Search results for "CSA"

showing 10 items of 50 documents

Moricsalā fiksētas Amanita eliae zīmējums

1930

Watercolor by Ferdinand Erdman Stolla (1874 – 1966) of the rarely found in Latvia Amanita eliae. The mushroom was found in a small meadow under an oak tree. A drawing from F. E. Štoll's collection of mushroom pictures, which is kept in the Botany and Mycology collections of Museum of the University of Latvia.

:NATURAL SCIENCES::Biology [Research Subject Categories]MorizinselEijas mušmireMoricsalaIsabellfarbener Wulstlingmycology
researchProduct

Moricsalas vēsturiskā izkārtne

2022

Atzīmējot Moricsalas dabas rezervāta dibināšanas 110 gadadienu, Latvijas Universitātes Muzejs par mēneša priekšmetu izvēlējās rezervāta vēsturisko izkārtni. Rakstā sniegta informācija par rezervāta tapšanu un muzeja krājuma priekšmetiem, kas ir rezervāta pastāvēšanas pirmajām desmitgadēm.

:NATURAL SCIENCES::Biology [Research Subject Categories]Nature ProtectionKarl Reinhold Kupfferdabas aizsardzībaLatvijas Universitātes MuzejsMoricsalas dabas rezervāts:HUMANITIES and RELIGION::History and philosophy subjects::History subjects::History [Research Subject Categories]the Museum of the University of LatviaRīgas Dabaspētnieku biedrībaMoritz IslandNaturforscher-Verein zu Riga
researchProduct

Geodetic and geological evidence of active tectonics in south-western Sicily (Italy)

2014

Abstract Integrated geological, geodetic and marine geophysical data provide evidence of active deformation in south-western Sicily, in an area spatially coincident with the macroseismic zone of the destructive 1968 Belice earthquake sequence. Even though the sequence represents the strongest seismic event recorded in Western Sicily in historical times, focal solutions provided by different authors are inconclusive on possible faulting mechanism, which ranges from thrusting to transpression, and the seismogenic source is still undefined. Interferometric (DInSAR) observations reveal a differential ground motion on a SW–NE alignment between Campobello di Mazara and Castelvetrano (CCA), locate…

Active tectonicsPleistoceneSettore GEO/02 - Geologia Stratigrafica E SedimentologicaSettore GEO/03 - Geologia StrutturaleGeodetic datumSicilian fold and thrust belt; Geodesy; Active tectonicsaActive faultTranspressionTectonicsSequence (geology)GeophysicsSeismic hazardThrust faultActive tectonicsaGeologySeismologySicilian fold and thrust beltGeodesyEarth-Surface ProcessesSicilian fold and thrust belt; Geodesy; Active tectonics
researchProduct

Kinetic modeling of ion conduction in KcsA potassium channel.

2005

KcsA constitutes a potassium channel of known structure that shows both high conduction rates and selectivity among monovalent cations. A kinetic model for ion conduction through this channel that assumes rapid ion transport within the filter has recently been presented by Nelson. In a recent, brief communication, we used the model to provide preliminary explanations to the experimental current-voltage J-V and conductance-concentration g-S curves obtained for a series of monovalent ions (K(+),Tl(+), and Rb(+)). We did not assume rapid ion transport in the calculations, since ion transport within the selectivity filter could be rate limiting for ions other than native K(+). This previous wor…

ChemistrySodiumPositive IonsIonic ConductivityAnalytical chemistryKcsA potassium channelUNESCO::FÍSICAGeneral Physics and AstronomyConductanceIon-associationRubidiumIonReaction rate constant:FÍSICA [UNESCO]Biomembrane TransportPotassium ; Thallium ; Rubidium ; Sodium ; Positive Ions ; Ionic Conductivity ; Biomembrane TransportPotassiumIonic conductivityPhysical and Theoretical ChemistryThalliumIon transporterIon channelThe Journal of chemical physics
researchProduct

Nonlocal Quantum XOR Games for Large Number of Players

2010

Nonlocal games are used to display differences between classical and quantum world In this paper, we study nonlocal games with a large number of players We give simple methods for calculating the classical and the quantum values for symmetric XOR games with one-bit input per player, a subclass of nonlocal games We illustrate those methods on the example of the N-player game (due to Ardehali [Ard92]) that provides the maximum quantum-over-classical advantage.

CombinatoricsAlgebraComputer Science::Computer Science and Game TheoryQuantum pseudo-telepathySimple (abstract algebra)TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSComputingMilieux_PERSONALCOMPUTINGTheoryofComputation_GENERALQuantum worldQuantumMathematics
researchProduct

Equivalence closure in the two-variable guarded fragment

2015

We consider the satisfiability and finite satisfiability problems for the extension of the two-variable guarded fragment in which an equivalence closure operator can be applied to two distinguished binary predicates. We show that the satisfiability and finite satisfiability problems for this logic are 2-ExpTime-complete. This contrasts with an earlier result that the corresponding problems for the full two-variable logic with equivalence closures of two binary predicates are 2-NExpTime-complete.

Computational complexity theoryLogiccomputational complexityguarded fragmentsatisfiability problemBinary numberTheoretical Computer ScienceCombinatoricsArts and Humanities (miscellaneous)Computer Science::Logic in Computer ScienceClosure operatorEquivalence (formal languages)MathematicsDiscrete mathematicssatisfiability problemcomputational complexitydecidabilityequivalence closureSatisfiabilityDecidabilityTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESClosure (computer programming)Hardware and ArchitectureTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSBoolean satisfiability problemSoftwareJournal of Logic and Computation
researchProduct

Transformations that preserve learnability

1996

We consider transformations (performed by general recursive operators) mapping recursive functions into recursive functions. These transformations can be considered as mapping sets of recursive functions into sets of recursive functions. A transformation is said to be preserving the identification type I, if the transformation always maps I-identifiable sets into I-identifiable sets.

Computer scienceLearnabilityType (model theory)Inductive reasoningAlgebraTuring machinesymbols.namesakeIdentification (information)TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESTransformation (function)TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSRecursive functionssymbolsInitial segment
researchProduct

2018

This study investigated participants’ conceptions of the ideal mentor and mentee in the Finnish model of peer-group mentoring (PGM). Existing mentoring research emphasises dyadic practices, yet the...

Cooperative learningIdeal (set theory)ComputingMilieux_THECOMPUTINGPROFESSION05 social sciences050301 educationPeer groupPeer relationshipsEducationComputingMilieux_GENERALTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSComputingMilieux_COMPUTERSANDEDUCATIONMathematics education0501 psychology and cognitive sciencesBig Five personality traitsPsychology0503 education050104 developmental & child psychologyScandinavian Journal of Educational Research
researchProduct

Minimal forbidden words and symbolic dynamics

1996

We introduce a new complexity measure of a factorial formal language L: the growth rate of the set of minimal forbidden words. We prove some combinatorial properties of minimal forbidden words. As main result we prove that the growth rate of the set of minimal forbidden words for L is a topological invariant of the dynamical system defined by L.

Discrete mathematicsFactorial010102 general mathematics[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Symbolic dynamicsComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]0102 computer and information sciencesInvariant (physics)16. Peace & justice01 natural sciencesCombinatorics010201 computation theory & mathematicsTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSInformation complexityFormal language0101 mathematicsComputer Science::Formal Languages and Automata TheoryComputingMilieux_MISCELLANEOUSMathematicsofComputing_DISCRETEMATHEMATICSMathematics
researchProduct

Collection Principles in Dependent Type Theory

2002

We introduce logic-enriched intuitionistic type theories, that extend intuitionistic dependent type theories with primitive judgements to express logic. By adding type theoretic rules that correspond to the collection axiom schemes of the constructive set theory CZF we obtain a generalisation of the type theoretic interpretation of CZF. Suitable logic-enriched type theories allow also the study of reinterpretations of logic. We end the paper with an application to the double-negation interpretation.

Discrete mathematicsInterpretation (logic)Dependent type theory constructive set theory propositions-as-typesComputer scienceConstructive set theoryIntuitionistic logicIntuitionistic type theoryDependent typeAlgebraMathematics::LogicTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESDependent type theoryType theoryTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSComputer Science::Logic in Computer ScienceDouble negationSet theoryRule of inferenceAxiom
researchProduct