TY - JOUR
AB - Ultracold atomic physics offers myriad possibilities to study strongly correlated many-body systems in lower dimensions. Typically, only ground-state phases are accessible. Using a tunable quantum gas of bosonic cesium atoms, we realized and controlled in one-dimensional geometry a highly excited quantum phase that is stabilized in the presence of attractive interactions by maintaining and strengthening quantum correlations across a confinement-induced resonance. We diagnosed the crossover from repulsive to attractive interactions in terms of the stiffness and energy of the system. Our results open up the experimental study of metastable, excited, many-body phases with strong correlations and their dynamical properties.
AU - Haller, Elmar
AU - Gustavsson, Mattias
AU - Mark, Manfred
AU - Danzl, Johann G
AU - Hart, Russell
AU - Pupillo, Guido
AU - Nägerl, Hanns
ID - 1040
IS - 5945
JF - Science
TI - Realization of an excited, strongly correlated quantum gas Phase
VL - 325
ER -
TY - JOUR
AB - We demonstrate efficient transfer of ultracold molecules into a deeply bound rovibrational level of the singlet ground state potential in the presence of an optical lattice. The overall molecule creation efficiency is 25%, and the transfer efficiency to the rovibrational level |v = 73, J = 2) is above 80%. We find that the molecules in |v = 73, J = 2) are trapped in the optical lattice, and that the lifetime in the lattice is limited by optical excitation by the lattice light. The molecule trapping time for a lattice depth of 15 atomic recoil energies is about 20 ms. We determine the trapping frequency by the lattice phase and amplitude modulation technique. It will now be possible to transfer the molecules to the rovibrational ground state |v = 0, J = 0) in the presence of the optical lattice.
AU - Danzl, Johann G
AU - Mark, Manfred
AU - Haller, Elmar
AU - Gustavsson, Mattias
AU - Hart, Russell
AU - Liem, Andreas
AU - Zellmer, Holger
AU - Nägerl, Hanns
ID - 1041
JF - New Journal of Physics
TI - Deeply bound ultracold molecules in an optical lattice
VL - 11
ER -
TY - JOUR
AB - One possibility for the creation of ultracold, high phase space density quantum gases of molecules in the rovibronic ground state relies on first associating weakly-bound molecules from quantum-degenerate atomic gases on a Feshbach resonance and then transferring the molecules via several steps of coherent two-photon stimulated Raman adiabatic passage (STIRAP) into the rovibronic ground state. Here, in ultracold samples of Cs2 Feshbach molecules produced out of ultracold samples of Cs atoms, we observe several optical transitions to deeply-bound rovibrational levels of the excited 0 u+ molecular potentials with high resolution. At least one of these transitions, although rather weak, allows efficient STIRAP transfer into the deeply-bound vibrational level v = 73> of the singlet X 1Σg+ ground state potential, as recently demonstrated (J. G. Danzl, E. Haller, M. Gustavsson, M. J. Mark, R. Hart, N. Bouloufa, O. Dulieu, H. Ritsch, and H.-C. Nägerl, Science, 2008, 321, 1062). From this level, the rovibrational ground state v = 0, J = 0> can be reached with one more transfer step. In total, our results show that coherent ground state transfer for Cs2 is possible using a maximum of two successive two-photon STIRAP processes or one single four-photon STIRAP process.
AU - Danzl, Johann G
AU - Mark, Manfred
AU - Haller, Elmar
AU - Gustavsson, Mattias
AU - Bouloufa, Nadia
AU - Dulieu, Olivier
AU - Ritsch, Helmut
AU - Hart, Russell
AU - Nägerl, Hanns
ID - 1043
JF - Faraday Discussions
TI - Precision molecular spectroscopy for ground state transfer of molecular quantum gases
VL - 142
ER -
TY - JOUR
AB - As part of an ongoing effort to develop a parameterization of wave-induced abyssal mixing, the authors derive an heuristic model for nonlinear wave breaking and energy dissipation associated with internal tides. Then the saturation and dissipation of internal tides for idealized and observed topography samples are investigated. One of the main results is that the wave-induced mixing could be more intense and more confined to the bottom than previously assumed in numerical models. Furthermore, in this model wave breaking and mixing clearly depend on the small scales of the topography below 10 km or so, which is below the current resolution of global bathymetry. This motivates the use of a statistical approach to represent the unresolved topography when addressing the role of internal tides in mixing the deep ocean.
AU - MULLER, Caroline J
AU - Bühler, Oliver
ID - 9147
IS - 9
JF - Journal of Physical Oceanography
KW - Oceanography
SN - 1520-0485
TI - Saturation of the internal tides and induced mixing in the abyssal ocean
VL - 39
ER -
TY - JOUR
AB - Several observational studies have shown a tight relationship between tropical precipitation and column‐integrated water vapor. We show that the observed relationship in the tropics between column‐integrated water vapor, precipitation, and its variance can be qualitatively reproduced by a simple and physically motivated two‐layer model. It has previously been argued that features of this relationship could be explained by analogy with the theory of continuous phase transitions. Instead, our model explicitly assumes that the onset of precipitation is governed by a stability threshold involving boundary‐layer water vapor. This allows us to explain the precipitation‐humidity relationship over a broader range of water vapor values, and may explain the observed temperature dependence of the relationship.
AU - MULLER, Caroline J
AU - Back, Larissa E.
AU - O'Gorman, Paul A.
AU - Emanuel, Kerry A.
ID - 9148
IS - 16
JF - Geophysical Research Letters
KW - General Earth and Planetary Sciences
KW - Geophysics
SN - 0094-8276
TI - A model for the relationship between tropical precipitation and column water vapor
VL - 36
ER -
TY - GEN
AB - Ising models with pairwise interactions are the least structured, or maximum-entropy, probability distributions that exactly reproduce measured pairwise correlations between spins. Here we use this equivalence to construct Ising models that describe the correlated spiking activity of populations of 40 neurons in the salamander retina responding to natural movies. We show that pairwise interactions between neurons account for observed higher-order correlations, and that for groups of 10 or more neurons pairwise interactions can no longer be regarded as small perturbations in an independent system. We then construct network ensembles that generalize the network instances observed in the experiment, and study their thermodynamic behavior and coding capacity. Based on this construction, we can also create synthetic networks of 120 neurons, and find that with increasing size the networks operate closer to a critical point and start exhibiting collective behaviors reminiscent of spin glasses. We examine closely two such behaviors that could be relevant for neural code: tuning of the network to the critical point to maximize the ability to encode diverse stimuli, and using the metastable states of the Ising Hamiltonian as neural code words.
AU - Gasper Tkacik
AU - Schneidman, Elad
AU - Berry, Michael J
AU - Bialek, William S
ID - 3732
T2 - ArXiv
TI - Spin glass models for a network of real neurons
VL - q-bio.NC
ER -
TY - JOUR
AB - There is a close analogy between statistical thermodynamics and the evolution of allele frequencies under mutation, selection and random drift. Wright's formula for the stationary distribution of allele frequencies is analogous to the Boltzmann distribution in statistical physics. Population size, 2N, plays the role of the inverse temperature, 1/kT, and determines the magnitude of random fluctuations. Log mean fitness, View the MathML source, tends to increase under selection, and is analogous to a (negative) energy; a potential function, U, increases under mutation in a similar way. An entropy, SH, can be defined which measures the deviation from the distribution of allele frequencies expected under random drift alone; the sum View the MathML source gives a free fitness that increases as the population evolves towards its stationary distribution. Usually, we observe the distribution of a few quantitative traits that depend on the frequencies of very many alleles. The mean and variance of such traits are analogous to observable quantities in statistical thermodynamics. Thus, we can define an entropy, SΩ, which measures the volume of allele frequency space that is consistent with the observed trait distribution. The stationary distribution of the traits is View the MathML source; this applies with arbitrary epistasis and dominance. The entropies SΩ, SH are distinct, but converge when there are so many alleles that traits fluctuate close to their expectations. Populations tend to evolve towards states that can be realised in many ways (i.e., large SΩ), which may lead to a substantial drop below the adaptive peak; we illustrate this point with a simple model of genetic redundancy. This analogy with statistical thermodynamics brings together previous ideas in a general framework, and justifies a maximum entropy approximation to the dynamics of quantitative traits.
AU - Barton, Nicholas H
AU - Coe, Jason
ID - 3775
IS - 2
JF - Journal of Theoretical Biology
TI - On the application of statistical physics to evolutionary biology
VL - 259
ER -
TY - JOUR
AB - Why are sinistral snails so rare? Two main hypotheses are that selection acts against the establishment of new coiling morphs, because dextral and sinistral snails have trouble mating, or else a developmental constraint prevents the establishment of sinistrals. We therefore used an isolate of the snail Lymnaea stagnalis, in which sinistrals are rare, and populations of Partula suturalis, in which sinistrals are common, as well as a mathematical model, to understand the circumstances by which new morphs evolve. The main finding is that the sinistral genotype is associated with reduced egg viability in L. stagnalis, but in P. suturalis individuals of sinistral and dextral genotype appear equally fecund, implying a lack of a constraint. As positive frequency-dependent selection against the rare chiral morph in P. suturalis also operates over a narrow range (< 3%), the results suggest a model for chiral evolution in snails in which weak positive frequency-dependent selection may be overcome by a negative frequency-dependent selection, such as reproductive character displacement. In snails, there is not always a developmental constraint. As the direction of cleavage, and thus the directional asymmetry of the entire body, does not generally vary in other Spiralia (annelids, echiurans, vestimentiferans, sipunculids and nemerteans), it remains an open question as to whether this is because of a constraint and/or because most taxa do not have a conspicuous external asymmetry (like a shell) upon which selection can act.
AU - Davison, Angus
AU - Barton, Nicholas H
AU - Clarke, Bryan
ID - 3780
IS - 8
JF - Journal of Evolutionary Biology
TI - The effect of chirality phenotype and genotype on the fecundity and viability of Partula suturalis and Lymnaea stagnalis: Implications for the evolution of sinistral snails
VL - 22
ER -
TY - CONF
AB - In this paper we extend the work of Alfaro, Henzinger et al. on interface theories for component-based design. Existing interface theories often fail to capture functional relations between the inputs and outputs of an interface. For example, a simple synchronous interface that takes as input a number n ≥ 0 and returns, at the same time, as output n + 1, cannot be expressed in existing theories. In this paper we provide a theory of relational interfaces, where such input-output relations can be captured. Our theory supports synchronous interfaces, both stateless and stateful. It includes explicit notions of environments and pluggability, and satisfies fundamental properties such as preservation of refinement by composition, and characterization of pluggability by refinement. We achieve these properties by making reasonable restrictions on feedback loops in interface compositions.
AU - Tripakis, Stavros
AU - Lickly, Ben
AU - Henzinger, Thomas A
AU - Lee, Edward
ID - 3837
T2 - EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
TI - On relational interfaces
ER -
TY - CONF
AB - We compare several languages for specifying Markovian population models such as queuing networks and chemical reaction networks. These languages —matrix descriptions, stochastic Petri nets, stoichiometric equations, stochastic process algebras, and guarded command models— all describe continuous-time Markov chains, but they differ according to important properties, such as compositionality, expressiveness and succinctness, executability, ease of use, and the support they provide for checking the well-formedness of a model and for analyzing a model.
AU - Henzinger, Thomas A
AU - Jobstmann, Barbara
AU - Wolf, Verena
ID - 3841
TI - Formalisms for specifying Markovian population models
VL - 5797
ER -
TY - CONF
AB - Within systems biology there is an increasing interest in the stochastic behavior of biochemical reaction networks. An appropriate stochastic description is provided by the chemical master equation, which represents a continuous- time Markov chain (CTMC).
Standard Uniformization (SU) is an efficient method for the transient analysis of CTMCs. For systems with very different time scales, such as biochemical reaction networks, SU is computationally expensive. In these cases, a variant of SU, called adaptive uniformization (AU), is known to reduce the large number of iterations needed by SU. The additional difficulty of AU is that it requires the solution of a birth process.
In this paper we present an on-the-fly variant of AU, where we improve the original algorithm for AU at the cost of a small approximation error. By means of several examples, we show that our approach is particularly well-suited for biochemical reaction networks.
AU - Didier, Frédéric
AU - Henzinger, Thomas A
AU - Mateescu, Maria
AU - Wolf, Verena
ID - 3843
IS - 6
TI - Fast adaptive uniformization of the chemical master equation
VL - 4
ER -
TY - CONF
AB - The Hierarchical Timing Language (HTL) is a real-time coordination language for distributed control systems. HTL programs must be checked for well-formedness, race freedom, transmission safety (schedulability of inter-host communication), and time safety (schedulability of host computation). We present a modular abstract syntax and semantics for HTL, modular checks of well-formedness, race freedom, and transmission safety, and modular code distribution. Our contributions here complement previous results on HTL time safety and modular code generation. Modularity in HTL can be utilized in easy program composition as well as fast program analysis and code generation, but also in so-called runtime patching, where program components may be modified at runtime.
AU - Henzinger, Thomas A
AU - Kirsch, Christoph
AU - Marques, Eduardo
AU - Sokolova, Ana
ID - 3844
TI - Distributed, modular HTL
ER -
TY - JOUR
AB - Games on graphs with omega-regular objectives provide a model for the control and synthesis of reactive systems. Every omega-regular objective can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens “eventually.” Two main strengths of the classical, infinite-limit formulation of liveness are robustness (independence from the granularity of transitions) and simplicity (abstraction of complicated time bounds). However, the classical liveness formulation suffers from the drawback that the time until something good happens may be unbounded. A stronger formulation of liveness, so-called finitary liveness, overcomes this drawback, while still retaining robustness and simplicity. Finitary liveness requires that there exists an unknown, fixed bound b such that something good happens within b transitions. While for one-shot liveness (reachability) objectives, classical and finitary liveness coincide, for repeated liveness (Buchi) objectives, the finitary formulation is strictly stronger. In this work we study games with finitary parity and Streett objectives. We prove the determinacy of these games, present algorithms for solving these games, and characterize the memory requirements of winning strategies. We show that finitary parity games can be solved in polynomial time, which is not known for infinitary parity games. For finitary Streett games, we give an EXPTIME algorithm and show that the problem is NP-hard. Our algorithms can be used, for example, for synthesizing controllers that do not let the response time of a system increase without bound.
AU - Chatterjee, Krishnendu
AU - Henzinger, Thomas A
AU - Horn, Florian
ID - 3870
IS - 1
JF - ACM Transactions on Computational Logic (TOCL)
TI - Finitary winning in omega-regular games
VL - 11
ER -
TY - CONF
AB - Nondeterministic weighted automata are finite automata with numerical weights oil transitions. They define quantitative languages 1, that assign to each word v; a real number L(w). The value of ail infinite word w is computed as the maximal value of all runs over w, and the value of a run as the supremum, limsup liminf, limit average, or discounted sum of the transition weights. We introduce probabilistic weighted antomata, in which the transitions are chosen in a randomized (rather than nondeterministic) fashion. Under almost-sure semantics (resp. positive semantics), the value of a word v) is the largest real v such that the runs over w have value at least v with probability I (resp. positive probability). We study the classical questions of automata theory for probabilistic weighted automata: emptiness and universality, expressiveness, and closure under various operations oil languages. For quantitative languages, emptiness university axe defined as whether the value of some (resp. every) word exceeds a given threshold. We prove some, of these questions to he decidable, and others undecidable. Regarding expressive power, we show that probabilities allow its to define a wide variety of new classes of quantitative languages except for discounted-sum automata, where probabilistic choice is no more expressive than nondeterminism. Finally we live ail almost complete picture of the closure of various classes of probabilistic weighted automata for the following, provide, is operations oil quantitative languages: maximum, sum. and numerical complement.
AU - Chatterjee, Krishnendu
AU - Doyen, Laurent
AU - Henzinger, Thomas A
ID - 3871
TI - Probabilistic weighted automata
VL - 5710
ER -
TY - JOUR
AB - We compare anti-parasite defences at the level of multicellular organisms and insect societies, and find that selection by parasites at these two organisational levels is often very similar and has created a number of parallel evolutionary solutions in the host's immune response. The defence mechanisms of both individuals and insect colonies start with border defences to prevent parasite intake and are followed by soma defences that prevent the establishment and spread of the parasite between the body's cells or the social insect workers. Lastly, germ line defences are employed to inhibit infection of the reproductive tissue of organisms or the reproductive individuals in colonies. We further find sophisticated self/non-self-recognition systems operating at both levels, which appear to be vital in maintaining the integrity of the body or colony as a reproductive entity. We then expand on the regulation of immune responses and end with a contemplation of how evolution may shape the different immune components, both within and between levels. The aim of this review is to highlight common evolutionary principles acting in disease defence at the level of both individual organisms and societies, thereby linking the fields of physiological and ecological immunology.
AU - Cremer, Sylvia
AU - Sixt, Michael K
ID - 3946
IS - 1513
JF - Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences
TI - Analogies in the evolution of individual and social immunity
VL - 364
ER -
TY - CONF
AB - We describe an algorithm for segmenting three-dimensional medical imaging data modeled as a continuous function on a 3-manifold. It is related to watershed algorithms developed in image processing but is closer to its mathematical roots, which are Morse theory and homological algebra. It allows for the implicit treatment of an underlying mesh, thus combining the structural integrity of its mathematical foundations with the computational efficiency of image processing.
AU - Edelsbrunner, Herbert
AU - Harer, John
ID - 3968
TI - The persistent Morse complex segmentation of a 3-manifold
VL - 5903
ER -
TY - JOUR
AB - Populations living in a spatially and temporally changing environment can adapt to the changing optimum and/or migrate toward favorable habitats. Here we extend previous analyses with a static optimum to allow the environment to vary in time as well as in space. The model follows both population dynamics and the trait mean under stabilizing selection, and the outcomes can be understood by comparing the loads due to genetic variance, dispersal, and temporal change. With fixed genetic variance, we obtain two regimes: (1) adaptation that is uniform along the environmental gradient and that responds to the moving optimum as expected for panmictic populations and when the spatial gradient is sufficiently steep, and (2) a population with limited range that adapts more slowly than the environmental optimum changes in both time and space; the population therefore becomes locally extinct and migrates toward suitable habitat. We also use a population‐genetic model with many loci to allow genetic variance to evolve, and we show that the only solution now has uniform adaptation.
AU - Polechova, Jitka
AU - Barton, Nicholas H
AU - Marion, Glenn
ID - 4136
IS - 5
JF - American Naturalist
TI - Species' range: Adaptation in space and time
VL - 174
ER -
TY - JOUR
AB - Felsenstein distinguished two ways by which selection can directly strengthen isolation. First, a modifier that strengthens prezygotic isolation can be favored everywhere. This fits with the traditional view of reinforcement as an adaptation to reduce deleterious hybridization by strengthening assortative mating. Second, selection can favor association between different incompatibilities, despite recombination. We generalize this “two allele” model to follow associations among any number of incompatibilities, which may include both assortment and hybrid inviability. Our key argument is that this process, of coupling between incompatibilities, may be quite different from the usual view of reinforcement: strong isolation can evolve through the coupling of any kind of incompatibility, whether prezygotic or postzygotic. Single locus incompatibilities become coupled because associations between them increase the variance in compatibility, which in turn increases mean fitness if there is positive epistasis. Multiple incompatibilities, each maintained by epistasis, can become coupled in the same way. In contrast, a single-locus incompatibility can become coupled with loci that reduce the viability of haploid hybrids because this reduces harmful recombination. We obtain simple approximations for the limits of tight linkage, and strong assortment, and show how assortment alleles can invade through associations with other components of reproductive isolation.
AU - Barton, Nicholas H
AU - De Cara, Maria
ID - 4242
IS - 5
JF - Evolution; International Journal of Organic Evolution
TI - The evolution of strong reproductive isolation
VL - 63
ER -
TY - CONF
AB - Pseudo-code descriptions of STMs assume sequentially consistent program execution and atomicity of high-level STM operations like read, write, and commit. These assumptions are often violated in realistic settings, as STM implementations run on relaxed memory models, with the atomicity of operations as provided by the hardware. This paper presents the first approach to verify STMs under relaxed memory models with atomicity of 32 bit loads and stores, and read-modify-write operations. We present RML, a new high-level language for expressing concurrent algorithms with a hardware-level atomicity of instructions, and whose semantics is parametrized by various relaxed memory models. We then present our tool, FOIL, which takes as input the RML description of an STM algorithm and the description of a memory model, and automatically determines the locations of fences, which if inserted, ensure the correctness of the STM algorithm under the given memory model. We use FOIL to verify DSTM, TL2, and McRT STM under the memory models of sequential consistency, total store order, partial store order, and relaxed memory order.
AU - Guerraoui, Rachid
AU - Thomas Henzinger
AU - Vasu Singh
ID - 4383
TI - Software transactional memory on relaxed memory models
VL - 5643
ER -
TY - CONF
AB - For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. In this paper, we consider algorithmic verification of programs that use boolean variables, and in addition, access a single read-only array whose length is potentially unbounded, and whose elements range over a potentially unbounded data domain. We show that the reachability problem, while undecidable in general, is (1) Pspace-complete for programs in which the array-accessing for-loops are not nested, (2) decidable for a restricted class of programs with doubly-nested loops. The second result establishes connections to automata and logics defining languages over data words.
AU - Alur, Rajeev
AU - Cerny, Pavol
AU - Weinstein, Scott
ID - 4403
TI - Algorithmic analysis of array-accessing programs
VL - 5771
ER -