TY - JOUR AB - The coupling between Ca2+ channels and release sensors is a key factor defining the signaling properties of a synapse. However, the coupling nanotopography at many synapses remains unknown, and it is unclear how it changes during development. To address these questions, we examined coupling at the cerebellar inhibitory basket cell (BC)-Purkinje cell (PC) synapse. Biophysical analysis of transmission by paired recording and intracellular pipette perfusion revealed that the effects of exogenous Ca2+ chelators decreased during development, despite constant reliance of release on P/Q-type Ca2+ channels. Structural analysis by freeze-fracture replica labeling (FRL) and transmission electron microscopy (EM) indicated that presynaptic P/Q-type Ca2+ channels formed nanoclusters throughout development, whereas docked vesicles were only clustered at later developmental stages. Modeling suggested a developmental transformation from a more random to a more clustered coupling nanotopography. Thus, presynaptic signaling developmentally approaches a point-to-point configuration, optimizing speed, reliability, and energy efficiency of synaptic transmission. AU - Chen, JingJing AU - Kaufmann, Walter AU - Chen, Chong AU - Arai, Itaru AU - Kim, Olena AU - Shigemoto, Ryuichi AU - Jonas, Peter M ID - 14843 JF - Neuron SN - 0896-6273 TI - Developmental transformation of Ca2+ channel-vesicle nanotopography at a central GABAergic synapse ER - TY - THES AU - Chen, JingJing ID - 15101 SN - 2663 - 337X TI - Developmental transformation of nanodomain coupling between Ca2+ channels and release sensors at a central GABAergic synapse ER - TY - JOUR AB - Quantum computers are increasing in size and quality but are still very noisy. Error mitigation extends the size of the quantum circuits that noisy devices can meaningfully execute. However, state-of-the-art error mitigation methods are hard to implement and the limited qubit connectivity in superconducting qubit devices restricts most applications to the hardware's native topology. Here we show a quantum approximate optimization algorithm (QAOA) on nonplanar random regular graphs with up to 40 nodes enabled by a machine learning-based error mitigation. We use a swap network with careful decision-variable-to-qubit mapping and a feed-forward neural network to optimize a depth-two QAOA on up to 40 qubits. We observe a meaningful parameter optimization for the largest graph which requires running quantum circuits with 958 two-qubit gates. Our paper emphasizes the need to mitigate samples, and not only expectation values, in quantum approximate optimization. These results are a step towards executing quantum approximate optimization at a scale that is not classically simulable. Reaching such system sizes is key to properly understanding the true potential of heuristic algorithms like QAOA. AU - Sack, Stefan AU - Egger, Daniel J. ID - 15122 IS - 1 JF - Physical Review Research SN - 2643-1564 TI - Large-scale quantum approximate optimization on nonplanar graphs with machine learning noise mitigation VL - 6 ER - TY - JOUR AB - Cell division in all domains of life requires the orchestration of many proteins, but in Archaea most of the machinery remains poorly characterized. Here we investigate the FtsZ-based cell division mechanism in Haloferax volcanii and find proteins containing photosynthetic reaction centre (PRC) barrel domains that play an essential role in archaeal cell division. We rename these proteins cell division protein B 1 (CdpB1) and CdpB2. Depletions and deletions in their respective genes cause severe cell division defects, generating drastically enlarged cells. Fluorescence microscopy of tagged FtsZ1, FtsZ2 and SepF in CdpB1 and CdpB2 mutant strains revealed an unusually disordered divisome that is not organized into a distinct ring-like structure. Biochemical analysis shows that SepF forms a tripartite complex with CdpB1/2 and crystal structures suggest that these two proteins might form filaments, possibly aligning SepF and the FtsZ2 ring during cell division. Overall our results indicate that PRC-domain proteins play essential roles in FtsZ-based cell division in Archaea. AU - Nußbaum, Phillip AU - Kureisaite-Ciziene, Danguole AU - Bellini, Dom AU - Van Der Does, Chris AU - Kojic, Marko AU - Taib, Najwa AU - Yeates, Anna AU - Tourte, Maxime AU - Gribaldo, Simonetta AU - Loose, Martin AU - Löwe, Jan AU - Albers, Sonja Verena ID - 15118 IS - 3 JF - Nature Microbiology TI - Proteins containing photosynthetic reaction centre domains modulate FtsZ-based archaeal cell division VL - 9 ER - TY - JOUR AB - In this paper we consider an SPDE where the leading term is a second order operator with periodic boundary conditions, coefficients which are measurable in (t,ω) , and Hölder continuous in space. Assuming stochastic parabolicity conditions, we prove Lp((0,T)×Ω,tκdt;Hσ,q(Td)) -estimates. The main novelty is that we do not require p=q . Moreover, we allow arbitrary σ∈R and weights in time. Such mixed regularity estimates play a crucial role in applications to nonlinear SPDEs which is clear from our previous work. To prove our main results we develop a general perturbation theory for SPDEs. Moreover, we prove a new result on pointwise multiplication in spaces with fractional smoothness. AU - Agresti, Antonio AU - Veraar, Mark ID - 15119 IS - 1 JF - Annales de l'institut Henri Poincare Probability and Statistics SN - 0246-0203 TI - Stochastic maximal Lp(Lq)-regularity for second order systems with periodic boundary conditions VL - 60 ER - TY - JOUR AB - Entire chromosomes are typically only transmitted vertically from one generation to the next. The horizontal transfer of such chromosomes has long been considered improbable, yet gained recent support in several pathogenic fungi where it may affect the fitness or host specificity. To date, it is unknown how these transfers occur, how common they are and whether they can occur between different species. In this study, we show multiple independent instances of horizontal transfers of the same accessory chromosome between two distinct strains of the asexual entomopathogenic fungusMetarhizium robertsiiduring experimental co-infection of its insect host, the Argentine ant. Notably, only the one chromosome – but no other – was transferred from the donor to the recipient strain. The recipient strain, now harboring the accessory chromosome, exhibited a competitive advantage under certain host conditions. By phylogenetic analysis we further demonstrate that the same accessory chromosome was horizontally transferred in a natural environment betweenM. robertsiiand another congeneric insect pathogen,M. guizhouense. Hence horizontal chromosome transfer is not limited to the observed frequent events within species during experimental infections but also occurs naturally across species. The transferred accessory chromosome contains genes that might be involved in its preferential horizontal transfer, encoding putative histones and histone-modifying enzymes, but also putative virulence factors that may support its establishment. Our study reveals that both intra- and interspecies horizontal transfer of entire chromosomes is more frequent than previously assumed, likely representing a not uncommon mechanism for gene exchange.Significance StatementThe enormous success of bacterial pathogens has been attributed to their ability to exchange genetic material between one another. Similarly, in eukaryotes, horizontal transfer of genetic material allowed the spread of virulence factors across species. The horizontal transfer of whole chromosomes could be an important pathway for such exchange of genetic material, but little is known about the origin of transferable chromosomes and how frequently they are exchanged. Here, we show that the transfer of accessory chromosomes - chromosomes that are non-essential but may provide fitness benefits - is common during fungal co-infections and is even possible between distant pathogenic species, highlighting the importance of horizontal gene transfer via chromosome transfer also for the evolution and function of eukaryotic pathogens. AU - Habig, Michael AU - Grasse, Anna V AU - Müller, Judith AU - Stukenbrock, Eva H. AU - Leitner, Hanna AU - Cremer, Sylvia ID - 14478 IS - 11 JF - Proceedings of the National Academy of Sciences of the United States of America SN - 0027-8424 TI - Frequent horizontal chromosome transfer between asexual fungal insect pathogens VL - 121 ER - TY - JOUR AB - Given a fixed finite metric space (V,μ), the {\em minimum 0-extension problem}, denoted as 0-Ext[μ], is equivalent to the following optimization problem: minimize function of the form minx∈Vn∑ifi(xi)+∑ijcijμ(xi,xj) where cij,cvi are given nonnegative costs and fi:V→R are functions given by fi(xi)=∑v∈Vcviμ(xi,v). The computational complexity of 0-Ext[μ] has been recently established by Karzanov and by Hirai: if metric μ is {\em orientable modular} then 0-Ext[μ] can be solved in polynomial time, otherwise 0-Ext[μ] is NP-hard. To prove the tractability part, Hirai developed a theory of discrete convex functions on orientable modular graphs generalizing several known classes of functions in discrete convex analysis, such as L♮-convex functions. We consider a more general version of the problem in which unary functions fi(xi) can additionally have terms of the form cuv;iμ(xi,{u,v}) for {u,v}∈F, where set F⊆(V2) is fixed. We extend the complexity classification above by providing an explicit condition on (μ,F) for the problem to be tractable. In order to prove the tractability part, we generalize Hirai's theory and define a larger class of discrete convex functions. It covers, in particular, another well-known class of functions, namely submodular functions on an integer lattice. Finally, we improve the complexity of Hirai's algorithm for solving 0-Ext on orientable modular graphs. AU - Dvorak, Martin AU - Kolmogorov, Vladimir ID - 10045 JF - Mathematical Programming KW - minimum 0-extension problem KW - metric labeling problem KW - discrete metric spaces KW - metric extensions KW - computational complexity KW - valued constraint satisfaction problems KW - discrete convex analysis KW - L-convex functions SN - 0025-5610 TI - Generalized minimum 0-extension problem and discrete convexity ER - TY - JOUR AB - We present an auction algorithm using multiplicative instead of constant weight updates to compute a (1-E)-approximate maximum weight matching (MWM) in a bipartite graph with n vertices and m edges in time 0(mE-1), beating the running time of the fastest known approximation algorithm of Duan and Pettie [JACM ’14] that runs in 0(mE-1 log E-1). Our algorithm is very simple and it can be extended to give a dynamic data structure that maintains a (1-E)-approximate maximum weight matching under (1) one-sided vertex deletions (with incident edges) and (2) one-sided vertex insertions (with incident edges sorted by weight) to the other side. The total time time used is 0(mE-1), where m is the sum of the number of initially existing and inserted edges. AU - Zheng, Da Wei AU - Henzinger, Monika H ID - 15121 JF - Mathematical Programming SN - 0025-5610 TI - Multiplicative auction algorithm for approximate maximum weight bipartite matching ER - TY - JOUR AB - As a key liquid organic hydrogen carrier, investigating the decomposition of formic acid (HCOOH) on the Pd (1 1 1) transition metal surface is imperative for harnessing hydrogen energy. Despite a multitude of studies, the major mechanisms and key intermediates involved in the dehydrogenation process of formic acid remain a great topic of debate due to ambiguous adsorbate interactions. In this research, we develop an advanced microkinetic model based on first-principles calculations, accounting for adsorbate–adsorbate interactions. Our study unveils a comprehensive mechanism for the Pd (1 1 1) surface, highlighting the significance of coverage effects in formic acid dehydrogenation. Our findings unequivocally demonstrate that H coverage on the Pd (1 1 1) surface renders formic acid more susceptible to decompose into H2 and CO2 through COOH intermediates. Consistent with experimental results, the selectivity of H2 in the decomposition of formic acid on the Pd (1 1 1) surface approaches 100 %. Considering the influence of H coverage, our kinetic analysis aligns perfectly with experimental values at a temperature of 373 K. AU - Yao, Zihao AU - Liu, Xu AU - Bunting, Rhys AU - Wang, Jianguo ID - 15114 JF - Chemical Engineering Science SN - 0009-2509 TI - Unravelling the reaction mechanism for H2 production via formic acid decomposition over Pd: Coverage-dependent microkinetic modeling VL - 291 ER - TY - JOUR AB - Water is known to play an important role in collagen self-assembly, but it is still largely unclear how water–collagen interactions influence the assembly process and determine the fibril network properties. Here, we use the H2O/D2O isotope effect on the hydrogen-bond strength in water to investigate the role of hydration in collagen self-assembly. We dissolve collagen in H2O and D2O and compare the growth kinetics and the structure of the collagen assemblies formed in these water isotopomers. Surprisingly, collagen assembly occurs ten times faster in D2O than in H2O, and collagen in D2O self-assembles into much thinner fibrils, that form a more inhomogeneous and softer network, with a fourfold reduction in elastic modulus when compared to H2O. Combining spectroscopic measurements with atomistic simulations, we show that collagen in D2O is less hydrated than in H2O. This partial dehydration lowers the enthalpic penalty for water removal and reorganization at the collagen–water interface, increasing the self-assembly rate and the number of nucleation centers, leading to thinner fibrils and a softer network. Coarse-grained simulations show that the acceleration in the initial nucleation rate can be reproduced by the enhancement of electrostatic interactions. These results show that water acts as a mediator between collagen monomers, by modulating their interactions so as to optimize the assembly process and, thus, the final network properties. We believe that isotopically modulating the hydration of proteins can be a valuable method to investigate the role of water in protein structural dynamics and protein self-assembly. AU - Giubertoni, Giulia AU - Feng, Liru AU - Klein, Kevin AU - Giannetti, Guido AU - Rutten, Luco AU - Choi, Yeji AU - Van Der Net, Anouk AU - Castro-Linares, Gerard AU - Caporaletti, Federico AU - Micha, Dimitra AU - Hunger, Johannes AU - Deblais, Antoine AU - Bonn, Daniel AU - Sommerdijk, Nico AU - Šarić, Anđela AU - Ilie, Ioana M. AU - Koenderink, Gijsje H. AU - Woutersen, Sander ID - 15116 IS - 11 JF - Proceedings of the National Academy of Sciences of the United States of America SN - 0027-8424 TI - Elucidating the role of water in collagen self-assembly by isotopically modulating collagen hydration VL - 121 ER - TY - JOUR AB - The hippocampal mossy fiber synapse, formed between axons of dentate gyrus granule cells and dendrites of CA3 pyramidal neurons, is a key synapse in the trisynaptic circuitry of the hippocampus. Because of its comparatively large size, this synapse is accessible to direct presynaptic recording, allowing a rigorous investigation of the biophysical mechanisms of synaptic transmission and plasticity. Furthermore, because of its placement in the very center of the hippocampal memory circuit, this synapse seems to be critically involved in several higher network functions, such as learning, memory, pattern separation, and pattern completion. Recent work based on new technologies in both nanoanatomy and nanophysiology, including presynaptic patch-clamp recording, paired recording, super-resolution light microscopy, and freeze-fracture and “flash-and-freeze” electron microscopy, has provided new insights into the structure, biophysics, and network function of this intriguing synapse. This brings us one step closer to answering a fundamental question in neuroscience: how basic synaptic properties shape higher network computations. AU - Vandael, David H AU - Jonas, Peter M ID - 15117 IS - 6687 JF - Science TI - Structure, biophysics, and circuit function of a "giant" cortical presynaptic terminal VL - 383 ER - TY - THES AB - Point sets, geometric networks, and arrangements of hyperplanes are fundamental objects in discrete geometry that have captivated mathematicians for centuries, if not millennia. This thesis seeks to cast new light on these structures by illustrating specific instances where a topological perspective, specifically through discrete Morse theory and persistent homology, provides valuable insights. At first glance, the topology of these geometric objects might seem uneventful: point sets essentially lack of topology, arrangements of hyperplanes are a decomposition of Rd, which is a contractible space, and the topology of a network primarily involves the enumeration of connected components and cycles within the network. However, beneath this apparent simplicity, there lies an array of intriguing structures, a small subset of which will be uncovered in this thesis. Focused on three case studies, each addressing one of the mentioned objects, this work will showcase connections that intertwine topology with diverse fields such as combinatorial geometry, algorithms and data structures, and emerging applications like spatial biology. AU - Cultrera di Montesano, Sebastiano ID - 15094 SN - 2663 - 337X TI - Persistence and Morse theory for discrete geometric structures ER - TY - CONF AB - We present a dynamic data structure for maintaining the persistent homology of a time series of real numbers. The data structure supports local operations, including the insertion and deletion of an item and the cutting and concatenating of lists, each in time O(log n + k), in which n counts the critical items and k the changes in the augmented persistence diagram. To achieve this, we design a tailor-made tree structure with an unconventional representation, referred to as banana tree, which may be useful in its own right. AU - Cultrera di Montesano, Sebastiano AU - Edelsbrunner, Herbert AU - Henzinger, Monika H AU - Ost, Lara ED - Woodruff, David P. ID - 15093 T2 - Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) TI - Dynamically maintaining the persistent homology of time series ER - TY - GEN AB - Motivated by applications in the medical sciences, we study finite chromatic sets in Euclidean space from a topological perspective. Based on the persistent homology for images, kernels and cokernels, we design provably stable homological quantifiers that describe the geometric micro- and macro-structure of how the color classes mingle. These can be efficiently computed using chromatic variants of Delaunay and alpha complexes, and code that does these computations is provided. AU - Cultrera di Montesano, Sebastiano AU - Draganov, Ondrej AU - Edelsbrunner, Herbert AU - Saghafian, Morteza ID - 15091 T2 - arXiv TI - Chromatic alpha complexes ER - TY - JOUR AB - The brain’s functionality is developed and maintained through synaptic plasticity. As synapses undergo plasticity, they also affect each other. The nature of such ‘co-dependency’ is difficult to disentangle experimentally, because multiple synapses must be monitored simultaneously. To help understand the experimentally observed phenomena, we introduce a framework that formalizes synaptic co-dependency between different connection types. The resulting model explains how inhibition can gate excitatory plasticity while neighboring excitatory–excitatory interactions determine the strength of long-term potentiation. Furthermore, we show how the interplay between excitatory and inhibitory synapses can account for the quick rise and long-term stability of a variety of synaptic weight profiles, such as orientation tuning and dendritic clustering of co-active synapses. In recurrent neuronal networks, co-dependent plasticity produces rich and stable motor cortex-like dynamics with high input sensitivity. Our results suggest an essential role for the neighborly synaptic interaction during learning, connecting micro-level physiology with network-wide phenomena. AU - Agnes, Everton J. AU - Vogels, Tim P ID - 15171 JF - Nature Neuroscience SN - 1097-6256 TI - Co-dependent excitatory and inhibitory plasticity accounts for quick, stable and long-lasting memories in biological networks ER - TY - JOUR AB - We propose a novel approach to concentration for non-independent random variables. The main idea is to “pretend” that the random variables are independent and pay a multiplicative price measuring how far they are from actually being independent. This price is encapsulated in the Hellinger integral between the joint and the product of the marginals, which is then upper bounded leveraging tensorisation properties. Our bounds represent a natural generalisation of concentration inequalities in the presence of dependence: we recover exactly the classical bounds (McDiarmid’s inequality) when the random variables are independent. Furthermore, in a “large deviations” regime, we obtain the same decay in the probability as for the independent case, even when the random variables display non-trivial dependencies. To show this, we consider a number of applications of interest. First, we provide a bound for Markov chains with finite state space. Then, we consider the Simple Symmetric Random Walk, which is a non-contracting Markov chain, and a non-Markovian setting in which the stochastic process depends on its entire past. To conclude, we propose an application to Markov Chain Monte Carlo methods, where our approach leads to an improved lower bound on the minimum burn-in period required to reach a certain accuracy. In all of these settings, we provide a regime of parameters in which our bound fares better than what the state of the art can provide. AU - Esposito, Amedeo Roberto AU - Mondelli, Marco ID - 15172 JF - IEEE Transactions on Information Theory SN - 0018-9448 TI - Concentration without independence via information measures ER - TY - JOUR AB - The James Webb Space Telescope is revealing a new population of dust-reddened broad-line active galactic nuclei (AGN) at redshifts z ≳ 5. Here we present deep NIRSpec/Prism spectroscopy from the Cycle 1 Treasury program Ultradeep NIRSpec and NIRCam ObserVations before the Epoch of Reionization (UNCOVER) of 15 AGN candidates selected to be compact, with red continua in the rest-frame optical but with blue slopes in the UV. From NIRCam photometry alone, they could have been dominated by dusty star formation or an AGN. Here we show that the majority of the compact red sources in UNCOVER are dust-reddened AGN: 60% show definitive evidence for broad-line Hα with a FWHM > 2000 km s −1, 20% of the current data are inconclusive, and 20% are brown dwarf stars. We propose an updated photometric criterion to select red z > 5 AGN that excludes brown dwarfs and is expected to yield >80% AGN. Remarkably, among all zphot > 5 galaxies with F277W – F444W > 1 in UNCOVER at least 33% are AGN regardless of compactness, climbing to at least 80% AGN for sources with F277W – F444W > 1.6. The confirmed AGN have black hole masses of 107–109M⊙. While their UV luminosities (−16 > MUV > −20 AB mag) are low compared to UV-selected AGN at these epochs, consistent with percent-level scattered AGN light or low levels of unobscured star formation, the inferred bolometric luminosities are typical of 107–109M⊙ black holes radiating at ∼10%–40% the Eddington limit. The number densities are surprisingly high at ∼10−5 Mpc−3 mag−1, 100 times more common than the faintest UV-selected quasars, while accounting for ∼1% of the UV-selected galaxies. While their UV faintness suggests they may not contribute strongly to reionization, their ubiquity poses challenges to models of black hole growth. AU - Greene, Jenny E. AU - Labbe, Ivo AU - Goulding, Andy D. AU - Furtak, Lukas J. AU - Chemerynska, Iryna AU - Kokorev, Vasily AU - Dayal, Pratika AU - Volonteri, Marta AU - Williams, Christina C. AU - Wang, Bingjie AU - Setton, David J. AU - Burgasser, Adam J. AU - Bezanson, Rachel AU - Atek, Hakim AU - Brammer, Gabriel AU - Cutler, Sam E. AU - Feldmann, Robert AU - Fujimoto, Seiji AU - Glazebrook, Karl AU - De Graaff, Anna AU - Khullar, Gourav AU - Leja, Joel AU - Marchesini, Danilo AU - Maseda, Michael V. AU - Matthee, Jorryt J AU - Miller, Tim B. AU - Naidu, Rohan P. AU - Nanayakkara, Themiya AU - Oesch, Pascal A. AU - Pan, Richard AU - Papovich, Casey AU - Price, Sedona H. AU - Van Dokkum, Pieter AU - Weaver, John R. AU - Whitaker, Katherine E. AU - Zitrin, Adi ID - 15170 JF - Astrophysical Journal SN - 0004-637X TI - UNCOVER spectroscopy confirms the surprising ubiquity of active galactic nuclei in red sources at z > 5 VL - 964 ER - TY - CONF AB - A linearly ordered (LO) k-colouring of a hypergraph is a colouring of its vertices with colours 1, … , k such that each edge contains a unique maximal colour. Deciding whether an input hypergraph admits LO k-colouring with a fixed number of colours is NP-complete (and in the special case of graphs, LO colouring coincides with the usual graph colouring). Here, we investigate the complexity of approximating the "linearly ordered chromatic number" of a hypergraph. We prove that the following promise problem is NP-complete: Given a 3-uniform hypergraph, distinguish between the case that it is LO 3-colourable, and the case that it is not even LO 4-colourable. We prove this result by a combination of algebraic, topological, and combinatorial methods, building on and extending a topological approach for studying approximate graph colouring introduced by Krokhin, Opršal, Wrochna, and Živný (2023). AU - Filakovský, Marek AU - Nakajima, Tamio Vesa AU - Opršal, Jakub AU - Tasinato, Gianluca AU - Wagner, Uli ID - 15168 SN - 9783959773119 T2 - 41st International Symposium on Theoretical Aspects of Computer Science TI - Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs VL - 289 ER - TY - JOUR AB - Primary implant stability, which refers to the stability of the implant during the initial healing period is a crucial factor in determining the long-term success of the implant and lays the foundation for secondary implant stability achieved through osseointegration. Factors affecting primary stability include implant design, surgical technique, and patient-specific factors like bone quality and morphology. In vivo, the cyclic nature of anatomical loading puts osteosynthesis locking screws under dynamic loads, which can lead to the formation of micro cracks and defects that slowly degrade the mechanical connection between the bone and screw, thus compromising the initial stability and secondary stability of the implant. Monotonic quasi-static loading used for testing the holding capacity of implanted screws is not well suited to capture this behavior since it cannot capture the progressive deterioration of peri‑implant bone at small displacements. In order to address this issue, this study aims to determine a critical point of loss of primary implant stability in osteosynthesis locking screws under cyclic overloading by investigating the evolution of damage, dissipated energy, and permanent deformation. A custom-made test setup was used to test implanted 2.5 mm locking screws under cyclic overloading test. For each loading cycle, maximum forces and displacement were recorded as well as initial and final cycle displacements and used to calculate damage and energy dissipation evolution. The results of this study demonstrate that for axial, shear, and mixed loading significant damage and energy dissipation can be observed at approximately 20 % of the failure force. Additionally, at this load level, permanent deformations on the screw-bone interface were found to be in the range of 50 to 150 mm which promotes osseointegration and secondary implant stability. This research can assist surgeons in making informed preoperative decisions by providing a better understanding of the critical point of loss of primary implant stability, thus improving the long-term success of the implant and overall patient satisfaction. AU - Silva-Henao, Juan D. AU - Schober, Sophie AU - Pahr, Dieter H. AU - Reisinger, Andreas G. ID - 15164 JF - Medical Engineering and Physics SN - 1350-4533 TI - Critical loss of primary implant stability in osteosynthesis locking screws under cyclic overloading VL - 126 ER - TY - JOUR AB - Interpretation of extracellular recordings can be challenging due to the long range of electric field. This challenge can be mitigated by estimating the current source density (CSD). Here we introduce kCSD-python, an open Python package implementing Kernel Current Source Density (kCSD) method and related tools to facilitate CSD analysis of experimental data and the interpretation of results. We show how to counter the limitations imposed by noise and assumptions in the method itself. kCSD-python allows CSD estimation for an arbitrary distribution of electrodes in 1D, 2D, and 3D, assuming distributions of sources in tissue, a slice, or in a single cell, and includes a range of diagnostic aids. We demonstrate its features in a Jupyter Notebook tutorial which illustrates a typical analytical workflow and main functionalities useful in validating analysis results. AU - Chintaluri, Chaitanya AU - Bejtka, Marta AU - Sredniawa, Wladyslaw AU - Czerwinski, Michal AU - Dzik, Jakub M. AU - Jedrzejewska-Szmek, Joanna AU - Wojciki, Daniel K. ID - 15169 IS - 3 JF - PLoS Computational Biology SN - 1553-734X TI - kCSD-python, reliable current source density estimation with quality control VL - 20 ER - TY - JOUR AB - We perform a diagrammatic analysis of the energy of a mobile impurity immersed in a strongly interacting two-component Fermi gas to second order in the impurity-bath interaction. These corrections demonstrate divergent behavior in the limit of large impurity momentum. We show the fundamental processes responsible for these logarithmically divergent terms. We study the problem in the general case without any assumptions regarding the fermion-fermion interactions in the bath. We show that the divergent term can be summed up to all orders in the Fermi-Fermi interaction and that the resulting expression is equivalent to the one obtained in the few-body calculation. Finally, we provide a perturbative calculation to the second order in the Fermi-Fermi interaction, and we show the diagrams responsible for these terms. AU - Al Hyder, Ragheed AU - Chevy, F. AU - Leyronas, X. ID - 15167 IS - 3 JF - Physical Review A SN - 2469-9926 TI - Exploring beyond-mean-field logarithmic divergences in Fermi-polaron energy VL - 109 ER - TY - JOUR AB - For some k∈Z≥0∪{∞}, we call a linear forest k-bounded if each of its components has at most k edges. We will say a (k,ℓ)-bounded linear forest decomposition of a graph G is a partition of E(G) into the edge sets of two linear forests Fk,Fℓ where Fk is k-bounded and Fℓ is ℓ-bounded. We show that the problem of deciding whether a given graph has such a decomposition is NP-complete if both k and ℓ are at least 2, NP-complete if k≥9 and ℓ=1, and is in P for (k,ℓ)=(2,1). Before this, the only known NP-complete cases were the (2,2) and (3,3) cases. Our hardness result answers a question of Bermond et al. from 1984. We also show that planar graphs of girth at least nine decompose into a linear forest and a matching, which in particular is stronger than 3-edge-colouring such graphs. AU - Campbell, Rutger AU - Hörsch, Florian AU - Moore, Benjamin ID - 15163 IS - 6 JF - Discrete Mathematics SN - 0012-365X TI - Decompositions into two linear forests of bounded lengths VL - 347 ER - TY - JOUR AB - Characterizing the prevalence and properties of faint active galactic nuclei (AGNs) in the early Universe is key for understanding the formation of supermassive black holes (SMBHs) and determining their role in cosmic reionization. We perform a spectroscopic search for broad Hα emitters at z ≈ 4–6 using deep JWST/NIRCam imaging and wide field slitless spectroscopy from the EIGER and FRESCO surveys. We identify 20 Hα lines at z = 4.2–5.5 that have broad components with line widths from ∼1200–3700 km s−1, contributing ∼30%–90% of the total line flux. We interpret these broad components as being powered by accretion onto SMBHs with implied masses ∼107–8M⊙. In the UV luminosity range MUV,AGN+host = −21 to −18, we measure number densities of ≈10−5 cMpc−3. This is an order of magnitude higher than expected from extrapolating quasar UV luminosity functions (LFs). Yet, such AGN are found in only <1% of star-forming galaxies at z ∼ 5. The number density discrepancy is much lower when compared to the broad Hα LF. The SMBH mass function agrees with large cosmological simulations. In two objects, we detect complex Hα profiles that we tentatively interpret as caused by absorption signatures from dense gas fueling SMBH growth and outflows. We may be witnessing early AGN feedback that will clear dust-free pathways through which more massive blue quasars are seen. We uncover a strong correlation between reddening and the fraction of total galaxy luminosity arising from faint AGN. This implies that early SMBH growth is highly obscured and that faint AGN are only minor contributors to cosmic reionization. AU - Matthee, Jorryt J AU - Naidu, Rohan P. AU - Brammer, Gabriel AU - Chisholm, John AU - Eilers, Anna-Christina AU - Goulding, Andy AU - Greene, Jenny AU - Kashino, Daichi AU - Labbe, Ivo AU - Lilly, Simon J. AU - Mackenzie, Ruari AU - Oesch, Pascal A. AU - Weibel, Andrea AU - Wuyts, Stijn AU - Xiao, Mengyuan AU - Bordoloi, Rongmon AU - Bouwens, Rychard AU - van Dokkum, Pieter AU - Illingworth, Garth AU - Kramarenko, Ivan AU - Maseda, Michael V. AU - Mason, Charlotte AU - Meyer, Romain A. AU - Nelson, Erica J. AU - Reddy, Naveen A. AU - Shivaei, Irene AU - Simcoe, Robert A. AU - Yue, Minghao ID - 15180 IS - 2 JF - The Astrophysical Journal KW - Space and Planetary Science KW - Astronomy and Astrophysics SN - 0004-637X TI - Little Red Dots: An abundant population of faint active galactic nuclei at z ∼ 5 revealed by the EIGER and FRESCO JWST surveys VL - 963 ER - TY - JOUR AB - The fungal bioluminescence pathway can be reconstituted in other organisms allowing luminescence imaging without exogenously supplied substrate. The pathway starts from hispidin biosynthesis—a step catalyzed by a large fungal polyketide synthase that requires a posttranslational modification for activity. Here, we report identification of alternative compact hispidin synthases encoded by a phylogenetically diverse group of plants. A hybrid bioluminescence pathway that combines plant and fungal genes is more compact, not dependent on availability of machinery for posttranslational modifications, and confers autonomous bioluminescence in yeast, mammalian, and plant hosts. The compact size of plant hispidin synthases enables additional modes of delivery of autoluminescence, such as delivery with viral vectors. AU - Palkina, Kseniia A. AU - Karataeva, Tatiana A. AU - Perfilov, Maxim M. AU - Fakhranurova, Liliia I. AU - Markina, Nadezhda M. AU - Gonzalez Somermeyer, Louisa AU - Garcia-Perez, Elena AU - Vazquez-Vilar, Marta AU - Rodriguez-Rodriguez, Marta AU - Vazquez-Vilriales, Victor AU - Shakhova, Ekaterina S. AU - Mitiouchkina, Tatiana AU - Belozerova, Olga A. AU - Kovalchuk, Sergey I. AU - Alekberova, Anna AU - Malyshevskaia, Alena K. AU - Bugaeva, Evgenia N. AU - Guglya, Elena B. AU - Balakireva, Anastasia AU - Sytov, Nikita AU - Bezlikhotnova, Anastasia AU - Boldyreva, Daria I. AU - Babenko, Vladislav V. AU - Kondrashov, Fyodor AU - Choob, Vladimir V. AU - Orzaez, Diego AU - Yampolsky, Ilia V. AU - Mishin, Alexander S. AU - Sarkisyan, Karen S. ID - 15179 IS - 10 JF - Science Advances SN - 2375-2548 TI - A hybrid pathway for self-sustained luminescence VL - 10 ER - TY - JOUR AB - The elimination of rain evaporation in the planetary boundary layer (PBL) has been found to lead to convective self‐aggregation (CSA) even without radiative feedback, but the precise mechanisms underlying this phenomenon remain unclear. We conducted cloud‐resolving simulations with two domain sizes and progressively reduced rain evaporation in the PBL. Surprisingly, CSA only occurred when rain evaporation was almost completely removed. The additional convective heating resulting from the reduction of evaporative cooling in the moist patch was found to be the trigger, thereafter a dry subsidence intrusion into the PBL in the dry patch takes over and sets CSA in motion. Temperature and moisture anomalies oppose each other in their buoyancy effects, hence explaining the need for almost total rain evaporation removal. We also found radiative cooling and not cold pools to be the leading cause for the comparative ease of CSA to take place in the larger domain. AU - Hwong, Yi-Ling AU - Muller, Caroline J ID - 15186 IS - 6 JF - Geophysical Research Letters KW - General Earth and Planetary Sciences KW - Geophysics SN - 0094-8276 TI - The unreasonable efficiency of total rain evaporation removal in triggering convective self‐aggregation VL - 51 ER - TY - JOUR AB - We demonstrate the failure of the adiabatic Born-Oppenheimer approximation to describe the ground state of a quantum impurity within an ultracold Fermi gas despite substantial mass differences between the bath and impurity species. Increasing repulsion leads to the appearance of nonadiabatic couplings between the fast bath and slow impurity degrees of freedom, which reduce the parity symmetry of the latter according to the pseudo Jahn-Teller effect. The presence of this mechanism is associated to a conical intersection involving the impurity position and the inverse of the interaction strength, which acts as a synthetic dimension. We elucidate the presence of these effects via a detailed ground-state analysis involving the comparison of ab initio fully correlated simulations with effective models. Our study suggests ultracold atomic ensembles as potent emulators of complex molecular phenomena. AU - Becker, A. AU - Koutentakis, Georgios AU - Schmelcher, P. ID - 15181 IS - 1 JF - Physical Review Research SN - 2643-1564 TI - Synthetic dimension-induced pseudo Jahn-Teller effect in one-dimensional confined fermions VL - 6 ER - TY - JOUR AB - Thermoelectric materials convert heat into electricity, with a broad range of applications near room temperature (RT). However, the library of RT high-performance materials is limited. Traditional high-temperature synthetic methods constrain the range of materials achievable, hindering the ability to surpass crystal structure limitations and engineer defects. Here, a solution-based synthetic approach is introduced, enabling RT synthesis of powders and exploration of densification at lower temperatures to influence the material's microstructure. The approach is exemplified by Ag2Se, an n-type alternative to bismuth telluride. It is demonstrated that the concentration of Ag interstitials, grain boundaries, and dislocations are directly correlated to the sintering temperature, and achieve a figure of merit of 1.1 from RT to 100 °C after optimization. Moreover, insights into and resolve Ag2Se's challenges are provided, including stoichiometry issues leading to irreproducible performances. This work highlights the potential of RT solution synthesis in expanding the repertoire of high-performance thermoelectric materials for practical applications. AU - Kleinhanns, Tobias AU - Milillo, Francesco AU - Calcabrini, Mariano AU - Fiedler, Christine AU - Horta, Sharona AU - Balazs, Daniel AU - Strumolo, Marissa J. AU - Hasler, Roger AU - Llorca, Jordi AU - Tkadletz, Michael AU - Brutchey, Richard L. AU - Ibáñez, Maria ID - 15182 JF - Advanced Energy Materials SN - 1614-6832 TI - A route to high thermoelectric performance: Solution‐based control of microstructure and composition in Ag2Se ER - TY - JOUR AB - Current knowledge suggests a drought Indian monsoon (perhaps a severe one) when the El Nino Southern Oscillation and Pacific Decadal Oscillation each exhibit positive phases (a joint positive phase). For the monsoons, which are exceptions in this regard, we found northeast India often gets excess pre-monsoon rainfall. Further investigation reveals that this excess pre-monsoon rainfall is produced by the interaction of the large-scale circulation associated with the joint phase with the mountains in northeast India. We posit that a warmer troposphere, a consequence of excess rainfall over northeast India, drives a stronger monsoon circulation and enhances monsoon rainfall over central India. Hence, we argue that pre-monsoon rainfall over northeast India can be used for seasonal monsoon rainfall prediction over central India. Most importantly, its predictive value is at its peak when the Pacific Ocean exhibits a joint positive phase and the threat of extreme drought monsoon looms over India. AU - Goswami, Bidyut B ID - 15165 IS - 5 JF - Geophysical Research Letters SN - 0094-8276 TI - A pre-monsoon signal of false alarms of Indian monsoon droughts VL - 51 ER - TY - JOUR AB - Reducing defects boosts room-temperature performance of a thermoelectric device AU - Navita, Navita AU - Ibáñez, Maria ID - 15166 IS - 6688 JF - Science SN - 0036-8075 TI - Electron highways are cooler VL - 383 ER - TY - JOUR AB - The extracellular matrix (ECM) serves as a scaffold for cells and plays an essential role in regulating numerous cellular processes, including cell migration and proliferation. Due to limitations in specimen preparation for conventional room-temperature electron microscopy, we lack structural knowledge on how ECM components are secreted, remodeled, and interact with surrounding cells. We have developed a 3D-ECM platform compatible with sample thinning by cryo-focused ion beam milling, the lift-out extraction procedure, and cryo-electron tomography. Our workflow implements cell-derived matrices (CDMs) grown on EM grids, resulting in a versatile tool closely mimicking ECM environments. This allows us to visualize ECM for the first time in its hydrated, native context. Our data reveal an intricate network of extracellular fibers, their positioning relative to matrix-secreting cells, and previously unresolved structural entities. Our workflow and results add to the structural atlas of the ECM, providing novel insights into its secretion and assembly. AU - Zens, Bettina AU - Fäßler, Florian AU - Hansen, Jesse AU - Hauschild, Robert AU - Datler, Julia AU - Hodirnau, Victor-Valentin AU - Zheden, Vanessa AU - Alanko, Jonna H AU - Sixt, Michael K AU - Schur, Florian KM ID - 15146 IS - 6 JF - Journal of Cell Biology SN - 0021-9525 TI - Lift-out cryo-FIBSEM and cryo-ET reveal the ultrastructural landscape of extracellular matrix VL - 223 ER - TY - JOUR AB - We prove an upper bound on the ground state energy of the dilute spin-polarized Fermi gas capturing the leading correction to the kinetic energy resulting from repulsive interactions. One of the main ingredients in the proof is a rigorous implementation of the fermionic cluster expansion of Gaudin et al. (1971) [15]. AU - Lauritsen, Asbjørn Bækgaard AU - Seiringer, Robert ID - 14931 IS - 7 JF - Journal of Functional Analysis SN - 0022-1236 TI - Ground state energy of the dilute spin-polarized Fermi gas: Upper bound via cluster expansion VL - 286 ER - TY - CHAP AB - The mammary gland consists of a bilayered epithelial structure with an extensively branched morphology. The majority of this epithelial tree is laid down during puberty, during which actively proliferating terminal end buds repeatedly elongate and bifurcate to form the basic structure of the ductal tree. Mammary ducts consist of a basal and luminal cell layer with a multitude of identified sub-lineages within both layers. The understanding of how these different cell lineages are cooperatively driving branching morphogenesis is a problem of crossing multiple scales, as this requires information on the macroscopic branched structure of the gland, as well as data on single-cell dynamics driving the morphogenic program. Here we describe a method to combine genetic lineage tracing with whole-gland branching analysis. Quantitative data on the global organ structure can be used to derive a model for mammary gland branching morphogenesis and provide a backbone on which the dynamics of individual cell lineages can be simulated and compared to lineage-tracing approaches. Eventually, these quantitative models and experiments allow to understand the couplings between the macroscopic shape of the mammary gland and the underlying single-cell dynamics driving branching morphogenesis. AU - Hannezo, Edouard B AU - Scheele, Colinda L.G.J. ED - Margadant, Coert ID - 12428 SN - 9781071628867 T2 - Cell Migration in Three Dimensions TI - A Guide Toward Multi-scale and Quantitative Branching Analysis in the Mammary Gland VL - 2608 ER - TY - JOUR AB - Brownian motion of a mobile impurity in a bath is affected by spin-orbit coupling (SOC). Here, we discuss a Caldeira-Leggett-type model that can be used to propose and interpret quantum simulators of this problem in cold Bose gases. First, we derive a master equation that describes the model and explore it in a one-dimensional (1D) setting. To validate the standard assumptions needed for our derivation, we analyze available experimental data without SOC; as a byproduct, this analysis suggests that the quench dynamics of the impurity is beyond the 1D Bose-polaron approach at temperatures currently accessible in a cold-atom laboratory—motion of the impurity is mainly driven by dissipation. For systems with SOC, we demonstrate that 1D spin-orbit coupling can be gauged out even in the presence of dissipation—the information about SOC is incorporated in the initial conditions. Observables sensitive to this information (such as spin densities) can be used to study formation of steady spin polarization domains during quench dynamics. AU - Ghazaryan, Areg AU - Cappellaro, Alberto AU - Lemeshko, Mikhail AU - Volosniev, Artem ID - 12534 IS - 1 JF - Physical Review Research SN - 2643-1564 TI - Dissipative dynamics of an impurity with spin-orbit coupling VL - 5 ER - TY - JOUR AB - Post-translational histone modifications modulate chromatin activity to affect gene expression. How chromatin states underlie lineage choice in single cells is relatively unexplored. We develop sort-assisted single-cell chromatin immunocleavage (sortChIC) and map active (H3K4me1 and H3K4me3) and repressive (H3K27me3 and H3K9me3) histone modifications in the mouse bone marrow. During differentiation, hematopoietic stem and progenitor cells (HSPCs) acquire active chromatin states mediated by cell-type-specifying transcription factors, which are unique for each lineage. By contrast, most alterations in repressive marks during differentiation occur independent of the final cell type. Chromatin trajectory analysis shows that lineage choice at the chromatin level occurs at the progenitor stage. Joint profiling of H3K4me1 and H3K9me3 demonstrates that cell types within the myeloid lineage have distinct active chromatin but share similar myeloid-specific heterochromatin states. This implies a hierarchical regulation of chromatin during hematopoiesis: heterochromatin dynamics distinguish differentiation trajectories and lineages, while euchromatin dynamics reflect cell types within lineages. AU - Zeller, Peter AU - Yeung, Jake AU - Viñas Gaza, Helena AU - de Barbanson, Buys Anton AU - Bhardwaj, Vivek AU - Florescu, Maria AU - van der Linden, Reinier AU - van Oudenaarden, Alexander ID - 12158 JF - Nature Genetics KW - Genetics SN - 1061-4036 TI - Single-cell sortChIC identifies hierarchical chromatin dynamics during hematopoiesis VL - 55 ER - TY - CONF AB - Turn-based stochastic games (aka simple stochastic games) are two-player zero-sum games played on directed graphs with probabilistic transitions. The goal of player-max is to maximize the probability to reach a target state against the adversarial player-min. These games lie in NP ∩ coNP and are among the rare combinatorial problems that belong to this complexity class for which the existence of polynomial-time algorithm is a major open question. While randomized sub-exponential time algorithm exists, all known deterministic algorithms require exponential time in the worst-case. An important open question has been whether faster algorithms can be obtained parametrized by the treewidth of the game graph. Even deterministic sub-exponential time algorithm for constant treewidth turn-based stochastic games has remain elusive. In this work our main result is a deterministic algorithm to solve turn-based stochastic games that, given a game with n states, treewidth at most t, and the bit-complexity of the probabilistic transition function log D, has running time O ((tn2 log D)t log n). In particular, our algorithm is quasi-polynomial time for games with constant or poly-logarithmic treewidth. AU - Chatterjee, Krishnendu AU - Meggendorfer, Tobias AU - Saona Urmeneta, Raimundo J AU - Svoboda, Jakub ID - 12676 SN - 9781611977554 T2 - Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms TI - Faster algorithm for turn-based stochastic games with bounded treewidth ER - TY - CHAP AB - Here we describe the in vivo DNA assembly approach, where molecular cloning procedures are performed using an E. coli recA-independent recombination pathway, which assembles linear fragments of DNA with short homologous termini. This pathway is present in all standard laboratory E. coli strains and, by bypassing the need for in vitro DNA assembly, allows simplified molecular cloning to be performed without the plasmid instability issues associated with specialized recombination-cloning bacterial strains. The methodology requires specific primer design and can perform all standard plasmid modifications (insertions, deletions, mutagenesis, and sub-cloning) in a rapid, simple, and cost-efficient manner, as it does not require commercial kits or specialized bacterial strains. Additionally, this approach can be used to perform complex procedures such as multiple modifications to a plasmid, as up to 6 linear fragments can be assembled in vivo by this recombination pathway. Procedures generally require less than 3 h, involving PCR amplification, DpnI digestion of template DNA, and transformation, upon which circular plasmids are assembled. In this chapter we describe the requirements, procedure, and potential pitfalls when using this technique, as well as protocol variations to overcome the most common issues. AU - Arroyo-Urea, Sandra AU - Watson, Jake AU - García-Nafría, Javier ED - Scarlett, Garry ID - 12720 SN - 1064-3745 T2 - DNA Manipulation and Analysis TI - Molecular Cloning Using In Vivo DNA Assembly VL - 2633 ER - TY - CONF AB - Asynchronous programming has gained significant popularity over the last decade: support for this programming pattern is available in many popular languages via libraries and native language implementations, typically in the form of coroutines or the async/await construct. Instead of programming via shared memory, this concept assumes implicit synchronization through message passing. The key data structure enabling such communication is the rendezvous channel. Roughly, a rendezvous channel is a blocking queue of size zero, so both send(e) and receive() operations wait for each other, performing a rendezvous when they meet. To optimize the message passing pattern, channels are usually equipped with a fixed-size buffer, so sends do not suspend and put elements into the buffer until its capacity is exceeded. This primitive is known as a buffered channel. This paper presents a fast and scalable algorithm for both rendezvous and buffered channels. Similarly to modern queues, our solution is based on an infinite array with two positional counters for send(e) and receive() operations, leveraging the unconditional Fetch-And-Add instruction to update them. Yet, the algorithm requires non-trivial modifications of this classic pattern, in order to support the full channel semantics, such as buffering and cancellation of waiting requests. We compare the performance of our solution to that of the Kotlin implementation, as well as against other academic proposals, showing up to 9.8× speedup. To showcase its expressiveness and performance, we also integrated the proposed algorithm into the standard Kotlin Coroutines library, replacing the previous channel implementations. AU - Koval, Nikita AU - Alistarh, Dan-Adrian AU - Elizarov, Roman ID - 12735 SN - 9798400700156 T2 - Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming TI - Fast and scalable channels in Kotlin Coroutines ER - TY - GEN AB - Although a wide variety of handcrafted concurrent data structures have been proposed, there is considerable interest in universal approaches (Universal Constructions or UCs) for building concurrent data structures. UCs (semi-)automatically convert a sequential data structure into a concurrent one. The simplest approach uses locks [3, 6] that protect a sequential data structure and allow only one process to access it at a time. However, the resulting data structure is blocking. Most work on UCs instead focuses on obtaining non-blocking progress guarantees such as obstruction-freedom, lock-freedom or wait-freedom. Many non-blocking UCs have appeared. Key examples include the seminal wait-free UC [2] by Herlihy, a NUMA-aware UC [10] by Yi et al., and an efficient UC for large objects [1] by Fatourou et al. AU - Aksenov, Vitaly AU - Brown, Trevor A AU - Fedorov, Alexander AU - Kokorin, Ilya ID - 12736 SN - 9798400700156 T2 - Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming TI - Unexpected scaling in path copying trees ER - TY - CONF AB - Dynamic programming (DP) is one of the fundamental paradigms in algorithm design. However, many DP algorithms have to fill in large DP tables, represented by two-dimensional arrays, which causes at least quadratic running times and space usages. This has led to the development of improved algorithms for special cases when the DPs satisfy additional properties like, e.g., the Monge property or total monotonicity. In this paper, we consider a new condition which assumes (among some other technical assumptions) that the rows of the DP table are monotone. Under this assumption, we introduce a novel data structure for computing (1 + ϵ)-approximate DP solutions in near-linear time and space in the static setting, and with polylogarithmic update times when the DP entries change dynamically. To the best of our knowledge, our new condition is incomparable to previous conditions and is the first which allows to derive dynamic algorithms based on existing DPs. Instead of using two-dimensional arrays to store the DP tables, we store the rows of the DP tables using monotone piecewise constant functions. This allows us to store length-n DP table rows with entries in [0, W] using only polylog(n, W) bits, and to perform operations, such as (min, +)-convolution or rounding, on these functions in polylogarithmic time. We further present several applications of our data structure. For bicriteria versions of k-balanced graph partitioning and simultaneous source location, we obtain the first dynamic algorithms with subpolynomial update times, as well as the first static algorithms using only near-linear time and space. Additionally, we obtain the currently fastest algorithm for fully dynamic knapsack. AU - Henzinger, Monika H AU - Neumann, Stefan AU - Räcke, Harald AU - Schmid, Stefan ID - 12760 SN - 1868-8969 T2 - 40th International Symposium on Theoretical Aspects of Computer Science TI - Dynamic maintenance of monotone dynamic programs and applications VL - 254 ER - TY - THES AB - The process of detecting and evaluating sensory information to guide behaviour is termed perceptual decision-making (PDM), and is critical for the ability of an organism to interact with its external world. Individuals with autism, a neurodevelopmental condition primarily characterised by social and communication difficulties, frequently exhibit altered sensory processing and PDM difficulties are widely reported. Recent technological advancements have pushed forward our understanding of the genetic changes accompanying this condition, however our understanding of how these mutations affect the function of specific neuronal circuits and bring about the corresponding behavioural changes remains limited. Here, we use an innate PDM task, the looming avoidance response (LAR) paradigm, to identify a convergent behavioural abnormality across three molecularly distinct genetic mouse models of autism (Cul3, Setd5 and Ptchd1). Although mutant mice can rapidly detect threatening visual stimuli, their responses are consistently delayed, requiring longer to initiate an appropriate response than their wild-type siblings. Mutant animals show abnormal adaptation in both their stimulus- evoked escape responses and exploratory dynamics following repeated stimulus presentations. Similarly delayed behavioural responses are observed in wild-type animals when faced with more ambiguous threats, suggesting the mutant phenotype could arise from a dysfunction in the flexible control of this PDM process. Our knowledge of the core neuronal circuitry mediating the LAR facilitated a detailed dissection of the neuronal mechanisms underlying the behavioural impairment. In vivo extracellular recording revealed that visual responses were unaffected within a key brain region for the rapid processing of visual threats, the superior colliculus (SC), indicating that the behavioural delay was unlikely to originate from sensory impairments. Delayed behavioural responses were recapitulated in the Setd5 model following optogenetic stimulation of the excitatory output neurons of the SC, which are known to mediate escape initiation through the activation of cells in the underlying dorsal periaqueductal grey (dPAG). In vitro patch-clamp recordings of dPAG cells uncovered a stark hypoexcitability phenotype in two out of the three genetic models investigated (Setd5 and Ptchd1), that in Setd5, is mediated by the misregulation of voltage-gated potassium channels. Overall, our results show that the ability to use visual information to drive efficient escape responses is impaired in three diverse genetic mouse models of autism and that, in one of the models studied, this behavioural delay likely originates from differences in the intrinsic excitability of a key subcortical node, the dPAG. Furthermore, this work showcases the use of an innate behavioural paradigm to mechanistically dissect PDM processes in autism. AU - Burnett, Laura ID - 12716 SN - 2663-337X TI - To flee, or not to flee? Using innate defensive behaviours to investigate rapid perceptual decision-making through subcortical circuits in mouse models of autism ER - TY - CONF AB - The main idea behind BUBAAK is to run multiple program analyses in parallel and use runtime monitoring and enforcement to observe and control their progress in real time. The analyses send information about (un)explored states of the program and discovered invariants to a monitor. The monitor processes the received data and can force an analysis to stop the search of certain program parts (which have already been analyzed by other analyses), or to make it utilize a program invariant found by another analysis. At SV-COMP 2023, the implementation of data exchange between the monitor and the analyses was not yet completed, which is why BUBAAK only ran several analyses in parallel, without any coordination. Still, BUBAAK won the meta-category FalsificationOverall and placed very well in several other (sub)-categories of the competition. AU - Chalupa, Marek AU - Henzinger, Thomas A ID - 12854 SN - 0302-9743 T2 - Tools and Algorithms for the Construction and Analysis of Systems TI - Bubaak: Runtime monitoring of program verifiers VL - 13994 ER - TY - GEN AB - We present a formula for the signed area of a spherical polygon via prequantization. In contrast to the traditional formula based on the Gauss-Bonnet theorem that requires measuring angles, the new formula mimics Green's theorem and is applicable to a wider range of degenerate spherical curves and polygons. AU - Chern, Albert AU - Ishida, Sadashige ID - 12846 T2 - arXiv TI - Area formula for spherical polygons via prequantization ER - TY - CONF AB - As the complexity and criticality of software increase every year, so does the importance of run-time monitoring. Third-party monitoring, with limited knowledge of the monitored software, and best-effort monitoring, which keeps pace with the monitored software, are especially valuable, yet underexplored areas of run-time monitoring. Most existing monitoring frameworks do not support their combination because they either require access to the monitored code for instrumentation purposes or the processing of all observed events, or both. We present a middleware framework, VAMOS, for the run-time monitoring of software which is explicitly designed to support third-party and best-effort scenarios. The design goals of VAMOS are (i) efficiency (keeping pace at low overhead), (ii) flexibility (the ability to monitor black-box code through a variety of different event channels, and the connectability to monitors written in different specification languages), and (iii) ease-of-use. To achieve its goals, VAMOS combines aspects of event broker and event recognition systems with aspects of stream processing systems. We implemented a prototype toolchain for VAMOS and conducted experiments including a case study of monitoring for data races. The results indicate that VAMOS enables writing useful yet efficient monitors, is compatible with a variety of event sources and monitor specifications, and simplifies key aspects of setting up a monitoring system from scratch. AU - Chalupa, Marek AU - Mühlböck, Fabian AU - Muroya Lei, Stefanie AU - Henzinger, Thomas A ID - 12856 SN - 0302-9743 T2 - Fundamental Approaches to Software Engineering TI - Vamos: Middleware for best-effort third-party monitoring VL - 13991 ER - TY - GEN AB - As the complexity and criticality of software increase every year, so does the importance of run-time monitoring. Third-party monitoring, with limited knowledge of the monitored software, and best-effort monitoring, which keeps pace with the monitored software, are especially valuable, yet underexplored areas of run-time monitoring. Most existing monitoring frameworks do not support their combination because they either require access to the monitored code for instrumentation purposes or the processing of all observed events, or both. We present a middleware framework, VAMOS, for the run-time monitoring of software which is explicitly designed to support third-party and best-effort scenarios. The design goals of VAMOS are (i) efficiency (keeping pace at low overhead), (ii) flexibility (the ability to monitor black-box code through a variety of different event channels, and the connectability to monitors written in different specification languages), and (iii) ease-of-use. To achieve its goals, VAMOS combines aspects of event broker and event recognition systems with aspects of stream processing systems. We implemented a prototype toolchain for VAMOS and conducted experiments including a case study of monitoring for data races. The results indicate that VAMOS enables writing useful yet efficient monitors, is compatible with a variety of event sources and monitor specifications, and simplifies key aspects of setting up a monitoring system from scratch. AU - Chalupa, Marek AU - Mühlböck, Fabian AU - Muroya Lei, Stefanie AU - Henzinger, Thomas A ID - 12407 KW - runtime monitoring KW - best effort KW - third party TI - VAMOS: Middleware for Best-Effort Third-Party Monitoring ER - TY - CHAP AB - Autism spectrum disorder (ASD) and epilepsy are frequently comorbid neurodevelopmental disorders. Extensive research has demonstrated shared pathological pathways, etiologies, and phenotypes. Many risk factors for these disorders, like genetic mutations and environmental pressures, are linked to changes in childhood brain development, which is a critical period for their manifestation. Decades of research have yielded many signatures for ASD and epilepsy, some shared and others unique or opposing. The anatomical, physiological, and behavioral correlates of these disorders are discussed in this chapter in the context of understanding shared pathological pathways. We end with important takeaways on the presentation, prevention, intervention, and policy changes for ASD and epilepsy. This chapter aims to explore the complexity of these disorders, both in etiology and phenotypes, with the further goal of appreciating the expanse of unknowns still to explore about the brain. AU - Currin, Christopher AU - Beyer, Chad ED - Halpern-Felsher, Bonnie ID - 12866 SN - 9780128188736 T2 - Encyclopedia of Child and Adolescent Health TI - Altered childhood brain development in autism and epilepsy ER - TY - THES AB - Understanding the mechanisms of learning and memory formation has always been one of the main goals in neuroscience. Already Pavlov (1927) in his early days has used his classic conditioning experiments to study the neural mechanisms governing behavioral adaptation. What was not known back then was that the part of the brain that is largely responsible for this type of associative learning is the cerebellum. Since then, plenty of theories on cerebellar learning have emerged. Despite their differences, one thing they all have in common is that learning relies on synaptic and intrinsic plasticity. The goal of my PhD project was to unravel the molecular mechanisms underlying synaptic plasticity in two synapses that have been shown to be implicated in motor learning, in an effort to understand how learning and memory formation are processed in the cerebellum. One of the earliest and most well-known cerebellar theories postulates that motor learning largely depends on long-term depression at the parallel fiber-Purkinje cell (PC-PC) synapse. However, the discovery of other types of plasticity in the cerebellar circuitry, like long-term potentiation (LTP) at the PC-PC synapse, potentiation of molecular layer interneurons (MLIs), and plasticity transfer from the cortex to the cerebellar/ vestibular nuclei has increased the popularity of the idea that multiple sites of plasticity might be involved in learning. Still a lot remains unknown about the molecular mechanisms responsible for these types of plasticity and whether they occur during physiological learning. In the first part of this thesis we have analyzed the variation and nanodistribution of voltagegated calcium channels (VGCCs) and α-amino-3-hydroxy-5-methyl-4-isoxazolepropionic acid type glutamate receptors (AMPARs) on the parallel fiber-Purkinje cell synapse after vestibuloocular reflex phase reversal adaptation, a behavior that has been suggested to rely on PF-PC LTP. We have found that on the last day of adaptation there is no learning trace in form of VGCCs nor AMPARs variation at the PF-PC synapse, but instead a decrease in the number of PF-PC synapses. These data seem to support the view that learning is only stored in the cerebellar cortex in an initial learning phase, being transferred later to the vestibular nuclei. Next, we have studied the role of MLIs in motor learning using a relatively simple and well characterized behavioral paradigm – horizontal optokinetic reflex (HOKR) adaptation. We have found behavior-induced MLI potentiation in form of release probability increase that could be explained by the increase of VGCCs at the presynaptic side. Our results strengthen the idea of distributed cerebellar plasticity contributing to learning and provide a novel mechanism for release probability increase. AU - Alcarva, Catarina ID - 12809 SN - 2663 - 337X TI - Plasticity in the cerebellum: What molecular mechanisms are behind physiological learning ER - TY - CONF AB - In this paper we introduce a pruning of the medial axis called the (λ,α)-medial axis (axλα). We prove that the (λ,α)-medial axis of a set K is stable in a Gromov-Hausdorff sense under weak assumptions. More formally we prove that if K and K′ are close in the Hausdorff (dH) sense then the (λ,α)-medial axes of K and K′ are close as metric spaces, that is the Gromov-Hausdorff distance (dGH) between the two is 1/4-Hölder in the sense that dGH (axλα(K),axλα(K′)) ≲ dH(K,K′)1/4. The Hausdorff distance between the two medial axes is also bounded, by dH (axλα(K),λα(K′)) ≲ dH(K,K′)1/2. These quantified stability results provide guarantees for practical computations of medial axes from approximations. Moreover, they provide key ingredients for studying the computability of the medial axis in the context of computable analysis. AU - Lieutier, André AU - Wintraecken, Mathijs ID - 13048 SN - 9781450399135 T2 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing TI - Hausdorff and Gromov-Hausdorff stable subsets of the medial axis ER - TY - CONF AB - Deep neural networks (DNNs) often have to be compressed, via pruning and/or quantization, before they can be deployed in practical settings. In this work we propose a new compression-aware minimizer dubbed CrAM that modifies the optimization step in a principled way, in order to produce models whose local loss behavior is stable under compression operations such as pruning. Thus, dense models trained via CrAM should be compressible post-training, in a single step, without significant accuracy loss. Experimental results on standard benchmarks, such as residual networks for ImageNet classification and BERT models for language modelling, show that CrAM produces dense models that can be more accurate than the standard SGD/Adam-based baselines, but which are stable under weight pruning: specifically, we can prune models in one-shot to 70-80% sparsity with almost no accuracy loss, and to 90% with reasonable (∼1%) accuracy loss, which is competitive with gradual compression methods. Additionally, CrAM can produce sparse models which perform well for transfer learning, and it also works for semi-structured 2:4 pruning patterns supported by GPU hardware. The code for reproducing the results is available at this https URL . AU - Peste, Elena-Alexandra AU - Vladu, Adrian AU - Kurtic, Eldar AU - Lampert, Christoph AU - Alistarh, Dan-Adrian ID - 13053 T2 - 11th International Conference on Learning Representations TI - CrAM: A Compression-Aware Minimizer ER - TY - CONF AB - GIMPS and PrimeGrid are large-scale distributed projects dedicated to searching giant prime numbers, usually of special forms like Mersenne and Proth primes. The numbers in the current search-space are millions of digits large and the participating volunteers need to run resource-consuming primality tests. Once a candidate prime N has been found, the only way for another party to independently verify the primality of N used to be by repeating the expensive primality test. To avoid the need for second recomputation of each primality test, these projects have recently adopted certifying mechanisms that enable efficient verification of performed tests. However, the mechanisms presently in place only detect benign errors and there is no guarantee against adversarial behavior: a malicious volunteer can mislead the project to reject a giant prime as being non-prime. In this paper, we propose a practical, cryptographically-sound mechanism for certifying the non-primality of Proth numbers. That is, a volunteer can – parallel to running the primality test for N – generate an efficiently verifiable proof at a little extra cost certifying that N is not prime. The interactive protocol has statistical soundness and can be made non-interactive using the Fiat-Shamir heuristic. Our approach is based on a cryptographic primitive called Proof of Exponentiation (PoE) which, for a group G, certifies that a tuple (x,y,T)∈G2×N satisfies x2T=y (Pietrzak, ITCS 2019 and Wesolowski, J. Cryptol. 2020). In particular, we show how to adapt Pietrzak’s PoE at a moderate additional cost to make it a cryptographically-sound certificate of non-primality. AU - Hoffmann, Charlotte AU - Hubáček, Pavel AU - Kamath, Chethan AU - Pietrzak, Krzysztof Z ID - 13143 SN - 0302-9743 T2 - Public-Key Cryptography - PKC 2023 TI - Certifying giant nonprimes VL - 13940 ER - TY - CONF AB - Reinforcement learning has received much attention for learning controllers of deterministic systems. We consider a learner-verifier framework for stochastic control systems and survey recent methods that formally guarantee a conjunction of reachability and safety properties. Given a property and a lower bound on the probability of the property being satisfied, our framework jointly learns a control policy and a formal certificate to ensure the satisfaction of the property with a desired probability threshold. Both the control policy and the formal certificate are continuous functions from states to reals, which are learned as parameterized neural networks. While in the deterministic case, the certificates are invariant and barrier functions for safety, or Lyapunov and ranking functions for liveness, in the stochastic case the certificates are supermartingales. For certificate verification, we use interval arithmetic abstract interpretation to bound the expected values of neural network functions. AU - Chatterjee, Krishnendu AU - Henzinger, Thomas A AU - Lechner, Mathias AU - Zikelic, Dorde ID - 13142 SN - 0302-9743 T2 - Tools and Algorithms for the Construction and Analysis of Systems TI - A learner-verifier framework for neural network controllers and certificates of stochastic systems VL - 13993 ER - TY - CONF AB - We automatically compute a new class of environment assumptions in two-player turn-based finite graph games which characterize an “adequate cooperation” needed from the environment to allow the system player to win. Given an ω-regular winning condition Φ for the system player, we compute an ω-regular assumption Ψ for the environment player, such that (i) every environment strategy compliant with Ψ allows the system to fulfill Φ (sufficiency), (ii) Ψ can be fulfilled by the environment for every strategy of the system (implementability), and (iii) Ψ does not prevent any cooperative strategy choice (permissiveness). For parity games, which are canonical representations of ω-regular games, we present a polynomial-time algorithm for the symbolic computation of adequately permissive assumptions and show that our algorithm runs faster and produces better assumptions than existing approaches—both theoretically and empirically. To the best of our knowledge, for ω -regular games, we provide the first algorithm to compute sufficient and implementable environment assumptions that are also permissive. AU - Anand, Ashwani AU - Mallik, Kaushik AU - Nayak, Satya Prakash AU - Schmuck, Anne Kathrin ID - 13141 SN - 0302-9743 T2 - TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems TI - Computing adequately permissive assumptions for synthesis VL - 13994 ER - TY - THES AB - During navigation, animals can infer the structure of the environment by computing the optic flow cues elicited by their own movements, and subsequently use this information to instruct proper locomotor actions. These computations require a panoramic assessment of the visual environment in order to disambiguate similar sensory experiences that may require distinct behavioral responses. The estimation of the global motion patterns is therefore essential for successful navigation. Yet, our understanding of the algorithms and implementations that enable coherent panoramic visual perception remains scarce. Here I pursue this problem by dissecting the functional aspects of interneuronal communication in the lobula plate tangential cell network in Drosophila melanogaster. The results presented in the thesis demonstrate that the basis for effective interpretation of the optic flow in this circuit are stereotyped synaptic connections that mediate the formation of distinct subnetworks, each extracting a particular pattern of global motion. Firstly, I show that gap junctions are essential for a correct interpretation of binocular motion cues by horizontal motion-sensitive cells. HS cells form electrical synapses with contralateral H2 neurons that are involved in detecting yaw rotation and translation. I developed an FlpStop-mediated mutant of a gap junction protein ShakB that disrupts these electrical synapses. While the loss of electrical synapses does not affect the tuning of the direction selectivity in HS neurons, it severely alters their sensitivity to horizontal motion in the contralateral side. These physiological changes result in an inappropriate integration of binocular motion cues in walking animals. While wild-type flies form a binocular perception of visual motion by non-linear integration of monocular optic flow cues, the mutant flies sum the monocular inputs linearly. These results indicate that rather than averaging signals in neighboring neurons, gap-junctions operate in conjunction with chemical synapses to mediate complex non-linear optic flow computations. Secondly, I show that stochastic manipulation of neuronal activity in the lobula plate tangential cell network is a powerful approach to study the neuronal implementation of optic flow-based navigation in flies. Tangential neurons form multiple subnetworks, each mediating course-stabilizing response to a particular global pattern of visual motion. Application of genetic mosaic techniques can provide sparse optogenetic activation of HS cells in numerous combinations. These distinct combinations of activated neurons drive an array of distinct behavioral responses, providing important insights into how visuomotor transformation is performed in the lobula plate tangential cell network. This approach can be complemented by stochastic silencing of tangential neurons, enabling direct assessment of the functional role of individual tangential neurons in the processing of specific visual motion patterns. Taken together, the findings presented in this thesis suggest that establishing specific activity patterns of tangential cells via stereotyped synaptic connectivity is a key to efficient optic flow-based navigation in Drosophila melanogaster. AU - Pokusaeva, Victoria ID - 12826 SN - 2663 - 337X TI - Neural control of optic flow-based navigation in Drosophila melanogaster ER - TY - JOUR AB - We present a simple algorithm for computing higher-order Delaunay mosaics that works in Euclidean spaces of any finite dimensions. The algorithm selects the vertices of the order-k mosaic from incrementally constructed lower-order mosaics and uses an algorithm for weighted first-order Delaunay mosaics as a black-box to construct the order-k mosaic from its vertices. Beyond this black-box, the algorithm uses only combinatorial operations, thus facilitating easy implementation. We extend this algorithm to compute higher-order α-shapes and provide open-source implementations. We present experimental results for properties of higher-order Delaunay mosaics of random point sets. AU - Edelsbrunner, Herbert AU - Osang, Georg F ID - 12086 JF - Algorithmica SN - 0178-4617 TI - A simple algorithm for higher-order Delaunay mosaics and alpha shapes VL - 85 ER - TY - JOUR AB - We study ergodic decompositions of Dirichlet spaces under intertwining via unitary order isomorphisms. We show that the ergodic decomposition of a quasi-regular Dirichlet space is unique up to a unique isomorphism of the indexing space. Furthermore, every unitary order isomorphism intertwining two quasi-regular Dirichlet spaces is decomposable over their ergodic decompositions up to conjugation via an isomorphism of the corresponding indexing spaces. AU - Dello Schiavo, Lorenzo AU - Wirth, Melchior ID - 12104 IS - 1 JF - Journal of Evolution Equations SN - 1424-3199 TI - Ergodic decompositions of Dirichlet forms under order isomorphisms VL - 23 ER - TY - JOUR AB - The Indian summer monsoon rainfall (ISMR) has been declining since the 1950s. However, since 2002 it is reported to have revived. For these observed changes in the ISMR, several explanations have been reported. Among these explanations, however, the role of the eastern equatorial Indian Ocean (EEIO) is missing despite being one of the warmest regions in the Indian Ocean, and monotonously warming. A recent study reported that EEIO warming impacts the rainfall over northern India. Here we report that warming in the EEIO weakens the low-level Indian summer monsoon circulation and reduces ISMR. A warm EEIO drives easterly winds in the Indo–Pacific sector as a Gill response. The warm EEIO also enhances nocturnal convection offshore the western coast of Sumatra. The latent heating associated with the increased convection augments the Gill response and the resultant circulation opposes the monsoon low-level circulation and weakens the seasonal rainfall. AU - Goswami, Bidyut B ID - 11434 JF - Climate Dynamics SN - 0930-7575 TI - Role of the eastern equatorial Indian Ocean warming in the Indian summer monsoon rainfall trend VL - 60 ER - TY - CONF AB - Safety and liveness are elementary concepts of computation, and the foundation of many verification paradigms. The safety-liveness classification of boolean properties characterizes whether a given property can be falsified by observing a finite prefix of an infinite computation trace (always for safety, never for liveness). In quantitative specification and verification, properties assign not truth values, but quantitative values to infinite traces (e.g., a cost, or the distance to a boolean property). We introduce quantitative safety and liveness, and we prove that our definitions induce conservative quantitative generalizations of both (1)~the safety-progress hierarchy of boolean properties and (2)~the safety-liveness decomposition of boolean properties. In particular, we show that every quantitative property can be written as the pointwise minimum of a quantitative safety property and a quantitative liveness property. Consequently, like boolean properties, also quantitative properties can be min-decomposed into safety and liveness parts, or alternatively, max-decomposed into co-safety and co-liveness parts. Moreover, quantitative properties can be approximated naturally. We prove that every quantitative property that has both safe and co-safe approximations can be monitored arbitrarily precisely by a monitor that uses only a finite number of states. AU - Henzinger, Thomas A AU - Mazzocchi, Nicolas Adrien AU - Sarac, Naci E ID - 12467 SN - 0302-9743 T2 - 26th International Conference Foundations of Software Science and Computation Structures TI - Quantitative safety and liveness VL - 13992 ER - TY - JOUR AB - Writing concurrent code that is both correct and efficient is notoriously difficult. Thus, programmers often prefer to use synchronization abstractions, which render code simpler and easier to reason about. Despite a wealth of work on this topic, there is still a gap between the rich semantics provided by synchronization abstractions in modern programming languages—specifically, fair FIFO ordering of synchronization requests and support for abortable operations—and frameworks for implementing it correctly and efficiently. Supporting such semantics is critical given the rising popularity of constructs for asynchronous programming, such as coroutines, which abort frequently and are cheaper to suspend and resume compared to native threads. This paper introduces a new framework called CancellableQueueSynchronizer (CQS), which enables simple yet efficient implementations of a wide range of fair and abortable synchronization primitives: mutexes, semaphores, barriers, count-down latches, and blocking pools. Our main contribution is algorithmic, as implementing both fairness and abortability efficiently at this level of generality is non-trivial. Importantly, all our algorithms, including the CQS framework and the primitives built on top of it, come with formal proofs in the Iris framework for Coq for many of their properties. These proofs are modular, so it is easy to show correctness for new primitives implemented on top of CQS. From a practical perspective, implementation of CQS for native threads on the JVM improves throughput by up to two orders of magnitude over Java’s AbstractQueuedSynchronizer, the only practical abstraction offering similar semantics. Further, we successfully integrated CQS as a core component of the popular Kotlin Coroutines library, validating the framework’s practical impact and expressiveness in a real-world environment. In sum, CancellableQueueSynchronizer is the first framework to combine expressiveness with formal guarantees and solid practical performance. Our approach should be extensible to other languages and families of synchronization primitives. AU - Koval, Nikita AU - Khalanskiy, Dmitry AU - Alistarh, Dan-Adrian ID - 13179 JF - Proceedings of the ACM on Programming Languages TI - CQS: A formally-verified framework for fair and abortable synchronization VL - 7 ER - TY - JOUR AB - We study the density of everywhere locally soluble diagonal quadric surfaces, parameterised by rational points that lie on a split quadric surface AU - Browning, Timothy D AU - Lyczak, Julian AU - Sarapin, Roman ID - 13180 IS - 2 JF - Involve SN - 1944-4176 TI - Local solubility for a family of quadrics over a split quadric surface VL - 16 ER - TY - GEN AU - Elefante, Stefano AU - Stadlbauer, Stephan AU - Alexander, Michael F AU - Schlögl, Alois ID - 13162 T2 - ASHPC23 - Austrian-Slovenian HPC Meeting 2023 TI - Cryo-EM software packages: A sys-admins point of view ER - TY - GEN AU - Schlögl, Alois AU - Elefante, Stefano AU - Hodirnau, Victor-Valentin ID - 13161 T2 - ASHPC23 - Austrian-Slovenian HPC Meeting 2023 TI - Running Windows-applications on a Linux HPC cluster using WINE ER - TY - JOUR AB - A rotating organic cation and a dynamically disordered soft inorganic cage are the hallmark features of organic-inorganic lead-halide perovskites. Understanding the interplay between these two subsystems is a challenging problem, but it is this coupling that is widely conjectured to be responsible for the unique behavior of photocarriers in these materials. In this work, we use the fact that the polarizability of the organic cation strongly depends on the ambient electrostatic environment to put the molecule forward as a sensitive probe of the local crystal fields inside the lattice cell. We measure the average polarizability of the C/N–H bond stretching mode by means of infrared spectroscopy, which allows us to deduce the character of the motion of the cation molecule, find the magnitude of the local crystal field, and place an estimate on the strength of the hydrogen bond between the hydrogen and halide atoms. Our results pave the way for understanding electric fields in lead-halide perovskites using infrared bond spectroscopy. AU - Wei, Yujing AU - Volosniev, Artem AU - Lorenc, Dusan AU - Zhumekenov, Ayan A. AU - Bakr, Osman M. AU - Lemeshko, Mikhail AU - Alpichshev, Zhanybek ID - 13251 IS - 27 JF - The Journal of Physical Chemistry Letters KW - General Materials Science KW - Physical and Theoretical Chemistry TI - Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites VL - 14 ER - TY - CONF AB - The operator precedence languages (OPLs) represent the largest known subclass of the context-free languages which enjoys all desirable closure and decidability properties. This includes the decidability of language inclusion, which is the ultimate verification problem. Operator precedence grammars, automata, and logics have been investigated and used, for example, to verify programs with arithmetic expressions and exceptions (both of which are deterministic pushdown but lie outside the scope of the visibly pushdown languages). In this paper, we complete the picture and give, for the first time, an algebraic characterization of the class of OPLs in the form of a syntactic congruence that has finitely many equivalence classes exactly for the operator precedence languages. This is a generalization of the celebrated Myhill-Nerode theorem for the regular languages to OPLs. As one of the consequences, we show that universality and language inclusion for nondeterministic operator precedence automata can be solved by an antichain algorithm. Antichain algorithms avoid determinization and complementation through an explicit subset construction, by leveraging a quasi-order on words, which allows the pruning of the search space for counterexample words without sacrificing completeness. Antichain algorithms can be implemented symbolically, and these implementations are today the best-performing algorithms in practice for the inclusion of finite automata. We give a generic construction of the quasi-order needed for antichain algorithms from a finite syntactic congruence. This yields the first antichain algorithm for OPLs, an algorithm that solves the ExpTime-hard language inclusion problem for OPLs in exponential time. AU - Henzinger, Thomas A AU - Kebis, Pavol AU - Mazzocchi, Nicolas Adrien AU - Sarac, Naci E ID - 13292 SN - 9783959772785 T2 - 50th International Colloquium on Automata, Languages, and Programming TI - Regular methods for operator precedence languages VL - 261 ER - TY - JOUR AB - Recent experimental advances have inspired the development of theoretical tools to describe the non-equilibrium dynamics of quantum systems. Among them an exact representation of quantum spin systems in terms of classical stochastic processes has been proposed. Here we provide first steps towards the extension of this stochastic approach to bosonic systems by considering the one-dimensional quantum quartic oscillator. We show how to exactly parameterize the time evolution of this prototypical model via the dynamics of a set of classical variables. We interpret these variables as stochastic processes, which allows us to propose a novel way to numerically simulate the time evolution of the system. We benchmark our findings by considering analytically solvable limits and providing alternative derivations of known results. AU - Tucci, Gennaro AU - De Nicola, Stefano AU - Wald, Sascha AU - Gambassi, Andrea ID - 13277 IS - 2 JF - SciPost Physics Core KW - Statistical and Nonlinear Physics KW - Atomic and Molecular Physics KW - and Optics KW - Nuclear and High Energy Physics KW - Condensed Matter Physics SN - 2666-9366 TI - Stochastic representation of the quantum quartic oscillator VL - 6 ER - TY - JOUR AB - We introduce a generic and accessible implementation of an exact diagonalization method for studying few-fermion models. Our aim is to provide a testbed for the newcomers to the field as well as a stepping stone for trying out novel optimizations and approximations. This userguide consists of a description of the algorithm, and several examples in varying orders of sophistication. In particular, we exemplify our routine using an effective-interaction approach that fixes the low-energy physics. We benchmark this approach against the existing data, and show that it is able to deliver state-of-the-art numerical results at a significantly reduced computational cost. AU - Rammelmüller, Lukas AU - Huber, David AU - Volosniev, Artem ID - 13276 JF - SciPost Physics Codebases SN - 2949-804X TI - A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D ER - TY - GEN AB - We introduce a generic and accessible implementation of an exact diagonalization method for studying few-fermion models. Our aim is to provide a testbed for the newcomers to the field as well as a stepping stone for trying out novel optimizations and approximations. This userguide consists of a description of the algorithm, and several examples in varying orders of sophistication. In particular, we exemplify our routine using an effective-interaction approach that fixes the low-energy physics. We benchmark this approach against the existing data, and show that it is able to deliver state-of-the-art numerical results at a significantly reduced computational cost. AU - Rammelmüller, Lukas AU - Huber, David AU - Volosniev, Artem ID - 13275 TI - Codebase release 1.0 for FermiFCI ER - TY - CONF AB - Determining the degree of inherent parallelism in classical sequential algorithms and leveraging it for fast parallel execution is a key topic in parallel computing, and detailed analyses are known for a wide range of classical algorithms. In this paper, we perform the first such analysis for the fundamental Union-Find problem, in which we are given a graph as a sequence of edges, and must maintain its connectivity structure under edge additions. We prove that classic sequential algorithms for this problem are well-parallelizable under reasonable assumptions, addressing a conjecture by [Blelloch, 2017]. More precisely, we show via a new potential argument that, under uniform random edge ordering, parallel union-find operations are unlikely to interfere: T concurrent threads processing the graph in parallel will encounter memory contention O(T2 · log |V| · log |E|) times in expectation, where |E| and |V| are the number of edges and nodes in the graph, respectively. We leverage this result to design a new parallel Union-Find algorithm that is both internally deterministic, i.e., its results are guaranteed to match those of a sequential execution, but also work-efficient and scalable, as long as the number of threads T is O(|E|1 over 3 - ε), for an arbitrarily small constant ε > 0, which holds for most large real-world graphs. We present lower bounds which show that our analysis is close to optimal, and experimental results suggesting that the performance cost of internal determinism is limited. AU - Fedorov, Alexander AU - Hashemi, Diba AU - Nadiradze, Giorgi AU - Alistarh, Dan-Adrian ID - 13262 SN - 9781450395458 T2 - Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures TI - Provably-efficient and internally-deterministic parallel Union-Find ER - TY - JOUR AB - Understanding population divergence that eventually leads to speciation is essential for evolutionary biology. High species diversity in the sea was regarded as a paradox when strict allopatry was considered necessary for most speciation events because geographical barriers seemed largely absent in the sea, and many marine species have high dispersal capacities. Combining genome-wide data with demographic modelling to infer the demographic history of divergence has introduced new ways to address this classical issue. These models assume an ancestral population that splits into two subpopulations diverging according to different scenarios that allow tests for periods of gene flow. Models can also test for heterogeneities in population sizes and migration rates along the genome to account, respectively, for background selection and selection against introgressed ancestry. To investigate how barriers to gene flow arise in the sea, we compiled studies modelling the demographic history of divergence in marine organisms and extracted preferred demographic scenarios together with estimates of demographic parameters. These studies show that geographical barriers to gene flow do exist in the sea but that divergence can also occur without strict isolation. Heterogeneity of gene flow was detected in most population pairs suggesting the predominance of semipermeable barriers during divergence. We found a weak positive relationship between the fraction of the genome experiencing reduced gene flow and levels of genome-wide differentiation. Furthermore, we found that the upper bound of the ‘grey zone of speciation’ for our dataset extended beyond that found before, implying that gene flow between diverging taxa is possible at higher levels of divergence than previously thought. Finally, we list recommendations for further strengthening the use of demographic modelling in speciation research. These include a more balanced representation of taxa, more consistent and comprehensive modelling, clear reporting of results and simulation studies to rule out nonbiological explanations for general results. AU - De Jode, Aurélien AU - Le Moan, Alan AU - Johannesson, Kerstin AU - Faria, Rui AU - Stankowski, Sean AU - Westram, Anja M AU - Butlin, Roger K. AU - Rafajlović, Marina AU - Fraisse, Christelle ID - 11479 IS - 2 JF - Evolutionary Applications TI - Ten years of demographic modelling of divergence and speciation in the sea VL - 16 ER - TY - JOUR AB - In this article, we develop two independent and new approaches to model epidemic spread in a network. Contrary to the most studied models, those developed here allow for contacts with different probabilities of transmitting the disease (transmissibilities). We then examine each of these models using some mean field type approximations. The first model looks at the late-stage effects of an epidemic outbreak and allows for the computation of the probability that a given vertex was infected. This computation is based on a mean field approximation and only depends on the number of contacts and their transmissibilities. This approach shares many similarities with percolation models in networks. The second model we develop is a dynamic model which we analyze using a mean field approximation which highly reduces the dimensionality of the system. In particular, the original system which individually analyses each vertex of the network is reduced to one with as many equations as different transmissibilities. Perhaps the greatest contribution of this article is the observation that, in both these models, the existence and size of an epidemic outbreak are linked to the properties of a matrix which we call the R-matrix. This is a generalization of the basic reproduction number which more precisely characterizes the main routes of infection. AU - Gómez, Arturo AU - Oliveira, Goncalo ID - 12329 JF - Scientific Reports TI - New approaches to epidemic modeling on networks VL - 13 ER - TY - JOUR AB - We determine an asymptotic formula for the number of integral points of bounded height on a blow-up of P3 outside certain planes using universal torsors. AU - Wilsch, Florian Alexander ID - 9034 IS - 8 JF - International Mathematics Research Notices SN - 1073-7928 TI - Integral points of bounded height on a log Fano threefold VL - 2023 ER - TY - JOUR AB - Hosts can carry many viruses in their bodies, but not all of them cause disease. We studied ants as a social host to determine both their overall viral repertoire and the subset of actively infecting viruses across natural populations of three subfamilies: the Argentine ant (Linepithema humile, Dolichoderinae), the invasive garden ant (Lasius neglectus, Formicinae) and the red ant (Myrmica rubra, Myrmicinae). We used a dual sequencing strategy to reconstruct complete virus genomes by RNA-seq and to simultaneously determine the small interfering RNAs (siRNAs) by small RNA sequencing (sRNA-seq), which constitute the host antiviral RNAi immune response. This approach led to the discovery of 41 novel viruses in ants and revealed a host ant-specific RNAi response (21 vs. 22 nt siRNAs) in the different ant species. The efficiency of the RNAi response (sRNA/RNA read count ratio) depended on the virus and the respective ant species, but not its population. Overall, we found the highest virus abundance and diversity per population in Li. humile, followed by La. neglectus and M. rubra. Argentine ants also shared a high proportion of viruses between populations, whilst overlap was nearly absent in M. rubra. Only one of the 59 viruses was found to infect two of the ant species as hosts, revealing high host-specificity in active infections. In contrast, six viruses actively infected one ant species, but were found as contaminants only in the others. Disentangling spillover of disease-causing infection from non-infecting contamination across species is providing relevant information for disease ecology and ecosystem management. AU - Viljakainen, Lumi AU - Fürst, Matthias AU - Grasse, Anna V AU - Jurvansuu, Jaana AU - Oh, Jinook AU - Tolonen, Lassi AU - Eder, Thomas AU - Rattei, Thomas AU - Cremer, Sylvia ID - 12469 JF - Frontiers in Microbiology TI - Antiviral immune response reveals host-specific virus infections in natural ant populations VL - 14 ER - TY - JOUR AB - We present criteria for establishing a triangulation of a manifold. Given a manifold M, a simplicial complex A, and a map H from the underlying space of A to M, our criteria are presented in local coordinate charts for M, and ensure that H is a homeomorphism. These criteria do not require a differentiable structure, or even an explicit metric on M. No Delaunay property of A is assumed. The result provides a triangulation guarantee for algorithms that construct a simplicial complex by working in local coordinate patches. Because the criteria are easily verified in such a setting, they are expected to be of general use. AU - Boissonnat, Jean-Daniel AU - Dyer, Ramsay AU - Ghosh, Arijit AU - Wintraecken, Mathijs ID - 12287 JF - Discrete & Computational Geometry KW - Computational Theory and Mathematics KW - Discrete Mathematics and Combinatorics KW - Geometry and Topology KW - Theoretical Computer Science SN - 0179-5376 TI - Local criteria for triangulating general manifolds VL - 69 ER - TY - JOUR AB - It may come as a surprise that a phenomenon as ubiquitous and prominent as the transition from laminar to turbulent flow has resisted combined efforts by physicists, engineers and mathematicians, and remained unresolved for almost one and a half centuries. In recent years, various studies have proposed analogies to directed percolation, a well-known universality class in statistical mechanics, which describes a non-equilibrium phase transition from a fluctuating active phase into an absorbing state. It is this unlikely relation between the multiscale, high-dimensional dynamics that signify the transition process in virtually all flows of practical relevance, and the arguably most basic non-equilibrium phase transition, that so far has mainly been the subject of model studies, which I review in this Perspective. AU - Hof, Björn ID - 12165 JF - Nature Reviews Physics KW - General Physics and Astronomy TI - Directed percolation and the transition to turbulence VL - 5 ER - TY - JOUR AB - The actin cytoskeleton plays a key role in cell migration and cellular morphodynamics in most eukaryotes. The ability of the actin cytoskeleton to assemble and disassemble in a spatiotemporally controlled manner allows it to form higher-order structures, which can generate forces required for a cell to explore and navigate through its environment. It is regulated not only via a complex synergistic and competitive interplay between actin-binding proteins (ABP), but also by filament biochemistry and filament geometry. The lack of structural insights into how geometry and ABPs regulate the actin cytoskeleton limits our understanding of the molecular mechanisms that define actin cytoskeleton remodeling and, in turn, impact emerging cell migration characteristics. With the advent of cryo-electron microscopy (cryo-EM) and advanced computational methods, it is now possible to define these molecular mechanisms involving actin and its interactors at both atomic and ultra-structural levels in vitro and in cellulo. In this review, we will provide an overview of the available cryo-EM methods, applicable to further our understanding of the actin cytoskeleton, specifically in the context of cell migration. We will discuss how these methods have been employed to elucidate ABP- and geometry-defined regulatory mechanisms in initiating, maintaining, and disassembling cellular actin networks in migratory protrusions. AU - Fäßler, Florian AU - Javoor, Manjunath AU - Schur, Florian KM ID - 12421 IS - 1 JF - Biochemical Society Transactions KW - Biochemistry SN - 0300-5127 TI - Deciphering the molecular mechanisms of actin cytoskeleton regulation in cell migration using cryo-EM VL - 51 ER - TY - JOUR AB - Data-driven dimensionality reduction methods such as proper orthogonal decomposition and dynamic mode decomposition have proven to be useful for exploring complex phenomena within fluid dynamics and beyond. A well-known challenge for these techniques is posed by the continuous symmetries, e.g. translations and rotations, of the system under consideration, as drifts in the data dominate the modal expansions without providing an insight into the dynamics of the problem. In the present study, we address this issue for fluid flows in rectangular channels by formulating a continuous symmetry reduction method that eliminates the translations in the streamwise and spanwise directions simultaneously. We demonstrate our method by computing the symmetry-reduced dynamic mode decomposition (SRDMD) of sliding windows of data obtained from the transitional plane-Couette and turbulent plane-Poiseuille flow simulations. In the former setting, SRDMD captures the dynamics in the vicinity of the invariant solutions with translation symmetries, i.e. travelling waves and relative periodic orbits, whereas in the latter, our calculations reveal episodes of turbulent time evolution that can be approximated by a low-dimensional linear expansion. AU - Marensi, Elena AU - Yalniz, Gökhan AU - Hof, Björn AU - Budanur, Nazmi B ID - 12105 JF - Journal of Fluid Mechanics SN - 0022-1120 TI - Symmetry-reduced dynamic mode decomposition of near-wall turbulence VL - 954 ER - TY - JOUR AB - The concept of a “speciation continuum” has gained popularity in recent decades. It emphasizes speciation as a continuous process that may be studied by comparing contemporary population pairs that show differing levels of divergence. In their recent perspective article in Evolution, Stankowski and Ravinet provided a valuable service by formally defining the speciation continuum as a continuum of reproductive isolation, based on opinions gathered from a survey of speciation researchers. While we agree that the speciation continuum has been a useful concept to advance the understanding of the speciation process, some intrinsic limitations exist. Here, we advocate for a multivariate extension, the speciation hypercube, first proposed by Dieckmann et al. in 2004, but rarely used since. We extend the idea of the speciation cube and suggest it has strong conceptual and practical advantages over a one-dimensional model. We illustrate how the speciation hypercube can be used to visualize and compare different speciation trajectories, providing new insights into the processes and mechanisms of speciation. A key strength of the speciation hypercube is that it provides a unifying framework for speciation research, as it allows questions from apparently disparate subfields to be addressed in a single conceptual model. AU - Bolnick, Daniel I. AU - Hund, Amanda K. AU - Nosil, Patrik AU - Peng, Foen AU - Ravinet, Mark AU - Stankowski, Sean AU - Subramanian, Swapna AU - Wolf, Jochen B.W. AU - Yukilevich, Roman ID - 12514 IS - 1 JF - Evolution: International journal of organic evolution TI - A multivariate view of the speciation continuum VL - 77 ER - TY - CONF AB - The limited exchange between human communities is a key factor in preventing the spread of COVID-19. This paper introduces a digital framework that combines an integration of real mobility data at the country scale with a series of modeling techniques and visual capabilities that highlight mobility patterns before and during the pandemic. The findings not only significantly exhibit mobility trends and different degrees of similarities at regional and local levels but also provide potential insight into the emergence of a pandemic on human behavior patterns and their likely socio-economic impacts. AU - Forghani, Mohammad AU - Claramunt, Christophe AU - Karimipour, Farid AU - Heiler, Georg ID - 12548 T2 - 2022 IEEE International Conference on Data Mining Workshops TI - Visual analytics of mobility network changes observed using mobile phone data during COVID-19 pandemic ER - TY - JOUR AB - he approximate graph coloring problem, whose complexity is unresolved in most cases, concerns finding a c-coloring of a graph that is promised to be k-colorable, where c≥k. This problem naturally generalizes to promise graph homomorphism problems and further to promise constraint satisfaction problems. The complexity of these problems has recently been studied through an algebraic approach. In this paper, we introduce two new techniques to analyze the complexity of promise CSPs: one is based on topology and the other on adjunction. We apply these techniques, together with the previously introduced algebraic approach, to obtain new unconditional NP-hardness results for a significant class of approximate graph coloring and promise graph homomorphism problems. AU - Krokhin, Andrei AU - Opršal, Jakub AU - Wrochna, Marcin AU - Živný, Stanislav ID - 12563 IS - 1 JF - SIAM Journal on Computing KW - General Mathematics KW - General Computer Science SN - 0097-5397 TI - Topology and adjunction in promise constraint satisfaction VL - 52 ER - TY - JOUR AB - We study active surface wetting using a minimal model of bacteria that takes into account the intrinsic motility diversity of living matter. A mixture of “fast” and “slow” self-propelled Brownian particles is considered in the presence of a wall. The evolution of the wetting layer thickness shows an overshoot before stationarity and its composition evolves in two stages, equilibrating after a slow elimination of excess particles. Nonmonotonic evolutions are shown to arise from delayed avalanches towards the dilute phase combined with the emergence of a transient particle front. AU - Rojas Vega, Mauricio Nicolas AU - De Castro, Pablo AU - Soto, Rodrigo ID - 12545 IS - 1 JF - Physical Review E SN - 2470-0045 TI - Wetting dynamics by mixtures of fast and slow self-propelled particles VL - 107 ER - TY - JOUR AB - Let k be a number field and X a smooth, geometrically integral quasi-projective variety over k. For any linear algebraic group G over k and any G-torsor g : Z → X, we observe that if the étale-Brauer obstruction is the only one for strong approximation off a finite set of places S for all twists of Z by elements in H^1(k, G), then the étale-Brauer obstruction is the only one for strong approximation off a finite set of places S for X. As an application, we show that any homogeneous space of the form G/H with G a connected linear algebraic group over k satisfies strong approximation off the infinite places with étale-Brauer obstruction, under some compactness assumptions when k is totally real. We also prove more refined strong approximation results for homogeneous spaces of the form G/H with G semisimple simply connected and H finite, using the theory of torsors and descent. AU - Balestrieri, Francesca ID - 12427 IS - 3 JF - Proceedings of the American Mathematical Society SN - 0002-9939 TI - Some remarks on strong approximation and applications to homogeneous spaces of linear algebraic groups VL - 151 ER - TY - JOUR AB - In this issue of Neuron, Espinosa-Medina et al.1 present the TEMPO (Temporal Encoding and Manipulation in a Predefined Order) system, which enables the marking and genetic manipulation of sequentially generated cell lineages in vertebrate species in vivo. AU - Villalba Requena, Ana AU - Hippenmeyer, Simon ID - 12542 IS - 3 JF - Neuron TI - Going back in time with TEMPO VL - 111 ER - TY - JOUR AB - Single-molecule localization microscopy (SMLM) greatly advances structural studies of diverse biological tissues. For example, presynaptic active zone (AZ) nanotopology is resolved in increasing detail. Immunofluorescence imaging of AZ proteins usually relies on epitope preservation using aldehyde-based immunocompetent fixation. Cryofixation techniques, such as high-pressure freezing (HPF) and freeze substitution (FS), are widely used for ultrastructural studies of presynaptic architecture in electron microscopy (EM). HPF/FS demonstrated nearer-to-native preservation of AZ ultrastructure, e.g., by facilitating single filamentous structures. Here, we present a protocol combining the advantages of HPF/FS and direct stochastic optical reconstruction microscopy (dSTORM) to quantify nanotopology of the AZ scaffold protein Bruchpilot (Brp) at neuromuscular junctions (NMJs) of Drosophila melanogaster. Using this standardized model, we tested for preservation of Brp clusters in different FS protocols compared to classical aldehyde fixation. In HPF/FS samples, presynaptic boutons were structurally well preserved with ~22% smaller Brp clusters that allowed quantification of subcluster topology. In summary, we established a standardized near-to-native preparation and immunohistochemistry protocol for SMLM analyses of AZ protein clusters in a defined model synapse. Our protocol could be adapted to study protein arrangements at single-molecule resolution in other intact tissue preparations. AU - Mrestani, Achmed AU - Lichter, Katharina AU - Sirén, Anna Leena AU - Heckmann, Manfred AU - Paul, Mila M. AU - Pauli, Martin ID - 12567 IS - 3 JF - International Journal of Molecular Sciences TI - Single-molecule localization microscopy of presynaptic active zones in Drosophila melanogaster after rapid cryofixation VL - 24 ER - TY - JOUR AB - Approximate agreement is one of the few variants of consensus that can be solved in a wait-free manner in asynchronous systems where processes communicate by reading and writing to shared memory. In this work, we consider a natural generalisation of approximate agreement on arbitrary undirected connected graphs. Each process is given a node of the graph as input and, if non-faulty, must output a node such that – all the outputs are within distance 1 of one another, and – each output value lies on a shortest path between two input values. From prior work, it is known that there is no wait-free algorithm among processes for this problem on any cycle of length , by reduction from 2-set agreement (Castañeda et al., 2018). In this work, we investigate the solvability of this task on general graphs. We give a new, direct proof of the impossibility of approximate agreement on cycles of length , via a generalisation of Sperner's Lemma to convex polygons. We also extend the reduction from 2-set agreement to a larger class of graphs, showing that approximate agreement on these graphs is unsolvable. On the positive side, we present a wait-free algorithm for a different class of graphs, which properly contains the class of chordal graphs. AU - Alistarh, Dan-Adrian AU - Ellen, Faith AU - Rybicki, Joel ID - 12566 IS - 2 JF - Theoretical Computer Science SN - 0304-3975 TI - Wait-free approximate agreement on graphs VL - 948 ER - TY - JOUR AB - The dissolution of minute concentration of polymers in wall-bounded flows is well-known for its unparalleled ability to reduce turbulent friction drag. Another phenomenon, elasto-inertial turbulence (EIT), has been far less studied even though elastic instabilities have already been observed in dilute polymer solutions before the discovery of polymer drag reduction. EIT is a chaotic state driven by polymer dynamics that is observed across many orders of magnitude in Reynolds number. It involves energy transfer from small elastic scales to large flow scales. The investigation of the mechanisms of EIT offers the possibility to better understand other complex phenomena such as elastic turbulence and maximum drag reduction. In this review, we survey recent research efforts that are advancing the understanding of the dynamics of EIT. We highlight the fundamental differences between EIT and Newtonian/inertial turbulence from the perspective of experiments, numerical simulations, instabilities, and coherent structures. Finally, we discuss the possible links between EIT and elastic turbulence and polymer drag reduction, as well as the remaining challenges in unraveling the self-sustaining mechanism of EIT. AU - Dubief, Yves AU - Terrapon, Vincent E. AU - Hof, Björn ID - 12681 IS - 1 JF - Annual Review of Fluid Mechanics SN - 0066-4189 TI - Elasto-inertial turbulence VL - 55 ER - TY - JOUR AB - Since the seminal studies by Osborne Reynolds in the nineteenth century, pipe flow has served as a primary prototype for investigating the transition to turbulence in wall-bounded flows. Despite the apparent simplicity of this flow, various facets of this problem have occupied researchers for more than a century. Here we review insights from three distinct perspectives: (a) stability and susceptibility of laminar flow, (b) phase transition and spatiotemporal dynamics, and (c) dynamical systems analysis of the Navier—Stokes equations. We show how these perspectives have led to a profound understanding of the onset of turbulence in pipe flow. Outstanding open points, applications to flows of complex fluids, and similarities with other wall-bounded flows are discussed. AU - Avila, Marc AU - Barkley, Dwight AU - Hof, Björn ID - 12682 JF - Annual Review of Fluid Mechanics SN - 0066-4189 TI - Transition to turbulence in pipe flow VL - 55 ER - TY - JOUR AB - Self-organisation is the spontaneous emergence of spatio-temporal structures and patterns from the interaction of smaller individual units. Examples are found across many scales in very different systems and scientific disciplines, from physics, materials science and robotics to biology, geophysics and astronomy. Recent research has highlighted how self-organisation can be both mediated and controlled by confinement. Confinement is an action over a system that limits its units’ translational and rotational degrees of freedom, thus also influencing the system's phase space probability density; it can function as either a catalyst or inhibitor of self-organisation. Confinement can then become a means to actively steer the emergence or suppression of collective phenomena in space and time. Here, to provide a common framework and perspective for future research, we examine the role of confinement in the self-organisation of soft-matter systems and identify overarching scientific challenges that need to be addressed to harness its full scientific and technological potential in soft matter and related fields. By drawing analogies with other disciplines, this framework will accelerate a common deeper understanding of self-organisation and trigger the development of innovative strategies to steer it using confinement, with impact on, e.g., the design of smarter materials, tissue engineering for biomedicine and in guiding active matter. AU - Araújo, Nuno A.M. AU - Janssen, Liesbeth M.C. AU - Barois, Thomas AU - Boffetta, Guido AU - Cohen, Itai AU - Corbetta, Alessandro AU - Dauchot, Olivier AU - Dijkstra, Marjolein AU - Durham, William M. AU - Dussutour, Audrey AU - Garnier, Simon AU - Gelderblom, Hanneke AU - Golestanian, Ramin AU - Isa, Lucio AU - Koenderink, Gijsje H. AU - Löwen, Hartmut AU - Metzler, Ralf AU - Polin, Marco AU - Royall, C. Patrick AU - Šarić, Anđela AU - Sengupta, Anupam AU - Sykes, Cécile AU - Trianni, Vito AU - Tuval, Idan AU - Vogel, Nicolas AU - Yeomans, Julia M. AU - Zuriguel, Iker AU - Marin, Alvaro AU - Volpe, Giorgio ID - 12708 JF - Soft Matter SN - 1744-683X TI - Steering self-organisation through confinement VL - 19 ER - TY - JOUR AB - Hydrocarbon mixtures are extremely abundant in the Universe, and diamond formation from them can play a crucial role in shaping the interior structure and evolution of planets. With first-principles accuracy, we first estimate the melting line of diamond, and then reveal the nature of chemical bonding in hydrocarbons at extreme conditions. We finally establish the pressure-temperature phase boundary where it is thermodynamically possible for diamond to form from hydrocarbon mixtures with different atomic fractions of carbon. Notably, here we show a depletion zone at pressures above 200 GPa and temperatures below 3000 K-3500 K where diamond formation is thermodynamically favorable regardless of the carbon atomic fraction, due to a phase separation mechanism. The cooler condition of the interior of Neptune compared to Uranus means that the former is much more likely to contain the depletion zone. Our findings can help explain the dichotomy of the two ice giants manifested by the low luminosity of Uranus, and lead to a better understanding of (exo-)planetary formation and evolution. AU - Cheng, Bingqing AU - Hamel, Sebastien AU - Bethkenhagen, Mandy ID - 12702 JF - Nature Communications TI - Thermodynamics of diamond formation from hydrocarbon mixtures in planets VL - 14 ER - TY - JOUR AB - Background Epigenetic clocks can track both chronological age (cAge) and biological age (bAge). The latter is typically defined by physiological biomarkers and risk of adverse health outcomes, including all-cause mortality. As cohort sample sizes increase, estimates of cAge and bAge become more precise. Here, we aim to develop accurate epigenetic predictors of cAge and bAge, whilst improving our understanding of their epigenomic architecture. Methods First, we perform large-scale (N = 18,413) epigenome-wide association studies (EWAS) of chronological age and all-cause mortality. Next, to create a cAge predictor, we use methylation data from 24,674 participants from the Generation Scotland study, the Lothian Birth Cohorts (LBC) of 1921 and 1936, and 8 other cohorts with publicly available data. In addition, we train a predictor of time to all-cause mortality as a proxy for bAge using the Generation Scotland cohort (1214 observed deaths). For this purpose, we use epigenetic surrogates (EpiScores) for 109 plasma proteins and the 8 component parts of GrimAge, one of the current best epigenetic predictors of survival. We test this bAge predictor in four external cohorts (LBC1921, LBC1936, the Framingham Heart Study and the Women’s Health Initiative study). Results Through the inclusion of linear and non-linear age-CpG associations from the EWAS, feature pre-selection in advance of elastic net regression, and a leave-one-cohort-out (LOCO) cross-validation framework, we obtain cAge prediction with a median absolute error equal to 2.3 years. Our bAge predictor was found to slightly outperform GrimAge in terms of the strength of its association to survival (HRGrimAge = 1.47 [1.40, 1.54] with p = 1.08 × 10−52, and HRbAge = 1.52 [1.44, 1.59] with p = 2.20 × 10−60). Finally, we introduce MethylBrowsR, an online tool to visualise epigenome-wide CpG-age associations. Conclusions The integration of multiple large datasets, EpiScores, non-linear DNAm effects, and new approaches to feature selection has facilitated improvements to the blood-based epigenetic prediction of biological and chronological age. AU - Bernabeu, Elena AU - Mccartney, Daniel L. AU - Gadd, Danni A. AU - Hillary, Robert F. AU - Lu, Ake T. AU - Murphy, Lee AU - Wrobel, Nicola AU - Campbell, Archie AU - Harris, Sarah E. AU - Liewald, David AU - Hayward, Caroline AU - Sudlow, Cathie AU - Cox, Simon R. AU - Evans, Kathryn L. AU - Horvath, Steve AU - Mcintosh, Andrew M. AU - Robinson, Matthew Richard AU - Vallejos, Catalina A. AU - Marioni, Riccardo E. ID - 12719 JF - Genome Medicine TI - Refining epigenetic prediction of chronological and biological age VL - 15 ER - TY - JOUR AB - Adversarial training (i.e., training on adversarially perturbed input data) is a well-studied method for making neural networks robust to potential adversarial attacks during inference. However, the improved robustness does not come for free but rather is accompanied by a decrease in overall model accuracy and performance. Recent work has shown that, in practical robot learning applications, the effects of adversarial training do not pose a fair trade-off but inflict a net loss when measured in holistic robot performance. This work revisits the robustness-accuracy trade-off in robot learning by systematically analyzing if recent advances in robust training methods and theory in conjunction with adversarial robot learning, are capable of making adversarial training suitable for real-world robot applications. We evaluate three different robot learning tasks ranging from autonomous driving in a high-fidelity environment amenable to sim-to-real deployment to mobile robot navigation and gesture recognition. Our results demonstrate that, while these techniques make incremental improvements on the trade-off on a relative scale, the negative impact on the nominal accuracy caused by adversarial training still outweighs the improved robustness by an order of magnitude. We conclude that although progress is happening, further advances in robust learning methods are necessary before they can benefit robot learning tasks in practice. AU - Lechner, Mathias AU - Amini, Alexander AU - Rus, Daniela AU - Henzinger, Thomas A ID - 12704 IS - 3 JF - IEEE Robotics and Automation Letters TI - Revisiting the adversarial robustness-accuracy tradeoff in robot learning VL - 8 ER - TY - JOUR AB - The substitution of heavier, more metallic atoms into classical organic ligand frameworks provides an important strategy for tuning ligand properties, such as ligand bite and donor character, and is the basis for the emerging area of main-group supramolecular chemistry. In this paper, we explore two new ligands [E(2-Me-8-qy)3] [E = Sb (1), Bi (2); qy = quinolyl], allowing a fundamental comparison of their coordination behavior with classical tris(2-pyridyl) ligands of the type [E′(2-py)3] (E = a range of bridgehead atoms and groups, py = pyridyl). A range of new coordination modes to Cu+, Ag+, and Au+ is seen for 1 and 2, in the absence of steric constraints at the bridgehead and with their more remote N-donor atoms. A particular feature is the adaptive nature of these new ligands, with the ability to adjust coordination mode in response to the hard–soft character of coordinated metal ions, influenced also by the character of the bridgehead atom (Sb or Bi). These features can be seen in a comparison between [Cu2{Sb(2-Me-8-qy)3}2](PF6)2 (1·CuPF6) and [Cu{Bi(2-Me-8-qy)3}](PF6) (2·CuPF6), the first containing a dimeric cation in which 1 adopts an unprecedented intramolecular N,N,Sb-coordination mode while in the second, 2 adopts an unusual N,N,(π-)C coordination mode. In contrast, the previously reported analogous ligands [E(6-Me-2-py)3] (E = Sb, Bi; 2-py = 2-pyridyl) show a tris-chelating mode in their complexes with CuPF6, which is typical for the extensive tris(2-pyridyl) family with a range of metals. The greater polarity of the Bi–C bond in 2 results in ligand transfer reactions with Au(I). Although this reactivity is not in itself unusual, the characterization of several products by single-crystal X-ray diffraction provides snapshots of the ligand transfer reaction involved, with one of the products (the bimetallic complex [(BiCl){ClAu2(2-Me-8-qy)3}] (8)) containing a Au2Bi core in which the shortest Au → Bi donor–acceptor bond to date is observed. AU - García-Romero, Álvaro AU - Waters, Jessica E. AU - Jethwa, Rajesh B AU - Bond, Andrew D. AU - Colebatch, Annie L. AU - García-Rodríguez, Raúl AU - Wright, Dominic S. ID - 12737 IS - 11 JF - Inorganic Chemistry SN - 0020-1669 TI - Highly adaptive nature of group 15 tris(quinolyl) ligands─studies with coinage metals VL - 62 ER - TY - JOUR AB - Lead halide perovskites enjoy a number of remarkable optoelectronic properties. To explain their origin, it is necessary to study how electromagnetic fields interact with these systems. We address this problem here by studying two classical quantities: Faraday rotation and the complex refractive index in a paradigmatic perovskite CH3NH3PbBr3 in a broad wavelength range. We find that the minimal coupling of electromagnetic fields to the k⋅p Hamiltonian is insufficient to describe the observed data even on the qualitative level. To amend this, we demonstrate that there exists a relevant atomic-level coupling between electromagnetic fields and the spin degree of freedom. This spin-electric coupling allows for quantitative description of a number of previous as well as present experimental data. In particular, we use it here to show that the Faraday effect in lead halide perovskites is dominated by the Zeeman splitting of the energy levels and has a substantial beyond-Becquerel contribution. Finally, we present general symmetry-based phenomenological arguments that in the low-energy limit our effective model includes all basis coupling terms to the electromagnetic field in the linear order. AU - Volosniev, Artem AU - Shiva Kumar, Abhishek AU - Lorenc, Dusan AU - Ashourishokri, Younes AU - Zhumekenov, Ayan A. AU - Bakr, Osman M. AU - Lemeshko, Mikhail AU - Alpichshev, Zhanybek ID - 12723 IS - 10 JF - Physical Review Letters KW - General Physics and Astronomy SN - 0031-9007 TI - Spin-electric coupling in lead halide perovskites VL - 130 ER - TY - JOUR AB - We use general symmetry-based arguments to construct an effective model suitable for studying optical properties of lead halide perovskites. To build the model, we identify an atomic-level interaction between electromagnetic fields and the spin degree of freedom that should be added to a minimally coupled k⋅p Hamiltonian. As a first application, we study two basic optical characteristics of the material: the Verdet constant and the refractive index. Beyond these linear characteristics of the material, the model is suitable for calculating nonlinear effects such as the third-order optical susceptibility. Analysis of this quantity shows that the geometrical properties of the spin-electric term imply isotropic optical response of the system, and that optical anisotropy of lead halide perovskites is a manifestation of hopping of charge carriers. To illustrate this, we discuss third-harmonic generation. AU - Volosniev, Artem AU - Shiva Kumar, Abhishek AU - Lorenc, Dusan AU - Ashourishokri, Younes AU - Zhumekenov, Ayan AU - Bakr, Osman M. AU - Lemeshko, Mikhail AU - Alpichshev, Zhanybek ID - 12724 IS - 12 JF - Physical Review B SN - 2469-9950 TI - Effective model for studying optical properties of lead halide perovskites VL - 107 ER - TY - JOUR AB - Stereological methods for estimating the 3D particle size and density from 2D projections are essential to many research fields. These methods are, however, prone to errors arising from undetected particle profiles due to sectioning and limited resolution, known as ‘lost caps’. A potential solution developed by Keiding, Jensen, and Ranek in 1972, which we refer to as the Keiding model, accounts for lost caps by quantifying the smallest detectable profile in terms of its limiting ‘cap angle’ (ϕ), a size-independent measure of a particle’s distance from the section surface. However, this simple solution has not been widely adopted nor tested. Rather, model-independent design-based stereological methods, which do not explicitly account for lost caps, have come to the fore. Here, we provide the first experimental validation of the Keiding model by comparing the size and density of particles estimated from 2D projections with direct measurement from 3D EM reconstructions of the same tissue. We applied the Keiding model to estimate the size and density of somata, nuclei and vesicles in the cerebellum of mice and rats, where high packing density can be problematic for design-based methods. Our analysis reveals a Gaussian distribution for ϕ rather than a single value. Nevertheless, curve fits of the Keiding model to the 2D diameter distribution accurately estimate the mean ϕ and 3D diameter distribution. While systematic testing using simulations revealed an upper limit to determining ϕ, our analysis shows that estimated ϕ can be used to determine the 3D particle density from the 2D density under a wide range of conditions, and this method is potentially more accurate than minimum-size-based lost-cap corrections and disector methods. Our results show the Keiding model provides an efficient means of accurately estimating the size and density of particles from 2D projections even under conditions of a high density. AU - Rothman, Jason Seth AU - Borges Merjane, Carolina AU - Holderith, Noemi AU - Jonas, Peter M AU - Angus Silver, R. ID - 12759 IS - 3 March JF - PLoS ONE TI - Validation of a stereological method for estimating particle size and density from 2D projections with high accuracy VL - 18 ER - TY - JOUR AB - ESCRT-III family proteins form composite polymers that deform and cut membrane tubes in the context of a wide range of cell biological processes across the tree of life. In reconstituted systems, sequential changes in the composition of ESCRT-III polymers induced by the AAA–adenosine triphosphatase Vps4 have been shown to remodel membranes. However, it is not known how composite ESCRT-III polymers are organized and remodeled in space and time in a cellular context. Taking advantage of the relative simplicity of the ESCRT-III–dependent division system in Sulfolobus acidocaldarius, one of the closest experimentally tractable prokaryotic relatives of eukaryotes, we use super-resolution microscopy, electron microscopy, and computational modeling to show how CdvB/CdvB1/CdvB2 proteins form a precisely patterned composite ESCRT-III division ring, which undergoes stepwise Vps4-dependent disassembly and contracts to cut cells into two. These observations lead us to suggest sequential changes in a patterned composite polymer as a general mechanism of ESCRT-III–dependent membrane remodeling. AU - Hurtig, Fredrik AU - Burgers, Thomas C.Q. AU - Cezanne, Alice AU - Jiang, Xiuyun AU - Mol, Frank N. AU - Traparić, Jovan AU - Pulschen, Andre Arashiro AU - Nierhaus, Tim AU - Tarrason-Risa, Gabriel AU - Harker-Kirschneck, Lena AU - Löwe, Jan AU - Šarić, Anđela AU - Vlijm, Rifka AU - Baum, Buzz ID - 12756 IS - 11 JF - Science Advances TI - The patterned assembly and stepwise Vps4-mediated disassembly of composite ESCRT-III polymers drives archaeal cell division VL - 9 ER - TY - JOUR AB - AlphaFold changed the field of structural biology by achieving three-dimensional (3D) structure prediction from protein sequence at experimental quality. The astounding success even led to claims that the protein folding problem is “solved”. However, protein folding problem is more than just structure prediction from sequence. Presently, it is unknown if the AlphaFold-triggered revolution could help to solve other problems related to protein folding. Here we assay the ability of AlphaFold to predict the impact of single mutations on protein stability (ΔΔG) and function. To study the question we extracted the pLDDT and metrics from AlphaFold predictions before and after single mutation in a protein and correlated the predicted change with the experimentally known ΔΔG values. Additionally, we correlated the same AlphaFold pLDDT metrics with the impact of a single mutation on structure using a large scale dataset of single mutations in GFP with the experimentally assayed levels of fluorescence. We found a very weak or no correlation between AlphaFold output metrics and change of protein stability or fluorescence. Our results imply that AlphaFold may not be immediately applied to other problems or applications in protein folding. AU - Pak, Marina A. AU - Markhieva, Karina A. AU - Novikova, Mariia S. AU - Petrov, Dmitry S. AU - Vorobyev, Ilya S. AU - Maksimova, Ekaterina AU - Kondrashov, Fyodor AU - Ivankov, Dmitry N. ID - 12758 IS - 3 JF - PLoS ONE TI - Using AlphaFold to predict the impact of single mutations on protein stability and function VL - 18 ER - TY - JOUR AB - My group and myself have studied respiratory complex I for almost 30 years, starting in 1994 when it was known as a L-shaped giant ‘black box' of bioenergetics. First breakthrough was the X-ray structure of the peripheral arm, followed by structures of the membrane arm and finally the entire complex from Thermus thermophilus. The developments in cryo-EM technology allowed us to solve the first complete structure of the twice larger, ∼1 MDa mammalian enzyme in 2016. However, the mechanism coupling, over large distances, the transfer of two electrons to pumping of four protons across the membrane remained an enigma. Recently we have solved high-resolution structures of mammalian and bacterial complex I under a range of redox conditions, including catalytic turnover. This allowed us to propose a robust and universal mechanism for complex I and related protein families. Redox reactions initially drive conformational changes around the quinone cavity and a long-distance transfer of substrate protons. These set up a stage for a series of electrostatically driven proton transfers along the membrane arm (‘domino effect'), eventually resulting in proton expulsion from the distal antiporter-like subunit. The mechanism radically differs from previous suggestions, however, it naturally explains all the unusual structural features of complex I. In this review I discuss the state of knowledge on complex I, including the current most controversial issues. AU - Sazanov, Leonid A ID - 12757 IS - 5 JF - The Biochemical Journal SN - 0264-6021 TI - From the 'black box' to 'domino effect' mechanism: What have we learned from the structures of respiratory complex I VL - 480 ER - TY - JOUR AB - Populations evolve in spatially heterogeneous environments. While a certain trait might bring a fitness advantage in some patch of the environment, a different trait might be advantageous in another patch. Here, we study the Moran birth–death process with two types of individuals in a population stretched across two patches of size N, each patch favouring one of the two types. We show that the long-term fate of such populations crucially depends on the migration rate μ between the patches. To classify the possible fates, we use the distinction between polynomial (short) and exponential (long) timescales. We show that when μ is high then one of the two types fixates on the whole population after a number of steps that is only polynomial in N. By contrast, when μ is low then each type holds majority in the patch where it is favoured for a number of steps that is at least exponential in N. Moreover, we precisely identify the threshold migration rate μ⋆ that separates those two scenarios, thereby exactly delineating the situations that support long-term coexistence of the two types. We also discuss the case of various cycle graphs and we present computer simulations that perfectly match our analytical results. AU - Svoboda, Jakub AU - Tkadlec, Josef AU - Kaveh, Kamran AU - Chatterjee, Krishnendu ID - 12787 IS - 2271 JF - Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences SN - 1364-5021 TI - Coexistence times in the Moran process with environmental heterogeneity VL - 479 ER - TY - JOUR AB - We show that the simplest of existing molecules—closed-shell diatomics not interacting with one another—host topological charges when driven by periodic far-off-resonant laser pulses. A periodically kicked molecular rotor can be mapped onto a “crystalline” lattice in angular momentum space. This allows us to define quasimomenta and the band structure in the Floquet representation, by analogy with the Bloch waves of solid-state physics. Applying laser pulses spaced by 1/3 of the molecular rotational period creates a lattice with three atoms per unit cell with staggered hopping. Within the synthetic dimension of the laser strength, we discover Dirac cones with topological charges. These Dirac cones, topologically protected by reflection and time-reversal symmetry, are reminiscent of (although not equivalent to) that seen in graphene. They—and the corresponding edge states—are broadly tunable by adjusting the laser strength and can be observed in present-day experiments by measuring molecular alignment and populations of rotational levels. This paves the way to study controllable topological physics in gas-phase experiments with small molecules as well as to classify dynamical molecular states by their topological invariants. AU - Karle, Volker AU - Ghazaryan, Areg AU - Lemeshko, Mikhail ID - 12788 IS - 10 JF - Physical Review Letters SN - 0031-9007 TI - Topological charges of periodically kicked molecules VL - 130 ER - TY - JOUR AB - Motivated by the recent discoveries of superconductivity in bilayer and trilayer graphene, we theoretically investigate superconductivity and other interaction-driven phases in multilayer graphene stacks. To this end, we study the density of states of multilayer graphene with up to four layers at the single-particle band structure level in the presence of a transverse electric field. Among the considered structures, tetralayer graphene with rhombohedral (ABCA) stacking reaches the highest density of states. We study the phases that can arise in ABCA graphene by tuning the carrier density and transverse electric field. For a broad region of the tuning parameters, the presence of strong Coulomb repulsion leads to a spontaneous spin and valley symmetry breaking via Stoner transitions. Using a model that incorporates the spontaneous spin and valley polarization, we explore the Kohn-Luttinger mechanism for superconductivity driven by repulsive Coulomb interactions. We find that the strongest superconducting instability is in the p-wave channel, and occurs in proximity to the onset of Stoner transitions. Interestingly, we find a range of densities and transverse electric fields where superconductivity develops out of a strongly corrugated, singly connected Fermi surface in each valley, leading to a topologically nontrivial chiral p+ip superconducting state with an even number of copropagating chiral Majorana edge modes. Our work establishes ABCA-stacked tetralayer graphene as a promising platform for observing strongly correlated physics and topological superconductivity. AU - Ghazaryan, Areg AU - Holder, Tobias AU - Berg, Erez AU - Serbyn, Maksym ID - 12790 IS - 10 JF - Physical Review B SN - 2469-9950 TI - Multilayer graphenes as a platform for interaction-driven physics and topological superconductivity VL - 107 ER - TY - JOUR AB - We investigate the capabilities of Physics-Informed Neural Networks (PINNs) to reconstruct turbulent Rayleigh–Bénard flows using only temperature information. We perform a quantitative analysis of the quality of the reconstructions at various amounts of low-passed-filtered information and turbulent intensities. We compare our results with those obtained via nudging, a classical equation-informed data assimilation technique. At low Rayleigh numbers, PINNs are able to reconstruct with high precision, comparable to the one achieved with nudging. At high Rayleigh numbers, PINNs outperform nudging and are able to achieve satisfactory reconstruction of the velocity fields only when data for temperature is provided with high spatial and temporal density. When data becomes sparse, the PINNs performance worsens, not only in a point-to-point error sense but also, and contrary to nudging, in a statistical sense, as can be seen in the probability density functions and energy spectra. AU - Clark Di Leoni, Patricio AU - Agasthya, Lokahith N AU - Buzzicotti, Michele AU - Biferale, Luca ID - 12791 IS - 3 JF - The European Physical Journal E SN - 1292-8941 TI - Reconstructing Rayleigh–Bénard flows out of temperature-only measurements using Physics-Informed Neural Networks VL - 46 ER - TY - JOUR AB - Interstitial fluid (IF) accumulation between embryonic cells is thought to be important for embryo patterning and morphogenesis. Here, we identify a positive mechanical feedback loop between cell migration and IF relocalization and find that it promotes embryonic axis formation during zebrafish gastrulation. We show that anterior axial mesendoderm (prechordal plate [ppl]) cells, moving in between the yolk cell and deep cell tissue to extend the embryonic axis, compress the overlying deep cell layer, thereby causing IF to flow from the deep cell layer to the boundary between the yolk cell and the deep cell layer, directly ahead of the advancing ppl. This IF relocalization, in turn, facilitates ppl cell protrusion formation and migration by opening up the space into which the ppl moves and, thereby, the ability of the ppl to trigger IF relocalization by pushing against the overlying deep cell layer. Thus, embryonic axis formation relies on a hydraulic feedback loop between cell migration and IF relocalization. AU - Huljev, Karla AU - Shamipour, Shayan AU - Nunes Pinheiro, Diana C AU - Preusser, Friedrich AU - Steccari, Irene AU - Sommer, Christoph M AU - Naik, Suyash AU - Heisenberg, Carl-Philipp J ID - 12830 IS - 7 JF - Developmental Cell SN - 1534-5807 TI - A hydraulic feedback loop between mesendoderm cell migration and interstitial fluid relocalization promotes embryonic axis formation in zebrafish VL - 58 ER -