TY - JOUR
AB - This special issue of the Journal on Formal Methods in System Design is dedicated to Prof. Helmut Veith, who unexpectedly passed away in March 2016. Helmut Veith was a brilliant researcher, inspiring collaborator, passionate mentor, generous friend, and valued member of the formal methods community. Helmut was not only known for his numerous and influential contributions in the field of automated verification (most prominently his work on Counterexample-Guided Abstraction Refinement [1,2]), but also for his untiring and passionate efforts for the logic community: he co-organized the Vienna Summer of Logic (an event comprising twelve conferences and numerous workshops which attracted thousands of researchers from all over the world), he initiated the Vienna Center for Logic and Algorithms (which promotes international collaboration on logic and algorithms and organizes outreach events such as the LogicLounge), and he coordinated the Doctoral Program on Logical Methods in Computer Science at TU Wien (currently educating more than 40 doctoral students) and a National Research Network on Rigorous Systems Engineering (uniting fifteen researchers in Austria to address the challenge of building reliable and safe computer
systems). With his enthusiasm and commitment, Helmut completely reshaped the Austrian research landscape in the field of logic and verification in his few years as a full professor at TU Wien.
AU - Gottlob, Georg
AU - Henzinger, Thomas A
AU - Weißenbacher, Georg
ID - 743
IS - 2
JF - Formal Methods in System Design
TI - Preface of the special issue in memoriam Helmut Veith
VL - 51
ER -
TY - JOUR
AB - In evolutionary game theory interactions between individuals are often assumed obligatory. However, in many real-life situations, individuals can decide to opt out of an interaction depending on the information they have about the opponent. We consider a simple evolutionary game theoretic model to study such a scenario, where at each encounter between two individuals the type of the opponent (cooperator/defector) is known with some probability, and where each individual either accepts or opts out of the interaction. If the type of the opponent is unknown, a trustful individual accepts the interaction, whereas a suspicious individual opts out of the interaction. If either of the two individuals opt out both individuals remain without an interaction. We show that in the prisoners dilemma optional interactions along with suspicious behaviour facilitates the emergence of trustful cooperation.
AU - Priklopil, Tadeas
AU - Chatterjee, Krishnendu
AU - Nowak, Martin
ID - 744
JF - Journal of Theoretical Biology
SN - 00225193
TI - Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma
VL - 433
ER -
TY - JOUR
AB - Fluid flows in nature and applications are frequently subject to periodic velocity modulations. Surprisingly, even for the generic case of flow through a straight pipe, there is little consensus regarding the influence of pulsation on the transition threshold to turbulence: while most studies predict a monotonically increasing threshold with pulsation frequency (i.e. Womersley number, ), others observe a decreasing threshold for identical parameters and only observe an increasing threshold at low . In the present study we apply recent advances in the understanding of transition in steady shear flows to pulsating pipe flow. For moderate pulsation amplitudes we find that the first instability encountered is subcritical (i.e. requiring finite amplitude disturbances) and gives rise to localized patches of turbulence ('puffs') analogous to steady pipe flow. By monitoring the impact of pulsation on the lifetime of turbulence we map the onset of turbulence in parameter space. Transition in pulsatile flow can be separated into three regimes. At small Womersley numbers the dynamics is dominated by the decay turbulence suffers during the slower part of the cycle and hence transition is delayed significantly. As shown in this regime thresholds closely agree with estimates based on a quasi-steady flow assumption only taking puff decay rates into account. The transition point predicted in the zero limit equals to the critical point for steady pipe flow offset by the oscillation Reynolds number (i.e. the dimensionless oscillation amplitude). In the high frequency limit on the other hand, puff lifetimes are identical to those in steady pipe flow and hence the transition threshold appears to be unaffected by flow pulsation. In the intermediate frequency regime the transition threshold sharply drops (with increasing ) from the decay dominated (quasi-steady) threshold to the steady pipe flow level.
AU - Xu, Duo
AU - Warnecke, Sascha
AU - Song, Baofang
AU - Ma, Xingyu
AU - Hof, Björn
ID - 745
JF - Journal of Fluid Mechanics
SN - 00221120
TI - Transition to turbulence in pulsating pipe flow
VL - 831
ER -
TY - JOUR
AB - Metabotropic glutamate receptor subtype 5 (mGluR5) is crucially implicated in the pathophysiology of Fragile X Syndrome (FXS); however, its dysfunction at the sub-cellular level, and related synaptic and cognitive phenotypes are unexplored. Here, we probed the consequences of mGluR5/Homer scaffold disruption for mGluR5 cell-surface mobility, synaptic N-methyl-D-Aspartate receptor (NMDAR) function, and behavioral phenotypes in the second-generation Fmr1 knockout (KO) mouse. Using single-molecule tracking, we found that mGluR5 was significantly more mobile at synapses in hippocampal Fmr1 KO neurons, causing an increased synaptic surface co-clustering of mGluR5 and NMDAR. This correlated with a reduced amplitude of synaptic NMDAR currents, a lack of their mGluR5-Activated long-Term depression, and NMDAR/hippocampus dependent cognitive deficits. These synaptic and behavioral phenomena were reversed by knocking down Homer1a in Fmr1 KO mice. Our study provides a mechanistic link between changes of mGluR5 dynamics and pathological phenotypes of FXS, unveiling novel targets for mGluR5-based therapeutics.
AU - Aloisi, Elisabetta
AU - Le Corf, Katy
AU - Dupuis, Julien
AU - Zhang, Pei
AU - Ginger, Melanie
AU - Labrousse, Virginie
AU - Spatuzza, Michela
AU - Georg Haberl, Matthias
AU - Costa, Lara
AU - Shigemoto, Ryuichi
AU - Tappe Theodor, Anke
AU - Drago, Fillippo
AU - Vincenzo Piazza, Pier
AU - Mulle, Christophe
AU - Groc, Laurent
AU - Ciranna, Lucia
AU - Catania, Maria
AU - Frick, Andreas
ID - 746
IS - 1
JF - Nature Communications
SN - 20411723
TI - Altered surface mGluR5 dynamics provoke synaptic NMDAR dysfunction and cognitive defects in Fmr1 knockout mice
VL - 8
ER -
TY - JOUR
AB - Bradykinin (BK), a component of the kallikrein-kininogen-kinin system exerts multiple effects via B1 and B2 receptor activation. In the cardiovascular system, bradykinin has cardioprotective and vasodilator properties. We investigated the effect of BK on cardiac-projecting neurons of nucleus ambiguus, a key site for the parasympathetic cardiac regulation. BK produced a dose-dependent increase in cytosolic Ca2+ concentration. Pretreatment with HOE140, a B2 receptor antagonist, but not with R715, a B1 receptor antagonist, abolished the response to BK. A selective B2 receptor agonist, but not a B1 receptor agonist, elicited an increase in cytosolic Ca2+ similarly to BK. Inhibition of N-type voltage-gated Ca2+ channels with ω-conotoxin GVIA had no effect on the Ca2+ signal produced by BK, while pretreatment with ω-conotoxin MVIIC, a blocker of P/Q-type of Ca2+ channels, significantly diminished the effect of BK. Pretreatment with xestospongin C and 2-aminoethoxydiphenyl borate, antagonists of inositol 1,4,5-trisphosphate receptors, abolished the response to BK. Inhibition of ryanodine receptors reduced the BK-induced Ca2+ increase, while disruption of lysosomal Ca2+ stores with bafilomycin A1 did not affect the response. BK produced a dose-dependent depolarization of nucleus ambiguus neurons, which was prevented by the B2 receptor antagonist. In vivo studies indicate that microinjection of BK into nucleus ambiguus elicited bradycardia in conscious rats via B2 receptors. In summary, in cardiac vagal neurons of nucleus ambiguus, BK activates B2 receptors promoting Ca2+ influx and Ca2+ release from endoplasmic reticulum, and membrane depolarization; these effects are translated in vivo by bradycardia.
AU - Brǎiloiu, Eugen
AU - Mcguire, Matthew
AU - Shuler, Shadaria
AU - Deliu, Elena
AU - Barr, Jeffrey
AU - Abood, Mary
AU - Brailoiu, Gabriela
ID - 747
JF - Neuroscience
SN - 03064522
TI - Modulation of cardiac vagal tone by bradykinin acting on nucleus ambiguus
VL - 365
ER -
TY - CHAP
AB - The essay focuses on individual and collective forms of liminality in John Marlyn’s Under the Ribs of Death. Set in early twentieth-century Winnipeg, the 1957 immigrant novel explores liminal experiences related to ethnic identity, male sexuality, social class, urban spaces and turbulent economic times. As the son of a poor working-class family from Hungary, Sandor Hunyadi makes every effort to become a true Canadian and a successful businessman, but, no matter how hard he tries to overcome contemporary ethnic prejudices and economic hardships, his personal and professional life remains in liminality. In other words, the protagonist undergoes separation, fails at incorporation, and becomes stuck in transition.
AU - Bernhard Wenzl
ED - Brandt, Stefan L.
ID - 748
T2 - In-Between - Liminal Spaces in Canadian Literature and Culture
TI - '...beyond the invisible barrier at Portage and Main': Liminality in John Marlyn's Under the Ribs of Death
ER -
TY - JOUR
AB - Synaptotagmin 7 (Syt7) is thought to be a Ca2+ sensor that mediates asynchronous transmitter release and facilitation at synapses. However, Syt7 is strongly expressed in fast-spiking, parvalbumin-expressing GABAergic interneurons, and the output synapses of these neurons produce only minimal asynchronous release and show depression rather than facilitation. To resolve this apparent contradiction, we examined the effects of genetic elimination of Syt7 on synaptic transmission at the GABAergic basket cell (BC)-Purkinje cell (PC) synapse in cerebellum. Our results indicate that at the BC-PC synapse, Syt7 contributes to asynchronous release, pool replenishment, and facilitation. In combination, these three effects ensure efficient transmitter release during high-frequency activity and guarantee frequency independence of inhibition. Our results identify a distinct function of Syt7: ensuring the efficiency of high-frequency inhibitory synaptic transmission
AU - Chen, Chong
AU - Satterfield, Rachel
AU - Young, Samuel
AU - Jonas, Peter M
ID - 749
IS - 8
JF - Cell Reports
SN - 22111247
TI - Triple function of Synaptotagmin 7 ensures efficiency of high-frequency transmission at central GABAergic synapses
VL - 21
ER -
TY - CONF
AB - Modern communication technologies allow first responders to contact thousands of potential volunteers simultaneously for support during a crisis or disaster event. However, such volunteer efforts must be well coordinated and monitored, in order to offer an effective relief to the professionals. In this paper we extend earlier work on optimally assigning volunteers to selected landmark locations. In particular, we emphasize the aspect that obtaining good assignments requires not only advanced computational tools, but also a realistic measure of distance between volunteers and landmarks. Specifically, we propose the use of the Open Street Map (OSM) driving distance instead of he previously used flight distance. We find the OSM driving distance to be better aligned with the interests of volunteers and first responders. Furthermore, we show that relying on the flying distance leads to a substantial underestimation of the number of required volunteers, causing negative side effects in case of an actual crisis situation.
AU - Pielorz, Jasmin
AU - Prandtstetter, Matthias
AU - Straub, Markus
AU - Lampert, Christoph
ID - 750
SN - 978-153862714-3
T2 - 2017 IEEE International Conference on Big Data
TI - Optimal geospatial volunteer allocation needs realistic distances
ER -
TY - JOUR
AB - The basement membrane (BM) is a thin layer of extracellular matrix (ECM) beneath nearly all epithelial cell types that is critical for cellular and tissue function. It is composed of numerous components conserved among all bilaterians [1]; however, it is unknown how all of these components are generated and subsequently constructed to form a fully mature BM in the living animal. Although BM formation is thought to simply involve a process of self-assembly [2], this concept suffers from a number of logistical issues when considering its construction in vivo. First, incorporation of BM components appears to be hierarchical [3-5], yet it is unclear whether their production during embryogenesis must also be regulated in a temporal fashion. Second, many BM proteins are produced not only by the cells residing on the BM but also by surrounding cell types [6-9], and it is unclear how large, possibly insoluble protein complexes [10] are delivered into the matrix. Here we exploit our ability to live image and genetically dissect de novo BM formation during Drosophila development. This reveals that there is a temporal hierarchy of BM protein production that is essential for proper component incorporation. Furthermore, we show that BM components require secretion by migrating macrophages (hemocytes) during their developmental dispersal, which is critical for embryogenesis. Indeed, hemocyte migration is essential to deliver a subset of ECM components evenly throughout the embryo. This reveals that de novo BM construction requires a combination of both production and distribution logistics allowing for the timely delivery of core components.
AU - Matsubayashi, Yutaka
AU - Louani, Adam
AU - Dragu, Anca
AU - Sanchez Sanchez, Besaiz
AU - Serna Morales, Eduardo
AU - Yolland, Lawrence
AU - György, Attila
AU - Vizcay, Gema
AU - Fleck, Roland
AU - Heddleston, John
AU - Chew, Teng
AU - Siekhaus, Daria E
AU - Stramer, Brian
ID - 751
IS - 22
JF - Current Biology
SN - 09609822
TI - A moving source of matrix components is essential for De Novo basement membrane formation
VL - 27
ER -
TY - JOUR
AB - Phenotypic plasticity is the ability of an individual genotype to alter aspects of its phenotype depending on the current environment. It is central to the persistence, resistance and resilience of populations facing variation in physical or biological factors. Genetic variation in plasticity is pervasive, which suggests its local adaptation is plausible. Existing studies on the adaptation of plasticity typically focus on single traits and a few populations, while theory about interactions among genes (for example, pleiotropy) suggests that a multi-trait, landscape scale (for example, multiple populations) perspective is required. We present data from a landscape scale, replicated, multi-trait experiment using a classic predator–prey system centred on the water flea Daphnia pulex. We find predator regime-driven differences in genetic variation of multivariate plasticity. These differences are associated with strong divergent selection linked to a predation regime. Our findings are evidence for local adaptation of plasticity, suggesting that responses of populations to environmental variation depend on the conditions in which they evolved in the past.
AU - Reger, Julia
AU - Lind, Martin I.
AU - Robinson, Matthew Richard
AU - Beckerman, Andrew P.
ID - 7725
JF - Nature Ecology & Evolution
SN - 2397-334X
TI - Predation drives local adaptation of phenotypic plasticity
VL - 2
ER -
TY - JOUR
AB - Genes of the major histocompatibility complex (MHC) have been shown to influence social signalling and mate preferences in many species, including humans. First observations suggest that MHC signalling may also affect female fertility. To test this hypothesis, we exposed 191 female horses (Equus caballus) to either an MHC-similar or an MHC-dissimilar stimulus male around the time of ovulation and conception. A within-subject experimental design controlled for non-MHC-linked male characteristics, and instrumental insemination with semen of other males (n = 106) controlled for potential confounding effects of semen or embryo characteristics. We found that females were more likely to become pregnant if exposed to an MHC-dissimilar than to an MHC-similar male, while overall genetic distance to the stimulus males (based on microsatellite markers on 20 chromosomes) had no effect. Our results demonstrate that early pregnancy failures can be due to maternal life-history decisions (cryptic female choice) influenced by MHC-linked social signalling.
AU - Burger, D.
AU - Thomas, S.
AU - Aepli, H.
AU - Dreyer, M.
AU - Fabre, G.
AU - Marti, E.
AU - Sieme, H.
AU - Robinson, Matthew Richard
AU - Wedekind, C.
ID - 7727
IS - 1868
JF - Proceedings of the Royal Society B: Biological Sciences
SN - 0962-8452
TI - Major histocompatibility complex-linked social signalling affects female fertility
VL - 284
ER -
TY - JOUR
AB - Meta-analyses of genome-wide association studies, which dominate genetic discovery, are based on data from diverse historical time periods and populations. Genetic scores derived from genome-wide association studies explain only a fraction of the heritability estimates obtained from whole-genome studies on single populations, known as the ‘hidden heritability’ puzzle. Using seven sampling populations (n = 35,062), we test whether hidden heritability is attributed to heterogeneity across sampling populations and time, showing that estimates are substantially smaller across populations compared with within populations. We show that the hidden heritability varies substantially: from zero for height to 20% for body mass index, 37% for education, 40% for age at first birth and up to 75% for number of children. Simulations demonstrate that our results are more likely to reflect heterogeneity in phenotypic measurement or gene–environment interactions than genetic heterogeneity. These findings have substantial implications for genetic discovery, suggesting that large homogenous datasets are required for behavioural phenotypes and that gene–environment interaction may be a central challenge for genetic discovery.
AU - Tropf, Felix C.
AU - Lee, S. Hong
AU - Verweij, Renske M.
AU - Stulp, Gert
AU - van der Most, Peter J.
AU - de Vlaming, Ronald
AU - Bakshi, Andrew
AU - Briley, Daniel A.
AU - Rahal, Charles
AU - Hellpap, Robert
AU - Iliadou, Anastasia N.
AU - Esko, Tõnu
AU - Metspalu, Andres
AU - Medland, Sarah E.
AU - Martin, Nicholas G.
AU - Barban, Nicola
AU - Snieder, Harold
AU - Robinson, Matthew Richard
AU - Mills, Melinda C.
ID - 7728
IS - 10
JF - Nature Human Behaviour
SN - 2397-3374
TI - Hidden heritability due to heterogeneity across seven populations
VL - 1
ER -
TY - JOUR
AB - Quantifying the effects of inbreeding is critical to characterizing the genetic architecture of complex traits. This study highlights through theory and simulations the strengths and shortcomings of three SNP-based inbreeding measures commonly used to estimate inbreeding depression (ID). We demonstrate that heterogeneity in linkage disequilibrium (LD) between causal variants and SNPs biases ID estimates, and we develop an approach to correct this bias using LD and minor allele frequency stratified inference (LDMS). We quantified ID in 25 traits measured in ∼140,000 participants of the UK Biobank, using LDMS, and confirmed previously published ID for 4 traits. We find unique evidence of ID for handgrip strength, waist/hip ratio, and visual and auditory acuity (ID between −2.3 and −5.2 phenotypic SDs for complete inbreeding; P<0.001). Our results illustrate that a careful choice of the measure of inbreeding combined with LDMS stratification improves both detection and quantification of ID using SNP data.
AU - Yengo, Loic
AU - Zhu, Zhihong
AU - Wray, Naomi R.
AU - Weir, Bruce S.
AU - Yang, Jian
AU - Robinson, Matthew Richard
AU - Visscher, Peter M.
ID - 7729
IS - 32
JF - Proceedings of the National Academy of Sciences
SN - 0027-8424
TI - Detection and quantification of inbreeding depression for complex traits from SNP data
VL - 114
ER -
TY - JOUR
AB - Genetic association studies in admixed populations are underrepresented in the genomics literature, with a key concern for researchers being the adequate control of spurious associations due to population structure. Linear mixed models (LMMs) are well suited for genome-wide association studies (GWAS) because they account for both population stratification and cryptic relatedness and achieve increased statistical power by jointly modeling all genotyped markers. Additionally, Bayesian LMMs allow for more flexible assumptions about the underlying distribution of genetic effects, and can concurrently estimate the proportion of phenotypic variance explained by genetic markers. Using three recently published Bayesian LMMs, Bayes R, BSLMM, and BOLT-LMM, we investigate an existing data set on eye (n = 625) and skin (n = 684) color from Cape Verde, an island nation off West Africa that is home to individuals with a broad range of phenotypic values for eye and skin color due to the mix of West African and European ancestry. We use simulations to demonstrate the utility of Bayesian LMMs for mapping loci and studying the genetic architecture of quantitative traits in admixed populations. The Bayesian LMMs provide evidence for two new pigmentation loci: one for eye color (AHRR) and one for skin color (DDB1).
AU - Lloyd-Jones, Luke R.
AU - Robinson, Matthew Richard
AU - Moser, Gerhard
AU - Zeng, Jian
AU - Beleza, Sandra
AU - Barsh, Gregory S.
AU - Tang, Hua
AU - Visscher, Peter M.
ID - 7731
IS - 2
JF - Genetics
SN - 0016-6731
TI - Inference on the genetic basis of eye and skin color in an admixed population via Bayesian linear mixed models
VL - 206
ER -
TY - JOUR
AB - Sections
PDFPDF
Tools
Share
Abstract
Background: Gene discovery has provided remarkable biological insights into amyotrophic lateral sclerosis (ALS). One challenge for clinical application of genetic testing is critical evaluation of the significance of reported variants.
Methods: We use whole exome sequencing (WES) to develop a clinically relevant approach to identify a subset of ALS patients harboring likely pathogenic mutations. In parallel, we assess if DNA methylation can be used to screen for pathogenicity of novel variants since a methylation signature has been shown to associate with the pathogenic C9orf72 expansion, but has not been explored for other ALS mutations. Australian patients identified with ALS‐relevant variants were cross‐checked with population databases and case reports to critically assess whether they were “likely causal,” “uncertain significance,” or “unlikely causal.”
Results: Published ALS variants were identified in >10% of patients; however, in only 3% of patients (4/120) could these be confidently considered pathogenic (in SOD1 and TARDBP). We found no evidence for a differential DNA methylation signature in these mutation carriers.
Conclusions: The use of WES in a typical ALS clinic demonstrates a critical approach to variant assessment with the capability to combine cohorts to enhance the largely unknown genetic basis of ALS.
AU - Garton, Fleur C.
AU - Benyamin, Beben
AU - Zhao, Qiongyi
AU - Liu, Zhijun
AU - Gratten, Jacob
AU - Henders, Anjali K.
AU - Zhang, Zong-Hong
AU - Edson, Janette
AU - Furlong, Sarah
AU - Morgan, Sarah
AU - Heggie, Susan
AU - Thorpe, Kathryn
AU - Pfluger, Casey
AU - Mather, Karen A.
AU - Sachdev, Perminder S.
AU - McRae, Allan F.
AU - Robinson, Matthew Richard
AU - Shah, Sonia
AU - Visscher, Peter M.
AU - Mangelsdorf, Marie
AU - Henderson, Robert D.
AU - Wray, Naomi R.
AU - McCombe, Pamela A.
ID - 7733
IS - 4
JF - Molecular Genetics & Genomic Medicine
SN - 2324-9269
TI - Whole exome sequencing and DNA methylation analysis in a clinical amyotrophic lateral sclerosis cohort
VL - 5
ER -
TY - JOUR
AB - We give a bird's-eye view of the plastic deformation of crystals aimed at the statistical physics community, as well as a broad introduction to the statistical theories of forced rigid systems aimed at the plasticity community. Memory effects in magnets, spin glasses, charge density waves, and dilute colloidal suspensions are discussed in relation to the onset of plastic yielding in crystals. Dislocation avalanches and complex dislocation tangles are discussed via a brief introduction to the renormalization group and scaling. Analogies to emergent scale invariance in fracture, jamming, coarsening, and a variety of depinning transitions are explored. Dislocation dynamics in crystals challenge nonequilibrium statistical physics. Statistical physics provides both cautionary tales of subtle memory effects in nonequilibrium systems and systematic tools designed to address complex scale-invariant behavior on multiple length scales and timescales.
AU - Sethna, James P.
AU - Bierbaum, Matthew K.
AU - Dahmen, Karin A.
AU - Goodrich, Carl Peter
AU - Greer, Julia R.
AU - Hayden, Lorien X.
AU - Kent-Dobias, Jaron P.
AU - Lee, Edward D.
AU - Liarte, Danilo B.
AU - Ni, Xiaoyue
AU - Quinn, Katherine N.
AU - Raju, Archishman
AU - Rocklin, D. Zeb
AU - Shekhawat, Ashivni
AU - Zapperi, Stefano
ID - 7755
JF - Annual Review of Materials Research
SN - 1531-7331
TI - Deformation of crystals: Connections with statistical physics
VL - 47
ER -
TY - JOUR
AB - We study the shear jamming of athermal frictionless soft spheres, and find that in the thermodynamic limit, a shear-jammed state exists with different elastic properties from the isotropically-jammed state. For example, shear-jammed states can have a non-zero residual shear stress in the thermodynamic limit that arises from long-range stress-stress correlations. As a result, the ratio of the shear and bulk moduli, which in isotropically-jammed systems vanishes as the jamming transition is approached from above, instead approaches a constant. Despite these striking differences, we argue that in a deeper sense, the shear jamming and isotropic jamming transitions actually have the same symmetry, and that the differences can be fully understood by rotating the six-dimensional basis of the elastic modulus tensor.
AU - Baity-Jesi, Marco
AU - Goodrich, Carl Peter
AU - Liu, Andrea J.
AU - Nagel, Sidney R.
AU - Sethna, James P.
ID - 7756
IS - 3-4
JF - Journal of Statistical Physics
SN - 0022-4715
TI - Emergent SO(3) symmetry of the frictionless shear jamming transition
VL - 167
ER -
TY - JOUR
AB - Recent advances in designing metamaterials have demonstrated that global mechanical properties of disordered spring networks can be tuned by selectively modifying only a small subset of bonds. Here, using a computationally efficient approach, we extend this idea to tune more general properties of networks. With nearly complete success, we are able to produce a strain between any two target nodes in a network in response to an applied source strain on any other pair of nodes by removing only ∼1% of the bonds. We are also able to control multiple pairs of target nodes, each with a different individual response, from a single source, and to tune multiple independent source/target responses simultaneously into a network. We have fabricated physical networks in macroscopic 2D and 3D systems that exhibit these responses. This work is inspired by the long-range coupled conformational changes that constitute allosteric function in proteins. The fact that allostery is a common means for regulation in biological molecules suggests that it is a relatively easy property to develop through evolution. In analogy, our results show that long-range coupled mechanical responses are similarly easy to achieve in disordered networks.
AU - Rocks, Jason W.
AU - Pashine, Nidhi
AU - Bischofberger, Irmgard
AU - Goodrich, Carl Peter
AU - Liu, Andrea J.
AU - Nagel, Sidney R.
ID - 7757
IS - 10
JF - Proceedings of the National Academy of Sciences
SN - 0027-8424
TI - Designing allostery-inspired response in mechanical networks
VL - 114
ER -
TY - JOUR
AB - Controlling motion at the microscopic scale is a fundamental goal in the development of biologically inspired systems. We show that the motion of active, self-propelled colloids can be sufficiently controlled for use as a tool to assemble complex structures such as braids and weaves out of microscopic filaments. Unlike typical self-assembly paradigms, these structures are held together by geometric constraints rather than adhesive bonds. The out-of-equilibrium assembly that we propose involves precisely controlling the 2D motion of active colloids so that their path has a nontrivial topology. We demonstrate with proof-of-principle Brownian dynamics simulations that, when the colloids are attached to long semiflexible filaments, this motion causes the filaments to braid. The ability of the active particles to provide sufficient force necessary to bend the filaments into a braid depends on a number of factors, including the self-propulsion mechanism, the properties of the filament, and the maximum curvature in the braid. Our work demonstrates that nonequilibrium assembly pathways can be designed using active particles.
AU - Goodrich, Carl Peter
AU - Brenner, Michael P.
ID - 7758
IS - 2
JF - Proceedings of the National Academy of Sciences
SN - 0027-8424
TI - Using active colloids as machines to weave and braid on the micrometer scale
VL - 114
ER -
TY - CONF
AB - Population protocols are a popular model of distributed computing, in which randomly-interacting agents with little computational power cooperate to jointly perform computational tasks. Inspired by developments in molecular computation, and in particular DNA computing, recent algorithmic work has focused on the complexity of solving simple yet fundamental tasks in the population model, such as leader election (which requires convergence to a single agent in a special "leader" state), and majority (in which agents must converge to a decision as to which of two possible initial states had higher initial count). Known results point towards an inherent trade-off between the time complexity of such algorithms, and the space complexity, i.e. size of the memory available to each agent. In this paper, we explore this trade-off and provide new upper and lower bounds for majority and leader election. First, we prove a unified lower bound, which relates the space available per node with the time complexity achievable by a protocol: for instance, our result implies that any protocol solving either of these tasks for n agents using O(log log n) states must take (n=polylogn) expected time. This is the first result to characterize time complexity for protocols which employ super-constant number of states per node, and proves that fast, poly-logarithmic running times require protocols to have relatively large space costs. On the positive side, we give algorithms showing that fast, poly-logarithmic convergence time can be achieved using O(log2 n) space per node, in the case of both tasks. Overall, our results highlight a time complexity separation between O(log log n) and (log2 n) state space size for both majority and leader election in population protocols, and introduce new techniques, which should be applicable more broadly.
AU - Alistarh, Dan-Adrian
AU - Aspnes, James
AU - Eisenstat, David
AU - Rivest, Ronald
AU - Gelashvili, Rati
ID - 787
TI - Time-space trade-offs in population protocols
ER -
TY - CONF
AB - In contrast to electronic computation, chemical computation is noisy and susceptible to a variety of sources of error, which has prevented the construction of robust complex systems. To be effective, chemical algorithms must be designed with an appropriate error model in mind. Here we consider the model of chemical reaction networks that preserve molecular count (population protocols), and ask whether computation can be made robust to a natural model of unintended “leak” reactions. Our definition of leak is motivated by both the particular spurious behavior seen when implementing chemical reaction networks with DNA strand displacement cascades, as well as the unavoidable side reactions in any implementation due to the basic laws of chemistry. We develop a new “Robust Detection” algorithm for the problem of fast (logarithmic time) single molecule detection, and prove that it is robust to this general model of leaks. Besides potential applications in single molecule detection, the error-correction ideas developed here might enable a new class of robust-by-design chemical algorithms. Our analysis is based on a non-standard hybrid argument, combining ideas from discrete analysis of population protocols with classic Markov chain techniques.
AU - Alistarh, Dan-Adrian
AU - Dudek, Bartłomiej
AU - Kosowski, Adrian
AU - Soloveichik, David
AU - Uznański, Przemysław
ID - 788
TI - Robust detection in leak-prone population protocols
VL - 10467 LNCS
ER -
TY - CONF
AB - The problem of efficient concurrent memory reclamation in unmanaged languages such as C or C++ is one of the major challenges facing the parallelization of billions of lines of legacy code. Garbage collectors for C/C++ can be inefficient; thus, programmers are often forced to use finely-crafted concurrent memory reclamation techniques. These techniques can provide good performance, but require considerable programming effort to deploy, and have strict requirements, allowing the programmer very little room for error. In this work, we present Forkscan, a new conservative concurrent memory reclamation scheme which is fully automatic and surprisingly scalable. Forkscan's semantics place it between automatic garbage collectors (it requires the programmer to explicitly retire nodes before they can be reclaimed), and concurrent memory reclamation techniques (as it does not assume that nodes are completely unlinked from the data structure for correctness). Forkscan's implementation exploits these new semantics for efficiency: we leverage parallelism and optimized implementations of signaling and copy-on-write in modern operating systems to efficiently obtain and process consistent snapshots of memory that can be scanned concurrently with the normal program operation. Empirical evaluation on a range of classical concurrent data structure microbenchmarks shows that Forkscan can preserve the scalability of the original code, while maintaining an order of magnitude lower latency than automatic garbage collection, and demonstrating competitive performance with finely crafted memory reclamation techniques.
AU - Alistarh, Dan-Adrian
AU - Leiserson, William
AU - Matveev, Alexander
AU - Shavit, Nir
ID - 789
TI - Forkscan: Conservative memory reclamation for modern operating systems
ER -
TY - CONF
AB - Stochastic gradient descent (SGD) is a commonly used algorithm for training linear machine learning models. Based on vector algebra, it benefits from the inherent parallelism available in an FPGA. In this paper, we first present a single-precision floating-point SGD implementation on an FPGA that provides similar performance as a 10-core CPU. We then adapt the design to make it capable of processing low-precision data. The low-precision data is obtained from a novel compression scheme - called stochastic quantization, specifically designed for machine learning applications. We test both full-precision and low-precision designs on various regression and classification data sets. We achieve up to an order of magnitude training speedup when using low-precision data compared to a full-precision SGD on the same FPGA and a state-of-the-art multi-core solution, while maintaining the quality of training. We open source the designs presented in this paper.
AU - Kara, Kaan
AU - Alistarh, Dan-Adrian
AU - Alonso, Gustavo
AU - Mutlu, Onur
AU - Zhang, Ce
ID - 790
TI - FPGA-accelerated dense linear machine learning: A precision-convergence trade-off
ER -
TY - CONF
AB - Consider the following random process: we are given n queues, into which elements of increasing labels are inserted uniformly at random. To remove an element, we pick two queues at random, and remove the element of lower label (higher priority) among the two. The cost of a removal is the rank of the label removed, among labels still present in any of the queues, that is, the distance from the optimal choice at each step. Variants of this strategy are prevalent in state-of-the-art concurrent priority queue implementations. Nonetheless, it is not known whether such implementations provide any rank guarantees, even in a sequential model. We answer this question, showing that this strategy provides surprisingly strong guarantees: Although the single-choice process, where we always insert and remove from a single randomly chosen queue, has degrading cost, going to infinity as we increase the number of steps, in the two choice process, the expected rank of a removed element is O(n) while the expected worst-case cost is O(n log n). These bounds are tight, and hold irrespective of the number of steps for which we run the process. The argument is based on a new technical connection between "heavily loaded" balls-into-bins processes and priority scheduling. Our analytic results inspire a new concurrent priority queue implementation, which improves upon the state of the art in terms of practical performance.
AU - Alistarh, Dan-Adrian
AU - Kopinsky, Justin
AU - Li, Jerry
AU - Nadiradze, Giorgi
ID - 791
SN - 978-145034992-5
T2 - Proceedings of the ACM Symposium on Principles of Distributed Computing
TI - The power of choice in priority scheduling
VL - Part F129314
ER -
TY - JOUR
AB - The chaotic dynamics of low-dimensional systems, such as Lorenz or Rössler flows, is guided by the infinity of periodic orbits embedded in their strange attractors. Whether this is also the case for the infinite-dimensional dynamics of Navier–Stokes equations has long been speculated, and is a topic of ongoing study. Periodic and relative periodic solutions have been shown to be involved in transitions to turbulence. Their relevance to turbulent dynamics – specifically, whether periodic orbits play the same role in high-dimensional nonlinear systems like the Navier–Stokes equations as they do in lower-dimensional systems – is the focus of the present investigation. We perform here a detailed study of pipe flow relative periodic orbits with energies and mean dissipations close to turbulent values. We outline several approaches to reduction of the translational symmetry of the system. We study pipe flow in a minimal computational cell at Re=2500, and report a library of invariant solutions found with the aid of the method of slices. Detailed study of the unstable manifolds of a sample of these solutions is consistent with the picture that relative periodic orbits are embedded in the chaotic saddle and that they guide the turbulent dynamics.
AU - Budanur, Nazmi B
AU - Short, Kimberly
AU - Farazmand, Mohammad
AU - Willis, Ashley
AU - Cvitanović, Predrag
ID - 792
JF - Journal of Fluid Mechanics
SN - 00221120
TI - Relative periodic orbits form the backbone of turbulent pipe flow
VL - 833
ER -
TY - JOUR
AB - Let P be a finite point set in the plane. A cordinary triangle in P is a subset of P consisting of three non-collinear points such that each of the three lines determined by the three points contains at most c points of P . Motivated by a question of Erdös, and answering a question of de Zeeuw, we prove that there exists a constant c > 0such that P contains a c-ordinary triangle, provided that P is not contained in the union of two lines. Furthermore, the number of c-ordinary triangles in P is Ω(| P |).
AU - Fulek, Radoslav
AU - Mojarrad, Hossein
AU - Naszódi, Márton
AU - Solymosi, József
AU - Stich, Sebastian
AU - Szedlák, May
ID - 793
JF - Computational Geometry: Theory and Applications
SN - 09257721
TI - On the existence of ordinary triangles
VL - 66
ER -
TY - JOUR
AB - We show that c-planarity is solvable in quadratic time for flat clustered graphs with three clusters if the combinatorial embedding of the underlying graph is fixed. In simpler graph-theoretical terms our result can be viewed as follows. Given a graph G with the vertex set partitioned into three parts embedded on a 2-sphere, our algorithm decides if we can augment G by adding edges without creating an edge-crossing so that in the resulting spherical graph the vertices of each part induce a connected sub-graph. We proceed by a reduction to the problem of testing the existence of a perfect matching in planar bipartite graphs. We formulate our result in a slightly more general setting of cyclic clustered graphs, i.e., the simple graph obtained by contracting each cluster, where we disregard loops and multi-edges, is a cycle.
AU - Fulek, Radoslav
ID - 794
JF - Computational Geometry: Theory and Applications
TI - C-planarity of embedded cyclic c-graphs
VL - 66
ER -
TY - JOUR
AB - We introduce a common generalization of the strong Hanani–Tutte theorem and the weak Hanani–Tutte theorem: if a graph G has a drawing D in the plane where every pair of independent edges crosses an even number of times, then G has a planar drawing preserving the rotation of each vertex whose incident edges cross each other evenly in D. The theorem is implicit in the proof of the strong Hanani–Tutte theorem by Pelsmajer, Schaefer and Štefankovič. We give a new, somewhat simpler proof.
AU - Fulek, Radoslav
AU - Kynčl, Jan
AU - Pálvölgyi, Dömötör
ID - 795
IS - 3
JF - Electronic Journal of Combinatorics
SN - 10778926
TI - Unified Hanani Tutte theorem
VL - 24
ER -
TY - JOUR
AB - We investigate transient behaviors induced by magnetic fields on the dynamics of the flow of a ferrofluid in the gap between two concentric, independently rotating cylinders. Without applying any magnetic fields, we uncover emergence of flow states constituted by a combination of a localized spiral state (SPIl) in the top and bottom of the annulus and different multi-cell flow states (SPI2v, SPI3v) with toroidally closed vortices in the interior of the bulk (SPIl+2v = SPIl + SPI2v and SPIl+3v = SPIl + SPI3v). However, when a magnetic field is presented, we observe the transient behaviors between multi-cell states passing through two critical thresholds in a strength of an axial (transverse) magnetic field. Before the first critical threshold of a magnetic field strength, multi-stable states with different number of cells could be observed. After the first critical threshold, we find the transient behavior between the three- and two-cell flow states. For more strength of magnetic field or after the second critical threshold, we discover that multi-cell states are disappeared and a localized spiral state remains to be stimulated. The studied transient behavior could be understood by the investigation of various quantities including a modal kinetic energy, a mode amplitude of the radial velocity, wavenumber, angular momentum, and torque. In addition, the emergence of new flow states and the transient behavior between their states in ferrofluidic flows indicate that richer and potentially controllable dynamics through magnetic fields could be possible in ferrofluic flow.
AU - Altmeyer, Sebastian
AU - Do, Younghae
AU - Ryu, Soorok
ID - 463
IS - 11
JF - Chaos
SN - 10541500
TI - Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow
VL - 27
ER -
TY - JOUR
AB - The computation of the winning set for parity objectives and for Streett objectives in graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formedness of specifications, and the synthesis of reactive systems. We show how to compute the winning set on n vertices for (1) parity-3 (aka one-pair Streett) objectives in game graphs in time O(n5/2) and for (2) k-pair Streett objectives in graphs in time O(n2+nklogn). For both problems this gives faster algorithms for dense graphs and represents the first improvement in asymptotic running time in 15 years.
AU - Chatterjee, Krishnendu
AU - Henzinger, Monika
AU - Loitzenbauer, Veronika
ID - 464
IS - 3
JF - Logical Methods in Computer Science
SN - 18605974
TI - Improved algorithms for parity and Streett objectives
VL - 13
ER -
TY - JOUR
AB - The edit distance between two words w 1 , w 2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w 1 to w 2 . The edit distance generalizes to languages L 1 , L 2 , where the edit distance from L 1 to L 2 is the minimal number k such that for every word from L 1 there exists a word in L 2 with edit distance at most k . We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to a pushdown automaton is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for the following problems: (1) deciding whether, for a given threshold k , the edit distance from a pushdown automaton to a finite automaton is at most k , and (2) deciding whether the edit distance from a pushdown automaton to a finite automaton is finite.
AU - Chatterjee, Krishnendu
AU - Henzinger, Thomas A
AU - Ibsen-Jensen, Rasmus
AU - Otop, Jan
ID - 465
IS - 3
JF - Logical Methods in Computer Science
SN - 18605974
TI - Edit distance for pushdown automata
VL - 13
ER -
TY - JOUR
AB - We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. There exist two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. We consider optimization with respect to both objectives at once, thus unifying the existing semantics. Precisely, the goal is to optimize the expectation while ensuring the satisfaction constraint. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensure certain probabilistic guarantee). Our main results are as follows: First, we present algorithms for the decision problems which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Second, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem.
AU - Chatterjee, Krishnendu
AU - Křetínská, Zuzana
AU - Kretinsky, Jan
ID - 466
IS - 2
JF - Logical Methods in Computer Science
SN - 18605974
TI - Unifying two views on multiple mean-payoff objectives in Markov decision processes
VL - 13
ER -
TY - JOUR
AB - Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata or in any other known decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata, which makes it possible to express important quantitative properties such as average response time. In nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in runtime verification. We establish an almost-complete decidability picture for the basic decision problems about nested weighted automata and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties.
AU - Chatterjee, Krishnendu
AU - Henzinger, Thomas A
AU - Otop, Jan
ID - 467
IS - 4
JF - ACM Transactions on Computational Logic (TOCL)
SN - 15293785
TI - Nested weighted automata
VL - 18
ER -
TY - JOUR
AB - This paper presents a method for simulating water surface waves as a displacement field on a 2D domain. Our method relies on Lagrangian particles that carry packets of water wave energy; each packet carries information about an entire group of wave trains, as opposed to only a single wave crest. Our approach is unconditionally stable and can simulate high resolution geometric details. This approach also presents a straightforward interface for artistic control, because it is essentially a particle system with intuitive parameters like wavelength and amplitude. Our implementation parallelizes well and runs in real time for moderately challenging scenarios.
AU - Jeschke, Stefan
AU - Wojtan, Christopher J
ID - 470
IS - 4
JF - ACM Transactions on Graphics
SN - 07300301
TI - Water wave packets
VL - 36
ER -
TY - JOUR
AB - We present a new algorithm for the statistical model checking of Markov chains with respect to unbounded temporal properties, including full linear temporal logic. The main idea is that we monitor each simulation run on the fly, in order to detect quickly if a bottom strongly connected component is entered with high probability, in which case the simulation run can be terminated early. As a result, our simulation runs are often much shorter than required by termination bounds that are computed a priori for a desired level of confidence on a large state space. In comparison to previous algorithms for statistical model checking our method is not only faster in many cases but also requires less information about the system, namely, only the minimum transition probability that occurs in the Markov chain. In addition, our method can be generalised to unbounded quantitative properties such as mean-payoff bounds.
AU - Daca, Przemyslaw
AU - Henzinger, Thomas A
AU - Kretinsky, Jan
AU - Petrov, Tatjana
ID - 471
IS - 2
JF - ACM Transactions on Computational Logic (TOCL)
SN - 15293785
TI - Faster statistical model checking for unbounded temporal properties
VL - 18
ER -
TY - JOUR
AB - α-Synuclein is a presynaptic protein the function of which has yet to be identified, but its neuronal content increases in patients of synucleinopa-thies including Parkinson’s disease. Chronic overexpression of α-synuclein reportedly expresses various phenotypes of synaptic dysfunction, but the primary target of its toxicity has not been determined. To investigate this, we acutely loaded human recombinant α-synuclein or its pathological mutants in their monomeric forms into the calyces of Held presynaptic terminals in slices from auditorily mature and immature rats of either sex. Membrane capacitance measurements revealed significant and specific inhibitory effects of WT monomeric α-synuclein on vesicle endocytosis throughout development. However, the α-synuclein A53T mutant affected vesicle endocytosis only at immature calyces, where as the A30P mutant had no effect throughout. The endocytic impairment by WTα-synuclein was rescued by intraterminal coloading of the microtubule (MT) polymerization blocker nocodazole. Furthermore, it was reversibly rescued by presynaptically loaded photostatin-1, a pho-toswitcheable inhibitor of MT polymerization, inalight-wavelength-dependent manner. Incontrast, endocyticinhibition by the A53T mutant at immature calyces was not rescued by nocodazole. Functionally, presynaptically loaded WT α-synuclein had no effect on basal synaptic transmission evoked at a low frequency, but significantly attenuated exocytosis and impaired the fidelity of neurotransmission during prolonged high-frequency stimulation. We conclude that monomeric WTα-synuclein primarily inhibits vesicle endocytosis via MT overassembly, thereby impairing high-frequency neurotransmission.
AU - Eguchi, Kohgaku
AU - Taoufiq, Zachari
AU - Thorn Seshold, Oliver
AU - Trauner, Dirk
AU - Hasegawa, Masato
AU - Takahashi, Tomoyuki
ID - 472
IS - 25
JF - European Journal of Neuroscience
SN - 02706474
TI - Wild-type monomeric α-synuclein can impair vesicle endocytosis and synaptic fidelity via tubulin polymerization at the calyx of held
VL - 37
ER -
TY - JOUR
AB - We introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist. Using our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings.
AU - Biedl, Therese
AU - Huber, Stefan
AU - Palfrader, Peter
ID - 481
IS - 3-4
JF - International Journal of Computational Geometry and Applications
TI - Planar matchings for weighted straight skeletons
VL - 26
ER -
TY - JOUR
AB - We prove the universality for the eigenvalue gap statistics in the bulk of the spectrum for band matrices, in the regime where the band width is comparable with the dimension of the matrix, W ~ N. All previous results concerning universality of non-Gaussian random matrices are for mean-field models. By relying on a new mean-field reduction technique, we deduce universality from quantum unique ergodicity for band matrices.
AU - Bourgade, Paul
AU - Erdös, László
AU - Yau, Horng
AU - Yin, Jun
ID - 483
IS - 3
JF - Advances in Theoretical and Mathematical Physics
SN - 10950761
TI - Universality for a class of random band matrices
VL - 21
ER -
TY - JOUR
AB - We consider the dynamics of a large quantum system of N identical bosons in 3D interacting via a two-body potential of the form N3β-1w(Nβ(x - y)). For fixed 0 = β < 1/3 and large N, we obtain a norm approximation to the many-body evolution in the Nparticle Hilbert space. The leading order behaviour of the dynamics is determined by Hartree theory while the second order is given by Bogoliubov theory.
AU - Nam, Phan
AU - Napiórkowski, Marcin M
ID - 484
IS - 3
JF - Advances in Theoretical and Mathematical Physics
SN - 10950761
TI - Bogoliubov correction to the mean-field dynamics of interacting bosons
VL - 21
ER -
TY - CONF
AB - We present results on nonlinear electro-optical conversion of microwave radiation into the optical telecommunication band with more than 0.1% photon number conversion efficiency with MHz bandwidth, in a crystalline whispering gallery mode resonator
AU - Rueda Sanchez, Alfredo R
AU - Sedlmeir, Florian
AU - Collodo, Michele
AU - Vogl, Ulrich
AU - Stiller, Birgit
AU - Schunk, Gerhard
AU - Strekalov, Dmitry
AU - Marquardt, Christoph
AU - Fink, Johannes M
AU - Painter, Oskar
AU - Leuchs, Gerd
AU - Schwefel, Harald
ID - 485
SN - 978-155752820-9
TI - Single sideband microwave to optical photon conversion-an-electro-optic-realization
VL - F54
ER -
TY - JOUR
AB - Color texture reproduction in 3D printing commonly ignores volumetric light transport (cross-talk) between surface points on a 3D print. Such light diffusion leads to significant blur of details and color bleeding, and is particularly severe for highly translucent resin-based print materials. Given their widely varying scattering properties, this cross-talk between surface points strongly depends on the internal structure of the volume surrounding each surface point. Existing scattering-aware methods use simplified models for light diffusion, and often accept the visual blur as an immutable property of the print medium. In contrast, our work counteracts heterogeneous scattering to obtain the impression of a crisp albedo texture on top of the 3D print, by optimizing for a fully volumetric material distribution that preserves the target appearance. Our method employs an efficient numerical optimizer on top of a general Monte-Carlo simulation of heterogeneous scattering, supported by a practical calibration procedure to obtain scattering parameters from a given set of printer materials. Despite the inherent translucency of the medium, we reproduce detailed surface textures on 3D prints. We evaluate our system using a commercial, five-tone 3D print process and compare against the printer’s native color texturing mode, demonstrating that our method preserves high-frequency features well without having to compromise on color gamut.
AU - Elek, Oskar
AU - Sumin, Denis
AU - Zhang, Ran
AU - Weyrich, Tim
AU - Myszkowski, Karol
AU - Bickel, Bernd
AU - Wilkie, Alexander
AU - Krivanek, Jaroslav
ID - 486
IS - 6
JF - ACM Transactions on Graphics
SN - 07300301
TI - Scattering-aware texture reproduction for 3D printing
VL - 36
ER -
TY - CONF
AB - In this paper we study network architecture for unlicensed cellular networking for outdoor coverage in TV white spaces. The main technology proposed for TV white spaces is 802.11af, a Wi-Fi variant adapted for TV frequencies. However, 802.11af is originally designed for improved indoor propagation. We show that long links, typical for outdoor use, exacerbate known Wi-Fi issues, such as hidden and exposed terminal, and significantly reduce its efficiency. Instead, we propose CellFi, an alternative architecture based on LTE. LTE is designed for long-range coverage and throughput efficiency, but it is also designed to operate in tightly controlled and centrally managed networks. CellFi overcomes these problems by designing an LTE-compatible spectrum database component, mandatory for TV white space networking, and introducing an interference management component for distributed coordination. CellFi interference management is compatible with existing LTE mechanisms, requires no explicit communication between base stations, and is more efficient than CSMA for long links. We evaluate our design through extensive real world evaluation on of-the-shelf LTE equipment and simulations. We show that, compared to 802.11af, it increases coverage by 40% and reduces median flow completion times by 2.3x.
AU - Baig, Ghufran
AU - Radunovic, Bozidar
AU - Alistarh, Dan-Adrian
AU - Balkwill, Matthew
AU - Karagiannis, Thomas
AU - Qiu, Lili
ID - 487
SN - 978-145035422-6
T2 - Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies
TI - Towards unlicensed cellular networks in TV white spaces
ER -
TY - JOUR
AB - The fixation probability is the probability that a new mutant introduced in a homogeneous population eventually takes over the entire population. The fixation probability is a fundamental quantity of natural selection, and known to depend on the population structure. Amplifiers of natural selection are population structures which increase the fixation probability of advantageous mutants, as compared to the baseline case of well-mixed populations. In this work we focus on symmetric population structures represented as undirected graphs. In the regime of undirected graphs, the strongest amplifier known has been the Star graph, and the existence of undirected graphs with stronger amplification properties has remained open for over a decade. In this work we present the Comet and Comet-swarm families of undirected graphs. We show that for a range of fitness values of the mutants, the Comet and Cometswarm graphs have fixation probability strictly larger than the fixation probability of the Star graph, for fixed population size and at the limit of large populations, respectively.
AU - Pavlogiannis, Andreas
AU - Tkadlec, Josef
AU - Chatterjee, Krishnendu
AU - Nowak, Martin
ID - 512
IS - 1
JF - Scientific Reports
SN - 20452322
TI - Amplification on undirected population structures: Comets beat stars
VL - 7
ER -
TY - JOUR
AB - We present an experimental setup that creates a shear flow with zero mean advection velocity achieved by counterbalancing the nonzero streamwise pressure gradient by moving boundaries, which generates plane Couette-Poiseuille flow. We obtain experimental results in the transitional regime for this flow. Using flow visualization, we characterize the subcritical transition to turbulence in Couette-Poiseuille flow and show the existence of turbulent spots generated by a permanent perturbation. Due to the zero mean advection velocity of the base profile, these turbulent structures are nearly stationary. We distinguish two regions of the turbulent spot: the active turbulent core, which is characterized by waviness of the streaks similar to traveling waves, and the surrounding region, which includes in addition the weak undisturbed streaks and oblique waves at the laminar-turbulent interface. We also study the dependence of the size of these two regions on Reynolds number. Finally, we show that the traveling waves move in the downstream (Poiseuille) direction.
AU - Klotz, Lukasz
AU - Lemoult, Grégoire M
AU - Frontczak, Idalia
AU - Tuckerman, Laurette
AU - Wesfreid, José
ID - 513
IS - 4
JF - Physical Review Fluids
TI - Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence
VL - 2
ER -
TY - JOUR
AB - Orientation in space is represented in specialized brain circuits. Persistent head direction signals are transmitted from anterior thalamus to the presubiculum, but the identity of the presubicular target neurons, their connectivity and function in local microcircuits are unknown. Here, we examine how thalamic afferents recruit presubicular principal neurons and Martinotti interneurons, and the ensuing synaptic interactions between these cells. Pyramidal neuron activation of Martinotti cells in superficial layers is strongly facilitating such that high-frequency head directional stimulation efficiently unmutes synaptic excitation. Martinotti-cell feedback plays a dual role: precisely timed spikes may not inhibit the firing of in-tune head direction cells, while exerting lateral inhibition. Autonomous attractor dynamics emerge from a modelled network implementing wiring motifs and timing sensitive synaptic interactions in the pyramidal - Martinotti-cell feedback loop. This inhibitory microcircuit is therefore tuned to refine and maintain head direction information in the presubiculum.
AU - Simonnet, Jean
AU - Nassar, Mérie
AU - Stella, Federico
AU - Cohen, Ivan
AU - Mathon, Bertrand
AU - Boccara, Charlotte
AU - Miles, Richard
AU - Fricker, Desdemona
ID - 514
JF - Nature Communications
SN - 20411723
TI - Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum
VL - 8
ER -
TY - JOUR
AB - The oxidative phosphorylation electron transport chain (OXPHOS-ETC) of the inner mitochondrial membrane is composed of five large protein complexes, named CI-CV. These complexes convert energy from the food we eat into ATP, a small molecule used to power a multitude of essential reactions throughout the cell. OXPHOS-ETC complexes are organized into supercomplexes (SCs) of defined stoichiometry: CI forms a supercomplex with CIII2 and CIV (SC I+III2+IV, known as the respirasome), as well as with CIII2 alone (SC I+III2). CIII2 forms a supercomplex with CIV (SC III2+IV) and CV forms dimers (CV2). Recent cryo-EM studies have revealed the structures of SC I+III2+IV and SC I+III2. Furthermore, recent work has shed light on the assembly and function of the SCs. Here we review and compare these recent studies and discuss how they have advanced our understanding of mitochondrial electron transport.
AU - Letts, James A
AU - Sazanov, Leonid A
ID - 515
IS - 10
JF - Nature Structural and Molecular Biology
SN - 15459993
TI - Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain
VL - 24
ER -
TY - JOUR
AB - Cyanobacteria are mostly engineered to be sustainable cell-factories by genetic manipulations alone. Here, by modulating the concentration of allosteric effectors, we focus on increasing product formation without further burdening the cells with increased expression of enzymes. Resorting to a novel 96-well microplate cultivation system for cyanobacteria, and using lactate-producing strains of Synechocystis PCC6803 expressing different l-lactate dehydrogenases (LDH), we titrated the effect of 2,5-anhydro-mannitol supplementation. The latter acts in cells as a nonmetabolizable analogue of fructose 1,6-bisphosphate, a known allosteric regulator of one of the tested LDHs. In this strain (SAA023), we achieved over 2-fold increase of lactate productivity. Furthermore, we observed that as carbon is increasingly deviated during growth toward product formation, there is an increased fixation rate in the population of spontaneous mutants harboring an impaired production pathway. This is a challenge in the development of green cell factories, which may be countered by the incorporation in biotechnological processes of strategies such as the one pioneered here.
AU - Du, Wei
AU - Angermayr, Andreas
AU - Jongbloets, Joeri
AU - Molenaar, Douwe
AU - Bachmann, Herwig
AU - Hellingwerf, Klaas
AU - Branco Dos Santos, Filipe
ID - 520
IS - 3
JF - ACS Synthetic Biology
SN - 21615063
TI - Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803
VL - 6
ER -
TY - JOUR
AB - Let X and Y be proper metric spaces. We show that a coarsely n-to-1 map f:X→Y induces an n-to-1 map of Higson coronas. This viewpoint turns out to be successful in showing that the classical dimension raising theorems hold in large scale; that is, if f:X→Y is a coarsely n-to-1 map between proper metric spaces X and Y then asdim(Y)≤asdim(X)+n−1. Furthermore we introduce coarsely open coarsely n-to-1 maps, which include the natural quotient maps via a finite group action, and prove that they preserve the asymptotic dimension.
AU - Austin, Kyle
AU - Virk, Ziga
ID - 521
JF - Topology and its Applications
SN - 01668641
TI - Higson compactification and dimension raising
VL - 215
ER -
TY - JOUR
AB - The Casparian strip is an important barrier regulating water and nutrient uptake into root tissues. New research reveals two peptide signals and their co-receptors play critical roles patterning and maintaining barrier integrity.
AU - Daniel von Wangenheim
AU - Goh, Tatsuaki
AU - Dietrich, Daniela
AU - Bennett, Malcolm J
ID - 525
IS - 5
JF - Current Biology
TI - Plant biology: Building barriers… in roots
VL - 27
ER -
TY - JOUR
AB - The pituitary adenylyl cyclase-activating polypeptide (PACAP) and its G protein-coupled receptors, PAC1, VPAC1 and VPAC2 form a system involved in a variety of biological processes. Although some sympathetic stimulatory effects of this system have been reported, its central cardiovascular regulatory properties are poorly characterized. VPAC1 receptors are expressed in the nucleus ambiguus (nAmb), a key center controlling cardiac parasympathetic tone. In this study, we report that selective VPAC1 activation in rhodamine-labeled cardiac vagal preganglionic neurons of the rat nAmb produces inositol 1,4,5-trisphosphate receptor-mediated Ca2+ mobilization, membrane depolarization and activation of P/Q-type Ca2+ channels. In vivo, this pathway converges onto transient reduction in heart rate of conscious rats. Therefore we demonstrate a VPAC1-dependent mechanism in the central parasympathetic regulation of the heart rate, adding to the complexity of PACAP-mediated cardiovascular modulation.
AU - Gherghina, Florin L
AU - Tica, Andrei A
AU - Elena Deliu
AU - Abood, Mary E
AU - Brailoiu, G. Christina
AU - Brǎiloiu, Eugen
ID - 529
JF - Brain Research
TI - Effects of VPAC1 activation in nucleus ambiguus neurons
VL - 1657
ER -
TY - JOUR
AB - We investigate the complexity of finding an embedded non-orientable surface of Euler genus g in a triangulated 3-manifold. This problem occurs both as a natural question in low-dimensional topology, and as a first non-trivial instance of embeddability of complexes into 3-manifolds. We prove that the problem is NP-hard, thus adding to the relatively few hardness results that are currently known in 3-manifold topology. In addition, we show that the problem lies in NP when the Euler genus g is odd, and we give an explicit algorithm in this case.
AU - Burton, Benjamin
AU - De Mesmay, Arnaud N
AU - Wagner, Uli
ID - 534
IS - 4
JF - Discrete & Computational Geometry
SN - 01795376
TI - Finding non-orientable surfaces in 3-Manifolds
VL - 58
ER -
TY - JOUR
AB - Optogenetik und Photopharmakologie ermöglichen präzise räumliche und zeitliche Kontrolle von Proteinwechselwirkung und -funktion in Zellen und Tieren. Optogenetische Methoden, die auf grünes Licht ansprechen und zum Trennen von Proteinkomplexen geeignet sind, sind nichtweitläufig verfügbar, würden jedoch mehrfarbige Experimente zur Beantwortung von biologischen Fragestellungen ermöglichen. Hier demonstrieren wir die Verwendung von Cobalamin(Vitamin B12)-bindenden Domänen von bakteriellen CarH-Transkriptionsfaktoren zur Grünlicht-induzierten Dissoziation von Rezeptoren. Fusioniert mit dem Fibroblasten-W achstumsfaktor-Rezeptor 1 führten diese im Dunkeln in kultivierten Zellen zu Signalaktivität durch Oligomerisierung, welche durch Beleuchten umgehend aufgehoben wurde. In Zebrafischembryonen, die einen derartigen Rezeptor exprimieren, ermöglichte grünes Licht die Kontrolle über abnormale Signalaktivität während der Embryonalentwicklung.
AU - Kainrath, Stephanie
AU - Stadler, Manuela
AU - Gschaider-Reichhart, Eva
AU - Distel, Martin
AU - Janovjak, Harald L
ID - 538
IS - 16
JF - Angewandte Chemie
TI - Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen
VL - 129
ER -
TY - JOUR
AB - RNA-dependent RNA polymerases (RdRps) play a key role in the life cycle of RNA viruses and impact their immunobiology. The arenavirus lymphocytic choriomeningitis virus (LCMV) strain Clone 13 provides a benchmark model for studying chronic infection. A major genetic determinant for its ability to persist maps to a single amino acid exchange in the viral L protein, which exhibits RdRp activity, yet its functional consequences remain elusive. To unravel the L protein interactions with the host proteome, we engineered infectious L protein-tagged LCMV virions by reverse genetics. A subsequent mass-spectrometric analysis of L protein pulldowns from infected human cells revealed a comprehensive network of interacting host proteins. The obtained LCMV L protein interactome was bioinformatically integrated with known host protein interactors of RdRps from other RNA viruses, emphasizing interconnected modules of human proteins. Functional characterization of selected interactors highlighted proviral (DDX3X) as well as antiviral (NKRF, TRIM21) host factors. To corroborate these findings, we infected Trim21-/-mice with LCMV and found impaired virus control in chronic infection. These results provide insights into the complex interactions of the arenavirus LCMV and other viral RdRps with the host proteome and contribute to a better molecular understanding of how chronic viruses interact with their host.
AU - Khamina, Kseniya
AU - Lercher, Alexander
AU - Caldera, Michael
AU - Schliehe, Christopher
AU - Vilagos, Bojan
AU - Sahin, Mehmet
AU - Kosack, Lindsay
AU - Bhattacharya, Anannya
AU - Májek, Peter
AU - Stukalov, Alexey
AU - Sacco, Roberto
AU - James, Leo
AU - Pinschewer, Daniel
AU - Bennett, Keiryn
AU - Menche, Jörg
AU - Bergthaler, Andreas
ID - 540
IS - 12
JF - PLoS Pathogens
SN - 15537366
TI - Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein
VL - 13
ER -
TY - JOUR
AB - While we have good understanding of bacterial metabolism at the population level, we know little about the metabolic behavior of individual cells: do single cells in clonal populations sometimes specialize on different metabolic pathways? Such metabolic specialization could be driven by stochastic gene expression and could provide individual cells with growth benefits of specialization. We measured the degree of phenotypic specialization in two parallel metabolic pathways, the assimilation of glucose and arabinose. We grew Escherichia coli in chemostats, and used isotope-labeled sugars in combination with nanometer-scale secondary ion mass spectrometry and mathematical modeling to quantify sugar assimilation at the single-cell level. We found large variation in metabolic activities between single cells, both in absolute assimilation and in the degree to which individual cells specialize in the assimilation of different sugars. Analysis of transcriptional reporters indicated that this variation was at least partially based on cell-to-cell variation in gene expression. Metabolic differences between cells in clonal populations could potentially reduce metabolic incompatibilities between different pathways, and increase the rate at which parallel reactions can be performed.
AU - Nikolic, Nela
AU - Schreiber, Frank
AU - Dal Co, Alma
AU - Kiviet, Daniel
AU - Bergmiller, Tobias
AU - Littmann, Sten
AU - Kuypers, Marcel
AU - Ackermann, Martin
ID - 541
IS - 12
JF - PLoS Genetics
SN - 15537390
TI - Cell-to-cell variation and specialization in sugar metabolism in clonal bacterial populations
VL - 13
ER -
TY - CHAP
AB - Development of vascular tissue is a remarkable example of intercellular communication and coordinated development involving hormonal signaling and tissue polarity. Thus far, studies on vascular patterning and regeneration have been conducted mainly in trees—woody plants—with a well-developed layer of vascular cambium and secondary tissues. Trees are difficult to use as genetic models, i.e., due to long generation time, unstable environmental conditions, and lack of available mutants and transgenic lines. Therefore, the use of the main genetic model plant Arabidopsis thaliana (L.) Heynh., with a wealth of available marker and transgenic lines, provides a unique opportunity to address molecular mechanism of vascular tissue formation and regeneration. With specific treatments, the tiny weed Arabidopsis can serve as a model to understand the growth of mighty trees and interconnect a tree physiology with molecular genetics and cell biology of Arabidopsis.
AU - Mazur, Ewa
AU - Friml, Jirí
ED - Jurić, Snježana
ID - 545
T2 - Plant Engineering
TI - Vascular tissue development and regeneration in the model plant arabidopsis
ER -
TY - GEN
AB - In this report the implementation of the institutional data repository IST DataRep at IST Austria will be covered: Starting with the research phase when requirements for a repository were established, the procedure of choosing a repository-software and its customization based on the results of user-testings will be discussed. Followed by reflections on the marketing strategies in regard of impact, and at the end sharing some experiences of one year operating IST DataRep.
AU - Barbara Petritsch
ID - 5450
TI - Implementing the institutional data repository IST DataRep
ER -
TY - GEN
AB - A fundamental algorithmic problem at the heart of static analysis is Dyck reachability. The input is a graphwhere the edges are labeled with different types of opening and closing parentheses, and the reachabilityinformation is computed via paths whose parentheses are properly matched. We present new results for Dyckreachability 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 asfollows:First, we consider Dyck reachability on bidirected graphs, which is the standard way of performing field-sensitive points-to analysis. Given a bidirected graph withnnodes andmedges, we present: (i) an algorithmwith worst-case running timeO(m+n·α(n)), whereα(n)is the inverse Ackermann function, improving thepreviously knownO(n2)time bound; (ii) a matching lower bound that shows that our algorithm is optimalwrt to worst-case complexity; and (iii) an optimal average-case upper bound ofO(m)time, improving thepreviously knownO(m·logn)bound.Second, we consider the problem of context-sensitive data-dependence analysis, where the task is to obtainanalysis summaries of library code in the presence of callbacks. Our algorithm preprocesses libraries in almostlinear 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 MatrixMultiplication, which is a long-standing open problem. Thus we establish that the existing combinatorialalgorithms for Dyck reachability are (conditionally) optimal for general graphs. We also show that the samehardness holds for graphs of constant treewidth.Finally, we provide a prototype implementation of our algorithms for both alias analysis and data-dependenceanalysis. Our experimental evaluation demonstrates that the new algorithms significantly outperform allexisting methods on the two problems, over real-world benchmarks.
AU - Chatterjee, Krishnendu
AU - Choudhary, Bhavya
AU - Pavlogiannis, Andreas
ID - 5455
SN - 2664-1690
TI - Optimal Dyck reachability for data-dependence and alias analysis
ER -
TY - GEN
AB - We present a new dynamic partial-order reduction method for stateless model checking of concurrent programs. A common approach for exploring program behaviors relies on enumerating the traces of the program, without storing the visited states (aka stateless exploration). As the number of distinct traces grows exponentially, dynamic partial-order reduction (DPOR) techniques have been successfully used to partition the space of traces into equivalence classes (Mazurkiewicz partitioning), with the goal of exploring only few representative traces from each class.
We introduce a new equivalence on traces under sequential consistency semantics, which we call the observation equivalence. Two traces are observationally equivalent if every read event observes the same write event in both traces. While the traditional Mazurkiewicz equivalence is control-centric, our new definition is data-centric. We show that our observation equivalence is coarser than the Mazurkiewicz equivalence, and in many cases even exponentially coarser. We devise a DPOR exploration of the trace space, called data-centric DPOR, based on the observation equivalence.
1. For acyclic architectures, our algorithm is guaranteed to explore exactly one representative trace from each observation class, while spending polynomial time per class. Hence, our algorithm is optimal wrt the observation equivalence, and in several cases explores exponentially fewer traces than any enumerative method based on the Mazurkiewicz equivalence.
2. For cyclic architectures, we consider an equivalence between traces which is finer than the observation equivalence; but coarser than the Mazurkiewicz equivalence, and in some cases is exponentially coarser. Our data-centric DPOR algorithm remains optimal under this trace equivalence.
Finally, we perform a basic experimental comparison between the existing Mazurkiewicz-based DPOR and our data-centric DPOR on a set of academic benchmarks. Our results show a significant reduction in both running time and the number of explored equivalence classes.
AU - Chalupa, Marek
AU - Chatterjee, Krishnendu
AU - Pavlogiannis, Andreas
AU - Sinha, Nishant
AU - Vaidya, Kapil
ID - 5456
SN - 2664-1690
TI - Data-centric dynamic partial order reduction
ER -
TY - JOUR
AB - In this work maximum entropy distributions in the space of steady states of metabolic networks are considered upon constraining the first and second moments of the growth rate. Coexistence of fast and slow phenotypes, with bimodal flux distributions, emerges upon considering control on the average growth (optimization) and its fluctuations (heterogeneity). This is applied to the carbon catabolic core of Escherichia coli where it quantifies the metabolic activity of slow growing phenotypes and it provides a quantitative map with metabolic fluxes, opening the possibility to detect coexistence from flux data. A preliminary analysis on data for E. coli cultures in standard conditions shows degeneracy for the inferred parameters that extend in the coexistence region.
AU - De Martino, Daniele
ID - 548
IS - 6
JF - Physical Review E
SN - 24700045
TI - Maximum entropy modeling of metabolic networks by constraining growth-rate moments predicts coexistence of phenotypes
VL - 96
ER -
TY - CONF
AB - Model checking is usually based on a comprehensive traversal of the state space. Causality-based model checking is a radically different approach that instead analyzes the cause-effect relationships in a program. We give an overview on a new class of model checking algorithms that capture the causal relationships in a special data structure called concurrent traces. Concurrent traces identify key events in an execution history and link them through their cause-effect relationships. The model checker builds a tableau of concurrent traces, where the case splits represent different causal explanations of a hypothetical error. Causality-based model checking has been implemented in the ARCTOR tool, and applied to previously intractable multi-threaded benchmarks.
AU - Finkbeiner, Bernd
AU - Kupriyanov, Andrey
ID - 549
SN - 20752180
T2 - Electronic Proceedings in Theoretical Computer Science
TI - Causality-based model checking
VL - 259
ER -
TY - JOUR
AB - For large random matrices X with independent, centered entries but not necessarily identical variances, the eigenvalue density of XX* is well-approximated by a deterministic measure on ℝ. We show that the density of this measure has only square and cubic-root singularities away from zero. We also extend the bulk local law in [5] to the vicinity of these singularities.
AU - Alt, Johannes
ID - 550
JF - Electronic Communications in Probability
SN - 1083589X
TI - Singularities of the density of states of random Gram matrices
VL - 22
ER -
TY - CONF
AB - Evolutionary graph theory studies the evolutionary dynamics in a population structure given as a connected graph. Each node of the graph represents an individual of the population, and edges determine how offspring are placed. We consider the classical birth-death Moran process where there are two types of individuals, namely, the residents with fitness 1 and mutants with fitness r. The fitness indicates the reproductive strength. The evolutionary dynamics happens as follows: in the initial step, in a population of all resident individuals a mutant is introduced, and then at each step, an individual is chosen proportional to the fitness of its type to reproduce, and the offspring replaces a neighbor uniformly at random. The process stops when all individuals are either residents or mutants. The probability that all individuals in the end are mutants is called the fixation probability, which is a key factor in the rate of evolution. We consider the problem of approximating the fixation probability. The class of algorithms that is extremely relevant for approximation of the fixation probabilities is the Monte-Carlo simulation of the process. Previous results present a polynomial-time Monte-Carlo algorithm for undirected graphs when r is given in unary. First, we present a simple modification: instead of simulating each step, we discard ineffective steps, where no node changes type (i.e., either residents replace residents, or mutants replace mutants). Using the above simple modification and our result that the number of effective steps is concentrated around the expected number of effective steps, we present faster polynomial-time Monte-Carlo algorithms for undirected graphs. Our algorithms are always at least a factor O(n2/ log n) faster as compared to the previous algorithms, where n is the number of nodes, and is polynomial even if r is given in binary. We also present lower bounds showing that the upper bound on the expected number of effective steps we present is asymptotically tight for undirected graphs.
AU - Chatterjee, Krishnendu
AU - Ibsen-Jensen, Rasmus
AU - Nowak, Martin
ID - 551
SN - 978-395977046-0
T2 - Leibniz International Proceedings in Informatics
TI - Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs
VL - 83
ER -
TY - CONF
AB - Graph games provide the foundation for modeling and synthesis of reactive processes. Such games are played over graphs where the vertices are controlled by two adversarial players. We consider graph games where the objective of the first player is the conjunction of a qualitative objective (specified as a parity condition) and a quantitative objective (specified as a meanpayoff condition). There are two variants of the problem, namely, the threshold problem where the quantitative goal is to ensure that the mean-payoff value is above a threshold, and the value problem where the quantitative goal is to ensure the optimal mean-payoff value; in both cases ensuring the qualitative parity objective. The previous best-known algorithms for game graphs with n vertices, m edges, parity objectives with d priorities, and maximal absolute reward value W for mean-payoff objectives, are as follows: O(nd+1 . m . w) for the threshold problem, and O(nd+2 · m · W) for the value problem. Our main contributions are faster algorithms, and the running times of our algorithms are as follows: O(nd-1 · m ·W) for the threshold problem, and O(nd · m · W · log(n · W)) for the value problem. For mean-payoff parity objectives with two priorities, our algorithms match the best-known bounds of the algorithms for mean-payoff games (without conjunction with parity objectives). Our results are relevant in synthesis of reactive systems with both functional requirement (given as a qualitative objective) and performance requirement (given as a quantitative objective).
AU - Chatterjee, Krishnendu
AU - Henzinger, Monika
AU - Svozil, Alexander
ID - 552
SN - 978-395977046-0
T2 - Leibniz International Proceedings in Informatics
TI - Faster algorithms for mean payoff parity games
VL - 83
ER -
TY - CONF
AB - We consider two player, zero-sum, finite-state concurrent reachability games, played for an infinite number of rounds, where in every round, each player simultaneously and independently of the other players chooses an action, whereafter the successor state is determined by a probability distribution given by the current state and the chosen actions. Player 1 wins iff a designated goal state is eventually visited. We are interested in the complexity of stationary strategies measured by their patience, which is defined as the inverse of the smallest non-zero probability employed. Our main results are as follows: We show that: (i) the optimal bound on the patience of optimal and -optimal strategies, for both players is doubly exponential; and (ii) even in games with a single non-absorbing state exponential (in the number of actions) patience is necessary.
AU - Chatterjee, Krishnendu
AU - Hansen, Kristofer
AU - Ibsen-Jensen, Rasmus
ID - 553
SN - 978-395977046-0
T2 - Leibniz International Proceedings in Informatics
TI - Strategy complexity of concurrent safety games
VL - 83
ER -
TY - DATA
AB - Strong amplifiers of natural selection
AU - Pavlogiannis, Andreas
AU - Tkadlec, Josef
AU - Chatterjee, Krishnendu
AU - Nowak , Martin
ID - 5559
KW - natural selection
TI - Strong amplifiers of natural selection
ER -
TY - DATA
AB - This repository contains the data collected for the manuscript "Biased partitioning of the multi-drug efflux pump AcrAB-TolC underlies long-lived phenotypic heterogeneity".
The data is compressed into a single archive. Within the archive, different folders correspond to figures of the main text and the SI of the related publication.
Data is saved as plain text, with each folder containing a separate readme file describing the format. Typically, the data is from fluorescence microscopy measurements of single cells growing in a microfluidic "mother machine" device, and consists of relevant values (primarily arbitrary unit or normalized fluorescence measurements, and division times / growth rates) after raw microscopy images have been processed, segmented, and their features extracted, as described in the methods section of the related publication.
AU - Bergmiller, Tobias
AU - Andersson, Anna M
AU - Tomasek, Kathrin
AU - Balleza, Enrique
AU - Kiviet, Daniel
AU - Hauschild, Robert
AU - Tkacik, Gasper
AU - Guet, Calin C
ID - 5560
KW - single cell microscopy
KW - mother machine microfluidic device
KW - AcrAB-TolC pump
KW - multi-drug efflux
KW - Escherichia coli
TI - Biased partitioning of the multi-drug efflux pump AcrAB-TolC underlies long-lived phenotypic heterogeneity
ER -
TY - DATA
AB - Graph matching problems as described in "Active Graph Matching for Automatic Joint Segmentation and Annotation of C. Elegans." by Kainmueller, Dagmar and Jug, Florian and Rother, Carsten and Myers, Gene, MICCAI 2014. Problems are in OpenGM2 hdf5 format (see http://hciweb2.iwr.uni-heidelberg.de/opengm/) and a custom text format used by the feature matching solver described in "Feature Correspondence via Graph Matching: Models and Global Optimization." by Lorenzo Torresani, Vladimir Kolmogorov and Carsten Rother, ECCV 2008, code at http://pub.ist.ac.at/~vnk/software/GraphMatching-v1.02.src.zip.
AU - Kainmueller, Dagmar
AU - Jug, Florian
AU - Rother, Carsten
AU - Meyers, Gene
ID - 5561
KW - graph matching
KW - feature matching
KW - QAP
KW - MAP-inference
TI - Graph matching problems for annotating C. Elegans
ER -
TY - DATA
AB - This data was collected as part of the study [1]. It consists of preprocessed multi-electrode array recording from 160 salamander retinal ganglion cells responding to 297 repeats of a 19 s natural movie. The data is available in two formats: (1) a .mat file containing an array with dimensions “number of repeats” x “number of neurons” x “time in a repeat”; (2) a zipped .txt file containing the same data represented as an array with dimensions “number of neurons” x “number of samples”, where the number of samples is equal to the product of the number of repeats and timebins within a repeat. The time dimension is divided into 20 ms time windows, and the array is binary indicating whether a given cell elicited at least one spike in a given time window during a particular repeat. See the reference below for details regarding collection and preprocessing:
[1] Tkačik G, Marre O, Amodei D, Schneidman E, Bialek W, Berry MJ II. Searching for Collective Behavior in a Large Network of Sensory Neurons. PLoS Comput Biol. 2014;10(1):e1003408.
AU - Marre, Olivier
AU - Tkacik, Gasper
AU - Amodei, Dario
AU - Schneidman, Elad
AU - Bialek, William
AU - Berry, Michael
ID - 5562
KW - multi-electrode recording
KW - retinal ganglion cells
TI - Multi-electrode array recording from salamander retinal ganglion cells
ER -
TY - DATA
AB - MATLAB code and processed datasets available for reproducing the results in:
Lukačišin, M.*, Landon, M.*, Jajoo, R*. (2016) Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.
*equal contributions
AU - Lukacisin, Martin
ID - 5563
TI - MATLAB analysis code for 'Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast'
ER -
TY - DATA
AB - Compressed Fastq files with whole-genome sequencing data of IS-wt strain D and clones from four evolved populations (A11, C08, C10, D08). Information on this data collection is available in the Methods Section of the primary publication.
AU - Steinrück, Magdalena
AU - Guet, Calin C
ID - 5564
TI - Fastq files for "Complex chromosomal neighborhood effects determine the adaptive potential of a gene under selection"
ER -
TY - DATA
AB - One of the key questions in understanding plant development is how single cells behave in a larger context of the tissue. Therefore, it requires the observation of the whole organ with a high spatial- as well as temporal resolution over prolonged periods of time, which may cause photo-toxic effects. This protocol shows a plant sample preparation method for light-sheet microscopy, which is characterized by mounting the plant vertically on the surface of a gel. The plant is mounted in such a way that the roots are submerged in a liquid medium while the leaves remain in the air. In order to ensure photosynthetic activity of the plant, a custom-made lighting system illuminates the leaves. To keep the roots in darkness the water surface is covered with sheets of black plastic foil. This method allows long-term imaging of plant organ development in standardized conditions.
The Video is licensed under a CC BY NC ND license.
AU - Von Wangenheim, Daniel
AU - Hauschild, Robert
AU - Friml, Jirí
ID - 5565
TI - Light Sheet Fluorescence microscopy of plant roots growing on the surface of a gel
ER -
TY - DATA
AB - Current minimal version of TipTracker
AU - Hauschild, Robert
ID - 5566
KW - tool
KW - tracking
KW - confocal microscopy
TI - Live tracking of moving samples in confocal microscopy for vertically grown roots
ER -
TY - DATA
AB - Immunological synapse DC-Tcells
AU - Leithner, Alexander F
ID - 5567
KW - Immunological synapse
TI - Immunological synapse DC-Tcells
ER -
TY - DATA
AB - Includes source codes, test cases, and example data used in the thesis Brittle Fracture Simulation with Boundary Elements for Computer Graphics. Also includes pre-built binaries of the HyENA library, but not sources - please contact the HyENA authors to obtain these sources if required (https://mech.tugraz.at/hyena)
AU - Hahn, David
ID - 5568
KW - Boundary elements
KW - brittle fracture
KW - computer graphics
KW - fracture simulation
TI - Source codes: Brittle fracture simulation with boundary elements for computer graphics
ER -
TY - JOUR
AB - PURPOSE. Gene therapy of retinal ganglion cells (RGCs) has promise as a powerful therapeutic for the rescue and regeneration of these cells after optic nerve damage. However, early after damage, RGCs undergo atrophic changes, including gene silencing. It is not known if these changes will deleteriously affect transduction and transgene expression, or if the therapeutic protein can influence reactivation of the endogenous genome. METHODS. Double-transgenic mice carrying a Rosa26-(LoxP)-tdTomato reporter, and a mutant allele for the proapoptotic Bax gene were reared. The Bax mutant blocks apoptosis, but RGCs still exhibit nuclear atrophy and gene silencing. At times ranging from 1 hour to 4 weeks after optic nerve crush (ONC), eyes received an intravitreal injection of AAV2 virus carrying the Cre recombinase. Successful transduction was monitored by expression of the tdTomato reporter. Immunostaining was used to localize tdTomato expression in select cell types. RESULTS. Successful transduction of RGCs was achieved at all time points after ONC using AAV2 expressing Cre from the phosphoglycerate kinase (Pgk) promoter, but not the CMV promoter. ONC promoted an increase in the transduction of cell types in the inner nuclear layer, including Müller cells and rod bipolar neurons. There was minimal evidence of transduction of amacrine cells and astrocytes in the inner retina or optic nerve. CONCLUSIONS. Damaged RGCs can be transduced and at least some endogenous genes can be subsequently activated. Optic nerve damage may change retinal architecture to allow greater penetration of an AAV2 virus to transduce several additional cell types in the inner nuclear layer.
AU - Nickells, Robert
AU - Schmitt, Heather
AU - Maes, Margaret E
AU - Schlamp, Cassandra
ID - 557
IS - 14
JF - Investigative Ophthalmology and Visual Science
SN - 01460404
TI - AAV2 mediated transduction of the mouse retina after optic nerve injury
VL - 58
ER -
TY - DATA
AB - Matlab script to calculate the forward migration indexes (/) from TrackMate spot-statistics files.
AU - Hauschild, Robert
ID - 5570
KW - Cell migration
KW - tracking
KW - forward migration index
KW - FMI
TI - Forward migration indexes
ER -
TY - DATA
AB - This folder contains all the data used in each of the main figures of "The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology" (Kelemen, R., Vicoso, B.), as well as in the supplementary figures.
AU - Vicoso, Beatriz
ID - 5571
TI - Data for "The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology"
ER -
TY - DATA
AB - Code described in the Supplementary Methods of "The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology" (Kelemen, R., Vicoso, B.)
AU - Vicoso, Beatriz
ID - 5572
TI - Code for "The genomic characterization of the t-haplotype, a mouse meiotic driver, highlights its complex history and specialized biology"
ER -
TY - JOUR
AB - Immune specificity is the degree to which a host’s immune system discriminates among various pathogens or antigenic variants. Vertebrate immune memory is highly specific due to antibody responses. On the other hand, some invertebrates show immune priming, i.e. improved survival after secondary exposure to a previously encountered pathogen. Until now, specificity of priming has only been demonstrated via the septic infection route or when live pathogens were used for priming. Therefore, we tested for specificity in the oral priming route in the red flour beetle, Tribolium castaneum. For priming, we used pathogen-free supernatants derived from three different strains of the entomopathogen, Bacillus thuringiensis, which express different Cry toxin variants known for their toxicity against this beetle. Subsequent exposure to the infective spores showed that oral priming was specific for two naturally occurring strains, while a third engineered strain did not induce any priming effect. Our data demonstrate that oral immune priming with a non-infectious bacterial agent can be specific, but the priming effect is not universal across all bacterial strains.
AU - Futo, Momir
AU - Sell, Marie
AU - Kutzer, Megan
AU - Kurtz, Joachim
ID - 558
IS - 12
JF - Biology Letters
SN - 17449561
TI - Specificity of oral immune priming in the red flour beetle Tribolium castaneum
VL - 13
ER -
TY - CONF
AB - Proofs of space (PoS) were suggested as more ecological and economical alternative to proofs of work, which are currently used in blockchain designs like Bitcoin. The existing PoS are based on rather sophisticated graph pebbling lower bounds. Much simpler and in several aspects more efficient schemes based on inverting random functions have been suggested, but they don’t give meaningful security guarantees due to existing time-memory trade-offs. In particular, Hellman showed that any permutation over a domain of size N can be inverted in time T by an algorithm that is given S bits of auxiliary information whenever (Formula presented). For functions Hellman gives a weaker attack with S2· T≈ N2 (e.g., S= T≈ N2/3). To prove lower bounds, one considers an adversary who has access to an oracle f: [ N] → [N] and can make T oracle queries. The best known lower bound is S· T∈ Ω(N) and holds for random functions and permutations. We construct functions that provably require more time and/or space to invert. Specifically, for any constant k we construct a function [N] → [N] that cannot be inverted unless Sk· T∈ Ω(Nk) (in particular, S= T≈ (Formula presented). Our construction does not contradict Hellman’s time-memory trade-off, because it cannot be efficiently evaluated in forward direction. However, its entire function table can be computed in time quasilinear in N, which is sufficient for the PoS application. Our simplest construction is built from a random function oracle g: [N] × [N] → [ N] and a random permutation oracle f: [N] → N] and is defined as h(x) = g(x, x′) where f(x) = π(f(x′)) with π being any involution without a fixed point, e.g. flipping all the bits. For this function we prove that any adversary who gets S bits of auxiliary information, makes at most T oracle queries, and inverts h on an ϵ fraction of outputs must satisfy S2· T∈ Ω(ϵ2N2).
AU - Abusalah, Hamza M
AU - Alwen, Joel F
AU - Cohen, Bram
AU - Khilko, Danylo
AU - Pietrzak, Krzysztof Z
AU - Reyzin, Leonid
ID - 559
SN - 978-331970696-2
TI - Beyond Hellman’s time-memory trade-offs with applications to proofs of space
VL - 10625
ER -
TY - JOUR
AB - In a recent article (Jentzen et al. 2016 Commun. Math. Sci. 14, 1477–1500 (doi:10.4310/CMS.2016.v14. n6.a1)), it has been established that, for every arbitrarily slow convergence speed and every natural number d ? {4, 5, . . .}, there exist d-dimensional stochastic differential equations with infinitely often differentiable and globally bounded coefficients such that no approximation method based on finitely many observations of the driving Brownian motion can converge in absolute mean to the solution faster than the given speed of convergence. In this paper, we strengthen the above result by proving that this slow convergence phenomenon also arises in two (d = 2) and three (d = 3) space dimensions.
AU - Gerencser, Mate
AU - Jentzen, Arnulf
AU - Salimova, Diyora
ID - 560
IS - 2207
JF - Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
SN - 13645021
TI - On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions
VL - 473
ER -
TY - JOUR
AB - Restriction–modification systems are widespread genetic elements that protect bacteria from bacteriophage infections by recognizing and cleaving heterologous DNA at short, well-defined sequences called restriction sites. Bioinformatic evidence shows that restriction sites are significantly underrepresented in bacteriophage genomes, presumably because bacteriophages with fewer restriction sites are more likely to escape cleavage by restriction–modification systems. However, how mutations in restriction sites affect the likelihood of bacteriophage escape is unknown. Using the bacteriophage l and the restriction–modification system EcoRI, we show that while mutation effects at different restriction sites are unequal, they are independent. As a result, the probability of bacteriophage escape increases with each mutated restriction site. Our results experimentally support the role of restriction site avoidance as a response to selection imposed by restriction–modification systems and offer an insight into the events underlying the process of bacteriophage escape.
AU - Pleska, Maros
AU - Guet, Calin C
ID - 561
IS - 12
JF - Biology Letters
SN - 17449561
TI - Effects of mutations in phage restriction sites during escape from restriction–modification
VL - 13
ER -
TY - BOOK
AB - This book is a concise and self-contained introduction of recent techniques to prove local spectral universality for large random matrices. Random matrix theory is a fast expanding research area, and this book mainly focuses on the methods that the authors participated in developing over the past few years. Many other interesting topics are not included, and neither are several new developments within the framework of these methods. The authors have chosen instead to present key concepts that they believe are the core of these methods and should be relevant for future applications. They keep technicalities to a minimum to make the book accessible to graduate students. With this in mind, they include in this book the basic notions and tools for high-dimensional analysis, such as large deviation, entropy, Dirichlet form, and the logarithmic Sobolev inequality.
AU - Erdös, László
AU - Yau, Horng
ID - 567
SN - 9781470436483
TI - A dynamical approach to random matrix theory
VL - 28
ER -
TY - JOUR
AB - We study robust properties of zero sets of continuous maps f: X → ℝn. Formally, we analyze the family Z< r(f) := (g-1(0): ||g - f|| < r) of all zero sets of all continuous maps g closer to f than r in the max-norm. All of these sets are outside A := (x: |f(x)| ≥ r) and we claim that Z< r(f) is fully determined by A and an element of a certain cohomotopy group which (by a recent result) is computable whenever the dimension of X is at most 2n - 3. By considering all r > 0 simultaneously, the pointed cohomotopy groups form a persistence module-a structure leading to persistence diagrams as in the case of persistent homology or well groups. Eventually, we get a descriptor of persistent robust properties of zero sets that has better descriptive power (Theorem A) and better computability status (Theorem B) than the established well diagrams. Moreover, if we endow every point of each zero set with gradients of the perturbation, the robust description of the zero sets by elements of cohomotopy groups is in some sense the best possible (Theorem C).
AU - Franek, Peter
AU - Krcál, Marek
ID - 568
IS - 2
JF - Homology, Homotopy and Applications
SN - 15320073
TI - Persistence of zero sets
VL - 19
ER -
TY - JOUR
AB - The actomyosin ring generates force to ingress the cytokinetic cleavage furrow in animal cells, yet its filament organization and the mechanism of contractility is not well understood. We quantified actin filament order in human cells using fluorescence polarization microscopy and found that cleavage furrow ingression initiates by contraction of an equatorial actin network with randomly oriented filaments. The network subsequently gradually reoriented actin filaments along the cell equator. This strictly depended on myosin II activity, suggesting local network reorganization by mechanical forces. Cortical laser microsurgery revealed that during cytokinesis progression, mechanical tension increased substantially along the direction of the cell equator, while the network contracted laterally along the pole-to-pole axis without a detectable increase in tension. Our data suggest that an asymmetric increase in cortical tension promotes filament reorientation along the cytokinetic cleavage furrow, which might have implications for diverse other biological processes involving actomyosin rings.
AU - Spira, Felix
AU - Cuylen Haering, Sara
AU - Mehta, Shalin
AU - Samwer, Matthias
AU - Reversat, Anne
AU - Verma, Amitabh
AU - Oldenbourg, Rudolf
AU - Sixt, Michael K
AU - Gerlich, Daniel
ID - 569
JF - eLife
SN - 2050084X
TI - Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments
VL - 6
ER -
TY - JOUR
AB - Most phenotypes are determined by molecular systems composed of specifically interacting molecules. However, unlike for individual components, little is known about the distributions of mutational effects of molecular systems as a whole. We ask how the distribution of mutational effects of a transcriptional regulatory system differs from the distributions of its components, by first independently, and then simultaneously, mutating a transcription factor and the associated promoter it represses. We find that the system distribution exhibits increased phenotypic variation compared to individual component distributions - an effect arising from intermolecular epistasis between the transcription factor and its DNA-binding site. In large part, this epistasis can be qualitatively attributed to the structure of the transcriptional regulatory system and could therefore be a common feature in prokaryotes. Counter-intuitively, intermolecular epistasis can alleviate the constraints of individual components, thereby increasing phenotypic variation that selection could act on and facilitating adaptive evolution.
AU - Lagator, Mato
AU - Sarikas, Srdjan
AU - Acar, Hande
AU - Bollback, Jonathan P
AU - Guet, Calin C
ID - 570
JF - eLife
SN - 2050084X
TI - Regulatory network structure determines patterns of intermolecular epistasis
VL - 6
ER -
TY - JOUR
AB - Blood platelets are critical for hemostasis and thrombosis and play diverse roles during immune responses. Despite these versatile tasks in mammalian biology, their skills on a cellular level are deemed limited, mainly consisting in rolling, adhesion, and aggregate formation. Here, we identify an unappreciated asset of platelets and show that adherent platelets use adhesion receptors to mechanically probe the adhesive substrate in their local microenvironment. When actomyosin-dependent traction forces overcome substrate resistance, platelets migrate and pile up the adhesive substrate together with any bound particulate material. They use this ability to act as cellular scavengers, scanning the vascular surface for potential invaders and collecting deposited bacteria. Microbe collection by migrating platelets boosts the activity of professional phagocytes, exacerbating inflammatory tissue injury in sepsis. This assigns platelets a central role in innate immune responses and identifies them as potential targets to dampen inflammatory tissue damage in clinical scenarios of severe systemic infection. In addition to their role in thrombosis and hemostasis, platelets can also migrate to sites of infection to help trap bacteria and clear the vascular surface.
AU - Gärtner, Florian R
AU - Ahmad, Zerkah
AU - Rosenberger, Gerhild
AU - Fan, Shuxia
AU - Nicolai, Leo
AU - Busch, Benjamin
AU - Yavuz, Gökce
AU - Luckner, Manja
AU - Ishikawa Ankerhold, Hellen
AU - Hennel, Roman
AU - Benechet, Alexandre
AU - Lorenz, Michael
AU - Chandraratne, Sue
AU - Schubert, Irene
AU - Helmer, Sebastian
AU - Striednig, Bianca
AU - Stark, Konstantin
AU - Janko, Marek
AU - Böttcher, Ralph
AU - Verschoor, Admar
AU - Leon, Catherine
AU - Gachet, Christian
AU - Gudermann, Thomas
AU - Mederos Y Schnitzler, Michael
AU - Pincus, Zachary
AU - Iannacone, Matteo
AU - Haas, Rainer
AU - Wanner, Gerhard
AU - Lauber, Kirsten
AU - Sixt, Michael K
AU - Massberg, Steffen
ID - 571
IS - 6
JF - Cell Press
SN - 00928674
TI - Migrating platelets are mechano scavengers that collect and bundle bacteria
VL - 171
ER -
TY - JOUR
AB - In this review, we summarize the different biosynthesis-related pathways that contribute to the regulation of endogenous auxin in plants. We demonstrate that all known genes involved in auxin biosynthesis also have a role in root formation, from the initiation of a root meristem during embryogenesis to the generation of a functional root system with a primary root, secondary lateral root branches and adventitious roots. Furthermore, the versatile adaptation of root development in response to environmental challenges is mediated by both local and distant control of auxin biosynthesis. In conclusion, auxin homeostasis mediated by spatial and temporal regulation of auxin biosynthesis plays a central role in determining root architecture.
AU - Olatunji, Damilola
AU - Geelen, Danny
AU - Verstraeten, Inge
ID - 572
IS - 12
JF - International Journal of Molecular Sciences
TI - Control of endogenous auxin levels in plant root development
VL - 18
ER -
TY - JOUR
AB - We construct a polyhedral surface called a graceful surface, which provides best possible approximation to a given sphere regarding certain criteria. In digital geometry terms, the graceful surface is uniquely characterized by its minimality while guaranteeing the connectivity of certain discrete (polyhedral) curves defined on it. The notion of “gracefulness” was first proposed in Brimkov and Barneva (1999) and shown to be useful for triangular mesh discretization through graceful planes and graceful lines. In this paper we extend the considerations to a nonlinear object such as a sphere. In particular, we investigate the properties of a discrete geodesic path between two voxels and show that discrete 3D circles, circular arcs, and Mobius triangles are all constructible on a graceful sphere, with guaranteed minimum thickness and the desired connectivity in the discrete topological space.
AU - Biswas, Ranita
AU - Bhowmick, Partha
AU - Brimkov, Valentin E.
ID - 5799
JF - Discrete Applied Mathematics
SN - 0166-218X
TI - On the polyhedra of graceful spheres and circular geodesics
VL - 216
ER -
TY - JOUR
AB - This paper presents a novel study on the functional gradation of coordinate planes in connection with the thinnest and tunnel-free (i.e., naive) discretization of sphere in the integer space. For each of the 48-symmetric quadraginta octants of naive sphere with integer radius and integer center, we show that the corresponding voxel set forms a bijection with its projected pixel set on a unique coordinate plane, which thereby serves as its functional plane. We use this fundamental property to prove several other theoretical results for naive sphere. First, the quadraginta octants form symmetry groups and subgroups with certain equivalent topological properties. Second, a naive sphere is always unique and consists of fewest voxels. Third, it is efficiently constructible from its functional-plane projection. And finally, a special class of 4-symmetric discrete 3D circles can be constructed on a naive sphere based on back projection from the functional plane.
AU - Biswas, Ranita
AU - Bhowmick, Partha
ID - 5800
IS - 1
JF - Journal of Mathematical Imaging and Vision
SN - 09249907
TI - On the functionality and usefulness of Quadraginta octants of naive sphere
VL - 59
ER -
TY - CONF
AB - Space filling circles and spheres have various applications in mathematical imaging and physical modeling. In this paper, we first show how the thinnest (i.e., 2-minimal) model of digital sphere can be augmented to a space filling model by fixing certain “simple voxels” and “filler voxels” associated with it. Based on elementary number-theoretic properties of such voxels, we design an efficient incremental algorithm for generation of these space filling spheres with successively increasing radius. The novelty of the proposed technique is established further through circular space filling on 3D digital plane. As evident from a preliminary set of experimental result, this can particularly be useful for parallel computing of 3D Voronoi diagrams in the digital space.
AU - Dwivedi, Shivam
AU - Gupta, Aniket
AU - Roy, Siddhant
AU - Biswas, Ranita
AU - Bhowmick, Partha
ID - 5801
SN - 0302-9743
TI - Fast and Efficient Incremental Algorithms for Circular and Spherical Propagation in Integer Space
VL - 10502
ER -
TY - CONF
AB - This papers introduces a definition of digital primitives based on focal points and weighted distances (with positive weights). The proposed definition is applicable to general dimensions and covers in its gamut various regular curves and surfaces like circles, ellipses, digital spheres and hyperspheres, ellipsoids and k-ellipsoids, Cartesian k-ovals, etc. Several interesting properties are presented for this class of digital primitives such as space partitioning, topological separation, and connectivity properties. To demonstrate further the potential of this new way of defining digital primitives, we propose, as extension, another class of digital conics defined by focus-directrix combination.
AU - Andres, Eric
AU - Biswas, Ranita
AU - Bhowmick, Partha
ID - 5802
SN - 0302-9743
TI - Digital Primitives Defined by Weighted Focal Set
VL - 10502
ER -
TY - CHAP
AB - Different distance metrics produce Voronoi diagrams with different properties. It is a well-known that on the (real) 2D plane or even on any 3D plane, a Voronoi diagram (VD) based on the Euclidean distance metric produces convex Voronoi regions. In this paper, we first show that this metric produces a persistent VD on the 2D digital plane, as it comprises digitally convex Voronoi regions and hence correctly approximates the corresponding VD on the 2D real plane. Next, we show that on a 3D digital plane D, the Euclidean metric spanning over its voxel set does not guarantee a digital VD which is persistent with the real-space VD. As a solution, we introduce a novel concept of functional-plane-convexity, which is ensured by the Euclidean metric spanning over the pedal set of D. Necessary proofs and some visual result have been provided to adjudge the merit and usefulness of the proposed concept.
AU - Biswas, Ranita
AU - Bhowmick, Partha
ID - 5803
SN - 0302-9743
T2 - Combinatorial image analysis
TI - Construction of Persistent Voronoi Diagram on 3D Digital Plane
VL - 10256
ER -
TY - JOUR
AB - Bell correlations, indicating nonlocality in composite quantum systems, were until recently only seen in small systems. Here, we demonstrate Bell correlations in squeezed states of 5×105 Rb87 atoms. The correlations are inferred using collective measurements as witnesses and are statistically significant to 124 standard deviations. The states are both generated and characterized using optical-cavity aided measurements.
AU - Engelsen, Nils
AU - Krishnakumar, Rajiv
AU - Hosten, Onur
AU - Kasevich, Mark
ID - 593
IS - 14
JF - Physical Review Letters
TI - Bell correlations in spin-squeezed states of 500 000 atoms
VL - 118
ER -
TY - JOUR
AB - Transcription initiation at the ribosomal RNA promoter requires RNA polymerase (Pol) I and the initiation factors Rrn3 and core factor (CF). Here, we combine X-ray crystallography and cryo-electron microscopy (cryo-EM) to obtain a molecular model for basal Pol I initiation. The three-subunit CF binds upstream promoter DNA, docks to the Pol I-Rrn3 complex, and loads DNA into the expanded active center cleft of the polymerase. DNA unwinding between the Pol I protrusion and clamp domains enables cleft contraction, resulting in an active Pol I conformation and RNA synthesis. Comparison with the Pol II system suggests that promoter specificity relies on a distinct “bendability” and “meltability” of the promoter sequence that enables contacts between initiation factors, DNA, and polymerase.
AU - Engel, Christoph
AU - Gubbey, Tobias
AU - Neyer, Simon
AU - Sainsbury, Sarah
AU - Oberthuer, Christiane
AU - Baejen, Carlo
AU - Bernecky, Carrie A
AU - Cramer, Patrick
ID - 600
IS - 1
JF - Cell
SN - 00928674
TI - Structural basis of RNA polymerase I transcription initiation
VL - 169
ER -
TY - JOUR
AB - The conserved polymerase-Associated factor 1 complex (Paf1C) plays multiple roles in chromatin transcription and genomic regulation. Paf1C comprises the five subunits Paf1, Leo1, Ctr9, Cdc73 and Rtf1, and binds to the RNA polymerase II (Pol II) transcription elongation complex (EC). Here we report the reconstitution of Paf1C from Saccharomyces cerevisiae, and a structural analysis of Paf1C bound to a Pol II EC containing the elongation factor TFIIS. Cryo-electron microscopy and crosslinking data reveal that Paf1C is highly mobile and extends over the outer Pol II surface from the Rpb2 to the Rpb3 subunit. The Paf1-Leo1 heterodimer and Cdc73 form opposite ends of Paf1C, whereas Ctr9 bridges between them. Consistent with the structural observations, the initiation factor TFIIF impairs Paf1C binding to Pol II, whereas the elongation factor TFIIS enhances it. We further show that Paf1C is globally required for normal mRNA transcription in yeast. These results provide a three-dimensional framework for further analysis of Paf1C function in transcription through chromatin.
AU - Xu, Youwei
AU - Bernecky, Carrie A
AU - Lee, Chung
AU - Maier, Kerstin
AU - Schwalb, Björn
AU - Tegunov, Dimitri
AU - Plitzko, Jürgen
AU - Urlaub, Henning
AU - Cramer, Patrick
ID - 601
JF - Nature Communications
SN - 20411723
TI - Architecture of the RNA polymerase II-Paf1C-TFIIS transcription elongation complex
VL - 8
ER -
TY - JOUR
AB - The first hundred attoseconds of the electron dynamics during strong field tunneling ionization are investigated. We quantify theoretically how the electron’s classical trajectories in the continuum emerge from the tunneling process and test the results with those achieved in parallel from attoclock measurements. An especially high sensitivity on the tunneling barrier is accomplished here by comparing the momentum distributions of two atomic species of slightly deviating atomic potentials (argon and krypton) being ionized under absolutely identical conditions with near-infrared laser pulses (1300 nm). The agreement between experiment and theory provides clear evidence for a nonzero tunneling time delay and a nonvanishing longitudinal momentum of the electron at the “tunnel exit.”
AU - Camus, Nicolas
AU - Yakaboylu, Enderalp
AU - Fechner, Lutz
AU - Klaiber, Michael
AU - Laux, Martin
AU - Mi, Yonghao
AU - Hatsagortsyan, Karen Z.
AU - Pfeifer, Thomas
AU - Keitel, Christoph H.
AU - Moshammer, Robert
ID - 6013
IS - 2
JF - Physical Review Letters
SN - 0031-9007
TI - Experimental evidence for quantum tunneling time
VL - 119
ER -
TY - JOUR
AB - During transcription, RNA polymerase II (Pol II) associates with the conserved elongation factor DSIF. DSIF renders the elongation complex stable and functions during Pol II pausing and RNA processing. We combined cryo-EM and X-ray crystallography to determine the structure of the mammalian Pol II-DSIF elongation complex at a nominal resolution of 3.4. Human DSIF has a modular structure with two domains forming a DNA clamp, two domains forming an RNA clamp, and one domain buttressing the RNA clamp. The clamps maintain the transcription bubble, position upstream DNA, and retain the RNA transcript in the exit tunnel. The mobile C-terminal region of DSIF is located near exiting RNA, where it can recruit factors for RNA processing. The structure provides insight into the roles of DSIF during mRNA synthesis.
AU - Bernecky, Carrie A
AU - Plitzko, Jürgen
AU - Cramer, Patrick
ID - 603
IS - 10
JF - Nature Structural and Molecular Biology
SN - 15459993
TI - Structure of a transcribing RNA polymerase II-DSIF complex reveals a multidentate DNA-RNA clamp
VL - 24
ER -
TY - CHAP
AB - In several settings of physics and chemistry one has to deal with molecules interacting with some kind of an external environment, be it a gas, a solution, or a crystal surface. Understanding molecular processes in the presence of such a many-particle bath is inherently challenging, and usually requires large-scale numerical computations. Here, we present an alternative approach to the problem, based on the notion of the angulon quasiparticle. We show that molecules rotating inside superfluid helium nanodroplets and Bose–Einstein condensates form angulons, and therefore can be described by straightforward solutions of a simple microscopic Hamiltonian. Casting the problem in the language of angulons allows us not only to greatly simplify it, but also to gain insights into the origins of the observed phenomena and to make predictions for future experimental studies.
AU - Lemeshko, Mikhail
AU - Schmidt, Richard
ED - Dulieu, Oliver
ED - Osterwalder, Andreas
ID - 604
SN - 20413181
T2 - Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero
TI - Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets
VL - 11
ER -
TY - CONF
AB - Position based cryptography (PBC), proposed in the seminal work of Chandran, Goyal, Moriarty, and Ostrovsky (SIAM J. Computing, 2014), aims at constructing cryptographic schemes in which the identity of the user is his geographic position. Chandran et al. construct PBC schemes for secure positioning and position-based key agreement in the bounded-storage model (Maurer, J. Cryptology, 1992). Apart from bounded memory, their security proofs need a strong additional restriction on the power of the adversary: he cannot compute joint functions of his inputs. Removing this assumption is left as an open problem. We show that an answer to this question would resolve a long standing open problem in multiparty communication complexity: finding a function that is hard to compute with low communication complexity in the simultaneous message model, but easy to compute in the fully adaptive model. On a more positive side: we also show some implications in the other direction, i.e.: we prove that lower bounds on the communication complexity of certain multiparty problems imply existence of PBC primitives. Using this result we then show two attractive ways to “bypass” our hardness result: the first uses the random oracle model, the second weakens the locality requirement in the bounded-storage model to online computability. The random oracle construction is arguably one of the simplest proposed so far in this area. Our results indicate that constructing improved provably secure protocols for PBC requires a better understanding of multiparty communication complexity. This is yet another example where negative results in one area (in our case: lower bounds in multiparty communication complexity) can be used to construct secure cryptographic schemes.
AU - Brody, Joshua
AU - Dziembowski, Stefan
AU - Faust, Sebastian
AU - Pietrzak, Krzysztof Z
ED - Kalai, Yael
ED - Reyzin, Leonid
ID - 605
SN - 978-331970499-9
TI - Position based cryptography and multiparty communication complexity
VL - 10677
ER -