TY - CONF AB - In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a non-terminating system and its environment. In bidding games the players bid for the right to move the token: in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Bidding games are known to have a clean and elegant mathematical structure that relies on the ability of the players to submit arbitrarily small bids. Many applications, however, require a fixed granularity for the bids, which can represent, for example, the monetary value expressed in cents. We study, for the first time, the combination of discrete-bidding and infinite-duration games. Our most important result proves that these games form a large determined subclass of concurrent games, where determinacy is the strong property that there always exists exactly one player who can guarantee winning the game. In particular, we show that, in contrast to non-discrete bidding games, the mechanism with which tied bids are resolved plays an important role in discrete-bidding games. We study several natural tie-breaking mechanisms and show that, while some do not admit determinacy, most natural mechanisms imply determinacy for every pair of initial budgets. AU - Aghajohari, Milad AU - Avni, Guy AU - Henzinger, Thomas A ID - 6886 TI - Determinacy in discrete-bidding infinite-duration games VL - 140 ER - TY - CONF AB - A vector addition system with states (VASS) consists of a finite set of states and counters. A configuration is a state and a value for each counter; a transition changes the state and each counter is incremented, decremented, or left unchanged. While qualitative properties such as state and configuration reachability have been studied for VASS, we consider the long-run average cost of infinite computations of VASS. The cost of a configuration is for each state, a linear combination of the counter values. In the special case of uniform cost functions, the linear combination is the same for all states. The (regular) long-run emptiness problem is, given a VASS, a cost function, and a threshold value, if there is a (lasso-shaped) computation such that the long-run average value of the cost function does not exceed the threshold. For uniform cost functions, we show that the regular long-run emptiness problem is (a) decidable in polynomial time for integer-valued VASS, and (b) decidable but nonelementarily hard for natural-valued VASS (i.e., nonnegative counters). For general cost functions, we show that the problem is (c) NP-complete for integer-valued VASS, and (d) undecidable for natural-valued VASS. Our most interesting result is for (c) integer-valued VASS with general cost functions, where we establish a connection between the regular long-run emptiness problem and quadratic Diophantine inequalities. The general (nonregular) long-run emptiness problem is equally hard as the regular problem in all cases except (c), where it remains open. AU - Chatterjee, Krishnendu AU - Henzinger, Thomas A AU - Otop, Jan ID - 6885 TI - Long-run average behavior of vector addition systems with states VL - 140 ER - TY - CONF AB - We study Markov decision processes and turn-based stochastic games with parity conditions. There are three qualitative winning criteria, namely, sure winning, which requires all paths to satisfy the condition, almost-sure winning, which requires the condition to be satisfied with probability 1, and limit-sure winning, which requires the condition to be satisfied with probability arbitrarily close to 1. We study the combination of two of these criteria for parity conditions, e.g., there are two parity conditions one of which must be won surely, and the other almost-surely. The problem has been studied recently by Berthon et al. for MDPs with combination of sure and almost-sure winning, under infinite-memory strategies, and the problem has been established to be in NP cap co-NP. Even in MDPs there is a difference between finite-memory and infinite-memory strategies. Our main results for combination of sure and almost-sure winning are as follows: (a) we show that for MDPs with finite-memory strategies the problem is in NP cap co-NP; (b) we show that for turn-based stochastic games the problem is co-NP-complete, both for finite-memory and infinite-memory strategies; and (c) we present algorithmic results for the finite-memory case, both for MDPs and turn-based stochastic games, by reduction to non-stochastic parity games. In addition we show that all the above complexity results also carry over to combination of sure and limit-sure winning, and results for all other combinations can be derived from existing results in the literature. Thus we present a complete picture for the study of combinations of two qualitative winning criteria for parity conditions in MDPs and turn-based stochastic games. AU - Chatterjee, Krishnendu AU - Piterman, Nir ID - 6889 TI - Combinations of Qualitative Winning for Stochastic Parity Games VL - 140 ER - TY - CONF AB - Consider a distributed system with n processors out of which f can be Byzantine faulty. In the approximate agreement task, each processor i receives an input value xi and has to decide on an output value yi such that 1. the output values are in the convex hull of the non-faulty processors’ input values, 2. the output values are within distance d of each other. Classically, the values are assumed to be from an m-dimensional Euclidean space, where m ≥ 1. In this work, we study the task in a discrete setting, where input values with some structure expressible as a graph. Namely, the input values are vertices of a finite graph G and the goal is to output vertices that are within distance d of each other in G, but still remain in the graph-induced convex hull of the input values. For d = 0, the task reduces to consensus and cannot be solved with a deterministic algorithm in an asynchronous system even with a single crash fault. For any d ≥ 1, we show that the task is solvable in asynchronous systems when G is chordal and n > (ω + 1)f, where ω is the clique number of G. In addition, we give the first Byzantine-tolerant algorithm for a variant of lattice agreement. For synchronous systems, we show tight resilience bounds for the exact variants of these and related tasks over a large class of combinatorial structures. AU - Nowak, Thomas AU - Rybicki, Joel ID - 6931 KW - consensus KW - approximate agreement KW - Byzantine faults KW - chordal graphs KW - lattice agreement T2 - 33rd International Symposium on Distributed Computing TI - Byzantine approximate agreement on graphs VL - 146 ER - TY - CONF AB - In this paper, we introduce a novel method to interpret recurrent neural networks (RNNs), particularly long short-term memory networks (LSTMs) at the cellular level. We propose a systematic pipeline for interpreting individual hidden state dynamics within the network using response characterization methods. The ranked contribution of individual cells to the network's output is computed by analyzing a set of interpretable metrics of their decoupled step and sinusoidal responses. As a result, our method is able to uniquely identify neurons with insightful dynamics, quantify relationships between dynamical properties and test accuracy through ablation analysis, and interpret the impact of network capacity on a network's dynamical distribution. Finally, we demonstrate the generalizability and scalability of our method by evaluating a series of different benchmark sequential datasets. AU - Hasani, Ramin AU - Amini, Alexander AU - Lechner, Mathias AU - Naser, Felix AU - Grosu, Radu AU - Rus, Daniela ID - 6985 SN - 9781728119854 T2 - Proceedings of the International Joint Conference on Neural Networks TI - Response characterization for auditing cell dynamics in long short-term memory networks ER - TY - JOUR AB - We consider the primitive relay channel, where the source sends a message to the relay and to the destination, and the relay helps the communication by transmitting an additional message to the destination via a separate channel. Two well-known coding techniques have been introduced for this setting: decode-and-forward and compress-and-forward. In decode-and-forward, the relay completely decodes the message and sends some information to the destination; in compress-and-forward, the relay does not decode, and it sends a compressed version of the received signal to the destination using Wyner–Ziv coding. In this paper, we present a novel coding paradigm that provides an improved achievable rate for the primitive relay channel. The idea is to combine compress-and-forward and decode-and-forward via a chaining construction. We transmit over pairs of blocks: in the first block, we use compress-and-forward; and, in the second block, we use decode-and-forward. More specifically, in the first block, the relay does not decode, it compresses the received signal via Wyner–Ziv, and it sends only part of the compression to the destination. In the second block, the relay completely decodes the message, it sends some information to the destination, and it also sends the remaining part of the compression coming from the first block. By doing so, we are able to strictly outperform both compress-and-forward and decode-and-forward. Note that the proposed coding scheme can be implemented with polar codes. As such, it has the typical attractive properties of polar coding schemes, namely, quasi-linear encoding and decoding complexity, and error probability that decays at super-polynomial speed. As a running example, we take into account the special case of the erasure relay channel, and we provide a comparison between the rates achievable by our proposed scheme and the existing upper and lower bounds. AU - Mondelli, Marco AU - Hassani, S. Hamed AU - Urbanke, Rüdiger ID - 7007 IS - 10 JF - Algorithms SN - 1999-4893 TI - A new coding paradigm for the primitive relay channel VL - 12 ER - TY - CONF AB - The aim of this short note is to expound one particular issue that was discussed during the talk [10] given at the symposium ”Researches on isometries as preserver problems and related topics” at Kyoto RIMS. That is, the role of Dirac masses by describing the isometry group of various metric spaces of probability measures. This article is of survey character, and it does not contain any essentially new results.From an isometric point of view, in some cases, metric spaces of measures are similar to C(K)-type function spaces. Similarity means here that their isometries are driven by some nice transformations of the underlying space. Of course, it depends on the particular choice of the metric how nice these transformations should be. Sometimes, as we will see, being a homeomorphism is enough to generate an isometry. But sometimes we need more: the transformation must preserve the underlying distance as well. Statements claiming that isometries in questions are necessarily induced by homeomorphisms are called Banach-Stone-type results, while results asserting that the underlying transformation is necessarily an isometry are termed as isometric rigidity results.As Dirac masses can be considered as building bricks of the set of all Borel measures, a natural question arises:Is it enough to understand how an isometry acts on the set of Dirac masses? Does this action extend uniquely to all measures?In what follows, we will thoroughly investigate this question. AU - Geher, Gyorgy Pal AU - Titkos, Tamas AU - Virosztek, Daniel ID - 7035 T2 - Kyoto RIMS Kôkyûroku TI - Dirac masses and isometric rigidity VL - 2125 ER - TY - BOOK AB - Wissen Sie, was sich hinter künstlicher Intelligenz und maschinellem Lernen verbirgt? Dieses Sachbuch erklärt Ihnen leicht verständlich und ohne komplizierte Formeln die grundlegenden Methoden und Vorgehensweisen des maschinellen Lernens. Mathematisches Vorwissen ist dafür nicht nötig. Kurzweilig und informativ illustriert Lisa, die Protagonistin des Buches, diese anhand von Alltagssituationen. Ein Buch für alle, die in Diskussionen über Chancen und Risiken der aktuellen Entwicklung der künstlichen Intelligenz und des maschinellen Lernens mit Faktenwissen punkten möchten. Auch für Schülerinnen und Schüler geeignet! ED - Kersting, Kristian ED - Lampert, Christoph ED - Rothkopf, Constantin ID - 7171 SN - 978-3-658-26762-9 TI - Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt ER - TY - CONF AB - The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface M_g of genus g. A drawing of a graph on a surface is independently even if every pair of nonadjacent edges in the drawing crosses an even number of times. The Z_2-genus of a graph G, denoted by g_0(G), is the minimum g such that G has an independently even drawing on M_g. By a result of Battle, Harary, Kodama and Youngs from 1962, the graph genus is additive over 2-connected blocks. In 2013, Schaefer and Stefankovic proved that the Z_2-genus of a graph is additive over 2-connected blocks as well, and asked whether this result can be extended to so-called 2-amalgamations, as an analogue of results by Decker, Glover, Huneke, and Stahl for the genus. We give the following partial answer. If G=G_1 cup G_2, G_1 and G_2 intersect in two vertices u and v, and G-u-v has k connected components (among which we count the edge uv if present), then |g_0(G)-(g_0(G_1)+g_0(G_2))|<=k+1. For complete bipartite graphs K_{m,n}, with n >= m >= 3, we prove that g_0(K_{m,n})/g(K_{m,n})=1-O(1/n). Similar results are proved also for the Euler Z_2-genus. We express the Z_2-genus of a graph using the minimum rank of partial symmetric matrices over Z_2; a problem that might be of independent interest. AU - Fulek, Radoslav AU - Kyncl, Jan ID - 7401 SN - 1868-8969 T2 - 35th International Symposium on Computational Geometry (SoCG 2019) TI - Z_2-Genus of graphs and minimum rank of partial symmetric matrices VL - 129 ER - TY - CHAP AB - We illustrate the ingredients of the state-of-the-art of model-based approach for the formal design and verification of cyber-physical systems. To capture the interaction between a discrete controller and its continuously evolving environment, we use the formal models of timed and hybrid automata. We explain the steps of modeling and verification in the tools Uppaal and SpaceEx using a case study based on a dual-chamber implantable pacemaker monitoring a human heart. We show how to design a model as a composition of components, how to construct models at varying levels of detail, how to establish that one model is an abstraction of another, how to specify correctness requirements using temporal logic, and how to verify that a model satisfies a logical requirement. AU - Alur, Rajeev AU - Giacobbe, Mirco AU - Henzinger, Thomas A AU - Larsen, Kim G. AU - Mikučionis, Marius ED - Steffen, Bernhard ED - Woeginger, Gerhard ID - 7453 SN - 1611-3349 T2 - Computing and Software Science TI - Continuous-time models for system design and analysis VL - 10000 ER - TY - JOUR AB - We consider an optimal control problem for an abstract nonlinear dissipative evolution equation. The differential constraint is penalized by augmenting the target functional by a nonnegative global-in-time functional which is null-minimized in the evolution equation is satisfied. Different variational settings are presented, leading to the convergence of the penalization method for gradient flows, noncyclic and semimonotone flows, doubly nonlinear evolutions, and GENERIC systems. AU - Portinale, Lorenzo AU - Stefanelli, Ulisse ID - 7550 IS - 2 JF - Advances in Mathematical Sciences and Applications SN - 1343-4373 TI - Penalization via global functionals of optimal-control problems for dissipative evolution VL - 28 ER - TY - GEN AB - There is increasing evidence that protein binding to specific sites along DNA can activate the reading out of genetic information without coming into direct physical contact with the gene. There also is evidence that these distant but interacting sites are embedded in a liquid droplet of proteins which condenses out of the surrounding solution. We argue that droplet-mediated interactions can account for crucial features of gene regulation only if the droplet is poised at a non-generic point in its phase diagram. We explore a minimal model that embodies this idea, show that this model has a natural mechanism for self-tuning, and suggest direct experimental tests. AU - Bialek, William AU - Gregor, Thomas AU - Tkačik, Gašper ID - 7552 T2 - arXiv:1912.08579 TI - Action at a distance in transcriptional regulation ER - TY - CONF AB - We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2019. In this year, 6 tools Ariadne, CORA, DynIbex, Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. They are applied to solve reachability analysis problems on four benchmark problems, one of them with hybrid dynamics. We do not rank the tools based on the results, but show the current status and discover the potential advantages of different tools. AU - Immler, Fabian AU - Althoff, Matthias AU - Benet, Luis AU - Chapoutot, Alexandre AU - Chen, Xin AU - Forets, Marcelo AU - Geretti, Luca AU - Kochdumper, Niklas AU - Sanders, David P. AU - Schilling, Christian ID - 7576 T2 - EPiC Series in Computing TI - ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics VL - 61 ER - TY - CONF AB - We study edge asymptotics of poissonized Plancherel-type measures on skew Young diagrams (integer partitions). These measures can be seen as generalizations of those studied by Baik--Deift--Johansson and Baik--Rains in resolving Ulam's problem on longest increasing subsequences of random permutations and the last passage percolation (corner growth) discrete versions thereof. Moreover they interpolate between said measures and the uniform measure on partitions. In the new KPZ-like 1/3 exponent edge scaling limit with logarithmic corrections, we find new probability distributions generalizing the classical Tracy--Widom GUE, GOE and GSE distributions from the theory of random matrices. AU - Betea, Dan AU - Bouttier, Jérémie AU - Nejjar, Peter AU - Vuletíc, Mirjana ID - 8175 T2 - Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics TI - New edge asymptotics of skew Young diagrams via free boundaries ER - TY - CONF AB - This report presents the results of a friendly competition for formal verification of continuous and hybrid systems with linear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2019. In its third edition, seven tools have been applied to solve six different benchmark problems in the category for linear continuous dynamics (in alphabetical order): CORA, CORA/SX, HyDRA, Hylaa, JuliaReach, SpaceEx, and XSpeed. This report is a snapshot of the current landscape of tools and the types of benchmarks they are particularly suited for. Due to the diversity of problems, we are not ranking tools, yet the presented results provide one of the most complete assessments of tools for the safety verification of continuous and hybrid systems with linear continuous dynamics up to this date. AU - Althoff, Matthias AU - Bak, Stanley AU - Forets, Marcelo AU - Frehse, Goran AU - Kochdumper, Niklas AU - Ray, Rajarshi AU - Schilling, Christian AU - Schupp, Stefan ID - 8570 T2 - EPiC Series in Computing TI - ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics VL - 61 ER - TY - JOUR AB - Epigenetic reprogramming is required for proper regulation of gene expression in eukaryotic organisms. In Arabidopsis, active DNA demethylation is crucial for seed viability, pollen function, and successful reproduction. The DEMETER (DME) DNA glycosylase initiates localized DNA demethylation in vegetative and central cells, so-called companion cells that are adjacent to sperm and egg gametes, respectively. In rice, the central cell genome displays local DNA hypomethylation, suggesting that active DNA demethylation also occurs in rice; however, the enzyme responsible for this process is unknown. One candidate is the rice REPRESSOR OF SILENCING 1a (ROS1a) gene, which is related to DME and is essential for rice seed viability and pollen function. Here, we report genome-wide analyses of DNA methylation in wild-type and ros1a mutant sperm and vegetative cells. We find that the rice vegetative cell genome is locally hypomethylated compared with sperm by a process that requires ROS1a activity. We show that many ROS1a target sequences in the vegetative cell are hypomethylated in the rice central cell, suggesting that ROS1a also demethylates the central cell genome. Similar to Arabidopsis, we show that sperm non-CG methylation is indirectly promoted by DNA demethylation in the vegetative cell. These results reveal that DNA glycosylase-mediated DNA demethylation processes are conserved in Arabidopsis and rice, plant species that diverged 150 million years ago. Finally, although global non-CG methylation levels of sperm and egg differ, the maternal and paternal embryo genomes show similar non-CG methylation levels, suggesting that rice gamete genomes undergo dynamic DNA methylation reprogramming after cell fusion. AU - Kim, M. Yvonne AU - Ono, Akemi AU - Scholten, Stefan AU - Kinoshita, Tetsu AU - Zilberman, Daniel AU - Okamoto, Takashi AU - Fischer, Robert L. ID - 9460 IS - 19 JF - Proceedings of the National Academy of Sciences KW - Multidisciplinary SN - 0027-8424 TI - DNA demethylation by ROS1a in rice vegetative cells promotes methylation in sperm VL - 116 ER - TY - JOUR AB - Glyphosate (N-phosphonomethyl glycine) and its commercial herbicide formulations have been shown to exert toxicity via various mechanisms. It has been asserted that glyphosate substitutes for glycine in polypeptide chains leading to protein misfolding and toxicity. However, as no direct evidence exists for glycine to glyphosate substitution in proteins, including in mammalian organisms, we tested this claim by conducting a proteomics analysis of MDA-MB-231 human breast cancer cells grown in the presence of 100 mg/L glyphosate for 6 days. Protein extracts from three treated and three untreated cell cultures were analysed as one TMT-6plex labelled sample, to highlight a specific pattern (+/+/+/−/−/−) of reporter intensities for peptides bearing true glyphosate treatment induced-post translational modifications as well as allowing an investigation of the total proteome. AU - Antoniou, Michael N. AU - Nicolas, Armel AU - Mesnage, Robin AU - Biserni, Martina AU - Rao, Francesco V. AU - Martin, Cristina Vazquez ID - 6819 JF - BMC Research Notes TI - Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells VL - 12 ER - TY - GEN AB - Additional file 1: Table S1. Kinetics of MDA-MB-231 cell growth in either the presence or absence of 100Â mg/L glyphosate. Cell counts are given at day-1 of seeding flasks and following 6-days of continuous culture. Note: no differences in cell numbers were observed between negative control and glyphosate treated cultures. AU - Antoniou, Michael N. AU - Nicolas, Armel AU - Mesnage, Robin AU - Biserni, Martina AU - Rao, Francesco V. AU - Martin, Cristina Vazquez ID - 9784 TI - MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells ER - TY - GEN AB - More than 100 years after Grigg’s influential analysis of species’ borders, the causes of limits to species’ ranges still represent a puzzle that has never been understood with clarity. The topic has become especially important recently as many scientists have become interested in the potential for species’ ranges to shift in response to climate change—and yet nearly all of those studies fail to recognise or incorporate evolutionary genetics in a way that relates to theoretical developments. I show that range margins can be understood based on just two measurable parameters: (i) the fitness cost of dispersal—a measure of environmental heterogeneity—and (ii) the strength of genetic drift, which reduces genetic diversity. Together, these two parameters define an ‘expansion threshold’: adaptation fails when genetic drift reduces genetic diversity below that required for adaptation to a heterogeneous environment. When the key parameters drop below this expansion threshold locally, a sharp range margin forms. When they drop below this threshold throughout the species’ range, adaptation collapses everywhere, resulting in either extinction or formation of a fragmented metapopulation. Because the effects of dispersal differ fundamentally with dimension, the second parameter—the strength of genetic drift—is qualitatively different compared to a linear habitat. In two-dimensional habitats, genetic drift becomes effectively independent of selection. It decreases with ‘neighbourhood size’—the number of individuals accessible by dispersal within one generation. Moreover, in contrast to earlier predictions, which neglected evolution of genetic variance and/or stochasticity in two dimensions, dispersal into small marginal populations aids adaptation. This is because the reduction of both genetic and demographic stochasticity has a stronger effect than the cost of dispersal through increased maladaptation. The expansion threshold thus provides a novel, theoretically justified, and testable prediction for formation of the range margin and collapse of the species’ range. AU - Polechova, Jitka ID - 9839 TI - Data from: Is the sky the limit? On the expansion threshold of a species' range ER - TY - JOUR AB - Background DNA methylation of active genes, also known as gene body methylation, is found in many animal and plant genomes. Despite this, the transcriptional and developmental role of such methylation remains poorly understood. Here, we explore the dynamic range of DNA methylation in honey bee, a model organism for gene body methylation. Results Our data show that CG methylation in gene bodies globally fluctuates during honey bee development. However, these changes cause no gene expression alterations. Intriguingly, despite the global alterations, tissue-specific CG methylation patterns of complete genes or exons are rare, implying robust maintenance of genic methylation during development. Additionally, we show that CG methylation maintenance fluctuates in somatic cells, while reaching maximum fidelity in sperm cells. Finally, unlike universally present CG methylation, we discovered non-CG methylation specifically in bee heads that resembles such methylation in mammalian brain tissue. Conclusions Based on these results, we propose that gene body CG methylation can oscillate during development if it is kept to a level adequate to preserve function. Additionally, our data suggest that heightened non-CG methylation is a conserved regulator of animal nervous systems. AU - Harris, Keith D. AU - Lloyd, James P. B. AU - Domb, Katherine AU - Zilberman, Daniel AU - Zemach, Assaf ID - 9530 JF - Epigenetics and Chromatin TI - DNA methylation is maintained with high fidelity in the honey bee germline and exhibits global non-functional fluctuations during somatic development VL - 12 ER - TY - JOUR AB - Transposable elements (TEs), the movement of which can damage the genome, are epigenetically silenced in eukaryotes. Intriguingly, TEs are activated in the sperm companion cell – vegetative cell (VC) – of the flowering plant Arabidopsis thaliana. However, the extent and mechanism of this activation are unknown. Here we show that about 100 heterochromatic TEs are activated in VCs, mostly by DEMETER-catalyzed DNA demethylation. We further demonstrate that DEMETER access to some of these TEs is permitted by the natural depletion of linker histone H1 in VCs. Ectopically expressed H1 suppresses TEs in VCs by reducing DNA demethylation and via a methylation-independent mechanism. We demonstrate that H1 is required for heterochromatin condensation in plant cells and show that H1 overexpression creates heterochromatic foci in the VC progenitor cell. Taken together, our results demonstrate that the natural depletion of H1 during male gametogenesis facilitates DEMETER-directed DNA demethylation, heterochromatin relaxation, and TE activation. AU - He, Shengbo AU - Vickers, Martin AU - Zhang, Jingyi AU - Feng, Xiaoqi ID - 12192 JF - eLife KW - General Immunology and Microbiology KW - General Biochemistry KW - Genetics and Molecular Biology KW - General Medicine KW - General Neuroscience SN - 2050-084X TI - Natural depletion of histone H1 in sex cells causes DNA demethylation, heterochromatin decondensation and transposon activation VL - 8 ER - TY - JOUR AB - Meiotic crossover frequency varies within genomes, which influences genetic diversity and adaptation. In turn, genetic variation within populations can act to modify crossover frequency in cis and trans. To identify genetic variation that controls meiotic crossover frequency, we screened Arabidopsis accessions using fluorescent recombination reporters. We mapped a genetic modifier of crossover frequency in Col × Bur populations of Arabidopsis to a premature stop codon within TBP-ASSOCIATED FACTOR 4b (TAF4b), which encodes a subunit of the RNA polymerase II general transcription factor TFIID. The Arabidopsis taf4b mutation is a rare variant found in the British Isles, originating in South-West Ireland. Using genetics, genomics, and immunocytology, we demonstrate a genome-wide decrease in taf4b crossovers, with strongest reduction in the sub-telomeric regions. Using RNA sequencing (RNA-seq) from purified meiocytes, we show that TAF4b expression is meiocyte enriched, whereas its paralog TAF4 is broadly expressed. Consistent with the role of TFIID in promoting gene expression, RNA-seq of wild-type and taf4b meiocytes identified widespread transcriptional changes, including in genes that regulate the meiotic cell cycle and recombination. Therefore, TAF4b duplication is associated with acquisition of meiocyte-specific expression and promotion of germline transcription, which act directly or indirectly to elevate crossovers. This identifies a novel mode of meiotic recombination control via a general transcription factor. AU - Lawrence, Emma J. AU - Gao, Hongbo AU - Tock, Andrew J. AU - Lambing, Christophe AU - Blackwell, Alexander R. AU - Feng, Xiaoqi AU - Henderson, Ian R. ID - 12190 IS - 16 JF - Current Biology KW - General Agricultural and Biological Sciences KW - General Biochemistry KW - Genetics and Molecular Biology SN - 0960-9822 TI - Natural variation in TBP-ASSOCIATED FACTOR 4b controls meiotic crossover and germline transcription in Arabidopsis VL - 29 ER - TY - GEN AU - Schlögl, Alois AU - Kiss, Janos AU - Elefante, Stefano ID - 12901 T2 - AHPC19 - Austrian HPC Meeting 2019 TI - Is Debian suitable for running an HPC Cluster? ER - TY - CONF AB - When can a polyomino piece of paper be folded into a unit cube? Prior work studied tree-like polyominoes, but polyominoes with holes remain an intriguing open problem. We present sufficient conditions for a polyomino with hole(s) to fold into a cube, and conditions under which cube folding is impossible. In particular, we show that all but five special simple holes guarantee foldability. AU - Aichholzer, Oswin AU - Akitaya, Hugo A AU - Cheung, Kenneth C AU - Demaine, Erik D AU - Demaine, Martin L AU - Fekete, Sandor P AU - Kleist, Linda AU - Kostitsyna, Irina AU - Löffler, Maarten AU - Masárová, Zuzana AU - Mundilova, Klara AU - Schmidt, Christiane ID - 6989 T2 - Proceedings of the 31st Canadian Conference on Computational Geometry TI - Folding polyominoes with holes into a cube ER - TY - CONF AB - In two-player games on graphs, the players move a token through a graph to produce a finite or infinite path, which determines the qualitative winner or quantitative payoff of the game. We study bidding games in which the players bid for the right to move the token. Several bidding rules were studied previously. In Richman bidding, in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Poorman bidding is similar except that the winner of the bidding pays the "bank" rather than the other player. Taxman bidding spans the spectrum between Richman and poorman bidding. They are parameterized by a constant tau in [0,1]: portion tau of the winning bid is paid to the other player, and portion 1-tau to the bank. While finite-duration (reachability) taxman games have been studied before, we present, for the first time, results on infinite-duration taxman games. It was previously shown that both Richman and poorman infinite-duration games with qualitative objectives reduce to reachability games, and we show a similar result here. Our most interesting results concern quantitative taxman games, namely mean-payoff games, where poorman and Richman bidding differ significantly. A central quantity in these games is the ratio between the two players' initial budgets. While in poorman mean-payoff games, the optimal payoff of a player depends on the initial ratio, in Richman bidding, the payoff depends only on the structure of the game. In both games the optimal payoffs can be found using (different) probabilistic connections with random-turn games in which in each turn, instead of bidding, a coin is tossed to determine which player moves. While the value with Richman bidding equals the value of a random-turn game with an un-biased coin, with poorman bidding, the bias in the coin is the initial ratio of the budgets. We give a complete classification of mean-payoff taxman games that is based on a probabilistic connection: the value of a taxman bidding game with parameter tau and initial ratio r, equals the value of a random-turn game that uses a coin with bias F(tau, r) = (r+tau * (1-r))/(1+tau). Thus, we show that Richman bidding is the exception; namely, for every tau <1, the value of the game depends on the initial ratio. Our proof technique simplifies and unifies the previous proof techniques for both Richman and poorman bidding. AU - Avni, Guy AU - Henzinger, Thomas A AU - Zikelic, Dorde ID - 6884 TI - Bidding mechanisms in graph games VL - 138 ER - TY - GEN AB - A detailed description of the two stochastic models, table of parameters, supplementary data for Figures 4 and 5, parameter dependence of the results, and an analysis on motors with different force–velocity functions (PDF) AU - Ucar, Mehmet C AU - Lipowsky, Reinhard ID - 9726 TI - Supplementary information - Collective force generation by molecular motors is determined by strain-induced unbinding ER - TY - JOUR AB - In this paper we discuss three results. The first two concern general sets of positive reach: we first characterize the reach of a closed set by means of a bound on the metric distortion between the distance measured in the ambient Euclidean space and the shortest path distance measured in the set. Secondly, we prove that the intersection of a ball with radius less than the reach with the set is geodesically convex, meaning that the shortest path between any two points in the intersection lies itself in the intersection. For our third result we focus on manifolds with positive reach and give a bound on the angle between tangent spaces at two different points in terms of the reach and the distance between the two points. AU - Boissonnat, Jean-Daniel AU - Lieutier, André AU - Wintraecken, Mathijs ID - 6671 IS - 1-2 JF - Journal of Applied and Computational Topology SN - 2367-1726 TI - The reach, metric distortion, geodesic convexity and the variation of tangent spaces VL - 3 ER - TY - JOUR AB - A representation formula for solutions of stochastic partial differential equations with Dirichlet boundary conditions is proved. The scope of our setting is wide enough to cover the general situation when the backward characteristics that appear in the usual formulation are not even defined in the Itô sense. AU - Gerencser, Mate AU - Gyöngy, István ID - 301 IS - 3 JF - Stochastic Processes and their Applications TI - A Feynman–Kac formula for stochastic Dirichlet problems VL - 129 ER - TY - JOUR AB - We consider an interacting, dilute Bose gas trapped in a harmonic potential at a positive temperature. The system is analyzed in a combination of a thermodynamic and a Gross–Pitaevskii (GP) limit where the trap frequency ω, the temperature T, and the particle number N are related by N∼ (T/ ω) 3→ ∞ while the scattering length is so small that the interaction energy per particle around the center of the trap is of the same order of magnitude as the spectral gap in the trap. We prove that the difference between the canonical free energy of the interacting gas and the one of the noninteracting system can be obtained by minimizing the GP energy functional. We also prove Bose–Einstein condensation in the following sense: The one-particle density matrix of any approximate minimizer of the canonical free energy functional is to leading order given by that of the noninteracting gas but with the free condensate wavefunction replaced by the GP minimizer. AU - Deuchert, Andreas AU - Seiringer, Robert AU - Yngvason, Jakob ID - 80 IS - 2 JF - Communications in Mathematical Physics TI - Bose–Einstein condensation in a dilute, trapped gas at positive temperature VL - 368 ER - TY - JOUR AB - Empirical data suggest that inversions in many species contain genes important for intraspecific divergence and speciation, yet mechanisms of evolution remain unclear. While genes inside an inversion are tightly linked, inversions are not static but evolve separately from the rest of the genome by new mutations, recombination within arrangements, and gene flux between arrangements. Inversion polymorphisms are maintained by different processes, for example, divergent or balancing selection, or a mix of multiple processes. Moreover, the relative roles of selection, drift, mutation, and recombination will change over the lifetime of an inversion and within its area of distribution. We believe inversions are central to the evolution of many species, but we need many more data and new models to understand the complex mechanisms involved. AU - Faria, Rui AU - Johannesson, Kerstin AU - Butlin, Roger K. AU - Westram, Anja M ID - 5911 IS - 3 JF - Trends in Ecology and Evolution SN - 01695347 TI - Evolving inversions VL - 34 ER - TY - JOUR AB - We count points over a finite field on wild character varieties,of Riemann surfaces for singularities with regular semisimple leading term. The new feature in our counting formulas is the appearance of characters of Yokonuma–Hecke algebras. Our result leads to the conjecture that the mixed Hodge polynomials of these character varieties agree with previously conjectured perverse Hodge polynomials of certain twisted parabolic Higgs moduli spaces, indicating the possibility of a P = W conjecture for a suitable wild Hitchin system. AU - Hausel, Tamas AU - Mereb, Martin AU - Wong, Michael ID - 439 IS - 10 JF - Journal of the European Mathematical Society TI - Arithmetic and representation theory of wild character varieties VL - 21 ER - TY - JOUR AB - Clinical Utility Gene Card. 1. Name of Disease (Synonyms): Pontocerebellar hypoplasia type 9 (PCH9) and spastic paraplegia-63 (SPG63). 2. OMIM# of the Disease: 615809 and 615686. 3. Name of the Analysed Genes or DNA/Chromosome Segments: AMPD2 at 1p13.3. 4. OMIM# of the Gene(s): 102771. AU - Marsh, Ashley AU - Novarino, Gaia AU - Lockhart, Paul AU - Leventer, Richard ID - 105 JF - European Journal of Human Genetics TI - CUGC for pontocerebellar hypoplasia type 9 and spastic paraplegia-63 VL - 27 ER - TY - JOUR AB - We provide an entropy formulation for porous medium-type equations with a stochastic, non-linear, spatially inhomogeneous forcing. Well-posedness and L1-contraction is obtained in the class of entropy solutions. Our scope allows for porous medium operators Δ(|u|m−1u) for all m∈(1,∞), and Hölder continuous diffusion nonlinearity with exponent 1/2. AU - Dareiotis, Konstantinos AU - Gerencser, Mate AU - Gess, Benjamin ID - 65 IS - 6 JF - Journal of Differential Equations TI - Entropy solutions for stochastic porous media equations VL - 266 ER - TY - JOUR AB - Microalgae of the genus Chlorella vulgaris are candidates for the production of lipids for biofuel production. Besides that, Chlorella vulgaris is marketed as protein and vitamin rich food additive. Its potential as a novel expression system for recombinant proteins inspired us to study its asparagine-linked oligosaccharides (N-glycans) by mass spectrometry, chromatography and gas chromatography. Oligomannosidic N-glycans with up to nine mannoses were the structures found in culture collection strains as well as several commercial products. These glycans co-eluted with plant N-glycans in the highly shape selective porous graphitic carbon chromatography. Thus, Chlorella vulgaris generates oligomannosidic N-glycans of the structural type known from land plants and animals. In fact, Man5 (Man5GlcNAc2) served as substrate for GlcNAc-transferase I and a trace of an endogenous structure with terminal GlcNAc was seen. The unusual more linear Man5 structure recently found on glycoproteins of Chlamydomonas reinhardtii occurred - if at all - in traces only. Notably, a majority of the oligomannosidic glycans was multiply O-methylated with 3-O-methyl and 3,6-di-O-methyl mannoses at the non-reducing termini. This modification has so far been neither found on plant nor vertebrate N-glycans. It’s possible immunogenicity raises concerns as to the use of C. vulgaris for production of pharmaceutical glycoproteins. AU - Mócsai, Réka AU - Figl, Rudolf AU - Troschl, Clemens AU - Strasser, Richard AU - Svehla, Elisabeth AU - Windwarder, Markus AU - Thader, Andreas AU - Altmann, Friedrich ID - 5907 IS - 1 JF - Scientific Reports TI - N-glycans of the microalga Chlorella vulgaris are of the oligomannosidic type but highly methylated VL - 9 ER - TY - JOUR AB - The interorganelle communication mediated by membrane contact sites (MCSs) is an evolutionary hallmark of eukaryotic cells. MCS connections enable the nonvesicular exchange of information between organelles and allow them to coordinate responses to changing cellular environments. In plants, the importance of MCS components in the responses to environmental stress has been widely established, but the molecular mechanisms regulating interorganelle connectivity during stress still remain opaque. In this report, we use the model plant Arabidopsis thaliana to show that ionic stress increases endoplasmic reticulum (ER)–plasma membrane (PM) connectivity by promoting the cortical expansion of synaptotagmin 1 (SYT1)-enriched ER–PM contact sites (S-EPCSs). We define differential roles for the cortical cytoskeleton in the regulation of S-EPCS dynamics and ER–PM connectivity, and we identify the accumulation of phosphatidylinositol 4,5-bisphosphate [PI(4,5)P2] at the PM as a molecular signal associated with the ER–PM connectivity changes. Our study highlights the functional conservation of EPCS components and PM phosphoinositides as modulators of ER–PM connectivity in eukaryotes, and uncovers unique aspects of the spatiotemporal regulation of ER–PM connectivity in plants. AU - Lee, Eunkyoung AU - Vanneste, Steffen AU - Pérez-Sancho, Jessica AU - Benitez-Fuente, Francisco AU - Strelau, Matthew AU - Macho, Alberto P. AU - Botella, Miguel A. AU - Friml, Jiří AU - Rosado, Abel ID - 5908 IS - 4 JF - Proceedings of the National Academy of Sciences of the United States of America TI - Ionic stress enhances ER–PM connectivity via phosphoinositide-associated SYT1 contact site expansion in Arabidopsis VL - 116 ER - TY - JOUR AB - Pollinators display a remarkable diversity of foraging strategies with flowering plants, from primarily mutualistic interactions to cheating through nectar robbery. Despite numerous studies on the effect of nectar robbing on components of plant fitness, its contribution to reproductive isolation is unclear. We experimentally tested the impact of different pollinator strategies in a natural hybrid zone between two subspecies of Antirrhinum majus with alternate flower colour guides. On either side of a steep cline in flower colour between Antirrhinum majus pseudomajus (magenta) and A. m. striatum (yellow), we quantified the behaviour of all floral visitors at different time points during the flowering season. Using long-run camera surveys, we quantify the impact of nectar robbing on the number of flowers visited per inflorescence and the flower probing time. We further experimentally tested the effect of nectar robbing on female reproductive success by manipulating the intensity of robbing. While robbing increased over time the number of legitimate visitors tended to decrease concomitantly. We found that the number of flowers pollinated on a focal inflorescence decreased with the number of prior robbing events. However, in the manipulative experiment, fruit set and fruit volume did not vary significantly between low robbing and control treatments. Our findings challenge the idea that robbers have a negative impact on plant fitness through female function. This study also adds to our understanding of the components of pollinator-mediated reproductive isolation and the maintenance of Antirrhinum hybrid zones. AU - Andalo, Christophe AU - Burrus, Monique AU - Paute, Sandrine AU - Lauzeral, Christine AU - Field, David ID - 5680 IS - 1 JF - Botany Letters SN - 23818107 TI - Prevalence of legitimate pollinators and nectar robbers and the consequences for fruit set in an Antirrhinum majus hybrid zone VL - 166 ER - TY - JOUR AB - The partial representation extension problem is a recently introduced generalization of the recognition problem. A circle graph is an intersection graph of chords of a circle. We study the partial representation extension problem for circle graphs, where the input consists of a graph G and a partial representation R′ giving some predrawn chords that represent an induced subgraph of G. The question is whether one can extend R′ to a representation R of the entire graph G, that is, whether one can draw the remaining chords into a partially predrawn representation to obtain a representation of G. Our main result is an O(n3) time algorithm for partial representation extension of circle graphs, where n is the number of vertices. To show this, we describe the structure of all representations of a circle graph using split decomposition. This can be of independent interest. AU - Chaplick, Steven AU - Fulek, Radoslav AU - Klavík, Pavel ID - 5790 IS - 4 JF - Journal of Graph Theory SN - 03649024 TI - Extending partial representations of circle graphs VL - 91 ER - TY - JOUR AB - We investigate the quantum Jensen divergences from the viewpoint of joint convexity. It turns out that the set of the functions which generate jointly convex quantum Jensen divergences on positive matrices coincides with the Matrix Entropy Class which has been introduced by Chen and Tropp quite recently. AU - Virosztek, Daniel ID - 405 JF - Linear Algebra and Its Applications TI - Jointly convex quantum Jensen divergences VL - 576 ER - TY - JOUR AB - An upper bound sieve for rational points on suitable varieties isdeveloped, together with applications tocounting rational points in thin sets,to local solubility in families, and to the notion of “friable” rational pointswith respect to divisors. In the special case of quadrics, sharper estimates areobtained by developing a version of the Selberg sieve for rational points. AU - Browning, Timothy D AU - Loughran, Daniel ID - 175 IS - 8 JF - Transactions of the American Mathematical Society SN - 00029947 TI - Sieving rational points on varieties VL - 371 ER - TY - JOUR AB - We study spaces of modelled distributions with singular behaviour near the boundary of a domain that, in the context of the theory of regularity structures, allow one to give robust solution theories for singular stochastic PDEs with boundary conditions. The calculus of modelled distributions established in Hairer (Invent Math 198(2):269–504, 2014. https://doi.org/10.1007/s00222-014-0505-4) is extended to this setting. We formulate and solve fixed point problems in these spaces with a class of kernels that is sufficiently large to cover in particular the Dirichlet and Neumann heat kernels. These results are then used to provide solution theories for the KPZ equation with Dirichlet and Neumann boundary conditions and for the 2D generalised parabolic Anderson model with Dirichlet boundary conditions. In the case of the KPZ equation with Neumann boundary conditions, we show that, depending on the class of mollifiers one considers, a “boundary renormalisation” takes place. In other words, there are situations in which a certain boundary condition is applied to an approximation to the KPZ equation, but the limiting process is the Hopf–Cole solution to the KPZ equation with a different boundary condition. AU - Gerencser, Mate AU - Hairer, Martin ID - 319 IS - 3-4 JF - Probability Theory and Related Fields SN - 01788051 TI - Singular SPDEs in domains with boundaries VL - 173 ER - TY - JOUR AB - We consider real symmetric or complex hermitian random matrices with correlated entries. We prove local laws for the resolvent and universality of the local eigenvalue statistics in the bulk of the spectrum. The correlations have fast decay but are otherwise of general form. The key novelty is the detailed stability analysis of the corresponding matrix valued Dyson equation whose solution is the deterministic limit of the resolvent. AU - Ajanki, Oskari H AU - Erdös, László AU - Krüger, Torben H ID - 429 IS - 1-2 JF - Probability Theory and Related Fields SN - 01788051 TI - Stability of the matrix Dyson equation and random matrices with correlations VL - 173 ER - TY - CONF AB - Graph algorithms applied in many applications, including social networks, communication networks, VLSI design, graphics, and several others, require dynamic modifications - addition and removal of vertices and/or edges - in the graph. This paper presents a novel concurrent non-blocking algorithm to implement a dynamic unbounded directed graph in a shared-memory machine. The addition and removal operations of vertices and edges are lock-free. For a finite sized graph, the lookup operations are wait-free. Most significant component of the presented algorithm is the reachability query in a concurrent graph. The reachability queries in our algorithm are obstruction-free and thus impose minimal additional synchronization cost over other operations. We prove that each of the data structure operations are linearizable. We extensively evaluate a sample C/C++ implementation of the algorithm through a number of micro-benchmarks. The experimental results show that the proposed algorithm scales well with the number of threads and on an average provides 5 to 7x performance improvement over a concurrent graph implementation using coarse-grained locking. AU - Chatterjee, Bapi AU - Peri, Sathya AU - Sa, Muktikanta AU - Singhal, Nandini ID - 5947 SN - 978-1-4503-6094-4 T2 - ACM International Conference Proceeding Series TI - A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries ER - TY - JOUR AB - A thrackle is a graph drawn in the plane so that every pair of its edges meet exactly once: either at a common end vertex or in a proper crossing. We prove that any thrackle of n vertices has at most 1.3984n edges. Quasi-thrackles are defined similarly, except that every pair of edges that do not share a vertex are allowed to cross an odd number of times. It is also shown that the maximum number of edges of a quasi-thrackle on n vertices is [Formula presented](n−1), and that this bound is best possible for infinitely many values of n. AU - Fulek, Radoslav AU - Pach, János ID - 5857 IS - 4 JF - Discrete Applied Mathematics SN - 0166218X TI - Thrackles: An improved upper bound VL - 259 ER - TY - JOUR AB - Understanding the thermodynamics of the duplication process is a fundamental step towards a comprehensive physical theory of biological systems. However, the immense complexity of real cells obscures the fundamental tensions between energy gradients and entropic contributions that underlie duplication. The study of synthetic, feasible systems reproducing part of the key ingredients of living entities but overcoming major sources of biological complexity is of great relevance to deepen the comprehension of the fundamental thermodynamic processes underlying life and its prevalence. In this paper an abstract—yet realistic—synthetic system made of small synthetic protocell aggregates is studied in detail. A fundamental relation between free energy and entropic gradients is derived for a general, non-equilibrium scenario, setting the thermodynamic conditions for the occurrence and prevalence of duplication phenomena. This relation sets explicitly how the energy gradients invested in creating and maintaining structural—and eventually, functional—elements of the system must always compensate the entropic gradients, whose contributions come from changes in the translational, configurational, and macrostate entropies, as well as from dissipation due to irreversible transitions. Work/energy relations are also derived, defining lower bounds on the energy required for the duplication event to take place. A specific example including real ternary emulsions is provided in order to grasp the orders of magnitude involved in the problem. It is found that the minimal work invested over the system to trigger a duplication event is around ~ 10−13J , which results, in the case of duplication of all the vesicles contained in a liter of emulsion, in an amount of energy around ~ 1kJ . Without aiming to describe a truly biological process of duplication, this theoretical contribution seeks to explicitly define and identify the key actors that participate in it. AU - Corominas-Murtra, Bernat ID - 5944 IS - 1 JF - Life TI - Thermodynamics of duplication thresholds in synthetic protocell systems VL - 9 ER - TY - JOUR AB - Protein micropatterning has become an important tool for many biomedical applications as well as in academic research. Current techniques that allow to reduce the feature size of patterns below 1 μm are, however, often costly and require sophisticated equipment. We present here a straightforward and convenient method to generate highly condensed nanopatterns of proteins without the need for clean room facilities or expensive equipment. Our approach is based on nanocontact printing and allows for the fabrication of protein patterns with feature sizes of 80 nm and periodicities down to 140 nm. This was made possible by the use of the material X-poly(dimethylsiloxane) (X-PDMS) in a two-layer stamp layout for protein printing. In a proof of principle, different proteins at various scales were printed and the pattern quality was evaluated by atomic force microscopy (AFM) and super-resolution fluorescence microscopy. AU - Lindner, Marco AU - Tresztenyak, Aliz AU - Fülöp, Gergö AU - Jahr, Wiebke AU - Prinz, Adrian AU - Prinz, Iris AU - Danzl, Johann G AU - Schütz, Gerhard J. AU - Sevcsik, Eva ID - 6029 JF - Frontiers in Chemistry TI - A fast and simple contact printing approach to generate 2D protein nanopatterns VL - 6 ER - TY - JOUR AB - We give a construction allowing us to build local renormalized solutions to general quasilinear stochastic PDEs within the theory of regularity structures, thus greatly generalizing the recent results of [1, 5, 11]. Loosely speaking, our construction covers quasilinear variants of all classes of equations for which the general construction of [3, 4, 7] applies, including in particular one‐dimensional systems with KPZ‐type nonlinearities driven by space‐time white noise. In a less singular and more specific case, we furthermore show that the counterterms introduced by the renormalization procedure are given by local functionals of the solution. The main feature of our construction is that it allows exploitation of a number of existing results developed for the semilinear case, so that the number of additional arguments it requires is relatively small. AU - Gerencser, Mate AU - Hairer, Martin ID - 6028 IS - 9 JF - Communications on Pure and Applied Mathematics TI - A solution theory for quasilinear singular SPDEs VL - 72 ER - TY - CONF AB - We study the termination problem for nondeterministic probabilistic programs. We consider the bounded termination problem that asks whether the supremum of the expected termination time over all schedulers is bounded. First, we show that ranking supermartingales (RSMs) are both sound and complete for proving bounded termination over nondeterministic probabilistic programs. For nondeterministic probabilistic programs a previous result claimed that RSMs are not complete for bounded termination, whereas our result corrects the previous flaw and establishes completeness with a rigorous proof. Second, we present the first sound approach to establish lower bounds on expected termination time through RSMs. AU - Fu, Hongfei AU - Chatterjee, Krishnendu ID - 5948 T2 - International Conference on Verification, Model Checking, and Abstract Interpretation TI - Termination of nondeterministic probabilistic programs VL - 11388 ER - TY - JOUR AB - In developing organisms, spatially prescribed cell identities are thought to be determined by the expression levels of multiple genes. Quantitative tests of this idea, however, require a theoretical framework capable of exposing the rules and precision of cell specification over developmental time. We use the gap gene network in the early fly embryo as an example to show how expression levels of the four gap genes can be jointly decoded into an optimal specification of position with 1% accuracy. The decoder correctly predicts, with no free parameters, the dynamics of pair-rule expression patterns at different developmental time points and in various mutant backgrounds. Precise cellular identities are thus available at the earliest stages of development, contrasting the prevailing view of positional information being slowly refined across successive layers of the patterning network. Our results suggest that developmental enhancers closely approximate a mathematically optimal decoding strategy. AU - Petkova, Mariela D. AU - Tkacik, Gasper AU - Bialek, William AU - Wieschaus, Eric F. AU - Gregor, Thomas ID - 5945 IS - 4 JF - Cell TI - Optimal decoding of cellular identities in a genetic network VL - 176 ER - TY - JOUR AB - The hairpin instability of a jet in a crossflow (JICF) for a low jet-to-crossflow velocity ratio is investigated experimentally for a velocity ratio range of R ∈ (0.14, 0.75) and crossflow Reynolds numbers ReD ∈ (260, 640). From spectral analysis we characterize the Strouhal number and amplitude of the hairpin instability as a function of R and ReD. We demonstrate that the dynamics of the hairpins is well described by the Landau model, and, hence, that the instability occurs through Hopf bifurcation, similarly to other hydrodynamical oscillators such as wake behind different bluff bodies. Using the Landau model, we determine the precise threshold values of hairpin shedding. We also study the spatial dependence of this hydrodynamical instability, which shows a global behaviour. AU - Klotz, Lukasz AU - Gumowski, Konrad AU - Wesfreid, José Eduardo ID - 5943 JF - Journal of Fluid Mechanics TI - Experiments on a jet in a crossflow in the low-velocity-ratio regime VL - 863 ER - TY - CONF AB - Static program analyzers are increasingly effective in checking correctness properties of programs and reporting any errors found, often in the form of error traces. However, developers still spend a significant amount of time on debugging. This involves processing long error traces in an effort to localize a bug to a relatively small part of the program and to identify its cause. In this paper, we present a technique for automated fault localization that, given a program and an error trace, efficiently narrows down the cause of the error to a few statements. These statements are then ranked in terms of their suspiciousness. Our technique relies only on the semantics of the given program and does not require any test cases or user guidance. In experiments on a set of C benchmarks, we show that our technique is effective in quickly isolating the cause of error while out-performing other state-of-the-art fault-localization techniques. AU - Christakis, Maria AU - Heizmann, Matthias AU - Mansur, Muhammad Numair AU - Schilling, Christian AU - Wüstholz, Valentin ID - 6042 T2 - 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems TI - Semantic fault localization and suspiciousness ranking VL - 11427 ER -