@article{10286, abstract = {In this paper, we evaluate clock signals generated in ring oscillators and self-timed rings and the way their jitter can be transformed into random numbers. We show that counting the periods of the jittery clock signal produces random numbers of significantly better quality than the methods in which the jittery signal is simply sampled (the case in almost all current methods). Moreover, we use the counter values to characterize and continuously monitor the source of randomness. However, instead of using the widely used statistical variance, we propose to use Allan variance to do so. There are two main advantages: Allan variance is insensitive to low frequency noises such as flicker noise that are known to be autocorrelated and significantly less circuitry is required for its computation than that used to compute commonly used variance. We also show that it is essential to use a differential principle of randomness extraction from the jitter based on the use of two identical oscillators to avoid autocorrelations originating from external and internal global jitter sources and that this fact is valid for both kinds of rings. Last but not least, we propose a method of statistical testing based on high order Markov model to show the reduced dependencies when the proposed randomness extraction is applied.}, author = {Allini, Elie Noumon and Skórski, Maciej and Petura, Oto and Bernard, Florent and Laban, Marek and Fischer, Viktor}, issn = {2569-2925}, journal = {IACR Transactions on Cryptographic Hardware and Embedded Systems}, number = {3}, pages = {214--242}, publisher = {International Association for Cryptologic Research}, title = {{Evaluation and monitoring of free running oscillators serving as source of randomness}}, doi = {10.13154/tches.v2018.i3.214-242}, volume = {2018}, year = {2018}, } @article{10362, abstract = {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.}, author = {Fisher, Patrick D. Ellis and Shen, Qi and Akpinar, Bernice and Davis, Luke K. and Chung, Kenny Kwok Hin and Baddeley, David and Šarić, Anđela and Melia, Thomas J. and Hoogenboom, Bart W. and Lin, Chenxiang and Lusk, C. Patrick}, issn = {1936-086X}, journal = {ACS Nano}, keywords = {general physics and astronomy}, number = {2}, pages = {1508--1518}, publisher = {American Chemical Society}, title = {{A Programmable DNA origami platform for organizing intrinsically disordered nucleoporins within nanopore confinement}}, doi = {10.1021/acsnano.7b08044}, volume = {12}, year = {2018}, } @article{10360, abstract = {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.}, author = {Cohen, Samuel I. A. and Cukalevski, Risto and Michaels, Thomas C. T. and Šarić, Anđela and Törnquist, Mattias and Vendruscolo, Michele and Dobson, Christopher M. and Buell, Alexander K. and Knowles, Tuomas P. J. and Linse, Sara}, issn = {1755-4349}, journal = {Nature Chemistry}, keywords = {general chemical engineering, general chemistry}, number = {5}, pages = {523--531}, publisher = {Springer Nature}, title = {{Distinct thermodynamic signatures of oligomer generation in the aggregation of the amyloid-β peptide}}, doi = {10.1038/s41557-018-0023-x}, volume = {10}, year = {2018}, } @article{10357, abstract = {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.}, author = {Dear, Alexander J. and Šarić, Anđela and Michaels, Thomas C. T. and Dobson, Christopher M. and Knowles, Tuomas P. J.}, issn = {1520-5207}, journal = {The Journal of Physical Chemistry B}, keywords = {materials chemistry}, number = {49}, pages = {11721--11730}, publisher = {American Chemical Society}, title = {{Statistical mechanics of globular oligomer formation by protein molecules}}, doi = {10.1021/acs.jpcb.8b07805}, volume = {122}, year = {2018}, } @article{10359, abstract = {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.}, author = {Curk, Tine and Wirnsberger, Peter and Dobnikar, Jure and Frenkel, Daan and Šarić, Anđela}, issn = {1530-6992}, journal = {Nano Letters}, keywords = {mechanical engineering, condensed matter physics}, number = {9}, pages = {5350--5356}, publisher = {American Chemical Society}, title = {{Controlling cargo trafficking in multicomponent membranes}}, doi = {10.1021/acs.nanolett.8b00786}, volume = {18}, year = {2018}, } @article{10358, abstract = {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.}, author = {Michaels, Thomas C. T. and Liu, Lucie X. and Curk, Samo and Bolhuis, Peter G. and Šarić, Anđela and Knowles, Tuomas P. J.}, issn = {1362-3028}, journal = {Molecular Physics}, keywords = {physical chemistry}, number = {21-22}, pages = {3055--3065}, publisher = {Taylor & Francis}, title = {{Reaction rate theory for supramolecular kinetics: application to protein aggregation}}, doi = {10.1080/00268976.2018.1474280}, volume = {116}, year = {2018}, } @article{10361, abstract = {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.}, author = {Michaels, Thomas C.T. and Šarić, Anđela and Habchi, Johnny and Chia, Sean and Meisl, Georg and Vendruscolo, Michele and Dobson, Christopher M. and Knowles, Tuomas P.J.}, issn = {1545-1593}, journal = {Annual Review of Physical Chemistry}, keywords = {physical and theoretical chemistry}, number = {1}, pages = {273--298}, publisher = {Annual Reviews}, title = {{Chemical kinetics for bridging molecular mechanisms and macroscopic measurements of amyloid fibril formation}}, doi = {10.1146/annurev-physchem-050317-021322}, volume = {69}, year = {2018}, } @article{10626, abstract = {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.}, author = {Polshyn, Hryhoriy and Zhou, H. and Spanton, E. M. and Taniguchi, T. and Watanabe, K. and Young, A. F.}, issn = {1079-7114}, journal = {Physical Review Letters}, keywords = {general physics and astronomy}, number = {22}, publisher = {American Physical Society}, title = {{Quantitative transport measurements of fractional quantum Hall energy gaps in edgeless graphene devices}}, doi = {10.1103/physrevlett.121.226801}, volume = {121}, year = {2018}, } @article{10627, abstract = {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.}, author = {Polshyn, Hryhoriy and Naibert, Tyler R. and Budakian, Raffi}, issn = {2469-9969}, journal = {Physical Review B}, number = {18}, publisher = {American Physical Society}, title = {{Imaging phase slip dynamics in micron-size superconducting rings}}, doi = {10.1103/physrevb.97.184501}, volume = {97}, year = {2018}, } @inproceedings{10883, abstract = {Solving parity games, which are equivalent to modal μ-calculus model checking, is a central algorithmic problem in formal methods, with applications in reactive synthesis, program repair, verification of branching-time properties, etc. Besides the standard compu- tation model with the explicit representation of games, another important theoretical model of computation is that of set-based symbolic algorithms. Set-based symbolic algorithms use basic set operations and one-step predecessor operations on the implicit description of games, rather than the explicit representation. The significance of symbolic algorithms is that they provide scalable algorithms for large finite-state systems, as well as for infinite-state systems with finite quotient. Consider parity games on graphs with n vertices and parity conditions with d priorities. While there is a rich literature of explicit algorithms for parity games, the main results for set-based symbolic algorithms are as follows: (a) the basic algorithm that requires O(nd) symbolic operations and O(d) symbolic space; and (b) an improved algorithm that requires O(nd/3+1) symbolic operations and O(n) symbolic space. In this work, our contributions are as follows: (1) We present a black-box set-based symbolic algorithm based on the explicit progress measure algorithm. Two important consequences of our algorithm are as follows: (a) a set-based symbolic algorithm for parity games that requires quasi-polynomially many symbolic operations and O(n) symbolic space; and (b) any future improvement in progress measure based explicit algorithms immediately imply an efficiency improvement in our set-based symbolic algorithm for parity games. (2) We present a set-based symbolic algorithm that requires quasi-polynomially many symbolic operations and O(d · log n) symbolic space. Moreover, for the important special case of d ≤ log n, our algorithm requires only polynomially many symbolic operations and poly-logarithmic symbolic space.}, author = {Chatterjee, Krishnendu and Dvořák, Wolfgang and Henzinger, Monika H and Svozil, Alexander}, booktitle = {22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning}, issn = {2398-7340}, location = {Awassa, Ethiopia}, pages = {233--253}, publisher = {EasyChair}, title = {{Quasipolynomial set-based symbolic algorithms for parity games}}, doi = {10.29007/5z5k}, volume = {57}, year = {2018}, } @article{1092, abstract = {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. }, author = {Mohammadi, Fatemeh and Uhler, Caroline and Wang, Charles and Yu, Josephine}, journal = {SIAM Journal on Discrete Mathematics}, number = {1}, pages = {64--93}, publisher = {SIAM}, title = {{Generalized permutohedra from probabilistic graphical models}}, doi = {10.1137/16M107894X}, volume = {32}, year = {2018}, } @inproceedings{11, abstract = {We report on a novel strategy to derive mean-field limits of quantum mechanical systems in which a large number of particles weakly couple to a second-quantized radiation field. The technique combines the method of counting and the coherent state approach to study the growth of the correlations among the particles and in the radiation field. As an instructional example, we derive the Schrödinger–Klein–Gordon system of equations from the Nelson model with ultraviolet cutoff and possibly massless scalar field. In particular, we prove the convergence of the reduced density matrices (of the nonrelativistic particles and the field bosons) associated with the exact time evolution to the projectors onto the solutions of the Schrödinger–Klein–Gordon equations in trace norm. Furthermore, we derive explicit bounds on the rate of convergence of the one-particle reduced density matrix of the nonrelativistic particles in Sobolev norm.}, author = {Leopold, Nikolai K and Pickl, Peter}, location = {Munich, Germany}, pages = {185 -- 214}, publisher = {Springer}, title = {{Mean-field limits of particles in interaction with quantised radiation fields}}, doi = {10.1007/978-3-030-01602-9_9}, volume = {270}, year = {2018}, } @article{11063, abstract = {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.}, author = {McCloskey, Asako and Ibarra, Arkaitz and HETZER, Martin W}, issn = {0890-9369}, journal = {Genes & Development}, keywords = {Developmental Biology, Genetics}, number = {19-20}, pages = {1321--1331}, publisher = {Cold Spring Harbor Laboratory}, title = {{Tpr regulates the total number of nuclear pore complexes per cell nucleus}}, doi = {10.1101/gad.315523.118}, volume = {32}, year = {2018}, } @article{11064, abstract = {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.}, author = {Fleischer, Jason G. and Schulte, Roberta and Tsai, Hsiao H. and Tyagi, Swati and Ibarra, Arkaitz and Shokhirev, Maxim N. and Huang, Ling and HETZER, Martin W and Navlakha, Saket}, issn = {1474-760X}, journal = {Genome Biology}, publisher = {BioMed Central}, title = {{Predicting age from the transcriptome of human dermal fibroblasts}}, doi = {10.1186/s13059-018-1599-6}, volume = {19}, year = {2018}, } @article{11508, abstract = {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.}, author = {Matthee, Jorryt J and Sobral, David and Gronke, Max and Paulino-Afonso, Ana and Stefanon, Mauro and Röttgering, Huub}, issn = {1432-0746}, journal = {Astronomy & Astrophysics}, keywords = {Space and Planetary Science, Astronomy and Astrophysics, galaxies: high-redshift / galaxies: formation / dark ages / reionization / first stars / techniques: spectroscopic / intergalactic medium}, publisher = {EDP Sciences}, title = {{Confirmation of double peaked Lyα emission at z = 6.593: Witnessing a galaxy directly contributing to the reionisation of the universe}}, doi = {10.1051/0004-6361/201833528}, volume = {619}, year = {2018}, } @article{11549, abstract = {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.}, author = {Khostovan, A A and Sobral, D and Mobasher, B and Best, P N and Smail, I and Matthee, Jorryt J and Darvish, B and Nayyeri, H and Hemmati, S and Stott, J P}, issn = {1365-2966}, journal = {Monthly Notices of the Royal Astronomical Society}, keywords = {Space and Planetary Science, Astronomy and Astrophysics, galaxies: evolution, galaxies: haloes, galaxies: high-redshift, galaxies: star formation, cosmology: observations, large-scale structure of Universe}, number = {3}, pages = {2999--3015}, publisher = {Oxford University Press}, title = {{The clustering of H β + [O III] and [O II] emitters since z ∼ 5: Dependencies with line luminosity and stellar mass}}, doi = {10.1093/mnras/sty925}, volume = {478}, year = {2018}, } @article{11557, abstract = {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.}, author = {Sobral, David and Matthee, Jorryt J and Darvish, Behnam and Smail, Ian and Best, Philip N and Alegre, Lara and Röttgering, Huub and Mobasher, Bahram and Paulino-Afonso, Ana and Stroe, Andra and Oteo, Iván}, issn = {1365-2966}, journal = {Monthly Notices of the Royal Astronomical Society}, keywords = {Space and Planetary Science, Astronomy and Astrophysics, galaxies: active, galaxies: evolution, galaxies: high-redshift, galaxies: ISM, galaxies: starburst, cosmology: observations}, number = {2}, pages = {2817--2840}, publisher = {Oxford University Press}, title = {{The nature of luminous Ly α emitters at z ∼ 2–3: Maximal dust-poor starbursts and highly ionizing AGN}}, doi = {10.1093/mnras/sty782}, volume = {477}, year = {2018}, } @article{11558, abstract = {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.}, author = {Sobral, David and Santos, Sérgio and Matthee, Jorryt J and Paulino-Afonso, Ana and Ribeiro, Bruno and Calhau, João and Khostovan, Ali A}, issn = {1365-2966}, journal = {Monthly Notices of the Royal Astronomical Society}, keywords = {Space and Planetary Science, Astronomy and Astrophysics, galaxies: evolution, galaxies: formation, galaxies: high-redshift, galaxies: luminosity function, mass function, galaxies: statistics}, number = {4}, pages = {4725--4752}, publisher = {Oxford University Press}, title = {{Slicing COSMOS with SC4K: The evolution of typical Ly α emitters and the Ly α escape fraction from z ∼ 2 to 6}}, doi = {10.1093/mnras/sty378}, volume = {476}, year = {2018}, } @article{11555, abstract = {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.}, author = {Carniani, S and Maiolino, R and Amorin, R and Pentericci, L and Pallottini, A and Ferrara, A and Willott, C J and Smit, R and Matthee, Jorryt J and Sobral, D and Santini, P and Castellano, M and De Barros, S and Fontana, A and Grazian, A and Guaita, L}, issn = {1365-2966}, journal = {Monthly Notices of the Royal Astronomical Society}, keywords = {Space and Planetary Science, Astronomy and Astrophysics, galaxies: evolution, galaxies: high-redshift, galaxies: ISM, galaxies: formation}, number = {1}, pages = {1170--1184}, publisher = {Oxford University Press}, title = {{Kiloparsec-scale gaseous clumps and star formation at z = 5–7}}, doi = {10.1093/mnras/sty1088}, volume = {478}, year = {2018}, } @article{11584, abstract = {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.}, author = {Matthee, Jorryt J and Schaye, Joop}, issn = {1745-3933}, journal = {Monthly Notices of the Royal Astronomical Society: Letters}, keywords = {Space and Planetary Science, Astronomy and Astrophysics, galaxies: abundances, galaxies: evolution, galaxies: formation, galaxies: star formation}, number = {1}, pages = {L34 -- L39}, publisher = {Oxford University Press}, title = {{Star-forming galaxies are predicted to lie on a fundamental plane of mass, star formation rate, and α-enhancement}}, doi = {10.1093/mnrasl/sly093}, volume = {479}, year = {2018}, } @article{11619, abstract = {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.}, author = {Gandolfi, D. and Barragán, O. and Livingston, J. H. and Fridlund, M. and Justesen, A. B. and Redfield, S. and Fossati, L. and Mathur, S. and Grziwa, S. and Cabrera, J. and García, R. A. and Persson, C. M. and Van Eylen, V. and Hatzes, A. P. and Hidalgo, D. and Albrecht, S. and Bugnet, Lisa Annabelle and Cochran, W. D. and Csizmadia, Sz. and Deeg, H. and Eigmüller, Ph. and Endl, M. and Erikson, A. and Esposito, M. and Guenther, E. and Korth, J. and Luque, R. and Montañes Rodríguez, P. and Nespral, D. and Nowak, G. and Pätzold, M. and Prieto-Arranz, J.}, issn = {1432-0746}, journal = {Astronomy & Astrophysics}, keywords = {Space and Planetary Science, Astronomy and Astrophysics, planetary systems / planets and satellites, detection / planets and satellites, fundamental parameters / planets and satellites, terrestrial planets / stars, fundamental parameters}, publisher = {EDP Sciences}, title = {{TESS’s first planet: A super-Earth transiting the naked-eye star π Mensae}}, doi = {10.1051/0004-6361/201834289}, volume = {619}, year = {2018}, } @article{11618, abstract = {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.}, author = {Bugnet, Lisa Annabelle and García, R. A. and Davies, G. R. and Mathur, S. and Corsaro, E. and Hall, O. J. and Rendle, B. M.}, issn = {1432-0746}, journal = {Astronomy & Astrophysics}, keywords = {Space and Planetary Science, Astronomy and Astrophysics, asteroseismology / methods, data analysis / stars, oscillations}, publisher = {EDP Sciences}, title = {{FliPer: A global measure of power density to estimate surface gravities of main-sequence solar-like stars and red giants}}, doi = {10.1051/0004-6361/201833106}, volume = {620}, year = {2018}, } @article{11620, abstract = {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.}, author = {Van Eylen, V and Dai, F and Mathur, S and Gandolfi, D and Albrecht, S and Fridlund, M and García, R A and Guenther, E and Hjorth, M and Justesen, A B and Livingston, J and Lund, M N and Pérez Hernández, F and Prieto-Arranz, J and Regulo, C and Bugnet, Lisa Annabelle and Everett, M E and Hirano, T and Nespral, D and Nowak, G and Palle, E and Silva Aguirre, V and Trifonov, T and Winn, J N and Barragán, O and Beck, P G and Chaplin, W J and Cochran, W D and Csizmadia, S and Deeg, H and Endl, M and Heeren, P and Grziwa, S and Hatzes, A P and Hidalgo, D and Korth, J and Mathis, S and Montañes Rodriguez, P and Narita, N and Patzold, M and Persson, C M and Rodler, F and Smith, A M S}, issn = {1365-2966}, journal = {Monthly Notices of the Royal Astronomical Society}, keywords = {Space and Planetary Science, Astronomy and Astrophysics, asteroseismology, planets and satellites: composition, planets and satellites: formation, planets and satellites: fundamental parameters}, number = {4}, pages = {4866--4880}, publisher = {Oxford University Press}, title = {{HD 89345: A bright oscillating star hosting a transiting warm Saturn-sized planet observed by K2}}, doi = {10.1093/mnras/sty1390}, volume = {478}, year = {2018}, } @unpublished{11631, abstract = {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.}, author = {Bugnet, Lisa Annabelle and García, R. A. and Davies, G. R. and Mathur, S. and Hall, O. J. and Rendle, B. M.}, booktitle = {arXiv}, keywords = {asteroseismology - methods, data analysis - stars, oscillations}, title = {{FliPer: Classifying TESS pulsating stars}}, doi = {10.48550/arXiv.1811.12140}, year = {2018}, } @article{11657, abstract = {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.}, author = {Henzinger, Monika H and Noe, Alexander and Schulz, Christian and Strash, Darren}, issn = {1084-6654}, journal = {ACM Journal of Experimental Algorithmics}, keywords = {Theoretical Computer Science}, pages = {1--22}, publisher = {Association for Computing Machinery}, title = {{Practical minimum cut algorithms}}, doi = {10.1145/3274662}, volume = {23}, year = {2018}, } @article{11667, abstract = {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.}, author = {Dütting, Paul and Henzinger, Monika H and Starnberger, Martin}, issn = {2167-8383}, journal = {ACM Transactions on Economics and Computation}, keywords = {Theory of computation, Algorithmic game theory and mechanism design, Applied computing, Economics, Simplified mechanisms, Combinatorial auctions with item bidding, Price of anarchy}, number = {2}, publisher = {Association for Computing Machinery}, title = {{Valuation compressions in VCG-based combinatorial auctions}}, doi = {10.1145/3232860}, volume = {6}, year = {2018}, } @article{11664, abstract = {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.}, author = {Goranci, Gramoz and Henzinger, Monika H and Thorup, Mikkel}, issn = {1549-6333}, journal = {ACM Transactions on Algorithms}, number = {2}, publisher = {Association for Computing Machinery}, title = {{Incremental exact min-cut in polylogarithmic amortized update time}}, doi = {10.1145/3174803}, volume = {14}, year = {2018}, } @article{11757, abstract = {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.}, author = {Bhattacharya, Sayan and Henzinger, Monika H and Italiano, Giuseppe}, issn = {0890-5401}, journal = {Information and Computation}, number = {08}, pages = {219--239}, publisher = {Elsevier}, title = {{Dynamic algorithms via the primal-dual method}}, doi = {10.1016/j.ic.2018.02.005}, volume = {261}, year = {2018}, } @inproceedings{11828, abstract = {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.}, author = {Goranci, Gramoz and Henzinger, Monika H and Peng, Pan}, booktitle = {26th Annual European Symposium on Algorithms}, isbn = {9783959770811}, issn = {1868-8969}, location = {Helsinki, Finland}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Dynamic effective resistances and approximate schur complement on separable graphs}}, doi = {10.4230/LIPICS.ESA.2018.40}, volume = {112}, year = {2018}, } @inproceedings{11827, abstract = {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.}, author = {Goranci, Gramoz and Henzinger, Monika H and Leniowski, Dariusz}, booktitle = {26th Annual European Symposium on Algorithms}, isbn = {9783959770811}, issn = {1868-8969}, location = {Helsinki, Finland}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{A tree structure for dynamic facility location}}, doi = {10.4230/LIPICS.ESA.2018.39}, volume = {112}, year = {2018}, } @article{11768, abstract = {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.}, author = {Henzinger, Monika H and Krinninger, Sebastian and Nanongkai, Danupon}, issn = {1557-735X}, journal = {Journal of the ACM}, number = {6}, pages = {1--40}, publisher = {Association for Computing Machinery}, title = {{Decremental single-source shortest paths on undirected graphs in near-linear total update time}}, doi = {10.1145/3218657}, volume = {65}, year = {2018}, } @inproceedings{11872, abstract = {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].}, author = {Bhattacharya, Sayan and Chakrabarty, Deeparnab and Henzinger, Monika H and Nanongkai, Danupon}, booktitle = {29th Annual ACM-SIAM Symposium on Discrete Algorithms}, location = {New Orleans, LA, United States}, pages = {1 -- 20}, publisher = {Society for Industrial and Applied Mathematics}, title = {{Dynamic algorithms for graph coloring}}, doi = {10.1137/1.9781611975031.1}, year = {2018}, } @inproceedings{11882, abstract = {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.}, author = {Henzinger, Monika H and Noe, Alexander and Schulz, Christian and Strash, Darren}, booktitle = {20th Workshop on Algorithm Engineering and Experiments}, location = {New Orleans, LA, United States}, pages = {48--61}, publisher = {Society for Industrial and Applied Mathematics}, title = {{Practical minimum cut algorithms}}, doi = {10.1137/1.9781611975055.5}, year = {2018}, } @article{11890, abstract = {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].}, author = {Bhattacharya, Sayan and Henzinger, Monika H and Italiano, Giuseppe F.}, issn = {1095-7111}, journal = {SIAM Journal on Computing}, number = {3}, pages = {859--887}, publisher = {Society for Industrial & Applied Mathematics}, title = {{Deterministic fully dynamic data structures for vertex cover and matching}}, doi = {10.1137/140998925}, volume = {47}, year = {2018}, } @inproceedings{11911, abstract = {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.}, author = {Biedermann, Sonja and Henzinger, Monika H and Schulz, Christian and Schuster, Bernhard}, booktitle = {17th International Symposium on Experimental Algorithms}, isbn = {9783959770705}, issn = {1868-8969}, location = {L'Aquila, Italy}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Memetic graph clustering}}, doi = {10.4230/LIPICS.SEA.2018.3}, volume = {103}, year = {2018}, } @article{11958, abstract = {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.}, author = {Pieber, Bartholomäus and Shalom, Menny and Antonietti, Markus and Seeberger, Peter H. and Gilmore, Kerry}, issn = { 1521-3773}, journal = {Angewandte Chemie International Edition}, number = {31}, pages = {9976--9979}, publisher = {Wiley}, title = {{Continuous heterogeneous photocatalysis in serial micro-batch reactors}}, doi = {10.1002/anie.201712568}, volume = {57}, year = {2018}, } @article{1215, abstract = {Two generalizations of Itô formula to infinite-dimensional spaces are given. The first one, in Hilbert spaces, extends the classical one by taking advantage of cancellations when they occur in examples and it is applied to the case of a group generator. The second one, based on the previous one and a limit procedure, is an Itô formula in a special class of Banach spaces having a product structure with the noise in a Hilbert component; again the key point is the extension due to a cancellation. This extension to Banach spaces and in particular the specific cancellation are motivated by path-dependent Itô calculus.}, author = {Flandoli, Franco and Russo, Francesco and Zanco, Giovanni A}, journal = {Journal of Theoretical Probability}, number = {2}, pages = {789--826}, publisher = {Springer}, title = {{Infinite-dimensional calculus under weak spatial regularity of the processes}}, doi = {10.1007/s10959-016-0724-2}, volume = {31}, year = {2018}, } @article{124, abstract = {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.}, author = {Waitukaitis, Scott R and Schrader, Devin and Nagashima, Kazuhide and Davidson, Jemma and Mccoy, Timothy and Conolly Jr, Harold and Lauretta, Dante}, journal = {Geochimica et Cosmochimica Acta}, pages = {405 -- 421}, publisher = {Elsevier}, title = {{The retention of dust in protoplanetary disks: evidence from agglomeration olivine chondrules from the outer solar system}}, doi = {10.1016/j.gca.2017.12.014}, volume = {223}, year = {2018}, } @article{125, abstract = {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.}, author = {Cerda, Mauricio and Waitukaitis, Scott R and Navarro, Cristóbal and Silva, Juan and Mujica, Nicolás and Hitschfeld, Nancy}, journal = {Computer Physics Communications}, pages = {8 -- 16}, publisher = {Elsevier}, title = {{A high-speed tracking algorithm for dense granular media}}, doi = {10.1016/j.cpc.2018.02.010}, volume = {227}, year = {2018}, } @article{126, abstract = {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.}, author = {Waitukaitis, Scott R and Harth, Kirsten and Van Hecke, Martin}, journal = {Physical Review Letters}, number = {4}, publisher = {American Physical Society}, title = {{From bouncing to floating: the Leidenfrost effect with hydrogel spheres}}, doi = {10.1103/PhysRevLett.121.048001}, volume = {121}, year = {2018}, } @article{127, abstract = {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.}, author = {Waitukaitis, Scott R}, journal = {Nature Physics}, number = {8}, pages = {777 -- 778}, publisher = {Nature Publishing Group}, title = {{Clicks for doughnuts}}, doi = {10.1038/s41567-018-0160-6}, volume = {14}, year = {2018}, } @inproceedings{174, abstract = {We survey recent efforts to quantify failures of the Hasse principle in families of rationally connected varieties.}, author = {Browning, Timothy D}, location = {Salt Lake City, Utah, USA}, number = {2}, pages = {89 -- 102}, publisher = {American Mathematical Society}, title = {{How often does the Hasse principle hold?}}, doi = {10.1090/pspum/097.2/01700}, volume = {97}, year = {2018}, } @article{176, abstract = {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.}, author = {Browning, Timothy D and Sofos, Efthymios}, journal = {International Journal of Nuber Theory}, number = {3}, pages = {547--567}, publisher = {World Scientific Publishing}, title = {{Averages of arithmetic functions over principal ideals}}, doi = {10.1142/S1793042119500283}, volume = {15}, year = {2018}, } @article{178, abstract = {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.}, author = {Browning, Timothy D and Heath-Brown, Roger}, issn = {2397-3129}, journal = {Discrete Analysis}, pages = {1 -- 29}, publisher = {Alliance of Diamond Open Access Journals}, title = {{Counting rational points on quadric surfaces}}, doi = {10.19086/da.4375}, volume = {15}, year = {2018}, } @inproceedings{185, abstract = {We resolve in the affirmative conjectures of A. Skopenkov and Repovš (1998), and M. Skopenkov (2003) generalizing the classical Hanani-Tutte theorem to the setting of approximating maps of graphs on 2-dimensional surfaces by embeddings. Our proof of this result is constructive and almost immediately implies an efficient algorithm for testing whether a given piecewise linear map of a graph in a surface is approximable by an embedding. More precisely, an instance of this problem consists of (i) a graph G whose vertices are partitioned into clusters and whose inter-cluster edges are partitioned into bundles, and (ii) a region R of a 2-dimensional compact surface M given as the union of a set of pairwise disjoint discs corresponding to the clusters and a set of pairwise disjoint "pipes" corresponding to the bundles, connecting certain pairs of these discs. We are to decide whether G can be embedded inside M so that the vertices in every cluster are drawn in the corresponding disc, the edges in every bundle pass only through its corresponding pipe, and every edge crosses the boundary of each disc at most once.}, author = {Fulek, Radoslav and Kynčl, Jan}, isbn = {978-3-95977-066-8}, location = {Budapest, Hungary}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Hanani-Tutte for approximating maps of graphs}}, doi = {10.4230/LIPIcs.SoCG.2018.39}, volume = {99}, year = {2018}, } @inproceedings{188, abstract = {Smallest enclosing spheres of finite point sets are central to methods in topological data analysis. Focusing on Bregman divergences to measure dissimilarity, we prove bounds on the location of the center of a smallest enclosing sphere. These bounds depend on the range of radii for which Bregman balls are convex.}, author = {Edelsbrunner, Herbert and Virk, Ziga and Wagner, Hubert}, location = {Budapest, Hungary}, pages = {35:1 -- 35:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Smallest enclosing spheres and Chernoff points in Bregman geometry}}, doi = {10.4230/LIPIcs.SoCG.2018.35}, volume = {99}, year = {2018}, } @article{2015, abstract = {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.}, author = {Raskutti, Garvesh and Uhler, Caroline}, journal = {STAT}, number = {1}, publisher = {Wiley}, title = {{Learning directed acyclic graphs based on sparsest permutations}}, doi = {10.1002/sta4.183}, volume = {7}, year = {2018}, } @article{306, abstract = {A cornerstone of statistical inference, the maximum entropy framework is being increasingly applied to construct descriptive and predictive models of biological systems, especially complex biological networks, from large experimental data sets. Both its broad applicability and the success it obtained in different contexts hinge upon its conceptual simplicity and mathematical soundness. Here we try to concisely review the basic elements of the maximum entropy principle, starting from the notion of ‘entropy’, and describe its usefulness for the analysis of biological systems. As examples, we focus specifically on the problem of reconstructing gene interaction networks from expression data and on recent work attempting to expand our system-level understanding of bacterial metabolism. Finally, we highlight some extensions and potential limitations of the maximum entropy approach, and point to more recent developments that are likely to play a key role in the upcoming challenges of extracting structures and information from increasingly rich, high-throughput biological data.}, author = {De Martino, Andrea and De Martino, Daniele}, journal = {Heliyon}, number = {4}, publisher = {Elsevier}, title = {{An introduction to the maximum entropy approach and its application to inference problems in biology}}, doi = {10.1016/j.heliyon.2018.e00596}, volume = {4}, year = {2018}, } @book{3300, abstract = {This book first explores the origins of this idea, grounded in theoretical work on temporal logic and automata. The editors and authors are among the world's leading researchers in this domain, and they contributed 32 chapters representing a thorough view of the development and application of the technique. Topics covered include binary decision diagrams, symbolic model checking, satisfiability modulo theories, partial-order reduction, abstraction, interpolation, concurrency, security protocols, games, probabilistic model checking, and process algebra, and chapters on the transfer of theory to industrial practice, property specification languages for hardware, and verification of real-time systems and hybrid systems. The book will be valuable for researchers and graduate students engaged with the development of formal methods and verification tools.}, author = {Clarke, Edmund M. and Henzinger, Thomas A and Veith, Helmut and Bloem, Roderick}, isbn = {978-3-319-10574-1}, pages = {XLVIII, 1212}, publisher = {Springer Nature}, title = {{Handbook of Model Checking}}, doi = {10.1007/978-3-319-10575-8}, year = {2018}, } @inbook{37, abstract = {Developmental processes are inherently dynamic and understanding them requires quantitative measurements of gene and protein expression levels in space and time. While live imaging is a powerful approach for obtaining such data, it is still a challenge to apply it over long periods of time to large tissues, such as the embryonic spinal cord in mouse and chick. Nevertheless, dynamics of gene expression and signaling activity patterns in this organ can be studied by collecting tissue sections at different developmental stages. In combination with immunohistochemistry, this allows for measuring the levels of multiple developmental regulators in a quantitative manner with high spatiotemporal resolution. The mean protein expression levels over time, as well as embryo-to-embryo variability can be analyzed. A key aspect of the approach is the ability to compare protein levels across different samples. This requires a number of considerations in sample preparation, imaging and data analysis. Here we present a protocol for obtaining time course data of dorsoventral expression patterns from mouse and chick neural tube in the first 3 days of neural tube development. The described workflow starts from embryo dissection and ends with a processed dataset. Software scripts for data analysis are included. The protocol is adaptable and instructions that allow the user to modify different steps are provided. Thus, the procedure can be altered for analysis of time-lapse images and applied to systems other than the neural tube.}, author = {Zagórski, Marcin P and Kicheva, Anna}, booktitle = {Morphogen Gradients }, isbn = {978-1-4939-8771-9}, issn = {1064-3745}, pages = {47 -- 63}, publisher = {Springer Nature}, title = {{Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube}}, doi = {10.1007/978-1-4939-8772-6_4}, volume = {1863}, year = {2018}, } @article{305, abstract = {The hanging-drop network (HDN) is a technology platform based on a completely open microfluidic network at the bottom of an inverted, surface-patterned substrate. The platform is predominantly used for the formation, culturing, and interaction of self-assembled spherical microtissues (spheroids) under precisely controlled flow conditions. Here, we describe design, fabrication, and operation of microfluidic hanging-drop networks.}, author = {Misun, Patrick and Birchler, Axel and Lang, Moritz and Hierlemann, Andreas and Frey, Olivier}, journal = {Methods in Molecular Biology}, pages = {183 -- 202}, publisher = {Springer}, title = {{Fabrication and operation of microfluidic hanging drop networks}}, doi = {10.1007/978-1-4939-7792-5_15}, volume = {1771}, year = {2018}, } @inproceedings{325, abstract = {Probabilistic programs extend classical imperative programs with real-valued random variables and random branching. The most basic liveness property for such programs is the termination property. The qualitative (aka almost-sure) termination problem asks whether a given program program terminates with probability 1. While ranking functions provide a sound and complete method for non-probabilistic programs, the extension of them to probabilistic programs is achieved via ranking supermartingales (RSMs). Although deep theoretical results have been established about RSMs, their application to probabilistic programs with nondeterminism has been limited only to programs of restricted control-flow structure. For non-probabilistic programs, lexicographic ranking functions provide a compositional and practical approach for termination analysis of real-world programs. In this work we introduce lexicographic RSMs and show that they present a sound method for almost-sure termination of probabilistic programs with nondeterminism. We show that lexicographic RSMs provide a tool for compositional reasoning about almost-sure termination, and for probabilistic programs with linear arithmetic they can be synthesized efficiently (in polynomial time). We also show that with additional restrictions even asymptotic bounds on expected termination time can be obtained through lexicographic RSMs. Finally, we present experimental results on benchmarks adapted from previous work to demonstrate the effectiveness of our approach.}, author = {Agrawal, Sheshansh and Chatterjee, Krishnendu and Novotny, Petr}, location = {Los Angeles, CA, USA}, number = {POPL}, publisher = {ACM}, title = {{Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs}}, doi = {10.1145/3158122}, volume = {2}, year = {2018}, } @article{394, abstract = {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. }, author = {Mahmood, Fahad and Alpichshev, Zhanybek and Lee, Yi and Kong, Jing and Gedik, Nuh}, journal = {Nano Letters}, number = {1}, pages = {223 -- 228}, publisher = {American Chemical Society}, title = {{Observation of exciton-exciton interaction mediated valley Depolarization in Monolayer MoSe2}}, doi = {10.1021/acs.nanolett.7b03953}, volume = {18}, year = {2018}, } @inbook{408, abstract = {Adventitious roots (AR) are de novo formed roots that emerge from any part of the plant or from callus in tissue culture, except root tissue. The plant tissue origin and the method by which they are induced determine the physiological properties of emerged ARs. Hence, a standard method encompassing all types of AR does not exist. Here we describe a method for the induction and analysis of AR that emerge from the etiolated hypocotyl of dicot plants. The hypocotyl is formed during embryogenesis and shows a determined developmental pattern which usually does not involve AR formation. However, the hypocotyl shows propensity to form de novo roots under specific circumstances such as removal of the root system, high humidity or flooding, or during de-etiolation. The hypocotyl AR emerge from a pericycle-like cell layer surrounding the vascular tissue of the central cylinder, which is reminiscent to the developmental program of lateral roots. Here we propose an easy protocol for in vitro hypocotyl AR induction from etiolated Arabidopsis seedlings.}, author = {Trinh, Hoang and Verstraeten, Inge and Geelen, Danny}, booktitle = {Root Development }, issn = {1064-3745}, pages = {95 -- 102}, publisher = {Springer Nature}, title = {{In vitro assay for induction of adventitious rooting on intact arabidopsis hypocotyls}}, doi = {10.1007/978-1-4939-7747-5_7}, volume = {1761}, year = {2018}, } @inbook{411, abstract = {Immunolocalization is a valuable tool for cell biology research that allows to rapidly determine the localization and expression levels of endogenous proteins. In plants, whole-mount in situ immunolocalization remains a challenging method, especially in tissues protected by waxy layers and complex cell wall carbohydrates. Here, we present a robust method for whole-mount in situ immunolocalization in primary root meristems and lateral root primordia in Arabidopsis thaliana. For good epitope preservation, fixation is done in an alkaline paraformaldehyde/glutaraldehyde mixture. This fixative is suitable for detecting a wide range of proteins, including integral transmembrane proteins and proteins peripherally attached to the plasma membrane. From initiation until emergence from the primary root, lateral root primordia are surrounded by several layers of differentiated tissues with a complex cell wall composition that interferes with the efficient penetration of all buffers. Therefore, immunolocalization in early lateral root primordia requires a modified method, including a strong solvent treatment for removal of hydrophobic barriers and a specific cocktail of cell wall-degrading enzymes. The presented method allows for easy, reliable, and high-quality in situ detection of the subcellular localization of endogenous proteins in primary and lateral root meristems without the need of time-consuming crosses or making translational fusions to fluorescent proteins.}, author = {Karampelias, Michael and Tejos, Ricardo and Friml, Jirí and Vanneste, Steffen}, booktitle = {Root Development. Methods and Protocols}, editor = {Ristova, Daniela and Barbez, Elke}, pages = {131 -- 143}, publisher = {Springer}, title = {{Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia}}, doi = {10.1007/978-1-4939-7747-5_10}, volume = {1761}, year = {2018}, } @article{456, abstract = {Inhibition of the endoplasmic reticulum stress pathway may hold the key to Zika virus-associated microcephaly treatment. }, author = {Novarino, Gaia}, journal = {Science Translational Medicine}, number = {423}, publisher = {American Association for the Advancement of Science}, title = {{Zika-associated microcephaly: Reduce the stress and race for the treatment}}, doi = {10.1126/scitranslmed.aar7514}, volume = {10}, year = {2018}, } @article{53, abstract = {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.}, author = {Petritsch, Barbara and Porsche, Jana}, journal = {VÖB Mitteilungen}, number = {1}, pages = {199 -- 206}, publisher = {Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare}, title = {{IST PubRep and IST DataRep: the institutional repositories at IST Austria}}, doi = {10.31263/voebm.v71i1.1993}, volume = {71}, year = {2018}, } @article{536, abstract = {We consider the problem of consensus in the challenging classic model. In this model, the adversary is adaptive; it can choose which processors crash at any point during the course of the algorithm. Further, communication is via asynchronous message passing: there is no known upper bound on the time to send a message from one processor to another, and all messages and coin flips are seen by the adversary. We describe a new randomized consensus protocol with expected message complexity O(n2log2n) when fewer than n / 2 processes may fail by crashing. This is an almost-linear improvement over the best previously known protocol, and within logarithmic factors of a known Ω(n2) message lower bound. The protocol further ensures that no process sends more than O(nlog3n) messages in expectation, which is again within logarithmic factors of optimal. We also present a generalization of the algorithm to an arbitrary number of failures t, which uses expected O(nt+t2log2t) total messages. Our approach is to build a message-efficient, resilient mechanism for aggregating individual processor votes, implementing the message-passing equivalent of a weak shared coin. Roughly, in our protocol, a processor first announces its votes to small groups, then propagates them to increasingly larger groups as it generates more and more votes. To bound the number of messages that an individual process might have to send or receive, the protocol progressively increases the weight of generated votes. The main technical challenge is bounding the impact of votes that are still “in flight” (generated, but not fully propagated) on the final outcome of the shared coin, especially since such votes might have different weights. We achieve this by leveraging the structure of the algorithm, and a technical argument based on martingale concentration bounds. Overall, we show that it is possible to build an efficient message-passing implementation of a shared coin, and in the process (almost-optimally) solve the classic consensus problem in the asynchronous message-passing model.}, author = {Alistarh, Dan-Adrian and Aspnes, James and King, Valerie and Saia, Jared}, issn = {01782770}, journal = {Distributed Computing}, number = {6}, pages = {489--501}, publisher = {Springer}, title = {{Communication-efficient randomized consensus}}, doi = {10.1007/s00446-017-0315-1}, volume = {31}, year = {2018}, } @article{554, abstract = {We analyse the canonical Bogoliubov free energy functional in three dimensions at low temperatures in the dilute limit. We prove existence of a first-order phase transition and, in the limit (Formula presented.), we determine the critical temperature to be (Formula presented.) to leading order. Here, (Formula presented.) is the critical temperature of the free Bose gas, ρ is the density of the gas and a is the scattering length of the pair-interaction potential V. We also prove asymptotic expansions for the free energy. In particular, we recover the Lee–Huang–Yang formula in the limit (Formula presented.).}, author = {Napiórkowski, Marcin M and Reuvers, Robin and Solovej, Jan}, issn = {00103616}, journal = {Communications in Mathematical Physics}, number = {1}, pages = {347--403}, publisher = {Springer}, title = {{The Bogoliubov free energy functional II: The dilute Limit}}, doi = {10.1007/s00220-017-3064-x}, volume = {360}, year = {2018}, } @inbook{562, abstract = {Primary neuronal cell culture preparations are widely used to investigate synaptic functions. This chapter describes a detailed protocol for the preparation of a neuronal cell culture in which giant calyx-type synaptic terminals are formed. This chapter also presents detailed protocols for utilizing the main technical advantages provided by such a preparation, namely, labeling and imaging of synaptic organelles and electrophysiological recordings directly from presynaptic terminals.}, author = {Dimitrov, Dimitar and Guillaud, Laurent and Eguchi, Kohgaku and Takahashi, Tomoyuki}, booktitle = {Neurotrophic Factors}, editor = {Skaper, Stephen D.}, pages = {201 -- 215}, publisher = {Springer}, title = {{Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses}}, doi = {10.1007/978-1-4939-7571-6_15}, volume = {1727}, year = {2018}, } @inbook{59, abstract = {Graph-based games are an important tool in computer science. They have applications in synthesis, verification, refinement, and far beyond. We review graphbased games with objectives on infinite plays. We give definitions and algorithms to solve the games and to give a winning strategy. The objectives we consider are mostly Boolean, but we also look at quantitative graph-based games and their objectives. Synthesis aims to turn temporal logic specifications into correct reactive systems. We explain the reduction of synthesis to graph-based games (or equivalently tree automata) using synthesis of LTL specifications as an example. We treat the classical approach that uses determinization of parity automata and more modern approaches.}, author = {Bloem, Roderick and Chatterjee, Krishnendu and Jobstmann, Barbara}, booktitle = {Handbook of Model Checking}, editor = {Henzinger, Thomas A and Clarke, Edmund M. and Veith, Helmut and Bloem, Roderick}, isbn = {978-3-319-10574-1}, pages = {921 -- 962}, publisher = {Springer}, title = {{Graph games and reactive synthesis}}, doi = {10.1007/978-3-319-10575-8_27}, year = {2018}, } @inbook{60, abstract = {Model checking is a computer-assisted method for the analysis of dynamical systems that can be modeled by state-transition systems. Drawing from research traditions in mathematical logic, programming languages, hardware design, and theoretical computer science, model checking is now widely used for the verification of hardware and software in industry. This chapter is an introduction and short survey of model checking. The chapter aims to motivate and link the individual chapters of the handbook, and to provide context for readers who are not familiar with model checking.}, author = {Clarke, Edmund and Henzinger, Thomas A and Veith, Helmut}, booktitle = {Handbook of Model Checking}, editor = {Henzinger, Thomas A}, pages = {1 -- 26}, publisher = {Springer}, title = {{Introduction to model checking}}, doi = {10.1007/978-3-319-10575-8_1}, year = {2018}, } @inbook{61, abstract = {We prove that there is no strongly regular graph (SRG) with parameters (460; 153; 32; 60). The proof is based on a recent lower bound on the number of 4-cliques in a SRG and some applications of Euclidean representation of SRGs. }, author = {Bondarenko, Andriy and Mellit, Anton and Prymak, Andriy and Radchenko, Danylo and Viazovska, Maryna}, booktitle = {Contemporary Computational Mathematics}, pages = {131 -- 134}, publisher = {Springer}, title = {{There is no strongly regular graph with parameters (460; 153; 32; 60)}}, doi = {10.1007/978-3-319-72456-0_7}, year = {2018}, } @article{6111, abstract = {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.}, author = {McLachlan, Ian G. and Beets, Isabel and de Bono, Mario and Heiman, Maxwell G.}, issn = {1553-7404}, journal = {PLOS Genetics}, number = {6}, publisher = {Public Library of Science}, title = {{A neuronal MAP kinase constrains growth of a Caenorhabditis elegans sensory dendrite throughout the life of the organism}}, doi = {10.1371/journal.pgen.1007435}, volume = {14}, year = {2018}, } @article{6109, abstract = {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.}, author = {Laurent, Patrick and Ch’ng, QueeLim and Jospin, Maëlle and Chen, Changchun and Lorenzo, Ramiro and de Bono, Mario}, issn = {0027-8424}, journal = {Proceedings of the National Academy of Sciences}, number = {29}, pages = {E6890--E6899}, publisher = {National Academy of Sciences}, title = {{Genetic dissection of neuropeptide cell biology at high and low activity in a defined sensory neuron}}, doi = {10.1073/pnas.1714610115}, volume = {115}, year = {2018}, } @inproceedings{6164, abstract = {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.}, author = {Koshti, Girish and Biswas, Ranita and Largeteau-Skapin, Gaëlle and Zrour, Rita and Andres, Eric and Bhowmick, Partha}, booktitle = {19th International Workshop}, isbn = {978-3-030-05287-4}, issn = {1611-3349}, location = {Porto, Portugal}, pages = {82--96}, publisher = {Springer}, title = {{Sphere construction on the FCC grid interpreted as layered hexagonal grids in 3D}}, doi = {10.1007/978-3-030-05288-1_7}, volume = {11255}, year = {2018}, } @article{6354, abstract = {Blood platelets are critical for hemostasis and thrombosis, but also play diverse roles during immune responses. We have recently reported that platelets migrate at sites of infection in vitro and in vivo. Importantly, platelets use their ability to migrate to collect and bundle fibrin (ogen)-bound bacteria accomplishing efficient intravascular bacterial trapping. Here, we describe a method that allows analyzing platelet migration in vitro, focusing on their ability to collect bacteria and trap bacteria under flow.}, author = {Fan, Shuxia and Lorenz, Michael and Massberg, Steffen and Gärtner, Florian R}, issn = {2331-8325}, journal = {Bio-Protocol}, keywords = {Platelets, Cell migration, Bacteria, Shear flow, Fibrinogen, E. coli}, number = {18}, publisher = {Bio-Protocol}, title = {{Platelet migration and bacterial trapping assay under flow}}, doi = {10.21769/bioprotoc.3018}, volume = {8}, year = {2018}, } @article{6368, abstract = {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.}, author = {Higginbotham, Andrew P and Burns, P. S. and Urmey, M. D. and Peterson, R. W. and Kampel, N. S. and Brubaker, B. M. and Smith, G. and Lehnert, K. W. and Regal, C. A.}, issn = {1745-2473}, journal = {Nature Physics}, number = {10}, pages = {1038--1042}, publisher = {Springer Nature}, title = {{Harnessing electro-optic correlations in an efficient mechanical converter}}, doi = {10.1038/s41567-018-0210-0}, volume = {14}, year = {2018}, } @article{6369, abstract = {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.}, author = {Rosenthal, Eric I. and Ehrlich, Nicole K. and Rudner, Mark S. and Higginbotham, Andrew P and Lehnert, K. W.}, issn = {2469-9950}, journal = {Physical Review B}, number = {22}, publisher = {American Physical Society (APS)}, title = {{Topological phase transition measured in a dissipative metamaterial}}, doi = {10.1103/physrevb.97.220301}, volume = {97}, year = {2018}, } @misc{6459, author = {Petritsch, Barbara}, keywords = {Open Access, Publication Analysis}, location = {Graz, Austria}, publisher = {IST Austria}, title = {{Open Access at IST Austria 2009-2017}}, doi = {10.5281/zenodo.1410279}, year = {2018}, } @inbook{6525, abstract = {This chapter finds an agreement of equivariant indices of semi-classical homomorphisms between pairwise mirror branes in the GL2 Higgs moduli space on a Riemann surface. On one side of the agreement, components of the Lagrangian brane of U(1,1) Higgs bundles, whose mirror was proposed by Hitchin to be certain even exterior powers of the hyperholomorphic Dirac bundle on the SL2 Higgs moduli space, are present. The agreement arises from a mysterious functional equation. This gives strong computational evidence for Hitchin’s proposal.}, author = {Hausel, Tamás and Mellit, Anton and Pei, Du}, booktitle = {Geometry and Physics: Volume I}, isbn = {9780198802013}, pages = {189--218}, publisher = {Oxford University Press}, title = {{Mirror symmetry with branes by equivariant verlinde formulas}}, doi = {10.1093/oso/9780198802013.003.0009}, year = {2018}, } @inproceedings{6664, abstract = {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.}, author = {Hashemi, Seyyed Ali and Doan, Nghia and Mondelli, Marco and Gross, Warren }, booktitle = {2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing}, location = {Hong Kong, China}, pages = {1--5}, publisher = {IEEE}, title = {{Decoding Reed-Muller and polar codes by successive factor graph permutations}}, doi = {10.1109/istc.2018.8625281}, year = {2018}, } @article{6674, abstract = {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.}, author = {Hashemi, Seyyed Ali and Mondelli, Marco and Hassani, S. Hamed and Condo, Carlo and Urbanke, Rudiger L. and Gross, Warren J.}, issn = {1558-0857}, journal = {IEEE Transactions on Communications}, number = {9}, pages = {3749--3759}, publisher = {IEEE}, title = {{Decoder partitioning: Towards practical list decoding of polar codes}}, doi = {10.1109/tcomm.2018.2832207}, volume = {66}, year = {2018}, } @inproceedings{6728, abstract = {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 .}, author = {Doan, Nghia and Hashemi, Seyyed Ali and Mondelli, Marco and Gross, Warren J.}, booktitle = {2018 IEEE Global Communications Conference }, isbn = {9781538647271}, location = {Abu Dhabi, United Arab Emirates}, publisher = {IEEE}, title = {{On the decoding of polar codes on permuted factor graphs}}, doi = {10.1109/glocom.2018.8647308}, year = {2018}, } @article{6678, abstract = {We survey coding techniques that enable reliable transmission at rates that approach the capacity of an arbitrary discrete memoryless channel. In particular, we take the point of view of modern coding theory and discuss how recent advances in coding for symmetric channels help provide more efficient solutions for the asymmetric case. We consider, in more detail, three basic coding paradigms. The first one is Gallager's scheme that consists of concatenating a linear code with a non-linear mapping so that the input distribution can be appropriately shaped. We explicitly show that both polar codes and spatially coupled codes can be employed in this scenario. Furthermore, we derive a scaling law between the gap to capacity, the cardinality of the input and output alphabets, and the required size of the mapper. The second one is an integrated scheme in which the code is used both for source coding, in order to create codewords distributed according to the capacity-achieving input distribution, and for channel coding, in order to provide error protection. Such a technique has been recently introduced by Honda and Yamamoto in the context of polar codes, and we show how to apply it also to the design of sparse graph codes. The third paradigm is based on an idea of Böcherer and Mathar, and separates the two tasks of source coding and channel coding by a chaining construction that binds together several codewords. We present conditions for the source code and the channel code, and we describe how to combine any source code with any channel code that fulfill those conditions, in order to provide capacity-achieving schemes for asymmetric channels. In particular, we show that polar codes, spatially coupled codes, and homophonic codes are suitable as basic building blocks of the proposed coding strategy. Rather than focusing on the exact details of the schemes, the purpose of this tutorial is to present different coding techniques that can then be implemented with many variants. There is no absolute winner and, in order to understand the most suitable technique for a specific application scenario, we provide a detailed comparison that takes into account several performance metrics.}, author = {Mondelli, Marco and Hassani, Hamed and Urbanke, Rudiger }, issn = {0018-9448}, journal = {IEEE Transactions on Information Theory}, number = {5}, pages = {3371--3393}, publisher = {IEEE}, title = {{How to achieve the capacity of asymmetric channels}}, doi = {10.1109/tit.2018.2789885}, volume = {64}, year = {2018}, } @article{690, abstract = {We consider spectral properties and the edge universality of sparse random matrices, the class of random matrices that includes the adjacency matrices of the Erdős–Rényi graph model G(N, p). We prove a local law for the eigenvalue density up to the spectral edges. Under a suitable condition on the sparsity, we also prove that the rescaled extremal eigenvalues exhibit GOE Tracy–Widom fluctuations if a deterministic shift of the spectral edge due to the sparsity is included. For the adjacency matrix of the Erdős–Rényi graph this establishes the Tracy–Widom fluctuations of the second largest eigenvalue when p is much larger than N−2/3 with a deterministic shift of order (Np)−1.}, author = {Lee, Jii and Schnelli, Kevin}, journal = {Probability Theory and Related Fields}, number = {1-2}, publisher = {Springer}, title = {{Local law and Tracy–Widom limit for sparse random matrices}}, doi = {10.1007/s00440-017-0787-8}, volume = {171}, year = {2018}, } @inproceedings{6675, abstract = {We present a coding paradigm that provides a new achievable rate for the primitive relay channel by combining compress-and-forward and decode-and-forward with a chaining construction. In the primitive relay channel model, the source broadcasts a message to the relay and to the destination; and the relay facilitates this communication by sending an additional message to the destination through a separate channel. Two well-known coding approaches for this setting are decode-and-forward and compress-and-forward: in the former, the relay decodes the message and sends some of the information to the destination; in the latter, the relay does not attempt to decode, but it sends a compressed description of the received sequence to the destination via Wyner-Ziv coding. In our scheme, we transmit over pairs of blocks and we use compress-and-forward for the first block and decode-and-forward for the second. In particular, in the first block, the relay does not attempt to decode and it sends only a part of the compressed description of the received sequence; in the second block, the relay decodes the message and sends this information plus the remaining part of the compressed sequence relative to the first block. As a result, we strictly outperform both compress-and- forward and decode-and-forward. Furthermore, this paradigm can be implemented with a low-complexity polar coding scheme that has the typical attractive features of polar codes, i.e., quasi-linear encoding/decoding complexity and super-polynomial decay of the error probability. Throughout the paper we consider as a running example the special case of the erasure relay channel and we compare the rates achievable by our proposed scheme with the existing upper and lower bounds.}, author = {Mondelli, Marco and Hassani, Hamed and Urbanke, Rudiger}, booktitle = {2018 IEEE International Symposium on Information Theory}, issn = {2157-8117}, location = {Vail, CO, United States}, pages = {351--355}, publisher = {IEEE}, title = {{A new coding paradigm for the primitive relay channel}}, doi = {10.1109/isit.2018.8437479}, year = {2018}, } @article{703, abstract = {We consider the NP-hard problem of MAP-inference for undirected discrete graphical models. We propose a polynomial time and practically efficient algorithm for finding a part of its optimal solution. Specifically, our algorithm marks some labels of the considered graphical model either as (i) optimal, meaning that they belong to all optimal solutions of the inference problem; (ii) non-optimal if they provably do not belong to any solution. With access to an exact solver of a linear programming relaxation to the MAP-inference problem, our algorithm marks the maximal possible (in a specified sense) number of labels. We also present a version of the algorithm, which has access to a suboptimal dual solver only and still can ensure the (non-)optimality for the marked labels, although the overall number of the marked labels may decrease. We propose an efficient implementation, which runs in time comparable to a single run of a suboptimal dual solver. Our method is well-scalable and shows state-of-the-art results on computational benchmarks from machine learning and computer vision.}, author = {Shekhovtsov, Alexander and Swoboda, Paul and Savchynskyy, Bogdan}, issn = {01628828}, journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence}, number = {7}, pages = {1668--1682}, publisher = {IEEE}, title = {{Maximum persistency via iterative relaxed inference with graphical models}}, doi = {10.1109/TPAMI.2017.2730884}, volume = {40}, year = {2018}, } @article{7063, abstract = {The high-pressure synthesis and incommensurately modulated structure are reported for the new compound Sr2Pt8−xAs, with x = 0.715 (5). The structure consists of Sr2Pt3As layers alternating with Pt-only corrugated grids. Ab initio calculations predict a metallic character with a dominant role of the Pt d electrons. The electrical resistivity (ρ) and Seebeck coefficient confirm the metallic character, but surprisingly, ρ showed a near-flat temperature dependence. This observation fits the description of the Mooij correlation for electrical resistivity in disordered metals, originally developed for statistically distributed point defects. The discussed material has a long-range crystallographic order, but the high concentration of Pt vacancies, incommensurately ordered, strongly influences the electronic conduction properties. This result extends the range of validity of the Mooij correlation to long-range ordered incommensurately modulated vacancies. Motivated by the layered structure, the resistivity anisotropy was measured in a focused-ion-beam micro-fabricated well oriented single crystal. A low resistivity anisotropy indicates that the layers are electrically coupled and conduction channels along different directions are intermixed.}, author = {Martino, Edoardo and Arakcheeva, Alla and Autès, Gabriel and Pisoni, Andrea and Bachmann, Maja D. and Modic, Kimberly A and Helm, Toni and Yazyev, Oleg V. and Moll, Philip J. W. and Forró, László and Katrych, Sergiy}, issn = {2052-2525}, journal = {IUCrJ}, number = {4}, pages = {470--477}, publisher = {International Union of Crystallography (IUCr)}, title = {{Sr2Pt8−xAs: A layered incommensurately modulated metal with saturated resistivity}}, doi = {10.1107/s2052252518007303}, volume = {5}, year = {2018}, } @article{7062, abstract = {Weyl fermions are a recently discovered ingredient for correlated states of electronic matter. A key difficulty has been that real materials also contain non-Weyl quasiparticles, and disentangling the experimental signatures has proven challenging. Here we use magnetic fields up to 95 T to drive the Weyl semimetal TaAs far into its quantum limit, where only the purely chiral 0th Landau levels of the Weyl fermions are occupied. We find the electrical resistivity to be nearly independent of magnetic field up to 50 T: unusual for conventional metals but consistent with the chiral anomaly for Weyl fermions. Above 50 T we observe a two-order-of-magnitude increase in resistivity, indicating that a gap opens in the chiral Landau levels. Above 80 T we observe strong ultrasonic attenuation below 2 K, suggesting a mesoscopically textured state of matter. These results point the way to inducing new correlated states of matter in the quantum limit of Weyl semimetals.}, author = {Ramshaw, B. J. and Modic, Kimberly A and Shekhter, Arkady and Zhang, Yi and Kim, Eun-Ah and Moll, Philip J. W. and Bachmann, Maja D. and Chan, M. K. and Betts, J. B. and Balakirev, F. and Migliori, A. and Ghimire, N. J. and Bauer, E. D. and Ronning, F. and McDonald, R. D.}, issn = {2041-1723}, journal = {Nature Communications}, number = {1}, publisher = {Springer Nature}, title = {{Quantum limit transport and destruction of the Weyl nodes in TaAs}}, doi = {10.1038/s41467-018-04542-9}, volume = {9}, year = {2018}, } @article{7059, abstract = {Unusual behavior in quantum materials commonly arises from their effective low-dimensional physics, reflecting the underlying anisotropy in the spin and charge degrees of freedom. Here we introduce the magnetotropic coefficient k = ∂2F/∂θ2, the second derivative of the free energy F with respect to the magnetic field orientation θ in the crystal. We show that the magnetotropic coefficient can be quantitatively determined from a shift in the resonant frequency of a commercially available atomic force microscopy cantilever under magnetic field. This detection method enables part per 100 million sensitivity and the ability to measure magnetic anisotropy in nanogram-scale samples, as demonstrated on the Weyl semimetal NbP. Measurement of the magnetotropic coefficient in the spin-liquid candidate RuCl3 highlights its sensitivity to anisotropic phase transitions and allows a quantitative comparison to other thermodynamic coefficients via the Ehrenfest relations.}, author = {Modic, Kimberly A and Bachmann, Maja D. and Ramshaw, B. J. and Arnold, F. and Shirer, K. R. and Estry, Amelia and Betts, J. B. and Ghimire, Nirmal J. and Bauer, E. D. and Schmidt, Marcus and Baenitz, Michael and Svanidze, E. and McDonald, Ross D. and Shekhter, Arkady and Moll, Philip J. W.}, issn = {2041-1723}, journal = {Nature Communications}, number = {1}, pages = {3975}, publisher = {Springer Nature}, title = {{Resonant torsion magnetometry in anisotropic quantum materials}}, doi = {10.1038/s41467-018-06412-w}, volume = {9}, year = {2018}, } @article{7058, abstract = {We examine recent magnetic torque measurements in two compounds, γ−Li2IrO3 and RuCl3, which have been discussed as possible realizations of the Kitaev model. The analysis of the reported discontinuity in torque, as an external magnetic field is rotated across the c axis in both crystals, suggests that they have a translationally invariant chiral spin order of the form ⟨Si⋅(Sj×Sk)⟩≠0 in the ground state and persisting over a very wide range of magnetic field and temperature. An extraordinary |B|B2 dependence of the torque for small fields, beside the usual B2 part, is predicted by the chiral spin order. Data for small fields are available for γ−Li2IrO3 and are found to be consistent with the prediction upon further analysis. Other experiments such as inelastic scattering and thermal Hall effect and several questions raised by the discovery of chiral spin order, including its topological consequences, are discussed.}, author = {Modic, Kimberly A and Ramshaw, B. J. and Shekhter, A. and Varma, C. M.}, issn = {2469-9969}, journal = {Physical Review B}, number = {20}, publisher = {APS}, title = {{Chiral spin order in some purported Kitaev spin-liquid compounds}}, doi = {10.1103/physrevb.98.205110}, volume = {98}, year = {2018}, } @article{7060, abstract = {The anomalous metallic state in the high-temperature superconducting cuprates is masked by superconductivity near a quantum critical point. Applying high magnetic fields to suppress superconductivity has enabled detailed studies of the normal state, yet the direct effect of strong magnetic fields on the metallic state is poorly understood. We report the high-field magnetoresistance of thin-film La2–xSrxCuO4 cuprate in the vicinity of the critical doping, 0.161 ≤ p ≤ 0.190. We find that the metallic state exposed by suppressing superconductivity is characterized by magnetoresistance that is linear in magnetic fields up to 80 tesla. The magnitude of the linear-in-field resistivity mirrors the magnitude and doping evolution of the well-known linear-in-temperature resistivity that has been associated with quantum criticality in high-temperature superconductors.}, author = {Giraldo-Gallo, P. and Galvis, J. A. and Stegen, Z. and Modic, Kimberly A and Balakirev, F. F. and Betts, J. B. and Lian, X. and Moir, C. and Riggs, S. C. and Wu, J. and Bollinger, A. T. and He, X. and Božović, I. and Ramshaw, B. J. and McDonald, R. D. and Boebinger, G. S. and Shekhter, A.}, issn = {1095-9203}, journal = {Science}, number = {6401}, pages = {479--481}, publisher = {AAAS}, title = {{Scale-invariant magnetoresistance in a cuprate superconductor}}, doi = {10.1126/science.aan3178}, volume = {361}, year = {2018}, } @inproceedings{7116, abstract = {Training deep learning models has received tremendous research interest recently. In particular, there has been intensive research on reducing the communication cost of training when using multiple computational devices, through reducing the precision of the underlying data representation. Naturally, such methods induce system trade-offs—lowering communication precision could de-crease communication overheads and improve scalability; but, on the other hand, it can also reduce the accuracy of training. In this paper, we study this trade-off space, and ask:Can low-precision communication consistently improve the end-to-end performance of training modern neural networks, with no accuracy loss?From the performance point of view, the answer to this question may appear deceptively easy: compressing communication through low precision should help when the ratio between communication and computation is high. However, this answer is less straightforward when we try to generalize this principle across various neural network architectures (e.g., AlexNet vs. ResNet),number of GPUs (e.g., 2 vs. 8 GPUs), machine configurations(e.g., EC2 instances vs. NVIDIA DGX-1), communication primitives (e.g., MPI vs. NCCL), and even different GPU architectures(e.g., Kepler vs. Pascal). Currently, it is not clear how a realistic realization of all these factors maps to the speed up provided by low-precision communication. In this paper, we conduct an empirical study to answer this question and report the insights.}, author = {Grubic, Demjan and Tam, Leo and Alistarh, Dan-Adrian and Zhang, Ce}, booktitle = {Proceedings of the 21st International Conference on Extending Database Technology}, isbn = {9783893180783}, issn = {2367-2005}, location = {Vienna, Austria}, pages = {145--156}, publisher = {OpenProceedings}, title = {{Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study}}, doi = {10.5441/002/EDBT.2018.14}, year = {2018}, } @article{7126, abstract = {In the Minimum Description Length (MDL) principle, learning from the data is equivalent to an optimal coding problem. We show that the codes that achieve optimal compression in MDL are critical in a very precise sense. First, when they are taken as generative models of samples, they generate samples with broad empirical distributions and with a high value of the relevance, defined as the entropy of the empirical frequencies. These results are derived for different statistical models (Dirichlet model, independent and pairwise dependent spin models, and restricted Boltzmann machines). Second, MDL codes sit precisely at a second order phase transition point where the symmetry between the sampled outcomes is spontaneously broken. The order parameter controlling the phase transition is the coding cost of the samples. The phase transition is a manifestation of the optimality of MDL codes, and it arises because codes that achieve a higher compression do not exist. These results suggest a clear interpretation of the widespread occurrence of statistical criticality as a characterization of samples which are maximally informative on the underlying generative process.}, author = {Cubero, Ryan J and Marsili, Matteo and Roudi, Yasser}, issn = {1099-4300}, journal = {Entropy}, keywords = {Minimum Description Length, normalized maximum likelihood, statistical criticality, phase transitions, large deviations}, number = {10}, publisher = {MDPI}, title = {{Minimum description length codes are critical}}, doi = {10.3390/e20100755}, volume = {20}, year = {2018}, } @article{7277, abstract = {Solid alkali metal carbonates are universal passivation layer components of intercalation battery materials and common side products in metal‐O2 batteries, and are believed to form and decompose reversibly in metal‐O2/CO2 cells. In these cathodes, Li2CO3 decomposes to CO2 when exposed to potentials above 3.8 V vs. Li/Li+. However, O2 evolution, as would be expected according to the decomposition reaction 2 Li2CO3→4 Li++4 e−+2 CO2+O2, is not detected. O atoms are thus unaccounted for, which was previously ascribed to unidentified parasitic reactions. Here, we show that highly reactive singlet oxygen (1O2) forms upon oxidizing Li2CO3 in an aprotic electrolyte and therefore does not evolve as O2. These results have substantial implications for the long‐term cyclability of batteries: they underpin the importance of avoiding 1O2 in metal‐O2 batteries, question the possibility of a reversible metal‐O2/CO2 battery based on a carbonate discharge product, and help explain the interfacial reactivity of transition‐metal cathodes with residual Li2CO3.}, author = {Mahne, Nika and Renfrew, Sara E. and McCloskey, Bryan D. and Freunberger, Stefan Alexander}, issn = {1433-7851}, journal = {Angewandte Chemie International Edition}, number = {19}, pages = {5529--5533}, publisher = {Wiley}, title = {{Electrochemical oxidation of Lithium Carbonate generates singlet oxygen}}, doi = {10.1002/anie.201802277}, volume = {57}, year = {2018}, } @article{7271, abstract = {The recent demand of multifunctional materials and devices for advanced applications in energy conversion and data storage resulted into a revival of multiferroics, that is, materials characterized by the coexistence of ferromagnetism and ferroelectricity. Despite intense efforts made in the past decade, single-phase room temperature multiferroics are yet to be discovered/fabricated. Nanostructured ferroic materials could potentially exhibit multiferroism since a high fraction of their atoms/ions are superficial, thereby altering significantly the properties of the bulk phase. Alternately, a magnetic order can be induced into ferroelectric materials upon aliovalent doping with magnetic ions. Here, we report on the synthesis of aggregate-free single-phase transition-metal-doped BaTiO3 quasi-monodisperse cuboidal nanocrystals (NC) which exhibit multiferroic properties at room temperature and can be suitable for applications in data storage. The proposed synthetic route allows the inclusion of a high concentration of magnetic ions such as Mn+ (M = Cr, Mn, Fe, Co) up to a nominal concentration of 4% without the formation of any secondary phase. The size of the nanocrystals was controlled in a wide range from ∼15 up to ∼70 nm by varying the reaction time from 48 to 144 h. The presence of unpaired electrons and their magnetic ordering have been probed by electron paramagnetic resonance spectroscopy (EPR), and a vibrating sample magnetometer (VSM). Likewise, an acentric structure, associated with the existence of a dielectric polarization, was observed by lattice dynamics analysis and piezoresponse force microscopy (PFM). These results show that high-quality titanium-containing perovskite nanocrystals which display multiferroic properties at room temperature can be fabricated via soft solution-based synthetic routes, and the properties of these materials can be modulated by changing the size of the nanocrystals and the concentration of the dopant thereby opening the door to the design and study of single-phase multiferroic materials.}, author = {Costanzo, Tommaso and McCracken, John and Rotaru, Aurelian and Caruntu, Gabriel}, issn = {2574-0970}, journal = {ACS Applied Nano Materials}, number = {9}, pages = {4863--4874}, publisher = {ACS}, title = {{Quasi-monodisperse transition-metal-doped BaTiO3 (M = Cr, Mn, Fe, Co) colloidal nanocrystals with multiferroic properties}}, doi = {10.1021/acsanm.8b01036}, volume = {1}, year = {2018}, } @article{7287, abstract = {Passivation layers on electrode materials are ubiquitous in nonaqueous battery chemistries and strongly govern performance and lifetime. They comprise breakdown products of the electrolyte including carbonate, alkyl carbonates, alkoxides, carboxylates, and polymers. Parasitic chemistry in metal–O2 batteries forms similar products and is tied to the deviation of the O2 balance from the ideal stoichiometry during formation/decomposition of alkaline peroxides or superoxides. Accurate and integral quantification of carbonaceous species and peroxides or superoxides in battery electrodes remains, however, elusive. We present a refined procedure to quantify them accurately and sensitively by pointing out and rectifying pitfalls of previous procedures. Carbonaceous compounds are differentiated into inorganic and organic ones. We combine mass and UV–vis spectrometry to quantify evolved O2 and complexed peroxide and CO2 evolved from carbonaceous compounds by acid treatment and Fenton’s reaction. The capabilities of the method are exemplified by means of Li–O2 and Na–O2 cathodes, graphite anodes, and LiNi0.8Co0.15Al0.05O2 cathodes.}, author = {Schafzahl, Bettina and Mourad, Eléonore and Schafzahl, Lukas and Petit, Yann K. and Raju, Anjana R. and Thotiyl, Musthafa Ottakam and Wilkening, Martin and Slugovc, Christian and Freunberger, Stefan Alexander}, issn = {2380-8195}, journal = {ACS Energy Letters}, number = {1}, pages = {170--176}, publisher = {ACS}, title = {{Quantifying total superoxide, peroxide, and carbonaceous compounds in metal–O2 batteries and the solid electrolyte interphase}}, doi = {10.1021/acsenergylett.7b01111}, volume = {3}, year = {2018}, } @article{7285, abstract = {Hydrogelation, the self-assembly of molecules into soft, water-loaded networks, is one way to bridge the structural gap between single molecules and functional materials. The potential of hydrogels, such as those based on perylene bisimides, lies in their chemical, physical, optical, and electronic properties, which are governed by the supramolecular structure of the gel. However, the structural motifs and their precise role for long-range conductivity are yet to be explored. Here, we present a comprehensive structural picture of a perylene bisimide hydrogel, suggesting that its long-range conductivity is limited by charge transfer between electronic backbones. We reveal nanocrystalline ribbon-like structures as the electronic and structural backbone units between which charge transfer is mediated by polar solvent bridges. We exemplify this effect with sensing, where exposure to polar vapor enhances conductivity by 5 orders of magnitude, emphasizing the crucial role of the interplay between structural motif and surrounding medium for the rational design of devices based on nanocrystalline hydrogels.}, author = {Burian, Max and Rigodanza, Francesco and Demitri, Nicola and D̵ord̵ević, Luka and Marchesan, Silvia and Steinhartova, Tereza and Letofsky-Papst, Ilse and Khalakhan, Ivan and Mourad, Eléonore and Freunberger, Stefan Alexander and Amenitsch, Heinz and Prato, Maurizio and Syrgiannis, Zois}, issn = {1936-0851}, journal = {ACS Nano}, number = {6}, pages = {5800--5806}, publisher = {ACS}, title = {{Inter-backbone charge transfer as prerequisite for long-range conductivity in perylene bisimide hydrogels}}, doi = {10.1021/acsnano.8b01689}, volume = {12}, year = {2018}, } @article{7286, abstract = {The solid electrolyte interphase (SEI) in Li and Na ion batteries forms when highly reducing or oxidizing electrode materials come into contact with a liquid organic electrolyte. Its ability to form a mechanically robust, ion-conducting, and electron-insulating layer critically determines performance, cycle life, and safety. Li or Na alkyl carbonates (LiAC and NaAC, respectively) are lead SEI components in state-of-the-art carbonate based electrolytes, and our fundamental understanding of their charge transport and mechanical properties may hold the key to designing electrolytes forming an improved SEI. We synthesized a homologous series of LiACs and NaACs from methyl to octyl analogues and characterized them with respect to structure, ionic conductivity, and stiffness. The compounds assume layered structures except for the lithium methyl carbonate. Room-temperature conductivities were found to be ∼10–9 S cm–1 for lithium methyl carbonate, <10–12 S cm–1 for the other LiACs, and <10–12 S cm–1 for the NaACs with ion transport mostly attributed to grain boundaries. While LiACs show stiffnesses of ∼1 GPa, NaACs become significantly softer with increasing chain lengths. These findings will help to more precisely interpret the complex results from charge transport and mechanical characterization of real SEIs and can give a rationale for influencing the SEI’s mechanical properties via the electrolyte.}, author = {Schafzahl, Lukas and Ehmann, Heike and Kriechbaum, Manfred and Sattelkow, Jürgen and Ganner, Thomas and Plank, Harald and Wilkening, Martin and Freunberger, Stefan Alexander}, issn = {1520-5002}, journal = {Chemistry of Materials}, number = {10}, pages = {3338--3345}, publisher = {ACS}, title = {{Long-chain Li and Na alkyl carbonates as solid electrolyte interphase components: Structure, ion transport, and mechanical properties}}, doi = {10.1021/acs.chemmater.8b00750}, volume = {30}, year = {2018}, } @inproceedings{7407, abstract = {Proofs of space (PoS) [Dziembowski et al., CRYPTO'15] are proof systems where a prover can convince a verifier that he "wastes" disk space. PoS were introduced as a more ecological and economical replacement for proofs of work which are currently used to secure blockchains like Bitcoin. In this work we investigate extensions of PoS which allow the prover to embed useful data into the dedicated space, which later can be recovered. Our first contribution is a security proof for the original PoS from CRYPTO'15 in the random oracle model (the original proof only applied to a restricted class of adversaries which can store a subset of the data an honest prover would store). When this PoS is instantiated with recent constructions of maximally depth robust graphs, our proof implies basically optimal security. As a second contribution we show three different extensions of this PoS where useful data can be embedded into the space required by the prover. Our security proof for the PoS extends (non-trivially) to these constructions. We discuss how some of these variants can be used as proofs of catalytic space (PoCS), a notion we put forward in this work, and which basically is a PoS where most of the space required by the prover can be used to backup useful data. Finally we discuss how one of the extensions is a candidate construction for a proof of replication (PoR), a proof system recently suggested in the Filecoin whitepaper. }, author = {Pietrzak, Krzysztof Z}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, isbn = {978-3-95977-095-8}, issn = {1868-8969}, location = {San Diego, CA, United States}, pages = {59:1--59:25}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Proofs of catalytic space}}, doi = {10.4230/LIPICS.ITCS.2019.59}, volume = {124}, year = {2018}, } @article{7458, abstract = {The coupling between magnetic and electric subsystems in composites of ferromagnetic and ferroelectric phases is a product property that is facilitated by mechanical strain that arises due to magnetostriction and the piezoelectric effect in the constituent phases. Such multiferroic composites are of immense interests for studies on the physics of electromagnetic coupling and for use in a variety of applications. Here, we focus on magneto-electric (ME) coupling in nanocomposites. Particular emphasis is on core-shell particles and coaxial fibers, thin film heterostructures, and planar structures with a variety of mechanical connectivity. A brief review of models that predict strong ME effects in nanostructures is followed by synthesis and characterization. Core-shell particulate composites can be prepared by hydrothermal processes and chemical or deoxyribonucleic acid-assisted assembly. Electrospinning techniques have been utilized to prepare defect free core-shell nanofibers. Core-shell particles and fibers can be assembled into superstructures with the aid of magnetic and electric fields and characterized for possible use in advanced technologies. Chemical-vapor deposition techniques have been shown to be effective for the preparation of heterostructures of ferrites and ferroelectrics. Exotic planar multiferroic structures with potential for enhancing ME coupling strengths are also considered. Scanning probe microscopy techniques are ideal for probing the nature of direct- and converse-ME coupling in individual nanostructures. Magnetoelectric characterization of assemblies of nanocomposites can be done by ME voltage coefficient, magnetic field induced polarization, and magneto-dielectric effects. We conclude with a brief discussion on possible avenues for strengthening the product properties in the nanocomposites.}, author = {Viehland, Dwight and Li, Jie Fang and Yang, Yaodong and Costanzo, Tommaso and Yourdkhani, Amin and Caruntu, Gabriel and Zhou, Peng and Zhang, Tianjin and Li, Tianqian and Gupta, Arunava and Popov, Maksym and Srinivasan, Gopalan}, issn = {0021-8979}, journal = {Journal of Applied Physics}, number = {6}, publisher = {AIP}, title = {{Tutorial: Product properties in multiferroic nanocomposites}}, doi = {10.1063/1.5038726}, volume = {124}, year = {2018}, } @article{7717, abstract = {Background: DNA methylation levels change along with age, but few studies have examined the variation in the rate of such changes between individuals. Methods: We performed a longitudinal analysis to quantify the variation in the rate of change of DNA methylation between individuals using whole blood DNA methylation array profiles collected at 2–4 time points (N = 2894) in 954 individuals (67–90 years). Results: After stringent quality control, we identified 1507 DNA methylation CpG sites (rsCpGs) with statistically significant variation in the rate of change (random slope) of DNA methylation among individuals in a mixed linear model analysis. Genes in the vicinity of these rsCpGs were found to be enriched in Homeobox transcription factors and the Wnt signalling pathway, both of which are related to ageing processes. Furthermore, we investigated the SNP effect on the random slope. We found that 4 out of 1507 rsCpGs had one significant (P < 5 × 10−8/1507) SNP effect and 343 rsCpGs had at least one SNP effect (436 SNP-probe pairs) reaching genome-wide significance (P < 5 × 10−8). Ninety-five percent of the significant (P < 5 × 10−8) SNPs are on different chromosomes from their corresponding probes. Conclusions: We identified CpG sites that have variability in the rate of change of DNA methylation between individuals, and our results suggest a genetic basis of this variation. Genes around these CpG sites have been reported to be involved in the ageing process.}, author = {Zhang, Qian and Marioni, Riccardo E and Robinson, Matthew Richard and Higham, Jon and Sproul, Duncan and Wray, Naomi R and Deary, Ian J and McRae, Allan F and Visscher, Peter M}, issn = {1756-994X}, journal = {Genome Medicine}, number = {1}, publisher = {Springer Nature}, title = {{Genotype effects contribute to variation in longitudinal methylome patterns in older people}}, doi = {10.1186/s13073-018-0585-7}, volume = {10}, year = {2018}, } @article{7718, abstract = {Flores Island, Indonesia, was inhabited by the small-bodied hominin species Homo floresiensis, which has an unknown evolutionary relationship to modern humans. This island is also home to an extant human pygmy population. Here we describe genome-scale single-nucleotide polymorphism data and whole-genome sequences from a contemporary human pygmy population living on Flores near the cave where H. floresiensis was found. The genomes of Flores pygmies reveal a complex history of admixture with Denisovans and Neanderthals but no evidence for gene flow with other archaic hominins. Modern individuals bear the signatures of recent positive selection encompassing the FADS (fatty acid desaturase) gene cluster, likely related to diet, and polygenic selection acting on standing variation that contributed to their short-stature phenotype. Thus, multiple independent instances of hominin insular dwarfism occurred on Flores.}, author = {Tucci, Serena and Vohr, Samuel H. and McCoy, Rajiv C. and Vernot, Benjamin and Robinson, Matthew Richard and Barbieri, Chiara and Nelson, Brad J. and Fu, Wenqing and Purnomo, Gludhug A. and Sudoyo, Herawati and Eichler, Evan E. and Barbujani, Guido and Visscher, Peter M. and Akey, Joshua M. and Green, Richard E.}, issn = {0036-8075}, journal = {Science}, number = {6401}, pages = {511--516}, publisher = {American Association for the Advancement of Science}, title = {{Evolutionary history and adaptation of a human pygmy population of Flores Island, Indonesia}}, doi = {10.1126/science.aar8486}, volume = {361}, year = {2018}, } @article{7712, abstract = {Male pattern baldness (MPB) is a sex-limited, age-related, complex trait. We study MPB genetics in 205,327 European males from the UK Biobank. Here we show that MPB is strongly heritable and polygenic, with pedigree-heritability of 0.62 (SE = 0.03) estimated from close relatives, and SNP-heritability of 0.39 (SE = 0.01) from conventionally-unrelated males. We detect 624 near-independent genome-wide loci, contributing SNP-heritability of 0.25 (SE = 0.01), of which 26 X-chromosome loci explain 11.6%. Autosomal genetic variance is enriched for common variants and regions of lower linkage disequilibrium. We identify plausible genetic correlations between MPB and multiple sex-limited markers of earlier puberty, increased bone mineral density (rg = 0.15) and pancreatic β-cell function (rg = 0.12). Correlations with reproductive traits imply an effect on fitness, consistent with an estimated linear selection gradient of -0.018 per MPB standard deviation. Overall, we provide genetic insights into MPB: a phenotype of interest in its own right, with value as a model sex-limited, complex trait.}, author = {Yap, Chloe X. and Sidorenko, Julia and Wu, Yang and Kemper, Kathryn E. and Yang, Jian and Wray, Naomi R. and Robinson, Matthew Richard and Visscher, Peter M.}, issn = {2041-1723}, journal = {Nature Communications}, publisher = {Springer Nature}, title = {{Dissection of genetic variation and evidence for pleiotropy in male pattern baldness}}, doi = {10.1038/s41467-018-07862-y}, volume = {9}, year = {2018}, } @article{7716, abstract = {Genomic prediction has the potential to contribute to precision medicine. However, to date, the utility of such predictors is limited due to low accuracy for most traits. Here theory and simulation study are used to demonstrate that widespread pleiotropy among phenotypes can be utilised to improve genomic risk prediction. We show how a genetic predictor can be created as a weighted index that combines published genome-wide association study (GWAS) summary statistics across many different traits. We apply this framework to predict risk of schizophrenia and bipolar disorder in the Psychiatric Genomics consortium data, finding substantial heterogeneity in prediction accuracy increases across cohorts. For six additional phenotypes in the UK Biobank data, we find increases in prediction accuracy ranging from 0.7% for height to 47% for type 2 diabetes, when using a multi-trait predictor that combines published summary statistics from multiple traits, as compared to a predictor based only on one trait.}, author = {Maier, Robert M. and Zhu, Zhihong and Lee, Sang Hong and Trzaskowski, Maciej and Ruderfer, Douglas M. and Stahl, Eli A. and Ripke, Stephan and Wray, Naomi R. and Yang, Jian and Visscher, Peter M. and Robinson, Matthew Richard}, issn = {2041-1723}, journal = {Nature Communications}, publisher = {Springer Nature}, title = {{Improving genetic prediction by leveraging genetic correlations among human diseases and traits}}, doi = {10.1038/s41467-017-02769-6}, volume = {9}, year = {2018}, } @article{7715, abstract = {Preference for mates with similar phenotypes; that is, assortative mating, is widely observed in humans1,2,3,4,5 and has evolutionary consequences6,7,8. Under Fisher's classical theory6, assortative mating is predicted to induce a signature in the genome at trait-associated loci that can be detected and quantified. Here, we develop and apply a method to quantify assortative mating on a specific trait by estimating the correlation (θ) between genetic predictors of the trait from single nucleotide polymorphisms on odd- versus even-numbered chromosomes. We show by theory and simulation that the effect of assortative mating can be quantified in the presence of population stratification. We applied this approach to 32 complex traits and diseases using single nucleotide polymorphism data from ~400,000 unrelated individuals of European ancestry. We found significant evidence of assortative mating for height (θ = 3.2%) and educational attainment (θ = 2.7%), both of which were consistent with theoretical predictions. Overall, our results imply that assortative mating involves multiple traits and affects the genomic architecture of loci that are associated with these traits, and that the consequence of mate choice can be detected from a random sample of genomes.}, author = {Yengo, Loic and Robinson, Matthew Richard and Keller, Matthew C. and Kemper, Kathryn E. and Yang, Yuanhao and Trzaskowski, Maciej and Gratten, Jacob and Turley, Patrick and Cesarini, David and Benjamin, Daniel J. and Wray, Naomi R. and Goddard, Michael E. and Yang, Jian and Visscher, Peter M.}, issn = {2397-3374}, journal = {Nature Human Behaviour}, number = {12}, pages = {948--954}, publisher = {Springer Nature}, title = {{Imprint of assortative mating on the human genome}}, doi = {10.1038/s41562-018-0476-3}, volume = {2}, year = {2018}, } @article{7714, abstract = {Health risk factors such as body mass index (BMI) and serum cholesterol are associated with many common diseases. It often remains unclear whether the risk factors are cause or consequence of disease, or whether the associations are the result of confounding. We develop and apply a method (called GSMR) that performs a multi-SNP Mendelian randomization analysis using summary-level data from genome-wide association studies to test the causal associations of BMI, waist-to-hip ratio, serum cholesterols, blood pressures, height, and years of schooling (EduYears) with common diseases (sample sizes of up to 405,072). We identify a number of causal associations including a protective effect of LDL-cholesterol against type-2 diabetes (T2D) that might explain the side effects of statins on T2D, a protective effect of EduYears against Alzheimer’s disease, and bidirectional associations with opposite effects (e.g., higher BMI increases the risk of T2D but the effect of T2D on BMI is negative).}, author = {Zhu, Zhihong and Zheng, Zhili and Zhang, Futao and Wu, Yang and Trzaskowski, Maciej and Maier, Robert and Robinson, Matthew Richard and McGrath, John J. and Visscher, Peter M. and Wray, Naomi R. and Yang, Jian}, issn = {2041-1723}, journal = {Nature Communications}, publisher = {Springer Nature}, title = {{Causal associations between risk factors and common diseases inferred from GWAS summary data}}, doi = {10.1038/s41467-017-02317-2}, volume = {9}, year = {2018}, } @article{7713, abstract = {There are mean differences in complex traits among global human populations. We hypothesize that part of the phenotypic differentiation is due to natural selection. To address this hypothesis, we assess the differentiation in allele frequencies of trait-associated SNPs among African, Eastern Asian, and European populations for ten complex traits using data of large sample size (up to ~405,000). We show that SNPs associated with height (P=2.46×10−5), waist-to-hip ratio (P=2.77×10−4), and schizophrenia (P=3.96×10−5) are significantly more differentiated among populations than matched “control” SNPs, suggesting that these trait-associated SNPs have undergone natural selection. We further find that SNPs associated with height (P=2.01×10−6) and schizophrenia (P=5.16×10−18) show significantly higher variance in linkage disequilibrium (LD) scores across populations than control SNPs. Our results support the hypothesis that natural selection has shaped the genetic differentiation of complex traits, such as height and schizophrenia, among worldwide populations.}, author = {Guo, Jing and Wu, Yang and Zhu, Zhihong and Zheng, Zhili and Trzaskowski, Maciej and Zeng, Jian and Robinson, Matthew Richard and Visscher, Peter M. and Yang, Jian}, issn = {2041-1723}, journal = {Nature Communications}, publisher = {Springer Nature}, title = {{Global genetic differentiation of complex traits shaped by natural selection in humans}}, doi = {10.1038/s41467-018-04191-y}, volume = {9}, year = {2018}, } @article{7721, abstract = {The availability of genome-wide genetic data on hundreds of thousands of people has led to an equally rapid growth in methodologies available to analyse these data. While the motivation for undertaking genome-wide association studies (GWAS) is identification of genetic markers associated with complex traits, once generated these data can be used for many other analyses. GWAS have demonstrated that complex traits exhibit a highly polygenic genetic architecture, often with shared genetic risk factors across traits. New methods to analyse data from GWAS are increasingly being used to address a diverse set of questions about the aetiology of complex traits and diseases, including psychiatric disorders. Here, we give an overview of some of these methods and present examples of how they have contributed to our understanding of psychiatric disorders. We consider: (i) estimation of the extent of genetic influence on traits, (ii) uncovering of shared genetic control between traits, (iii) predictions of genetic risk for individuals, (iv) uncovering of causal relationships between traits, (v) identifying causal single-nucleotide polymorphisms and genes or (vi) the detection of genetic heterogeneity. This classification helps organise the large number of recently developed methods, although some could be placed in more than one category. While some methods require GWAS data on individual people, others simply use GWAS summary statistics data, allowing novel well-powered analyses to be conducted at a low computational burden.}, author = {Maier, R. M. and Visscher, P. M. and Robinson, Matthew Richard and Wray, N. R.}, issn = {0033-2917}, journal = {Psychological Medicine}, number = {7}, pages = {1055--1067}, publisher = {Cambridge University Press}, title = {{Embracing polygenicity: A review of methods and tools for psychiatric genetics research}}, doi = {10.1017/s0033291717002318}, volume = {48}, year = {2018}, }