TY - JOUR AB - 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. AU - Castro, João Pl AU - Yancoskie, Michelle N. AU - Marchini, Marta AU - Belohlavy, Stefanie AU - Hiramatsu, Layla AU - Kučka, Marek AU - Beluch, William H. AU - Naumann, Ronald AU - Skuplik, Isabella AU - Cobb, John AU - Barton, Nicholas H AU - Rolian, Campbell AU - Chan, Yingguang Frank ID - 6713 JF - eLife TI - An integrative genomic analysis of the Longshanks selection experiment for longer limbs in mice VL - 8 ER - TY - GEN AB - 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. AU - Hofmann, Andrea C AU - Jirovec, Daniel AU - Borovkov, Maxim AU - Prieto Gonzalez, Ivan AU - Ballabio, Andrea AU - Frigerio, Jacopo AU - Chrastina, Daniel AU - Isella, Giovanni AU - Katsaros, Georgios ID - 10065 T2 - arXiv TI - Assessing the potential of Ge/SiGe quantum dots as hosts for singlet-triplet qubits ER - TY - JOUR AB - 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. AU - Valosková, Katarina AU - Biebl, Julia AU - Roblek, Marko AU - Emtenani, Shamsi AU - György, Attila AU - Misova, Michaela AU - Ratheesh, Aparna AU - Rodrigues, Patricia AU - Shkarina, Katerina AU - Larsen, Ida Signe Bohse AU - Vakhrushev, Sergey Y AU - Clausen, Henrik AU - Siekhaus, Daria E ID - 6187 JF - eLife SN - 2050-084X TI - A conserved major facilitator superfamily member orchestrates a subset of O-glycosylation to aid macrophage tissue invasion VL - 8 ER - TY - THES AB - 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. AU - Valosková, Katarina ID - 6546 SN - 2663-337X TI - The role of a highly conserved major facilitator superfamily member in Drosophila embryonic macrophage migration ER - TY - THES AB - 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. AU - Espinoza Martinez, Claudia ID - 6363 SN - 2663-337X TI - Parvalbumin+ interneurons enable efficient pattern separation in hippocampal microcircuits ER - TY - CONF AB - 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 AU - Huang, Mingzhang AU - Fu, Hongfei AU - Chatterjee, Krishnendu AU - Goharshady, Amir Kafshdar ID - 6780 T2 - Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications TI - Modular verification for almost-sure termination of probabilistic programs VL - 3 ER - TY - JOUR AB - 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. AU - Chatterjee, Krishnendu AU - Goharshady, Amir Kafshdar AU - Okati, Nastaran AU - Pavlogiannis, Andreas ID - 6380 IS - POPL JF - Proceedings of the ACM on Programming Languages SN - 2475-1421 TI - Efficient parameterized algorithms for data packing VL - 3 ER - TY - CONF AB - 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. AU - Chatterjee, Krishnendu AU - Goharshady, Amir Kafshdar AU - Pourdamghani, Arash ID - 6056 T2 - IEEE International Conference on Blockchain and Cryptocurrency TI - Probabilistic smart contracts: Secure randomness on the blockchain ER - TY - CONF AB - 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. AU - Chatterjee, Krishnendu AU - Goharshady, Amir Kafshdar AU - Pourdamghani, Arash ID - 6378 SN - 9781450359337 T2 - Proceedings of the 34th ACM Symposium on Applied Computing TI - Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving VL - Part F147772 ER - TY - CONF AB - 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. AU - Wang, Peixin AU - Fu, Hongfei AU - Goharshady, Amir Kafshdar AU - Chatterjee, Krishnendu AU - Qin, Xudong AU - Shi, Wenjun ID - 6175 KW - Program Cost Analysis KW - Program Termination KW - Probabilistic Programs KW - Martingales T2 - PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation TI - Cost analysis of nondeterministic probabilistic programs ER - TY - CONF AB - 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. AU - Chatterjee, Krishnendu AU - Goharshady, Amir Kafshdar AU - Goharshady, Ehsan Kafshdar ID - 6490 SN - 9781450359337 T2 - Proceedings of the 34th ACM Symposium on Applied Computing TI - The treewidth of smart contracts VL - Part F147772 ER - TY - JOUR AB - 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. AU - Chatterjee, Krishnendu AU - Goharshady, Amir Kafshdar AU - Goyal, Prateesh AU - Ibsen-Jensen, Rasmus AU - Pavlogiannis, Andreas ID - 7158 IS - 4 JF - ACM Transactions on Programming Languages and Systems SN - 0164-0925 TI - Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth VL - 41 ER - TY - JOUR AB - 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. AU - Chatterjee, Krishnendu AU - Fu, Hongfei AU - Goharshady, Amir Kafshdar ID - 7014 IS - 4 JF - ACM Transactions on Programming Languages and Systems TI - Non-polynomial worst-case analysis of recursive programs VL - 41 ER - TY - JOUR AB - 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. AU - Kühnen, Jakob AU - Scarselli, Davide AU - Hof, Björn ID - 6486 IS - 11 JF - Journal of Fluids Engineering SN - 00982202 TI - Relaminarization of pipe flow by means of 3D-printed shaped honeycombs VL - 141 ER - TY - JOUR AB - 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. AU - Scarselli, Davide AU - Kühnen, Jakob AU - Hof, Björn ID - 6228 JF - Journal of Fluid Mechanics SN - 00221120 TI - Relaminarising pipe flow by wall movement VL - 867 ER - TY - JOUR AB - 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. AU - Oochi, A AU - Hajny, Jakub AU - Fukui, K AU - Nakao, Y AU - Gallei, Michelle C AU - Quareshy, M AU - Takahashi, K AU - Kinoshita, T AU - Harborough, SR AU - Kepinski, S AU - Kasahara, H AU - Napier, RM AU - Friml, Jiří AU - Hayashi, KI ID - 6260 IS - 2 JF - Plant Physiology SN - 0032-0889 TI - Pinstatic acid promotes auxin transport by inhibiting PIN internalization VL - 180 ER - TY - JOUR AB - 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. AU - Shamipour, Shayan AU - Kardos, Roland AU - Xue, Shi-lei AU - Hof, Björn AU - Hannezo, Edouard B AU - Heisenberg, Carl-Philipp J ID - 6508 IS - 6 JF - Cell SN - 00928674 TI - Bulk actin dynamics drive phase segregation in zebrafish oocytes VL - 177 ER - TY - JOUR AU - Schwayer, Cornelia AU - Shamipour, Shayan AU - Pranjic-Ferscha, Kornelija AU - Schauer, Alexandra AU - Balda, M AU - Tada, M AU - Matter, K AU - Heisenberg, Carl-Philipp J ID - 7001 IS - 4 JF - Cell SN - 0092-8674 TI - Mechanosensation of tight junctions depends on ZO-1 phase separation and flow VL - 179 ER - TY - THES AB - 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. AU - Kopf, Aglaja ID - 6891 KW - cell biology KW - immunology KW - leukocyte KW - migration KW - microfluidics SN - 978-3-99078-002-2 TI - The implication of cytoskeletal dynamics on leukocyte migration ER - TY - JOUR AB - 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. AU - Renkawitz, Jörg AU - Kopf, Aglaja AU - Stopp, Julian A AU - de Vries, Ingrid AU - Driscoll, Meghan K. AU - Merrin, Jack AU - Hauschild, Robert AU - Welf, Erik S. AU - Danuser, Gaudenz AU - Fiolka, Reto AU - Sixt, Michael K ID - 6328 JF - Nature TI - Nuclear positioning facilitates amoeboid migration along the path of least resistance VL - 568 ER - TY - JOUR AU - Kopf, Aglaja AU - Sixt, Michael K ID - 6877 IS - 1 JF - Cell SN - 0092-8674 TI - The neural crest pitches in to remove apoptotic debris VL - 179 ER - TY - JOUR AU - Contreras, Ximena AU - Hippenmeyer, Simon ID - 6830 IS - 5 JF - Neuron SN - 08966273 TI - Memo1 tiles the radial glial cell grid VL - 103 ER - TY - JOUR AB - 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. AU - Adamowski, Maciek AU - Li, Lanxin AU - Friml, Jiří ID - 6627 IS - 13 JF - International Journal of Molecular Sciences TI - Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling VL - 20 ER - TY - JOUR AB - 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. AU - Hafner, Christian AU - Schumacher, Christian AU - Knoop, Espen AU - Auzinger, Thomas AU - Bickel, Bernd AU - Bächer, Moritz ID - 7117 IS - 6 JF - ACM Transactions on Graphics SN - 0730-0301 TI - X-CAD: Optimizing CAD Models with Extended Finite Elements VL - 38 ER - TY - JOUR AB - 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. AU - Agrawal, Nishchal AU - Choueiri, George H AU - Hof, Björn ID - 6189 IS - 11 JF - Physical Review Letters SN - 00319007 TI - Transition to turbulence in particle laden flows VL - 122 ER - TY - THES AB - 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. AU - Igler, Claudia ID - 6371 KW - gene regulation KW - biophysics KW - transcription factor binding KW - bacteria SN - 2663-337X TI - On the nature of gene regulatory design - The biophysics of transcription factor binding shapes gene regulation ER - TY - JOUR AB - 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. AU - Allini, Elie Noumon AU - Skórski, Maciej AU - Petura, Oto AU - Bernard, Florent AU - Laban, Marek AU - Fischer, Viktor ID - 10286 IS - 3 JF - IACR Transactions on Cryptographic Hardware and Embedded Systems TI - Evaluation and monitoring of free running oscillators serving as source of randomness VL - 2018 ER - TY - JOUR AB - Nuclear pore complexes (NPCs) form gateways that control molecular exchange between the nucleus and the cytoplasm. They impose a diffusion barrier to macromolecules and enable the selective transport of nuclear transport receptors with bound cargo. The underlying mechanisms that establish these permeability properties remain to be fully elucidated but require unstructured nuclear pore proteins rich in Phe-Gly (FG)-repeat domains of different types, such as FxFG and GLFG. While physical modeling and in vitro approaches have provided a framework for explaining how the FG network contributes to the barrier and transport properties of the NPC, it remains unknown whether the number and/or the spatial positioning of different FG-domains along a cylindrical, ∼40 nm diameter transport channel contributes to their collective properties and function. To begin to answer these questions, we have used DNA origami to build a cylinder that mimics the dimensions of the central transport channel and can house a specified number of FG-domains at specific positions with easily tunable design parameters, such as grafting density and topology. We find the overall morphology of the FG-domain assemblies to be dependent on their chemical composition, determined by the type and density of FG-repeat, and on their architectural confinement provided by the DNA cylinder, largely consistent with here presented molecular dynamics simulations based on a coarse-grained polymer model. In addition, high-speed atomic force microscopy reveals local and reversible FG-domain condensation that transiently occludes the lumen of the DNA central channel mimics, suggestive of how the NPC might establish its permeability properties. AU - Fisher, Patrick D. Ellis AU - Shen, Qi AU - Akpinar, Bernice AU - Davis, Luke K. AU - Chung, Kenny Kwok Hin AU - Baddeley, David AU - Šarić, Anđela AU - Melia, Thomas J. AU - Hoogenboom, Bart W. AU - Lin, Chenxiang AU - Lusk, C. Patrick ID - 10362 IS - 2 JF - ACS Nano KW - general physics and astronomy SN - 1936-0851 TI - A Programmable DNA origami platform for organizing intrinsically disordered nucleoporins within nanopore confinement VL - 12 ER - TY - JOUR AB - Mapping free-energy landscapes has proved to be a powerful tool for studying reaction mechanisms. Many complex biomolecular assembly processes, however, have remained challenging to access using this approach, including the aggregation of peptides and proteins into amyloid fibrils implicated in a range of disorders. Here, we generalize the strategy used to probe free-energy landscapes in protein folding to determine the activation energies and entropies that characterize each of the molecular steps in the aggregation of the amyloid-β peptide (Aβ42), which is associated with Alzheimer’s disease. Our results reveal that interactions between monomeric Aβ42 and amyloid fibrils during fibril-dependent secondary nucleation fundamentally reverse the thermodynamic signature of this process relative to primary nucleation, even though both processes generate aggregates from soluble peptides. By mapping the energetic and entropic contributions along the reaction trajectories, we show that the catalytic efficiency of Aβ42 fibril surfaces results from the enthalpic stabilization of adsorbing peptides in conformations amenable to nucleation, resulting in a dramatic lowering of the activation energy for nucleation. AU - Cohen, Samuel I. A. AU - Cukalevski, Risto AU - Michaels, Thomas C. T. AU - Šarić, Anđela AU - Törnquist, Mattias AU - Vendruscolo, Michele AU - Dobson, Christopher M. AU - Buell, Alexander K. AU - Knowles, Tuomas P. J. AU - Linse, Sara ID - 10360 IS - 5 JF - Nature Chemistry KW - general chemical engineering KW - general chemistry SN - 1755-4330 TI - Distinct thermodynamic signatures of oligomer generation in the aggregation of the amyloid-β peptide VL - 10 ER - TY - JOUR AB - The misfolding and aggregation of proteins into linear fibrils is widespread in human biology, for example, in connection with amyloid formation and the pathology of neurodegenerative disorders such as Alzheimer’s and Parkinson’s diseases. The oligomeric species that are formed in the early stages of protein aggregation are of great interest, having been linked with the cellular toxicity associated with these conditions. However, these species are not characterized in any detail experimentally, and their properties are not well understood. Many of these species have been found to have approximately spherical morphology and to be held together by hydrophobic interactions. We present here an analytical statistical mechanical model of globular oligomer formation from simple idealized amphiphilic protein monomers and show that this correlates well with Monte Carlo simulations of oligomer formation. We identify the controlling parameters of the model, which are closely related to simple quantities that may be fitted directly from experiment. We predict that globular oligomers are unlikely to form at equilibrium in many polypeptide systems but instead form transiently in the early stages of amyloid formation. We contrast the globular model of oligomer formation to a well-established model of linear oligomer formation, highlighting how the differing ensemble properties of linear and globular oligomers offer a potential strategy for characterizing oligomers from experimental measurements. AU - Dear, Alexander J. AU - Šarić, Anđela AU - Michaels, Thomas C. T. AU - Dobson, Christopher M. AU - Knowles, Tuomas P. J. ID - 10357 IS - 49 JF - The Journal of Physical Chemistry B KW - materials chemistry SN - 1520-6106 TI - Statistical mechanics of globular oligomer formation by protein molecules VL - 122 ER - TY - JOUR AB - Biological membranes typically contain a large number of different components dispersed in small concentrations in the main membrane phase, including proteins, sugars, and lipids of varying geometrical properties. Most of these components do not bind the cargo. Here, we show that such “inert” components can be crucial for the precise control of cross-membrane trafficking. Using a statistical mechanics model and molecular dynamics simulations, we demonstrate that the presence of inert membrane components of small isotropic curvatures dramatically influences cargo endocytosis, even if the total spontaneous curvature of such a membrane remains unchanged. Curved lipids, such as cholesterol, as well as asymmetrically included proteins and tethered sugars can, therefore, actively participate in the control of the membrane trafficking of nanoscopic cargo. We find that even a low-level expression of curved inert membrane components can determine the membrane selectivity toward the cargo size and can be used to selectively target membranes of certain compositions. Our results suggest a robust and general method of controlling cargo trafficking by adjusting the membrane composition without needing to alter the concentration of receptors or the average membrane curvature. This study indicates that cells can prepare for any trafficking event by incorporating curved inert components in either of the membrane leaflets. AU - Curk, Tine AU - Wirnsberger, Peter AU - Dobnikar, Jure AU - Frenkel, Daan AU - Šarić, Anđela ID - 10359 IS - 9 JF - Nano Letters KW - mechanical engineering KW - condensed matter physics SN - 1530-6984 TI - Controlling cargo trafficking in multicomponent membranes VL - 18 ER - TY - JOUR AB - Probing reaction mechanisms of supramolecular processes in soft and biological matter, such as protein aggregation, is inherently challenging. This is because these processes involve multiple molecular mechanisms that are associated with the rearrangement of large numbers of weak bonds, resulting in complex free energy landscapes with many kinetic barriers. Reaction rate measurements at different temperatures can offer unprecedented insights into the underlying molecular mechanisms. However, to be able to interpret such measurements, a key challenge is to establish which properties of the complex free energy landscapes are probed by the reaction rate. Here, we present a reaction rate theory for supramolecular kinetics based on Kramers theory of diffusive reactions over multiple kinetic barriers. We find that reaction rates for protein aggregation are of the Arrhenius–Eyring type and that the associated activation energies probe only one relevant barrier along the respective free energy landscapes. We apply this advancement to interpret, in experiments and in coarse-grained computer simulations, reaction rates of amyloid aggregation in terms of molecular mechanisms and associated thermodynamic signatures. These results suggest a practical extension of the concept of rate-determining steps for complex supramolecular processes and establish a general platform for probing the underlying energy landscape using kinetic measurements. AU - Michaels, Thomas C. T. AU - Liu, Lucie X. AU - Curk, Samo AU - Bolhuis, Peter G. AU - Šarić, Anđela AU - Knowles, Tuomas P. J. ID - 10358 IS - 21-22 JF - Molecular Physics KW - physical chemistry SN - 0026-8976 TI - Reaction rate theory for supramolecular kinetics: application to protein aggregation VL - 116 ER - TY - JOUR AB - Understanding how normally soluble peptides and proteins aggregate to form amyloid fibrils is central to many areas of modern biomolecular science, ranging from the development of functional biomaterials to the design of rational therapeutic strategies against increasingly prevalent medical conditions such as Alzheimer's and Parkinson's diseases. As such, there is a great need to develop models to mechanistically describe how amyloid fibrils are formed from precursor peptides and proteins. Here we review and discuss how ideas and concepts from chemical reaction kinetics can help to achieve this objective. In particular, we show how a combination of theory, experiments, and computer simulations, based on chemical kinetics, provides a general formalism for uncovering, at the molecular level, the mechanistic steps that underlie the phenomenon of amyloid fibril formation. AU - Michaels, Thomas C.T. AU - Šarić, Anđela AU - Habchi, Johnny AU - Chia, Sean AU - Meisl, Georg AU - Vendruscolo, Michele AU - Dobson, Christopher M. AU - Knowles, Tuomas P.J. ID - 10361 IS - 1 JF - Annual Review of Physical Chemistry KW - physical and theoretical chemistry SN - 0066-426X TI - Chemical kinetics for bridging molecular mechanisms and macroscopic measurements of amyloid fibril formation VL - 69 ER - TY - JOUR AB - Owing to their wide tunability, multiple internal degrees of freedom, and low disorder, graphene heterostructures are emerging as a promising experimental platform for fractional quantum Hall (FQH) studies. Here, we report FQH thermal activation gap measurements in dual graphite-gated monolayer graphene devices fabricated in an edgeless Corbino geometry. In devices with substrate-induced sublattice splitting, we find a tunable crossover between single- and multicomponent FQH states in the zero energy Landau level. Activation gaps in the single-component regime show excellent agreement with numerical calculations using a single broadening parameter Γ≈7.2K. In the first excited Landau level, in contrast, FQH gaps are strongly influenced by Landau level mixing, and we observe an unexpected valley-ordered state at integer filling ν=−4. AU - Polshyn, Hryhoriy AU - Zhou, H. AU - Spanton, E. M. AU - Taniguchi, T. AU - Watanabe, K. AU - Young, A. F. ID - 10626 IS - 22 JF - Physical Review Letters KW - general physics and astronomy SN - 0031-9007 TI - Quantitative transport measurements of fractional quantum Hall energy gaps in edgeless graphene devices VL - 121 ER - TY - JOUR AB - We present a scanning probe technique for measuring the dynamics of individual fluxoid transitions in multiply connected superconducting structures. In these measurements, a small magnetic particle attached to the tip of a silicon cantilever is scanned over a micron-size superconducting ring fabricated from a thin aluminum film. We find that near the superconducting transition temperature of the aluminum, the dissipation and frequency of the cantilever changes significantly at particular locations where the tip-induced magnetic flux penetrating the ring causes the two lowest-energy fluxoid states to become nearly degenerate. In this regime, we show that changes in the cantilever frequency and dissipation are well-described by a stochastic resonance (SR) process, wherein small oscillations of the cantilever in the presence of thermally activated phase slips (TAPS) in the ring give rise to a dynamical force that modifies the mechanical properties of the cantilever. Using the SR model, we calculate the average fluctuation rate of the TAPS as a function of temperature over a 32-dB range in frequency, and we compare it to the Langer-Ambegaokar-McCumber-Halperin theory for TAPS in one-dimensional superconducting structures. AU - Polshyn, Hryhoriy AU - Naibert, Tyler R. AU - Budakian, Raffi ID - 10627 IS - 18 JF - Physical Review B SN - 2469-9950 TI - Imaging phase slip dynamics in micron-size superconducting rings VL - 97 ER - TY - CONF AB - 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. AU - Chatterjee, Krishnendu AU - Dvořák, Wolfgang AU - Henzinger, Monika H AU - Svozil, Alexander ID - 10883 SN - 2398-7340 T2 - 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning TI - Quasipolynomial set-based symbolic algorithms for parity games VL - 57 ER - TY - JOUR AB - A graphical model encodes conditional independence relations via the Markov properties. For an undirected graph these conditional independence relations can be represented by a simple polytope known as the graph associahedron, which can be constructed as a Minkowski sum of standard simplices. We show that there is an analogous polytope for conditional independence relations coming from a regular Gaussian model, and it can be defined using multiinformation or relative entropy. For directed acyclic graphical models we give a construction of this polytope as a Minkowski sum of matroid polytopes. Finally, we apply this geometric insight to construct a new ordering-based search algorithm for causal inference via directed acyclic graphical models. AU - Mohammadi, Fatemeh AU - Uhler, Caroline AU - Wang, Charles AU - Yu, Josephine ID - 1092 IS - 1 JF - SIAM Journal on Discrete Mathematics TI - Generalized permutohedra from probabilistic graphical models VL - 32 ER - TY - CONF AB - 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. AU - Leopold, Nikolai K AU - Pickl, Peter ID - 11 TI - Mean-field limits of particles in interaction with quantised radiation fields VL - 270 ER - TY - JOUR AB - The total number of nuclear pore complexes (NPCs) per nucleus varies greatly between different cell types and is known to change during cell differentiation and cell transformation. However, the underlying mechanisms that control how many nuclear transport channels are assembled into a given nuclear envelope remain unclear. Here, we report that depletion of the NPC basket protein Tpr, but not Nup153, dramatically increases the total NPC number in various cell types. This negative regulation of Tpr occurs via a phosphorylation cascade of extracellular signal-regulated kinase (ERK), the central kinase of the mitogen-activated protein kinase (MAPK) pathway. Tpr serves as a scaffold for ERK to phosphorylate the nucleoporin (Nup) Nup153, which is critical for early stages of NPC biogenesis. Our results reveal a critical role of the Nup Tpr in coordinating signal transduction pathways during cell proliferation and the dynamic organization of the nucleus. AU - McCloskey, Asako AU - Ibarra, Arkaitz AU - HETZER, Martin W ID - 11063 IS - 19-20 JF - Genes & Development KW - Developmental Biology KW - Genetics SN - 0890-9369 TI - Tpr regulates the total number of nuclear pore complexes per cell nucleus VL - 32 ER - TY - JOUR AB - Biomarkers of aging can be used to assess the health of individuals and to study aging and age-related diseases. We generate a large dataset of genome-wide RNA-seq profiles of human dermal fibroblasts from 133 people aged 1 to 94 years old to test whether signatures of aging are encoded within the transcriptome. We develop an ensemble machine learning method that predicts age to a median error of 4 years, outperforming previous methods used to predict age. The ensemble was further validated by testing it on ten progeria patients, and our method is the only one that predicts accelerated aging in these patients. AU - Fleischer, Jason G. AU - Schulte, Roberta AU - Tsai, Hsiao H. AU - Tyagi, Swati AU - Ibarra, Arkaitz AU - Shokhirev, Maxim N. AU - Huang, Ling AU - HETZER, Martin W AU - Navlakha, Saket ID - 11064 JF - Genome Biology SN - 1474-760X TI - Predicting age from the transcriptome of human dermal fibroblasts VL - 19 ER - TY - JOUR AB - Distant luminous Lyman-α emitters (LAEs) are excellent targets for spectroscopic observations of galaxies in the epoch of reionisation (EoR). We present deep high-resolution (R = 5000) VLT/X-shooter observations, along with an extensive collection of photometric data of COLA1, a proposed double peaked LAE at z = 6.6. We rule out the possibility that COLA1’s emission line is an [OII] doublet at z = 1.475 on the basis of i) the asymmetric red line-profile and flux ratio of the peaks (blue/red=0.31 ± 0.03) and ii) an unphysical [OII]/Hα ratio ([OII]/Hα >  22). We show that COLA1’s observed B-band flux is explained by a faint extended foreground LAE, for which we detect Lyα and [OIII] at z = 2.142. We thus conclude that COLA1 is a real double-peaked LAE at z = 6.593, the first discovered at z >  6. COLA1 is UV luminous (M1500 = −21.6 ± 0.3), has a high equivalent width (EW0,Lyα = 120−40+50 Å) and very compact Lyα emission (r50,Lyα = 0.33−0.04+0.07 kpc). Relatively weak inferred Hβ+[OIII] line-emission from Spitzer/IRAC indicates an extremely low metallicity of Z <  1/20 Z⊙ or reduced strength of nebular lines due to high escape of ionising photons. The small Lyα peak separation of 220 ± 20 km s−1 implies a low HI column density and an ionising photon escape fraction of ≈15 − 30%, providing the first direct evidence that such galaxies contribute actively to the reionisation of the Universe at z >  6. Based on simple estimates, we find that COLA1 could have provided just enough photons to reionise its own ≈0.3 pMpc (2.3 cMpc) bubble, allowing the blue Lyα line to be observed. However, we also discuss alternative scenarios explaining the detected double peaked nature of COLA1. Our results show that future high-resolution observations of statistical samples of double peaked LAEs at z >  5 are a promising probe of the occurrence of ionised regions around galaxies in the EoR. AU - Matthee, Jorryt J AU - Sobral, David AU - Gronke, Max AU - Paulino-Afonso, Ana AU - Stefanon, Mauro AU - Röttgering, Huub ID - 11508 JF - Astronomy & Astrophysics KW - Space and Planetary Science KW - Astronomy and Astrophysics KW - galaxies: high-redshift / galaxies: formation / dark ages / reionization / first stars / techniques: spectroscopic / intergalactic medium SN - 0004-6361 TI - Confirmation of double peaked Lyα emission at z = 6.593: Witnessing a galaxy directly contributing to the reionisation of the universe VL - 619 ER - TY - JOUR AB - We investigate the clustering properties of ∼7000 H β + [O III] and [O II] narrowband-selected emitters at z ∼ 0.8–4.7 from the High-z Emission Line Survey. We find clustering lengths, r0, of 1.5–4.0 h−1 Mpc and minimum dark matter halo masses of 1010.7–12.1 M⊙ for our z = 0.8–3.2 H β + [O III] emitters and r0 ∼ 2.0–8.3 h−1 Mpc and halo masses of 1011.5–12.6 M⊙ for our z = 1.5–4.7 [O II] emitters. We find r0 to strongly increase both with increasing line luminosity and redshift. By taking into account the evolution of the characteristic line luminosity, L⋆(z), and using our model predictions of halo mass given r0, we find a strong, redshift-independent increasing trend between L/L⋆(z) and minimum halo mass. The faintest H β + [O III] emitters are found to reside in 109.5 M⊙ haloes and the brightest emitters in 1013.0 M⊙ haloes. For [O II] emitters, the faintest emitters are found in 1010.5 M⊙ haloes and the brightest emitters in 1012.6 M⊙ haloes. A redshift-independent stellar mass dependency is also observed where the halo mass increases from 1011 to 1012.5 M⊙ for stellar masses of 108.5 to 1011.5 M⊙, respectively. We investigate the interdependencies of these trends by repeating our analysis in a Lline−Mstar grid space for our most populated samples (H β + [O III] z = 0.84 and [O II] z = 1.47) and find that the line luminosity dependency is stronger than the stellar mass dependency on halo mass. For L > L⋆ emitters at all epochs, we find a relatively flat trend with halo masses of 1012.5–13 M⊙, which may be due to quenching mechanisms in massive haloes that is consistent with a transitional halo mass predicted by models. AU - Khostovan, A A AU - Sobral, D AU - Mobasher, B AU - Best, P N AU - Smail, I AU - Matthee, Jorryt J AU - Darvish, B AU - Nayyeri, H AU - Hemmati, S AU - Stott, J P ID - 11549 IS - 3 JF - Monthly Notices of the Royal Astronomical Society KW - Space and Planetary Science KW - Astronomy and Astrophysics KW - galaxies: evolution KW - galaxies: haloes KW - galaxies: high-redshift KW - galaxies: star formation KW - cosmology: observations KW - large-scale structure of Universe SN - 0035-8711 TI - The clustering of H β + [O III] and [O II] emitters since z ∼ 5: Dependencies with line luminosity and stellar mass VL - 478 ER - TY - JOUR AB - Deep narrow-band surveys have revealed a large population of faint Ly α emitters (LAEs) in the distant Universe, but relatively little is known about the most luminous sources (⁠LLyα≳1042.7 erg s−1; LLyα≳L∗Lyα⁠). Here we present the spectroscopic follow-up of 21 luminous LAEs at z ∼ 2–3 found with panoramic narrow-band surveys over five independent extragalactic fields (≈4 × 106 Mpc3 surveyed at z ∼ 2.2 and z ∼ 3.1). We use WHT/ISIS, Keck/DEIMOS, and VLT/X-SHOOTER to study these sources using high ionization UV lines. Luminous LAEs at z ∼ 2–3 have blue UV slopes (⁠β=−2.0+0.3−0.1⁠) and high Ly α escape fractions (⁠50+20−15 per cent) and span five orders of magnitude in UV luminosity (MUV ≈ −19 to −24). Many (70 per cent) show at least one high ionization rest-frame UV line such as C IV, N V, C III], He II or O III], typically blue-shifted by ≈100–200 km s−1 relative to Ly α. Their Ly α profiles reveal a wide variety of shapes, including significant blue-shifted components and widths from 200 to 4000 km s−1. Overall, 60 ± 11  per cent appear to be active galactic nucleus (AGN) dominated, and at LLyα > 1043.3 erg s−1 and/or MUV < −21.5 virtually all LAEs are AGNs with high ionization parameters (log U = 0.6 ± 0.5) and with metallicities of ≈0.5 − 1 Z⊙. Those lacking signatures of AGNs (40 ± 11  per cent) have lower ionization parameters (⁠logU=−3.0+1.6−0.9 and log ξion = 25.4 ± 0.2) and are apparently metal-poor sources likely powered by young, dust-poor ‘maximal’ starbursts. Our results show that luminous LAEs at z ∼ 2–3 are a diverse population and that 2×L∗Lyα and 2×M∗UV mark a sharp transition in the nature of LAEs, from star formation dominated to AGN dominated. AU - Sobral, David AU - Matthee, Jorryt J AU - Darvish, Behnam AU - Smail, Ian AU - Best, Philip N AU - Alegre, Lara AU - Röttgering, Huub AU - Mobasher, Bahram AU - Paulino-Afonso, Ana AU - Stroe, Andra AU - Oteo, Iván ID - 11557 IS - 2 JF - Monthly Notices of the Royal Astronomical Society KW - Space and Planetary Science KW - Astronomy and Astrophysics KW - galaxies: active KW - galaxies: evolution KW - galaxies: high-redshift KW - galaxies: ISM KW - galaxies: starburst KW - cosmology: observations SN - 0035-8711 TI - The nature of luminous Ly α emitters at z ∼ 2–3: Maximal dust-poor starbursts and highly ionizing AGN VL - 477 ER - TY - JOUR AB - We present and explore deep narrow- and medium-band data obtained with the Subaru and the Isaac Newton Telescopes in the ∼2 deg2 COSMOS field. We use these data as an extremely wide, low-resolution (R ∼ 20–80) Integral Field Unit survey to slice through the COSMOS field and obtain a large sample of ∼4000 Ly α emitters (LAEs) from z ∼ 2 to 6 in 16 redshift slices (SC4K). We present new Ly α luminosity functions (LFs) covering a comoving volume of ∼108 Mpc3. SC4K extensively complements ultradeep surveys, jointly covering over 4 dex in Ly α luminosity and revealing a global (2.5 < z < 6) synergy LF with α=−1.93+0.12−0.12⁠, log10Φ∗Lyα=−3.45+0.22−0.29 Mpc−3, and log10L∗Lyα=42.93+0.15−0.11 erg s−1. The Schechter component of the Ly α LF reveals a factor ∼5 rise in L∗Lyα and a ∼7 × decline in Φ∗Lyα from z ∼ 2 to 6. The data reveal an extra power-law (or Schechter) component above LLy α ≈ 1043.3 erg s−1 at z ∼ 2.2–3.5 and we show that it is partially driven by X-ray and radio active galactic nucleus (AGN), as their Ly α LF resembles the excess. The power-law component vanishes and/or is below our detection limits above z > 3.5, likely linked with the evolution of the AGN population. The Ly α luminosity density rises by a factor ∼2 from z ∼ 2 to 3 but is then found to be roughly constant (⁠1.1+0.2−0.2×1040 erg s−1 Mpc−3) to z ∼ 6, despite the ∼0.7 dex drop in ultraviolet (UV) luminosity density. The Ly α/UV luminosity density ratio rises from 4 ± 1 per cent to 30 ± 6 per cent from z ∼ 2.2 to 6. Our results imply a rise of a factor of ≈2 in the global ionization efficiency (ξion) and a factor ≈4 ± 1 in the Ly α escape fraction from z ∼ 2 to 6, hinting for evolution in both the typical burstiness/stellar populations and even more so in the typical interstellar medium conditions allowing Ly α photons to escape. AU - Sobral, David AU - Santos, Sérgio AU - Matthee, Jorryt J AU - Paulino-Afonso, Ana AU - Ribeiro, Bruno AU - Calhau, João AU - Khostovan, Ali A ID - 11558 IS - 4 JF - Monthly Notices of the Royal Astronomical Society KW - Space and Planetary Science KW - Astronomy and Astrophysics KW - galaxies: evolution KW - galaxies: formation KW - galaxies: high-redshift KW - galaxies: luminosity function KW - mass function KW - galaxies: statistics SN - 0035-8711 TI - Slicing COSMOS with SC4K: The evolution of typical Ly α emitters and the Ly α escape fraction from z ∼ 2 to 6 VL - 476 ER - TY - JOUR AB - We investigate the morphology of the [C II] emission in a sample of ‘normal’ star-forming galaxies at 5 < z < 7.2 in relation to their UV (rest-frame) counterpart. We use new Atacama Large Millimetre/submillimetre Array (ALMA) observations of galaxies at z ∼ 6–7, as well as a careful re-analysis of archival ALMA data. In total 29 galaxies were analysed, 21 of which are detected in [C II]. For several of the latter the [C II] emission breaks into multiple components. Only a fraction of these [C II] components, if any, is associated with the primary UV systems, while the bulk of the [C II] emission is associated either with fainter UV components, or not associated with any UV counterpart at the current limits. By taking into account the presence of all these components, we find that the L[CII]–SFR (star formation rate) relation at early epochs is fully consistent with the local relation, but it has a dispersion of 0.48 ± 0.07 dex, which is about two times larger than observed locally. We also find that the deviation from the local L[CII]–SFR relation has a weak anticorrelation with the EW(Ly α). The morphological analysis also reveals that [C II] emission is generally much more extended than the UV emission. As a consequence, these primordial galaxies are characterized by a [C II] surface brightness generally much lower than expected from the local Σ[CII]−ΣSFR relation. These properties are likely a consequence of a combination of different effects, namely gas metallicity, [C II] emission from obscured star-forming regions, strong variations of the ionization parameter, and circumgalactic gas in accretion or ejected by these primeval galaxies. AU - Carniani, S AU - Maiolino, R AU - Amorin, R AU - Pentericci, L AU - Pallottini, A AU - Ferrara, A AU - Willott, C J AU - Smit, R AU - Matthee, Jorryt J AU - Sobral, D AU - Santini, P AU - Castellano, M AU - De Barros, S AU - Fontana, A AU - Grazian, A AU - Guaita, L ID - 11555 IS - 1 JF - Monthly Notices of the Royal Astronomical Society KW - Space and Planetary Science KW - Astronomy and Astrophysics KW - galaxies: evolution KW - galaxies: high-redshift KW - galaxies: ISM KW - galaxies: formation SN - 0035-8711 TI - Kiloparsec-scale gaseous clumps and star formation at z = 5–7 VL - 478 ER - TY - JOUR AB - Observations show that star-forming galaxies reside on a tight 3D plane between mass, gas-phase metallicity, and star formation rate (SFR), which can be explained by the interplay between metal-poor gas inflows, SFR and outflows. However, different metals are released on different time-scales, which may affect the slope of this relation. Here, we use central, star-forming galaxies with Mstar = 109.0–10.5 M⊙ from the EAGLE hydrodynamical simulation to examine 3D relations between mass, SFR, and chemical enrichment using absolute and relative C, N, O, and Fe abundances. We show that the scatter is smaller when gas-phase α-enhancement is used rather than metallicity. A similar plane also exists for stellar α-enhancement, implying that present-day specific SFRs are correlated with long time-scale star formation histories. Between z = 0 and 1, the α-enhancement plane is even more insensitive to redshift than the plane using metallicity. However, it evolves at z > 1 due to lagging iron yields. At fixed mass, galaxies with higher SFRs have star formation histories shifted towards late times, are more α-enhanced, and this α-enhancement increases with redshift as observed. These findings suggest that relations between physical properties inferred from observations may be affected by systematic variations in α-enhancements. AU - Matthee, Jorryt J AU - Schaye, Joop ID - 11584 IS - 1 JF - Monthly Notices of the Royal Astronomical Society: Letters KW - Space and Planetary Science KW - Astronomy and Astrophysics KW - galaxies: abundances KW - galaxies: evolution KW - galaxies: formation KW - galaxies: star formation SN - 1745-3925 TI - Star-forming galaxies are predicted to lie on a fundamental plane of mass, star formation rate, and α-enhancement VL - 479 ER - TY - JOUR AB - We report on the confirmation and mass determination of π Men c, the first transiting planet discovered by NASA’s TESS space mission. π Men is a naked-eye (V = 5.65 mag), quiet G0 V star that was previously known to host a sub-stellar companion (π Men b) on a longperiod (Porb = 2091 days), eccentric (e = 0.64) orbit. Using TESS time-series photometry, combined with Gaia data, published UCLES at AAT Doppler measurements, and archival HARPS at ESO-3.6m radial velocities, we found that π Men c is a close-in planet with an orbital period of Porb = 6.27 days, a mass of Mc = 4.52 ± 0.81 M⊕, and a radius of Rc = 2.06 ± 0.03 R⊕. Based on the planet’s orbital period and size, π Men c is a super-Earth located at, or close to, the radius gap, while its mass and bulk density suggest it may have held on to a significant atmosphere. Because of the brightness of the host star, this system is highly suitable for a wide range of further studies to characterize the planetary atmosphere and dynamical properties. We also performed an asteroseismic analysis of the TESS data and detected a hint of power excess consistent with the seismic values expected for this star, although this result depends on the photometric aperture used to extract the light curve. This marginal detection is expected from pre-launch simulations hinting at the asteroseismic potential of the TESS mission for longer, multi-sector observations and/or for more evolved bright stars. AU - Gandolfi, D. AU - Barragán, O. AU - Livingston, J. H. AU - Fridlund, M. AU - Justesen, A. B. AU - Redfield, S. AU - Fossati, L. AU - Mathur, S. AU - Grziwa, S. AU - Cabrera, J. AU - García, R. A. AU - Persson, C. M. AU - Van Eylen, V. AU - Hatzes, A. P. AU - Hidalgo, D. AU - Albrecht, S. AU - Bugnet, Lisa Annabelle AU - Cochran, W. D. AU - Csizmadia, Sz. AU - Deeg, H. AU - Eigmüller, Ph. AU - Endl, M. AU - Erikson, A. AU - Esposito, M. AU - Guenther, E. AU - Korth, J. AU - Luque, R. AU - Montañes Rodríguez, P. AU - Nespral, D. AU - Nowak, G. AU - Pätzold, M. AU - Prieto-Arranz, J. ID - 11619 JF - Astronomy & Astrophysics KW - Space and Planetary Science KW - Astronomy and Astrophysics KW - planetary systems / planets and satellites KW - detection / planets and satellites KW - fundamental parameters / planets and satellites KW - terrestrial planets / stars KW - fundamental parameters SN - 0004-6361 TI - TESS’s first planet: A super-Earth transiting the naked-eye star π Mensae VL - 619 ER - TY - JOUR AB - Asteroseismology provides global stellar parameters such as masses, radii, or surface gravities using mean global seismic parameters and effective temperature for thousands of low-mass stars (0.8 M⊙ < M < 3 M⊙). This methodology has been successfully applied to stars in which acoustic modes excited by turbulent convection are measured. Other methods such as the Flicker technique can also be used to determine stellar surface gravities, but only works for log g above 2.5 dex. In this work, we present a new metric called FliPer (Flicker in spectral power density, in opposition to the standard Flicker measurement which is computed in the time domain); it is able to extend the range for which reliable surface gravities can be obtained (0.1 < log g < 4.6 dex) without performing any seismic analysis for stars brighter than Kp < 14. FliPer takes into account the average variability of a star measured in the power density spectrum in a given range of frequencies. However, FliPer values calculated on several ranges of frequency are required to better characterize a star. Using a large set of asteroseismic targets it is possible to calibrate the behavior of surface gravity with FliPer through machine learning. This calibration made with a random forest regressor covers a wide range of surface gravities from main-sequence stars to subgiants and red giants, with very small uncertainties from 0.04 to 0.1 dex. FliPer values can be inserted in automatic global seismic pipelines to either give an estimation of the stellar surface gravity or to assess the quality of the seismic results by detecting any outliers in the obtained νmax values. FliPer also constrains the surface gravities of main-sequence dwarfs using only long-cadence data for which the Nyquist frequency is too low to measure the acoustic-mode properties. AU - Bugnet, Lisa Annabelle AU - García, R. A. AU - Davies, G. R. AU - Mathur, S. AU - Corsaro, E. AU - Hall, O. J. AU - Rendle, B. M. ID - 11618 JF - Astronomy & Astrophysics KW - Space and Planetary Science KW - Astronomy and Astrophysics KW - asteroseismology / methods KW - data analysis / stars KW - oscillations SN - 0004-6361 TI - FliPer: A global measure of power density to estimate surface gravities of main-sequence solar-like stars and red giants VL - 620 ER - TY - JOUR AB - We report the discovery and characterization of HD 89345b (K2-234b; EPIC 248777106b), a Saturn-sized planet orbiting a slightly evolved star. HD 89345 is a bright star (V = 9.3 mag) observed by the K2 mission with 1 min time sampling. It exhibits solar-like oscillations. We conducted asteroseismology to determine the parameters of the star, finding the mass and radius to be 1.12+0.04−0.01M⊙ and 1.657+0.020−0.004R⊙⁠, respectively. The star appears to have recently left the main sequence, based on the inferred age, 9.4+0.4−1.3Gyr⁠, and the non-detection of mixed modes. The star hosts a ‘warm Saturn’ (P = 11.8 d, Rp = 6.86 ± 0.14 R⊕). Radial-velocity follow-up observations performed with the FIbre-fed Echelle Spectrograph, HARPS, and HARPS-N spectrographs show that the planet has a mass of 35.7 ± 3.3 M⊕. The data also show that the planet’s orbit is eccentric (e ≈ 0.2). An investigation of the rotational splitting of the oscillation frequencies of the star yields no conclusive evidence on the stellar inclination angle. We further obtained Rossiter–McLaughlin observations, which result in a broad posterior of the stellar obliquity. The planet seems to confirm to the same patterns that have been observed for other sub-Saturns regarding planet mass and multiplicity, orbital eccentricity, and stellar metallicity. AU - Van Eylen, V AU - Dai, F AU - Mathur, S AU - Gandolfi, D AU - Albrecht, S AU - Fridlund, M AU - García, R A AU - Guenther, E AU - Hjorth, M AU - Justesen, A B AU - Livingston, J AU - Lund, M N AU - Pérez Hernández, F AU - Prieto-Arranz, J AU - Regulo, C AU - Bugnet, Lisa Annabelle AU - Everett, M E AU - Hirano, T AU - Nespral, D AU - Nowak, G AU - Palle, E AU - Silva Aguirre, V AU - Trifonov, T AU - Winn, J N AU - Barragán, O AU - Beck, P G AU - Chaplin, W J AU - Cochran, W D AU - Csizmadia, S AU - Deeg, H AU - Endl, M AU - Heeren, P AU - Grziwa, S AU - Hatzes, A P AU - Hidalgo, D AU - Korth, J AU - Mathis, S AU - Montañes Rodriguez, P AU - Narita, N AU - Patzold, M AU - Persson, C M AU - Rodler, F AU - Smith, A M S ID - 11620 IS - 4 JF - Monthly Notices of the Royal Astronomical Society KW - Space and Planetary Science KW - Astronomy and Astrophysics KW - asteroseismology KW - planets and satellites: composition KW - planets and satellites: formation KW - planets and satellites: fundamental parameters SN - 0035-8711 TI - HD 89345: A bright oscillating star hosting a transiting warm Saturn-sized planet observed by K2 VL - 478 ER - TY - GEN AB - The recently launched NASA Transiting Exoplanet Survey Satellite (TESS) mission is going to collect lightcurves for a few hundred million of stars and we expect to increase the number of pulsating stars to analyze compared to the few thousand stars observed by the CoRoT, Kepler and K2 missions. However, most of the TESS targets have not yet been properly classified and characterized. In order to improve the analysis of the TESS data, it is crucial to determine the type of stellar pulsations in a timely manner. We propose an automatic method to classify stars attending to their pulsation properties, in particular, to identify solar-like pulsators among all TESS targets. It relies on the use of the global amount of power contained in the power spectrum (already known as the FliPer method) as a key parameter, along with the effective temperature, to feed into a machine learning classifier. Our study, based on TESS simulated datasets, shows that we are able to classify pulsators with a 98% accuracy. AU - Bugnet, Lisa Annabelle AU - García, R. A. AU - Davies, G. R. AU - Mathur, S. AU - Hall, O. J. AU - Rendle, B. M. ID - 11631 KW - asteroseismology - methods KW - data analysis - stars KW - oscillations T2 - arXiv TI - FliPer: Classifying TESS pulsating stars ER - TY - JOUR AB - The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our algorithm is based on cluster contraction using label propagation and Padberg and Rinaldi’s contraction heuristics [SIAM Review, 1991]. We give both sequential and shared-memory parallel implementations of our algorithm. Extensive experiments on both real-world and generated instances show that our algorithm finds the optimal cut on nearly all instances significantly faster than other state-of-the-art exact algorithms, and our error rate is lower than that of other heuristic algorithms. In addition, our parallel algorithm runs a factor 7.5× faster on average when using 32 threads. To further speed up computations, we also give a version of our algorithm that performs random edge contractions as preprocessing. This version achieves a lower running time and better parallel scalability at the expense of a higher error rate. AU - Henzinger, Monika H AU - Noe, Alexander AU - Schulz, Christian AU - Strash, Darren ID - 11657 JF - ACM Journal of Experimental Algorithmics KW - Theoretical Computer Science SN - 1084-6654 TI - Practical minimum cut algorithms VL - 23 ER - TY - JOUR AB - The focus of classic mechanism design has been on truthful direct-revelation mechanisms. In the context of combinatorial auctions, the truthful direct-revelation mechanism that maximizes social welfare is the Vickrey-Clarke-Groves mechanism. For many valuation spaces, computing the allocation and payments of the VCG mechanism, however, is a computationally hard problem. We thus study the performance of the VCG mechanism when bidders are forced to choose bids from a subspace of the valuation space for which the VCG outcome can be computed efficiently. We prove improved upper bounds on the welfare loss for restrictions to additive bids and upper and lower bounds for restrictions to non-additive bids. These bounds show that increased expressiveness can give rise to additional equilibria of poorer efficiency. AU - Dütting, Paul AU - Henzinger, Monika H AU - Starnberger, Martin ID - 11667 IS - 2 JF - ACM Transactions on Economics and Computation KW - Theory of computation KW - Algorithmic game theory and mechanism design KW - Applied computing KW - Economics KW - Simplified mechanisms KW - Combinatorial auctions with item bidding KW - Price of anarchy SN - 2167-8375 TI - Valuation compressions in VCG-based combinatorial auctions VL - 6 ER - TY - JOUR AB - We present a deterministic incremental algorithm for exactly maintaining the size of a minimum cut with O(log3 n log log2 n) amortized time per edge insertion and O(1) query time. This result partially answers an open question posed by Thorup (2007). It also stays in sharp contrast to a polynomial conditional lower bound for the fully dynamic weighted minimum cut problem. Our algorithm is obtained by combining a sparsification technique of Kawarabayashi and Thorup (2015) or its recent improvement by Henzinger, Rao, and Wang (2017), and an exact incremental algorithm of Henzinger (1997). We also study space-efficient incremental algorithms for the minimum cut problem. Concretely, we show that there exists an O(nlog n/ε2) space Monte Carlo algorithm that can process a stream of edge insertions starting from an empty graph, and with high probability, the algorithm maintains a (1+ε)-approximation to the minimum cut. The algorithm has O((α (n) log3 n)/ε 2) amortized update time and constant query time, where α (n) stands for the inverse of Ackermann function. AU - Goranci, Gramoz AU - Henzinger, Monika H AU - Thorup, Mikkel ID - 11664 IS - 2 JF - ACM Transactions on Algorithms SN - 1549-6325 TI - Incremental exact min-cut in polylogarithmic amortized update time VL - 14 ER - TY - JOUR AB - We develop a dynamic version of the primal-dual method for optimization problems, and apply it to obtain the following results. (1) For the dynamic set-cover problem, we maintain an O ( f 2)-approximately optimal solution in O ( f · log(m + n)) amortized update time, where f is the maximum “frequency” of an element, n is the number of sets, and m is the maximum number of elements in the universe at any point in time. (2) For the dynamic b-matching problem, we maintain an O (1)-approximately optimal solution in O (log3 n) amortized update time, where n is the number of nodes in the graph. AU - Bhattacharya, Sayan AU - Henzinger, Monika H AU - Italiano, Giuseppe ID - 11757 IS - 08 JF - Information and Computation SN - 0890-5401 TI - Dynamic algorithms via the primal-dual method VL - 261 ER - TY - CONF AB - We consider the problem of dynamically maintaining (approximate) all-pairs effective resistances in separable graphs, which are those that admit an n^{c}-separator theorem for some c<1. We give a fully dynamic algorithm that maintains (1+epsilon)-approximations of the all-pairs effective resistances of an n-vertex graph G undergoing edge insertions and deletions with O~(sqrt{n}/epsilon^2) worst-case update time and O~(sqrt{n}/epsilon^2) worst-case query time, if G is guaranteed to be sqrt{n}-separable (i.e., it is taken from a class satisfying a sqrt{n}-separator theorem) and its separator can be computed in O~(n) time. Our algorithm is built upon a dynamic algorithm for maintaining approximate Schur complement that approximately preserves pairwise effective resistances among a set of terminals for separable graphs, which might be of independent interest. We complement our result by proving that for any two fixed vertices s and t, no incremental or decremental algorithm can maintain the s-t effective resistance for sqrt{n}-separable graphs with worst-case update time O(n^{1/2-delta}) and query time O(n^{1-delta}) for any delta>0, unless the Online Matrix Vector Multiplication (OMv) conjecture is false. We further show that for general graphs, no incremental or decremental algorithm can maintain the s-t effective resistance problem with worst-case update time O(n^{1-delta}) and query-time O(n^{2-delta}) for any delta >0, unless the OMv conjecture is false. AU - Goranci, Gramoz AU - Henzinger, Monika H AU - Peng, Pan ID - 11828 SN - 1868-8969 T2 - 26th Annual European Symposium on Algorithms TI - Dynamic effective resistances and approximate schur complement on separable graphs VL - 112 ER - TY - CONF AB - We study the metric facility location problem with client insertions and deletions. This setting differs from the classic dynamic facility location problem, where the set of clients remains the same, but the metric space can change over time. We show a deterministic algorithm that maintains a constant factor approximation to the optimal solution in worst-case time O~(2^{O(kappa^2)}) per client insertion or deletion in metric spaces while answering queries about the cost in O(1) time, where kappa denotes the doubling dimension of the metric. For metric spaces with bounded doubling dimension, the update time is polylogarithmic in the parameters of the problem. AU - Goranci, Gramoz AU - Henzinger, Monika H AU - Leniowski, Dariusz ID - 11827 SN - 1868-8969 T2 - 26th Annual European Symposium on Algorithms TI - A tree structure for dynamic facility location VL - 112 ER - TY - JOUR AB - In the decremental single-source shortest paths (SSSP) problem, we want to maintain the distances between a given source node s and every other node in an n-node m-edge graph G undergoing edge deletions. While its static counterpart can be solved in near-linear time, this decremental problem is much more challenging even in the undirected unweighted case. In this case, the classic O(mn) total update time of Even and Shiloach [16] has been the fastest known algorithm for three decades. At the cost of a (1+ϵ)-approximation factor, the running time was recently improved to n2+o(1) by Bernstein and Roditty [9]. In this article, we bring the running time down to near-linear: We give a (1+ϵ)-approximation algorithm with m1+o(1) expected total update time, thus obtaining near-linear time. Moreover, we obtain m1+o(1) log W time for the weighted case, where the edge weights are integers from 1 to W. The only prior work on weighted graphs in o(mn) time is the mn0.9 + o(1)-time algorithm by Henzinger et al. [18, 19], which works for directed graphs with quasi-polynomial edge weights. The expected running time bound of our algorithm holds against an oblivious adversary. In contrast to the previous results, which rely on maintaining a sparse emulator, our algorithm relies on maintaining a so-called sparse (h, ϵ)-hop set introduced by Cohen [12] in the PRAM literature. An (h, ϵ)-hop set of a graph G=(V, E) is a set F of weighted edges such that the distance between any pair of nodes in G can be (1+ϵ)-approximated by their h-hop distance (given by a path containing at most h edges) on G′=(V, E ∪ F). Our algorithm can maintain an (no(1), ϵ)-hop set of near-linear size in near-linear time under edge deletions. It is the first of its kind to the best of our knowledge. To maintain approximate distances using this hop set, we extend the monotone Even-Shiloach tree of Henzinger et al. [20] and combine it with the bounded-hop SSSP technique of Bernstein [4, 5] and Mądry [27]. These two new tools might be of independent interest. AU - Henzinger, Monika H AU - Krinninger, Sebastian AU - Nanongkai, Danupon ID - 11768 IS - 6 JF - Journal of the ACM SN - 0004-5411 TI - Decremental single-source shortest paths on undirected graphs in near-linear total update time VL - 65 ER - TY - CONF AB - We design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions. In the static setting, there are simple linear time algorithms for (Δ + 1)- vertex coloring and (2Δ – 1)-edge coloring in a graph with maximum degree Δ. It is natural to ask if we can efficiently maintain such colorings in the dynamic setting as well. We get the following three results. (1) We present a randomized algorithm which maintains a (Δ + 1)-vertex coloring with O(log Δ) expected amortized update time. (2) We present a deterministic algorithm which maintains a (1 + o(1)Δ-vertex coloring with O(polylog Δ) amortized update time. (3) We present a simple, deterministic algorithm which maintains a (2Δ – 1)-edge coloring with O(log Δ) worst-case update time. This improves the recent O(Δ)-edge coloring algorithm with worst-case update time [4]. AU - Bhattacharya, Sayan AU - Chakrabarty, Deeparnab AU - Henzinger, Monika H AU - Nanongkai, Danupon ID - 11872 T2 - 29th Annual ACM-SIAM Symposium on Discrete Algorithms TI - Dynamic algorithms for graph coloring ER - TY - CONF AB - The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our algorithm is based on cluster contraction using label propagation and Padberg and Rinaldi's contraction heuristics [SIAM Review, 1991]. We give both sequential and shared-memory parallel implementations of our algorithm. Extensive experiments on both real-world and generated instances show that our algorithm finds the optimal cut on nearly all instances significantly faster than other state-of-the-art exact algorithms, and our error rate is lower than that of other heuristic algorithms. In addition, our parallel algorithm shows good scalability. AU - Henzinger, Monika H AU - Noe, Alexander AU - Schulz, Christian AU - Strash, Darren ID - 11882 T2 - 20th Workshop on Algorithm Engineering and Experiments TI - Practical minimum cut algorithms ER - TY - JOUR AB - We present the first deterministic data structures for maintaining approximate minimum vertex cover and maximum matching in a fully dynamic graph 𝐺=(𝑉,𝐸), with |𝑉|=𝑛 and |𝐸|=𝑚, in 𝑜(𝑚‾‾√) time per update. In particular, for minimum vertex cover, we provide deterministic data structures for maintaining a (2+𝜖) approximation in 𝑂(log𝑛/𝜖2) amortized time per update. For maximum matching, we show how to maintain a (3+𝜖) approximation in 𝑂(min(𝑛√/𝜖,𝑚1/3/𝜖2) amortized time per update and a (4+𝜖) approximation in 𝑂(𝑚1/3/𝜖2) worst-case time per update. Our data structure for fully dynamic minimum vertex cover is essentially near-optimal and settles an open problem by Onak and Rubinfeld [in 42nd ACM Symposium on Theory of Computing, Cambridge, MA, ACM, 2010, pp. 457--464]. AU - Bhattacharya, Sayan AU - Henzinger, Monika H AU - Italiano, Giuseppe F. ID - 11890 IS - 3 JF - SIAM Journal on Computing SN - 0097-5397 TI - Deterministic fully dynamic data structures for vertex cover and matching VL - 47 ER - TY - CONF AB - It is common knowledge that there is no single best strategy for graph clustering, which justifies a plethora of existing approaches. In this paper, we present a general memetic algorithm, VieClus, to tackle the graph clustering problem. This algorithm can be adapted to optimize different objective functions. A key component of our contribution are natural recombine operators that employ ensemble clusterings as well as multi-level techniques. Lastly, we combine these techniques with a scalable communication protocol, producing a system that is able to compute high-quality solutions in a short amount of time. We instantiate our scheme with local search for modularity and show that our algorithm successfully improves or reproduces all entries of the 10th DIMACS implementation challenge under consideration using a small amount of time. AU - Biedermann, Sonja AU - Henzinger, Monika H AU - Schulz, Christian AU - Schuster, Bernhard ID - 11911 SN - 1868-8969 T2 - 17th International Symposium on Experimental Algorithms TI - Memetic graph clustering VL - 103 ER - TY - JOUR AB - Solid reagents, leaching catalysts, and heterogeneous photocatalysts are commonly employed in batch processes but are ill-suited for continuous-flow chemistry. Heterogeneous catalysts for thermal reactions are typically used in packed-bed reactors, which cannot be penetrated by light and thus are not suitable for photocatalytic reactions involving solids. We demonstrate that serial micro-batch reactors (SMBRs) allow for the continuous utilization of solid materials together with liquids and gases in flow. This technology was utilized to develop selective and efficient fluorination reactions using a modified graphitic carbon nitride heterogeneous catalyst instead of costly homogeneous metal polypyridyl complexes. The merger of this inexpensive, recyclable catalyst and the SMBR approach enables sustainable and scalable photocatalysis. AU - Pieber, Bartholomäus AU - Shalom, Menny AU - Antonietti, Markus AU - Seeberger, Peter H. AU - Gilmore, Kerry ID - 11958 IS - 31 JF - Angewandte Chemie International Edition SN - 1433-7851 TI - Continuous heterogeneous photocatalysis in serial micro-batch reactors VL - 57 ER - TY - JOUR AB - 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. AU - Flandoli, Franco AU - Russo, Francesco AU - Zanco, Giovanni A ID - 1215 IS - 2 JF - Journal of Theoretical Probability TI - Infinite-dimensional calculus under weak spatial regularity of the processes VL - 31 ER - TY - JOUR AB - By investigating the in situ chemical and O-isotope compositions of olivine in lightly sintered dust agglomerates from the early Solar System, we constrain their origins and the retention of dust in the protoplanetary disk. The grain sizes of silicates in these agglomeratic olivine (AO) chondrules indicate that the grain sizes of chondrule precursors in the Renazzo-like carbonaceous (CR) chondrites ranged from <1 to 80 µm. We infer this grain size range to be equivalent to the size range for dust in the early Solar System. AO chondrules may contain, but are not solely composed of, recycled fragments of earlier formed chondrules. They also contain 16O-rich olivine related to amoeboid olivine aggregates and represent the best record of chondrule-precursor materials. AO chondrules contain one or more large grains, sometimes similar to FeO-poor (type I) and/or FeO-rich (type II) chondrules, while others contain a type II chondrule core. These morphologies are consistent with particle agglomeration by electrostatic charging of grains during collision, a process that may explain solid agglomeration in the protoplanetary disk in the micrometer size regime. The petrographic, isotopic, and chemical compositions of AO chondrules are consistent with chondrule formation by large-scale shocks, bow shocks, and current sheets. The petrographic, isotopic, and chemical similarities between AO chondrules in CR chondrites and chondrule-like objects from comet 81P/Wild 2 indicate that comets contain AO chondrules. We infer that these AO chondrules likely formed in the inner Solar System and migrated to the comet forming region at least 3 Ma after the formation of the first Solar System solids. Observations made in this study imply that the protoplanetary disk retained a dusty disk at least ∼3.7 Ma after the formation of the first Solar System solids, longer than half of the dusty accretion disks observed around other stars. AU - Waitukaitis, Scott R AU - Schrader, Devin AU - Nagashima, Kazuhide AU - Davidson, Jemma AU - Mccoy, Timothy AU - Conolly Jr, Harold AU - Lauretta, Dante ID - 124 JF - Geochimica et Cosmochimica Acta TI - The retention of dust in protoplanetary disks: evidence from agglomeration olivine chondrules from the outer solar system VL - 223 ER - TY - JOUR AB - Many fields of study, including medical imaging, granular physics, colloidal physics, and active matter, require the precise identification and tracking of particle-like objects in images. While many algorithms exist to track particles in diffuse conditions, these often perform poorly when particles are densely packed together—as in, for example, solid-like systems of granular materials. Incorrect particle identification can have significant effects on the calculation of physical quantities, which makes the development of more precise and faster tracking algorithms a worthwhile endeavor. In this work, we present a new tracking algorithm to identify particles in dense systems that is both highly accurate and fast. We demonstrate the efficacy of our approach by analyzing images of dense, solid-state granular media, where we achieve an identification error of 5% in the worst evaluated cases. Going further, we propose a parallelization strategy for our algorithm using a GPU, which results in a speedup of up to 10× when compared to a sequential CPU implementation in C and up to 40× when compared to the reference MATLAB library widely used for particle tracking. Our results extend the capabilities of state-of-the-art particle tracking methods by allowing fast, high-fidelity detection in dense media at high resolutions. AU - Cerda, Mauricio AU - Waitukaitis, Scott R AU - Navarro, Cristóbal AU - Silva, Juan AU - Mujica, Nicolás AU - Hitschfeld, Nancy ID - 125 JF - Computer Physics Communications TI - A high-speed tracking algorithm for dense granular media VL - 227 ER - TY - JOUR AB - The Leidenfrost effect occurs when a liquid or stiff sublimable solid near a hot surface creates enough vapor beneath it to lift itself up and float. In contrast, vaporizable soft solids, e.g., hydrogels, have been shown to exhibit persistent bouncing - the elastic Leidenfrost effect. By carefully lowering hydrogel spheres towards a hot surface, we discover that they are also capable of floating. The bounce-to-float transition is controlled by the approach velocity and temperature, analogously to the "dynamic Leidenfrost effect." For the floating regime, we measure power-law scalings for the gap geometry, which we explain with a model that couples the vaporization rate to the spherical shape. Our results reveal that hydrogels are a promising pathway for controlling floating Leidenfrost objects through shape. AU - Waitukaitis, Scott R AU - Harth, Kirsten AU - Van Hecke, Martin ID - 126 IS - 4 JF - Physical Review Letters TI - From bouncing to floating: the Leidenfrost effect with hydrogel spheres VL - 121 ER - TY - JOUR AB - The ideas of topology are breaking ground in origami-based metamaterials. Experiments now show that certain shapes — doughnuts included — exhibit topological bistability, and can be made to click between different topologically stable states. AU - Waitukaitis, Scott R ID - 127 IS - 8 JF - Nature Physics TI - Clicks for doughnuts VL - 14 ER - TY - CONF AB - We survey recent efforts to quantify failures of the Hasse principle in families of rationally connected varieties. AU - Browning, Timothy D ID - 174 IS - 2 TI - How often does the Hasse principle hold? VL - 97 ER - TY - JOUR AB - For a general class of non-negative functions defined on integral ideals of number fields, upper bounds are established for their average over the values of certain principal ideals that are associated to irreducible binary forms with integer coefficients. AU - Browning, Timothy D AU - Sofos, Efthymios ID - 176 IS - 3 JF - International Journal of Nuber Theory TI - Averages of arithmetic functions over principal ideals VL - 15 ER - TY - JOUR AB - We give an upper bound for the number of rational points of height at most B, lying on a surface defined by a quadratic form Q. The bound shows an explicit dependence on Q. It is optimal with respect to B, and is also optimal for typical forms Q. AU - Browning, Timothy D AU - Heath-Brown, Roger ID - 178 JF - Discrete Analysis TI - Counting rational points on quadric surfaces VL - 15 ER - TY - CONF AB - 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. AU - Fulek, Radoslav AU - Kynčl, Jan ID - 185 SN - 978-3-95977-066-8 TI - Hanani-Tutte for approximating maps of graphs VL - 99 ER - TY - CONF AB - 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. AU - Edelsbrunner, Herbert AU - Virk, Ziga AU - Wagner, Hubert ID - 188 TI - Smallest enclosing spheres and Chernoff points in Bregman geometry VL - 99 ER - TY - JOUR AB - We consider the problem of learning a Bayesian network or directed acyclic graph model from observational data. A number of constraint‐based, score‐based and hybrid algorithms have been developed for this purpose. Statistical consistency guarantees of these algorithms rely on the faithfulness assumption, which has been shown to be restrictive especially for graphs with cycles in the skeleton. We here propose the sparsest permutation (SP) algorithm, showing that learning Bayesian networks is possible under strictly weaker assumptions than faithfulness. This comes at a computational price, thereby indicating a statistical‐computational trade‐off for causal inference algorithms. In the Gaussian noiseless setting, we prove that the SP algorithm boils down to finding the permutation of the variables with the sparsest Cholesky decomposition of the inverse covariance matrix, which is equivalent to ℓ0‐penalized maximum likelihood estimation. We end with a simulation study showing that in line with the proven stronger consistency guarantees, and the SP algorithm compares favourably to standard causal inference algorithms in terms of accuracy for a given sample size. AU - Raskutti, Garvesh AU - Uhler, Caroline ID - 2015 IS - 1 JF - STAT TI - Learning directed acyclic graphs based on sparsest permutations VL - 7 ER - TY - JOUR AB - 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. AU - De Martino, Andrea AU - De Martino, Daniele ID - 306 IS - 4 JF - Heliyon TI - An introduction to the maximum entropy approach and its application to inference problems in biology VL - 4 ER - TY - BOOK AB - 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. AU - Clarke, Edmund M. AU - Henzinger, Thomas A AU - Veith, Helmut AU - Bloem, Roderick ID - 3300 SN - 978-3-319-10574-1 TI - Handbook of Model Checking ER - TY - CHAP AB - 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. AU - Zagórski, Marcin P AU - Kicheva, Anna ID - 37 SN - 1064-3745 T2 - Morphogen Gradients TI - Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube VL - 1863 ER - TY - JOUR AB - 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. AU - Misun, Patrick AU - Birchler, Axel AU - Lang, Moritz AU - Hierlemann, Andreas AU - Frey, Olivier ID - 305 JF - Methods in Molecular Biology TI - Fabrication and operation of microfluidic hanging drop networks VL - 1771 ER - TY - CONF AB - 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. AU - Agrawal, Sheshansh AU - Chatterjee, Krishnendu AU - Novotny, Petr ID - 325 IS - POPL TI - Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs VL - 2 ER - TY - JOUR AB - The valley pseudospin in monolayer transition metal dichalcogenides (TMDs) has been proposed as a new way to manipulate information in various optoelectronic devices. This relies on a large valley polarization that remains stable over long time scales (hundreds of nanoseconds). However, time-resolved measurements report valley lifetimes of only a few picoseconds. This has been attributed to mechanisms such as phonon-mediated intervalley scattering and a precession of the valley pseudospin through electron-hole exchange. Here we use transient spin grating to directly measure the valley depolarization lifetime in monolayer MoSe2. We find a fast valley decay rate that scales linearly with the excitation density at different temperatures. This establishes the presence of strong exciton-exciton Coulomb exchange interactions enhancing the valley depolarization. Our work highlights the microscopic processes inhibiting the efficient use of the exciton valley pseudospin in monolayer TMDs. AU - Mahmood, Fahad AU - Alpichshev, Zhanybek AU - Lee, Yi AU - Kong, Jing AU - Gedik, Nuh ID - 394 IS - 1 JF - Nano Letters TI - Observation of exciton-exciton interaction mediated valley Depolarization in Monolayer MoSe2 VL - 18 ER - TY - CHAP AB - 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. AU - Trinh, Hoang AU - Verstraeten, Inge AU - Geelen, Danny ID - 408 SN - 1064-3745 T2 - Root Development TI - In vitro assay for induction of adventitious rooting on intact arabidopsis hypocotyls VL - 1761 ER - TY - CHAP AB - 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. AU - Karampelias, Michael AU - Tejos, Ricardo AU - Friml, Jirí AU - Vanneste, Steffen ED - Ristova, Daniela ED - Barbez, Elke ID - 411 T2 - Root Development. Methods and Protocols TI - Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia VL - 1761 ER - TY - JOUR AB - Inhibition of the endoplasmic reticulum stress pathway may hold the key to Zika virus-associated microcephaly treatment. AU - Novarino, Gaia ID - 456 IS - 423 JF - Science Translational Medicine TI - Zika-associated microcephaly: Reduce the stress and race for the treatment VL - 10 ER - TY - JOUR AB - In 2013, a publication repository was implemented at IST Austria and 2015 after a thorough preparation phase a data repository was implemented - both based on the Open Source Software EPrints. In this text, designed as field report, we will reflect on our experiences with Open Source Software in general and specifically with EPrints regarding technical aspects but also regarding their characteristics of the user community. The second part is a pleading for including the end users in the process of implementation, adaption and evaluation. AU - Petritsch, Barbara AU - Porsche, Jana ID - 53 IS - 1 JF - VÖB Mitteilungen TI - IST PubRep and IST DataRep: the institutional repositories at IST Austria VL - 71 ER - TY - JOUR AB - 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. AU - Alistarh, Dan-Adrian AU - Aspnes, James AU - King, Valerie AU - Saia, Jared ID - 536 IS - 6 JF - Distributed Computing SN - 01782770 TI - Communication-efficient randomized consensus VL - 31 ER - TY - JOUR AB - 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.). AU - Napiórkowski, Marcin M AU - Reuvers, Robin AU - Solovej, Jan ID - 554 IS - 1 JF - Communications in Mathematical Physics SN - 00103616 TI - The Bogoliubov free energy functional II: The dilute Limit VL - 360 ER - TY - CHAP AB - 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. AU - Dimitrov, Dimitar AU - Guillaud, Laurent AU - Eguchi, Kohgaku AU - Takahashi, Tomoyuki ED - Skaper, Stephen D. ID - 562 T2 - Neurotrophic Factors TI - Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses VL - 1727 ER - TY - CHAP AB - 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. AU - Bloem, Roderick AU - Chatterjee, Krishnendu AU - Jobstmann, Barbara ED - Henzinger, Thomas A ED - Clarke, Edmund M. ED - Veith, Helmut ED - Bloem, Roderick ID - 59 SN - 978-3-319-10574-1 T2 - Handbook of Model Checking TI - Graph games and reactive synthesis ER - TY - CHAP AB - 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. AU - Clarke, Edmund AU - Henzinger, Thomas A AU - Veith, Helmut ED - Henzinger, Thomas A ID - 60 T2 - Handbook of Model Checking TI - Introduction to model checking ER - TY - CHAP AB - 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. AU - Bondarenko, Andriy AU - Mellit, Anton AU - Prymak, Andriy AU - Radchenko, Danylo AU - Viazovska, Maryna ID - 61 T2 - Contemporary Computational Mathematics TI - There is no strongly regular graph with parameters (460; 153; 32; 60) ER - TY - JOUR AB - Neurons develop elaborate morphologies that provide a model for understanding cellular architecture. By studying C. elegans sensory dendrites, we previously identified genes that act to promote the extension of ciliated sensory dendrites during embryogenesis. Interestingly, the nonciliated dendrite of the oxygen-sensing neuron URX is not affected by these genes, suggesting it develops through a distinct mechanism. Here, we use a visual forward genetic screen to identify mutants that affect URX dendrite morphogenesis. We find that disruption of the MAP kinase MAPK-15 or the βH-spectrin SMA-1 causes a phenotype opposite to what we had seen before: dendrites extend normally during embryogenesis but begin to overgrow as the animals reach adulthood, ultimately extending up to 150% of their normal length. SMA-1 is broadly expressed and acts non-cell-autonomously, while MAPK-15 is expressed in many sensory neurons including URX and acts cell-autonomously. MAPK-15 acts at the time of overgrowth, localizes at the dendrite ending, and requires its kinase activity, suggesting it acts locally in time and space to constrain dendrite growth. Finally, we find that the oxygen-sensing guanylate cyclase GCY-35, which normally localizes at the dendrite ending, is localized throughout the overgrown region, and that overgrowth can be suppressed by overexpressing GCY-35 or by genetically mimicking elevated cGMP signaling. These results suggest that overgrowth may correspond to expansion of a sensory compartment at the dendrite ending, reminiscent of the remodeling of sensory cilia or dendritic spines. Thus, in contrast to established pathways that promote dendrite growth during early development, our results reveal a distinct mechanism that constrains dendrite growth throughout the life of the animal, possibly by controlling the size of a sensory compartment at the dendrite ending. AU - McLachlan, Ian G. AU - Beets, Isabel AU - de Bono, Mario AU - Heiman, Maxwell G. ID - 6111 IS - 6 JF - PLOS Genetics SN - 1553-7404 TI - A neuronal MAP kinase constrains growth of a Caenorhabditis elegans sensory dendrite throughout the life of the organism VL - 14 ER - TY - JOUR AB - Neuropeptides are ubiquitous modulators of behavior and physiology. They are packaged in specialized secretory organelles called dense core vesicles (DCVs) that are released upon neural stimulation. Unlike synaptic vesicles, which can be recycled and refilled close to release sites, DCVs must be replenished by de novo synthesis in the cell body. Here, we dissect DCV cell biology in vivo in a Caenorhabditis elegans sensory neuron whose tonic activity we can control using a natural stimulus. We express fluorescently tagged neuropeptides in the neuron and define parameters that describe their subcellular distribution. We measure these parameters at high and low neural activity in 187 mutants defective in proteins implicated in membrane traffic, neuroendocrine secretion, and neuronal or synaptic activity. Using unsupervised hierarchical clustering methods, we analyze these data and identify 62 groups of genes with similar mutant phenotypes. We explore the function of a subset of these groups. We recapitulate many previous findings, validating our paradigm. We uncover a large battery of proteins involved in recycling DCV membrane proteins, something hitherto poorly explored. We show that the unfolded protein response promotes DCV production, which may contribute to intertissue communication of stress. We also find evidence that different mechanisms of priming and exocytosis may operate at high and low neural activity. Our work provides a defined framework to study DCV biology at different neural activity levels. AU - Laurent, Patrick AU - Ch’ng, QueeLim AU - Jospin, Maëlle AU - Chen, Changchun AU - Lorenzo, Ramiro AU - de Bono, Mario ID - 6109 IS - 29 JF - Proceedings of the National Academy of Sciences SN - 0027-8424 TI - Genetic dissection of neuropeptide cell biology at high and low activity in a defined sensory neuron VL - 115 ER - TY - CONF AB - In this paper, we propose an algorithm to build discrete spherical shell having integer center and real-valued inner and outer radii on the face-centered cubic (FCC) grid. We address the problem by mapping it to a 2D scenario and building the shell layer by layer on hexagonal grids with additive manufacturing in mind. The layered hexagonal grids get shifted according to need as we move from one layer to another and forms the FCC grid in 3D. However, we restrict our computation strictly to 2D in order to utilize symmetry and simplicity. AU - Koshti, Girish AU - Biswas, Ranita AU - Largeteau-Skapin, Gaëlle AU - Zrour, Rita AU - Andres, Eric AU - Bhowmick, Partha ID - 6164 SN - 0302-9743 T2 - 19th International Workshop TI - Sphere construction on the FCC grid interpreted as layered hexagonal grids in 3D VL - 11255 ER - TY - JOUR AB - 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. AU - Fan, Shuxia AU - Lorenz, Michael AU - Massberg, Steffen AU - Gärtner, Florian R ID - 6354 IS - 18 JF - Bio-Protocol KW - Platelets KW - Cell migration KW - Bacteria KW - Shear flow KW - Fibrinogen KW - E. coli SN - 2331-8325 TI - Platelet migration and bacterial trapping assay under flow VL - 8 ER - TY - JOUR AB - An optical network of superconducting quantum bits (qubits) is an appealing platform for quantum communication and distributed quantum computing, but developing a quantum-compatible link between the microwave and optical domains remains an outstanding challenge. Operating at T < 100 mK temperatures, as required for quantum electrical circuits, we demonstrate a mechanically mediated microwave–optical converter with 47% conversion efficiency, and use a classical feed-forward protocol to reduce added noise to 38 photons. The feed-forward protocol harnesses our discovery that noise emitted from the two converter output ports is strongly correlated because both outputs record thermal motion of the same mechanical mode. We also discuss a quantum feed-forward protocol that, given high system efficiencies, would allow quantum information to be transferred even when thermal phonons enter the mechanical element faster than the electro-optic conversion rate. AU - Higginbotham, Andrew P AU - Burns, P. S. AU - Urmey, M. D. AU - Peterson, R. W. AU - Kampel, N. S. AU - Brubaker, B. M. AU - Smith, G. AU - Lehnert, K. W. AU - Regal, C. A. ID - 6368 IS - 10 JF - Nature Physics SN - 1745-2473 TI - Harnessing electro-optic correlations in an efficient mechanical converter VL - 14 ER - TY - JOUR AB - We construct a metamaterial from radio-frequency harmonic oscillators, and find two topologically distinct phases resulting from dissipation engineered into the system. These phases are distinguished by a quantized value of bulk energy transport. The impulse response of our circuit is measured and used to reconstruct the band structure and winding number of circuit eigenfunctions around a dark mode. Our results demonstrate that dissipative topological transport can occur in a wider class of physical systems than considered before. AU - Rosenthal, Eric I. AU - Ehrlich, Nicole K. AU - Rudner, Mark S. AU - Higginbotham, Andrew P AU - Lehnert, K. W. ID - 6369 IS - 22 JF - Physical Review B SN - 2469-9950 TI - Topological phase transition measured in a dissipative metamaterial VL - 97 ER - TY - GEN AU - Petritsch, Barbara ID - 6459 KW - Open Access KW - Publication Analysis TI - Open Access at IST Austria 2009-2017 ER - TY - CHAP AB - 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. AU - Hausel, Tamás AU - Mellit, Anton AU - Pei, Du ID - 6525 SN - 9780198802013 T2 - Geometry and Physics: Volume I TI - Mirror symmetry with branes by equivariant verlinde formulas ER - TY - CONF AB - Reed-Muller (RM) and polar codes are a class of capacity-achieving channel coding schemes with the same factor graph representation. Low-complexity decoding algorithms fall short in providing a good error-correction performance for RM and polar codes. Using the symmetric group of RM and polar codes, the specific decoding algorithm can be carried out on multiple permutations of the factor graph to boost the error-correction performance. However, this approach results in high decoding complexity. In this paper, we first derive the total number of factor graph permutations on which the decoding can be performed. We further propose a successive permutation (SP) scheme which finds the permutations on the fly, thus the decoding always progresses on a single factor graph permutation. We show that SP can be used to improve the error-correction performance of RM and polar codes under successive-cancellation (SC) and SC list (SCL) decoding, while keeping the memory requirements of the decoders unaltered. Our results for RM and polar codes of length 128 and rate 0.5 show that when SP is used and at a target frame error rate of 10 -4 , up to 0.5 dB and 0.1 dB improvement can be achieved for RM and polar codes respectively. AU - Hashemi, Seyyed Ali AU - Doan, Nghia AU - Mondelli, Marco AU - Gross, Warren ID - 6664 T2 - 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing TI - Decoding Reed-Muller and polar codes by successive factor graph permutations ER - TY - JOUR AB - Polar codes represent one of the major recent breakthroughs in coding theory and, because of their attractive features, they have been selected for the incoming 5G standard. As such, a lot of attention has been devoted to the development of decoding algorithms with good error performance and efficient hardware implementation. One of the leading candidates in this regard is represented by successive-cancellation list (SCL) decoding. However, its hardware implementation requires a large amount of memory. Recently, a partitioned SCL (PSCL) decoder has been proposed to significantly reduce the memory consumption. In this paper, we consider the paradigm of PSCL decoding from a practical standpoint, and we provide several improvements. First, by changing the target signal-to-noise ratio and consequently modifying the construction of the code, we are able to improve the performance at no additional computational, latency, or memory cost. Second, we bridge the performance gap between SCL and PSCL decoding by introducing a generalized PSCL decoder and a layered PSCL decoder. In this way, we obtain almost the same performance of the SCL decoder with a significantly lower memory requirement, as testified by hardware implementation results. Third, we present an optimal scheme to allocate cyclic redundancy checks. Finally, we provide a lower bound on the list size that guarantees optimal maximum a posteriori performance for the binary erasure channel. AU - Hashemi, Seyyed Ali AU - Mondelli, Marco AU - Hassani, S. Hamed AU - Condo, Carlo AU - Urbanke, Rudiger L. AU - Gross, Warren J. ID - 6674 IS - 9 JF - IEEE Transactions on Communications TI - Decoder partitioning: Towards practical list decoding of polar codes VL - 66 ER - TY - CONF AB - Polar codes are a channel coding scheme for the next generation of wireless communications standard (5G). The belief propagation (BP) decoder allows for parallel decoding of polar codes, making it suitable for high throughput applications. However, the error-correction performance of polar codes under BP decoding is far from the requirements of 5G. It has been shown that the error-correction performance of BP can be improved if the decoding is performed on multiple permuted factor graphs of polar codes. However, a different BP decoding scheduling is required for each factor graph permutation which results in the design of a different decoder for each permutation. Moreover, the selection of the different factor graph permutations is at random, which prevents the decoder to achieve a desirable error correction performance with a small number of permutations. In this paper, we first show that the permutations on the factor graph can be mapped into suitable permutations on the codeword positions. As a result, we can make use of a single decoder for all the permutations. In addition, we introduce a method to construct a set of predetermined permutations which can provide the correct codeword if the decoding fails on the original permutation. We show that for the 5G polar code of length 1024, the error-correction performance of the proposed decoder is more than 0.25 dB better than that of the BP decoder with the same number of random permutations at the frame error rate of 10 -4 . AU - Doan, Nghia AU - Hashemi, Seyyed Ali AU - Mondelli, Marco AU - Gross, Warren J. ID - 6728 SN - 9781538647271 T2 - 2018 IEEE Global Communications Conference TI - On the decoding of polar codes on permuted factor graphs ER -