TY - JOUR
AB - The exocyst, a eukaryotic tethering complex, coregulates targeted exocytosis as an effector of small GTPases in polarized cell growth. In land plants, several exocyst subunits are encoded by double or triple paralogs, culminating in tens of EXO70 paralogs. Out of 23 Arabidopsis thaliana EXO70 isoforms, we analyzed seven isoforms expressed in pollen. Genetic and microscopic analyses of single mutants in EXO70A2, EXO70C1, EXO70C2, EXO70F1, EXO70H3, EXO70H5, and EXO70H6 genes revealed that only a loss-of-function EXO70C2 allele resulted in a significant male-specific transmission defect (segregation 40%:51%:9%) due to aberrant pollen tube growth. Mutant pollen tubes grown in vitro exhibited an enhanced growth rate and a decreased thickness of the tip cell wall, causing tip bursts. However, exo70C2 pollen tubes could frequently recover and restart their speedy elongation, resulting in a repetitive stop-and-go growth dynamics. A pollenspecific depletion of the closest paralog, EXO70C1, using artificial microRNA in the exo70C2 mutant background, resulted in a complete pollen-specific transmission defect, suggesting redundant functions of EXO70C1 and EXO70C2. Both EXO70C1 and EXO70C2, GFP tagged and expressed under the control of their native promoters, localized in the cytoplasm of pollen grains, pollen tubes, and also root trichoblast cells. The expression of EXO70C2-GFP complemented the aberrant growth of exo70C2 pollen tubes. The absent EXO70C2 interactions with core exocyst subunits in the yeast two-hybrid assay, cytoplasmic localization, and genetic effect suggest an unconventional EXO70 function possibly as a regulator of exocytosis outside the exocyst complex. In conclusion, EXO70C2 is a novel factor contributing to the regulation of optimal tip growth of Arabidopsis pollen tubes.
AU - Synek, Lukáš
AU - Vukašinović, Nemanja
AU - Kulich, Ivan
AU - Hála, Michal
AU - Aldorfová, Klára
AU - Fendrych, Matyas
AU - Žárský, Viktor
ID - 669
IS - 1
JF - Plant Physiology
SN - 00320889
TI - EXO70C2 is a key regulatory factor for optimal tip growth of pollen
VL - 174
ER -
TY - JOUR
AB - We propose an efficient method to model paper tearing in the context of interactive modeling. The method uses geometrical information to automatically detect potential starting points of tears. We further introduce a new hybrid geometrical and physical-based method to compute the trajectory of tears while procedurally synthesizing high resolution details of the tearing path using a texture based approach. The results obtained are compared with real paper and with previous studies on the expected geometric paths of paper that tears.
AU - Schreck, Camille
AU - Rohmer, Damien
AU - Hahmann, Stefanie
ID - 670
IS - 2
JF - Computer Graphics Forum
SN - 01677055
TI - Interactive paper tearing
VL - 36
ER -
TY - JOUR
AB - Humans routinely use conditionally cooperative strategies when interacting in repeated social dilemmas. They are more likely to cooperate if others cooperated before, and are ready to retaliate if others defected. To capture the emergence of reciprocity, most previous models consider subjects who can only choose from a restricted set of representative strategies, or who react to the outcome of the very last round only. As players memorize more rounds, the dimension of the strategy space increases exponentially. This increasing computational complexity renders simulations for individuals with higher cognitive abilities infeasible, especially if multiplayer interactions are taken into account. Here, we take an axiomatic approach instead. We propose several properties that a robust cooperative strategy for a repeated multiplayer dilemma should have. These properties naturally lead to a unique class of cooperative strategies, which contains the classical Win-Stay Lose-Shift rule as a special case. A comprehensive numerical analysis for the prisoner's dilemma and for the public goods game suggests that strategies of this class readily evolve across various memory-n spaces. Our results reveal that successful strategies depend not only on how cooperative others were in the past but also on the respective context of cooperation.
AU - Hilbe, Christian
AU - Martinez, Vaquero
AU - Chatterjee, Krishnendu
AU - Nowak, Martin
ID - 671
IS - 18
JF - PNAS
SN - 00278424
TI - Memory-n strategies of direct reciprocity
VL - 114
ER -
TY - JOUR
AB - Trafficking cells frequently transmigrate through epithelial and endothelial monolayers. How monolayers cooperate with the penetrating cells to support their transit is poorly understood. We studied dendritic cell (DC) entry into lymphatic capillaries as a model system for transendothelial migration. We find that the chemokine CCL21, which is the decisive guidance cue for intravasation, mainly localizes in the trans-Golgi network and intracellular vesicles of lymphatic endothelial cells. Upon DC transmigration, these Golgi deposits disperse and CCL21 becomes extracellularly enriched at the sites of endothelial cell-cell junctions. When we reconstitute the transmigration process in vitro, we find that secretion of CCL21-positive vesicles is triggered by a DC contact-induced calcium signal, and selective calcium chelation in lymphatic endothelium attenuates transmigration. Altogether, our data demonstrate a chemokine-mediated feedback between DCs and lymphatic endothelium, which facilitates transendothelial migration.
AU - Vaahtomeri, Kari
AU - Brown, Markus
AU - Hauschild, Robert
AU - De Vries, Ingrid
AU - Leithner, Alexander F
AU - Mehling, Matthias
AU - Kaufmann, Walter
AU - Sixt, Michael K
ID - 672
IS - 5
JF - Cell Reports
SN - 22111247
TI - Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia
VL - 19
ER -
TY - CONF
AB - Consider the problem of constructing a polar code of block length N for the transmission over a given channel W. Typically this requires to compute the reliability of all the N synthetic channels and then to include those that are sufficiently reliable. However, we know from [1], [2] that there is a partial order among the synthetic channels. Hence, it is natural to ask whether we can exploit it to reduce the computational burden of the construction problem. We show that, if we take advantage of the partial order [1], [2], we can construct a polar code by computing the reliability of roughly N/ log 3/2 N synthetic channels. Such a set of synthetic channels is universal, in the sense that it allows one to construct polar codes for any W, and it can be identified by solving a maximum matching problem on a bipartite graph. Our proof technique consists in reducing the construction problem to the problem of computing the maximum cardinality of an antichain for a suitable partially ordered set. As such, this method is general and it can be used to further improve the complexity of the construction problem in case a new partial order on the synthetic channels of polar codes is discovered.
AU - Mondelli, Marco
AU - Hassani, S. Hamed
AU - Urbanke, Rudiger
ID - 6729
SN - 9781509040964
T2 - 2017 IEEE International Symposium on Information Theory
TI - Construction of polar codes with sublinear complexity
ER -
TY - JOUR
AB - We present a numerical study of wavy supercritical cylindrical Couette flow between counter-rotating cylinders in which the wavy pattern propagates either prograde with the inner cylinder or retrograde opposite the rotation of the inner cylinder. The wave propagation reversals from prograde to retrograde and vice versa occur at distinct values of the inner cylinder Reynolds number when the associated frequency of the wavy instability vanishes. The reversal occurs for both twofold and threefold symmetric wavy vortices. Moreover, the wave propagation reversal only occurs for sufficiently strong counter-rotation. The flow pattern reversal appears to be intrinsic in the system as either periodic boundary conditions or fixed end wall boundary conditions for different system sizes always result in the wave propagation reversal. We present a detailed bifurcation sequence and parameter space diagram with respect to retrograde behavior of wavy flows. The retrograde propagation of the instability occurs when the inner Reynolds number is about two times the outer Reynolds number. The mechanism for the retrograde propagation is associated with the inviscidly unstable region near the inner cylinder and the direction of the global average azimuthal velocity. Flow dynamics, spatio-temporal behavior, global mean angular velocity, and torque of the flow with the wavy pattern are explored.
AU - Altmeyer, Sebastian
AU - Lueptow, Richard
ID - 673
IS - 5
JF - Physical Review E - Statistical, Nonlinear, and Soft Matter Physics
SN - 24700045
TI - Wave propagation reversal for wavy vortices in wide gap counter rotating cylindrical Couette flow
VL - 95
ER -
TY - JOUR
AB - We introduce a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relying on the precise structure of the codes, our method exploits code symmetry. In particular, the technique applies to any sequence of linear codes where the blocklengths are strictly increasing, the code rates converge, and the permutation group of each code is doubly transitive. In other words, we show that symmetry alone implies near-optimal performance. An important consequence of this result is that a sequence of Reed-Muller codes with increasing block length and converging rate achieves capacity. This possibility has been suggested previously in the literature but it has only been proven for cases where the limiting code rate is 0 or 1. Moreover, these results extend naturally to all affine-invariant codes and, thus, to extended primitive narrow-sense BCH codes. This also resolves, in the affirmative, the existence question for capacity-achieving sequences of binary cyclic codes. The primary tools used in the proof are the sharp threshold property for symmetric monotone Boolean functions and the area theorem for extrinsic information transfer functions.
AU - Kudekar, Shrinivas
AU - Kumar, Santhosh
AU - Mondelli, Marco
AU - Pfister, Henry D.
AU - Sasoglu, Eren
AU - Urbanke, Ridiger L.
ID - 6730
IS - 7
JF - IEEE Transactions on Information Theory
SN - 0018-9448
TI - Reed–Muller codes achieve capacity on erasure channels
VL - 63
ER -
TY - CONF
AB - We present a rate-compatible polar coding scheme that achieves the capacity of any family of channels. Our solution generalizes the previous results [1], [2] that provide capacity-achieving rate-compatible polar codes for a degraded family of channels. The motivation for our extension comes from the fact that in many practical scenarios, e.g., MIMO systems and non-Gaussian interference, the channels cannot be ordered by degradation. The main technical contribution of this paper consists in removing the degradation condition. To do so, we exploit the ideas coming from the construction of universal polar codes. Our scheme possesses the usual attractive features of polar codes: low complexity code construction, encoding, and decoding; super-polynomial scaling of the error probability with the block length; and absence of error floors. On the negative side, the scaling of the gap to capacity with the block length is slower than in standard polar codes, and we prove an upper bound on the scaling exponent.
AU - Mondelli, Marco
AU - Hassani, Hamed
AU - Maric, Ivana
AU - Hui, Dennis
AU - Hong, Song-Nam
ID - 6731
SN - 9781509059089
T2 - 2017 IEEE Wireless Communications and Networking Conference Workshops
TI - Capacity-achieving rate-compatible polar codes for general channels
ER -
TY - JOUR
AB - Navigation of cells along gradients of guidance cues is a determining step in many developmental and immunological processes. Gradients can either be soluble or immobilized to tissues as demonstrated for the haptotactic migration of dendritic cells (DCs) toward higher concentrations of immobilized chemokine CCL21. To elucidate how gradient characteristics govern cellular response patterns, we here introduce an in vitro system allowing to track migratory responses of DCs to precisely controlled immobilized gradients of CCL21. We find that haptotactic sensing depends on the absolute CCL21 concentration and local steepness of the gradient, consistent with a scenario where DC directionality is governed by the signal-to-noise ratio of CCL21 binding to the receptor CCR7. We find that the conditions for optimal DC guidance are perfectly provided by the CCL21 gradients we measure in vivo. Furthermore, we find that CCR7 signal termination by the G-protein-coupled receptor kinase 6 (GRK6) is crucial for haptotactic but dispensable for chemotactic CCL21 gradient sensing in vitro and confirm those observations in vivo. These findings suggest that stable, tissue-bound CCL21 gradients as sustainable “roads” ensure optimal guidance in vivo.
AU - Schwarz, Jan
AU - Bierbaum, Veronika
AU - Vaahtomeri, Kari
AU - Hauschild, Robert
AU - Brown, Markus
AU - De Vries, Ingrid
AU - Leithner, Alexander F
AU - Reversat, Anne
AU - Merrin, Jack
AU - Tarrant, Teresa
AU - Bollenbach, Tobias
AU - Sixt, Michael K
ID - 674
IS - 9
JF - Current Biology
SN - 09609822
TI - Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6
VL - 27
ER -
TY - JOUR
AB - We report the enhancement of infrared absorption of chemisorbed carbon monoxide on platinum in the gap of plasmonic nanoantennas. Our method is based on the self-assembled formation of platinum nanoislands on nanoscopic dipole antenna arrays manufactured via electron beam lithography. We employ systematic variations of the plasmonic antenna resonance to precisely couple to the molecular stretch vibration of carbon monoxide adsorbed on the platinum nanoislands. Ultimately, we reach more than 1500-fold infrared absorption enhancements, allowing for an ultrasensitive detection of a monolayer of chemisorbed carbon monoxide. The developed procedure can be adapted to other metal adsorbents and molecular species and could be utilized for coverage sensing in surface catalytic reactions.
AU - Haase, Johannes
AU - Bagiante, Salvatore
AU - Sigg, Hans
AU - Van Bokhoven, Jeroen
ID - 675
IS - 10
JF - Optics Letters
TI - Surface enhanced infrared absorption of chemisorbed carbon monoxide using plasmonic nanoantennas
VL - 42
ER -
TY - JOUR
AB - The INO80 complex (INO80-C) is an evolutionarily conserved nucleosome remodeler that acts in transcription, replication, and genome stability. It is required for resistance against genotoxic agents and is involved in the repair of DNA double-strand breaks (DSBs) by homologous recombination (HR). However, the causes of the HR defect in INO80-C mutant cells are controversial. Here, we unite previous findings using a system to study HR with high spatial resolution in budding yeast. We find that INO80-C has at least two distinct functions during HR—DNA end resection and presynaptic filament formation. Importantly, the second function is linked to the histone variant H2A.Z. In the absence of H2A.Z, presynaptic filament formation and HR are restored in INO80-C-deficient mutants, suggesting that presynaptic filament formation is the crucial INO80-C function during HR.
AU - Lademann, Claudio
AU - Renkawitz, Jörg
AU - Pfander, Boris
AU - Jentsch, Stefan
ID - 677
IS - 7
JF - Cell Reports
SN - 22111247
TI - The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination
VL - 19
ER -
TY - JOUR
AB - The seminal observation that mechanical signals can elicit changes in biochemical signalling within cells, a process commonly termed mechanosensation and mechanotransduction, has revolutionized our understanding of the role of cell mechanics in various fundamental biological processes, such as cell motility, adhesion, proliferation and differentiation. In this Review, we will discuss how the interplay and feedback between mechanical and biochemical signals control tissue morphogenesis and cell fate specification in embryonic development.
AU - Petridou, Nicoletta
AU - Spiro, Zoltan P
AU - Heisenberg, Carl-Philipp J
ID - 678
IS - 6
JF - Nature Cell Biology
SN - 14657392
TI - Multiscale force sensing in development
VL - 19
ER -
TY - JOUR
AB - Protective responses against pathogens require a rapid mobilization of resting neutrophils and the timely removal of activated ones. Neutrophils are exceptionally short-lived leukocytes, yet it remains unclear whether the lifespan of pathogen-engaged neutrophils is regulated differently from that in the circulating steady-state pool. Here, we have found that under homeostatic conditions, the mRNA-destabilizing protein tristetraprolin (TTP) regulates apoptosis and the numbers of activated infiltrating murine neutrophils but not neutrophil cellularity. Activated TTP-deficient neutrophils exhibited decreased apoptosis and enhanced accumulation at the infection site. In the context of myeloid-specific deletion of Ttp, the potentiation of neutrophil deployment protected mice against lethal soft tissue infection with Streptococcus pyogenes and prevented bacterial dissemination. Neutrophil transcriptome analysis revealed that decreased apoptosis of TTP-deficient neutrophils was specifically associated with elevated expression of myeloid cell leukemia 1 (Mcl1) but not other antiapoptotic B cell leukemia/ lymphoma 2 (Bcl2) family members. Higher Mcl1 expression resulted from stabilization of Mcl1 mRNA in the absence of TTP. The low apoptosis rate of infiltrating TTP-deficient neutrophils was comparable to that of transgenic Mcl1-overexpressing neutrophils. Our study demonstrates that posttranscriptional gene regulation by TTP schedules the termination of the antimicrobial engagement of neutrophils. The balancing role of TTP comes at the cost of an increased risk of bacterial infections.
AU - Ebner, Florian
AU - Sedlyarov, Vitaly
AU - Tasciyan, Saren
AU - Ivin, Masa
AU - Kratochvill, Franz
AU - Gratz, Nina
AU - Kenner, Lukas
AU - Villunger, Andreas
AU - Sixt, Michael K
AU - Kovarik, Pavel
ID - 679
IS - 6
JF - The Journal of Clinical Investigation
SN - 00219738
TI - The RNA-binding protein tristetraprolin schedules apoptosis of pathogen-engaged neutrophils during bacterial infection
VL - 127
ER -
TY - JOUR
AB - In order to respond reliably to specific features of their environment, sensory neurons need to integrate multiple incoming noisy signals. Crucially, they also need to compete for the interpretation of those signals with other neurons representing similar features. The form that this competition should take depends critically on the noise corrupting these signals. In this study we show that for the type of noise commonly observed in sensory systems, whose variance scales with the mean signal, sensory neurons should selectively divide their input signals by their predictions, suppressing ambiguous cues while amplifying others. Any change in the stimulus context alters which inputs are suppressed, leading to a deep dynamic reshaping of neural receptive fields going far beyond simple surround suppression. Paradoxically, these highly variable receptive fields go alongside and are in fact required for an invariant representation of external sensory features. In addition to offering a normative account of context-dependent changes in sensory responses, perceptual inference in the presence of signal-dependent noise accounts for ubiquitous features of sensory neurons such as divisive normalization, gain control and contrast dependent temporal dynamics.
AU - Chalk, Matthew J
AU - Masset, Paul
AU - Gutkin, Boris
AU - Denève, Sophie
ID - 680
IS - 6
JF - PLoS Computational Biology
SN - 1553734X
TI - Sensory noise predicts divisive reshaping of receptive fields
VL - 13
ER -
TY - CONF
AB - Given a triangulation of a point set in the plane, a flip deletes an edge e whose removal leaves a convex quadrilateral, and replaces e by the opposite diagonal of the quadrilateral. It is well known that any triangulation of a point set can be reconfigured to any other triangulation by some sequence of flips. We explore this question in the setting where each edge of a triangulation has a label, and a flip transfers the label of the removed edge to the new edge. It is not true that every labelled triangulation of a point set can be reconfigured to every other labelled triangulation via a sequence of flips, but we characterize when this is possible. There is an obvious necessary condition: for each label l, if edge e has label l in the first triangulation and edge f has label l in the second triangulation, then there must be some sequence of flips that moves label l from e to f, ignoring all other labels. Bose, Lubiw, Pathak and Verdonschot formulated the Orbit Conjecture, which states that this necessary condition is also sufficient, i.e. that all labels can be simultaneously mapped to their destination if and only if each label individually can be mapped to its destination. We prove this conjecture. Furthermore, we give a polynomial-time algorithm to find a sequence of flips to reconfigure one labelled triangulation to another, if such a sequence exists, and we prove an upper bound of O(n7) on the length of the flip sequence. Our proof uses the topological result that the sets of pairwise non-crossing edges on a planar point set form a simplicial complex that is homeomorphic to a high-dimensional ball (this follows from a result of Orden and Santos; we give a different proof based on a shelling argument). The dual cell complex of this simplicial ball, called the flip complex, has the usual flip graph as its 1-skeleton. We use properties of the 2-skeleton of the flip complex to prove the Orbit Conjecture.
AU - Lubiw, Anna
AU - Masárová, Zuzana
AU - Wagner, Uli
ID - 683
TI - A proof of the orbit conjecture for flipping edge labelled triangulations
VL - 77
ER -
TY - JOUR
AB - We generalize winning conditions in two-player games by adding a structural acceptance condition called obligations. Obligations are orthogonal to the linear winning conditions that define whether a play is winning. Obligations are a declaration that player 0 can achieve a certain value from a configuration. If the obligation is met, the value of that configuration for player 0 is 1. We define the value in such games and show that obligation games are determined. For Markov chains with Borel objectives and obligations, and finite turn-based stochastic parity games with obligations we give an alternative and simpler characterization of the value function. Based on this simpler definition we show that the decision problem of winning finite turn-based stochastic parity games with obligations is in NP∩co-NP. We also show that obligation games provide a game framework for reasoning about p-automata. © 2017 The Association for Symbolic Logic.
AU - Chatterjee, Krishnendu
AU - Piterman, Nir
ID - 684
IS - 2
JF - Journal of Symbolic Logic
SN - 0022-4812
TI - Obligation blackwell games and p-automata
VL - 82
ER -
TY - CONF
AB - In classical machine learning, regression is treated as a black box process of identifying a suitable function from a hypothesis set without attempting to gain insight into the mechanism connecting inputs and outputs. In the natural sciences, however, finding an interpretable function for a phenomenon is the prime goal as it allows to understand and generalize results. This paper proposes a novel type of function learning network, called equation learner (EQL), that can learn analytical expressions and is able to extrapolate to unseen domains. It is implemented as an end-to-end differentiable feed-forward network and allows for efficient gradient based training. Due to sparsity regularization concise interpretable expressions can be obtained. Often the true underlying source expression is identified.
AU - Martius, Georg S
AU - Lampert, Christoph
ID - 6841
T2 - 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings
TI - Extrapolation and learning equations
ER -
TY - JOUR
AB - By applying methods and principles from the physical sciences to biological problems, D'Arcy Thompson's On Growth and Form demonstrated how mathematical reasoning reveals elegant, simple explanations for seemingly complex processes. This has had a profound influence on subsequent generations of developmental biologists. We discuss how this influence can be traced through twentieth century morphologists, embryologists and theoreticians to current research that explores the molecular and cellular mechanisms of tissue growth and patterning, including our own studies of the vertebrate neural tube.
AU - Briscoe, James
AU - Kicheva, Anna
ID - 685
JF - Mechanisms of Development
SN - 09254773
TI - The physics of development 100 years after D'Arcy Thompson's “on growth and form”
VL - 145
ER -
TY - JOUR
AB - Tissues are thought to behave like fluids with a given surface tension. Differences in tissue surface tension (TST) have been proposed to trigger cell sorting and tissue envelopment. D'Arcy Thompson in his seminal book ‘On Growth and Form’ has introduced this concept of differential TST as a key physical mechanism dictating tissue formation and organization within the developing organism. Over the past century, many studies have picked up the concept of differential TST and analyzed the role and cell biological basis of TST in development, underlining the importance and influence of this concept in developmental biology.
AU - Heisenberg, Carl-Philipp J
ID - 686
JF - Mechanisms of Development
SN - 09254773
TI - D'Arcy Thompson's ‘on growth and form’: From soap bubbles to tissue self organization
VL - 145
ER -
TY - JOUR
AB - Pursuing the similarity between the Kontsevich-Soibelman construction of the cohomological Hall algebra (CoHA) of BPS states and Lusztig's construction of canonical bases for quantum enveloping algebras, and the similarity between the integrality conjecture for motivic Donaldson-Thomas invariants and the PBW theorem for quantum enveloping algebras, we build a coproduct on the CoHA associated to a quiver with potential. We also prove a cohomological dimensional reduction theorem, further linking a special class of CoHAs with Yangians, and explaining how to connect the study of character varieties with the study of CoHAs.
AU - Davison, Ben
ID - 687
IS - 2
JF - Quarterly Journal of Mathematics
SN - 00335606
TI - The critical CoHA of a quiver with potential
VL - 68
ER -
TY - CONF
AB - We show that the framework of topological data analysis can be extended from metrics to general Bregman divergences, widening the scope of possible applications. Examples are the Kullback - Leibler divergence, which is commonly used for comparing text and images, and the Itakura - Saito divergence, popular for speech and sound. In particular, we prove that appropriately generalized čech and Delaunay (alpha) complexes capture the correct homotopy type, namely that of the corresponding union of Bregman balls. Consequently, their filtrations give the correct persistence diagram, namely the one generated by the uniformly growing Bregman balls. Moreover, we show that unlike the metric setting, the filtration of Vietoris-Rips complexes may fail to approximate the persistence diagram. We propose algorithms to compute the thus generalized čech, Vietoris-Rips and Delaunay complexes and experimentally test their efficiency. Lastly, we explain their surprisingly good performance by making a connection with discrete Morse theory.
AU - Edelsbrunner, Herbert
AU - Wagner, Hubert
ID - 688
SN - 18688969
TI - Topological data analysis with Bregman divergences
VL - 77
ER -
TY - JOUR
AB - Rett syndrome modeling in monkey mirrors the human disorder.
AU - Novarino, Gaia
ID - 689
IS - 393
JF - Science Translational Medicine
SN - 19466234
TI - Rett syndrome modeling goes simian
VL - 9
ER -
TY - JOUR
AB - Many central synapses contain a single presynaptic active zone and a single postsynaptic density. Vesicular release statistics at such “simple synapses” indicate that they contain a small complement of docking sites where vesicles repetitively dock and fuse. In this work, we investigate functional and morphological aspects of docking sites at simple synapses made between cerebellar parallel fibers and molecular layer interneurons. Using immunogold labeling of SDS-treated freeze-fracture replicas, we find that Cav2.1 channels form several clusters per active zone with about nine channels per cluster. The mean value and range of intersynaptic variation are similar for Cav2.1 cluster numbers and for functional estimates of docking-site numbers obtained from the maximum numbers of released vesicles per action potential. Both numbers grow in relation with synaptic size and decrease by a similar extent with age between 2 wk and 4 wk postnatal. Thus, the mean docking-site numbers were 3.15 at 2 wk (range: 1–10) and 2.03 at 4 wk (range: 1–4), whereas the mean numbers of Cav2.1 clusters were 2.84 at 2 wk (range: 1–8) and 2.37 at 4 wk (range: 1–5). These changes were accompanied by decreases of miniature current amplitude (from 93 pA to 56 pA), active-zone surface area (from 0.0427 μm2 to 0.0234 μm2), and initial success rate (from 0.609 to 0.353), indicating a tightening of synaptic transmission with development. Altogether, these results suggest a close correspondence between the number of functionally defined vesicular docking sites and that of clusters of voltage-gated calcium channels.
AU - Miki, Takafumi
AU - Kaufmann, Walter
AU - Malagon, Gerardo
AU - Gomez, Laura
AU - Tabuchi, Katsuhiko
AU - Watanabe, Masahiko
AU - Shigemoto, Ryuichi
AU - Marty, Alain
ID - 693
IS - 26
JF - PNAS
SN - 00278424
TI - Numbers of presynaptic Ca2+ channel clusters match those of functionally defined vesicular docking sites in single central synapses
VL - 114
ER -
TY - CONF
AB - LCLs or locally checkable labelling problems (e.g. maximal independent set, maximal matching, and vertex colouring) in the LOCAL model of computation are very well-understood in cycles (toroidal 1-dimensional grids): every problem has a complexity of O(1), Θ(log* n), or Θ(n), and the design of optimal algorithms can be fully automated. This work develops the complexity theory of LCL problems for toroidal 2-dimensional grids. The complexity classes are the same as in the 1-dimensional case: O(1), Θ(log* n), and Θ(n). However, given an LCL problem it is undecidable whether its complexity is Θ(log* n) or Θ(n) in 2-dimensional grids.
Nevertheless, if we correctly guess that the complexity of a problem is Θ(log* n), we can completely automate the design of optimal algorithms. For any problem we can find an algorithm that is of a normal form A' o Sk, where A' is a finite function, Sk is an algorithm for finding a maximal independent set in kth power of the grid, and k is a constant.
Finally, partially with the help of automated design tools, we classify the complexity of several concrete LCL problems related to colourings and orientations.
AU - Brandt, Sebastian
AU - Hirvonen, Juho
AU - Korhonen, Janne H.
AU - Lempiäinen, Tuomo
AU - Östergård, Patric R.J.
AU - Purcell, Christopher
AU - Rybicki, Joel
AU - Suomela, Jukka
AU - Uznański, Przemysław
ID - 6932
SN - 9781450349925
TI - LCL problems on grids
ER -
TY - JOUR
AB - A change regarding the extent of adhesion - hereafter referred to as adhesion plasticity - between adhesive and less-adhesive states of mammalian cells is important for their behavior. To investigate adhesion plasticity, we have selected a stable isogenic subpopulation of human MDA-MB-468 breast carcinoma cells growing in suspension. These suspension cells are unable to re-adhere to various matrices or to contract three-dimensional collagen lattices. By using transcriptome analysis, we identified the focal adhesion protein tensin3 (Tns3) as a determinant of adhesion plasticity. Tns3 is strongly reduced at mRNA and protein levels in suspension cells. Furthermore, by transiently challenging breast cancer cells to grow under non-adherent conditions markedly reduces Tns3 protein expression, which is regained upon re-adhesion. Stable knockdown of Tns3 in parental MDA-MB-468 cells results in defective adhesion, spreading and migration. Tns3-knockdown cells display impaired structure and dynamics of focal adhesion complexes as determined by immunostaining. Restoration of Tns3 protein expression in suspension cells partially rescues adhesion and focal contact composition. Our work identifies Tns3 as a crucial focal adhesion component regulated by, and functionally contributing to, the switch between adhesive and non-adhesive states in MDA-MB-468 cancer cells.
AU - Veß, Astrid
AU - Blache, Ulrich
AU - Leitner, Laura
AU - Kurz, Angela
AU - Ehrenpfordt, Anja
AU - Sixt, Michael K
AU - Posern, Guido
ID - 694
IS - 13
JF - Journal of Cell Science
SN - 00219533
TI - A dual phenotype of MDA MB 468 cancer cells reveals mutual regulation of tensin3 and adhesion plasticity
VL - 130
ER -
TY - JOUR
AB - Magnetic anisotropy in strontium iridate (Sr2IrO4) is found to be large because of the strong spin-orbit interactions. In our work, we studied the in-plane magnetic anisotropy of Sr2IrO4 and traced the anisotropic exchange interactions between the isospins in the crystal. The magnetic-field-dependent torque τ(H) showed a prominent transition from the canted antiferromagnetic state to the weak ferromagnetic (WFM) state. A comprehensive analysis was conducted to examine the isotropic and anisotropic regimes and probe the easy magnetization axis along the a b plane. The angle-dependent torque τ(θ) revealed a deviation from the sinusoidal behavior, and small differences in hysteresis were observed around 0° and 90° in the low-magnetic-field regime. This indicates that the orientation of the easy axis of the FM component is along the b axis, where the antiferromagnetic to WFM spin-flop transition occurs. We compared the coefficients of the magnetic susceptibility tensors and captured the anisotropy of the material. The in-plane τ(θ) revealed a tendency toward isotropic behavior for fields with values above the field value of the WFM transition.
AU - Nauman, Muhammad
AU - Hong, Yunjeong
AU - Hussain, Tayyaba
AU - Seo, M. S.
AU - Park, S. Y.
AU - Lee, N.
AU - Choi, Y. J.
AU - Kang, Woun
AU - Jo, Younjung
ID - 9065
IS - 15
JF - Physical Review B
SN - 2469-9950
TI - In-plane magnetic anisotropy in strontium iridate Sr2IrO4
VL - 96
ER -
TY - JOUR
AB - We study the lengths of curves passing through a fixed number of points on the boundary of a convex shape in the plane. We show that, for any convex shape K, there exist four points on the boundary of K such that the length of any curve passing through these points is at least half of the perimeter of K. It is also shown that the same statement does not remain valid with the additional constraint that the points are extreme points of K. Moreover, the factor ½ cannot be achieved with any fixed number of extreme points. We conclude the paper with a few other inequalities related to the perimeter of a convex shape.
AU - Akopyan, Arseniy
AU - Vysotsky, Vladislav
ID - 909
IS - 7
JF - The American Mathematical Monthly
SN - 00029890
TI - On the lengths of curves passing through boundary points of a planar convex shape
VL - 124
ER -
TY - JOUR
AB - Frequency-independent selection is generally considered as a force that acts to reduce the genetic variation in evolving populations, yet rigorous arguments for this idea are scarce. When selection fluctuates in time, it is unclear whether frequency-independent selection may maintain genetic polymorphism without invoking additional mechanisms. We show that constant frequency-independent selection with arbitrary epistasis on a well-mixed haploid population eliminates genetic variation if we assume linkage equilibrium between alleles. To this end, we introduce the notion of frequency-independent selection at the level of alleles, which is sufficient to prove our claim and contains the notion of frequency-independent selection on haploids. When selection and recombination are weak but of the same order, there may be strong linkage disequilibrium; numerical calculations show that stable equilibria are highly unlikely. Using the example of a diallelic two-locus model, we then demonstrate that frequency-independent selection that fluctuates in time can maintain stable polymorphism if linkage disequilibrium changes its sign periodically. We put our findings in the context of results from the existing literature and point out those scenarios in which the possible role of frequency-independent selection in maintaining genetic variation remains unclear.
AU - Novak, Sebastian
AU - Barton, Nicholas H
ID - 910
IS - 2
JF - Genetics
TI - When does frequency-independent selection maintain genetic variation?
VL - 207
ER -
TY - CONF
AB - We develop a probabilistic technique for colorizing grayscale natural images. In light of the intrinsic uncertainty of this task, the proposed probabilistic framework has numerous desirable properties. In particular, our model is able to produce multiple plausible and vivid colorizations for a given grayscale image and is one of the first colorization models to provide a proper stochastic sampling scheme. Moreover, our training procedure is supported by a rigorous theoretical framework that does not require any ad hoc heuristics and allows for efficient modeling and learning of the joint pixel color distribution.We demonstrate strong quantitative and qualitative experimental results on the CIFAR-10 dataset and the challenging ILSVRC 2012 dataset.
AU - Royer, Amélie
AU - Kolesnikov, Alexander
AU - Lampert, Christoph
ID - 911
TI - Probabilistic image colorization
ER -
TY - JOUR
AB - We consider a many-body system of fermionic atoms interacting via a local pair potential and subject to an external potential within the framework of Bardeen-Cooper-Schrieffer (BCS) theory. We measure the free energy of the whole sample with respect to the free energy of a reference state which allows us to define a BCS functional with boundary conditions at infinity. Our main result is a lower bound for this energy functional in terms of expressions that typically appear in Ginzburg-Landau functionals.
AU - Deuchert, Andreas
ID - 912
IS - 8
JF - Journal of Mathematical Physics
SN - 00222488
TI - A lower bound for the BCS functional with boundary conditions at infinity
VL - 58
ER -
TY - JOUR
AB - Pools of air cooled by partial rain evaporation span up to several hundreds of kilometers in nature and typically last less than 1 day, ultimately losing their identity to the large-scale flow. These fundamentally differ in character from the radiatively-driven dry pools defining convective aggregation. Advancement in remote sensing and in computer capabilities has promoted exploration of how precipitation-induced cold pool processes modify the convective spectrum and life cycle. This contribution surveys current understanding of such cold pools over the tropical and subtropical oceans. In shallow convection with low rain rates, the cold pools moisten, preserving the near-surface equivalent potential temperature or increasing it if the surface moisture fluxes cannot ventilate beyond the new surface layer; both conditions indicate downdraft origin air from within the boundary layer. When rain rates exceed ∼ 2 mm h−1, convective-scale downdrafts can bring down drier air of lower equivalent potential temperature from above the boundary layer. The resulting density currents facilitate the lifting of locally thermodynamically favorable air and can impose an arc-shaped mesoscale cloud organization. This organization allows clouds capable of reaching 4–5 km within otherwise dry environments. These are more commonly observed in the northern hemisphere trade wind regime, where the flow to the intertropical convergence zone is unimpeded by the equator. Their near-surface air properties share much with those shown from cold pools sampled in the equatorial Indian Ocean. Cold pools are most effective at influencing the mesoscale organization when the atmosphere is moist in the lower free troposphere and dry above, suggesting an optimal range of water vapor paths. Outstanding questions on the relationship between cold pools, their accompanying moisture distribution and cloud cover are detailed further. Near-surface water vapor rings are documented in one model inside but near the cold pool edge; these are not consistent with observations, but do improve with smaller horizontal grid spacings.
AU - Zuidema, Paquita
AU - Torri, Giuseppe
AU - Muller, Caroline J
AU - Chandra, Arunchandra
ID - 9137
IS - 6
JF - Surveys in Geophysics
KW - Geochemistry and Petrology
KW - Geophysics
SN - 0169-3298
TI - A survey of precipitation-induced atmospheric cold pools over oceans and their interactions with the larger-scale environment
VL - 38
ER -
TY - JOUR
AB - Convective self-aggregation, the spontaneous organization of initially scattered convection into isolated convective clusters despite spatially homogeneous boundary conditions and forcing, was first recognized and studied in idealized numerical simulations. While there is a rich history of observational work on convective clustering and organization, there have been only a few studies that have analyzed observations to look specifically for processes related to self-aggregation in models. Here we review observational work in both of these categories and motivate the need for more of this work. We acknowledge that self-aggregation may appear to be far-removed from observed convective organization in terms of time scales, initial conditions, initiation processes, and mean state extremes, but we argue that these differences vary greatly across the diverse range of model simulations in the literature and that these comparisons are already offering important insights into real tropical phenomena. Some preliminary new findings are presented, including results showing that a self-aggregation simulation with square geometry has too broad distribution of humidity and is too dry in the driest regions when compared with radiosonde records from Nauru, while an elongated channel simulation has realistic representations of atmospheric humidity and its variability. We discuss recent work increasing our understanding of how organized convection and climate change may interact, and how model discrepancies related to this question are prompting interest in observational comparisons. We also propose possible future directions for observational work related to convective aggregation, including novel satellite approaches and a ground-based observational network.
AU - Holloway, Christopher E.
AU - Wing, Allison A.
AU - Bony, Sandrine
AU - Muller, Caroline J
AU - Masunaga, Hirohiko
AU - L’Ecuyer, Tristan S.
AU - Turner, David D.
AU - Zuidema, Paquita
ID - 9138
IS - 6
JF - Surveys in Geophysics
KW - Geochemistry and Petrology
KW - Geophysics
SN - 0169-3298
TI - Observing convective aggregation
VL - 38
ER -
TY - JOUR
AB - Organized convection in the tropics occurs across a range of spatial and temporal scales and strongly influences cloud cover and humidity. One mode of organization found is “self-aggregation,” in which moist convection spontaneously organizes into one or several isolated clusters despite spatially homogeneous boundary conditions and forcing. Self-aggregation is driven by interactions between clouds, moisture, radiation, surface fluxes, and circulation, and occurs in a wide variety of idealized simulations of radiative–convective equilibrium. Here we provide a review of convective self-aggregation in numerical simulations, including its character, causes, and effects. We describe the evolution of self-aggregation including its time and length scales and the physical mechanisms leading to its triggering and maintenance, and we also discuss possible links to climate and climate change.
AU - Wing, Allison A.
AU - Emanuel, Kerry
AU - Holloway, Christopher E.
AU - Muller, Caroline J
ID - 9139
IS - 6
JF - Surveys in Geophysics
KW - Geochemistry and Petrology
KW - Geophysics
SN - 0169-3298
TI - Convective self-aggregation in numerical simulations: A review
VL - 38
ER -
TY - JOUR
AB - Infections with potentially lethal pathogens may negatively affect an individual’s lifespan and decrease its reproductive value. The terminal investment hypothesis predicts that individuals faced with a reduced survival should invest more into reproduction instead of maintenance and growth. Several studies suggest that individuals are indeed able to estimate their body condition and to increase their reproductive effort with approaching death, while other studies gave ambiguous results. We investigate whether queens of a perennial social insect (ant) are able to boost their reproduction following infection with an obligate killing pathogen. Social insect queens are special with regard to reproduction and aging, as they outlive conspecific non-reproductive workers. Moreover, in the ant Cardiocondyla obscurior, fecundity increases with queen age. However, it remained unclear whether this reflects negative reproductive senescence or terminal investment in response to approaching death. Here, we test whether queens of C. obscurior react to infection with the entomopathogenic fungus Metarhizium brunneum by an increased egg-laying rate. We show that a fungal infection triggers a reinforced investment in reproduction in queens. This adjustment of the reproductive rate by ant queens is consistent with predictions of the terminal investment hypothesis and is reported for the first time in a social insect.
AU - Giehr, Julia
AU - Grasse, Anna V
AU - Cremer, Sylvia
AU - Heinze, Jürgen
AU - Schrempf, Alexandra
ID - 914
IS - 7
JF - Royal Society Open Science
SN - 20545703
TI - Ant queens increase their reproductive efforts after pathogen infection
VL - 4
ER -
TY - CONF
AB - We propose a dual decomposition and linear program relaxation of the NP-hard minimum cost multicut problem. Unlike other polyhedral relaxations of the multicut polytope, it is amenable to efficient optimization by message passing. Like other polyhedral relaxations, it can be tightened efficiently by cutting planes. We define an algorithm that alternates between message passing and efficient separation of cycle- and odd-wheel inequalities. This algorithm is more efficient than state-of-the-art algorithms based on linear programming, including algorithms written in the framework of leading commercial software, as we show in experiments with large instances of the problem from applications in computer vision, biomedical image analysis and data mining.
AU - Swoboda, Paul
AU - Andres, Bjoern
ID - 915
SN - 978-153860457-1
TI - A message passing algorithm for the minimum cost multicut problem
VL - 2017
ER -
TY - JOUR
AB - Previous numerical studies of the dissipation of internal tides in idealized settings suggest the existence of a critical latitude (~29°) where dissipation is enhanced. But observations only indicate a modest enhancement at this latitude. To resolve this difference between observational and numerical results, the authors study the latitudinal dependence of internal tides’ dissipation in more realistic conditions. In particular, the ocean is not a quiescent medium; the presence of large-scale currents or mesoscale eddies can impact the propagation and dissipation of internal tides. This paper investigates the impact of a weak background mean current in numerical simulations. The authors focus on the local dissipation of high spatial mode internal waves near their generation site. The vertical profile of dissipation and its variation with latitude without the mean current are consistent with earlier studies. But adding a weak mean current has a major impact on the latitudinal distribution of dissipation. The peak at the critical latitude disappears, and the dissipation is closer to a constant, albeit with two weak peaks at ~25° and ~35° latitude. This disappearance results from the Doppler shift of the internal tides’ frequency, which hinders the nonlinear transfer of energy to small-scale secondary waves via the parametric subharmonic instability (PSI). The new two weak peaks correspond to the Doppler-shifted critical latitudes of the left- and right-propagating waves. The results are confirmed in simulations with simple sinusoidal topography. Thus, although nonlinear transfers via PSI are efficient at dissipating internal tides, the exact location of the dissipation is sensitive to large-scale oceanic conditions.
AU - Richet, O.
AU - Muller, Caroline J
AU - Chomaz, J.-M.
ID - 9152
IS - 6
JF - Journal of Physical Oceanography
KW - Oceanography
SN - 0022-3670
TI - Impact of a mean current on the internal tide energy dissipation at the critical latitude
VL - 47
ER -
TY - CONF
AB - We study the quadratic assignment problem, in computer vision also known as graph matching. Two leading solvers for this problem optimize the Lagrange decomposition duals with sub-gradient and dual ascent (also known as message passing) updates. We explore this direction further and propose several additional Lagrangean relaxations of the graph matching problem along with corresponding algorithms, which are all based on a common dual ascent framework. Our extensive empirical evaluation gives several theoretical insights and suggests a new state-of-the-art anytime solver for the considered problem. Our improvement over state-of-the-art is particularly visible on a new dataset with large-scale sparse problem instances containing more than 500 graph nodes each.
AU - Swoboda, Paul
AU - Rother, Carsten
AU - Abu Alhaija, Carsten
AU - Kainmueller, Dagmar
AU - Savchynskyy, Bogdan
ID - 916
SN - 978-153860457-1
TI - A study of lagrangean decompositions and dual ascent solvers for graph matching
VL - 2017
ER -
TY - JOUR
AB - Advances in colloidal synthesis allow for the design of particles with controlled patches. This article reviews routes towards colloidal locomotion, where energy is consumed and converted into motion, and its implementation with active patchy particles. A special emphasis is given to phoretic swimmers, where the self-propulsion originates from an interfacial phenomenon, raising experimental challenges and opening up opportunities for particles with controlled anisotropic surface chemistry and novel behaviors.
AU - Aubret, A.
AU - Ramananarivo, S.
AU - Palacci, Jérémie A
ID - 9165
JF - Current Opinion in Colloid & Interface Science
SN - 1359-0294
TI - Eppur si muove, and yet it moves: Patchy (phoretic) swimmers
VL - 30
ER -
TY - CONF
AB - We propose a general dual ascent framework for Lagrangean decomposition of combinatorial problems. Although methods of this type have shown their efficiency for a number of problems, so far there was no general algorithm applicable to multiple problem types. In this work, we propose such a general algorithm. It depends on several parameters, which can be used to optimize its performance in each particular setting. We demonstrate efficacy of our method on graph matching and multicut problems, where it outperforms state-of-the-art solvers including those based on subgradient optimization and off-the-shelf linear programming solvers.
AU - Swoboda, Paul
AU - Kuske, Jan
AU - Savchynskyy, Bogdan
ID - 917
SN - 978-153860457-1
TI - A dual ascent framework for Lagrangean decomposition of combinatorial problems
VL - 2017
ER -
TY - JOUR
AB - Plant meristems carry pools of continuously active stem cells, whose activity is controlled by developmental and environmental signals. After stem cell division, daughter cells that exit the stem cell domain acquire transit amplifying cell identity before they are incorporated into organs and differentiate. In this study, we used an integrated approach to elucidate the role of HECATE (HEC) genes in regulating developmental trajectories of shoot stem cells in Arabidopsis thaliana. Our work reveals that HEC function stabilizes cell fate in distinct zones of the shoot meristem thereby controlling the spatio-temporal dynamics of stem cell differentiation. Importantly, this activity is concomitant with the local modulation of cellular responses to cytokinin and auxin, two key phytohormones regulating cell behaviour. Mechanistically, we show that HEC factors transcriptionally control and physically interact with MONOPTEROS (MP), a key regulator of auxin signalling, and modulate the autocatalytic stabilization of auxin signalling output.
AU - Gaillochet, Christophe
AU - Stiehl, Thomas
AU - Wenzl, Christian
AU - Ripoll, Juan-José
AU - Bailey-Steinitz, Lindsay J
AU - Li, Lanxin
AU - Pfeiffer, Anne
AU - Miotk, Andrej
AU - Hakenjos, Jana P
AU - Forner, Joachim
AU - Yanofsky, Martin F
AU - Marciniak-Czochra, Anna
AU - Lohmann, Jan U
ID - 9190
JF - eLife
SN - 2050-084X
TI - Control of plant cell fate transitions by transcriptional and hormonal signals
VL - 6
ER -
TY - JOUR
AB - We introduce the Voronoi functional of a triangulation of a finite set of points in the Euclidean plane and prove that among all geometric triangulations of the point set, the Delaunay triangulation maximizes the functional. This result neither extends to topological triangulations in the plane nor to geometric triangulations in three and higher dimensions.
AU - Edelsbrunner, Herbert
AU - Glazyrin, Alexey
AU - Musin, Oleg
AU - Nikitenko, Anton
ID - 1173
IS - 5
JF - Combinatorica
SN - 02099683
TI - The Voronoi functional is maximized by the Delaunay triangulation in the plane
VL - 37
ER -
TY - CONF
AB - Security of cryptographic applications is typically defined by security games. The adversary, within certain resources, cannot win with probability much better than 0 (for unpredictability applications, like one-way functions) or much better than 1/2 (indistinguishability applications for instance encryption schemes). In so called squared-friendly applications the winning probability of the adversary, for different values of the application secret randomness, is not only close to 0 or 1/2 on average, but also concentrated in the sense that its second central moment is small. The class of squared-friendly applications, which contains all unpredictability applications and many indistinguishability applications, is particularly important for key derivation. Barak et al. observed that for square-friendly applications one can beat the "RT-bound", extracting secure keys with significantly smaller entropy loss. In turn Dodis and Yu showed that in squared-friendly applications one can directly use a "weak" key, which has only high entropy, as a secure key. In this paper we give sharp lower bounds on square security assuming security for "weak" keys. We show that any application which is either (a) secure with weak keys or (b) allows for entropy savings for keys derived by universal hashing, must be square-friendly. Quantitatively, our lower bounds match the positive results of Dodis and Yu and Barak et al. (TCC\'13, CRYPTO\'11) Hence, they can be understood as a general characterization of squared-friendly applications. While the positive results on squared-friendly applications where derived by one clever application of the Cauchy-Schwarz Inequality, for tight lower bounds we need more machinery. In our approach we use convex optimization techniques and some theory of circular matrices.
AU - Skórski, Maciej
ID - 1174
SN - 18688969
TI - Lower bounds on key derivation for square-friendly applications
VL - 66
ER -
TY - CONF
AB - We study space complexity and time-space trade-offs with a focus not on peak memory usage but on overall memory consumption throughout the computation. Such a cumulative space measure was introduced for the computational model of parallel black pebbling by [Alwen and Serbinenko ’15] as a tool for obtaining results in cryptography. We consider instead the non- deterministic black-white pebble game and prove optimal cumulative space lower bounds and trade-offs, where in order to minimize pebbling time the space has to remain large during a significant fraction of the pebbling. We also initiate the study of cumulative space in proof complexity, an area where other space complexity measures have been extensively studied during the last 10–15 years. Using and extending the connection between proof complexity and pebble games in [Ben-Sasson and Nordström ’08, ’11] we obtain several strong cumulative space results for (even parallel versions of) the resolution proof system, and outline some possible future directions of study of this, in our opinion, natural and interesting space measure.
AU - Alwen, Joel F
AU - De Rezende, Susanna
AU - Nordstrom, Jakob
AU - Vinyals, Marc
ED - Papadimitriou, Christos
ID - 1175
SN - 18688969
TI - Cumulative space in black-white pebbling and resolution
VL - 67
ER -
TY - CONF
AB - The algorithm Argon2i-B of Biryukov, Dinu and Khovratovich is currently being considered by the IRTF (Internet Research Task Force) as a new de-facto standard for password hashing. An older version (Argon2i-A) of the same algorithm was chosen as the winner of the recent Password Hashing Competition. An important competitor to Argon2i-B is the recently introduced Balloon Hashing (BH) algorithm of Corrigan-Gibs, Boneh and Schechter. A key security desiderata for any such algorithm is that evaluating it (even using a custom device) requires a large amount of memory amortized across multiple instances. Alwen and Blocki (CRYPTO 2016) introduced a class of theoretical attacks against Argon2i-A and BH. While these attacks yield large asymptotic reductions in the amount of memory, it was not, a priori, clear if (1) they can be extended to the newer Argon2i-B, (2) the attacks are effective on any algorithm for practical parameter ranges (e.g., 1GB of memory) and (3) if they can be effectively instantiated against any algorithm under realistic hardware constrains. In this work we answer all three of these questions in the affirmative for all three algorithms. This is also the first work to analyze the security of Argon2i-B. In more detail, we extend the theoretical attacks of Alwen and Blocki (CRYPTO 2016) to the recent Argon2i-B proposal demonstrating severe asymptotic deficiencies in its security. Next we introduce several novel heuristics for improving the attack's concrete memory efficiency even when on-chip memory bandwidth is bounded. We then simulate our attacks on randomly sampled Argon2i-A, Argon2i-B and BH instances and measure the resulting memory consumption for various practical parameter ranges and for a variety of upperbounds on the amount of parallelism available to the attacker. Finally we describe, implement, and test a new heuristic for applying the Alwen-Blocki attack to functions employing a technique developed by Corrigan-Gibs et al. for improving concrete security of memory-hard functions. We analyze the collected data and show the effects various parameters have on the memory consumption of the attack. In particular, we can draw several interesting conclusions about the level of security provided by these functions. · For the Alwen-Blocki attack to fail against practical memory parameters, Argon2i-B must be instantiated with more than 10 passes on memory - beyond the "paranoid" parameter setting in the current IRTF proposal. · The technique of Corrigan-Gibs for improving security can also be overcome by the Alwen-Blocki attack under realistic hardware constraints. · On a positive note, both the asymptotic and concrete security of Argon2i-B seem to improve on that of Argon2i-A.
AU - Alwen, Joel F
AU - Blocki, Jeremiah
ID - 1176
SN - 978-150905761-0
TI - Towards practical attacks on Argon2i and balloon hashing
ER -
TY - CONF
AB - For any pair (X, Z) of correlated random variables we can think of Z as a randomized function of X. If the domain of Z is small, one can make this function computationally efficient by allowing it to be only approximately correct. In folklore this problem is known as simulating auxiliary inputs. This idea of simulating auxiliary information turns out to be a very usefull tool, finding applications in complexity theory, cryptography, pseudorandomness and zero-knowledge. In this paper we revisit this problem, achieving the following results: (a) We present a novel boosting algorithm for constructing the simulator. This boosting proof is of independent interest, as it shows how to handle “negative mass” issues when constructing probability measures by shifting distinguishers in descent algorithms. Our technique essentially fixes the flaw in the TCC’14 paper “How to Fake Auxiliary Inputs”. (b) The complexity of our simulator is better than in previous works, including results derived from the uniform min-max theorem due to Vadhan and Zheng. To achieve (s,ϵ) -indistinguishability we need the complexity O(s⋅25ℓϵ−2) in time/circuit size, which improve previous bounds by a factor of ϵ−2. In particular, with we get meaningful provable security for the EUROCRYPT’09 leakage-resilient stream cipher instantiated with a standard 256-bit block cipher, like
AU - Skórski, Maciej
ID - 1178
TI - Simulating auxiliary inputs, revisited
VL - 9985
ER -
TY - JOUR
AB - In this article we define an algebraic vertex of a generalized polyhedron and show that the set of algebraic vertices is the smallest set of points needed to define the polyhedron. We prove that the indicator function of a generalized polytope P is a linear combination of indicator functions of simplices whose vertices are algebraic vertices of P. We also show that the indicator function of any generalized polyhedron is a linear combination, with integer coefficients, of indicator functions of cones with apices at algebraic vertices and line-cones. The concept of an algebraic vertex is closely related to the Fourier–Laplace transform. We show that a point v is an algebraic vertex of a generalized polyhedron P if and only if the tangent cone of P, at v, has non-zero Fourier–Laplace transform.
AU - Akopyan, Arseniy
AU - Bárány, Imre
AU - Robins, Sinai
ID - 1180
JF - Advances in Mathematics
SN - 00018708
TI - Algebraic vertices of non-convex polyhedra
VL - 308
ER -
TY - JOUR
AB - We construct efficient authentication protocols and message authentication codes (MACs) whose security can be reduced to the learning parity with noise (LPN) problem. Despite a large body of work—starting with the (Formula presented.) protocol of Hopper and Blum in 2001—until now it was not even known how to construct an efficient authentication protocol from LPN which is secure against man-in-the-middle attacks. A MAC implies such a (two-round) protocol.
AU - Kiltz, Eike
AU - Pietrzak, Krzysztof Z
AU - Venturi, Daniele
AU - Cash, David
AU - Jain, Abhishek
ID - 1187
IS - 4
JF - Journal of Cryptology
TI - Efficient authentication from hard learning problems
VL - 30
ER -
TY - JOUR
AB - Variation in genotypes may be responsible for differences in dispersal rates, directional biases, and growth rates of individuals. These traits may favor certain genotypes and enhance their spatiotemporal spreading into areas occupied by the less advantageous genotypes. We study how these factors influence the speed of spreading in the case of two competing genotypes under the assumption that spatial variation of the total population is small compared to the spatial variation of the frequencies of the genotypes in the population. In that case, the dynamics of the frequency of one of the genotypes is approximately described by a generalized Fisher–Kolmogorov–Petrovskii–Piskunov (F–KPP) equation. This generalized F–KPP equation with (nonlinear) frequency-dependent diffusion and advection terms admits traveling wave solutions that characterize the invasion of the dominant genotype. Our existence results generalize the classical theory for traveling waves for the F–KPP with constant coefficients. Moreover, in the particular case of the quadratic (monostable) nonlinear growth–decay rate in the generalized F–KPP we study in detail the influence of the variance in diffusion and mean displacement rates of the two genotypes on the minimal wave propagation speed.
AU - Kollár, Richard
AU - Novak, Sebastian
ID - 1191
IS - 3
JF - Bulletin of Mathematical Biology
TI - Existence of traveling waves for the generalized F–KPP equation
VL - 79
ER -
TY - CONF
AB - The main result of this paper is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge CSP) and all constraints are even Δ-matroid relations (represented by lists of tuples). As a consequence of this, we settle the complexity classification of planar Boolean CSPs started by Dvorak and Kupec. Knowing that edge CSP is tractable for even Δ-matroid constraints allows us to extend the tractability result to a larger class of Δ-matroids that includes many classes that were known to be tractable before, namely co-independent, compact, local and binary.
AU - Kazda, Alexandr
AU - Kolmogorov, Vladimir
AU - Rolinek, Michal
ID - 1192
SN - 978-161197478-2
TI - Even delta-matroids and the complexity of planar Boolean CSPs
ER -
TY - CONF
AB - Termination is one of the basic liveness properties, and we study the termination problem for probabilistic programs with real-valued variables. Previous works focused on the qualitative problem that asks whether an input program terminates with probability~1 (almost-sure termination). A powerful approach for this qualitative problem is the notion of ranking supermartingales with respect to a given set of invariants. The quantitative problem (probabilistic termination) asks for bounds on the termination probability. A fundamental and conceptual drawback of the existing approaches to address probabilistic termination is that even though the supermartingales consider the probabilistic behavior of the programs, the invariants are obtained completely ignoring the probabilistic aspect. In this work we address the probabilistic termination problem for linear-arithmetic probabilistic programs with nondeterminism. We define the notion of {\em stochastic invariants}, which are constraints along with a probability bound that the constraints hold. We introduce a concept of {\em repulsing supermartingales}. First, we show that repulsing supermartingales can be used to obtain bounds on the probability of the stochastic invariants. Second, we show the effectiveness of repulsing supermartingales in the following three ways: (1)~With a combination of ranking and repulsing supermartingales we can compute lower bounds on the probability of termination; (2)~repulsing supermartingales provide witnesses for refutation of almost-sure termination; and (3)~with a combination of ranking and repulsing supermartingales we can establish persistence properties of probabilistic programs. We also present results on related computational problems and an experimental evaluation of our approach on academic examples.
AU - Chatterjee, Krishnendu
AU - Novotny, Petr
AU - Zikelic, Djordje
ID - 1194
IS - 1
SN - 07308566
TI - Stochastic invariants for probabilistic termination
VL - 52
ER -
TY - JOUR
AB - We define the . model-measuring problem: given a model . M and specification . ϕ, what is the maximal distance . ρ such that all models . M' within distance . ρ from . M satisfy (or violate) . ϕ. The model-measuring problem presupposes a distance function on models. We concentrate on . automatic distance functions, which are defined by weighted automata. The model-measuring problem subsumes several generalizations of the classical model-checking problem, in particular, quantitative model-checking problems that measure the degree of satisfaction of a specification; robustness problems that measure how much a model can be perturbed without violating the specification; and parameter synthesis for hybrid systems. We show that for automatic distance functions, and (a) . ω-regular linear-time, (b) . ω-regular branching-time, and (c) hybrid specifications, the model-measuring problem can be solved.We use automata-theoretic model-checking methods for model measuring, replacing the emptiness question for word, tree, and hybrid automata by the . optimal-value question for the weighted versions of these automata. For automata over words and trees, we consider weighted automata that accumulate weights by maximizing, summing, discounting, and limit averaging. For hybrid automata, we consider monotonic (parametric) hybrid automata, a hybrid counterpart of (discrete) weighted automata.We give several examples of using the model-measuring problem to compute various notions of robustness and quantitative satisfaction for temporal specifications. Further, we propose the modeling framework for model measuring to ease the specification and reduce the likelihood of errors in modeling.Finally, we present a variant of the model-measuring problem, called the . model-repair problem. The model-repair problem applies to models that do not satisfy the specification; it can be used to derive restrictions, under which the model satisfies the specification, i.e., to repair the model.
AU - Henzinger, Thomas A
AU - Otop, Jan
ID - 1196
JF - Nonlinear Analysis: Hybrid Systems
TI - Model measuring for discrete and hybrid systems
VL - 23
ER -
TY - JOUR
AB - We consider a model of fermions interacting via point interactions, defined via a certain weighted Dirichlet form. While for two particles the interaction corresponds to infinite scattering length, the presence of further particles effectively decreases the interaction strength. We show that the model becomes trivial in the thermodynamic limit, in the sense that the free energy density at any given particle density and temperature agrees with the corresponding expression for non-interacting particles.
AU - Moser, Thomas
AU - Seiringer, Robert
ID - 1198
IS - 3
JF - Letters in Mathematical Physics
SN - 03779017
TI - Triviality of a model of particles with point interactions in the thermodynamic limit
VL - 107
ER -
TY - JOUR
AB - Much of quantitative genetics is based on the ‘infinitesimal model’, under which selection has a negligible effect on the genetic variance. This is typically justified by assuming a very large number of loci with additive effects. However, it applies even when genes interact, provided that the number of loci is large enough that selection on each of them is weak relative to random drift. In the long term, directional selection will change allele frequencies, but even then, the effects of epistasis on the ultimate change in trait mean due to selection may be modest. Stabilising selection can maintain many traits close to their optima, even when the underlying alleles are weakly selected. However, the number of traits that can be optimised is apparently limited to ~4Ne by the ‘drift load’, and this is hard to reconcile with the apparent complexity of many organisms. Just as for the mutation load, this limit can be evaded by a particular form of negative epistasis. A more robust limit is set by the variance in reproductive success. This suggests that selection accumulates information most efficiently in the infinitesimal regime, when selection on individual alleles is weak, and comparable with random drift. A review of evidence on selection strength suggests that although most variance in fitness may be because of alleles with large Nes, substantial amounts of adaptation may be because of alleles in the infinitesimal regime, in which epistasis has modest effects.
AU - Barton, Nicholas H
ID - 1199
JF - Heredity
TI - How does epistasis influence the response to selection?
VL - 118
ER -
TY - JOUR
AB - The eigenvalue distribution of the sum of two large Hermitian matrices, when one of them is conjugated by a Haar distributed unitary matrix, is asymptotically given by the free convolution of their spectral distributions. We prove that this convergence also holds locally in the bulk of the spectrum, down to the optimal scales larger than the eigenvalue spacing. The corresponding eigenvectors are fully delocalized. Similar results hold for the sum of two real symmetric matrices, when one is conjugated by Haar orthogonal matrix.
AU - Bao, Zhigang
AU - Erdös, László
AU - Schnelli, Kevin
ID - 1207
IS - 3
JF - Communications in Mathematical Physics
SN - 00103616
TI - Local law of addition of random matrices on optimal scale
VL - 349
ER -
TY - JOUR
AB - We study parameter estimation in linear Gaussian covariance models, which are p-dimensional Gaussian models with linear constraints on the covariance matrix. Maximum likelihood estimation for this class of models leads to a non-convex optimization problem which typically has many local maxima. Using recent results on the asymptotic distribution of extreme eigenvalues of the Wishart distribution, we provide sufficient conditions for any hill climbing method to converge to the global maximum. Although we are primarily interested in the case in which n≫p, the proofs of our results utilize large sample asymptotic theory under the scheme n/p→γ>1. Remarkably, our numerical simulations indicate that our results remain valid for p as small as 2. An important consequence of this analysis is that, for sample sizes n≃14p, maximum likelihood estimation for linear Gaussian covariance models behaves as if it were a convex optimization problem. © 2016 The Royal Statistical Society and Blackwell Publishing Ltd.
AU - Zwiernik, Piotr
AU - Uhler, Caroline
AU - Richards, Donald
ID - 1208
IS - 4
JF - Journal of the Royal Statistical Society. Series B: Statistical Methodology
SN - 13697412
TI - Maximum likelihood estimation for linear Gaussian covariance models
VL - 79
ER -
TY - JOUR
AB - Systems such as fluid flows in channels and pipes or the complex Ginzburg–Landau system, defined over periodic domains, exhibit both continuous symmetries, translational and rotational, as well as discrete symmetries under spatial reflections or complex conjugation. The simplest, and very common symmetry of this type is the equivariance of the defining equations under the orthogonal group O(2). We formulate a novel symmetry reduction scheme for such systems by combining the method of slices with invariant polynomial methods, and show how it works by applying it to the Kuramoto–Sivashinsky system in one spatial dimension. As an example, we track a relative periodic orbit through a sequence of bifurcations to the onset of chaos. Within the symmetry-reduced state space we are able to compute and visualize the unstable manifolds of relative periodic orbits, their torus bifurcations, a transition to chaos via torus breakdown, and heteroclinic connections between various relative periodic orbits. It would be very hard to carry through such analysis in the full state space, without a symmetry reduction such as the one we present here.
AU - Budanur, Nazmi B
AU - Cvitanović, Predrag
ID - 1211
IS - 3-4
JF - Journal of Statistical Physics
TI - Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system
VL - 167
ER -
TY - CHAP
AB - Bacterial cytokinesis is commonly initiated by the Z-ring, a dynamic cytoskeletal structure that assembles at the site of division. Its primary component is FtsZ, a tubulin-like GTPase, that like its eukaryotic relative forms protein filaments in the presence of GTP. Since the discovery of the Z-ring 25 years ago, various models for the role of FtsZ have been suggested. However, important information about the architecture and dynamics of FtsZ filaments during cytokinesis is still missing. One reason for this lack of knowledge has been the small size of bacteria, which has made it difficult to resolve the orientation and dynamics of individual FtsZ filaments in the Z-ring. While superresolution microscopy experiments have helped to gain more information about the organization of the Z-ring in the dividing cell, they were not yet able to elucidate a mechanism of how FtsZ filaments reorganize during assembly and disassembly of the Z-ring. In this chapter, we explain how to use an in vitro reconstitution approach to investigate the self-organization of FtsZ filaments recruited to a biomimetic lipid bilayer by its membrane anchor FtsA. We show how to perform single-molecule experiments to study the behavior of individual FtsZ monomers during the constant reorganization of the FtsZ-FtsA filament network. We describe how to analyze the dynamics of single molecules and explain why this information can help to shed light onto possible mechanism of Z-ring constriction. We believe that similar experimental approaches will be useful to study the mechanism of membrane-based polymerization of other cytoskeletal systems, not only from prokaryotic but also eukaryotic origin.
AU - Baranova, Natalia
AU - Loose, Martin
ED - Echard, Arnaud
ID - 1213
SN - 0091679X
T2 - Cytokinesis
TI - Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA copolymers
VL - 137
ER -
TY - JOUR
AB - The Leidenfrost effect occurs when an object near a hot surface vaporizes rapidly enough to lift itself up and hover. Although well understood for liquids and stiff sublimable solids, nothing is known about the effect with materials whose stiffness lies between these extremes. Here we introduce a new phenomenon that occurs with vaporizable soft solids - the elastic Leidenfrost effect. By dropping hydrogel spheres onto hot surfaces we find that, rather than hovering, they energetically bounce several times their diameter for minutes at a time. With high-speed video during a single impact, we uncover high-frequency microscopic gap dynamics at the sphere/substrate interface. We show how these otherwise-hidden agitations constitute work cycles that harvest mechanical energy from the vapour and sustain the bouncing. Our findings suggest a new strategy for injecting mechanical energy into a widely used class of soft materials, with potential relevance to fields such as active matter, soft robotics and microfluidics.
AU - Waitukaitis, Scott R
AU - Zuiderwijk, Antal
AU - Souslov, Anton
AU - Coulais, Corentin
AU - Van Hecke, Martin
ID - 123
IS - 11
JF - Nature Physics
TI - Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing
VL - 13
ER -
TY - JOUR
AB - We study controller synthesis problems for finite-state Markov decision processes, where the objective is to optimize the expected mean-payoff performance and stability (also known as variability in the literature). We argue that the basic notion of expressing the stability using the statistical variance of the mean payoff is sometimes insufficient, and propose an alternative definition. We show that a strategy ensuring both the expected mean payoff and the variance below given bounds requires randomization and memory, under both the above definitions. We then show that the problem of finding such a strategy can be expressed as a set of constraints.
AU - Brázdil, Tomáš
AU - Chatterjee, Krishnendu
AU - Forejt, Vojtěch
AU - Kučera, Antonín
ID - 1294
JF - Journal of Computer and System Sciences
TI - Trading performance for stability in Markov decision processes
VL - 84
ER -
TY - JOUR
AB - Evolutionary algorithms (EAs) form a popular optimisation paradigm inspired by natural evolution. In recent years the field of evolutionary computation has developed a rigorous analytical theory to analyse the runtimes of EAs on many illustrative problems. Here we apply this theory to a simple model of natural evolution. In the Strong Selection Weak Mutation (SSWM) evolutionary regime the time between occurrences of new mutations is much longer than the time it takes for a mutated genotype to take over the population. In this situation, the population only contains copies of one genotype and evolution can be modelled as a stochastic process evolving one genotype by means of mutation and selection between the resident and the mutated genotype. The probability of accepting the mutated genotype then depends on the change in fitness. We study this process, SSWM, from an algorithmic perspective, quantifying its expected optimisation time for various parameters and investigating differences to a similar evolutionary algorithm, the well-known (1+1) EA. We show that SSWM can have a moderate advantage over the (1+1) EA at crossing fitness valleys and study an example where SSWM outperforms the (1+1) EA by taking advantage of information on the fitness gradient.
AU - Paixao, Tiago
AU - Pérez Heredia, Jorge
AU - Sudholt, Dirk
AU - Trubenova, Barbora
ID - 1336
IS - 2
JF - Algorithmica
SN - 01784617
TI - Towards a runtime comparison of natural and artificial evolution
VL - 78
ER -
TY - JOUR
AB - We consider the local eigenvalue distribution of large self-adjoint N×N random matrices H=H∗ with centered independent entries. In contrast to previous works the matrix of variances sij=\mathbbmE|hij|2 is not assumed to be stochastic. Hence the density of states is not the Wigner semicircle law. Its possible shapes are described in the companion paper (Ajanki et al. in Quadratic Vector Equations on the Complex Upper Half Plane. arXiv:1506.05095). We show that as N grows, the resolvent, G(z)=(H−z)−1, converges to a diagonal matrix, diag(m(z)), where m(z)=(m1(z),…,mN(z)) solves the vector equation −1/mi(z)=z+∑jsijmj(z) that has been analyzed in Ajanki et al. (Quadratic Vector Equations on the Complex Upper Half Plane. arXiv:1506.05095). We prove a local law down to the smallest spectral resolution scale, and bulk universality for both real symmetric and complex hermitian symmetry classes.
AU - Ajanki, Oskari H
AU - Erdös, László
AU - Krüger, Torben H
ID - 1337
IS - 3-4
JF - Probability Theory and Related Fields
SN - 01788051
TI - Universality for general Wigner-type matrices
VL - 169
ER -
TY - JOUR
AB - We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedure inserts synchronization to ensure that the final program works even with a preemptive scheduler. The correctness specification is implicit, inferred from the non-preemptive behavior. Let us consider sequences of calls that the program makes to an external interface. The specification requires that any such sequence produced under a preemptive scheduler should be included in the set of sequences produced under a non-preemptive scheduler. We guarantee that our synthesis does not introduce deadlocks and that the synchronization inserted is optimal w.r.t. a given objective function. The solution is based on a finitary abstraction, an algorithm for bounded language inclusion modulo an independence relation, and generation of a set of global constraints over synchronization placements. Each model of the global constraints set corresponds to a correctness-ensuring synchronization placement. The placement that is optimal w.r.t. the given objective function is chosen as the synchronization solution. We apply the approach to device-driver programming, where the driver threads call the software interface of the device and the API provided by the operating system. Our experiments demonstrate that our synthesis method is precise and efficient. The implicit specification helped us find one concurrency bug previously missed when model-checking using an explicit, user-provided specification. We implemented objective functions for coarse-grained and fine-grained locking and observed that different synchronization placements are produced for our experiments, favoring a minimal number of synchronization operations or maximum concurrency, respectively.
AU - Cerny, Pavol
AU - Clarke, Edmund
AU - Henzinger, Thomas A
AU - Radhakrishna, Arjun
AU - Ryzhyk, Leonid
AU - Samanta, Roopsha
AU - Tarrach, Thorsten
ID - 1338
IS - 2-3
JF - Formal Methods in System Design
TI - From non-preemptive to preemptive scheduling using synchronization synthesis
VL - 50
ER -
TY - JOUR
AB - The behaviour of gene regulatory networks (GRNs) is typically analysed using simulation-based statistical testing-like methods. In this paper, we demonstrate that we can replace this approach by a formal verification-like method that gives higher assurance and scalability. We focus on Wagner’s weighted GRN model with varying weights, which is used in evolutionary biology. In the model, weight parameters represent the gene interaction strength that may change due to genetic mutations. For a property of interest, we synthesise the constraints over the parameter space that represent the set of GRNs satisfying the property. We experimentally show that our parameter synthesis procedure computes the mutational robustness of GRNs—an important problem of interest in evolutionary biology—more efficiently than the classical simulation method. We specify the property in linear temporal logic. We employ symbolic bounded model checking and SMT solving to compute the space of GRNs that satisfy the property, which amounts to synthesizing a set of linear constraints on the weights.
AU - Giacobbe, Mirco
AU - Guet, Calin C
AU - Gupta, Ashutosh
AU - Henzinger, Thomas A
AU - Paixao, Tiago
AU - Petrov, Tatjana
ID - 1351
IS - 8
JF - Acta Informatica
SN - 00015903
TI - Model checking the evolution of gene regulatory networks
VL - 54
ER -
TY - JOUR
AB - One of the major challenges in physically based modelling is making simulations efficient. Adaptive models provide an essential solution to these efficiency goals. These models are able to self-adapt in space and time, attempting to provide the best possible compromise between accuracy and speed. This survey reviews the adaptive solutions proposed so far in computer graphics. Models are classified according to the strategy they use for adaptation, from time-stepping and freezing techniques to geometric adaptivity in the form of structured grids, meshes and particles. Applications range from fluids, through deformable bodies, to articulated solids.
AU - Manteaux, Pierre
AU - Wojtan, Christopher J
AU - Narain, Rahul
AU - Redon, Stéphane
AU - Faure, François
AU - Cani, Marie
ID - 1367
IS - 6
JF - Computer Graphics Forum
SN - 01677055
TI - Adaptive physically based models in computer graphics
VL - 36
ER -
TY - JOUR
AB - We consider the problem of computing the set of initial states of a dynamical system such that there exists a control strategy to ensure that the trajectories satisfy a temporal logic specification with probability 1 (almost-surely). We focus on discrete-time, stochastic linear dynamics and specifications given as formulas of the Generalized Reactivity(1) fragment of Linear Temporal Logic over linear predicates in the states of the system. We propose a solution based on iterative abstraction-refinement, and turn-based 2-player probabilistic games. While the theoretical guarantee of our algorithm after any finite number of iterations is only a partial solution, we show that if our algorithm terminates, then the result is the set of all satisfying initial states. Moreover, for any (partial) solution our algorithm synthesizes witness control strategies to ensure almost-sure satisfaction of the temporal logic specification. While the proposed algorithm guarantees progress and soundness in every iteration, it is computationally demanding. We offer an alternative, more efficient solution for the reachability properties that decomposes the problem into a series of smaller problems of the same type. All algorithms are demonstrated on an illustrative case study.
AU - Svoreňová, Mária
AU - Kretinsky, Jan
AU - Chmelik, Martin
AU - Chatterjee, Krishnendu
AU - Cěrná, Ivana
AU - Belta, Cǎlin
ID - 1407
IS - 2
JF - Nonlinear Analysis: Hybrid Systems
TI - Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
VL - 23
ER -
TY - CONF
AB - We study probabilistic models of natural images and extend the autoregressive family of PixelCNN models by incorporating latent variables. Subsequently, we describe two new generative image models that exploit different image transformations as latent variables: a quantized grayscale view of the image or a multi-resolution image pyramid. The proposed models tackle two known shortcomings of existing PixelCNN models: 1) their tendency to focus on low-level image details, while largely ignoring high-level image information, such as object shapes, and 2) their computationally costly procedure for image sampling. We experimentally demonstrate benefits of our LatentPixelCNN models, in particular showing that they produce much more realistically looking image samples than previous state-of-the-art probabilistic models.
AU - Kolesnikov, Alexander
AU - Lampert, Christoph
ID - 1000
SN - 978-151085514-4
T2 - 34th International Conference on Machine Learning
TI - PixelCNN models with auxiliary variables for natural image modeling
VL - 70
ER -
TY - CONF
AB - We present a computational approach for designing CurveUps, curvy shells that form from an initially flat state. They consist of small rigid tiles that are tightly held together by two pre-stretched elastic sheets attached to them. Our method allows the realization of smooth, doubly curved surfaces that can be fabricated as a flat piece. Once released, the restoring forces of the pre-stretched sheets support the object to take shape in 3D. CurveUps are structurally stable in their target configuration. The design process starts with a target surface. Our method generates a tile layout in 2D and optimizes the distribution, shape, and attachment areas of the tiles to obtain a configuration that is fabricable and in which the curved up state closely matches the target. Our approach is based on an efficient approximate model and a local optimization strategy for an otherwise intractable nonlinear optimization problem. We demonstrate the effectiveness of our approach for a wide range of shapes, all realized as physical prototypes.
AU - Guseinov, Ruslan
AU - Miguel, Eder
AU - Bickel, Bernd
ID - 1001
IS - 4
TI - CurveUps: Shaping objects from flat plates with tension-actuated curvature
VL - 36
ER -
TY - CONF
AB - We present an interactive design system to create functional mechanical objects. Our computational approach allows novice users to retarget an existing mechanical template to a user-specified input shape. Our proposed representation for a mechanical template encodes a parameterized mechanism, mechanical constraints that ensure a physically valid configuration, spatial relationships of mechanical parts to the user-provided shape, and functional constraints that specify an intended functionality. We provide an intuitive interface and optimization-in-the-loop approach for finding a valid configuration of the mechanism and the shape to ensure that higher-level functional goals are met. Our algorithm interactively optimizes the mechanism while the user manipulates the placement of mechanical components and the shape. Our system allows users to efficiently explore various design choices and to synthesize customized mechanical objects that can be fabricated with rapid prototyping technologies. We demonstrate the efficacy of our approach by retargeting various mechanical templates to different shapes and fabricating the resulting functional mechanical objects.
AU - Zhang, Ran
AU - Auzinger, Thomas
AU - Ceylan, Duygu
AU - Li, Wilmot
AU - Bickel, Bernd
ID - 1002
IS - 4
SN - 07300301
TI - Functionality-aware retargeting of mechanisms to 3D shapes
VL - 36
ER -
TY - CONF
AB - Network games (NGs) are played on directed graphs and are extensively used in network design and analysis. Search problems for NGs include finding special strategy profiles such as a Nash equilibrium and a globally optimal solution. The networks modeled by NGs may be huge. In formal verification, abstraction has proven to be an extremely effective technique for reasoning about systems with big and even infinite state spaces. We describe an abstraction-refinement methodology for reasoning about NGs. Our methodology is based on an abstraction function that maps the state space of an NG to a much smaller state space. We search for a global optimum and a Nash equilibrium by reasoning on an under- and an overapproximation defined on top of this smaller state space. When the approximations are too coarse to find such profiles, we refine the abstraction function. Our experimental results demonstrate the efficiency of the methodology.
AU - Avni, Guy
AU - Guha, Shibashis
AU - Kupferman, Orna
ID - 1003
SN - 10450823
TI - An abstraction-refinement methodology for reasoning about network games
ER -
TY - JOUR
AB - The fundamental tasks of the root system are, besides anchoring, mediating interactions between plant and soil and providing the plant with water and nutrients. The architecture of the root system is controlled by endogenous mechanisms that constantly integrate environmental signals, such as availability of nutrients and water. Extremely important for efficient soil exploitation and survival under less favorable conditions is the developmental flexibility of the root system that is largely determined by its postembryonic branching capacity. Modulation of initiation and outgrowth of lateral roots provides roots with an exceptional plasticity, allows optimal adjustment to underground heterogeneity, and enables effective soil exploitation and use of resources. Here we discuss recent advances in understanding the molecular mechanisms that shape the plant root system and integrate external cues to adapt to the changing environment.
AU - Ötvös, Krisztina
AU - Benková, Eva
ID - 1004
JF - Current Opinion in Genetics & Development
SN - 0959437X
TI - Spatiotemporal mechanisms of root branching
VL - 45
ER -
TY - JOUR
AB - Background: The phenomenon of immune priming, i.e. enhanced protection following a secondary exposure to a pathogen, has now been demonstrated in a wide range of invertebrate species. Despite accumulating phenotypic evidence, knowledge of its mechanistic underpinnings is currently very limited. Here we used the system of the red flour beetle, Tribolium castaneum and the insect pathogen Bacillus thuringiensis (Bt) to further our molecular understanding of the oral immune priming phenomenon. We addressed how ingestion of bacterial cues (derived from spore supernatants) of an orally pathogenic and non-pathogenic Bt strain affects gene expression upon later challenge exposure, using a whole-transcriptome sequencing approach. Results: Whereas gene expression of individuals primed with the orally non-pathogenic strain showed minor changes to controls, we found that priming with the pathogenic strain induced regulation of a large set of distinct genes, many of which are known immune candidates. Intriguingly, the immune repertoire activated upon priming and subsequent challenge qualitatively differed from the one mounted upon infection with Bt without previous priming. Moreover, a large subset of priming-specific genes showed an inverse regulation compared to their regulation upon challenge only. Conclusions: Our data demonstrate that gene expression upon infection is strongly affected by previous immune priming. We hypothesise that this shift in gene expression indicates activation of a more targeted and efficient response towards a previously encountered pathogen, in anticipation of potential secondary encounter.
AU - Greenwood, Jenny
AU - Milutinovic, Barbara
AU - Peuß, Robert
AU - Behrens, Sarah
AU - Essar, Daniela
AU - Rosenstiel, Philip
AU - Schulenburg, Hinrich
AU - Kurtz, Joachim
ID - 1006
IS - 1
JF - BMC Genomics
SN - 14712164
TI - Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae
VL - 18
ER -
TY - JOUR
AB - A nonlinear system possesses an invariance with respect to a set of transformations if its output dynamics remain invariant when transforming the input, and adjusting the initial condition accordingly. Most research has focused on invariances with respect to time-independent pointwise transformations like translational-invariance (u(t) -> u(t) + p, p in R) or scale-invariance (u(t) -> pu(t), p in R>0). In this article, we introduce the concept of s0-invariances with respect to continuous input transformations exponentially growing/decaying over time. We show that s0-invariant systems not only encompass linear time-invariant (LTI) systems with transfer functions having an irreducible zero at s0 in R, but also that the input/output relationship of nonlinear s0-invariant systems possesses properties well known from their linear counterparts. Furthermore, we extend the concept of s0-invariances to second- and higher-order s0-invariances, corresponding to invariances with respect to transformations of the time-derivatives of the input, and encompassing LTI systems with zeros of multiplicity two or higher. Finally, we show that nth-order 0-invariant systems realize – under mild conditions – nth-order nonlinear differential operators: when excited by an input of a characteristic functional form, the system’s output converges to a constant value only depending on the nth (nonlinear) derivative of the input.
AU - Lang, Moritz
AU - Sontag, Eduardo
ID - 1007
JF - Automatica
SN - 00051098
TI - Zeros of nonlinear systems with input invariances
VL - 81C
ER -
TY - CONF
AB - A standard objective in partially-observable Markov decision processes (POMDPs) is to find a policy that maximizes the expected discounted-sum payoff. However, such policies may still permit unlikely but highly undesirable outcomes, which is problematic especially in safety-critical applications. Recently, there has been a surge of interest in POMDPs where the goal is to maximize the probability to ensure that the payoff is at least a given threshold, but these approaches do not consider any optimization beyond satisfying this threshold constraint. In this work we go beyond both the “expectation” and “threshold” approaches and consider a “guaranteed payoff optimization (GPO)” problem for POMDPs, where we are given a threshold t and the objective is to find a policy σ such that a) each possible outcome of σ yields a discounted-sum payoff of at least t, and b) the expected discounted-sum payoff of σ is optimal (or near-optimal) among all policies satisfying a). We present a practical approach to tackle the GPO problem and evaluate it on standard POMDP benchmarks.
AU - Chatterjee, Krishnendu
AU - Novotny, Petr
AU - Pérez, Guillermo
AU - Raskin, Jean
AU - Zikelic, Djordje
ID - 1009
T2 - Proceedings of the 31st AAAI Conference on Artificial Intelligence
TI - Optimizing expectation with guarantees in POMDPs
VL - 5
ER -
TY - JOUR
AB - We prove a local law in the bulk of the spectrum for random Gram matrices XX∗, a generalization of sample covariance matrices, where X is a large matrix with independent, centered entries with arbitrary variances. The limiting eigenvalue density that generalizes the Marchenko-Pastur law is determined by solving a system of nonlinear equations. Our entrywise and averaged local laws are on the optimal scale with the optimal error bounds. They hold both in the square case (hard edge) and in the properly rectangular case (soft edge). In the latter case we also establish a macroscopic gap away from zero in the spectrum of XX∗.
AU - Alt, Johannes
AU - Erdös, László
AU - Krüger, Torben H
ID - 1010
JF - Electronic Journal of Probability
SN - 10836489
TI - Local law for random Gram matrices
VL - 22
ER -
TY - CONF
AB - Pushdown systems (PDSs) and recursive state machines (RSMs), which are linearly equivalent, are standard models for interprocedural analysis. Yet RSMs are more convenient as they (a) explicitly model function calls and returns, and (b) specify many natural parameters for algorithmic analysis, e.g., the number of entries and exits. We consider a general framework where RSM transitions are labeled from a semiring and path properties are algebraic with semiring operations, which can model, e.g., interprocedural reachability and dataflow analysis problems. Our main contributions are new algorithms for several fundamental problems. As compared to a direct translation of RSMs to PDSs and the best-known existing bounds of PDSs, our analysis algorithm improves the complexity for finite-height semirings (that subsumes reachability and standard dataflow properties). We further consider the problem of extracting distance values from the representation structures computed by our algorithm, and give efficient algorithms that distinguish the complexity of a one-time preprocessing from the complexity of each individual query. Another advantage of our algorithm is that our improvements carry over to the concurrent setting, where we improve the bestknown complexity for the context-bounded analysis of concurrent RSMs. Finally, we provide a prototype implementation that gives a significant speed-up on several benchmarks from the SLAM/SDV project.
AU - Chatterjee, Krishnendu
AU - Kragl, Bernhard
AU - Mishra, Samarth
AU - Pavlogiannis, Andreas
ED - Yang, Hongseok
ID - 1011
SN - 03029743
TI - Faster algorithms for weighted recursive state machines
VL - 10201
ER -
TY - JOUR
AU - Vahid Belarghou, Afshin
AU - Šarić, Anđela
AU - Idema, Timon
ID - 10126
IS - 3
JF - Biophysical Journal
KW - biophysics
SN - 0006-3495
TI - Curvature mediated interactions in highly curved membranes
VL - 112
ER -
TY - JOUR
AB - We consider the large-scale regularity of solutions to second-order linear elliptic equations with random coefficient fields. In contrast to previous works on regularity theory for random elliptic operators, our interest is in the regularity at the boundary: We consider problems posed on the half-space with homogeneous Dirichlet boundary conditions and derive an associated C1,α-type large-scale regularity theory in the form of a corresponding decay estimate for the homogenization-adapted tilt-excess. This regularity theory entails an associated Liouville-type theorem. The results are based on the existence of homogenization correctors adapted to the half-space setting, which we construct-by an entirely deterministic argument-as a modification of the homogenization corrector on the whole space. This adaption procedure is carried out inductively on larger scales, crucially relying on the regularity theory already established on smaller scales.
AU - Fischer, Julian L
AU - Raithel, Claudia
ID - 1014
IS - 1
JF - SIAM Journal on Mathematical Analysis
SN - 00361410
TI - Liouville principles and a large-scale regularity theory for random elliptic operators on the half-space
VL - 49
ER -
TY - JOUR
AB - Vortices are commonly observed in the context of classical hydrodynamics: from whirlpools after stirring the coffee in a cup to a violent atmospheric phenomenon such as a tornado, all classical vortices are characterized by an arbitrary circulation value of the local velocity field. On the other hand the appearance of vortices with quantized circulation represents one of the fundamental signatures of macroscopic quantum phenomena. In two-dimensional superfluids quantized vortices play a key role in determining finite-temperature properties, as the superfluid phase and the normal state are separated by a vortex unbinding transition, the Berezinskii-Kosterlitz-Thouless transition. Very recent experiments with two-dimensional superfluid fermions motivate the present work: we present theoretical results based on the renormalization group showing that the universal jump of the superfluid density and the critical temperature crucially depend on the interaction strength, providing a strong benchmark for forthcoming investigations.
AU - Bighin, Giacomo
AU - Salasnich, Luca
ID - 1015
JF - Scientific Reports
SN - 20452322
TI - Vortices and antivortices in two-dimensional ultracold Fermi gases
VL - 7
ER -
TY - JOUR
AB - The integrity and dynamic properties of the microtubule cytoskeleton are indispensable for the development of the mammalian brain. Consequently, mutations in the genes that encode the structural component (the α/β-tubulin heterodimer) can give rise to severe, sporadic neurodevelopmental disorders. These are commonly referred to as the tubulinopathies. Here we report the addition of recessive quadrupedalism, also known as Uner Tan syndrome (UTS), to the growing list of diseases caused by tubulin variants. Analysis of a consanguineous UTS family identified a biallelic TUBB2B mutation, resulting in a p.R390Q amino acid substitution. In addition to the identifying quadrupedal locomotion, all three patients showed severe cerebellar hypoplasia. None, however, displayed the basal ganglia malformations typically associated with TUBB2B mutations. Functional analysis of the R390Q substitution revealed that it did not affect the ability of β-tubulin to fold or become assembled into the α/β-heterodimer, nor did it influence the incorporation of mutant-containing heterodimers into microtubule polymers. The 390Q mutation in S. cerevisiae TUB2 did not affect growth under basal conditions, but did result in increased sensitivity to microtubule-depolymerizing drugs, indicative of a mild impact of this mutation on microtubule function. The TUBB2B mutation described here represents an unusual recessive mode of inheritance for missense-mediated tubulinopathies and reinforces the sensitivity of the developing cerebellum to microtubule defects.
AU - Breuss, Martin
AU - Nguyen, Thai
AU - Srivatsan, Anjana
AU - Leca, Ines
AU - Tian, Guoling
AU - Fritz, Tanja
AU - Hansen, Andi H
AU - Musaev, Damir
AU - Mcevoy Venneri, Jennifer
AU - Kiely, James
AU - Rosti, Rasim
AU - Scott, Eric
AU - Tan, Uner
AU - Kolodner, Richard
AU - Cowan, Nicholas
AU - Keays, David
AU - Gleeson, Joseph
ID - 1016
IS - 2
JF - Human Molecular Genetics
SN - 09646906
TI - Uner Tan syndrome caused by a homozygous TUBB2B mutation affecting microtubule stability
VL - 26
ER -
TY - JOUR
AB - The development of the vertebrate central nervous system is reliant on a complex cascade of biological processes that include mitotic division, relocation of migrating neurons, and the extension of dendritic and axonal processes. Each of these cellular events requires the diverse functional repertoire of the microtubule cytoskeleton for the generation of forces, assembly of macromolecular complexes and transport of molecules and organelles. The tubulins are a multi-gene family that encode for the constituents of microtubules, and have been implicated in a spectrum of neurological disorders. Evidence is building that different tubulins tune the functional properties of the microtubule cytoskeleton dependent on the cell type, developmental profile and subcellular localisation. Here we review of the origins of the functional specification of the tubulin gene family in the developing brain at a transcriptional, translational, and post-transcriptional level. We remind the reader that tubulins are not just loading controls for your average Western blot.
AU - Breuss, Martin
AU - Leca, Ines
AU - Gstrein, Thomas
AU - Hansen, Andi H
AU - Keays, David
ID - 1017
JF - Molecular and Cellular Neuroscience
SN - 10447431
TI - Tubulins and brain development: The origins of functional specification
VL - 84
ER -
TY - JOUR
AB - We study periodic homogenization by Γ-convergence of integral functionals with integrands W(x,ξ) having no polynomial growth and which are both not necessarily continuous with respect to the space variable and not necessarily convex with respect to the matrix variable. This allows to deal with homogenization of composite hyperelastic materials consisting of two or more periodic components whose the energy densities tend to infinity as the volume of matter tends to zero, i.e., W(x,ξ)=∑j∈J1Vj(x)Hj(ξ) where {Vj}j∈J is a finite family of open disjoint subsets of RN, with |∂Vj|=0 for all j∈J and ∣∣RN∖⋃j∈JVj|=0, and, for each j∈J, Hj(ξ)→∞ as detξ→0. In fact, our results apply to integrands of type W(x,ξ)=a(x)H(ξ) when H(ξ)→∞ as detξ→0 and a∈L∞(RN;[0,∞[) is 1-periodic and is either continuous almost everywhere or not continuous. When a is not continuous, we obtain a density homogenization formula which is a priori different from the classical one by Braides–Müller. Although applications to hyperelasticity are limited due to the fact that our framework is not consistent with the constraint of noninterpenetration of the matter, our results can be of technical interest to analysis of homogenization of integral functionals.
AU - Anza Hafsa, Omar
AU - Clozeau, Nicolas
AU - Mandallena, Jean-Philippe
ID - 10175
IS - 2
JF - Annales mathématiques Blaise Pascal
SN - 1259-1734
TI - Homogenization of nonconvex unbounded singular integrals
VL - 24
ER -
TY - JOUR
AB - In plants, the multistep phosphorelay (MSP) pathway mediates a range of regulatory processes, including those activated by cytokinins. The crosstalk between cytokinin response and light is known for a long time. However, the molecular mechanism underlying the interactionbetween light and cytokinin signaling remains elusive. In the screen for upstream regulators we identified a LONG PALE HYPOCOTYL (LPH) gene whose activity is indispensable for spatiotemporally correct expression of CYTOKININ INDEPENDENT-1 (CKI1), encoding the constitutively active sensor histidine kinase that activates MSP signaling. lph is a new allele of HEME OXYGENASE 1 (HY1) which encodes the key protein in the biosynthesis of phytochromobilin, a cofactor of photoconvertiblephytochromes. Our analysis confirmed the light-dependent regulation oftheCKI1 expression pattern. We show that CKI1 expression is under the control of phytochrome A (phyA), functioning as a dual (both positive and negative) regulator of CKI1 expression, presumably via the phyA-regulated transcription factors PHYTOCHROME INTERACTING FACTOR 3 (PIF3) and CIRCADIAN CLOCK ASSOCIATED 1 (CCA1). Changes in CKI1 expression observed in lph/hy1-7 and phy mutants correlatewithmisregulation of MSP signaling, changedcytokinin sensitivity and developmental aberrations,previously shown to be associated with cytokinin and/or CKI1 action. Besides that, we demonstrate novel role of phyA-dependent CKI1 expression in the hypocotyl elongation and hook development during skotomorphogenesis. Based on these results, we propose that the light-dependent regulation of CKI1 provides a plausible mechanistic link underlying the well-known interaction between light- and cytokinin-controlled plant development.
AU - Dobisova, Tereza
AU - Hrdinova, Vendula
AU - Cuesta, Candela
AU - Michlickova, Sarka
AU - Urbankova, Ivana
AU - Hejatkova, Romana
AU - Zadnikova, Petra
AU - Pernisová, Markéta
AU - Benková, Eva
AU - Hejátko, Jan
ID - 1018
IS - 1
JF - Plant Physiology
TI - Light regulated expression of sensor histidine kinase CKI1 controls cytokinin related development
VL - 174
ER -
TY - JOUR
AB - As a consequence of its difference in copy number between males and females, the X chromosome is subject to unique evolutionary forces and gene regulatory mechanisms. Previous studies of Drosophila melanogaster have shown that the expression of X-linked, testis-specific reporter genes is suppressed in the male germline. However, it is not known whether this phenomenon is restricted to testis-expressed genes or if it is a more general property of genes with tissue-specific expression, which are also underrepresented on the X chromosome. To test this, we compared the expression of three tissue-specific reporter genes (ovary, accessory gland and Malpighian tubule) inserted at various autosomal and X-chromosomal locations. In contrast to testis-specific reporter genes, we found no reduction of X-linked expression in any of the other tissues. In accessory gland and Malpighian tubule, we detected higher expression of the X-linked reporter genes, which suggests that they are at least partially dosage compensated. We found no difference in the tissue-specificity of X-linked and autosomal reporter genes. These findings indicate that, in general, the X chromosome is not a detrimental environment for tissue-specific gene expression and that the suppression of X-linked expression is limited to the male germline.
AU - Argyridou, Eliza
AU - Huylmans, Ann K
AU - Königer, Annabella
AU - Parsch, John
ID - 1019
IS - 1
JF - Heredity
SN - 0018067X
TI - X-linkage is not a general inhibitor of tissue-specific gene expression in Drosophila melanogaster
VL - 119
ER -
TY - JOUR
AB - Cellulose is the most abundant biopolymer on Earth. Cellulose fibers, such as the one extracted form cotton or woodpulp, have been used by humankind for hundreds of years to make textiles and paper. Here we show how, by engineering light-matter interaction, we can optimize light scattering using exclusively cellulose nanocrystals. The produced material is sustainable, biocompatible, and when compared to ordinary microfiber-based paper, it shows enhanced scattering strength (×4), yielding a transport mean free path as low as 3.5 μm in the visible light range. The experimental results are in a good agreement with the theoretical predictions obtained with a diffusive model for light propagation.
AU - Caixeiro, Soraya
AU - Peruzzo, Matilda
AU - Onelli, Olimpia
AU - Vignolini, Silvia
AU - Sapienza, Riccardo
ID - 1020
IS - 9
JF - ACS Applied Materials and Interfaces
SN - 19448244
TI - Disordered cellulose based nanostructures for enhanced light scattering
VL - 9
ER -
TY - JOUR
AB - Most flows in nature and engineering are turbulent because of their large velocities and spatial scales. Laboratory experiments on rotating quasi-Keplerian flows, for which the angular velocity decreases radially but the angular momentum increases, are however laminar at Reynolds numbers exceeding one million. This is in apparent contradiction to direct numerical simulations showing that in these experiments turbulence transition is triggered by the axial boundaries. We here show numerically that as the Reynolds number increases, turbulence becomes progressively confined to the boundary layers and the flow in the bulk fully relaminarizes. Our findings support that turbulence is unlikely to occur in isothermal constant-density quasi-Keplerian flows.
AU - Lopez Alonso, Jose M
AU - Avila, Marc
ID - 1021
JF - Journal of Fluid Mechanics
SN - 00221120
TI - Boundary layer turbulence in experiments on quasi Keplerian flows
VL - 817
ER -
TY - JOUR
AB - We introduce a multiscale topological description of the Megaparsec web-like cosmic matter distribution. Betti numbers and topological persistence offer a powerful means of describing the rich connectivity structure of the cosmic web and of its multiscale arrangement of matter and galaxies. Emanating from algebraic topology and Morse theory, Betti numbers and persistence diagrams represent an extension and deepening of the cosmologically familiar topological genus measure and the related geometric Minkowski functionals. In addition to a description of the mathematical background, this study presents the computational procedure for computing Betti numbers and persistence diagrams for density field filtrations. The field may be computed starting from a discrete spatial distribution of galaxies or simulation particles. The main emphasis of this study concerns an extensive and systematic exploration of the imprint of different web-like morphologies and different levels of multiscale clustering in the corresponding computed Betti numbers and persistence diagrams. To this end, we use Voronoi clustering models as templates for a rich variety of web-like configurations and the fractal-like Soneira-Peebles models exemplify a range of multiscale configurations. We have identified the clear imprint of cluster nodes, filaments, walls, and voids in persistence diagrams, along with that of the nested hierarchy of structures in multiscale point distributions. We conclude by outlining the potential of persistent topology for understanding the connectivity structure of the cosmic web, in large simulations of cosmic structure formation and in the challenging context of the observed galaxy distribution in large galaxy surveys.
AU - Pranav, Pratyush
AU - Edelsbrunner, Herbert
AU - Van De Weygaert, Rien
AU - Vegter, Gert
AU - Kerber, Michael
AU - Jones, Bernard
AU - Wintraecken, Mathijs
ID - 1022
IS - 4
JF - Monthly Notices of the Royal Astronomical Society
SN - 00358711
TI - The topology of the cosmic web in terms of persistent Betti numbers
VL - 465
ER -
TY - JOUR
AB - We consider products of independent square non-Hermitian random matrices. More precisely, let X1,…, Xn be independent N × N random matrices with independent entries (real or complex with independent real and imaginary parts) with zero mean and variance 1/N. Soshnikov-O’Rourke [19] and Götze-Tikhomirov [15] showed that the empirical spectral distribution of the product of n random matrices with iid entries converges to (equation found). We prove that if the entries of the matrices X1,…, Xn are independent (but not necessarily identically distributed) and satisfy uniform subexponential decay condition, then in the bulk the convergence of the ESD of X1,…, Xn to (0.1) holds up to the scale N–1/2+ε.
AU - Nemish, Yuriy
ID - 1023
JF - Electronic Journal of Probability
SN - 10836489
TI - Local law for the product of independent non-Hermitian random matrices with independent entries
VL - 22
ER -
TY - JOUR
AB - Many organ surfaces are covered by a protective epithelial-cell layer. It emerges that such layers are maintained by cell stretching that triggers cell division mediated by the force-sensitive ion-channel protein Piezo1. See Letter p.118
AU - Heisenberg, Carl-Philipp J
ID - 1025
IS - 7643
JF - Nature
SN - 00280836
TI - Cell biology: Stretched divisions
VL - 543
ER -
TY - JOUR
AB - We investigate effects of quasiparticle poisoning in a Majorana island with strong tunnel coupling to normal-metal leads. In addition to the main Coulomb blockade diamonds, "shadow" diamonds appear, shifted by 1e in gate voltage, consistent with transport through an excited (poisoned) state of the island. Comparison to a simple model yields an estimate of parity lifetime for the strongly coupled island (∼1 μs) and sets a bound for a weakly coupled island (>10 μs). Fluctuations in the gate-voltage spacing of Coulomb peaks at high field, reflecting Majorana hybridization, are enhanced by the reduced lever arm at strong coupling. When converted from gate voltage to energy units, fluctuations are consistent with previous measurements.
AU - Albrecht, S M
AU - Hansen, Esben
AU - Higginbotham, Andrew P
AU - Kuemmeth, Ferdinand
AU - Jespersen, Thomas
AU - Nygård, Jesper
AU - Krogstrup, Peter
AU - Danon, Jeroen
AU - Flensberg, Karsten
AU - Marcus, Charles
ID - 103
IS - 13
JF - APS Physics, Physical Review Letters
TI - Transport signatures of quasiparticle poisoning in a majorana island
VL - 118
ER -
TY - JOUR
AB - Auf der Suche nach einem Bibliothekssystem entschied sich die Forschungseinrichtung IST Austria im Jahr 2014 für das Open-Source-Produkt Koha. In einem ersten Schritt wurden zunächst Grundfunktionen aktiviert um im Anschluss diverse zusätzliche Tools zum Einsatz zu bringen. Die große Flexibilität des Systems erlaubt maßgeschneiderte Lösungen für unterschiedlichste Institutionen. Trotz Herausforderungen kann die Bibliothek auf eine erfolgreiche Implementierung zurückblicken.
AU - Villányi, Márton
ID - 1030
IS - 1
JF - Informationspraxis
SN - 2297-3249
TI - Ein freies Bibliothekssystem für wissenschaftliche Bibliotheken – Werkstattbericht der IST Austria Library
VL - 3
ER -
TY - JOUR
AB - Biological membranes have a central role in mediating the organization of membrane-curving proteins, a dynamic process that has proven to be challenging to probe experimentally. Using atomic force microscopy, we capture the hierarchically organized assemblies of Bin/amphiphysin/Rvs (BAR) proteins on supported lipid membranes. Their structure reveals distinct long linear aggregates of proteins, regularly spaced by up to 300 nm. Employing accurate free-energy calculations from large-scale coarse-grained computer simulations, we found that the membrane mediates the interaction among protein filaments as a combination of short- and long-ranged interactions. The long-ranged component acts at strikingly long distances, giving rise to a variety of micron-sized ordered patterns. This mechanism may contribute to the long-ranged spatiotemporal control of membrane remodeling by proteins in the cell.
AU - Simunovic, Mijo
AU - Šarić, Anđela
AU - Henderson, J. Michael
AU - Lee, Ka Yee C.
AU - Voth, Gregory A.
ID - 10369
IS - 12
JF - ACS Central Science
KW - general chemical engineering
KW - general chemistry
SN - 2374-7943
TI - Long-range organization of membrane-curving proteins
VL - 3
ER -
TY - JOUR
AB - Eukaryotic cells are densely packed with macromolecular complexes and intertwining organelles, continually transported and reshaped. Intriguingly, organelles avoid clashing and entangling with each other in such limited space. Mitochondria form extensive networks constantly remodeled by fission and fusion. Here, we show that mitochondrial fission is triggered by mechanical forces. Mechano-stimulation of mitochondria – via encounter with motile intracellular pathogens, via external pressure applied by an atomic force microscope, or via cell migration across uneven microsurfaces – results in the recruitment of the mitochondrial fission machinery, and subsequent division. We propose that MFF, owing to affinity for narrow mitochondria, acts as a membrane-bound force sensor to recruit the fission machinery to mechanically strained sites. Thus, mitochondria adapt to the environment by sensing and responding to biomechanical cues. Our findings that mechanical triggers can be coupled to biochemical responses in membrane dynamics may explain how organelles orderly cohabit in the crowded cytoplasm.
AU - Helle, Sebastian Carsten Johannes
AU - Feng, Qian
AU - Aebersold, Mathias J
AU - Hirt, Luca
AU - Grüter, Raphael R
AU - Vahid, Afshin
AU - Sirianni, Andrea
AU - Mostowy, Serge
AU - Snedeker, Jess G
AU - Šarić, Anđela
AU - Idema, Timon
AU - Zambelli, Tomaso
AU - Kornmann, Benoît
ID - 10370
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 - Mechanical force induces mitochondrial fission
VL - 6
ER -
TY - JOUR
AB - Electric charges are conserved. The same would be expected to hold for magnetic charges, yet magnetic monopoles have never been observed. It is therefore surprising that the laws of nonequilibrium thermodynamics, combined with Maxwell’s equations, suggest that colloidal particles heated or cooled in certain polar or paramagnetic solvents may behave as if they carry an electric/magnetic charge. Here, we present numerical simulations that show that the field distribution around a pair of such heated/cooled colloidal particles agrees quantitatively with the theoretical predictions for a pair of oppositely charged electric or magnetic monopoles. However, in other respects, the nonequilibrium colloidal particles do not behave as monopoles: They cannot be moved by a homogeneous applied field. The numerical evidence for the monopole-like fields around heated/cooled colloidal particles is crucial because the experimental and numerical determination of forces between such colloidal particles would be complicated by the presence of other effects, such as thermophoresis.
AU - Wirnsberger, Peter
AU - Fijan, Domagoj
AU - Lightwood, Roger A.
AU - Šarić, Anđela
AU - Dellago, Christoph
AU - Frenkel, Daan
ID - 10373
IS - 19
JF - Proceedings of the National Academy of Sciences
KW - multidisciplinary
SN - 0027-8424
TI - Numerical evidence for thermally induced monopoles
VL - 114
ER -
TY - JOUR
AB - The formation of filaments from naturally occurring protein molecules is a process at the core of a range of functional and aberrant biological phenomena, such as the assembly of the cytoskeleton or the appearance of aggregates in Alzheimer's disease. The macroscopic behaviour associated with such processes is remarkably diverse, ranging from simple nucleated growth to highly cooperative processes with a well-defined lagtime. Thus, conventionally, different molecular mechanisms have been used to explain the self-assembly of different proteins. Here we show that this range of behaviour can be quantitatively captured by a single unifying Petri net that describes filamentous growth in terms of aggregate number and aggregate mass concentrations. By considering general features associated with a particular network connectivity, we are able to establish directly the rate-determining steps of the overall aggregation reaction from the system's scaling behaviour. We illustrate the power of this framework on a range of different experimental and simulated aggregating systems. The approach is general and will be applicable to any future extensions of the reaction network of filamentous self-assembly.
AU - Meisl, Georg
AU - Rajah, Luke
AU - Cohen, Samuel A. I.
AU - Pfammatter, Manuela
AU - Šarić, Anđela
AU - Hellstrand, Erik
AU - Buell, Alexander K.
AU - Aguzzi, Adriano
AU - Linse, Sara
AU - Vendruscolo, Michele
AU - Dobson, Christopher M.
AU - Knowles, Tuomas P. J.
ID - 10374
IS - 10
JF - Chemical Science
KW - general chemistry
SN - 2041-6520
TI - Scaling behaviour and rate-determining steps in filamentous self-assembly
VL - 8
ER -
TY - JOUR
AB - Cellular membranes exhibit a large variety of shapes, strongly coupled to their function. Many biological processes involve dynamic reshaping of membranes, usually mediated by proteins. This interaction works both ways: while proteins influence the membrane shape, the membrane shape affects the interactions between the proteins. To study these membrane-mediated interactions on closed and anisotropically curved membranes, we use colloids adhered to ellipsoidal membrane vesicles as a model system. We find that two particles on a closed system always attract each other, and tend to align with the direction of largest curvature. Multiple particles form arcs, or, at large enough numbers, a complete ring surrounding the vesicle in its equatorial plane. The resulting vesicle shape resembles a snowman. Our results indicate that these physical interactions on membranes with anisotropic shapes can be exploited by cells to drive macromolecules to preferred regions of cellular or intracellular membranes, and utilized to initiate dynamic processes such as cell division. The same principle could be used to find the midplane of an artificial vesicle, as a first step towards dividing it into two equal parts.
AU - Vahid, Afshin
AU - Šarić, Anđela
AU - Idema, Timon
ID - 10375
IS - 28
JF - Soft Matter
KW - condensed matter physics
KW - general chemistry
SN - 1744-683X
TI - Curvature variation controls particle aggregation on fluid vesicles
VL - 13
ER -
TY - JOUR
AB - A fundamental algorithmic problem at the heart of static analysis is Dyck reachability. The input is a graph where the edges are labeled with different types of opening and closing parentheses, and the reachability information is computed via paths whose parentheses are properly matched. We present new results for Dyck reachability problems with applications to alias analysis and data-dependence analysis. Our main contributions, that include improved upper bounds as well as lower bounds that establish optimality guarantees, are as follows: First, we consider Dyck reachability on bidirected graphs, which is the standard way of performing field-sensitive points-to analysis. Given a bidirected graph with n nodes and m edges, we present: (i) an algorithm with worst-case running time O(m + n · α(n)), where α(n) is the inverse Ackermann function, improving the previously known O(n2) time bound; (ii) a matching lower bound that shows that our algorithm is optimal wrt to worst-case complexity; and (iii) an optimal average-case upper bound of O(m) time, improving the previously known O(m · logn) bound. Second, we consider the problem of context-sensitive data-dependence analysis, where the task is to obtain analysis summaries of library code in the presence of callbacks. Our algorithm preprocesses libraries in almost linear time, after which the contribution of the library in the complexity of the client analysis is only linear, and only wrt the number of call sites. Third, we prove that combinatorial algorithms for Dyck reachability on general graphs with truly sub-cubic bounds cannot be obtained without obtaining sub-cubic combinatorial algorithms for Boolean Matrix Multiplication, which is a long-standing open problem. Thus we establish that the existing combinatorial algorithms for Dyck reachability are (conditionally) optimal for general graphs. We also show that the same hardness holds for graphs of constant treewidth. Finally, we provide a prototype implementation of our algorithms for both alias analysis and data-dependence analysis. Our experimental evaluation demonstrates that the new algorithms significantly outperform all existing methods on the two problems, over real-world benchmarks.
AU - Chatterjee, Krishnendu
AU - Choudhary, Bhavya
AU - Pavlogiannis, Andreas
ID - 10416
IS - POPL
JF - Proceedings of the ACM on Programming Languages
TI - Optimal Dyck reachability for data-dependence and Alias analysis
VL - 2
ER -
TY - JOUR
AB - We present a new dynamic partial-order reduction method for stateless model checking of concurrent programs. A common approach for exploring program behaviors relies on enumerating the traces of the program, without storing the visited states (aka stateless exploration). As the number of distinct traces grows exponentially, dynamic partial-order reduction (DPOR) techniques have been successfully used to partition the space of traces into equivalence classes (Mazurkiewicz partitioning), with the goal of exploring only few representative traces from each class.
We introduce a new equivalence on traces under sequential consistency semantics, which we call the observation equivalence. Two traces are observationally equivalent if every read event observes the same write event in both traces. While the traditional Mazurkiewicz equivalence is control-centric, our new definition is data-centric. We show that our observation equivalence is coarser than the Mazurkiewicz equivalence, and in many cases even exponentially coarser. We devise a DPOR exploration of the trace space, called data-centric DPOR, based on the observation equivalence.
AU - Chalupa, Marek
AU - Chatterjee, Krishnendu
AU - Pavlogiannis, Andreas
AU - Sinha, Nishant
AU - Vaidya, Kapil
ID - 10417
IS - POPL
JF - Proceedings of the ACM on Programming Languages
TI - Data-centric dynamic partial order reduction
VL - 2
ER -
TY - JOUR
AB - We present a new proof rule for proving almost-sure termination of probabilistic programs, including those that contain demonic non-determinism. An important question for a probabilistic program is whether the probability mass of all its diverging runs is zero, that is that it terminates "almost surely". Proving that can be hard, and this paper presents a new method for doing so. It applies directly to the program's source code, even if the program contains demonic choice. Like others, we use variant functions (a.k.a. "super-martingales") that are real-valued and decrease randomly on each loop iteration; but our key innovation is that the amount as well as the probability of the decrease are parametric. We prove the soundness of the new rule, indicate where its applicability goes beyond existing rules, and explain its connection to classical results on denumerable (non-demonic) Markov chains.
AU - Mciver, Annabelle
AU - Morgan, Carroll
AU - Kaminski, Benjamin Lucien
AU - Katoen, Joost P
ID - 10418
IS - POPL
JF - Proceedings of the ACM on Programming Languages
TI - A new proof rule for almost-sure termination
VL - 2
ER -
TY - JOUR
AB - The Ising model is one of the simplest and most famous models of interacting systems. It was originally proposed to model ferromagnetic interactions in statistical physics and is now widely used to model spatial processes in many areas such as ecology, sociology, and genetics, usually without testing its goodness-of-fit. Here, we propose an exact goodness-of-fit test for the finite-lattice Ising model. The theory of Markov bases has been developed in algebraic statistics for exact goodness-of-fit testing using a Monte Carlo approach. However, this beautiful theory has fallen short of its promise for applications, because finding a Markov basis is usually computationally intractable. We develop a Monte Carlo method for exact goodness-of-fit testing for the Ising model which avoids computing a Markov basis and also leads to a better connectivity of the Markov chain and hence to a faster convergence. We show how this method can be applied to analyze the spatial organization of receptors on the cell membrane.
AU - Martin Del Campo Sanchez, Abraham
AU - Cepeda Humerez, Sarah A
AU - Uhler, Caroline
ID - 2016
IS - 2
JF - Scandinavian Journal of Statistics
SN - 03036898
TI - Exact goodness-of-fit testing for the Ising model
VL - 44
ER -
TY - JOUR
AB - We establish the dimension and irreducibility of the moduli space of rational curves (of fixed degree) on arbitrary smooth hypersurfaces of sufficiently low degree. A spreading out argument reduces the problem to hypersurfaces defined over finite fields of large cardinality, which can then be tackled using a function field version of the Hardy-Littlewood circle method, in which particular care is taken to ensure uniformity in the size of the underlying finite field.
AU - Timothy Browning
AU - Vishe, Pankaj
ID - 265
IS - 7
JF - Geometric Methods in Algebra and Number Theory
TI - Rational curves on smooth hypersurfaces of low degree
VL - 11
ER -