@article{1426, abstract = {Brood parasites exploit their host in order to increase their own fitness. Typically, this results in an arms race between parasite trickery and host defence. Thus, it is puzzling to observe hosts that accept parasitism without any resistance. The ‘mafia’ hypothesis suggests that these hosts accept parasitism to avoid retaliation. Retaliation has been shown to evolve when the hosts condition their response to mafia parasites, who use depredation as a targeted response to rejection. However, it is unclear if acceptance would also emerge when ‘farming’ parasites are present in the population. Farming parasites use depredation to synchronize the timing with the host, destroying mature clutches to force the host to re-nest. Herein, we develop an evolutionary model to analyse the interaction between depredatory parasites and their hosts. We show that coevolutionary cycles between farmers and mafia can still induce host acceptance of brood parasites. However, this equilibrium is unstable and in the long-run the dynamics of this host–parasite interaction exhibits strong oscillations: when farmers are the majority, accepters conditional to mafia (the host will reject first and only accept after retaliation by the parasite) have a higher fitness than unconditional accepters (the host always accepts parasitism). This leads to an increase in mafia parasites’ fitness and in turn induce an optimal environment for accepter hosts.}, author = {Chakra, Maria and Hilbe, Christian and Traulsen, Arne}, journal = {Royal Society Open Science}, number = {5}, publisher = {Royal Society, The}, title = {{Coevolutionary interactions between farmers and mafia induce host acceptance of avian brood parasites}}, doi = {10.1098/rsos.160036}, volume = {3}, year = {2016}, } @article{1423, abstract = {Direct reciprocity is a mechanism for the evolution of cooperation based on repeated interactions. When individuals meet repeatedly, they can use conditional strategies to enforce cooperative outcomes that would not be feasible in one-shot social dilemmas. Direct reciprocity requires that individuals keep track of their past interactions and find the right response. However, there are natural bounds on strategic complexity: Humans find it difficult to remember past interactions accurately, especially over long timespans. Given these limitations, it is natural to ask how complex strategies need to be for cooperation to evolve. Here, we study stochastic evolutionary game dynamics in finite populations to systematically compare the evolutionary performance of reactive strategies, which only respond to the co-player's previous move, and memory-one strategies, which take into account the own and the co-player's previous move. In both cases, we compare deterministic strategy and stochastic strategy spaces. For reactive strategies and small costs, we find that stochasticity benefits cooperation, because it allows for generous-tit-for-tat. For memory one strategies and small costs, we find that stochasticity does not increase the propensity for cooperation, because the deterministic rule of win-stay, lose-shift works best. For memory one strategies and large costs, however, stochasticity can augment cooperation.}, author = {Baek, Seung and Jeong, Hyeongchai and Hilbe, Christian and Nowak, Martin}, journal = {Scientific Reports}, publisher = {Nature Publishing Group}, title = {{Comparing reactive and memory-one strategies of direct reciprocity}}, doi = {10.1038/srep25676}, volume = {6}, year = {2016}, } @article{1422, abstract = {We study the time-dependent Bogoliubov–de-Gennes equations for generic translation-invariant fermionic many-body systems. For initial states that are close to thermal equilibrium states at temperatures near the critical temperature, we show that the magnitude of the order parameter stays approximately constant in time and, in particular, does not follow a time-dependent Ginzburg–Landau equation, which is often employed as a phenomenological description and predicts a decay of the order parameter in time. The full non-linear structure of the equations is necessary to understand this behavior.}, author = {Frank, Rupert and Hainzl, Christian and Schlein, Benjamin and Seiringer, Robert}, journal = {Letters in Mathematical Physics}, number = {7}, pages = {913 -- 923}, publisher = {Springer}, title = {{Incompatibility of time-dependent Bogoliubov–de-Gennes and Ginzburg–Landau equations}}, doi = {10.1007/s11005-016-0847-5}, volume = {106}, year = {2016}, } @inproceedings{1421, abstract = {Hybridization methods enable the analysis of hybrid automata with complex, nonlinear dynamics through a sound abstraction process. Complex dynamics are converted to simpler ones with added noise, and then analysis is done using a reachability method for the simpler dynamics. Several such recent approaches advocate that only "dynamic" hybridization techniquesi.e., those where the dynamics are abstracted on-The-fly during a reachability computation are effective. In this paper, we demonstrate this is not the case, and create static hybridization methods that are more scalable than earlier approaches. The main insight in our approach is that quick, numeric simulations can be used to guide the process, eliminating the need for an exponential number of hybridization domains. Transitions between domains are generally timetriggered, avoiding accumulated error from geometric intersections. We enhance our static technique by combining time-Triggered transitions with occasional space-Triggered transitions, and demonstrate the benefits of the combined approach in what we call mixed-Triggered hybridization. Finally, error modes are inserted to confirm that the reachable states stay within the hybridized regions. The developed techniques can scale to higher dimensions than previous static approaches, while enabling the parallelization of the main performance bottleneck for many dynamic hybridization approaches: The nonlinear optimization required for sound dynamics abstraction. We implement our method as a model transformation pass in the HYST tool, and perform reachability analysis and evaluation using an unmodified version of SpaceEx on nonlinear models with up to six dimensions.}, author = {Bak, Stanley and Bogomolov, Sergiy and Henzinger, Thomas A and Johnson, Taylor and Prakash, Pradyot}, location = {Vienna, Austria}, pages = {155 -- 164}, publisher = {Springer}, title = {{Scalable static hybridization methods for analysis of nonlinear systems}}, doi = {10.1145/2883817.2883837}, year = {2016}, } @article{1420, abstract = {Selection, mutation, and random drift affect the dynamics of allele frequencies and consequently of quantitative traits. While the macroscopic dynamics of quantitative traits can be measured, the underlying allele frequencies are typically unobserved. Can we understand how the macroscopic observables evolve without following these microscopic processes? This problem has been studied previously by analogy with statistical mechanics: the allele frequency distribution at each time point is approximated by the stationary form, which maximizes entropy. We explore the limitations of this method when mutation is small (4Nμ < 1) so that populations are typically close to fixation, and we extend the theory in this regime to account for changes in mutation strength. We consider a single diallelic locus either under directional selection or with overdominance and then generalize to multiple unlinked biallelic loci with unequal effects. We find that the maximum-entropy approximation is remarkably accurate, even when mutation and selection change rapidly. }, author = {Bod'ová, Katarína and Tkacik, Gasper and Barton, Nicholas H}, journal = {Genetics}, number = {4}, pages = {1523 -- 1548}, publisher = {Genetics Society of America}, title = {{A general approximation for the dynamics of quantitative traits}}, doi = {10.1534/genetics.115.184127}, volume = {202}, year = {2016}, } @article{1429, abstract = {Solitons are localized waves formed by a balance of focusing and defocusing effects. These nonlinear waves exist in diverse forms of matter yet exhibit similar properties including stability, periodic recurrence and particle-like trajectories. One important property is soliton fission, a process by which an energetic higher-order soliton breaks apart due to dispersive or nonlinear perturbations. Here we demonstrate through both experiment and theory that nonlinear photocarrier generation can induce soliton fission. Using near-field measurements, we directly observe the nonlinear spatial and temporal evolution of optical pulses in situ in a nanophotonic semiconductor waveguide. We develop an analytic formalism describing the free-carrier dispersion (FCD) perturbation and show the experiment exceeds the minimum threshold by an order of magnitude. We confirm these observations with a numerical nonlinear Schrödinger equation model. These results provide a fundamental explanation and physical scaling of optical pulse evolution in free-carrier media and could enable improved supercontinuum sources in gas based and integrated semiconductor waveguides.}, author = {Husko, Chad and Wulf, Matthias and Lefrançois, Simon and Combrié, Sylvain and Lehoucq, Gaëlle and De Rossi, Alfredo and Eggleton, Benjamin and Kuipers, Laurens}, journal = {Nature Communications}, publisher = {Nature Publishing Group}, title = {{Free-carrier-induced soliton fission unveiled by in situ measurements in nanophotonic waveguides}}, doi = {10.1038/ncomms11332}, volume = {7}, year = {2016}, } @article{1431, abstract = {The rare socially parasitic butterfly Maculinea alcon occurs in two forms, which are characteristic of hygric or xeric habitats and which exploit different host plants and host ants. The status of these two forms has been the subject of considerable controversy. Populations of the two forms are usually spatially distinct, but at Răscruci in Romania both forms occur on the same site (syntopically). We examined the genetic differentiation between the two forms using eight microsatellite markers, and compared with a nearby hygric site, Şardu. Our results showed that while the two forms are strongly differentiated at Răscruci, it is the xeric form there that is most similar to the hygric form at Şardu, and Bayesian clustering algorithms suggest that these two populations have exchanged genes relatively recently. We found strong evidence for population substructuring, caused by high within host ant nest relatedness, indicating very limited dispersal of most ovipositing females, but not association with particular host ant species. Our results are consistent with the results of larger scale phylogeographic studies that suggest that the two forms represent local ecotypes specialising on different host plants, each with a distinct flowering phenology, providing a temporal rather than spatial barrier to gene flow.}, author = {Tartally, András and Kelager, Andreas and Fürst, Matthias and Nash, David}, journal = {PeerJ}, number = {3}, publisher = {PeerJ}, title = {{Host plant use drives genetic differentiation in syntopic populations of Maculinea alcon}}, doi = {10.7717/peerj.1865}, volume = {2016}, year = {2016}, } @article{1434, abstract = {We prove that the system of subordination equations, defining the free additive convolution of two probability measures, is stable away from the edges of the support and blow-up singularities by showing that the recent smoothness condition of Kargin is always satisfied. As an application, we consider the local spectral statistics of the random matrix ensemble A+UBU⁎A+UBU⁎, where U is a Haar distributed random unitary or orthogonal matrix, and A and B are deterministic matrices. In the bulk regime, we prove that the empirical spectral distribution of A+UBU⁎A+UBU⁎ concentrates around the free additive convolution of the spectral distributions of A and B on scales down to N−2/3N−2/3.}, author = {Bao, Zhigang and Erdös, László and Schnelli, Kevin}, journal = {Journal of Functional Analysis}, number = {3}, pages = {672 -- 719}, publisher = {Academic Press}, title = {{Local stability of the free additive convolution}}, doi = {10.1016/j.jfa.2016.04.006}, volume = {271}, year = {2016}, } @article{1436, abstract = {We study the time evolution of a system of N spinless fermions in R3 which interact through a pair potential, e.g., the Coulomb potential. We compare the dynamics given by the solution to Schrödinger's equation with the time-dependent Hartree-Fock approximation, and we give an estimate for the accuracy of this approximation in terms of the kinetic energy of the system. This leads, in turn, to bounds in terms of the initial total energy of the system.}, author = {Bach, Volker and Breteaux, Sébastien and Petrat, Sören P and Pickl, Peter and Tzaneteas, Tim}, journal = {Journal de Mathématiques Pures et Appliquées}, number = {1}, pages = {1 -- 30}, publisher = {Elsevier}, title = {{Kinetic energy estimates for the accuracy of the time-dependent Hartree-Fock approximation with Coulomb interaction}}, doi = {10.1016/j.matpur.2015.09.003}, volume = {105}, year = {2016}, } @article{1435, abstract = {ATP released from neurons and astrocytes during neuronal activity or under pathophysiological circumstances is able to influence information flow in neuronal circuits by activation of ionotropic P2X and metabotropic P2Y receptors and subsequent modulation of cellular excitability, synaptic strength, and plasticity. In the present paper we review cellular and network effects of P2Y receptors in the brain. We show that P2Y receptors inhibit the release of neurotransmitters, modulate voltage- and ligand-gated ion channels, and differentially influence the induction of synaptic plasticity in the prefrontal cortex, hippocampus, and cerebellum. The findings discussed here may explain how P2Y1 receptor activation during brain injury, hypoxia, inflammation, schizophrenia, or Alzheimer's disease leads to an impairment of cognitive processes. Hence, it is suggested that the blockade of P2Y1 receptors may have therapeutic potential against cognitive disturbances in these states.}, author = {Guzmán, José and Gerevich, Zoltan}, journal = {Neural Plasticity}, publisher = {Hindawi Publishing Corporation}, title = {{P2Y receptors in synaptic transmission and plasticity: Therapeutic potential in cognitive dysfunction}}, doi = {10.1155/2016/1207393}, volume = {2016}, year = {2016}, } @inproceedings{1439, abstract = {Fault-tolerant distributed algorithms play an important role in many critical/high-availability applications. These algorithms are notoriously difficult to implement correctly, due to asynchronous communication and the occurrence of faults, such as the network dropping messages or computers crashing. We introduce PSYNC, a domain specific language based on the Heard-Of model, which views asynchronous faulty systems as synchronous ones with an adversarial environment that simulates asynchrony and faults by dropping messages. We define a runtime system for PSYNC that efficiently executes on asynchronous networks. We formalize the relation between the runtime system and PSYNC in terms of observational refinement. The high-level lockstep abstraction introduced by PSYNC simplifies the design and implementation of fault-tolerant distributed algorithms and enables automated formal verification. We have implemented an embedding of PSYNC in the SCALA programming language with a runtime system for asynchronous networks. We show the applicability of PSYNC by implementing several important fault-tolerant distributed algorithms and we compare the implementation of consensus algorithms in PSYNC against implementations in other languages in terms of code size, runtime efficiency, and verification.}, author = {Dragoi, Cezara and Henzinger, Thomas A and Zufferey, Damien}, location = {St. Petersburg, FL, USA}, pages = {400 -- 415}, publisher = {ACM}, title = {{PSYNC: A partially synchronous language for fault-tolerant distributed algorithms}}, doi = {10.1145/2837614.2837650}, volume = {20-22}, year = {2016}, } @article{1440, author = {Janovjak, Harald L}, journal = {Structure}, number = {2}, pages = {213 -- 215}, publisher = {Cell Press}, title = {{Light at the end of the protein: Crystal structure of a C-terminal light-sensing domain}}, doi = {10.1016/j.str.2016.01.002}, volume = {24}, year = {2016}, } @article{1446, abstract = {The accuracy of interdisciplinarity measurements is directly related to the quality of the underlying bibliographic data. Existing indicators of interdisciplinarity are not capable of reflecting the inaccuracies introduced by incorrect and incomplete records because correct and complete bibliographic data can rarely be obtained. This is the case for the Rao–Stirling index, which cannot handle references that are not categorized into disciplinary fields. We introduce a method that addresses this problem. It extends the Rao–Stirling index to acknowledge missing data by calculating its interval of uncertainty using computational optimization. The evaluation of our method indicates that the uncertainty interval is not only useful for estimating the inaccuracy of interdisciplinarity measurements, but it also delivers slightly more accurate aggregated interdisciplinarity measurements than the Rao–Stirling index.}, author = {Calatrava Moreno, Maria and Auzinger, Thomas and Werthner, Hannes}, journal = {Scientometrics}, number = {1}, pages = {213 -- 232}, publisher = {Springer}, title = {{On the uncertainty of interdisciplinarity measurements due to incomplete bibliographic data}}, doi = {10.1007/s11192-016-1842-4}, volume = {107}, year = {2016}, } @article{1448, abstract = {We develop a new and systematic method for proving entropic Ricci curvature lower bounds for Markov chains on discrete sets. Using different methods, such bounds have recently been obtained in several examples (e.g., 1-dimensional birth and death chains, product chains, Bernoulli–Laplace models, and random transposition models). However, a general method to obtain discrete Ricci bounds had been lacking. Our method covers all of the examples above. In addition we obtain new Ricci curvature bounds for zero-range processes on the complete graph. The method is inspired by recent work of Caputo, Dai Pra and Posta on discrete functional inequalities.}, author = {Fathi, Max and Maas, Jan}, journal = {The Annals of Applied Probability}, number = {3}, pages = {1774 -- 1806}, publisher = {Institute of Mathematical Statistics}, title = {{Entropic Ricci curvature bounds for discrete interacting systems}}, doi = {10.1214/15-AAP1133}, volume = {26}, year = {2016}, } @article{1476, abstract = {The dynamic assembly and disassembly of actin filaments is essential for the formation and transport of vesicles during endocytosis. In yeast, two types of actin structures, namely cortical patches and cytoplasmic cables, play a direct role in endocytosis, but how their interaction is regulated remains unclear. Here, we show that Srv2/CAP, an evolutionarily conserved actin regulator, is required for efficient endocytosis owing to its role in the formation of the actin patches that aid initial vesicle invagination and of the actin cables that these move along. Deletion of the SRV2 gene resulted in the appearance of aberrant fragmented actin cables that frequently moved past actin patches, the sites of endocytosis. We find that the C-terminal CARP domain of Srv2p is vitally important for the proper assembly of actin patches and cables; we also demonstrate that the N-terminal helical folded domain of Srv2 is required for its localization to actin patches, specifically to the ADP-actin rich region through an interaction with cofilin. These results demonstrate the in vivo roles of Srv2p in the regulation of the actin cytoskeleton during clathrin-mediated endocytosis}, author = {Toshima, Junko and Horikomi, Chika and Okada, Asuka and Hatori, Makiko and Nagano, Makoto and Masuda, Atsushi and Yamamoto, Wataru and Siekhaus, Daria E and Toshima, Jiro}, journal = {Journal of Cell Science}, number = {2}, pages = {367 -- 379}, publisher = {Company of Biologists}, title = {{Srv2/CAP is required for polarized actin cable assembly and patch internalization during clathrin-mediated endocytosis}}, doi = {10.1242/jcs.176651}, volume = {129}, year = {2016}, } @article{1475, abstract = {The actin cytoskeleton plays important roles in the formation and internalization of endocytic vesicles. In yeast, endocytic vesicles move towards early endosomes along actin cables, however, the molecular machinery regulating interaction between endocytic vesicles and actin cables is poorly understood. The Eps15-like protein Pan1p plays a key role in actin-mediated endocytosis and is negatively regulated by Ark1 and Prk1 kinases. Here we show that pan1 mutated to prevent phosphorylation at all 18 threonines, pan1-18TA, displayed almost the same endocytic defect as ark1Δ prk1Δ cells, and contained abnormal actin concentrations including several endocytic compartments. Early endosomes were highly localized in the actin concentrations and displayed movement along actin cables. The dephosphorylated form of Pan1p also caused stable associations between endocytic vesicles and actin cables, and between endocytic vesicles and endosomes. Thus Pan1 phosphorylation is part of a novel mechanism that regulates endocytic compartment interactions with each other and with actin cables.}, author = {Toshima, Junko and Furuya, Eri and Nagano, Makoto and Kanno, Chisa and Sakamoto, Yuta and Ebihara, Masashi and Siekhaus, Daria E and Toshima, Jiro}, journal = {eLife}, number = {February 2016}, publisher = {eLife Sciences Publications}, title = {{Yeast Eps15-like endocytic protein Pan1p regulates the interaction between endocytic vesicles, endosomes and the actin cytoskeleton}}, doi = {10.7554/eLife.10276}, volume = {5}, year = {2016}, } @article{1478, abstract = {We consider the Tonks-Girardeau gas subject to a random external potential. If the disorder is such that the underlying one-particle Hamiltonian displays localization (which is known to be generically the case), we show that there is exponential decay of correlations in the many-body eigenstates. Moreover, there is no Bose-Einstein condensation and no superfluidity, even at zero temperature.}, author = {Seiringer, Robert and Warzel, Simone}, journal = {New Journal of Physics}, number = {3}, publisher = {IOP Publishing Ltd.}, title = {{Decay of correlations and absence of superfluidity in the disordered Tonks-Girardeau gas}}, doi = {10.1088/1367-2630/18/3/035002}, volume = {18}, year = {2016}, } @article{1480, abstract = {Exponential varieties arise from exponential families in statistics. These real algebraic varieties have strong positivity and convexity properties, familiar from toric varieties and their moment maps. Among them are varieties of inverses of symmetric matrices satisfying linear constraints. This class includes Gaussian graphical models. We develop a general theory of exponential varieties. These are derived from hyperbolic polynomials and their integral representations. We compare the multidegrees and ML degrees of the gradient map for hyperbolic polynomials. }, author = {Michałek, Mateusz and Sturmfels, Bernd and Uhler, Caroline and Zwiernik, Piotr}, journal = {Proceedings of the London Mathematical Society}, number = {1}, pages = {27 -- 56}, publisher = {Oxford University Press}, title = {{Exponential varieties}}, doi = {10.1112/plms/pdv066}, volume = {112}, year = {2016}, } @article{1487, abstract = {Rhythms with time scales of multiple cycles per second permeate the mammalian brain, yet neuroscientists are not certain of their functional roles. One leading idea is that coherent oscillation between two brain regions facilitates the exchange of information between them. In rats, the hippocampus and the vibrissal sensorimotor system both are characterized by rhythmic oscillation in the theta range, 5–12 Hz. Previous work has been divided as to whether the two rhythms are independent or coherent. To resolve this question, we acquired three measures from rats—whisker motion, hippocampal local field potential (LFP), and barrel cortex unit firing—during a whisker-mediated texture discrimination task and during control conditions (not engaged in a whisker-mediated memory task). Compared to control conditions, the theta band of hippocampal LFP showed a marked increase in power as the rats approached and then palpated the texture. Phase synchronization between whisking and hippocampal LFP increased by almost 50% during approach and texture palpation. In addition, a greater proportion of barrel cortex neurons showed firing that was phase-locked to hippocampal theta while rats were engaged in the discrimination task. Consistent with a behavioral consequence of phase synchronization, the rats identified the texture more rapidly and with lower error likelihood on trials in which there was an increase in theta-whisking coherence at the moment of texture palpation. These results suggest that coherence between the whisking rhythm, barrel cortex firing, and hippocampal LFP is augmented selectively during epochs in which the rat collects sensory information and that such coherence enhances the efficiency of integration of stimulus information into memory and decision-making centers.}, author = {Grion, Natalia and Akrami, Athena and Zuo, Yangfang and Stella, Federico and Diamond, Mathew}, journal = {PLoS Biology}, number = {2}, publisher = {Public Library of Science}, title = {{Coherence between rat sensorimotor system and hippocampus is enhanced during tactile discrimination}}, doi = {10.1371/journal.pbio.1002384}, volume = {14}, year = {2016}, } @article{1482, abstract = {Plants have the ability to continously generate new organs by maintaining populations of stem cells throught their lives. The shoot apical meristem (SAM) provides a stable environment for the maintenance of stem cells. All cells inside the SAM divide, yet boundaries and patterns are maintained. Experimental evidence indicates that patterning is independent of cell lineage, thus a dynamic self-regulatory mechanism is required. A pivotal role in the organization of the SAM is played by the WUSCHEL gene (WUS). An important question in this regard is that how WUS expression is positioned in the SAM via a cell-lineage independent signaling mechanism. In this study we demonstrate via mathematical modeling that a combination of an inhibitor of the Cytokinin (CK) receptor, Arabidopsis histidine kinase 4 (AHK4) and two morphogens originating from the top cell layer, can plausibly account for the cell lineage-independent centering of WUS expression within SAM. Furthermore, our laser ablation and microsurgical experiments support the hypothesis that patterning in SAM occurs at the level of CK reception and signaling. The model suggests that the interplay between CK signaling, WUS/CLV feedback loop and boundary signals can account for positioning of the WUS expression, and provides directions for further experimental investigation.}, author = {Adibi, Milad and Yoshida, Saiko and Weijers, Dolf and Fleck, Christian}, journal = {PLoS One}, number = {2}, publisher = {Public Library of Science}, title = {{Centering the organizing center in the Arabidopsis thaliana shoot apical meristem by a combination of cytokinin signaling and self-organization}}, doi = {10.1371/journal.pone.0147830}, volume = {11}, year = {2016}, } @article{1484, author = {Chen, Xu and Wu, Shuang and Liu, Zengyu and Friml, Jiřĺ}, journal = {Trends in Cell Biology}, number = {6}, pages = {409 -- 419}, publisher = {Cell Press}, title = {{Environmental and endogenous control of cortical microtubule orientation}}, doi = {10.1016/j.tcb.2016.02.003}, volume = {26}, year = {2016}, } @article{1485, abstract = {In this article the notion of metabolic turnover is revisited in the light of recent results of out-of-equilibrium thermodynamics. By means of Monte Carlo methods we perform an exact sampling of the enzymatic fluxes in a genome scale metabolic network of E. Coli in stationary growth conditions from which we infer the metabolites turnover times. However the latter are inferred from net fluxes, and we argue that this approximation is not valid for enzymes working nearby thermodynamic equilibrium. We recalculate turnover times from total fluxes by performing an energy balance analysis of the network and recurring to the fluctuation theorem. We find in many cases values one of order of magnitude lower, implying a faster picture of intermediate metabolism.}, author = {De Martino, Daniele}, journal = {Physical Biology}, number = {1}, publisher = {IOP Publishing Ltd.}, title = {{Genome-scale estimate of the metabolic turnover of E. Coli from the energy balance analysis}}, doi = {10.1088/1478-3975/13/1/016003}, volume = {13}, year = {2016}, } @article{1486, abstract = {We review recent results concerning the mathematical properties of the Bardeen-Cooper-Schrieffer (BCS) functional of superconductivity, which were obtained in a series of papers, partly in collaboration with R. Frank, E. Hamza, S. Naboko, and J. P. Solovej. Our discussion includes, in particular, an investigation of the critical temperature for a general class of interaction potentials, as well as a study of its dependence on external fields. We shall explain how the Ginzburg-Landau model can be derived from the BCS theory in a suitable parameter regime.}, author = {Hainzl, Christian and Seiringer, Robert}, journal = {Journal of Mathematical Physics}, number = {2}, publisher = {American Institute of Physics}, title = {{The Bardeen–Cooper–Schrieffer functional of superconductivity and its mathematical properties}}, doi = {10.1063/1.4941723}, volume = {57}, year = {2016}, } @article{1488, abstract = {Branching morphogenesis of the epithelial ureteric bud forms the renal collecting duct system and is critical for normal nephron number, while low nephron number is implicated in hypertension and renal disease. Ureteric bud growth and branching requires GDNF signaling from the surrounding mesenchyme to cells at the ureteric bud tips, via the Ret receptor tyrosine kinase and coreceptor Gfrα1; Ret signaling up-regulates transcription factors Etv4 and Etv5, which are also critical for branching. Despite extensive knowledge of the genetic control of these events, it is not understood, at the cellular level, how renal branching morphogenesis is achieved or how Ret signaling influences epithelial cell behaviors to promote this process. Analysis of chimeric embryos previously suggested a role for Ret signaling in promoting cell rearrangements in the nephric duct, but this method was unsuited to study individual cell behaviors during ureteric bud branching. Here, we use Mosaic Analysis with Double Markers (MADM), combined with organ culture and time-lapse imaging, to trace the movements and divisions of individual ureteric bud tip cells. We first examine wild-type clones and then Ret or Etv4 mutant/wild-type clones in which the mutant and wild-type sister cells are differentially and heritably marked by green and red fluorescent proteins. We find that, in normal kidneys, most individual tip cells behave as self-renewing progenitors, some of whose progeny remain at the tips while others populate the growing UB trunks. In Ret or Etv4 MADM clones, the wild-type cells generated at a UB tip are much more likely to remain at, or move to, the new tips during branching and elongation, while their Ret−/− or Etv4−/− sister cells tend to lag behind and contribute only to the trunks. By tracking successive mitoses in a cell lineage, we find that Ret signaling has little effect on proliferation, in contrast to its effects on cell movement. Our results show that Ret/Etv4 signaling promotes directed cell movements in the ureteric bud tips, and suggest a model in which these cell movements mediate branching morphogenesis.}, author = {Riccio, Paul and Cebrián, Cristina and Zong, Hui and Hippenmeyer, Simon and Costantini, Frank}, journal = {PLoS Biology}, number = {2}, publisher = {Public Library of Science}, title = {{Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis}}, doi = {10.1371/journal.pbio.1002382}, volume = {14}, year = {2016}, } @article{1489, abstract = {We prove optimal local law, bulk universality and non-trivial decay for the off-diagonal elements of the resolvent for a class of translation invariant Gaussian random matrix ensembles with correlated entries. }, author = {Ajanki, Oskari H and Erdös, László and Krüger, Torben H}, journal = {Journal of Statistical Physics}, number = {2}, pages = {280 -- 302}, publisher = {Springer}, title = {{Local spectral statistics of Gaussian matrices with correlated entries}}, doi = {10.1007/s10955-016-1479-y}, volume = {163}, year = {2016}, } @article{1490, abstract = {To induce adaptive immunity, dendritic cells (DCs) migrate through afferent lymphatic vessels (LVs) to draining lymph nodes (dLNs). This process occurs in several consecutive steps. Upon entry into lymphatic capillaries, DCs first actively crawl into downstream collecting vessels. From there, they are next passively and rapidly transported to the dLN by lymph flow. Here, we describe a role for the chemokine CCL21 in intralymphatic DC crawling. Performing time-lapse imaging in murine skin, we found that blockade of CCL21-but not the absence of lymph flow-completely abolished DC migration from capillaries toward collecting vessels and reduced the ability of intralymphatic DCs to emigrate from skin. Moreover, we found that in vitro low laminar flow established a CCL21 gradient along lymphatic endothelial monolayers, thereby inducing downstream-directed DC migration. These findings reveal a role for intralymphatic CCL21 in promoting DC trafficking to dLNs, through the formation of a flow-induced gradient.}, author = {Russo, Erica and Teijeira, Alvaro and Vaahtomeri, Kari and Willrodt, Ann and Bloch, Joël and Nitschké, Maximilian and Santambrogio, Laura and Kerjaschki, Dontscho and Sixt, Michael K and Halin, Cornelia}, journal = {Cell Reports}, number = {7}, pages = {1723 -- 1734}, publisher = {Cell Press}, title = {{Intralymphatic CCL21 promotes tissue egress of dendritic cells through afferent lymphatic vessels}}, doi = {10.1016/j.celrep.2016.01.048}, volume = {14}, year = {2016}, } @article{1493, abstract = {We introduce a new method for deriving the time-dependent Hartree or Hartree-Fock equations as an effective mean-field dynamics from the microscopic Schrödinger equation for fermionic many-particle systems in quantum mechanics. The method is an adaption of the method used in Pickl (Lett. Math. Phys. 97 (2) 151–164 2011) for bosonic systems to fermionic systems. It is based on a Gronwall type estimate for a suitable measure of distance between the microscopic solution and an antisymmetrized product state. We use this method to treat a new mean-field limit for fermions with long-range interactions in a large volume. Some of our results hold for singular attractive or repulsive interactions. We can also treat Coulomb interaction assuming either a mild singularity cutoff or certain regularity conditions on the solutions to the Hartree(-Fock) equations. In the considered limit, the kinetic and interaction energy are of the same order, while the average force is subleading. For some interactions, we prove that the Hartree(-Fock) dynamics is a more accurate approximation than a simpler dynamics that one would expect from the subleading force. With our method we also treat the mean-field limit coupled to a semiclassical limit, which was discussed in the literature before, and we recover some of the previous results. All results hold for initial data close (but not necessarily equal) to antisymmetrized product states and we always provide explicit rates of convergence.}, author = {Petrat, Sören P and Pickl, Peter}, journal = {Mathematical Physics, Analysis and Geometry}, number = {1}, publisher = {Springer}, title = {{A new method and a new scaling for deriving fermionic mean-field dynamics}}, doi = {10.1007/s11040-016-9204-2}, volume = {19}, year = {2016}, } @article{1492, abstract = {To sustain a lifelong ability to initiate organs, plants retain pools of undifferentiated cells with a preserved prolif eration capacity. The root pericycle represents a unique tissue with conditional meristematic activity, and its tight control determines initiation of lateral organs. Here we show that the meristematic activity of the pericycle is constrained by the interaction with the adjacent endodermis. Release of these restraints by elimination of endo dermal cells by single-cell ablation triggers the pericycle to re-enter the cell cycle. We found that endodermis removal substitutes for the phytohormone auxin-dependent initiation of the pericycle meristematic activity. However, auxin is indispensable to steer the cell division plane orientation of new organ-defining divisions. We propose a dual, spatiotemporally distinct role for auxin during lateral root initiation. In the endodermis, auxin releases constraints arising from cell-to-cell interactions that compromise the pericycle meristematic activity, whereas, in the pericycle, auxin defines the orientation of the cell division plane to initiate lateral roots.}, author = {Marhavy, Peter and Montesinos López, Juan C and Abuzeineh, Anas and Van Damme, Daniël and Vermeer, Joop and Duclercq, Jérôme and Rakusova, Hana and Marhavá, Petra and Friml, Jirí and Geldner, Niko and Benková, Eva}, journal = {Genes and Development}, number = {4}, pages = {471 -- 483}, publisher = {Cold Spring Harbor Laboratory Press}, title = {{Targeted cell elimination reveals an auxin-guided biphasic mode of lateral root initiation}}, doi = {10.1101/gad.276964.115}, volume = {30}, year = {2016}, } @article{1496, abstract = {The two-photon 1s2 2s 2p 3P0 1s22s2 1S0 transition in berylliumlike ions is theoretically investigated within a fully relativistic framework and a second-order perturbation theory. We focus our analysis on how electron correlation, as well as the negative-energy spectrum, can affect the forbidden E1M1 decay rate. For this purpose, we include the electronic correlation via an effective local potential and within a single configuration-state model. Due to its experimental interest, evaluations of decay rates are performed for berylliumlike xenon and uranium. We find that the negative-energy contribution can be neglected at the present level of accuracy in the evaluation of the decay rate. On the other hand, if contributions of electronic correlation are not carefully taken into account, it may change the lifetime of the metastable state by up to 20%. By performing a full-relativistic jj-coupling calculation, we found a decrease of the decay rate by two orders of magnitude compared to non-relativistic LS-coupling calculations, for the selected heavy ions.}, author = {Amaro, Pedro and Fratini, Filippo and Safari, Laleh and Machado, Jorge and Guerra, Mauro and Indelicato, Paul and Santos, José}, journal = {Physical Review A - Atomic, Molecular, and Optical Physics}, number = {3}, publisher = {American Physical Society}, title = {{Relativistic evaluation of the two-photon decay of the metastable 1s22s2p3P0 state in berylliumlike ions with an effective-potential model}}, doi = {10.1103/PhysRevA.93.032502}, volume = {93}, year = {2016}, } @article{1494, abstract = {Turbulence is one of the most frequently encountered non-equilibrium phenomena in nature, yet characterizing the transition that gives rise to turbulence in basic shear flows has remained an elusive task. Although, in recent studies, critical points marking the onset of sustained turbulence have been determined for several such flows, the physical nature of the transition could not be fully explained. In extensive experimental and computational studies we show for the example of Couette flow that the onset of turbulence is a second-order phase transition and falls into the directed percolation universality class. Consequently, the complex laminar–turbulent patterns distinctive for the onset of turbulence in shear flows result from short-range interactions of turbulent domains and are characterized by universal critical exponents. More generally, our study demonstrates that even high-dimensional systems far from equilibrium such as turbulence exhibit universality at onset and that here the collective dynamics obeys simple rules.}, author = {Lemoult, Grégoire M and Shi, Liang and Avila, Kerstin and Jalikop, Shreyas V and Avila, Marc and Hof, Björn}, journal = {Nature Physics}, number = {3}, pages = {254 -- 258}, publisher = {Nature Publishing Group}, title = {{Directed percolation phase transition to sustained turbulence in Couette flow}}, doi = {10.1038/nphys3675}, volume = {12}, year = {2016}, } @article{1491, abstract = {We study the ground state of a trapped Bose gas, starting from the full many-body Schrödinger Hamiltonian, and derive the non-linear Schrödinger energy functional in the limit of a large particle number, when the interaction potential converges slowly to a Dirac delta function. Our method is based on quantitative estimates on the discrepancy between the full many-body energy and its mean-field approximation using Hartree states. These are proved using finite dimensional localization and a quantitative version of the quantum de Finetti theorem. Our approach covers the case of attractive interactions in the regime of stability. In particular, our main new result is a derivation of the 2D attractive non-linear Schrödinger ground state.}, author = {Lewin, Mathieu and Nam, Phan and Rougerie, Nicolas}, journal = {Transactions of the American Mathematical Society}, number = {9}, pages = {6131 -- 6157}, publisher = {American Mathematical Society}, title = {{The mean-field approximation and the non-linear Schrödinger functional for trapped Bose gases}}, doi = {10.1090/tran/6537}, volume = {368}, year = {2016}, } @article{1408, abstract = {The concept of well group in a special but important case captures homological properties of the zero set of a continuous map (Formula presented.) on a compact space K that are invariant with respect to perturbations of f. The perturbations are arbitrary continuous maps within (Formula presented.) distance r from f for a given (Formula presented.). The main drawback of the approach is that the computability of well groups was shown only when (Formula presented.) or (Formula presented.). Our contribution to the theory of well groups is twofold: on the one hand we improve on the computability issue, but on the other hand we present a range of examples where the well groups are incomplete invariants, that is, fail to capture certain important robust properties of the zero set. For the first part, we identify a computable subgroup of the well group that is obtained by cap product with the pullback of the orientation of (Formula presented.) by f. In other words, well groups can be algorithmically approximated from below. When f is smooth and (Formula presented.), our approximation of the (Formula presented.)th well group is exact. For the second part, we find examples of maps (Formula presented.) with all well groups isomorphic but whose perturbations have different zero sets. We discuss on a possible replacement of the well groups of vector valued maps by an invariant of a better descriptive power and computability status.}, author = {Franek, Peter and Krcál, Marek}, journal = {Discrete & Computational Geometry}, number = {1}, pages = {126 -- 164}, publisher = {Springer}, title = {{On computability and triviality of well groups}}, doi = {10.1007/s00454-016-9794-2}, volume = {56}, year = {2016}, } @article{1518, abstract = {The inference of demographic history from genome data is hindered by a lack of efficient computational approaches. In particular, it has proved difficult to exploit the information contained in the distribution of genealogies across the genome. We have previously shown that the generating function (GF) of genealogies can be used to analytically compute likelihoods of demographic models from configurations of mutations in short sequence blocks (Lohse et al. 2011). Although the GF has a simple, recursive form, the size of such likelihood calculations explodes quickly with the number of individuals and applications of this framework have so far been mainly limited to small samples (pairs and triplets) for which the GF can be written by hand. Here we investigate several strategies for exploiting the inherent symmetries of the coalescent. In particular, we show that the GF of genealogies can be decomposed into a set of equivalence classes that allows likelihood calculations from nontrivial samples. Using this strategy, we automated blockwise likelihood calculations for a general set of demographic scenarios in Mathematica. These histories may involve population size changes, continuous migration, discrete divergence, and admixture between multiple populations. To give a concrete example, we calculate the likelihood for a model of isolation with migration (IM), assuming two diploid samples without phase and outgroup information. We demonstrate the new inference scheme with an analysis of two individual butterfly genomes from the sister species Heliconius melpomene rosina and H. cydno.}, author = {Lohse, Konrad and Chmelik, Martin and Martin, Simon and Barton, Nicholas H}, journal = {Genetics}, number = {2}, pages = {775 -- 786}, publisher = {Genetics Society of America}, title = {{Efficient strategies for calculating blockwise likelihoods under the coalescent}}, doi = {10.1534/genetics.115.183814}, volume = {202}, year = {2016}, } @inproceedings{1524, abstract = {When designing genetic circuits, the typical primitives used in major existing modelling formalisms are gene interaction graphs, where edges between genes denote either an activation or inhibition relation. However, when designing experiments, it is important to be precise about the low-level mechanistic details as to how each such relation is implemented. The rule-based modelling language Kappa allows to unambiguously specify mechanistic details such as DNA binding sites, dimerisation of transcription factors, or co-operative interactions. Such a detailed description comes with complexity and computationally costly executions. We propose a general method for automatically transforming a rule-based program, by eliminating intermediate species and adjusting the rate constants accordingly. To the best of our knowledge, we show the first automated reduction of rule-based models based on equilibrium approximations. Our algorithm is an adaptation of an existing algorithm, which was designed for reducing reaction-based programs; our version of the algorithm scans the rule-based Kappa model in search for those interaction patterns known to be amenable to equilibrium approximations (e.g. Michaelis-Menten scheme). Additional checks are then performed in order to verify if the reduction is meaningful in the context of the full model. The reduced model is efficiently obtained by static inspection over the rule-set. The tool is tested on a detailed rule-based model of a λ-phage switch, which lists 92 rules and 13 agents. The reduced model has 11 rules and 5 agents, and provides a dramatic reduction in simulation time of several orders of magnitude.}, author = {Beica, Andreea and Guet, Calin C and Petrov, Tatjana}, location = {Madrid, Spain}, pages = {173 -- 191}, publisher = {Springer}, title = {{Efficient reduction of kappa models by static inspection of the rule-set}}, doi = {10.1007/978-3-319-26916-0_10}, volume = {9271}, year = {2016}, } @article{1521, abstract = {Complex I (NADH:ubiquinone oxidoreductase) plays a central role in cellular energy production, coupling electron transfer between NADH and quinone to proton translocation. It is the largest protein assembly of respiratory chains and one of the most elaborate redox membrane proteins known. Bacterial enzyme is about half the size of mitochondrial and thus provides its important "minimal" model. Dysfunction of mitochondrial complex I is implicated in many human neurodegenerative diseases. The L-shaped complex consists of a hydrophilic arm, where electron transfer occurs, and a membrane arm, where proton translocation takes place. We have solved the crystal structures of the hydrophilic domain of complex I from Thermus thermophilus, the membrane domain from Escherichia coli and recently of the intact, entire complex I from T. thermophilus (536. kDa, 16 subunits, 9 iron-sulphur clusters, 64 transmembrane helices). The 95. Å long electron transfer pathway through the enzyme proceeds from the primary electron acceptor flavin mononucleotide through seven conserved Fe-S clusters to the unusual elongated quinone-binding site at the interface with the membrane domain. Four putative proton translocation channels are found in the membrane domain, all linked by the central flexible axis containing charged residues. The redox energy of electron transfer is coupled to proton translocation by the as yet undefined mechanism proposed to involve long-range conformational changes. This article is part of a Special Issue entitled Respiratory complex I, edited by Volker Zickermann and Ulrich Brandt.}, author = {Berrisford, John and Baradaran, Rozbeh and Sazanov, Leonid A}, journal = {Biochimica et Biophysica Acta - Bioenergetics}, number = {7}, pages = {892 -- 901}, publisher = {Elsevier}, title = {{Structure of bacterial respiratory complex I}}, doi = {10.1016/j.bbabio.2016.01.012}, volume = {1857}, year = {2016}, } @article{1522, abstract = {We classify smooth Brunnian (i.e., unknotted on both components) embeddings (S2 × S1) ⊔ S3 → ℝ6. Any Brunnian embedding (S2 × S1) ⊔ S3 → ℝ6 is isotopic to an explicitly constructed embedding fk,m,n for some integers k, m, n such that m ≡ n (mod 2). Two embeddings fk,m,n and fk′ ,m′,n′ are isotopic if and only if k = k′, m ≡ m′ (mod 2k) and n ≡ n′ (mod 2k). We use Haefliger’s classification of embeddings S3 ⊔ S3 → ℝ6 in our proof. The relation between the embeddings (S2 × S1) ⊔ S3 → ℝ6 and S3 ⊔ S3 → ℝ6 is not trivial, however. For example, we show that there exist embeddings f: (S2 ×S1) ⊔ S3 → ℝ6 and g, g′ : S3 ⊔ S3 → ℝ6 such that the componentwise embedded connected sum f # g is isotopic to f # g′ but g is not isotopic to g′.}, author = {Avvakumov, Serhii}, issn = {1609-4514}, journal = {Moscow Mathematical Journal}, number = {1}, pages = {1 -- 25}, publisher = {Independent University of Moscow}, title = {{The classification of certain linked 3-manifolds in 6-space}}, doi = {10.17323/1609-4514-2016-16-1-1-25}, volume = {16}, year = {2016}, } @article{1523, abstract = {For random graphs, the containment problem considers the probability that a binomial random graph G(n, p) contains a given graph as a substructure. When asking for the graph as a topological minor, i.e., for a copy of a subdivision of the given graph, it is well known that the (sharp) threshold is at p = 1/n. We consider a natural analogue of this question for higher-dimensional random complexes Xk(n, p), first studied by Cohen, Costa, Farber and Kappeler for k = 2. Improving previous results, we show that p = Θ(1/ √n) is the (coarse) threshold for containing a subdivision of any fixed complete 2-complex. For higher dimensions k > 2, we get that p = O(n−1/k) is an upper bound for the threshold probability of containing a subdivision of a fixed k-dimensional complex.}, author = {Gundert, Anna and Wagner, Uli}, journal = {Proceedings of the American Mathematical Society}, number = {4}, pages = {1815 -- 1828}, publisher = {American Mathematical Society}, title = {{On topological minors in random simplicial complexes}}, doi = {10.1090/proc/12824}, volume = {144}, year = {2016}, } @inproceedings{1526, abstract = {We present the first study of robustness of systems that are both timed as well as reactive (I/O). We study the behavior of such timed I/O systems in the presence of uncertain inputs and formalize their robustness using the analytic notion of Lipschitz continuity: a timed I/O system is K-(Lipschitz) robust if the perturbation in its output is at most K times the perturbation in its input. We quantify input and output perturbation using similarity functions over timed words such as the timed version of the Manhattan distance and the Skorokhod distance. We consider two models of timed I/O systems — timed transducers and asynchronous sequential circuits. We show that K-robustness of timed transducers can be decided in polynomial space under certain conditions. For asynchronous sequential circuits, we reduce K-robustness w.r.t. timed Manhattan distances to K-robustness of discrete letter-to-letter transducers and show PSpace-completeness of the problem.}, author = {Henzinger, Thomas A and Otop, Jan and Samanta, Roopsha}, location = {St. Petersburg, FL, USA}, pages = {250 -- 267}, publisher = {Springer}, title = {{Lipschitz robustness of timed I/O systems}}, doi = {10.1007/978-3-662-49122-5_12}, volume = {9583}, year = {2016}, } @article{1545, abstract = {We provide general conditions for which bosonic quadratic Hamiltonians on Fock spaces can be diagonalized by Bogoliubov transformations. Our results cover the case when quantum systems have infinite degrees of freedom and the associated one-body kinetic and paring operators are unbounded. Our sufficient conditions are optimal in the sense that they become necessary when the relevant one-body operators commute.}, author = {Nam, Phan and Napiórkowski, Marcin M and Solovej, Jan}, journal = {Journal of Functional Analysis}, number = {11}, pages = {4340 -- 4368}, publisher = {Academic Press}, title = {{Diagonalization of bosonic quadratic Hamiltonians by Bogoliubov transformations}}, doi = {10.1016/j.jfa.2015.12.007}, volume = {270}, year = {2016}, } @article{1552, abstract = {Antibiotic resistance carries a fitness cost that must be overcome in order for resistance to persist over the long term. Compensatory mutations that recover the functional defects associated with resistance mutations have been argued to play a key role in overcoming the cost of resistance, but compensatory mutations are expected to be rare relative to generally beneficial mutations that increase fitness, irrespective of antibiotic resistance. Given this asymmetry, population genetics theory predicts that populations should adapt by compensatory mutations when the cost of resistance is large, whereas generally beneficial mutations should drive adaptation when the cost of resistance is small. We tested this prediction by determining the genomic mechanisms underpinning adaptation to antibiotic-free conditions in populations of the pathogenic bacterium Pseudomonas aeruginosa that carry costly antibiotic resistance mutations. Whole-genome sequencing revealed that populations founded by high-cost rifampicin-resistant mutants adapted via compensatory mutations in three genes of the RNA polymerase core enzyme, whereas populations founded by low-cost mutants adapted by generally beneficial mutations, predominantly in the quorum-sensing transcriptional regulator gene lasR. Even though the importance of compensatory evolution in maintaining resistance has been widely recognized, our study shows that the roles of general adaptation in maintaining resistance should not be underestimated and highlights the need to understand how selection at other sites in the genome influences the dynamics of resistance alleles in clinical settings.}, author = {Qi, Qin and Toll Riera, Macarena and Heilbron, Karl and Preston, Gail and Maclean, R Craig}, journal = {Proceedings of the Royal Society of London Series B Biological Sciences}, number = {1822}, publisher = {Royal Society, The}, title = {{The genomic basis of adaptation to the fitness cost of rifampicin resistance in Pseudomonas aeruginosa}}, doi = {10.1098/rspb.2015.2452}, volume = {283}, year = {2016}, } @article{1289, abstract = {Aiming at the automatic diagnosis of tumors using narrow band imaging (NBI) magnifying endoscopic (ME) images of the stomach, we combine methods from image processing, topology, geometry, and machine learning to classify patterns into three classes: oval, tubular and irregular. Training the algorithm on a small number of images of each type, we achieve a high rate of correct classifications. The analysis of the learning algorithm reveals that a handful of geometric and topological features are responsible for the overwhelming majority of decisions.}, author = {Dunaeva, Olga and Edelsbrunner, Herbert and Lukyanov, Anton and Machin, Michael and Malkova, Daria and Kuvaev, Roman and Kashin, Sergey}, journal = {Pattern Recognition Letters}, number = {1}, pages = {13 -- 22}, publisher = {Elsevier}, title = {{The classification of endoscopy images with persistent homology}}, doi = {10.1016/j.patrec.2015.12.012}, volume = {83}, year = {2016}, } @inproceedings{1164, abstract = {A drawing of a graph G is radial if the vertices of G are placed on concentric circles C1, … , Ck with common center c, and edges are drawn radially: every edge intersects every circle centered at c at most once. G is radial planar if it has a radial embedding, that is, a crossing-free radial drawing. If the vertices of G are ordered or partitioned into ordered levels (as they are for leveled graphs), we require that the assignment of vertices to circles corresponds to the given ordering or leveling. A pair of edges e and f in a graph is independent if e and f do not share a vertex. We show that a graph G is radial planar if G has a radial drawing in which every two independent edges cross an even number of times; the radial embedding has the same leveling as the radial drawing. In other words, we establish the strong Hanani-Tutte theorem for radial planarity. This characterization yields a very simple algorithm for radial planarity testing.}, author = {Fulek, Radoslav and Pelsmajer, Michael and Schaefer, Marcus}, location = {Athens, Greece}, pages = {468 -- 481}, publisher = {Springer}, title = {{Hanani-Tutte for radial planarity II}}, doi = {10.1007/978-3-319-50106-2_36}, volume = {9801}, year = {2016}, } @article{1592, abstract = {A modular approach to constructing cryptographic protocols leads to simple designs but often inefficient instantiations. On the other hand, ad hoc constructions may yield efficient protocols at the cost of losing conceptual simplicity. We suggest a new design paradigm, structure-preserving cryptography, that provides a way to construct modular protocols with reasonable efficiency while retaining conceptual simplicity. A cryptographic scheme over a bilinear group is called structure-preserving if its public inputs and outputs consist of elements from the bilinear groups and their consistency can be verified by evaluating pairing-product equations. As structure-preserving schemes smoothly interoperate with each other, they are useful as building blocks in modular design of cryptographic applications. This paper introduces structure-preserving commitment and signature schemes over bilinear groups with several desirable properties. The commitment schemes include homomorphic, trapdoor and length-reducing commitments to group elements, and the structure-preserving signature schemes are the first ones that yield constant-size signatures on multiple group elements. A structure-preserving signature scheme is called automorphic if the public keys lie in the message space, which cannot be achieved by compressing inputs via a cryptographic hash function, as this would destroy the mathematical structure we are trying to preserve. Automorphic signatures can be used for building certification chains underlying privacy-preserving protocols. Among a vast number of applications of structure-preserving protocols, we present an efficient round-optimal blind-signature scheme and a group signature scheme with an efficient and concurrently secure protocol for enrolling new members.}, author = {Abe, Masayuki and Fuchsbauer, Georg and Groth, Jens and Haralambiev, Kristiyan and Ohkubo, Miyako}, journal = {Journal of Cryptology}, number = {2}, pages = {363 -- 421}, publisher = {Springer}, title = {{Structure preserving signatures and commitments to group elements}}, doi = {10.1007/s00145-014-9196-7}, volume = {29}, year = {2016}, } @article{1599, abstract = {The addition of polysialic acid to N- and/or O-linked glycans, referred to as polysialylation, is a rare posttranslational modification that is mainly known to control the developmental plasticity of the nervous system. Here we show that CCR7, the central chemokine receptor controlling immune cell trafficking to secondary lymphatic organs, carries polysialic acid. This modification is essential for the recognition of the CCR7 ligand CCL21. As a consequence, dendritic cell trafficking is abrogated in polysialyltransferase-deficient mice, manifesting as disturbed lymph node homeostasis and unresponsiveness to inflammatory stimuli. Structure-function analysis of chemokine-receptor interactions reveals that CCL21 adopts an autoinhibited conformation, which is released upon interaction with polysialic acid. Thus, we describe a glycosylation-mediated immune cell trafficking disorder and its mechanistic basis. }, author = {Kiermaier, Eva and Moussion, Christine and Veldkamp, Christopher and Gerardy Schahn, Rita and De Vries, Ingrid and Williams, Larry and Chaffee, Gary and Phillips, Andrew and Freiberger, Friedrich and Imre, Richard and Taleski, Deni and Payne, Richard and Braun, Asolina and Förster, Reinhold and Mechtler, Karl and Mühlenhoff, Martina and Volkman, Brian and Sixt, Michael K}, journal = {Science}, number = {6269}, pages = {186 -- 190}, publisher = {American Association for the Advancement of Science}, title = {{Polysialylation controls dendritic cell trafficking by regulating chemokine recognition}}, doi = {10.1126/science.aad0512}, volume = {351}, year = {2016}, } @article{1597, abstract = {Chemokines are the main guidance cues directing leukocyte migration. Opposed to early assumptions, chemokines do not necessarily act as soluble cues but are often immobilized within tissues, e.g., dendritic cell migration toward lymphatic vessels is guided by a haptotactic gradient of the chemokine CCL21. Controlled assay systems to quantitatively study haptotaxis in vitro are still missing. In this chapter, we describe an in vitro haptotaxis assay optimized for the unique properties of dendritic cells. The chemokine CCL21 is immobilized in a bioactive state, using laser-assisted protein adsorption by photobleaching. The cells follow this immobilized CCL21 gradient in a haptotaxis chamber, which provides three dimensionally confined migration conditions.}, author = {Schwarz, Jan and Sixt, Michael K}, journal = {Methods in Enzymology}, pages = {567 -- 581}, publisher = {Elsevier}, title = {{Quantitative analysis of dendritic cell haptotaxis}}, doi = {10.1016/bs.mie.2015.11.004}, volume = {570}, year = {2016}, } @article{1608, abstract = {We show that the Anderson model has a transition from localization to delocalization at exactly 2 dimensional growth rate on antitrees with normalized edge weights which are certain discrete graphs. The kinetic part has a one-dimensional structure allowing a description through transfer matrices which involve some Schur complement. For such operators we introduce the notion of having one propagating channel and extend theorems from the theory of one-dimensional Jacobi operators that relate the behavior of transfer matrices with the spectrum. These theorems are then applied to the considered model. In essence, in a certain energy region the kinetic part averages the random potentials along shells and the transfer matrices behave similar as for a one-dimensional operator with random potential of decaying variance. At d dimensional growth for d>2 this effective decay is strong enough to obtain absolutely continuous spectrum, whereas for some uniform d dimensional growth with d<2 one has pure point spectrum in this energy region. At exactly uniform 2 dimensional growth also some singular continuous spectrum appears, at least at small disorder. As a corollary we also obtain a change from singular spectrum (d≤2) to absolutely continuous spectrum (d≥3) for random operators of the type rΔdr+λ on ℤd, where r is an orthogonal radial projection, Δd the discrete adjacency operator (Laplacian) on ℤd and λ a random potential. }, author = {Sadel, Christian}, journal = {Annales Henri Poincare}, number = {7}, pages = {1631 -- 1675}, publisher = {Birkhäuser}, title = {{Anderson transition at 2 dimensional growth rate on antitrees and spectral theory for operators with one propagating channel}}, doi = {10.1007/s00023-015-0456-3}, volume = {17}, year = {2016}, } @article{1612, abstract = {We prove that whenever A is a 3-conservative relational structure with only binary and unary relations,then the algebra of polymorphisms of A either has no Taylor operation (i.e.,CSP(A)is NP-complete),or it generates an SD(∧) variety (i.e.,CSP(A)has bounded width).}, author = {Kazda, Alexandr}, journal = {Algebra Universalis}, number = {1}, pages = {75 -- 84}, publisher = {Springer}, title = {{CSP for binary conservative relational structures}}, doi = {10.1007/s00012-015-0358-8}, volume = {75}, year = {2016}, } @article{1617, abstract = {We study the discrepancy of jittered sampling sets: such a set P⊂ [0,1]d is generated for fixed m∈ℕ by partitioning [0,1]d into md axis aligned cubes of equal measure and placing a random point inside each of the N=md cubes. We prove that, for N sufficiently large, 1/10 d/N1/2+1/2d ≤EDN∗(P)≤ √d(log N) 1/2/N1/2+1/2d, where the upper bound with an unspecified constant Cd was proven earlier by Beck. Our proof makes crucial use of the sharp Dvoretzky-Kiefer-Wolfowitz inequality and a suitably taylored Bernstein inequality; we have reasons to believe that the upper bound has the sharp scaling in N. Additional heuristics suggest that jittered sampling should be able to improve known bounds on the inverse of the star-discrepancy in the regime N≳dd. We also prove a partition principle showing that every partition of [0,1]d combined with a jittered sampling construction gives rise to a set whose expected squared L2-discrepancy is smaller than that of purely random points.}, author = {Pausinger, Florian and Steinerberger, Stefan}, journal = {Journal of Complexity}, pages = {199 -- 216}, publisher = {Academic Press}, title = {{On the discrepancy of jittered sampling}}, doi = {10.1016/j.jco.2015.11.003}, volume = {33}, year = {2016}, } @article{1620, abstract = {We consider the Bardeen–Cooper–Schrieffer free energy functional for particles interacting via a two-body potential on a microscopic scale and in the presence of weak external fields varying on a macroscopic scale. We study the influence of the external fields on the critical temperature. We show that in the limit where the ratio between the microscopic and macroscopic scale tends to zero, the next to leading order of the critical temperature is determined by the lowest eigenvalue of the linearization of the Ginzburg–Landau equation.}, author = {Frank, Rupert and Hainzl, Christian and Seiringer, Robert and Solovej, Jan}, journal = {Communications in Mathematical Physics}, number = {1}, pages = {189 -- 216}, publisher = {Springer}, title = {{The external field dependence of the BCS critical temperature}}, doi = {10.1007/s00220-015-2526-2}, volume = {342}, year = {2016}, } @article{1622, abstract = {We prove analogues of the Lieb–Thirring and Hardy–Lieb–Thirring inequalities for many-body quantum systems with fractional kinetic operators and homogeneous interaction potentials, where no anti-symmetry on the wave functions is assumed. These many-body inequalities imply interesting one-body interpolation inequalities, and we show that the corresponding one- and many-body inequalities are actually equivalent in certain cases.}, author = {Lundholm, Douglas and Nam, Phan and Portmann, Fabian}, journal = {Archive for Rational Mechanics and Analysis}, number = {3}, pages = {1343 -- 1382}, publisher = {Springer}, title = {{Fractional Hardy–Lieb–Thirring and related Inequalities for interacting systems}}, doi = {10.1007/s00205-015-0923-5}, volume = {219}, year = {2016}, } @article{1631, abstract = {Ancestral processes are fundamental to modern population genetics and spatial structure has been the subject of intense interest for many years. Despite this interest, almost nothing is known about the distribution of the locations of pedigree or genetic ancestors. Using both spatially continuous and stepping-stone models, we show that the distribution of pedigree ancestors approaches a travelling wave, for which we develop two alternative approximations. The speed and width of the wave are sensitive to the local details of the model. After a short time, genetic ancestors spread far more slowly than pedigree ancestors, ultimately diffusing out with radius ## rather than spreading at constant speed. In contrast to the wave of pedigree ancestors, the spread of genetic ancestry is insensitive to the local details of the models.}, author = {Kelleher, Jerome and Etheridge, Alison and Véber, Amandine and Barton, Nicholas H}, journal = {Theoretical Population Biology}, pages = {1 -- 12}, publisher = {Academic Press}, title = {{Spread of pedigree versus genetic ancestry in spatially distributed populations}}, doi = {10.1016/j.tpb.2015.10.008}, volume = {108}, year = {2016}, } @article{1641, abstract = {The plant hormone auxin (indole-3-acetic acid) is a major regulator of plant growth and development including embryo and root patterning, lateral organ formation and growth responses to environmental stimuli. Auxin is directionally transported from cell to cell by the action of specific auxin influx [AUXIN-RESISTANT1 (AUX1)] and efflux [PIN-FORMED (PIN)] transport regulators, whose polar, subcellular localizations are aligned with the direction of the auxin flow. Auxin itself regulates its own transport by modulation of the expression and subcellular localization of the auxin transporters. Increased auxin levels promote the transcription of PIN2 and AUX1 genes as well as stabilize PIN proteins at the plasma membrane, whereas prolonged auxin exposure increases the turnover of PIN proteins and their degradation in the vacuole. In this study, we applied a forward genetic approach, to identify molecular components playing a role in the auxin-mediated degradation. We generated EMS-mutagenized Arabidopsis PIN2::PIN2:GFP, AUX1::AUX1:YFP eir1aux1 populations and designed a screen for mutants with persistently strong fluorescent signals of the tagged PIN2 and AUX1 after prolonged treatment with the synthetic auxin 2,4-dichlorophenoxyacetic acid (2,4-D). This approach yielded novel auxin degradation mutants defective in trafficking and degradation of PIN2 and AUX1 proteins and established a role for auxin-mediated degradation in plant development.}, author = {Zemová, Radka and Zwiewka, Marta and Bielach, Agnieszka and Robert, Hélène and Friml, Jirí}, journal = {Journal of Plant Growth Regulation}, number = {2}, pages = {465 -- 476}, publisher = {Springer}, title = {{A forward genetic screen for new regulators of auxin mediated degradation of auxin transport proteins in Arabidopsis thaliana}}, doi = {10.1007/s00344-015-9553-2}, volume = {35}, year = {2016}, } @inproceedings{1225, abstract = {At Crypto 2015 Fuchsbauer, Hanser and Slamanig (FHS) presented the first standard-model construction of efficient roundoptimal blind signatures that does not require complexity leveraging. It is conceptually simple and builds on the primitive of structure-preserving signatures on equivalence classes (SPS-EQ). FHS prove the unforgeability of their scheme assuming EUF-CMA security of the SPS-EQ scheme and hardness of a version of the DH inversion problem. Blindness under adversarially chosen keys is proven under an interactive variant of the DDH assumption. We propose a variant of their scheme whose blindness can be proven under a non-interactive assumption, namely a variant of the bilinear DDH assumption. We moreover prove its unforgeability assuming only unforgeability of the underlying SPS-EQ but no additional assumptions as needed for the FHS scheme.}, author = {Fuchsbauer, Georg and Hanser, Christian and Kamath Hosdurg, Chethan and Slamanig, Daniel}, location = {Amalfi, Italy}, pages = {391 -- 408}, publisher = {Springer}, title = {{Practical round-optimal blind signatures in the standard model from weaker assumptions}}, doi = {10.1007/978-3-319-44618-9_21}, volume = {9841}, year = {2016}, } @inproceedings{1653, abstract = {A somewhere statistically binding (SSB) hash, introduced by Hubáček and Wichs (ITCS ’15), can be used to hash a long string x to a short digest y = H hk (x) using a public hashing-key hk. Furthermore, there is a way to set up the hash key hk to make it statistically binding on some arbitrary hidden position i, meaning that: (1) the digest y completely determines the i’th bit (or symbol) of x so that all pre-images of y have the same value in the i’th position, (2) it is computationally infeasible to distinguish the position i on which hk is statistically binding from any other position i’. Lastly, the hash should have a local opening property analogous to Merkle-Tree hashing, meaning that given x and y = H hk (x) it should be possible to create a short proof π that certifies the value of the i’th bit (or symbol) of x without having to provide the entire input x. A similar primitive called a positional accumulator, introduced by Koppula, Lewko and Waters (STOC ’15) further supports dynamic updates of the hashed value. These tools, which are interesting in their own right, also serve as one of the main technical components in several recent works building advanced applications from indistinguishability obfuscation (iO). The prior constructions of SSB hashing and positional accumulators required fully homomorphic encryption (FHE) and iO respectively. In this work, we give new constructions of these tools based on well studied number-theoretic assumptions such as DDH, Phi-Hiding and DCR, as well as a general construction from lossy/injective functions.}, author = {Okamoto, Tatsuaki and Pietrzak, Krzysztof Z and Waters, Brent and Wichs, Daniel}, location = {Auckland, New Zealand}, pages = {121 -- 145}, publisher = {Springer}, title = {{New realizations of somewhere statistically binding hashing and positional accumulators}}, doi = {10.1007/978-3-662-48797-6_6}, volume = {9452}, year = {2016}, } @article{1148, abstract = {Continuous-time Markov chain (CTMC) models have become a central tool for understanding the dynamics of complex reaction networks and the importance of stochasticity in the underlying biochemical processes. When such models are employed to answer questions in applications, in order to ensure that the model provides a sufficiently accurate representation of the real system, it is of vital importance that the model parameters are inferred from real measured data. This, however, is often a formidable task and all of the existing methods fail in one case or the other, usually because the underlying CTMC model is high-dimensional and computationally difficult to analyze. The parameter inference methods that tend to scale best in the dimension of the CTMC are based on so-called moment closure approximations. However, there exists a large number of different moment closure approximations and it is typically hard to say a priori which of the approximations is the most suitable for the inference procedure. Here, we propose a moment-based parameter inference method that automatically chooses the most appropriate moment closure method. Accordingly, contrary to existing methods, the user is not required to be experienced in moment closure techniques. In addition to that, our method adaptively changes the approximation during the parameter inference to ensure that always the best approximation is used, even in cases where different approximations are best in different regions of the parameter space. © 2016 Elsevier Ireland Ltd}, author = {Schilling, Christian and Bogomolov, Sergiy and Henzinger, Thomas A and Podelski, Andreas and Ruess, Jakob}, journal = {Biosystems}, pages = {15 -- 25}, publisher = {Elsevier}, title = {{Adaptive moment closure for parameter inference of biochemical reaction networks}}, doi = {10.1016/j.biosystems.2016.07.005}, volume = {149}, year = {2016}, } @article{1705, abstract = {Hybrid systems represent an important and powerful formalism for modeling real-world applications such as embedded systems. A verification tool like SpaceEx is based on the exploration of a symbolic search space (the region space). As a verification tool, it is typically optimized towards proving the absence of errors. In some settings, e.g., when the verification tool is employed in a feedback-directed design cycle, one would like to have the option to call a version that is optimized towards finding an error trajectory in the region space. A recent approach in this direction is based on guided search. Guided search relies on a cost function that indicates which states are promising to be explored, and preferably explores more promising states first. In this paper, we propose an abstraction-based cost function based on coarse-grained space abstractions for guiding the reachability analysis. For this purpose, a suitable abstraction technique that exploits the flexible granularity of modern reachability analysis algorithms is introduced. The new cost function is an effective extension of pattern database approaches that have been successfully applied in other areas. The approach has been implemented in the SpaceEx model checker. The evaluation shows its practical potential.}, author = {Bogomolov, Sergiy and Donzé, Alexandre and Frehse, Goran and Grosu, Radu and Johnson, Taylor and Ladan, Hamed and Podelski, Andreas and Wehrle, Martin}, journal = {International Journal on Software Tools for Technology Transfer}, number = {4}, pages = {449 -- 467}, publisher = {Springer}, title = {{Guided search for hybrid systems based on coarse-grained space abstractions}}, doi = {10.1007/s10009-015-0393-y}, volume = {18}, year = {2016}, } @inproceedings{1707, abstract = {Volunteer supporters play an important role in modern crisis and disaster management. In the times of mobile Internet devices, help from thousands of volunteers can be requested within a short time span, thus relieving professional helpers from minor chores or geographically spread-out tasks. However, the simultaneous availability of many volunteers also poses new problems. In particular, the volunteer efforts must be well coordinated, or otherwise situations might emerge in which too many idle volunteers at one location become more of a burden than a relief to the professionals. In this work, we study the task of optimally assigning volunteers to selected locations, e.g. in order to perform regular measurements, to report on damage, or to distribute information or resources to the population in a crisis situation. We formulate the assignment tasks as an optimization problem and propose an effective and efficient solution procedure. Experiments on real data of the Team Österreich, consisting of over 36,000 Austrian volunteers, show the effectiveness and efficiency of our approach.}, author = {Pielorz, Jasmin and Lampert, Christoph}, location = {Rennes, France}, publisher = {IEEE}, title = {{Optimal geospatial allocation of volunteers for crisis management}}, doi = {10.1109/ICT-DM.2015.7402041}, year = {2016}, } @article{1833, abstract = {Relational models for contingency tables are generalizations of log-linear models, allowing effects associated with arbitrary subsets of cells in the table, and not necessarily containing the overall effect, that is, a common parameter in every cell. Similarly to log-linear models, relational models can be extended to non-negative distributions, but the extension requires more complex methods. An extended relational model is defined as an algebraic variety, and it turns out to be the closure of the original model with respect to the Bregman divergence. In the extended relational model, the MLE of the cell parameters always exists and is unique, but some of its properties may be different from those of the MLE under log-linear models. The MLE can be computed using a generalized iterative scaling procedure based on Bregman projections. }, author = {Klimova, Anna and Rudas, Tamás}, journal = {Journal of Multivariate Analysis}, pages = {440 -- 452}, publisher = {Elsevier}, title = {{On the closure of relational models}}, doi = {10.1016/j.jmva.2015.10.005}, volume = {143}, year = {2016}, } @article{1881, abstract = {We consider random matrices of the form H=W+λV, λ∈ℝ+, where W is a real symmetric or complex Hermitian Wigner matrix of size N and V is a real bounded diagonal random matrix of size N with i.i.d.\ entries that are independent of W. We assume subexponential decay for the matrix entries of W and we choose λ∼1, so that the eigenvalues of W and λV are typically of the same order. Further, we assume that the density of the entries of V is supported on a single interval and is convex near the edges of its support. In this paper we prove that there is λ+∈ℝ+ such that the largest eigenvalues of H are in the limit of large N determined by the order statistics of V for λ>λ+. In particular, the largest eigenvalue of H has a Weibull distribution in the limit N→∞ if λ>λ+. Moreover, for N sufficiently large, we show that the eigenvectors associated to the largest eigenvalues are partially localized for λ>λ+, while they are completely delocalized for λ<λ+. Similar results hold for the lowest eigenvalues. }, author = {Lee, Jioon and Schnelli, Kevin}, journal = {Probability Theory and Related Fields}, number = {1-2}, pages = {165 -- 241}, publisher = {Springer}, title = {{Extremal eigenvalues and eigenvectors of deformed Wigner matrices}}, doi = {10.1007/s00440-014-0610-8}, volume = {164}, year = {2016}, } @article{1411, abstract = {We consider two systems (α1, …, αm) and (β1, …,βn) of simple curves drawn on a compact two-dimensional surface M with boundary. Each αi and each βj is either an arc meeting the boundary of M at its two endpoints, or a closed curve. The αi are pairwise disjoint except for possibly sharing endpoints, and similarly for the βj. We want to “untangle” the βj from the ai by a self-homeomorphism of M; more precisely, we seek a homeomorphism φ:M→M fixing the boundary of M pointwise such that the total number of crossings of the ai with the φ(βj) is as small as possible. This problem is motivated by an application in the algorithmic theory of embeddings and 3-manifolds. We prove that if M is planar, i.e., a sphere with h ≥ 0 boundary components (“holes”), then O(mn) crossings can be achieved (independently of h), which is asymptotically tight, as an easy lower bound shows. In general, for an arbitrary (orientable or nonorientable) surface M with h holes and of (orientable or nonorientable) genus g ≥ 0, we obtain an O((m + n)4) upper bound, again independent of h and g. The proofs rely, among other things, on a result concerning simultaneous planar drawings of graphs by Erten and Kobourov.}, author = {Matoušek, Jiří and Sedgwick, Eric and Tancer, Martin and Wagner, Uli}, journal = {Israel Journal of Mathematics}, number = {1}, pages = {37 -- 79}, publisher = {Springer}, title = {{Untangling two systems of noncrossing curves}}, doi = {10.1007/s11856-016-1294-9}, volume = {212}, year = {2016}, } @article{1479, abstract = {Most entropy notions H(.) like Shannon or min-entropy satisfy a chain rule stating that for random variables X,Z, and A we have H(X|Z,A)≥H(X|Z)−|A|. That is, by conditioning on A the entropy of X can decrease by at most the bitlength |A| of A. Such chain rules are known to hold for some computational entropy notions like Yao’s and unpredictability-entropy. For HILL entropy, the computational analogue of min-entropy, the chain rule is of special interest and has found many applications, including leakage-resilient cryptography, deterministic encryption, and memory delegation. These applications rely on restricted special cases of the chain rule. Whether the chain rule for conditional HILL entropy holds in general was an open problem for which we give a strong negative answer: we construct joint distributions (X,Z,A), where A is a distribution over a single bit, such that the HILL entropy H HILL (X|Z) is large but H HILL (X|Z,A) is basically zero. Our counterexample just makes the minimal assumption that NP⊈P/poly. Under the stronger assumption that injective one-way function exist, we can make all the distributions efficiently samplable. Finally, we show that some more sophisticated cryptographic objects like lossy functions can be used to sample a distribution constituting a counterexample to the chain rule making only a single invocation to the underlying object.}, author = {Krenn, Stephan and Pietrzak, Krzysztof Z and Wadia, Akshay and Wichs, Daniel}, journal = {Computational Complexity}, number = {3}, pages = {567 -- 605}, publisher = {Springer}, title = {{A counterexample to the chain rule for conditional HILL entropy}}, doi = {10.1007/s00037-015-0120-9}, volume = {25}, year = {2016}, } @inproceedings{478, abstract = {Magic: the Gathering is a game about magical combat for any number of players. Formally it is a zero-sum, imperfect information stochastic game that consists of a potentially unbounded number of steps. We consider the problem of deciding if a move is legal in a given single step of Magic. We show that the problem is (a) coNP-complete in general; and (b) in P if either of two small sets of cards are not used. Our lower bound holds even for single-player Magic games. The significant aspects of our results are as follows: First, in most real-life game problems, the task of deciding whether a given move is legal in a single step is trivial, and the computationally hard task is to find the best sequence of legal moves in the presence of multiple players. In contrast, quite uniquely our hardness result holds for single step and with only one-player. Second, we establish efficient algorithms for important special cases of Magic.}, author = {Chatterjee, Krishnendu and Ibsen-Jensen, Rasmus}, location = {The Hague, Netherlands}, pages = {1432 -- 1439}, publisher = {IOS Press}, title = {{The complexity of deciding legality of a single step of magic: The gathering}}, doi = {10.3233/978-1-61499-672-9-1432}, volume = {285}, year = {2016}, } @inproceedings{479, abstract = {Clinical guidelines and decision support systems (DSS) play an important role in daily practices of medicine. Many text-based guidelines have been encoded for work-flow simulation of DSS to automate health care. During the collaboration with Carle hospital to develop a DSS, we identify that, for some complex and life-critical diseases, it is highly desirable to automatically rigorously verify some complex temporal properties in guidelines, which brings new challenges to current simulation based DSS with limited support of automatical formal verification and real-time data analysis. In this paper, we conduct the first study on applying runtime verification to cooperate with current DSS based on real-time data. Within the proposed technique, a user-friendly domain specific language, named DRTV, is designed to specify vital real-time data sampled by medical devices and temporal properties originated from clinical guidelines. Some interfaces are developed for data acquisition and communication. Then, for medical practice scenarios described in DRTV model, we will automatically generate event sequences and runtime property verifier automata. If a temporal property violates, real-time warnings will be produced by the formal verifier and passed to medical DSS. We have used DRTV to specify different kinds of medical care scenarios, and applied the proposed technique to assist existing DSS. As presented in experiment results, in terms of warning detection, it outperforms the only use of DSS or human inspection, and improves the quality of clinical health care of hospital}, author = {Jiang, Yu and Liu, Han and Kong, Hui and Wang, Rui and Hosseini, Mohamad and Sun, Jiaguang and Sha, Lui}, booktitle = {Proceedings of the 38th International Conference on Software Engineering Companion }, location = {Austin, TX, USA}, pages = {112 -- 121}, publisher = {IEEE}, title = {{Use runtime verification to improve the quality of medical care practice}}, doi = {10.1145/2889160.2889233}, year = {2016}, } @inproceedings{480, abstract = {Graph games provide the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic reactive processes, the traditional model is perfect-information stochastic games, where some transitions of the game graph are controlled by two adversarial players, and the other transitions are executed probabilistically. We consider such games where the objective is the conjunction of several quantitative objectives (specified as mean-payoff conditions), which we refer to as generalized mean-payoff objectives. The basic decision problem asks for the existence of a finite-memory strategy for a player that ensures the generalized mean-payoff objective be satisfied with a desired probability against all strategies of the opponent. A special case of the decision problem is the almost-sure problem where the desired probability is 1. Previous results presented a semi-decision procedure for -approximations of the almost-sure problem. In this work, we show that both the almost-sure problem as well as the general basic decision problem are coNP-complete, significantly improving the previous results. Moreover, we show that in the case of 1-player stochastic games, randomized memoryless strategies are sufficient and the problem can be solved in polynomial time. In contrast, in two-player stochastic games, we show that even with randomized strategies exponential memory is required in general, and present a matching exponential upper bound. We also study the basic decision problem with infinite-memory strategies and present computational complexity results for the problem. Our results are relevant in the synthesis of stochastic reactive systems with multiple quantitative requirements.}, author = {Chatterjee, Krishnendu and Doyen, Laurent}, location = {New York, NY, USA}, pages = {247 -- 256}, publisher = {IEEE}, title = {{Perfect-information stochastic games with generalized mean-payoff objectives}}, doi = {10.1145/2933575.2934513}, volume = {05-08-July-2016}, year = {2016}, } @inproceedings{1379, abstract = {We investigate the complexity of finding an embedded non-orientable surface of Euler genus g in a triangulated 3-manifold. This problem occurs both as a natural question in low-dimensional topology, and as a first non-trivial instance of embeddability of complexes into 3-manifolds. We prove that the problem is NP-hard, thus adding to the relatively few hardness results that are currently known in 3-manifold topology. In addition, we show that the problem lies in NP when the Euler genus g is odd, and we give an explicit algorithm in this case.}, author = {Burton, Benjamin and De Mesmay, Arnaud N and Wagner, Uli}, location = {Medford, MA, USA}, pages = {24.1 -- 24.15}, publisher = {Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing}, title = {{Finding non-orientable surfaces in 3-manifolds}}, doi = {10.4230/LIPIcs.SoCG.2016.24}, volume = {51}, year = {2016}, } @article{1477, abstract = {We consider partially observable Markov decision processes (POMDPs) with ω-regular conditions specified as parity objectives. The class of ω-regular languages provides a robust specification language to express properties in verification, and parity objectives are canonical forms to express them. The qualitative analysis problem given a POMDP and a parity objective asks whether there is a strategy to ensure that the objective is satisfied with probability 1 (resp. positive probability). While the qualitative analysis problems are undecidable even for special cases of parity objectives, we establish decidability (with optimal complexity) for POMDPs with all parity objectives under finite-memory strategies. We establish optimal (exponential) memory bounds and EXPTIME-completeness of the qualitative analysis problems under finite-memory strategies for POMDPs with parity objectives. We also present a practical approach, where we design heuristics to deal with the exponential complexity, and have applied our implementation on a number of POMDP examples.}, author = {Chatterjee, Krishnendu and Chmelik, Martin and Tracol, Mathieu}, journal = {Journal of Computer and System Sciences}, number = {5}, pages = {878 -- 911}, publisher = {Elsevier}, title = {{What is decidable about partially observable Markov decision processes with ω-regular objectives}}, doi = {10.1016/j.jcss.2016.02.009}, volume = {82}, year = {2016}, } @article{1529, abstract = {We consider partially observable Markov decision processes (POMDPs) with a set of target states and an integer cost associated with every transition. The optimization objective we study asks to minimize the expected total cost of reaching a state in the target set, while ensuring that the target set is reached almost surely (with probability 1). We show that for integer costs approximating the optimal cost is undecidable. For positive costs, our results are as follows: (i) we establish matching lower and upper bounds for the optimal cost, both double exponential in the POMDP state space size; (ii) we show that the problem of approximating the optimal cost is decidable and present approximation algorithms developing on the existing algorithms for POMDPs with finite-horizon objectives. While the worst-case running time of our algorithm is double exponential, we also present efficient stopping criteria for the algorithm and show experimentally that it performs well in many examples of interest.}, author = {Chatterjee, Krishnendu and Chmelik, Martin and Gupta, Raghav and Kanodia, Ayush}, journal = {Artificial Intelligence}, pages = {26 -- 48}, publisher = {Elsevier}, title = {{Optimal cost almost-sure reachability in POMDPs}}, doi = {10.1016/j.artint.2016.01.007}, volume = {234}, year = {2016}, } @misc{5445, abstract = {We consider the quantitative analysis problem for interprocedural control-flow graphs (ICFGs). The input consists of an ICFG, a positive weight function that assigns every transition a positive integer-valued number, and a labelling of the transitions (events) as good, bad, and neutral events. The weight function assigns to each transition a numerical value that represents ameasure of how good or bad an event is. The quantitative analysis problem asks whether there is a run of the ICFG where the ratio of the sum of the numerical weights of good events versus the sum of weights of bad events in the long-run is at least a given threshold (or equivalently, to compute the maximal ratio among all valid paths in the ICFG). The quantitative analysis problem for ICFGs can be solved in polynomial time, and we present an efficient and practical algorithm for the problem. We show that several problems relevant for static program analysis, such as estimating the worst-case execution time of a program or the average energy consumption of a mobile application, can be modeled in our framework. We have implemented our algorithm as a tool in the Java Soot framework. We demonstrate the effectiveness of our approach with two case studies. First, we show that our framework provides a sound approach (no false positives) for the analysis of inefficiently-used containers. Second, we show that our approach can also be used for static profiling of programs which reasons about methods that are frequently invoked. Our experimental results show that our tool scales to relatively large benchmarks, and discovers relevant and useful information that can be used to optimize performance of the programs. }, author = {Chatterjee, Krishnendu and Pavlogiannis, Andreas and Velner, Yaron}, issn = {2664-1690}, pages = {33}, publisher = {IST Austria}, title = {{Quantitative interprocedural analysis}}, doi = {10.15479/AT:IST-2016-523-v1-1}, year = {2016}, } @inproceedings{1166, abstract = {POMDPs are standard models for probabilistic planning problems, where an agent interacts with an uncertain environment. We study the problem of almost-sure reachability, where given a set of target states, the question is to decide whether there is a policy to ensure that the target set is reached with probability 1 (almost-surely). While in general the problem is EXPTIMEcomplete, in many practical cases policies with a small amount of memory suffice. Moreover, the existing solution to the problem is explicit, which first requires to construct explicitly an exponential reduction to a belief-support MDP. In this work, we first study the existence of observation-stationary strategies, which is NP-complete, and then small-memory strategies. We present a symbolic algorithm by an efficient encoding to SAT and using a SAT solver for the problem. We report experimental results demonstrating the scalability of our symbolic (SAT-based) approach. © 2016, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.}, author = {Chatterjee, Krishnendu and Chmelik, Martin and Davies, Jessica}, booktitle = {Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence}, location = {Phoenix, AZ, USA}, pages = {3225 -- 3232}, publisher = {AAAI Press}, title = {{A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps}}, volume = {2016}, year = {2016}, } @misc{5449, abstract = {The fixation probability is the probability that a new mutant introduced in a homogeneous population eventually takes over the entire population. The fixation probability is a fundamental quantity of natural selection, and known to depend on the population structure. Amplifiers of natural selection are population structures which increase the fixation probability of advantageous mutants, as compared to the baseline case of well-mixed populations. In this work we focus on symmetric population structures represented as undirected graphs. In the regime of undirected graphs, the strongest amplifier known has been the Star graph, and the existence of undirected graphs with stronger amplification properties has remained open for over a decade. In this work we present the Comet and Comet-swarm families of undirected graphs. We show that for a range of fitness values of the mutants, the Comet and Comet-swarm graphs have fixation probability strictly larger than the fixation probability of the Star graph, for fixed population size and at the limit of large populations, respectively.}, author = {Pavlogiannis, Andreas and Tkadlec, Josef and Chatterjee, Krishnendu and Nowak, Martin}, issn = {2664-1690}, pages = {22}, publisher = {IST Austria}, title = {{Amplification on undirected population structures: Comets beat stars}}, doi = {10.15479/AT:IST-2016-648-v1-1}, year = {2016}, } @misc{5453, author = {Pavlogiannis, Andreas and Tkadlec, Josef and Chatterjee, Krishnendu and Nowak, Martin}, issn = {2664-1690}, pages = {34}, publisher = {IST Austria}, title = {{Arbitrarily strong amplifiers of natural selection}}, doi = {10.15479/AT:IST-2017-749-v3-1}, year = {2016}, } @misc{5451, author = {Pavlogiannis, Andreas and Tkadlec, Josef and Chatterjee, Krishnendu and Nowak, Martin}, issn = {2664-1690}, pages = {34}, publisher = {IST Austria}, title = {{Strong amplifiers of natural selection}}, doi = {10.15479/AT:IST-2016-728-v1-1}, year = {2016}, } @inproceedings{5806, abstract = {Although the concept of functional plane for naive plane is studied and reported in the literature in great detail, no similar study is yet found for naive sphere. This article exposes the first study in this line, opening up further prospects of analyzing the topological properties of sphere in the discrete space. We show that each quadraginta octant Q of a naive sphere forms a bijection with its projected pixel set on a unique coordinate plane, which thereby serves as the functional plane of Q, and hence gives rise to merely mono-jumps during back projection. The other two coordinate planes serve as para-functional and dia-functional planes for Q, as the former is ‘mono-jumping’ but not bijective, whereas the latter holds neither of the two. Owing to this, the quadraginta octants form symmetry groups and subgroups with equivalent jump conditions. We also show a potential application in generating a special class of discrete 3D circles based on back projection and jump bridging by Steiner voxels. A circle in this class possesses 4-symmetry, uniqueness, and bounded distance from the underlying real sphere and real plane.}, author = {Biswas, Ranita and Bhowmick, Partha}, booktitle = {Discrete Geometry for Computer Imagery}, isbn = {978-3-319-32359-6}, issn = {0302-9743}, location = {Nantes, France}, pages = {256--267}, publisher = {Springer Nature}, title = {{On functionality of quadraginta octants of naive sphere with application to circle drawing}}, doi = {10.1007/978-3-319-32360-2_20}, volume = {9647}, year = {2016}, } @inbook{5805, abstract = {Discretization of sphere in the integer space follows a particular discretization scheme, which, in principle, conforms to some topological model. This eventually gives rise to interesting topological properties of a discrete spherical surface, which need to be investigated for its analytical characterization. This paper presents some novel results on the local topological properties of the naive model of discrete sphere. They follow from the bijection of each quadraginta octant of naive sphere with its projection map called f -map on the corresponding functional plane and from the characterization of certain jumps in the f-map. As an application, we have shown how these properties can be used in designing an efficient reconstruction algorithm for a naive spherical surface from an input voxel set when it is sparse or noisy.}, author = {Sen, Nabhasmita and Biswas, Ranita and Bhowmick, Partha}, booktitle = {Computational Topology in Image Context}, isbn = {978-3-319-39440-4}, issn = {1611-3349}, location = {Marseille, France}, pages = {253--264}, publisher = {Springer Nature}, title = {{On some local topological properties of naive discrete sphere}}, doi = {10.1007/978-3-319-39441-1_23}, volume = {9667}, year = {2016}, } @inbook{5809, abstract = {A discrete spherical circle is a topologically well-connected 3D circle in the integer space, which belongs to a discrete sphere as well as a discrete plane. It is one of the most important 3D geometric primitives, but has not possibly yet been studied up to its merit. This paper is a maiden exposition of some of its elementary properties, which indicates a sense of its profound theoretical prospects in the framework of digital geometry. We have shown how different types of discretization can lead to forbidden and admissible classes, when one attempts to define the discretization of a spherical circle in terms of intersection between a discrete sphere and a discrete plane. Several fundamental theoretical results have been presented, the algorithm for construction of discrete spherical circles has been discussed, and some test results have been furnished to demonstrate its practicality and usefulness.}, author = {Biswas, Ranita and Bhowmick, Partha and Brimkov, Valentin E.}, booktitle = {Combinatorial image analysis}, isbn = {978-3-319-26144-7}, issn = {1611-3349}, location = {Kolkata, India}, pages = {86--100}, publisher = {Springer Nature}, title = {{On the connectivity and smoothness of discrete spherical circles}}, doi = {10.1007/978-3-319-26145-4_7}, volume = {9448}, year = {2016}, } @inproceedings{8094, abstract = {With the accelerated development of robot technologies, optimal control becomes one of the central themes of research. In traditional approaches, the controller, by its internal functionality, finds appropriate actions on the basis of the history of sensor values, guided by the goals, intentions, objectives, learning schemes, and so forth. The idea is that the controller controls the world---the body plus its environment---as reliably as possible. This paper focuses on new lines of self-organization for developmental robotics. We apply the recently developed differential extrinsic synaptic plasticity to a muscle-tendon driven arm-shoulder system from the Myorobotics toolkit. In the experiments, we observe a vast variety of self-organized behavior patterns: when left alone, the arm realizes pseudo-random sequences of different poses. By applying physical forces, the system can be entrained into definite motion patterns like wiping a table. Most interestingly, after attaching an object, the controller gets in a functional resonance with the object's internal dynamics, starting to shake spontaneously bottles half-filled with water or sensitively driving an attached pendulum into a circular mode. When attached to the crank of a wheel the neural system independently discovers how to rotate it. In this way, the robot discovers affordances of objects its body is interacting with.}, author = {Martius, Georg S and Hostettler, Rafael and Knoll, Alois and Der, Ralf}, booktitle = {Proceedings of the Artificial Life Conference 2016}, isbn = {9780262339360}, location = {Cancun, Mexico}, pages = {142--143}, publisher = {MIT Press}, title = {{Self-organized control of an tendon driven arm by differential extrinsic plasticity}}, doi = {10.7551/978-0-262-33936-0-ch029}, volume = {28}, year = {2016}, } @article{1197, abstract = {Across the nervous system, certain population spiking patterns are observed far more frequently than others. A hypothesis about this structure is that these collective activity patterns function as population codewords–collective modes–carrying information distinct from that of any single cell. We investigate this phenomenon in recordings of ∼150 retinal ganglion cells, the retina’s output. We develop a novel statistical model that decomposes the population response into modes; it predicts the distribution of spiking activity in the ganglion cell population with high accuracy. We found that the modes represent localized features of the visual stimulus that are distinct from the features represented by single neurons. Modes form clusters of activity states that are readily discriminated from one another. When we repeated the same visual stimulus, we found that the same mode was robustly elicited. These results suggest that retinal ganglion cells’ collective signaling is endowed with a form of error-correcting code–a principle that may hold in brain areas beyond retina.}, author = {Prentice, Jason and Marre, Olivier and Ioffe, Mark and Loback, Adrianna and Tkacik, Gasper and Berry, Michael}, journal = {PLoS Computational Biology}, number = {11}, publisher = {Public Library of Science}, title = {{Error-robust modes of the retinal population code}}, doi = {10.1371/journal.pcbi.1005148}, volume = {12}, year = {2016}, } @misc{9720, abstract = {Summary: Declining populations of bee pollinators are a cause of concern, with major repercussions for biodiversity loss and food security. RNA viruses associated with honeybees represent a potential threat to other insect pollinators, but the extent of this threat is poorly understood. This study aims to attain a detailed understanding of the current and ongoing risk of emerging infectious disease (EID) transmission between managed and wild pollinator species across a wide range of RNA viruses. Within a structured large-scale national survey across 26 independent sites, we quantify the prevalence and pathogen loads of multiple RNA viruses in co-occurring managed honeybee (Apis mellifera) and wild bumblebee (Bombus spp.) populations. We then construct models that compare virus prevalence between wild and managed pollinators. Multiple RNA viruses associated with honeybees are widespread in sympatric wild bumblebee populations. Virus prevalence in honeybees is a significant predictor of virus prevalence in bumblebees, but we remain cautious in speculating over the principle direction of pathogen transmission. We demonstrate species-specific differences in prevalence, indicating significant variation in disease susceptibility or tolerance. Pathogen loads within individual bumblebees may be high and in the case of at least one RNA virus, prevalence is higher in wild bumblebees than in managed honeybee populations. Our findings indicate widespread transmission of RNA viruses between managed and wild bee pollinators, pointing to an interconnected network of potential disease pressures within and among pollinator species. In the context of the biodiversity crisis, our study emphasizes the importance of targeting a wide range of pathogens and defining host associations when considering potential drivers of population decline.}, author = {Mcmahon, Dino and Fürst, Matthias and Caspar, Jesicca and Theodorou, Panagiotis and Brown, Mark and Paxton, Robert}, publisher = {Dryad}, title = {{Data from: A sting in the spit: widespread cross-infection of multiple RNA viruses across wild and managed bees}}, doi = {10.5061/dryad.4b565}, year = {2016}, } @article{1158, abstract = {Speciation results from the progressive accumulation of mutations that decrease the probability of mating between parental populations or reduce the fitness of hybrids—the so-called species barriers. The speciation genomic literature, however, is mainly a collection of case studies, each with its own approach and specificities, such that a global view of the gradual process of evolution from one to two species is currently lacking. Of primary importance is the prevalence of gene flow between diverging entities, which is central in most species concepts and has been widely discussed in recent years. Here, we explore the continuum of speciation thanks to a comparative analysis of genomic data from 61 pairs of populations/species of animals with variable levels of divergence. Gene flow between diverging gene pools is assessed under an approximate Bayesian computation (ABC) framework. We show that the intermediate "grey zone" of speciation, in which taxonomy is often controversial, spans from 0.5% to 2% of net synonymous divergence, irrespective of species life history traits or ecology. Thanks to appropriate modeling of among-locus variation in genetic drift and introgression rate, we clarify the status of the majority of ambiguous cases and uncover a number of cryptic species. Our analysis also reveals the high incidence in animals of semi-isolated species (when some but not all loci are affected by barriers to gene flow) and highlights the intrinsic difficulty, both statistical and conceptual, of delineating species in the grey zone of speciation.}, author = {Roux, Camille and Fraisse, Christelle and Romiguier, Jonathan and Anciaux, Youann and Galtier, Nicolas and Bierne, Nicolas}, journal = {PLoS Biology}, number = {12}, publisher = {Public Library of Science}, title = {{Shedding light on the grey zone of speciation along a continuum of genomic divergence}}, doi = {10.1371/journal.pbio.2000234}, volume = {14}, year = {2016}, } @article{1167, abstract = {Evolutionary pathways describe trajectories of biological evolution in the space of different variants of organisms (genotypes). The probability of existence and the number of evolutionary pathways that lead from a given genotype to a better-adapted genotype are important measures of accessibility of local fitness optima and the reproducibility of evolution. Both quantities have been studied in simple mathematical models where genotypes are represented as binary sequences of two types of basic units, and the network of permitted mutations between the genotypes is a hypercube graph. However, it is unclear how these results translate to the biologically relevant case in which genotypes are represented by sequences of more than two units, for example four nucleotides (DNA) or 20 amino acids (proteins), and the mutational graph is not the hypercube. Here we investigate accessibility of the best-adapted genotype in the general case of K > 2 units. Using computer generated and experimental fitness landscapes we show that accessibility of the global fitness maximum increases with K and can be much higher than for binary sequences. The increase in accessibility comes from the increase in the number of indirect trajectories exploited by evolution for higher K. As one of the consequences, the fraction of genotypes that are accessible increases by three orders of magnitude when the number of units K increases from 2 to 16 for landscapes of size N ∼ 106genotypes. This suggests that evolution can follow many different trajectories on such landscapes and the reconstruction of evolutionary pathways from experimental data might be an extremely difficult task.}, author = {Zagórski, Marcin P and Burda, Zdzisław and Wacław, Bartłomiej}, journal = {PLoS Computational Biology}, number = {12}, publisher = {Public Library of Science}, title = {{Beyond the hypercube evolutionary accessibility of fitness landscapes with realistic mutational networks}}, doi = {10.1371/journal.pcbi.1005218}, volume = {12}, year = {2016}, } @misc{9867, abstract = {In the beginning of our experiment, subjects were asked to read a few pages on their computer screens that would explain the rules of the subsequent game. Here, we provide these instructions, translated from German.}, author = {Hilbe, Christian and Hagel, Kristin and Milinski, Manfred}, publisher = {Public Library of Science}, title = {{Experimental game instructions}}, doi = {10.1371/journal.pone.0163867.s008}, year = {2016}, } @misc{9862, author = {Roux, Camille and Fraisse, Christelle and Romiguier, Jonathan and Anciaux, Youann and Galtier, Nicolas and Bierne, Nicolas}, publisher = {Public Library of Science}, title = {{Simulation study to test the robustness of ABC in face of recent times of divergence}}, doi = {10.1371/journal.pbio.2000234.s016}, year = {2016}, } @misc{9863, author = {Roux, Camille and Fraisse, Christelle and Romiguier, Jonathan and Anciaux, Youann and Galtier, Nicolas and Bierne, Nicolas}, publisher = {Public Library of Science}, title = {{Accessions of surveyed individuals, geographic locations and summary statistics}}, doi = {10.1371/journal.pbio.2000234.s017}, year = {2016}, } @misc{9866, author = {Zagórski, Marcin P and Burda, Zdzisław and Wacław, Bartłomiej}, publisher = {Public Library of Science}, title = {{ZIP-archived directory containing all data and computer programs}}, doi = {10.1371/journal.pcbi.1005218.s009}, year = {2016}, } @article{9456, abstract = {The discovery of introns four decades ago was one of the most unexpected findings in molecular biology. Introns are sequences interrupting genes that must be removed as part of messenger RNA production. Genome sequencing projects have shown that most eukaryotic genes contain at least one intron, and frequently many. Comparison of these genomes reveals a history of long evolutionary periods during which few introns were gained, punctuated by episodes of rapid, extensive gain. However, although several detailed mechanisms for such episodic intron generation have been proposed, none has been empirically supported on a genomic scale. Here we show how short, non-autonomous DNA transposons independently generated hundreds to thousands of introns in the prasinophyte Micromonas pusilla and the pelagophyte Aureococcus anophagefferens. Each transposon carries one splice site. The other splice site is co-opted from the gene sequence that is duplicated upon transposon insertion, allowing perfect splicing out of the RNA. The distributions of sequences that can be co-opted are biased with respect to codons, and phasing of transposon-generated introns is similarly biased. These transposons insert between pre-existing nucleosomes, so that multiple nearby insertions generate nucleosome-sized intervening segments. Thus, transposon insertion and sequence co-option may explain the intron phase biases and prevalence of nucleosome-sized exons observed in eukaryotes. Overall, the two independent examples of proliferating elements illustrate a general DNA transposon mechanism that can plausibly account for episodes of rapid, extensive intron gain during eukaryotic evolution.}, author = {Huff, Jason T. and Zilberman, Daniel and Roy, Scott W.}, issn = {1476-4687}, journal = {Nature}, number = {7626}, pages = {533--536}, publisher = {Springer Nature }, title = {{Mechanism for DNA transposons to generate introns on genomic scales}}, doi = {10.1038/nature20110}, volume = {538}, year = {2016}, } @inproceedings{948, abstract = {Experience constantly shapes neural circuits through a variety of plasticity mechanisms. While the functional roles of some plasticity mechanisms are well-understood, it remains unclear how changes in neural excitability contribute to learning. Here, we develop a normative interpretation of intrinsic plasticity (IP) as a key component of unsupervised learning. We introduce a novel generative mixture model that accounts for the class-specific statistics of stimulus intensities, and we derive a neural circuit that learns the input classes and their intensities. We will analytically show that inference and learning for our generative model can be achieved by a neural circuit with intensity-sensitive neurons equipped with a specific form of IP. Numerical experiments verify our analytical derivations and show robust behavior for artificial and natural stimuli. Our results link IP to non-trivial input statistics, in particular the statistics of stimulus intensities for classes to which a neuron is sensitive. More generally, our work paves the way toward new classification algorithms that are robust to intensity variations.}, author = {Monk, Travis and Savin, Cristina and Lücke, Jörg}, location = {Barcelona, Spaine}, pages = {4285 -- 4293}, publisher = {Neural Information Processing Systems}, title = {{Neurons equipped with intrinsic plasticity learn stimulus intensity statistics}}, volume = {29}, year = {2016}, } @article{1262, abstract = {Emerging infectious diseases (EIDs) have contributed significantly to the current biodiversity crisis, leading to widespread epidemics and population loss. Owing to genetic variation in pathogen virulence, a complete understanding of species decline requires the accurate identification and characterization of EIDs. We explore this issue in the Western honeybee, where increasing mortality of populations in the Northern Hemisphere has caused major concern. Specifically, we investigate the importance of genetic identity of the main suspect in mortality, deformed wing virus (DWV), in driving honeybee loss. Using laboratory experiments and a systematic field survey, we demonstrate that an emerging DWV genotype (DWV-B) is more virulent than the established DWV genotype (DWV-A) and is widespread in the landscape. Furthermore, we show in a simple model that colonies infected with DWV-B collapse sooner than colonies infected with DWV-A. We also identify potential for rapid DWV evolution by revealing extensive genome-wide recombination in vivo. The emergence of DWV-B in naive honeybee populations, including via recombination with DWV-A, could be of significant ecological and economic importance. Our findings emphasize that knowledge of pathogen genetic identity and diversity is critical to understanding drivers of species decline.}, author = {Mcmahon, Dino and Natsopoulou, Myrsini and Doublet, Vincent and Fürst, Matthias and Weging, Silvio and Brown, Mark and Gogol Döring, Andreas and Paxton, Robert}, journal = {Proceedings of the Royal Society of London Series B Biological Sciences}, number = {1833}, publisher = {Royal Society, The}, title = {{Elevated virulence of an emerging viral genotype as a driver of honeybee loss}}, doi = {10.1098/rspb.2016.0811}, volume = {283}, year = {2016}, } @misc{9704, abstract = {Emerging infectious diseases (EIDs) have contributed significantly to the current biodiversity crisis, leading to widespread epidemics and population loss. Owing to genetic variation in pathogen virulence, a complete understanding of species decline requires the accurate identification and characterization of EIDs. We explore this issue in the Western honeybee, where increasing mortality of populations in the Northern Hemisphere has caused major concern. Specifically, we investigate the importance of genetic identity of the main suspect in mortality, deformed wing virus (DWV), in driving honeybee loss. Using laboratory experiments and a systematic field survey, we demonstrate that an emerging DWV genotype (DWV-B) is more virulent than the established DWV genotype (DWV-A) and is widespread in the landscape. Furthermore, we show in a simple model that colonies infected with DWV-B collapse sooner than colonies infected with DWV-A. We also identify potential for rapid DWV evolution by revealing extensive genome-wide recombination in vivo. The emergence of DWV-B in naive honeybee populations, including via recombination with DWV-A, could be of significant ecological and economic importance. Our findings emphasize that knowledge of pathogen genetic identity and diversity is critical to understanding drivers of species decline.}, author = {Mcmahon, Dino and Natsopoulou, Myrsini and Doublet, Vincent and Fürst, Matthias and Weging, Silvio and Brown, Mark and Gogol Döring, Andreas and Paxton, Robert}, publisher = {Dryad}, title = {{Data from: Elevated virulence of an emerging viral genotype as a driver of honeybee loss}}, doi = {10.5061/dryad.cq7t1}, year = {2016}, } @article{1322, abstract = {Direct reciprocity is a major mechanism for the evolution of cooperation. Several classical studies have suggested that humans should quickly learn to adopt reciprocal strategies to establish mutual cooperation in repeated interactions. On the other hand, the recently discovered theory of ZD strategies has found that subjects who use extortionate strategies are able to exploit and subdue cooperators. Although such extortioners have been predicted to succeed in any population of adaptive opponents, theoretical follow-up studies questioned whether extortion can evolve in reality. However, most of these studies presumed that individuals have similar strategic possibilities and comparable outside options, whereas asymmetries are ubiquitous in real world applications. Here we show with a model and an economic experiment that extortionate strategies readily emerge once subjects differ in their strategic power. Our experiment combines a repeated social dilemma with asymmetric partner choice. In our main treatment there is one randomly chosen group member who is unilaterally allowed to exchange one of the other group members after every ten rounds of the social dilemma. We find that this asymmetric replacement opportunity generally promotes cooperation, but often the resulting payoff distribution reflects the underlying power structure. Almost half of the subjects in a better strategic position turn into extortioners, who quickly proceed to exploit their peers. By adapting their cooperation probabilities consistent with ZD theory, extortioners force their co-players to cooperate without being similarly cooperative themselves. Comparison to non-extortionate players under the same conditions indicates a substantial net gain to extortion. Our results thus highlight how power asymmetries can endanger mutually beneficial interactions, and transform them into exploitative relationships. In particular, our results indicate that the extortionate strategies predicted from ZD theory could play a more prominent role in our daily interactions than previously thought.}, author = {Hilbe, Christian and Hagel, Kristin and Milinski, Manfred}, journal = {PLoS One}, number = {10}, publisher = {Public Library of Science}, title = {{Asymmetric power boosts extortion in an economic experiment}}, doi = {10.1371/journal.pone.0163867}, volume = {11}, year = {2016}, } @article{1270, abstract = {A crucial step in the early development of multicellular organisms involves the establishment of spatial patterns of gene expression which later direct proliferating cells to take on different cell fates. These patterns enable the cells to infer their global position within a tissue or an organism by reading out local gene expression levels. The patterning system is thus said to encode positional information, a concept that was formalized recently in the framework of information theory. Here we introduce a toy model of patterning in one spatial dimension, which can be seen as an extension of Wolpert's paradigmatic "French Flag" model, to patterning by several interacting, spatially coupled genes subject to intrinsic and extrinsic noise. Our model, a variant of an Ising spin system, allows us to systematically explore expression patterns that optimally encode positional information. We find that optimal patterning systems use positional cues, as in the French Flag model, together with gene-gene interactions to generate combinatorial codes for position which we call "Counter" patterns. Counter patterns can also be stabilized against noise and variations in system size or morphogen dosage by longer-range spatial interactions of the type invoked in the Turing model. The simple setup proposed here qualitatively captures many of the experimentally observed properties of biological patterning systems and allows them to be studied in a single, theoretically consistent framework.}, author = {Hillenbrand, Patrick and Gerland, Ulrich and Tkacik, Gasper}, journal = {PLoS One}, number = {9}, publisher = {Public Library of Science}, title = {{Beyond the French flag model: Exploiting spatial and gene regulatory interactions for positional information}}, doi = {10.1371/journal.pone.0163628}, volume = {11}, year = {2016}, } @article{1250, abstract = {In bacteria, replicative aging manifests as a difference in growth or survival between the two cells emerging from division. One cell can be regarded as an aging mother with a decreased potential for future survival and division, the other as a rejuvenated daughter. Here, we aimed at investigating some of the processes involved in aging in the bacterium Escherichia coli, where the two types of cells can be distinguished by the age of their cell poles. We found that certain changes in the regulation of the carbohydrate metabolism can affect aging. A mutation in the carbon storage regulator gene, csrA, leads to a dramatically shorter replicative lifespan; csrA mutants stop dividing once their pole exceeds an age of about five divisions. These old-pole cells accumulate glycogen at their old cell poles; after their last division, they do not contain a chromosome, presumably because of spatial exclusion by the glycogen aggregates. The new-pole daughters produced by these aging mothers are born young; they only express the deleterious phenotype once their pole is old. These results demonstrate how manipulations of nutrient allocation can lead to the exclusion of the chromosome and limit replicative lifespan in E. coli, and illustrate how mutations can have phenotypic effects that are specific for cells with old poles. This raises the question how bacteria can avoid the accumulation of such mutations in their genomes over evolutionary times, and how they can achieve the long replicative lifespans that have recently been reported.}, author = {Boehm, Alex and Arnoldini, Markus and Bergmiller, Tobias and Röösli, Thomas and Bigosch, Colette and Ackermann, Martin}, journal = {PLoS Genetics}, number = {4}, publisher = {Public Library of Science}, title = {{Genetic manipulation of glycogen allocation affects replicative lifespan in E coli}}, doi = {10.1371/journal.pgen.1005974}, volume = {12}, year = {2016}, } @misc{9870, abstract = {The effect of noise in the input field on an Ising model is approximated. Furthermore, methods to compute positional information in an Ising model by transfer matrices and Monte Carlo sampling are outlined.}, author = {Hillenbrand, Patrick and Gerland, Ulrich and Tkačik, Gašper}, publisher = {Public Library of Science}, title = {{Computation of positional information in an Ising model}}, doi = {10.1371/journal.pone.0163628.s002}, year = {2016}, } @misc{9873, author = {Boehm, Alex and Arnoldini, Markus and Bergmiller, Tobias and Röösli, Thomas and Bigosch, Colette and Ackermann, Martin}, publisher = {Public Library of Science}, title = {{Quantification of the growth rate reduction as a consequence of age-specific mortality}}, doi = {10.1371/journal.pgen.1005974.s015}, year = {2016}, } @misc{9869, abstract = {A lower bound on the error of a positional estimator with limited positional information is derived.}, author = {Hillenbrand, Patrick and Gerland, Ulrich and Tkačik, Gašper}, publisher = {Public Library of Science}, title = {{Error bound on an estimator of position}}, doi = {10.1371/journal.pone.0163628.s001}, year = {2016}, } @misc{9871, abstract = {The positional information in a discrete morphogen field with Gaussian noise is computed.}, author = {Hillenbrand, Patrick and Gerland, Ulrich and Tkačik, Gašper}, publisher = {Public Library of Science}, title = {{Computation of positional information in a discrete morphogen field}}, doi = {10.1371/journal.pone.0163628.s003}, year = {2016}, } @misc{9868, abstract = {The raw data file containing the experimental decisions of all our study subjects.}, author = {Hilbe, Christian and Hagel, Kristin and Milinski, Manfred}, publisher = {Public Library of Science}, title = {{Experimental data}}, doi = {10.1371/journal.pone.0163867.s009}, year = {2016}, } @article{1101, abstract = {Optical sensors based on the phenomenon of Förster resonance energy transfer (FRET) are powerful tools that have advanced the study of small molecules in biological systems. However, sensor construction is not trivial and often requires multiple rounds of engineering or an ability to screen large numbers of variants. A method that would allow the accurate rational design of FRET sensors would expedite the production of biologically useful sensors. Here, we present Rangefinder, a computational algorithm that allows rapid in silico screening of dye attachment sites in a ligand-binding protein for the conjugation of a dye molecule to act as a Förster acceptor for a fused fluorescent protein. We present three ratiometric fluorescent sensors designed with Rangefinder, including a maltose sensor with a dynamic range of >300% and the first sensors for the most abundant sialic acid in human cells, N-acetylneuraminic acid. Provided a ligand-binding protein exists, it is our expectation that this model will facilitate the design of an optical sensor for any small molecule of interest.}, author = {Mitchell, Joshua and Whitfield, Jason and Zhang, William and Henneberger, Christian and Janovjak, Harald L and O'Mara, Megan and Jackson, Colin}, journal = {ACS SENSORS}, number = {11}, pages = {1286 -- 1290}, publisher = {American Chemical Society}, title = {{Rangefinder: A semisynthetic FRET sensor design algorithm}}, doi = {10.1021/acssensors.6b00576}, volume = {1}, year = {2016}, } @article{9477, abstract = {Cytosine methylation is a DNA modification with important regulatory functions in eukaryotes. In flowering plants, sexual reproduction is accompanied by extensive DNA demethylation, which is required for proper gene expression in the endosperm, a nutritive extraembryonic seed tissue. Endosperm arises from a fusion of a sperm cell carried in the pollen and a female central cell. Endosperm DNA demethylation is observed specifically on the chromosomes inherited from the central cell in Arabidopsis thaliana, rice, and maize, and requires the DEMETER DNA demethylase in Arabidopsis. DEMETER is expressed in the central cell before fertilization, suggesting that endosperm demethylation patterns are inherited from the central cell. Down-regulation of the MET1 DNA methyltransferase has also been proposed to contribute to central cell demethylation. However, with the exception of three maize genes, central cell DNA methylation has not been directly measured, leaving the origin and mechanism of endosperm demethylation uncertain. Here, we report genome-wide analysis of DNA methylation in the central cells of Arabidopsis and rice—species that diverged 150 million years ago—as well as in rice egg cells. We find that DNA demethylation in both species is initiated in central cells, which requires DEMETER in Arabidopsis. However, we do not observe a global reduction of CG methylation that would be indicative of lowered MET1 activity; on the contrary, CG methylation efficiency is elevated in female gametes compared with nonsexual tissues. Our results demonstrate that locus-specific, active DNA demethylation in the central cell is the origin of maternal chromosome hypomethylation in the endosperm.}, author = {Park, Kyunghyuk and Kim, M. Yvonne and Vickers, Martin and Park, Jin-Sup and Hyun, Youbong and Okamoto, Takashi and Zilberman, Daniel and Fischer, Robert L. and Feng, Xiaoqi and Choi, Yeonhee and Scholten, Stefan}, issn = {1091-6490}, journal = {Proceedings of the National Academy of Sciences}, keywords = {Multidisciplinary}, number = {52}, pages = {15138--15143}, publisher = {National Academy of Sciences}, title = {{DNA demethylation is initiated in the central cells of Arabidopsis and rice}}, doi = {10.1073/pnas.1619047114}, volume = {113}, year = {2016}, } @article{9473, abstract = {Cytosine DNA methylation regulates the expression of eukaryotic genes and transposons. Methylation is copied by methyltransferases after DNA replication, which results in faithful transmission of methylation patterns during cell division and, at least in flowering plants, across generations. Transgenerational inheritance is mediated by a small group of cells that includes gametes and their progenitors. However, methylation is usually analyzed in somatic tissues that do not contribute to the next generation, and the mechanisms of transgenerational inheritance are inferred from such studies. To gain a better understanding of how DNA methylation is inherited, we analyzed purified Arabidopsis thaliana sperm and vegetative cells-the cell types that comprise pollen-with mutations in the DRM, CMT2, and CMT3 methyltransferases. We find that DNA methylation dependency on these enzymes is similar in sperm, vegetative cells, and somatic tissues, although DRM activity extends into heterochromatin in vegetative cells, likely reflecting transcription of heterochromatic transposons in this cell type. We also show that lack of histone H1, which elevates heterochromatic DNA methylation in somatic tissues, does not have this effect in pollen. Instead, levels of CG methylation in wild-type sperm and vegetative cells, as well as in wild-type microspores from which both pollen cell types originate, are substantially higher than in wild-type somatic tissues and similar to those of H1-depleted roots. Our results demonstrate that the mechanisms of methylation maintenance are similar between pollen and somatic cells, but the efficiency of CG methylation is higher in pollen, allowing methylation patterns to be accurately inherited across generations.}, author = {Hsieh, Ping-Hung and He, Shengbo and Buttress, Toby and Gao, Hongbo and Couchman, Matthew and Fischer, Robert L. and Zilberman, Daniel and Feng, Xiaoqi}, issn = {1091-6490}, journal = {Proceedings of the National Academy of Sciences}, number = {52}, pages = {15132--15137}, publisher = {National Academy of Sciences}, title = {{Arabidopsis male sexual lineage exhibits more robust maintenance of CG methylation than somatic tissues}}, doi = {10.1073/pnas.1619074114}, volume = {113}, year = {2016}, } @inproceedings{12903, author = {Schlögl, Alois and Stadlbauer, Stephan}, booktitle = {AHPC16 - Austrian HPC Meeting 2016}, location = {Grundlsee, Austria}, pages = {37}, publisher = {VSC - Vienna Scientific Cluster}, title = {{High performance computing at IST Austria: Modelling the human hippocampus}}, year = {2016}, }