TY - CONF AB - We present a new approach to proving non-termination of non-deterministic integer programs. Our technique is rather simple but efficient. It relies on a purely syntactic reversal of the program's transition system followed by a constraint-based invariant synthesis with constraints coming from both the original and the reversed transition system. The latter task is performed by a simple call to an off-the-shelf SMT-solver, which allows us to leverage the latest advances in SMT-solving. Moreover, our method offers a combination of features not present (as a whole) in previous approaches: it handles programs with non-determinism, provides relative completeness guarantees and supports programs with polynomial arithmetic. The experiments performed with our prototype tool RevTerm show that our approach, despite its simplicity and stronger theoretical guarantees, is at least on par with the state-of-the-art tools, often achieving a non-trivial improvement under a proper configuration of its parameters. AU - Chatterjee, Krishnendu AU - Goharshady, Ehsan Kafshdar AU - Novotný, Petr AU - Zikelic, Dorde ID - 9644 SN - 9781450383912 T2 - Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation TI - Proving non-termination by program reversal ER - TY - JOUR AB - The quantum approximate optimization algorithm (QAOA) is a prospective near-term quantum algorithm due to its modest circuit depth and promising benchmarks. However, an external parameter optimization required in the QAOA could become a performance bottleneck. This motivates studies of the optimization landscape and search for heuristic ways of parameter initialization. In this work we visualize the optimization landscape of the QAOA applied to the MaxCut problem on random graphs, demonstrating that random initialization of the QAOA is prone to converging to local minima with suboptimal performance. We introduce the initialization of QAOA parameters based on the Trotterized quantum annealing (TQA) protocol, parameterized by the Trotter time step. We find that the TQA initialization allows to circumvent the issue of false minima for a broad range of time steps, yielding the same performance as the best result out of an exponentially scaling number of random initializations. Moreover, we demonstrate that the optimal value of the time step coincides with the point of proliferation of Trotter errors in quantum annealing. Our results suggest practical ways of initializing QAOA protocols on near-term quantum devices and reveal new connections between QAOA and quantum annealing. AU - Sack, Stefan AU - Serbyn, Maksym ID - 9760 JF - Quantum TI - Quantum annealing initialization of the quantum approximate optimization algorithm VL - 5 ER - TY - CONF AB - We consider the almost-sure (a.s.) termination problem for probabilistic programs, which are a stochastic extension of classical imperative programs. Lexicographic ranking functions provide a sound and practical approach for termination of non-probabilistic programs, and their extension to probabilistic programs is achieved via lexicographic ranking supermartingales (LexRSMs). However, LexRSMs introduced in the previous work have a limitation that impedes their automation: all of their components have to be non-negative in all reachable states. This might result in LexRSM not existing even for simple terminating programs. Our contributions are twofold: First, we introduce a generalization of LexRSMs which allows for some components to be negative. This standard feature of non-probabilistic termination proofs was hitherto not known to be sound in the probabilistic setting, as the soundness proof requires a careful analysis of the underlying stochastic process. Second, we present polynomial-time algorithms using our generalized LexRSMs for proving a.s. termination in broad classes of linear-arithmetic programs. AU - Chatterjee, Krishnendu AU - Goharshady, Ehsan Kafshdar AU - Novotný, Petr AU - Zárevúcky, Jiří AU - Zikelic, Dorde ID - 10414 SN - 0302-9743 T2 - 24th International Symposium on Formal Methods TI - On lexicographic proof rules for probabilistic termination VL - 13047 ER - TY - JOUR AB - Research on two-dimensional (2D) materials has been explosively increasing in last seventeen years in varying subjects including condensed matter physics, electronic engineering, materials science, and chemistry since the mechanical exfoliation of graphene in 2004. Starting from graphene, 2D materials now have become a big family with numerous members and diverse categories. The unique structural features and physicochemical properties of 2D materials make them one class of the most appealing candidates for a wide range of potential applications. In particular, we have seen some major breakthroughs made in the field of 2D materials in last five years not only in developing novel synthetic methods and exploring new structures/properties but also in identifying innovative applications and pushing forward commercialisation. In this review, we provide a critical summary on the recent progress made in the field of 2D materials with a particular focus on last five years. After a brief background introduction, we first discuss the major synthetic methods for 2D materials, including the mechanical exfoliation, liquid exfoliation, vapor phase deposition, and wet-chemical synthesis as well as phase engineering of 2D materials belonging to the field of phase engineering of nanomaterials (PEN). We then introduce the superconducting/optical/magnetic properties and chirality of 2D materials along with newly emerging magic angle 2D superlattices. Following that, the promising applications of 2D materials in electronics, optoelectronics, catalysis, energy storage, solar cells, biomedicine, sensors, environments, etc. are described sequentially. Thereafter, we present the theoretic calculations and simulations of 2D materials. Finally, after concluding the current progress, we provide some personal discussions on the existing challenges and future outlooks in this rapidly developing field. AU - Chang, Cheng AU - Chen, Wei AU - Chen, Ye AU - Chen, Yonghua AU - Chen, Yu AU - Ding, Feng AU - Fan, Chunhai AU - Fan, Hong Jin AU - Fan, Zhanxi AU - Gong, Cheng AU - Gong, Yongji AU - He, Qiyuan AU - Hong, Xun AU - Hu, Sheng AU - Hu, Weida AU - Huang, Wei AU - Huang, Yuan AU - Ji, Wei AU - Li, Dehui AU - Li, Lain Jong AU - Li, Qiang AU - Lin, Li AU - Ling, Chongyi AU - Liu, Minghua AU - Liu, Nan AU - Liu, Zhuang AU - Loh, Kian Ping AU - Ma, Jianmin AU - Miao, Feng AU - Peng, Hailin AU - Shao, Mingfei AU - Song, Li AU - Su, Shao AU - Sun, Shuo AU - Tan, Chaoliang AU - Tang, Zhiyong AU - Wang, Dingsheng AU - Wang, Huan AU - Wang, Jinlan AU - Wang, Xin AU - Wang, Xinran AU - Wee, Andrew T.S. AU - Wei, Zhongming AU - Wu, Yuen AU - Wu, Zhong Shuai AU - Xiong, Jie AU - Xiong, Qihua AU - Xu, Weigao AU - Yin, Peng AU - Zeng, Haibo AU - Zeng, Zhiyuan AU - Zhai, Tianyou AU - Zhang, Han AU - Zhang, Hui AU - Zhang, Qichun AU - Zhang, Tierui AU - Zhang, Xiang AU - Zhao, Li Dong AU - Zhao, Meiting AU - Zhao, Weijie AU - Zhao, Yunxuan AU - Zhou, Kai Ge AU - Zhou, Xing AU - Zhou, Yu AU - Zhu, Hongwei AU - Zhang, Hua AU - Liu, Zhongfan ID - 14800 IS - 12 JF - Acta Physico-Chimica Sinica SN - 1001-4861 TI - Recent progress on two-dimensional materials VL - 37 ER - TY - CONF AB - Neural-network classifiers achieve high accuracy when predicting the class of an input that they were trained to identify. Maintaining this accuracy in dynamic environments, where inputs frequently fall outside the fixed set of initially known classes, remains a challenge. The typical approach is to detect inputs from novel classes and retrain the classifier on an augmented dataset. However, not only the classifier but also the detection mechanism needs to adapt in order to distinguish between newly learned and yet unknown input classes. To address this challenge, we introduce an algorithmic framework for active monitoring of a neural network. A monitor wrapped in our framework operates in parallel with the neural network and interacts with a human user via a series of interpretable labeling queries for incremental adaptation. In addition, we propose an adaptive quantitative monitor to improve precision. An experimental evaluation on a diverse set of benchmarks with varying numbers of classes confirms the benefits of our active monitoring framework in dynamic scenarios. AU - Lukina, Anna AU - Schilling, Christian AU - Henzinger, Thomas A ID - 10206 KW - monitoring KW - neural networks KW - novelty detection SN - 0302-9743 T2 - 21st International Conference on Runtime Verification TI - Into the unknown: active monitoring of neural networks VL - 12974 ER - TY - JOUR AB - We consider the Fröhlich Hamiltonian with large coupling constant α. For initial data of Pekar product form with coherent phonon field and with the electron minimizing the corresponding energy, we provide a norm approximation of the evolution, valid up to times of order α2. The approximation is given in terms of a Pekar product state, evolved through the Landau-Pekar equations, corrected by a Bogoliubov dynamics taking quantum fluctuations into account. This allows us to show that the Landau-Pekar equations approximately describe the evolution of the electron- and one-phonon reduced density matrices under the Fröhlich dynamics up to times of order α2. AU - Leopold, Nikolai K AU - Mitrouskas, David Johannes AU - Rademacher, Simone Anna Elvira AU - Schlein, Benjamin AU - Seiringer, Robert ID - 14889 IS - 4 JF - Pure and Applied Analysis SN - 2578-5893 TI - Landau–Pekar equations and quantum fluctuations for the dynamics of a strongly coupled polaron VL - 3 ER - TY - JOUR AB - We consider a system of N interacting bosons in the mean-field scaling regime and construct corrections to the Bogoliubov dynamics that approximate the true N-body dynamics in norm to arbitrary precision. The N-independent corrections are given in terms of the solutions of the Bogoliubov and Hartree equations and satisfy a generalized form of Wick's theorem. We determine the n-point correlation functions of the excitations around the condensate, as well as the reduced densities of the N-body system, to arbitrary accuracy, given only the knowledge of the two-point functions of a quasi-free state and the solution of the Hartree equation. In this way, the complex problem of computing all n-point correlation functions for an interacting N-body system is essentially reduced to the problem of solving the Hartree equation and the PDEs for the Bogoliubov two-point functions. AU - Bossmann, Lea AU - Petrat, Sören P AU - Pickl, Peter AU - Soffer, Avy ID - 14890 IS - 4 JF - Pure and Applied Analysis SN - 2578-5893 TI - Beyond Bogoliubov dynamics VL - 3 ER - TY - JOUR AB - We consider random n×n matrices X with independent and centered entries and a general variance profile. We show that the spectral radius of X converges with very high probability to the square root of the spectral radius of the variance matrix of X when n tends to infinity. We also establish the optimal rate of convergence, that is a new result even for general i.i.d. matrices beyond the explicitly solvable Gaussian cases. The main ingredient is the proof of the local inhomogeneous circular law [arXiv:1612.07776] at the spectral edge. AU - Alt, Johannes AU - Erdös, László AU - Krüger, Torben H ID - 15013 IS - 2 JF - Probability and Mathematical Physics SN - 2690-0998 TI - Spectral radius of random matrices with independent entries VL - 2 ER - TY - JOUR AB - Clathrin-mediated endocytosis is the major route of entry of cargos into cells and thus underpins many physiological processes. During endocytosis, an area of flat membrane is remodeled by proteins to create a spherical vesicle against intracellular forces. The protein machinery which mediates this membrane bending in plants is unknown. However, it is known that plant endocytosis is actin independent, thus indicating that plants utilize a unique mechanism to mediate membrane bending against high-turgor pressure compared to other model systems. Here, we investigate the TPLATE complex, a plant-specific endocytosis protein complex. It has been thought to function as a classical adaptor functioning underneath the clathrin coat. However, by using biochemical and advanced live microscopy approaches, we found that TPLATE is peripherally associated with clathrin-coated vesicles and localizes at the rim of endocytosis events. As this localization is more fitting to the protein machinery involved in membrane bending during endocytosis, we examined cells in which the TPLATE complex was disrupted and found that the clathrin structures present as flat patches. This suggests a requirement of the TPLATE complex for membrane bending during plant clathrin–mediated endocytosis. Next, we used in vitro biophysical assays to confirm that the TPLATE complex possesses protein domains with intrinsic membrane remodeling activity. These results redefine the role of the TPLATE complex and implicate it as a key component of the evolutionarily distinct plant endocytosis mechanism, which mediates endocytic membrane bending against the high-turgor pressure in plant cells. AU - Johnson, Alexander J AU - Dahhan, Dana A AU - Gnyliukh, Nataliia AU - Kaufmann, Walter AU - Zheden, Vanessa AU - Costanzo, Tommaso AU - Mahou, Pierre AU - Hrtyan, Mónika AU - Wang, Jie AU - Aguilera Servin, Juan L AU - van Damme, Daniël AU - Beaurepaire, Emmanuel AU - Loose, Martin AU - Bednarek, Sebastian Y AU - Friml, Jiří ID - 9887 IS - 51 JF - Proceedings of the National Academy of Sciences TI - The TPLATE complex mediates membrane bending during plant clathrin-mediated endocytosis VL - 118 ER - TY - CHAP AB - Hybrid zones are narrow geographic regions where different populations, races or interbreeding species meet and mate, producing mixed ‘hybrid’ offspring. They are relatively common and can be found in a diverse range of organisms and environments. The study of hybrid zones has played an important role in our understanding of the origin of species, with hybrid zones having been described as ‘natural laboratories’. This is because they allow us to study,in situ, the conditions and evolutionary forces that enable divergent taxa to remain distinct despite some ongoing gene exchange between them. AU - Stankowski, Sean AU - Shipilina, Daria AU - Westram, Anja M ID - 14984 SN - 9780470016176 T2 - Encyclopedia of Life Sciences TI - Hybrid Zones VL - 2 ER - TY - CHAP AB - The goal of zero-shot learning is to construct a classifier that can identify object classes for which no training examples are available. When training data for some of the object classes is available but not for others, the name generalized zero-shot learning is commonly used. In a wider sense, the phrase zero-shot is also used to describe other machine learning-based approaches that require no training data from the problem of interest, such as zero-shot action recognition or zero-shot machine translation. AU - Lampert, Christoph ED - Ikeuchi, Katsushi ID - 14987 SN - 9783030634155 T2 - Computer Vision TI - Zero-Shot Learning ER - TY - GEN AB - Raw data generated from the publication - The TPLATE complex mediates membrane bending during plant clathrin-mediated endocytosis by Johnson et al., 2021 In PNAS AU - Johnson, Alexander J ID - 14988 TI - Raw data from Johnson et al, PNAS, 2021 ER - TY - GEN AB - Superconductor-semiconductor hybrids are platforms for realizing effective p-wave superconductivity. Spin-orbit coupling, combined with the proximity effect, causes the two-dimensional semiconductor to inherit p±ip intraband pairing, and application of magnetic field can then result in transitions to the normal state, partial Bogoliubov Fermi surfaces, or topological phases with Majorana modes. Experimentally probing the hybrid superconductor-semiconductor interface is challenging due to the shunting effect of the conventional superconductor. Consequently, the nature of induced pairing remains an open question. Here, we use the circuit quantum electrodynamics architecture to probe induced superconductivity in a two dimensional Al-InAs hybrid system. We observe a strong suppression of superfluid density and enhanced dissipation driven by magnetic field, which cannot be accounted for by the depairing theory of an s-wave superconductor. These observations are explained by a picture of independent intraband p±ip superconductors giving way to partial Bogoliubov Fermi surfaces, and allow for the first characterization of key properties of the hybrid superconducting system. AU - Phan, Duc T AU - Senior, Jorden L AU - Ghazaryan, Areg AU - Hatefipour, M. AU - Strickland, W. M. AU - Shabani, J. AU - Serbyn, Maksym AU - Higginbotham, Andrew P ID - 10029 T2 - arXiv TI - Breakdown of induced p±ip pairing in a superconductor-semiconductor hybrid ER - TY - DATA AB - This .zip File contains the transport data for figures presented in the main text and 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 - 9291 TI - Raw transport data for: Enhancement of proximity induced superconductivity in planar germanium ER - TY - DATA AU - Higginbotham, Andrew P ID - 9636 TI - Data for "Breakdown of induced p ± ip pairing in a superconductor-semiconductor hybrid" ER - TY - JOUR AB - A semiconducting nanowire fully wrapped by a superconducting shell has been proposed as a platform for obtaining Majorana modes at small magnetic fields. In this study, we demonstrate that the appearance of subgap states in such structures is actually governed by the junction region in tunneling spectroscopy measurements and not the full-shell nanowire itself. Short tunneling regions never show subgap states, whereas longer junctions always do. This can be understood in terms of quantum dots forming in the junction and hosting Andreev levels in the Yu-Shiba-Rusinov regime. The intricate magnetic field dependence of the Andreev levels, through both the Zeeman and Little-Parks effects, may result in robust zero-bias peaks—features that could be easily misinterpreted as originating from Majorana zero modes but are unrelated to topological superconductivity. AU - Valentini, Marco AU - Peñaranda, Fernando AU - Hofmann, Andrea C AU - Brauns, Matthias AU - Hauschild, Robert AU - Krogstrup, Peter AU - San-Jose, Pablo AU - Prada, Elsa AU - Aguado, Ramón AU - Katsaros, Georgios ID - 8910 IS - 6550 JF - Science SN - 00368075 TI - Nontopological zero-bias peaks in full-shell nanowires induced by flux-tunable Andreev states VL - 373 ER - TY - DATA AB - This .zip File contains the data for figures presented in the main text and supplementary material of "A singlet triplet hole spin qubit in planar Ge" by D. Jirovec, 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). A single file is acquired with QCodes and features the corresponding data type. XRD data are in .dat format and a code to open the data is provided. The code for simulations is as well provided in Python. AU - Jirovec, Daniel ID - 9323 TI - Research data for "A singlet-triplet hole spin qubit planar Ge" ER - TY - DATA AB - This .zip File contains the transport data for "Non-topological zero bias peaks in full-shell nanowires induced by flux tunable Andreev states" by M. Valentini, et. al. The measurements were done using Labber Software and the data is stored in the hdf5 file format. Instructions of how to read the data are in "Notebook_Valentini.pdf". AU - Valentini, Marco ID - 9389 TI - Research data for "Non-topological zero bias peaks in full-shell nanowires induced by flux tunable Andreev states" ER - TY - JOUR AB - Hole gases in planar germanium can have high mobilities in combination with strong spin-orbit interaction and electrically tunable g factors, and are therefore emerging as a promising platform for creating hybrid superconductor-semiconductor devices. A key challenge towards hybrid Ge-based quantum technologies is the design of high-quality interfaces and superconducting contacts that are robust against magnetic fields. In this work, by combining the assets of aluminum, which provides good contact to the Ge, and niobium, which has a significant superconducting gap, we demonstrate highly transparent low-disordered JoFETs with relatively large ICRN products that are capable of withstanding high magnetic fields. We furthermore demonstrate the ability of phase-biasing individual JoFETs, opening up an avenue to explore topological superconductivity in planar Ge. The persistence of superconductivity in the reported hybrid devices beyond 1.8 T paves the way towards integrating spin qubits and proximity-induced superconductivity on the same chip. AU - Aggarwal, Kushagra AU - Hofmann, Andrea C AU - Jirovec, Daniel AU - Prieto Gonzalez, Ivan AU - Sammak, Amir AU - Botifoll, Marc AU - Martí-Sánchez, Sara AU - Veldhorst, Menno AU - Arbiol, Jordi AU - Scappucci, Giordano AU - Danon, Jeroen AU - Katsaros, Georgios ID - 10559 IS - 2 JF - Physical Review Research KW - general engineering SN - 2643-1564 TI - Enhancement of proximity-induced superconductivity in a planar Ge hole gas VL - 3 ER - TY - JOUR AB - While sexual reproduction is widespread among many taxa, asexual lineages have repeatedly evolved from sexual ancestors. Despite extensive research on the evolution of sex, it is still unclear whether this switch represents a major transition requiring major molecular reorganization, and how convergent the changes involved are. In this study, we investigated the phylogenetic relationship and patterns of gene expression of sexual and asexual lineages of Eurasian Artemia brine shrimp, to assess how gene expression patterns are affected by the transition to asexuality. We find only a few genes that are consistently associated with the evolution of asexuality, suggesting that this shift may not require an extensive overhauling of the meiotic machinery. While genes with sex-biased expression have high rates of expression divergence within Eurasian Artemia, neither female- nor male-biased genes appear to show unusual evolutionary patterns after sexuality is lost, contrary to theoretical expectations. AU - Huylmans, Ann K AU - Macon, Ariana AU - Hontoria, Francisco AU - Vicoso, Beatriz ID - 10166 IS - 1959 JF - Proceedings of the Royal Society B: Biological Sciences KW - asexual reproduction KW - parthenogenesis KW - sex-biased genes KW - sexual conflict KW - automixis KW - crustaceans SN - 0962-8452 TI - Transitions to asexuality and evolution of gene expression in Artemia brine shrimp VL - 288 ER - TY - DATA AB - Here are the research data underlying the publication " Effects of fine-scale population structure on inbreeding in a long-term study of snapdragons (Antirrhinum majus)." Further information are summed up in the README document. AU - Surendranadh, Parvathy AU - Arathoon, Louise S AU - Baskett, Carina AU - Field, David AU - Pickup, Melinda AU - Barton, Nicholas H ID - 9192 TI - Effects of fine-scale population structure on the distribution of heterozygosity in a long-term study of Antirrhinum majus ER - TY - DATA AU - Vicoso, Beatriz ID - 9949 TI - Data from Hyulmans et al 2021, "Transitions to asexuality and evolution of gene expression in Artemia brine shrimp" ER - TY - JOUR 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 AU - Tkačik, Gašper AU - Bollenbach, Tobias ID - 8997 JF - PLOS Computational Biology KW - Modelling and Simulation KW - Genetics KW - Molecular Biology KW - Antibiotics KW - Drug interactions SN - 1553-7358 TI - Minimal biophysical model of combined antibiotic action VL - 17 ER - TY - JOUR 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 (GRNs) remains a major challenge. Here, we use a well-defined synthetic GRN to study in Escherichia coli 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 GRN with fixed topology can display not only quantitatively but also qualitatively different phenotypes, depending solely on the local genetic context of its components. Transcriptional read-through is the main molecular mechanism that places one transcriptional unit (TU) within two separate regulons without the need for complex regulatory sequences. We propose that relative order of individual TUs, with its potential for combinatorial complexity, plays an important role in shaping phenotypes of GRNs. AU - Nagy-Staron, Anna A AU - Tomasek, Kathrin AU - Caruso Carter, Caroline AU - Sonnleitner, Elisabeth AU - Kavcic, Bor AU - Paixão, Tiago AU - Guet, Calin C ID - 9283 JF - eLife KW - Genetics and Molecular Biology SN - 2050-084X TI - Local genetic context shapes the function of a gene regulatory network VL - 10 ER - TY - JOUR AB - We introduce a novel technique to automatically decompose an input object’s volume into a set of parts that can be represented by two opposite height fields. Such decomposition enables the manufacturing of individual parts using two-piece reusable rigid molds. Our decomposition strategy relies on a new energy formulation that utilizes a pre-computed signal on the mesh volume representing the accessibility for a predefined set of extraction directions. Thanks to this novel formulation, our method allows for efficient optimization of a fabrication-aware partitioning of volumes in a completely automatic way. We demonstrate the efficacy of our approach by generating valid volume partitionings for a wide range of complex objects and physically reproducing several of them. AU - Alderighi, Thomas AU - Malomo, Luigi AU - Bickel, Bernd AU - Cignoni, Paolo AU - Pietroni, Nico ID - 10184 IS - 6 JF - ACM Transactions on Graphics SN - 0730-0301 TI - Volume decomposition for two-piece rigid casting VL - 40 ER - TY - JOUR AB - The Massively Parallel Computation (MPC) model is an emerging model that distills core aspects of distributed and parallel computation, developed as a tool to solve combinatorial (typically graph) problems in systems of many machines with limited space. Recent work has focused on the regime in which machines have sublinear (in n, the number of nodes in the input graph) space, with randomized algorithms presented for the fundamental problems of Maximal Matching and Maximal Independent Set. However, there have been no prior corresponding deterministic algorithms. A major challenge underlying the sublinear space setting is that the local space of each machine might be too small to store all edges incident to a single node. This poses a considerable obstacle compared to classical models in which each node is assumed to know and have easy access to its incident edges. To overcome this barrier, we introduce a new graph sparsification technique that deterministically computes a low-degree subgraph, with the additional property that solving the problem on this subgraph provides significant progress towards solving the problem for the original input graph. Using this framework to derandomize the well-known algorithm of Luby [SICOMP’86], we obtain O(log Δ + log log n)-round deterministic MPC algorithms for solving the problems of Maximal Matching and Maximal Independent Set with O(nɛ) space on each machine for any constant ɛ > 0. These algorithms also run in O(log Δ) rounds in the closely related model of CONGESTED CLIQUE, improving upon the state-of-the-art bound of O(log 2Δ) rounds by Censor-Hillel et al. [DISC’17]. AU - Czumaj, Artur AU - Davies, Peter AU - Parter, Merav ID - 9541 IS - 2 JF - ACM Transactions on Algorithms SN - 1549-6325 TI - Graph sparsification for derandomizing massively parallel computation with low space VL - 17 ER - TY - JOUR AB - We investigate the effect of coupling between translational and internal degrees of freedom of composite quantum particles on their localization in a random potential. We show that entanglement between the two degrees of freedom weakens localization due to the upper bound imposed on the inverse participation ratio by purity of a quantum state. We perform numerical calculations for a two-particle system bound by a harmonic force in a 1D disordered lattice and a rigid rotor in a 2D disordered lattice. We illustrate that the coupling has a dramatic effect on localization properties, even with a small number of internal states participating in quantum dynamics. AU - Suzuki, Fumika AU - Lemeshko, Mikhail AU - Zurek, Wojciech H. AU - Krems, Roman V. ID - 10134 IS - 16 JF - Physical Review Letters KW - General Physics and Astronomy SN - 0031-9007 TI - Anderson localization of composite particles VL - 127 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 stable orientations and more generally for locally optimal semi-matchings. The prior work by Czygrinow et al. (DISC 2012) finds a stable orientation in O(Δ^5) rounds in graphs of maximum degree Δ, while we improve it to O(Δ^4) and also prove a lower bound of Ω(Δ). For the more general problem of locally optimal semi-matchings, the prior upper bound is O(S^5) and our new algorithm runs in O(C · S^4) rounds, which is an improvement for C = o(S); here C and S are the maximum degrees of customers and servers, respectively. AU - Brandt, Sebastian AU - Keller, Barbara AU - Rybicki, Joel AU - Suomela, Jukka AU - Uitto, Jara ID - 9678 SN - 9781450380706 T2 - Annual ACM Symposium on Parallelism in Algorithms and Architectures TI - Efficient load-balancing through distributed token dropping ER - TY - JOUR 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 - 8286 JF - Algorithmica SN - 0178-4617 TI - Dynamic averaging load balancing on cycles ER - TY - THES AB - This thesis is the result of the research carried out by the author during his PhD at IST Austria between 2017 and 2021. It mainly focuses on the Fröhlich polaron model, specifically to its regime of strong coupling. This model, which is rigorously introduced and discussed in the introduction, has been of great interest in condensed matter physics and field theory for more than eighty years. It is used to describe an electron interacting with the atoms of a solid material (the strength of this interaction is modeled by the presence of a coupling constant α in the Hamiltonian of the system). The particular regime examined here, which is mathematically described by considering the limit α →∞, displays many interesting features related to the emergence of classical behavior, which allows for a simplified effective description of the system under analysis. The properties, the range of validity and a quantitative analysis of the precision of such classical approximations are the main object of the present work. We specify our investigation to the study of the ground state energy of the system, its dynamics and its effective mass. For each of these problems, we provide in the introduction an overview of the previously known results and a detailed account of the original contributions by the author. AU - Feliciangeli, Dario ID - 9733 SN - 2663-337X TI - The polaron at strong coupling ER - TY - JOUR AB - As the size and complexity of models and datasets grow, so does the need for communication-efficient variants of stochastic gradient descent that can be deployed to perform parallel model training. One popular communication-compression method for data-parallel SGD is QSGD (Alistarh et al., 2017), which quantizes and encodes gradients to reduce communication costs. The baseline variant of QSGD provides strong theoretical guarantees, however, for practical purposes, the authors proposed a heuristic variant which we call QSGDinf, which demonstrated impressive empirical gains for distributed training of large neural networks. In this paper, we build on this work to propose a new gradient quantization scheme, and show that it has both stronger theoretical guarantees than QSGD, and matches and exceeds the empirical performance of the QSGDinf heuristic and of other compression methods. AU - Ramezani-Kebrya, Ali AU - Faghri, Fartash AU - Markov, Ilya AU - Aksenov, Vitalii AU - Alistarh, Dan-Adrian AU - Roy, Daniel M. ID - 9571 IS - 114 JF - Journal of Machine Learning Research SN - 15324435 TI - NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization VL - 22 ER - TY - JOUR AB - The synaptotrophic hypothesis posits that synapse formation stabilizes dendritic branches, yet this hypothesis has not been causally tested in vivo in the mammalian brain. Presynaptic ligand cerebellin-1 (Cbln1) and postsynaptic receptor GluD2 mediate synaptogenesis between granule cells and Purkinje cells in the molecular layer of the cerebellar cortex. Here we show that sparse but not global knockout of GluD2 causes under-elaboration of Purkinje cell dendrites in the deep molecular layer and overelaboration in the superficial molecular layer. Developmental, overexpression, structure-function, and genetic epistasis analyses indicate that dendrite morphogenesis defects result from competitive synaptogenesis in a Cbln1/GluD2-dependent manner. A generative model of dendritic growth based on competitive synaptogenesis largely recapitulates GluD2 sparse and global knockout phenotypes. Our results support the synaptotrophic hypothesis at initial stages of dendrite development, suggest a second mode in which cumulative synapse formation inhibits further dendrite growth, and highlight the importance of competition in dendrite morphogenesis. AU - Takeo, Yukari H. AU - Shuster, S. Andrew AU - Jiang, Linnie AU - Hu, Miley AU - Luginbuhl, David J. AU - Rülicke, Thomas AU - Contreras, Ximena AU - Hippenmeyer, Simon AU - Wagner, Mark J. AU - Ganguli, Surya AU - Luo, Liqun ID - 8544 IS - 4 JF - Neuron TI - GluD2- and Cbln1-mediated competitive synaptogenesis shapes the dendritic arbors of cerebellar Purkinje cells VL - 109 ER - TY - GEN AB - We provide a definition of the effective mass for the classical polaron described by the Landau-Pekar equations. It is based on a novel variational principle, minimizing the energy functional over states with given (initial) velocity. The resulting formula for the polaron's effective mass agrees with the prediction by Landau and Pekar. AU - Feliciangeli, Dario AU - Rademacher, Simone Anna Elvira AU - Seiringer, Robert ID - 9791 T2 - arXiv TI - The effective mass problem for the Landau-Pekar equations ER - TY - JOUR AB - Normative theories and statistical inference provide complementary approaches for the study of biological systems. A normative theory postulates that organisms have adapted to efficiently solve essential tasks, and proceeds to mathematically work out testable consequences of such optimality; parameters that maximize the hypothesized organismal function can be derived ab initio, without reference to experimental data. In contrast, statistical inference focuses on efficient utilization of data to learn model parameters, without reference to any a priori notion of biological function, utility, or fitness. Traditionally, these two approaches were developed independently and applied separately. Here we unify them in a coherent Bayesian framework that embeds a normative theory into a family of maximum-entropy “optimization priors.” This family defines a smooth interpolation between a data-rich inference regime (characteristic of “bottom-up” statistical models), and a data-limited ab inito prediction regime (characteristic of “top-down” normative theory). We demonstrate the applicability of our framework using data from the visual cortex, and argue that the flexibility it affords is essential to address a number of fundamental challenges relating to inference and prediction in complex, high-dimensional biological problems. AU - Mlynarski, Wiktor F AU - Hledik, Michal AU - Sokolowski, Thomas R AU - Tkačik, Gašper ID - 7553 IS - 7 JF - Neuron TI - Statistical analysis and optimality of neural systems VL - 109 ER - TY - CONF AB - We consider the problem of estimating a signal from measurements obtained via a generalized linear model. We focus on estimators based on approximate message passing (AMP), a family of iterative algorithms with many appealing features: the performance of AMP in the high-dimensional limit can be succinctly characterized under suitable model assumptions; AMP can also be tailored to the empirical distribution of the signal entries, and for a wide class of estimation problems, AMP is conjectured to be optimal among all polynomial-time algorithms. However, a major issue of AMP is that in many models (such as phase retrieval), it requires an initialization correlated with the ground-truth signal and independent from the measurement matrix. Assuming that such an initialization is available is typically not realistic. In this paper, we solve this problem by proposing an AMP algorithm initialized with a spectral estimator. With such an initialization, the standard AMP analysis fails since the spectral estimator depends in a complicated way on the design matrix. Our main contribution is a rigorous characterization of the performance of AMP with spectral initialization in the high-dimensional limit. The key technical idea is to define and analyze a two-phase artificial AMP algorithm that first produces the spectral estimator, and then closely approximates the iterates of the true AMP. We also provide numerical results that demonstrate the validity of the proposed approach. AU - Mondelli, Marco AU - Venkataramanan, Ramji ED - Banerjee, Arindam ED - Fukumizu, Kenji ID - 10598 SN - 2640-3498 T2 - Proceedings of The 24th International Conference on Artificial Intelligence and Statistics TI - Approximate message passing with spectral initialization for generalized linear models VL - 130 ER - TY - JOUR AB - This paper aims to obtain a strong convergence result for a Douglas–Rachford splitting method with inertial extrapolation step for finding a zero of the sum of two set-valued maximal monotone operators without any further assumption of uniform monotonicity on any of the involved maximal monotone operators. Furthermore, our proposed method is easy to implement and the inertial factor in our proposed method is a natural choice. Our method of proof is of independent interest. Finally, some numerical implementations are given to confirm the theoretical analysis. AU - Shehu, Yekini AU - Dong, Qiao-Li AU - Liu, Lu-Lu AU - Yao, Jen-Chih ID - 8196 JF - Optimization and Engineering SN - 1389-4420 TI - New strong convergence method for the sum of two maximal monotone operators VL - 22 ER - TY - JOUR AB - In the worldwide endeavor for disruptive quantum technologies, germanium is emerging as a versatile material to realize devices capable of encoding, processing, or transmitting quantum information. These devices leverage special properties of the germanium valence-band states, commonly known as holes, such as their inherently strong spin-orbit coupling and the ability to host superconducting pairing correlations. In this Review, we initially introduce the physics of holes in low-dimensional germanium structures with key insights from a theoretical perspective. We then examine the material science progress underpinning germanium-based planar heterostructures and nanowires. We review the most significant experimental results demonstrating key building blocks for quantum technology, such as an electrically driven universal quantum gate set with spin qubits in quantum dots and superconductor-semiconductor devices for hybrid quantum systems. We conclude by identifying the most promising prospects toward scalable quantum information processing. AU - Scappucci, Giordano AU - Kloeffel, Christoph AU - Zwanenburg, Floris A. AU - Loss, Daniel AU - Myronov, Maksym AU - Zhang, Jian-Jun AU - Franceschi, Silvano De AU - Katsaros, Georgios AU - Veldhorst, Menno ID - 8911 JF - Nature Reviews Materials TI - The germanium quantum information route VL - 6 ER - TY - JOUR AB - Canonical parametrisations of classical confocal coordinate systems are introduced and exploited to construct non-planar analogues of incircular (IC) nets on individual quadrics and systems of confocal quadrics. Intimate connections with classical deformations of quadrics that are isometric along asymptotic lines and circular cross-sections of quadrics are revealed. The existence of octahedral webs of surfaces of Blaschke type generated by asymptotic and characteristic lines that are diagonally related to lines of curvature is proved theoretically and established constructively. Appropriate samplings (grids) of these webs lead to three-dimensional extensions of non-planar IC nets. Three-dimensional octahedral grids composed of planes and spatially extending (checkerboard) IC-nets are shown to arise in connection with systems of confocal quadrics in Minkowski space. In this context, the Laguerre geometric notion of conical octahedral grids of planes is introduced. The latter generalise the octahedral grids derived from systems of confocal quadrics in Minkowski space. An explicit construction of conical octahedral grids is presented. The results are accompanied by various illustrations which are based on the explicit formulae provided by the theory. AU - Akopyan, Arseniy AU - Bobenko, Alexander I. AU - Schief, Wolfgang K. AU - Techter, Jan ID - 8338 JF - Discrete and Computational Geometry SN - 0179-5376 TI - On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs VL - 66 ER - TY - JOUR AB - We design fast deterministic algorithms for distance computation in the Congested Clique model. Our key contributions include: A (2+ϵ)-approximation for all-pairs shortest paths in O(log2n/ϵ) rounds on unweighted undirected graphs. With a small additional additive factor, this also applies for weighted graphs. This is the first sub-polynomial constant-factor approximation for APSP in this model. A (1+ϵ)-approximation for multi-source shortest paths from O(n−−√) sources in O(log2n/ϵ) rounds on weighted undirected graphs. This is the first sub-polynomial algorithm obtaining this approximation for a set of sources of polynomial size. Our main techniques are new distance tools that are obtained via improved algorithms for sparse matrix multiplication, which we leverage to construct efficient hopsets and shortest paths. Furthermore, our techniques extend to additional distance problems for which we improve upon the state-of-the-art, including diameter approximation, and an exact single-source shortest paths algorithm for weighted undirected graphs in O~(n1/6) rounds. AU - Censor-Hillel, Keren AU - Dory, Michal AU - Korhonen, Janne AU - Leitersdorf, Dean ID - 7939 JF - Distributed Computing SN - 0178-2770 TI - Fast approximate shortest paths in the congested clique VL - 34 ER - TY - JOUR AB - We consider the following setting: suppose that we are given a manifold M in Rd with positive reach. Moreover assume that we have an embedded simplical complex A without boundary, whose vertex set lies on the manifold, is sufficiently dense and such that all simplices in A have sufficient quality. We prove that if, locally, interiors of the projection of the simplices onto the tangent space do not intersect, then A is a triangulation of the manifold, that is, they are homeomorphic. AU - Boissonnat, Jean-Daniel AU - Dyer, Ramsay AU - Ghosh, Arijit AU - Lieutier, Andre AU - Wintraecken, Mathijs ID - 8248 JF - Discrete and Computational Geometry SN - 0179-5376 TI - Local conditions for triangulating submanifolds of Euclidean space VL - 66 ER - TY - JOUR AB - We prove that, for the binary erasure channel (BEC), the polar-coding paradigm gives rise to codes that not only approach the Shannon limit but do so under the best possible scaling of their block length as a function of the gap to capacity. This result exhibits the first known family of binary codes that attain both optimal scaling and quasi-linear complexity of encoding and decoding. Our proof is based on the construction and analysis of binary polar codes with large kernels. When communicating reliably at rates within ε>0 of capacity, the code length n often scales as O(1/εμ), where the constant μ is called the scaling exponent. It is known that the optimal scaling exponent is μ=2, and it is achieved by random linear codes. The scaling exponent of conventional polar codes (based on the 2×2 kernel) on the BEC is μ=3.63. This falls far short of the optimal scaling guaranteed by random codes. Our main contribution is a rigorous proof of the following result: for the BEC, there exist ℓ×ℓ binary kernels, such that polar codes constructed from these kernels achieve scaling exponent μ(ℓ) that tends to the optimal value of 2 as ℓ grows. We furthermore characterize precisely how large ℓ needs to be as a function of the gap between μ(ℓ) and 2. The resulting binary codes maintain the recursive structure of conventional polar codes, and thereby achieve construction complexity O(n) and encoding/decoding complexity O(nlogn). AU - Fazeli, Arman AU - Hassani, Hamed AU - Mondelli, Marco AU - Vardy, Alexander ID - 9002 IS - 9 JF - IEEE Transactions on Information Theory SN - 0018-9448 TI - Binary linear codes with optimal scaling: Polar codes with large kernels VL - 67 ER - TY - JOUR AB - All vertebrates have a spinal cord with dimensions and shape specific to their species. Yet how species‐specific organ size and shape are achieved is a fundamental unresolved question in biology. The formation and sculpting of organs begins during embryonic development. As it develops, the spinal cord extends in anterior–posterior direction in synchrony with the overall growth of the body. The dorsoventral (DV) and apicobasal lengths of the spinal cord neuroepithelium also change, while at the same time a characteristic pattern of neural progenitor subtypes along the DV axis is established and elaborated. At the basis of these changes in tissue size and shape are biophysical determinants, such as the change in cell number, cell size and shape, and anisotropic tissue growth. These processes are controlled by global tissue‐scale regulators, such as morphogen signaling gradients as well as mechanical forces. Current challenges in the field are to uncover how these tissue‐scale regulatory mechanisms are translated to the cellular and molecular level, and how regulation of distinct cellular processes gives rise to an overall defined size. Addressing these questions will help not only to achieve a better understanding of how size is controlled, but also of how tissue size is coordinated with the specification of pattern. AU - Kuzmicz-Kowalska, Katarzyna AU - Kicheva, Anna ID - 7883 JF - Wiley Interdisciplinary Reviews: Developmental Biology SN - 17597684 TI - Regulation of size and scale in vertebrate spinal cord development ER - TY - JOUR AB - We investigate a sheaf-theoretic interpretation of stratification learning from geometric and topological perspectives. Our main result is the construction of stratification learning algorithms framed in terms of a sheaf on a partially ordered set with the Alexandroff topology. We prove that the resulting decomposition is the unique minimal stratification for which the strata are homogeneous and the given sheaf is constructible. In particular, when we choose to work with the local homology sheaf, our algorithm gives an alternative to the local homology transfer algorithm given in Bendich et al. (Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1355–1370, ACM, New York, 2012), and the cohomology stratification algorithm given in Nanda (Found. Comput. Math. 20(2), 195–222, 2020). Additionally, we give examples of stratifications based on the geometric techniques of Breiding et al. (Rev. Mat. Complut. 31(3), 545–593, 2018), illustrating how the sheaf-theoretic approach can be used to study stratifications from both topological and geometric perspectives. This approach also points toward future applications of sheaf theory in the study of topological data analysis by illustrating the utility of the language of sheaf theory in generalizing existing algorithms. AU - Brown, Adam AU - Wang, Bei ID - 7905 JF - Discrete and Computational Geometry SN - 0179-5376 TI - Sheaf-theoretic stratification learning from geometric and topological perspectives VL - 65 ER - TY - JOUR AB - We consider large non-Hermitian real or complex random matrices X with independent, identically distributed centred entries. We prove that their local eigenvalue statistics near the spectral edge, the unit circle, coincide with those of the Ginibre ensemble, i.e. when the matrix elements of X are Gaussian. This result is the non-Hermitian counterpart of the universality of the Tracy–Widom distribution at the spectral edges of the Wigner ensemble. AU - Cipolloni, Giorgio AU - Erdös, László AU - Schröder, Dominik J ID - 8601 JF - Probability Theory and Related Fields SN - 01788051 TI - Edge universality for non-Hermitian random matrices ER - TY - JOUR AB - In this paper, we introduce a relaxed CQ method with alternated inertial step for solving split feasibility problems. We give convergence of the sequence generated by our method under some suitable assumptions. Some numerical implementations from sparse signal and image deblurring are reported to show the efficiency of our method. AU - Shehu, Yekini AU - Gibali, Aviv ID - 7925 JF - Optimization Letters SN - 1862-4472 TI - New inertial relaxed method for solving split feasibilities VL - 15 ER - TY - JOUR AB - Rigorous investigation of synaptic transmission requires analysis of unitary synaptic events by simultaneous recording from presynaptic terminals and postsynaptic target neurons. However, this has been achieved at only a limited number of model synapses, including the squid giant synapse and the mammalian calyx of Held. Cortical presynaptic terminals have been largely inaccessible to direct presynaptic recording, due to their small size. Here, we describe a protocol for improved subcellular patch-clamp recording in rat and mouse brain slices, with the synapse in a largely intact environment. Slice preparation takes ~2 h, recording ~3 h and post hoc morphological analysis 2 d. Single presynaptic hippocampal mossy fiber terminals are stimulated minimally invasively in the bouton-attached configuration, in which the cytoplasmic content remains unperturbed, or in the whole-bouton configuration, in which the cytoplasmic composition can be precisely controlled. Paired pre–postsynaptic recordings can be integrated with biocytin labeling and morphological analysis, allowing correlative investigation of synapse structure and function. Paired recordings can be obtained from mossy fiber terminals in slices from both rats and mice, implying applicability to genetically modified synapses. Paired recordings can also be performed together with axon tract stimulation or optogenetic activation, allowing comparison of unitary and compound synaptic events in the same target cell. Finally, paired recordings can be combined with spontaneous event analysis, permitting collection of miniature events generated at a single identified synapse. In conclusion, the subcellular patch-clamp techniques detailed here should facilitate analysis of biophysics, plasticity and circuit function of cortical synapses in the mammalian central nervous system. AU - Vandael, David H AU - Okamoto, Yuji AU - Borges Merjane, Carolina AU - Vargas Barroso, Victor M AU - Suter, Benjamin AU - Jonas, Peter M ID - 9438 IS - 6 JF - Nature Protocols SN - 17542189 TI - Subcellular patch-clamp techniques for single-bouton stimulation and simultaneous pre- and postsynaptic recording at cortical synapses VL - 16 ER - TY - THES AB - Blood – this is what animals use to heal wounds fast and efficient. Plants do not have blood circulation and their cells cannot move. However, plants have evolved remarkable capacities to regenerate tissues and organs preventing further damage. In my PhD research, I studied the wound healing in the Arabidopsis root. I used a UV laser to ablate single cells in the root tip and observed the consequent wound healing. Interestingly, the inner adjacent cells induced a division plane switch and subsequently adopted the cell type of the killed cell to replace it. We termed this form of wound healing “restorative divisions”. This initial observation triggered the questions of my PhD studies: How and why do cells orient their division planes, how do they feel the wound and why does this happen only in inner adjacent cells. For answering these questions, I used a quite simple experimental setup: 5 day - old seedlings were stained with propidium iodide to visualize cell walls and dead cells; ablation was carried out using a special laser cutter and a confocal microscope. Adaptation of the novel vertical microscope system made it possible to observe wounds in real time. This revealed that restorative divisions occur at increased frequency compared to normal divisions. Additionally, the major plant hormone auxin accumulates in wound adjacent cells and drives the expression of the wound-stress responsive transcription factor ERF115. Using this as a marker gene for wound responses, we found that an important part of wound signalling is the sensing of the collapse of the ablated cell. The collapse causes a radical pressure drop, which results in strong tissue deformations. These deformations manifest in an invasion of the now free spot specifically by the inner adjacent cells within seconds, probably because of higher pressure of the inner tissues. Long-term imaging revealed that those deformed cells continuously expand towards the wound hole and that this is crucial for the restorative division. These wound-expanding cells exhibit an abnormal, biphasic polarity of microtubule arrays before the division. Experiments inhibiting cell expansion suggest that it is the biphasic stretching that induces those MT arrays. Adapting the micromanipulator aspiration system from animal scientists at our institute confirmed the hypothesis that stretching influences microtubule stability. In conclusion, this shows that microtubules react to tissue deformation and this facilitates the observed division plane switch. This puts mechanical cues and tensions at the most prominent position for explaining the growth and wound healing properties of plants. Hence, it shines light onto the importance of understanding mechanical signal transduction. AU - Hörmayer, Lukas ID - 9992 SN - 2663-337X TI - Wound healing in the Arabidopsis root meristem ER - TY - JOUR AB - Pattern separation is a fundamental brain computation that converts small differences in input patterns into large differences in output patterns. Several synaptic mechanisms of pattern separation have been proposed, including code expansion, inhibition and plasticity; however, which of these mechanisms play a role in the entorhinal cortex (EC)–dentate gyrus (DG)–CA3 circuit, a classical pattern separation circuit, remains unclear. Here we show that a biologically realistic, full-scale EC–DG–CA3 circuit model, including granule cells (GCs) and parvalbumin-positive inhibitory interneurons (PV+-INs) in the DG, is an efficient pattern separator. Both external gamma-modulated inhibition and internal lateral inhibition mediated by PV+-INs substantially contributed to pattern separation. Both local connectivity and fast signaling at GC–PV+-IN synapses were important for maximum effectiveness. Similarly, mossy fiber synapses with conditional detonator properties contributed to pattern separation. By contrast, perforant path synapses with Hebbian synaptic plasticity and direct EC–CA3 connection shifted the network towards pattern completion. Our results demonstrate that the specific properties of cells and synapses optimize higher-order computations in biological networks and might be useful to improve the deep learning capabilities of technical networks. AU - Guzmán, José AU - Schlögl, Alois AU - Espinoza Martinez, Claudia AU - Zhang, Xiaomin AU - Suter, Benjamin AU - Jonas, Peter M ID - 10816 IS - 12 JF - Nature Computational Science KW - general medicine SN - 2662-8457 TI - How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network VL - 1 ER - TY - COMP AB - Pattern separation is a fundamental brain computation that converts small differences in input patterns into large differences in output patterns. Several synaptic mechanisms of pattern separation have been proposed, including code expansion, inhibition and plasticity; however, which of these mechanisms play a role in the entorhinal cortex (EC)–dentate gyrus (DG)–CA3 circuit, a classical pattern separation circuit, remains unclear. Here we show that a biologically realistic, full-scale EC–DG–CA3 circuit model, including granule cells (GCs) and parvalbumin-positive inhibitory interneurons (PV+-INs) in the DG, is an efficient pattern separator. Both external gamma-modulated inhibition and internal lateral inhibition mediated by PV+-INs substantially contributed to pattern separation. Both local connectivity and fast signaling at GC–PV+-IN synapses were important for maximum effectiveness. Similarly, mossy fiber synapses with conditional detonator properties contributed to pattern separation. By contrast, perforant path synapses with Hebbian synaptic plasticity and direct EC–CA3 connection shifted the network towards pattern completion. Our results demonstrate that the specific properties of cells and synapses optimize higher-order computations in biological networks and might be useful to improve the deep learning capabilities of technical networks. AU - Guzmán, José AU - Schlögl, Alois AU - Espinoza Martinez, Claudia AU - Zhang, Xiaomin AU - Suter, Benjamin AU - Jonas, Peter M ID - 10110 TI - How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network ER - TY - GEN AB - Although much is known about how single neurons in the hippocampus represent an animal’s position, how cell-cell interactions contribute to spatial coding remains poorly understood. Using a novel statistical estimator and theoretical modeling, both developed in the framework of maximum entropy models, we reveal highly structured cell-to-cell interactions whose statistics depend on familiar vs. novel environment. In both conditions the circuit interactions optimize the encoding of spatial information, but for regimes that differ in the signal-to-noise ratio of their spatial inputs. Moreover, the topology of the interactions facilitates linear decodability, making the information easy to read out by downstream circuits. These findings suggest that the efficient coding hypothesis is not applicable only to individual neuron properties in the sensory periphery, but also to neural interactions in the central brain. AU - Nardin, Michele AU - Csicsvari, Jozsef L AU - Tkačik, Gašper AU - Savin, Cristina ID - 10077 T2 - bioRxiv TI - The structure of hippocampal CA1 interactions optimizes spatial coding across experience ER -