Scopolamine reduces the density of M1 muscarinic neurons in rats' hippocampus

Cholinergic system in CNS is involved in learning and memory. Scopolamine as muscarinic acetylcholine receptor antagonist is used for creation of memory impairment. The purpose of this study is evaluation of scopolamine-based amnesia on memory retention and the effect of this phenomenon on the number of neurons contains M1-receptors in the male Wistar rats hippocampal regions. Thirty-five male Wistar rats (200±20 g) were distributed randomly into five groups. Control group (intact samples) and 3 experimental groups with sham group (saline) were tested by the method of passive avoidance (shuttle box) in doses of 0.2, 0.5 and 1 mg/kg (intraperitoneally) as a single dose. After one week, memory test was taken from the rats. Finally, brains dissected from sacrificed rats, and then processed tissues were stained with antibody against M1 receptors (Immunohistochemistry technique) followed by counting of hippocampal CA1, CA3 and DG regions. Our results showed significant decrease in neurons contains M1-receptors in all area of hippocampus. We found that the less number of M1-neurons showed in 1 mg/kg dose of scopolamine. We concluded that scopolamine as muscarinic acetylcholine receptor antagonist can reduce dose-dependently the density of M1-neurons in all areas of hippocampus

Universal spectral statistics in Wigner-Dyson, chiral and Andreev star graphs II: semiclassical approach

A semiclassical approach to the universal ergodic spectral statistics in quantum star graphs is presented for all known ten symmetry classes of quantum systems. The approach is based on periodic orbit theory, the exact semiclassical trace formula for star graphs and on diagrammatic techniques. The appropriate spectral form factors are calculated upto one order beyond the diagonal and self-dual approximations. The results are in accordance with the corresponding random-matrix theories which supports a properly generalized Bohigas-Giannoni-Schmit conjecture.Comment: 15 Page

Structural operational semantics for Kernel Andorra Prolog

Kernel Andorra Prolog is a framework for nondeterministic concurrent constraint logic programming languages. Many languages, such as Prolog, GHC, Parlog, and Atomic Herbrand, can be seen as instances of this framework, by adding specific constraint systems and constraint operations, and optionally by imposing further restrictions on the language and the control of the computation model. We systematically revisit the description in Haridi and Jarison [HJ90], adding the formal machinery which is necessary in order to completely formalize the control of the computation model. To this we add a formal description of the transformational semantics of Kernel Andorra Prolog. The semantics of Kernel Andorra Prolog is a set of or-trees which also captures infinite computations

Surgical Antimicrobial Prophylaxis : Challenges in translating evidence to practice

N

Ageing and crystallization in a lattice glass model

We have studied a the 3-$d$ lattice glass of Pica Ciamarra, Tarzia, de Candia and Coniglio [Phys.\ Rev.\ E. 67, 057105 (2013)], which has been shown to reproduce several features of the structural glass phenomenology, such as the cage effect, exponential increase of relaxation times and ageing. We show, using short-time dynamics, that the metastability limit is above the estimated Kauzmann temperature. We also find that in the region where the metastable liquid exists the aging exponent is lower that 0.5, indicating that equilibrium is reached relatively quickly. We conclude that the usefulness of this model to study the deeply supercooled regime is rather limited.Comment: 7 pages, 9 figure

Exploiting the Synergy Between Gossiping and Structured Overlays

In this position paper we argue for exploiting the synergy between gossip-based algorithms and structured overlay networks (SON). These two strands of research have both aimed at building fault-tolerant, dynamic, self-managing, and large-scale distributed systems. Despite the common goals, the two areas have, however, been relatively isolated. We focus on three problem domains where there is an untapped potential of using gossiping combined with SONs. We argue for applying gossip-based membership for ring-based SONs---such as Chord and Bamboo---to make them handle partition mergers and loopy networks. We argue that small world SONs---such as Accordion and Mercury---are specifically well-suited for gossip-based membership management. The benefits would be better graph-theoretic properties. Finally, we argue that gossip-based algorithms could use the overlay constructed by SONs. For example, many unreliable broadcast algorithms for SONs could be augmented with anti-entropy protocols. Similarly, gossip-based aggregation could be used in SONs for network size estimation and load-balancing purposes