@misc{6062, abstract = {Open the files in Jupyter Notebook (reccomended https://www.anaconda.com/distribution/#download-section with Python 3.7).}, author = {Nardin, Michele}, publisher = {Institute of Science and Technology Austria}, title = {{Supplementary Code and Data for the paper "The Entorhinal Cognitive Map is Attracted to Goals"}}, doi = {10.15479/AT:ISTA:6062}, year = {2019}, } @article{6089, abstract = {Pleiotropy is the well-established idea that a single mutation affects multiple phenotypes. If a mutation has opposite effects on fitness when expressed in different contexts, then genetic conflict arises. Pleiotropic conflict is expected to reduce the efficacy of selection by limiting the fixation of beneficial mutations through adaptation, and the removal of deleterious mutations through purifying selection. Although this has been widely discussed, in particular in the context of a putative “gender load,” it has yet to be systematically quantified. In this work, we empirically estimate to which extent different pleiotropic regimes impede the efficacy of selection in Drosophila melanogaster. We use whole-genome polymorphism data from a single African population and divergence data from D. simulans to estimate the fraction of adaptive fixations (α), the rate of adaptation (ωA), and the direction of selection (DoS). After controlling for confounding covariates, we find that the different pleiotropic regimes have a relatively small, but significant, effect on selection efficacy. Specifically, our results suggest that pleiotropic sexual antagonism may restrict the efficacy of selection, but that this conflict can be resolved by limiting the expression of genes to the sex where they are beneficial. Intermediate levels of pleiotropy across tissues and life stages can also lead to maladaptation in D. melanogaster, due to inefficient purifying selection combined with low frequency of mutations that confer a selective advantage. Thus, our study highlights the need to consider the efficacy of selection in the context of antagonistic pleiotropy, and of genetic conflict in general.}, author = {Fraisse, Christelle and Puixeu Sala, Gemma and Vicoso, Beatriz}, issn = {1537-1719}, journal = {Molecular biology and evolution}, number = {3}, pages = {500--515}, publisher = {Oxford University Press}, title = {{Pleiotropy modulates the efficacy of selection in drosophila melanogaster}}, doi = {10.1093/molbev/msy246}, volume = {36}, year = {2019}, } @phdthesis{6179, abstract = {In the first part of this thesis we consider large random matrices with arbitrary expectation and a general slowly decaying correlation among its entries. We prove universality of the local eigenvalue statistics and optimal local laws for the resolvent in the bulk and edge regime. The main novel tool is a systematic diagrammatic control of a multivariate cumulant expansion. In the second part we consider Wigner-type matrices and show that at any cusp singularity of the limiting eigenvalue distribution the local eigenvalue statistics are uni- versal and form a Pearcey process. Since the density of states typically exhibits only square root or cubic root cusp singularities, our work complements previous results on the bulk and edge universality and it thus completes the resolution of the Wigner- Dyson-Mehta universality conjecture for the last remaining universality type. Our analysis holds not only for exact cusps, but approximate cusps as well, where an ex- tended Pearcey process emerges. As a main technical ingredient we prove an optimal local law at the cusp, and extend the fast relaxation to equilibrium of the Dyson Brow- nian motion to the cusp regime. In the third and final part we explore the entrywise linear statistics of Wigner ma- trices and identify the fluctuations for a large class of test functions with little regularity. This enables us to study the rectangular Young diagram obtained from the interlacing eigenvalues of the random matrix and its minor, and we find that, despite having the same limit, the fluctuations differ from those of the algebraic Young tableaux equipped with the Plancharel measure.}, author = {Schröder, Dominik J}, issn = {2663-337X}, pages = {375}, publisher = {Institute of Science and Technology Austria}, title = {{From Dyson to Pearcey: Universal statistics in random matrix theory}}, doi = {10.15479/AT:ISTA:th6179}, year = {2019}, } @inproceedings{6482, abstract = {Computer vision systems for automatic image categorization have become accurate and reliable enough that they can run continuously for days or even years as components of real-world commercial applications. A major open problem in this context, however, is quality control. Good classification performance can only be expected if systems run under the specific conditions, in particular data distributions, that they were trained for. Surprisingly, none of the currently used deep network architectures have a built-in functionality that could detect if a network operates on data from a distribution it was not trained for, such that potentially a warning to the human users could be triggered. In this work, we describe KS(conf), a procedure for detecting such outside of specifications (out-of-specs) operation, based on statistical testing of the network outputs. We show by extensive experiments using the ImageNet, AwA2 and DAVIS datasets on a variety of ConvNets architectures that KS(conf) reliably detects out-of-specs situations. It furthermore has a number of properties that make it a promising candidate for practical deployment: it is easy to implement, adds almost no overhead to the system, works with all networks, including pretrained ones, and requires no a priori knowledge of how the data distribution could change. }, author = {Sun, Rémy and Lampert, Christoph}, isbn = {9783030129385}, issn = {1611-3349}, location = {Stuttgart, Germany}, pages = {244--259}, publisher = {Springer Nature}, title = {{KS(conf): A light-weight test if a ConvNet operates outside of Its specifications}}, doi = {10.1007/978-3-030-12939-2_18}, volume = {11269}, year = {2019}, } @inproceedings{6642, abstract = {We present a thermodynamically based approach to the design of models for viscoelastic fluids with stress diffusion effect. In particular, we show how to add a stress diffusion term to some standard viscoelastic rate-type models (Giesekus, FENE-P, Johnson–Segalman, Phan-Thien–Tanner and Bautista–Manero–Puig) so that the resulting models with the added stress diffusion term are thermodynamically consistent in the sense that they obey the first and the second law of thermodynamics. We point out the potential applications of the provided thermodynamical background in the study of flows of fluids described by the proposed models.}, author = {Dostalík, Mark and Pruša, Vít and Skrivan, Tomas}, booktitle = {AIP Conference Proceedings}, location = {Zlin, Czech Republic}, publisher = {AIP Publishing}, title = {{On diffusive variants of some classical viscoelastic rate-type models}}, doi = {10.1063/1.5109493}, volume = {2107}, year = {2019}, } @article{7226, author = {Jaksic, Vojkan and Seiringer, Robert}, issn = {00222488}, journal = {Journal of Mathematical Physics}, number = {12}, publisher = {AIP Publishing}, title = {{Introduction to the Special Collection: International Congress on Mathematical Physics (ICMP) 2018}}, doi = {10.1063/1.5138135}, volume = {60}, year = {2019}, } @article{7190, abstract = {We investigate the ground-state energy of a one-dimensional Fermi gas with two bosonic impurities. We consider spinless fermions with no fermion-fermion interactions. The fermion-impurity and impurity-impurity interactions are modeled with Dirac delta functions. First, we study the case where impurity and fermion have equal masses, and the impurity-impurity two-body interaction is identical to the fermion-impurity interaction, such that the system is solvable with the Bethe ansatz. For attractive interactions, we find that the energy of the impurity-impurity subsystem is below the energy of the bound state that exists without the Fermi gas. We interpret this as a manifestation of attractive boson-boson interactions induced by the fermionic medium, and refer to the impurity-impurity subsystem as an in-medium bound state. For repulsive interactions, we find no in-medium bound states. Second, we construct an effective model to describe these interactions, and compare its predictions to the exact solution. We use this effective model to study nonintegrable systems with unequal masses and/or potentials. We discuss parameter regimes for which impurity-impurity attraction induced by the Fermi gas can lead to the formation of in-medium bound states made of bosons that repel each other in the absence of the Fermi gas.}, author = {Huber, D. and Hammer, H.-W. and Volosniev, Artem}, issn = {2643-1564}, journal = {Physical Review Research}, number = {3}, publisher = {American Physical Society}, title = {{In-medium bound states of two bosonic impurities in a one-dimensional Fermi gas}}, doi = {10.1103/physrevresearch.1.033177}, volume = {1}, year = {2019}, } @article{6575, abstract = {Motivated by recent experimental observations of coherent many-body revivals in a constrained Rydbergatom chain, we construct a weak quasilocal deformation of the Rydberg-blockaded Hamiltonian, whichmakes the revivals virtually perfect. Our analysis suggests the existence of an underlying nonintegrableHamiltonian which supports an emergent SU(2)-spin dynamics within a small subspace of the many-bodyHilbert space. We show that such perfect dynamics necessitates the existence of atypical, nonergodicenergy eigenstates—quantum many-body scars. Furthermore, using these insights, we construct a toymodel that hosts exact quantum many-body scars, providing an intuitive explanation of their origin. Ourresults offer specific routes to enhancing coherent many-body revivals and provide a step towardestablishing the stability of quantum many-body scars in the thermodynamic limit.}, author = {Choi, Soonwon and Turner, Christopher J. and Pichler, Hannes and Ho, Wen Wei and Michailidis, Alexios and Papić, Zlatko and Serbyn, Maksym and Lukin, Mikhail D. and Abanin, Dmitry A.}, issn = {10797114}, journal = {Physical Review Letters}, number = {22}, publisher = {American Physical Society}, title = {{Emergent SU(2) dynamics and perfect quantum many-body scars}}, doi = {10.1103/PhysRevLett.122.220603}, volume = {122}, year = {2019}, } @article{6092, abstract = {In 1915, Einstein and de Haas and Barnett demonstrated that changing the magnetization of a magnetic material results in mechanical rotation and vice versa. At the microscopic level, this effect governs the transfer between electron spin and orbital angular momentum, and lattice degrees of freedom, understanding which is key for molecular magnets, nano-magneto-mechanics, spintronics, and ultrafast magnetism. Until now, the timescales of electron-to-lattice angular momentum transfer remain unclear, since modeling this process on a microscopic level requires the addition of an infinite amount of quantum angular momenta. We show that this problem can be solved by reformulating it in terms of the recently discovered angulon quasiparticles, which results in a rotationally invariant quantum many-body theory. In particular, we demonstrate that nonperturbative effects take place even if the electron-phonon coupling is weak and give rise to angular momentum transfer on femtosecond timescales.}, author = {Mentink, Johann H and Katsnelson, Mikhail and Lemeshko, Mikhail}, journal = {Physical Review B}, number = {6}, publisher = {American Physical Society}, title = {{Quantum many-body dynamics of the Einstein-de Haas effect}}, doi = {10.1103/PhysRevB.99.064428}, volume = {99}, year = {2019}, } @article{6090, abstract = {Cells need to reliably sense external ligand concentrations to achieve various biological functions such as chemotaxis or signaling. The molecular recognition of ligands by surface receptors is degenerate in many systems, leading to crosstalk between ligand-receptor pairs. Crosstalk is often thought of as a deviation from optimal specific recognition, as the binding of noncognate ligands can interfere with the detection of the receptor's cognate ligand, possibly leading to a false triggering of a downstream signaling pathway. Here we quantify the optimal precision of sensing the concentrations of multiple ligands by a collection of promiscuous receptors. We demonstrate that crosstalk can improve precision in concentration sensing and discrimination tasks. To achieve superior precision, the additional information about ligand concentrations contained in short binding events of the noncognate ligand should be exploited. We present a proofreading scheme to realize an approximate estimation of multiple ligand concentrations that reaches a precision close to the derived optimal bounds. Our results help rationalize the observed ubiquity of receptor crosstalk in molecular sensing.}, author = {Carballo-Pacheco, Martín and Desponds, Jonathan and Gavrilchenko, Tatyana and Mayer, Andreas and Prizak, Roshan and Reddy, Gautam and Nemenman, Ilya and Mora, Thierry}, journal = {Physical Review E}, number = {2}, publisher = {American Physical Society}, title = {{Receptor crosstalk improves concentration sensing of multiple ligands}}, doi = {10.1103/PhysRevE.99.022423}, volume = {99}, year = {2019}, } @article{6786, abstract = {Dipolar coupling plays a fundamental role in the interaction between electrically or magnetically polarized species such as magnetic atoms and dipolar molecules in a gas or dipolar excitons in the solid state. Unlike Coulomb or contactlike interactions found in many atomic, molecular, and condensed-matter systems, this interaction is long-ranged and highly anisotropic, as it changes from repulsive to attractive depending on the relative positions and orientation of the dipoles. Because of this unique property, many exotic, symmetry-breaking collective states have been recently predicted for cold dipolar gases, but only a few have been experimentally detected and only in dilute atomic dipolar Bose-Einstein condensates. Here, we report on the first observation of attractive dipolar coupling between excitonic dipoles using a new design of stacked semiconductor bilayers. We show that the presence of a dipolar exciton fluid in one bilayer modifies the spatial distribution and increases the binding energy of excitonic dipoles in a vertically remote layer. The binding energy changes are explained using a many-body polaron model describing the deformation of the exciton cloud due to its interaction with a remote dipolar exciton. The surprising nonmonotonic dependence on the cloud density indicates the important role of dipolar correlations, which is unique to dense, strongly interacting dipolar solid-state systems. Our concept provides a route for the realization of dipolar lattices with strong anisotropic interactions in semiconductor systems, which open the way for the observation of theoretically predicted new and exotic collective phases, as well as for engineering and sensing their collective excitations.}, author = {Hubert, Colin and Baruchi, Yifat and Mazuz-Harpaz, Yotam and Cohen, Kobi and Biermann, Klaus and Lemeshko, Mikhail and West, Ken and Pfeiffer, Loren and Rapaport, Ronen and Santos, Paulo}, issn = {2160-3308}, journal = {Physical Review X}, number = {2}, publisher = {American Physical Society}, title = {{Attractive dipolar coupling between stacked exciton fluids}}, doi = {10.1103/PhysRevX.9.021026}, volume = {9}, year = {2019}, } @article{7013, abstract = {Chains of superconducting circuit devices provide a natural platform for studies of synthetic bosonic quantum matter. Motivated by the recent experimental progress in realizing disordered and interacting chains of superconducting transmon devices, we study the bosonic many-body localization phase transition using the methods of exact diagonalization as well as matrix product state dynamics. We estimate the location of transition separating the ergodic and the many-body localized phases as a function of the disorder strength and the many-body on-site interaction strength. The main difference between the bosonic model realized by superconducting circuits and similar fermionic model is that the effect of the on-site interaction is stronger due to the possibility of multiple excitations occupying the same site. The phase transition is found to be robust upon including longer-range hopping and interaction terms present in the experiments. Furthermore, we calculate experimentally relevant local observables and show that their temporal fluctuations can be used to distinguish between the dynamics of Anderson insulator, many-body localization, and delocalized phases. While we consider unitary dynamics, neglecting the effects of dissipation, decoherence, and measurement back action, the timescales on which the dynamics is unitary are sufficient for observation of characteristic dynamics in the many-body localized phase. Moreover, the experimentally available disorder strength and interactions allow for tuning the many-body localization phase transition, thus making the arrays of superconducting circuit devices a promising platform for exploring localization physics and phase transition.}, author = {Orell, Tuure and Michailidis, Alexios and Serbyn, Maksym and Silveri, Matti}, issn = {2469-9969}, journal = {Physical Review B}, number = {13}, publisher = {American Physical Society}, title = {{Probing the many-body localization phase transition with superconducting circuits}}, doi = {10.1103/physrevb.100.134504}, volume = {100}, year = {2019}, } @article{7200, abstract = {Recent scanning tunneling microscopy experiments in NbN thin disordered superconducting films found an emergent inhomogeneity at the scale of tens of nanometers. This inhomogeneity is mirrored by an apparent dimensional crossover in the paraconductivity measured in transport above the superconducting critical temperature Tc. This behavior was interpreted in terms of an anomalous diffusion of fluctuating Cooper pairs that display a quasiconfinement (i.e., a slowing down of their diffusive dynamics) on length scales shorter than the inhomogeneity identified by tunneling experiments. Here, we assume this anomalous diffusive behavior of fluctuating Cooper pairs and calculate the effect of these fluctuations on the electron density of states above Tc. We find that the density of states is substantially suppressed up to temperatures well above Tc. This behavior, which is closely reminiscent of a pseudogap, only arises from the anomalous diffusion of fluctuating Cooper pairs in the absence of stable preformed pairs, setting the stage for an intermediate behavior between the two common paradigms in the superconducting-insulator transition, namely, the localization of Cooper pairs (the so-called bosonic scenario) and the breaking of Cooper pairs into unpaired electrons due to strong disorder (the so-called fermionic scenario).}, author = {Brighi, Pietro and Grilli, Marco and Leridon, Brigitte and Caprara, Sergio}, issn = {2469-9969}, journal = {Physical Review B}, number = {17}, publisher = {American Physical Society}, title = {{Effect of anomalous diffusion of fluctuating Cooper pairs on the density of states of superconducting NbN thin films}}, doi = {10.1103/PhysRevB.100.174518}, volume = {100}, year = {2019}, } @article{6779, abstract = {Recent studies suggest that unstable recurrent solutions of the Navier-Stokes equation provide new insights into dynamics of turbulent flows. In this study, we compute an extensive network of dynamical connections between such solutions in a weakly turbulent quasi-two-dimensional Kolmogorov flow that lies in the inversion symmetric subspace. In particular, we find numerous isolated heteroclinic connections between different types of solutions—equilibria, periodic, and quasiperiodic orbits—as well as continua of connections forming higher-dimensional connecting manifolds. We also compute a homoclinic connection of a periodic orbit and provide strong evidence that the associated homoclinic tangle forms the chaotic repeller that underpins transient turbulence in the symmetric subspace.}, author = {Suri, Balachandra and Pallantla, Ravi Kumar and Schatz, Michael F. and Grigoriev, Roman O.}, issn = {2470-0053}, journal = {Physical Review E}, number = {1}, publisher = {American Physical Society}, title = {{Heteroclinic and homoclinic connections in a Kolmogorov-like flow}}, doi = {10.1103/physreve.100.013112}, volume = {100}, year = {2019}, } @article{7015, abstract = {We modify the "floating crystal" trial state for the classical homogeneous electron gas (also known as jellium), in order to suppress the boundary charge fluctuations that are known to lead to a macroscopic increase of the energy. The argument is to melt a thin layer of the crystal close to the boundary and consequently replace it by an incompressible fluid. With the aid of this trial state we show that three different definitions of the ground-state energy of jellium coincide. In the first point of view the electrons are placed in a neutralizing uniform background. In the second definition there is no background but the electrons are submitted to the constraint that their density is constant, as is appropriate in density functional theory. Finally, in the third system each electron interacts with a periodic image of itself; that is, periodic boundary conditions are imposed on the interaction potential.}, author = {Lewin, Mathieu and Lieb, Elliott H. and Seiringer, Robert}, issn = {2469-9969}, journal = {Physical Review B}, number = {3}, publisher = {American Physical Society}, title = {{Floating Wigner crystal with no boundary charge fluctuations}}, doi = {10.1103/physrevb.100.035127}, volume = {100}, year = {2019}, } @article{7145, abstract = {End-to-end correlated bound states are investigated in superconductor-semiconductor hybrid nanowires at zero magnetic field. Peaks in subgap conductance are independently identified from each wire end, and a cross-correlation function is computed that counts end-to-end coincidences, averaging over thousands of subgap features. Strong correlations in a short, 300-nm device are reduced by a factor of 4 in a long, 900-nm device. In addition, subgap conductance distributions are investigated, and correlations between the left and right distributions are identified based on their mutual information.}, author = {Anselmetti, G. L. R. and Martinez, E. A. and Ménard, G. C. and Puglia, D. and Malinowski, F. K. and Lee, J. S. and Choi, S. and Pendharkar, M. and Palmstrøm, C. J. and Marcus, C. M. and Casparis, L. and Higginbotham, Andrew P}, issn = {2469-9969}, journal = {Physical Review B}, number = {20}, publisher = {American Physical Society}, title = {{End-to-end correlated subgap states in hybrid nanowires}}, doi = {10.1103/physrevb.100.205412}, volume = {100}, year = {2019}, } @article{5906, abstract = {We introduce a simple, exactly solvable strong-randomness renormalization group (RG) model for the many-body localization (MBL) transition in one dimension. Our approach relies on a family of RG flows parametrized by the asymmetry between thermal and localized phases. We identify the physical MBL transition in the limit of maximal asymmetry, reflecting the instability of MBL against rare thermal inclusions. We find a critical point that is localized with power-law distributed thermal inclusions. The typical size of critical inclusions remains finite at the transition, while the average size is logarithmically diverging. We propose a two-parameter scaling theory for the many-body localization transition that falls into the Kosterlitz-Thouless universality class, with the MBL phase corresponding to a stable line of fixed points with multifractal behavior.}, author = {Goremykina, Anna and Vasseur, Romain and Serbyn, Maksym}, issn = {1079-7114}, journal = {Physical Review Letters}, number = {4}, publisher = {American Physical Society}, title = {{Analytically solvable renormalization group for the many-body localization transition}}, doi = {10.1103/physrevlett.122.040601}, volume = {122}, year = {2019}, } @article{6632, abstract = {We consider a two-component Bose gas in two dimensions at a low temperature with short-range repulsive interaction. In the coexistence phase where both components are superfluid, interspecies interactions induce a nondissipative drag between the two superfluid flows (Andreev-Bashkin effect). We show that this behavior leads to a modification of the usual Berezinskii-Kosterlitz-Thouless (BKT) transition in two dimensions. We extend the renormalization of the superfluid densities at finite temperature using the renormalization-group approach and find that the vortices of one component have a large influence on the superfluid properties of the other, mediated by the nondissipative drag. The extended BKT flow equations indicate that the occurrence of the vortex unbinding transition in one of the components can induce the breakdown of superfluidity also in the other, leading to a locking phenomenon for the critical temperatures of the two gases.}, author = {Karle, Volker and Defenu, Nicolò and Enss, Tilman}, issn = {24699934}, journal = {Physical Review A}, number = {6}, publisher = {American Physical Society}, title = {{Coupled superfluidity of binary Bose mixtures in two dimensions}}, doi = {10.1103/PhysRevA.99.063627}, volume = {99}, year = {2019}, } @article{7396, abstract = {The angular momentum of molecules, or, equivalently, their rotation in three-dimensional space, is ideally suited for quantum control. Molecular angular momentum is naturally quantized, time evolution is governed by a well-known Hamiltonian with only a few accurately known parameters, and transitions between rotational levels can be driven by external fields from various parts of the electromagnetic spectrum. Control over the rotational motion can be exerted in one-, two-, and many-body scenarios, thereby allowing one to probe Anderson localization, target stereoselectivity of bimolecular reactions, or encode quantum information to name just a few examples. The corresponding approaches to quantum control are pursued within separate, and typically disjoint, subfields of physics, including ultrafast science, cold collisions, ultracold gases, quantum information science, and condensed-matter physics. It is the purpose of this review to present the various control phenomena, which all rely on the same underlying physics, within a unified framework. To this end, recall the Hamiltonian for free rotations, assuming the rigid rotor approximation to be valid, and summarize the different ways for a rotor to interact with external electromagnetic fields. These interactions can be exploited for control—from achieving alignment, orientation, or laser cooling in a one-body framework, steering bimolecular collisions, or realizing a quantum computer or quantum simulator in the many-body setting.}, author = {Koch, Christiane P. and Lemeshko, Mikhail and Sugny, Dominique}, issn = {1539-0756}, journal = {Reviews of Modern Physics}, number = {3}, publisher = {American Physical Society}, title = {{Quantum control of molecular rotation}}, doi = {10.1103/revmodphys.91.035005}, volume = {91}, year = {2019}, } @inproceedings{7606, abstract = {We derive a tight lower bound on equivocation (conditional entropy), or equivalently a tight upper bound on mutual information between a signal variable and channel outputs. The bound is in terms of the joint distribution of the signals and maximum a posteriori decodes (most probable signals given channel output). As part of our derivation, we describe the key properties of the distribution of signals, channel outputs and decodes, that minimizes equivocation and maximizes mutual information. This work addresses a problem in data analysis, where mutual information between signals and decodes is sometimes used to lower bound the mutual information between signals and channel outputs. Our result provides a corresponding upper bound.}, author = {Hledik, Michal and Sokolowski, Thomas R and Tkačik, Gašper}, booktitle = {IEEE Information Theory Workshop, ITW 2019}, isbn = {9781538669006}, location = {Visby, Sweden}, publisher = {IEEE}, title = {{A tight upper bound on mutual information}}, doi = {10.1109/ITW44776.2019.8989292}, year = {2019}, } @inproceedings{6933, 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 problem in O(log²n / ε) 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 problem from O(√n) sources in O(log² n / ε) 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 Õ(n^{1/6}) rounds.}, author = {Censor-Hillel, Keren and Dory, Michal and Korhonen, Janne and Leitersdorf, Dean}, booktitle = {Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin}, isbn = {9781450362177}, location = {Toronto, ON, Canada}, pages = {74--83}, publisher = {ACM}, title = {{Fast approximate shortest paths in the congested clique}}, doi = {10.1145/3293611.3331633}, year = {2019}, } @phdthesis{6392, abstract = {The regulation of gene expression is one of the most fundamental processes in living systems. In recent years, thanks to advances in sequencing technology and automation, it has become possible to study gene expression quantitatively, genome-wide and in high-throughput. This leads to the possibility of exploring changes in gene expression in the context of many external perturbations and their combinations, and thus of characterising the basic principles governing gene regulation. In this thesis, I present quantitative experimental approaches to studying transcriptional and protein level changes in response to combinatorial drug treatment, as well as a theoretical data-driven approach to analysing thermodynamic principles guiding transcription of protein coding genes. In the first part of this work, I present a novel methodological framework for quantifying gene expression changes in drug combinations, termed isogrowth profiling. External perturbations through small molecule drugs influence the growth rate of the cell, leading to wide-ranging changes in cellular physiology and gene expression. This confounds the gene expression changes specifically elicited by the particular drug. Combinatorial perturbations, owing to the increased stress they exert, influence the growth rate even more strongly and hence suffer the convolution problem to a greater extent when measuring gene expression changes. Isogrowth profiling is a way to experimentally abstract non-specific, growth rate related changes, by performing the measurement using varying ratios of two drugs at such concentrations that the overall inhibition rate is constant. Using a robotic setup for automated high-throughput re-dilution culture of Saccharomyces cerevisiae, the budding yeast, I investigate all pairwise interactions of four small molecule drugs through sequencing RNA along a growth isobole. Through principal component analysis, I demonstrate here that isogrowth profiling can uncover drug-specific as well as drug-interaction-specific gene expression changes. I show that drug-interaction-specific gene expression changes can be used for prediction of higher-order drug interactions. I propose a simplified generalised framework of isogrowth profiling, with few measurements needed for each drug pair, enabling the broad application of isogrowth profiling to high-throughput screening of inhibitors of cellular growth and beyond. Such high-throughput screenings of gene expression changes specific to pairwise drug interactions will be instrumental for predicting the higher-order interactions of the drugs. In the second part of this work, I extend isogrowth profiling to single-cell measurements of gene expression, characterising population heterogeneity in the budding yeast in response to combinatorial drug perturbation while controlling for non-specific growth rate effects. Through flow cytometry of strains with protein products fused to green fluorescent protein, I discover multiple proteins with bi-modally distributed expression levels in the population in response to drug treatment. I characterize more closely the effect of an ionic stressor, lithium chloride, and find that it inhibits the splicing of mRNA, most strongly affecting ribosomal protein transcripts and leading to a bi-stable behaviour of a small ribosomal subunit protein Rps22B. Time-lapse microscopy of a microfluidic culture system revealed that the induced Rps22B heterogeneity leads to preferential survival of Rps22B-low cells after long starvation, but to preferential proliferation of Rps22B-high cells after short starvation. Overall, this suggests that yeast cells might use splicing of ribosomal genes for bet-hedging in fluctuating environments. I give specific examples of how further exploration of cellular heterogeneity in yeast in response to external perturbation has the potential to reveal yet-undiscovered gene regulation circuitry. In the last part of this thesis, a re-analysis of a published sequencing dataset of nascent elongating transcripts is used to characterise the thermodynamic constraints for RNA polymerase II (RNAP) elongation. Population-level data on RNAP position throughout the transcribed genome with single nucleotide resolution are used to infer the sequence specific thermodynamic determinants of RNAP pausing and backtracking. This analysis reveals that the basepairing strength of the eight nucleotide-long RNA:DNA duplex relative to the basepairing strength of the same sequence when in DNA:DNA duplex, and the change in this quantity during RNA polymerase movement, is the key determinant of RNAP pausing. This is true for RNAP pausing while elongating, but also of RNAP pausing while backtracking and of the backtracking length. The quantitative dependence of RNAP pausing on basepairing energetics is used to infer the increase in pausing due to transcriptional mismatches, leading to a hypothesis that pervasive RNA polymerase II pausing is due to basepairing energetics, as an evolutionary cost for increased RNA polymerase II fidelity. This work advances our understanding of the general principles governing gene expression, with the goal of making computational predictions of single-cell gene expression responses to combinatorial perturbations based on the individual perturbations possible. This ability would substantially facilitate the design of drug combination treatments and, in the long term, lead to our increased ability to more generally design targeted manipulations to any biological system. }, author = {Lukacisin, Martin}, isbn = {978-3-99078-001-5}, issn = {2663-337X}, pages = {103}, publisher = {IST Austria}, title = {{Quantitative investigation of gene expression principles through combinatorial drug perturbation and theory}}, doi = {10.15479/AT:ISTA:6392}, year = {2019}, } @phdthesis{6435, abstract = {Social insect colonies tend to have numerous members which function together like a single organism in such harmony that the term ``super-organism'' is often used. In this analogy the reproductive caste is analogous to the primordial germ cells of a metazoan, while the sterile worker caste corresponds to somatic cells. The worker castes, like tissues, are in charge of all functions of a living being, besides reproduction. The establishment of new super-organismal units (i.e. new colonies) is accomplished by the co-dependent castes. The term oftentimes goes beyond a metaphor. We invoke it when we speak about the metabolic rate, thermoregulation, nutrient regulation and gas exchange of a social insect colony. Furthermore, we assert that the super-organism has an immune system, and benefits from ``social immunity''. Social immunity was first summoned by evolutionary biologists to resolve the apparent discrepancy between the expected high frequency of disease outbreak amongst numerous, closely related tightly-interacting hosts, living in stable and microbially-rich environments, against the exceptionally scarce epidemic accounts in natural populations. Social immunity comprises a multi-layer assembly of behaviours which have evolved to effectively keep the pathogenic enemies of a colony at bay. The field of social immunity has drawn interest, as it becomes increasingly urgent to stop the collapse of pollinator species and curb the growth of invasive pests. In the past decade, several mechanisms of social immune responses have been dissected, but many more questions remain open. I present my work in two experimental chapters. In the first, I use invasive garden ants (*Lasius neglectus*) to study how pathogen load and its distribution among nestmates affect the grooming response of the group. Any given group of ants will carry out the same total grooming work, but will direct their grooming effort towards individuals carrying a relatively higher spore load. Contrary to expectation, the highest risk of transmission does not stem from grooming highly contaminated ants, but instead, we suggest that the grooming response likely minimizes spore loss to the environment, reducing contamination from inadvertent pickup from the substrate. The second is a comparative developmental approach. I follow black garden ant queens (*Lasius niger*) and their colonies from mating flight, through hibernation for a year. Colonies which grow fast from the start, have a lower chance of survival through hibernation, and those which survive grow at a lower pace later. This is true for colonies of naive and challenged queens. Early pathogen exposure of the queens changes colony dynamics in an unexpected way: colonies from exposed queens are more likely to grow slowly and recover in numbers only after they survive hibernation. In addition to the two experimental chapters, this thesis includes a co-authored published review on organisational immunity, where we enlist the experimental evidence and theoretical framework on which this hypothesis is built, identify the caveats and underline how the field is ripe to overcome them. In a final chapter, I describe my part in two collaborative efforts, one to develop an image-based tracker, and the second to develop a classifier for ant behaviour.}, author = {Casillas Perez, Barbara E}, issn = {2663-337X}, keywords = {Social Immunity, Sanitary care, Social Insects, Organisational Immunity, Colony development, Multi-target tracking}, pages = {183}, publisher = {Institute of Science and Technology Austria}, title = {{Collective defenses of garden ants against a fungal pathogen}}, doi = {10.15479/AT:ISTA:6435}, year = {2019}, } @phdthesis{6269, abstract = {Clathrin-Mediated Endocytosis (CME) is an aspect of cellular trafficking that is constantly regulated for mediating developmental and physiological responses. The main aim of my thesis is to decipher the basic mechanisms of CME and post-endocytic trafficking in the whole multicellular organ systems of Arabidopsis. The first chapter of my thesis describes the search for new components involved in CME. Tandem affinity purification was conducted using CLC and its interacting partners were identified. Amongst the identified proteins were the Auxilin-likes1 and 2 (Axl1/2), putative uncoating factors, for which we made a full functional analysis. Over-expression of Axl1/2 causes extreme modifications in the dynamics of the machinery proteins and inhibition of endocytosis altogether. However the loss of function of the axl1/2 did not present any cellular or physiological phenotype, meaning Auxilin-likes do not form the major uncoating machinery. The second chapter of my thesis describes the establishment/utilisation of techniques to capture the dynamicity and the complexity of CME and post-endocytic trafficking. We have studied the development of endocytic pits at the PM – specifically, the mode of membrane remodeling during pit development and the role of actin in it, given plant cells possess high turgor pressure. Utilizing the improved z-resolution of TIRF and VAEM techniques, we captured the time-lapse of the endocytic events at the plasma membrane; and using particle detection software, we quantitatively analysed all the endocytic trajectories in an unbiased way to obtain the endocytic rate of the system. This together with the direct analysis of cargo internalisation from the PM provided an estimate on the endocytic potential of the cell. We also developed a methodology for ultrastructural analysis of different populations of Clathrin-Coated Structures (CCSs) in both PM and endomembranes in unroofed protoplasts. Structural analysis, together with the intensity profile of CCSs at the PM show that the mode of CCP development at the PM follows ‘Constant curvature model’; meaning that clathrin polymerisation energy is a major contributing factor of membrane remodeling. In addition, other analyses clearly show that actin is not required for membrane remodeling during invagination or any other step of CCP development, despite the prevalent high turgor pressure. However, actin is essential in orchestrating the post-endocytic trafficking of CCVs facilitating the EE formation. We also observed that the uncoating process post-endocytosis is not immediate; an alternative mechanism of uncoating – Sequential multi-step process – functions in the cell. Finally we also looked at one of the important physiological stimuli modulating the process – hormone, auxin. auxin has been known to influence CME before. We have made a detailed study on the concentration-time based effect of auxin on the machinery proteins, CCP development, and the specificity of cargoes endocytosed. To this end, we saw no general effect of auxin on CME at earlier time points. However, very low concentration of IAA, such as 50nM, accelerates endocytosis of specifically PIN2 through CME. Such a tight regulatory control with high specificity to PIN2 could be essential in modulating its polarity. }, author = {Narasimhan, Madhumitha}, issn = {2663-337X}, pages = {138}, publisher = {Institute of Science and Technology Austria}, title = {{Clathrin-Mediated endocytosis, post-endocytic trafficking and their regulatory controls in plants }}, doi = {10.15479/at:ista:th1075}, year = {2019}, } @inproceedings{11222, author = {Kim, Olena and Borges Merjane, Carolina and Jonas, Peter M}, booktitle = {Intrinsic Activity}, issn = {2309-8503}, keywords = {hippocampus, mossy fibers, readily releasable pool, electron microscopy}, location = {Innsbruck, Austria}, number = {Suppl. 1}, publisher = {Austrian Pharmacological Society}, title = {{Functional analysis of the docked vesicle pool in hippocampal mossy fiber terminals by electron microscopy}}, doi = {10.25006/ia.7.s1-a3.27}, volume = {7}, year = {2019}, } @phdthesis{6947, abstract = {Lymph nodes are es s ential organs of the immune s ys tem where adaptive immune responses originate, and consist of various leukocyte populations and a stromal backbone. Fibroblastic reticular cells (FRCs) are the main stromal cells and form a sponge-like extracellular matrix network, called conduits , which they thems elves enwrap and contract. Lymph, containing s oluble antigens , arrive in lymph nodes via afferent lymphatic vessels that connect to the s ubcaps ular s inus and conduit network. According to the current paradigm, the conduit network dis tributes afferent lymph through lymph nodes and thus provides acces s for immune cells to lymph-borne antigens. An elas tic caps ule s urrounds the organ and confines the immune cells and FRC network. Lymph nodes are completely packed with lymphocytes and lymphocyte numbers directly dictates the size of the organ. Although lymphocytes cons tantly enter and leave the lymph node, its s ize remains remarkedly s table under homeostatic conditions. It is only partly known how the cellularity and s ize of the lymph node is regulated and how the lymph node is able to swell in inflammation. The role of the FRC network in lymph node s welling and trans fer of fluids are inves tigated in this thes is. Furthermore, we s tudied what trafficking routes are us ed by cancer cells in lymph nodes to form distal metastases.We examined the role of a mechanical feedback in regulation of lymph node swelling. Using parallel plate compression and UV-las er cutting experiments we dis s ected the mechanical force dynamics of the whole lymph node, and individually for FRCs and the caps ule. Physical forces generated by packed lymphocytes directly affect the tens ion on the FRC network and capsule, which increases its resistance to swelling. This implies a feedback mechanism between tis s ue pres s ure and ability of lymphocytes to enter the organ. Following inflammation, the lymph node swells ∼10 fold in two weeks . Yet, what is the role for tens ion on the FRC network and caps ule, and how are lymphocytes able to enter in conditions that resist swelling remain open ques tions . We s how that tens ion on the FRC network is important to limit the swelling rate of the organ so that the FRC network can grow in a coordinated fashion. This is illustrated by interfering with FRC contractility, which leads to faster swelling rates and a dis organized FRC network in the inflamed lymph node. Growth of the FRC network in turn is expected to releas e tens ion on thes e s tructures and lowers the res is tance to swelling, thereby allowing more lymphocytes to enter the organ and drive more swelling. Halt of swelling coincides with a thickening of the caps ule, which forms a thick res is tant band around the organ and lowers tens ion on the FRC network to form a new force equilibrium.The FRC and conduit network are further believed to be a privileged s ite of s oluble information within the lymph node, although many details remain uns olved. We s how by 3D ultra-recons truction that FRCs and antigen pres enting cells cover the s urface of conduit s ys tem for more than 99% and we dis cus s the implications for s oluble information exchangeat the conduit level.Finally, there is an ongoing debate in the cancer field whether and how cancer cells in lymph nodes s eed dis tal metas tas es . We s how that cancer cells infus ed into the lymph node can utilize trafficking routes of immune cells and rapidly migrate to blood vessels. Once in the blood circulation, these cells are able to form metastases in distal tissues.}, author = {Assen, Frank P}, issn = {2663-337X}, pages = {142}, publisher = {Institute of Science and Technology Austria}, title = {{Lymph node mechanics: Deciphering the interplay between stroma contractility, morphology and lymphocyte trafficking}}, doi = {10.15479/AT:ISTA:6947}, year = {2019}, } @phdthesis{6849, abstract = {Brain function is mediated by complex dynamical interactions between excitatory and inhibitory cell types. The Cholecystokinin-expressing inhibitory cells (CCK-interneurons) are one of the least studied types, despite being suspected to play important roles in cognitive processes. We studied the network effects of optogenetic silencing of CCK-interneurons in the CA1 hippocampal area during exploration and sleep states. The cell firing pattern in response to light pulses allowed us to classify the recorded neurons in 5 classes, including disinhibited and non-responsive pyramidal cell and interneurons, and the inhibited interneurons corresponding to the CCK group. The light application, which inhibited the activity of CCK interneurons triggered wider changes in the firing dynamics of cells. We observed rate changes (i.e. remapping) of pyramidal cells during the exploration session in which the light was applied relative to the previous control session that was not restricted neither in time nor space to the light delivery. Also, the disinhibited pyramidal cells had higher increase in bursting than in single spike firing rate as a result of CCK silencing. In addition, the firing activity patterns during exploratory periods were more weakly reactivated in sleep for those periods in which CCK-interneuron were silenced than in the unaffected periods. Furthermore, light pulses during sleep disrupted the reactivation of recent waking patterns. Hence, silencing CCK neurons during exploration suppressed the reactivation of waking firing patterns in sleep and CCK interneuron activity was also required during sleep for the normal reactivation of waking patterns. These findings demonstrate the involvement of CCK cells in reactivation-related memory consolidation. An important part of our analysis was to test the relationship of the identified CCKinterneurons to brain oscillations. Our findings showed that these cells exhibited different oscillatory behaviour during anaesthesia and natural waking and sleep conditions. We showed that: 1) Contrary to the past studies performed under anaesthesia, the identified CCKinterneurons fired on the descending portion of the theta phase in waking exploration. 2) CCKinterneuron preferred phases around the trough of gamma oscillations. 3) Contrary to anaesthesia conditions, the average firing rate of the CCK-interneurons increased around the peak activity of the sharp-wave ripple (SWR) events in natural sleep, which is congruent with new reports about their functional connectivity. We also found that light driven CCK-interneuron silencing altered the dynamics on the CA1 network oscillatory activity: 1) Pyramidal cells negatively shifted their preferred theta phases when the light was applied, while interneurons responses were less consistent. 2) As a population, pyramidal cells negatively shifted their preferred activity during gamma oscillations, albeit we did not find gamma modulation differences related to the light application when pyramidal cells were subdivided into the disinhibited and unaffected groups. 3) During the peak of SWR events, all but the CCK-interneurons had a reduction in their relative firing rate change during the light application as compared to the change observed at SWR initiation. Finally, regarding to the place field activity of the recorded pyramidal neurons, we showed that the disinhibited pyramidal cells had reduced place field similarity, coherence and spatial information, but only during the light application. The mechanisms behind such observed behaviours might involve eCB signalling and plastic changes in CCK-interneuron synapses. In conclusion, the observed changes related to the light-mediated silencing of CCKinterneurons have unravelled characteristics of this interneuron subpopulation that might change the understanding not only of their particular network interactions, but also of the current theories about the emergence of certain cognitive processes such as place coding needed for navigation or hippocampus-dependent memory consolidation. }, author = {Rangel Guerrero, Dámaris K}, isbn = {9783990780039}, issn = {2663-337X}, pages = {97}, publisher = {Institute of Science and Technology Austria}, title = {{The role of CCK-interneurons in regulating hippocampal network dynamics}}, doi = {10.15479/AT:ISTA:6849}, year = {2019}, } @article{6351, abstract = {A process of restorative patterning in plant roots correctly replaces eliminated cells to heal local injuries despite the absence of cell migration, which underpins wound healing in animals. Patterning in plants relies on oriented cell divisions and acquisition of specific cell identities. Plants regularly endure wounds caused by abiotic or biotic environmental stimuli and have developed extraordinary abilities to restore their tissues after injuries. Here, we provide insight into a mechanism of restorative patterning that repairs tissues after wounding. Laser-assisted elimination of different cells in Arabidopsis root combined with live-imaging tracking during vertical growth allowed analysis of the regeneration processes in vivo. Specifically, the cells adjacent to the inner side of the injury re-activated their stem cell transcriptional programs. They accelerated their progression through cell cycle, coordinately changed the cell division orientation, and ultimately acquired de novo the correct cell fates to replace missing cells. These observations highlight existence of unknown intercellular positional signaling and demonstrate the capability of specified cells to re-acquire stem cell programs as a crucial part of the plant-specific mechanism of wound healing.}, author = {Marhavá, Petra and Hörmayer, Lukas and Yoshida, Saiko and Marhavy, Peter and Benková, Eva and Friml, Jiří}, issn = {10974172}, journal = {Cell}, number = {4}, pages = {957--969.e13}, publisher = {Elsevier}, title = {{Re-activation of stem cell pathways for pattern restoration in plant wound healing}}, doi = {10.1016/j.cell.2019.04.015}, volume = {177}, year = {2019}, } @article{6943, abstract = {Plants as sessile organisms are constantly under attack by herbivores, rough environmental situations, or mechanical pressure. These challenges often lead to the induction of wounds or destruction of already specified and developed tissues. Additionally, wounding makes plants vulnerable to invasion by pathogens, which is why wound signalling often triggers specific defence responses. To stay competitive or, eventually, survive under these circumstances, plants need to regenerate efficiently, which in rigid, tissue migration-incompatible plant tissues requires post-embryonic patterning and organogenesis. Now, several studies used laser-assisted single cell ablation in the Arabidopsis root tip as a minimal wounding proxy. Here, we discuss their findings and put them into context of a broader spectrum of wound signalling, pathogen responses and tissue as well as organ regeneration.}, author = {Hörmayer, Lukas and Friml, Jiří}, issn = {1369-5266}, journal = {Current Opinion in Plant Biology}, pages = {124--130}, publisher = {Elsevier}, title = {{Targeted cell ablation-based insights into wound healing and restorative patterning}}, doi = {10.1016/j.pbi.2019.08.006}, volume = {52}, year = {2019}, } @article{7391, abstract = {Electron microscopy (EM) is a technology that enables visualization of single proteins at a nanometer resolution. However, current protein analysis by EM mainly relies on immunolabeling with gold-particle-conjugated antibodies, which is compromised by large size of antibody, precluding precise detection of protein location in biological samples. Here, we develop a specific chemical labeling method for EM detection of proteins at single-molecular level. Rational design of α-helical peptide tag and probe structure provided a complementary reaction pair that enabled specific cysteine conjugation of the tag. The developed chemical labeling with gold-nanoparticle-conjugated probe showed significantly higher labeling efficiency and detectability of high-density clusters of tag-fused G protein-coupled receptors in freeze-fracture replicas compared with immunogold labeling. Furthermore, in ultrathin sections, the spatial resolution of the chemical labeling was significantly higher than that of antibody-mediated labeling. These results demonstrate substantial advantages of the chemical labeling approach for single protein visualization by EM.}, author = {Tabata, Shigekazu and Jevtic, Marijo and Kurashige, Nobutaka and Fuchida, Hirokazu and Kido, Munetsugu and Tani, Kazushi and Zenmyo, Naoki and Uchinomiya, Shohei and Harada, Harumi and Itakura, Makoto and Hamachi, Itaru and Shigemoto, Ryuichi and Ojida, Akio}, issn = {2589-0042}, journal = {iScience}, number = {12}, pages = {256--268}, publisher = {Elsevier}, title = {{Electron microscopic detection of single membrane proteins by a specific chemical labeling}}, doi = {10.1016/j.isci.2019.11.025}, volume = {22}, year = {2019}, } @article{6848, abstract = {Proton-translocating transhydrogenase (also known as nicotinamide nucleotide transhydrogenase (NNT)) is found in the plasma membranes of bacteria and the inner mitochondrial membranes of eukaryotes. NNT catalyses the transfer of a hydride between NADH and NADP+, coupled to the translocation of one proton across the membrane. Its main physiological function is the generation of NADPH, which is a substrate in anabolic reactions and a regulator of oxidative status; however, NNT may also fine-tune the Krebs cycle1,2. NNT deficiency causes familial glucocorticoid deficiency in humans and metabolic abnormalities in mice, similar to those observed in type II diabetes3,4. The catalytic mechanism of NNT has been proposed to involve a rotation of around 180° of the entire NADP(H)-binding domain that alternately participates in hydride transfer and proton-channel gating. However, owing to the lack of high-resolution structures of intact NNT, the details of this process remain unclear5,6. Here we present the cryo-electron microscopy structure of intact mammalian NNT in different conformational states. We show how the NADP(H)-binding domain opens the proton channel to the opposite sides of the membrane, and we provide structures of these two states. We also describe the catalytically important interfaces and linkers between the membrane and the soluble domains and their roles in nucleotide exchange. These structures enable us to propose a revised mechanism for a coupling process in NNT that is consistent with a large body of previous biochemical work. Our results are relevant to the development of currently unavailable NNT inhibitors, which may have therapeutic potential in ischaemia reperfusion injury, metabolic syndrome and some cancers7,8,9.}, author = {Kampjut, Domen and Sazanov, Leonid A}, issn = {1476-4687}, journal = {Nature}, number = {7773}, pages = {291–295}, publisher = {Springer Nature}, title = {{Structure and mechanism of mitochondrial proton-translocating transhydrogenase}}, doi = {10.1038/s41586-019-1519-2}, volume = {573}, year = {2019}, } @article{6194, abstract = {Grid cells with their rigid hexagonal firing fields are thought to provide an invariant metric to the hippocampal cognitive map, yet environmental geometrical features have recently been shown to distort the grid structure. Given that the hippocampal role goes beyond space, we tested the influence of nonspatial information on the grid organization. We trained rats to daily learn three new reward locations on a cheeseboard maze while recording from the medial entorhinal cortex and the hippocampal CA1 region. Many grid fields moved toward goal location, leading to long-lasting deformations of the entorhinal map. Therefore, distortions in the grid structure contribute to goal representation during both learning and recall, which demonstrates that grid cells participate in mnemonic coding and do not merely provide a simple metric of space.}, author = {Boccara, Charlotte N. and Nardin, Michele and Stella, Federico and O'Neill, Joseph and Csicsvari, Jozsef L}, issn = {1095-9203}, journal = {Science}, number = {6434}, pages = {1443--1447}, publisher = {American Association for the Advancement of Science}, title = {{The entorhinal cognitive map is attracted to goals}}, doi = {10.1126/science.aav4837}, volume = {363}, year = {2019}, } @phdthesis{7132, abstract = {A major challenge in neuroscience research is to dissect the circuits that orchestrate behavior in health and disease. Proteins from a wide range of non-mammalian species, such as microbial opsins, have been successfully transplanted to specific neuronal targets to override their natural communication patterns. The goal of our work is to manipulate synaptic communication in a manner that closely incorporates the functional intricacies of synapses by preserving temporal encoding (i.e. the firing pattern of the presynaptic neuron) and connectivity (i.e. target specific synapses rather than specific neurons). Our strategy to achieve this goal builds on the use of non-mammalian transplants to create a synthetic synapse. The mode of modulation comes from pre-synaptic uptake of a synthetic neurotransmitter (SN) into synaptic vesicles by means of a genetically targeted transporter selective for the SN. Upon natural vesicular release, exposure of the SN to the synaptic cleft will modify the post-synaptic potential through an orthogonal ligand gated ion channel. To achieve this goal we have functionally characterized a mixed cationic methionine-gated ion channel from Arabidopsis thaliana, designed a method to functionally characterize a synthetic transporter in isolated synaptic vesicles without the need for transgenic animals, identified and extracted multiple prokaryotic uptake systems that are substrate specific for methionine (Met), and established a primary/cell line co-culture system that would allow future combinatorial testing of this orthogonal transmitter-transporter-channel trifecta. Synthetic synapses will provide a unique opportunity to manipulate synaptic communication while maintaining the electrophysiological integrity of the pre-synaptic cell. In this way, information may be preserved that was generated in upstream circuits and that could be essential for concerted function and information processing.}, author = {Mckenzie, Catherine}, issn = {2663-337X}, pages = {95}, publisher = {Institute of Science and Technology Austria}, title = {{Design and characterization of methods and biological components to realize synthetic neurotransmission}}, doi = {10.15479/at:ista:7132}, year = {2019}, } @article{5949, abstract = {Aberrant proteostasis of protein aggregation may lead to behavior disorders including chronic mental illnesses (CMI). Furthermore, the neuronal activity alterations that underlie CMI are not well understood. We recorded the local field potential and single-unit activity of the hippocampal CA1 region in vivo in rats transgenically overexpressing the Disrupted-in-Schizophrenia 1 (DISC1) gene (tgDISC1), modeling sporadic CMI. These tgDISC1 rats have previously been shown to exhibit DISC1 protein aggregation, disturbances in the dopaminergic system and attention-related deficits. Recordings were performed during exploration of familiar and novel open field environments and during sleep, allowing investigation of neuronal abnormalities in unconstrained behavior. Compared to controls, tgDISC1 place cells exhibited smaller place fields and decreased speed-modulation of their firing rates, demonstrating altered spatial coding and deficits in encoding location-independent sensory inputs. Oscillation analyses showed that tgDISC1 pyramidal neurons had higher theta phase locking strength during novelty, limiting their phase coding ability. However, their mean theta phases were more variable at the population level, reducing oscillatory network synchronization. Finally, tgDISC1 pyramidal neurons showed a lack of novelty-induced shift in their preferred theta and gamma firing phases, indicating deficits in coding of novel environments with oscillatory firing. By combining single cell and neuronal population analyses, we link DISC1 protein pathology with abnormal hippocampal neural coding and network synchrony, and thereby gain a more comprehensive understanding of CMI mechanisms.}, author = {Käfer, Karola and Malagon-Vina, Hugo and Dickerson, Desiree and O'Neill, Joseph and Trossbach, Svenja V. and Korth, Carsten and Csicsvari, Jozsef L}, journal = {Hippocampus}, number = {9}, pages = {802--816}, publisher = {Wiley}, title = {{Disrupted-in-schizophrenia 1 overexpression disrupts hippocampal coding and oscillatory synchronization}}, doi = {10.1002/hipo.23076}, volume = {29}, year = {2019}, } @phdthesis{6825, abstract = {The solving of complex tasks requires the functions of more than one brain area and their interaction. Whilst spatial navigation and memory is dependent on the hippocampus, flexible behavior relies on the medial prefrontal cortex (mPFC). To further examine the roles of the hippocampus and mPFC, we recorded their neural activity during a task that depends on both of these brain regions. With tetrodes, we recorded the extracellular activity of dorsal hippocampal CA1 (HPC) and mPFC neurons in Long-Evans rats performing a rule-switching task on the plus-maze. The plus-maze task had a spatial component since it required navigation along one of the two start arms and at the maze center a choice between one of the two goal arms. Which goal contained a reward depended on the rule currently in place. After an uncued rule change the animal had to abandon the old strategy and switch to the new rule, testing cognitive flexibility. Investigating the coordination of activity between the HPC and mPFC allows determination during which task stages their interaction is required. Additionally, comparing neural activity patterns in these two brain regions allows delineation of the specialized functions of the HPC and mPFC in this task. We analyzed neural activity in the HPC and mPFC in terms of oscillatory interactions, rule coding and replay. We found that theta coherence between the HPC and mPFC is increased at the center and goals of the maze, both when the rule was stable or has changed. Similar results were found for locking of HPC and mPFC neurons to HPC theta oscillations. However, no differences in HPC-mPFC theta coordination were observed between the spatially- and cue-guided rule. Phase locking of HPC and mPFC neurons to HPC gamma oscillations was not modulated by maze position or rule type. We found that the HPC coded for the two different rules with cofiring relationships between cell pairs. However, we could not find conclusive evidence for rule coding in the mPFC. Spatially-selective firing in the mPFC generalized between the two start and two goal arms. With Bayesian positional decoding, we found that the mPFC reactivated non-local positions during awake immobility periods. Replay of these non-local positions could represent entire behavioral trajectories resembling trajectory replay of the HPC. Furthermore, mPFC trajectory-replay at the goal positively correlated with rule-switching performance. Finally, HPC and mPFC trajectory replay occurred independently of each other. These results show that the mPFC can replay ordered patterns of activity during awake immobility, possibly underlying its role in flexible behavior. }, author = {Käfer, Karola}, issn = {2663-337X}, pages = {89}, publisher = {Institute of Science and Technology Austria}, title = {{The hippocampus and medial prefrontal cortex during flexible behavior}}, doi = {10.15479/AT:ISTA:6825}, year = {2019}, } @article{6713, abstract = {Evolutionary studies are often limited by missing data that are critical to understanding the history of selection. Selection experiments, which reproduce rapid evolution under controlled conditions, are excellent tools to study how genomes evolve under selection. Here we present a genomic dissection of the Longshanks selection experiment, in which mice were selectively bred over 20 generations for longer tibiae relative to body mass, resulting in 13% longer tibiae in two replicates. We synthesized evolutionary theory, genome sequences and molecular genetics to understand the selection response and found that it involved both polygenic adaptation and discrete loci of major effect, with the strongest loci tending to be selected in parallel between replicates. We show that selection may favor de-repression of bone growth through inactivating two limb enhancers of an inhibitor, Nkx3-2. Our integrative genomic analyses thus show that it is possible to connect individual base-pair changes to the overall selection response.}, author = {Castro, João Pl and Yancoskie, Michelle N. and Marchini, Marta and Belohlavy, Stefanie and Hiramatsu, Layla and Kučka, Marek and Beluch, William H. and Naumann, Ronald and Skuplik, Isabella and Cobb, John and Barton, Nicholas H and Rolian, Campbell and Chan, Yingguang Frank}, journal = {eLife}, publisher = {eLife Sciences Publications}, title = {{An integrative genomic analysis of the Longshanks selection experiment for longer limbs in mice}}, doi = {10.7554/eLife.42014}, volume = {8}, year = {2019}, } @unpublished{10065, abstract = {We study double quantum dots in a Ge/SiGe heterostructure and test their maturity towards singlet-triplet ($S-T_0$) qubits. We demonstrate a large range of tunability, from two single quantum dots to a double quantum dot. We measure Pauli spin blockade and study the anisotropy of the $g$-factor. We use an adjacent quantum dot for sensing charge transitions in the double quantum dot at interest. In conclusion, Ge/SiGe possesses all ingredients necessary for building a singlet-triplet qubit.}, author = {Hofmann, Andrea C and Jirovec, Daniel and Borovkov, Maxim and Prieto Gonzalez, Ivan and Ballabio, Andrea and Frigerio, Jacopo and Chrastina, Daniel and Isella, Giovanni and Katsaros, Georgios}, booktitle = {arXiv}, title = {{Assessing the potential of Ge/SiGe quantum dots as hosts for singlet-triplet qubits}}, doi = {10.48550/arXiv.1910.05841}, year = {2019}, } @article{6187, abstract = {Aberrant display of the truncated core1 O-glycan T-antigen is a common feature of human cancer cells that correlates with metastasis. Here we show that T-antigen in Drosophila melanogaster macrophages is involved in their developmentally programmed tissue invasion. Higher macrophage T-antigen levels require an atypical major facilitator superfamily (MFS) member that we named Minerva which enables macrophage dissemination and invasion. We characterize for the first time the T and Tn glycoform O-glycoproteome of the Drosophila melanogaster embryo, and determine that Minerva increases the presence of T-antigen on proteins in pathways previously linked to cancer, most strongly on the sulfhydryl oxidase Qsox1 which we show is required for macrophage tissue entry. Minerva’s vertebrate ortholog, MFSD1, rescues the minerva mutant’s migration and T-antigen glycosylation defects. We thus identify a key conserved regulator that orchestrates O-glycosylation on a protein subset to activate a program governing migration steps important for both development and cancer metastasis.}, author = {Valosková, Katarina and Biebl, Julia and Roblek, Marko and Emtenani, Shamsi and György, Attila and Misova, Michaela and Ratheesh, Aparna and Rodrigues, Patricia and Shkarina, Katerina and Larsen, Ida Signe Bohse and Vakhrushev, Sergey Y and Clausen, Henrik and Siekhaus, Daria E}, issn = {2050-084X}, journal = {eLife}, publisher = {eLife Sciences Publications}, title = {{A conserved major facilitator superfamily member orchestrates a subset of O-glycosylation to aid macrophage tissue invasion}}, doi = {10.7554/elife.41801}, volume = {8}, year = {2019}, } @phdthesis{6546, abstract = {Invasive migration plays a crucial role not only during development and homeostasis but also in pathological states, such as tumor metastasis. Drosophila macrophage migration into the extended germband is an interesting system to study invasive migration. It carries similarities to immune cell transmigration and cancer cell invasion, therefore studying this process could also bring new understanding of invasion in higher organisms. In our work, we uncover a highly conserved member of the major facilitator family that plays a role in tissue invasion through regulation of glycosylation on a subgroup of proteins and/or by aiding the precise timing of DN-Cadherin downregulation. Aberrant display of the truncated core1 O-glycan T-antigen is a common feature of human cancer cells that correlates with metastasis. Here we show that T-antigen in Drosophila melanogaster macrophages is involved in their developmentally programmed tissue invasion. Higher macrophage T-antigen levels require an atypical major facilitator superfamily (MFS) member that we named Minerva which enables macrophage dissemination and invasion. We characterize for the first time the T and Tn glycoform O-glycoproteome of the Drosophila melanogaster embryo, and determine that Minerva increases the presence of T-antigen on proteins in pathways previously linked to cancer, most strongly on the sulfhydryl oxidase Qsox1 which we show is required for macrophage tissue entry. Minerva’s vertebrate ortholog, MFSD1, rescues the minerva mutant’s migration and T-antigen glycosylation defects. We thus identify a key conserved regulator that orchestrates O-glycosylation on a protein subset to activate a program governing migration steps important for both development and cancer metastasis. }, author = {Valosková, Katarina}, issn = {2663-337X}, pages = {141}, publisher = {Institute of Science and Technology Austria}, title = {{The role of a highly conserved major facilitator superfamily member in Drosophila embryonic macrophage migration}}, doi = {10.15479/AT:ISTA:6546}, year = {2019}, } @phdthesis{6363, abstract = {Distinguishing between similar experiences is achieved by the brain in a process called pattern separation. In the hippocampus, pattern separation reduces the interference of memories and increases the storage capacity by decorrelating similar inputs patterns of neuronal activity into non-overlapping output firing patterns. Winners-take-all (WTA) mechanism is a theoretical model for pattern separation in which a "winner" cell suppresses the activity of the neighboring neurons through feedback inhibition. However, if the network properties of the dentate gyrus support WTA as a biologically conceivable model remains unknown. Here, we showed that the connectivity rules of PV+interneurons and their synaptic properties are optimizedfor efficient pattern separation. We found using multiple whole-cell in vitrorecordings that PV+interneurons mainly connect to granule cells (GC) through lateral inhibition, a form of feedback inhibition in which a GC inhibits other GCs but not itself through the activation of PV+interneurons. Thus, lateral inhibition between GC–PV+interneurons was ~10 times more abundant than recurrent connections. Furthermore, the GC–PV+interneuron connectivity was more spatially confined but less abundant than PV+interneurons–GC connectivity, leading to an asymmetrical distribution of excitatory and inhibitory connectivity. Our network model of the dentate gyrus with incorporated real connectivity rules efficiently decorrelates neuronal activity patterns using WTA as the primary mechanism. This process relied on lateral inhibition, fast-signaling properties of PV+interneurons and the asymmetrical distribution of excitatory and inhibitory connectivity. Finally, we found that silencing the activity of PV+interneurons in vivoleads to acute deficits in discrimination between similar environments, suggesting that PV+interneuron networks are necessary for behavioral relevant computations. Our results demonstrate that PV+interneurons possess unique connectivity and fast signaling properties that confer to the dentate gyrus network properties that allow the emergence of pattern separation. Thus, our results contribute to the knowledge of how specific forms of network organization underlie sophisticated types of information processing. }, author = {Espinoza Martinez, Claudia }, isbn = {978-3-99078-000-8}, issn = {2663-337X}, pages = {140}, publisher = {Institute of Science and Technology Austria}, title = {{Parvalbumin+ interneurons enable efficient pattern separation in hippocampal microcircuits}}, doi = {10.15479/AT:ISTA:6363}, year = {2019}, } @inproceedings{6780, abstract = {In this work, we consider the almost-sure termination problem for probabilistic programs that asks whether a given probabilistic program terminates with probability 1. Scalable approaches for program analysis often rely on modularity as their theoretical basis. In non-probabilistic programs, the classical variant rule (V-rule) of Floyd-Hoare logic provides the foundation for modular analysis. Extension of this rule to almost-sure termination of probabilistic programs is quite tricky, and a probabilistic variant was proposed in [16]. While the proposed probabilistic variant cautiously addresses the key issue of integrability, we show that the proposed modular rule is still not sound for almost-sure termination of probabilistic programs. Besides establishing unsoundness of the previous rule, our contributions are as follows: First, we present a sound modular rule for almost-sure termination of probabilistic programs. Our approach is based on a novel notion of descent supermartingales. Second, for algorithmic approaches, we consider descent supermartingales that are linear and show that they can be synthesized in polynomial time. Finally, we present experimental results on a variety of benchmarks and several natural examples that model various types of nested while loops in probabilistic programs and demonstrate that our approach is able to efficiently prove their almost-sure termination property}, author = {Huang, Mingzhang and Fu, Hongfei and Chatterjee, Krishnendu and Goharshady, Amir Kafshdar}, booktitle = {Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications }, location = {Athens, Greece}, publisher = {ACM}, title = {{Modular verification for almost-sure termination of probabilistic programs}}, doi = {10.1145/3360555}, volume = {3}, year = {2019}, } @article{6380, abstract = {There is a huge gap between the speeds of modern caches and main memories, and therefore cache misses account for a considerable loss of efficiency in programs. The predominant technique to address this issue has been Data Packing: data elements that are frequently accessed within time proximity are packed into the same cache block, thereby minimizing accesses to the main memory. We consider the algorithmic problem of Data Packing on a two-level memory system. Given a reference sequence R of accesses to data elements, the task is to partition the elements into cache blocks such that the number of cache misses on R is minimized. The problem is notoriously difficult: it is NP-hard even when the cache has size 1, and is hard to approximate for any cache size larger than 4. Therefore, all existing techniques for Data Packing are based on heuristics and lack theoretical guarantees. In this work, we present the first positive theoretical results for Data Packing, along with new and stronger negative results. We consider the problem under the lens of the underlying access hypergraphs, which are hypergraphs of affinities between the data elements, where the order of an access hypergraph corresponds to the size of the affinity group. We study the problem parameterized by the treewidth of access hypergraphs, which is a standard notion in graph theory to measure the closeness of a graph to a tree. Our main results are as follows: We show there is a number q* depending on the cache parameters such that (a) if the access hypergraph of order q* has constant treewidth, then there is a linear-time algorithm for Data Packing; (b)the Data Packing problem remains NP-hard even if the access hypergraph of order q*-1 has constant treewidth. Thus, we establish a fine-grained dichotomy depending on a single parameter, namely, the highest order among access hypegraphs that have constant treewidth; and establish the optimal value q* of this parameter. Finally, we present an experimental evaluation of a prototype implementation of our algorithm. Our results demonstrate that, in practice, access hypergraphs of many commonly-used algorithms have small treewidth. We compare our approach with several state-of-the-art heuristic-based algorithms and show that our algorithm leads to significantly fewer cache-misses. }, author = {Chatterjee, Krishnendu and Goharshady, Amir Kafshdar and Okati, Nastaran and Pavlogiannis, Andreas}, issn = {2475-1421}, journal = {Proceedings of the ACM on Programming Languages}, number = {POPL}, publisher = {ACM}, title = {{Efficient parameterized algorithms for data packing}}, doi = {10.1145/3290366}, volume = {3}, year = {2019}, } @inproceedings{6056, abstract = {In today's programmable blockchains, smart contracts are limited to being deterministic and non-probabilistic. This lack of randomness is a consequential limitation, given that a wide variety of real-world financial contracts, such as casino games and lotteries, depend entirely on randomness. As a result, several ad-hoc random number generation approaches have been developed to be used in smart contracts. These include ideas such as using an oracle or relying on the block hash. However, these approaches are manipulatable, i.e. their output can be tampered with by parties who might not be neutral, such as the owner of the oracle or the miners.We propose a novel game-theoretic approach for generating provably unmanipulatable pseudorandom numbers on the blockchain. Our approach allows smart contracts to access a trustworthy source of randomness that does not rely on potentially compromised miners or oracles, hence enabling the creation of a new generation of smart contracts that are not limited to being non-probabilistic and can be drawn from the much more general class of probabilistic programs.}, author = {Chatterjee, Krishnendu and Goharshady, Amir Kafshdar and Pourdamghani, Arash}, booktitle = {IEEE International Conference on Blockchain and Cryptocurrency}, location = {Seoul, Korea}, publisher = {IEEE}, title = {{Probabilistic smart contracts: Secure randomness on the blockchain}}, doi = {10.1109/BLOC.2019.8751326}, year = {2019}, } @inproceedings{6378, abstract = {In today's cryptocurrencies, Hashcash proof of work is the most commonly-adopted approach to mining. In Hashcash, when a miner decides to add a block to the chain, she has to solve the difficult computational puzzle of inverting a hash function. While Hashcash has been successfully adopted in both Bitcoin and Ethereum, it has attracted significant and harsh criticism due to its massive waste of electricity, its carbon footprint and environmental effects, and the inherent lack of usefulness in inverting a hash function. Various other mining protocols have been suggested, including proof of stake, in which a miner's chance of adding the next block is proportional to her current balance. However, such protocols lead to a higher entry cost for new miners who might not still have any stake in the cryptocurrency, and can in the worst case lead to an oligopoly, where the rich have complete control over mining. In this paper, we propose Hybrid Mining: a new mining protocol that combines solving real-world useful problems with Hashcash. Our protocol allows new miners to join the network by taking part in Hashcash mining without having to own an initial stake. It also allows nodes of the network to submit hard computational problems whose solutions are of interest in the real world, e.g.~protein folding problems. Then, miners can choose to compete in solving these problems, in lieu of Hashcash, for adding a new block. Hence, Hybrid Mining incentivizes miners to solve useful problems, such as hard computational problems arising in biology, in a distributed manner. It also gives researchers in other areas an easy-to-use tool to outsource their hard computations to the blockchain network, which has enormous computational power, by paying a reward to the miner who solves the problem for them. Moreover, our protocol provides strong security guarantees and is at least as resilient to double spending as Bitcoin.}, author = {Chatterjee, Krishnendu and Goharshady, Amir Kafshdar and Pourdamghani, Arash}, booktitle = {Proceedings of the 34th ACM Symposium on Applied Computing}, isbn = {9781450359337}, location = {Limassol, Cyprus}, pages = {374--381}, publisher = {ACM}, title = {{Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving}}, doi = {10.1145/3297280.3297319}, volume = {Part F147772}, year = {2019}, } @inproceedings{6175, abstract = {We consider the problem of expected cost analysis over nondeterministic probabilistic programs, which aims at automated methods for analyzing the resource-usage of such programs. Previous approaches for this problem could only handle nonnegative bounded costs. However, in many scenarios, such as queuing networks or analysis of cryptocurrency protocols, both positive and negative costs are necessary and the costs are unbounded as well. In this work, we present a sound and efficient approach to obtain polynomial bounds on the expected accumulated cost of nondeterministic probabilistic programs. Our approach can handle (a) general positive and negative costs with bounded updates in variables; and (b) nonnegative costs with general updates to variables. We show that several natural examples which could not be handled by previous approaches are captured in our framework. Moreover, our approach leads to an efficient polynomial-time algorithm, while no previous approach for cost analysis of probabilistic programs could guarantee polynomial runtime. Finally, we show the effectiveness of our approach using experimental results on a variety of programs for which we efficiently synthesize tight resource-usage bounds.}, author = {Wang, Peixin and Fu, Hongfei and Goharshady, Amir Kafshdar and Chatterjee, Krishnendu and Qin, Xudong and Shi, Wenjun}, booktitle = {PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation}, keywords = {Program Cost Analysis, Program Termination, Probabilistic Programs, Martingales}, location = {Phoenix, AZ, United States}, pages = {204--220}, publisher = {Association for Computing Machinery}, title = {{Cost analysis of nondeterministic probabilistic programs}}, doi = {10.1145/3314221.3314581}, year = {2019}, } @inproceedings{6490, abstract = {Smart contracts are programs that are stored and executed on the Blockchain and can receive, manage and transfer money (cryptocurrency units). Two important problems regarding smart contracts are formal analysis and compiler optimization. Formal analysis is extremely important, because smart contracts hold funds worth billions of dollars and their code is immutable after deployment. Hence, an undetected bug can cause significant financial losses. Compiler optimization is also crucial, because every action of a smart contract has to be executed by every node in the Blockchain network. Therefore, optimizations in compiling smart contracts can lead to significant savings in computation, time and energy. Two classical approaches in program analysis and compiler optimization are intraprocedural and interprocedural analysis. In intraprocedural analysis, each function is analyzed separately, while interprocedural analysis considers the entire program. In both cases, the analyses are usually reduced to graph problems over the control flow graph (CFG) of the program. These graph problems are often computationally expensive. Hence, there has been ample research on exploiting structural properties of CFGs for efficient algorithms. One such well-studied property is the treewidth, which is a measure of tree-likeness of graphs. It is known that intraprocedural CFGs of structured programs have treewidth at most 6, whereas the interprocedural treewidth cannot be bounded. This result has been used as a basis for many efficient intraprocedural analyses. In this paper, we explore the idea of exploiting the treewidth of smart contracts for formal analysis and compiler optimization. First, similar to classical programs, we show that the intraprocedural treewidth of structured Solidity and Vyper smart contracts is at most 9. Second, for global analysis, we prove that the interprocedural treewidth of structured smart contracts is bounded by 10 and, in sharp contrast with classical programs, treewidth-based algorithms can be easily applied for interprocedural analysis. Finally, we supplement our theoretical results with experiments using a tool we implemented for computing treewidth of smart contracts and show that the treewidth is much lower in practice. We use 36,764 real-world Ethereum smart contracts as benchmarks and find that they have an average treewidth of at most 3.35 for the intraprocedural case and 3.65 for the interprocedural case. }, author = {Chatterjee, Krishnendu and Goharshady, Amir Kafshdar and Goharshady, Ehsan Kafshdar}, booktitle = {Proceedings of the 34th ACM Symposium on Applied Computing}, isbn = {9781450359337}, location = {Limassol, Cyprus}, pages = {400--408}, publisher = {ACM}, title = {{The treewidth of smart contracts}}, doi = {10.1145/3297280.3297322}, volume = {Part F147772}, year = {2019}, } @article{7158, abstract = {Interprocedural analysis is at the heart of numerous applications in programming languages, such as alias analysis, constant propagation, and so on. Recursive state machines (RSMs) are standard models for interprocedural analysis. We consider a general framework with RSMs where the transitions are labeled from a semiring and path properties are algebraic with semiring operations. RSMs with algebraic path properties can model interprocedural dataflow analysis problems, the shortest path problem, the most probable path problem, and so on. The traditional algorithms for interprocedural analysis focus on path properties where the starting point is fixed as the entry point of a specific method. In this work, we consider possible multiple queries as required in many applications such as in alias analysis. The study of multiple queries allows us to bring in an important algorithmic distinction between the resource usage of the one-time preprocessing vs for each individual query. The second aspect we consider is that the control flow graphs for most programs have constant treewidth. Our main contributions are simple and implementable algorithms that support multiple queries for algebraic path properties for RSMs that have constant treewidth. Our theoretical results show that our algorithms have small additional one-time preprocessing but can answer subsequent queries significantly faster as compared to the current algorithmic solutions for interprocedural dataflow analysis. We have also implemented our algorithms and evaluated their performance for performing on-demand interprocedural dataflow analysis on various domains, such as for live variable analysis and reaching definitions, on a standard benchmark set. Our experimental results align with our theoretical statements and show that after a lightweight preprocessing, on-demand queries are answered much faster than the standard existing algorithmic approaches. }, author = {Chatterjee, Krishnendu and Goharshady, Amir Kafshdar and Goyal, Prateesh and Ibsen-Jensen, Rasmus and Pavlogiannis, Andreas}, issn = {0164-0925}, journal = {ACM Transactions on Programming Languages and Systems}, number = {4}, publisher = {ACM}, title = {{Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth}}, doi = {10.1145/3363525}, volume = {41}, year = {2019}, } @article{7014, abstract = {We study the problem of developing efficient approaches for proving worst-case bounds of non-deterministic recursive programs. Ranking functions are sound and complete for proving termination and worst-case bounds of nonrecursive programs. First, we apply ranking functions to recursion, resulting in measure functions. We show that measure functions provide a sound and complete approach to prove worst-case bounds of non-deterministic recursive programs. Our second contribution is the synthesis of measure functions in nonpolynomial forms. We show that non-polynomial measure functions with logarithm and exponentiation can be synthesized through abstraction of logarithmic or exponentiation terms, Farkas' Lemma, and Handelman's Theorem using linear programming. While previous methods obtain worst-case polynomial bounds, our approach can synthesize bounds of the form $\mathcal{O}(n\log n)$ as well as $\mathcal{O}(n^r)$ where $r$ is not an integer. We present experimental results to demonstrate that our approach can obtain efficiently worst-case bounds of classical recursive algorithms such as (i) Merge-Sort, the divide-and-conquer algorithm for the Closest-Pair problem, where we obtain $\mathcal{O}(n \log n)$ worst-case bound, and (ii) Karatsuba's algorithm for polynomial multiplication and Strassen's algorithm for matrix multiplication, where we obtain $\mathcal{O}(n^r)$ bound such that $r$ is not an integer and close to the best-known bounds for the respective algorithms.}, author = {Chatterjee, Krishnendu and Fu, Hongfei and Goharshady, Amir Kafshdar}, journal = {ACM Transactions on Programming Languages and Systems}, number = {4}, publisher = {ACM}, title = {{Non-polynomial worst-case analysis of recursive programs}}, doi = {10.1145/3339984}, volume = {41}, year = {2019}, } @article{6486, abstract = {Based on a novel control scheme, where a steady modification of the streamwise velocity profile leads to complete relaminarization of initially fully turbulent pipe flow, we investigate the applicability and usefulness of custom-shaped honeycombs for such control. The custom-shaped honeycombs are used as stationary flow management devices which generate specific modifications of the streamwise velocity profile. Stereoscopic particle image velocimetry and pressure drop measurements are used to investigate and capture the development of the relaminarizing flow downstream these devices. We compare the performance of straight (constant length across the radius of the pipe) honeycombs with custom-shaped ones (variable length across the radius) and try to determine the optimal shape for maximal relaminarization at minimal pressure loss. The optimally modified streamwise velocity profile is found to be M-shaped, and the maximum attainable Reynolds number for total relaminarization is found to be of the order of 10,000. Consequently, the respective reduction in skin friction downstream of the device is almost by a factor of 5. The break-even point, where the additional pressure drop caused by the device is balanced by the savings due to relaminarization and a net gain is obtained, corresponds to a downstream stretch of distances as low as approximately 100 pipe diameters of laminar flow.}, author = {Kühnen, Jakob and Scarselli, Davide and Hof, Björn}, issn = {1528901X}, journal = {Journal of Fluids Engineering}, number = {11}, publisher = {ASME}, title = {{Relaminarization of pipe flow by means of 3D-printed shaped honeycombs}}, doi = {10.1115/1.4043494}, volume = {141}, year = {2019}, } @article{6228, abstract = {Following the recent observation that turbulent pipe flow can be relaminarised bya relatively simple modification of the mean velocity profile, we here carry out aquantitative experimental investigation of this phenomenon. Our study confirms thata flat velocity profile leads to a collapse of turbulence and in order to achieve theblunted profile shape, we employ a moving pipe segment that is briefly and rapidlyshifted in the streamwise direction. The relaminarisation threshold and the minimumshift length and speeds are determined as a function of Reynolds number. Althoughturbulence is still active after the acceleration phase, the modulated profile possessesa severely decreased lift-up potential as measured by transient growth. As shown,this results in an exponential decay of fluctuations and the flow relaminarises. Whilethis method can be easily applied at low to moderate flow speeds, the minimumstreamwise length over which the acceleration needs to act increases linearly with theReynolds number.}, author = {Scarselli, Davide and Kühnen, Jakob and Hof, Björn}, issn = {14697645}, journal = {Journal of Fluid Mechanics}, pages = {934--948}, publisher = {Cambridge University Press}, title = {{Relaminarising pipe flow by wall movement}}, doi = {10.1017/jfm.2019.191}, volume = {867}, year = {2019}, } @article{6260, abstract = {Polar auxin transport plays a pivotal role in plant growth and development. PIN auxin efflux carriers regulate directional auxin movement by establishing local auxin maxima, minima, and gradients that drive multiple developmental processes and responses to environmental signals. Auxin has been proposed to modulate its own transport by regulating subcellular PIN trafficking via processes such as clathrin-mediated PIN endocytosis and constitutive recycling. Here, we further investigated the mechanisms by which auxin affects PIN trafficking by screening auxin analogs and identified pinstatic acid (PISA) as a positive modulator of polar auxin transport in Arabidopsis thaliana. PISA had an auxin-like effect on hypocotyl elongation and adventitious root formation via positive regulation of auxin transport. PISA did not activate SCFTIR1/AFB signaling and yet induced PIN accumulation at the cell surface by inhibiting PIN internalization from the plasma membrane. This work demonstrates PISA to be a promising chemical tool to dissect the regulatory mechanisms behind subcellular PIN trafficking and auxin transport.}, author = {Oochi, A and Hajny, Jakub and Fukui, K and Nakao, Y and Gallei, Michelle C and Quareshy, M and Takahashi, K and Kinoshita, T and Harborough, SR and Kepinski, S and Kasahara, H and Napier, RM and Friml, Jiří and Hayashi, KI}, issn = {1532-2548}, journal = {Plant Physiology}, number = {2}, pages = {1152--1165}, publisher = {ASPB}, title = {{Pinstatic acid promotes auxin transport by inhibiting PIN internalization}}, doi = {10.1104/pp.19.00201}, volume = {180}, year = {2019}, } @article{6508, abstract = {Segregation of maternal determinants within the oocyte constitutes the first step in embryo patterning. In zebrafish oocytes, extensive ooplasmic streaming leads to the segregation of ooplasm from yolk granules along the animal-vegetal axis of the oocyte. Here, we show that this process does not rely on cortical actin reorganization, as previously thought, but instead on a cell-cycle-dependent bulk actin polymerization wave traveling from the animal to the vegetal pole of the oocyte. This wave functions in segregation by both pulling ooplasm animally and pushing yolk granules vegetally. Using biophysical experimentation and theory, we show that ooplasm pulling is mediated by bulk actin network flows exerting friction forces on the ooplasm, while yolk granule pushing is achieved by a mechanism closely resembling actin comet formation on yolk granules. Our study defines a novel role of cell-cycle-controlled bulk actin polymerization waves in oocyte polarization via ooplasmic segregation.}, author = {Shamipour, Shayan and Kardos, Roland and Xue, Shi-lei and Hof, Björn and Hannezo, Edouard B and Heisenberg, Carl-Philipp J}, issn = {10974172}, journal = {Cell}, number = {6}, pages = {1463--1479.e18}, publisher = {Elsevier}, title = {{Bulk actin dynamics drive phase segregation in zebrafish oocytes}}, doi = {10.1016/j.cell.2019.04.030}, volume = {177}, year = {2019}, } @article{7001, author = {Schwayer, Cornelia and Shamipour, Shayan and Pranjic-Ferscha, Kornelija and Schauer, Alexandra and Balda, M and Tada, M and Matter, K and Heisenberg, Carl-Philipp J}, issn = {1097-4172}, journal = {Cell}, number = {4}, pages = {937--952.e18}, publisher = {Cell Press}, title = {{Mechanosensation of tight junctions depends on ZO-1 phase separation and flow}}, doi = {10.1016/j.cell.2019.10.006}, volume = {179}, year = {2019}, } @phdthesis{6891, abstract = {While cells of mesenchymal or epithelial origin perform their effector functions in a purely anchorage dependent manner, cells derived from the hematopoietic lineage are not committed to operate only within a specific niche. Instead, these cells are able to function autonomously of the molecular composition in a broad range of tissue compartments. By this means, cells of the hematopoietic lineage retain the capacity to disseminate into connective tissue and recirculate between organs, building the foundation for essential processes such as tissue regeneration or immune surveillance. Cells of the immune system, specifically leukocytes, are extraordinarily good at performing this task. These cells are able to flexibly shift their mode of migration between an adhesion-mediated and an adhesion-independent manner, instantaneously accommodating for any changes in molecular composition of the external scaffold. The key component driving directed leukocyte migration is the chemokine receptor 7, which guides the cell along gradients of chemokine ligand. Therefore, the physical destination of migrating leukocytes is purely deterministic, i.e. given by global directional cues such as chemokine gradients. Nevertheless, these cells typically reside in three-dimensional scaffolds of inhomogeneous complexity, raising the question whether cells are able to locally discriminate between multiple optional migration routes. Current literature provides evidence that leukocytes, specifically dendritic cells, do indeed probe their surrounding by virtue of multiple explorative protrusions. However, it remains enigmatic how these cells decide which one is the more favorable route to follow and what are the key players involved in performing this task. Due to the heterogeneous environment of most tissues, and the vast adaptability of migrating leukocytes, at this time it is not clear to what extent leukocytes are able to optimize their migratory strategy by adapting their level of adhesiveness. And, given the fact that leukocyte migration is characterized by branched cell shapes in combination with high migration velocities, it is reasonable to assume that these cells require fine tuned shape maintenance mechanisms that tightly coordinate protrusion and adhesion dynamics in a spatiotemporal manner. Therefore, this study aimed to elucidate how rapidly migrating leukocytes opt for an ideal migratory path while maintaining a continuous cell shape and balancing adhesive forces to efficiently navigate through complex microenvironments. The results of this study unraveled a role for the microtubule cytoskeleton in promoting the decision making process during path finding and for the first time point towards a microtubule-mediated function in cell shape maintenance of highly ramified cells such as dendritic cells. Furthermore, we found that migrating low-adhesive leukocytes are able to instantaneously adapt to increased tensile load by engaging adhesion receptors. This response was only occurring tangential to the substrate while adhesive properties in the vertical direction were not increased. As leukocytes are primed for rapid migration velocities, these results demonstrate that leukocyte integrins are able to confer a high level of traction forces parallel to the cell membrane along the direction of migration without wasting energy in gluing the cell to the substrate. Thus, the data in the here presented thesis provide new insights into the pivotal role of cytoskeletal dynamics and the mechanisms of force transduction during leukocyte migration. Thereby the here presented results help to further define fundamental principles underlying leukocyte migration and open up potential therapeutic avenues of clinical relevance. }, author = {Kopf, Aglaja}, isbn = {978-3-99078-002-2}, issn = {2663-337X}, keywords = {cell biology, immunology, leukocyte, migration, microfluidics}, pages = {171}, publisher = {Institute of Science and Technology Austria}, title = {{The implication of cytoskeletal dynamics on leukocyte migration}}, doi = {10.15479/AT:ISTA:6891}, year = {2019}, } @article{6328, abstract = {During metazoan development, immune surveillance and cancer dissemination, cells migrate in complex three-dimensional microenvironments1,2,3. These spaces are crowded by cells and extracellular matrix, generating mazes with differently sized gaps that are typically smaller than the diameter of the migrating cell4,5. Most mesenchymal and epithelial cells and some—but not all—cancer cells actively generate their migratory path using pericellular tissue proteolysis6. By contrast, amoeboid cells such as leukocytes use non-destructive strategies of locomotion7, raising the question how these extremely fast cells navigate through dense tissues. Here we reveal that leukocytes sample their immediate vicinity for large pore sizes, and are thereby able to choose the path of least resistance. This allows them to circumnavigate local obstacles while effectively following global directional cues such as chemotactic gradients. Pore-size discrimination is facilitated by frontward positioning of the nucleus, which enables the cells to use their bulkiest compartment as a mechanical gauge. Once the nucleus and the closely associated microtubule organizing centre pass the largest pore, cytoplasmic protrusions still lingering in smaller pores are retracted. These retractions are coordinated by dynamic microtubules; when microtubules are disrupted, migrating cells lose coherence and frequently fragment into migratory cytoplasmic pieces. As nuclear positioning in front of the microtubule organizing centre is a typical feature of amoeboid migration, our findings link the fundamental organization of cellular polarity to the strategy of locomotion.}, author = {Renkawitz, Jörg and Kopf, Aglaja and Stopp, Julian A and de Vries, Ingrid and Driscoll, Meghan K. and Merrin, Jack and Hauschild, Robert and Welf, Erik S. and Danuser, Gaudenz and Fiolka, Reto and Sixt, Michael K}, journal = {Nature}, pages = {546--550}, publisher = {Springer Nature}, title = {{Nuclear positioning facilitates amoeboid migration along the path of least resistance}}, doi = {10.1038/s41586-019-1087-5}, volume = {568}, year = {2019}, } @article{6877, author = {Kopf, Aglaja and Sixt, Michael K}, issn = {1097-4172}, journal = {Cell}, number = {1}, pages = {51--53}, publisher = {Elsevier}, title = {{The neural crest pitches in to remove apoptotic debris}}, doi = {10.1016/j.cell.2019.08.047}, volume = {179}, year = {2019}, } @article{6830, author = {Contreras, Ximena and Hippenmeyer, Simon}, issn = {10974199}, journal = {Neuron}, number = {5}, pages = {750--752}, publisher = {Elsevier}, title = {{Memo1 tiles the radial glial cell grid}}, doi = {10.1016/j.neuron.2019.08.021}, volume = {103}, year = {2019}, } @article{6627, abstract = {Cortical microtubule arrays in elongating epidermal cells in both the root and stem of plants have the propensity of dynamic reorientations that are correlated with the activation or inhibition of growth. Factors regulating plant growth, among them the hormone auxin, have been recognized as regulators of microtubule array orientations. Some previous work in the field has aimed at elucidating the causal relationship between cell growth, the signaling of auxin or other growth-regulating factors, and microtubule array reorientations, with various conclusions. Here, we revisit this problem of causality with a comprehensive set of experiments in Arabidopsis thaliana, using the now available pharmacological and genetic tools. We use isolated, auxin-depleted hypocotyls, an experimental system allowing for full control of both growth and auxin signaling. We demonstrate that reorientation of microtubules is not directly triggered by an auxin signal during growth activation. Instead, reorientation is triggered by the activation of the growth process itself and is auxin-independent in its nature. We discuss these findings in the context of previous relevant work, including that on the mechanical regulation of microtubule array orientation.}, author = {Adamowski, Maciek and Li, Lanxin and Friml, Jiří}, issn = {1422-0067}, journal = {International Journal of Molecular Sciences}, number = {13}, publisher = {MDPI}, title = {{Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling}}, doi = {10.3390/ijms20133337}, volume = {20}, year = {2019}, } @article{7117, abstract = {We propose a novel generic shape optimization method for CAD models based on the eXtended Finite Element Method (XFEM). Our method works directly on the intersection between the model and a regular simulation grid, without the need to mesh or remesh, thus removing a bottleneck of classical shape optimization strategies. This is made possible by a novel hierarchical integration scheme that accurately integrates finite element quantities with sub-element precision. For optimization, we efficiently compute analytical shape derivatives of the entire framework, from model intersection to integration rule generation and XFEM simulation. Moreover, we describe a differentiable projection of shape parameters onto a constraint manifold spanned by user-specified shape preservation, consistency, and manufacturability constraints. We demonstrate the utility of our approach by optimizing mass distribution, strength-to-weight ratio, and inverse elastic shape design objectives directly on parameterized 3D CAD models.}, author = {Hafner, Christian and Schumacher, Christian and Knoop, Espen and Auzinger, Thomas and Bickel, Bernd and Bächer, Moritz}, issn = {0730-0301}, journal = {ACM Transactions on Graphics}, number = {6}, publisher = {ACM}, title = {{X-CAD: Optimizing CAD Models with Extended Finite Elements}}, doi = {10.1145/3355089.3356576}, volume = {38}, year = {2019}, } @article{6189, abstract = {Suspended particles can alter the properties of fluids and in particular also affect the transition fromlaminar to turbulent flow. An earlier study [Mataset al.,Phys. Rev. Lett.90, 014501 (2003)] reported howthe subcritical (i.e., hysteretic) transition to turbulent puffs is affected by the addition of particles. Here weshow that in addition to this known transition, with increasing concentration a supercritical (i.e.,continuous) transition to a globally fluctuating state is found. At the same time the Newtonian-typetransition to puffs is delayed to larger Reynolds numbers. At even higher concentration only the globallyfluctuating state is found. The dynamics of particle laden flows are hence determined by two competinginstabilities that give rise to three flow regimes: Newtonian-type turbulence at low, a particle inducedglobally fluctuating state at high, and a coexistence state at intermediate concentrations.}, author = {Agrawal, Nishchal and Choueiri, George H and Hof, Björn}, issn = {10797114}, journal = {Physical Review Letters}, number = {11}, publisher = {American Physical Society}, title = {{Transition to turbulence in particle laden flows}}, doi = {10.1103/PhysRevLett.122.114502}, volume = {122}, year = {2019}, } @phdthesis{6371, abstract = {Decades of studies have revealed the mechanisms of gene regulation in molecular detail. We make use of such well-described regulatory systems to explore how the molecular mechanisms of protein-protein and protein-DNA interactions shape the dynamics and evolution of gene regulation. i) We uncover how the biophysics of protein-DNA binding determines the potential of regulatory networks to evolve and adapt, which can be captured using a simple mathematical model. ii) The evolution of regulatory connections can lead to a significant amount of crosstalk between binding proteins. We explore the effect of crosstalk on gene expression from a target promoter, which seems to be modulated through binding competition at non-specific DNA sites. iii) We investigate how the very same biophysical characteristics as in i) can generate significant fitness costs for cells through global crosstalk, meaning non-specific DNA binding across the genomic background. iv) Binding competition between proteins at a target promoter is a prevailing regulatory feature due to the prevalence of co-regulation at bacterial promoters. However, the dynamics of these systems are not always straightforward to determine even if the molecular mechanisms of regulation are known. A detailed model of the biophysical interactions reveals that interference between the regulatory proteins can constitute a new, generic form of system memory that records the history of the input signals at the promoter. We demonstrate how the biophysics of protein-DNA binding can be harnessed to investigate the principles that shape and ultimately limit cellular gene regulation. These results provide a basis for studies of higher-level functionality, which arises from the underlying regulation. }, author = {Igler, Claudia}, issn = {2663-337X}, keywords = {gene regulation, biophysics, transcription factor binding, bacteria}, pages = {152}, publisher = {Institute of Science and Technology Austria}, title = {{On the nature of gene regulatory design - The biophysics of transcription factor binding shapes gene regulation}}, doi = {10.15479/AT:ISTA:6371}, year = {2019}, } @article{10286, abstract = {In this paper, we evaluate clock signals generated in ring oscillators and self-timed rings and the way their jitter can be transformed into random numbers. We show that counting the periods of the jittery clock signal produces random numbers of significantly better quality than the methods in which the jittery signal is simply sampled (the case in almost all current methods). Moreover, we use the counter values to characterize and continuously monitor the source of randomness. However, instead of using the widely used statistical variance, we propose to use Allan variance to do so. There are two main advantages: Allan variance is insensitive to low frequency noises such as flicker noise that are known to be autocorrelated and significantly less circuitry is required for its computation than that used to compute commonly used variance. We also show that it is essential to use a differential principle of randomness extraction from the jitter based on the use of two identical oscillators to avoid autocorrelations originating from external and internal global jitter sources and that this fact is valid for both kinds of rings. Last but not least, we propose a method of statistical testing based on high order Markov model to show the reduced dependencies when the proposed randomness extraction is applied.}, author = {Allini, Elie Noumon and Skórski, Maciej and Petura, Oto and Bernard, Florent and Laban, Marek and Fischer, Viktor}, issn = {2569-2925}, journal = {IACR Transactions on Cryptographic Hardware and Embedded Systems}, number = {3}, pages = {214--242}, publisher = {International Association for Cryptologic Research}, title = {{Evaluation and monitoring of free running oscillators serving as source of randomness}}, doi = {10.13154/tches.v2018.i3.214-242}, volume = {2018}, year = {2018}, } @inproceedings{10883, abstract = {Solving parity games, which are equivalent to modal μ-calculus model checking, is a central algorithmic problem in formal methods, with applications in reactive synthesis, program repair, verification of branching-time properties, etc. Besides the standard compu- tation model with the explicit representation of games, another important theoretical model of computation is that of set-based symbolic algorithms. Set-based symbolic algorithms use basic set operations and one-step predecessor operations on the implicit description of games, rather than the explicit representation. The significance of symbolic algorithms is that they provide scalable algorithms for large finite-state systems, as well as for infinite-state systems with finite quotient. Consider parity games on graphs with n vertices and parity conditions with d priorities. While there is a rich literature of explicit algorithms for parity games, the main results for set-based symbolic algorithms are as follows: (a) the basic algorithm that requires O(nd) symbolic operations and O(d) symbolic space; and (b) an improved algorithm that requires O(nd/3+1) symbolic operations and O(n) symbolic space. In this work, our contributions are as follows: (1) We present a black-box set-based symbolic algorithm based on the explicit progress measure algorithm. Two important consequences of our algorithm are as follows: (a) a set-based symbolic algorithm for parity games that requires quasi-polynomially many symbolic operations and O(n) symbolic space; and (b) any future improvement in progress measure based explicit algorithms immediately imply an efficiency improvement in our set-based symbolic algorithm for parity games. (2) We present a set-based symbolic algorithm that requires quasi-polynomially many symbolic operations and O(d · log n) symbolic space. Moreover, for the important special case of d ≤ log n, our algorithm requires only polynomially many symbolic operations and poly-logarithmic symbolic space.}, author = {Chatterjee, Krishnendu and Dvořák, Wolfgang and Henzinger, Monika H and Svozil, Alexander}, booktitle = {22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning}, issn = {2398-7340}, location = {Awassa, Ethiopia}, pages = {233--253}, publisher = {EasyChair}, title = {{Quasipolynomial set-based symbolic algorithms for parity games}}, doi = {10.29007/5z5k}, volume = {57}, year = {2018}, } @inproceedings{11, abstract = {We report on a novel strategy to derive mean-field limits of quantum mechanical systems in which a large number of particles weakly couple to a second-quantized radiation field. The technique combines the method of counting and the coherent state approach to study the growth of the correlations among the particles and in the radiation field. As an instructional example, we derive the Schrödinger–Klein–Gordon system of equations from the Nelson model with ultraviolet cutoff and possibly massless scalar field. In particular, we prove the convergence of the reduced density matrices (of the nonrelativistic particles and the field bosons) associated with the exact time evolution to the projectors onto the solutions of the Schrödinger–Klein–Gordon equations in trace norm. Furthermore, we derive explicit bounds on the rate of convergence of the one-particle reduced density matrix of the nonrelativistic particles in Sobolev norm.}, author = {Leopold, Nikolai K and Pickl, Peter}, location = {Munich, Germany}, pages = {185 -- 214}, publisher = {Springer}, title = {{Mean-field limits of particles in interaction with quantised radiation fields}}, doi = {10.1007/978-3-030-01602-9_9}, volume = {270}, year = {2018}, } @article{1215, abstract = {Two generalizations of Itô formula to infinite-dimensional spaces are given. The first one, in Hilbert spaces, extends the classical one by taking advantage of cancellations when they occur in examples and it is applied to the case of a group generator. The second one, based on the previous one and a limit procedure, is an Itô formula in a special class of Banach spaces having a product structure with the noise in a Hilbert component; again the key point is the extension due to a cancellation. This extension to Banach spaces and in particular the specific cancellation are motivated by path-dependent Itô calculus.}, author = {Flandoli, Franco and Russo, Francesco and Zanco, Giovanni A}, journal = {Journal of Theoretical Probability}, number = {2}, pages = {789--826}, publisher = {Springer}, title = {{Infinite-dimensional calculus under weak spatial regularity of the processes}}, doi = {10.1007/s10959-016-0724-2}, volume = {31}, year = {2018}, } @inproceedings{185, abstract = {We resolve in the affirmative conjectures of A. Skopenkov and Repovš (1998), and M. Skopenkov (2003) generalizing the classical Hanani-Tutte theorem to the setting of approximating maps of graphs on 2-dimensional surfaces by embeddings. Our proof of this result is constructive and almost immediately implies an efficient algorithm for testing whether a given piecewise linear map of a graph in a surface is approximable by an embedding. More precisely, an instance of this problem consists of (i) a graph G whose vertices are partitioned into clusters and whose inter-cluster edges are partitioned into bundles, and (ii) a region R of a 2-dimensional compact surface M given as the union of a set of pairwise disjoint discs corresponding to the clusters and a set of pairwise disjoint "pipes" corresponding to the bundles, connecting certain pairs of these discs. We are to decide whether G can be embedded inside M so that the vertices in every cluster are drawn in the corresponding disc, the edges in every bundle pass only through its corresponding pipe, and every edge crosses the boundary of each disc at most once.}, author = {Fulek, Radoslav and Kynčl, Jan}, isbn = {978-3-95977-066-8}, location = {Budapest, Hungary}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Hanani-Tutte for approximating maps of graphs}}, doi = {10.4230/LIPIcs.SoCG.2018.39}, volume = {99}, year = {2018}, } @inproceedings{188, abstract = {Smallest enclosing spheres of finite point sets are central to methods in topological data analysis. Focusing on Bregman divergences to measure dissimilarity, we prove bounds on the location of the center of a smallest enclosing sphere. These bounds depend on the range of radii for which Bregman balls are convex.}, author = {Edelsbrunner, Herbert and Virk, Ziga and Wagner, Hubert}, location = {Budapest, Hungary}, pages = {35:1 -- 35:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Smallest enclosing spheres and Chernoff points in Bregman geometry}}, doi = {10.4230/LIPIcs.SoCG.2018.35}, volume = {99}, year = {2018}, } @article{306, abstract = {A cornerstone of statistical inference, the maximum entropy framework is being increasingly applied to construct descriptive and predictive models of biological systems, especially complex biological networks, from large experimental data sets. Both its broad applicability and the success it obtained in different contexts hinge upon its conceptual simplicity and mathematical soundness. Here we try to concisely review the basic elements of the maximum entropy principle, starting from the notion of ‘entropy’, and describe its usefulness for the analysis of biological systems. As examples, we focus specifically on the problem of reconstructing gene interaction networks from expression data and on recent work attempting to expand our system-level understanding of bacterial metabolism. Finally, we highlight some extensions and potential limitations of the maximum entropy approach, and point to more recent developments that are likely to play a key role in the upcoming challenges of extracting structures and information from increasingly rich, high-throughput biological data.}, author = {De Martino, Andrea and De Martino, Daniele}, journal = {Heliyon}, number = {4}, publisher = {Elsevier}, title = {{An introduction to the maximum entropy approach and its application to inference problems in biology}}, doi = {10.1016/j.heliyon.2018.e00596}, volume = {4}, year = {2018}, } @book{3300, abstract = {This book first explores the origins of this idea, grounded in theoretical work on temporal logic and automata. The editors and authors are among the world's leading researchers in this domain, and they contributed 32 chapters representing a thorough view of the development and application of the technique. Topics covered include binary decision diagrams, symbolic model checking, satisfiability modulo theories, partial-order reduction, abstraction, interpolation, concurrency, security protocols, games, probabilistic model checking, and process algebra, and chapters on the transfer of theory to industrial practice, property specification languages for hardware, and verification of real-time systems and hybrid systems. The book will be valuable for researchers and graduate students engaged with the development of formal methods and verification tools.}, author = {Clarke, Edmund M. and Henzinger, Thomas A and Veith, Helmut and Bloem, Roderick}, isbn = {978-3-319-10574-1}, pages = {XLVIII, 1212}, publisher = {Springer Nature}, title = {{Handbook of Model Checking}}, doi = {10.1007/978-3-319-10575-8}, year = {2018}, } @inbook{37, abstract = {Developmental processes are inherently dynamic and understanding them requires quantitative measurements of gene and protein expression levels in space and time. While live imaging is a powerful approach for obtaining such data, it is still a challenge to apply it over long periods of time to large tissues, such as the embryonic spinal cord in mouse and chick. Nevertheless, dynamics of gene expression and signaling activity patterns in this organ can be studied by collecting tissue sections at different developmental stages. In combination with immunohistochemistry, this allows for measuring the levels of multiple developmental regulators in a quantitative manner with high spatiotemporal resolution. The mean protein expression levels over time, as well as embryo-to-embryo variability can be analyzed. A key aspect of the approach is the ability to compare protein levels across different samples. This requires a number of considerations in sample preparation, imaging and data analysis. Here we present a protocol for obtaining time course data of dorsoventral expression patterns from mouse and chick neural tube in the first 3 days of neural tube development. The described workflow starts from embryo dissection and ends with a processed dataset. Software scripts for data analysis are included. The protocol is adaptable and instructions that allow the user to modify different steps are provided. Thus, the procedure can be altered for analysis of time-lapse images and applied to systems other than the neural tube.}, author = {Zagórski, Marcin P and Kicheva, Anna}, booktitle = {Morphogen Gradients }, isbn = {978-1-4939-8771-9}, issn = {1064-3745}, pages = {47 -- 63}, publisher = {Springer Nature}, title = {{Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube}}, doi = {10.1007/978-1-4939-8772-6_4}, volume = {1863}, year = {2018}, } @article{305, abstract = {The hanging-drop network (HDN) is a technology platform based on a completely open microfluidic network at the bottom of an inverted, surface-patterned substrate. The platform is predominantly used for the formation, culturing, and interaction of self-assembled spherical microtissues (spheroids) under precisely controlled flow conditions. Here, we describe design, fabrication, and operation of microfluidic hanging-drop networks.}, author = {Misun, Patrick and Birchler, Axel and Lang, Moritz and Hierlemann, Andreas and Frey, Olivier}, journal = {Methods in Molecular Biology}, pages = {183 -- 202}, publisher = {Springer}, title = {{Fabrication and operation of microfluidic hanging drop networks}}, doi = {10.1007/978-1-4939-7792-5_15}, volume = {1771}, year = {2018}, } @inproceedings{325, abstract = {Probabilistic programs extend classical imperative programs with real-valued random variables and random branching. The most basic liveness property for such programs is the termination property. The qualitative (aka almost-sure) termination problem asks whether a given program program terminates with probability 1. While ranking functions provide a sound and complete method for non-probabilistic programs, the extension of them to probabilistic programs is achieved via ranking supermartingales (RSMs). Although deep theoretical results have been established about RSMs, their application to probabilistic programs with nondeterminism has been limited only to programs of restricted control-flow structure. For non-probabilistic programs, lexicographic ranking functions provide a compositional and practical approach for termination analysis of real-world programs. In this work we introduce lexicographic RSMs and show that they present a sound method for almost-sure termination of probabilistic programs with nondeterminism. We show that lexicographic RSMs provide a tool for compositional reasoning about almost-sure termination, and for probabilistic programs with linear arithmetic they can be synthesized efficiently (in polynomial time). We also show that with additional restrictions even asymptotic bounds on expected termination time can be obtained through lexicographic RSMs. Finally, we present experimental results on benchmarks adapted from previous work to demonstrate the effectiveness of our approach.}, author = {Agrawal, Sheshansh and Chatterjee, Krishnendu and Novotny, Petr}, location = {Los Angeles, CA, USA}, number = {POPL}, publisher = {ACM}, title = {{Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs}}, doi = {10.1145/3158122}, volume = {2}, year = {2018}, } @inbook{408, abstract = {Adventitious roots (AR) are de novo formed roots that emerge from any part of the plant or from callus in tissue culture, except root tissue. The plant tissue origin and the method by which they are induced determine the physiological properties of emerged ARs. Hence, a standard method encompassing all types of AR does not exist. Here we describe a method for the induction and analysis of AR that emerge from the etiolated hypocotyl of dicot plants. The hypocotyl is formed during embryogenesis and shows a determined developmental pattern which usually does not involve AR formation. However, the hypocotyl shows propensity to form de novo roots under specific circumstances such as removal of the root system, high humidity or flooding, or during de-etiolation. The hypocotyl AR emerge from a pericycle-like cell layer surrounding the vascular tissue of the central cylinder, which is reminiscent to the developmental program of lateral roots. Here we propose an easy protocol for in vitro hypocotyl AR induction from etiolated Arabidopsis seedlings.}, author = {Trinh, Hoang and Verstraeten, Inge and Geelen, Danny}, booktitle = {Root Development }, issn = {1064-3745}, pages = {95 -- 102}, publisher = {Springer Nature}, title = {{In vitro assay for induction of adventitious rooting on intact arabidopsis hypocotyls}}, doi = {10.1007/978-1-4939-7747-5_7}, volume = {1761}, year = {2018}, } @inbook{411, abstract = {Immunolocalization is a valuable tool for cell biology research that allows to rapidly determine the localization and expression levels of endogenous proteins. In plants, whole-mount in situ immunolocalization remains a challenging method, especially in tissues protected by waxy layers and complex cell wall carbohydrates. Here, we present a robust method for whole-mount in situ immunolocalization in primary root meristems and lateral root primordia in Arabidopsis thaliana. For good epitope preservation, fixation is done in an alkaline paraformaldehyde/glutaraldehyde mixture. This fixative is suitable for detecting a wide range of proteins, including integral transmembrane proteins and proteins peripherally attached to the plasma membrane. From initiation until emergence from the primary root, lateral root primordia are surrounded by several layers of differentiated tissues with a complex cell wall composition that interferes with the efficient penetration of all buffers. Therefore, immunolocalization in early lateral root primordia requires a modified method, including a strong solvent treatment for removal of hydrophobic barriers and a specific cocktail of cell wall-degrading enzymes. The presented method allows for easy, reliable, and high-quality in situ detection of the subcellular localization of endogenous proteins in primary and lateral root meristems without the need of time-consuming crosses or making translational fusions to fluorescent proteins.}, author = {Karampelias, Michael and Tejos, Ricardo and Friml, Jirí and Vanneste, Steffen}, booktitle = {Root Development. Methods and Protocols}, editor = {Ristova, Daniela and Barbez, Elke}, pages = {131 -- 143}, publisher = {Springer}, title = {{Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia}}, doi = {10.1007/978-1-4939-7747-5_10}, volume = {1761}, year = {2018}, } @article{456, abstract = {Inhibition of the endoplasmic reticulum stress pathway may hold the key to Zika virus-associated microcephaly treatment. }, author = {Novarino, Gaia}, journal = {Science Translational Medicine}, number = {423}, publisher = {American Association for the Advancement of Science}, title = {{Zika-associated microcephaly: Reduce the stress and race for the treatment}}, doi = {10.1126/scitranslmed.aar7514}, volume = {10}, year = {2018}, } @article{536, abstract = {We consider the problem of consensus in the challenging classic model. In this model, the adversary is adaptive; it can choose which processors crash at any point during the course of the algorithm. Further, communication is via asynchronous message passing: there is no known upper bound on the time to send a message from one processor to another, and all messages and coin flips are seen by the adversary. We describe a new randomized consensus protocol with expected message complexity O(n2log2n) when fewer than n / 2 processes may fail by crashing. This is an almost-linear improvement over the best previously known protocol, and within logarithmic factors of a known Ω(n2) message lower bound. The protocol further ensures that no process sends more than O(nlog3n) messages in expectation, which is again within logarithmic factors of optimal. We also present a generalization of the algorithm to an arbitrary number of failures t, which uses expected O(nt+t2log2t) total messages. Our approach is to build a message-efficient, resilient mechanism for aggregating individual processor votes, implementing the message-passing equivalent of a weak shared coin. Roughly, in our protocol, a processor first announces its votes to small groups, then propagates them to increasingly larger groups as it generates more and more votes. To bound the number of messages that an individual process might have to send or receive, the protocol progressively increases the weight of generated votes. The main technical challenge is bounding the impact of votes that are still “in flight” (generated, but not fully propagated) on the final outcome of the shared coin, especially since such votes might have different weights. We achieve this by leveraging the structure of the algorithm, and a technical argument based on martingale concentration bounds. Overall, we show that it is possible to build an efficient message-passing implementation of a shared coin, and in the process (almost-optimally) solve the classic consensus problem in the asynchronous message-passing model.}, author = {Alistarh, Dan-Adrian and Aspnes, James and King, Valerie and Saia, Jared}, issn = {01782770}, journal = {Distributed Computing}, number = {6}, pages = {489--501}, publisher = {Springer}, title = {{Communication-efficient randomized consensus}}, doi = {10.1007/s00446-017-0315-1}, volume = {31}, year = {2018}, } @article{554, abstract = {We analyse the canonical Bogoliubov free energy functional in three dimensions at low temperatures in the dilute limit. We prove existence of a first-order phase transition and, in the limit (Formula presented.), we determine the critical temperature to be (Formula presented.) to leading order. Here, (Formula presented.) is the critical temperature of the free Bose gas, ρ is the density of the gas and a is the scattering length of the pair-interaction potential V. We also prove asymptotic expansions for the free energy. In particular, we recover the Lee–Huang–Yang formula in the limit (Formula presented.).}, author = {Napiórkowski, Marcin M and Reuvers, Robin and Solovej, Jan}, issn = {00103616}, journal = {Communications in Mathematical Physics}, number = {1}, pages = {347--403}, publisher = {Springer}, title = {{The Bogoliubov free energy functional II: The dilute Limit}}, doi = {10.1007/s00220-017-3064-x}, volume = {360}, year = {2018}, } @inbook{562, abstract = {Primary neuronal cell culture preparations are widely used to investigate synaptic functions. This chapter describes a detailed protocol for the preparation of a neuronal cell culture in which giant calyx-type synaptic terminals are formed. This chapter also presents detailed protocols for utilizing the main technical advantages provided by such a preparation, namely, labeling and imaging of synaptic organelles and electrophysiological recordings directly from presynaptic terminals.}, author = {Dimitrov, Dimitar and Guillaud, Laurent and Eguchi, Kohgaku and Takahashi, Tomoyuki}, booktitle = {Neurotrophic Factors}, editor = {Skaper, Stephen D.}, pages = {201 -- 215}, publisher = {Springer}, title = {{Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses}}, doi = {10.1007/978-1-4939-7571-6_15}, volume = {1727}, year = {2018}, } @inbook{59, abstract = {Graph-based games are an important tool in computer science. They have applications in synthesis, verification, refinement, and far beyond. We review graphbased games with objectives on infinite plays. We give definitions and algorithms to solve the games and to give a winning strategy. The objectives we consider are mostly Boolean, but we also look at quantitative graph-based games and their objectives. Synthesis aims to turn temporal logic specifications into correct reactive systems. We explain the reduction of synthesis to graph-based games (or equivalently tree automata) using synthesis of LTL specifications as an example. We treat the classical approach that uses determinization of parity automata and more modern approaches.}, author = {Bloem, Roderick and Chatterjee, Krishnendu and Jobstmann, Barbara}, booktitle = {Handbook of Model Checking}, editor = {Henzinger, Thomas A and Clarke, Edmund M. and Veith, Helmut and Bloem, Roderick}, isbn = {978-3-319-10574-1}, pages = {921 -- 962}, publisher = {Springer}, title = {{Graph games and reactive synthesis}}, doi = {10.1007/978-3-319-10575-8_27}, year = {2018}, } @inbook{60, abstract = {Model checking is a computer-assisted method for the analysis of dynamical systems that can be modeled by state-transition systems. Drawing from research traditions in mathematical logic, programming languages, hardware design, and theoretical computer science, model checking is now widely used for the verification of hardware and software in industry. This chapter is an introduction and short survey of model checking. The chapter aims to motivate and link the individual chapters of the handbook, and to provide context for readers who are not familiar with model checking.}, author = {Clarke, Edmund and Henzinger, Thomas A and Veith, Helmut}, booktitle = {Handbook of Model Checking}, editor = {Henzinger, Thomas A}, pages = {1 -- 26}, publisher = {Springer}, title = {{Introduction to model checking}}, doi = {10.1007/978-3-319-10575-8_1}, year = {2018}, } @inbook{61, abstract = {We prove that there is no strongly regular graph (SRG) with parameters (460; 153; 32; 60). The proof is based on a recent lower bound on the number of 4-cliques in a SRG and some applications of Euclidean representation of SRGs. }, author = {Bondarenko, Andriy and Mellit, Anton and Prymak, Andriy and Radchenko, Danylo and Viazovska, Maryna}, booktitle = {Contemporary Computational Mathematics}, pages = {131 -- 134}, publisher = {Springer}, title = {{There is no strongly regular graph with parameters (460; 153; 32; 60)}}, doi = {10.1007/978-3-319-72456-0_7}, year = {2018}, } @article{6354, abstract = {Blood platelets are critical for hemostasis and thrombosis, but also play diverse roles during immune responses. We have recently reported that platelets migrate at sites of infection in vitro and in vivo. Importantly, platelets use their ability to migrate to collect and bundle fibrin (ogen)-bound bacteria accomplishing efficient intravascular bacterial trapping. Here, we describe a method that allows analyzing platelet migration in vitro, focusing on their ability to collect bacteria and trap bacteria under flow.}, author = {Fan, Shuxia and Lorenz, Michael and Massberg, Steffen and Gärtner, Florian R}, issn = {2331-8325}, journal = {Bio-Protocol}, keywords = {Platelets, Cell migration, Bacteria, Shear flow, Fibrinogen, E. coli}, number = {18}, publisher = {Bio-Protocol}, title = {{Platelet migration and bacterial trapping assay under flow}}, doi = {10.21769/bioprotoc.3018}, volume = {8}, year = {2018}, } @inbook{6525, abstract = {This chapter finds an agreement of equivariant indices of semi-classical homomorphisms between pairwise mirror branes in the GL2 Higgs moduli space on a Riemann surface. On one side of the agreement, components of the Lagrangian brane of U(1,1) Higgs bundles, whose mirror was proposed by Hitchin to be certain even exterior powers of the hyperholomorphic Dirac bundle on the SL2 Higgs moduli space, are present. The agreement arises from a mysterious functional equation. This gives strong computational evidence for Hitchin’s proposal.}, author = {Hausel, Tamás and Mellit, Anton and Pei, Du}, booktitle = {Geometry and Physics: Volume I}, isbn = {9780198802013}, pages = {189--218}, publisher = {Oxford University Press}, title = {{Mirror symmetry with branes by equivariant verlinde formulas}}, doi = {10.1093/oso/9780198802013.003.0009}, year = {2018}, } @article{690, abstract = {We consider spectral properties and the edge universality of sparse random matrices, the class of random matrices that includes the adjacency matrices of the Erdős–Rényi graph model G(N, p). We prove a local law for the eigenvalue density up to the spectral edges. Under a suitable condition on the sparsity, we also prove that the rescaled extremal eigenvalues exhibit GOE Tracy–Widom fluctuations if a deterministic shift of the spectral edge due to the sparsity is included. For the adjacency matrix of the Erdős–Rényi graph this establishes the Tracy–Widom fluctuations of the second largest eigenvalue when p is much larger than N−2/3 with a deterministic shift of order (Np)−1.}, author = {Lee, Jii and Schnelli, Kevin}, journal = {Probability Theory and Related Fields}, number = {1-2}, publisher = {Springer}, title = {{Local law and Tracy–Widom limit for sparse random matrices}}, doi = {10.1007/s00440-017-0787-8}, volume = {171}, year = {2018}, } @article{703, abstract = {We consider the NP-hard problem of MAP-inference for undirected discrete graphical models. We propose a polynomial time and practically efficient algorithm for finding a part of its optimal solution. Specifically, our algorithm marks some labels of the considered graphical model either as (i) optimal, meaning that they belong to all optimal solutions of the inference problem; (ii) non-optimal if they provably do not belong to any solution. With access to an exact solver of a linear programming relaxation to the MAP-inference problem, our algorithm marks the maximal possible (in a specified sense) number of labels. We also present a version of the algorithm, which has access to a suboptimal dual solver only and still can ensure the (non-)optimality for the marked labels, although the overall number of the marked labels may decrease. We propose an efficient implementation, which runs in time comparable to a single run of a suboptimal dual solver. Our method is well-scalable and shows state-of-the-art results on computational benchmarks from machine learning and computer vision.}, author = {Shekhovtsov, Alexander and Swoboda, Paul and Savchynskyy, Bogdan}, issn = {01628828}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, number = {7}, pages = {1668--1682}, publisher = {IEEE}, title = {{Maximum persistency via iterative relaxed inference with graphical models}}, doi = {10.1109/TPAMI.2017.2730884}, volume = {40}, year = {2018}, } @inproceedings{7116, abstract = {Training deep learning models has received tremendous research interest recently. In particular, there has been intensive research on reducing the communication cost of training when using multiple computational devices, through reducing the precision of the underlying data representation. Naturally, such methods induce system trade-offs—lowering communication precision could de-crease communication overheads and improve scalability; but, on the other hand, it can also reduce the accuracy of training. In this paper, we study this trade-off space, and ask:Can low-precision communication consistently improve the end-to-end performance of training modern neural networks, with no accuracy loss?From the performance point of view, the answer to this question may appear deceptively easy: compressing communication through low precision should help when the ratio between communication and computation is high. However, this answer is less straightforward when we try to generalize this principle across various neural network architectures (e.g., AlexNet vs. ResNet),number of GPUs (e.g., 2 vs. 8 GPUs), machine configurations(e.g., EC2 instances vs. NVIDIA DGX-1), communication primitives (e.g., MPI vs. NCCL), and even different GPU architectures(e.g., Kepler vs. Pascal). Currently, it is not clear how a realistic realization of all these factors maps to the speed up provided by low-precision communication. In this paper, we conduct an empirical study to answer this question and report the insights.}, author = {Grubic, Demjan and Tam, Leo and Alistarh, Dan-Adrian and Zhang, Ce}, booktitle = {Proceedings of the 21st International Conference on Extending Database Technology}, isbn = {9783893180783}, issn = {2367-2005}, location = {Vienna, Austria}, pages = {145--156}, publisher = {OpenProceedings}, title = {{Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study}}, doi = {10.5441/002/EDBT.2018.14}, year = {2018}, } @inproceedings{7407, abstract = {Proofs of space (PoS) [Dziembowski et al., CRYPTO'15] are proof systems where a prover can convince a verifier that he "wastes" disk space. PoS were introduced as a more ecological and economical replacement for proofs of work which are currently used to secure blockchains like Bitcoin. In this work we investigate extensions of PoS which allow the prover to embed useful data into the dedicated space, which later can be recovered. Our first contribution is a security proof for the original PoS from CRYPTO'15 in the random oracle model (the original proof only applied to a restricted class of adversaries which can store a subset of the data an honest prover would store). When this PoS is instantiated with recent constructions of maximally depth robust graphs, our proof implies basically optimal security. As a second contribution we show three different extensions of this PoS where useful data can be embedded into the space required by the prover. Our security proof for the PoS extends (non-trivially) to these constructions. We discuss how some of these variants can be used as proofs of catalytic space (PoCS), a notion we put forward in this work, and which basically is a PoS where most of the space required by the prover can be used to backup useful data. Finally we discuss how one of the extensions is a candidate construction for a proof of replication (PoR), a proof system recently suggested in the Filecoin whitepaper. }, author = {Pietrzak, Krzysztof Z}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, isbn = {978-3-95977-095-8}, issn = {1868-8969}, location = {San Diego, CA, United States}, pages = {59:1--59:25}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Proofs of catalytic space}}, doi = {10.4230/LIPICS.ITCS.2019.59}, volume = {124}, year = {2018}, } @article{6001, abstract = {The concurrent memory reclamation problem is that of devising a way for a deallocating thread to verify that no other concurrent threads hold references to a memory block being deallocated. To date, in the absence of automatic garbage collection, there is no satisfactory solution to this problem; existing tracking methods like hazard pointers, reference counters, or epoch-based techniques like RCU are either prohibitively expensive or require significant programming expertise to the extent that implementing them efficiently can be worthy of a publication. None of the existing techniques are automatic or even semi-automated. In this article, we take a new approach to concurrent memory reclamation. Instead of manually tracking access to memory locations as done in techniques like hazard pointers, or restricting shared accesses to specific epoch boundaries as in RCU, our algorithm, called ThreadScan, leverages operating system signaling to automatically detect which memory locations are being accessed by concurrent threads. Initial empirical evidence shows that ThreadScan scales surprisingly well and requires negligible programming effort beyond the standard use of Malloc and Free.}, author = {Alistarh, Dan-Adrian and Leiserson, William and Matveev, Alexander and Shavit, Nir}, issn = {2329-4949}, journal = {ACM Transactions on Parallel Computing}, number = {4}, publisher = {Association for Computing Machinery}, title = {{ThreadScan: Automatic and scalable memory reclamation}}, doi = {10.1145/3201897}, volume = {4}, year = {2018}, } @inproceedings{7812, abstract = {Deep neural networks (DNNs) continue to make significant advances, solving tasks from image classification to translation or reinforcement learning. One aspect of the field receiving considerable attention is efficiently executing deep models in resource-constrained environments, such as mobile or embedded devices. This paper focuses on this problem, and proposes two new compression methods, which jointly leverage weight quantization and distillation of larger teacher networks into smaller student networks. The first method we propose is called quantized distillation and leverages distillation during the training process, by incorporating distillation loss, expressed with respect to the teacher, into the training of a student network whose weights are quantized to a limited set of levels. The second method, differentiable quantization, optimizes the location of quantization points through stochastic gradient descent, to better fit the behavior of the teacher model. We validate both methods through experiments on convolutional and recurrent architectures. We show that quantized shallow students can reach similar accuracy levels to full-precision teacher models, while providing order of magnitude compression, and inference speedup that is linear in the depth reduction. In sum, our results enable DNNs for resource-constrained environments to leverage architecture and accuracy advances developed on more powerful devices.}, author = {Polino, Antonio and Pascanu, Razvan and Alistarh, Dan-Adrian}, booktitle = {6th International Conference on Learning Representations}, location = {Vancouver, Canada}, title = {{Model compression via distillation and quantization}}, year = {2018}, } @unpublished{8547, abstract = {The cerebral cortex contains multiple hierarchically organized areas with distinctive cytoarchitectonical patterns, but the cellular mechanisms underlying the emergence of this diversity remain unclear. Here, we have quantitatively investigated the neuronal output of individual progenitor cells in the ventricular zone of the developing mouse neocortex using a combination of methods that together circumvent the biases and limitations of individual approaches. We found that individual cortical progenitor cells show a high degree of stochasticity and generate pyramidal cell lineages that adopt a wide range of laminar configurations. Mathematical modelling these lineage data suggests that a small number of progenitor cell populations, each generating pyramidal cells following different stochastic developmental programs, suffice to generate the heterogenous complement of pyramidal cell lineages that collectively build the complex cytoarchitecture of the neocortex.}, author = {Llorca, Alfredo and Ciceri, Gabriele and Beattie, Robert J and Wong, Fong K. and Diana, Giovanni and Serafeimidou, Eleni and Fernández-Otero, Marian and Streicher, Carmen and Arnold, Sebastian J. and Meyer, Martin and Hippenmeyer, Simon and Maravall, Miguel and Marín, Oscar}, booktitle = {bioRxiv}, publisher = {Cold Spring Harbor Laboratory}, title = {{Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture}}, doi = {10.1101/494088}, year = {2018}, } @inbook{86, abstract = {Responsiveness—the requirement that every request to a system be eventually handled—is one of the fundamental liveness properties of a reactive system. Average response time is a quantitative measure for the responsiveness requirement used commonly in performance evaluation. We show how average response time can be computed on state-transition graphs, on Markov chains, and on game graphs. In all three cases, we give polynomial-time algorithms.}, author = {Chatterjee, Krishnendu and Henzinger, Thomas A and Otop, Jan}, booktitle = {Principles of Modeling}, editor = {Lohstroh, Marten and Derler, Patricia and Sirjani, Marjan}, pages = {143 -- 161}, publisher = {Springer}, title = {{Computing average response time}}, doi = {10.1007/978-3-319-95246-8_9}, volume = {10760}, year = {2018}, } @article{9229, author = {Danzl, Johann G}, issn = {2500-2295}, journal = {Opera Medica et Physiologica}, number = {S1}, pages = {11}, publisher = {Lobachevsky State University of Nizhny Novgorod}, title = {{Diffraction-unlimited optical imaging for synaptic physiology}}, doi = {10.20388/omp2018.00s1.001}, volume = {4}, year = {2018}, } @inproceedings{6005, abstract = {Network games are widely used as a model for selfish resource-allocation problems. In the classicalmodel, each player selects a path connecting her source and target vertices. The cost of traversingan edge depends on theload; namely, number of players that traverse it. Thus, it abstracts the factthat different users may use a resource at different times and for different durations, which playsan important role in determining the costs of the users in reality. For example, when transmittingpackets in a communication network, routing traffic in a road network, or processing a task in aproduction system, actual sharing and congestion of resources crucially depends on time.In [13], we introducedtimed network games, which add a time component to network games.Each vertexvin the network is associated with a cost function, mapping the load onvto theprice that a player pays for staying invfor one time unit with this load. Each edge in thenetwork is guarded by the time intervals in which it can be traversed, which forces the players tospend time in the vertices. In this work we significantly extend the way time can be referred toin timed network games. In the model we study, the network is equipped withclocks, and, as intimed automata, edges are guarded by constraints on the values of the clocks, and their traversalmay involve a reset of some clocks. We argue that the stronger model captures many realisticnetworks. The addition of clocks breaks the techniques we developed in [13] and we developnew techniques in order to show that positive results on classic network games carry over to thestronger timed setting.}, author = {Avni, Guy and Guha, Shibashis and Kupferman, Orna}, issn = {1868-8969}, location = {Liverpool, United Kingdom}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Timed network games with clocks}}, doi = {10.4230/LIPICS.MFCS.2018.23}, volume = {117}, year = {2018}, } @article{315, abstract = {More than 100 years after Grigg’s influential analysis of species’ borders, the causes of limits to species’ ranges still represent a puzzle that has never been understood with clarity. The topic has become especially important recently as many scientists have become interested in the potential for species’ ranges to shift in response to climate change—and yet nearly all of those studies fail to recognise or incorporate evolutionary genetics in a way that relates to theoretical developments. I show that range margins can be understood based on just two measurable parameters: (i) the fitness cost of dispersal—a measure of environmental heterogeneity—and (ii) the strength of genetic drift, which reduces genetic diversity. Together, these two parameters define an ‘expansion threshold’: adaptation fails when genetic drift reduces genetic diversity below that required for adaptation to a heterogeneous environment. When the key parameters drop below this expansion threshold locally, a sharp range margin forms. When they drop below this threshold throughout the species’ range, adaptation collapses everywhere, resulting in either extinction or formation of a fragmented metapopulation. Because the effects of dispersal differ fundamentally with dimension, the second parameter—the strength of genetic drift—is qualitatively different compared to a linear habitat. In two-dimensional habitats, genetic drift becomes effectively independent of selection. It decreases with ‘neighbourhood size’—the number of individuals accessible by dispersal within one generation. Moreover, in contrast to earlier predictions, which neglected evolution of genetic variance and/or stochasticity in two dimensions, dispersal into small marginal populations aids adaptation. This is because the reduction of both genetic and demographic stochasticity has a stronger effect than the cost of dispersal through increased maladaptation. The expansion threshold thus provides a novel, theoretically justified, and testable prediction for formation of the range margin and collapse of the species’ range.}, author = {Polechova, Jitka}, issn = {15449173}, journal = {PLoS Biology}, number = {6}, publisher = {Public Library of Science}, title = {{Is the sky the limit? On the expansion threshold of a species’ range}}, doi = {10.1371/journal.pbio.2005372}, volume = {16}, year = {2018}, } @article{9471, abstract = {The DEMETER (DME) DNA glycosylase catalyzes genome-wide DNA demethylation and is required for endosperm genomic imprinting and embryo viability. Targets of DME-mediated DNA demethylation reside in small, euchromatic, AT-rich transposons and at the boundaries of large transposons, but how DME interacts with these diverse chromatin states is unknown. The STRUCTURE SPECIFIC RECOGNITION PROTEIN 1 (SSRP1) subunit of the chromatin remodeler FACT (facilitates chromatin transactions), was previously shown to be involved in the DME-dependent regulation of genomic imprinting in Arabidopsis endosperm. Therefore, to investigate the interaction between DME and chromatin, we focused on the activity of the two FACT subunits, SSRP1 and SUPPRESSOR of TY16 (SPT16), during reproduction in Arabidopsis. We found that FACT colocalizes with nuclear DME in vivo, and that DME has two classes of target sites, the first being euchromatic and accessible to DME, but the second, representing over half of DME targets, requiring the action of FACT for DME-mediated DNA demethylation genome-wide. Our results show that the FACT-dependent DME targets are GC-rich heterochromatin domains with high nucleosome occupancy enriched with H3K9me2 and H3K27me1. Further, we demonstrate that heterochromatin-associated linker histone H1 specifically mediates the requirement for FACT at a subset of DME-target loci. Overall, our results demonstrate that FACT is required for DME targeting by facilitating its access to heterochromatin.}, author = {Frost, Jennifer M. and Kim, M. Yvonne and Park, Guen Tae and Hsieh, Ping-Hung and Nakamura, Miyuki and Lin, Samuel J. H. and Yoo, Hyunjin and Choi, Jaemyung and Ikeda, Yoko and Kinoshita, Tetsu and Choi, Yeonhee and Zilberman, Daniel and Fischer, Robert L.}, issn = {1091-6490}, journal = {Proceedings of the National Academy of Sciences}, keywords = {Multidisciplinary}, number = {20}, pages = {E4720--E4729}, publisher = {National Academy of Sciences}, title = {{FACT complex is required for DNA demethylation at heterochromatin during reproduction in Arabidopsis}}, doi = {10.1073/pnas.1713333115}, volume = {115}, year = {2018}, } @inproceedings{186, abstract = {A drawing of a graph on a surface is independently even if every pair of nonadjacent edges in the drawing crosses an even number of times. The ℤ2-genus of a graph G is the minimum g such that G has an independently even drawing on the orientable surface of genus g. An unpublished result by Robertson and Seymour implies that for every t, every graph of sufficiently large genus contains as a minor a projective t × t grid or one of the following so-called t-Kuratowski graphs: K3, t, or t copies of K5 or K3,3 sharing at most 2 common vertices. We show that the ℤ2-genus of graphs in these families is unbounded in t; in fact, equal to their genus. Together, this implies that the genus of a graph is bounded from above by a function of its ℤ2-genus, solving a problem posed by Schaefer and Štefankovič, and giving an approximate version of the Hanani-Tutte theorem on orientable surfaces.}, author = {Fulek, Radoslav and Kynčl, Jan}, location = {Budapest, Hungary}, pages = {40.1 -- 40.14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{The ℤ2-Genus of Kuratowski minors}}, doi = {10.4230/LIPIcs.SoCG.2018.40}, volume = {99}, year = {2018}, } @inproceedings{433, abstract = {A thrackle is a graph drawn in the plane so that every pair of its edges meet exactly once: either at a common end vertex or in a proper crossing. We prove that any thrackle of n vertices has at most 1.3984n edges. Quasi-thrackles are defined similarly, except that every pair of edges that do not share a vertex are allowed to cross an odd number of times. It is also shown that the maximum number of edges of a quasi-thrackle on n vertices is 3/2(n-1), and that this bound is best possible for infinitely many values of n.}, author = {Fulek, Radoslav and Pach, János}, location = {Boston, MA, United States}, pages = {160 -- 166}, publisher = {Springer}, title = {{Thrackles: An improved upper bound}}, doi = {10.1007/978-3-319-73915-1_14}, volume = {10692}, year = {2018}, } @misc{9837, abstract = {Both classical and recent studies suggest that chromosomal inversion polymorphisms are important in adaptation and speciation. However, biases in discovery and reporting of inversions make it difficult to assess their prevalence and biological importance. Here, we use an approach based on linkage disequilibrium among markers genotyped for samples collected across a transect between contrasting habitats to detect chromosomal rearrangements de novo. We report 17 polymorphic rearrangements in a single locality for the coastal marine snail, Littorina saxatilis. Patterns of diversity in the field and of recombination in controlled crosses provide strong evidence that at least the majority of these rearrangements are inversions. Most show clinal changes in frequency between habitats, suggestive of divergent selection, but only one appears to be fixed for different arrangements in the two habitats. Consistent with widespread evidence for balancing selection on inversion polymorphisms, we argue that a combination of heterosis and divergent selection can explain the observed patterns and should be considered in other systems spanning environmental gradients.}, author = {Faria, Rui and Chaube, Pragya and Morales, Hernán E. and Larsson, Tomas and Lemmon, Alan R. and Lemmon, Emily M. and Rafajlović, Marina and Panova, Marina and Ravinet, Mark and Johannesson, Kerstin and Westram, Anja M and Butlin, Roger K.}, publisher = {Dryad}, title = {{Data from: Multiple chromosomal rearrangements in a hybrid zone between Littorina saxatilis ecotypes}}, doi = {10.5061/dryad.72cg113}, year = {2018}, } @inbook{10864, abstract = {We prove that every congruence distributive variety has directed Jónsson terms, and every congruence modular variety has directed Gumm terms. The directed terms we construct witness every case of absorption witnessed by the original Jónsson or Gumm terms. This result is equivalent to a pair of claims about absorption for admissible preorders in congruence distributive and congruence modular varieties, respectively. For finite algebras, these absorption theorems have already seen significant applications, but until now, it was not clear if the theorems hold for general algebras as well. Our method also yields a novel proof of a result by P. Lipparini about the existence of a chain of terms (which we call Pixley terms) in varieties that are at the same time congruence distributive and k-permutable for some k.}, author = {Kazda, Alexandr and Kozik, Marcin and McKenzie, Ralph and Moore, Matthew}, booktitle = {Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science}, editor = {Czelakowski, J}, isbn = {9783319747712}, issn = {2211-2766}, pages = {203--220}, publisher = {Springer Nature}, title = {{Absorption and directed Jónsson terms}}, doi = {10.1007/978-3-319-74772-9_7}, volume = {16}, year = {2018}, } @inproceedings{184, abstract = {We prove that for every d ≥ 2, deciding if a pure, d-dimensional, simplicial complex is shellable is NP-hard, hence NP-complete. This resolves a question raised, e.g., by Danaraj and Klee in 1978. Our reduction also yields that for every d ≥ 2 and k ≥ 0, deciding if a pure, d-dimensional, simplicial complex is k-decomposable is NP-hard. For d ≥ 3, both problems remain NP-hard when restricted to contractible pure d-dimensional complexes.}, author = {Goaoc, Xavier and Paták, Pavel and Patakova, Zuzana and Tancer, Martin and Wagner, Uli}, location = {Budapest, Hungary}, pages = {41:1 -- 41:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Shellability is NP-complete}}, doi = {10.4230/LIPIcs.SoCG.2018.41}, volume = {99}, year = {2018}, }