@misc{9192, abstract = {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.}, author = {Surendranadh, Parvathy and Arathoon, Louise S and Baskett, Carina and Field, David and Pickup, Melinda and Barton, Nicholas H}, publisher = {Institute of Science and Technology Austria}, title = {{Effects of fine-scale population structure on the distribution of heterozygosity in a long-term study of Antirrhinum majus}}, doi = {10.15479/AT:ISTA:9192}, year = {2021}, } @misc{9949, author = {Vicoso, Beatriz}, publisher = {Institute of Science and Technology Austria}, title = {{Data from Hyulmans et al 2021, "Transitions to asexuality and evolution of gene expression in Artemia brine shrimp"}}, doi = {10.15479/AT:ISTA:9949}, year = {2021}, } @article{8997, abstract = {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.}, author = {Kavcic, Bor and Tkačik, Gašper and Bollenbach, Tobias}, issn = {1553-7358}, journal = {PLOS Computational Biology}, keywords = {Modelling and Simulation, Genetics, Molecular Biology, Antibiotics, Drug interactions}, publisher = {Public Library of Science}, title = {{Minimal biophysical model of combined antibiotic action}}, doi = {10.1371/journal.pcbi.1008529}, volume = {17}, year = {2021}, } @article{9283, abstract = {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.}, author = {Nagy-Staron, Anna A and Tomasek, Kathrin and Caruso Carter, Caroline and Sonnleitner, Elisabeth and Kavcic, Bor and Paixão, Tiago and Guet, Calin C}, issn = {2050-084X}, journal = {eLife}, keywords = {Genetics and Molecular Biology}, publisher = {eLife Sciences Publications}, title = {{Local genetic context shapes the function of a gene regulatory network}}, doi = {10.7554/elife.65993}, volume = {10}, year = {2021}, } @article{10184, abstract = {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.}, author = {Alderighi, Thomas and Malomo, Luigi and Bickel, Bernd and Cignoni, Paolo and Pietroni, Nico}, issn = {1557-7368 }, journal = {ACM Transactions on Graphics}, number = {6}, publisher = {Association for Computing Machinery}, title = {{Volume decomposition for two-piece rigid casting}}, doi = {10.1145/3478513.3480555}, volume = {40}, year = {2021}, } @article{9541, abstract = {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].}, author = {Czumaj, Artur and Davies, Peter and Parter, Merav}, issn = {1549-6333}, journal = {ACM Transactions on Algorithms}, number = {2}, publisher = {Association for Computing Machinery}, title = {{Graph sparsification for derandomizing massively parallel computation with low space}}, doi = {10.1145/3451992}, volume = {17}, year = {2021}, } @article{10134, abstract = {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.}, author = {Suzuki, Fumika and Lemeshko, Mikhail and Zurek, Wojciech H. and Krems, Roman V.}, issn = {1079-7114}, journal = {Physical Review Letters}, keywords = {General Physics and Astronomy}, number = {16}, publisher = {American Physical Society }, title = {{Anderson localization of composite particles}}, doi = {10.1103/physrevlett.127.160602}, volume = {127}, year = {2021}, } @inproceedings{9678, abstract = {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.}, author = {Brandt, Sebastian and Keller, Barbara and Rybicki, Joel and Suomela, Jukka and Uitto, Jara}, booktitle = {Annual ACM Symposium on Parallelism in Algorithms and Architectures}, isbn = {9781450380706}, location = { Virtual Event, United States}, pages = {129--139}, title = {{Efficient load-balancing through distributed token dropping}}, doi = {10.1145/3409964.3461785}, year = {2021}, } @article{8286, abstract = {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. }, author = {Alistarh, Dan-Adrian and Nadiradze, Giorgi and Sabour, Amirmojtaba}, issn = {1432-0541}, journal = {Algorithmica}, location = {Virtual, Online; Germany}, publisher = {Springer Nature}, title = {{Dynamic averaging load balancing on cycles}}, doi = {10.1007/s00453-021-00905-9}, year = {2021}, } @phdthesis{9733, abstract = {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.}, author = {Feliciangeli, Dario}, issn = {2663-337X}, pages = {180}, publisher = {Institute of Science and Technology Austria}, title = {{The polaron at strong coupling}}, doi = {10.15479/at:ista:9733}, year = {2021}, } @article{9571, abstract = {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.}, author = {Ramezani-Kebrya, Ali and Faghri, Fartash and Markov, Ilya and Aksenov, Vitalii and Alistarh, Dan-Adrian and Roy, Daniel M.}, issn = {15337928}, journal = {Journal of Machine Learning Research}, number = {114}, pages = {1−43}, publisher = {Journal of Machine Learning Research}, title = {{NUQSGD: Provably communication-efficient data-parallel SGD via nonuniform quantization}}, volume = {22}, year = {2021}, } @article{8544, abstract = {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.}, author = {Takeo, Yukari H. and Shuster, S. Andrew and Jiang, Linnie and Hu, Miley and Luginbuhl, David J. and Rülicke, Thomas and Contreras, Ximena and Hippenmeyer, Simon and Wagner, Mark J. and Ganguli, Surya and Luo, Liqun}, issn = {1097-4199}, journal = {Neuron}, number = {4}, pages = {P629--644.E8}, publisher = {Elsevier}, title = {{GluD2- and Cbln1-mediated competitive synaptogenesis shapes the dendritic arbors of cerebellar Purkinje cells}}, doi = {10.1016/j.neuron.2020.11.028}, volume = {109}, year = {2021}, } @unpublished{9791, abstract = {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.}, author = {Feliciangeli, Dario and Rademacher, Simone Anna Elvira and Seiringer, Robert}, booktitle = {arXiv}, title = {{The effective mass problem for the Landau-Pekar equations}}, year = {2021}, } @article{7553, abstract = {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.}, author = {Mlynarski, Wiktor F and Hledik, Michal and Sokolowski, Thomas R and Tkačik, Gašper}, journal = {Neuron}, number = {7}, pages = {1227--1241.e5}, publisher = {Cell Press}, title = {{Statistical analysis and optimality of neural systems}}, doi = {10.1016/j.neuron.2021.01.020}, volume = {109}, year = {2021}, } @inproceedings{10598, abstract = { 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. }, author = {Mondelli, Marco and Venkataramanan, Ramji}, booktitle = {Proceedings of The 24th International Conference on Artificial Intelligence and Statistics}, editor = {Banerjee, Arindam and Fukumizu, Kenji}, issn = {2640-3498}, location = {Virtual, San Diego, CA, United States}, pages = {397--405}, publisher = {ML Research Press}, title = {{Approximate message passing with spectral initialization for generalized linear models}}, volume = {130}, year = {2021}, } @article{8196, abstract = {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.}, author = {Shehu, Yekini and Dong, Qiao-Li and Liu, Lu-Lu and Yao, Jen-Chih}, issn = {1573-2924}, journal = {Optimization and Engineering}, pages = {2627--2653}, publisher = {Springer Nature}, title = {{New strong convergence method for the sum of two maximal monotone operators}}, doi = {10.1007/s11081-020-09544-5}, volume = {22}, year = {2021}, } @article{8911, abstract = {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. }, author = {Scappucci, Giordano and Kloeffel, Christoph and Zwanenburg, Floris A. and Loss, Daniel and Myronov, Maksym and Zhang, Jian-Jun and Franceschi, Silvano De and Katsaros, Georgios and Veldhorst, Menno}, issn = {2058-8437}, journal = {Nature Reviews Materials}, pages = {926–943 }, publisher = {Springer Nature}, title = {{The germanium quantum information route}}, doi = {10.1038/s41578-020-00262-z}, volume = {6}, year = {2021}, } @article{8338, abstract = {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.}, author = {Akopyan, Arseniy and Bobenko, Alexander I. and Schief, Wolfgang K. and Techter, Jan}, issn = {1432-0444}, journal = {Discrete and Computational Geometry}, pages = {938--976}, publisher = {Springer Nature}, title = {{On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs}}, doi = {10.1007/s00454-020-00240-w}, volume = {66}, year = {2021}, } @article{7939, abstract = {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. }, author = {Censor-Hillel, Keren and Dory, Michal and Korhonen, Janne and Leitersdorf, Dean}, issn = {1432-0452}, journal = {Distributed Computing}, pages = {463--487}, publisher = {Springer Nature}, title = {{Fast approximate shortest paths in the congested clique}}, doi = {10.1007/s00446-020-00380-5}, volume = {34}, year = {2021}, } @article{8248, abstract = {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.}, author = {Boissonnat, Jean-Daniel and Dyer, Ramsay and Ghosh, Arijit and Lieutier, Andre and Wintraecken, Mathijs}, issn = {1432-0444}, journal = {Discrete and Computational Geometry}, pages = {666--686}, publisher = {Springer Nature}, title = {{Local conditions for triangulating submanifolds of Euclidean space}}, doi = {10.1007/s00454-020-00233-9}, volume = {66}, year = {2021}, } @article{9002, abstract = { 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).}, author = {Fazeli, Arman and Hassani, Hamed and Mondelli, Marco and Vardy, Alexander}, issn = {1557-9654}, journal = {IEEE Transactions on Information Theory}, number = {9}, pages = {5693--5710}, publisher = {IEEE}, title = {{Binary linear codes with optimal scaling: Polar codes with large kernels}}, doi = {10.1109/TIT.2020.3038806}, volume = {67}, year = {2021}, } @article{7883, abstract = {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.}, author = {Kuzmicz-Kowalska, Katarzyna and Kicheva, Anna}, issn = {17597692}, journal = {Wiley Interdisciplinary Reviews: Developmental Biology}, publisher = {Wiley}, title = {{Regulation of size and scale in vertebrate spinal cord development}}, doi = {10.1002/wdev.383}, year = {2021}, } @article{7905, abstract = {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.}, author = {Brown, Adam and Wang, Bei}, issn = {1432-0444}, journal = {Discrete and Computational Geometry}, pages = {1166--1198}, publisher = {Springer Nature}, title = {{Sheaf-theoretic stratification learning from geometric and topological perspectives}}, doi = {10.1007/s00454-020-00206-y}, volume = {65}, year = {2021}, } @article{8601, abstract = {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.}, author = {Cipolloni, Giorgio and Erdös, László and Schröder, Dominik J}, issn = {14322064}, journal = {Probability Theory and Related Fields}, publisher = {Springer Nature}, title = {{Edge universality for non-Hermitian random matrices}}, doi = {10.1007/s00440-020-01003-7}, year = {2021}, } @article{7925, abstract = {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.}, author = {Shehu, Yekini and Gibali, Aviv}, issn = {1862-4480}, journal = {Optimization Letters}, pages = {2109--2126}, publisher = {Springer Nature}, title = {{New inertial relaxed method for solving split feasibilities}}, doi = {10.1007/s11590-020-01603-1}, volume = {15}, year = {2021}, } @article{9438, abstract = {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.}, author = {Vandael, David H and Okamoto, Yuji and Borges Merjane, Carolina and Vargas Barroso, Victor M and Suter, Benjamin and Jonas, Peter M}, issn = {17502799}, journal = {Nature Protocols}, number = {6}, pages = {2947–2967}, publisher = {Springer Nature}, title = {{Subcellular patch-clamp techniques for single-bouton stimulation and simultaneous pre- and postsynaptic recording at cortical synapses}}, doi = {10.1038/s41596-021-00526-0}, volume = {16}, year = {2021}, } @phdthesis{9992, abstract = {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. }, author = {Hörmayer, Lukas}, issn = {2663-337X}, pages = {168}, publisher = {Institute of Science and Technology Austria}, title = {{Wound healing in the Arabidopsis root meristem}}, doi = {10.15479/at:ista:9992}, year = {2021}, } @article{10816, abstract = {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.}, author = {Guzmán, José and Schlögl, Alois and Espinoza Martinez, Claudia and Zhang, Xiaomin and Suter, Benjamin and Jonas, Peter M}, issn = {2662-8457}, journal = {Nature Computational Science}, keywords = {general medicine}, number = {12}, pages = {830--842}, publisher = {Springer Nature}, title = {{How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network}}, doi = {10.1038/s43588-021-00157-1}, volume = {1}, year = {2021}, } @misc{10110, abstract = {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.}, author = {Guzmán, José and Schlögl, Alois and Espinoza Martinez, Claudia and Zhang, Xiaomin and Suter, Benjamin and Jonas, Peter M}, publisher = {IST Austria}, title = {{How connectivity rules and synaptic properties shape the efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network}}, doi = {10.15479/AT:ISTA:10110}, year = {2021}, } @unpublished{10077, abstract = {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.}, author = {Nardin, Michele and Csicsvari, Jozsef L and Tkačik, Gašper and Savin, Cristina}, booktitle = {bioRxiv}, publisher = {Cold Spring Harbor Laboratory}, title = {{The structure of hippocampal CA1 interactions optimizes spatial coding across experience}}, doi = {10.1101/2021.09.28.460602}, year = {2021}, } @article{9250, abstract = {Aprotic alkali metal–O2 batteries face two major obstacles to their chemistry occurring efficiently, the insulating nature of the formed alkali superoxides/peroxides and parasitic reactions that are caused by the highly reactive singlet oxygen (1O2). Redox mediators are recognized to be key for improving rechargeability. However, it is unclear how they affect 1O2 formation, which hinders strategies for their improvement. Here we clarify the mechanism of mediated peroxide and superoxide oxidation and thus explain how redox mediators either enhance or suppress 1O2 formation. We show that charging commences with peroxide oxidation to a superoxide intermediate and that redox potentials above ~3.5 V versus Li/Li+ drive 1O2 evolution from superoxide oxidation, while disproportionation always generates some 1O2. We find that 1O2 suppression requires oxidation to be faster than the generation of 1O2 from disproportionation. Oxidation rates decrease with growing driving force following Marcus inverted-region behaviour, establishing a region of maximum rate.}, author = {Petit, Yann K. and Mourad, Eléonore and Prehal, Christian and Leypold, Christian and Windischbacher, Andreas and Mijailovic, Daniel and Slugovc, Christian and Borisov, Sergey M. and Zojer, Egbert and Brutti, Sergio and Fontaine, Olivier and Freunberger, Stefan Alexander}, issn = {1755-4349}, journal = {Nature Chemistry}, keywords = {General Chemistry, General Chemical Engineering}, number = {5}, pages = {465--471}, publisher = {Springer Nature}, title = {{Mechanism of mediated alkali peroxide oxidation and triplet versus singlet oxygen formation}}, doi = {10.1038/s41557-021-00643-z}, volume = {13}, year = {2021}, } @phdthesis{9623, abstract = {Cytoplasmic reorganizations are essential for morphogenesis. In large cells like oocytes, these reorganizations become crucial in patterning the oocyte for later stages of embryonic development. Ascidians oocytes reorganize their cytoplasm (ooplasm) in a spectacular manner. Ooplasmic reorganization is initiated at fertilization with the contraction of the actomyosin cortex along the animal-vegetal axis of the oocyte, driving the accumulation of cortical endoplasmic reticulum (cER), maternal mRNAs associated to it and a mitochondria-rich subcortical layer – the myoplasm – in a region of the vegetal pole termed contraction pole (CP). Here we have used the species Phallusia mammillata to investigate the changes in cell shape that accompany these reorganizations and the mechanochemical mechanisms underlining CP formation. We report that the length of the animal-vegetal (AV) axis oscillates upon fertilization: it first undergoes a cycle of fast elongation-lengthening followed by a slow expansion of mainly the vegetal pole (VP) of the cell. We show that the fast oscillation corresponds to a dynamic polarization of the actin cortex as a result of a fertilization-induced increase in cortical tension in the oocyte that triggers a rupture of the cortex at the animal pole and the establishment of vegetal-directed cortical flows. These flows are responsible for the vegetal accumulation of actin causing the VP to flatten. We find that the slow expansion of the VP, leading to CP formation, correlates with a relaxation of the vegetal cortex and that the myoplasm plays a role in the expansion. We show that the myoplasm is a solid-like layer that buckles under compression forces arising from the contracting actin cortex at the VP. Straightening of the myoplasm when actin flows stops, facilitates the expansion of the VP and the CP. Altogether, our results present a previously unrecognized role for the myoplasm in ascidian ooplasmic segregation. }, author = {Caballero Mancebo, Silvia}, isbn = {978-3-99078-012-1}, issn = {2663-337X}, pages = {111}, publisher = {Institute of Science and Technology Austria}, title = {{Fertilization-induced deformations are controlled by the actin cortex and a mitochondria-rich subcortical layer in ascidian oocytes}}, doi = {10.15479/at:ista:9623}, year = {2021}, } @article{9006, abstract = {Cytoplasm is a gel-like crowded environment composed of various macromolecules, organelles, cytoskeletal networks, and cytosol. The structure of the cytoplasm is highly organized and heterogeneous due to the crowding of its constituents and their effective compartmentalization. In such an environment, the diffusive dynamics of the molecules are restricted, an effect that is further amplified by clustering and anchoring of molecules. Despite the crowded nature of the cytoplasm at the microscopic scale, large-scale reorganization of the cytoplasm is essential for important cellular functions, such as cell division and polarization. How such mesoscale reorganization of the cytoplasm is achieved, especially for large cells such as oocytes or syncytial tissues that can span hundreds of micrometers in size, is only beginning to be understood. In this review, we will discuss recent advances in elucidating the molecular, cellular, and biophysical mechanisms by which the cytoskeleton drives cytoplasmic reorganization across different scales, structures, and species.}, author = {Shamipour, Shayan and Caballero Mancebo, Silvia and Heisenberg, Carl-Philipp J}, issn = {18781551}, journal = {Developmental Cell}, number = {2}, pages = {P213--226}, publisher = {Elsevier}, title = {{Cytoplasm's got moves}}, doi = {10.1016/j.devcel.2020.12.002}, volume = {56}, year = {2021}, } @article{9429, abstract = {De novo loss of function mutations in the ubiquitin ligase-encoding gene Cullin3 lead to autism spectrum disorder (ASD). In mouse, constitutive haploinsufficiency leads to motor coordination deficits as well as ASD-relevant social and cognitive impairments. However, induction of Cul3 haploinsufficiency later in life does not lead to ASD-relevant behaviors, pointing to an important role of Cul3 during a critical developmental window. Here we show that Cul3 is essential to regulate neuronal migration and, therefore, constitutive Cul3 heterozygous mutant mice display cortical lamination abnormalities. At the molecular level, we found that Cul3 controls neuronal migration by tightly regulating the amount of Plastin3 (Pls3), a previously unrecognized player of neural migration. Furthermore, we found that Pls3 cell-autonomously regulates cell migration by regulating actin cytoskeleton organization, and its levels are inversely proportional to neural migration speed. Finally, we provide evidence that cellular phenotypes associated with autism-linked gene haploinsufficiency can be rescued by transcriptional activation of the intact allele in vitro, offering a proof of concept for a potential therapeutic approach for ASDs.}, author = {Morandell, Jasmin and Schwarz, Lena A and Basilico, Bernadette and Tasciyan, Saren and Dimchev, Georgi A and Nicolas, Armel and Sommer, Christoph M and Kreuzinger, Caroline and Dotter, Christoph and Knaus, Lisa and Dobler, Zoe and Cacci, Emanuele and Schur, Florian KM and Danzl, Johann G and Novarino, Gaia}, issn = {2041-1723}, journal = {Nature Communications}, keywords = {General Biochemistry, Genetics and Molecular Biology}, number = {1}, publisher = {Springer Nature}, title = {{Cul3 regulates cytoskeleton protein homeostasis and cell migration during a critical window of brain development}}, doi = {10.1038/s41467-021-23123-x}, volume = {12}, year = {2021}, } @phdthesis{10058, abstract = {Quantum information and computation has become a vast field paved with opportunities for researchers and investors. As large multinational companies and international funds are heavily investing in quantum technologies it is still a question which platform is best suited for the task of realizing a scalable quantum processor. In this work we investigate hole spins in Ge quantum wells. These hold great promise as they possess several favorable properties: a small effective mass, a strong spin-orbit coupling, long relaxation time and an inherent immunity to hyperfine noise. All these characteristics helped Ge hole spin qubits to evolve from a single qubit to a fully entangled four qubit processor in only 3 years. Here, we investigated a qubit approach leveraging the large out-of-plane g-factors of heavy hole states in Ge quantum dots. We found this qubit to be reproducibly operable at extremely low magnetic field and at large speeds while maintaining coherence. This was possible because large differences of g-factors in adjacent dots can be achieved in the out-of-plane direction. In the in-plane direction the small g-factors, on the other hand, can be altered very effectively by the confinement potentials. Here, we found that this can even lead to a sign change of the g-factors. The resulting g-factor difference alters the dynamics of the system drastically and produces effects typically attributed to a spin-orbit induced spin-flip term. The investigations carried out in this thesis give further insights into the possibilities of holes in Ge and reveal new physical properties that need to be considered when designing future spin qubit experiments.}, author = {Jirovec, Daniel}, issn = {2663-337X}, keywords = {qubits, quantum computing, holes}, pages = {151}, publisher = {Institute of Science and Technology Austria}, title = {{Singlet-Triplet qubits and spin-orbit interaction in 2-dimensional Ge hole gases}}, doi = {10.15479/at:ista:10058}, year = {2021}, } @article{8909, abstract = {Spin qubits are considered to be among the most promising candidates for building a quantum processor. Group IV hole spin qubits have moved into the focus of interest due to the ease of operation and compatibility with Si technology. In addition, Ge offers the option for monolithic superconductor-semiconductor integration. Here we demonstrate a hole spin qubit operating at fields below 10 mT, the critical field of Al, by exploiting the large out-of-plane hole g-factors in planar Ge and by encoding the qubit into the singlet-triplet states of a double quantum dot. We observe electrically controlled X and Z-rotations with tunable frequencies exceeding 100 MHz and dephasing times of 1μs which we extend beyond 15μs with echo techniques. These results show that Ge hole singlet triplet qubits outperform their electronic Si and GaAs based counterparts in speed and coherence, respectively. In addition, they are on par with Ge single spin qubits, but can be operated at much lower fields underlining their potential for on chip integration with superconducting technologies.}, author = {Jirovec, Daniel and Hofmann, Andrea C and Ballabio, Andrea and Mutter, Philipp M. and Tavani, Giulio and Botifoll, Marc and Crippa, Alessandro and Kukucka, Josip and Sagi, Oliver and Martins, Frederico and Saez Mollejo, Jaime and Prieto Gonzalez, Ivan and Borovkov, Maksim and Arbiol, Jordi and Chrastina, Daniel and Isella, Giovanni and Katsaros, Georgios}, issn = {1476-4660}, journal = {Nature Materials}, number = {8}, pages = {1106–1112}, publisher = {Springer Nature}, title = {{A singlet triplet hole spin qubit in planar Ge}}, doi = {10.1038/s41563-021-01022-2}, volume = {20}, year = {2021}, } @phdthesis{9397, abstract = {Accumulation of interstitial fluid (IF) between embryonic cells is a common phenomenon in vertebrate embryogenesis. Unlike other model systems, where these accumulations coalesce into a large central cavity – the blastocoel, in zebrafish, IF is more uniformly distributed between the deep cells (DC) before the onset of gastrulation. This is likely due to the presence of a large extraembryonic structure – the yolk cell (YC) at the position where the blastocoel typically forms in other model organisms. IF has long been speculated to play a role in tissue morphogenesis during embryogenesis, but direct evidence supporting such function is still sparse. Here we show that the relocalization of IF to the interface between the YC and DC/epiblast is critical for axial mesendoderm (ME) cell protrusion formation and migration along this interface, a key process in embryonic axis formation. We further demonstrate that axial ME cell migration and IF relocalization engage in a positive feedback loop, where axial ME migration triggers IF accumulation ahead of the advancing axial ME tissue by mechanically compressing the overlying epiblast cell layer. Upon compression, locally induced flow relocalizes the IF through the porous epiblast tissue resulting in an IF accumulation ahead of the leading axial ME. This IF accumulation, in turn, promotes cell protrusion formation and migration of the leading axial ME cells, thereby facilitating axial ME extension. Our findings reveal a central role of dynamic IF relocalization in orchestrating germ layer morphogenesis during gastrulation.}, author = {Huljev, Karla}, issn = {2663-337X}, pages = {101}, publisher = {Institute of Science and Technology Austria}, title = {{Coordinated spatiotemporal reorganization of interstitial fluid is required for axial mesendoderm migration in zebrafish gastrulation}}, doi = {10.15479/at:ista:9397}, year = {2021}, } @unpublished{10066, abstract = {The potential of Si and SiGe-based devices for the scaling of quantum circuits is tainted by device variability. Each device needs to be tuned to operation conditions. We give a key step towards tackling this variability with an algorithm that, without modification, is capable of tuning a 4-gate Si FinFET, a 5-gate GeSi nanowire and a 7-gate SiGe heterostructure double quantum dot device from scratch. We achieve tuning times of 30, 10, and 92 minutes, respectively. The algorithm also provides insight into the parameter space landscape for each of these devices. These results show that overarching solutions for the tuning of quantum devices are enabled by machine learning.}, author = {Severin, B. and Lennon, D. T. and Camenzind, L. C. and Vigneau, F. and Fedele, F. and Jirovec, Daniel and Ballabio, A. and Chrastina, D. and Isella, G. and Kruijf, M. de and Carballido, M. J. and Svab, S. and Kuhlmann, A. V. and Braakman, F. R. and Geyer, S. and Froning, F. N. M. and Moon, H. and Osborne, M. A. and Sejdinovic, D. and Katsaros, Georgios and Zumbühl, D. M. and Briggs, G. A. D. and Ares, N.}, booktitle = {arXiv}, title = {{Cross-architecture tuning of silicon and SiGe-based quantum devices using machine learning}}, doi = {10.48550/arXiv.2107.12975}, year = {2021}, } @article{9437, abstract = {The synaptic connection from medial habenula (MHb) to interpeduncular nucleus (IPN) is critical for emotion-related behaviors and uniquely expresses R-type Ca2+ channels (Cav2.3) and auxiliary GABAB receptor (GBR) subunits, the K+-channel tetramerization domain-containing proteins (KCTDs). Activation of GBRs facilitates or inhibits transmitter release from MHb terminals depending on the IPN subnucleus, but the role of KCTDs is unknown. We therefore examined the localization and function of Cav2.3, GBRs, and KCTDs in this pathway in mice. We show in heterologous cells that KCTD8 and KCTD12b directly bind to Cav2.3 and that KCTD8 potentiates Cav2.3 currents in the absence of GBRs. In the rostral IPN, KCTD8, KCTD12b, and Cav2.3 co-localize at the presynaptic active zone. Genetic deletion indicated a bidirectional modulation of Cav2.3-mediated release by these KCTDs with a compensatory increase of KCTD8 in the active zone in KCTD12b-deficient mice. The interaction of Cav2.3 with KCTDs therefore scales synaptic strength independent of GBR activation.}, author = {Bhandari, Pradeep and Vandael, David H and Fernández-Fernández, Diego and Fritzius, Thorsten and Kleindienst, David and Önal, Hüseyin C and Montanaro-Punzengruber, Jacqueline-Claire and Gassmann, Martin and Jonas, Peter M and Kulik, Akos and Bettler, Bernhard and Shigemoto, Ryuichi and Koppensteiner, Peter}, issn = {2050-084X}, journal = {eLife}, publisher = {eLife Sciences Publications}, title = {{GABAB receptor auxiliary subunits modulate Cav2.3-mediated release from medial habenula terminals}}, doi = {10.7554/ELIFE.68274}, volume = {10}, year = {2021}, } @phdthesis{9562, abstract = {Left-right asymmetries can be considered a fundamental organizational principle of the vertebrate central nervous system. The hippocampal CA3-CA1 pyramidal cell synaptic connection shows an input-side dependent asymmetry where the hemispheric location of the presynaptic CA3 neuron determines the synaptic properties. Left-input synapses terminating on apical dendrites in stratum radiatum have a higher density of NMDA receptor subunit GluN2B, a lower density of AMPA receptor subunit GluA1 and smaller areas with less often perforated PSDs. On the other hand, left-input synapses terminating on basal dendrites in stratum oriens have lower GluN2B densities than right-input ones. Apical and basal synapses further employ different signaling pathways involved in LTP. SDS-digested freeze-fracture replica labeling can visualize synaptic membrane proteins with high sensitivity and resolution, and has been used to reveal the asymmetry at the electron microscopic level. However, it requires time-consuming manual demarcation of the synaptic surface for quantitative measurements. To facilitate the analysis of replica labeling, I first developed a software named Darea, which utilizes deep-learning to automatize this demarcation. With Darea I characterized the synaptic distribution of NMDA and AMPA receptors as well as the voltage-gated Ca2+ channels in CA1 stratum radiatum and oriens. Second, I explored the role of GluN2B and its carboxy-terminus in the establishment of input-side dependent hippocampal asymmetry. In conditional knock-out mice lacking GluN2B expression in CA1 and GluN2B-2A swap mice, where GluN2B carboxy-terminus was exchanged to that of GluN2A, no significant asymmetries of GluN2B, GluA1 and PSD area were detected. We further discovered a previously unknown functional asymmetry of GluN2A, which was also lost in the swap mouse. These results demonstrate that GluN2B carboxy-terminus plays a critical role in normal formation of input-side dependent asymmetry.}, author = {Kleindienst, David}, issn = {2663-337X}, pages = {124}, publisher = {Institute of Science and Technology Austria}, title = {{2B or not 2B: Hippocampal asymmetries mediated by NMDA receptor subunit GluN2B C-terminus and high-throughput image analysis by Deep-Learning}}, doi = {10.15479/at:ista:9562}, year = {2021}, } @inbook{9756, abstract = {High-resolution visualization and quantification of membrane proteins contribute to the understanding of their functions and the roles they play in physiological and pathological conditions. Sodium dodecyl sulfate-digested freeze-fracture replica labeling (SDS-FRL) is a powerful electron microscopy method to study quantitatively the two-dimensional distribution of transmembrane proteins and their tightly associated proteins. During treatment with SDS, intracellular organelles and proteins not anchored to the replica are dissolved, whereas integral membrane proteins captured and stabilized by carbon/platinum deposition remain on the replica. Their intra- and extracellular domains become exposed on the surface of the replica, facilitating the accessibility of antibodies and, therefore, providing higher labeling efficiency than those obtained with other immunoelectron microscopy techniques. In this chapter, we describe the protocols of SDS-FRL adapted for mammalian brain samples, and optimization of the SDS treatment to increase the labeling efficiency for quantification of Cav2.1, the alpha subunit of P/Q-type voltage-dependent calcium channels utilizing deep learning algorithms.}, author = {Kaufmann, Walter and Kleindienst, David and Harada, Harumi and Shigemoto, Ryuichi}, booktitle = { Receptor and Ion Channel Detection in the Brain}, isbn = {9781071615218}, keywords = {Freeze-fracture replica: Deep learning, Immunogold labeling, Integral membrane protein, Electron microscopy}, pages = {267--283}, publisher = {Humana}, title = {{High-Resolution localization and quantitation of membrane proteins by SDS-digested freeze-fracture replica labeling (SDS-FRL)}}, doi = {10.1007/978-1-0716-1522-5_19}, volume = {169}, year = {2021}, } @phdthesis{8934, abstract = {In this thesis, we consider several of the most classical and fundamental problems in static analysis and formal verification, including invariant generation, reachability analysis, termination analysis of probabilistic programs, data-flow analysis, quantitative analysis of Markov chains and Markov decision processes, and the problem of data packing in cache management. We use techniques from parameterized complexity theory, polyhedral geometry, and real algebraic geometry to significantly improve the state-of-the-art, in terms of both scalability and completeness guarantees, for the mentioned problems. In some cases, our results are the first theoretical improvements for the respective problems in two or three decades.}, author = {Goharshady, Amir Kafshdar}, issn = {2663-337X}, pages = {278}, publisher = {Institute of Science and Technology Austria}, title = {{Parameterized and algebro-geometric advances in static program analysis}}, doi = {10.15479/AT:ISTA:8934}, year = {2021}, } @phdthesis{10307, abstract = {Bacteria-host interactions represent a continuous trade-off between benefit and risk. Thus, the host immune response is faced with a non-trivial problem – accommodate beneficial commensals and remove harmful pathogens. This is especially difficult as molecular patterns, such as lipopolysaccharide or specific surface organelles such as pili, are conserved in both, commensal and pathogenic bacteria. Type 1 pili, tightly regulated by phase variation, are considered an important virulence factor of pathogenic bacteria as they facilitate invasion into host cells. While invasion represents a de facto passive mechanism for pathogens to escape the host immune response, we demonstrate a fundamental role of type 1 pili as active modulators of the innate and adaptive immune response.}, author = {Tomasek, Kathrin}, issn = {2663-337X}, pages = {73}, publisher = {Institute of Science and Technology Austria}, title = {{Pathogenic Escherichia coli hijack the host immune response}}, doi = {10.15479/at:ista:10307}, year = {2021}, } @unpublished{10316, abstract = {A key attribute of persistent or recurring bacterial infections is the ability of the pathogen to evade the host’s immune response. Many Enterobacteriaceae express type 1 pili, a pre-adapted virulence trait, to invade host epithelial cells and establish persistent infections. However, the molecular mechanisms and strategies by which bacteria actively circumvent the immune response of the host remain poorly understood. Here, we identified CD14, the major co-receptor for lipopolysaccharide detection, on dendritic cells as a previously undescribed binding partner of FimH, the protein located at the tip of the type 1 pilus of Escherichia coli. The FimH amino acids involved in CD14 binding are highly conserved across pathogenic and non-pathogenic strains. Binding of pathogenic bacteria to CD14 lead to reduced dendritic cell migration and blunted expression of co-stimulatory molecules, both rate-limiting factors of T cell activation. While defining an active molecular mechanism of immune evasion by pathogens, the interaction between FimH and CD14 represents a potential target to interfere with persistent and recurrent infections, such as urinary tract infections or Crohn’s disease.}, author = {Tomasek, Kathrin and Leithner, Alexander F and Glatzová, Ivana and Lukesch, Michael S. and Guet, Calin C and Sixt, Michael K}, booktitle = {bioRxiv}, publisher = {Cold Spring Harbor Laboratory}, title = {{Type 1 piliated uropathogenic Escherichia coli hijack the host immune response by binding to CD14}}, doi = {10.1101/2021.10.18.464770}, year = {2021}, } @article{9010, abstract = {Availability of the essential macronutrient nitrogen in soil plays a critical role in plant growth, development, and impacts agricultural productivity. Plants have evolved different strategies for sensing and responding to heterogeneous nitrogen distribution. Modulation of root system architecture, including primary root growth and branching, is among the most essential plant adaptions to ensure adequate nitrogen acquisition. However, the immediate molecular pathways coordinating the adjustment of root growth in response to distinct nitrogen sources, such as nitrate or ammonium, are poorly understood. Here, we show that growth as manifested by cell division and elongation is synchronized by coordinated auxin flux between two adjacent outer tissue layers of the root. This coordination is achieved by nitrate‐dependent dephosphorylation of the PIN2 auxin efflux carrier at a previously uncharacterized phosphorylation site, leading to subsequent PIN2 lateralization and thereby regulating auxin flow between adjacent tissues. A dynamic computer model based on our experimental data successfully recapitulates experimental observations. Our study provides mechanistic insights broadening our understanding of root growth mechanisms in dynamic environments.}, author = {Ötvös, Krisztina and Marconi, Marco and Vega, Andrea and O’Brien, Jose and Johnson, Alexander J and Abualia, Rashed and Antonielli, Livio and Montesinos López, Juan C and Zhang, Yuzhou and Tan, Shutang and Cuesta, Candela and Artner, Christina and Bouguyon, Eleonore and Gojon, Alain and Friml, Jiří and Gutiérrez, Rodrigo A. and Wabnik, Krzysztof T and Benková, Eva}, issn = {14602075}, journal = {EMBO Journal}, number = {3}, publisher = {Embo Press}, title = {{Modulation of plant root growth by nitrogen source-defined regulation of polar auxin transport}}, doi = {10.15252/embj.2020106862}, volume = {40}, year = {2021}, } @article{9913, abstract = {Nitrate commands genome-wide gene expression changes that impact metabolism, physiology, plant growth, and development. In an effort to identify new components involved in nitrate responses in plants, we analyze the Arabidopsis thaliana root phosphoproteome in response to nitrate treatments via liquid chromatography coupled to tandem mass spectrometry. 176 phosphoproteins show significant changes at 5 or 20 min after nitrate treatments. Proteins identified by 5 min include signaling components such as kinases or transcription factors. In contrast, by 20 min, proteins identified were associated with transporter activity or hormone metabolism functions, among others. The phosphorylation profile of NITRATE TRANSPORTER 1.1 (NRT1.1) mutant plants was significantly altered as compared to wild-type plants, confirming its key role in nitrate signaling pathways that involves phosphorylation changes. Integrative bioinformatics analysis highlights auxin transport as an important mechanism modulated by nitrate signaling at the post-translational level. We validated a new phosphorylation site in PIN2 and provide evidence that it functions in primary and lateral root growth responses to nitrate.}, author = {Vega, Andrea and Fredes, Isabel and O’Brien, José and Shen, Zhouxin and Ötvös, Krisztina and Abualia, Rashed and Benková, Eva and Briggs, Steven P. and Gutiérrez, Rodrigo A.}, issn = {1469-3178}, journal = {EMBO Reports}, number = {9}, publisher = {Wiley}, title = {{Nitrate triggered phosphoproteome changes and a PIN2 phosphosite modulating root system architecture}}, doi = {10.15252/embr.202051813}, volume = {22}, year = {2021}, } @phdthesis{10303, abstract = {Nitrogen is an essential macronutrient determining plant growth, development and affecting agricultural productivity. Root, as a hub that perceives and integrates local and systemic signals on the plant’s external and endogenous nitrogen resources, communicates with other plant organs to consolidate their physiology and development in accordance with actual nitrogen balance. Over the last years, numerous studies demonstrated that these comprehensive developmental adaptations rely on the interaction between pathways controlling nitrogen homeostasis and hormonal networks acting globally in the plant body. However, molecular insights into how the information about the nitrogen status is translated through hormonal pathways into specific developmental output are lacking. In my work, I addressed so far poorly understood mechanisms underlying root-to-shoot communication that lead to a rapid re-adjustment of shoot growth and development after nitrate provision. Applying a combination of molecular, cell, and developmental biology approaches, genetics and grafting experiments as well as hormonal analytics, I identified and characterized an unknown molecular framework orchestrating shoot development with a root nitrate sensory system. }, author = {Abualia, Rashed}, issn = {2663-337X}, pages = {139}, publisher = {Institute of Science and Technology Austria}, title = {{Role of hormones in nitrate regulated growth}}, doi = {10.15479/at:ista:10303}, year = {2021}, } @phdthesis{9962, abstract = {The brain is one of the largest and most complex organs and it is composed of billions of neurons that communicate together enabling e.g. consciousness. The cerebral cortex is the largest site of neural integration in the central nervous system. Concerted radial migration of newly born cortical projection neurons, from their birthplace to their final position, is a key step in the assembly of the cerebral cortex. The cellular and molecular mechanisms regulating radial neuronal migration in vivo are however still unclear. Recent evidence suggests that distinct signaling cues act cell-autonomously but differentially at certain steps during the overall migration process. Moreover, functional analysis of genetic mosaics (mutant neurons present in wild-type/heterozygote environment) using the MADM (Mosaic Analysis with Double Markers) analyses in comparison to global knockout also indicate a significant degree of non-cell-autonomous and/or community effects in the control of cortical neuron migration. The interactions of cell-intrinsic (cell-autonomous) and cell-extrinsic (non-cell-autonomous) components are largely unknown. In part of this thesis work we established a MADM-based experimental strategy for the quantitative analysis of cell-autonomous gene function versus non-cell-autonomous and/or community effects. The direct comparison of mutant neurons from the genetic mosaic (cell-autonomous) to mutant neurons in the conditional and/or global knockout (cell-autonomous + non-cell-autonomous) allows to quantitatively analyze non-cell-autonomous effects. Such analysis enable the high-resolution analysis of projection neuron migration dynamics in distinct environments with concomitant isolation of genomic and proteomic profiles. Using these experimental paradigms and in combination with computational modeling we show and characterize the nature of non-cell-autonomous effects to coordinate radial neuron migration. Furthermore, this thesis discusses recent developments in neurodevelopment with focus on neuronal polarization and non-cell-autonomous mechanisms in neuronal migration.}, author = {Hansen, Andi H}, issn = {2663-337X}, keywords = {Neuronal migration, Non-cell-autonomous, Cell-autonomous, Neurodevelopmental disease}, pages = {182}, publisher = {Institute of Science and Technology Austria}, title = {{Cell-autonomous gene function and non-cell-autonomous effects in radial projection neuron migration}}, doi = {10.15479/at:ista:9962}, year = {2021}, } @article{9428, abstract = {Thermalization is the inevitable fate of many complex quantum systems, whose dynamics allow them to fully explore the vast configuration space regardless of the initial state---the behaviour known as quantum ergodicity. In a quest for experimental realizations of coherent long-time dynamics, efforts have focused on ergodicity-breaking mechanisms, such as integrability and localization. The recent discovery of persistent revivals in quantum simulators based on Rydberg atoms have pointed to the existence of a new type of behaviour where the system rapidly relaxes for most initial conditions, while certain initial states give rise to non-ergodic dynamics. This collective effect has been named ”quantum many-body scarring’by analogy with a related form of weak ergodicity breaking that occurs for a single particle inside a stadium billiard potential. In this Review, we provide a pedagogical introduction to quantum many-body scars and highlight the emerging connections with the semiclassical quantization of many-body systems. We discuss the relation between scars and more general routes towards weak violations of ergodicity due to embedded algebras and non-thermal eigenstates, and highlight possible applications of scars in quantum technology.}, author = {Serbyn, Maksym and Abanin, Dmitry A. and Papić, Zlatko}, issn = {1745-2481}, journal = {Nature Physics}, number = {6}, pages = {675–685}, publisher = {Nature Research}, title = {{Quantum many-body scars and weak breaking of ergodicity}}, doi = {10.1038/s41567-021-01230-2}, volume = {17}, year = {2021}, } @article{8931, abstract = {Auxin is a major plant growth regulator, but current models on auxin perception and signaling cannot explain the whole plethora of auxin effects, in particular those associated with rapid responses. A possible candidate for a component of additional auxin perception mechanisms is the AUXIN BINDING PROTEIN 1 (ABP1), whose function in planta remains unclear. Here we combined expression analysis with gain- and loss-of-function approaches to analyze the role of ABP1 in plant development. ABP1 shows a broad expression largely overlapping with, but not regulated by, transcriptional auxin response activity. Furthermore, ABP1 activity is not essential for the transcriptional auxin signaling. Genetic in planta analysis revealed that abp1 loss-of-function mutants show largely normal development with minor defects in bolting. On the other hand, ABP1 gain-of-function alleles show a broad range of growth and developmental defects, including root and hypocotyl growth and bending, lateral root and leaf development, bolting, as well as response to heat stress. At the cellular level, ABP1 gain-of-function leads to impaired auxin effect on PIN polar distribution and affects BFA-sensitive PIN intracellular aggregation. The gain-of-function analysis suggests a broad, but still mechanistically unclear involvement of ABP1 in plant development, possibly masked in abp1 loss-of-function mutants by a functional redundancy.}, author = {Gelová, Zuzana and Gallei, Michelle C and Pernisová, Markéta and Brunoud, Géraldine and Zhang, Xixi and Glanc, Matous and Li, Lanxin and Michalko, Jaroslav and Pavlovicova, Zlata and Verstraeten, Inge and Han, Huibin and Hajny, Jakub and Hauschild, Robert and Čovanová, Milada and Zwiewka, Marta and Hörmayer, Lukas and Fendrych, Matyas and Xu, Tongda and Vernoux, Teva and Friml, Jiří}, issn = {0168-9452}, journal = {Plant Science}, keywords = {Agronomy and Crop Science, Plant Science, Genetics, General Medicine}, publisher = {Elsevier}, title = {{Developmental roles of auxin binding protein 1 in Arabidopsis thaliana}}, doi = {10.1016/j.plantsci.2020.110750}, volume = {303}, year = {2021}, } @article{9287, abstract = {The phytohormone auxin and its directional transport through tissues are intensively studied. However, a mechanistic understanding of auxin-mediated feedback on endocytosis and polar distribution of PIN auxin transporters remains limited due to contradictory observations and interpretations. Here, we used state-of-the-art methods to reexamine the auxin effects on PIN endocytic trafficking. We used high auxin concentrations or longer treatments versus lower concentrations and shorter treatments of natural (IAA) and synthetic (NAA) auxins to distinguish between specific and nonspecific effects. Longer treatments of both auxins interfere with Brefeldin A-mediated intracellular PIN2 accumulation and also with general aggregation of endomembrane compartments. NAA treatment decreased the internalization of the endocytic tracer dye, FM4-64; however, NAA treatment also affected the number, distribution, and compartment identity of the early endosome/trans-Golgi network (EE/TGN), rendering the FM4-64 endocytic assays at high NAA concentrations unreliable. To circumvent these nonspecific effects of NAA and IAA affecting the endomembrane system, we opted for alternative approaches visualizing the endocytic events directly at the plasma membrane (PM). Using Total Internal Reflection Fluorescence (TIRF) microscopy, we saw no significant effects of IAA or NAA treatments on the incidence and dynamics of clathrin foci, implying that these treatments do not affect the overall endocytosis rate. However, both NAA and IAA at low concentrations rapidly and specifically promoted endocytosis of photo-converted PIN2 from the PM. These analyses identify a specific effect of NAA and IAA on PIN2 endocytosis, thus contributing to its polarity maintenance and furthermore illustrate that high auxin levels have nonspecific effects on trafficking and endomembrane compartments. }, author = {Narasimhan, Madhumitha and Gallei, Michelle C and Tan, Shutang and Johnson, Alexander J and Verstraeten, Inge and Li, Lanxin and Rodriguez Solovey, Lesia and Han, Huibin and Himschoot, E and Wang, R and Vanneste, S and Sánchez-Simarro, J and Aniento, F and Adamowski, Maciek and Friml, Jiří}, issn = {1532-2548}, journal = {Plant Physiology}, number = {2}, pages = {1122–1142}, publisher = {Oxford University Press}, title = {{Systematic analysis of specific and nonspecific auxin effects on endocytosis and trafficking}}, doi = {10.1093/plphys/kiab134}, volume = {186}, year = {2021}, } @phdthesis{10083, abstract = {Plant motions occur across a wide spectrum of timescales, ranging from seed dispersal through bursting (milliseconds) and stomatal opening (minutes) to long-term adaptation of gross architecture. Relatively fast motions include water-driven growth as exemplified by root cell expansion under abiotic/biotic stresses or during gravitropism. A showcase is a root growth inhibition in 30 seconds triggered by the phytohormone auxin. However, the cellular and molecular mechanisms are still largely unknown. This thesis covers the studies about this topic as follows. By taking advantage of microfluidics combined with live imaging, pharmaceutical tools, and transgenic lines, we examined the kinetics of and causal relationship among various auxininduced rapid cellular changes in root growth, apoplastic pH, cytosolic Ca2+, cortical microtubule (CMT) orientation, and vacuolar morphology. We revealed that CMT reorientation and vacuolar constriction are the consequence of growth itself instead of responding directly to auxin. In contrast, auxin induces apoplast alkalinization to rapidly inhibit root growth in 30 seconds. This auxin-triggered apoplast alkalinization results from rapid H+- influx that is contributed by Ca2+ inward channel CYCLIC NUCLEOTIDE-GATED CHANNEL 14 (CNGC14)-dependent Ca2+ signaling. To dissect which auxin signaling mediates the rapid apoplast alkalinization, we combined microfluidics and genetic engineering to verify that TIR1/AFB receptors conduct a non-transcriptional regulation on Ca2+ and H+ -influx. This non-canonical pathway is mostly mediated by the cytosolic portion of TIR1/AFB. On the other hand, we uncovered, using biochemical and phospho-proteomic analysis, that auxin cell surface signaling component TRANSMEMBRANE KINASE 1 (TMK1) plays a negative role during auxin-trigger apoplast alkalinization and root growth inhibition through directly activating PM H+ -ATPases. Therefore, we discovered that PM H+ -ATPases counteract instead of mediate the auxintriggered rapid H+ -influx, and that TIR1/AFB and TMK1 regulate root growth antagonistically. This opposite effect of TIR1/AFB and TMK1 is consistent during auxin-induced hypocotyl elongation, leading us to explore the relation of two signaling pathways. Assisted with biochemistry and fluorescent imaging, we verified for the first time that TIR1/AFB and TMK1 can interact with each other. The ability of TIR1/AFB binding to membrane lipid provides a basis for the interaction of plasma membrane- and cytosol-localized proteins. Besides, transgenic analysis combined with genetic engineering and biochemistry showed that vi they do function in the same pathway. Particularly, auxin-induced TMK1 increase is TIR1/AFB dependent, suggesting TIR1/AFB regulation on TMK1. Conversely, TMK1 also regulates TIR1/AFB protein levels and thus auxin canonical signaling. To follow the study of rapid growth regulation, we analyzed another rapid growth regulator, signaling peptide RALF1. We showed that RALF1 also triggers a rapid and reversible growth inhibition caused by H + influx, highly resembling but not dependent on auxin. Besides, RALF1 promotes auxin biosynthesis by increasing expression of auxin biosynthesis enzyme YUCCAs and thus induces auxin signaling in ca. 1 hour, contributing to the sustained RALF1-triggered growth inhibition. These studies collectively contribute to understanding rapid regulation on plant cell growth, novel auxin signaling pathway as well as auxin-peptide crosstalk. }, author = {Li, Lanxin}, issn = {2663-337X}, publisher = {Institute of Science and Technology Austria}, title = {{Rapid cell growth regulation in Arabidopsis}}, doi = {10.15479/at:ista:10083}, year = {2021}, } @article{10015, abstract = {Auxin plays a dual role in growth regulation and, depending on the tissue and concentration of the hormone, it can either promote or inhibit division and expansion processes in plants. Recent studies have revealed that, beyond transcriptional reprogramming, alternative auxincontrolled mechanisms regulate root growth. Here, we explored the impact of different concentrations of the synthetic auxin NAA that establish growth-promoting and -repressing conditions on the root tip proteome and phosphoproteome, generating a unique resource. From the phosphoproteome data, we pinpointed (novel) growth regulators, such as the RALF34-THE1 module. Our results, together with previously published studies, suggest that auxin, H+-ATPases, cell wall modifications and cell wall sensing receptor-like kinases are tightly embedded in a pathway regulating cell elongation. Furthermore, our study assigned a novel role to MKK2 as a regulator of primary root growth and a (potential) regulator of auxin biosynthesis and signalling, and suggests the importance of the MKK2 Thr31 phosphorylation site for growth regulation in the Arabidopsis root tip.}, author = {Nikonorova, N and Murphy, E and Fonseca de Lima, CF and Zhu, S and van de Cotte, B and Vu, LD and Balcerowicz, D and Li, Lanxin and Kong, X and De Rop, G and Beeckman, T and Friml, Jiří and Vissenberg, K and Morris, PC and Ding, Z and De Smet, I}, issn = {2073-4409}, journal = {Cells}, keywords = {primary root, (phospho)proteomics, auxin, (receptor) kinase}, publisher = {MDPI}, title = {{The Arabidopsis root tip (phospho)proteomes at growth-promoting versus growth-repressing conditions reveal novel root growth regulators}}, doi = {10.3390/cells10071665}, volume = {10}, year = {2021}, } @unpublished{10095, abstract = {Growth regulation tailors plant development to its environment. A showcase is response to gravity, where shoots bend up and roots down1. This paradox is based on opposite effects of the phytohormone auxin, which promotes cell expansion in shoots, while inhibiting it in roots via a yet unknown cellular mechanism2. Here, by combining microfluidics, live imaging, genetic engineering and phospho-proteomics in Arabidopsis thaliana, we advance our understanding how auxin inhibits root growth. We show that auxin activates two distinct, antagonistically acting signalling pathways that converge on the rapid regulation of the apoplastic pH, a causative growth determinant. Cell surface-based TRANSMEMBRANE KINASE1 (TMK1) interacts with and mediates phosphorylation and activation of plasma membrane H+-ATPases for apoplast acidification, while intracellular canonical auxin signalling promotes net cellular H+-influx, causing apoplast alkalinisation. The simultaneous activation of these two counteracting mechanisms poises the root for a rapid, fine-tuned growth modulation while navigating complex soil environment.}, author = {Li, Lanxin and Verstraeten, Inge and Roosjen, Mark and Takahashi, Koji and Rodriguez Solovey, Lesia and Merrin, Jack and Chen, Jian and Shabala, Lana and Smet, Wouter and Ren, Hong and Vanneste, Steffen and Shabala, Sergey and De Rybel, Bert and Weijers, Dolf and Kinoshita, Toshinori and Gray, William M. and Friml, Jiří}, booktitle = {Research Square}, issn = {2693-5015}, title = {{Cell surface and intracellular auxin signalling for H+-fluxes in root growth}}, doi = {10.21203/rs.3.rs-266395/v3}, year = {2021}, } @phdthesis{10293, abstract = {Indirect reciprocity in evolutionary game theory is a prominent mechanism for explaining the evolution of cooperation among unrelated individuals. In contrast to direct reciprocity, which is based on individuals meeting repeatedly, and conditionally cooperating by using their own experiences, indirect reciprocity is based on individuals’ reputations. If a player helps another, this increases the helper’s public standing, benefitting them in the future. This lets cooperation in the population emerge without individuals having to meet more than once. While the two modes of reciprocity are intertwined, they are difficult to compare. Thus, they are usually studied in isolation. Direct reciprocity can maintain cooperation with simple strategies, and is robust against noise even when players do not remember more than their partner’s last action. Meanwhile, indirect reciprocity requires its successful strategies, or social norms, to be more complex. Exhaustive search previously identified eight such norms, called the “leading eight”, which excel at maintaining cooperation. However, as the first result of this thesis, we show that the leading eight break down once we remove the fundamental assumption that information is synchronized and public, such that everyone agrees on reputations. Once we consider a more realistic scenario of imperfect information, where reputations are private, and individuals occasionally misinterpret or miss observations, the leading eight do not promote cooperation anymore. Instead, minor initial disagreements can proliferate, fragmenting populations into subgroups. In a next step, we consider ways to mitigate this issue. We first explore whether introducing “generosity” can stabilize cooperation when players use the leading eight strategies in noisy environments. This approach of modifying strategies to include probabilistic elements for coping with errors is known to work well in direct reciprocity. However, as we show here, it fails for the more complex norms of indirect reciprocity. Imperfect information still prevents cooperation from evolving. On the other hand, we succeeded to show in this thesis that modifying the leading eight to use “quantitative assessment”, i.e. tracking reputation scores on a scale beyond good and bad, and making overall judgments of others based on a threshold, is highly successful, even when noise increases in the environment. Cooperation can flourish when reputations are more nuanced, and players have a broader understanding what it means to be “good.” Finally, we present a single theoretical framework that unites the two modes of reciprocity despite their differences. Within this framework, we identify a novel simple and successful strategy for indirect reciprocity, which can cope with noisy environments and has an analogue in direct reciprocity. We can also analyze decision making when different sources of information are available. Our results help highlight that for sustaining cooperation, already the most simple rules of reciprocity can be sufficient.}, author = {Schmid, Laura}, issn = {2663-337X}, pages = {171}, publisher = {Institute of Science and Technology Austria}, title = {{Evolution of cooperation via (in)direct reciprocity under imperfect information}}, doi = {10.15479/at:ista:10293}, year = {2021}, } @article{9997, abstract = {Indirect reciprocity is a mechanism for the evolution of cooperation based on social norms. This mechanism requires that individuals in a population observe and judge each other’s behaviors. Individuals with a good reputation are more likely to receive help from others. Previous work suggests that indirect reciprocity is only effective when all relevant information is reliable and publicly available. Otherwise, individuals may disagree on how to assess others, even if they all apply the same social norm. Such disagreements can lead to a breakdown of cooperation. Here we explore whether the predominantly studied ‘leading eight’ social norms of indirect reciprocity can be made more robust by equipping them with an element of generosity. To this end, we distinguish between two kinds of generosity. According to assessment generosity, individuals occasionally assign a good reputation to group members who would usually be regarded as bad. According to action generosity, individuals occasionally cooperate with group members with whom they would usually defect. Using individual-based simulations, we show that the two kinds of generosity have a very different effect on the resulting reputation dynamics. Assessment generosity tends to add to the overall noise and allows defectors to invade. In contrast, a limited amount of action generosity can be beneficial in a few cases. However, even when action generosity is beneficial, the respective simulations do not result in full cooperation. Our results suggest that while generosity can favor cooperation when individuals use the most simple strategies of reciprocity, it is disadvantageous when individuals use more complex social norms.}, author = {Schmid, Laura and Shati, Pouya and Hilbe, Christian and Chatterjee, Krishnendu}, issn = {2045-2322}, journal = {Scientific Reports}, keywords = {Multidisciplinary}, number = {1}, publisher = {Springer Nature}, title = {{The evolution of indirect reciprocity under action and assessment generosity}}, doi = {10.1038/s41598-021-96932-1}, volume = {11}, year = {2021}, } @article{9402, abstract = {Direct and indirect reciprocity are key mechanisms for the evolution of cooperation. Direct reciprocity means that individuals use their own experience to decide whether to cooperate with another person. Indirect reciprocity means that they also consider the experiences of others. Although these two mechanisms are intertwined, they are typically studied in isolation. Here, we introduce a mathematical framework that allows us to explore both kinds of reciprocity simultaneously. We show that the well-known ‘generous tit-for-tat’ strategy of direct reciprocity has a natural analogue in indirect reciprocity, which we call ‘generous scoring’. Using an equilibrium analysis, we characterize under which conditions either of the two strategies can maintain cooperation. With simulations, we additionally explore which kind of reciprocity evolves when members of a population engage in social learning to adapt to their environment. Our results draw unexpected connections between direct and indirect reciprocity while highlighting important differences regarding their evolvability.}, author = {Schmid, Laura and Chatterjee, Krishnendu and Hilbe, Christian and Nowak, Martin A.}, issn = {2397-3374}, journal = {Nature Human Behaviour}, number = {10}, pages = {1292–1302}, publisher = {Springer Nature}, title = {{A unified framework of direct and indirect reciprocity}}, doi = {10.1038/s41562-021-01114-8}, volume = {5}, year = {2021}, } @article{9817, abstract = {Elastic bending of initially flat slender elements allows the realization and economic fabrication of intriguing curved shapes. In this work, we derive an intuitive but rigorous geometric characterization of the design space of plane elastic rods with variable stiffness. It enables designers to determine which shapes are physically viable with active bending by visual inspection alone. Building on these insights, we propose a method for efficiently designing the geometry of a flat elastic rod that realizes a target equilibrium curve, which only requires solving a linear program. We implement this method in an interactive computational design tool that gives feedback about the feasibility of a design, and computes the geometry of the structural elements necessary to realize it within an instant. The tool also offers an iterative optimization routine that improves the fabricability of a model while modifying it as little as possible. In addition, we use our geometric characterization to derive an algorithm for analyzing and recovering the stability of elastic curves that would otherwise snap out of their unstable equilibrium shapes by buckling. We show the efficacy of our approach by designing and manufacturing several physical models that are assembled from flat elements.}, author = {Hafner, Christian and Bickel, Bernd}, issn = {1557-7368}, journal = {ACM Transactions on Graphics}, keywords = {Computing methodologies, shape modeling, modeling and simulation, theory of computation, computational geometry, mathematics of computing, mathematical optimization}, location = {Virtual}, number = {4}, publisher = {Association for Computing Machinery}, title = {{The design space of plane elastic curves}}, doi = {10.1145/3450626.3459800}, volume = {40}, year = {2021}, } @phdthesis{10135, abstract = {Plants maintain the capacity to develop new organs e.g. lateral roots post-embryonically throughout their whole life and thereby flexibly adapt to ever-changing environmental conditions. Plant hormones auxin and cytokinin are the main regulators of the lateral root organogenesis. Additionally to their solo activities, the interaction between auxin and cytokinin plays crucial role in fine-tuning of lateral root development and growth. In particular, cytokinin modulates auxin distribution within the developing lateral root by affecting the endomembrane trafficking of auxin transporter PIN1 and promoting its vacuolar degradation (Marhavý et al., 2011, 2014). This effect is independent of transcription and translation. Therefore, it suggests novel, non-canonical cytokinin activity occuring possibly on the posttranslational level. Impact of cytokinin and other plant hormones on auxin transporters (including PIN1) on the posttranslational level is described in detail in the introduction part of this thesis in a form of a review (Semeradova et al., 2020). To gain insights into the molecular machinery underlying cytokinin effect on the endomembrane trafficking in the plant cell, in particular on the PIN1 degradation, we conducted two large proteomic screens: 1) Identification of cytokinin binding proteins using chemical proteomics. 2) Monitoring of proteomic and phosphoproteomic changes upon cytokinin treatment. In the first screen, we identified DYNAMIN RELATED PROTEIN 2A (DRP2A). We found that DRP2A plays a role in cytokinin regulated processes during the plant growth and that cytokinin treatment promotes destabilization of DRP2A protein. However, the role of DRP2A in the PIN1 degradation remains to be elucidated. In the second screen, we found VACUOLAR PROTEIN SORTING 9A (VPS9A). VPS9a plays crucial role in plant’s response to cytokin and in cytokinin mediated PIN1 degradation. Altogether, we identified proteins, which bind to cytokinin and proteins that in response to cytokinin exhibit significantly changed abundance or phosphorylation pattern. By combining information from these two screens, we can pave our way towards understanding of noncanonical cytokinin effects.}, author = {Semerádová, Hana}, isbn = {978-3-99078-014-5}, issn = {2663-337X}, publisher = {Institute of Science and Technology Austria}, title = {{Molecular mechanisms of the cytokinin-regulated endomembrane trafficking to coordinate plant organogenesis}}, doi = {10.15479/at:ista:10135}, year = {2021}, } @phdthesis{9728, abstract = {Most real-world flows are multiphase, yet we know little about them compared to their single-phase counterparts. Multiphase flows are more difficult to investigate as their dynamics occur in large parameter space and involve complex phenomena such as preferential concentration, turbulence modulation, non-Newtonian rheology, etc. Over the last few decades, experiments in particle-laden flows have taken a back seat in favour of ever-improving computational resources. However, computers are still not powerful enough to simulate a real-world fluid with millions of finite-size particles. Experiments are essential not only because they offer a reliable way to investigate real-world multiphase flows but also because they serve to validate numerical studies and steer the research in a relevant direction. In this work, we have experimentally investigated particle-laden flows in pipes, and in particular, examined the effect of particles on the laminar-turbulent transition and the drag scaling in turbulent flows. For particle-laden pipe flows, an earlier study [Matas et al., 2003] reported how the sub-critical (i.e., hysteretic) transition that occurs via localised turbulent structures called puffs is affected by the addition of particles. In this study, in addition to this known transition, we found a super-critical transition to a globally fluctuating state with increasing particle concentration. At the same time, the Newtonian-type transition via puffs is delayed to larger Reynolds numbers. At an even higher concentration, only the globally fluctuating state is found. The dynamics of particle-laden flows are hence determined by two competing instabilities that give rise to three flow regimes: Newtonian-type turbulence at low, a particle-induced globally fluctuating state at high, and a coexistence state at intermediate concentrations. The effect of particles on turbulent drag is ambiguous, with studies reporting drag reduction, no net change, and even drag increase. The ambiguity arises because, in addition to particle concentration, particle shape, size, and density also affect the net drag. Even similar particles might affect the flow dissimilarly in different Reynolds number and concentration ranges. In the present study, we explored a wide range of both Reynolds number and concentration, using spherical as well as cylindrical particles. We found that the spherical particles do not reduce drag while the cylindrical particles are drag-reducing within a specific Reynolds number interval. The interval strongly depends on the particle concentration and the relative size of the pipe and particles. Within this interval, the magnitude of drag reduction reaches a maximum. These drag reduction maxima appear to fall onto a distinct power-law curve irrespective of the pipe diameter and particle concentration, and this curve can be considered as the maximum drag reduction asymptote for a given fibre shape. Such an asymptote is well known for polymeric flows but had not been identified for particle-laden flows prior to this work.}, author = {Agrawal, Nishchal}, issn = {2663-337X}, keywords = {Drag Reduction, Transition to Turbulence, Multiphase Flows, particle Laden Flows, Complex Flows, Experiments, Fluid Dynamics}, pages = {118}, publisher = {Institute of Science and Technology Austria}, title = {{Transition to turbulence and drag reduction in particle-laden pipe flows}}, doi = {10.15479/at:ista:9728}, year = {2021}, } @inproceedings{10673, abstract = {We propose a neural information processing system obtained by re-purposing the function of a biological neural circuit model to govern simulated and real-world control tasks. Inspired by the structure of the nervous system of the soil-worm, C. elegans, we introduce ordinary neural circuits (ONCs), defined as the model of biological neural circuits reparameterized for the control of alternative tasks. We first demonstrate that ONCs realize networks with higher maximum flow compared to arbitrary wired networks. We then learn instances of ONCs to control a series of robotic tasks, including the autonomous parking of a real-world rover robot. For reconfiguration of the purpose of the neural circuit, we adopt a search-based optimization algorithm. Ordinary neural circuits perform on par and, in some cases, significantly surpass the performance of contemporary deep learning models. ONC networks are compact, 77% sparser than their counterpart neural controllers, and their neural dynamics are fully interpretable at the cell-level.}, author = {Hasani, Ramin and Lechner, Mathias and Amini, Alexander and Rus, Daniela and Grosu, Radu}, booktitle = {Proceedings of the 37th International Conference on Machine Learning}, issn = {2640-3498}, location = {Virtual}, pages = {4082--4093}, title = {{A natural lottery ticket winner: Reinforcement learning with ordinary neural circuits}}, year = {2020}, } @inproceedings{7272, abstract = {Many systems rely on optimistic concurrent search trees for multi-core scalability. In principle, optimistic trees have a simple performance story: searches are read-only and so run in parallel, with writes to shared memory occurring only when modifying the data structure. However, this paper shows that in practice, obtaining the full performance benefits of optimistic search trees is not so simple. We focus on optimistic binary search trees (BSTs) and perform a detailed performance analysis of 10 state-of-the-art BSTs on large scale x86-64 hardware, using both microbenchmarks and an in-memory database system. We find and explain significant unexpected performance differences between BSTs with similar tree structure and search implementations, which we trace to subtle performance-degrading interactions of BSTs with systems software and hardware subsystems. We further derive a prescriptive approach to avoid this performance degradation, as well as algorithmic insights on optimistic BST design. Our work underlines the gap between the theory and practice of multi-core performance, and calls for further research to help bridge this gap.}, author = {Arbel-Raviv, Maya and Brown, Trevor A and Morrison, Adam}, booktitle = {Proceedings of the 2018 USENIX Annual Technical Conference}, isbn = {9781939133021}, location = {Boston, MA, United States}, pages = {295--306}, publisher = {USENIX Association}, title = {{Getting to the root of concurrent binary search tree performance}}, year = {2020}, } @inproceedings{7346, abstract = {The Price of Anarchy (PoA) is a well-established game-theoretic concept to shed light on coordination issues arising in open distributed systems. Leaving agents to selfishly optimize comes with the risk of ending up in sub-optimal states (in terms of performance and/or costs), compared to a centralized system design. However, the PoA relies on strong assumptions about agents' rationality (e.g., resources and information) and interactions, whereas in many distributed systems agents interact locally with bounded resources. They do so repeatedly over time (in contrast to "one-shot games"), and their strategies may evolve. Using a more realistic evolutionary game model, this paper introduces a realized evolutionary Price of Anarchy (ePoA). The ePoA allows an exploration of equilibrium selection in dynamic distributed systems with multiple equilibria, based on local interactions of simple memoryless agents. Considering a fundamental game related to virus propagation on networks, we present analytical bounds on the ePoA in basic network topologies and for different strategy update dynamics. In particular, deriving stationary distributions of the stochastic evolutionary process, we find that the Nash equilibria are not always the most abundant states, and that different processes can feature significant off-equilibrium behavior, leading to a significantly higher ePoA compared to the PoA studied traditionally in the literature. }, author = {Schmid, Laura and Chatterjee, Krishnendu and Schmid, Stefan}, booktitle = {Proceedings of the 23rd International Conference on Principles of Distributed Systems}, location = {Neuchâtel, Switzerland}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game}}, doi = {10.4230/LIPIcs.OPODIS.2019.21}, volume = {153}, year = {2020}, } @inproceedings{7348, abstract = {The monitoring of event frequencies can be used to recognize behavioral anomalies, to identify trends, and to deduce or discard hypotheses about the underlying system. For example, the performance of a web server may be monitored based on the ratio of the total count of requests from the least and most active clients. Exact frequency monitoring, however, can be prohibitively expensive; in the above example it would require as many counters as there are clients. In this paper, we propose the efficient probabilistic monitoring of common frequency properties, including the mode (i.e., the most common event) and the median of an event sequence. We define a logic to express composite frequency properties as a combination of atomic frequency properties. Our main contribution is an algorithm that, under suitable probabilistic assumptions, can be used to monitor these important frequency properties with four counters, independent of the number of different events. Our algorithm samples longer and longer subwords of an infinite event sequence. We prove the almost-sure convergence of our algorithm by generalizing ergodic theory from increasing-length prefixes to increasing-length subwords of an infinite sequence. A similar algorithm could be used to learn a connected Markov chain of a given structure from observing its outputs, to arbitrary precision, for a given confidence. }, author = {Ferrere, Thomas and Henzinger, Thomas A and Kragl, Bernhard}, booktitle = {28th EACSL Annual Conference on Computer Science Logic}, isbn = {9783959771320}, issn = {1868-8969}, location = {Barcelona, Spain}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Monitoring event frequencies}}, doi = {10.4230/LIPIcs.CSL.2020.20}, volume = {152}, year = {2020}, } @article{7567, abstract = {Coxeter triangulations are triangulations of Euclidean space based on a single simplex. By this we mean that given an individual simplex we can recover the entire triangulation of Euclidean space by inductively reflecting in the faces of the simplex. In this paper we establish that the quality of the simplices in all Coxeter triangulations is O(1/d−−√) of the quality of regular simplex. We further investigate the Delaunay property for these triangulations. Moreover, we consider an extension of the Delaunay property, namely protection, which is a measure of non-degeneracy of a Delaunay triangulation. In particular, one family of Coxeter triangulations achieves the protection O(1/d2). We conjecture that both bounds are optimal for triangulations in Euclidean space.}, author = {Choudhary, Aruni and Kachanovich, Siargey and Wintraecken, Mathijs}, issn = {1661-8289}, journal = {Mathematics in Computer Science}, pages = {141--176}, publisher = {Springer Nature}, title = {{Coxeter triangulations have good quality}}, doi = {10.1007/s11786-020-00461-5}, volume = {14}, year = {2020}, } @article{7594, abstract = {The concept of the entanglement between spin and orbital degrees of freedom plays a crucial role in our understanding of various phases and exotic ground states in a broad class of materials, including orbitally ordered materials and spin liquids. We investigate how the spin-orbital entanglement in a Mott insulator depends on the value of the spin-orbit coupling of the relativistic origin. To this end, we numerically diagonalize a one-dimensional spin-orbital model with Kugel-Khomskii exchange interactions between spins and orbitals on different sites supplemented by the on-site spin-orbit coupling. In the regime of small spin-orbit coupling with regard to the spin-orbital exchange, the ground state to a large extent resembles the one obtained in the limit of vanishing spin-orbit coupling. On the other hand, for large spin-orbit coupling the ground state can, depending on the model parameters, either still show negligible spin-orbital entanglement or evolve to a highly spin-orbitally-entangled phase with completely distinct properties that are described by an effective XXZ model. The presented results suggest that (i) the spin-orbital entanglement may be induced by large on-site spin-orbit coupling, as found in the 5d transition metal oxides, such as the iridates; (ii) for Mott insulators with weak spin-orbit coupling of Ising type, such as, e.g., the alkali hyperoxides, the effects of the spin-orbit coupling on the ground state can, in the first order of perturbation theory, be neglected.}, author = {Gotfryd, Dorota and Paerschke, Ekaterina and Chaloupka, Jiri and Oles, Andrzej M. and Wohlfeld, Krzysztof}, journal = {Physical Review Research}, number = {1}, publisher = {American Physical Society}, title = {{How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator}}, doi = {10.1103/PhysRevResearch.2.013353}, volume = {2}, year = {2020}, } @inproceedings{7605, abstract = {Union-Find (or Disjoint-Set Union) is one of the fundamental problems in computer science; it has been well-studied from both theoretical and practical perspectives in the sequential case. Recently, there has been mounting interest in analyzing this problem in the concurrent scenario, and several asymptotically-efficient algorithms have been proposed. Yet, to date, there is very little known about the practical performance of concurrent Union-Find. This work addresses this gap. We evaluate and analyze the performance of several concurrent Union-Find algorithms and optimization strategies across a wide range of platforms (Intel, AMD, and ARM) and workloads (social, random, and road networks, as well as integrations into more complex algorithms). We first observe that, due to the limited computational cost, the number of induced cache misses is the critical determining factor for the performance of existing algorithms. We introduce new techniques to reduce this cost by storing node priorities implicitly and by using plain reads and writes in a way that does not affect the correctness of the algorithms. Finally, we show that Union-Find implementations are an interesting application for Transactional Memory (TM): one of the fastest algorithm variants we discovered is a sequential one that uses coarse-grained locking with the lock elision optimization to reduce synchronization cost and increase scalability. }, author = {Alistarh, Dan-Adrian and Fedorov, Alexander and Koval, Nikita}, booktitle = {23rd International Conference on Principles of Distributed Systems}, isbn = {9783959771337}, issn = {18688969}, location = {Neuchatal, Switzerland}, pages = {15:1--15:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{In search of the fastest concurrent union-find algorithm}}, doi = {10.4230/LIPIcs.OPODIS.2019.15}, volume = {153}, year = {2020}, } @unpublished{7601, abstract = {Plasmodesmata (PD) are crucial structures for intercellular communication in multicellular plants with remorins being their crucial plant-specific structural and functional constituents. The PD biogenesis is an intriguing but poorly understood process. By expressing an Arabidopsis remorin protein in mammalian cells, we have reconstituted a PD-like filamentous structure, termed remorin filament (RF), connecting neighboring cells physically and physiologically. Notably, RFs are capable of transporting macromolecules intercellularly, in a way similar to plant PD. With further super-resolution microscopic analysis and biochemical characterization, we found that RFs are also composed of actin filaments, forming the core skeleton structure, aligned with the remorin protein. This unique heterologous filamentous structure might explain the molecular mechanism for remorin function as well as PD construction. Furthermore, remorin protein exhibits a specific distribution manner in the plasma membrane in mammalian cells, representing a lipid nanodomain, depending on its lipid modification status. Our studies not only provide crucial insights into the mechanism of PD biogenesis, but also uncovers unsuspected fundamental mechanistic and evolutionary links between intercellular communication systems of plants and animals.}, author = {Wei, Zhuang and Tan, Shutang and Liu, Tao and Wu, Yuan and Lei, Ji-Gang and Chen, ZhengJun and Friml, Jiří and Xue, Hong-Wei and Liao, Kan}, booktitle = {bioRxiv}, pages = {22}, publisher = {Cold Spring Harbor Laboratory}, title = {{Plasmodesmata-like intercellular connections by plant remorin in animal cells}}, doi = {10.1101/791137}, year = {2020}, } @article{7651, abstract = {The growth of snail shells can be described by simple mathematical rules. Variation in a few parameters can explain much of the diversity of shell shapes seen in nature. However, empirical studies of gastropod shell shape variation typically use geometric morphometric approaches, which do not capture this growth pattern. We have developed a way to infer a set of developmentally descriptive shape parameters based on three-dimensional logarithmic helicospiral growth and using landmarks from two-dimensional shell images as input. We demonstrate the utility of this approach, and compare it to the geometric morphometric approach, using a large set of Littorina saxatilis shells in which locally adapted populations differ in shape. Our method can be modified easily to make it applicable to a wide range of shell forms, which would allow for investigations of the similarities and differences between and within many different species of gastropods.}, author = {Larsson, J. and Westram, Anja M and Bengmark, S. and Lundh, T. and Butlin, R. K.}, issn = {1742-5662}, journal = {Journal of The Royal Society Interface}, number = {163}, publisher = {The Royal Society}, title = {{A developmentally descriptive method for quantifying shape in gastropod shells}}, doi = {10.1098/rsif.2019.0721}, volume = {17}, year = {2020}, } @inproceedings{7803, abstract = {We settle the complexity of the (Δ+1)-coloring and (Δ+1)-list coloring problems in the CONGESTED CLIQUE model by presenting a simple deterministic algorithm for both problems running in a constant number of rounds. This matches the complexity of the recent breakthrough randomized constant-round (Δ+1)-list coloring algorithm due to Chang et al. (PODC'19), and significantly improves upon the state-of-the-art O(logΔ)-round deterministic (Δ+1)-coloring bound of Parter (ICALP'18). A remarkable property of our algorithm is its simplicity. Whereas the state-of-the-art randomized algorithms for this problem are based on the quite involved local coloring algorithm of Chang et al. (STOC'18), our algorithm can be described in just a few lines. At a high level, it applies a careful derandomization of a recursive procedure which partitions the nodes and their respective palettes into separate bins. We show that after O(1) recursion steps, the remaining uncolored subgraph within each bin has linear size, and thus can be solved locally by collecting it to a single node. This algorithm can also be implemented in the Massively Parallel Computation (MPC) model provided that each machine has linear (in n, the number of nodes in the input graph) space. We also show an extension of our algorithm to the MPC regime in which machines have sublinear space: we present the first deterministic (Δ+1)-list coloring algorithm designed for sublinear-space MPC, which runs in O(logΔ+loglogn) rounds.}, author = {Czumaj, Artur and Davies, Peter and Parter, Merav}, booktitle = {Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing}, location = {Salerno, Italy}, pages = {309--318}, publisher = {Association for Computing Machinery}, title = {{Simple, deterministic, constant-round coloring in the congested clique}}, doi = {10.1145/3382734.3405751}, year = {2020}, } @inproceedings{7806, abstract = {We consider the following decision problem EMBEDk→d in computational topology (where k ≤ d are fixed positive integers): Given a finite simplicial complex K of dimension k, does there exist a (piecewise-linear) embedding of K into ℝd? The special case EMBED1→2 is graph planarity, which is decidable in linear time, as shown by Hopcroft and Tarjan. In higher dimensions, EMBED2→3 and EMBED3→3 are known to be decidable (as well as NP-hard), and recent results of Čadek et al. in computational homotopy theory, in combination with the classical Haefliger–Weber theorem in geometric topology, imply that EMBEDk→d can be solved in polynomial time for any fixed pair (k, d) of dimensions in the so-called metastable range . Here, by contrast, we prove that EMBEDk→d is algorithmically undecidable for almost all pairs of dimensions outside the metastable range, namely for . This almost completely resolves the decidability vs. undecidability of EMBEDk→d in higher dimensions and establishes a sharp dichotomy between polynomial-time solvability and undecidability. Our result complements (and in a wide range of dimensions strengthens) earlier results of Matoušek, Tancer, and the second author, who showed that EMBEDk→d is undecidable for 4 ≤ k ϵ {d – 1, d}, and NP-hard for all remaining pairs (k, d) outside the metastable range and satisfying d ≥ 4.}, author = {Filakovský, Marek and Wagner, Uli and Zhechev, Stephan Y}, booktitle = {Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms}, isbn = {9781611975994}, location = {Salt Lake City, UT, United States}, pages = {767--785}, publisher = {SIAM}, title = {{Embeddability of simplicial complexes is undecidable}}, doi = {10.1137/1.9781611975994.47}, volume = {2020-January}, year = {2020}, } @article{7814, abstract = {Scientific research is to date largely restricted to wealthy laboratories in developed nations due to the necessity of complex and expensive equipment. This inequality limits the capacity of science to be used as a diplomatic channel. Maker movements use open-source technologies including additive manufacturing (3D printing) and laser cutting, together with low-cost computers for developing novel products. This movement is setting the groundwork for a revolution, allowing scientific equipment to be sourced at a fraction of the cost and has the potential to increase the availability of equipment for scientists around the world. Science education is increasingly recognized as another channel for science diplomacy. In this perspective, we introduce the idea that the Maker movement and open-source technologies have the potential to revolutionize science, technology, engineering and mathematics (STEM) education worldwide. We present an open-source STEM didactic tool called SCOPES (Sparking Curiosity through Open-source Platforms in Education and Science). SCOPES is self-contained, independent of local resources, and cost-effective. SCOPES can be adapted to communicate complex subjects from genetics to neurobiology, perform real-world biological experiments and explore digitized scientific samples. We envision such platforms will enhance science diplomacy by providing a means for scientists to share their findings with classrooms and for educators to incorporate didactic concepts into STEM lessons. By providing students the opportunity to design, perform, and share scientific experiments, students also experience firsthand the benefits of a multinational scientific community. We provide instructions on how to build and use SCOPES on our webpage: http://scopeseducation.org.}, author = {Beattie, Robert J and Hippenmeyer, Simon and Pauler, Florian}, issn = {2504-284X}, journal = {Frontiers in Education}, publisher = {Frontiers Media}, title = {{SCOPES: Sparking curiosity through Open-Source platforms in education and science}}, doi = {10.3389/feduc.2020.00048}, volume = {5}, year = {2020}, } @article{7866, abstract = {In this paper, we establish convergence to equilibrium for a drift–diffusion–recombination system modelling the charge transport within certain semiconductor devices. More precisely, we consider a two-level system for electrons and holes which is augmented by an intermediate energy level for electrons in so-called trapped states. The recombination dynamics use the mass action principle by taking into account this additional trap level. The main part of the paper is concerned with the derivation of an entropy–entropy production inequality, which entails exponential convergence to the equilibrium via the so-called entropy method. The novelty of our approach lies in the fact that the entropy method is applied uniformly in a fast-reaction parameter which governs the lifetime of electrons on the trap level. Thus, the resulting decay estimate for the densities of electrons and holes extends to the corresponding quasi-steady-state approximation.}, author = {Fellner, Klemens and Kniely, Michael}, issn = {22969039}, journal = {Journal of Elliptic and Parabolic Equations}, pages = {529--598}, publisher = {Springer Nature}, title = {{Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model}}, doi = {10.1007/s41808-020-00068-8}, volume = {6}, year = {2020}, } @article{7919, abstract = {We explore the time evolution of two impurities in a trapped one-dimensional Bose gas that follows a change of the boson-impurity interaction. We study the induced impurity-impurity interactions and their effect on the quench dynamics. In particular, we report on the size of the impurity cloud, the impurity-impurity entanglement, and the impurity-impurity correlation function. The presented numerical simulations are based upon the variational multilayer multiconfiguration time-dependent Hartree method for bosons. To analyze and quantify induced impurity-impurity correlations, we employ an effective two-body Hamiltonian with a contact interaction. We show that the effective model consistent with the mean-field attraction of two heavy impurities explains qualitatively our results for weak interactions. Our findings suggest that the quench dynamics in cold-atom systems can be a tool for studying impurity-impurity correlations.}, author = {Mistakidis, S. I. and Volosniev, Artem and Schmelcher, P.}, issn = {2643-1564}, journal = {Physical Review Research}, publisher = {American Physical Society}, title = {{Induced correlations between impurities in a one-dimensional quenched Bose gas}}, doi = {10.1103/physrevresearch.2.023154}, volume = {2}, year = {2020}, } @inproceedings{7991, abstract = {We define and study a discrete process that generalizes the convex-layer decomposition of a planar point set. Our process, which we call homotopic curve shortening (HCS), starts with a closed curve (which might self-intersect) in the presence of a set P⊂ ℝ² of point obstacles, and evolves in discrete steps, where each step consists of (1) taking shortcuts around the obstacles, and (2) reducing the curve to its shortest homotopic equivalent. We find experimentally that, if the initial curve is held fixed and P is chosen to be either a very fine regular grid or a uniformly random point set, then HCS behaves at the limit like the affine curve-shortening flow (ACSF). This connection between HCS and ACSF generalizes the link between "grid peeling" and the ACSF observed by Eppstein et al. (2017), which applied only to convex curves, and which was studied only for regular grids. We prove that HCS satisfies some properties analogous to those of ACSF: HCS is invariant under affine transformations, preserves convexity, and does not increase the total absolute curvature. Furthermore, the number of self-intersections of a curve, or intersections between two curves (appropriately defined), does not increase. Finally, if the initial curve is simple, then the number of inflection points (appropriately defined) does not increase.}, author = {Avvakumov, Sergey and Nivasch, Gabriel}, booktitle = {36th International Symposium on Computational Geometry}, isbn = {9783959771436}, issn = {18688969}, location = {Zürich, Switzerland}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Homotopic curve shortening and the affine curve-shortening flow}}, doi = {10.4230/LIPIcs.SoCG.2020.12}, volume = {164}, year = {2020}, } @inproceedings{7989, abstract = {We prove general topological Radon-type theorems for sets in ℝ^d, smooth real manifolds or finite dimensional simplicial complexes. Combined with a recent result of Holmsen and Lee, it gives fractional Helly theorem, and consequently the existence of weak ε-nets as well as a (p,q)-theorem. More precisely: Let X be either ℝ^d, smooth real d-manifold, or a finite d-dimensional simplicial complex. Then if F is a finite, intersection-closed family of sets in X such that the ith reduced Betti number (with ℤ₂ coefficients) of any set in F is at most b for every non-negative integer i less or equal to k, then the Radon number of F is bounded in terms of b and X. Here k is the smallest integer larger or equal to d/2 - 1 if X = ℝ^d; k=d-1 if X is a smooth real d-manifold and not a surface, k=0 if X is a surface and k=d if X is a d-dimensional simplicial complex. Using the recent result of the author and Kalai, we manage to prove the following optimal bound on fractional Helly number for families of open sets in a surface: Let F be a finite family of open sets in a surface S such that the intersection of any subfamily of F is either empty, or path-connected. Then the fractional Helly number of F is at most three. This also settles a conjecture of Holmsen, Kim, and Lee about an existence of a (p,q)-theorem for open subsets of a surface.}, author = {Patakova, Zuzana}, booktitle = {36th International Symposium on Computational Geometry}, isbn = {9783959771436}, issn = {18688969}, location = {Zürich, Switzerland}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Bounding radon number via Betti numbers}}, doi = {10.4230/LIPIcs.SoCG.2020.61}, volume = {164}, year = {2020}, } @inproceedings{7992, abstract = {Let K be a convex body in ℝⁿ (i.e., a compact convex set with nonempty interior). Given a point p in the interior of K, a hyperplane h passing through p is called barycentric if p is the barycenter of K ∩ h. In 1961, Grünbaum raised the question whether, for every K, there exists an interior point p through which there are at least n+1 distinct barycentric hyperplanes. Two years later, this was seemingly resolved affirmatively by showing that this is the case if p=p₀ is the point of maximal depth in K. However, while working on a related question, we noticed that one of the auxiliary claims in the proof is incorrect. Here, we provide a counterexample; this re-opens Grünbaum’s question. It follows from known results that for n ≥ 2, there are always at least three distinct barycentric cuts through the point p₀ ∈ K of maximal depth. Using tools related to Morse theory we are able to improve this bound: four distinct barycentric cuts through p₀ are guaranteed if n ≥ 3.}, author = {Patakova, Zuzana and Tancer, Martin and Wagner, Uli}, booktitle = {36th International Symposium on Computational Geometry}, isbn = {9783959771436}, issn = {18688969}, location = {Zürich, Switzerland}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Barycentric cuts through a convex body}}, doi = {10.4230/LIPIcs.SoCG.2020.62}, volume = {164}, year = {2020}, } @inproceedings{7994, abstract = {In the recent study of crossing numbers, drawings of graphs that can be extended to an arrangement of pseudolines (pseudolinear drawings) have played an important role as they are a natural combinatorial extension of rectilinear (or straight-line) drawings. A characterization of the pseudolinear drawings of K_n was found recently. We extend this characterization to all graphs, by describing the set of minimal forbidden subdrawings for pseudolinear drawings. Our characterization also leads to a polynomial-time algorithm to recognize pseudolinear drawings and construct the pseudolines when it is possible.}, author = {Arroyo Guevara, Alan M and Bensmail, Julien and Bruce Richter, R.}, booktitle = {36th International Symposium on Computational Geometry}, isbn = {9783959771436}, issn = {18688969}, location = {Zürich, Switzerland}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Extending drawings of graphs to arrangements of pseudolines}}, doi = {10.4230/LIPIcs.SoCG.2020.9}, volume = {164}, year = {2020}, } @article{8011, abstract = {Relaxation to a thermal state is the inevitable fate of nonequilibrium interacting quantum systems without special conservation laws. While thermalization in one-dimensional systems can often be suppressed by integrability mechanisms, in two spatial dimensions thermalization is expected to be far more effective due to the increased phase space. In this work we propose a general framework for escaping or delaying the emergence of the thermal state in two-dimensional arrays of Rydberg atoms via the mechanism of quantum scars, i.e., initial states that fail to thermalize. The suppression of thermalization is achieved in two complementary ways: by adding local perturbations or by adjusting the driving Rabi frequency according to the local connectivity of the lattice. We demonstrate that these mechanisms allow us to realize robust quantum scars in various two-dimensional lattices, including decorated lattices with nonconstant connectivity. In particular, we show that a small decrease of the Rabi frequency at the corners of the lattice is crucial for mitigating the strong boundary effects in two-dimensional systems. Our results identify synchronization as an important tool for future experiments on two-dimensional quantum scars.}, author = {Michailidis, Alexios and Turner, C. J. and Papić, Z. and Abanin, D. A. and Serbyn, Maksym}, issn = {2643-1564}, journal = {Physical Review Research}, number = {2}, publisher = {American Physical Society}, title = {{Stabilizing two-dimensional quantum scars by deformation and synchronization}}, doi = {10.1103/physrevresearch.2.022065}, volume = {2}, year = {2020}, } @unpublished{8063, abstract = {We present a generative model of images that explicitly reasons over the set of objects they show. Our model learns a structured latent representation that separates objects from each other and from the background; unlike prior works, it explicitly represents the 2D position and depth of each object, as well as an embedding of its segmentation mask and appearance. The model can be trained from images alone in a purely unsupervised fashion without the need for object masks or depth information. Moreover, it always generates complete objects, even though a significant fraction of training images contain occlusions. Finally, we show that our model can infer decompositions of novel images into their constituent objects, including accurate prediction of depth ordering and segmentation of occluded parts.}, author = {Anciukevicius, Titas and Lampert, Christoph and Henderson, Paul M}, booktitle = {arXiv}, title = {{Object-centric image generation with factored depths, locations, and appearances}}, year = {2020}, } @unpublished{8081, abstract = {Here, we employ micro- and nanosized cellulose particles, namely paper fines and cellulose nanocrystals, to induce hierarchical organization over a wide length scale. After processing them into carbonaceous materials, we demonstrate that these hierarchically organized materials outperform the best materials for supercapacitors operating with organic electrolytes reported in literature in terms of specific energy/power (Ragone plot) while showing hardly any capacity fade over 4,000 cycles. The highly porous materials feature a specific surface area as high as 2500 m2ˑg-1 and exhibit pore sizes in the range of 0.5 to 200 nm as proven by scanning electron microscopy and N2 physisorption. The carbonaceous materials have been further investigated by X-ray photoelectron spectroscopy and RAMAN spectroscopy. Since paper fines are an underutilized side stream in any paper production process, they are a cheap and highly available feedstock to prepare carbonaceous materials with outstanding performance in electrochemical applications. }, author = {Hobisch, Mathias A. and Mourad, Eléonore and Fischer, Wolfgang J. and Prehal, Christian and Eyley, Samuel and Childress, Anthony and Zankel, Armin and Mautner, Andreas and Breitenbach, Stefan and Rao, Apparao M. and Thielemans, Wim and Freunberger, Stefan Alexander and Eckhart, Rene and Bauer, Wolfgang and Spirk, Stefan }, title = {{High specific capacitance supercapacitors from hierarchically organized all-cellulose composites}}, year = {2020}, } @article{8105, abstract = {Physical and biological systems often exhibit intermittent dynamics with bursts or avalanches (active states) characterized by power-law size and duration distributions. These emergent features are typical of systems at the critical point of continuous phase transitions, and have led to the hypothesis that such systems may self-organize at criticality, i.e. without any fine tuning of parameters. Since the introduction of the Bak-Tang-Wiesenfeld (BTW) model, the paradigm of self-organized criticality (SOC) has been very fruitful for the analysis of emergent collective behaviors in a number of systems, including the brain. Although considerable effort has been devoted in identifying and modeling scaling features of burst and avalanche statistics, dynamical aspects related to the temporal organization of bursts remain often poorly understood or controversial. Of crucial importance to understand the mechanisms responsible for emergent behaviors is the relationship between active and quiet periods, and the nature of the correlations. Here we investigate the dynamics of active (θ-bursts) and quiet states (δ-bursts) in brain activity during the sleep-wake cycle. We show the duality of power-law (θ, active phase) and exponential-like (δ, quiescent phase) duration distributions, typical of SOC, jointly emerge with power-law temporal correlations and anti-correlated coupling between active and quiet states. Importantly, we demonstrate that such temporal organization shares important similarities with earthquake dynamics, and propose that specific power-law correlations and coupling between active and quiet states are distinctive characteristics of a class of systems with self-organization at criticality.}, author = {Lombardi, Fabrizio and Wang, Jilin W.J.L. and Zhang, Xiyun and Ivanov, Plamen Ch}, issn = {2100-014X}, journal = {EPJ Web of Conferences}, publisher = {EDP Sciences}, title = {{Power-law correlations and coupling of active and quiet states underlie a class of complex systems with self-organization at criticality}}, doi = {10.1051/epjconf/202023000005}, volume = {230}, year = {2020}, } @inproceedings{8135, abstract = {Discrete Morse theory has recently lead to new developments in the theory of random geometric complexes. This article surveys the methods and results obtained with this new approach, and discusses some of its shortcomings. It uses simulations to illustrate the results and to form conjectures, getting numerical estimates for combinatorial, topological, and geometric properties of weighted and unweighted Delaunay mosaics, their dual Voronoi tessellations, and the Alpha and Wrap complexes contained in the mosaics.}, author = {Edelsbrunner, Herbert and Nikitenko, Anton and Ölsböck, Katharina and Synak, Peter}, booktitle = {Topological Data Analysis}, isbn = {9783030434076}, issn = {21978549}, pages = {181--218}, publisher = {Springer Nature}, title = {{Radius functions on Poisson–Delaunay mosaics and related complexes experimentally}}, doi = {10.1007/978-3-030-43408-3_8}, volume = {15}, year = {2020}, } @inbook{8173, abstract = {Understanding how the activity of membrane receptors and cellular signaling pathways shapes cell behavior is of fundamental interest in basic and applied research. Reengineering receptors to react to light instead of their cognate ligands allows for generating defined signaling inputs with high spatial and temporal precision and facilitates the dissection of complex signaling networks. Here, we describe fundamental considerations in the design of light-regulated receptor tyrosine kinases (Opto-RTKs) and appropriate control experiments. We also introduce methods for transient receptor expression in HEK293 cells, quantitative assessment of signaling activity in reporter gene assays, semiquantitative assessment of (in)activation time courses through Western blot (WB) analysis, and easy to implement light stimulation hardware.}, author = {Kainrath, Stephanie and Janovjak, Harald L}, booktitle = {Photoswitching Proteins}, editor = {Niopek, Dominik}, issn = {19406029}, pages = {233--246}, publisher = {Springer Nature}, title = {{Design and application of light-regulated receptor tyrosine kinases}}, doi = {10.1007/978-1-0716-0755-8_16}, volume = {2173}, year = {2020}, } @misc{8181, author = {Hauschild, Robert}, publisher = {IST Austria}, title = {{Amplified centrosomes in dendritic cells promote immune cell effector functions}}, doi = {10.15479/AT:ISTA:8181}, year = {2020}, } @misc{8294, abstract = {Automated root growth analysis and tracking of root tips. }, author = {Hauschild, Robert}, publisher = {IST Austria}, title = {{RGtracker}}, doi = {10.15479/AT:ISTA:8294}, year = {2020}, } @inproceedings{8322, abstract = {Reverse firewalls were introduced at Eurocrypt 2015 by Miro-nov and Stephens-Davidowitz, as a method for protecting cryptographic protocols against attacks on the devices of the honest parties. In a nutshell: a reverse firewall is placed outside of a device and its goal is to “sanitize” the messages sent by it, in such a way that a malicious device cannot leak its secrets to the outside world. It is typically assumed that the cryptographic devices are attacked in a “functionality-preserving way” (i.e. informally speaking, the functionality of the protocol remains unchanged under this attacks). In their paper, Mironov and Stephens-Davidowitz construct a protocol for passively-secure two-party computations with firewalls, leaving extension of this result to stronger models as an open question. In this paper, we address this problem by constructing a protocol for secure computation with firewalls that has two main advantages over the original protocol from Eurocrypt 2015. Firstly, it is a multiparty computation protocol (i.e. it works for an arbitrary number n of the parties, and not just for 2). Secondly, it is secure in much stronger corruption settings, namely in the active corruption model. More precisely: we consider an adversary that can fully corrupt up to 𝑛−1 parties, while the remaining parties are corrupt in a functionality-preserving way. Our core techniques are: malleable commitments and malleable non-interactive zero-knowledge, which in particular allow us to create a novel protocol for multiparty augmented coin-tossing into the well with reverse firewalls (that is based on a protocol of Lindell from Crypto 2001).}, author = {Chakraborty, Suvradip and Dziembowski, Stefan and Nielsen, Jesper Buus}, booktitle = {Advances in Cryptology – CRYPTO 2020}, isbn = {9783030568795}, issn = {16113349}, location = {Santa Barbara, CA, United States}, pages = {732--762}, publisher = {Springer Nature}, title = {{Reverse firewalls for actively secure MPCs}}, doi = {10.1007/978-3-030-56880-1_26}, volume = {12171}, year = {2020}, } @inproceedings{8339, abstract = {Discrete Gaussian distributions over lattices are central to lattice-based cryptography, and to the computational and mathematical aspects of lattices more broadly. The literature contains a wealth of useful theorems about the behavior of discrete Gaussians under convolutions and related operations. Yet despite their structural similarities, most of these theorems are formally incomparable, and their proofs tend to be monolithic and written nearly “from scratch,” making them unnecessarily hard to verify, understand, and extend. In this work we present a modular framework for analyzing linear operations on discrete Gaussian distributions. The framework abstracts away the particulars of Gaussians, and usually reduces proofs to the choice of appropriate linear transformations and elementary linear algebra. To showcase the approach, we establish several general properties of discrete Gaussians, and show how to obtain all prior convolution theorems (along with some new ones) as straightforward corollaries. As another application, we describe a self-reduction for Learning With Errors (LWE) that uses a fixed number of samples to generate an unlimited number of additional ones (having somewhat larger error). The distinguishing features of our reduction are its simple analysis in our framework, and its exclusive use of discrete Gaussians without any loss in parameters relative to a prior mixed discrete-and-continuous approach. As a contribution of independent interest, for subgaussian random matrices we prove a singular value concentration bound with explicitly stated constants, and we give tighter heuristics for specific distributions that are commonly used for generating lattice trapdoors. These bounds yield improvements in the concrete bit-security estimates for trapdoor lattice cryptosystems.}, author = {Genise, Nicholas and Micciancio, Daniele and Peikert, Chris and Walter, Michael}, booktitle = {23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography}, isbn = {9783030453732}, issn = {16113349}, location = {Edinburgh, United Kingdom}, pages = {623--651}, publisher = {Springer Nature}, title = {{Improved discrete Gaussian and subgaussian analysis for lattice cryptography}}, doi = {10.1007/978-3-030-45374-9_21}, volume = {12110}, year = {2020}, } @inproceedings{8572, abstract = {We present the results of the ARCH 2020 friendly competition for formal verification of continuous and hybrid systems with linear continuous dynamics. In its fourth edition, eight tools have been applied to solve eight different benchmark problems in the category for linear continuous dynamics (in alphabetical order): CORA, C2E2, HyDRA, Hylaa, Hylaa-Continuous, JuliaReach, SpaceEx, and XSpeed. This report is a snapshot of the current landscape of tools and the types of benchmarks they are particularly suited for. Due to the diversity of problems, we are not ranking tools, yet the presented results provide one of the most complete assessments of tools for the safety verification of continuous and hybrid systems with linear continuous dynamics up to this date.}, author = {Althoff, Matthias and Bak, Stanley and Bao, Zongnan and Forets, Marcelo and Frehse, Goran and Freire, Daniel and Kochdumper, Niklas and Li, Yangge and Mitra, Sayan and Ray, Rajarshi and Schilling, Christian and Schupp, Stefan and Wetzlinger, Mark}, booktitle = {EPiC Series in Computing}, pages = {16--48}, publisher = {EasyChair}, title = {{ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics}}, doi = {10.29007/7dt2}, volume = {74}, year = {2020}, } @inproceedings{8571, abstract = {We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2020. This year, 6 tools Ariadne, CORA, DynIbex, Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. These tools are applied to solve reachability analysis problems on six benchmark problems, two of them featuring hybrid dynamics. We do not rank the tools based on the results, but show the current status and discover the potential advantages of different tools.}, author = {Geretti, Luca and Alexandre Dit Sandretto, Julien and Althoff, Matthias and Benet, Luis and Chapoutot, Alexandre and Chen, Xin and Collins, Pieter and Forets, Marcelo and Freire, Daniel and Immler, Fabian and Kochdumper, Niklas and Sanders, David and Schilling, Christian}, booktitle = {EPiC Series in Computing}, pages = {49--75}, publisher = {EasyChair}, title = {{ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics}}, doi = {10.29007/zkf6}, volume = {74}, year = {2020}, } @inproceedings{8600, abstract = {A vector addition system with states (VASS) consists of a finite set of states and counters. A transition changes the current state to the next state, and every counter is either incremented, or decremented, or left unchanged. A state and value for each counter is a configuration; and a computation is an infinite sequence of configurations with transitions between successive configurations. A probabilistic VASS consists of a VASS along with a probability distribution over the transitions for each state. Qualitative properties such as state and configuration reachability have been widely studied for VASS. In this work we consider multi-dimensional long-run average objectives for VASS and probabilistic VASS. For a counter, the cost of a configuration is the value of the counter; and the long-run average value of a computation for the counter is the long-run average of the costs of the configurations in the computation. The multi-dimensional long-run average problem given a VASS and a threshold value for each counter, asks whether there is a computation such that for each counter the long-run average value for the counter does not exceed the respective threshold. For probabilistic VASS, instead of the existence of a computation, we consider whether the expected long-run average value for each counter does not exceed the respective threshold. Our main results are as follows: we show that the multi-dimensional long-run average problem (a) is NP-complete for integer-valued VASS; (b) is undecidable for natural-valued VASS (i.e., nonnegative counters); and (c) can be solved in polynomial time for probabilistic integer-valued VASS, and probabilistic natural-valued VASS when all computations are non-terminating.}, author = {Chatterjee, Krishnendu and Henzinger, Thomas A and Otop, Jan}, booktitle = {31st International Conference on Concurrency Theory}, isbn = {9783959771603}, issn = {18688969}, location = {Virtual}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Multi-dimensional long-run average problems for vector addition systems with states}}, doi = {10.4230/LIPIcs.CONCUR.2020.23}, volume = {171}, year = {2020}, } @inproceedings{8599, abstract = {A graph game is a two-player zero-sum game in which the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. In bidding games, both players have budgets, and in each turn, we hold an "auction" (bidding) to determine which player moves the token. In this survey, we consider several bidding mechanisms and study their effect on the properties of the game. Specifically, bidding games, and in particular bidding games of infinite duration, have an intriguing equivalence with random-turn games in which in each turn, the player who moves is chosen randomly. We show how minor changes in the bidding mechanism lead to unexpected differences in the equivalence with random-turn games.}, author = {Avni, Guy and Henzinger, Thomas A}, booktitle = {31st International Conference on Concurrency Theory}, isbn = {9783959771603}, issn = {18688969}, location = {Virtual}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{A survey of bidding games on graphs}}, doi = {10.4230/LIPIcs.CONCUR.2020.2}, volume = {171}, year = {2020}, } @inproceedings{8725, abstract = {The design and implementation of efficient concurrent data structures have seen significant attention. However, most of this work has focused on concurrent data structures providing good \emph{worst-case} guarantees. In real workloads, objects are often accessed at different rates, since access distributions may be non-uniform. Efficient distribution-adaptive data structures are known in the sequential case, e.g. the splay-trees; however, they often are hard to translate efficiently in the concurrent case. In this paper, we investigate distribution-adaptive concurrent data structures and propose a new design called the splay-list. At a high level, the splay-list is similar to a standard skip-list, with the key distinction that the height of each element adapts dynamically to its access rate: popular elements ``move up,'' whereas rarely-accessed elements decrease in height. We show that the splay-list provides order-optimal amortized complexity bounds for a subset of operations while being amenable to efficient concurrent implementation. Experimental results show that the splay-list can leverage distribution-adaptivity to improve on the performance of classic concurrent designs, and can outperform the only previously-known distribution-adaptive design in certain settings.}, author = {Aksenov, Vitaly and Alistarh, Dan-Adrian and Drozdova, Alexandra and Mohtashami, Amirkeivan}, booktitle = {34th International Symposium on Distributed Computing}, isbn = {9783959771689}, issn = {1868-8969}, location = {Freiburg, Germany}, pages = {3:1--3:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{The splay-list: A distribution-adaptive concurrent skip-list}}, doi = {10.4230/LIPIcs.DISC.2020.3}, volume = {179}, year = {2020}, } @article{8726, abstract = {Several realistic spin-orbital models for transition metal oxides go beyond the classical expectations and could be understood only by employing the quantum entanglement. Experiments on these materials confirm that spin-orbital entanglement has measurable consequences. Here, we capture the essential features of spin-orbital entanglement in complex quantum matter utilizing 1D spin-orbital model which accommodates SU(2)⊗SU(2) symmetric Kugel-Khomskii superexchange as well as the Ising on-site spin-orbit coupling. Building on the results obtained for full and effective models in the regime of strong spin-orbit coupling, we address the question whether the entanglement found on superexchange bonds always increases when the Ising spin-orbit coupling is added. We show that (i) quantum entanglement is amplified by strong spin-orbit coupling and, surprisingly, (ii) almost classical disentangled states are possible. We complete the latter case by analyzing how the entanglement existing for intermediate values of spin-orbit coupling can disappear for higher values of this coupling.}, author = {Gotfryd, Dorota and Paerschke, Ekaterina and Wohlfeld, Krzysztof and Oleś, Andrzej M.}, issn = {2410-3896}, journal = {Condensed Matter}, number = {3}, publisher = {MDPI}, title = {{Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling}}, doi = {10.3390/condmat5030053}, volume = {5}, year = {2020}, } @inproceedings{9040, abstract = {Machine learning and formal methods have complimentary benefits and drawbacks. In this work, we address the controller-design problem with a combination of techniques from both fields. The use of black-box neural networks in deep reinforcement learning (deep RL) poses a challenge for such a combination. Instead of reasoning formally about the output of deep RL, which we call the wizard, we extract from it a decision-tree based model, which we refer to as the magic book. Using the extracted model as an intermediary, we are able to handle problems that are infeasible for either deep RL or formal methods by themselves. First, we suggest, for the first time, a synthesis procedure that is based on a magic book. We synthesize a stand-alone correct-by-design controller that enjoys the favorable performance of RL. Second, we incorporate a magic book in a bounded model checking (BMC) procedure. BMC allows us to find numerous traces of the plant under the control of the wizard, which a user can use to increase the trustworthiness of the wizard and direct further training.}, author = {Alamdari, Par Alizadeh and Avni, Guy and Henzinger, Thomas A and Lukina, Anna}, booktitle = {Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design}, isbn = {9783854480426}, issn = {2708-7824}, location = {Online Conference}, pages = {138--147}, publisher = {TU Wien Academic Press}, title = {{Formal methods with a touch of magic}}, doi = {10.34727/2020/isbn.978-3-85448-042-6_21}, year = {2020}, } @inbook{9096, author = {Schmid-Hempel, Paul and Cremer, Sylvia M}, booktitle = {Encyclopedia of Social Insects}, editor = {Starr, C}, isbn = {9783319903064}, publisher = {Springer Nature}, title = {{Parasites and Pathogens}}, doi = {10.1007/978-3-319-90306-4_94-1}, year = {2020}, } @inbook{9123, abstract = {Inversions are chromosomal rearrangements where the order of genes is reversed. Inversions originate by mutation and can be under positive, negative or balancing selection. Selective effects result from potential disruptive effects on meiosis, gene disruption at inversion breakpoints and, importantly, the effects of inversions as modifiers of recombination rate: Recombination is strongly reduced in individuals heterozygous for an inversion, allowing for alleles at different loci to be inherited as a ‘block’. This may lead to a selective advantage whenever it is favourable to keep certain combinations of alleles associated, for example under local adaptation with gene flow. Inversions can cover a considerable part of a chromosome and contain numerous loci under different selection pressures, so that the resulting overall effects may be complex. Empirical data from various systems show that inversions may have a prominent role in local adaptation, speciation, parallel evolution, the maintenance of polymorphism and sex chromosome evolution.}, author = {Westram, Anja M and Faria, Rui and Butlin, Roger and Johannesson, Kerstin}, booktitle = {eLS}, isbn = {9780470016176}, publisher = {Wiley}, title = {{Inversions and Evolution}}, doi = {10.1002/9780470015902.a0029007}, year = {2020}, } @article{9249, abstract = {Rhombic dodecahedron is a space filling polyhedron which represents the close packing of spheres in 3D space and the Voronoi structures of the face centered cubic (FCC) lattice. In this paper, we describe a new coordinate system where every 3-integer coordinates grid point corresponds to a rhombic dodecahedron centroid. In order to illustrate the interest of the new coordinate system, we propose the characterization of 3D digital plane with its topological features, such as the interrelation between the thickness of the digital plane and the separability constraint we aim to obtain. We also present the characterization of 3D digital lines and study it as the intersection of multiple digital planes. Characterization of 3D digital sphere with relevant topological features is proposed as well along with the 48-symmetry appearing in the new coordinate system.}, author = {Biswas, Ranita and Largeteau-Skapin, Gaëlle and Zrour, Rita and Andres, Eric}, issn = {2353-3390}, journal = {Mathematical Morphology - Theory and Applications}, number = {1}, pages = {143--158}, publisher = {De Gruyter}, title = {{Digital objects in rhombic dodecahedron grid}}, doi = {10.1515/mathm-2020-0106}, volume = {4}, year = {2020}, } @inproceedings{9299, abstract = {We call a multigraph non-homotopic if it can be drawn in the plane in such a way that no two edges connecting the same pair of vertices can be continuously transformed into each other without passing through a vertex, and no loop can be shrunk to its end-vertex in the same way. It is easy to see that a non-homotopic multigraph on n>1 vertices can have arbitrarily many edges. We prove that the number of crossings between the edges of a non-homotopic multigraph with n vertices and m>4n edges is larger than cm2n for some constant c>0 , and that this bound is tight up to a polylogarithmic factor. We also show that the lower bound is not asymptotically sharp as n is fixed and m⟶∞ .}, author = {Pach, János and Tardos, Gábor and Tóth, Géza}, booktitle = {28th International Symposium on Graph Drawing and Network Visualization}, isbn = {9783030687656}, issn = {1611-3349}, location = {Virtual, Online}, pages = {359--371}, publisher = {Springer Nature}, title = {{Crossings between non-homotopic edges}}, doi = {10.1007/978-3-030-68766-3_28}, volume = {12590}, year = {2020}, } @inproceedings{9632, abstract = {Second-order information, in the form of Hessian- or Inverse-Hessian-vector products, is a fundamental tool for solving optimization problems. Recently, there has been significant interest in utilizing this information in the context of deep neural networks; however, relatively little is known about the quality of existing approximations in this context. Our work examines this question, identifies issues with existing approaches, and proposes a method called WoodFisher to compute a faithful and efficient estimate of the inverse Hessian. Our main application is to neural network compression, where we build on the classic Optimal Brain Damage/Surgeon framework. We demonstrate that WoodFisher significantly outperforms popular state-of-the-art methods for oneshot pruning. Further, even when iterative, gradual pruning is allowed, our method results in a gain in test accuracy over the state-of-the-art approaches, for standard image classification datasets such as ImageNet ILSVRC. We examine how our method can be extended to take into account first-order information, as well as illustrate its ability to automatically set layer-wise pruning thresholds and perform compression in the limited-data regime. The code is available at the following link, https://github.com/IST-DASLab/WoodFisher.}, author = {Singh, Sidak Pal and Alistarh, Dan-Adrian}, booktitle = {Advances in Neural Information Processing Systems}, isbn = {9781713829546}, issn = {10495258}, location = {Vancouver, Canada}, pages = {18098--18109}, publisher = {Curran Associates}, title = {{WoodFisher: Efficient second-order approximation for neural network compression}}, volume = {33}, year = {2020}, }