@article{536, abstract = {We consider the problem of consensus in the challenging classic model. In this model, the adversary is adaptive; it can choose which processors crash at any point during the course of the algorithm. Further, communication is via asynchronous message passing: there is no known upper bound on the time to send a message from one processor to another, and all messages and coin flips are seen by the adversary. We describe a new randomized consensus protocol with expected message complexity O(n2log2n) when fewer than n / 2 processes may fail by crashing. This is an almost-linear improvement over the best previously known protocol, and within logarithmic factors of a known Ω(n2) message lower bound. The protocol further ensures that no process sends more than O(nlog3n) messages in expectation, which is again within logarithmic factors of optimal. We also present a generalization of the algorithm to an arbitrary number of failures t, which uses expected O(nt+t2log2t) total messages. Our approach is to build a message-efficient, resilient mechanism for aggregating individual processor votes, implementing the message-passing equivalent of a weak shared coin. Roughly, in our protocol, a processor first announces its votes to small groups, then propagates them to increasingly larger groups as it generates more and more votes. To bound the number of messages that an individual process might have to send or receive, the protocol progressively increases the weight of generated votes. The main technical challenge is bounding the impact of votes that are still “in flight” (generated, but not fully propagated) on the final outcome of the shared coin, especially since such votes might have different weights. We achieve this by leveraging the structure of the algorithm, and a technical argument based on martingale concentration bounds. Overall, we show that it is possible to build an efficient message-passing implementation of a shared coin, and in the process (almost-optimally) solve the classic consensus problem in the asynchronous message-passing model.}, author = {Alistarh, Dan-Adrian and Aspnes, James and King, Valerie and Saia, Jared}, issn = {0178-2770}, journal = {Distributed Computing}, number = {6}, pages = {489--501}, publisher = {Springer}, title = {{Communication-efficient randomized consensus}}, doi = {10.1007/s00446-017-0315-1}, volume = {31}, year = {2018}, } @article{54, abstract = {During epithelial tissue development, repair, and homeostasis, adherens junctions (AJs) ensure intercellular adhesion and tissue integrity while allowing for cell and tissue dynamics. Mechanical forces play critical roles in AJs’ composition and dynamics. Recent findings highlight that beyond a well-established role in reinforcing cell-cell adhesion, AJ mechanosensitivity promotes junctional remodeling and polarization, thereby regulating critical processes such as cell intercalation, division, and collective migration. Here, we provide an integrated view of mechanosensing mechanisms that regulate cell-cell contact composition, geometry, and integrity under tension and highlight pivotal roles for mechanosensitive AJ remodeling in preserving epithelial integrity and sustaining tissue dynamics.}, author = {Nunes Pinheiro, Diana C and Bellaïche, Yohanns}, journal = {Developmental Cell}, number = {1}, pages = {3 -- 19}, publisher = {Cell Press}, title = {{Mechanical force-driven adherents junction remodeling and epithelial dynamics}}, doi = {10.1016/j.devcel.2018.09.014}, volume = {47}, year = {2018}, } @article{543, abstract = {A central goal in theoretical neuroscience is to predict the response properties of sensory neurons from first principles. To this end, “efficient coding” posits that sensory neurons encode maximal information about their inputs given internal constraints. There exist, however, many variants of efficient coding (e.g., redundancy reduction, different formulations of predictive coding, robust coding, sparse coding, etc.), differing in their regimes of applicability, in the relevance of signals to be encoded, and in the choice of constraints. It is unclear how these types of efficient coding relate or what is expected when different coding objectives are combined. Here we present a unified framework that encompasses previously proposed efficient coding models and extends to unique regimes. We show that optimizing neural responses to encode predictive information can lead them to either correlate or decorrelate their inputs, depending on the stimulus statistics; in contrast, at low noise, efficiently encoding the past always predicts decorrelation. Later, we investigate coding of naturalistic movies and show that qualitatively different types of visual motion tuning and levels of response sparsity are predicted, depending on whether the objective is to recover the past or predict the future. Our approach promises a way to explain the observed diversity of sensory neural responses, as due to multiple functional goals and constraints fulfilled by different cell types and/or circuits.}, author = {Chalk, Matthew J and Marre, Olivier and Tkacik, Gasper}, journal = {Proceedings of the National Academy of Sciences of the United States of America}, number = {1}, pages = {186 -- 191}, publisher = {National Academy of Sciences}, title = {{Toward a unified theory of efficient, predictive, and sparse coding}}, doi = {10.1073/pnas.1711114115}, volume = {115}, year = {2018}, } @misc{5457, abstract = {We consider the problem of expected cost analysis over nondeterministic probabilistic programs, which aims at automated methods for analyzing the resource-usage of such programs. Previous approaches for this problem could only handle nonnegative bounded costs. However, in many scenarios, such as queuing networks or analysis of cryptocurrency protocols, both positive and negative costs are necessary and the costs are unbounded as well. In this work, we present a sound and efficient approach to obtain polynomial bounds on the expected accumulated cost of nondeterministic probabilistic programs. Our approach can handle (a) general positive and negative costs with bounded updates in variables; and (b) nonnegative costs with general updates to variables. We show that several natural examples which could not be handled by previous approaches are captured in our framework. Moreover, our approach leads to an efficient polynomial-time algorithm, while no previous approach for cost analysis of probabilistic programs could guarantee polynomial runtime. Finally, we show the effectiveness of our approach by presenting experimental results on a variety of programs, motivated by real-world applications, for which we efficiently synthesize tight resource-usage bounds.}, author = {Anonymous, 1 and Anonymous, 2 and Anonymous, 3 and Anonymous, 4 and Anonymous, 5 and Anonymous, 6}, issn = {2664-1690}, pages = {27}, publisher = {IST Austria}, title = {{Cost analysis of nondeterministic probabilistic programs}}, year = {2018}, } @article{55, abstract = {Many animals use antimicrobials to prevent or cure disease [1,2]. For example, some animals will ingest plants with medicinal properties, both prophylactically to prevent infection and therapeutically to self-medicate when sick. Antimicrobial substances are also used as topical disinfectants, to prevent infection, protect offspring and to sanitise their surroundings [1,2]. Social insects (ants, bees, wasps and termites) build nests in environments with a high abundance and diversity of pathogenic microorganisms — such as soil and rotting wood — and colonies are often densely crowded, creating conditions that favour disease outbreaks. Consequently, social insects have evolved collective disease defences to protect their colonies from epidemics. These traits can be seen as functionally analogous to the immune system of individual organisms [3,4]. This ‘social immunity’ utilises antimicrobials to prevent and eradicate infections, and to keep the brood and nest clean. However, these antimicrobial compounds can be harmful to the insects themselves, and it is unknown how colonies prevent collateral damage when using them. Here, we demonstrate that antimicrobial acids, produced by workers to disinfect the colony, are harmful to the delicate pupal brood stage, but that the pupae are protected from the acids by the presence of a silk cocoon. Garden ants spray their nests with an antimicrobial poison to sanitize contaminated nestmates and brood. Here, Pull et al show that they also prophylactically sanitise their colonies, and that the silk cocoon serves as a barrier to protect developing pupae, thus preventing collateral damage during nest sanitation.}, author = {Pull, Christopher and Metzler, Sina and Naderlinger, Elisabeth and Cremer, Sylvia}, journal = {Current Biology}, number = {19}, pages = {R1139 -- R1140}, publisher = {Cell Press}, title = {{Protection against the lethal side effects of social immunity in ants}}, doi = {10.1016/j.cub.2018.08.063}, volume = {28}, year = {2018}, } @article{554, abstract = {We analyse the canonical Bogoliubov free energy functional in three dimensions at low temperatures in the dilute limit. We prove existence of a first-order phase transition and, in the limit (Formula presented.), we determine the critical temperature to be (Formula presented.) to leading order. Here, (Formula presented.) is the critical temperature of the free Bose gas, ρ is the density of the gas and a is the scattering length of the pair-interaction potential V. We also prove asymptotic expansions for the free energy. In particular, we recover the Lee–Huang–Yang formula in the limit (Formula presented.).}, author = {Napiórkowski, Marcin M and Reuvers, Robin and Solovej, Jan}, issn = {0010-3616}, journal = {Communications in Mathematical Physics}, number = {1}, pages = {347--403}, publisher = {Springer}, title = {{The Bogoliubov free energy functional II: The dilute Limit}}, doi = {10.1007/s00220-017-3064-x}, volume = {360}, year = {2018}, } @article{555, abstract = {Conventional wisdom has it that proteins fold and assemble into definite structures, and that this defines their function. Glycosaminoglycans (GAGs) are different. In most cases the structures they form have a low degree of order, even when interacting with proteins. Here, we discuss how physical features common to all GAGs — hydrophilicity, charge, linearity and semi-flexibility — underpin the overall properties of GAG-rich matrices. By integrating soft matter physics concepts (e.g. polymer brushes and phase separation) with our molecular understanding of GAG–protein interactions, we can better comprehend how GAG-rich matrices assemble, what their properties are, and how they function. Taking perineuronal nets (PNNs) — a GAG-rich matrix enveloping neurons — as a relevant example, we propose that microphase separation determines the holey PNN anatomy that is pivotal to PNN functions.}, author = {Richter, Ralf and Baranova, Natalia and Day, Anthony and Kwok, Jessica}, journal = {Current Opinion in Structural Biology}, pages = {65 -- 74}, publisher = {Elsevier}, title = {{Glycosaminoglycans in extracellular matrix organisation: Are concepts from soft matter physics key to understanding the formation of perineuronal nets?}}, doi = {10.1016/j.sbi.2017.12.002}, volume = {50}, year = {2018}, } @article{556, abstract = {We investigate the free boundary Schur process, a variant of the Schur process introduced by Okounkov and Reshetikhin, where we allow the first and the last partitions to be arbitrary (instead of empty in the original setting). The pfaffian Schur process, previously studied by several authors, is recovered when just one of the boundary partitions is left free. We compute the correlation functions of the process in all generality via the free fermion formalism, which we extend with the thorough treatment of “free boundary states.” For the case of one free boundary, our approach yields a new proof that the process is pfaffian. For the case of two free boundaries, we find that the process is not pfaffian, but a closely related process is. We also study three different applications of the Schur process with one free boundary: fluctuations of symmetrized last passage percolation models, limit shapes and processes for symmetric plane partitions and for plane overpartitions.}, author = {Betea, Dan and Bouttier, Jeremie and Nejjar, Peter and Vuletic, Mirjana}, issn = {1424-0637}, journal = {Annales Henri Poincare}, number = {12}, pages = {3663--3742}, publisher = {Springer Nature}, title = {{The free boundary Schur process and applications I}}, doi = {10.1007/s00023-018-0723-1}, volume = {19}, year = {2018}, } @misc{5569, abstract = {Nela Nikolic, Tobias Bergmiller, Alexandra Vandervelde, Tanino G. Albanese, Lendert Gelens, and Isabella Moll (2018) “Autoregulation of mazEF expression underlies growth heterogeneity in bacterial populations” Nucleic Acids Research, doi: 10.15479/AT:ISTA:74; microscopy experiments by Tobias Bergmiller; image and data analysis by Nela Nikolic.}, author = {Bergmiller, Tobias and Nikolic, Nela}, keywords = {microscopy, microfluidics}, publisher = {Institute of Science and Technology Austria}, title = {{Time-lapse microscopy data}}, doi = {10.15479/AT:ISTA:74}, year = {2018}, } @misc{5573, abstract = {Graph matching problems for large displacement optical flow of RGB-D images.}, author = {Alhaija, Hassan and Sellent, Anita and Kondermann, Daniel and Rother, Carsten}, keywords = {graph matching, quadratic assignment problem<}, publisher = {Institute of Science and Technology Austria}, title = {{Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow}}, doi = {10.15479/AT:ISTA:82}, year = {2018}, } @misc{5574, abstract = {Comparison of Scopus' and publisher's data on Austrian publication output at IOP. }, author = {Villányi, Márton}, keywords = {Publication analysis, Bibliography, Open Access}, publisher = {Institute of Science and Technology Austria}, title = {{Data Check IOP Scopus vs. Publisher}}, doi = {10.15479/AT:ISTA:86}, year = {2018}, } @misc{5575, abstract = {Comparison of Scopus' and FWF's data on Austrian publication output at RSC. }, author = {Villányi, Márton}, keywords = {Publication analysis, Bibliography, Open Access}, publisher = {Institute of Science and Technology Austria}, title = {{Data Check RSC Scopus vs. FWF}}, doi = {10.15479/AT:ISTA:87}, year = {2018}, } @misc{5576, abstract = {Comparison of Scopus' and FWF's data on Austrian publication output at T&F.}, author = {Villányi, Márton}, keywords = {Publication analysis, Bibliography, Open Access}, publisher = {Institute of Science and Technology Austria}, title = {{Data Check T&F Scopus vs. FWF}}, doi = {10.15479/AT:ISTA:88}, year = {2018}, } @misc{5577, abstract = {Data on Austrian open access publication output at Emerald from 2013-2017 including data analysis.}, author = {Villányi, Márton}, keywords = {Publication analysis, Bibliography, Open Access}, publisher = {Institute of Science and Technology Austria}, title = {{Emerald Austrian Publications 2013-2017}}, doi = {10.15479/AT:ISTA:89}, year = {2018}, } @misc{5578, abstract = {Data on Austrian open access publication output at IOP from 2012-2015 including data analysis.}, author = {Villányi, Márton}, keywords = {Publication analysis, Bibliography, Open Access}, publisher = {Institute of Science and Technology Austria}, title = {{IOP Austrian Publications 2012-2015}}, doi = {10.15479/AT:ISTA:90}, year = {2018}, } @misc{5579, abstract = {Data on Austrian open access publication output at RSC from 2013-2017 including data analysis.}, author = {Villányi, Márton}, keywords = {Publication analysis, Bibliography, Open Access}, publisher = {Institute of Science and Technology Austria}, title = {{RSC Austrian Publications 2013-2017}}, doi = {10.15479/AT:ISTA:91}, year = {2018}, } @misc{5580, abstract = {Data on Austrian open access publication output at SAGE from 2013-2017 including data analysis.}, author = {Villányi, Márton}, keywords = {Publication analysis, Bibliography, Open Access}, publisher = {Institute of Science and Technology Austria}, title = {{SAGE Austrian Publications 2013-2017}}, doi = {10.15479/AT:ISTA:92}, year = {2018}, } @misc{5581, abstract = {Data on Austrian open access publication output at Springer from 2013-2016 including data analysis.}, author = {Villányi, Márton}, keywords = {Publication analysis, Bibliography, Open Access}, publisher = {Institute of Science and Technology Austria}, title = {{Springer Austrian Publications 2013-2016}}, doi = {10.15479/AT:ISTA:93}, year = {2018}, } @misc{5582, abstract = {Data on Austrian open access publication output at Taylor&Francis from 2013-2017 including data analysis.}, author = {Villányi, Márton}, keywords = {Publication analysis, Bibliography, Open Access}, publisher = {Institute of Science and Technology Austria}, title = {{Taylor&Francis Austrian Publications 2013-2017}}, doi = {10.15479/AT:ISTA:94}, year = {2018}, } @misc{5583, abstract = {Data and scripts are provided in support of the manuscript "Efficient inference of paternity and sibship inference given known maternity via hierarchical clustering", and the associated Python package FAPS, available from www.github.com/ellisztamas/faps. Simulation scripts cover: 1. Performance under different mating scenarios. 2. Comparison with Colony2. 3. Effect of changing the number of Monte Carlo draws The final script covers the analysis of half-sib arrays from wild-pollinated seed in an Antirrhinum majus hybrid zone.}, author = {Ellis, Thomas}, publisher = {Institute of Science and Technology Austria}, title = {{Data and Python scripts supporting Python package FAPS}}, doi = {10.15479/AT:ISTA:95}, year = {2018}, }