Search results for "LIST"
showing 10 items of 4869 documents
Beetles (Coleoptera) in the Tarnowskie Góry-Bytom Subterranean System
2017
Badania gatunków chrząszczy (Coleoptera), które przeprowadzono w jednym z największych sztucznych podziemnych systemów w Europie (Podziemia TarnogórskoBytomskie). W wyniku rocznych badań stwierdzono 3 gatunki chrząszczy: Choleva glauca, Pterostichus niger, Quedius mesomelinus. Ze względu na brak okazów w strefie przy wejściu należy założyć, że te populacje są odizolowane od pozostałych na powierzchni. Poszczególne gatunki występują tylko w określonych porach roku. Autorzy sugeruje, może to być początek troglobiontycznego trybu życia.
Older adult psychopathology: international comparisons of self-reports, collateral reports, and cross-informant agreement
2020
ABSTRACTObjectives:To conduct international comparisons of self-reports, collateral reports, and cross-informant agreement regarding older adult psychopathology.Participants:We compared self-ratings of problems (e.g. I cry a lot) and personal strengths (e.g. I like to help others) for 10,686 adults aged 60–102 years from 19 societies and collateral ratings for 7,065 of these adults from 12 societies.Measurements:Data were obtained via the Older Adult Self-Report (OASR) and the Older Adult Behavior Checklist (OABCL; Achenbach et al., 2004).Results:Cronbach’s alphas were .76 (OASR) and .80 (OABCL) averaged across societies. Across societies, 27 of the 30 problem items with the highest mean ra…
Emergent Collective Behaviors in a Multi-agent Reinforcement Learning Pedestrian Simulation: A Case Study
2015
In this work, a Multi-agent Reinforcement Learning framework is used to generate simulations of virtual pedestrians groups. The aim is to study the influence of two different learning approaches in the quality of generated simulations. The case of study consists on the simulation of the crossing of two groups of embodied virtual agents inside a narrow corridor. This scenario is a classic experiment inside the pedestrian modeling area, because a collective behavior, specifically the lanes formation, emerges with real pedestrians. The paper studies the influence of different learning algorithms, function approximation approaches, and knowledge transfer mechanisms on performance of learned ped…
Successful control of an outbreak of colonization by Klebsiella pneumoniae carbapenemase-producing K. pneumoniae sequence type 258 in a neonatal inte…
2013
This article reports an outbreak of colonization by Klebsiella pneumoniae carbapenemase-producing K. pneumoniae (KPC-Kp) sequence type (ST) 258 in a neonatal intensive care unit (NICU) in Palermo, Italy. KPC-Kp ST258 was detected by an active surveillance culture programme. Between 18th September and 14th November 2012, KPC-Kp was isolated from 10 out of 54 neonates admitted in the outbreak period. No cases of infection were recorded. Male sex was associated with colonization, whereas administration of ampicilline-sulbactam plus gentamicin was protective. Infection control interventions interrupted the spread of KPC-Kp without the need to close the NICU to new admissions. (C) 2013 The Healt…
Behavior of four main dairy pathogenic bacteria during manufacturing and ripening of pecorino siciliano cheese
2020
Background: Consumption of raw cheese may be associated with different diseases. This study aimed to evaluate behavior of four pathogenic bacteria during manufacture and ripening of Protected Designation of Origin (PDO) Pecorino Siciliano cheese.
 Methods: The experimental cheese groups were inoculated with pathogenic bacteria, including Escherichia coli O157, Listeria monocytogenes, Salmonella Enteritidis, and Staphylococcus aureus. The cheese making processes were monitored from milk curdling until 3 months ripened cheeses and the levels of Lactic Acid Bacteria (LAB) and the four dairy pathogens were evaluated by plate counts. Randomly Amplified Polymorphic DNA (RAPD)-Polymerase Chai…
Coma blisters. A key to neurological diagnosis
2020
Improved Constructions of Quantum Automata
2008
We present a simple construction of quantum automata which achieve an exponential advantage over classical finite automata. Our automata use $\frac{4}{\epsilon} \log 2p + O(1)$ states to recognize a language that requires p states classically. The construction is both substantially simpler and achieves a better constant in the front of logp than the previously known construction of [2]. Similarly to [2], our construction is by a probabilistic argument. We consider the possibility to derandomize it and present some preliminary results in this direction.
Running time to recognize nonregular languages by 2-way probabilistic automata
1991
R. Freivalds proved that the language {0m1m} can be recognized by 2-way probabilistic finite automata (2pfa) with arbitrarily high probability 1-ɛ. A.G.Greenberg and A.Weiss proved that no 2pfa can recognize this language in expected time \(T(n) = c^\circ{(n)}\). For arbitrary languages C.Dwork and L.Stockmeyer showed somewhat less: if a language L is recognized by a 2pfa in expected time \(T(n) = c^{n^\circ{(1)} }\), then L is regular. First, we improve this theorem replacing the expected time by the time with probability 1-ɛ. On the other hand, time bound by C.Dwork and L.Stockmeyer cannot be improved: for arbitrary k≥2 we exhibit a specific nonregular language that can be recognized by 2…
Iterated Conditionals and Characterization of P-Entailment
2021
In this paper we deepen, in the setting of coherence, some results obtained in recent papers on the notion of p-entailment of Adams and its relationship with conjoined and iterated conditionals. We recall that conjoined and iterated conditionals are suitably defined in the framework of conditional random quantities. Given a family \(\mathcal {F}\) of n conditional events \(\{E_{1}|H_{1},\ldots , E_{n}|H_{n}\}\) we denote by \(\mathcal {C}(\mathcal {F})=(E_{1}|H_{1})\wedge \cdots \wedge (E_{n}|H_{n})\) the conjunction of the conditional events in \(\mathcal F\). We introduce the iterated conditional \(\mathcal {C}(\mathcal {F}_{2})|\mathcal {C}(\mathcal {F}_{1})\), where \(\mathcal {F}_{1}\)…