@misc{4276, author = {Barton, Nicholas H}, booktitle = {Genetics Research}, issn = {0016-6723}, number = {3}, pages = {371 -- 373}, publisher = {Cambridge University Press}, title = {{Population genetics of multiple loci}}, doi = {10.1017/S0016672300239220}, volume = {75}, year = {2000}, } @inproceedings{4433, abstract = {Bisimulations enjoy numerous applications in the analysis of labeled transition systems. Many of these applications are based on two central observations: first, bisimilar systems satisfy the same branching-time properties; second, bisimilarity can be checked efficiently for finite-state systems. The local character of bisimulation, however, makes it difficult to address liveness concerns. Indeed, the definitions of fair bisimulation that have been proposed in the literature sacrifice locality, and with it, also efficient checkability. We put forward a new definition of fair bisimulation which does not suffer from this drawback. The bisimilarity of two systems can be viewed in terms of a game played between a protagonist and an adversary. In each step of the infinite bisimulation game, the adversary chooses one system, makes a move, and the protagonist matches it with a move of the other system. Consistent with this game-based view, we call two fair transition systems bisimilar if in the bisimulation game, the infinite path produced in the first system is fair iff the infinite path produced in the second system is fair. We show that this notion of fair bisimulation enjoys the following properties. First, fairly bisimilar systems satisfy the same formulas of the logics Fair-AFMC (the fair alternation-free μ-calculus) and Fair-CTL*. Therefore, fair bisimulations can serve as property-preserving abstractions for these logics and weaker ones, such as Fair-CTL and LTL. Indeed, Fair-AFMC provides an exact logical characterization of fair bisimilarity. Second, it can be checked in time polynomial in the number of states if two systems are fairly bisimilar. This is in stark contrast to all trace-based equivalences, which are traditionally used for addressing liveness but require exponential time for checking.}, author = {Henzinger, Thomas A and Rajamani, Sriram}, booktitle = {Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems}, isbn = {9783540672821}, location = {Berlin, Germany}, pages = {299 -- 314}, publisher = {Springer}, title = {{Fair bisimulation}}, doi = {10.1007/3-540-46419-0_21}, volume = {1785}, year = {2000}, } @inproceedings{4434, abstract = {The algorithmic approach to the analysis of timed and hybrid systems is fundamentally limited by undecidability, of universality in the timed case (where all continuous variables are clocks), and of emptiness in the rectangular case (which includes drifting clocks). Traditional proofs of undecidability encode a single Turing computation by a single timed trajectory. These proofs have nurtured the hope that the introduction of “fuzziness” into timed and hybrid models (in the sense that a system cannot distinguish between trajectories that are sufficiently similar) may lead to decidability. We show that this is not the case, by sharpening both fundamental undecidability results. Besides the obvious blow our results deal to the algorithmic method, they also prove that the standard model of timed and hybrid systems, while not “robust” in its definition of trajectory acceptance (which is affected by tiny perturbations in the timing of events), is quite robust in its mathematical properties: the undecidability barriers are not affected by reasonable perturbations of the model.}, author = {Henzinger, Thomas A and Raskin, Jean}, booktitle = {Proceedings of the 3rd International Workshop on Hybrid Systems}, isbn = {9783540672593}, location = {Pittsburgh, PA, USA}, pages = {145 -- 159}, publisher = {Springer}, title = {{Robust undecidability of timed and hybrid systems}}, doi = {10.1007/3-540-46430-1_15}, volume = {1790}, year = {2000}, } @inproceedings{4435, abstract = {An important case of hybrid systems are the rectangular automata. First, rectangular dynamics can naturally and arbitrarily closely approximate more general, nonlinear dynamics. Second, rectangular automata are the most general type of hybrid systems for which model checking -in particular, Ltl model checking- is decidable. However, on one hand, the original proofs of decidability did not suggest practical algorithms and, on the other hand, practical symbolic model-checking procedures -such as those implemented in HyTech- were not known to terminate on rectangular automata. We remedy this unsatisfactory situation: we present a symbolic method for Ltl model checking which can be performed by HyTech and is guaranteed to terminate on all rectangular automata. We do so by proving that our method for symbolic Ltl model checking terminates on an infinite-state transition system if the trace-equivalence relation of the system has finite index, which is the case for all rectangular automata.}, author = {Henzinger, Thomas A and Majumdar, Ritankar}, booktitle = {Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems}, isbn = {9783540672821}, location = {Berlin, Germany}, pages = {142 -- 156}, publisher = {Springer}, title = {{Symbolic model checking for rectangular hybrid systems}}, doi = {10.1007/3-540-46419-0_11}, volume = {1785}, year = {2000}, } @inproceedings{4439, abstract = {We define five increasingly comprehensive classes of infinite-state systems, called STS1–5, whose state spaces have finitary structure. For four of these classes, we provide examples from hybrid systems. STS1 These are the systems with finite bisimilarity quotients. They can be analyzed symbolically by (1) iterating the predecessor and boolean operations starting from a finite set of observable state sets, and (2) terminating when no new state sets are generated. This enables model checking of the μ-calculus. STS2 These are the systems with finite similarity quotients. They can be analyzed symbolically by iterating the predecessor and positive boolean operations. This enables model checking of the existential and universal fragments of the μ-calculus. STS3 These are the systems with finite trace-equivalence quotients. They can be analyzed symbolically by iterating the predecessor operation and a restricted form of positive boolean operations (intersection is restricted to intersection with observables). This enables model checking of linear temporal logic. STS4 These are the systems with finite distance-equivalence quotients (two states are equivalent if for every distance d, the same observables can be reached in d transitions). The systems in this class can be analyzed symbolically by iterating the predecessor operation and terminating when no new state sets are generated. This enables model checking of the existential conjunction-free and universal disjunction-free fragments of the μ-calculus. STS5 These are the systems with finite bounded-reachability quotients (two states are equivalent if for every distance d, the same observables can be reached in d or fewer transitions). The systems in this class can be analyzed symbolically by iterating the predecessor operation and terminating when no new states are encountered. This enables model checking of reachability properties.}, author = {Henzinger, Thomas A and Majumdar, Ritankar}, booktitle = {Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science}, isbn = {9783540671411}, location = {Lille, France}, pages = {13 -- 34}, publisher = {Springer}, title = {{A classification of symbolic transition systems}}, doi = {10.1007/3-540-46541-3_2}, volume = {1770}, year = {2000}, } @inproceedings{4481, abstract = {Since hybrid embedded systems are pervasive and often safety-critical, guarantees about their correct performance are desirable. The hybrid systems model checker HyTech provides such guarantees and has successfully verified some systems. However, HyTech severely restricts the continuous dynamics of the system being analyzed and, therefore, often forces the use of prohibitively expensive discrete and polyhedral abstractions. We have designed a new algorithm, which is capable of directly verifying hybrid systems with general continuous dynamics, such as linear and nonlinear differential equations. The new algorithm conservatively overapproximates the reachable states of a hybrid automaton by using interval numerical methods. Interval numerical methods return sets of points that enclose the true result of numerical computation and, thus, avoid distortions due to the accumulation of round-off errors. We have implemented the new algorithm in a successor tool to HyTech called HyperTech. We consider three examples: a thermostat with delay, a two-tank water system, and an air-traffic collision avoidance protocol. HyperTech enables the direct, fully automatic analysis of these systems, which is also more accurate than the use of polyhedral abstractions.}, author = {Henzinger, Thomas A and Horowitz, Benjamin and Majumdar, Ritankar and Wong Toi, Howard}, booktitle = {Proceedings of the 3rd International Workshop on Hybrid Systems}, isbn = {9783540672593}, location = {Pittsburgh, PA, USA}, pages = {130 -- 144}, publisher = {Springer}, title = {{Beyond HyTech: Hybrid systems analysis using interval numerical methods}}, doi = {10.1007/3-540-46430-1_14}, volume = {1790}, year = {2000}, } @inproceedings{4482, abstract = {We apply the theory of abstract interpretation to the verification of game properties for reactive systems. Unlike properties expressed in standard temporal logics, game properties can distinguish adversarial from collaborative relationships between the processes of a concurrent program, or the components of a parallel system. We consider two-player concurrent games –say, component vs. environment– and specify properties of such games –say, the component has a winning strategy to obtain a resource, no matter how the environment behaves– in the alternating-time μ-calculus (Aμ ). A sound abstraction of such a game must at the same time restrict the behaviors of the component and increase the behaviors of the environment: if a less powerful component can win against a more powerful environment, then surely the original component can win against the original environment. We formalize the concrete semantics of a concurrent game in terms of controllable and uncontrollable predecessor predicates, which suffice for model checking all Aμ properties by applying boolean operations and iteration. We then define the abstract semantics of a concurrent game in terms of abstractions for the controllable and uncontrollable predecessor predicates. This allows us to give general characterizations for the soundness and completeness of abstract games with respect to Aμ properties. We also present a simple programming language for multi-process programs, and show how approximations of the maximal abstraction (w.r.t. Aμ properties) can be obtained from the program text. We apply the theory to two practical verification examples, a communication protocol developed at the Berkeley Wireless Research Center, and a protocol converter. In the wireless protocol, both the use of a game property for specification and the use of abstraction for automatic verification were instrumental to uncover a subtle bug.}, author = {Henzinger, Thomas A and Majumdar, Ritankar and Mang, Freddy and Raskin, Jean}, booktitle = {Proceedings of the 7th International Symposium on Static Analysis}, isbn = {9783540676683}, location = {Santa Barbara, CA, USA}, pages = {220 -- 239}, publisher = {Springer}, title = {{Abstract interpretation of game properties}}, doi = {10.1007/978-3-540-45099-3_12}, volume = {1824}, year = {2000}, } @inproceedings{4483, abstract = {Model-checking algorithms can be used to verify, formally and automatically, if a low-level description of a design conforms with a high-level description. However, for designs with very large state spaces, prior to the application of an algorithm, the refinement-checking task needs to be decomposed into subtasks of manageable complexity. It is natural to decompose the task following the component structure of the design. However, an individual component often does not satisfy its requirements unless the component is put into the right context, which constrains the inputs to the component. Thus, in order to verify each component individually, we need to make assumptions about its inputs, which are provided by the other components of the design. This reasoning is circular: component A is verified under the assumption that context B behaves correctly, and symmetrically, B is verified assuming the correctness of A. The assume-guarantee paradigm provides a systematic theory and methodology for ensuring the soundness of the circular style of postulating and discharging assumptions in component-based reasoning.We give a tutorial introduction to the assume-guarantee paradigm for decomposing refinement-checking tasks. To illustrate the method, we step in detail through the formal verification of a processor pipeline against an instruction set architecture. In this example, the verification of a three-stage pipeline is broken up into three subtasks, one for each stage of the pipeline.}, author = {Henzinger, Thomas A and Qadeer, Shaz and Rajamani, Sriram}, booktitle = {Proceedings of the 2000 International Conference on Computer-Aided Design}, isbn = {0780364457}, location = {San Jose, CA, USA}, pages = {245 -- 252}, publisher = {IEEE}, title = {{Decomposing refinement proofs using assume-guarantee reasoning}}, doi = {10.1109/ICCAD.2000.896481}, year = {2000}, } @inproceedings{4512, abstract = {Masaccio is a formal model for hybrid dynamical systems which are built from atomic discrete components (difference equations) and atomic continuous components (differential equations) by parallel and serial composition, arbitrarily nested. Each system component consists of an interface, which determines the possible ways of using the component, and a set of executions, which define the possible behaviors of the component in real time. Version 1.0 (May 2000). }, author = {Henzinger, Thomas A}, booktitle = {Proceedings of the 1st International Conference on Theoretical Computer Science }, isbn = {9783540678236}, location = {Sendai, Japan}, pages = {549 -- 563}, publisher = {Springer}, title = {{Masaccio: A formal model for embedded components}}, doi = {10.1007/3-540-44929-9_38}, volume = {1872}, year = {2000}, } @inbook{4513, abstract = {A hybrid automaton is a formal model for a mixed discrete-continuous system. We classify hybrid automata according to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discrete-continuous state spaces that was previously studied on purely discrete state spaces only. In particular, various classes of hybrid automata induce finitary trace equivalence (or similarity, or bisimilarity) relations on an uncountable state space, thus permitting the application of various model-checking techniques that were originally developed for finitestate systems. }, author = {Henzinger, Thomas A}, booktitle = {Verification of Digital and Hybrid Systems}, editor = {Inan, M. and Kurshan, Robert}, isbn = {9783642596155}, pages = {265 -- 292}, publisher = {Springer}, title = {{The theory of hybrid automata}}, doi = {10.1007/978-3-642-59615-5}, volume = {170}, year = {2000}, } @article{2591, abstract = {The occurrence and distribution of the preferred receptor for the neuropeptide, substance P (SP), the neurokinin-1 receptor (NK1R) was investigated in the vascular supply of the rat sciatic nerve. Messenger RNA for NK1R was demonstrated by RT-PCR in the epineurial layer where the majority of small arteries and arterioles feeding the endoneurial vasculature are located. Immunoreactivity to NK1R-protein was localized on the smooth muscle cells of these arterial vessels by means of immunofluorescence using a polyclonal NK1R antiserum. This muscular localization of NK1R explains the previously reported [Zochodne, D.W. and Ho, L.T., J. Physiol. 444 (1991) 615- 630] moderate vasoconstrictor rather than vasodilator effects of SP in this vascular bed.}, author = {Kummer, Wolfgang and Shigemoto, Ryuichi and Haberberger, Rainer}, issn = {0304-3940}, journal = {Neuroscience Letters}, number = {2}, pages = {119 -- 122}, publisher = {Elsevier}, title = {{Smooth muscle cells are the site of neurokinin-1 receptor localization in the arterial supply of the rat sciatic nerve}}, doi = {10.1016/S0304-3940(98)00926-4}, volume = {259}, year = {1999}, } @article{2592, abstract = {Metabotropic glutamate receptors (mGluRs) consist of eight different subtypes and exert their effects or second messengers and ion channels via G- proteins. The function of individual mGluR subtypes in the CNS, however, largely remains to be clarified. We examined the fear response of freezing after electric shock in wild-type and mGluR7(-/-) knockout littermates. Wild- type mice displayed freezing immediately after and 1 d after footshock. In comparison, mGluR7(-/-) knockout mice showed significantly reduced levels in both immediate postshock and delayed freezing responses. However, the knockout mice exhibited no abnormalities in pain sensitivity and locomotor activity. To further examine amygdala-dependent behavior, we performed conditioned taste aversion (CTA) experiments. In wild-type mice, the administration of saccharin followed by intraperitoneal injection of the malaise-inducing agent LiCl resulted in an association between saccharin and LiCl. This association caused strong CTA toward saccharin n contrast, mGluR7(-/-) knockout mice failed to associate between the taste and the negative reinforcer in CTA experiments. Again, the knockout mice showed no abnormalities in taste preference and in the sensitivity to LiCl toxicity. These results indicate that mGluR7 deficiency causes an impairment of two distinct amygdala-dependent behavioral paradigms. Immunohistochemical and immunoelectron-microscopic analyses showed that mGluR7 is highly expressed in amygdala and preferentially localized at the presynaptic axon terminals of glutamatergic neurons. Together, these findings strongly suggest that mGluR7 is involved in neural processes subserving amygdala-dependent averse responses.}, author = {Masugi, Miwako and Yokoi, Mineto and Shigemoto, Ryuichi and Muguruma, Keiko and Watanabe, Yasuyoshi and Sansig, Gilles and Van Der Putten, Herman and Nakanishi, Shigetada}, issn = {0270-6474}, journal = {Journal of Neuroscience}, number = {3}, pages = {955 -- 963}, publisher = {Society for Neuroscience}, title = {{Metabotropic glutamate receptor subtype 7 ablation causes deficit in fear response and conditioned taste aversion}}, doi = {10.1523/JNEUROSCI.19-03-00955.1999}, volume = {19}, year = {1999}, } @article{2593, abstract = {In cat and monkey, lamina I cells can be classified into three basic morphological types (fusiform, pyramidal, and multipolar), and recent intracellular labeling evidence in the cat indicates that fusiform and multipolar lamina I cells are two different types of nociceptive cells, whereas pyramidal cells are innocuous thermoreceptive-specific. Because earlier observations indicated that only nociceptive dorsal horn neurons respond to substance P (SP), we examined which morphological types of lamina I neurons express receptors for SP (NK-1r). We categorized NK-1r- immunoreactive (IR) lamina I neurons in serial horizontal sections from the cervical and lumbar enlargements of four monkeys. Consistent results were obtained by two independent teams of observers. Nearly all NK-1r-IR cells were fusiform (42%) or multipolar (43%), but only 6% were pyramidal (with 9% unclassified). We obtained similar findings in three monkeys in which we used double-labeling immunocytochemistry to identify NK-1r-IR and spinothalamic lamina I neurons retrogradely labeled with cholera toxin subunit b from the thalamus; most NK-1r-IR lamina I spinothalamic neurons were fusiform (48%) or multipolar (33%), and only 10% were pyramidal. In contrast, most (~75%) pyramidal and some (~25%) fusiform and multipolar lamina I spinothalamic neurons did not display NK-1r immunoreactivity. These data indicate that most fusiform and multipolar lamina I neurons in the monkey can express NK-1r, consistent with the idea that both types are nociceptive, whereas only a small proportion of lamina I pyramidal cells express this receptor, consistent with the previous finding that they are nonnociceptive. However, these findings also indicate that not all nociceptive lamina I neurons express receptors for SP.}, author = {Yu, Xiao and Zhang, En and Craig, Arthur and Shigemoto, Ryuichi and Ribeiro Da Silva, Alfredo and De Koninck, Yves}, issn = {0270-6474}, journal = {Journal of Neuroscience}, number = {9}, pages = {3545 -- 3555}, publisher = {Society for Neuroscience}, title = {{NK-1 receptor immunoreactivity in distinct morphological types of lamina I neurons of the primate spinal cord}}, doi = {10.1523/JNEUROSCI.19-09-03545.1999}, volume = {19}, year = {1999}, } @article{2594, abstract = {Substance P receptor (i.e. NK1)-like immunoreactive (SPR-LI) neurons were observed in the newborn and adult human spinal cord. Substance P receptor-like immunoreactive neuronal cell bodies were seen most frequently in lamina I, and were scattered throughout the remaining laminae of the dorsal horn and the area around the central canal. Some neurons in the intermediolateral nucleus also showed weak immunoreactivity. The pattern of distribution of SPR-LI neurons in the adult spinal cord was essentially the same as that in the newborn spinal cord. However, SPR-LI neurons cell bodies were seen much more frequently in the newborn than in the adult dorsal horn, especially in lamina II.}, author = {Ding, Yu and Zheng, Heng and Wang, Dian and Xu, Jun and Gong, Liang and Lü, Yan and Qin, Bing and Shi, Juan and Li, Hua and Li, Ji and Shigemoto, Ryuichi and Kaneko, Takeshi and Mizuno, Noboru}, issn = {0304-3940}, journal = {Neuroscience Letters}, number = {2}, pages = {133 -- 136}, publisher = {Elsevier}, title = {{The distribution of substance P receptor (NK1)-like immunoreactive neurons in the newborn and adult human spinal cord}}, doi = {10.1016/S0304-3940(99)00283-9}, volume = {266}, year = {1999}, } @article{2595, abstract = {Presynaptic metabotropic glutamate receptors (mGluRs) of group III constitute possible targets for putative neuroprotective drugs acting against glutamate excitotoxic insults. Indeed, in glutamatergic cerebellar granule neurones in culture, high concentrations of L-2-amino-4-phosphonobutyrate (L-AP4, above 0.3 mM, thus activating mGluR7) inhibit NMDA-induced cell death. In contrast, in striatal cultures which are enriched in GABAergic neurones, we show that high concentrations of L-AP4 increased neuronal death in control as well as in NMDA-stimulated cultures. Moreover, similar results were obtained with the GABA(B)R agonist, baclofen. Both the neuroprotective effects in cerebellar granule cells and the neurotoxic effects in striatal neurones were mediated via Gi-Go-coupled mGluRs, suggesting that these effects were probably mediated by mGluR7a or b and GABA(B)R expressed in these neurones. In striatal neurones, we found that L-AP4 and baclofen inhibited both basal and NMDA-stimulated GABA release. These inhibitions of GABA release may be responsible for the increase in basal and NMDA-stimulated neuronal death. Indeed, blockade of GABA(A) receptors with bicuculline increased neuronal death of control and NMDA-treated striatal cultures. Taken together, these results suggest that L-AP4 and baclofen, via mGluR7 and GABA(B)R, reduced the neuroprotective effect of GABA present in striatal cultures acting via GABA(A) receptors. Although caution must be taken when extrapolating from in vitro to in vivo situations, the present experiments and the recent observations that mGluR7 and GABA(B)R are expressed in heterologous synapses, should be taken into consideration when evaluating the neuroprotective action of future mGluR7 specific agonists or GABA(B)R specific antagonists.}, author = {Lafon Cazal, Mireille and Viennois, Gaëlle and Kühn, Rainer and Malitschek, Barbara and Pin, Jean and Shigemoto, Ryuichi and Bockaërt, Joël}, issn = {0028-3908}, journal = {Neuropharmacology}, number = {10}, pages = {1631 -- 1640}, publisher = {Elsevier}, title = {{mGluR7-like receptor and GABA(B) receptor activation enhance neurotoxic effects of N-methyl-D-aspartate in cultured mouse striatal GABAergic neurones}}, doi = {10.1016/S0028-3908(99)00124-0}, volume = {38}, year = {1999}, } @article{2596, abstract = {A γ-aminobutyric acid (GABA)(B) receptor (named GABA(B)R1) has been recently cloned in the rat and human brain and two variants generated by alternative RNA splicing were identified. In the present study, we addressed the question as to whether these variants contribute to the diversity of GABA(B) receptor-mediated physiological responses and constitute real receptor subtypes with distinct functions. To this aim, we have mapped the GABA(B)R1 (R1a) and GABA(B)R1b (R1b) transcript distribution in the rat brain using in situ hybridization. We have compared the mRNA distribution with the distribution of [ 3H]CGP54626-labeled binding GABA(B)R1 receptor sites as assessed in adjacent cryosections by quantitative autoradiography. We found that GABA(B) receptor transcripts and binding sites are expressed in the brain in almost all neuronal cell populations. Expression in glial cells, if any, is marginal. We observed a good parallelism between GABA(B)R1 mRNA transcripts and binding sites in broad neuroanatomical entities with highest densities in hippocampus, thalamic nuclei, and cerebellum. By contrast, R1a and R1b transcripts exhibit marked differences in their regional and cellular distribution pattern. A typical example is the cerebellum with an almost exclusive expression of R1b in the Purkinje cells and of R1a in the granule, stellate, and basket cells. Data pointing at a pre- versus postsynaptic localization for R1a and R1b, respectively, at some neuronal sites are presented. }, author = {Bischoff, Serge and Leonhard, Sabine and Reymann, Nicole and Schuler, Valérie and Shigemoto, Ryuichi and Kaupmann, Klemens and Bettler, Bernhard}, issn = {0021-9967}, journal = {Journal of Comparative Neurology}, number = {1}, pages = {1 -- 16}, publisher = {Wiley-Blackwell}, title = {{Spatial distribution of GABA(B)R1 receptor mRNA and binding sites in the rat brain^}}, doi = {10.1002/(SICI)1096-9861(19990913)412:1<1::AID-CNE1>3.0.CO;2-D}, volume = {412}, year = {1999}, } @article{2597, abstract = {Metabotropic glutamate receptors (mGlus) are known to modulate synaptic transmission in various pathways of the central nervous system, but the exact mechanisms by which this modulation occurs remain unclear. Here we utilise electrophysiological and immunocytochemical techniques on cultured autaptic hippocampal neurones to investigate the mechanism of action and distribution of mGlus. Agonists at all three groups of mGlus depressed glutamatergic transmission, whereas only agonists at group I mGlus depressed GABAergic transmission. Agonists at all mGlus failed to modulate Ca2+ and K+ channels in glutamatergic autapses whereas an agonist at group III mGlus did depress the frequency of miniature excitatory postsynaptic currents (mEPSCs). Agonists failed to modulate Ca2+ or K+ channels and miniature inhibitory postsynaptic currents (mIPSCs) in GABAergic autapses. Distribution studies using selective antibodies revealed punctate staining for group III mGlus that co-localised with the synaptic marker, synaptophysin. Staining for the remaining mGlus was more diffuse throughout the soma and processes with little co-localisation with synaptophysin. The distribution of the group III receptors is consistent with the direct 'downstream' modulation of mEPSCs, although the exact mechanism of action for the remaining receptors remains unclear.}, author = {Bushell, Trevor and Lee, Chong and Shigemoto, Ryuichi and Miller, Richard}, issn = {0028-3908}, journal = {Neuropharmacology}, number = {10}, pages = {1553 -- 1567}, publisher = {Elsevier}, title = {{Modulation of synaptic transmission and differential localisation of mGlus in cultured hippocampal autapses}}, doi = {10.1016/S0028-3908(99)00103-3}, volume = {38}, year = {1999}, } @inproceedings{2711, abstract = {We study the long time evolution of a quantum particle in a Gaussian random environment. We show that in the weak coupling limit the Wigner distribution of the wave function converges to the solution of a linear Boltzmann equation globally in time. The Boltzmann collision kernel is given by the Born approximation of the quantum scattering cross section.}, author = {Erdös, László}, booktitle = {Proceedings of the 7th QMath Conference}, isbn = {9783034897549}, location = {Prague, Czech Republik}, pages = {233 -- 242}, publisher = {World Scientific Publishing}, title = {{Linear Boltzmann equation as the weak coupling limit of the random Schrödinger equation}}, doi = {10.1007/978-3-0348-8745-8_20}, volume = {108}, year = {1999}, } @article{2730, abstract = {We give the leading order semiclassical asymptotics for the sum of the negative eigenvalues of the Pauli operator (in dimension two and three) with a strong non-homogeneous magnetic field. This result can be used to prove that the magnetic Thomas-Fermi theory gives the leading order ground state energy of large atoms. We develop a new localization scheme well suited to the anisotropic character of the strong magnetic field. We also use the basic Lieb-Thirring estimate obtained earlier (1996). (orig.) 19 refs.}, author = {Erdös, László and Solovej, Jan}, issn = {0012-7094}, journal = {Duke Mathematical Journal}, number = {1}, pages = {127 -- 173}, publisher = {Duke University Press}, title = {{Semiclassical eigenvalue estimates for the Pauli operator with strong nonhomogeneous magnetic fields, I: Nonasymptotic Lieb-Thirring-type estimate}}, doi = {10.1215/S0012-7094-99-09604-7}, volume = {96}, year = {1999}, } @article{2783, abstract = {Pattern formation in a layer of fluid heated from below is an example of macroscopic ordering in continuous media. Here we show that in a relatively compact experimental version of the problem, a rich and diverse set of stable flows can be found. These flows, many of which are novel, can be categorized and understood in terms of their symmetry properties. This approach shows promise for providing insight into the more complicated fluid motion that occurs as the lateral dimension of the layer is increased.}, author = {Hof, Björn and Lucas, Peter and Mullin, Tom}, issn = {0031-9171}, journal = {Physics of Fluids}, number = {10}, pages = {2815 -- 2817}, publisher = {American Institute of Physics}, title = {{Flow state multiplicity in convection}}, doi = {10.1063/1.870178 }, volume = {11}, year = {1999}, }