TY - JOUR
AB - We consider non-interacting particles subject to a fixed external potential V and a self-generated magnetic field B. The total energy includes the field energy β∫B2 and we minimize over all particle states and magnetic fields. In the case of spin-1/2 particles this minimization leads to the coupled Maxwell-Pauli system. The parameter β tunes the coupling strength between the field and the particles and it effectively determines the strength of the field. We investigate the stability and the semiclassical asymptotics, h→0, of the total ground state energy E(β,h,V). The relevant parameter measuring the field strength in the semiclassical limit is κ=βh. We are not able to give the exact leading order semiclassical asymptotics uniformly in κ or even for fixed κ. We do however give upper and lower bounds on E with almost matching dependence on κ. In the simultaneous limit h→0 and κ→∞ we show that the standard non-magnetic Weyl asymptotics holds. The same result also holds for the spinless case, i.e. where the Pauli operator is replaced by the Schrödinger operator.
AU - Erdös, László
AU - Fournais, Søren
AU - Solovej, Jan
ID - 2698
IS - 6
JF - Journal of the European Mathematical Society
TI - Stability and semiclassics in self-generated fields
VL - 15
ER -
TY - CONF
AB - Even though both population and quantitative genetics, and evolutionary computation, deal with the same questions, they have developed largely independently of each other. I review key results from each field, emphasising those that apply independently of the (usually unknown) relation between genotype and phenotype. The infinitesimal model provides a simple framework for predicting the response of complex traits to selection, which in biology has proved remarkably successful. This allows one to choose the schedule of population sizes and selection intensities that will maximise the response to selection, given that the total number of individuals realised, C = ∑t Nt, is constrained. This argument shows that for an additive trait (i.e., determined by the sum of effects of the genes), the optimum population size and the maximum possible response (i.e., the total change in trait mean) are both proportional to √C.
AU - Barton, Nicholas H
AU - Paixao, Tiago
ID - 2718
T2 - Proceedings of the 15th annual conference on Genetic and evolutionary computation
TI - Can quantitative and population genetics help us understand evolutionary computation?
ER -
TY - CONF
AB - Prediction of the evolutionary process is a long standing problem both in the theory of evolutionary biology and evolutionary computation (EC). It has long been realized that heritable variation is crucial to both the response to selection and the success of genetic algorithms. However, not all variation contributes in the same way to the response. Quantitative genetics has developed a large body of work trying to estimate and understand how different components of the variance in fitness in the population contribute to the response to selection. We illustrate how to apply some concepts of quantitative genetics to the analysis of genetic algorithms. In particular, we derive estimates for the short term prediction of the response to selection and we use variance decomposition to gain insight on local aspects of the landscape. Finally, we propose a new population based genetic algorithm that uses these methods to improve its operation.
AU - Paixao, Tiago
AU - Barton, Nicholas H
ID - 2719
T2 - Proceedings of the 15th annual conference on Genetic and evolutionary computation
TI - A variance decomposition approach to the analysis of genetic algorithms
ER -
TY - JOUR
AB - Knowledge of the rate and fitness effects of mutations is essential for understanding the process of evolution. Mutations are inherently difficult to study because they are rare and are frequently eliminated by natural selection. In the ciliate Tetrahymena thermophila, mutations can accumulate in the germline genome without being exposed to selection. We have conducted a mutation accumulation (MA) experiment in this species. Assuming that all mutations are deleterious and have the same effect, we estimate that the deleterious mutation rate per haploid germline genome per generation is U = 0.0047 (95% credible interval: 0.0015, 0.0125), and that germline mutations decrease fitness by s = 11% when expressed in a homozygous state (95% CI: 4.4%, 27%). We also estimate that deleterious mutations are partially recessive on average (h = 0.26; 95% CI: –0.022, 0.62) and that the rate of lethal mutations is <10% of the deleterious mutation rate. Comparisons between the observed evolutionary responses in the germline and somatic genomes and the results from individual-based simulations of MA suggest that the two genomes have similar mutational parameters. These are the first estimates of the deleterious mutation rate and fitness effects from the eukaryotic supergroup Chromalveolata and are within the range of those of other eukaryotes.
AU - Long, Hongan
AU - Paixao, Tiago
AU - Azevedo, Ricardo
AU - Zufall, Rebecca
ID - 2720
IS - 2
JF - Genetics
TI - Accumulation of spontaneous mutations in the ciliate Tetrahymena thermophila
VL - 195
ER -
TY - JOUR
AB - We consider random n×n matrices of the form (XX*+YY*)^{-1/2}YY*(XX*+YY*)^{-1/2}, where X and Y have independent entries with zero mean and variance one. These matrices are the natural generalization of the Gaussian case, which are known as MANOVA matrices and which have joint eigenvalue density given by the third classical ensemble, the Jacobi ensemble. We show that, away from the spectral edge, the eigenvalue density converges to the limiting density of the Jacobi ensemble even on the shortest possible scales of order 1/n (up to log n factors). This result is the analogue of the local Wigner semicircle law and the local Marchenko-Pastur law for general MANOVA matrices.
AU - Erdös, László
AU - Farrell, Brendan
ID - 2782
IS - 6
JF - Journal of Statistical Physics
TI - Local eigenvalue density for general MANOVA matrices
VL - 152
ER -
TY - JOUR
AB - A novel Taylor-Couette system has been constructed for investigations of transitional as well as high Reynolds number turbulent flows in very large aspect ratios. The flexibility of the setup enables studies of a variety of problems regarding hydrodynamic instabilities and turbulence in rotating flows. The inner and outer cylinders and the top and bottom endplates can be rotated independently with rotation rates of up to 30 Hz, thereby covering five orders of magnitude in Reynolds numbers (Re = 101-106). The radius ratio can be easily changed, the highest realized one is η = 0.98 corresponding to an aspect ratio of 260 gap width in the vertical and 300 in the azimuthal direction. For η < 0.98 the aspect ratio can be dynamically changed during measurements and complete transparency in the radial direction over the full length of the cylinders is provided by the usage of a precision glass inner cylinder. The temperatures of both cylinders are controlled independently. Overall this apparatus combines an unmatched variety in geometry, rotation rates, and temperatures, which is provided by a sophisticated high-precision bearing system. Possible applications are accurate studies of the onset of turbulence and spatio-temporal intermittent flow patterns in very large domains, transport processes of turbulence at high Re, the stability of Keplerian flows for different boundary conditions, and studies of baroclinic instabilities.
AU - Avila, Kerstin
AU - Hof, Björn
ID - 2806
IS - 6
JF - Review of Scientific Instruments
TI - High-precision Taylor-Couette experiment to study subcritical transitions and the role of boundary conditions and size effects
VL - 84
ER -
TY - CONF
AB - We consider several basic problems of algebraic topology, with connections to combinatorial and geometric questions, from the point of view of computational complexity. The extension problem asks, given topological spaces X; Y , a subspace A ⊆ X, and a (continuous) map f : A → Y , whether f can be extended to a map X → Y . For computational purposes, we assume that X and Y are represented as finite simplicial complexes, A is a subcomplex of X, and f is given as a simplicial map. In this generality the problem is undecidable, as follows from Novikov's result from the 1950s on uncomputability of the fundamental group π1(Y ). We thus study the problem under the assumption that, for some k ≥ 2, Y is (k - 1)-connected; informally, this means that Y has \no holes up to dimension k-1" (a basic example of such a Y is the sphere Sk). We prove that, on the one hand, this problem is still undecidable for dimX = 2k. On the other hand, for every fixed k ≥ 2, we obtain an algorithm that solves the extension problem in polynomial time assuming Y (k - 1)-connected and dimX ≤ 2k - 1. For dimX ≤ 2k - 2, the algorithm also provides a classification of all extensions up to homotopy (continuous deformation). This relies on results of our SODA 2012 paper, and the main new ingredient is a machinery of objects with polynomial-time homology, which is a polynomial-time analog of objects with effective homology developed earlier by Sergeraert et al. We also consider the computation of the higher homotopy groups πk(Y ), k ≥ 2, for a 1-connected Y . Their computability was established by Brown in 1957; we show that πk(Y ) can be computed in polynomial time for every fixed k ≥ 2. On the other hand, Anick proved in 1989 that computing πk(Y ) is #P-hard if k is a part of input, where Y is a cell complex with certain rather compact encoding. We strengthen his result to #P-hardness for Y given as a simplicial complex.
AU - Čadek, Martin
AU - Krcál, Marek
AU - Matoušek, Jiří
AU - Vokřínek, Lukáš
AU - Wagner, Uli
ID - 2807
T2 - 45th Annual ACM Symposium on theory of computing
TI - Extending continuous maps: Polynomiality and undecidability
ER -
TY - JOUR
AB - In order to establish a reference for analysis of the function of auxin and the auxin biosynthesis regulators SHORT INTERNODE/ STYLISH (SHI/STY) during Physcomitrella patens reproductive development, we have described male (antheridial) and female (archegonial) development in detail, including temporal and positional information of organ initiation. This has allowed us to define discrete stages of organ morphogenesis and to show that reproductive organ development in P. patens is highly organized and that organ phyllotaxis differs between vegetative and reproductive development. Using the PpSHI1 and PpSHI2 reporter and knockout lines, the auxin reporters GmGH3pro:GUS and PpPINApro:GFP-GUS, and the auxin-conjugating transgene PpSHI2pro:IAAL, we could show that the PpSHI genes, and by inference also auxin, play important roles for reproductive organ development in moss. The PpSHI genes are required for the apical opening of the reproductive organs, the final differentiation of the egg cell, and the progression of canal cells into a cell death program. The apical cells of the archegonium, the canal cells, and the egg cell are also sites of auxin responsiveness and are affected by reduced levels of active auxin, suggesting that auxin mediates PpSHI function in the reproductive organs.
AU - Landberg, Katarina
AU - Pederson, Eric
AU - Viaene, Tom
AU - Bozorg, Behruz
AU - Friml, Jirí
AU - Jönsson, Henrik
AU - Thelander, Mattias
AU - Sundberg, Eva
ID - 2808
IS - 3
JF - Plant Physiology
TI - The moss physcomitrella patens reproductive organ development is highly organized, affected by the two SHI/STY genes and by the level of active auxin in the SHI/STY expression domain
VL - 162
ER -
TY - JOUR
AB - The epistatic interactions that underlie evolutionary constraint have mainly been studied for constant external conditions. However, environmental changes may modulate epistasis and hence affect genetic constraints. Here we investigate genetic constraints in the adaptive evolution of a novel regulatory function in variable environments, using the lac repressor, LacI, as a model system. We have systematically reconstructed mutational trajectories from wild type LacI to three different variants that each exhibit an inverse response to the inducing ligand IPTG, and analyzed the higher-order interactions between genetic and environmental changes. We find epistasis to depend strongly on the environment. As a result, mutational steps essential to inversion but inaccessible by positive selection in one environment, become accessible in another. We present a graphical method to analyze the observed complex higher-order interactions between multiple mutations and environmental change, and show how the interactions can be explained by a combination of mutational effects on allostery and thermodynamic stability. This dependency of genetic constraint on the environment should fundamentally affect evolutionary dynamics and affects the interpretation of phylogenetic data.
AU - De Vos, Marjon
AU - Poelwijk, Frank
AU - Battich, Nico
AU - Ndika, Joseph
AU - Tans, Sander
ID - 2810
IS - 6
JF - PLoS Genetics
TI - Environmental dependence of genetic constraint
VL - 9
ER -
TY - JOUR
AB - In pipe, channel, and boundary layer flows turbulence first occurs intermittently in space and time: at moderate Reynolds numbers domains of disordered turbulent motion are separated by quiescent laminar regions. Based on direct numerical simulations of pipe flow we argue here that the spatial intermittency has its origin in a nearest neighbor interaction between turbulent regions. We further show that in this regime turbulent flows are intrinsically intermittent with a well-defined equilibrium turbulent fraction but without ever assuming a steady pattern. This transition scenario is analogous to that found in simple models such as coupled map lattices. The scaling observed implies that laminar intermissions of the turbulent flow will persist to arbitrarily large Reynolds numbers.
AU - Avila, Marc
AU - Hof, Björn
ID - 2811
IS - 6
JF - Physical Review E
TI - Nature of laminar-turbulence intermittency in shear flows
VL - 87
ER -
TY - CONF
AB - We consider the problem of deciding whether the persistent homology group of a simplicial pair (K, L) can be realized as the homology H* (X) of some complex X with L ⊂ X ⊂ K. We show that this problem is NP-complete even if K is embedded in ℝ3. As a consequence, we show that it is NP-hard to simplify level and sublevel sets of scalar functions on S3 within a given tolerance constraint. This problem has relevance to the visualization of medical images by isosurfaces. We also show an implication to the theory of well groups of scalar functions: not every well group can be realized by some level set, and deciding whether a well group can be realized is NP-hard.
AU - Attali, Dominique
AU - Bauer, Ulrich
AU - Devillers, Olivier
AU - Glisse, Marc
AU - Lieutier, André
ID - 2812
T2 - Proceedings of the 29th annual symposium on Computational Geometry
TI - Homological reconstruction and simplification in R3
ER -
TY - JOUR
AB - Turbulence is ubiquitous in nature, yet even for the case of ordinary Newtonian fluids like water, our understanding of this phenomenon is limited. Many liquids of practical importance are more complicated (e.g., blood, polymer melts, paints), however; they exhibit elastic as well as viscous characteristics, and the relation between stress and strain is nonlinear. We demonstrate here for a model system of such complex fluids that at high shear rates, turbulence is not simply modified as previously believed but is suppressed and replaced by a different type of disordered motion, elasto-inertial turbulence. Elasto-inertial turbulence is found to occur at much lower Reynolds numbers than Newtonian turbulence, and the dynamical properties differ significantly. The friction scaling observed coincides with the so-called "maximum drag reduction" asymptote, which is exhibited by a wide range of viscoelastic fluids.
AU - Samanta, Devranjan
AU - Dubief, Yves
AU - Holzner, Markus
AU - Schäfer, Christof
AU - Morozov, Alexander
AU - Wagner, Christian
AU - Hof, Björn
ID - 2813
IS - 26
JF - PNAS
TI - Elasto-inertial turbulence
VL - 110
ER -
TY - JOUR
AB - We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between the tester and the system, where the system state space is partitioned according to some coverage criterion and the objective of the tester is to maximize the set of partitions (or coverage goals) visited during the game. We show the complexity of the maximal coverage problem for non-deterministic systems is PSPACE-complete, but is NP-complete for deterministic systems. For the special case of non-deterministic systems with a re-initializing "reset" action, which represent running a new test input on a re-initialized system, we show that the complexity is coNP-complete. Our proof technique for reset games uses randomized testing strategies that circumvent the exponentially large memory requirement of deterministic testing strategies. We also discuss the memory requirement for deterministic strategies and extensions of our results to other models, such as pushdown systems and timed systems.
AU - Chatterjee, Krishnendu
AU - Alfaro, Luca
AU - Majumdar, Ritankar
ID - 2814
IS - 2
JF - International Journal of Foundations of Computer Science
TI - The complexity of coverage
VL - 24
ER -
TY - JOUR
AB - The fact that a sum of isotropic Gaussian kernels can have more modes than kernels is surprising. Extra (ghost) modes do not exist in ℝ1 and are generally not well studied in higher dimensions. We study a configuration of n+1 Gaussian kernels for which there are exactly n+2 modes. We show that all modes lie on a finite set of lines, which we call axes, and study the restriction of the Gaussian mixture to these axes in order to discover that there are an exponential number of critical points in this configuration. Although the existence of ghost modes remained unknown due to the difficulty of finding examples in ℝ2, we show that the resilience of ghost modes grows like the square root of the dimension. In addition, we exhibit finite configurations of isotropic Gaussian kernels with superlinearly many modes.
AU - Edelsbrunner, Herbert
AU - Fasy, Brittany Terese
AU - Rote, Günter
ID - 2815
IS - 4
JF - Discrete & Computational Geometry
TI - Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions
VL - 49
ER -
TY - JOUR
AB - In solid tumors, targeted treatments can lead to dramatic regressions, but responses are often short-lived because resistant cancer cells arise. The major strategy proposed for overcoming resistance is combination therapy. We present a mathematical model describing the evolutionary dynamics of lesions in response to treatment. We first studied 20 melanoma patients receiving vemurafenib. We then applied our model to an independent set of pancreatic, colorectal, and melanoma cancer patients with metastatic disease. We find that dual therapy results in long-term disease control for most patients, if there are no single mutations that cause cross-resistance to both drugs; in patients with large disease burden, triple therapy is needed. We also find that simultaneous therapy with two drugs is much more effective than sequential therapy. Our results provide realistic expectations for the efficacy of new drug combinations and inform the design of trials for new cancer therapeutics.
AU - Božić, Ivana
AU - Reiter, Johannes
AU - Allen, Benjamin
AU - Antal, Tibor
AU - Chatterjee, Krishnendu
AU - Shah, Preya
AU - Moon, Yo
AU - Yaqubie, Amin
AU - Kelly, Nicole
AU - Le, Dung
AU - Lipson, Evan
AU - Chapman, Paul
AU - Diaz, Luis
AU - Vogelstein, Bert
AU - Nowak, Martin
ID - 2816
JF - eLife
TI - Evolutionary dynamics of cancer in response to targeted combination therapy
VL - 2
ER -
TY - JOUR
AB - The basic idea of evolutionary game theory is that payoff determines reproductive rate. Successful individuals have a higher payoff and produce more offspring. But in evolutionary and ecological situations there is not only reproductive rate but also carrying capacity. Individuals may differ in their exposure to density limiting effects. Here we explore an alternative approach to evolutionary game theory by assuming that the payoff from the game determines the carrying capacity of individual phenotypes. Successful strategies are less affected by density limitation (crowding) and reach higher equilibrium abundance. We demonstrate similarities and differences between our framework and the standard replicator equation. Our equation is defined on the positive orthant, instead of the simplex, but has the same equilibrium points as the replicator equation. Linear stability analysis produces the classical conditions for asymptotic stability of pure strategies, but the stability properties of internal equilibria can differ in the two frameworks. For example, in a two-strategy game with an internal equilibrium that is always stable under the replicator equation, the corresponding equilibrium can be unstable in the new framework resulting in a limit cycle.
AU - Novak, Sebastian
AU - Chatterjee, Krishnendu
AU - Nowak, Martin
ID - 2817
JF - Journal of Theoretical Biology
TI - Density games
VL - 334
ER -
TY - JOUR
AB - Models of neural responses to stimuli with complex spatiotemporal correlation structure often assume that neurons are selective for only a small number of linear projections of a potentially high-dimensional input. In this review, we explore recent modeling approaches where the neural response depends on the quadratic form of the input rather than on its linear projection, that is, the neuron is sensitive to the local covariance structure of the signal preceding the spike. To infer this quadratic dependence in the presence of arbitrary (e.g., naturalistic) stimulus distribution, we review several inference methods, focusing in particular on two information theory–based approaches (maximization of stimulus energy and of noise entropy) and two likelihood-based approaches (Bayesian spike-triggered covariance and extensions of generalized linear models). We analyze the formal relationship between the likelihood-based and information-based approaches to demonstrate how they lead to consistent inference. We demonstrate the practical feasibility of these procedures by using model neurons responding to a flickering variance stimulus.
AU - Rajan, Kanaka
AU - Marre, Olivier
AU - Tkacik, Gasper
ID - 2818
IS - 7
JF - Neural Computation
TI - Learning quadratic receptive fields from neural responses to natural stimuli
VL - 25
ER -
TY - CONF
AB - We introduce quantatitive timed refinement metrics and quantitative timed simulation functions, incorporating zenoness checks, for timed systems. These functions assign positive real numbers between zero and infinity which quantify the timing mismatches between two timed systems, amongst non-zeno runs. We quantify timing mismatches in three ways: (1) the maximum timing mismatch that can arise, (2) the "steady-state" maximum timing mismatches, where initial transient timing mismatches are ignored; and (3) the (long-run) average timing mismatches amongst two systems. These three kinds of mismatches constitute three important types of timing differences. Our event times are the global times, measured from the start of the system execution, not just the time durations of individual steps. We present algorithms over timed automata for computing the three quantitative simulation functions to within any desired degree of accuracy. In order to compute the values of the quantitative simulation functions, we use a game theoretic formulation. We introduce two new kinds of objectives for two player games on finite state game graphs: (1) eventual debit-sum level objectives, and (2) average debit-sum level objectives. We present algorithms for computing the optimal values for these objectives for player 1, and then use these algorithms to compute the values of the quantitative timed simulation functions.
AU - Chatterjee, Krishnendu
AU - Prabhu, Vinayak
ID - 2819
T2 - Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control
TI - Quantitative timed simulation functions and refinement metrics for real-time systems
VL - 1
ER -
TY - CONF
AB - In this paper, we introduce the powerful framework of graph games for the analysis of real-time scheduling with firm deadlines. We introduce a novel instance of a partial-observation game that is suitable for this purpose, and prove decidability of all the involved decision problems. We derive a graph game that allows the automated computation of the competitive ratio (along with an optimal witness algorithm for the competitive ratio) and establish an NP-completeness proof for the graph game problem. For a given on-line algorithm, we present polynomial time solution for computing (i) the worst-case utility; (ii) the worst-case utility ratio w.r.t. a clairvoyant off-line algorithm; and (iii) the competitive ratio. A major strength of the proposed approach lies in its flexibility w.r.t. incorporating additional constraints on the adversary and/or the algorithm, including limited maximum or average load, finiteness of periods of overload, etc., which are easily added by means of additional instances of standard objective functions for graph games.
AU - Chatterjee, Krishnendu
AU - Kößler, Alexander
AU - Schmid, Ulrich
ID - 2820
SN - 978-1-4503-1567-8
T2 - Proceedings of the 16th International conference on Hybrid systems: Computation and control
TI - Automated analysis of real-time scheduling using graph games
ER -
TY - JOUR
AB - Many key aspects of plant development are regulated by the polarized transport of the phytohormone auxin. Cellular auxin efflux, the rate-limiting step in this process, has been shown to rely on the coordinated action of PIN-formed (PIN) and B-type ATP binding cassette (ABCB) carriers. Here, we report that polar auxin transport in the Arabidopsis thaliana root also requires the action of a Major Facilitator Superfamily (MFS) transporter, Zinc-Induced Facilitator-Like 1 (ZIFL1). Sequencing, promoter-reporter, and fluorescent protein fusion experiments indicate that the full-length ZIFL1.1 protein and a truncated splice isoform, ZIFL1.3, localize to the tonoplast of root cells and the plasma membrane of leaf stomatal guard cells, respectively. Using reverse genetics, we show that the ZIFL1.1 transporter regulates various root auxin-related processes, while the ZIFL1.3 isoform mediates drought tolerance by regulating stomatal closure. Auxin transport and immunolocalization assays demonstrate that ZIFL1.1 indirectly modulates cellular auxin efflux during shootward auxin transport at the root tip, likely by regulating plasma membrane PIN2 abundance. Finally, heterologous expression in yeast revealed that ZIFL1.1 and ZIFL1.3 share H+-coupled K+ transport activity. Thus, by determining the subcellular and tissue distribution of two isoforms, alternative splicing dictates a dual function for the ZIFL1 transporter. We propose that this MFS carrier regulates stomatal movements and polar auxin transport by modulating potassium and proton fluxes in Arabidopsis cells.
AU - Remy, Estelle
AU - Cabrito, Tânia
AU - Baster, Pawel
AU - Batista, Rita
AU - Teixeira, Miguel
AU - Friml, Jirí
AU - Sá Correia, Isabel
AU - Duque, Paula
ID - 2821
IS - 3
JF - Plant Cell
TI - A major facilitator superfamily transporter plays a dual role in polar auxin transport and drought stress tolerance in Arabidopsis
VL - 25
ER -
TY - JOUR
AB - Identification of genes that control root system architecture in crop plants requires innovations that enable high-throughput and accurate measurements of root system architecture through time. We demonstrate the ability of a semiautomated 3D in vivo imaging and digital phenotyping pipeline to interrogate the quantitative genetic basis of root system growth in a rice biparental mapping population, Bala x Azucena. We phenotyped >1,400 3D root models and >57,000 2D images for a suite of 25 traits that quantified the distribution, shape, extent of exploration, and the intrinsic size of root networks at days 12, 14, and 16 of growth in a gellan gum medium. From these data we identified 89 quantitative trait loci, some of which correspond to those found previously in soil-grown plants, and provide evidence for genetic tradeoffs in root growth allocations, such as between the extent and thoroughness of exploration. We also developed a multivariate method for generating and mapping central root architecture phenotypes and used it to identify five major quantitative trait loci (r2 = 24-37%), two of which were not identified by our univariate analysis. Our imaging and analytical platform provides a means to identify genes with high potential for improving root traits and agronomic qualities of crops.
AU - Topp, Christopher
AU - Iyer Pascuzzi, Anjali
AU - Anderson, Jill
AU - Lee, Cheng
AU - Zurek, Paul
AU - Symonova, Olga
AU - Zheng, Ying
AU - Bucksch, Alexander
AU - Mileyko, Yuriy
AU - Galkovskyi, Taras
AU - Moore, Brad
AU - Harer, John
AU - Edelsbrunner, Herbert
AU - Mitchell Olds, Thomas
AU - Weitz, Joshua
AU - Benfey, Philip
ID - 2822
IS - 18
JF - PNAS
TI - 3D phenotyping and quantitative trait locus mapping identify core regions of the rice genome controlling root architecture
VL - 110
ER -
TY - JOUR
AB - The primary goal of restoration is to create self-sustaining ecological communities that are resilient to periodic disturbance. Currently, little is known about how restored communities respond to disturbance events such as fire and how this response compares to remnant vegetation. Following the 2003 fires in south-eastern Australia we examined the post-fire response of revegetation plantings and compared this to remnant vegetation. Ten burnt and 10 unburnt (control) sites were assessed for each of three types of vegetation (direct seeding revegetation, revegetation using nursery seedlings (tubestock) and remnant woodland). Sixty sampling sites were surveyed 6months after fire to quantify the initial survival of mid- and overstorey plant species in each type of vegetation. Three and 5years after fire all sites were resurveyed to assess vegetation structure, species diversity and vigour, as well as indicators of soil function. Overall, revegetation showed high (>60%) post-fire survival, but this varied among species depending on regeneration strategy (obligate seeder or resprouter). The native ground cover, mid- and overstorey in both types of plantings showed rapid recovery of vegetation structure and cover within 3years of fire. This recovery was similar to the burnt remnant woodlands. Non-native (exotic) ground cover initially increased after fire, but was no different in burnt and unburnt sites 5years after fire. Fire had no effect on species richness, but burnt direct seeding sites had reduced species diversity (Simpson's Diversity Index) while diversity was higher in burnt remnant woodlands. Indices of soil function in all types of vegetation had recovered to levels found in unburnt sites 5years after fire. These results indicate that even young revegetation (stands <10years old) showed substantial recovery from disturbance by fire. This suggests that revegetation can provide an important basis for restoring woodland communities in the fire-prone Australian environment.
AU - Pickup, Melinda
AU - Wilson, Susie
AU - Freudenberger, David
AU - Nicholls, Nick
AU - Gould, Lori
AU - Hnatiuk, Sarah
AU - Delandre, Jeni
ID - 2823
IS - 3
JF - Austral Ecology
TI - Post-fire recovery of revegetated woodland communities in south-eastern Australia
VL - 38
ER -
TY - JOUR
AB - We study synthesis of controllers for real-time systems, where the objective is to stay in a given safe set. The problem is solved by obtaining winning strategies in the setting of concurrent two player timed automaton games with safety objectives. To prevent a player from winning by blocking time, we restrict each player to strategies that ensure that the player cannot be responsible for causing a Zeno run. We construct winning strategies for the controller which require access only to (1) the system clocks (thus, controllers which require their own internal infinitely precise clocks are not necessary), and (2) a logarithmic (in the number of clocks) number of memory bits (i.e. a linear number of memory states). Precisely, we show that for safety objectives, a memory of size (3 + lg (| C | + 1)) bits suffices for winning controller strategies, where C is the set of clocks of the timed automaton game, significantly improving the previous known exponential memory states bound. We also settle the open question of whether winning region-based strategies require memory for safety objectives by showing with an example the necessity of memory for such strategies to win for safety objectives. Finally, we show that the decision problem of determining if there exists a receptive player-1 winning strategy for safety objectives is EXPTIME-complete over timed automaton games.
AU - Chatterjee, Krishnendu
AU - Prabhu, Vinayak
ID - 2824
JF - Information and Computation
TI - Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems
VL - 228-229
ER -
TY - JOUR
AB - Removal of cargos from the cell surface via endocytosis is an efficient mechanism to regulate activities of plasma membrane (PM)-resident proteins, such as receptors or transporters. Salicylic acid (SA) is an important plant hormone that is traditionally associated with pathogen defense. Here, we describe an unanticipated effect of SA on subcellular endocytic cycling of proteins. Both exogenous treatments and endogenously enhanced SA levels repressed endocytosis of different PM proteins. The SA effect on endocytosis did not involve transcription or known components of the SA signaling pathway for transcriptional regulation. SA likely targets an endocytic mechanism that involves the coat protein clathrin, because SA interfered with the clathrin incidence at the PM and clathrin-deficient mutants were less sensitive to the impact of SA on the auxin distribution and root bending during the gravitropic response. By contrast, SA did not affect the ligand-induced endocytosis of the FLAGELLIN SENSING2 (FLS2) receptor during pathogen responses. Our data suggest that the established SA impact on transcription in plant immunity and the nontranscriptional effect of SA on clathrin-mediated endocytosis are independent mechanisms by which SA regulates distinct aspects of plant physiology.
AU - Du, Yunlong
AU - Tejos, Ricardo
AU - Beck, Martina
AU - Himschoot, Ellie
AU - Li, Hongjiang
AU - Robatzek, Silke
AU - Vanneste, Steffen
AU - Friml, Jirí
ID - 2827
IS - 19
JF - PNAS
TI - Salicylic acid interferes with clathrin-mediated endocytic protein trafficking
VL - 110
ER -
TY - JOUR
AB - We study the complexity of valued constraint satisfaction problems (VCSPs) parametrized by a constraint language, a fixed set of cost functions over a finite domain. An instance of the problem is specified by a sum of cost functions from the language and the goal is to minimize the sum. Under the unique games conjecture, the approximability of finite-valued VCSPs is well understood, see Raghavendra [2008]. However, there is no characterization of finite-valued VCSPs, let alone general-valued VCSPs, that can be solved exactly in polynomial time, thus giving insights from a combinatorial optimization perspective. We consider the case of languages containing all possible unary cost functions. In the case of languages consisting of only {0, ∞}-valued cost functions (i.e., relations), such languages have been called conservative and studied by Bulatov [2003, 2011] and recently by Barto [2011]. Since we study valued languages, we call a language conservative if it contains all finite-valued unary cost functions. The computational complexity of conservative valued languages has been studied by Cohen et al. [2006] for languages over Boolean domains, by Deineko et al. [2008] for {0, 1}-valued languages (a.k.a Max-CSP), and by Takhanov [2010a] for {0, ∞}-valued languages containing all finite-valued unary cost functions (a.k.a. Min-Cost-Hom). We prove a Schaefer-like dichotomy theorem for conservative valued languages: if all cost functions in the language satisfy a certain condition (specified by a complementary combination of STP and MJN multimor-phisms), then any instance can be solved in polynomial time (via a new algorithm developed in this article), otherwise the language is NP-hard. This is the first complete complexity classification of general-valued constraint languages over non-Boolean domains. It is a common phenomenon that complexity classifications of problems over non-Boolean domains are significantly harder than the Boolean cases. The polynomial-time algorithm we present for the tractable cases is a generalization of the submodular minimization problem and a result of Cohen et al. [2008]. Our results generalize previous results by Takhanov [2010a] and (a subset of results) by Cohen et al. [2006] and Deineko et al. [2008]. Moreover, our results do not rely on any computer-assisted search as in Deineko et al. [2008], and provide a powerful tool for proving hardness of finite-valued and general-valued languages.
AU - Kolmogorov, Vladimir
AU - Živný, Stanislav
ID - 2828
IS - 2
JF - Journal of the ACM
TI - The complexity of conservative valued CSPs
VL - 60
ER -
TY - JOUR
AB - Laminar-turbulent intermittency is intrinsic to the transitional regime of a wide range of fluid flows including pipe, channel, boundary layer, and Couette flow. In the latter turbulent spots can grow and form continuous stripes, yet in the stripe-normal direction they remain interspersed by laminar fluid. We carry out direct numerical simulations in a long narrow domain and observe that individual turbulent stripes are transient. In agreement with recent observations in pipe flow, we find that turbulence becomes sustained at a distinct critical point once the spatial proliferation outweighs the inherent decaying process. By resolving the asymptotic size distributions close to criticality we can for the first time demonstrate scale invariance at the onset of turbulence.
AU - Shi, Liang
AU - Avila, Marc
AU - Hof, Björn
ID - 2829
IS - 20
JF - Physical Review Letters
TI - Scale invariance at the onset of turbulence in couette flow
VL - 110
ER -
TY - JOUR
AU - Moussion, Christine
AU - Sixt, Michael K
ID - 2830
IS - 5
JF - Immunity
TI - A conduit to amplify innate immunity
VL - 38
ER -
TY - JOUR
AB - We consider Markov decision processes (MDPs) with Büchi (liveness) objectives. We consider the problem of computing the set of almost-sure winning states from where the objective can be ensured with probability 1. Our contributions are as follows: First, we present the first subquadratic symbolic algorithm to compute the almost-sure winning set for MDPs with Büchi objectives; our algorithm takes O(n · √ m) symbolic steps as compared to the previous known algorithm that takes O(n 2) symbolic steps, where n is the number of states and m is the number of edges of the MDP. In practice MDPs have constant out-degree, and then our symbolic algorithm takes O(n · √ n) symbolic steps, as compared to the previous known O(n 2) symbolic steps algorithm. Second, we present a new algorithm, namely win-lose algorithm, with the following two properties: (a) the algorithm iteratively computes subsets of the almost-sure winning set and its complement, as compared to all previous algorithms that discover the almost-sure winning set upon termination; and (b) requires O(n · √ K) symbolic steps, where K is the maximal number of edges of strongly connected components (scc's) of the MDP. The win-lose algorithm requires symbolic computation of scc's. Third, we improve the algorithm for symbolic scc computation; the previous known algorithm takes linear symbolic steps, and our new algorithm improves the constants associated with the linear number of steps. In the worst case the previous known algorithm takes 5×n symbolic steps, whereas our new algorithm takes 4×n symbolic steps.
AU - Chatterjee, Krishnendu
AU - Henzinger, Monika
AU - Joglekar, Manas
AU - Shah, Nisarg
ID - 2831
IS - 3
JF - Formal Methods in System Design
TI - Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
VL - 42
ER -
TY - JOUR
AB - PIN-FORMED (PIN) proteins localize asymmetrically at the plasma membrane and mediate intercellular polar transport of the plant hormone auxin that is crucial for a multitude of developmental processes in plants. PIN localization is under extensive control by environmental or developmental cues, but mechanisms regulating PIN localization are not fully understood. Here we show that early endosomal components ARF GEF BEN1 and newly identified Sec1/Munc18 family protein BEN2 are involved in distinct steps of early endosomal trafficking. BEN1 and BEN2 are collectively required for polar PIN localization, for their dynamic repolarization, and consequently for auxin activity gradient formation and auxin-related developmental processes including embryonic patterning, organogenesis, and vasculature venation patterning. These results show that early endosomal trafficking is crucial for cell polarity and auxin-dependent regulation of plant architecture.
AU - Tanaka, Hirokazu
AU - Kitakura, Saeko
AU - Rakusová, Hana
AU - Uemura, Tomohiro
AU - Feraru, Mugurel
AU - De Rycke, Riet
AU - Robert, Stéphanie
AU - Kakimoto, Tatsuo
AU - Friml, Jirí
ID - 2832
IS - 5
JF - PLoS Genetics
TI - Cell polarity and patterning by PIN trafficking through early endosomal compartments in arabidopsis thaliana
VL - 9
ER -
TY - JOUR
AB - During development, mechanical forces cause changes in size, shape, number, position, and gene expression of cells. They are therefore integral to any morphogenetic processes. Force generation by actin-myosin networks and force transmission through adhesive complexes are two self-organizing phenomena driving tissue morphogenesis. Coordination and integration of forces by long-range force transmission and mechanosensing of cells within tissues produce large-scale tissue shape changes. Extrinsic mechanical forces also control tissue patterning by modulating cell fate specification and differentiation. Thus, the interplay between tissue mechanics and biochemical signaling orchestrates tissue morphogenesis and patterning in development.
AU - Heisenberg, Carl-Philipp J
AU - Bellaïche, Yohanns
ID - 2833
IS - 5
JF - Cell
TI - Forces in tissue morphogenesis and patterning
VL - 153
ER -
TY - JOUR
AB - Although the equations governing fluid flow are well known, there are no analytical expressions that describe the complexity of turbulent motion. A recent proposition is that in analogy to low dimensional chaotic systems, turbulence is organized around unstable solutions of the governing equations which provide the building blocks of the disordered dynamics. We report the discovery of periodic solutions which just like intermittent turbulence are spatially localized and show that turbulent transients arise from one such solution branch.
AU - Avila, Marc
AU - Mellibovsky, Fernando
AU - Roland, Nicolas
AU - Hof, Björn
ID - 2834
IS - 22
JF - Physical Review Letters
TI - Streamwise-localized solutions at the onset of turbulence in pipe flow
VL - 110
ER -
TY - JOUR
AB - The phytohormone auxin regulates virtually every aspect of plant development. To identify new genes involved in auxin activity, a genetic screen was performed for Arabidopsis (Arabidopsis thaliana) mutants with altered expression of the auxin-responsive reporter DR5rev:GFP. One of the mutants recovered in the screen, designated as weak auxin response3 (wxr3), exhibits much lower DR5rev:GFP expression when treated with the synthetic auxin 2,4-dichlorophenoxyacetic acid and displays severe defects in root development. The wxr3 mutant decreases polar auxin transport and results in a disruption of the asymmetric auxin distribution. The levels of the auxin transporters AUXIN1 and PIN-FORMED are dramatically reduced in the wxr3 root tip. Molecular analyses demonstrate that WXR3 is ROOT ULTRAVIOLET B-SENSITIVE1 (RUS1), a member of the conserved Domain of Unknown Function647 protein family found in diverse eukaryotic organisms. Our data suggest that RUS1/WXR3 plays an essential role in the regulation of polar auxin transport by maintaining the proper level of auxin transporters on the plasma membrane.
AU - Yu, Hong
AU - Karampelias, Michael
AU - Robert, Stéphanie
AU - Peer, Wendy
AU - Swarup, Ranjan
AU - Ye, Songqing
AU - Ge, Lei
AU - Cohen, Jerry
AU - Murphy, Angus
AU - Friml, Jirí
AU - Estelle, Mark
ID - 2835
IS - 2
JF - Plant Physiology
TI - Root ultraviolet b-sensitive1/weak auxin response3 is essential for polar auxin transport in arabidopsis
VL - 162
ER -
TY - JOUR
AB - We study the automatic synthesis of fair non-repudiation protocols, a class of fair exchange protocols, used for digital contract signing. First, we show how to specify the objectives of the participating agents and the trusted third party as path formulas in linear temporal logic and prove that the satisfaction of these objectives imply fairness; a property required of fair exchange protocols. We then show that weak (co-operative) co-synthesis and classical (strictly competitive) co-synthesis fail, whereas assume-guarantee synthesis (AGS) succeeds. We demonstrate the success of AGS as follows: (a) any solution of AGS is attack-free; no subset of participants can violate the objectives of the other participants; (b) the Asokan-Shoup-Waidner certified mail protocol that has known vulnerabilities is not a solution of AGS; (c) the Kremer-Markowitch non-repudiation protocol is a solution of AGS; and (d) AGS presents a new and symmetric fair non-repudiation protocol that is attack-free. To our knowledge this is the first application of synthesis to fair non-repudiation protocols, and our results show how synthesis can both automatically discover vulnerabilities in protocols and generate correct protocols. The solution to AGS can be computed efficiently as the secure equilibrium solution of three-player graph games.
AU - Chatterjee, Krishnendu
AU - Raman, Vishwanath
ID - 2836
IS - 4
JF - Formal Aspects of Computing
TI - Assume-guarantee synthesis for digital contract signing
VL - 26
ER -
TY - JOUR
AB - We consider a general class of N × N random matrices whose entries hij are independent up to a symmetry constraint, but not necessarily identically distributed. Our main result is a local semicircle law which improves previous results [17] both in the bulk and at the edge. The error bounds are given in terms of the basic small parameter of the model, maxi,j E|hij|2. As a consequence, we prove the universality of the local n-point correlation functions in the bulk spectrum for a class of matrices whose entries do not have comparable variances, including random band matrices with band width W ≫N1-εn with some εn > 0 and with a negligible mean-field component. In addition, we provide a coherent and pedagogical proof of the local semicircle law, streamlining and strengthening previous arguments from [17, 19, 6].
AU - Erdös, László
AU - Knowles, Antti
AU - Yau, Horng
AU - Yin, Jun
ID - 2837
IS - 59
JF - Electronic Journal of Probability
TI - The local semicircle law for a general class of random matrices
VL - 18
ER -
TY - JOUR
AB - Individuals with Down syndrome (DS) present important motor deficits that derive from altered motor development of infants and young children. DYRK1A, a candidate gene for DS abnormalities has been implicated in motor function due to its expression in motor nuclei in the adult brain, and its overexpression in DS mouse models leads to hyperactivity and altered motor learning. However, its precise role in the adult motor system, or its possible involvement in postnatal locomotor development has not yet been clarified. During the postnatal period we observed time-specific expression of Dyrk1A in discrete subsets of brainstem nuclei and spinal cord motor neurons. Interestingly, we describe for the first time the presence of Dyrk1A in the presynaptic terminal of the neuromuscular junctions and its axonal transport from the facial nucleus, suggesting a function for Dyrk1A in these structures. Relevant to DS, Dyrk1A overexpression in transgenic mice (TgDyrk1A) produces motor developmental alterations possibly contributing to DS motor phenotypes and modifies the numbers of motor cholinergic neurons, suggesting that the kinase may have a role in the development of the brainstem and spinal cord motor system.
AU - Arquè Fuste, Gloria
AU - Casanovas, Anna
AU - Dierssen, Mara
ID - 2838
IS - 1
JF - PLoS One
TI - Dyrk1A is dynamically expressed on subsets of motor neurons and in the neuromuscular junction: Possible role in Down syndrome
VL - 8
ER -
TY - JOUR
AB - Directional guidance of cells via gradients of chemokines is considered crucial for embryonic development, cancer dissemination, and immune responses. Nevertheless, the concept still lacks direct experimental confirmation in vivo. Here, we identify endogenous gradients of the chemokine CCL21 within mouse skin and show that they guide dendritic cells toward lymphatic vessels. Quantitative imaging reveals depots of CCL21 within lymphatic endothelial cells and steeply decaying gradients within the perilymphatic interstitium. These gradients match the migratory patterns of the dendritic cells, which directionally approach vessels from a distance of up to 90-micrometers. Interstitial CCL21 is immobilized to heparan sulfates, and its experimental delocalization or swamping the endogenous gradients abolishes directed migration. These findings functionally establish the concept of haptotaxis, directed migration along immobilized gradients, in tissues.
AU - Weber, Michele
AU - Hauschild, Robert
AU - Schwarz, Jan
AU - Moussion, Christine
AU - De Vries, Ingrid
AU - Legler, Daniel
AU - Luther, Sanjiv
AU - Bollenbach, Mark Tobias
AU - Sixt, Michael K
ID - 2839
IS - 6117
JF - Science
TI - Interstitial dendritic cell guidance by haptotactic chemokine gradients
VL - 339
ER -
TY - JOUR
AB - It is known that the entorhinal cortex plays a crucial role in spatial cognition in rodents. Neuroanatomical and electrophysiological data suggest that there is a functional distinction between 2 subregions within the entorhinal cortex, the medial entorhinal cortex (MEC), and the lateral entorhinal cortex (LEC). Rats with MEC or LEC lesions were trained in 2 navigation tasks requiring allothetic (water maze task) or idiothetic (path integration) information processing and 2-object exploration tasks allowing testing of spatial and nonspatial processing of intramaze objects. MEC lesions mildly affected place navigation in the water maze and produced a path integration deficit. They also altered the processing of spatial information in both exploration tasks while sparing the processing of nonspatial information. LEC lesions did not affect navigation abilities in both the water maze and the path integration tasks. They altered spatial and nonspatial processing in the object exploration task but not in the one-trial recognition task. Overall, these results indicate that the MEC is important for spatial processing and path integration. The LEC has some influence on both spatial and nonspatial processes, suggesting that the 2 kinds of information interact at the level of the EC.
AU - Van Cauter, Tiffany
AU - Camon, Jeremy
AU - Alvernhe, Alice
AU - Elduayen, Coralie
AU - Sargolini, Francesca
AU - Save, Étienne
ID - 2840
IS - 2
JF - Cerebral Cortex
TI - Distinct roles of medial and lateral entorhinal cortex in spatial cognition
VL - 23
ER -
TY - JOUR
AB - In zebrafish early development, blastoderm cells undergo extensive radial intercalations, triggering the spreading of the blastoderm over the yolk cell and thereby initiating embryonic body axis formation. Now reporting in Developmental Cell, Song et al. (2013) demonstrate a critical function for EGF-dependent E-cadherin endocytosis in promoting blastoderm cell intercalations.
AU - Morita, Hitoshi
AU - Heisenberg, Carl-Philipp J
ID - 2841
IS - 6
JF - Developmental Cell
TI - Holding on and letting go: Cadherin turnover in cell intercalation
VL - 24
ER -
TY - JOUR
AB - We outline two approaches to inference of neighbourhood size, N, and dispersal rate, σ2, based on either allele frequencies or on the lengths of sequence blocks that are shared between genomes. Over intermediate timescales (10-100 generations, say), populations that live in two dimensions approach a quasi-equilibrium that is independent of both their local structure and their deeper history. Over such scales, the standardised covariance of allele frequencies (i.e. pairwise FS T) falls with the logarithm of distance, and depends only on neighbourhood size, N, and a 'local scale', κ; the rate of gene flow, σ2, cannot be inferred. We show how spatial correlations can be accounted for, assuming a Gaussian distribution of allele frequencies, giving maximum likelihood estimates of N and κ. Alternatively, inferences can be based on the distribution of the lengths of sequence that are identical between blocks of genomes: long blocks (>0.1 cM, say) tell us about intermediate timescales, over which we assume a quasi-equilibrium. For large neighbourhood size, the distribution of long blocks is given directly by the classical Wright-Malécot formula; this relationship can be used to infer both N and σ2. With small neighbourhood size, there is an appreciable chance that recombinant lineages will coalesce back before escaping into the distant past. For this case, we show that if genomes are sampled from some distance apart, then the distribution of lengths of blocks that are identical in state is geometric, with a mean that depends on N and σ2.
AU - Barton, Nicholas H
AU - Etheridge, Alison
AU - Kelleher, Jerome
AU - Véber, Amandine
ID - 2842
IS - 1
JF - Theoretical Population Biology
TI - Inference in two dimensions: Allele frequencies versus lengths of shared sequence blocks
VL - 87
ER -
TY - CONF
AB - Mathematical objects can be measured unambiguously, but not so objects from our physical world. Even the total length of tubelike shapes has its difficulties. We introduce a combination of geometric, probabilistic, and topological methods to design a stable length estimate for tube-like shapes; that is: one that is insensitive to small shape changes.
AU - Edelsbrunner, Herbert
AU - Pausinger, Florian
ID - 2843
T2 - 17th IAPR International Conference on Discrete Geometry for Computer Imagery
TI - Stable length estimates of tube-like shapes
VL - 7749
ER -
TY - JOUR
AB - As soon as a seed germinates, plant growth relates to gravity to ensure that the root penetrates the soil and the shoot expands aerially. Whereas mechanisms of positive and negative orthogravitropism of primary roots and shoots are relatively well understood [1-3], lateral organs often show more complex growth behavior [4]. Lateral roots (LRs) seemingly suppress positive gravitropic growth and show a defined gravitropic set-point angle (GSA) that allows radial expansion of the root system (plagiotropism) [3, 4]. Despite its eminent importance for root architecture, it so far remains completely unknown how lateral organs partially suppress positive orthogravitropism. Here we show that the phytohormone auxin steers GSA formation and limits positive orthogravitropism in LR. Low and high auxin levels/signaling lead to radial or axial root systems, respectively. At a cellular level, it is the auxin transport-dependent regulation of asymmetric growth in the elongation zone that determines GSA. Our data suggest that strong repression of PIN4/PIN7 and transient PIN3 expression limit auxin redistribution in young LR columella cells. We conclude that PIN activity, by temporally limiting the asymmetric auxin fluxes in the tip of LRs, induces transient, differential growth responses in the elongation zone and, consequently, controls root architecture.
AU - Rosquete, Michel
AU - Von Wangenheim, Daniel
AU - Marhavy, Peter
AU - Barbez, Elke
AU - Stelzer, Ernst
AU - Benková, Eva
AU - Maizel, Alexis
AU - Kleine Vehn, Jürgen
ID - 2844
IS - 9
JF - Current Biology
TI - An auxin transport mechanism restricts positive orthogravitropism in lateral roots
VL - 23
ER -
TY - JOUR
AB - At synapses formed between dissociated neurons, about half of all synaptic vesicles are refractory to evoked release, forming the so-called "resting pool." Here, we use optical measurements of vesicular pH to study developmental changes in pool partitioning and vesicle cycling in cultured hippocampal slices. Two-photon imaging of a genetically encoded two-color release sensor (ratio-sypHy) allowed us to perform calibrated measurements at individual Schaffer collateral boutons. Mature boutons released a large fraction of their vesicles during simulated place field activity, and vesicle retrieval rates were 7-fold higher compared to immature boutons. Saturating stimulation mobilized essentially all vesicles at mature synapses. Resting pool formation and a concomitant reduction in evoked release was induced by chronic depolarization but not by acute inhibition of the protein phosphatase calcineurin. We conclude that synapses in CA1 undergo a prominent refinement of vesicle use during early postnatal development that is not recapitulated in dissociated neuronal culture.
AU - Rose, Tobias
AU - Schönenberger, Philipp
AU - Jezek, Karel
AU - Oertner, Thomas
ID - 2845
IS - 6
JF - Neuron
TI - Developmental refinement of vesicle cycling at Schaffer collateral synapses
VL - 77
ER -
TY - CONF
AB - Depth-Bounded Systems form an expressive class of well-structured transition systems. They can model a wide range of concurrent infinite-state systems including those with dynamic thread creation, dynamically changing communication topology, and complex shared heap structures. We present the first method to automatically prove fair termination of depth-bounded systems. Our method uses a numerical abstraction of the system, which we obtain by systematically augmenting an over-approximation of the system’s reachable states with a finite set of counters. This numerical abstraction can be analyzed with existing termination provers. What makes our approach unique is the way in which it exploits the well-structuredness of the analyzed system. We have implemented our work in a prototype tool and used it to automatically prove liveness properties of complex concurrent systems, including nonblocking algorithms such as Treiber’s stack and several distributed processes. Many of these examples are beyond the scope of termination analyses that are based on traditional counter abstractions.
AU - Bansal, Kshitij
AU - Koskinen, Eric
AU - Wies, Thomas
AU - Zufferey, Damien
ED - Piterman, Nir
ED - Smolka, Scott
ID - 2847
TI - Structural Counter Abstraction
VL - 7795
ER -
TY - JOUR
AB - Recent work emphasizes that the maximum entropy principle provides a bridge between statistical mechanics models for collective behavior in neural networks and experiments on networks of real neurons. Most of this work has focused on capturing the measured correlations among pairs of neurons. Here we suggest an alternative, constructing models that are consistent with the distribution of global network activity, i.e. the probability that K out of N cells in the network generate action potentials in the same small time bin. The inverse problem that we need to solve in constructing the model is analytically tractable, and provides a natural 'thermodynamics' for the network in the limit of large N. We analyze the responses of neurons in a small patch of the retina to naturalistic stimuli, and find that the implied thermodynamics is very close to an unusual critical point, in which the entropy (in proper units) is exactly equal to the energy. © 2013 IOP Publishing Ltd and SISSA Medialab srl.
AU - Tkacik, Gasper
AU - Marre, Olivier
AU - Mora, Thierry
AU - Amodei, Dario
AU - Berry, Michael
AU - Bialek, William
ID - 2850
IS - 3
JF - Journal of Statistical Mechanics Theory and Experiment
TI - The simplest maximum entropy model for collective behavior in a neural network
VL - 2013
ER -
TY - JOUR
AB - The number of possible activity patterns in a population of neurons grows exponentially with the size of the population. Typical experiments explore only a tiny fraction of the large space of possible activity patterns in the case of populations with more than 10 or 20 neurons. It is thus impossible, in this undersampled regime, to estimate the probabilities with which most of the activity patterns occur. As a result, the corresponding entropy - which is a measure of the computational power of the neural population - cannot be estimated directly. We propose a simple scheme for estimating the entropy in the undersampled regime, which bounds its value from both below and above. The lower bound is the usual 'naive' entropy of the experimental frequencies. The upper bound results from a hybrid approximation of the entropy which makes use of the naive estimate, a maximum entropy fit, and a coverage adjustment. We apply our simple scheme to artificial data, in order to check their accuracy; we also compare its performance to those of several previously defined entropy estimators. We then apply it to actual measurements of neural activity in populations with up to 100 cells. Finally, we discuss the similarities and differences between the proposed simple estimation scheme and various earlier methods. © 2013 IOP Publishing Ltd and SISSA Medialab srl.
AU - Berry, Michael
AU - Tkacik, Gasper
AU - Dubuis, Julien
AU - Marre, Olivier
AU - Da Silveira, Ravá
ID - 2851
IS - 3
JF - Journal of Statistical Mechanics Theory and Experiment
TI - A simple method for estimating the entropy of neural activity
VL - 2013
ER -
TY - JOUR
AB - High relatedness among interacting individuals has generally been considered a precondition for the evolution of altruism. However, kin-selection theory also predicts the evolution of altruism when relatedness is low, as long as the cost of the altruistic act is minor compared with its benefit. Here, we demonstrate evidence for a low-cost altruistic act in bacteria. We investigated Escherichia coli responding to the attack of an obligately lytic phage by committing suicide in order to prevent parasite transmission to nearby relatives. We found that bacterial suicide provides large benefits to survivors at marginal costs to committers. The cost of suicide was low, because infected cells are moribund, rapidly dying upon phage infection, such that no more opportunity for reproduction remains. As a consequence of its marginal cost, host suicide was selectively favoured even when relatedness between committers and survivors approached zero. Altogether, our findings demonstrate that low-cost suicide can evolve with ease, represents an effective host-defence strategy, and seems to be widespread among microbes. Moreover, low-cost suicide might also occur in higher organisms as exemplified by infected social insect workers leaving the colony to die in isolation.
AU - Refardt, Dominik
AU - Bergmiller, Tobias
AU - Kümmerli, Rolf
ID - 2853
IS - 1759
JF - Proceedings of the Royal Society of London Series B Biological Sciences
TI - Altruism can evolve when relatedness is low: Evidence from bacteria committing suicide upon phage infection
VL - 280
ER -
TY - JOUR
AB - We consider concurrent games played on graphs. At every round of a game, each player simultaneously and independently selects a move; the moves jointly determine the transition to a successor state. Two basic objectives are the safety objective to stay forever in a given set of states, and its dual, the reachability objective to reach a given set of states. First, we present a simple proof of the fact that in concurrent reachability games, for all ε>0, memoryless ε-optimal strategies exist. A memoryless strategy is independent of the history of plays, and an ε-optimal strategy achieves the objective with probability within ε of the value of the game. In contrast to previous proofs of this fact, our proof is more elementary and more combinatorial. Second, we present a strategy-improvement (a.k.a. policy-iteration) algorithm for concurrent games with reachability objectives. Finally, we present a strategy-improvement algorithm for turn-based stochastic games (where each player selects moves in turns) with safety objectives. Our algorithms yield sequences of player-1 strategies which ensure probabilities of winning that converge monotonically (from below) to the value of the game. © 2012 Elsevier Inc.
AU - Chatterjee, Krishnendu
AU - De Alfaro, Luca
AU - Henzinger, Thomas A
ID - 2854
IS - 5
JF - Journal of Computer and System Sciences
TI - Strategy improvement for concurrent reachability and turn based stochastic safety games
VL - 79
ER -
TY - JOUR
AB - Genomic imprinting leads to preferred expression of either the maternal or paternal alleles of a subset of genes. Imprinting is essential for mammalian development, and its deregulation causes many diseases. However, the functional relevance of imprinting at the cellular level is poorly understood for most imprinted genes. We used mosaic analysis with double markers (MADM) in mice to create uniparental disomies (UPDs) and to visualize imprinting effects with single-cell resolution. Although chromosome 12 UPD did not produce detectable phenotypes, chromosome 7 UPD caused highly significant paternal growth dominance in the liver and lung, but not in the brain or heart. A single gene on chromosome 7, encoding the secreted insulin-like growth factor 2 (IGF2), accounts for most of the paternal dominance effect. Mosaic analyses implied additional imprinted loci on chromosome 7 acting cell autonomously to transmit the IGF2 signal. Our study reveals chromosome- and cell-type specificity of genomic imprinting effects.
AU - Hippenmeyer, Simon
AU - Johnson, Randy
AU - Luo, Liqun
ID - 2855
IS - 3
JF - Cell Reports
TI - Mosaic analysis with double markers reveals cell type specific paternal growth dominance
VL - 3
ER -
TY - JOUR
AB - G protein–coupled receptors (GPCRs), the largest family of membrane signaling proteins, respond to neurotransmitters, hormones and small environmental molecules. The neuronal function of many GPCRs has been difficult to resolve because of an inability to gate them with subtype specificity, spatial precision, speed and reversibility. To address this, we developed an approach for opto-chemical engineering of native GPCRs. We applied this to the metabotropic glutamate receptors (mGluRs) to generate light-agonized and light-antagonized mGluRs (LimGluRs). The light-agonized LimGluR2, on which we focused, was fast, bistable and supported multiple rounds of on/off switching. Light gated two of the primary neuronal functions of mGluR2: suppression of excitability and inhibition of neurotransmitter release. We found that the light-antagonized tool LimGluR2-block was able to manipulate negative feedback of synaptically released glutamate on transmitter release. We generalized the optical control to two additional family members: mGluR3 and mGluR6. This system worked in rodent brain slices and in zebrafish in vivo, where we found that mGluR2 modulated the threshold for escape behavior. These light-gated mGluRs pave the way for determining the roles of mGluRs in synaptic plasticity, memory and disease.
AU - Levitz, Joshua
AU - Pantoja, Carlos
AU - Gaub, Benjamin
AU - Janovjak, Harald L
AU - Reiner, Andreas
AU - Hoagland, Adam
AU - Schoppik, David
AU - Kane, Brian
AU - Stawski, Philipp
AU - Schier, Alexander
AU - Trauner, Dirk
AU - Isacoff, Ehud
ID - 2856
JF - Nature Neuroscience
TI - Optical control of metabotropic glutamate receptors
VL - 16
ER -
TY - JOUR
AB - In the vibrant field of optogenetics, optics and genetic targeting are combined to commandeer cellular functions, such as the neuronal action potential, by optically stimulating light-sensitive ion channels expressed in the cell membrane. One broadly applicable manifestation of this approach are covalently attached photochromic tethered ligands (PTLs) that allow activating ligand-gated ion channels with outstanding spatial and temporal resolution. Here, we describe all steps towards the successful development and application of PTL-gated ion channels in cell lines and primary cells. The basis for these experiments forms a combination of molecular modeling, genetic engineering, cell culture, and electrophysiology. The light-gated glutamate receptor (LiGluR), which consists of the PTL-functionalized GluK2 receptor, serves as a model.
AU - Szobota, Stephanie
AU - Mckenzie, Catherine
AU - Janovjak, Harald L
ID - 2857
JF - Methods in Molecular Biology
TI - Optical control of ligand-gated ion channels
VL - 998
ER -