TY - JOUR AB - Motivation: Recent technological advances have led to an increase in the production and availability of single-cell data. The ability to integrate a set of multi-technology measurements would allow the identification of biologically or clinically meaningful observations through the unification of the perspectives afforded by each technology. In most cases, however, profiling technologies consume the used cells and thus pairwise correspondences between datasets are lost. Due to the sheer size single-cell datasets can acquire, scalable algorithms that are able to universally match single-cell measurements carried out in one cell to its corresponding sibling in another technology are needed. Results: We propose Single-Cell data Integration via Matching (SCIM), a scalable approach to recover such correspondences in two or more technologies. SCIM assumes that cells share a common (low-dimensional) underlying structure and that the underlying cell distribution is approximately constant across technologies. It constructs a technology-invariant latent space using an autoencoder framework with an adversarial objective. Multi-modal datasets are integrated by pairing cells across technologies using a bipartite matching scheme that operates on the low-dimensional latent representations. We evaluate SCIM on a simulated cellular branching process and show that the cell-to-cell matches derived by SCIM reflect the same pseudotime on the simulated dataset. Moreover, we apply our method to two real-world scenarios, a melanoma tumor sample and a human bone marrow sample, where we pair cells from a scRNA dataset to their sibling cells in a CyTOF dataset achieving 90% and 78% cell-matching accuracy for each one of the samples, respectively. AU - Stark, Stefan G AU - Ficek, Joanna AU - Locatello, Francesco AU - Bonilla, Ximena AU - Chevrier, Stéphane AU - Singer, Franziska AU - Aebersold, Rudolf AU - Al-Quaddoomi, Faisal S AU - Albinus, Jonas AU - Alborelli, Ilaria AU - Andani, Sonali AU - Attinger, Per-Olof AU - Bacac, Marina AU - Baumhoer, Daniel AU - Beck-Schimmer, Beatrice AU - Beerenwinkel, Niko AU - Beisel, Christian AU - Bernasconi, Lara AU - Bertolini, Anne AU - Bodenmiller, Bernd AU - Bonilla, Ximena AU - Casanova, Ruben AU - Chevrier, Stéphane AU - Chicherova, Natalia AU - D'Costa, Maya AU - Danenberg, Esther AU - Davidson, Natalie AU - gan, Monica-Andreea Dră AU - Dummer, Reinhard AU - Engler, Stefanie AU - Erkens, Martin AU - Eschbach, Katja AU - Esposito, Cinzia AU - Fedier, André AU - Ferreira, Pedro AU - Ficek, Joanna AU - Frei, Anja L AU - Frey, Bruno AU - Goetze, Sandra AU - Grob, Linda AU - Gut, Gabriele AU - Günther, Detlef AU - Haberecker, Martina AU - Haeuptle, Pirmin AU - Heinzelmann-Schwarz, Viola AU - Herter, Sylvia AU - Holtackers, Rene AU - Huesser, Tamara AU - Irmisch, Anja AU - Jacob, Francis AU - Jacobs, Andrea AU - Jaeger, Tim M AU - Jahn, Katharina AU - James, Alva R AU - Jermann, Philip M AU - Kahles, André AU - Kahraman, Abdullah AU - Koelzer, Viktor H AU - Kuebler, Werner AU - Kuipers, Jack AU - Kunze, Christian P AU - Kurzeder, Christian AU - Lehmann, Kjong-Van AU - Levesque, Mitchell AU - Lugert, Sebastian AU - Maass, Gerd AU - Manz, Markus AU - Markolin, Philipp AU - Mena, Julien AU - Menzel, Ulrike AU - Metzler, Julian M AU - Miglino, Nicola AU - Milani, Emanuela S AU - Moch, Holger AU - Muenst, Simone AU - Murri, Riccardo AU - Ng, Charlotte KY AU - Nicolet, Stefan AU - Nowak, Marta AU - Pedrioli, Patrick GA AU - Pelkmans, Lucas AU - Piscuoglio, Salvatore AU - Prummer, Michael AU - Ritter, Mathilde AU - Rommel, Christian AU - Rosano-González, María L AU - Rätsch, Gunnar AU - Santacroce, Natascha AU - Castillo, Jacobo Sarabia del AU - Schlenker, Ramona AU - Schwalie, Petra C AU - Schwan, Severin AU - Schär, Tobias AU - Senti, Gabriela AU - Singer, Franziska AU - Sivapatham, Sujana AU - Snijder, Berend AU - Sobottka, Bettina AU - Sreedharan, Vipin T AU - Stark, Stefan AU - Stekhoven, Daniel J AU - Theocharides, Alexandre PA AU - Thomas, Tinu M AU - Tolnay, Markus AU - Tosevski, Vinko AU - Toussaint, Nora C AU - Tuncel, Mustafa A AU - Tusup, Marina AU - Drogen, Audrey Van AU - Vetter, Marcus AU - Vlajnic, Tatjana AU - Weber, Sandra AU - Weber, Walter P AU - Wegmann, Rebekka AU - Weller, Michael AU - Wendt, Fabian AU - Wey, Norbert AU - Wicki, Andreas AU - Wollscheid, Bernd AU - Yu, Shuqing AU - Ziegler, Johanna AU - Zimmermann, Marc AU - Zoche, Martin AU - Zuend, Gregor AU - Rätsch, Gunnar AU - Lehmann, Kjong-Van ID - 14125 IS - Supplement_2 JF - Bioinformatics KW - Computational Mathematics KW - Computational Theory and Mathematics KW - Computer Science Applications KW - Molecular Biology KW - Biochemistry KW - Statistics and Probability TI - SCIM: Universal single-cell matching with unpaired feature sets VL - 36 ER - TY - CONF AB - The goal of the unsupervised learning of disentangled representations is to separate the independent explanatory factors of variation in the data without access to supervision. In this paper, we summarize the results of Locatello et al., 2019, and focus on their implications for practitioners. We discuss the theoretical result showing that the unsupervised learning of disentangled representations is fundamentally impossible without inductive biases and the practical challenges it entails. Finally, we comment on our experimental findings, highlighting the limitations of state-of-the-art approaches and directions for future research. AU - Locatello, Francesco AU - Bauer, Stefan AU - Lucic, Mario AU - Rätsch, Gunnar AU - Gelly, Sylvain AU - Schölkopf, Bernhard AU - Bachem, Olivier ID - 14186 IS - 9 SN - 9781577358350 T2 - The 34th AAAI Conference on Artificial Intelligence TI - A commentary on the unsupervised learning of disentangled representations VL - 34 ER - TY - CONF AB - Intelligent agents should be able to learn useful representations by observing changes in their environment. We model such observations as pairs of non-i.i.d. images sharing at least one of the underlying factors of variation. First, we theoretically show that only knowing how many factors have changed, but not which ones, is sufficient to learn disentangled representations. Second, we provide practical algorithms that learn disentangled representations from pairs of images without requiring annotation of groups, individual factors, or the number of factors that have changed. Third, we perform a large-scale empirical study and show that such pairs of observations are sufficient to reliably learn disentangled representations on several benchmark data sets. Finally, we evaluate our learned representations and find that they are simultaneously useful on a diverse suite of tasks, including generalization under covariate shifts, fairness, and abstract reasoning. Overall, our results demonstrate that weak supervision enables learning of useful disentangled representations in realistic scenarios. AU - Locatello, Francesco AU - Poole, Ben AU - Rätsch, Gunnar AU - Schölkopf, Bernhard AU - Bachem, Olivier AU - Tschannen, Michael ID - 14188 T2 - Proceedings of the 37th International Conference on Machine Learning TI - Weakly-supervised disentanglement without compromises VL - 119 ER - TY - CONF AB - We propose a novel Stochastic Frank-Wolfe (a.k.a. conditional gradient) algorithm for constrained smooth finite-sum minimization with a generalized linear prediction/structure. This class of problems includes empirical risk minimization with sparse, low-rank, or other structured constraints. The proposed method is simple to implement, does not require step-size tuning, and has a constant per-iteration cost that is independent of the dataset size. Furthermore, as a byproduct of the method we obtain a stochastic estimator of the Frank-Wolfe gap that can be used as a stopping criterion. Depending on the setting, the proposed method matches or improves on the best computational guarantees for Stochastic Frank-Wolfe algorithms. Benchmarks on several datasets highlight different regimes in which the proposed method exhibits a faster empirical convergence than related methods. Finally, we provide an implementation of all considered methods in an open-source package. AU - Négiar, Geoffrey AU - Dresdner, Gideon AU - Tsai, Alicia AU - Ghaoui, Laurent El AU - Locatello, Francesco AU - Freund, Robert M. AU - Pedregosa, Fabian ID - 14187 T2 - Proceedings of the 37th International Conference on Machine Learning TI - Stochastic Frank-Wolfe for constrained finite-sum minimization VL - 119 ER - TY - JOUR AB - The idea behind the unsupervised learning of disentangled representations is that real-world data is generated by a few explanatory factors of variation which can be recovered by unsupervised learning algorithms. In this paper, we provide a sober look at recent progress in the field and challenge some common assumptions. We first theoretically show that the unsupervised learning of disentangled representations is fundamentally impossible without inductive biases on both the models and the data. Then, we train over 14000 models covering most prominent methods and evaluation metrics in a reproducible large-scale experimental study on eight data sets. We observe that while the different methods successfully enforce properties “encouraged” by the corresponding losses, well-disentangled models seemingly cannot be identified without supervision. Furthermore, different evaluation metrics do not always agree on what should be considered “disentangled” and exhibit systematic differences in the estimation. Finally, increased disentanglement does not seem to necessarily lead to a decreased sample complexity of learning for downstream tasks. Our results suggest that future work on disentanglement learning should be explicit about the role of inductive biases and (implicit) supervision, investigate concrete benefits of enforcing disentanglement of the learned representations, and consider a reproducible experimental setup covering several data sets. AU - Locatello, Francesco AU - Bauer, Stefan AU - Lucic, Mario AU - Rätsch, Gunnar AU - Gelly, Sylvain AU - Schölkopf, Bernhard AU - Bachem, Olivier ID - 14195 JF - Journal of Machine Learning Research TI - A sober look at the unsupervised learning of disentangled representations and their evaluation VL - 21 ER - TY - JOUR AB - Genes differ in the frequency at which they are expressed and in the form of regulation used to control their activity. In particular, positive or negative regulation can lead to activation of a gene in response to an external signal. Previous works proposed that the form of regulation of a gene correlates with its frequency of usage: positive regulation when the gene is frequently expressed and negative regulation when infrequently expressed. Such network design means that, in the absence of their regulators, the genes are found in their least required activity state, hence regulatory intervention is often necessary. Due to the multitude of genes and regulators, spurious binding and unbinding events, called “crosstalk”, could occur. To determine how the form of regulation affects the global crosstalk in the network, we used a mathematical model that includes multiple regulators and multiple target genes. We found that crosstalk depends non-monotonically on the availability of regulators. Our analysis showed that excess use of regulation entailed by the formerly suggested network design caused high crosstalk levels in a large part of the parameter space. We therefore considered the opposite ‘idle’ design, where the default unregulated state of genes is their frequently required activity state. We found, that ‘idle’ design minimized the use of regulation and thus minimized crosstalk. In addition, we estimated global crosstalk of S. cerevisiae using transcription factors binding data. We demonstrated that even partial network data could suffice to estimate its global crosstalk, suggesting its applicability to additional organisms. We found that S. cerevisiae estimated crosstalk is lower than that of a random network, suggesting that natural selection reduces crosstalk. In summary, our study highlights a new type of protein production cost which is typically overlooked: that of regulatory interference caused by the presence of excess regulators in the cell. It demonstrates the importance of whole-network descriptions, which could show effects missed by single-gene models. AU - Grah, Rok AU - Friedlander, Tamar ID - 7569 IS - 2 JF - PLOS Computational Biology SN - 1553-7358 TI - The relation between crosstalk and gene regulation form revisited VL - 16 ER - TY - GEN AB - In mammals, chromatin marks at imprinted genes are asymmetrically inherited to control parentally-biased gene expression. This control is thought predominantly to involve parent-specific differentially methylated regions (DMR) in genomic DNA. However, neither parent-of-origin-specific transcription nor DMRs have been comprehensively mapped. We here address this by integrating transcriptomic and epigenomic approaches in mouse preimplantation embryos (blastocysts). Transcriptome-analysis identified 71 genes expressed with previously unknown parent-of-origin-specific expression in blastocysts (nBiX: novel blastocyst-imprinted expression). Uniparental expression of nBiX genes disappeared soon after implantation. Micro-whole-genome bisulfite sequencing (μWGBS) of individual uniparental blastocysts detected 859 DMRs. Only 18% of nBiXs were associated with a DMR, whereas 60% were associated with parentally-biased H3K27me3. This suggests a major role for Polycomb-mediated imprinting in blastocysts. Five nBiX-clusters contained at least one known imprinted gene, and five novel clusters contained exclusively nBiX-genes. These data suggest a complex program of stage-specific imprinting involving different tiers of regulation. AU - Santini, Laura AU - Halbritter, Florian AU - Titz-Teixeira, Fabian AU - Suzuki, Toru AU - Asami, Maki AU - Ramesmayer, Julia AU - Ma, Xiaoyan AU - Lackner, Andreas AU - Warr, Nick AU - Pauler, Florian AU - Hippenmeyer, Simon AU - Laue, Ernest AU - Farlik, Matthias AU - Bock, Christoph AU - Beyer, Andreas AU - Perry, Anthony C. F. AU - Leeb, Martin ID - 8813 T2 - bioRxiv TI - Novel imprints in mouse blastocysts are predominantly DNA methylation independent ER - TY - GEN AU - Grah, Rok AU - Friedlander, Tamar ID - 9777 TI - Maximizing crosstalk ER - TY - THES AB - Designing and verifying concurrent programs is a notoriously challenging, time consuming, and error prone task, even for experts. This is due to the sheer number of possible interleavings of a concurrent program, all of which have to be tracked and accounted for in a formal proof. Inventing an inductive invariant that captures all interleavings of a low-level implementation is theoretically possible, but practically intractable. We develop a refinement-based verification framework that provides mechanisms to simplify proof construction by decomposing the verification task into smaller subtasks. In a first line of work, we present a foundation for refinement reasoning over structured concurrent programs. We introduce layered concurrent programs as a compact notation to represent multi-layer refinement proofs. A layered concurrent program specifies a sequence of connected concurrent programs, from most concrete to most abstract, such that common parts of different programs are written exactly once. Each program in this sequence is expressed as structured concurrent program, i.e., a program over (potentially recursive) procedures, imperative control flow, gated atomic actions, structured parallelism, and asynchronous concurrency. This is in contrast to existing refinement-based verifiers, which represent concurrent systems as flat transition relations. We present a powerful refinement proof rule that decomposes refinement checking over structured programs into modular verification conditions. Refinement checking is supported by a new form of modular, parameterized invariants, called yield invariants, and a linear permission system to enhance local reasoning. In a second line of work, we present two new reduction-based program transformations that target asynchronous programs. These transformations reduce the number of interleavings that need to be considered, thus reducing the complexity of invariants. Synchronization simplifies the verification of asynchronous programs by introducing the fiction, for proof purposes, that asynchronous operations complete synchronously. Synchronization summarizes an asynchronous computation as immediate atomic effect. Inductive sequentialization establishes sequential reductions that captures every behavior of the original program up to reordering of coarse-grained commutative actions. A sequential reduction of a concurrent program is easy to reason about since it corresponds to a simple execution of the program in an idealized synchronous environment, where processes act in a fixed order and at the same speed. Our approach is implemented the CIVL verifier, which has been successfully used for the verification of several complex concurrent programs. In our methodology, the overall correctness of a program is established piecemeal by focusing on the invariant required for each refinement step separately. While the programmer does the creative work of specifying the chain of programs and the inductive invariant justifying each link in the chain, the tool automatically constructs the verification conditions underlying each refinement step. AU - Kragl, Bernhard ID - 8332 SN - 2663-337X TI - Verifying concurrent programs: Refinement, synchronization, sequentialization ER - TY - CONF AB - Learning object-centric representations of complex scenes is a promising step towards enabling efficient abstract reasoning from low-level perceptual features. Yet, most deep learning approaches learn distributed representations that do not capture the compositional properties of natural scenes. In this paper, we present the Slot Attention module, an architectural component that interfaces with perceptual representations such as the output of a convolutional neural network and produces a set of task-dependent abstract representations which we call slots. These slots are exchangeable and can bind to any object in the input by specializing through a competitive procedure over multiple rounds of attention. We empirically demonstrate that Slot Attention can extract object-centric representations that enable generalization to unseen compositions when trained on unsupervised object discovery and supervised property prediction tasks. AU - Locatello, Francesco AU - Weissenborn, Dirk AU - Unterthiner, Thomas AU - Mahendran, Aravindh AU - Heigold, Georg AU - Uszkoreit, Jakob AU - Dosovitskiy, Alexey AU - Kipf, Thomas ID - 14326 SN - 9781713829546 T2 - Advances in Neural Information Processing Systems TI - Object-centric learning with slot attention VL - 33 ER - TY - JOUR AB - We consider dynamical transport metrics for probability measures on discretisations of a bounded convex domain in ℝd. These metrics are natural discrete counterparts to the Kantorovich metric 𝕎2, defined using a Benamou-Brenier type formula. Under mild assumptions we prove an asymptotic upper bound for the discrete transport metric Wt in terms of 𝕎2, as the size of the mesh T tends to 0. However, we show that the corresponding lower bound may fail in general, even on certain one-dimensional and symmetric two-dimensional meshes. In addition, we show that the asymptotic lower bound holds under an isotropy assumption on the mesh, which turns out to be essentially necessary. This assumption is satisfied, e.g., for tilings by convex regular polygons, and it implies Gromov-Hausdorff convergence of the transport metric. AU - Gladbach, Peter AU - Kopfer, Eva AU - Maas, Jan ID - 71 IS - 3 JF - SIAM Journal on Mathematical Analysis SN - 00361410 TI - Scaling limits of discrete optimal transport VL - 52 ER - TY - JOUR AB - We introduce dynamically warping grids for adaptive liquid simulation. Our primary contributions are a strategy for dynamically deforming regular grids over the course of a simulation and a method for efficiently utilizing these deforming grids for liquid simulation. Prior work has shown that unstructured grids are very effective for adaptive fluid simulations. However, unstructured grids often lead to complicated implementations and a poor cache hit rate due to inconsistent memory access. Regular grids, on the other hand, provide a fast, fixed memory access pattern and straightforward implementation. Our method combines the advantages of both: we leverage the simplicity of regular grids while still achieving practical and controllable spatial adaptivity. We demonstrate that our method enables adaptive simulations that are fast, flexible, and robust to null-space issues. At the same time, our method is simple to implement and takes advantage of existing highly-tuned algorithms. AU - Hikaru, Ibayashi AU - Wojtan, Christopher J AU - Thuerey, Nils AU - Igarashi, Takeo AU - Ando, Ryoichi ID - 5681 IS - 6 JF - IEEE Transactions on Visualization and Computer Graphics SN - 10772626 TI - Simulating liquids on dynamically warping grids VL - 26 ER - TY - THES AB - The oft-quoted dictum by Arthur Schawlow: ``A diatomic molecule has one atom too many'' has been disavowed. Inspired by the possibility to experimentally manipulate and enhance chemical reactivity in helium nanodroplets, we investigate the rotation of coupled cold molecules in the presence of a many-body environment. In this thesis, we introduce new variational approaches to quantum impurities and apply them to the Fröhlich polaron - a quasiparticle formed out of an electron (or other point-like impurity) in a polar medium, and to the angulon - a quasiparticle formed out of a rotating molecule in a bosonic bath. With this theoretical toolbox, we reveal the self-localization transition for the angulon quasiparticle. We show that, unlike for polarons, self-localization of angulons occurs at finite impurity-bath coupling already at the mean-field level. The transition is accompanied by the spherical-symmetry breaking of the angulon ground state and a discontinuity in the first derivative of the ground-state energy. Moreover, the type of symmetry breaking is dictated by the symmetry of the microscopic impurity-bath interaction, which leads to a number of distinct self-localized states. For the system containing multiple impurities, by analogy with the bipolaron, we introduce the biangulon quasiparticle describing two rotating molecules that align with respect to each other due to the effective attractive interaction mediated by the excitations of the bath. We study this system from the strong-coupling regime to the weak molecule-bath interaction regime. We show that the molecules tend to have a strong alignment in the ground state, the biangulon shows shifted angulon instabilities and an additional spectral instability, where resonant angular momentum transfer between the molecules and the bath takes place. Finally, we introduce a diagonalization scheme that allows us to describe the transition from two separated angulons to a biangulon as a function of the distance between the two molecules. AU - Li, Xiang ID - 8958 SN - 2663-337X TI - Rotation of coupled cold molecules in the presence of a many-body environment ER - TY - THES AB - Form versus function is a long-standing debate in various design-related fields, such as architecture as well as graphic and industrial design. A good design that balances form and function often requires considerable human effort and collaboration among experts from different professional fields. Computational design tools provide a new paradigm for designing functional objects. In computational design, form and function are represented as mathematical quantities, with the help of numerical and combinatorial algorithms, they can assist even novice users in designing versatile models that exhibit their desired functionality. This thesis presents three disparate research studies on the computational design of functional objects: The appearance of 3d print—we optimize the volumetric material distribution for faithfully replicating colored surface texture in 3d printing; the dynamic motion of mechanical structures— our design system helps the novice user to retarget various mechanical templates with different functionality to complex 3d shapes; and a more abstract functionality, multistability—our algorithm automatically generates models that exhibit multiple stable target poses. For each of these cases, our computational design tools not only ensure the functionality of the results but also permit the user aesthetic freedom over the form. Moreover, fabrication constraints were taken into account, which allow for the immediate creation of physical realization via 3D printing or laser cutting. AU - Zhang, Ran ID - 8386 SN - 2663-337X TI - Structure-aware computational design and its application to 3D printable volume scattering, mechanism, and multistability ER - TY - THES AB - Quantum computation enables the execution of algorithms that have exponential complexity. This might open the path towards the synthesis of new materials or medical drugs, optimization of transport or financial strategies etc., intractable on even the fastest classical computers. A quantum computer consists of interconnected two level quantum systems, called qubits, that satisfy DiVincezo’s criteria. Worldwide, there are ongoing efforts to find the qubit architecture which will unite quantum error correction compatible single and two qubit fidelities, long distance qubit to qubit coupling and calability. Superconducting qubits have gone the furthest in this race, demonstrating an algorithm running on 53 coupled qubits, but still the fidelities are not even close to those required for realizing a single logical qubit. emiconductor qubits offer extremely good characteristics, but they are currently investigated across different platforms. Uniting those good characteristics into a single platform might be a big step towards the quantum computer realization. Here we describe the implementation of a hole spin qubit hosted in a Ge hut wire double quantum dot. The high and tunable spin-orbit coupling together with a heavy hole state character is expected to allow fast spin manipulation and long coherence times. Furthermore large lever arms, for hut wire devices, should allow good coupling to superconducting resonators enabling efficient long distance spin to spin coupling and a sensitive gate reflectometry spin readout. The developed cryogenic setup (printed circuit board sample holders, filtering, high-frequency wiring) enabled us to perform low temperature spin dynamics experiments. Indeed, we measured the fastest single spin qubit Rabi frequencies reported so far, reaching 140 MHz, while the dephasing times of 130 ns oppose the long decoherence predictions. In order to further investigate this, a double quantum dot gate was connected directly to a lumped element resonator which enabled gate reflectometry readout. The vanishing inter-dot transition signal, for increasing external magnetic field, revealed the spin nature of the measured quantity. AU - Kukucka, Josip ID - 7996 SN - 2663-337X TI - Implementation of a hole spin qubit in Ge hut wires and dispersive spin sensing ER - TY - CONF AB - We study turn-based stochastic zero-sum games with lexicographic preferences over reachability and safety objectives. Stochastic games are standard models in control, verification, and synthesis of stochastic reactive systems that exhibit both randomness as well as angelic and demonic non-determinism. Lexicographic order allows to consider multiple objectives with a strict preference order over the satisfaction of the objectives. To the best of our knowledge, stochastic games with lexicographic objectives have not been studied before. We establish determinacy of such games and present strategy and computational complexity results. For strategy complexity, we show that lexicographically optimal strategies exist that are deterministic and memory is only required to remember the already satisfied and violated objectives. For a constant number of objectives, we show that the relevant decision problem is in NP∩coNP , matching the current known bound for single objectives; and in general the decision problem is PSPACE -hard and can be solved in NEXPTIME∩coNEXPTIME . We present an algorithm that computes the lexicographically optimal strategies via a reduction to computation of optimal strategies in a sequence of single-objectives games. We have implemented our algorithm and report experimental results on various case studies. AU - Chatterjee, Krishnendu AU - Katoen, Joost P AU - Weininger, Maximilian AU - Winkler, Tobias ID - 8272 SN - 03029743 T2 - International Conference on Computer Aided Verification TI - Stochastic games with lexicographic reachability-safety objectives VL - 12225 ER - TY - CHAP AB - The polymerization–depolymerization dynamics of cytoskeletal proteins play essential roles in the self-organization of cytoskeletal structures, in eukaryotic as well as prokaryotic cells. While advances in fluorescence microscopy and in vitro reconstitution experiments have helped to study the dynamic properties of these complex systems, methods that allow to collect and analyze large quantitative datasets of the underlying polymer dynamics are still missing. Here, we present a novel image analysis workflow to study polymerization dynamics of active filaments in a nonbiased, highly automated manner. Using treadmilling filaments of the bacterial tubulin FtsZ as an example, we demonstrate that our method is able to specifically detect, track and analyze growth and shrinkage of polymers, even in dense networks of filaments. We believe that this automated method can facilitate the analysis of a large variety of dynamic cytoskeletal systems, using standard time-lapse movies obtained from experiments in vitro as well as in the living cell. Moreover, we provide scripts implementing this method as supplementary material. AU - Dos Santos Caldas, Paulo R AU - Radler, Philipp AU - Sommer, Christoph M AU - Loose, Martin ED - Tran, Phong ID - 7572 SN - 0091679X T2 - Methods in Cell Biology TI - Computational analysis of filament polymerization dynamics in cytoskeletal networks VL - 158 ER - TY - JOUR AB - Most bacteria accomplish cell division with the help of a dynamic protein complex called the divisome, which spans the cell envelope in the plane of division. Assembly and activation of this machinery are coordinated by the tubulin-related GTPase FtsZ, which was found to form treadmilling filaments on supported bilayers in vitro1, as well as in live cells, in which filaments circle around the cell division site2,3. Treadmilling of FtsZ is thought to actively move proteins around the division septum, thereby distributing peptidoglycan synthesis and coordinating the inward growth of the septum to form the new poles of the daughter cells4. However, the molecular mechanisms underlying this function are largely unknown. Here, to study how FtsZ polymerization dynamics are coupled to downstream proteins, we reconstituted part of the bacterial cell division machinery using its purified components FtsZ, FtsA and truncated transmembrane proteins essential for cell division. We found that the membrane-bound cytosolic peptides of FtsN and FtsQ co-migrated with treadmilling FtsZ–FtsA filaments, but despite their directed collective behaviour, individual peptides showed random motion and transient confinement. Our work suggests that divisome proteins follow treadmilling FtsZ filaments by a diffusion-and-capture mechanism, which can give rise to a moving zone of signalling activity at the division site. AU - Baranova, Natalia S. AU - Radler, Philipp AU - Hernández-Rocamora, Víctor M. AU - Alfonso, Carlos AU - Lopez Pelegrin, Maria D AU - Rivas, Germán AU - Vollmer, Waldemar AU - Loose, Martin ID - 7387 JF - Nature Microbiology SN - 2058-5276 TI - Diffusion and capture permits dynamic coupling between treadmilling FtsZ filaments and cell division proteins VL - 5 ER - TY - JOUR AB - Fejes Tóth [3] studied approximations of smooth surfaces in three-space by piecewise flat triangular meshes with a given number of vertices on the surface that are optimal with respect to Hausdorff distance. He proves that this Hausdorff distance decreases inversely proportional with the number of vertices of the approximating mesh if the surface is convex. He also claims that this Hausdorff distance is inversely proportional to the square of the number of vertices for a specific non-convex surface, namely a one-sheeted hyperboloid of revolution bounded by two congruent circles. We refute this claim, and show that the asymptotic behavior of the Hausdorff distance is linear, that is the same as for convex surfaces. AU - Vegter, Gert AU - Wintraecken, Mathijs ID - 8163 IS - 2 JF - Studia Scientiarum Mathematicarum Hungarica SN - 0081-6906 TI - Refutation of a claim made by Fejes Tóth on the accuracy of surface meshes VL - 57 ER - TY - JOUR AB - We study relations between evidence theory and S-approximation spaces. Both theories have their roots in the analysis of Dempsterchr('39')s multivalued mappings and lower and upper probabilities, and have close relations to rough sets. We show that an S-approximation space, satisfying a monotonicity condition, can induce a natural belief structure which is a fundamental block in evidence theory. We also demonstrate that one can induce a natural belief structure on one set, given a belief structure on another set, if the two sets are related by a partial monotone S-approximation space. AU - Shakiba, A. AU - Goharshady, Amir Kafshdar AU - Hooshmandasl, M.R. AU - Alambardar Meybodi, M. ID - 8671 IS - 2 JF - Iranian Journal of Mathematical Sciences and Informatics SN - 1735-4463 TI - A note on belief structures and s-approximation spaces VL - 15 ER - TY - JOUR AB - The strong rate of convergence of the Euler-Maruyama scheme for nondegenerate SDEs with irregular drift coefficients is considered. In the case of α-Hölder drift in the recent literature the rate α/2 was proved in many related situations. By exploiting the regularising effect of the noise more efficiently, we show that the rate is in fact arbitrarily close to 1/2 for all α>0. The result extends to Dini continuous coefficients, while in d=1 also to all bounded measurable coefficients. AU - Dareiotis, Konstantinos AU - Gerencser, Mate ID - 6359 JF - Electronic Journal of Probability TI - On the regularisation of the noise for the Euler-Maruyama scheme with irregular drift VL - 25 ER - TY - THES AB - Deep neural networks have established a new standard for data-dependent feature extraction pipelines in the Computer Vision literature. Despite their remarkable performance in the standard supervised learning scenario, i.e. when models are trained with labeled data and tested on samples that follow a similar distribution, neural networks have been shown to struggle with more advanced generalization abilities, such as transferring knowledge across visually different domains, or generalizing to new unseen combinations of known concepts. In this thesis we argue that, in contrast to the usual black-box behavior of neural networks, leveraging more structured internal representations is a promising direction for tackling such problems. In particular, we focus on two forms of structure. First, we tackle modularity: We show that (i) compositional architectures are a natural tool for modeling reasoning tasks, in that they efficiently capture their combinatorial nature, which is key for generalizing beyond the compositions seen during training. We investigate how to to learn such models, both formally and experimentally, for the task of abstract visual reasoning. Then, we show that (ii) in some settings, modularity allows us to efficiently break down complex tasks into smaller, easier, modules, thereby improving computational efficiency; We study this behavior in the context of generative models for colorization, as well as for small objects detection. Secondly, we investigate the inherently layered structure of representations learned by neural networks, and analyze its role in the context of transfer learning and domain adaptation across visually dissimilar domains. AU - Royer, Amélie ID - 8390 SN - 2663-337X TI - Leveraging structure in Computer Vision tasks for flexible Deep Learning models ER - TY - CONF AB - Numerous methods have been proposed for probabilistic generative modelling of 3D objects. However, none of these is able to produce textured objects, which renders them of limited use for practical tasks. In this work, we present the first generative model of textured 3D meshes. Training such a model would traditionally require a large dataset of textured meshes, but unfortunately, existing datasets of meshes lack detailed textures. We instead propose a new training methodology that allows learning from collections of 2D images without any 3D information. To do so, we train our model to explain a distribution of images by modelling each image as a 3D foreground object placed in front of a 2D background. Thus, it learns to generate meshes that when rendered, produce images similar to those in its training set. A well-known problem when generating meshes with deep networks is the emergence of self-intersections, which are problematic for many use-cases. As a second contribution we therefore introduce a new generation process for 3D meshes that guarantees no self-intersections arise, based on the physical intuition that faces should push one another out of the way as they move. We conduct extensive experiments on our approach, reporting quantitative and qualitative results on both synthetic data and natural images. These show our method successfully learns to generate plausible and diverse textured 3D samples for five challenging object classes. AU - Henderson, Paul M AU - Tsiminaki, Vagia AU - Lampert, Christoph ID - 8186 T2 - Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition TI - Leveraging 2D data to learn textured 3D mesh generation ER - TY - JOUR AB - Earlier, we demonstrated that transcript levels of METAL TOLERANCE PROTEIN2 (MTP2) and of HEAVY METAL ATPase2 (HMA2) increase strongly in roots of Arabidopsis upon prolonged zinc (Zn) deficiency and respond to shoot physiological Zn status, and not to the local Zn status in roots. This provided evidence for shoot-to-root communication in the acclimation of plants to Zn deficiency. Zn-deficient soils limit both the yield and quality of agricultural crops and can result in clinically relevant nutritional Zn deficiency in human populations. Implementing Zn deficiency during cultivation of the model plant Arabidopsis thaliana on agar-solidified media is difficult because trace element contaminations are present in almost all commercially available agars. Here, we demonstrate root morphological acclimations to Zn deficiency on agar-solidified medium following the effective removal of contaminants. These advancements allow reproducible phenotyping toward understanding fundamental plant responses to deficiencies of Zn and other essential trace elements. AU - Sinclair, Scott A AU - Krämer, U. ID - 7416 IS - 1 JF - Plant Signaling & Behavior SN - 1559-2324 TI - Generation of effective zinc-deficient agar-solidified media allows identification of root morphology changes in response to zinc limitation VL - 15 ER - TY - JOUR AB - In order to provide a local description of a regular function in a small neighbourhood of a point x, it is sufficient by Taylor’s theorem to know the value of the function as well as all of its derivatives up to the required order at the point x itself. In other words, one could say that a regular function is locally modelled by the set of polynomials. The theory of regularity structures due to Hairer generalizes this observation and provides an abstract setup, which in the application to singular SPDE extends the set of polynomials by functionals constructed from, e.g., white noise. In this context, the notion of Taylor polynomials is lifted to the notion of so-called modelled distributions. The celebrated reconstruction theorem, which in turn was inspired by Gubinelli’s \textit {sewing lemma}, is of paramount importance for the theory. It enables one to reconstruct a modelled distribution as a true distribution on Rd which is locally approximated by this extended set of models or “monomials”. In the original work of Hairer, the error is measured by means of Hölder norms. This was then generalized to the whole scale of Besov spaces by Hairer and Labbé. It is the aim of this work to adapt the analytic part of the theory of regularity structures to the scale of Triebel–Lizorkin spaces. AU - Hensel, Sebastian AU - Rosati, Tommaso ID - 9196 IS - 3 JF - Studia Mathematica KW - General Mathematics SN - 0039-3223 TI - Modelled distributions of Triebel–Lizorkin type VL - 252 ER - TY - JOUR AB - Retrovirus assembly is driven by the multidomain structural protein Gag. Interactions between the capsid domains (CA) of Gag result in Gag multimerization, leading to an immature virus particle that is formed by a protein lattice based on dimeric, trimeric, and hexameric protein contacts. Among retroviruses the inter- and intra-hexamer contacts differ, especially in the N-terminal sub-domain of CA (CANTD). For HIV-1 the cellular molecule inositol hexakisphosphate (IP6) interacts with and stabilizes the immature hexamer, and is required for production of infectious virus particles. We have used in vitro assembly, cryo-electron tomography and subtomogram averaging, atomistic molecular dynamics simulations and mutational analyses to study the HIV-related lentivirus equine infectious anemia virus (EIAV). In particular, we sought to understand the structural conservation of the immature lentivirus lattice and the role of IP6 in EIAV assembly. Similar to HIV-1, IP6 strongly promoted in vitro assembly of EIAV Gag proteins into virus-like particles (VLPs), which took three morphologically highly distinct forms: narrow tubes, wide tubes, and spheres. Structural characterization of these VLPs to sub-4Å resolution unexpectedly showed that all three morphologies are based on an immature lattice with preserved key structural components, highlighting the structural versatility of CA to form immature assemblies. A direct comparison between EIAV and HIV revealed that both lentiviruses maintain similar immature interfaces, which are established by both conserved and non-conserved residues. In both EIAV and HIV-1, IP6 regulates immature assembly via conserved lysine residues within the CACTD and SP. Lastly, we demonstrate that IP6 stimulates in vitro assembly of immature particles of several other retroviruses in the lentivirus genus, suggesting a conserved role for IP6 in lentiviral assembly. AU - Dick, Robert A. AU - Xu, Chaoyi AU - Morado, Dustin R. AU - Kravchuk, Vladyslav AU - Ricana, Clifton L. AU - Lyddon, Terri D. AU - Broad, Arianna M. AU - Feathers, J. Ryan AU - Johnson, Marc C. AU - Vogt, Volker M. AU - Perilla, Juan R. AU - Briggs, John A. G. AU - Schur, Florian KM ID - 7464 IS - 1 JF - PLOS Pathogens SN - 1553-7374 TI - Structures of immature EIAV Gag lattices reveal a conserved role for IP6 in lentivirus assembly VL - 16 ER - TY - JOUR AB - The fixation probability of a single mutant invading a population of residents is among the most widely-studied quantities in evolutionary dynamics. Amplifiers of natural selection are population structures that increase the fixation probability of advantageous mutants, compared to well-mixed populations. Extensive studies have shown that many amplifiers exist for the Birth-death Moran process, some of them substantially increasing the fixation probability or even guaranteeing fixation in the limit of large population size. On the other hand, no amplifiers are known for the death-Birth Moran process, and computer-assisted exhaustive searches have failed to discover amplification. In this work we resolve this disparity, by showing that any amplification under death-Birth updating is necessarily bounded and transient. Our boundedness result states that even if a population structure does amplify selection, the resulting fixation probability is close to that of the well-mixed population. Our transience result states that for any population structure there exists a threshold r⋆ such that the population structure ceases to amplify selection if the mutant fitness advantage r is larger than r⋆. Finally, we also extend the above results to δ-death-Birth updating, which is a combination of Birth-death and death-Birth updating. On the positive side, we identify population structures that maintain amplification for a wide range of values r and δ. These results demonstrate that amplification of natural selection depends on the specific mechanisms of the evolutionary process. AU - Tkadlec, Josef AU - Pavlogiannis, Andreas AU - Chatterjee, Krishnendu AU - Nowak, Martin A. ID - 7212 JF - PLoS computational biology TI - Limits on amplifiers of natural selection under death-Birth updating VL - 16 ER - TY - THES AB - In this thesis we study certain mathematical aspects of evolution. The two primary forces that drive an evolutionary process are mutation and selection. Mutation generates new variants in a population. Selection chooses among the variants depending on the reproductive rates of individuals. Evolutionary processes are intrinsically random – a new mutation that is initially present in the population at low frequency can go extinct, even if it confers a reproductive advantage. The overall rate of evolution is largely determined by two quantities: the probability that an invading advantageous mutation spreads through the population (called fixation probability) and the time until it does so (called fixation time). Both those quantities crucially depend not only on the strength of the invading mutation but also on the population structure. In this thesis, we aim to understand how the underlying population structure affects the overall rate of evolution. Specifically, we study population structures that increase the fixation probability of advantageous mutants (called amplifiers of selection). Broadly speaking, our results are of three different types: We present various strong amplifiers, we identify regimes under which only limited amplification is feasible, and we propose population structures that provide different tradeoffs between high fixation probability and short fixation time. AU - Tkadlec, Josef ID - 7196 TI - A role of graphs in evolutionary processes ER - TY - CONF AB - The optimization of multilayer neural networks typically leads to a solution with zero training error, yet the landscape can exhibit spurious local minima and the minima can be disconnected. In this paper, we shed light on this phenomenon: we show that the combination of stochastic gradient descent (SGD) and over-parameterization makes the landscape of multilayer neural networks approximately connected and thus more favorable to optimization. More specifically, we prove that SGD solutions are connected via a piecewise linear path, and the increase in loss along this path vanishes as the number of neurons grows large. This result is a consequence of the fact that the parameters found by SGD are increasingly dropout stable as the network becomes wider. We show that, if we remove part of the neurons (and suitably rescale the remaining ones), the change in loss is independent of the total number of neurons, and it depends only on how many neurons are left. Our results exhibit a mild dependence on the input dimension: they are dimension-free for two-layer networks and depend linearly on the dimension for multilayer networks. We validate our theoretical findings with numerical experiments for different architectures and classification tasks. AU - Shevchenko, Alexander AU - Mondelli, Marco ID - 9198 T2 - Proceedings of the 37th International Conference on Machine Learning TI - Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks VL - 119 ER - TY - JOUR AB - Representing an atom by a solid sphere in 3-dimensional Euclidean space, we get the space-filling diagram of a molecule by taking the union. Molecular dynamics simulates its motion subject to bonds and other forces, including the solvation free energy. The morphometric approach [12, 17] writes the latter as a linear combination of weighted versions of the volume, area, mean curvature, and Gaussian curvature of the space-filling diagram. We give a formula for the derivative of the weighted mean curvature. Together with the derivatives of the weighted volume in [7], the weighted area in [3], and the weighted Gaussian curvature [1], this yields the derivative of the morphometric expression of the solvation free energy. AU - Akopyan, Arseniy AU - Edelsbrunner, Herbert ID - 9157 IS - 1 JF - Computational and Mathematical Biophysics SN - 2544-7297 TI - The weighted mean curvature derivative of a space-filling diagram VL - 8 ER - TY - JOUR AB - The morphometric approach [11, 14] writes the solvation free energy as a linear combination of weighted versions of the volume, area, mean curvature, and Gaussian curvature of the space-filling diagram. We give a formula for the derivative of the weighted Gaussian curvature. Together with the derivatives of the weighted volume in [7], the weighted area in [4], and the weighted mean curvature in [1], this yields the derivative of the morphometric expression of solvation free energy. AU - Akopyan, Arseniy AU - Edelsbrunner, Herbert ID - 9156 IS - 1 JF - Computational and Mathematical Biophysics SN - 2544-7297 TI - The weighted Gaussian curvature derivative of a space-filling diagram VL - 8 ER - TY - JOUR AB - We consider the symmetric simple exclusion process in Zd with quenched bounded dynamic random conductances and prove its hydrodynamic limit in path space. The main tool is the connection, due to the self-duality of the process, between the invariance principle for single particles starting from all points and the macroscopic behavior of the density field. While the hydrodynamic limit at fixed macroscopic times is obtained via a generalization to the time-inhomogeneous context of the strategy introduced in [41], in order to prove tightness for the sequence of empirical density fields we develop a new criterion based on the notion of uniform conditional stochastic continuity, following [50]. In conclusion, we show that uniform elliptic dynamic conductances provide an example of environments in which the so-called arbitrary starting point invariance principle may be derived from the invariance principle of a single particle starting from the origin. Therefore, our hydrodynamics result applies to the examples of quenched environments considered in, e.g., [1], [3], [6] in combination with the hypothesis of uniform ellipticity. AU - Redig, Frank AU - Saada, Ellen AU - Sau, Federico ID - 8973 JF - Electronic Journal of Probability TI - Symmetric simple exclusion process in dynamic environment: Hydrodynamics VL - 25 ER - TY - JOUR AB - An asymptotic formula is established for the number of rational points of bounded anticanonical height which lie on a certain Zariski dense subset of the biprojective hypersurface x1y21+⋯+x4y24=0 in ℙ3×ℙ3. This confirms the modified Manin conjecture for this variety, in which the removal of a thin set of rational points is allowed. AU - Browning, Timothy D AU - Heath Brown, Roger ID - 179 IS - 16 JF - Duke Mathematical Journal SN - 0012-7094 TI - Density of rational points on a quadric bundle in ℙ3×ℙ3 VL - 169 ER - TY - GEN AB - Data and mathematica notebooks for plotting figures from Language learning with communication between learners AU - Ibsen-Jensen, Rasmus AU - Tkadlec, Josef AU - Chatterjee, Krishnendu AU - Nowak, Martin ID - 9814 TI - Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners ER - TY - JOUR AB - We demonstrate the utility of optical cavity generated spin-squeezed states in free space atomic fountain clocks in ensembles of 390 000 87Rb atoms. Fluorescence imaging, correlated to an initial quantum nondemolition measurement, is used for population spectroscopy after the atoms are released from a confining lattice. For a free fall time of 4 milliseconds, we resolve a single-shot phase sensitivity of 814(61) microradians, which is 5.8(0.6) decibels (dB) below the quantum projection limit. We observe that this squeezing is preserved as the cloud expands to a roughly 200  μm radius and falls roughly 300  μm in free space. Ramsey spectroscopy with 240 000 atoms at a 3.6 ms Ramsey time results in a single-shot fractional frequency stability of 8.4(0.2)×10−12, 3.8(0.2) dB below the quantum projection limit. The sensitivity and stability are limited by the technical noise in the fluorescence detection protocol and the microwave system, respectively. AU - Malia, Benjamin K. AU - Martínez-Rincón, Julián AU - Wu, Yunfan AU - Hosten, Onur AU - Kasevich, Mark A. ID - 8285 IS - 4 JF - Physical Review Letters SN - 0031-9007 TI - Free space Ramsey spectroscopy in rubidium with noise below the quantum projection limit VL - 125 ER - TY - CONF AB - We discus noise channels in coherent electro-optic up-conversion between microwave and optical fields, in particular due to optical heating. We also report on a novel configuration, which promises to be flexible and highly efficient. AU - Lambert, Nicholas J. AU - Mobassem, Sonia AU - Rueda Sanchez, Alfredo R AU - Schwefel, Harald G.L. ID - 10328 SN - 9-781-5575-2820-9 T2 - OSA Quantum 2.0 Conference TI - New designs and noise channels in electro-optic microwave to optical up-conversion ER - TY - CONF AB - The search for biologically faithful synaptic plasticity rules has resulted in a large body of models. They are usually inspired by – and fitted to – experimental data, but they rarely produce neural dynamics that serve complex functions. These failures suggest that current plasticity models are still under-constrained by existing data. Here, we present an alternative approach that uses meta-learning to discover plausible synaptic plasticity rules. Instead of experimental data, the rules are constrained by the functions they implement and the structure they are meant to produce. Briefly, we parameterize synaptic plasticity rules by a Volterra expansion and then use supervised learning methods (gradient descent or evolutionary strategies) to minimize a problem-dependent loss function that quantifies how effectively a candidate plasticity rule transforms an initially random network into one with the desired function. We first validate our approach by re-discovering previously described plasticity rules, starting at the single-neuron level and “Oja’s rule”, a simple Hebbian plasticity rule that captures the direction of most variability of inputs to a neuron (i.e., the first principal component). We expand the problem to the network level and ask the framework to find Oja’s rule together with an anti-Hebbian rule such that an initially random two-layer firing-rate network will recover several principal components of the input space after learning. Next, we move to networks of integrate-and-fire neurons with plastic inhibitory afferents. We train for rules that achieve a target firing rate by countering tuned excitation. Our algorithm discovers a specific subset of the manifold of rules that can solve this task. Our work is a proof of principle of an automated and unbiased approach to unveil synaptic plasticity rules that obey biological constraints and can solve complex functions. AU - Confavreux, Basile J AU - Zenke, Friedemann AU - Agnes, Everton J. AU - Lillicrap, Timothy AU - Vogels, Tim P ID - 9633 SN - 1049-5258 T2 - Advances in Neural Information Processing Systems TI - A meta-learning approach to (re)discover plasticity rules that carve a desired function into a neural network VL - 33 ER - TY - JOUR AB - The widely used non-steroidal anti-inflammatory drugs (NSAIDs) are derivatives of the phytohormone salicylic acid (SA). SA is well known to regulate plant immunity and development, whereas there have been few reports focusing on the effects of NSAIDs in plants. Our studies here reveal that NSAIDs exhibit largely overlapping physiological activities to SA in the model plant Arabidopsis. NSAID treatments lead to shorter and agravitropic primary roots and inhibited lateral root organogenesis. Notably, in addition to the SA-like action, which in roots involves binding to the protein phosphatase 2A (PP2A), NSAIDs also exhibit PP2A-independent effects. Cell biological and biochemical analyses reveal that many NSAIDs bind directly to and inhibit the chaperone activity of TWISTED DWARF1, thereby regulating actin cytoskeleton dynamics and subsequent endosomal trafficking. Our findings uncover an unexpected bioactivity of human pharmaceuticals in plants and provide insights into the molecular mechanism underlying the cellular action of this class of anti-inflammatory compounds. AU - Tan, Shutang AU - Di Donato, Martin AU - Glanc, Matous AU - Zhang, Xixi AU - Klíma, Petr AU - Liu, Jie AU - Bailly, Aurélien AU - Ferro, Noel AU - Petrášek, Jan AU - Geisler, Markus AU - Friml, Jiří ID - 8943 IS - 9 JF - Cell Reports TI - Non-steroidal anti-inflammatory drugs target TWISTED DWARF1-regulated actin dynamics and auxin transport-mediated plant development VL - 33 ER - TY - JOUR AB - Pulsating flows through tubular geometries are laminar provided that velocities are moderate. This in particular is also believed to apply to cardiovascular flows where inertial forces are typically too low to sustain turbulence. On the other hand, flow instabilities and fluctuating shear stresses are held responsible for a variety of cardiovascular diseases. Here we report a nonlinear instability mechanism for pulsating pipe flow that gives rise to bursts of turbulence at low flow rates. Geometrical distortions of small, yet finite, amplitude are found to excite a state consisting of helical vortices during flow deceleration. The resulting flow pattern grows rapidly in magnitude, breaks down into turbulence, and eventually returns to laminar when the flow accelerates. This scenario causes shear stress fluctuations and flow reversal during each pulsation cycle. Such unsteady conditions can adversely affect blood vessels and have been shown to promote inflammation and dysfunction of the shear stress-sensitive endothelial cell layer. AU - Xu, Duo AU - Varshney, Atul AU - Ma, Xingyu AU - Song, Baofang AU - Riedl, Michael AU - Avila, Marc AU - Hof, Björn ID - 7932 IS - 21 JF - Proceedings of the National Academy of Sciences of the United States of America SN - 00278424 TI - Nonlinear hydrodynamic instability and turbulence in pulsatile flow VL - 117 ER - TY - JOUR AB - We study the unique solution m of the Dyson equation \( -m(z)^{-1} = z\1 - a + S[m(z)] \) on a von Neumann algebra A with the constraint Imm≥0. Here, z lies in the complex upper half-plane, a is a self-adjoint element of A and S is a positivity-preserving linear operator on A. We show that m is the Stieltjes transform of a compactly supported A-valued measure on R. Under suitable assumptions, we establish that this measure has a uniformly 1/3-Hölder continuous density with respect to the Lebesgue measure, which is supported on finitely many intervals, called bands. In fact, the density is analytic inside the bands with a square-root growth at the edges and internal cubic root cusps whenever the gap between two bands vanishes. The shape of these singularities is universal and no other singularity may occur. We give a precise asymptotic description of m near the singular points. These asymptotics generalize the analysis at the regular edges given in the companion paper on the Tracy-Widom universality for the edge eigenvalue statistics for correlated random matrices [the first author et al., Ann. Probab. 48, No. 2, 963--1001 (2020; Zbl 1434.60017)] and they play a key role in the proof of the Pearcey universality at the cusp for Wigner-type matrices [G. Cipolloni et al., Pure Appl. Anal. 1, No. 4, 615--707 (2019; Zbl 07142203); the second author et al., Commun. Math. Phys. 378, No. 2, 1203--1278 (2020; Zbl 07236118)]. We also extend the finite dimensional band mass formula from [the first author et al., loc. cit.] to the von Neumann algebra setting by showing that the spectral mass of the bands is topologically rigid under deformations and we conclude that these masses are quantized in some important cases. AU - Alt, Johannes AU - Erdös, László AU - Krüger, Torben H ID - 14694 JF - Documenta Mathematica KW - General Mathematics SN - 1431-0635 TI - The Dyson equation with linear self-energy: Spectral bands, edges and cusps VL - 25 ER - TY - THES AB - We present solutions to several problems originating from geometry and discrete mathematics: existence of equipartitions, maps without Tverberg multiple points, and inscribing quadrilaterals. Equivariant obstruction theory is the natural topological approach to these type of questions. However, for the specific problems we consider it had yielded only partial or no results. We get our results by complementing equivariant obstruction theory with other techniques from topology and geometry. AU - Avvakumov, Sergey ID - 8156 SN - 2663-337X TI - Topological methods in geometry and discrete mathematics ER - TY - JOUR AB - We give the first mathematically rigorous justification of the local density approximation in density functional theory. We provide a quantitative estimate on the difference between the grand-canonical Levy–Lieb energy of a given density (the lowest possible energy of all quantum states having this density) and the integral over the uniform electron gas energy of this density. The error involves gradient terms and justifies the use of the local density approximation in the situation where the density is very flat on sufficiently large regions in space. AU - Lewin, Mathieu AU - Lieb, Elliott H. AU - Seiringer, Robert ID - 14891 IS - 1 JF - Pure and Applied Analysis SN - 2578-5893 TI - The local density approximation in density functional theory VL - 2 ER - TY - JOUR AB - Amyotrophic lateral sclerosis (ALS) leads to a loss of specific motor neuron populations in the spinal cord and cortex. Emerging evidence suggests that interneurons may also be affected, but a detailed characterization of interneuron loss and its potential impacts on motor neuron loss and disease progression is lacking. To examine this issue, the fate of V1 inhibitory neurons during ALS was assessed in the ventral spinal cord using the SODG93A mouse model. The V1 population makes up ∼30% of all ventral inhibitory neurons, ∼50% of direct inhibitory synaptic contacts onto motor neuron cell bodies, and is thought to play a key role in modulating motor output, in part through recurrent and reciprocal inhibitory circuits. We find that approximately half of V1 inhibitory neurons are lost in SODG93A mice at late disease stages, but that this loss is delayed relative to the loss of motor neurons and V2a excitatory neurons. We further identify V1 subpopulations based on transcription factor expression that are differentially susceptible to degeneration in SODG93A mice. At an early disease stage, we show that V1 synaptic contacts with motor neuron cell bodies increase, suggesting an upregulation of inhibition before V1 neurons are lost in substantial numbers. These data support a model in which progressive changes in V1 synaptic contacts early in disease, and in select V1 subpopulations at later stages, represent a compensatory upregulation and then deleterious breakdown of specific interneuron circuits within the spinal cord. AU - Salamatina, Alina AU - Yang, Jerry H AU - Brenner-Morton, Susan AU - Bikoff, Jay B AU - Fang, Linjing AU - Kintner, Christopher R AU - Jessell, Thomas M AU - Sweeney, Lora Beatrice Jaeger ID - 8914 JF - Neuroscience SN - 0306-4522 TI - Differential loss of spinal interneurons in a mouse model of ALS VL - 450 ER - TY - DATA AB - This data collection contains the transport data for figures presented in the supplementary material of "Enhancement of Proximity Induced Superconductivity in Planar Germanium" by K. Aggarwal, et. al. The measurements were done using Labber Software and the data is stored in the hdf5 file format. The files can be opened using either the Labber Log Browser (https://labber.org/overview/) or Labber Python API (http://labber.org/online-doc/api/LogFile.html). AU - Katsaros, Georgios ID - 8834 TI - Enhancement of proximity induced superconductivity in planar Germanium ER - TY - DATA AB - Antibiotics that interfere with translation, when combined, interact in diverse and difficult-to-predict ways. Here, we explain these interactions by "translation bottlenecks": points in the translation cycle where antibiotics block ribosomal progression. To elucidate the underlying mechanisms of drug interactions between translation inhibitors, we generate translation bottlenecks genetically using inducible control of translation factors that regulate well-defined translation cycle steps. These perturbations accurately mimic antibiotic action and drug interactions, supporting that the interplay of different translation bottlenecks causes these interactions. We further show that growth laws, combined with drug uptake and binding kinetics, enable the direct prediction of a large fraction of observed interactions, yet fail to predict suppression. However, varying two translation bottlenecks simultaneously supports that dense traffic of ribosomes and competition for translation factors account for the previously unexplained suppression. These results highlight the importance of "continuous epistasis" in bacterial physiology. AU - Kavcic, Bor ID - 8097 KW - Escherichia coli KW - antibiotic combinations KW - translation KW - growth laws KW - drug interactions KW - bacterial physiology KW - translation inhibitors TI - Analysis scripts and research data for the paper "Mechanisms of drug interactions between translation-inhibiting antibiotics" ER - TY - DATA AB - Here are the research data underlying the publication "Estimating inbreeding and its effects in a long-term study of snapdragons (Antirrhinum majus)". Further information are summed up in the README document. The files for this record have been updated and are now found in the linked DOI https://doi.org/10.15479/AT:ISTA:9192. AU - Arathoon, Louise S ID - 8254 TI - Estimating inbreeding and its effects in a long-term study of snapdragons (Antirrhinum majus) ER - TY - JOUR AB - Semiconductor nanowires have been playing a crucial role in the development of nanoscale devices for the realization of spin qubits, Majorana fermions, single photon emitters, nanoprocessors, etc. The monolithic growth of site‐controlled nanowires is a prerequisite toward the next generation of devices that will require addressability and scalability. Here, combining top‐down nanofabrication and bottom‐up self‐assembly, the growth of Ge wires on prepatterned Si (001) substrates with controllable position, distance, length, and structure is reported. This is achieved by a novel growth process that uses a SiGe strain‐relaxation template and can be potentially generalized to other material combinations. Transport measurements show an electrically tunable spin–orbit coupling, with a spin–orbit length similar to that of III–V materials. Also, charge sensing between quantum dots in closely spaced wires is observed, which underlines their potential for the realization of advanced quantum devices. The reported results open a path toward scalable qubit devices using nanowires on silicon. AU - Gao, Fei AU - Wang, Jian-Huan AU - Watzinger, Hannes AU - Hu, Hao AU - Rančić, Marko J. AU - Zhang, Jie-Yin AU - Wang, Ting AU - Yao, Yuan AU - Wang, Gui-Lei AU - Kukucka, Josip AU - Vukušić, Lada AU - Kloeffel, Christoph AU - Loss, Daniel AU - Liu, Feng AU - Katsaros, Georgios AU - Zhang, Jian-Jun ID - 7541 IS - 16 JF - Advanced Materials SN - 0935-9648 TI - Site-controlled uniform Ge/Si hut wires with electrically tunable spin-orbit coupling VL - 32 ER - TY - DATA AB - Phenomenological relations such as Ohm’s or Fourier’s law have a venerable history in physics but are still scarce in biology. This situation restrains predictive theory. Here, we build on bacterial “growth laws,” which capture physiological feedback between translation and cell growth, to construct a minimal biophysical model for the combined action of ribosome-targeting antibiotics. Our model predicts drug interactions like antagonism or synergy solely from responses to individual drugs. We provide analytical results for limiting cases, which agree well with numerical results. We systematically refine the model by including direct physical interactions of different antibiotics on the ribosome. In a limiting case, our model provides a mechanistic underpinning for recent predictions of higher-order interactions that were derived using entropy maximization. We further refine the model to include the effects of antibiotics that mimic starvation and the presence of resistance genes. We describe the impact of a starvation-mimicking antibiotic on drug interactions analytically and verify it experimentally. Our extended model suggests a change in the type of drug interaction that depends on the strength of resistance, which challenges established rescaling paradigms. We experimentally show that the presence of unregulated resistance genes can lead to altered drug interaction, which agrees with the prediction of the model. While minimal, the model is readily adaptable and opens the door to predicting interactions of second and higher-order in a broad range of biological systems. AU - Kavcic, Bor ID - 8930 KW - Escherichia coli KW - antibiotic combinations KW - translation KW - growth laws KW - drug interactions KW - bacterial physiology KW - translation inhibitors TI - Analysis scripts and research data for the paper "Minimal biophysical model of combined antibiotic action" ER - TY - DATA AB - Gene expression levels are influenced by multiple coexisting molecular mechanisms. Some of these interactions, such as those of transcription factors and promoters have been studied extensively. However, predicting phenotypes of gene regulatory networks remains a major challenge. Here, we use a well-defined synthetic gene regulatory network to study how network phenotypes depend on local genetic context, i.e. the genetic neighborhood of a transcription factor and its relative position. We show that one gene regulatory network with fixed topology can display not only quantitatively but also qualitatively different phenotypes, depending solely on the local genetic context of its components. Our results demonstrate that changes in local genetic context can place a single transcriptional unit within two separate regulons without the need for complex regulatory sequences. We propose that relative order of individual transcriptional units, with its potential for combinatorial complexity, plays an important role in shaping phenotypes of gene regulatory networks. AU - Nagy-Staron, Anna A ID - 8951 KW - Gene regulatory networks KW - Gene expression KW - Escherichia coli KW - Synthetic Biology TI - Sequences of gene regulatory network permutations for the article "Local genetic context shapes the function of a gene regulatory network" ER - TY - DATA AB - Organisms cope with change by employing transcriptional regulators. However, when faced with rare environments, the evolution of transcriptional regulators and their promoters may be too slow. We ask whether the intrinsic instability of gene duplication and amplification provides a generic alternative to canonical gene regulation. By real-time monitoring of gene copy number mutations in E. coli, we show that gene duplications and amplifications enable adaptation to fluctuating environments by rapidly generating copy number, and hence expression level, polymorphism. This ‘amplification-mediated gene expression tuning’ occurs on timescales similar to canonical gene regulation and can deal with rapid environmental changes. Mathematical modeling shows that amplifications also tune gene expression in stochastic environments where transcription factor-based schemes are hard to evolve or maintain. The fleeting nature of gene amplifications gives rise to a generic population-level mechanism that relies on genetic heterogeneity to rapidly tune expression of any gene, without leaving any genomic signature. AU - Grah, Rok ID - 7383 KW - Matlab scripts KW - analysis of microfluidics KW - mathematical model TI - Matlab scripts for the Paper: Gene Amplification as a Form of Population-Level Gene Expression regulation ER - TY - DATA AU - Katsaros, Georgios ID - 9222 TI - Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling ER - TY - THES AB - Fabrication of curved shells plays an important role in modern design, industry, and science. Among their remarkable properties are, for example, aesthetics of organic shapes, ability to evenly distribute loads, or efficient flow separation. They find applications across vast length scales ranging from sky-scraper architecture to microscopic devices. But, at the same time, the design of curved shells and their manufacturing process pose a variety of challenges. In this thesis, they are addressed from several perspectives. In particular, this thesis presents approaches based on the transformation of initially flat sheets into the target curved surfaces. This involves problems of interactive design of shells with nontrivial mechanical constraints, inverse design of complex structural materials, and data-driven modeling of delicate and time-dependent physical properties. At the same time, two newly-developed self-morphing mechanisms targeting flat-to-curved transformation are presented. In architecture, doubly curved surfaces can be realized as cold bent glass panelizations. Originally flat glass panels are bent into frames and remain stressed. This is a cost-efficient fabrication approach compared to hot bending, when glass panels are shaped plastically. However such constructions are prone to breaking during bending, and it is highly nontrivial to navigate the design space, keeping the panels fabricable and aesthetically pleasing at the same time. We introduce an interactive design system for cold bent glass façades, while previously even offline optimization for such scenarios has not been sufficiently developed. Our method is based on a deep learning approach providing quick and high precision estimation of glass panel shape and stress while handling the shape multimodality. Fabrication of smaller objects of scales below 1 m, can also greatly benefit from shaping originally flat sheets. In this respect, we designed new self-morphing shell mechanisms transforming from an initial flat state to a doubly curved state with high precision and detail. Our so-called CurveUps demonstrate the encodement of the geometric information into the shell. Furthermore, we explored the frontiers of programmable materials and showed how temporal information can additionally be encoded into a flat shell. This allows prescribing deformation sequences for doubly curved surfaces and, thus, facilitates self-collision avoidance enabling complex shapes and functionalities otherwise impossible. Both of these methods include inverse design tools keeping the user in the design loop. AU - Guseinov, Ruslan ID - 8366 KW - computer-aided design KW - shape modeling KW - self-morphing KW - mechanical engineering SN - 2663-337X TI - Computational design of curved thin shells: From glass façades to programmable matter ER - TY - JOUR AB - Cold bent glass is a promising and cost-efficient method for realizing doubly curved glass facades. They are produced by attaching planar glass sheets to curved frames and require keeping the occurring stress within safe limits. However, it is very challenging to navigate the design space of cold bent glass panels due to the fragility of the material, which impedes the form-finding for practically feasible and aesthetically pleasing cold bent glass facades. We propose an interactive, data-driven approach for designing cold bent glass facades that can be seamlessly integrated into a typical architectural design pipeline. Our method allows non-expert users to interactively edit a parametric surface while providing real-time feedback on the deformed shape and maximum stress of cold bent glass panels. Designs are automatically refined to minimize several fairness criteria while maximal stresses are kept within glass limits. We achieve interactive frame rates by using a differentiable Mixture Density Network trained from more than a million simulations. Given a curved boundary, our regression model is capable of handling multistable configurations and accurately predicting the equilibrium shape of the panel and its corresponding maximal stress. We show predictions are highly accurate and validate our results with a physical realization of a cold bent glass surface. AU - Gavriil, Konstantinos AU - Guseinov, Ruslan AU - Perez Rodriguez, Jesus AU - Pellis, Davide AU - Henderson, Paul M AU - Rist, Florian AU - Pottmann, Helmut AU - Bickel, Bernd ID - 8562 IS - 6 JF - ACM Transactions on Graphics SN - 0730-0301 TI - Computational design of cold bent glass façades VL - 39 ER - TY - JOUR AB - Using inelastic cotunneling spectroscopy we observe a zero field splitting within the spin triplet manifold of Ge hut wire quantum dots. The states with spin ±1 in the confinement direction are energetically favored by up to 55 μeV compared to the spin 0 triplet state because of the strong spin–orbit coupling. The reported effect should be observable in a broad class of strongly confined hole quantum-dot systems and might need to be considered when operating hole spin qubits. AU - Katsaros, Georgios AU - Kukucka, Josip AU - Vukušić, Lada AU - Watzinger, Hannes AU - Gao, Fei AU - Wang, Ting AU - Zhang, Jian-Jun AU - Held, Karsten ID - 8203 IS - 7 JF - Nano Letters SN - 1530-6984 TI - Zero field splitting of heavy-hole states in quantum dots VL - 20 ER - TY - JOUR AB - In vitro work revealed that excitatory synaptic inputs to hippocampal inhibitory interneurons could undergo Hebbian, associative, or non-associative plasticity. Both behavioral and learning-dependent reorganization of these connections has also been demonstrated by measuring spike transmission probabilities in pyramidal cell-interneuron spike cross-correlations that indicate monosynaptic connections. Here we investigated the activity-dependent modification of these connections during exploratory behavior in rats by optogenetically inhibiting pyramidal cell and interneuron subpopulations. Light application and associated firing alteration of pyramidal and interneuron populations led to lasting changes in pyramidal-interneuron connection weights as indicated by spike transmission changes. Spike transmission alterations were predicted by the light-mediated changes in the number of pre- and postsynaptic spike pairing events and by firing rate changes of interneurons but not pyramidal cells. This work demonstrates the presence of activity-dependent associative and non-associative reorganization of pyramidal-interneuron connections triggered by the optogenetic modification of the firing rate and spike synchrony of cells. AU - Gridchyn, Igor AU - Schönenberger, Philipp AU - O'Neill, Joseph AU - Csicsvari, Jozsef L ID - 8740 JF - eLife TI - Optogenetic inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron connections during behavior VL - 9 ER - TY - DATA AB - Supplementary movies showing the following sequences for spatio-temporarily programmed shells: input geometry and actuation time landscape; comparison of morphing processes from a camera recording and a simulation; final actuated shape. AU - Guseinov, Ruslan ID - 8375 TI - Supplementary data for "Computational design of curved thin shells: from glass façades to programmable matter" ER - TY - DATA AB - These are the supplementary research data to the publication "Zero field splitting of heavy-hole states in quantum dots". All matrix files have the same format. Within each column the bias voltage is changed. Each column corresponds to either a different gate voltage or magnetic field. The voltage values are given in mV, the current values in pA. Find a specific description in the included Readme file. AU - Katsaros, Georgios ID - 7689 TI - Supplementary data for "Zero field splitting of heavy-hole states in quantum dots" ER - TY - DATA AU - Guseinov, Ruslan ID - 8761 TI - Supplementary data for "Computational design of cold bent glass façades" ER - TY - DATA AB - Supplementary data provided for the provided for the publication: Igor Gridchyn , Philipp Schoenenberger , Joseph O'Neill , Jozsef Csicsvari (2020) Optogenetic inhibition-mediated activity-dependent modification of CA1 pyramidal-interneuron connections during behavior. Elife. AU - Csicsvari, Jozsef L AU - Gridchyn, Igor AU - Schönenberger, Philipp ID - 8563 TI - Optogenetic alteration of hippocampal network activity ER - TY - JOUR AB - Advances in shape-morphing materials, such as hydrogels, shape-memory polymers and light-responsive polymers have enabled prescribing self-directed deformations of initially flat geometries. However, most proposed solutions evolve towards a target geometry without considering time-dependent actuation paths. To achieve more complex geometries and avoid self-collisions, it is critical to encode a spatial and temporal shape evolution within the initially flat shell. Recent realizations of time-dependent morphing are limited to the actuation of few, discrete hinges and cannot form doubly curved surfaces. Here, we demonstrate a method for encoding temporal shape evolution in architected shells that assume complex shapes and doubly curved geometries. The shells are non-periodic tessellations of pre-stressed contractile unit cells that soften in water at rates prescribed locally by mesostructure geometry. The ensuing midplane contraction is coupled to the formation of encoded curvatures. We propose an inverse design tool based on a data-driven model for unit cells’ temporal responses. AU - Guseinov, Ruslan AU - McMahan, Connor AU - Perez Rodriguez, Jesus AU - Daraio, Chiara AU - Bickel, Bernd ID - 7262 JF - Nature Communications KW - Design KW - Synthesis and processing KW - Mechanical engineering KW - Polymers SN - 2041-1723 TI - Programming temporal morphing of self-actuated shells VL - 11 ER - TY - DATA AB - Cryo-electron microscopy (cryo-EM) of cellular specimens provides insights into biological processes and structures within a native context. However, a major challenge still lies in the efficient and reproducible preparation of adherent cells for subsequent cryo-EM analysis. This is due to the sensitivity of many cellular specimens to the varying seeding and culturing conditions required for EM experiments, the often limited amount of cellular material and also the fragility of EM grids and their substrate. Here, we present low-cost and reusable 3D printed grid holders, designed to improve specimen preparation when culturing challenging cellular samples directly on grids. The described grid holders increase cell culture reproducibility and throughput, and reduce the resources required for cell culturing. We show that grid holders can be integrated into various cryo-EM workflows, including micro-patterning approaches to control cell seeding on grids, and for generating samples for cryo-focused ion beam milling and cryo-electron tomography experiments. Their adaptable design allows for the generation of specialized grid holders customized to a large variety of applications. AU - Schur, Florian KM ID - 14592 TI - STL-files for 3D-printed grid holders described in Fäßler F, Zens B, et al.; 3D printed cell culture grid holders for improved cellular specimen preparation in cryo-electron microscopy ER - TY - CONF AB - Persistent homology is a powerful tool in Topological Data Analysis (TDA) to capture the topological properties of data succinctly at different spatial resolutions. For graphical data, the shape, and structure of the neighborhood of individual data items (nodes) are an essential means of characterizing their properties. We propose the use of persistent homology methods to capture structural and topological properties of graphs and use it to address the problem of link prediction. We achieve encouraging results on nine different real-world datasets that attest to the potential of persistent homology-based methods for network analysis. AU - Bhatia, Sumit AU - Chatterjee, Bapi AU - Nathani, Deepak AU - Kaul, Manohar ID - 7213 SN - 1860949X T2 - Complex Networks and their applications VIII TI - A persistent homology perspective to the link prediction problem VL - 881 ER - TY - CONF AB - In this paper, we present the first Asynchronous Distributed Key Generation (ADKG) algorithm which is also the first distributed key generation algorithm that can generate cryptographic keys with a dual (f,2f+1)-threshold (where f is the number of faulty parties). As a result, using our ADKG we remove the trusted setup assumption that the most scalable consensus algorithms make. In order to create a DKG with a dual (f,2f+1)- threshold we first answer in the affirmative the open question posed by Cachin et al. [7] on how to create an Asynchronous Verifiable Secret Sharing (AVSS) protocol with a reconstruction threshold of f+1 0$. Based on the recent work of Ghaffari et al. [FOCS'18], this additive $O(\log\log n)$ factor is conditionally essential. These algorithms can also be shown to run in $O(\log \Delta)$ rounds in the closely related model of CONGESTED CLIQUE, improving upon the state-of-the-art bound of $O(\log^2 \Delta)$ rounds by Censor-Hillel et al. [DISC'17]. AU - Czumaj, Artur AU - Davies, Peter AU - Parter, Merav ID - 7802 IS - 7 T2 - Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020) TI - Graph sparsification for derandomizing massively parallel computation with low space ER - TY - CONF AB - Balanced search trees typically use key comparisons to guide their operations, and achieve logarithmic running time. By relying on numerical properties of the keys, interpolation search achieves lower search complexity and better performance. Although interpolation-based data structures were investigated in the past, their non-blocking concurrent variants have received very little attention so far. In this paper, we propose the first non-blocking implementation of the classic interpolation search tree (IST) data structure. For arbitrary key distributions, the data structure ensures worst-case O(log n + p) amortized time for search, insertion and deletion traversals. When the input key distributions are smooth, lookups run in expected O(log log n + p) time, and insertion and deletion run in expected amortized O(log log n + p) time, where p is a bound on the number of threads. To improve the scalability of concurrent insertion and deletion, we propose a novel parallel rebuilding technique, which should be of independent interest. We evaluate whether the theoretical improvements translate to practice by implementing the concurrent interpolation search tree, and benchmarking it on uniform and nonuniform key distributions, for dataset sizes in the millions to billions of keys. Relative to the state-of-the-art concurrent data structures, the concurrent interpolation search tree achieves performance improvements of up to 15% under high update rates, and of up to 50% under moderate update rates. Further, ISTs exhibit up to 2X less cache-misses, and consume 1.2 -- 2.6X less memory compared to the next best alternative on typical dataset sizes. We find that the results are surprisingly robust to distributional skew, which suggests that our data structure can be a promising alternative to classic concurrent search structures. AU - Brown, Trevor A AU - Prokopec, Aleksandar AU - Alistarh, Dan-Adrian ID - 7636 SN - 9781450368186 T2 - Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming TI - Non-blocking interpolation search trees with doubly-logarithmic running time ER - TY - CONF AB - There has been a significant amount of research on hardware and software support for efficient concurrent data structures; yet, the question of how to build correct, simple, and scalable data structures has not yet been definitively settled. In this paper, we revisit this question from a minimalist perspective, and ask: what is the smallest amount of synchronization required for correct and efficient concurrent search data structures, and how could this minimal synchronization support be provided in hardware? To address these questions, we introduce memory tagging, a simple hardware mechanism which enables the programmer to "tag" a dynamic set of memory locations, at cache-line granularity, and later validate whether the memory has been concurrently modified, with the possibility of updating one of the underlying locations atomically if validation succeeds. We provide several examples showing that this mechanism can enable fast and arguably simple concurrent data structure designs, such as lists, binary search trees, balanced search trees, range queries, and Software Transactional Memory (STM) implementations. We provide an implementation of memory tags in the Graphite multi-core simulator, showing that the mechanism can be implemented entirely at the level of L1 cache, and that it can enable non-trivial speedups versus existing implementations of the above data structures. AU - Alistarh, Dan-Adrian AU - Brown, Trevor A AU - Singhal, Nandini ID - 8191 IS - 7 SN - 9781450369350 T2 - Annual ACM Symposium on Parallelism in Algorithms and Architectures TI - Memory tagging: Minimalist synchronization for scalable concurrent data structures ER - TY - CONF AB - Concurrent programming can be notoriously complex and error-prone. Programming bugs can arise from a variety of sources, such as operation re-reordering, or incomplete understanding of the memory model. A variety of formal and model checking methods have been developed to address this fundamental difficulty. While technically interesting, existing academic methods are still hard to apply to the large codebases typical of industrial deployments, which limits their practical impact. AU - Koval, Nikita AU - Sokolova, Mariia AU - Fedorov, Alexander AU - Alistarh, Dan-Adrian AU - Tsitelov, Dmitry ID - 7635 SN - 9781450368186 T2 - Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP TI - Testing concurrency on the JVM with Lincheck ER - TY - CONF AB - We introduce extension-based proofs, a class of impossibility proofs that includes valency arguments. They are modelled as an interaction between a prover and a protocol. Using proofs based on combinatorial topology, it has been shown that it is impossible to deterministically solve k-set agreement among n > k ≥ 2 processes in a wait-free manner. However, it was unknown whether proofs based on simpler techniques were possible. We explain why this impossibility result cannot be obtained by an extension-based proof and, hence, extension-based proofs are limited in power. AU - Alistarh, Dan-Adrian AU - Aspnes, James AU - Ellen, Faith AU - Gelashvili, Rati AU - Zhu, Leqi ID - 8383 SN - 9781450375825 T2 - Proceedings of the 39th Symposium on Principles of Distributed Computing TI - Brief Announcement: Why Extension-Based Proofs Fail ER - TY - JOUR AB - We present a method for animating yarn-level cloth effects using a thin-shell solver. We accomplish this through numerical homogenization: we first use a large number of yarn-level simulations to build a model of the potential energy density of the cloth, and then use this energy density function to compute forces in a thin shell simulator. We model several yarn-based materials, including both woven and knitted fabrics. Our model faithfully reproduces expected effects like the stiffness of woven fabrics, and the highly deformable nature and anisotropy of knitted fabrics. Our approach does not require any real-world experiments nor measurements; because the method is based entirely on simulations, it can generate entirely new material models quickly, without the need for testing apparatuses or human intervention. We provide data-driven models of several woven and knitted fabrics, which can be used for efficient simulation with an off-the-shelf cloth solver. AU - Sperl, Georg AU - Narain, Rahul AU - Wojtan, Christopher J ID - 8385 IS - 4 JF - ACM Transactions on Graphics SN - 07300301 TI - Homogenized yarn-level cloth VL - 39 ER - TY - JOUR AB - When short-range attractions are combined with long-range repulsions in colloidal particle systems, complex microphases can emerge. Here, we study a system of isotropic particles, which can form lamellar structures or a disordered fluid phase when temperature is varied. We show that, at equilibrium, the lamellar structure crystallizes, while out of equilibrium, the system forms a variety of structures at different shear rates and temperatures above melting. The shear-induced ordering is analyzed by means of principal component analysis and artificial neural networks, which are applied to data of reduced dimensionality. Our results reveal the possibility of inducing ordering by shear, potentially providing a feasible route to the fabrication of ordered lamellar structures from isotropic particles. AU - Pȩkalski, J. AU - Rzadkowski, Wojciech AU - Panagiotopoulos, A. Z. ID - 7956 IS - 20 JF - The Journal of chemical physics TI - Shear-induced ordering in systems with competing interactions: A machine learning study VL - 152 ER - TY - CONF AB - We present the first deterministic wait-free long-lived snapshot algorithm, using only read and write operations, that guarantees polylogarithmic amortized step complexity in all executions. This is the first non-blocking snapshot algorithm, using reads and writes only, that has sub-linear amortized step complexity in executions of arbitrary length. The key to our construction is a novel implementation of a 2-component max array object which may be of independent interest. AU - Baig, Mirza Ahad AU - Hendler, Danny AU - Milani, Alessia AU - Travers, Corentin ID - 8382 SN - 9781450375825 T2 - Proceedings of the 39th Symposium on Principles of Distributed Computing TI - Long-lived snapshots with polylogarithmic amortized step complexity ER - TY - JOUR AB - In the superconducting regime of FeTe(1−x)Sex, there exist two types of vortices which are distinguished by the presence or absence of zero-energy states in their core. To understand their origin, we examine the interplay of Zeeman coupling and superconducting pairings in three-dimensional metals with band inversion. Weak Zeeman fields are found to suppress intraorbital spin-singlet pairing, known to localize the states at the ends of the vortices on the surface. On the other hand, an orbital-triplet pairing is shown to be stable against Zeeman interactions, but leads to delocalized zero-energy Majorana modes which extend through the vortex. In contrast, the finite-energy vortex modes remain localized at the vortex ends even when the pairing is of orbital-triplet form. Phenomenologically, this manifests as an observed disappearance of zero-bias peaks within the cores of topological vortices upon an increase of the applied magnetic field. The presence of magnetic impurities in FeTe(1−x)Sex, which are attracted to the vortices, would lead to such Zeeman-induced delocalization of Majorana modes in a fraction of vortices that capture a large enough number of magnetic impurities. Our results provide an explanation for the dichotomy between topological and nontopological vortices recently observed in FeTe(1−x)Sex. AU - Ghazaryan, Areg AU - Lopes, P. L.S. AU - Hosur, Pavan AU - Gilbert, Matthew J. AU - Ghaemi, Pouyan ID - 7428 IS - 2 JF - Physical Review B SN - 24699950 TI - Effect of Zeeman coupling on the Majorana vortex modes in iron-based topological superconductors VL - 101 ER - TY - JOUR AB - We demonstrate that releasing atoms into free space from an optical lattice does not deteriorate cavity-generated spin squeezing for metrological purposes. In this work, an ensemble of 500000 spin-squeezed atoms in a high-finesse optical cavity with near-uniform atom-cavity coupling is prepared, released into free space, recaptured in the cavity, and probed. Up to ∼10 dB of metrologically relevant squeezing is retrieved for 700μs free-fall times, and decaying levels of squeezing are realized for up to 3 ms free-fall times. The degradation of squeezing results from loss of atom-cavity coupling homogeneity between the initial squeezed state generation and final collective state readout. A theoretical model is developed to quantify this degradation and this model is experimentally validated. AU - Wu, Yunfan AU - Krishnakumar, Rajiv AU - Martínez-Rincón, Julián AU - Malia, Benjamin K. AU - Hosten, Onur AU - Kasevich, Mark A. ID - 8319 IS - 1 JF - Physical Review A SN - 24699926 TI - Retrieval of cavity-generated atomic spin squeezing after free-space release VL - 102 ER - TY - JOUR AB - The “procedural” approach to animating ocean waves is the dominant algorithm for animating larger bodies of water in interactive applications as well as in off-line productions — it provides high visual quality with a low computational demand. In this paper, we widen the applicability of procedural water wave animation with an extension that guarantees the satisfaction of boundary conditions imposed by terrain while still approximating physical wave behavior. In combination with a particle system that models wave breaking, foam, and spray, this allows us to naturally model waves interacting with beaches and rocks. Our system is able to animate waves at large scales at interactive frame rates on a commodity PC. AU - Jeschke, Stefan AU - Hafner, Christian AU - Chentanez, Nuttapong AU - Macklin, Miles AU - Müller-Fischer, Matthias AU - Wojtan, Christopher J ID - 8766 IS - 8 JF - Computer Graphics forum TI - Making procedural water waves boundary-aware VL - 39 ER - TY - JOUR AB - Markov decision processes (MDPs) are the defacto framework for sequential decision making in the presence of stochastic uncertainty. A classical optimization criterion for MDPs is to maximize the expected discounted-sum payoff, which ignores low probability catastrophic events with highly negative impact on the system. On the other hand, risk-averse policies require the probability of undesirable events to be below a given threshold, but they do not account for optimization of the expected payoff. We consider MDPs with discounted-sum payoff with failure states which represent catastrophic outcomes. The objective of risk-constrained planning is to maximize the expected discounted-sum payoff among risk-averse policies that ensure the probability to encounter a failure state is below a desired threshold. Our main contribution is an efficient risk-constrained planning algorithm that combines UCT-like search with a predictor learned through interaction with the MDP (in the style of AlphaZero) and with a risk-constrained action selection via linear programming. We demonstrate the effectiveness of our approach with experiments on classical MDPs from the literature, including benchmarks with an order of 106 states. AU - Brázdil, Tomáš AU - Chatterjee, Krishnendu AU - Novotný, Petr AU - Vahala, Jiří ID - 15055 IS - 06 JF - Proceedings of the 34th AAAI Conference on Artificial Intelligence KW - General Medicine SN - 2374-3468 TI - Reinforcement learning of risk-constrained policies in Markov decision processes VL - 34 ER - TY - JOUR AB - Vaccinia virus–related kinase (VRK) is an evolutionarily conserved nuclear protein kinase. VRK-1, the single Caenorhabditis elegans VRK ortholog, functions in cell division and germline proliferation. However, the role of VRK-1 in postmitotic cells and adult life span remains unknown. Here, we show that VRK-1 increases organismal longevity by activating the cellular energy sensor, AMP-activated protein kinase (AMPK), via direct phosphorylation. We found that overexpression of vrk-1 in the soma of adult C. elegans increased life span and, conversely, inhibition of vrk-1 decreased life span. In addition, vrk-1 was required for longevity conferred by mutations that inhibit C. elegans mitochondrial respiration, which requires AMPK. VRK-1 directly phosphorylated and up-regulated AMPK in both C. elegans and cultured human cells. Thus, our data show that the somatic nuclear kinase, VRK-1, promotes longevity through AMPK activation, and this function appears to be conserved between C. elegans and humans. AU - Park, Sangsoon AU - Artan, Murat AU - Han, Seung Hyun AU - Park, Hae-Eun H. AU - Jung, Yoonji AU - Hwang, Ara B. AU - Shin, Won Sik AU - Kim, Kyong-Tai AU - Lee, Seung-Jae V. ID - 15057 IS - 27 JF - Science Advances TI - VRK-1 extends life span by activation of AMPK via phosphorylation VL - 6 ER - TY - JOUR AB - The actin cytoskeleton, a dynamic network of actin filaments and associated F-actin–binding proteins, is fundamentally important in eukaryotes. α-Actinins are major F-actin bundlers that are inhibited by Ca2+ in nonmuscle cells. Here we report the mechanism of Ca2+-mediated regulation of Entamoeba histolytica α-actinin-2 (EhActn2) with features expected for the common ancestor of Entamoeba and higher eukaryotic α-actinins. Crystal structures of Ca2+-free and Ca2+-bound EhActn2 reveal a calmodulin-like domain (CaMD) uniquely inserted within the rod domain. Integrative studies reveal an exceptionally high affinity of the EhActn2 CaMD for Ca2+, binding of which can only be regulated in the presence of physiological concentrations of Mg2+. Ca2+ binding triggers an increase in protein multidomain rigidity, reducing conformational flexibility of F-actin–binding domains via interdomain cross-talk and consequently inhibiting F-actin bundling. In vivo studies uncover that EhActn2 plays an important role in phagocytic cup formation and might constitute a new drug target for amoebic dysentery. AU - Pinotsis, Nikos AU - Zielinska, Karolina AU - Babuta, Mrigya AU - Arolas, Joan L. AU - Kostan, Julius AU - Khan, Muhammad Bashir AU - Schreiner, Claudia AU - Testa Salmazo, Anita P AU - Ciccarelli, Luciano AU - Puchinger, Martin AU - Gkougkoulia, Eirini A. AU - Ribeiro, Euripedes de Almeida AU - Marlovits, Thomas C. AU - Bhattacharya, Alok AU - Djinovic-Carugo, Kristina ID - 15061 IS - 36 JF - Proceedings of the National Academy of Sciences SN - 0027-8424 TI - Calcium modulates the domain flexibility and function of an α-actinin similar to the ancestral α-actinin VL - 117 ER - TY - JOUR AB - We call a continuous self-map that reveals itself through a discrete set of point-value pairs a sampled dynamical system. Capturing the available information with chain maps on Delaunay complexes, we use persistent homology to quantify the evidence of recurrent behavior. We establish a sampling theorem to recover the eigenspaces of the endomorphism on homology induced by the self-map. Using a combinatorial gradient flow arising from the discrete Morse theory for Čech and Delaunay complexes, we construct a chain map to transform the problem from the natural but expensive Čech complexes to the computationally efficient Delaunay triangulations. The fast chain map algorithm has applications beyond dynamical systems. AU - Bauer, U. AU - Edelsbrunner, Herbert AU - Jablonski, Grzegorz AU - Mrozek, M. ID - 15064 IS - 4 JF - Journal of Applied and Computational Topology SN - 2367-1726 TI - Čech-Delaunay gradient flow and homology inference for self-maps VL - 4 ER - TY - JOUR AB - We consider the least singular value of a large random matrix with real or complex i.i.d. Gaussian entries shifted by a constant z∈C. We prove an optimal lower tail estimate on this singular value in the critical regime where z is around the spectral edge, thus improving the classical bound of Sankar, Spielman and Teng (SIAM J. Matrix Anal. Appl. 28:2 (2006), 446–476) for the particular shift-perturbation in the edge regime. Lacking Brézin–Hikami formulas in the real case, we rely on the superbosonization formula (Comm. Math. Phys. 283:2 (2008), 343–395). AU - Cipolloni, Giorgio AU - Erdös, László AU - Schröder, Dominik J ID - 15063 IS - 1 JF - Probability and Mathematical Physics KW - General Medicine SN - 2690-1005 TI - Optimal lower bound on the least singular value of the shifted Ginibre ensemble VL - 1 ER - TY - CONF AB - In this paper we present a room temperature radiometer that can eliminate the need of using cryostats in satellite payload reducing its weight and improving reliability. The proposed radiometer is based on an electro-optic upconverter that boosts up microwave photons energy by upconverting them into an optical domain what makes them immune to thermal noise even if operating at room temperature. The converter uses a high-quality factor whispering gallery mode (WGM) resonator providing naturally narrow bandwidth and therefore might be useful for applications like microwave hyperspectral sensing. The upconversion process is explained by providing essential information about photon conversion efficiency and sensitivity. To prove the concept, we describe an experiment which shows state-of-the-art photon conversion efficiency n=10-5 per mW of pump power at the frequency of 80 GHz. AU - Wasiak, Michal AU - Botello, Gabriel Santamaria AU - Abdalmalak, Kerlos Atia AU - Sedlmeir, Florian AU - Rueda Sanchez, Alfredo R AU - Segovia-Vargas, Daniel AU - Schwefel, Harald G. L. AU - Munoz, Luis Enrique Garcia ID - 15059 T2 - 14th European Conference on Antennas and Propagation TI - Compact millimeter and submillimeter-wave photonic radiometer for cubesats ER - TY - CONF AB - We introduce a new graph problem, the token dropping game, and we show how to solve it efficiently in a distributed setting. We use the token dropping game as a tool to design an efficient distributed algorithm for the stable orientation problem, which is a special case of the more general locally optimal semi-matching problem. The prior work by Czygrinow et al. (DISC 2012) finds a locally optimal semi-matching in O(Δ⁵) rounds in graphs of maximum degree Δ, which directly implies an algorithm with the same runtime for stable orientations. We improve the runtime to O(Δ⁴) for stable orientations and prove a lower bound of Ω(Δ) rounds. AU - Brandt, Sebastian AU - Keller, Barbara AU - Rybicki, Joel AU - Suomela, Jukka AU - Uitto, Jara ID - 15074 T2 - 34th International Symposium on Distributed Computing TI - Brief announcement: Efficient load-balancing through distributed token dropping VL - 179 ER - TY - CONF AB - We consider the following dynamic load-balancing process: given an underlying graph G with n nodes, in each step t≥ 0, one unit of load is created, and placed at a randomly chosen graph node. In the same step, the chosen node picks a random neighbor, and the two nodes balance their loads by averaging them. We are interested in the expected gap between the minimum and maximum loads at nodes as the process progresses, and its dependence on n and on the graph structure. Variants of the above graphical balanced allocation process have been studied previously by Peres, Talwar, and Wieder [Peres et al., 2015], and by Sauerwald and Sun [Sauerwald and Sun, 2015]. These authors left as open the question of characterizing the gap in the case of cycle graphs in the dynamic case, where weights are created during the algorithm’s execution. For this case, the only known upper bound is of 𝒪(n log n), following from a majorization argument due to [Peres et al., 2015], which analyzes a related graphical allocation process. In this paper, we provide an upper bound of 𝒪 (√n log n) on the expected gap of the above process for cycles of length n. We introduce a new potential analysis technique, which enables us to bound the difference in load between k-hop neighbors on the cycle, for any k ≤ n/2. We complement this with a "gap covering" argument, which bounds the maximum value of the gap by bounding its value across all possible subsets of a certain structure, and recursively bounding the gaps within each subset. We provide analytical and experimental evidence that our upper bound on the gap is tight up to a logarithmic factor. AU - Alistarh, Dan-Adrian AU - Nadiradze, Giorgi AU - Sabour, Amirmojtaba ID - 15077 T2 - 47th International Colloquium on Automata, Languages, and Programming TI - Dynamic averaging load balancing on cycles VL - 168 ER - TY - CONF AB - Two plane drawings of geometric graphs on the same set of points are called disjoint compatible if their union is plane and they do not have an edge in common. For a given set S of 2n points two plane drawings of perfect matchings M1 and M2 (which do not need to be disjoint nor compatible) are disjoint tree-compatible if there exists a plane drawing of a spanning tree T on S which is disjoint compatible to both M1 and M2. We show that the graph of all disjoint tree-compatible perfect geometric matchings on 2n points in convex position is connected if and only if 2n ≥ 10. Moreover, in that case the diameter of this graph is either 4 or 5, independent of n. AU - Aichholzer, Oswin AU - Obmann, Julia AU - Patak, Pavel AU - Perz, Daniel AU - Tkadlec, Josef ID - 15082 T2 - 36th European Workshop on Computational Geometry TI - Disjoint tree-compatible plane perfect matchings ER - TY - JOUR AB - Fitting a function by using linear combinations of a large number N of `simple' components is one of the most fruitful ideas in statistical learning. This idea lies at the core of a variety of methods, from two-layer neural networks to kernel regression, to boosting. In general, the resulting risk minimization problem is non-convex and is solved by gradient descent or its variants. Unfortunately, little is known about global convergence properties of these approaches. Here we consider the problem of learning a concave function f on a compact convex domain Ω⊆ℝd, using linear combinations of `bump-like' components (neurons). The parameters to be fitted are the centers of N bumps, and the resulting empirical risk minimization problem is highly non-convex. We prove that, in the limit in which the number of neurons diverges, the evolution of gradient descent converges to a Wasserstein gradient flow in the space of probability distributions over Ω. Further, when the bump width δ tends to 0, this gradient flow has a limit which is a viscous porous medium equation. Remarkably, the cost function optimized by this gradient flow exhibits a special property known as displacement convexity, which implies exponential convergence rates for N→∞, δ→0. Surprisingly, this asymptotic theory appears to capture well the behavior for moderate values of δ,N. Explaining this phenomenon, and understanding the dependence on δ,N in a quantitative manner remains an outstanding challenge. AU - Javanmard, Adel AU - Mondelli, Marco AU - Montanari, Andrea ID - 6748 IS - 6 JF - Annals of Statistics SN - 1932-6157 TI - Analysis of a two-layer neural network via displacement convexity VL - 48 ER - TY - JOUR AB - This workshop focused on interactions between the various perspectives on the moduli space of Higgs bundles over a Riemann surface. This subject draws on algebraic geometry, geometric topology, geometric analysis and mathematical physics, and the goal was to promote interactions between these various branches of the subject. The main current directions of research were well represented by the participants, and the talks included many from both senior and junior participants. AU - Anderson, Lara AU - Hausel, Tamás AU - Mazzeo, Rafe AU - Schaposnik, Laura ID - 15070 IS - 2 JF - Oberwolfach Reports KW - Organic Chemistry KW - Biochemistry SN - 1660-8933 TI - Geometry and physics of Higgs bundles VL - 16 ER - TY - JOUR AB - In ecology, climate and other fields, (sub)systems have been identified that can transition into a qualitatively different state when a critical threshold or tipping point in a driving process is crossed. An understanding of those tipping elements is of great interest given the increasing influence of humans on the biophysical Earth system. Complex interactions exist between tipping elements, e.g. physical mechanisms connect subsystems of the climate system. Based on earlier work on such coupled nonlinear systems, we systematically assessed the qualitative long-term behaviour of interacting tipping elements. We developed an understanding of the consequences of interactions on the tipping behaviour allowing for tipping cascades to emerge under certain conditions. The (narrative) application of these qualitative results to real-world examples of interacting tipping elements indicates that tipping cascades with profound consequences may occur: the interacting Greenland ice sheet and thermohaline ocean circulation might tip before the tipping points of the isolated subsystems are crossed. The eutrophication of the first lake in a lake chain might propagate through the following lakes without a crossing of their individual critical nutrient input levels. The possibility of emerging cascading tipping dynamics calls for the development of a unified theory of interacting tipping elements and the quantitative analysis of interacting real-world tipping elements. AU - Klose, Ann Kristin AU - Karle, Volker AU - Winkelmann, Ricarda AU - Donges, Jonathan F. ID - 8741 IS - 6 JF - Royal Society Open Science TI - Emergence of cascading dynamics in interacting tipping elements of ecology and climate: Cascading dynamics in tipping elements VL - 7 ER - TY - JOUR AB - A working group, which was established within the Network of Repository Managers (RepManNet), has dealt with common certifications for repositories. In addition, current requirements of the research funding agencies FWF and EU were also taken into account. The Core Trust Seal was examined in more detail. For this purpose, a questionnaire was sent to those organizations that are already certified with CTS in Austria. The answers were summarized and evaluated anonymously. It is recommended to go for a repository certification. Moreover, the development of a DINI certificate in Austria is strongly suggested. AU - Ernst, Doris AU - Novotny, Gertraud AU - Schönher, Eva Maria ID - 7687 IS - 1 JF - Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare SN - 1022-2588 TI - (Core Trust) Seal your repository! VL - 73 ER - TY - JOUR AB - Large complex systems tend to develop universal patterns that often represent their essential characteristics. For example, the cumulative effects of independent or weakly dependent random variables often yield the Gaussian universality class via the central limit theorem. For non-commutative random variables, e.g. matrices, the Gaussian behavior is often replaced by another universality class, commonly called random matrix statistics. Nearby eigenvalues are strongly correlated, and, remarkably, their correlation structure is universal, depending only on the symmetry type of the matrix. Even more surprisingly, this feature is not restricted to matrices; in fact Eugene Wigner, the pioneer of the field, discovered in the 1950s that distributions of the gaps between energy levels of complicated quantum systems universally follow the same random matrix statistics. This claim has never been rigorously proved for any realistic physical system but experimental data and extensive numerics leave no doubt as to its correctness. Since then random matrices have proved to be extremely useful phenomenological models in a wide range of applications beyond quantum physics that include number theory, statistics, neuroscience, population dynamics, wireless communication and mathematical finance. The ubiquity of random matrices in natural sciences is still a mystery, but recent years have witnessed a breakthrough in the mathematical description of the statistical structure of their spectrum. Random matrices and closely related areas such as log-gases have become an extremely active research area in probability theory. This workshop brought together outstanding researchers from a variety of mathematical backgrounds whose areas of research are linked to random matrices. While there are strong links between their motivations, the techniques used by these researchers span a large swath of mathematics, ranging from purely algebraic techniques to stochastic analysis, classical probability theory, operator algebra, supersymmetry, orthogonal polynomials, etc. AU - Erdös, László AU - Götze, Friedrich AU - Guionnet, Alice ID - 15079 IS - 4 JF - Oberwolfach Reports SN - 1660-8933 TI - Random matrices VL - 16 ER - TY - JOUR AB - The interaction among fundamental particles in nature leads to many interesting effects in quantum statistical mechanics; examples include superconductivity for charged systems and superfluidity in cold gases. It is a huge challenge for mathematical physics to understand the collective behavior of systems containing a large number of particles, emerging from known microscopic interactions. In this workshop we brought together researchers working on different aspects of many-body quantum mechanics to discuss recent developments, exchange ideas and propose new challenges and research directions. AU - Hainzl, Christian AU - Schlein, Benjamin AU - Seiringer, Robert AU - Warzel, Simone ID - 15072 IS - 3 JF - Oberwolfach Reports SN - 1660-8933 TI - Many-body quantum systems VL - 16 ER - TY - CONF AB - A mesophilic methanogenic culture, designated JL01, was isolated from Holocene permafrost in the Russian Arctic [1]. After long-term extensive cultivation at 15°C it turned out to be a tied binary culture of archaeal (JL01) and bacterial (Sphaerochaeta associata GLS2) strains. Strain JL01 was a strict anaerobe and grew on methanol, acetate and methylamines as energy and carbon sources. Cells were irregular coccoid, non-motile, non-spore-forming, and Gram-stainpositive. Optimum conditions for growth were 24-28 oC, pH 6.8–7.3 and 0.075-0.1 M NaCl. Phylogenetic tree reconstructions based on 16S rRNA and concatenated alignment of broadly conserved protein-coding genes revealed its close relation to Methanosarcina mazei S-6 T (similarity 99.5%). The comparison of whole genomic sequences (ANI) of the isolate and the type strain of M.mazei was 98.5%, which is higher than the values recommended for new species. Thus strain JL01 (=VKM B-2370=JCM 31898) represents the first M. mazei isolated from permanently subzero Arcticsediments. The long-term co-cultivation of JL01 with S. associata GLS2T showed the methane production without any additional carbon and energy sources. Genome analysis of S. associata GLS2T revealed putative genes involved in methanochondroithin catabolism. AU - Oshurkova, Viktoriia AU - Troshina, Olga AU - Trubitsyn, Vladimir AU - Ryzhmanova, Yana AU - Bochkareva, Olga AU - Shcherbakova, Viktoria ID - 15071 T2 - Proceedings of 1st International Electronic Conference on Microbiology TI - Characterization of methanosarcina mazei JL01 isolated from holocene arctic permafrost and study of the archaeon cooperation with bacterium Sphaerochaeta associata GLS2T ER -