@inproceedings{6887, abstract = {The fundamental model-checking problem, given as input a model and a specification, asks for the algorithmic verification of whether the model satisfies the specification. Two classical models for reactive systems are graphs and Markov decision processes (MDPs). A basic specification formalism in the verification of reactive systems is the strong fairness (aka Streett) objective, where given different types of requests and corresponding grants, the requirement is that for each type, if the request event happens infinitely often, then the corresponding grant event must also happen infinitely often. All omega-regular objectives can be expressed as Streett objectives and hence they are canonical in verification. Consider graphs/MDPs with n vertices, m edges, and a Streett objectives with k pairs, and let b denote the size of the description of the Streett objective for the sets of requests and grants. The current best-known algorithm for the problem requires time O(min(n^2, m sqrt{m log n}) + b log n). In this work we present randomized near-linear time algorithms, with expected running time O~(m + b), where the O~ notation hides poly-log factors. Our randomized algorithms are near-linear in the size of the input, and hence optimal up to poly-log factors. }, author = {Chatterjee, Krishnendu and Dvorák, Wolfgang and Henzinger, Monika H and Svozil, Alexander}, booktitle = {Leibniz International Proceedings in Informatics}, location = {Amsterdam, Netherlands}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Near-linear time algorithms for Streett objectives in graphs and MDPs}}, doi = {10.4230/LIPICS.CONCUR.2019.7}, volume = {140}, year = {2019}, } @inproceedings{6888, abstract = {In this paper, we design novel liquid time-constant recurrent neural networks for robotic control, inspired by the brain of the nematode, C. elegans. In the worm's nervous system, neurons communicate through nonlinear time-varying synaptic links established amongst them by their particular wiring structure. This property enables neurons to express liquid time-constants dynamics and therefore allows the network to originate complex behaviors with a small number of neurons. We identify neuron-pair communication motifs as design operators and use them to configure compact neuronal network structures to govern sequential robotic tasks. The networks are systematically designed to map the environmental observations to motor actions, by their hierarchical topology from sensory neurons, through recurrently-wired interneurons, to motor neurons. The networks are then parametrized in a supervised-learning scheme by a search-based algorithm. We demonstrate that obtained networks realize interpretable dynamics. We evaluate their performance in controlling mobile and arm robots, and compare their attributes to other artificial neural network-based control agents. Finally, we experimentally show their superior resilience to environmental noise, compared to the existing machine learning-based methods.}, author = {Lechner, Mathias and Hasani, Ramin and Zimmer, Manuel and Henzinger, Thomas A and Grosu, Radu}, booktitle = {Proceedings - IEEE International Conference on Robotics and Automation}, isbn = {9781538660270}, location = {Montreal, QC, Canada}, publisher = {IEEE}, title = {{Designing worm-inspired neural networks for interpretable robotic control}}, doi = {10.1109/icra.2019.8793840}, volume = {2019-May}, year = {2019}, } @inproceedings{6889, abstract = {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. }, author = {Chatterjee, Krishnendu and Piterman, Nir}, location = {Amsterdam, Netherlands}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Combinations of Qualitative Winning for Stochastic Parity Games}}, doi = {10.4230/LIPICS.CONCUR.2019.6}, volume = {140}, year = {2019}, } @phdthesis{6894, abstract = {Hybrid automata combine finite automata and dynamical systems, and model the interaction of digital with physical systems. Formal analysis that can guarantee the safety of all behaviors or rigorously witness failures, while unsolvable in general, has been tackled algorithmically using, e.g., abstraction, bounded model-checking, assisted theorem proving. Nevertheless, very few methods have addressed the time-unbounded reachability analysis of hybrid automata and, for current sound and automatic tools, scalability remains critical. We develop methods for the polyhedral abstraction of hybrid automata, which construct coarse overapproximations and tightens them incrementally, in a CEGAR fashion. We use template polyhedra, i.e., polyhedra whose facets are normal to a given set of directions. While, previously, directions were given by the user, we introduce (1) the first method for computing template directions from spurious counterexamples, so as to generalize and eliminate them. The method applies naturally to convex hybrid automata, i.e., hybrid automata with (possibly non-linear) convex constraints on derivatives only, while for linear ODE requires further abstraction. Specifically, we introduce (2) the conic abstractions, which, partitioning the state space into appropriate (possibly non-uniform) cones, divide curvy trajectories into relatively straight sections, suitable for polyhedral abstractions. Finally, we introduce (3) space-time interpolation, which, combining interval arithmetic and template refinement, computes appropriate (possibly non-uniform) time partitioning and template directions along spurious trajectories, so as to eliminate them. We obtain sound and automatic methods for the reachability analysis over dense and unbounded time of convex hybrid automata and hybrid automata with linear ODE. We build prototype tools and compare—favorably—our methods against the respective state-of-the-art tools, on several benchmarks.}, author = {Giacobbe, Mirco}, issn = {2663-337X}, pages = {132}, publisher = {Institute of Science and Technology Austria}, title = {{Automatic time-unbounded reachability analysis of hybrid systems}}, doi = {10.15479/AT:ISTA:6894}, year = {2019}, } @article{6896, abstract = {Until recently, a great amount of brain studies have been conducted in human post mortem tissues, cell lines and model organisms. These researches provided useful insights regarding cell-cell interactions occurring in the brain. However, such approaches suffer from technical limitations and inaccurate modeling of the tissue 3D cytoarchitecture. Importantly, they might lack a human genetic background essential for disease modeling. With the development of protocols to generate human cerebral organoids, we are now closer to reproducing the early stages of human brain development in vitro. As a result, more relevant cell-cell interaction studies can be conducted. In this review, we discuss the advantages of 3D cultures over 2D in modulating brain cell-cell interactions during physiological and pathological development, as well as the progress made in developing organoids in which neurons, macroglia, microglia and vascularization are present. Finally, we debate the limitations of those models and possible future directions.}, author = {Oliveira, Bárbara and Yahya, Aysan Çerağ and Novarino, Gaia}, issn = {1872-6240}, journal = {Brain Research}, publisher = {Elsevier}, title = {{Modeling cell-cell interactions in the brain using cerebral organoids}}, doi = {10.1016/j.brainres.2019.146458}, volume = {1724}, year = {2019}, } @article{6898, abstract = {Background Chlamydia are ancient intracellular pathogens with reduced, though strikingly conserved genome. Despite their parasitic lifestyle and isolated intracellular environment, these bacteria managed to avoid accumulation of deleterious mutations leading to subsequent genome degradation characteristic for many parasitic bacteria. Results We report pan-genomic analysis of sixteen species from genus Chlamydia including identification and functional annotation of orthologous genes, and characterization of gene gains, losses, and rearrangements. We demonstrate the overall genome stability of these bacteria as indicated by a large fraction of common genes with conserved genomic locations. On the other hand, extreme evolvability is confined to several paralogous gene families such as polymorphic membrane proteins and phospholipase D, and likely is caused by the pressure from the host immune system. Conclusions This combination of a large, conserved core genome and a small, evolvable periphery likely reflect the balance between the selective pressure towards genome reduction and the need to adapt to escape from the host immunity.}, author = {Sigalova, Olga M. and Chaplin, Andrei V. and Bochkareva, Olga and Shelyakin, Pavel V. and Filaretov, Vsevolod A. and Akkuratov, Evgeny E. and Burskaia, Valentina and Gelfand, Mikhail S.}, issn = {1471-2164}, journal = {BMC Genomics}, number = {1}, publisher = {BioMed Central}, title = {{Chlamydia pan-genomic analysis reveals balance between host adaptation and selective pressure to genome reduction}}, doi = {10.1186/s12864-019-6059-5}, volume = {20}, year = {2019}, } @article{6899, abstract = {Intra-organ communication guides morphogenetic processes that are essential for an organ to carry out complex physiological functions. In the heart, the growth of the myocardium is tightly coupled to that of the endocardium, a specialized endothelial tissue that lines its interior. Several molecular pathways have been implicated in the communication between these tissues including secreted factors, components of the extracellular matrix, or proteins involved in cell-cell communication. Yet, it is unknown how the growth of the endocardium is coordinated with that of the myocardium. Here, we show that an increased expansion of the myocardial atrial chamber volume generates higher junctional forces within endocardial cells. This leads to biomechanical signaling involving VE-cadherin, triggering nuclear localization of the Hippo pathway transcriptional regulator Yap1 and endocardial proliferation. Our work suggests that the growth of the endocardium results from myocardial chamber volume expansion and ends when the tension on the tissue is relaxed.}, author = {Bornhorst, Dorothee and Xia, Peng and Nakajima, Hiroyuki and Dingare, Chaitanya and Herzog, Wiebke and Lecaudey, Virginie and Mochizuki, Naoki and Heisenberg, Carl-Philipp J and Yelon, Deborah and Abdelilah-Seyfried, Salim}, issn = {2041-1723}, journal = {Nature communications}, number = {1}, pages = {4113}, publisher = {Nature Publishing Group}, title = {{Biomechanical signaling within the developing zebrafish heart attunes endocardial growth to myocardial chamber dimensions}}, doi = {10.1038/s41467-019-12068-x}, volume = {10}, year = {2019}, } @article{6900, abstract = {Across diverse biological systems—ranging from neural networks to intracellular signaling and genetic regulatory networks—the information about changes in the environment is frequently encoded in the full temporal dynamics of the network nodes. A pressing data-analysis challenge has thus been to efficiently estimate the amount of information that these dynamics convey from experimental data. Here we develop and evaluate decoding-based estimation methods to lower bound the mutual information about a finite set of inputs, encoded in single-cell high-dimensional time series data. For biological reaction networks governed by the chemical Master equation, we derive model-based information approximations and analytical upper bounds, against which we benchmark our proposed model-free decoding estimators. In contrast to the frequently-used k-nearest-neighbor estimator, decoding-based estimators robustly extract a large fraction of the available information from high-dimensional trajectories with a realistic number of data samples. We apply these estimators to previously published data on Erk and Ca2+ signaling in mammalian cells and to yeast stress-response, and find that substantial amount of information about environmental state can be encoded by non-trivial response statistics even in stationary signals. We argue that these single-cell, decoding-based information estimates, rather than the commonly-used tests for significant differences between selected population response statistics, provide a proper and unbiased measure for the performance of biological signaling networks.}, author = {Cepeda Humerez, Sarah A and Ruess, Jakob and Tkačik, Gašper}, issn = {1553-7358}, journal = {PLoS computational biology}, number = {9}, pages = {e1007290}, publisher = {Public Library of Science}, title = {{Estimating information in time-varying signals}}, doi = {10.1371/journal.pcbi.1007290}, volume = {15}, year = {2019}, } @article{6919, author = {Qi, Chao and Minin, Giulio Di and Vercellino, Irene and Wutz, Anton and Korkhov, Volodymyr M.}, issn = {2375-2548}, journal = {Science Advances}, number = {9}, publisher = {American Association for the Advancement of Science}, title = {{Structural basis of sterol recognition by human hedgehog receptor PTCH1}}, doi = {10.1126/sciadv.aaw6490}, volume = {5}, year = {2019}, } @article{6920, author = {Artner, Christina and Benková, Eva}, issn = {1674-2052}, journal = {Molecular Plant}, number = {10}, pages = {1312--1314}, publisher = {Cell Press}, title = {{Ethylene and cytokinin - partners in root growth regulation}}, doi = {10.1016/j.molp.2019.09.003}, volume = {12}, year = {2019}, } @inproceedings{6931, abstract = {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.}, author = {Nowak, Thomas and Rybicki, Joel}, booktitle = {33rd International Symposium on Distributed Computing}, keywords = {consensus, approximate agreement, Byzantine faults, chordal graphs, lattice agreement}, location = {Budapest, Hungary}, pages = {29:1----29:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Byzantine approximate agreement on graphs}}, doi = {10.4230/LIPICS.DISC.2019.29}, volume = {146}, year = {2019}, } @inproceedings{6933, abstract = {We design fast deterministic algorithms for distance computation in the CONGESTED CLIQUE model. Our key contributions include: - A (2+ε)-approximation for all-pairs shortest paths problem in O(log²n / ε) rounds on unweighted undirected graphs. With a small additional additive factor, this also applies for weighted graphs. This is the first sub-polynomial constant-factor approximation for APSP in this model. - A (1+ε)-approximation for multi-source shortest paths problem from O(√n) sources in O(log² n / ε) rounds on weighted undirected graphs. This is the first sub-polynomial algorithm obtaining this approximation for a set of sources of polynomial size. Our main techniques are new distance tools that are obtained via improved algorithms for sparse matrix multiplication, which we leverage to construct efficient hopsets and shortest paths. Furthermore, our techniques extend to additional distance problems for which we improve upon the state-of-the-art, including diameter approximation, and an exact single-source shortest paths algorithm for weighted undirected graphs in Õ(n^{1/6}) rounds.}, author = {Censor-Hillel, Keren and Dory, Michal and Korhonen, Janne and Leitersdorf, Dean}, booktitle = {Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin}, isbn = {9781450362177}, location = {Toronto, ON, Canada}, pages = {74--83}, publisher = {ACM}, title = {{Fast approximate shortest paths in the congested clique}}, doi = {10.1145/3293611.3331633}, year = {2019}, } @inproceedings{6935, abstract = {This paper investigates the power of preprocessing in the CONGEST model. Schmid and Suomela (ACM HotSDN 2013) introduced the SUPPORTED CONGEST model to study the application of distributed algorithms in Software-Defined Networks (SDNs). In this paper, we show that a large class of lower bounds in the CONGEST model still hold in the SUPPORTED model, highlighting the robustness of these bounds. This also raises the question how much does preprocessing help in the CONGEST model.}, author = {Foerster, Klaus-Tycho and Korhonen, Janne and Rybicki, Joel and Schmid, Stefan}, booktitle = {Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing}, isbn = {9781450362177}, location = {Toronto, ON, Canada}, pages = {259--261}, publisher = {ACM}, title = {{Does preprocessing help under congestion?}}, doi = {10.1145/3293611.3331581}, year = {2019}, } @article{6936, abstract = {A key challenge for community ecology is to understand to what extent observational data can be used to infer the underlying community assembly processes. As different processes can lead to similar or even identical patterns, statistical analyses of non‐manipulative observational data never yield undisputable causal inference on the underlying processes. Still, most empirical studies in community ecology are based on observational data, and hence understanding under which circumstances such data can shed light on assembly processes is a central concern for community ecologists. We simulated a spatial agent‐based model that generates variation in metacommunity dynamics across multiple axes, including the four classic metacommunity paradigms as special cases. We further simulated a virtual ecologist who analysed snapshot data sampled from the simulations using eighteen output metrics derived from beta‐diversity and habitat variation indices, variation partitioning and joint species distribution modelling. Our results indicated two main axes of variation in the output metrics. The first axis of variation described whether the landscape has patchy or continuous variation, and thus was essentially independent of the properties of the species community. The second axis of variation related to the level of predictability of the metacommunity. The most predictable communities were niche‐based metacommunities inhabiting static landscapes with marked environmental heterogeneity, such as metacommunities following the species sorting paradigm or the mass effects paradigm. The most unpredictable communities were neutral‐based metacommunities inhabiting dynamics landscapes with little spatial heterogeneity, such as metacommunities following the neutral or patch sorting paradigms. The output metrics from joint species distribution modelling yielded generally the highest resolution to disentangle among the simulated scenarios. Yet, the different types of statistical approaches utilized in this study carried complementary information, and thus our results suggest that the most comprehensive evaluation of metacommunity structure can be obtained by combining them. }, author = {Ovaskainen, Otso and Rybicki, Joel and Abrego, Nerea}, issn = {1600-0587}, journal = {Ecography}, number = {11}, pages = {1877--1886}, publisher = {Wiley}, title = {{What can observational data reveal about metacommunity processes?}}, doi = {10.1111/ecog.04444}, volume = {42}, year = {2019}, } @article{6940, abstract = {We study the effect of a linear tunneling coupling between two-dimensional systems, each separately exhibiting the topological Berezinskii-Kosterlitz-Thouless (BKT) transition. In the uncoupled limit, there are two phases: one where the one-body correlation functions are algebraically decaying and the other with exponential decay. When the linear coupling is turned on, a third BKT-paired phase emerges, in which one-body correlations are exponentially decaying, while two-body correlation functions exhibit power-law decay. We perform numerical simulations in the paradigmatic case of two coupled XY models at finite temperature, finding evidences that for any finite value of the interlayer coupling, the BKT-paired phase is present. We provide a picture of the phase diagram using a renormalization group approach.}, author = {Bighin, Giacomo and Defenu, Nicolò and Nándori, István and Salasnich, Luca and Trombettoni, Andrea}, issn = {1079-7114}, journal = {Physical Review Letters}, number = {10}, publisher = {American Physical Society}, title = {{Berezinskii-Kosterlitz-Thouless paired phase in coupled XY models}}, doi = {10.1103/physrevlett.123.100601}, volume = {123}, year = {2019}, } @inproceedings{6942, abstract = {Graph games and Markov decision processes (MDPs) are standard models in reactive synthesis and verification of probabilistic systems with nondeterminism. The class of 𝜔 -regular winning conditions; e.g., safety, reachability, liveness, parity conditions; provides a robust and expressive specification formalism for properties that arise in analysis of reactive systems. The resolutions of nondeterminism in games and MDPs are represented as strategies, and we consider succinct representation of such strategies. The decision-tree data structure from machine learning retains the flavor of decisions of strategies and allows entropy-based minimization to obtain succinct trees. However, in contrast to traditional machine-learning problems where small errors are allowed, for winning strategies in graph games and MDPs no error is allowed, and the decision tree must represent the entire strategy. In this work we propose decision trees with linear classifiers for representation of strategies in graph games and MDPs. We have implemented strategy representation using this data structure and we present experimental results for problems on graph games and MDPs, which show that this new data structure presents a much more efficient strategy representation as compared to standard decision trees.}, author = {Ashok, Pranav and Brázdil, Tomáš and Chatterjee, Krishnendu and Křetínský, Jan and Lampert, Christoph and Toman, Viktor}, booktitle = {16th International Conference on Quantitative Evaluation of Systems}, isbn = {9783030302801}, issn = {0302-9743}, location = {Glasgow, United Kingdom}, pages = {109--128}, publisher = {Springer Nature}, title = {{Strategy representation by decision trees with linear classifiers}}, doi = {10.1007/978-3-030-30281-8_7}, volume = {11785}, year = {2019}, } @article{6955, abstract = {We study few-body bound states of charged particles subject to attractive zero-range/short-range plus repulsive Coulomb interparticle forces. The characteristic length scales of the system at zero energy are set by the Coulomb length scale D and the Coulomb-modified effective range r eff. We study shallow bound states of charged particles with D >> r eff and show that these systems obey universal scaling laws different from neutral particles. An accurate description of these states requires both the Coulomb-modified scattering length and the effective range unless the Coulomb interaction is very weak (D -> ). Our findings are relevant for bound states whose spatial extent is significantly larger than the range of the attractive potential. These states enjoy universality – their character is independent of the shape of the short-range potential.}, author = {Schmickler, C.H. and Hammer, H.-W. and Volosniev, Artem}, issn = {0370-2693}, journal = {Physics Letters B}, publisher = {Elsevier}, title = {{Universal physics of bound states of a few charged particles}}, doi = {10.1016/j.physletb.2019.135016}, volume = {798}, year = {2019}, } @phdthesis{6957, abstract = {In many shear flows like pipe flow, plane Couette flow, plane Poiseuille flow, etc. turbulence emerges subcritically. Here, when subjected to strong enough perturbations, the flow becomes turbulent in spite of the laminar base flow being linearly stable. The nature of this instability has puzzled the scientific community for decades. At onset, turbulence appears in localized patches and flows are spatio-temporally intermittent. In pipe flow the localized turbulent structures are referred to as puffs and in planar flows like plane Couette and channel flow, patches arise in the form of localized oblique bands. In this thesis, we study the onset of turbulence in channel flow in direct numerical simulations from a dynamical system theory perspective, as well as by performing experiments in a large aspect ratio channel. The aim of the experimental work is to determine the critical Reynolds number where turbulence first becomes sustained. Recently, the onset of turbulence has been described in analogy to absorbing state phase transition (i.e. directed percolation). In particular, it has been shown that the critical point can be estimated from the competition between spreading and decay processes. Here, by performing experiments, we identify the mechanisms underlying turbulence proliferation in channel flow and find the critical Reynolds number, above which turbulence becomes sustained. Above the critical point, the continuous growth at the tip of the stripes outweighs the stochastic shedding of turbulent patches at the tail and the stripes expand. For growing stripes, the probability to decay decreases while the probability of stripe splitting increases. Consequently, and unlike for the puffs in pipe flow, neither of these two processes is time-independent i.e. memoryless. Coupling between stripe expansion and creation of new stripes via splitting leads to a significantly lower critical point ($Re_c=670+/-10$) than most earlier studies suggest. While the above approach sheds light on how turbulence first becomes sustained, it provides no insight into the origin of the stripes themselves. In the numerical part of the thesis we investigate how turbulent stripes form from invariant solutions of the Navier-Stokes equations. The origin of these turbulent stripes can be identified by applying concepts from the dynamical system theory. In doing so, we identify the exact coherent structures underlying stripes and their bifurcations and how they give rise to the turbulent attractor in phase space. We first report a family of localized nonlinear traveling wave solutions of the Navier-Stokes equations in channel flow. These solutions show structural similarities with turbulent stripes in experiments like obliqueness, quasi-streamwise streaks and vortices, etc. A parametric study of these traveling wave solution is performed, with parameters like Reynolds number, stripe tilt angle and domain size, including the stability of the solutions. These solutions emerge through saddle-node bifurcations and form a phase space skeleton for the turbulent stripes observed in the experiments. The lower branches of these TW solutions at different tilt angles undergo Hopf bifurcation and new solutions branches of relative periodic orbits emerge. These RPO solutions do not belong to the same family and therefore the routes to chaos for different angles are different. In shear flows, turbulence at onset is transient in nature. Consequently,turbulence can not be tracked to lower Reynolds numbers, where the dynamics may simplify. Before this happens, turbulence becomes short-lived and laminarizes. In the last part of the thesis, we show that using numerical simulations we can continue turbulent stripes in channel flow past the 'relaminarization barrier' all the way to their origin. Here, turbulent stripe dynamics simplifies and the fluctuations are no longer stochastic and the stripe settles down to a relative periodic orbit. This relative periodic orbit originates from the aforementioned traveling wave solutions. Starting from the relative periodic orbit, a small increase in speed i.e. Reynolds number gives rise to chaos and the attractor dimension sharply increases in contrast to the classical transition scenario where the instabilities affect the flow globally and give rise to much more gradual route to turbulence.}, author = {Paranjape, Chaitanya S}, issn = {2663-337X}, keywords = {Instabilities, Turbulence, Nonlinear dynamics}, pages = {138}, publisher = {Institute of Science and Technology Austria}, title = {{Onset of turbulence in plane Poiseuille flow}}, doi = {10.15479/AT:ISTA:6957}, year = {2019}, } @article{6972, abstract = {We give fault-tolerant algorithms for establishing synchrony in distributed systems in which each of thennodes has its own clock. Our algorithms operate in a very strong fault model: we require self-stabilisation, i.e.,the initial state of the system may be arbitrary, and there can be up to f