@phdthesis{12364, abstract = {Autism spectrum disorders (ASDs) are a group of neurodevelopmental disorders characterized by behavioral symptoms such as problems in social communication and interaction, as well as repetitive, restricted behaviors and interests. These disorders show a high degree of heritability and hundreds of risk genes have been identifed using high throughput sequencing technologies. This genetic heterogeneity has hampered eforts in understanding the pathogenesis of ASD but at the same time given rise to the concept of convergent mechanisms. Previous studies have identifed that risk genes for ASD broadly converge onto specifc functional categories with transcriptional regulation being one of the biggest groups. In this thesis, I focus on this subgroup of genes and investigate the gene regulatory consequences of some of them in the context of neurodevelopment. First, we showed that mutations in the ASD and intellectual disability risk gene Setd5 lead to perturbations of gene regulatory programs in early cell fate specifcation. In addition, adult animals display abnormal learning behavior which is mirrored at the transcriptional level by altered activity dependent regulation of postsynaptic gene expression. Lastly, we link the regulatory function of Setd5 to its interaction with the Paf1 and the NCoR complex. Second, by modeling the heterozygous loss of the top ASD gene CHD8 in human cerebral organoids we demonstrate profound changes in the developmental trajectories of both inhibitory and excitatory neurons using single cell RNA-sequencing. While the former were generated earlier in CHD8+/- organoids, the generation of the latter was shifted to later times in favor of a prolonged progenitor expansion phase and ultimately increased organoid size. Finally, by modeling heterozygous mutations for four ASD associated chromatin modifers, ASH1L, KDM6B, KMT5B, and SETD5 in human cortical spheroids we show evidence of regulatory convergence across three of those genes. We observe a shift from dorsal cortical excitatory neuron fates towards partially ventralized cell types resembling cells from the lateral ganglionic eminence. As this project is still ongoing at the time of writing, future experiments will aim at elucidating the regulatory mechanisms underlying this shift with the aim of linking these three ASD risk genes through biological convergence.}, author = {Dotter, Christoph}, issn = {2663-337X}, pages = {152}, publisher = {Institute of Science and Technology Austria}, title = {{Transcriptional consequences of mutations in genes associated with Autism Spectrum Disorder}}, doi = {10.15479/at:ista:12094}, year = {2022}, } @misc{10934, abstract = {FtsA is crucial for assembly of the E. coli divisome, as it dynamically links cytoplasmic FtsZ filaments with transmembrane cell division proteins. FtsA allegedly initiates cell division by switching from an inactive polymeric to an active monomeric confirmation, which recruits downstream proteins and stabilizes FtsZ filaments. Here, we use biochemical reconstitution experiments combined with quantitative fluorescence microscopy to study divisome activation in vitro. We compare wildtype-FtsA with FtsA-R286W, a constantly active gain-of-function mutant and find that R286W outperforms the wildtype protein in replicating FtsZ treadmilling dynamics, stabilizing FtsZ filaments and recruiting FtsN. We attribute these differences to a faster membrane exchange of FtsA-R286W and its higher packing density below FtsZ filaments. Using FRET microscopy, we find that FtsN binding does not compete with, but promotes FtsA self-interaction. Our findings suggest a model where FtsA always forms dynamic polymers on the membrane, which re-organize during assembly and activation of the divisome. }, author = {Radler, Philipp}, keywords = {Bacterial cell division, in vitro reconstitution, FtsZ, FtsN, FtsA}, publisher = {Institute of Science and Technology Austria}, title = {{In vitro reconstitution of Escherichia coli divisome activation}}, doi = {10.15479/AT:ISTA:10934}, year = {2022}, } @phdthesis{11393, abstract = {AMPA receptors (AMPARs) mediate fast excitatory neurotransmission and their role is implicated in complex processes such as learning and memory and various neurological diseases. These receptors are composed of different subunits and the subunit composition can affect channel properties, receptor trafficking and interaction with other associated proteins. Using the high sensitivity SDS-digested freeze-fracture replica labeling (SDS-FRL) for electron microscopy I investigated the number, density, and localization of AMPAR subunits, GluA1, GluA2, GluA3, and GluA1-3 (panAMPA) in pyramidal cells in the CA1 area of mouse hippocampus. I have found that the immunogold labeling for all of these subunits in the postsynaptic sites was highest in stratum radiatum and lowest in stratum lacunosummoleculare. The labeling density for the all subunits in the extrasynaptic sites showed a gradual increase from the pyramidal cell soma towards the distal part of stratum radiatum. The densities of extrasynaptic GluA1, GluA2 and panAMPA labeling reached 10-15% of synaptic densities, while the ratio of extrasynaptic labeling for GluA3 was significantly lower compared than those for other subunits. The labeling patterns for GluA1, GluA2 and GluA1-3 are similar and their densities were higher in the periphery than center of synapses. In contrast, the GluA3- containing receptors were more centrally localized compared to the GluA1- and GluA2- containing receptors. The hippocampus plays a central role in learning and memory. Contextual learning has been shown to require the delivery of AMPA receptors to CA1 synapses in the dorsal hippocampus. However, proximodistal heterogeneity of this plasticity and particular contribution of different AMPA receptor subunits are not fully understood. By combining inhibitory avoidance task, a hippocampus-dependent contextual fear-learning paradigm, with SDS-FRL, I have revealed an increase in synaptic density specific to GluA1-containing AMPA receptors in the CA1 area. The intrasynaptic distribution of GluA1 also changed from the periphery to center-preferred pattern. Furthermore, this synaptic plasticity was evident selectively in stratum radiatum but not stratum oriens, and in the CA1 subregion proximal but not distal to CA2. These findings further contribute to our understanding of how specific hippocampal subregions and AMPA receptor subunits are involved in physiological learning. Although the immunolabeling results above shed light on subunit-specific plasticity in AMPAR distribution, no tools to visualize and study the subunit composition at the single channel level in situ have been available. Electron microscopy with conventional immunogold labeling approaches has limitations in the single channel analysis because of the large size of antibodies and steric hindrance hampering multiple subunit labeling of single channels. I managed to develop a new chemical labeling system using a short peptide tag and small synthetic probes, which form specific covalent bond with a cysteine residue in the tag fused to proteins of interest (reactive tag system). I additionally made substantial progress into adapting this system for AMPA receptor subunits.}, author = {Jevtic, Marijo}, issn = {2663-337X}, pages = {108}, publisher = {Institute of Science and Technology Austria}, title = {{Contextual fear learning induced changes in AMPA receptor subtypes along the proximodistal axis in dorsal hippocampus}}, doi = {10.15479/at:ista:11393}, year = {2022}, } @phdthesis{12366, abstract = {Recent substantial advances in the feld of superconducting circuits have shown its potential as a leading platform for future quantum computing. In contrast to classical computers based on bits that are represented by a single binary value, 0 or 1, quantum bits (or qubits) can be in a superposition of both. Thus, quantum computers can store and handle more information at the same time and a quantum advantage has already been demonstrated for two types of computational tasks. Rapid progress in academic and industry labs accelerates the development of superconducting processors which may soon fnd applications in complex computations, chemical simulations, cryptography, and optimization. Now that these machines are scaled up to tackle such problems the questions of qubit interconnects and networks becomes very relevant. How to route signals on-chip between diferent processor components? What is the most efcient way to entangle qubits? And how to then send and process entangled signals between distant cryostats hosting superconducting processors? In this thesis, we are looking for solutions to these problems by studying the collective behavior of superconducting qubit ensembles. We frst demonstrate on-demand tunable directional scattering of microwave photons from a pair of qubits in a waveguide. Such a device can route microwave photons on-chip with a high diode efciency. Then we focus on studying ultra-strong coupling regimes between light (microwave photons) and matter (superconducting qubits), a regime that could be promising for extremely fast multi-qubit entanglement generation. Finally, we show coherent pulse storage and periodic revivals in a fve qubit ensemble strongly coupled to a resonator. Such a reconfgurable storage device could be used as part of a quantum repeater that is needed for longer-distance quantum communication. The achieved high degree of control over multi-qubit ensembles highlights not only the beautiful physics of circuit quantum electrodynamics, it also represents the frst step toward new quantum simulation and communication methods, and certain techniques may also fnd applications in future superconducting quantum computing hardware. }, author = {Redchenko, Elena}, isbn = {978-3-99078-024-4}, issn = {2663-337X}, pages = {168}, publisher = {Institute of Science and Technology Austria}, title = {{Controllable states of superconducting Qubit ensembles}}, doi = {10.15479/at:ista:12132}, year = {2022}, } @phdthesis{11193, abstract = {The infiltration of immune cells into tissues underlies the establishment of tissue-resident macrophages and responses to infections and tumors. However, the mechanisms immune cells utilize to collectively migrate through tissue barriers in vivo are not yet well understood. In this thesis, I describe two mechanisms that Drosophila immune cells (hemocytes) use to overcome the tissue barrier of the germband in the embryo. One strategy is the strengthening of the actin cortex through developmentally controlled transcriptional regulation induced by the Drosophila proto-oncogene family member Dfos, which I show in Chapter 2. Dfos induces expression of the tetraspanin TM4SF and the filamin Cher leading to higher levels of the activated formin Dia at the cortex and increased cortical F-actin. This enhanced cortical strength allows hemocytes to overcome the physical resistance of the surrounding tissue and translocate their nucleus to move forward. This mechanism affects the speed of migration when hemocytes face a confined environment in vivo. Another aspect of the invasion process is the initial step of the leading hemocytes entering the tissue, which potentially guides the follower cells. In Chapter 3, I describe a novel subpopulation of hemocytes activated by BMP signaling prior to tissue invasion that leads penetration into the germband. Hemocytes that are deficient in BMP signaling activation show impaired persistence at the tissue entry, while their migration speed remains unaffected. This suggests that there might be different mechanisms controlling immune cell migration within the confined environment in vivo, one of these being the general ability to overcome the resistance of the surrounding tissue and another affecting the order of hemocytes that collectively invade the tissue in a stream of individual cells. Together, my findings provide deeper insights into transcriptional changes in immune cells that enable efficient tissue invasion and pave the way for future studies investigating the early colonization of tissues by macrophages in higher organisms. Moreover, they extend the current view of Drosophila immune cell heterogeneity and point toward a potentially conserved role for canonical BMP signaling in specifying immune cells that lead the migration of tissue resident macrophages during embryogenesis.}, author = {Wachner, Stephanie}, issn = {2663-337X}, pages = {170}, publisher = {Institute of Science and Technology Austria}, title = {{Transcriptional regulation by Dfos and BMP-signaling support tissue invasion of Drosophila immune cells}}, doi = {10.15479/at:ista:11193}, year = {2022}, } @phdthesis{12378, abstract = {Environmental cues influence the highly dynamic morphology of microglia. Strategies to characterize these changes usually involve user-selected morphometric features, which preclude the identification of a spectrum of context-dependent morphological phenotypes. Here, we develop MorphOMICs, a topological data analysis approach, which enables semiautomatic mapping of microglial morphology into an atlas of cue-dependent phenotypes, overcomes feature-selection bias and minimizes biological variability. First, with MorphOMICs we derive the morphological spectrum of microglia across seven brain regions during postnatal development and in two distinct Alzheimer’s disease degeneration mouse models. We uncover region-specific and sexually dimorphic morphological trajectories, with females showing an earlier morphological shift than males in the degenerating brain. Overall, we demonstrate that both long primary- and short terminal processes provide distinct insights to morphological phenotypes. Moreover, using machine learning to map novel condition on the spectrum, we observe that microglia morphologies reflect a dose-dependent adaptation upon ketamine anesthesia and do not recover to control morphologies. Next, we took advantage of MorphOMICs to build a high-resolution and layer-specific map of microglial morphological spectrum in the retina, covering postnatal development and rd10 degeneration. Here, following photoreceptor death, microglia assume an early developmentlike morphology. Finally, we map microglial morphology following optic nerve crush on the retinal spectrum and observe a layer- and sex-dependent response. Overall, MorphOMICs opens a new perspective to analyze microglial morphology across multiple conditions, and provides a novel tool to characterize microglial morphology beyond the traditionally dichotomized view of microglia.}, author = {Colombo, Gloria}, issn = {2663-337X}, pages = {142}, publisher = {Institute of Science and Technology Austria}, title = {{MorphOMICs, a tool for mapping microglial morphology, reveals brain region- and sex-dependent phenotypes}}, doi = {10.15479/at:ista:12378}, year = {2022}, } @phdthesis{11388, abstract = {In evolve and resequence experiments, a population is sequenced, subjected to selection and then sequenced again, so that genetic changes before and after selection can be observed at the genetic level. Here, I use these studies to better understand the genetic basis of complex traits - traits which depend on more than a few genes. In the first chapter, I discuss the first evolve and resequence experiment, in which a population of mice, the so-called "Longshanks" mice, were selected for tibia length while their body mass was kept constant. The full pedigree is known. We observed a selection response on all chromosomes and used the infinitesimal model with linkage, a model which assumes an infinite number of genes with infinitesimally small effect sizes, as a null model. Results implied a very polygenic basis with a few loci of major effect standing out and changing in parallel. There was large variability between the different chromosomes in this study, probably due to LD. In chapter two, I go on to discuss the impact of LD, on the variability in an allele-frequency based summary statistic, giving an equation based on the initial allele frequencies, average pairwise LD, and the first four moments of the haplotype block copy number distribution. I describe this distribution by referring back to the founder generation. I then demonstrate how to infer selection via a maximum likelihood scheme on the example of a single locus and discuss how to extend this to more realistic scenarios. In chapter three, I discuss the second evolve and resequence experiment, in which a small population of Drosophila melanogaster was selected for increased pupal case size over 6 generations. The experiment was highly replicated with 27 lines selected within family and a known pedigree. We observed a phenotypic selection response of over one standard deviation. I describe the patterns in allele frequency data, including allele frequency changes and patterns of heterozygosity, and give ideas for future work.}, author = {Belohlavy, Stefanie}, isbn = {978-3-99078-018-3}, pages = {98}, publisher = {Institute of Science and Technology Austria}, title = {{The genetic basis of complex traits studied via analysis of evolve and resequence experiments}}, doi = {10.15479/at:ista:11388}, year = {2022}, } @phdthesis{12401, abstract = {Detachment of the cancer cells from the bulk of the tumor is the first step of metastasis, which is the primary cause of cancer related deaths. It is unclear, which factors contribute to this step. Recent studies indicate a crucial role of the tumor microenvironment in malignant transformation and metastasis. Studying cancer cell invasion and detachments quantitatively in the context of its physiological microenvironment is technically challenging. Especially, precise control of microenvironmental properties in vivo is currently not possible. Here, I studied the role of microenvironment geometry in the invasion and detachment of cancer cells from the bulk with a simplistic and reductionist approach. In this approach, I engineered microfluidic devices to mimic a pseudo 3D extracellular matrix environment, where I was able to quantitatively tune the geometrical configuration of the microenvironment and follow tumor cells with fluorescence live imaging. To aid quantitative analysis I developed a widely applicable software application to automatically analyze and visualize particle tracking data. Quantitative analysis of tumor cell invasion in isotropic and anisotropic microenvironments showed that heterogeneity in the microenvironment promotes faster invasion and more frequent detachment of cells. These observations correlated with overall higher speed of cells at the edge of the bulk of the cells. In heterogeneous microenvironments cells preferentially passed through larger pores, thus invading areas of least resistance and generating finger-like invasive structures. The detachments occurred mostly at the tips of these structures. To investigate the potential mechanism, we established a two dimensional model to simulate active Brownian particles representing the cell nuclei dynamics. These simulations backed our in vitro observations without the need of precise fitting the simulation parameters. Our model suggests the importance of the pore heterogeneity in the direction perpendicular to the orientation of bias field (lateral heterogeneity), which causes the interface roughening.}, author = {Tasciyan, Saren}, issn = {2663-337X}, pages = {105}, publisher = {Institute of Science and Technology Austria}, title = {{Role of microenvironment heterogeneity in cancer cell invasion}}, doi = {10.15479/at:ista:12401}, year = {2022}, } @misc{11653, abstract = {Eurasian brine shrimp (genus Artemia) have closely related sexual and asexual lineages of parthenogenetic females, which produce rare males at low frequencies. Although they are known to have ZW chromosomes, these are not well characterized, and it is unclear whether they are shared across the clade. Furthermore, the underlying genetic architecture of the transmission of asexuality, which can occur when rare males mate with closely related sexual females, is not well understood. We produced a chromosome-level assembly for the sexual Eurasian species A. sinica and characterized in detail the pair of sex chromosomes of this species. We combined this new assembly with short-read genomic data for the sexual species A. sp. Kazakhstan and several asexual lineages of A. parthenogenetica, allowing us to perform an in-depth characterization of sex-chromosome evolution across the genus. We identified a small differentiated region of the ZW pair that is shared by all sexual and asexual lineages, supporting the shared ancestry of the sex chromosomes. We also inferred that recombination suppression has spread to larger sections of the chromosome independently in the American and Eurasian lineages. Finally, we took advantage of a rare male, which we backcrossed to sexual females, to explore the genetic basis of asexuality. Our results suggest that parthenogenesis is likely partly controlled by a locus on the Z chromosome, highlighting the interplay between sex determination and asexuality.}, author = {Elkrewi, Marwan N}, publisher = {Institute of Science and Technology Austria}, title = {{Data from Elkrewi, Khauratovich, Toups et al. 2022, "ZW sex-chromosome evolution and contagious parthenogenesis in Artemia brine shrimp"}}, doi = {10.15479/AT:ISTA:11653}, year = {2022}, } @phdthesis{11932, abstract = {The ability to form and retrieve memories is central to survival. In mammals, the hippocampus is a brain region essential to the acquisition and consolidation of new memories. It is also involved in keeping track of one’s position in space and aids navigation. Although this space-memory has been a source of contradiction, evidence supports the view that the role of the hippocampus in navigation is memory, thanks to the formation of cognitive maps. First introduced by Tolman in 1948, cognitive maps are generally used to organize experiences in memory; however, the detailed mechanisms by which these maps are formed and stored are not yet agreed upon. Some influential theories describe this process as involving three fundamental steps: initial encoding by the hippocampus, interactions between the hippocampus and other cortical areas, and long-term extra-hippocampal consolidation. In this thesis, I will show how the investigation of cognitive maps of space helped to shed light on each of these three memory processes. The first study included in this thesis deals with the initial encoding of spatial memories in the hippocampus. Much is known about encoding at the level of single cells, but less about their co-activity or joint contribution to the encoding of novel spatial information. I will describe the structure of an interaction network that allows for efficient encoding of noisy spatial information during the first exploration of a novel environment. The second study describes the interactions between the hippocampus and the prefrontal cortex (PFC), two areas directly and indirectly connected. It is known that the PFC, in concert with the hippocampus, is involved in various processes, including memory storage and spatial navigation. Nonetheless, the detailed mechanisms by which PFC receives information from the hippocampus are not clear. I will show how a transient improvement in theta phase locking of PFC cells enables interactions of cell pairs across the two regions. The third study describes the learning of behaviorally-relevant spatial locations in the hippocampus and the medial entorhinal cortex. I will show how the accumulation of firing around goal locations, a correlate of learning, can shed light on the transition from short- to long-term spatial memories and the speed of consolidation in different brain areas. The studies included in this thesis represent the main scientific contributions of my Ph.D. They involve statistical analyses and models of neural responses of cells in different brain areas of rats executing spatial tasks. I will conclude the thesis by discussing the impact of the findings on principles of memory formation and retention, including the mechanisms, the speed, and the duration of these processes.}, author = {Nardin, Michele}, issn = {2663-337X}, pages = {136}, publisher = {Institute of Science and Technology Austria}, title = {{On the encoding, transfer, and consolidation of spatial memories}}, doi = {10.15479/at:ista:11932}, year = {2022}, } @phdthesis{10727, abstract = {Social insects are a common model to study disease dynamics in social animals. Even though pathogens should thrive in social insect colonies as the hosts engage in frequent social interactions, are closely related and live in a pathogen-rich environment, disease outbreaks are rare. This is because social insects have evolved mechanisms to keep pathogens at bay – and fight disease as a collective. Social insect colonies are often viewed as “superorganisms” with division of labor between reproductive “germ-like” queens and males and “somatic” workers, which together form an interdependent reproductive unit that parallels a multicellular body. Superorganisms possess a “social immune system” that comprises of collective disease defenses performed by the workers - summarized as “social immunity”. In social groups immunization (reduced susceptibility to a parasite upon secondary exposure to the same parasite) can e.g. be triggered by social interactions (“social immunization”). Social immunization can be caused by (i) asymptomatic low-level infections that are acquired during caregiving to a contagious individual that can give an immune boost, which can induce protection upon later encounter with the same pathogen (active immunization) or (ii) by transfer of immune effectors between individuals (passive immunization). In the second chapter, I built up on a study that I co-authored that found that low-level infections can not only be protective, but also be costly and make the host more susceptible to detrimental superinfections after contact to a very dissimilar pathogen. I here now tested different degrees of phylogenetically-distant fungal strains of M. brunneum and M. robertsii in L. neglectus and can describe the occurrence of cross-protection of social immunization if the first and second pathogen are from the same level. Interestingly, low-level infections only provided protection when the first strain was less virulent than the second strain and elicited higher immune gene expression. In the third and fourth chapters, I expanded on the role of social immunity in sexual selection, a so far unstudied field. I used the fungus Metarhizium robertsii and the ant Cardiocondyla obscurior as a model, as in this species mating occurs in the presence of workers and can be studied under laboratory conditions. Before males mate with virgin queens in the nest they engage in fierce combat over the access to their mating partners. First, I focused on male-male competition in the third chapter and found that fighting with a contagious male is costly as it can lead to contamination of the rival, but that workers can decrease the risk of disease contraction by performing sanitary care. In the fourth chapter, I studied the effect of fungal infection on survival and mating success of sexuals (freshly emerged queens and males) and found that worker-performed sanitary care can buffer the negative effect that a pathogenic contagion would have on sexuals by spore removal from the exposed individuals. When social immunity was prevented and queens could contract spores from their mating partner, very low dosages led to negative consequences: their lifespan was reduced and they produced fewer offspring with poor immunocompetence compared to healthy queens. Interestingly, cohabitation with a late-stage infected male where no spore transfer was possible had a positive effect on offspring immunity – male offspring of mothers that apparently perceived an infected partner in their vicinity reacted more sensitively to fungal challenge than male offspring without paternal pathogen history.}, author = {Metzler, Sina}, issn = {2663-337X}, publisher = {Institute of Science and Technology Austria}, title = {{Pathogen-mediated sexual selection and immunization in ant colonies}}, doi = {10.15479/AT:ISTA:10727}, year = {2022}, } @inproceedings{11458, abstract = {The increasing computational requirements of deep neural networks (DNNs) have led to significant interest in obtaining DNN models that are sparse, yet accurate. Recent work has investigated the even harder case of sparse training, where the DNN weights are, for as much as possible, already sparse to reduce computational costs during training. Existing sparse training methods are often empirical and can have lower accuracy relative to the dense baseline. In this paper, we present a general approach called Alternating Compressed/DeCompressed (AC/DC) training of DNNs, demonstrate convergence for a variant of the algorithm, and show that AC/DC outperforms existing sparse training methods in accuracy at similar computational budgets; at high sparsity levels, AC/DC even outperforms existing methods that rely on accurate pre-trained dense models. An important property of AC/DC is that it allows co-training of dense and sparse models, yielding accurate sparse–dense model pairs at the end of the training process. This is useful in practice, where compressed variants may be desirable for deployment in resource-constrained settings without re-doing the entire training flow, and also provides us with insights into the accuracy gap between dense and compressed models. The code is available at: https://github.com/IST-DASLab/ACDC.}, author = {Peste, Elena-Alexandra and Iofinova, Eugenia B and Vladu, Adrian and Alistarh, Dan-Adrian}, booktitle = {35th Conference on Neural Information Processing Systems}, isbn = {9781713845393}, issn = {1049-5258}, location = {Virtual, Online}, pages = {8557--8570}, publisher = {Neural Information Processing Systems Foundation}, title = {{AC/DC: Alternating Compressed/DeCompressed training of deep neural networks}}, volume = {34}, year = {2021}, } @phdthesis{10007, abstract = {The present thesis is concerned with the derivation of weak-strong uniqueness principles for curvature driven interface evolution problems not satisfying a comparison principle. The specific examples being treated are two-phase Navier-Stokes flow with surface tension, modeling the evolution of two incompressible, viscous and immiscible fluids separated by a sharp interface, and multiphase mean curvature flow, which serves as an idealized model for the motion of grain boundaries in an annealing polycrystalline material. Our main results - obtained in joint works with Julian Fischer, Tim Laux and Theresa M. Simon - state that prior to the formation of geometric singularities due to topology changes, the weak solution concept of Abels (Interfaces Free Bound. 9, 2007) to two-phase Navier-Stokes flow with surface tension and the weak solution concept of Laux and Otto (Calc. Var. Partial Differential Equations 55, 2016) to multiphase mean curvature flow (for networks in R^2 or double bubbles in R^3) represents the unique solution to these interface evolution problems within the class of classical solutions, respectively. To the best of the author's knowledge, for interface evolution problems not admitting a geometric comparison principle the derivation of a weak-strong uniqueness principle represented an open problem, so that the works contained in the present thesis constitute the first positive results in this direction. The key ingredient of our approach consists of the introduction of a novel concept of relative entropies for a class of curvature driven interface evolution problems, for which the associated energy contains an interfacial contribution being proportional to the surface area of the evolving (network of) interface(s). The interfacial part of the relative entropy gives sufficient control on the interface error between a weak and a classical solution, and its time evolution can be computed, at least in principle, for any energy dissipating weak solution concept. A resulting stability estimate for the relative entropy essentially entails the above mentioned weak-strong uniqueness principles. The present thesis contains a detailed introduction to our relative entropy approach, which in particular highlights potential applications to other problems in curvature driven interface evolution not treated in this thesis.}, author = {Hensel, Sebastian}, issn = {2663-337X}, pages = {300}, publisher = {Institute of Science and Technology Austria}, title = {{Curvature driven interface evolution: Uniqueness properties of weak solution concepts}}, doi = {10.15479/at:ista:10007}, year = {2021}, } @phdthesis{10030, abstract = {This PhD thesis is primarily focused on the study of discrete transport problems, introduced for the first time in the seminal works of Maas [Maa11] and Mielke [Mie11] on finite state Markov chains and reaction-diffusion equations, respectively. More in detail, my research focuses on the study of transport costs on graphs, in particular the convergence and the stability of such problems in the discrete-to-continuum limit. This thesis also includes some results concerning non-commutative optimal transport. The first chapter of this thesis consists of a general introduction to the optimal transport problems, both in the discrete, the continuous, and the non-commutative setting. Chapters 2 and 3 present the content of two works, obtained in collaboration with Peter Gladbach, Eva Kopfer, and Jan Maas, where we have been able to show the convergence of discrete transport costs on periodic graphs to suitable continuous ones, which can be described by means of a homogenisation result. We first focus on the particular case of quadratic costs on the real line and then extending the result to more general costs in arbitrary dimension. Our results are the first complete characterisation of limits of transport costs on periodic graphs in arbitrary dimension which do not rely on any additional symmetry. In Chapter 4 we turn our attention to one of the intriguing connection between evolution equations and optimal transport, represented by the theory of gradient flows. We show that discrete gradient flow structures associated to a finite volume approximation of a certain class of diffusive equations (Fokker–Planck) is stable in the limit of vanishing meshes, reproving the convergence of the scheme via the method of evolutionary Γ-convergence and exploiting a more variational point of view on the problem. This is based on a collaboration with Dominik Forkert and Jan Maas. Chapter 5 represents a change of perspective, moving away from the discrete world and reaching the non-commutative one. As in the discrete case, we discuss how classical tools coming from the commutative optimal transport can be translated into the setting of density matrices. In particular, in this final chapter we present a non-commutative version of the Schrödinger problem (or entropic regularised optimal transport problem) and discuss existence and characterisation of minimisers, a duality result, and present a non-commutative version of the well-known Sinkhorn algorithm to compute the above mentioned optimisers. This is based on a joint work with Dario Feliciangeli and Augusto Gerolin. Finally, Appendix A and B contain some additional material and discussions, with particular attention to Harnack inequalities and the regularity of flows on discrete spaces.}, author = {Portinale, Lorenzo}, issn = {2663-337X}, publisher = {Institute of Science and Technology Austria}, title = {{Discrete-to-continuum limits of transport problems and gradient flows in the space of measures}}, doi = {10.15479/at:ista:10030}, year = {2021}, } @article{10191, abstract = {In this work we solve the algorithmic problem of consistency verification for the TSO and PSO memory models given a reads-from map, denoted VTSO-rf and VPSO-rf, respectively. For an execution of n events over k threads and d variables, we establish novel bounds that scale as nk+1 for TSO and as nk+1· min(nk2, 2k· d) for PSO. Moreover, based on our solution to these problems, we develop an SMC algorithm under TSO and PSO that uses the RF equivalence. The algorithm is exploration-optimal, in the sense that it is guaranteed to explore each class of the RF partitioning exactly once, and spends polynomial time per class when k is bounded. Finally, we implement all our algorithms in the SMC tool Nidhugg, and perform a large number of experiments over benchmarks from existing literature. Our experimental results show that our algorithms for VTSO-rf and VPSO-rf provide significant scalability improvements over standard alternatives. Moreover, when used for SMC, the RF partitioning is often much coarser than the standard Shasha-Snir partitioning for TSO/PSO, which yields a significant speedup in the model checking task. }, author = {Bui, Truc Lam and Chatterjee, Krishnendu and Gautam, Tushar and Pavlogiannis, Andreas and Toman, Viktor}, issn = {2475-1421}, journal = {Proceedings of the ACM on Programming Languages}, keywords = {safety, risk, reliability and quality, software}, number = {OOPSLA}, publisher = {Association for Computing Machinery}, title = {{The reads-from equivalence for the TSO and PSO memory models}}, doi = {10.1145/3485541}, volume = {5}, year = {2021}, } @phdthesis{10199, abstract = {The design and verification of concurrent systems remains an open challenge due to the non-determinism that arises from the inter-process communication. In particular, concurrent programs are notoriously difficult both to be written correctly and to be analyzed formally, as complex thread interaction has to be accounted for. The difficulties are further exacerbated when concurrent programs get executed on modern-day hardware, which contains various buffering and caching mechanisms for efficiency reasons. This causes further subtle non-determinism, which can often produce very unintuitive behavior of the concurrent programs. Model checking is at the forefront of tackling the verification problem, where the task is to decide, given as input a concurrent system and a desired property, whether the system satisfies the property. The inherent state-space explosion problem in model checking of concurrent systems causes naïve explicit methods not to scale, thus more inventive methods are required. One such method is stateless model checking (SMC), which explores in memory-efficient manner the program executions rather than the states of the program. State-of-the-art SMC is typically coupled with partial order reduction (POR) techniques, which argue that certain executions provably produce identical system behavior, thus limiting the amount of executions one needs to explore in order to cover all possible behaviors. Another method to tackle the state-space explosion is symbolic model checking, where the considered techniques operate on a succinct implicit representation of the input system rather than explicitly accessing the system. In this thesis we present new techniques for verification of concurrent systems. We present several novel POR methods for SMC of concurrent programs under various models of semantics, some of which account for write-buffering mechanisms. Additionally, we present novel algorithms for symbolic model checking of finite-state concurrent systems, where the desired property of the systems is to ensure a formally defined notion of fairness.}, author = {Toman, Viktor}, issn = {2663-337X}, keywords = {concurrency, verification, model checking}, pages = {166}, publisher = {Institute of Science and Technology Austria}, title = {{Improved verification techniques for concurrent systems}}, doi = {10.15479/at:ista:10199}, year = {2021}, } @phdthesis{10422, abstract = {Those who aim to devise new materials with desirable properties usually examine present methods first. However, they will find out that some approaches can exist only conceptually without high chances to become practically useful. It seems that a numerical technique called automatic differentiation together with increasing supply of computational accelerators will soon shift many methods of the material design from the category ”unimaginable” to the category ”expensive but possible”. Approach we suggest is not an exception. Our overall goal is to have an efficient and generalizable approach allowing to solve inverse design problems. In this thesis we scratch its surface. We consider jammed systems of identical particles. And ask ourselves how the shape of those particles (or the parameters codifying it) may affect mechanical properties of the system. An indispensable part of reaching the answer is an appropriate particle parametrization. We come up with a simple, yet generalizable and purposeful scheme for it. Using our generalizable shape parameterization, we simulate the formation of a solid composed of pentagonal-like particles and measure anisotropy in the resulting elastic response. Through automatic differentiation techniques, we directly connect the shape parameters with the elastic response. Interestingly, for our system we find that less isotropic particles lead to a more isotropic elastic response. Together with other results known about our method it seems that it can be successfully generalized for different inverse design problems.}, author = {Piankov, Anton}, issn = {2791-4585}, publisher = {Institute of Science and Technology Austria}, title = {{Towards designer materials using customizable particle shape}}, doi = {10.15479/at:ista:10422}, year = {2021}, } @article{10635, abstract = {The brain efficiently performs nonlinear computations through its intricate networks of spiking neurons, but how this is done remains elusive. While nonlinear computations can be implemented successfully in spiking neural networks, this requires supervised training and the resulting connectivity can be hard to interpret. In contrast, the required connectivity for any computation in the form of a linear dynamical system can be directly derived and understood with the spike coding network (SCN) framework. These networks also have biologically realistic activity patterns and are highly robust to cell death. Here we extend the SCN framework to directly implement any polynomial dynamical system, without the need for training. This results in networks requiring a mix of synapse types (fast, slow, and multiplicative), which we term multiplicative spike coding networks (mSCNs). Using mSCNs, we demonstrate how to directly derive the required connectivity for several nonlinear dynamical systems. We also show how to carry out higher-order polynomials with coupled networks that use only pair-wise multiplicative synapses, and provide expected numbers of connections for each synapse type. Overall, our work demonstrates a novel method for implementing nonlinear computations in spiking neural networks, while keeping the attractive features of standard SCNs (robustness, realistic activity patterns, and interpretable connectivity). Finally, we discuss the biological plausibility of our approach, and how the high accuracy and robustness of the approach may be of interest for neuromorphic computing.}, author = {Nardin, Michele and Phillips, James W. and Podlaski, William F. and Keemink, Sander W.}, issn = {2804-3871}, journal = {Peer Community Journal}, publisher = {Peer Community In}, title = {{Nonlinear computations in spiking neural networks through multiplicative synapses}}, doi = {10.24072/pcjournal.69}, volume = {1}, year = {2021}, } @inproceedings{10668, abstract = {Robustness to variations in lighting conditions is a key objective for any deep vision system. To this end, our paper extends the receptive field of convolutional neural networks with two residual components, ubiquitous in the visual processing system of vertebrates: On-center and off-center pathways, with an excitatory center and inhibitory surround; OOCS for short. The On-center pathway is excited by the presence of a light stimulus in its center, but not in its surround, whereas the Off-center pathway is excited by the absence of a light stimulus in its center, but not in its surround. We design OOCS pathways via a difference of Gaussians, with their variance computed analytically from the size of the receptive fields. OOCS pathways complement each other in their response to light stimuli, ensuring this way a strong edge-detection capability, and as a result an accurate and robust inference under challenging lighting conditions. We provide extensive empirical evidence showing that networks supplied with OOCS pathways gain accuracy and illumination-robustness from the novel edge representation, compared to other baselines.}, author = {Babaiee, Zahra and Hasani, Ramin and Lechner, Mathias and Rus, Daniela and Grosu, Radu}, booktitle = {Proceedings of the 38th International Conference on Machine Learning}, issn = {2640-3498}, location = {Virtual}, pages = {478--489}, publisher = {ML Research Press}, title = {{On-off center-surround receptive fields for accurate and robust image classification}}, volume = {139}, year = {2021}, } @inproceedings{10694, abstract = {In a two-player zero-sum graph game the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In bidding games, however, the players have budgets, and in each turn, we hold an “auction” (bidding) to determine which player moves the token: both players simultaneously submit bids and the higher bidder moves the token. The bidding mechanisms differ in their payment schemes. Bidding games were largely studied with variants of first-price bidding in which only the higher bidder pays his bid. We focus on all-pay bidding, where both players pay their bids. Finite-duration all-pay bidding games were studied and shown to be technically more challenging than their first-price counterparts. We study for the first time, infinite-duration all-pay bidding games. Our most interesting results are for mean-payoff objectives: we portray a complete picture for games played on strongly-connected graphs. We study both pure (deterministic) and mixed (probabilistic) strategies and completely characterize the optimal and almost-sure (with probability 1) payoffs the players can respectively guarantee. We show that mean-payoff games under all-pay bidding exhibit the intriguing mathematical properties of their first-price counterparts; namely, an equivalence with random-turn games in which in each turn, the player who moves is selected according to a (biased) coin toss. The equivalences for all-pay bidding are more intricate and unexpected than for first-price bidding.}, author = {Avni, Guy and Jecker, Ismael R and Zikelic, Dorde}, booktitle = {Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms}, editor = {Marx, Dániel}, isbn = {978-1-61197-646-5}, location = {Virtual}, pages = {617--636}, publisher = {Society for Industrial and Applied Mathematics}, title = {{Infinite-duration all-pay bidding games}}, doi = {10.1137/1.9781611976465.38}, year = {2021}, }