TY - JOUR
AB - RNA Polymerase II pauses and backtracks during transcription, with many consequences for gene expression and cellular physiology. Here, we show that the energy required to melt double-stranded nucleic acids in the transcription bubble predicts pausing in Saccharomyces cerevisiae far more accurately than nucleosome roadblocks do. In addition, the same energy difference also determines when the RNA polymerase backtracks instead of continuing to move forward. This data-driven model corroborates—in a genome wide and quantitative manner—previous evidence that sequence-dependent thermodynamic features of nucleic acids influence both transcriptional pausing and backtracking.
AU - Lukacisin, Martin
AU - Landon, Matthieu
AU - Jajoo, Rishi
ID - 1029
IS - 3
JF - PLoS One
SN - 19326203
TI - Sequence-specific thermodynamic properties of nucleic acids influence both transcriptional pausing and backtracking in yeast
VL - 12
ER -
TY - JOUR
AB - Left-right asymmetry is a fundamental feature of higher-order brain structure; however, the molecular basis of brain asymmetry remains unclear. We recently identified structural and functional asymmetries in mouse hippocampal circuitry that result from the asymmetrical distribution of two distinct populations of pyramidal cell synapses that differ in the density of the NMDA receptor subunit GluRε2 (also known as NR2B, GRIN2B or GluN2B). By examining the synaptic distribution of ε2 subunits, we previously found that β2-microglobulin-deficient mice, which lack cell surface expression of the vast majority of major histocompatibility complex class I (MHCI) proteins, do not exhibit circuit asymmetry. In the present study, we conducted electrophysiological and anatomical analyses on the hippocampal circuitry of mice with a knockout of the paired immunoglobulin-like receptor B (PirB), an MHCI receptor. As in β2-microglobulin-deficient mice, the PirB-deficient hippocampus lacked circuit asymmetries. This finding that MHCI loss-of-function mice and PirB knockout mice have identical phenotypes suggests that MHCI signals that produce hippocampal asymmetries are transduced through PirB. Our results provide evidence for a critical role of the MHCI/PirB signaling system in the generation of asymmetries in hippocampal circuitry.
AU - Ukai, Hikari
AU - Kawahara, Aiko
AU - Hirayama, Keiko
AU - Case, Matthew J
AU - Aino, Shotaro
AU - Miyabe, Masahiro
AU - Wakita, Ken
AU - Oogi, Ryohei
AU - Kasayuki, Michiyo
AU - Kawashima, Shihomi
AU - Sugimoto, Shunichi
AU - Chikamatsu, Kanako
AU - Nitta, Noritaka
AU - Koga, Tsuneyuki
AU - Shigemoto, Ryuichi
AU - Takai, Toshiyuki
AU - Ito, Isao
ID - 682
IS - 6
JF - PLoS One
SN - 19326203
TI - PirB regulates asymmetries in hippocampal circuitry
VL - 12
ER -
TY - JOUR
AB - Mutator strains are expected to evolve when the availability and effect of beneficial mutations are high enough to counteract the disadvantage from deleterious mutations that will inevitably accumulate. As the population becomes more adapted to its environment, both availability and effect of beneficial mutations necessarily decrease and mutation rates are predicted to decrease. It has been shown that certain molecular mechanisms can lead to increased mutation rates when the organism finds itself in a stressful environment. While this may be a correlated response to other functions, it could also be an adaptive mechanism, raising mutation rates only when it is most advantageous. Here, we use a mathematical model to investigate the plausibility of the adaptive hypothesis. We show that such a mechanism can be mantained if the population is subjected to diverse stresses. By simulating various antibiotic treatment schemes, we find that combination treatments can reduce the effectiveness of second-order selection on stress-induced mutagenesis. We discuss the implications of our results to strategies of antibiotic therapy.
AU - Lukacisinova, Marta
AU - Novak, Sebastian
AU - Paixao, Tiago
ID - 696
IS - 7
JF - PLoS Computational Biology
SN - 1553734X
TI - Stress induced mutagenesis: Stress diversity facilitates the persistence of mutator genes
VL - 13
ER -
TY - JOUR
AB - The rising prevalence of antibiotic resistant bacteria is an increasingly serious public health challenge. To address this problem, recent work ranging from clinical studies to theoretical modeling has provided valuable insights into the mechanisms of resistance, its emergence and spread, and ways to counteract it. A deeper understanding of the underlying dynamics of resistance evolution will require a combination of experimental and theoretical expertise from different disciplines and new technology for studying evolution in the laboratory. Here, we review recent advances in the quantitative understanding of the mechanisms and evolution of antibiotic resistance. We focus on key theoretical concepts and new technology that enables well-controlled experiments. We further highlight key challenges that can be met in the near future to ultimately develop effective strategies for combating resistance.
AU - Lukacisinova, Marta
AU - Bollenbach, Mark Tobias
ID - 1027
JF - Current Opinion in Biotechnology
TI - Toward a quantitative understanding of antibiotic resistance evolution
VL - 46
ER -
TY - JOUR
AB - The history of auxin and cytokinin biology including the initial discoveries by father–son duo Charles Darwin and Francis Darwin (1880), and Gottlieb Haberlandt (1919) is a beautiful demonstration of unceasing continuity of research. Novel findings are integrated into existing hypotheses and models and deepen our understanding of biological principles. At the same time new questions are triggered and hand to hand with this new methodologies are developed to address these new challenges.
AU - Hurny, Andrej
AU - Benková, Eva
ID - 1024
JF - Auxins and Cytokinins in Plant Biology
SN - 10643745
TI - Methodological advances in auxin and cytokinin biology
VL - 1569
ER -
TY - JOUR
AB - How the organization of genes on a chromosome shapes adaptation is essential for understanding evolutionary paths. Here, we investigate how adaptation to rapidly increasing levels of antibiotic depends on the chromosomal neighborhood of a drug-resistance gene inserted at different positions of the Escherichia coli chromosome. Using a dual-fluorescence reporter that allows us to distinguish gene amplifications from other up-mutations, we track in real-time adaptive changes in expression of the drug-resistance gene. We find that the relative contribution of several mutation types differs systematically between loci due to properties of neighboring genes: essentiality, expression, orientation, termination, and presence of duplicates. These properties determine rate and fitness effects of gene amplification, deletions, and mutations compromising transcriptional termination. Thus, the adaptive potential of a gene under selection is a system-property with a complex genetic basis that is specific for each chromosomal locus, and it can be inferred from detailed functional and genomic data.
AU - Steinrück, Magdalena
AU - Guet, Calin C
ID - 704
JF - eLife
SN - 2050084X
TI - Complex chromosomal neighborhood effects determine the adaptive potential of a gene under selection
VL - 6
ER -
TY - JOUR
AB - The segregation of different cell types into distinct tissues is a fundamental process in metazoan development. Differences in cell adhesion and cortex tension are commonly thought to drive cell sorting by regulating tissue surface tension (TST). However, the role that differential TST plays in cell segregation within the developing embryo is as yet unclear. Here, we have analyzed the role of differential TST for germ layer progenitor cell segregation during zebrafish gastrulation. Contrary to previous observations that differential TST drives germ layer progenitor cell segregation in vitro, we show that germ layers display indistinguishable TST within the gastrulating embryo, arguing against differential TST driving germ layer progenitor cell segregation in vivo. We further show that the osmolarity of the interstitial fluid (IF) is an important factor that influences germ layer TST in vivo, and that lower osmolarity of the IF compared with standard cell culture medium can explain why germ layers display differential TST in culture but not in vivo. Finally, we show that directed migration of mesendoderm progenitors is required for germ layer progenitor cell segregation and germ layer formation.
AU - Krens, Gabriel
AU - Veldhuis, Jim
AU - Barone, Vanessa
AU - Capek, Daniel
AU - Maître, Jean-Léon
AU - Brodland, Wayne
AU - Heisenberg, Carl-Philipp J
ID - 676
IS - 10
JF - Development
SN - 09501991
TI - Interstitial fluid osmolarity modulates the action of differential tissue surface tension in progenitor cell segregation during gastrulation
VL - 144
ER -
TY - JOUR
AB - During embryonic development, mechanical forces are essential for cellular rearrangements driving tissue morphogenesis. Here, we show that in the early zebrafish embryo, friction forces are generated at the interface between anterior axial mesoderm (prechordal plate, ppl) progenitors migrating towards the animal pole and neurectoderm progenitors moving in the opposite direction towards the vegetal pole of the embryo. These friction forces lead to global rearrangement of cells within the neurectoderm and determine the position of the neural anlage. Using a combination of experiments and simulations, we show that this process depends on hydrodynamic coupling between neurectoderm and ppl as a result of E-cadherin-mediated adhesion between those tissues. Our data thus establish the emergence of friction forces at the interface between moving tissues as a critical force-generating process shaping the embryo.
AU - Smutny, Michael
AU - Ákos, Zsuzsa
AU - Grigolon, Silvia
AU - Shamipour, Shayan
AU - Ruprecht, Verena
AU - Capek, Daniel
AU - Behrndt, Martin
AU - Papusheva, Ekaterina
AU - Tada, Masazumi
AU - Hof, Björn
AU - Vicsek, Tamás
AU - Salbreux, Guillaume
AU - Heisenberg, Carl-Philipp J
ID - 661
JF - Nature Cell Biology
SN - 14657392
TI - Friction forces position the neural anlage
VL - 19
ER -
TY - CONF
AB - The notion of treewidth of graphs has been exploited for faster algorithms for several problems arising in verification and program analysis. Moreover, various notions of balanced tree decompositions have been used for improved algorithms supporting dynamic updates and analysis of concurrent programs. In this work, we present a tool for constructing tree-decompositions of CFGs obtained from Java methods, which is implemented as an extension to the widely used Soot framework. The experimental results show that our implementation on real-world Java benchmarks is very efficient. Our tool also provides the first implementation for balancing tree-decompositions. In summary, we present the first tool support for exploiting treewidth in the static analysis problems on Java programs.
AU - Chatterjee, Krishnendu
AU - Goharshady, Amir
AU - Pavlogiannis, Andreas
ED - D'Souza, Deepak
ID - 949
SN - 03029743
TI - JTDec: A tool for tree decompositions in soot
VL - 10482
ER -
TY - CONF
AB - We study the problem of developing efficient approaches for proving worst-case bounds of non-deterministic recursive programs. Ranking functions are sound and complete for proving termination and worst-case bounds of non-recursive programs. First, we apply ranking functions to recursion, resulting in measure functions, and show that they provide a sound and complete approach to prove worst-case bounds of non-deterministic recursive programs. Our second contribution is the synthesis of measure functions in non-polynomial forms. We show that non-polynomial measure functions with logarithm and exponentiation can be synthesized through abstraction of logarithmic or exponentiation terms, Farkas’ Lemma, and Handelman’s Theorem using linear programming. While previous methods obtain worst-case polynomial bounds, our approach can synthesize bounds of the form O(n log n) as well as O(nr) where r is not an integer. We present experimental results to demonstrate that our approach can efficiently obtain worst-case bounds of classical recursive algorithms such as Merge-Sort, Closest-Pair, Karatsuba’s algorithm and Strassen’s algorithm.
AU - Chatterjee, Krishnendu
AU - Fu, Hongfei
AU - Goharshady, Amir
ED - Majumdar, Rupak
ED - Kunčak, Viktor
ID - 639
SN - 978-331963389-3
TI - Non-polynomial worst case analysis of recursive programs
VL - 10427
ER -
TY - JOUR
AB - For any number field we calculate the exact proportion of rational numbers which are everywhere locally a norm but not globally a norm from the number field.
AU - Timothy Browning
AU - Newton, Rachel
ID - 262
IS - 2
JF - Mathematika
TI - The proportion of failures of the Hasse norm principle
VL - 62
ER -
TY - JOUR
AB - We count rational points of bounded height on the Cayley ruled cubic surface and interpret the result in the context of general conjectures due to Batyrev and Tschinkel.
AU - de la Bretèche, Régis
AU - Timothy Browning
AU - Salberger, Per
ID - 263
IS - 1
JF - European Journal of Mathematics
TI - Counting rational points on the Cayley ruled cubic
VL - 2
ER -
TY - JOUR
AB - Given a family of varieties over a number field, we determine conditions under which there is a Brauer-Manin obstruction to weak approximation for 100% of the fibres which are everywhere locally soluble.
AU - Bright, Maritn J
AU - Timothy Browning
AU - Loughran, Daniel
ID - 264
IS - 7
JF - Compositio Mathematica
TI - Failures of weak approximation in families
VL - 152
ER -
TY - JOUR
AB - Balance of cortical excitation and inhibition (EI) is thought to be disrupted in several neuropsychiatric conditions, yet it is not clear how it is maintained in the healthy human brain. When EI balance is disturbed during learning and memory in animal models, it can be restabilized via formation of inhibitory replicas of newly formed excitatory connections. Here we assess evidence for such selective inhibitory rebalancing in humans. Using fMRI repetition suppression we measure newly formed cortical associations in the human brain. We show that expression of these associations reduces over time despite persistence in behavior, consistent with inhibitory rebalancing. To test this, we modulated excitation/inhibition balance with transcranial direct current stimulation (tDCS). Using ultra-high-field (7T) MRI and spectroscopy, we show that reducing GABA allows cortical associations to be re-expressed. This suggests that in humans associative memories are stored in balanced excitatory-inhibitory ensembles that lie dormant unless latent inhibitory connections are unmasked.
AU - Barron, H.C.
AU - Vogels, Tim P
AU - Emir, U.E.
AU - Makin, T.R.
AU - O’Shea, J.
AU - Clare, S.
AU - Jbabdi, S.
AU - Dolan, R.J.
AU - Behrens, T.E.J.
ID - 8020
IS - 1
JF - Neuron
SN - 0896-6273
TI - Unmasking latent inhibitory connections in human cortex to reveal dormant cortical memories
VL - 90
ER -
TY - CONF
AB - 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.
AU - Martius, Georg S
AU - Hostettler, Rafael
AU - Knoll, Alois
AU - Der, Ralf
ID - 8094
SN - 9780262339360
T2 - Proceedings of the Artificial Life Conference 2016
TI - Self-organized control of an tendon driven arm by differential extrinsic plasticity
VL - 28
ER -
TY - GEN
AB - The stimulus selectivity of synaptic currents in cortical neurons often shows a co-tuning of excitation and inhibition, but the mechanisms that underlie the emergence and plasticity of this co-tuning are not fully understood. Using a computational model, we show that an interaction of excitatory and inhibitory synaptic plasticity reproduces both the developmental and – when combined with a disinhibitory gate – the adult plasticity of excitatory and inhibitory receptive fields in auditory cortex. The co-tuning arises from inhibitory plasticity that balances excitation and inhibition, while excitatory stimulus selectivity can result from two different mechanisms. Inhibitory inputs with a broad stimulus tuning introduce a sliding threshold as in Bienenstock-Cooper-Munro rules, introducing an excitatory stimulus selectivity at the cost of a broader inhibitory receptive field. Alternatively, input asymmetries can be amplified by synaptic competition. The latter leaves any receptive field plasticity transient, a prediction we verify in recordings in auditory cortex.
AU - Clopath, Claudia
AU - Vogels, Tim P
AU - Froemke, Robert C.
AU - Sprekeler, Henning
ID - 8128
T2 - bioRxiv
TI - Receptive field formation by interacting excitatory and inhibitory synaptic plasticity
ER -
TY - JOUR
AB - Background: Anticancer vaccines could represent a valuable complementary strategy to established therapies, especially in settings of early stage and minimal residual disease. HER-2 is an important target for immunotherapy and addressed by the monoclonal antibody trastuzumab. We have previously generated HER-2 mimotope peptides from phage display libraries. The synthesized peptides were coupled to carriers and applied for epitope-specific induction of trastuzumab-like IgG. For simplification and to avoid methodological limitations of synthesis and coupling chemistry, we herewith present a novel and optimized approach by using adeno-associated viruses (AAV) as effective and high-density mimotope-display system, which can be directly used for vaccination. Methods: An AAV capsid display library was constructed by genetically incorporating random peptides in a plasmid encoding the wild-type AAV2 capsid protein. AAV clones, expressing peptides specifically reactive to trastuzumab, were employed to immunize BALB/c mice. Antibody titers against human HER-2 were determined, and the isotype composition and functional properties of these were tested. Finally, prophylactically immunized mice were challenged with human HER-2 transfected mouse D2F2/E2 cells. Results: HER-2 mimotope AAV-vaccines induced antibodies specific to human HER-2. Two clones were selected for immunization of mice, which were subsequently grafted D2F2/E2 cells. Both mimotope AAV clones delayed the growth of tumors significantly, as compared to controls. Conclusion: In this study, a novel mimotope AAV-based platform was created allowing the isolation of mimotopes, which can be directly used as anticancer vaccines. The example of trastuzumab AAV-mimotopes demonstrates that this vaccine strategy could help to establish active immunotherapy for breast-cancer patients.
AU - Singer, Josef
AU - Manzano-Szalai, Krisztina
AU - Fazekas, Judit
AU - Thell, Kathrin
AU - Bentley-Lukschal, Anna
AU - Stremnitzer, Caroline
AU - Roth-Walter, Franziska
AU - Weghofer, Margit
AU - Ritter, Mirko
AU - Pino Tossi, Kerstin
AU - Hörer, Markus
AU - Michaelis, Uwe
AU - Jensen-Jarolim, Erika
ID - 8241
IS - 7
JF - OncoImmunology
SN - 2162-402X
TI - Proof of concept study with an HER-2 mimotope anticancer vaccine deduced from a novel AAV-mimotope library platform
VL - 5
ER -
TY - CONF
AB - While showing great promise, Bitcoin requires users to wait tens of minutes for transactions to commit, and even then, offering only probabilistic guarantees. This paper introduces ByzCoin, a novel Byzantine consensus protocol that leverages scalable collective signing to commit Bitcoin transactions irreversibly within seconds. ByzCoin achieves Byzantine consensus while preserving Bitcoin’s open membership by dynamically forming hash power-proportionate consensus groups that represent recently-successful block miners. ByzCoin employs communication trees to optimize transaction commitment and verification under normal operation while guaranteeing safety and liveness under Byzantine faults, up to a near-optimal tolerance of f faulty group members among 3f + 2 total. ByzCoin mitigates double spending and selfish mining attacks by producing collectively signed transaction blocks within one minute of transaction submission. Tree-structured communication further reduces this latency to less than 30 seconds. Due to these optimizations, ByzCoin achieves a throughput higher than Paypal currently handles, with a confirmation latency of 15-20 seconds.
AU - Kokoris Kogias, Eleftherios
AU - Jovanovic, Philipp
AU - Gailly, Nicolas
AU - Khoffi, Ismail
AU - Gasser, Linus
AU - Ford, Bryan
ID - 8302
SN - 9781931971324
T2 - Proceedings of the 25th USENIX Conference on Security Symposium
TI - Enhancing bitcoin security and performance with strong consistency via collective signing
ER -
TY - JOUR
AB - 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.
AU - Bogomolov, Sergiy
AU - Donzé, Alexandre
AU - Frehse, Goran
AU - Grosu, Radu
AU - Johnson, Taylor
AU - Ladan, Hamed
AU - Podelski, Andreas
AU - Wehrle, Martin
ID - 1705
IS - 4
JF - International Journal on Software Tools for Technology Transfer
TI - Guided search for hybrid systems based on coarse-grained space abstractions
VL - 18
ER -
TY - JOUR
AB - We calculate admissible values of r such that a square-free polynomial with integer coefficients, no fixed prime divisor and irreducible factors of degree at most 3 takes infinitely many values that are a product of at most r distinct primes.
AU - Browning, Timothy D
AU - Booker, Andrew
ID - 173
JF - Discrete Analysis
TI - Square-free values of reducible polynomials
VL - 8
ER -
TY - JOUR
AB - We consider Conditional random fields (CRFs) with pattern-based potentials defined on a chain. In this model the energy of a string (labeling) (Formula presented.) is the sum of terms over intervals [i, j] where each term is non-zero only if the substring (Formula presented.) equals a prespecified pattern w. Such CRFs can be naturally applied to many sequence tagging problems. We present efficient algorithms for the three standard inference tasks in a CRF, namely computing (i) the partition function, (ii) marginals, and (iii) computing the MAP. Their complexities are respectively (Formula presented.), (Formula presented.) and (Formula presented.) where L is the combined length of input patterns, (Formula presented.) is the maximum length of a pattern, and D is the input alphabet. This improves on the previous algorithms of Ye et al. (NIPS, 2009) whose complexities are respectively (Formula presented.), (Formula presented.) and (Formula presented.), where (Formula presented.) is the number of input patterns. In addition, we give an efficient algorithm for sampling, and revisit the case of MAP with non-positive weights.
AU - Kolmogorov, Vladimir
AU - Takhanov, Rustem
ID - 1794
IS - 1
JF - Algorithmica
TI - Inference algorithms for pattern-based CRFs on sequence data
VL - 76
ER -
TY - JOUR
AB - 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.
AU - Klimova, Anna
AU - Rudas, Tamás
ID - 1833
JF - Journal of Multivariate Analysis
TI - On the closure of relational models
VL - 143
ER -
TY - JOUR
AB - 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.
AU - Lee, Jioon
AU - Schnelli, Kevin
ID - 1881
IS - 1-2
JF - Probability Theory and Related Fields
TI - Extremal eigenvalues and eigenvectors of deformed Wigner matrices
VL - 164
ER -
TY - JOUR
AB - Kinetics of electrochemical reactions are several orders of magnitude slower in solids than in liquids as a result of the much lower ion diffusivity. Yet, the solid state maximizes the density of redox species, which is at least two orders of magnitude lower in liquids because of solubility limitations. With regard to electrochemical energy storage devices, this leads to high-energy batteries with limited power and high-power supercapacitors with a well-known energy deficiency. For such devices the ideal system should endow the liquid state with a density of redox species close to the solid state. Here we report an approach based on biredox ionic liquids to achieve bulk-like redox density at liquid-like fast kinetics. The cation and anion of these biredox ionic liquids bear moieties that undergo very fast reversible redox reactions. As a first demonstration of their potential for high-capacity/high-rate charge storage, we used them in redox supercapacitors. These ionic liquids are able to decouple charge storage from an ion-accessible electrode surface, by storing significant charge in the pores of the electrodes, to minimize self-discharge and leakage current as a result of retaining the redox species in the pores, and to raise working voltage due to their wide electrochemical window.
AU - Mourad, Eléonore
AU - Coustan, Laura
AU - Lannelongue, Pierre
AU - Zigah, Dodzi
AU - Mehdi, Ahmad
AU - Vioux, André
AU - Freunberger, Stefan Alexander
AU - Favier, Frédéric
AU - Fontaine, Olivier
ID - 7279
IS - 4
JF - Nature Materials
SN - 1476-1122
TI - Biredox ionic liquids with solid-like redox density in the liquid state for high-energy supercapacitors
VL - 16
ER -
TY - JOUR
AB - Redox mediators facilitate the oxidation of the highly insulating discharge product in metal–oxygen batteries during recharge and offer opportunities to achieve high reversible capacities. Now a design principle for selecting redox mediators that can recharge the batteries more efficiently is suggested.
AU - Freunberger, Stefan Alexander
ID - 7297
IS - 6
JF - Nature Energy
SN - 2058-7546
TI - Batteries: Charging ahead rationally
VL - 1
ER -
TY - JOUR
AB - Normal leaf margin development is important for leaf morphogenesis and contributes to diverse leaf shapes in higher plants. We here show the crucial roles of an atypical type II phosphatidylinositol 4-kinase, PI4Kγ5, in Arabidopsis leaf margin development. PI4Kγ5 presents a dynamics expression pattern along with leaf development and a T-DNA mutant lacking PI4Kγ5, pi4kγ5–1, presents serrated leaves, which is resulted from the accelerated cell division and increased auxin concentration at serration tips. Studies revealed that PI4Kγ5 interacts with and phosphorylates a membrane-bound NAC transcription factor, ANAC078. Previous studies demonstrated that membrane-bound transcription factors regulate gene transcription by undergoing proteolytic process to translocate into nucleus, and ANAC078 undergoes proteolysis by cleaving off the transmembrane region and carboxyl terminal. Western blot analysis indeed showed that ANAC078 deleting of carboxyl terminal is significantly reduced in pi4kγ5–1, indicating that PI4Kγ5 is important for the cleavage of ANAC078. This is consistent with the subcellular localization observation showing that fluorescence by GFP-ANAC078 is detected at plasma membrane but not nucleus in pi4kγ5–1 mutant and that expression of ANAC078 deleting of carboxyl terminal, driven by PI4Kγ5 promoter, could rescue the leaf serration defects of pi4kγ5–1. Further analysis showed that ANAC078 suppresses the auxin synthesis by directly binding and regulating the expression of auxin synthesis-related genes. These results indicate that PI4Kγ5 interacts with ANAC078 to negatively regulate auxin synthesis and hence influences cell proliferation and leaf development, providing informative clues for the regulation of in situ auxin synthesis and cell division, as well as the cleavage and functional mechanism of membrane-bound transcription factors.
AU - Tang, Yong
AU - Zhao, Chun-Yan
AU - Tan, Shutang
AU - Xue, Hong-Wei
ID - 7599
IS - 8
JF - PLOS Genetics
SN - 1553-7404
TI - Arabidopsis type II phosphatidylinositol 4-kinase PI4Kγ5 regulates auxin biosynthesis and leaf margin development through interacting with membrane-bound transcription factor ANAC078
VL - 12
ER -
TY - JOUR
AB - Genome-wide association studies (GWAS) have identified thousands of genetic variants associated with human complex traits. However, the genes or functional DNA elements through which these variants exert their effects on the traits are often unknown. We propose a method (called SMR) that integrates summary-level data from GWAS with data from expression quantitative trait locus (eQTL) studies to identify genes whose expression levels are associated with a complex trait because of pleiotropy. We apply the method to five human complex traits using GWAS data on up to 339,224 individuals and eQTL data on 5,311 individuals, and we prioritize 126 genes (for example, TRAF1 and ANKRD55 for rheumatoid arthritis and SNX19 and NMRAL1 for schizophrenia), of which 25 genes are new candidates; 77 genes are not the nearest annotated gene to the top associated GWAS SNP. These genes provide important leads to design future functional studies to understand the mechanism whereby DNA variation leads to complex trait variation.
AU - Zhu, Zhihong
AU - Zhang, Futao
AU - Hu, Han
AU - Bakshi, Andrew
AU - Robinson, Matthew Richard
AU - Powell, Joseph E
AU - Montgomery, Grant W
AU - Goddard, Michael E
AU - Wray, Naomi R
AU - Visscher, Peter M
AU - Yang, Jian
ID - 7737
IS - 5
JF - Nature Genetics
SN - 1061-4036
TI - Integration of summary data from GWAS and eQTL studies predicts complex trait gene targets
VL - 48
ER -
TY - JOUR
AB - Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers prefer to treat concurrent code as if it were wait-free, guaranteeing that all operations always make progress. Unfortunately, designing wait-free algorithms is generally a very complex task, and the resulting algorithms are not always efficient. Although obtaining efficient wait-free algorithms has been a long-time goal for the theory community, most nonblocking commercial code is only lock-free. This article suggests a simple solution to this problem.We show that for a large class of lock-free algorithms, under scheduling conditions that approximate those found in commercial hardware architectures, lock-free algorithms behave as if they are wait-free. In other words, programmers can continue to design simple lock-free algorithms instead of complex wait-free ones, and in practice, they will get wait-free progress. Our main contribution is a new way of analyzing a general class of lock-free algorithms under a stochastic scheduler. Our analysis relates the individual performance of processes to the global performance of the system using Markov chain lifting between a complex per-process chain and a simpler system progress chain. We show that lock-free algorithms are not only wait-free with probability 1 but that in fact a general subset of lock-free algorithms can be closely bounded in terms of the average number of steps required until an operation completes. To the best of our knowledge, this is the first attempt to analyze progress conditions, typically stated in relation to a worst-case adversary, in a stochastic model capturing their expected asymptotic behavior.
AU - Alistarh, Dan-Adrian
AU - Censor Hillel, Keren
AU - Shavit, Nir
ID - 786
IS - 4
JF - Journal of the ACM
TI - Are lock free concurrent algorithms practically wait free
VL - 63
ER -
TY - JOUR
AB - NF-κB signaling is a central pathway of immunity and integrates signal transduction upon a wide array of inflammatory stimuli. Noncanonical NF-κB signaling is activated by a small subset of TNF family receptors and characterized by NF-κB2/p52 transcriptional activity. The medical relevance of this pathway has recently re-emerged from the discovery of primary immunodeficiency patients that have loss-of-function mutations in the MAP3K14 gene encoding NIK. Nevertheless, knowledge of protein interactions that regulate noncanonical NF-κB signaling is sparse. Here we report a detailed state-of-the-art mass spectrometry-based protein–protein interaction network including the noncanonical NF-κB signaling nodes TRAF2, TRAF3, IKKα, NIK, and NF-κB2/p100. The value of the data set was confirmed by the identification of interactions already known to regulate this pathway. In addition, a remarkable number of novel interactors were identified. We provide validation of the novel NIK and IKKα interactor FKBP8, which may regulate processes downstream of noncanonical NF-κB signaling. To understand perturbed noncanonical NF-κB signaling in the context of misregulated NIK in disease, we also provide a differential interactome of NIK mutants that cause immunodeficiency. Altogether, this data set not only provides critical insight into how protein–protein interactions can regulate immune signaling but also offers a novel resource on noncanonical NF-κB signaling.
AU - Willmann, Katharina L
AU - Roberto Sacco
AU - Martins, Rui
AU - Garncarz, Wojciech
AU - Krolo, Ana
AU - Knapp, Sylvia
AU - Bennett, Keiryn L
AU - Boztug, Kaan
ID - 460
IS - 9
JF - Journal of Proteome Research
TI - Expanding the interactome of the noncanonical NF-κB signaling pathway
VL - 15
ER -
TY - CONF
AB - 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.
AU - Chatterjee, Krishnendu
AU - Ibsen-Jensen, Rasmus
ID - 478
TI - The complexity of deciding legality of a single step of magic: The gathering
VL - 285
ER -
TY - CONF
AB - 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.
AU - Chatterjee, Krishnendu
AU - Doyen, Laurent
ID - 480
TI - Perfect-information stochastic games with generalized mean-payoff objectives
VL - 05-08-July-2016
ER -
TY - JOUR
AB - The CLE (CLAVATA3/Embryo Surrounding Region-related) peptides are small secreted signaling peptides that are primarily involved in the regulation of stem cell homeostasis in different plant meristems. Particularly, the characterization of the CLE41-PXY/TDR signaling pathway has greatly advanced our understanding on the potential roles of CLE peptides in vascular development and wood formation. Nevertheless, our knowledge on this gene family in a tree species is limited. In a recent study, we reported on a systematically investigation of the CLE gene family in Populus trichocarpa . The potential roles of PtCLE genes were studied by comparative analysis and transcriptional pro fi ling. Among fi fty PtCLE members, many PtCLE proteins share identical CLE motifs or contain the same CLE motif as that of AtCLEs, while PtCLE genes exhibited either comparable or distinct expression patterns comparing to their Arabidopsis counterparts. These fi ndings indicate the existence of both functional conservation and functional divergence between PtCLEs and their AtCLE orthologues. Our results provide valuable resources for future functional investigations of these critical signaling molecules in woody plants.
AU - Liu, Zhijun
AU - Yang, Nan
AU - Lv, Yanting
AU - Pan, Lixia
AU - Lv, Shuo
AU - Han, Huibin
AU - Wang, Guodong
ID - 510
IS - 6
JF - Plant Signaling & Behavior
TI - The CLE gene family in Populus trichocarpa
VL - 11
ER -
TY - GEN
AB - 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.
AU - Chatterjee, Krishnendu
AU - Pavlogiannis, Andreas
AU - Velner, Yaron
ID - 5445
SN - 2664-1690
TI - Quantitative interprocedural analysis
ER -
TY - GEN
AB - We study the problem of developing efficient approaches for proving termination of recursive programs with one-dimensional arrays. Ranking functions serve as a sound and complete approach for proving termination of non-recursive programs without array operations. First, we generalize ranking functions to the notion of measure functions, and prove that measure functions (i) provide a sound method to prove termination of recursive programs (with one-dimensional arrays), and (ii) is both sound and complete over recursive programs without array operations. Our second contribution is the synthesis of measure functions of specific forms in polynomial time. More precisely, we prove that (i) polynomial measure functions over recursive programs can be synthesized in polynomial time through Farkas’ Lemma and Handelman’s Theorem, and (ii) measure functions involving logarithm and exponentiation can be synthesized in polynomial time through abstraction of logarithmic or exponential terms and Handelman’s Theorem. A key application of our method is the worst-case analysis of recursive programs. While previous methods obtain worst-case polynomial bounds of the form O(n^k), where k is an integer, our polynomial time methods can synthesize bounds of the form O(n log n), as well as O(n^x), where x is not an integer. We show the applicability of our automated technique to obtain worst-case complexity of classical recursive algorithms such as (i) Merge-Sort, the divideand-
conquer algorithm for the Closest-Pair problem, where we obtain O(n log n) worst-case bound, and (ii) Karatsuba’s algorithm for polynomial multiplication and Strassen’s algorithm for matrix multiplication, where we obtain O(n^x) bound, where x is not an integer and close to the best-known bounds for the respective algorithms. Finally, we present experimental results to demonstrate the
effectiveness of our approach.
AU - Anonymous, 1
AU - Anonymous, 2
AU - Anonymous, 3
ID - 5446
SN - 2664-1690
TI - Termination and worst-case analysis of recursive programs
ER -
TY - GEN
AB - We consider the problem of developing automated techniques to aid the average-case complexity analysis of programs. Several classical textbook algorithms have quite efficient average-case complexity, whereas the corresponding worst-case bounds are either inefficient (e.g., QUICK-SORT), or completely ineffective (e.g., COUPONCOLLECTOR). Since the main focus of average-case analysis is to obtain efficient bounds, we consider bounds that are either logarithmic,
linear, or almost-linear (O(log n), O(n), O(n · log n),
respectively, where n represents the size of the input). Our main contribution is a sound approach for deriving such average-case bounds for randomized recursive programs. Our approach is efficient (a simple linear-time algorithm), and it is based on (a) the analysis of recurrence relations induced by randomized algorithms, and (b) a guess-and-check technique. Our approach can infer the asymptotically optimal average-case bounds for classical randomized algorithms, including RANDOMIZED-SEARCH, QUICKSORT, QUICK-SELECT, COUPON-COLLECTOR, where the worstcase
bounds are either inefficient (such as linear as compared to logarithmic of average-case, or quadratic as compared to linear or almost-linear of average-case), or ineffective. We have implemented our approach, and the experimental results show that we obtain the bounds efficiently for various classical algorithms.
AU - Anonymous, 1
AU - Anonymous, 2
AU - Anonymous, 3
ID - 5447
SN - 2664-1690
TI - Average-case analysis of programs: Automated recurrence analysis for almost-linear bounds
ER -
TY - GEN
AB - We present a new dynamic partial-order reduction method for stateless model checking of concurrent programs. A common approach for exploring program behaviors relies on enumerating the traces of the program, without storing the visited states (aka stateless exploration). As the number of distinct traces grows exponentially, dynamic partial-order reduction (DPOR) techniques have been successfully used to partition the space of traces into equivalence classes (Mazurkiewicz partitioning), with the goal of exploring only few representative traces from each class.
We introduce a new equivalence on traces under sequential consistency semantics, which we call the observation equivalence. Two traces are observationally equivalent if every read event observes the same write event in both traces. While the traditional Mazurkiewicz equivalence is control-centric, our new definition is data-centric. We show that our observation equivalence is coarser than the Mazurkiewicz equivalence, and in many cases even exponentially coarser. We devise a DPOR exploration of the trace space, called data-centric DPOR, based on the observation equivalence.
1. For acyclic architectures, our algorithm is guaranteed to explore exactly one representative trace from each observation class, while spending polynomial time per class. Hence, our algorithm is optimal wrt the observation equivalence, and in several cases explores exponentially fewer traces than any enumerative method based on the Mazurkiewicz equivalence.
2. For cyclic architectures, we consider an equivalence between traces which is finer than the observation equivalence; but coarser than the Mazurkiewicz equivalence, and in some cases is exponentially coarser. Our data-centric DPOR algorithm remains optimal under this trace equivalence.
Finally, we perform a basic experimental comparison between the existing Mazurkiewicz-based DPOR and our data-centric DPOR on a set of academic benchmarks. Our results show a significant reduction in both running time and the number of explored equivalence classes.
AU - Anonymous, 1
AU - Anonymous, 2
AU - Anonymous, 3
AU - Anonymous, 4
ID - 5448
SN - 2664-1690
TI - Data-centric dynamic partial order reduction
ER -
TY - GEN
AB - 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.
AU - Pavlogiannis, Andreas
AU - Tkadlec, Josef
AU - Chatterjee, Krishnendu
AU - Nowak, Martin
ID - 5449
SN - 2664-1690
TI - Amplification on undirected population structures: Comets beat stars
ER -
TY - GEN
AU - Pavlogiannis, Andreas
AU - Tkadlec, Josef
AU - Chatterjee, Krishnendu
AU - Nowak, Martin
ID - 5451
SN - 2664-1690
TI - Strong amplifiers of natural selection
ER -
TY - GEN
AU - Pavlogiannis, Andreas
AU - Tkadlec, Josef
AU - Chatterjee, Krishnendu
AU - Nowak, Martin
ID - 5452
SN - 2664-1690
TI - Arbitrarily strong amplifiers of natural selection
ER -
TY - GEN
AU - Pavlogiannis, Andreas
AU - Tkadlec, Josef
AU - Chatterjee, Krishnendu
AU - Nowak, Martin
ID - 5453
SN - 2664-1690
TI - Arbitrarily strong amplifiers of natural selection
ER -
TY - DATA
AB - We collected flower colour information on species in the tribe Antirrhineae from taxonomic literature. We also retreived molecular data from GenBank for as many of these species as possible to estimate phylogenetic relationships among these taxa. We then used the R package 'diversitree' to examine patterns of evolutionary transitions between anthocyanin and yellow pigmentation across the phylogeny.
For full details of the methods see:
Ellis TJ and Field DL "Repeated gains in yellow and anthocyanin pigmentation in flower colour transitions in the Antirrhineae”, Annals of Botany (in press)
AU - Ellis, Thomas
AU - Field, David
ID - 5550
TI - Flower colour data and phylogeny (NEXUS) files
ER -
TY - DATA
AB - Data from array experiments investigating pollinator behaviour on snapdragons in controlled conditions, and their effect on plant mating. Data were collected as part of Tom Ellis' PhD thesis , submitted February 2016.
We placed a total of 36 plants in a grid inside a closed organza tent, with a single hive of commercially bred bumblebees (Bombus hortorum). We used only the yellow-flowered Antirrhinum majus striatum and the magenta-flowered Antirrhinum majus pseudomajus, at ratios of 6:36, 12:24, 18:18, 24:12 and 30:6.
After 24 hours to learn how to deal with snapdragons, I observed pollinators foraging on plants, and recorded the transitions between plants. Thereafter seeds on plants were allowed to develops. A sample of these were grown to maturity when their flower colour could be determined, and they were scored as yellow, magenta, or hybrid.
AU - Ellis, Thomas
ID - 5551
TI - Data on pollinator observations and offpsring phenotypes
ER -
TY - DATA
AB - Data on pollinator visitation to wild snapdragons in a natural hybrid zone, collected as part of Tom Ellis' PhD thesis (submitted February 2016).
Snapdragon flowers have a mouth-like structure which pollinators must open to access nectar. We placed 5mm cellophane tags in these mouths, which are held in place by the pressure of the flower until a pollinator visits. When she opens the flower, the tag drops out, and one can infer a visit. We surveyed plants over multiple days in 2010, 2011 and 2012.
Also included are data on phenotypic and demographic variables which may be explanatory variables for pollinator visitation.
AU - Ellis, Thomas
ID - 5552
TI - Pollinator visitation data for wild Antirrhinum majus plants, with phenotypic and frequency data.
ER -
TY - DATA
AB - Genotypic, phenotypic and demographic data for 2128 wild snapdragons and 1127 open-pollinated progeny from a natural hybrid zone, collected as part of Tom Ellis' PhD thesis (submitted) February 2016).
Tissue samples were sent to LGC Genomics in Berlin for DNA extraction, and genotyping at 70 SNP markers by KASPR genotyping. 29 of these SNPs failed to amplify reliably, and have been removed from this dataset.
Other data were retreived from an online database of this population at www.antspec.org.
AU - Field, David
AU - Ellis, Thomas
ID - 5553
KW - paternity assignment
KW - pedigree
KW - matting patterns
KW - assortative mating
KW - Antirrhinum majus
KW - frequency-dependent selection
KW - plant-pollinator interaction
TI - Inference of mating patterns among wild snapdragons in a natural hybrid zone in 2012
ER -
TY - DATA
AB - This FIJI script calculates the population average of the migration speed as a function of time of all cells from wide field microscopy movies.
AU - Hauschild, Robert
ID - 5555
KW - cell migration
KW - wide field microscopy
KW - FIJI
TI - Fiji script to determine average speed and direction of migration of cells
ER -
TY - DATA
AB - MATLAB code and processed datasets available for reproducing the results in:
Lukačišin, M.*, Landon, M.*, Jajoo, R*. (2016) Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.
*equal contributions
AU - Lukacisin, Martin
AU - Landon, Matthieu
AU - Jajoo, Rishi
ID - 5556
KW - transcription
KW - pausing
KW - backtracking
KW - polymerase
KW - RNA
KW - NET-seq
KW - nucleosome
KW - basepairing
TI - MATLAB analysis code for 'Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast'
ER -
TY - DATA
AB - Small synthetic discrete tomography problems.
Sizes are 32x32, 64z64 and 256x256.
Projection angles are 2, 4, and 6.
Number of labels are 3 and 5.
AU - Swoboda, Paul
ID - 5557
KW - discrete tomography
TI - Synthetic discrete tomography problems
ER -
TY - DATA
AB - PhD thesis LaTeX source code
AU - Bojsen-Hansen, Morten
ID - 5558
TI - Tracking, Correcting and Absorbing Water Surface Waves
ER -
TY - JOUR
AB - Retroviruses such as HIV-1 assemble and bud from infected cells in an immature, non-infectious form. Subsequently, a series of proteolytic cleavages catalysed by the viral protease leads to a spectacular structural rearrangement of the viral particle into a mature form that is competent to fuse with and infect a new cell. Maturation involves changes in the structures of protein domains, in the interactions between protein domains, and in the architecture of the viral components that are assembled by the proteins. Tight control of proteolytic cleavages at different sites is required for successful maturation, and the process is a major target of antiretroviral drugs. Here we will describe what is known about the structures of immature and mature retrovirus particles, and about the maturation process by which one transitions into the other. Despite a wealth of available data, fundamental questions about retroviral maturation remain unanswered.
AU - Mattei, Simone
AU - Schur, Florian
AU - Briggs, John AG
ID - 5771
IS - 6
JF - Current Opinion in Virology
SN - 1879-6257
TI - Retrovirus maturation—an extraordinary structural transformation
VL - 18
ER -
TY - JOUR
AB - Quantum metrology exploits entangled states of particles to improve sensing precision beyond the limit achievable with uncorrelated particles. All previous methods required detection noise levels below this standard quantum limit to realize the benefits of the intrinsic sensitivity provided by these states.We experimentally demonstrate a widely applicable method for entanglement-enhanced measurements without low-noise detection. The method involves an intermediate quantum phase magnification step that eases implementation complexity. We used it to perform squeezed-state metrology 8 decibels below the standard quantum limit with a detection system that has a noise floor 10 decibels above the standard quantum limit.
AU - Onur Hosten
AU - Krishnakumar, Rajiv
AU - Engelsen, Nils J
AU - Kasevich, Mark A
ID - 587
IS - 6293
JF - Science
TI - Quantum phase magnification
VL - 352
ER -
TY - JOUR
AB - Consider the transmission of a polar code of block length N and rate R over a binary memoryless symmetric channel W and let P e be the block error probability under successive cancellation decoding. In this paper, we develop new bounds that characterize the relationship of the parameters R, N, P e , and the quality of the channel W quantified by its capacity I(W) and its Bhattacharyya parameter Z(W). In previous work, two main regimes were studied. In the error exponent regime, the channel W and the rate R <; I(W) are fixed, and it was proved that the error probability Pe scales roughly as 2 -√N . In the scaling exponent approach, the channel W and the error probability Pe are fixed and it was proved that the gap to capacity I(W) - R scales as N -1/μ . Here, μ is called scaling exponent and this scaling exponent depends on the channel W. A heuristic computation for the binary erasure channel (BEC) gives μ = 3.627 and it was shown that, for any channel W, 3.579 ≤ μ ≤ 5.702. Our contributions are as follows. First, we provide the tighter upper bound μ <;≤ 4.714 valid for any W. With the same technique, we obtain the upper bound μ ≤ 3.639 for the case of the BEC; this upper bound approaches very closely the heuristically derived value for the scaling exponent of the erasure channel. Second, we develop a trade-off between the gap to capacity I(W)- R and the error probability Pe as the functions of the block length N. In other words, we neither fix the gap to capacity (error exponent regime) nor the error probability (scaling exponent regime), but we do consider a moderate deviations regime in which we study how fast both quantities, as the functions of the block length N, simultaneously go to 0. Third, we prove that polar codes are not affected by error floors. To do so, we fix a polar code of block length N and rate R. Then, we vary the channel W and study the impact of this variation on the error probability. We show that the error probability Pe scales as the Bhattacharyya parameter Z(W) raised to a power that scales roughly like VN. This agrees with the scaling in the error exponent regime.
AU - Mondelli, Marco
AU - Hassani, S. Hamed
AU - Urbanke, Rudiger L.
ID - 6732
IS - 12
JF - IEEE Transactions on Information Theory
SN - 0018-9448
TI - Unified scaling of polar codes: Error exponent, scaling exponent, moderate deviations, and error floors
VL - 62
ER -
TY - CONF
AB - The question whether RM codes are capacity-achieving is a long-standing open problem in coding theory that was recently answered in the affirmative for transmission over erasure channels [1], [2]. Remarkably, the proof does not rely on specific properties of RM codes, apart from their symmetry. Indeed, the main technical result consists in showing that any sequence of linear codes, with doubly-transitive permutation groups, achieves capacity on the memoryless erasure channel under bit-MAP decoding. Thus, a natural question is what happens under block-MAP decoding. In [1], [2], by exploiting further symmetries of the code, the bit-MAP threshold was shown to be sharp enough so that the block erasure probability also converges to 0. However, this technique relies heavily on the fact that the transmission is over an erasure channel. We present an alternative approach to strengthen results regarding the bit-MAP threshold to block-MAP thresholds. This approach is based on a careful analysis of the weight distribution of RM codes. In particular, the flavor of the main result is the following: assume that the bit-MAP error probability decays as N -δ , for some δ > 0. Then, the block-MAP error probability also converges to 0. This technique applies to transmission over any binary memoryless symmetric channel. Thus, it can be thought of as a first step in extending the proof that RM codes are capacity-achieving to the general case.
AU - Kudekar, Shrinivas
AU - Kumar, Santhosh
AU - Mondelli, Marco
AU - Pfister, Henry D.
AU - Urbankez, Rudiger
ID - 6733
T2 - 2016 IEEE International Symposium on Information Theory
TI - Comparing the bit-MAP and block-MAP decoding thresholds of Reed-Muller codes on BMS channels
ER -
TY - JOUR
AB - Electrons in materials with linear dispersion behave as massless Weyl- or Dirac-quasiparticles, and continue to intrigue due to their close resemblance to elusive ultra-relativistic particles as well as their potential for future electronics. Yet the experimental signatures of Weyl-fermions are often subtle and indirect, in particular if they coexist with conventional, massive quasiparticles. Here we show a pronounced anomaly in the magnetic torque of the Weyl semimetal NbAs upon entering the quantum limit state in high magnetic fields. The torque changes sign in the quantum limit, signalling a reversal of the magnetic anisotropy that can be directly attributed to the topological nature of the Weyl electrons. Our results establish that anomalous quantum limit torque measurements provide a direct experimental method to identify and distinguish Weyl and Dirac systems.
AU - Moll, Philip J. W.
AU - Potter, Andrew C.
AU - Nair, Nityan L.
AU - Ramshaw, B. J.
AU - Modic, Kimberly A
AU - Riggs, Scott
AU - Zeng, Bin
AU - Ghimire, Nirmal J.
AU - Bauer, Eric D.
AU - Kealhofer, Robert
AU - Ronning, Filip
AU - Analytis, James G.
ID - 7068
JF - Nature Communications
SN - 2041-1723
TI - Magnetic torque anomaly in the quantum limit of Weyl semimetals
VL - 7
ER -
TY - JOUR
AB - 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.
AU - Hillenbrand, Patrick
AU - Gerland, Ulrich
AU - Tkacik, Gasper
ID - 1270
IS - 9
JF - PLoS One
TI - Beyond the French flag model: Exploiting spatial and gene regulatory interactions for positional information
VL - 11
ER -
TY - JOUR
AB - Background: High directional persistence is often assumed to enhance the efficiency of chemotactic migration. Yet, cells in vivo usually display meandering trajectories with relatively low directional persistence, and the control and function of directional persistence during cell migration in three-dimensional environments are poorly understood. Results: Here, we use mesendoderm progenitors migrating during zebrafish gastrulation as a model system to investigate the control of directional persistence during migration in vivo. We show that progenitor cells alternate persistent run phases with tumble phases that result in cell reorientation. Runs are characterized by the formation of directed actin-rich protrusions and tumbles by enhanced blebbing. Increasing the proportion of actin-rich protrusions or blebs leads to longer or shorter run phases, respectively. Importantly, both reducing and increasing run phases result in larger spatial dispersion of the cells, indicative of reduced migration precision. A physical model quantitatively recapitulating the migratory behavior of mesendoderm progenitors indicates that the ratio of tumbling to run times, and thus the specific degree of directional persistence of migration, are critical for optimizing migration precision. Conclusions: Together, our experiments and model provide mechanistic insight into the control of migration directionality for cells moving in three-dimensional environments that combine different protrusion types, whereby the proportion of blebs to actin-rich protrusions determines the directional persistence and precision of movement by regulating the ratio of tumbling to run times.
AU - Diz Muñoz, Alba
AU - Romanczuk, Pawel
AU - Yu, Weimiao
AU - Bergert, Martin
AU - Ivanovitch, Kenzo
AU - Salbreux, Guillame
AU - Heisenberg, Carl-Philipp J
AU - Paluch, Ewa
ID - 1271
IS - 1
JF - BMC Biology
TI - Steering cell migration by alternating blebs and actin-rich protrusions
VL - 14
ER -
TY - JOUR
AB - We study different means to extend offsetting based on skeletal structures beyond the well-known constant-radius and mitered offsets supported by Voronoi diagrams and straight skeletons, for which the orthogonal distance of offset elements to their respective input elements is constant and uniform over all input elements. Our main contribution is a new geometric structure, called variable-radius Voronoi diagram, which supports the computation of variable-radius offsets, i.e., offsets whose distance to the input is allowed to vary along the input. We discuss properties of this structure and sketch a prototype implementation that supports the computation of variable-radius offsets based on this new variant of Voronoi diagrams.
AU - Held, Martin
AU - Huber, Stefan
AU - Palfrader, Peter
ID - 1272
IS - 5
JF - Computer-Aided Design and Applications
TI - Generalized offsetting of planar structures using skeletons
VL - 13
ER -
TY - JOUR
AB - Lateral root primordia (LRP) originate from pericycle stem cells located deep within parental root tissues. LRP emerge through overlying root tissues by inducing auxin-dependent cell separation and hydraulic changes in adjacent cells. The auxin-inducible auxin influx carrier LAX3 plays a key role concentrating this signal in cells overlying LRP. Delimiting LAX3 expression to two adjacent cell files overlying new LRP is crucial to ensure that auxin-regulated cell separation occurs solely along their shared walls. Multiscale modeling has predicted that this highly focused pattern of expression requires auxin to sequentially induce auxin efflux and influx carriers PIN3 and LAX3, respectively. Consistent with model predictions, we report that auxin-inducible LAX3 expression is regulated indirectly by AUXIN RESPONSE FACTOR 7 (ARF7). Yeast one-hybrid screens revealed that the LAX3 promoter is bound by the transcription factor LBD29, which is a direct target for regulation by ARF7. Disrupting auxin-inducible LBD29 expression or expressing an LBD29-SRDX transcriptional repressor phenocopied the lax3 mutant, resulting in delayed lateral root emergence. We conclude that sequential LBD29 and LAX3 induction by auxin is required to coordinate cell separation and organ emergence.
AU - Porco, Silvana
AU - Larrieu, Antoine
AU - Du, Yujuan
AU - Gaudinier, Allison
AU - Goh, Tatsuaki
AU - Swarup, Kamal
AU - Swarup, Ranjan
AU - Kuempers, Britta
AU - Bishopp, Anthony
AU - Lavenus, Julien
AU - Casimiro, Ilda
AU - Hill, Kristine
AU - Benková, Eva
AU - Fukaki, Hidehiro
AU - Brady, Siobhan
AU - Scheres, Ben
AU - Peéet, Benjamin
AU - Bennett, Malcolm
ID - 1273
IS - 18
JF - Development
TI - Lateral root emergence in Arabidopsis is dependent on transcription factor LBD29 regulation of auxin influx carrier LAX3
VL - 143
ER -
TY - JOUR
AB - Synchronized tissue polarization during regeneration or de novo vascular tissue formation is a plant-specific example of intercellular communication and coordinated development. According to the canalization hypothesis, the plant hormone auxin serves as polarizing signal that mediates directional channel formation underlying the spatio-temporal vasculature patterning. A necessary part of canalization is a positive feedback between auxin signaling and polarity of the intercellular auxin flow. The cellular and molecular mechanisms of this process are still poorly understood, not the least, because of a lack of a suitable model system. We show that the main genetic model plant, Arabidopsis (Arabidopsis thaliana) can be used to study the canalization during vascular cambium regeneration and new vasculature formation. We monitored localized auxin responses, directional auxin-transport channels formation, and establishment of new vascular cambium polarity during regenerative processes after stem wounding. The increased auxin response above and around the wound preceded the formation of PIN1 auxin transporter-marked channels from the primarily homogenous tissue and the transient, gradual changes in PIN1 localization preceded the polarity of newly formed vascular tissue. Thus, Arabidopsis is a useful model for studies of coordinated tissue polarization and vasculature formation after wounding allowing for genetic and mechanistic dissection of the canalization hypothesis.
AU - Mazur, Ewa
AU - Benková, Eva
AU - Friml, Jirí
ID - 1274
JF - Scientific Reports
TI - Vascular cambium regeneration and vessel formation in wounded inflorescence stems of Arabidopsis
VL - 6
ER -
TY - JOUR
AB - The cytochrome (cyt) bc 1 complex is an integral component of the respiratory electron transfer chain sustaining the energy needs of organisms ranging from humans to bacteria. Due to its ubiquitous role in the energy metabolism, both the oxidation and reduction of the enzyme's substrate co-enzyme Q has been studied vigorously. Here, this vast amount of data is reassessed after probing the substrate reduction steps at the Q i-site of the cyt bc 1 complex of Rhodobacter capsulatus using atomistic molecular dynamics simulations. The simulations suggest that the Lys251 side chain could rotate into the Q i-site to facilitate binding of half-protonated semiquinone-a reaction intermediate that is potentially formed during substrate reduction. At this bent pose, the Lys251 forms a salt bridge with the Asp252, thus making direct proton transfer possible. In the neutral state, the lysine side chain stays close to the conserved binding location of cardiolipin (CL). This back-and-forth motion between the CL and Asp252 indicates that Lys251 functions as a proton shuttle controlled by pH-dependent negative feedback. The CL/K/D switching, which represents a refinement to the previously described CL/K pathway, fine-tunes the proton transfer process. Lastly, the simulation data was used to formulate a mechanism for reducing the substrate at the Q i-site.
AU - Postila, Pekka
AU - Kaszuba, Karol
AU - Kuleta, Patryk
AU - Vattulainen, Ilpo
AU - Sarewicz, Marcin
AU - Osyczka, Artur
AU - Róg, Tomasz
ID - 1276
JF - Scientific Reports
TI - Atomistic determinants of co-enzyme Q reduction at the Qi-site of the cytochrome bc1 complex
VL - 6
ER -
TY - JOUR
AB - The Arabidopsis thaliana endogenous elicitor peptides (AtPeps) are released into the apoplast after cellular damage caused by pathogens or wounding to induce innate immunity by direct binding to the membrane-localized leucine-rich repeat receptor kinases, PEP RECEPTOR1 (PEPR1) and PEPR2. Although the PEPR-mediated signaling components and responses have been studied extensively, the contributions of the subcellular localization and dynamics of the active PEPRs remain largely unknown. We used live-cell imaging of the fluorescently labeled and bioactive pep1 to visualize the intracellular behavior of the PEPRs in the Arabidopsis root meristem. We found that AtPep1 decorated the plasma membrane (PM) in a receptor-dependent manner and cointernalized with PEPRs. Trafficking of the AtPep1-PEPR1 complexes to the vacuole required neither the trans-Golgi network/early endosome (TGN/EE)-localized vacuolar H+ -ATPase activity nor the function of the brefeldin A-sensitive ADP-ribosylation factor-guanine exchange factors (ARF-GEFs). In addition, AtPep1 and different TGN/EE markers colocalized only rarely, implying that the intracellular route of this receptor-ligand pair is largely independent of the TGN/EE. Inducible overexpression of the Arabidopsis clathrin coat disassembly factor, Auxilin2, which inhibits clathrin-mediated endocytosis (CME), impaired the AtPep1-PEPR1 internalization and compromised AtPep1-mediated responses. Our results show that clathrin function at the PM is required to induce plant defense responses, likely through CME of cell surface-located signaling components.
AU - Ortiz Morea, Fausto
AU - Savatin, Daniel
AU - Dejonghe, Wim
AU - Kumar, Rahul
AU - Luo, Yu
AU - Adamowski, Maciek
AU - Van Begin, Jos
AU - Dressano, Keini
AU - De Oliveira, Guilherme
AU - Zhao, Xiuyang
AU - Lu, Qing
AU - Madder, Annemieke
AU - Friml, Jirí
AU - De Moura, Daniel
AU - Russinova, Eugenia
ID - 1277
IS - 39
JF - PNAS
TI - Danger-associated peptide signaling in Arabidopsis requires clathrin
VL - 113
ER -
TY - JOUR
AB - Adaptations of vestibulo-ocular and optokinetic response eye movements have been studied as an experimental model of cerebellum-dependent motor learning. Several previous physiological and pharmacological studies have consistently suggested that the cerebellar flocculus (FL) Purkinje cells (P-cells) and the medial vestibular nucleus (MVN) neurons targeted by FL (FL-targeted MVN neurons) may respectively maintain the memory traces of short- and long-term adaptation. To study the basic structures of the FL-MVN synapses by light microscopy (LM) and electron microscopy (EM), we injected green florescence protein (GFP)-expressing lentivirus into FL to anterogradely label the FL P-cell axons in C57BL/6J mice. The FL P-cell axonal boutons were distributed in the magnocellular MVN and in the border region of parvocellular MVN and prepositus hypoglossi (PrH). In the magnocellular MVN, the FL-P cell axons mainly terminated on somata and proximal dendrites. On the other hand, in the parvocellular MVN/PrH, the FL P-cell axonal synaptic boutons mainly terminated on the relatively small-diameter (< 1 μm) distal dendrites of MVN neurons, forming symmetrical synapses. The majority of such parvocellular MVN/PrH neurons were determined to be glutamatergic by immunocytochemistry and in-situ hybridization of GFP expressing transgenic mice. To further examine the spatial relationship between the synapses of FL P-cells and those of vestibular nerve on the neurons of the parvocellular MVN/ PrH, we added injections of biotinylated dextran amine into the semicircular canal and anterogradely labeled vestibular nerve axons in some mice. The MVN dendrites receiving the FL P-cell axonal synaptic boutons often closely apposed vestibular nerve synaptic boutons in both LM and EM studies. Such a partial overlap of synaptic boutons of FL P-cell axons with those of vestibular nerve axons in the distal dendrites of MVN neurons suggests that inhibitory synapses of FL P-cells may influence the function of neighboring excitatory synapses of vestibular nerve in the parvocellular MVN/PrH neurons.
AU - Matsuno, Hitomi
AU - Kudoh, Moeko
AU - Watakabe, Akiya
AU - Yamamori, Tetsuo
AU - Shigemoto, Ryuichi
AU - Nagao, Soichi
ID - 1278
IS - 10
JF - PLoS One
TI - Distribution and structure of synapses on medial vestibular nuclear neurons targeted by cerebellar flocculus purkinje cells and vestibular nerve in mice: Light and electron microscopy studies
VL - 11
ER -
TY - JOUR
AB - During hippocampal sharp wave/ripple (SWR) events, previously occurring, sensory inputdriven neuronal firing patterns are replayed. Such replay is thought to be important for plasticity- related processes and consolidation of memory traces. It has previously been shown that the electrical stimulation-induced disruption of SWR events interferes with learning in rodents in different experimental paradigms. On the other hand, the cognitive map theory posits that the plastic changes of the firing of hippocampal place cells constitute the electrophysiological counterpart of the spatial learning, observable at the behavioral level. Therefore, we tested whether intact SWR events occurring during the sleep/rest session after the first exploration of a novel environment are needed for the stabilization of the CA1 code, which process requires plasticity. We found that the newly-formed representation in the CA1 has the same level of stability with optogenetic SWR blockade as with a control manipulation that delivered the same amount of light into the brain. Therefore our results suggest that at least in the case of passive exploratory behavior, SWR-related plasticity is dispensable for the stability of CA1 ensembles.
AU - Kovács, Krisztián
AU - O'Neill, Joseph
AU - Schönenberger, Philipp
AU - Penttonen, Markku
AU - Rangel Guerrero, Dámaris K
AU - Csicsvari, Jozsef L
ID - 1279
IS - 10
JF - PLoS One
TI - Optogenetically blocking sharp wave ripple events in sleep does not interfere with the formation of stable spatial representation in the CA1 area of the hippocampus
VL - 11
ER -
TY - JOUR
AB - We prove the Wigner-Dyson-Mehta conjecture at fixed energy in the bulk of the spectrum for generalized symmetric and Hermitian Wigner matrices. Previous results concerning the universality of random matrices either require an averaging in the energy parameter or they hold only for Hermitian matrices if the energy parameter is fixed. We develop a homogenization theory of the Dyson Brownian motion and show that microscopic universality follows from mesoscopic statistics.
AU - Bourgade, Paul
AU - Erdös, László
AU - Yau, Horngtzer
AU - Yin, Jun
ID - 1280
IS - 10
JF - Communications on Pure and Applied Mathematics
TI - Fixed energy universality for generalized wigner matrices
VL - 69
ER -
TY - JOUR
AB - Plants are able to modulate root growth and development to optimize their nitrogen nutrition. In Arabidopsis (Arabidopsis thaliana), the adaptive root response to nitrate (NO3 -) depends on the NRT1.1/NPF6.3 transporter/sensor. NRT1.1 represses emergence of lateral root primordia (LRPs) at low concentration or absence of NO3 - through its auxin transport activity that lowers auxin accumulation in LR. However, these functional data strongly contrast with the known transcriptional regulation of NRT1.1, which is markedly repressed in LRPs in the absence of NO3 -. To explain this discrepancy, we investigated in detail the spatiotemporal expression pattern of the NRT1.1 protein during LRP development and combined local transcript analysis with the use of transgenic lines expressing tagged NRT1.1 proteins. Our results show that although NO3 - stimulates NRT1.1 transcription and probably mRNA stability both in primary root tissues and in LRPs, it acts differentially on protein accumulation, depending on the tissues considered with stimulation in cortex and epidermis of the primary root and a strong repression in LRPs and to a lower extent at the primary root tip. This demonstrates that NRT1.1 is strongly regulated at the posttranscriptional level by tissue-specific mechanisms. These mechanisms are crucial for controlling the large palette of adaptive responses to NO3 - mediated by NRT1.1 as they ensure that the protein is present in the proper tissue under the specific conditions where it plays a signaling role in this particular tissue.
AU - Bouguyon, Eléonore
AU - Perrine Walker, Francine
AU - Pervent, Marjorie
AU - Rochette, Juliette
AU - Cuesta, Candela
AU - Benková, Eva
AU - Martinière, Alexandre
AU - Bach, Lien
AU - Krouk, Gabriel
AU - Gojon, Alain
AU - Nacry, Philippe
ID - 1281
IS - 2
JF - Plant Physiology
TI - Nitrate controls root development through posttranscriptional regulation of the NRT1.1/NPF6.3 transporter sensor
VL - 172
ER -
TY - JOUR
AB - We consider higher-dimensional generalizations of the normalized Laplacian and the adjacency matrix of graphs and study their eigenvalues for the Linial–Meshulam model Xk(n, p) of random k-dimensional simplicial complexes on n vertices. We show that for p = Ω(logn/n), the eigenvalues of each of the matrices are a.a.s. concentrated around two values. The main tool, which goes back to the work of Garland, are arguments that relate the eigenvalues of these matrices to those of graphs that arise as links of (k - 2)-dimensional faces. Garland’s result concerns the Laplacian; we develop an analogous result for the adjacency matrix. The same arguments apply to other models of random complexes which allow for dependencies between the choices of k-dimensional simplices. In the second part of the paper, we apply this to the question of possible higher-dimensional analogues of the discrete Cheeger inequality, which in the classical case of graphs relates the eigenvalues of a graph and its edge expansion. It is very natural to ask whether this generalizes to higher dimensions and, in particular, whether the eigenvalues of the higher-dimensional Laplacian capture the notion of coboundary expansion—a higher-dimensional generalization of edge expansion that arose in recent work of Linial and Meshulam and of Gromov; this question was raised, for instance, by Dotterrer and Kahle. We show that this most straightforward version of a higher-dimensional discrete Cheeger inequality fails, in quite a strong way: For every k ≥ 2 and n ∈ N, there is a k-dimensional complex Yn k on n vertices that has strong spectral expansion properties (all nontrivial eigenvalues of the normalised k-dimensional Laplacian lie in the interval [1−O(1/√1), 1+0(1/√1]) but whose coboundary expansion is bounded from above by O(log n/n) and so tends to zero as n → ∞; moreover, Yn k can be taken to have vanishing integer homology in dimension less than k.
AU - Gundert, Anna
AU - Wagner, Uli
ID - 1282
IS - 2
JF - Israel Journal of Mathematics
TI - On eigenvalues of random complexes
VL - 216
ER -
TY - JOUR
AB - Brassinosteroids (BRs) are growth-promoting plant hormones that play a role in abiotic stress responses, but molecular modes that enable this activity remain largely unknown. Here we show that BRs participate in the regulation of freezing tolerance. BR signaling-defective mutants of Arabidopsis thaliana were hypersensitive to freezing before and after cold acclimation. The constitutive activation of BR signaling, in contrast, enhanced freezing resistance. Evidence is provided that the BR-controlled basic helix-loop-helix transcription factor CESTA (CES) can contribute to the constitutive expression of the C-REPEAT/DEHYDRATION-RESPONSIVE ELEMENT BINDING FACTOR (CBF) transcriptional regulators that control cold responsive (COR) gene expression. In addition, CBF-independent classes of BR-regulated COR genes are identified that are regulated in a BR- and CES-dependent manner during cold acclimation. A model is presented in which BRs govern different cold-responsive transcriptional cascades through the post-translational modification of CES and redundantly acting factors. This contributes to the basal resistance against freezing stress, but also to the further improvement of this resistance through cold acclimation.
AU - Eremina, Marina
AU - Unterholzner, Simon
AU - Rathnayake, Ajith
AU - Castellanos, Marcos
AU - Khan-Djamei, Mamoona
AU - Kügler, Karl
AU - May, Sean
AU - Mayer, Klaus
AU - Rozhon, Wilfried
AU - Poppenberger, Brigitte
ID - 1284
IS - 40
JF - PNAS
TI - Brassinosteroids participate in the control of basal and acquired freezing tolerance of plants
VL - 113
ER -
TY - JOUR
AB - We use recently developed angulon theory [R. Schmidt and M. Lemeshko, Phys. Rev. Lett. 114, 203001 (2015)PRLTAO0031-900710.1103/PhysRevLett.114.203001] to study the rotational spectrum of a cyanide molecular anion immersed into Bose-Einstein condensates of rubidium and strontium. Based on ab initio potential energy surfaces, we provide a detailed study of the rotational Lamb shift and many-body-induced fine structure which arise due to dressing of molecular rotation by a field of phonon excitations. We demonstrate that the magnitude of these effects is large enough in order to be observed in modern experiments on cold molecular ions. Furthermore, we introduce a novel method to construct pseudopotentials starting from the ab initio potential energy surfaces, which provides a means to obtain effective coupling constants for low-energy polaron models.
AU - Midya, Bikashkali
AU - Tomza, Michał
AU - Schmidt, Richard
AU - Lemeshko, Mikhail
ID - 1286
IS - 4
JF - Physical Review A - Atomic, Molecular, and Optical Physics
TI - Rotation of cold molecular ions inside a Bose-Einstein condensate
VL - 94
ER -
TY - JOUR
AB - A planar waveguide with an impedance boundary, composed of nonperfect metallic plates, and with passive or active dielectric filling, is considered. We show the possibility of selective mode guiding and amplification when a homogeneous pump is added to the dielectric and analyze differences in TE and TM mode propagation. Such a non-conservative system is also shown to feature exceptional points for specific and experimentally tunable parameters, which are described for a particular case of transparent dielectric.
AU - Midya, Bikashkali
AU - Konotop, Vladimir
ID - 1287
IS - 20
JF - Optics Letters
TI - Modes and exceptional points in waveguides with impedance boundary conditions
VL - 41
ER -
TY - JOUR
AB - 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.
AU - Dunaeva, Olga
AU - Edelsbrunner, Herbert
AU - Lukyanov, Anton
AU - Machin, Michael
AU - Malkova, Daria
AU - Kuvaev, Roman
AU - Kashin, Sergey
ID - 1289
IS - 1
JF - Pattern Recognition Letters
TI - The classification of endoscopy images with persistent homology
VL - 83
ER -
TY - JOUR
AB - We developed a competition-based screening strategy to identify compounds that invert the selective advantage of antibiotic resistance. Using our assay, we screened over 19,000 compounds for the ability to select against the TetA tetracycline-resistance efflux pump in Escherichia coli and identified two hits, β-thujaplicin and disulfiram. Treating a tetracycline-resistant population with β-thujaplicin selects for loss of the resistance gene, enabling an effective second-phase treatment with doxycycline.
AU - Stone, Laura
AU - Baym, Michael
AU - Lieberman, Tami
AU - Chait, Remy P
AU - Clardy, Jon
AU - Kishony, Roy
ID - 1290
IS - 11
JF - Nature Chemical Biology
TI - Compounds that select against the tetracycline-resistance efflux pump
VL - 12
ER -
TY - JOUR
AB - We consider Ising models in two and three dimensions, with short range ferromagnetic and long range, power-law decaying, antiferromagnetic interactions. We let J be the ratio between the strength of the ferromagnetic to antiferromagnetic interactions. The competition between these two kinds of interactions induces the system to form domains of minus spins in a background of plus spins, or vice versa. If the decay exponent p of the long range interaction is larger than dÂ +Â 1, with d the space dimension, this happens for all values of J smaller than a critical value Jc(p), beyond which the ground state is homogeneous. In this paper, we give a characterization of the infinite volume ground states of the system, for pÂ >Â 2d and J in a left neighborhood of Jc(p). In particular, we prove that the quasi-one-dimensional states consisting of infinite stripes (dÂ =Â 2) or slabs (dÂ =Â 3), all of the same optimal width and orientation, and alternating magnetization, are infinite volume ground states. Our proof is based on localization bounds combined with reflection positivity.
AU - Giuliani, Alessandro
AU - Seiringer, Robert
ID - 1291
IS - 3
JF - Communications in Mathematical Physics
TI - Periodic striped ground states in Ising models with competing interactions
VL - 347
ER -
TY - JOUR
AB - We give explicit formulas and algorithms for the computation of the Thurston–Bennequin invariant of a nullhomologous Legendrian knot on a page of a contact open book and on Heegaard surfaces in convex position. Furthermore, we extend the results to rationally nullhomologous knots in arbitrary 3-manifolds.
AU - Durst, Sebastian
AU - Kegel, Marc
AU - Klukas, Mirko D
ID - 1292
IS - 2
JF - Acta Mathematica Hungarica
TI - Computing the Thurston–Bennequin invariant in open books
VL - 150
ER -
TY - JOUR
AB - For a graph G with p vertices the closed convex cone S⪰0(G) consists of all real positive semidefinite p×p matrices whose sparsity pattern is given by G, that is, those matrices with zeros in the off-diagonal entries corresponding to nonedges of G. The extremal rays of this cone and their associated ranks have applications to matrix completion problems, maximum likelihood estimation in Gaussian graphical models in statistics, and Gauss elimination for sparse matrices. While the maximum rank of an extremal ray in S⪰0(G), known as the sparsity order of G, has been characterized for different classes of graphs, we here study all possible extremal ranks of S⪰0(G). We investigate when the geometry of the (±1)-cut polytope of G yields a polyhedral characterization of the set of extremal ranks of S⪰0(G). For a graph G without K5 minors, we show that appropriately chosen normal vectors to the facets of the (±1)-cut polytope of G specify the off-diagonal entries of extremal matrices in S⪰0(G). We also prove that for appropriately chosen scalars the constant term of the linear equation of each facet-supporting hyperplane is the rank of its corresponding extremal matrix in S⪰0(G). Furthermore, we show that if G is series-parallel then this gives a complete characterization of all possible extremal ranks of S⪰0(G). Consequently, the sparsity order problem for series-parallel graphs can be solved in terms of polyhedral geometry.
AU - Solus, Liam T
AU - Uhler, Caroline
AU - Yoshida, Ruriko
ID - 1293
JF - Linear Algebra and Its Applications
TI - Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without K5 minors
VL - 509
ER -
TY - JOUR
AB - We develop a large-scale regularity theory of higher order for divergence-form elliptic equations with heterogeneous coefficient fields a in the context of stochastic homogenization. The large-scale regularity of a-harmonic functions is encoded by Liouville principles: The space of a-harmonic functions that grow at most like a polynomial of degree k has the same dimension as in the constant-coefficient case. This result can be seen as the qualitative side of a large-scale Ck,α-regularity theory, which in the present work is developed in the form of a corresponding Ck,α-“excess decay” estimate: For a given a-harmonic function u on a ball BR, its energy distance on some ball Br to the above space of a-harmonic functions that grow at most like a polynomial of degree k has the natural decay in the radius r above some minimal radius r0. Though motivated by stochastic homogenization, the contribution of this paper is of purely deterministic nature: We work under the assumption that for the given realization a of the coefficient field, the couple (φ, σ) of scalar and vector potentials of the harmonic coordinates, where φ is the usual corrector, grows sublinearly in a mildly quantified way. We then construct “kth-order correctors” and thereby the space of a-harmonic functions that grow at most like a polynomial of degree k, establish the above excess decay, and then the corresponding Liouville principle.
AU - Julian Fischer
AU - Otto, Felix
ID - 1318
IS - 7
JF - Communications in Partial Differential Equations
TI - A higher-order large scale regularity theory for random elliptic operators
VL - 41
ER -
TY - JOUR
AB - 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.
AU - Hilbe, Christian
AU - Hagel, Kristin
AU - Milinski, Manfred
ID - 1322
IS - 10
JF - PLoS One
TI - Asymmetric power boosts extortion in an economic experiment
VL - 11
ER -
TY - JOUR
AB - Mossy fiber synapses on CA3 pyramidal cells are 'conditional detonators' that reliably discharge postsynaptic targets. The 'conditional' nature implies that burst activity in dentate gyrus granule cells is required for detonation. Whether single unitary excitatory postsynaptic potentials (EPSPs) trigger spikes in CA3 neurons remains unknown. Mossy fiber synapses exhibit both pronounced short-term facilitation and uniquely large post-tetanic potentiation (PTP). We tested whether PTP could convert mossy fiber synapses from subdetonator into detonator mode, using a recently developed method to selectively and noninvasively stimulate individual presynaptic terminals in rat brain slices. Unitary EPSPs failed to initiate a spike in CA3 neurons under control conditions, but reliably discharged them after induction of presynaptic short-term plasticity. Remarkably, PTP switched mossy fiber synapses into full detonators for tens of seconds. Plasticity-dependent detonation may be critical for efficient coding, storage, and recall of information in the granule cell–CA3 cell network.
AU - Vyleta, Nicholas
AU - Borges Merjane, Carolina
AU - Jonas, Peter M
ID - 1323
JF - eLife
TI - Plasticity-dependent, full detonation at hippocampal mossy fiber–CA3 pyramidal neuron synapses
VL - 5
ER -
TY - CONF
AB - We study graphs and two-player games in which rewards are assigned to states, and the goal of the players is to satisfy or dissatisfy certain property of the generated outcome, given as a mean payoff property. Since the notion of mean-payoff does not reflect possible fluctuations from the mean-payoff along a run, we propose definitions and algorithms for capturing the stability of the system, and give algorithms for deciding if a given mean payoff and stability objective can be ensured in the system.
AU - Brázdil, Tomáš
AU - Forejt, Vojtěch
AU - Kučera, Antonín
AU - Novotny, Petr
ID - 1325
TI - Stability in graphs and games
VL - 59
ER -
TY - CONF
AB - Energy Markov Decision Processes (EMDPs) are finite-state Markov decision processes where each transition is assigned an integer counter update and a rational payoff. An EMDP configuration is a pair s(n), where s is a control state and n is the current counter value. The configurations are changed by performing transitions in the standard way. We consider the problem of computing a safe strategy (i.e., a strategy that keeps the counter non-negative) which maximizes the expected mean payoff.
AU - Brázdil, Tomáš
AU - Kučera, Antonín
AU - Novotny, Petr
ID - 1326
TI - Optimizing the expected mean payoff in Energy Markov Decision Processes
VL - 9938
ER -
TY - CONF
AB - We consider partially observable Markov decision processes (POMDPs) with a set of target states and positive integer costs associated with every transition. The traditional optimization objective (stochastic shortest path) asks to minimize the expected total cost until the target set is reached. We extend the traditional framework of POMDPs to model energy consumption, which represents a hard constraint. The energy levels may increase and decrease with transitions, and the hard constraint requires that the energy level must remain positive in all steps till the target is reached. First, we present a novel algorithm for solving POMDPs with energy levels, developing on existing POMDP solvers and using RTDP as its main method. Our second contribution is related to policy representation. For larger POMDP instances the policies computed by existing solvers are too large to be understandable. We present an automated procedure based on machine learning techniques that automatically extracts important decisions of the policy allowing us to compute succinct human readable policies. Finally, we show experimentally that our algorithm performs well and computes succinct policies on a number of POMDP instances from the literature that were naturally enhanced with energy levels.
AU - Brázdil, Tomáš
AU - Chatterjee, Krishnendu
AU - Chmelik, Martin
AU - Gupta, Anchit
AU - Novotny, Petr
ID - 1327
T2 - Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems
TI - Stochastic shortest path with energy constraints in POMDPs
ER -
TY - JOUR
AB - Hole spins have gained considerable interest in the past few years due to their potential for fast electrically controlled qubits. Here, we study holes confined in Ge hut wires, a so-far unexplored type of nanostructure. Low-temperature magnetotransport measurements reveal a large anisotropy between the in-plane and out-of-plane g-factors of up to 18. Numerical simulations verify that this large anisotropy originates from a confined wave function of heavy-hole character. A light-hole admixture of less than 1% is estimated for the states of lowest energy, leading to a surprisingly large reduction of the out-of-plane g-factors compared with those for pure heavy holes. Given this tiny light-hole contribution, the spin lifetimes are expected to be very long, even in isotopically nonpurified samples.
AU - Watzinger, Hannes
AU - Kloeffel, Christoph
AU - Vukusic, Lada
AU - Rossell, Marta
AU - Sessi, Violetta
AU - Kukucka, Josip
AU - Kirchschlager, Raimund
AU - Lausecker, Elisabeth
AU - Truhlar, Alisha
AU - Glaser, Martin
AU - Rastelli, Armando
AU - Fuhrer, Andreas
AU - Loss, Daniel
AU - Katsaros, Georgios
ID - 1328
IS - 11
JF - Nano Letters
TI - Heavy-hole states in germanium hut wires
VL - 16
ER -
TY - JOUR
AB - Daphnia species have become models for ecological genomics and exhibit interesting features, such as high phenotypic plasticity and a densely packed genome with many lineage-specific genes. They are also cyclic parthenogenetic, with alternating asexual and sexual cycles and environmental sex determination. Here, we present a de novo transcriptome assembly of over 32,000 D. galeata genes and use it to investigate gene expression in females and spontaneously produced males of two clonal lines derived from lakes in Germany and the Czech Republic. We find that only a low percentage (18%) of genes shows sex-biased expression and that there are many more female-biased gene (FBG) than male-biased gene (MBG). Furthermore, FBGs tend to be more conserved between species than MBGs in both sequence and expression. These patterns may be a consequence of cyclic parthenogenesis leading to a relaxation of purifying selection on MBGs. The two clonal lines show considerable differences in both number and identity of sex-biased genes, suggesting that they may have reproductive strategies differing in their investment in sexual reproduction. Orthologs of key genes in the sex determination and juvenile hormone pathways, which are thought to be important for the transition from asexual to sexual reproduction, are present in D. galeata and highly conserved among Daphnia species.
AU - Huylmans, Ann K
AU - López Ezquerra, Alberto
AU - Parsch, John
AU - Cordellier, Mathilde
ID - 1329
IS - 10
JF - Genome Biology and Evolution
TI - De novo transcriptome assembly and sex-biased gene expression in the cyclical parthenogenetic Daphnia galeata
VL - 8
ER -
TY - JOUR
AB - In this paper we investigate the existence of closed billiard trajectories in not necessarily smooth convex bodies. In particular, we show that if a body K ⊂ Rd has the property that the tangent cone of every non-smooth point q ∉ ∂K is acute (in a certain sense), then there is a closed billiard trajectory in K.
AU - Akopyan, Arseniy
AU - Balitskiy, Alexey
ID - 1330
IS - 2
JF - Israel Journal of Mathematics
TI - Billiards in convex bodies with acute angles
VL - 216
ER -
TY - JOUR
AB - Antibiotic-sensitive and -resistant bacteria coexist in natural environments with low, if detectable, antibiotic concentrations. Except possibly around localized antibiotic sources, where resistance can provide a strong advantage, bacterial fitness is dominated by stresses unaffected by resistance to the antibiotic. How do such mixed and heterogeneous conditions influence the selective advantage or disadvantage of antibiotic resistance? Here we find that sub-inhibitory levels of tetracyclines potentiate selection for or against tetracycline resistance around localized sources of almost any toxin or stress. Furthermore, certain stresses generate alternating rings of selection for and against resistance around a localized source of the antibiotic. In these conditions, localized antibiotic sources, even at high strengths, can actually produce a net selection against resistance to the antibiotic. Our results show that interactions between the effects of an antibiotic and other stresses in inhomogeneous environments can generate pervasive, complex patterns of selection both for and against antibiotic resistance.
AU - Chait, Remy P
AU - Palmer, Adam
AU - Yelin, Idan
AU - Kishony, Roy
ID - 1332
JF - Nature Communications
TI - Pervasive selection for and against antibiotic resistance in inhomogeneous multistress environments
VL - 7
ER -
TY - JOUR
AB - Social dilemmas force players to balance between personal and collective gain. In many dilemmas, such as elected governments negotiating climate-change mitigation measures, the decisions are made not by individual players but by their representatives. However, the behaviour of representatives in social dilemmas has not been investigated experimentally. Here inspired by the negotiations for greenhouse-gas emissions reductions, we experimentally study a collective-risk social dilemma that involves representatives deciding on behalf of their fellow group members. Representatives can be re-elected or voted out after each consecutive collective-risk game. Selfish players are preferentially elected and are hence found most frequently in the "representatives" treatment. Across all treatments, we identify the selfish players as extortioners. As predicted by our mathematical model, their steadfast strategies enforce cooperation from fair players who finally compensate almost completely the deficit caused by the extortionate co-players. Everybody gains, but the extortionate representatives and their groups gain the most.
AU - Milinski, Manfred
AU - Hilbe, Christian
AU - Semmann, Dirk
AU - Sommerfeld, Ralf
AU - Marotzke, Jochem
ID - 1333
JF - Nature Communications
TI - Humans choose representatives who enforce cooperation in social dilemmas through extortion
VL - 7
ER -
TY - JOUR
AB - Hippocampal neurons encode a cognitive map of space. These maps are thought to be updated during learning and in response to changes in the environment through activity-dependent synaptic plasticity. Here we examine how changes in activity influence spatial coding in rats using halorhodopsin-mediated, spatially selective optogenetic silencing. Halorhoposin stimulation leads to light-induced suppression in many place cells and interneurons; some place cells increase their firing through disinhibition, whereas some show no effect. We find that place fields of the unaffected subpopulation remain stable. On the other hand, place fields of suppressed place cells were unstable, showing remapping across sessions before and after optogenetic inhibition. Disinhibited place cells had stable maps but sustained an elevated firing rate. These findings suggest that place representation in the hippocampus is constantly governed by activity-dependent processes, and that disinhibition may provide a mechanism for rate remapping.
AU - Schönenberger, Philipp
AU - O'Neill, Joseph
AU - Csicsvari, Jozsef L
ID - 1334
JF - Nature Communications
TI - Activity dependent plasticity of hippocampal place maps
VL - 7
ER -
TY - CONF
AB - In this paper we review various automata-theoretic formalisms for expressing quantitative properties. We start with finite-state Boolean automata that express the traditional regular properties. We then consider weighted ω-automata that can measure the average density of events, which finite-state Boolean automata cannot. However, even weighted ω-automata cannot express basic performance properties like average response time. We finally consider two formalisms of weighted ω-automata with monitors, where the monitors are either (a) counters or (b) weighted automata themselves. We present a translation result to establish that these two formalisms are equivalent. Weighted ω-automata with monitors generalize weighted ω-automata, and can express average response time property. They present a natural, robust, and expressive framework for quantitative specifications, with important decidable properties.
AU - Chatterjee, Krishnendu
AU - Henzinger, Thomas A
AU - Otop, Jan
ID - 1335
TI - Quantitative monitor automata
VL - 9837
ER -
TY - JOUR
AB - We present a microelectromechanical system, in which a silicon beam is attached to a comb-drive
actuator, which is used to tune the tension in the silicon beam and thus its resonance frequency. By
measuring the resonance frequencies of the system, we show that the comb-drive actuator and the
silicon beam behave as two strongly coupled resonators. Interestingly, the effective coupling rate
(1.5 MHz) is tunable with the comb-drive actuator (10%) as well as with a side-gate (10%)
placed close to the silicon beam. In contrast, the effective spring constant of the system is insensitive
to either of them and changes only by 60.5%. Finally, we show that the comb-drive actuator
can be used to switch between different coupling rates with a frequency of at least 10 kHz.
AU - Verbiest, Gerard
AU - Xu, Duo
AU - Goldsche, Matthias
AU - Khodkov, Timofiy
AU - Barzanjeh, Shabir
AU - Von Den Driesch, Nils
AU - Buca, Dan
AU - Stampfer, Christoph
ID - 1339
JF - Applied Physics Letter
TI - Tunable mechanical coupling between driven microelectromechanical resonators
VL - 109
ER -
TY - CONF
AB - We study repeated games with absorbing states, a type of two-player, zero-sum concurrent mean-payoff games with the prototypical example being the Big Match of Gillete (1957). These games may not allow optimal strategies but they always have ε-optimal strategies. In this paper we design ε-optimal strategies for Player 1 in these games that use only O(log log T) space. Furthermore, we construct strategies for Player 1 that use space s(T), for an arbitrary small unbounded non-decreasing function s, and which guarantee an ε-optimal value for Player 1 in the limit superior sense. The previously known strategies use space Ω(log T) and it was known that no strategy can use constant space if it is ε-optimal even in the limit superior sense. We also give a complementary lower bound. Furthermore, we also show that no Markov strategy, even extended with finite memory, can ensure value greater than 0 in the Big Match, answering a question posed by Neyman [11].
AU - Hansen, Kristoffer
AU - Ibsen-Jensen, Rasmus
AU - Koucký, Michal
ID - 1340
TI - The big match in small space
VL - 9928
ER -
TY - CONF
AB - In resource allocation games, selfish players share resources that are needed in order to fulfill their objectives. The cost of using a resource depends on the load on it. In the traditional setting, the players make their choices concurrently and in one-shot. That is, a strategy for a player is a subset of the resources. We introduce and study dynamic resource allocation games. In this setting, the game proceeds in phases. In each phase each player chooses one resource. A scheduler dictates the order in which the players proceed in a phase, possibly scheduling several players to proceed concurrently. The game ends when each player has collected a set of resources that fulfills his objective. The cost for each player then depends on this set as well as on the load on the resources in it – we consider both congestion and cost-sharing games. We argue that the dynamic setting is the suitable setting for many applications in practice. We study the stability of dynamic resource allocation games, where the appropriate notion of stability is that of subgame perfect equilibrium, study the inefficiency incurred due to selfish behavior, and also study problems that are particular to the dynamic setting, like constraints on the order in which resources can be chosen or the problem of finding a scheduler that achieves stability.
AU - Avni, Guy
AU - Henzinger, Thomas A
AU - Kupferman, Orna
ID - 1341
TI - Dynamic resource allocation games
VL - 9928
ER -
TY - JOUR
AB - A key aspect of bacterial survival is the ability to evolve while migrating across spatially varying environmental challenges. Laboratory experiments, however, often study evolution in well-mixed systems. Here, we introduce an experimental device, the microbial evolution and growth arena (MEGA)-plate, in which bacteria spread and evolved on a large antibiotic landscape (120 × 60 centimeters) that allowed visual observation of mutation and selection in a migrating bacterial front.While resistance increased consistently, multiple coexisting lineages diversified both phenotypically and genotypically. Analyzing mutants at and behind the propagating front,we found that evolution is not always led by the most resistant mutants; highly resistant mutants may be trapped behindmore sensitive lineages.TheMEGA-plate provides a versatile platformfor studying microbial adaption and directly visualizing evolutionary dynamics.
AU - Baym, Michael
AU - Lieberman, Tami
AU - Kelsic, Eric
AU - Chait, Remy P
AU - Gross, Rotem
AU - Yelin, Idan
AU - Kishony, Roy
ID - 1342
IS - 6304
JF - Science
TI - Spatiotemporal microbial evolution on antibiotic landscapes
VL - 353
ER -
TY - JOUR
AB - The Fermi-Hubbard model is one of the key models of condensed matter physics, which holds a
potential for explaining the mystery of high-temperature superconductivity. Recent progress in
ultracold atoms in optical lattices has paved the way to studying the model’s phase diagram using
the tools of quantum simulation, which emerged as a promising alternative to the numerical
calculations plagued by the infamous sign problem. However, the temperatures achieved using
elaborate laser cooling protocols so far have been too high to show the appearance of
antiferromagnetic (AF) and superconducting quantum phases directly. In this work, we demonstrate
that using the machinery of dissipative quantum state engineering, one can observe the emergence of
the AF order in the Fermi-Hubbard model with fermions in optical lattices. The core of the approach
is to add incoherent laser scattering in such a way that the AF state emerges as the dark state of
the driven-dissipative dynamics. The proposed controlled dissipation channels described in this work
are straightforward to add to already existing experimental setups.
AU - Kaczmarczyk, Jan
AU - Weimer, Hendrik
AU - Lemeshko, Mikhail
ID - 1343
IS - 9
JF - New Journal of Physics
TI - Dissipative preparation of antiferromagnetic order in the Fermi-Hubbard model
VL - 18
ER -
TY - JOUR
AB - Despite being composed of immobile cells, plants reorient along directional stimuli. The hormone auxin is redistributed in stimulated organs leading to differential growth and bending. Auxin application triggers rapid cell wall acidification and elongation of aerial organs of plants, but the molecular players mediating these effects are still controversial. Here we use genetically-encoded pH and auxin signaling sensors, pharmacological and genetic manipulations available for Arabidopsis etiolated hypocotyls to clarify how auxin is perceived and the downstream growth executed. We show that auxin-induced acidification occurs by local activation of H+-ATPases, which in the context of gravity response is restricted to the lower organ side. This auxin-stimulated acidification and growth require TIR1/AFB-Aux/IAA nuclear auxin perception. In addition, auxin-induced gene transcription and specifically SAUR proteins are crucial downstream mediators of this growth. Our study provides strong experimental support for the acid growth theory and clarified the contribution of the upstream auxin perception mechanisms.
AU - Fendrych, Matyas
AU - Leung, Jeffrey
AU - Friml, Jirí
ID - 1344
JF - eLife
TI - TIR1 AFB Aux IAA auxin perception mediates rapid cell wall acidification and growth of Arabidopsis hypocotyls
VL - 5
ER -
TY - JOUR
AB - The electrostatic charge at the inner surface of the plasma membrane is strongly negative in higher organisms. A new study shows that phosphatidylinositol-4-phosphate plays a critical role in establishing plasma membrane surface charge in Arabidopsis, which regulates the correct localization of signalling components.
AU - Molnar, Gergely
AU - Fendrych, Matyas
AU - Friml, Jirí
ID - 1345
JF - Nature Plants
TI - Plasma membrane: Negative attraction
VL - 2
ER -
TY - JOUR
AB - ATP production requires the establishment of an electrochemical proton gradient across the inner mitochondrial membrane. Mitochondrial uncouplers dissipate this proton gradient and disrupt numerous cellular processes, including vesicular trafficking, mainly through energy depletion. Here we show that Endosidin9 (ES9), a novel mitochondrial uncoupler, is a potent inhibitor of clathrin-mediated endocytosis (CME) in different systems and that ES9 induces inhibition of CME not because of its effect on cellular ATP, but rather due to its protonophore activity that leads to cytoplasm acidification. We show that the known tyrosine kinase inhibitor tyrphostinA23, which is routinely used to block CME, displays similar properties, thus questioning its use as a specific inhibitor of cargo recognition by the AP-2 adaptor complex via tyrosine motif-based endocytosis signals. Furthermore, we show that cytoplasm acidification dramatically affects the dynamics and recruitment of clathrin and associated adaptors, and leads to reduction of phosphatidylinositol 4,5-biphosphate from the plasma membrane.
AU - Dejonghe, Wim
AU - Kuenen, Sabine
AU - Mylle, Evelien
AU - Vasileva, Mina K
AU - Keech, Olivier
AU - Viotti, Corrado
AU - Swerts, Jef
AU - Fendrych, Matyas
AU - Ortiz Morea, Fausto
AU - Mishev, Kiril
AU - Delang, Simon
AU - Scholl, Stefan
AU - Zarza, Xavier
AU - Heilmann, Mareike
AU - Kourelis, Jiorgos
AU - Kasprowicz, Jaroslaw
AU - Nguyen, Le
AU - Drozdzecki, Andrzej
AU - Van Houtte, Isabelle
AU - Szatmári, Anna
AU - Majda, Mateusz
AU - Baisa, Gary
AU - Bednarek, Sebastian
AU - Robert, Stéphanie
AU - Audenaert, Dominique
AU - Testerink, Christa
AU - Munnik, Teun
AU - Van Damme, Daniël
AU - Heilmann, Ingo
AU - Schumacher, Karin
AU - Winne, Johan
AU - Friml, Jirí
AU - Verstreken, Patrik
AU - Russinova, Eugenia
ID - 1346
JF - Nature Communications
TI - Mitochondrial uncouplers inhibit clathrin-mediated endocytosis largely through cytoplasmic acidification
VL - 7
ER -
TY - JOUR
AB - During the past 70 years, the quantum theory of angular momentum has been successfully applied to describing the properties of nuclei, atoms, and molecules, and their interactions with each other as well as with external fields. Because of the properties of quantum rotations, the angular-momentum algebra can be of tremendous complexity even for a few interacting particles, such as valence electrons of an atom, not to mention larger many-particle systems. In this work, we study an example of the latter: A rotating quantum impurity coupled to a many-body bosonic bath. In the regime of strong impurity-bath couplings, the problem involves the addition of an infinite number of angular momenta, which renders it intractable using currently available techniques. Here, we introduce a novel canonical transformation that allows us to eliminate the complex angular-momentum algebra from such a class of many-body problems. In addition, the transformation exposes the problem's constants of motion, and renders it solvable exactly in the limit of a slowly rotating impurity. We exemplify the technique by showing that there exists a critical rotational speed at which the impurity suddenly acquires one quantum of angular momentum from the many-particle bath. Such an instability is accompanied by the deformation of the phonon density in the frame rotating along with the impurity.
AU - Schmidt, Richard
AU - Lemeshko, Mikhail
ID - 1347
IS - 1
JF - Physical Review X
TI - Deformation of a quantum many-particle system by a rotating impurity
VL - 6
ER -
TY - CONF
AB - A drawing in the plane (ℝ2) of a graph G = (V,E) equipped with a function γ : V → ℕ is x-bounded if (i) x(u) < x(v) whenever γ(u) < γ(v) and (ii) γ(u) ≤ γ(w) ≤ γ(v), where uv ∈ E and γ(u) ≤ γ(v), whenever x(w) ∈ x(uv), where x(.) denotes the projection to the xaxis.We prove a characterization of isotopy classes of embeddings of connected graphs equipped with γ in the plane containing an x-bounded embedding.Then we present an efficient algorithm, which relies on our result, for testing the existence of an x-bounded embedding if the given graph is a forest.This partially answers a question raised recently by Angelini et al.and Chang et al., and proves that c-planarity testing of flat clustered graphs with three clusters is tractable when the underlying abstract graph is a forest.
AU - Fulek, Radoslav
ID - 1348
TI - Bounded embeddings of graphs in the plane
VL - 9843
ER -
TY - CONF
AB - Crossing fitness valleys is one of the major obstacles to function optimization. In this paper we investigate how the structure of the fitness valley, namely its depth d and length ℓ, influence the runtime of different strategies for crossing these valleys. We present a runtime comparison between the (1+1) EA and two non-elitist nature-inspired algorithms, Strong Selection Weak Mutation (SSWM) and the Metropolis algorithm. While the (1+1) EA has to jump across the valley to a point of higher fitness because it does not accept decreasing moves, the non-elitist algorithms may cross the valley by accepting worsening moves. We show that while the runtime of the (1+1) EA algorithm depends critically on the length of the valley, the runtimes of the non-elitist algorithms depend crucially only on the depth of the valley. In particular, the expected runtime of both SSWM and Metropolis is polynomial in ℓ and exponential in d while the (1+1) EA is efficient only for valleys of small length. Moreover, we show that both SSWM and Metropolis can also efficiently optimize a rugged function consisting of consecutive valleys.
AU - Oliveto, Pietro
AU - Paixao, Tiago
AU - Heredia, Jorge
AU - Sudholt, Dirk
AU - Trubenova, Barbora
ID - 1349
T2 - Proceedings of the Genetic and Evolutionary Computation Conference 2016
TI - When non-elitism outperforms elitism for crossing fitness valleys
ER -
TY - JOUR
AB - The hippocampal CA3 region plays a key role in learning and memory. Recurrent CA3–CA3
synapses are thought to be the subcellular substrate of pattern completion. However, the
synaptic mechanisms of this network computation remain enigmatic. To investigate these mechanisms, we combined functional connectivity analysis with network modeling.
Simultaneous recording fromup to eight CA3 pyramidal neurons revealed that connectivity was sparse, spatially uniform, and highly enriched in disynaptic motifs (reciprocal, convergence,divergence, and chain motifs). Unitary connections were composed of one or two synaptic contacts, suggesting efficient use of postsynaptic space. Real-size modeling indicated that CA3 networks with sparse connectivity, disynaptic motifs, and single-contact connections robustly generated pattern completion.Thus, macro- and microconnectivity contribute to efficient
memory storage and retrieval in hippocampal networks.
AU - Guzmán, José
AU - Schlögl, Alois
AU - Frotscher, Michael
AU - Jonas, Peter M
ID - 1350
IS - 6304
JF - Science
TI - Synaptic mechanisms of pattern completion in the hippocampal CA3 network
VL - 353
ER -
TY - JOUR
AB - We study the interplay of nematic and superconducting order in the two-dimensional Hubbard model and show that they can coexist, especially when superconductivity is not the energetically dominant phase. Due to a breaking of the C4 symmetry, the coexisting phase inherently contains admixture of the s-wave pairing components. As a result, the superconducting gap exhibits nonstandard features including changed nodal directions. Our results also show that in the optimally doped regime the pure superconducting phase is typically unstable towards developing nematicity (breaking of the C4 symmetry). This has implications for the cuprate high-Tc superconductors, for which in this regime the so-called intertwined orders have recently been observed. Namely, the coexisting phase may be viewed as a precursor to such more involved patterns of symmetry breaking.
AU - Kaczmarczyk, Jan
AU - Schickling, Tobias
AU - Bünemann, Jörg
ID - 1352
IS - 8
JF - Physical Review B - Condensed Matter and Materials Physics
TI - Coexistence of nematic order and superconductivity in the Hubbard model
VL - 94
ER -
TY - JOUR
AB - We characterize absorption in finite idempotent algebras by means of Jónsson absorption and cube term blockers. As an application we show that it is decidable whether a given subset is an absorbing subuniverse of an algebra given by the tables of its basic operations.
AU - Barto, Libor
AU - Kazda, Alexandr
ID - 1353
IS - 5
JF - International Journal of Algebra and Computation
TI - Deciding absorption
VL - 26
ER -