TY - JOUR AB - For a locally finite set in R2, the order-k Brillouin tessellations form an infinite sequence of convex face-to-face tilings of the plane. If the set is coarsely dense and generic, then the corresponding infinite sequences of minimum and maximum angles are both monotonic in k. As an example, a stationary Poisson point process in R2 is locally finite, coarsely dense, and generic with probability one. For such a set, the distributions of angles in the Voronoi tessellations, Delaunay mosaics, and Brillouin tessellations are independent of the order and can be derived from the formula for angles in order-1 Delaunay mosaics given by Miles (Math. Biosci. 6, 85–127 (1970)). AU - Edelsbrunner, Herbert AU - Garber, Alexey AU - Ghafari, Mohadese AU - Heiss, Teresa AU - Saghafian, Morteza ID - 14345 JF - Discrete and Computational Geometry SN - 0179-5376 TI - On angles in higher order Brillouin tessellations and related tilings in the plane ER - TY - JOUR AB - Branching morphogenesis is a ubiquitous process that gives rise to high exchange surfaces in the vasculature and epithelial organs. Lymphatic capillaries form branched networks, which play a key role in the circulation of tissue fluid and immune cells. Although mouse models and correlative patient data indicate that the lymphatic capillary density directly correlates with functional output, i.e., tissue fluid drainage and trafficking efficiency of dendritic cells, the mechanisms ensuring efficient tissue coverage remain poorly understood. Here, we use the mouse ear pinna lymphatic vessel network as a model system and combine lineage-tracing, genetic perturbations, whole-organ reconstructions and theoretical modeling to show that the dermal lymphatic capillaries tile space in an optimal, space-filling manner. This coverage is achieved by two complementary mechanisms: initial tissue invasion provides a non-optimal global scaffold via self-organized branching morphogenesis, while VEGF-C dependent side-branching from existing capillaries rapidly optimizes local coverage by directionally targeting low-density regions. With these two ingredients, we show that a minimal biophysical model can reproduce quantitatively whole-network reconstructions, across development and perturbations. Our results show that lymphatic capillary networks can exploit local self-organizing mechanisms to achieve tissue-scale optimization. AU - Ucar, Mehmet C AU - Hannezo, Edouard B AU - Tiilikainen, Emmi AU - Liaqat, Inam AU - Jakobsson, Emma AU - Nurmi, Harri AU - Vaahtomeri, Kari ID - 14378 JF - Nature Communications TI - Self-organized and directed branching results in optimal coverage in developing dermal lymphatic networks VL - 14 ER - TY - JOUR AB - Whether one considers swarming insects, flocking birds, or bacterial colonies, collective motion arises from the coordination of individuals and entails the adjustment of their respective velocities. In particular, in close confinements, such as those encountered by dense cell populations during development or regeneration, collective migration can only arise coordinately. Yet, how individuals unify their velocities is often not understood. Focusing on a finite number of cells in circular confinements, we identify waves of polymerizing actin that function as a pacemaker governing the speed of individual cells. We show that the onset of collective motion coincides with the synchronization of the wave nucleation frequencies across the population. Employing a simpler and more readily accessible mechanical model system of active spheres, we identify the synchronization of the individuals’ internal oscillators as one of the essential requirements to reach the corresponding collective state. The mechanical ‘toy’ experiment illustrates that the global synchronous state is achieved by nearest neighbor coupling. We suggest by analogy that local coupling and the synchronization of actin waves are essential for the emergent, self-organized motion of cell collectives. AU - Riedl, Michael AU - Mayer, Isabelle D AU - Merrin, Jack AU - Sixt, Michael K AU - Hof, Björn ID - 14361 JF - Nature Communications TI - Synchronization in collectively moving inanimate and living active matter VL - 14 ER - TY - JOUR AB - Only recently has it been possible to construct a self-adjoint Hamiltonian that involves the creation of Dirac particles at a point source in 3d space. Its definition makes use of an interior-boundary condition. Here, we develop for this Hamiltonian a corresponding theory of the Bohmian configuration. That is, we (non-rigorously) construct a Markov jump process $(Q_t)_{t\in\mathbb{R}}$ in the configuration space of a variable number of particles that is $|\psi_t|^2$-distributed at every time t and follows Bohmian trajectories between the jumps. The jumps correspond to particle creation or annihilation events and occur either to or from a configuration with a particle located at the source. The process is the natural analog of Bell's jump process, and a central piece in its construction is the determination of the rate of particle creation. The construction requires an analysis of the asymptotic behavior of the Bohmian trajectories near the source. We find that the particle reaches the source with radial speed 0, but orbits around the source infinitely many times in finite time before absorption (or after emission). AU - Henheik, Sven Joscha AU - Tumulka, Roderich ID - 14421 IS - 44 JF - Journal of Physics A: Mathematical and Theoretical SN - 1751-8113 TI - Creation rate of Dirac particles at a point source VL - 56 ER - TY - JOUR AB - We consider the problem of computing the maximal probability of satisfying an -regular specification for stochastic, continuous-state, nonlinear systems evolving in discrete time. The problem reduces, after automata-theoretic constructions, to finding the maximal probability of satisfying a parity condition on a (possibly hybrid) state space. While characterizing the exact satisfaction probability is open, we show that a lower bound on this probability can be obtained by (I) computing an under-approximation of the qualitative winning region, i.e., states from which the parity condition can be enforced almost surely, and (II) computing the maximal probability of reaching this qualitative winning region. The heart of our approach is a technique to symbolically compute the under-approximation of the qualitative winning region in step (I) via a finite-state abstraction of the original system as a -player parity game. Our abstraction procedure uses only the support of the probabilistic evolution; it does not use precise numerical transition probabilities. We prove that the winning set in the abstract -player game induces an under-approximation of the qualitative winning region in the original synthesis problem, along with a policy to solve it. By combining these contributions with (a) a symbolic fixpoint algorithm to solve -player games and (b) existing techniques for reachability policy synthesis in stochastic nonlinear systems, we get an abstraction-based algorithm for finding a lower bound on the maximal satisfaction probability. We have implemented the abstraction-based algorithm in Mascot-SDS, where we combined the outlined abstraction step with our tool Genie (Majumdar et al., 2023) that solves -player parity games (through a reduction to Rabin games) more efficiently than existing algorithms. We evaluated our implementation on the nonlinear model of a perturbed bistable switch from the literature. We show empirically that the lower bound on the winning region computed by our approach is precise, by comparing against an over-approximation of the qualitative winning region. Moreover, our implementation outperforms a recently proposed tool for solving this problem by a large margin. AU - Majumdar, Rupak AU - Mallik, Kaushik AU - Schmuck, Anne Kathrin AU - Soudjani, Sadegh ID - 14400 JF - Nonlinear Analysis: Hybrid Systems SN - 1751-570X TI - Symbolic control for stochastic systems via finite parity games VL - 51 ER - TY - JOUR AB - Water adsorption and dissociation processes on pristine low-index TiO2 interfaces are important but poorly understood outside the well-studied anatase (101) and rutile (110). To understand these, we construct three sets of machine learning potentials that are simultaneously applicable to various TiO2 surfaces, based on three density-functional-theory approximations. Here we show the water dissociation free energies on seven pristine TiO2 surfaces, and predict that anatase (100), anatase (110), rutile (001), and rutile (011) favor water dissociation, anatase (101) and rutile (100) have mostly molecular adsorption, while the simulations of rutile (110) sensitively depend on the slab thickness and molecular adsorption is preferred with thick slabs. Moreover, using an automated algorithm, we reveal that these surfaces follow different types of atomistic mechanisms for proton transfer and water dissociation: one-step, two-step, or both. These mechanisms can be rationalized based on the arrangements of water molecules on the different surfaces. Our finding thus demonstrates that the different pristine TiO2 surfaces react with water in distinct ways, and cannot be represented using just the low-energy anatase (101) and rutile (110) surfaces. AU - Zeng, Zezhu AU - Wodaczek, Felix AU - Liu, Keyang AU - Stein, Frederick AU - Hutter, Jürg AU - Chen, Ji AU - Cheng, Bingqing ID - 14425 JF - Nature Communications TI - Mechanistic insight on water dissociation on pristine low-index TiO2 surfaces from machine learning molecular dynamics simulations VL - 14 ER - TY - JOUR AB - Squall lines are substantially influenced by the interaction of low-level shear with cold pools associated with convective downdrafts. Beyond an optimal shear amplitude, squall lines tend to orient themselves at an angle with respect to the low-level shear. While the mechanisms behind squall line orientation seem to be increasingly well understood, uncertainties remain on the implications of this orientation. Roca and Fiolleau (2020, https://doi.org/10.1038/s43247-020-00015-4) show that long lived mesoscale convective systems, including squall lines, are disproportionately involved in rainfall extremes in the tropics. This article investigates the influence of the interaction between low-level shear and squall line outflow on squall line generated precipitation extrema in the tropics. Using a cloud resolving model, simulated squall lines in radiative convective equilibrium amid a shear-dominated regime (super optimal), a balanced regime (optimal), and an outflow dominated regime (suboptimal). Our results show that precipitation extremes in squall lines are 40% more intense in the case of optimal shear and remain 30% superior in the superoptimal regime relative to a disorganized case. With a theoretical scaling of precipitation extremes (C. Muller & Takayabu, 2020, https://doi.org/10.1088/1748-9326/ab7130), we show that the condensation rates control the amplification of precipitation extremes in tropical squall lines, mainly due to its change in vertical mass flux (dynamic component). The reduction of dilution by entrainment explains half of this change, consistent with Mulholland et al. (2021, https://doi.org/10.1175/jas-d-20-0299.1). The other half is explained by increased cloud-base velocity intensity in optimal and superoptimal squall lines. AU - Abramian, Sophie AU - Muller, Caroline J AU - Risi, Camille ID - 14453 IS - 10 JF - Journal of Advances in Modeling Earth Systems TI - Extreme precipitation in tropical squall lines VL - 15 ER - TY - JOUR AB - High entropy alloys (HEAs) are highly suitable candidate catalysts for oxygen evolution and reduction reactions (OER/ORR) as they offer numerous parameters for optimizing the electronic structure and catalytic sites. Herein, FeCoNiMoW HEA nanoparticles are synthesized using a solution‐based low‐temperature approach. Such FeCoNiMoW nanoparticles show high entropy properties, subtle lattice distortions, and modulated electronic structure, leading to superior OER performance with an overpotential of 233 mV at 10 mA cm−2 and 276 mV at 100 mA cm−2. Density functional theory calculations reveal the electronic structures of the FeCoNiMoW active sites with an optimized d‐band center position that enables suitable adsorption of OOH* intermediates and reduces the Gibbs free energy barrier in the OER process. Aqueous zinc–air batteries (ZABs) based on this HEA demonstrate a high open circuit potential of 1.59 V, a peak power density of 116.9 mW cm−2, a specific capacity of 857 mAh gZn−1, and excellent stability for over 660 h of continuous charge–discharge cycles. Flexible and solid ZABs are also assembled and tested, displaying excellent charge–discharge performance at different bending angles. This work shows the significance of 4d/5d metal‐modulated electronic structure and optimized adsorption ability to improve the performance of OER/ORR, ZABs, and beyond. AU - He, Ren AU - Yang, Linlin AU - Zhang, Yu AU - Jiang, Daochuan AU - Lee, Seungho AU - Horta, Sharona AU - Liang, Zhifu AU - Lu, Xuan AU - Ostovari Moghaddam, Ahmad AU - Li, Junshan AU - Ibáñez, Maria AU - Xu, Ying AU - Zhou, Yingtang AU - Cabot, Andreu ID - 14434 JF - Advanced Materials KW - Mechanical Engineering KW - Mechanics of Materials KW - General Materials Science SN - 0935-9648 TI - A 3d‐4d‐5d high entropy alloy as a bifunctional oxygen catalyst for robust aqueous zinc–air batteries ER - TY - JOUR AB - Low‐cost, safe, and environmental‐friendly rechargeable aqueous zinc‐ion batteries (ZIBs) are promising as next‐generation energy storage devices for wearable electronics among other applications. However, sluggish ionic transport kinetics and the unstable electrode structure during ionic insertion/extraction hampers their deployment. Herein,  we propose a new cathode material based on a layered metal chalcogenide (LMC), bismuth telluride (Bi2Te3), coated with polypyrrole (PPy). Taking advantage of the PPy coating, the Bi2Te3@PPy composite presents strong ionic absorption affinity, high oxidation resistance, and high structural stability. The ZIBs based on Bi2Te3@PPy cathodes exhibit high capacities and ultra‐long lifespans of over 5000 cycles. They also present outstanding stability even under bending. In addition,  we analyze here the reaction mechanism using in situ X‐ray diffraction, X‐ray photoelectron spectroscopy, and computational tools and demonstrate that, in the aqueous system, Zn2+ is not inserted into the cathode as previously assumed. In contrast, proton charge storage dominates the process. Overall, this work not only shows the great potential of LMCs as ZIBs cathode materials and the advantages of PPy coating, but also clarifies the charge/discharge mechanism in rechargeable ZIBs based on LMCs. AU - Zeng, Guifang AU - Sun, Qing AU - Horta, Sharona AU - Wang, Shang AU - Lu, Xuan AU - Zhang, Chaoyue AU - Li, Jing AU - Li, Junshan AU - Ci, Lijie AU - Tian, Yanhong AU - Ibáñez, Maria AU - Cabot, Andreu ID - 14435 JF - Advanced Materials KW - Mechanical Engineering KW - Mechanics of Materials KW - General Materials Science SN - 0935-9648 TI - A layered Bi2Te3@PPy cathode for aqueous zinc ion batteries: Mechanism and application in printed flexible batteries ER - TY - JOUR AB - Inversions are thought to play a key role in adaptation and speciation, suppressing recombination between diverging populations. Genes influencing adaptive traits cluster in inversions, and changes in inversion frequencies are associated with environmental differences. However, in many organisms, it is unclear if inversions are geographically and taxonomically widespread. The intertidal snail, Littorina saxatilis, is one such example. Strong associations between putative polymorphic inversions and phenotypic differences have been demonstrated between two ecotypes of L. saxatilis in Sweden and inferred elsewhere, but no direct evidence for inversion polymorphism currently exists across the species range. Using whole genome data from 107 snails, most inversion polymorphisms were found to be widespread across the species range. The frequencies of some inversion arrangements were significantly different among ecotypes, suggesting a parallel adaptive role. Many inversions were also polymorphic in the sister species, L. arcana, hinting at an ancient origin. AU - Reeve, James AU - Butlin, Roger K. AU - Koch, Eva L. AU - Stankowski, Sean AU - Faria, Rui ID - 14463 JF - Molecular Ecology SN - 0962-1083 TI - Chromosomal inversion polymorphisms are widespread across the species ranges of rough periwinkles (Littorina saxatilis and L. arcana) ER - TY - JOUR AU - Narzisi, Antonio AU - Halladay, Alycia AU - Masi, Gabriele AU - Novarino, Gaia AU - Lord, Catherine ID - 14455 JF - Frontiers in Psychiatry TI - Tempering expectations: Considerations on the current state of stem cells therapy for autism treatment VL - 14 ER - TY - JOUR AB - In the paper, we establish Squash Rigidity Theorem—the dynamical spectral rigidity for piecewise analytic Bunimovich squash-type stadia whose convex arcs are homothetic. We also establish Stadium Rigidity Theorem—the dynamical spectral rigidity for piecewise analytic Bunimovich stadia whose flat boundaries are a priori fixed. In addition, for smooth Bunimovich squash-type stadia we compute the Lyapunov exponents along the maximal period two orbit, as well as the value of the Peierls’ Barrier function from the maximal marked length spectrum associated to the rotation number 2n/4n+1. AU - Chen, Jianyu AU - Kaloshin, Vadim AU - Zhang, Hong Kun ID - 14427 JF - Communications in Mathematical Physics SN - 0010-3616 TI - Length spectrum rigidity for piecewise analytic Bunimovich billiards ER - TY - JOUR AB - Given a triangle Δ, we study the problem of determining the smallest enclosing and largest embedded isosceles triangles of Δ with respect to area and perimeter. This problem was initially posed by Nandakumar [17, 22] and was first studied by Kiss, Pach, and Somlai [13], who showed that if Δ′ is the smallest area isosceles triangle containing Δ, then Δ′ and Δ share a side and an angle. In the present paper, we prove that for any triangle Δ, every maximum area isosceles triangle embedded in Δ and every maximum perimeter isosceles triangle embedded in Δ shares a side and an angle with Δ. Somewhat surprisingly, the case of minimum perimeter enclosing triangles is different: there are infinite families of triangles Δ whose minimum perimeter isosceles containers do not share a side and an angle with Δ. AU - Ambrus, Áron AU - Csikós, Mónika AU - Kiss, Gergely AU - Pach, János AU - Somlai, Gábor ID - 14464 IS - 7 JF - International Journal of Foundations of Computer Science SN - 0129-0541 TI - Optimal embedded and enclosing isosceles triangles VL - 34 ER - TY - JOUR AB - The rapid development of machine learning (ML) techniques has opened up the data-dense field of microbiome research for novel therapeutic, diagnostic, and prognostic applications targeting a wide range of disorders, which could substantially improve healthcare practices in the era of precision medicine. However, several challenges must be addressed to exploit the benefits of ML in this field fully. In particular, there is a need to establish “gold standard” protocols for conducting ML analysis experiments and improve interactions between microbiome researchers and ML experts. The Machine Learning Techniques in Human Microbiome Studies (ML4Microbiome) COST Action CA18131 is a European network established in 2019 to promote collaboration between discovery-oriented microbiome researchers and data-driven ML experts to optimize and standardize ML approaches for microbiome analysis. This perspective paper presents the key achievements of ML4Microbiome, which include identifying predictive and discriminatory ‘omics’ features, improving repeatability and comparability, developing automation procedures, and defining priority areas for the novel development of ML methods targeting the microbiome. The insights gained from ML4Microbiome will help to maximize the potential of ML in microbiome research and pave the way for new and improved healthcare practices. AU - D’Elia, Domenica AU - Truu, Jaak AU - Lahti, Leo AU - Berland, Magali AU - Papoutsoglou, Georgios AU - Ceci, Michelangelo AU - Zomer, Aldert AU - Lopes, Marta B. AU - Ibrahimi, Eliana AU - Gruca, Aleksandra AU - Nechyporenko, Alina AU - Frohme, Marcus AU - Klammsteiner, Thomas AU - Pau, Enrique Carrillo De Santa AU - Marcos-Zambrano, Laura Judith AU - Hron, Karel AU - Pio, Gianvito AU - Simeon, Andrea AU - Suharoschi, Ramona AU - Moreno-Indias, Isabel AU - Temko, Andriy AU - Nedyalkova, Miroslava AU - Apostol, Elena Simona AU - Truică, Ciprian Octavian AU - Shigdel, Rajesh AU - Telalović, Jasminka Hasić AU - Bongcam-Rudloff, Erik AU - Przymus, Piotr AU - Jordamović, Naida Babić AU - Falquet, Laurent AU - Tarazona, Sonia AU - Sampri, Alexia AU - Isola, Gaetano AU - Pérez-Serrano, David AU - Trajkovik, Vladimir AU - Klucar, Lubos AU - Loncar-Turukalo, Tatjana AU - Havulinna, Aki S. AU - Jansen, Christian AU - Bertelsen, Randi J. AU - Claesson, Marcus Joakim ID - 14449 JF - Frontiers in Microbiology TI - Advancing microbiome research with machine learning: Key findings from the ML4Microbiome COST action VL - 14 ER - TY - JOUR AB - The quantum approximate optimization algorithm (QAOA) is a variational quantum algorithm, where a quantum computer implements a variational ansatz consisting of p layers of alternating unitary operators and a classical computer is used to optimize the variational parameters. For a random initialization, the optimization typically leads to local minima with poor performance, motivating the search for initialization strategies of QAOA variational parameters. Although numerous heuristic initializations exist, an analytical understanding and performance guarantees for large p remain evasive.We introduce a greedy initialization of QAOA which guarantees improving performance with an increasing number of layers. Our main result is an analytic construction of 2p + 1 transition states—saddle points with a unique negative curvature direction—for QAOA with p + 1 layers that use the local minimum of QAOA with p layers. Transition states connect to new local minima, which are guaranteed to lower the energy compared to the minimum found for p layers. We use the GREEDY procedure to navigate the exponentially increasing with p number of local minima resulting from the recursive application of our analytic construction. The performance of the GREEDY procedure matches available initialization strategies while providing a guarantee for the minimal energy to decrease with an increasing number of layers p. AU - Sack, Stefan AU - Medina Ramos, Raimel A AU - Kueng, Richard AU - Serbyn, Maksym ID - 13125 IS - 6 JF - Physical Review A SN - 2469-9926 TI - Recursive greedy initialization of the quantum approximate optimization algorithm with guaranteed improvement VL - 107 ER - TY - JOUR AB - We prove the following quantitative Borsuk–Ulam-type result (an equivariant analogue of Gromov’s Topological Overlap Theorem): Let X be a free ℤ/2-complex of dimension d with coboundary expansion at least ηk in dimension 0 ≤ k < d. Then for every equivariant map F: X →ℤ/2 ℝd, the fraction of d-simplices σ of X with 0 ∈ F (σ) is at least 2−d Π d−1k=0ηk. As an application, we show that for every sufficiently thick d-dimensional spherical building Y and every map f: Y → ℝ2d, we have f(σ) ∩ f(τ) ≠ ∅ for a constant fraction μd > 0 of pairs {σ, τ} of d-simplices of Y. In particular, such complexes are non-embeddable into ℝ2d, which proves a conjecture of Tancer and Vorwerk for sufficiently thick spherical buildings. We complement these results by upper bounds on the coboundary expansion of two families of simplicial complexes; this indicates some limitations to the bounds one can obtain by straighforward applications of the quantitative Borsuk–Ulam theorem. Specifically, we prove • an upper bound of (d + 1)/2d on the normalized (d − 1)-th coboundary expansion constant of complete (d + 1)-partite d-dimensional complexes (under a mild divisibility assumption on the sizes of the parts); and • an upper bound of (d + 1)/2d + ε on the normalized (d − 1)-th coboundary expansion of the d-dimensional spherical building associated with GLd+2(Fq) for any ε > 0 and sufficiently large q. This disproves, in a rather strong sense, a conjecture of Lubotzky, Meshulam and Mozes. AU - Wagner, Uli AU - Wild, Pascal ID - 14445 IS - 2 JF - Israel Journal of Mathematics SN - 0021-2172 TI - Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes VL - 256 ER - TY - JOUR AB - Auxin belongs among major phytohormones and governs multiple aspects of plant growth and development. The establishment of auxin concentration gradients, determines, among other processes, plant organ positioning and growth responses to environmental stimuli. Herein we report the synthesis of new NBD- or DNS-labelled IAA derivatives and the elucidation of their biological activity, fluorescence properties and subcellular accumulation patterns in planta. These novel compounds did not show auxin-like activity, but instead antagonized physiological auxin effects. The DNS-labelled derivatives FL5 and FL6 showed strong anti-auxin activity in roots and hypocotyls, which also occurred at the level of gene transcription as confirmed by quantitative PCR analysis. The auxin antagonism of our derivatives was further demonstrated in vitro using an SPR-based binding assay. The NBD-labelled compound FL4 with the best fluorescence properties proved to be unsuitable to study auxin accumulation patterns in planta. On the other hand, the strongest anti-auxin activity possessing compounds FL5 and FL6 could be useful to study binding mechanisms to auxin receptors and for manipulations of auxin-regulated processes. AU - Bieleszová, Kristýna AU - Hladík, Pavel AU - Kubala, Martin AU - Napier, Richard AU - Brunoni, Federica AU - Gelová, Zuzana AU - Fiedler, Lukas AU - Kulich, Ivan AU - Strnad, Miroslav AU - Doležal, Karel AU - Novák, Ondřej AU - Friml, Jiří AU - Žukauskaitė, Asta ID - 14447 JF - Plant Growth Regulation SN - 0167-6903 TI - New fluorescent auxin derivatives: anti-auxin activity and accumulation patterns in Arabidopsis thaliana ER - TY - THES AU - Sack, Stefan ID - 14622 SN - 2663 - 337X TI - Improving variational quantum algorithms: Innovative initialization techniques and extensions to qudit systems ER - TY - JOUR AB - Mosaic analysis with double markers (MADM) technology enables the generation of genetic mosaic tissue in mice and high-resolution phenotyping at the individual cell level. Here, we present a protocol for isolating MADM-labeled cells with high yield for downstream molecular analyses using fluorescence-activated cell sorting (FACS). We describe steps for generating MADM-labeled mice, perfusion, single-cell suspension, and debris removal. We then detail procedures for cell sorting by FACS and downstream analysis. This protocol is suitable for embryonic to adult mice. For complete details on the use and execution of this protocol, please refer to Contreras et al. (2021).1 AU - Amberg, Nicole AU - Cheung, Giselle T AU - Hippenmeyer, Simon ID - 14683 IS - 1 JF - STAR Protocols KW - General Immunology and Microbiology KW - General Biochemistry KW - Genetics and Molecular Biology KW - General Neuroscience SN - 2666-1667 TI - Protocol for sorting cells from mouse brains labeled with mosaic analysis with double markers by flow cytometry VL - 5 ER - TY - JOUR AB - This paper is concerned with the problem of regularization by noise of systems of reaction–diffusion equations with mass control. It is known that strong solutions to such systems of PDEs may blow-up in finite time. Moreover, for many systems of practical interest, establishing whether the blow-up occurs or not is an open question. Here we prove that a suitable multiplicative noise of transport type has a regularizing effect. More precisely, for both a sufficiently noise intensity and a high spectrum, the blow-up of strong solutions is delayed up to an arbitrary large time. Global existence is shown for the case of exponentially decreasing mass. The proofs combine and extend recent developments in regularization by noise and in the Lp(Lq)-approach to stochastic PDEs, highlighting new connections between the two areas. AU - Agresti, Antonio ID - 12486 JF - Stochastics and Partial Differential Equations: Analysis and Computations SN - 2194-0401 TI - Delayed blow-up and enhanced diffusion by transport noise for systems of reaction-diffusion equations ER - TY - JOUR AB - We derive lower bounds on the maximal rates for multiple packings in high-dimensional Euclidean spaces. For any N > 0 and L ∈ Z ≥2 , a multiple packing is a set C of points in R n such that any point in R n lies in the intersection of at most L - 1 balls of radius √ nN around points in C . This is a natural generalization of the sphere packing problem. We study the multiple packing problem for both bounded point sets whose points have norm at most √ nP for some constant P > 0, and unbounded point sets whose points are allowed to be anywhere in R n . Given a well-known connection with coding theory, multiple packings can be viewed as the Euclidean analog of list-decodable codes, which are well-studied over finite fields. We derive the best known lower bounds on the optimal multiple packing density. This is accomplished by establishing an inequality which relates the list-decoding error exponent for additive white Gaussian noise channels, a quantity of average-case nature, to the list-decoding radius, a quantity of worst-case nature. We also derive novel bounds on the list-decoding error exponent for infinite constellations and closed-form expressions for the list-decoding error exponents for the power-constrained AWGN channel, which may be of independent interest beyond multiple packing. AU - Zhang, Yihan AU - Vatedka, Shashank ID - 14665 JF - IEEE Transactions on Information Theory SN - 0018-9448 TI - Multiple packing: Lower bounds via error exponents ER - TY - CONF AB - Lucas sequences are constant-recursive integer sequences with a long history of applications in cryptography, both in the design of cryptographic schemes and cryptanalysis. In this work, we study the sequential hardness of computing Lucas sequences over an RSA modulus. First, we show that modular Lucas sequences are at least as sequentially hard as the classical delay function given by iterated modular squaring proposed by Rivest, Shamir, and Wagner (MIT Tech. Rep. 1996) in the context of time-lock puzzles. Moreover, there is no obvious reduction in the other direction, which suggests that the assumption of sequential hardness of modular Lucas sequences is strictly weaker than that of iterated modular squaring. In other words, the sequential hardness of modular Lucas sequences might hold even in the case of an algorithmic improvement violating the sequential hardness of iterated modular squaring. Second, we demonstrate the feasibility of constructing practically-efficient verifiable delay functions based on the sequential hardness of modular Lucas sequences. Our construction builds on the work of Pietrzak (ITCS 2019) by leveraging the intrinsic connection between the problem of computing modular Lucas sequences and exponentiation in an appropriate extension field. AU - Hoffmann, Charlotte AU - Hubáček, Pavel AU - Kamath, Chethan AU - Krňák, Tomáš ID - 14693 SN - 0302-9743 T2 - 21st International Conference on Theory of Cryptography TI - (Verifiable) delay functions from Lucas sequences VL - 14372 ER - TY - CONF AB - Continuous Group-Key Agreement (CGKA) allows a group of users to maintain a shared key. It is the fundamental cryptographic primitive underlying group messaging schemes and related protocols, most notably TreeKEM, the underlying key agreement protocol of the Messaging Layer Security (MLS) protocol, a standard for group messaging by the IETF. CKGA works in an asynchronous setting where parties only occasionally must come online, and their messages are relayed by an untrusted server. The most expensive operation provided by CKGA is that which allows for a user to refresh their key material in order to achieve forward secrecy (old messages are secure when a user is compromised) and post-compromise security (users can heal from compromise). One caveat of early CGKA protocols is that these update operations had to be performed sequentially, with any user wanting to update their key material having had to receive and process all previous updates. Late versions of TreeKEM do allow for concurrent updates at the cost of a communication overhead per update message that is linear in the number of updating parties. This was shown to be indeed necessary when achieving PCS in just two rounds of communication by [Bienstock et al. TCC’20]. The recently proposed protocol CoCoA [Alwen et al. Eurocrypt’22], however, shows that this overhead can be reduced if PCS requirements are relaxed, and only a logarithmic number of rounds is required. The natural question, thus, is whether CoCoA is optimal in this setting. In this work we answer this question, providing a lower bound on the cost (concretely, the amount of data to be uploaded to the server) for CGKA protocols that heal in an arbitrary k number of rounds, that shows that CoCoA is very close to optimal. Additionally, we extend CoCoA to heal in an arbitrary number of rounds, and propose a modification of it, with a reduced communication cost for certain k. We prove our bound in a combinatorial setting where the state of the protocol progresses in rounds, and the state of the protocol in each round is captured by a set system, each set specifying a set of users who share a secret key. We show this combinatorial model is equivalent to a symbolic model capturing building blocks including PRFs and public-key encryption, related to the one used by Bienstock et al. Our lower bound is of order k•n1+1/(k-1)/log(k), where 2≤k≤log(n) is the number of updates per user the protocol requires to heal. This generalizes the n2 bound for k=2 from Bienstock et al.. This bound almost matches the k⋅n1+2/(k-1) or k2⋅n1+1/(k-1) efficiency we get for the variants of the CoCoA protocol also introduced in this paper. AU - Auerbach, Benedikt AU - Cueto Noval, Miguel AU - Pascual Perez, Guillermo AU - Pietrzak, Krzysztof Z ID - 14691 SN - 0302-9743 T2 - 21st International Conference on Theory of Cryptography TI - On the cost of post-compromise security in concurrent Continuous Group-Key Agreement VL - 14371 ER - TY - CONF AB - The generic-group model (GGM) aims to capture algorithms working over groups of prime order that only rely on the group operation, but do not exploit any additional structure given by the concrete implementation of the group. In it, it is possible to prove information-theoretic lower bounds on the hardness of problems like the discrete logarithm (DL) or computational Diffie-Hellman (CDH). Thus, since its introduction, it has served as a valuable tool to assess the concrete security provided by cryptographic schemes based on such problems. A work on the related algebraic-group model (AGM) introduced a method, used by many subsequent works, to adapt GGM lower bounds for one problem to another, by means of conceptually simple reductions. In this work, we propose an alternative approach to extend GGM bounds from one problem to another. Following an idea by Yun [EC15], we show that, in the GGM, the security of a large class of problems can be reduced to that of geometric search-problems. By reducing the security of the resulting geometric-search problems to variants of the search-by-hypersurface problem, for which information theoretic lower bounds exist, we give alternative proofs of several results that used the AGM approach. The main advantage of our approach is that our reduction from geometric search-problems works, as well, for the GGM with preprocessing (more precisely the bit-fixing GGM introduced by Coretti, Dodis and Guo [Crypto18]). As a consequence, this opens up the possibility of transferring preprocessing GGM bounds from one problem to another, also by means of simple reductions. Concretely, we prove novel preprocessing bounds on the hardness of the d-strong discrete logarithm, the d-strong Diffie-Hellman inversion, and multi-instance CDH problems, as well as a large class of Uber assumptions. Additionally, our approach applies to Shoup’s GGM without additional restrictions on the query behavior of the adversary, while the recent works of Zhang, Zhou, and Katz [AC22] and Zhandry [Crypto22] highlight that this is not the case for the AGM approach. AU - Auerbach, Benedikt AU - Hoffmann, Charlotte AU - Pascual Perez, Guillermo ID - 14692 SN - 0302-9743 T2 - 21st International Conference on Theory of Cryptography TI - Generic-group lower bounds via reductions between geometric-search problems: With and without preprocessing VL - 14371 ER - TY - JOUR AB - Generalized multifractality characterizes system size dependence of pure scaling local observables at Anderson transitions in all 10 symmetry classes of disordered systems. Recently, the concept of generalized multifractality has been extended to boundaries of critical disordered noninteracting systems. Here we study the generalized boundary multifractality in the presence of electron-electron interaction, focusing on the spin quantum Hall symmetry class (class C). Employing the two-loop renormalization group analysis within the Finkel'stein nonlinear sigma model, we compute the anomalous dimensions of the pure scaling operators located at the boundary of the system. We find that generalized boundary multifractal exponents are twice larger than their bulk counterparts. Exact symmetry relations between generalized boundary multifractal exponents in the case of noninteracting systems are explicitly broken by the interaction. AU - Babkin, Serafim AU - Burmistrov, I ID - 14690 IS - 20 JF - Physical Review B SN - 2469-9950 TI - Boundary multifractality in the spin quantum Hall symmetry class with interaction VL - 108 ER - TY - JOUR AU - Ing-Simmons, Elizabeth AU - Machnik, Nick N AU - Vaquerizas, Juan M. ID - 14689 IS - 12 JF - Nature Genetics SN - 1061-4036 TI - Reply to: Revisiting the use of structural similarity index in Hi-C VL - 55 ER - TY - JOUR AU - Archer, Lynden A. AU - Bruce, Peter G. AU - Calvo, Ernesto J. AU - Dewar, Daniel AU - Ellison, James H. J. AU - Freunberger, Stefan Alexander AU - Gao, Xiangwen AU - Hardwick, Laurence J. AU - Horwitz, Gabriela AU - Janek, Jürgen AU - Johnson, Lee R. AU - Jordan, Jack W. AU - Matsuda, Shoichi AU - Menkin, Svetlana AU - Mondal, Soumyadip AU - Qiu, Qianyuan AU - Samarakoon, Thukshan AU - Temprano, Israel AU - Uosaki, Kohei AU - Vailaya, Ganesh AU - Wachsman, Eric D. AU - Wu, Yiying AU - Ye, Shen ID - 14701 JF - Faraday Discussions KW - Physical and Theoretical Chemistry SN - 1359-6640 TI - Towards practical metal–oxygen batteries: General discussion ER - TY - JOUR AU - Attard, Gary A. AU - Calvo, Ernesto J. AU - Curtiss, Larry A. AU - Dewar, Daniel AU - Ellison, James H. J. AU - Gao, Xiangwen AU - Grey, Clare P. AU - Hardwick, Laurence J. AU - Horwitz, Gabriela AU - Janek, Juergen AU - Johnson, Lee R. AU - Jordan, Jack W. AU - Matsuda, Shoichi AU - Mondal, Soumyadip AU - Neale, Alex R. AU - Ortiz-Vitoriano, Nagore AU - Temprano, Israel AU - Vailaya, Ganesh AU - Wachsman, Eric D. AU - Wang, Hsien-Hau AU - Wu, Yiying AU - Ye, Shen ID - 14702 JF - Faraday Discussions KW - Physical and Theoretical Chemistry SN - 1359-6640 TI - Materials for stable metal–oxygen battery cathodes: general discussion ER - TY - JOUR AB - To navigate through diverse tissues, migrating cells must balance persistent self-propelled motion with adaptive behaviors to circumvent obstacles. We identify a curvature-sensing mechanism underlying obstacle evasion in immune-like cells. Specifically, we propose that actin polymerization at the advancing edge of migrating cells is inhibited by the curvature-sensitive BAR domain protein Snx33 in regions with inward plasma membrane curvature. The genetic perturbation of this machinery reduces the cells’ capacity to evade obstructions combined with faster and more persistent cell migration in obstacle-free environments. Our results show how cells can read out their surface topography and utilize actin and plasma membrane biophysics to interpret their environment, allowing them to adaptively decide if they should move ahead or turn away. On the basis of our findings, we propose that the natural diversity of BAR domain proteins may allow cells to tune their curvature sensing machinery to match the shape characteristics in their environment. AU - Sitarska, Ewa AU - Almeida, Silvia Dias AU - Beckwith, Marianne Sandvold AU - Stopp, Julian A AU - Czuchnowski, Jakub AU - Siggel, Marc AU - Roessner, Rita AU - Tschanz, Aline AU - Ejsing, Christer AU - Schwab, Yannick AU - Kosinski, Jan AU - Sixt, Michael K AU - Kreshuk, Anna AU - Erzberger, Anna AU - Diz-Muñoz, Alba ID - 14360 JF - Nature Communications TI - Sensing their plasma membrane curvature allows migrating cells to circumvent obstacles VL - 14 ER - TY - JOUR AB - Immune responses rely on the rapid and coordinated migration of leukocytes. Whereas it is well established that single-cell migration is often guided by gradients of chemokines and other chemoattractants, it remains poorly understood how these gradients are generated, maintained, and modulated. By combining experimental data with theory on leukocyte chemotaxis guided by the G protein–coupled receptor (GPCR) CCR7, we demonstrate that in addition to its role as the sensory receptor that steers migration, CCR7 also acts as a generator and a modulator of chemotactic gradients. Upon exposure to the CCR7 ligand CCL19, dendritic cells (DCs) effectively internalize the receptor and ligand as part of the canonical GPCR desensitization response. We show that CCR7 internalization also acts as an effective sink for the chemoattractant, dynamically shaping the spatiotemporal distribution of the chemokine. This mechanism drives complex collective migration patterns, enabling DCs to create or sharpen chemotactic gradients. We further show that these self-generated gradients can sustain the long-range guidance of DCs, adapt collective migration patterns to the size and geometry of the environment, and provide a guidance cue for other comigrating cells. Such a dual role of CCR7 as a GPCR that both senses and consumes its ligand can thus provide a novel mode of cellular self-organization. AU - Alanko, Jonna H AU - Ucar, Mehmet C AU - Canigova, Nikola AU - Stopp, Julian A AU - Schwarz, Jan AU - Merrin, Jack AU - Hannezo, Edouard B AU - Sixt, Michael K ID - 14274 IS - 87 JF - Science Immunology KW - General Medicine KW - Immunology SN - 2470-9468 TI - CCR7 acts as both a sensor and a sink for CCL19 to coordinate collective leukocyte migration VL - 8 ER - TY - THES AU - Stopp, Julian A ID - 14697 SN - 2663 - 337X TI - Neutrophils on the hunt: Migratory strategies employed by neutrophils to fulfill their effector function ER - TY - THES AB - For self-incompatibility (SI) to be stable in a population, theory predicts that sufficient inbreeding depression (ID) is required: the fitness of offspring from self-mated individuals must be low enough to prevent the spread of self-compatibility (SC). Reviews of natural plant populations have supported this theory, with SI species generally showing high levels of ID. However, there is thought to be an under-sampling of self-incompatible taxa in the current literature. In this thesis, I study inbreeding depression in the SI plant species Antirrhinum majus using both greenhouse crosses and a large collected field dataset. Additionally, the gametophytic S-locus of A. majus is highly heterozygous and polymorphic, thus making assembly and discovery of S-alleles very difficult. Here, 206 new alleles of the male component SLFs are presented, along with a phylogeny showing the high conservation with alleles from another Antirrhinum species. Lastly, selected sites within the protein structure of SLFs are investigated, with one site in particular highlighted as potentially being involved in the SI recognition mechanism. AU - Arathoon, Louise S ID - 14651 SN - 2663 - 337X TI - Investigating inbreeding depression and the self-incompatibility locus of Antirrhinum majus ER - TY - GEN AB - We present a discretization of the dynamic optimal transport problem for which we can obtain the convergence rate for the value of the transport cost to its continuous value when the temporal and spatial stepsize vanish. This convergence result does not require any regularity assumption on the measures, though experiments suggest that the rate is not sharp. Via an analysis of the duality gap we also obtain the convergence rates for the gradient of the optimal potentials and the velocity field under mild regularity assumptions. To obtain such rates we discretize the dual formulation of the dynamic optimal transport problem and use the mature literature related to the error due to discretizing the Hamilton-Jacobi equation. AU - Ishida, Sadashige AU - Lavenant, Hugo ID - 14703 KW - Optimal transport KW - Hamilton-Jacobi equation KW - convex optimization T2 - arXiv TI - Quantitative convergence of a discretization of dynamic optimal transport using the dual formulation ER - TY - JOUR AB - Background: Antimicrobial resistance (AMR) poses a significant global health threat, and an accurate prediction of bacterial resistance patterns is critical for effective treatment and control strategies. In recent years, machine learning (ML) approaches have emerged as powerful tools for analyzing large-scale bacterial AMR data. However, ML methods often ignore evolutionary relationships among bacterial strains, which can greatly impact performance of the ML methods, especially if resistance-associated features are attempted to be detected. Genome-wide association studies (GWAS) methods like linear mixed models accounts for the evolutionary relationships in bacteria, but they uncover only highly significant variants which have already been reported in literature. Results: In this work, we introduce a novel phylogeny-related parallelism score (PRPS), which measures whether a certain feature is correlated with the population structure of a set of samples. We demonstrate that PRPS can be used, in combination with SVM- and random forest-based models, to reduce the number of features in the analysis, while simultaneously increasing models’ performance. We applied our pipeline to publicly available AMR data from PATRIC database for Mycobacterium tuberculosis against six common antibiotics. Conclusions: Using our pipeline, we re-discovered known resistance-associated mutations as well as new candidate mutations which can be related to resistance and not previously reported in the literature. We demonstrated that taking into account phylogenetic relationships not only improves the model performance, but also yields more biologically relevant predicted most contributing resistance markers. AU - Yurtseven, Alper AU - Buyanova, Sofia AU - Agrawal, Amay Ajaykumar A. AU - Bochkareva, Olga AU - Kalinina, Olga V V. ID - 14716 IS - 1 JF - BMC Microbiology TI - Machine learning and phylogenetic analysis allow for predicting antibiotic resistance in M. tuberculosis VL - 23 ER - TY - CONF AB - Binary decision diagrams (BDDs) are one of the fundamental data structures in formal methods and computer science in general. However, the performance of BDD-based algorithms greatly depends on memory latency due to the reliance on large hash tables and thus, by extension, on the speed of random memory access. This hinders the full utilisation of resources available on modern CPUs, since the absolute memory latency has not improved significantly for at least a decade. In this paper, we explore several implementation techniques that improve the performance of BDD manipulation either through enhanced memory locality or by partially eliminating random memory access. On a benchmark suite of 600+ BDDs derived from real-world applications, we demonstrate runtime that is comparable or better than parallelising the same operations on eight CPU cores. AU - Pastva, Samuel AU - Henzinger, Thomas A ID - 14718 SN - 9783854480600 T2 - Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design TI - Binary decision diagrams on modern hardware ER - TY - JOUR AB - We count primitive lattices of rank d inside Zn as their covolume tends to infinity, with respect to certain parameters of such lattices. These parameters include, for example, the subspace that a lattice spans, namely its projection to the Grassmannian; its homothety class and its equivalence class modulo rescaling and rotation, often referred to as a shape. We add to a prior work of Schmidt by allowing sets in the spaces of parameters that are general enough to conclude the joint equidistribution of these parameters. In addition to the primitive d-lattices Λ themselves, we also consider their orthogonal complements in Zn⁠, A1⁠, and show that the equidistribution occurs jointly for Λ and A1⁠. Finally, our asymptotic formulas for the number of primitive lattices include an explicit bound on the error term. AU - Horesh, Tal AU - Karasik, Yakov ID - 14717 IS - 4 JF - Quarterly Journal of Mathematics SN - 0033-5606 TI - Equidistribution of primitive lattices in ℝn VL - 74 ER - TY - JOUR AB - Lithium–sulfur batteries are regarded as an advantageous option for meeting the growing demand for high-energy-density storage, but their commercialization relies on solving the current limitations of both sulfur cathodes and lithium metal anodes. In this scenario, the implementation of lithium sulfide (Li2S) cathodes compatible with alternative anode materials such as silicon has the potential to alleviate the safety concerns associated with lithium metal. In this direction, here, we report a sulfur cathode based on Li2S nanocrystals grown on a catalytic host consisting of CoFeP nanoparticles supported on tubular carbon nitride. Nanosized Li2S is incorporated into the host by a scalable liquid infiltration–evaporation method. Theoretical calculations and experimental results demonstrate that the CoFeP–CN composite can boost the polysulfide adsorption/conversion reaction kinetics and strongly reduce the initial overpotential activation barrier by stretching the Li–S bonds of Li2S. Besides, the ultrasmall size of the Li2S particles in the Li2S–CoFeP–CN composite cathode facilitates the initial activation. Overall, the Li2S–CoFeP–CN electrodes exhibit a low activation barrier of 2.56 V, a high initial capacity of 991 mA h gLi2S–1, and outstanding cyclability with a small fading rate of 0.029% per cycle over 800 cycles. Moreover, Si/Li2S full cells are assembled using the nanostructured Li2S–CoFeP–CN cathode and a prelithiated anode based on graphite-supported silicon nanowires. These Si/Li2S cells demonstrate high initial discharge capacities above 900 mA h gLi2S–1 and good cyclability with a capacity fading rate of 0.28% per cycle over 150 cycles. AU - Mollania, Hamid AU - Zhang, Chaoqi AU - Du, Ruifeng AU - Qi, Xueqiang AU - Li, Junshan AU - Horta, Sharona AU - Ibáñez, Maria AU - Keller, Caroline AU - Chenevier, Pascale AU - Oloomi-Buygi, Majid AU - Cabot, Andreu ID - 14719 IS - 50 JF - ACS Applied Materials and Interfaces SN - 1944-8244 TI - Nanostructured Li₂S cathodes for silicon-sulfur batteries VL - 15 ER - TY - JOUR AB - We consider N trapped bosons in the mean-field limit with coupling constant λN = 1/(N − 1). The ground state of such systems exhibits Bose–Einstein condensation. We prove that the probability of finding ℓ particles outside the condensate wave function decays exponentially in ℓ. AU - Mitrouskas, David Johannes AU - Pickl, Peter ID - 14715 IS - 12 JF - Journal of Mathematical Physics SN - 0022-2488 TI - Exponential decay of the number of excitations in the weakly interacting Bose gas VL - 64 ER - TY - JOUR AB - This paper introduces a novel method for simulating large bodies of water as a height field. At the start of each time step, we partition the waves into a bulk flow (which approximately satisfies the assumptions of the shallow water equations) and surface waves (which approximately satisfy the assumptions of Airy wave theory). We then solve the two wave regimes separately using appropriate state-of-the-art techniques, and re-combine the resulting wave velocities at the end of each step. This strategy leads to the first heightfield wave model capable of simulating complex interactions between both deep and shallow water effects, like the waves from a boat wake sloshing up onto a beach, or a dam break producing wave interference patterns and eddies. We also analyze the numerical dispersion created by our method and derive an exact correction factor for waves at a constant water depth, giving us a numerically perfect re-creation of theoretical water wave dispersion patterns. AU - Jeschke, Stefan AU - Wojtan, Christopher J ID - 14240 IS - 4 JF - ACM Transactions on Graphics SN - 0730-0301 TI - Generalizing shallow water simulations with dispersive surface waves VL - 42 ER - TY - JOUR AB - The self-assembly of complex structures from a set of non-identical building blocks is a hallmark of soft matter and biological systems, including protein complexes, colloidal clusters, and DNA-based assemblies. Predicting the dependence of the equilibrium assembly yield on the concentrations and interaction energies of building blocks is highly challenging, owing to the difficulty of computing the entropic contributions to the free energy of the many structures that compete with the ground state configuration. While these calculations yield well known results for spherically symmetric building blocks, they do not hold when the building blocks have internal rotational degrees of freedom. Here we present an approach for solving this problem that works with arbitrary building blocks, including proteins with known structure and complex colloidal building blocks. Our algorithm combines classical statistical mechanics with recently developed computational tools for automatic differentiation. Automatic differentiation allows efficient evaluation of equilibrium averages over configurations that would otherwise be intractable. We demonstrate the validity of our framework by comparison to molecular dynamics simulations of simple examples, and apply it to calculate the yield curves for known protein complexes and for the assembly of colloidal shells. AU - Curatolo, Agnese I. AU - Kimchi, Ofer AU - Goodrich, Carl Peter AU - Krueger, Ryan K. AU - Brenner, Michael P. ID - 14710 JF - Nature Communications TI - A computational toolbox for the assembly yield of complex and heterogeneous structures VL - 14 ER - TY - JOUR AB - Amid the delays due to the global pandemic, in early October 2022, the auxin community gathered in the idyllic peninsula of Cavtat, Croatia. More than 170 scientists from across the world converged to discuss the latest advancements in fundamental and applied research in the field. The topics, from signalling and transport to plant architecture and response to the environment, show how auxin research must bridge from the molecular realm to macroscopic developmental responses. This is mirrored in this collection of reviews, contributed by participants of the Auxin 2022 meeting. AU - Del Bianco, Marta AU - Friml, Jiří AU - Strader, Lucia AU - Kepinski, Stefan ID - 14709 IS - 22 JF - Journal of Experimental Botany SN - 0022-0957 TI - Auxin research: Creating tools for a greener future VL - 74 ER - TY - JOUR AB - The input to the token swapping problem is a graph with vertices v1, v2, . . . , vn, and n tokens with labels 1,2, . . . , n, one on each vertex. The goal is to get token i to vertex vi for all i= 1, . . . , n using a minimum number of swaps, where a swap exchanges the tokens on the endpoints of an edge.Token swapping on a tree, also known as “sorting with a transposition tree,” is not known to be in P nor NP-complete. We present some partial results: 1. An optimum swap sequence may need to perform a swap on a leaf vertex that has the correct token (a “happy leaf”), disproving a conjecture of Vaughan. 2. Any algorithm that fixes happy leaves—as all known approximation algorithms for the problem do—has approximation factor at least 4/3. Furthermore, the two best-known 2-approximation algorithms have approximation factor exactly 2. 3. A generalized problem—weighted coloured token swapping—is NP-complete on trees, but solvable in polynomial time on paths and stars. In this version, tokens and vertices have colours, and colours have weights. The goal is to get every token to a vertex of the same colour, and the cost of a swap is the sum of the weights of the two tokens involved. AU - Biniaz, Ahmad AU - Jain, Kshitij AU - Lubiw, Anna AU - Masárová, Zuzana AU - Miltzow, Tillmann AU - Mondal, Debajyoti AU - Naredla, Anurag Murty AU - Tkadlec, Josef AU - Turcotte, Alexi ID - 12833 IS - 2 JF - Discrete Mathematics and Theoretical Computer Science SN - 1462-7264 TI - Token swapping on trees VL - 24 ER - TY - CONF AB - Scaling blockchain protocols to perform on par with the expected needs of Web3.0 has been proven to be a challenging task with almost a decade of research. In the forefront of the current solution is the idea of separating the execution of the updates encoded in a block from the ordering of blocks. In order to achieve this, a new class of protocols called rollups has emerged. Rollups have as input a total ordering of valid and invalid transactions and as output a new valid state-transition. If we study rollups from a distributed computing perspective, we uncover that rollups take as input the output of a Byzantine Atomic Broadcast (BAB) protocol and convert it to a State Machine Replication (SMR) protocol. BAB and SMR, however, are considered equivalent as far as distributed computing is concerned and a solution to one can easily be retrofitted to solve the other simply by adding/removing an execution step before the validation of the input. This “easy” step of retrofitting an atomic broadcast solution to implement an SMR has, however, been overlooked in practice. In this paper, we formalize the problem and show that after BAB is solved, traditional impossibility results for consensus no longer apply towards an SMR. Leveraging this we propose a distributed execution protocol that allows reduced execution and storage cost per executor (O(log2n/n)) without relaxing the network assumptions of the underlying BAB protocol and providing censorship-resistance. Finally, we propose efficient non-interactive light client constructions that leverage our efficient execution protocols and do not require any synchrony assumptions or expensive ZK-proofs. AU - Stefo, Christos AU - Xiang, Zhuolun AU - Kokoris Kogias, Eleftherios ID - 14735 SN - 1611-3349 T2 - 27th International Conference on Financial Cryptography and Data Security TI - Executing and proving over dirty ledgers VL - 13950 ER - TY - JOUR AB - Redox flow batteries (RFBs) rely on the development of cheap, highly soluble, and high-energy-density electrolytes. Several candidate quinones have already been investigated in the literature as two-electron anolytes or catholytes, benefiting from fast kinetics, high tunability, and low cost. Here, an investigation of nitrogen-rich fused heteroaromatic quinones was carried out to explore avenues for electrolyte development. These quinones were synthesized and screened by using electrochemical techniques. The most promising candidate, 4,8-dioxo-4,8-dihydrobenzo[1,2-d:4,5-d′]bis([1,2,3]triazole)-1,5-diide (−0.68 V(SHE)), was tested in both an asymmetric and symmetric full-cell setup resulting in capacity fade rates of 0.35% per cycle and 0.0124% per cycle, respectively. In situ ultraviolet-visible spectroscopy (UV–Vis), nuclear magnetic resonance (NMR), and electron paramagnetic resonance (EPR) spectroscopies were used to investigate the electrochemical stability of the charged species during operation. UV–Vis spectroscopy, supported by density functional theory (DFT) modeling, reaffirmed that the two-step charging mechanism observed during battery operation consisted of two, single-electron transfers. The radical concentration during battery operation and the degree of delocalization of the unpaired electron were quantified with NMR and EPR spectroscopy. AU - Jethwa, Rajesh B AU - Hey, Dominic AU - Kerber, Rachel N. AU - Bond, Andrew D. AU - Wright, Dominic S. AU - Grey, Clare P. ID - 14733 JF - ACS Applied Energy Materials KW - Electrical and Electronic Engineering KW - Materials Chemistry KW - Electrochemistry KW - Energy Engineering and Power Technology KW - Chemical Engineering (miscellaneous) TI - Exploring the landscape of heterocyclic quinones for redox flow batteries ER - TY - JOUR AB - Developing cost-effective and high-performance thermoelectric (TE) materials to assemble efficient TE devices presents a multitude of challenges and opportunities. Cu3SbSe4 is a promising p-type TE material based on relatively earth abundant elements. However, the challenge lies in its poor electrical conductivity. Herein, an efficient and scalable solution-based approach is developed to synthesize high-quality Cu3SbSe4 nanocrystals doped with Pb at the Sb site. After ligand displacement and annealing treatments, the dried powders are consolidated into dense pellets, and their TE properties are investigated. Pb doping effectively increases the charge carrier concentration, resulting in a significant increase in electrical conductivity, while the Seebeck coefficients remain consistently high. The calculated band structure shows that Pb doping induces band convergence, thereby increasing the effective mass. Furthermore, the large ionic radius of Pb2+ results in the generation of additional point and plane defects and interphases, dramatically enhancing phonon scattering, which significantly decreases the lattice thermal conductivity at high temperatures. Overall, a maximum figure of merit (zTmax) ≈ 0.85 at 653 K is obtained in Cu3Sb0.97Pb0.03Se4. This represents a 1.6-fold increase compared to the undoped sample and exceeds most doped Cu3SbSe4-based materials produced by solid-state, demonstrating advantages of versatility and cost-effectiveness using a solution-based technology. AU - Wan, Shanhong AU - Xiao, Shanshan AU - Li, Mingquan AU - Wang, Xin AU - Lim, Khak Ho AU - Hong, Min AU - Ibáñez, Maria AU - Cabot, Andreu AU - Liu, Yu ID - 14734 JF - Small Methods TI - Band engineering through Pb-doping of nanocrystal building blocks to enhance thermoelectric performance in Cu3SbSe4 ER - TY - JOUR AB - John’s fundamental theorem characterizing the largest volume ellipsoid contained in a convex body $K$ in $\mathbb{R}^{d}$ has seen several generalizations and extensions. One direction, initiated by V. Milman is to replace ellipsoids by positions (affine images) of another body $L$. Another, more recent direction is to consider logarithmically concave functions on $\mathbb{R}^{d}$ instead of convex bodies: we designate some special, radially symmetric log-concave function $g$ as the analogue of the Euclidean ball, and want to find its largest integral position under the constraint that it is pointwise below some given log-concave function $f$. We follow both directions simultaneously: we consider the functional question, and allow essentially any meaningful function to play the role of $g$ above. Our general theorems jointly extend known results in both directions. The dual problem in the setting of convex bodies asks for the smallest volume ellipsoid, called Löwner’s ellipsoid, containing $K$. We consider the analogous problem for functions: we characterize the solutions of the optimization problem of finding a smallest integral position of some log-concave function $g$ under the constraint that it is pointwise above $f$. It turns out that in the functional setting, the relationship between the John and the Löwner problems is more intricate than it is in the setting of convex bodies. AU - Ivanov, Grigory AU - Naszódi, Márton ID - 14737 IS - 23 JF - International Mathematics Research Notices KW - General Mathematics SN - 1073-7928 TI - Functional John and Löwner conditions for pairs of log-concave functions VL - 2023 ER - TY - CONF AB - Payment channel networks (PCNs) are a promising technology to improve the scalability of cryptocurrencies. PCNs, however, face the challenge that the frequent usage of certain routes may deplete channels in one direction, and hence prevent further transactions. In order to reap the full potential of PCNs, recharging and rebalancing mechanisms are required to provision channels, as well as an admission control logic to decide which transactions to reject in case capacity is insufficient. This paper presents a formal model of this optimisation problem. In particular, we consider an online algorithms perspective, where transactions arrive over time in an unpredictable manner. Our main contributions are competitive online algorithms which come with provable guarantees over time. We empirically evaluate our algorithms on randomly generated transactions to compare the average performance of our algorithms to our theoretical bounds. We also show how this model and approach differs from related problems in classic communication networks. AU - Bastankhah, Mahsa AU - Chatterjee, Krishnendu AU - Maddah-Ali, Mohammad Ali AU - Schmid, Stefan AU - Svoboda, Jakub AU - Yeo, Michelle X ID - 14736 SN - 0302-9743 T2 - 27th International Conference on Financial Cryptography and Data Security TI - R2: Boosting liquidity in payment channel networks with online admission control VL - 13950 ER - TY - JOUR AB - Attempts to incorporate topological information in supervised learning tasks have resulted in the creation of several techniques for vectorizing persistent homology barcodes. In this paper, we study thirteen such methods. Besides describing an organizational framework for these methods, we comprehensively benchmark them against three well-known classification tasks. Surprisingly, we discover that the best-performing method is a simple vectorization, which consists only of a few elementary summary statistics. Finally, we provide a convenient web application which has been designed to facilitate exploration and experimentation with various vectorization methods. AU - Ali, Dashti AU - Asaad, Aras AU - Jimenez, Maria-Jose AU - Nanda, Vidit AU - Paluzo-Hidalgo, Eduardo AU - Soriano Trigueros, Manuel ID - 14739 IS - 12 JF - IEEE Transactions on Pattern Analysis and Machine Intelligence KW - Applied Mathematics KW - Artificial Intelligence KW - Computational Theory and Mathematics KW - Computer Vision and Pattern Recognition KW - Software SN - 0162-8828 TI - A survey of vectorization methods in topological data analysis VL - 45 ER - TY - JOUR AB - Chromosomal rearrangements (CRs) have been known since almost the beginning of genetics. While an important role for CRs in speciation has been suggested, evidence primarily stems from theoretical and empirical studies focusing on the microevolutionary level (i.e., on taxon pairs where speciation is often incomplete). Although the role of CRs in eukaryotic speciation at a macroevolutionary level has been supported by associations between species diversity and rates of evolution of CRs across phylogenies, these findings are limited to a restricted range of CRs and taxa. Now that more broadly applicable and precise CR detection approaches have become available, we address the challenges in filling some of the conceptual and empirical gaps between micro- and macroevolutionary studies on the role of CRs in speciation. We synthesize what is known about the macroevolutionary impact of CRs and suggest new research avenues to overcome the pitfalls of previous studies to gain a more comprehensive understanding of the evolutionary significance of CRs in speciation across the tree of life. AU - Lucek, Kay AU - Giménez, Mabel D. AU - Joron, Mathieu AU - Rafajlović, Marina AU - Searle, Jeremy B. AU - Walden, Nora AU - Westram, Anja M AU - Faria, Rui ID - 14742 IS - 11 JF - Cold Spring Harbor Perspectives in Biology KW - General Biochemistry KW - Genetics and Molecular Biology SN - 1943-0264 TI - The impact of chromosomal rearrangements in speciation: From micro- to macroevolution VL - 15 ER - TY - CONF AB - Sharding distributed ledgers is a promising on-chain solution for scaling blockchains but lacks formal grounds, nurturing skepticism on whether such complex systems can scale blockchains securely. We fill this gap by introducing the first formal framework as well as a roadmap to robust sharding. In particular, we first define the properties sharded distributed ledgers should fulfill. We build upon and extend the Bitcoin backbone protocol by defining consistency and scalability. Consistency encompasses the need for atomic execution of cross-shard transactions to preserve safety, whereas scalability encapsulates the speedup a sharded system can gain in comparison to a non-sharded system. Using our model, we explore the limitations of sharding. We show that a sharded ledger with n participants cannot scale under a fully adaptive adversary, but it can scale up to m shards where n=c'm log m, under an epoch-adaptive adversary; the constant c' encompasses the trade-off between security and scalability. This is possible only if the sharded ledgers create succinct proofs of the valid state updates at every epoch. We leverage our results to identify the sufficient components for robust sharding, which we incorporate in a protocol abstraction termed Divide & Scale. To demonstrate the power of our framework, we analyze the most prominent sharded blockchains (Elastico, Monoxide, OmniLedger, RapidChain) and pinpoint where they fail to meet the desired properties. AU - Avarikioti, Zeta AU - Desjardins, Antoine AU - Kokoris Kogias, Eleftherios AU - Wattenhofer, Roger ID - 14744 SN - 0302-9743 T2 - 30th International Colloquium on Structural Information and Communication Complexity TI - Divide & Scale: Formalization and roadmap to robust sharding VL - 13892 ER - TY - JOUR AB - We unveil a powerful method for the stabilization of laser injection locking based on sensing variations in the output beam ellipticity of an optically seeded laser. The effect arises due to an interference between the seeding beam and the injected laser output. We demonstrate the method for a commercial semiconductor laser without the need for any internal changes to the readily operational injection locked laser system that was used. The method can also be used to increase the mode-hop free tuning range of lasers, and has the potential to fill a void in the low-noise laser industry. AU - Mishra, Umang AU - Li, Vyacheslav AU - Wald, Sebastian AU - Agafonova, Sofya AU - Diorico, Fritz R AU - Hosten, Onur ID - 14749 IS - 15 JF - Optics Letters KW - Atomic and Molecular Physics KW - and Optics SN - 0146-9592 TI - Monitoring and active stabilization of laser injection locking using beam ellipticity VL - 48 ER - TY - JOUR AB - Radiative cooling of the lowest atmospheric levels is of strong importance for modulating atmospheric circulations and organizing convection, but detailed observations and a robust theoretical understanding are lacking. Here we use unprecedented observational constraints from subsidence regimes in the tropical Atlantic to develop a theory for the shape and magnitude of low‐level longwave radiative cooling in clear‐sky, showing peaks larger than 5–10 K/day at the top of the boundary layer. A suite of novel scaling approximations is first developed from simplified spectral theory, in close agreement with the measurements. The radiative cooling peak height is set by the maximum lapse rate in water vapor path, and its magnitude is mainly controlled by the ratio of column relative humidity above and below the peak. We emphasize how elevated intrusions of moist air can reduce low‐level cooling, by sporadically shading the spectral range which effectively cools to space. The efficiency of this spectral shading depends both on water content and altitude of moist intrusions; its height dependence cannot be explained by the temperature difference between the emitting and absorbing layers, but by the decrease of water vapor extinction with altitude. This analytical work can help to narrow the search for low‐level cloud patterns sensitive to radiative‐convective feedbacks: the most organized patterns with largest cloud fractions occur in atmospheres below 10% relative humidity and feel the strongest low‐level cooling. This motivates further assessment of favorable conditions for radiative‐convective feedbacks and a robust quantification of corresponding shallow cloud dynamics in current and warmer climates. AU - Fildier, B. AU - Muller, Caroline J AU - Pincus, R. AU - Fueglistaler, S. ID - 14752 IS - 3 JF - AGU Advances KW - General Earth and Planetary Sciences TI - How moisture shapes low‐level radiative cooling in subsidence regimes VL - 4 ER - TY - JOUR AB - The large-scale laminar/turbulent spiral patterns that appear in the linearly unstable regime of counter-rotating Taylor–Couette flow are investigated from a statistical perspective by means of direct numerical simulation. Unlike the vast majority of previous numerical studies, we analyse the flow in periodic parallelogram-annular domains, following a coordinate change that aligns one of the parallelogram sides with the spiral pattern. The domain size, shape and spatial resolution have been varied and the results compared with those in a sufficiently large computational orthogonal domain with natural axial and azimuthal periodicity. We find that a minimal parallelogram of the right tilt significantly reduces the computational cost without notably compromising the statistical properties of the supercritical turbulent spiral. Its mean structure, obtained from extremely long time integrations in a co-rotating reference frame using the method of slices, bears remarkable similarity with the turbulent stripes observed in plane Couette flow, the centrifugal instability playing only a secondary role. AU - Wang, B. AU - Mellibovsky, F. AU - Ayats López, Roger AU - Deguchi, K. AU - Meseguer, A. ID - 14754 IS - 2246 JF - Philosophical Transactions of the Royal Society A KW - General Physics and Astronomy KW - General Engineering KW - General Mathematics SN - 1364-503X TI - Mean structure of the supercritical turbulent spiral in Taylor–Couette flow VL - 381 ER - TY - JOUR AB - Several fixed-target experiments reported J/ψ and ϒ polarizations, as functions of Feynman x (xF) and transverse momentum (PT), in three different frames, using different combinations of beam particles, target nuclei, and collision energies. Despite the diverse and heterogeneous picture formed by these measurements, a detailed look allows us to discern qualitative physical patterns that inspire a simple empirical model. This data-driven scenario offers a good quantitative description of the J/ψ and ϒ(1S) polarizations measured in proton- and pion-nucleus collisions, in the xF 0.5 domain: more than 80 data points (not statistically independent) are well reproduced with only one free parameter. This study sets the context for future low-PT quarkonium polarization measurements in proton- and pion-nucleus collisions, such as those to be made by the AMBER experiment, and shows that such measurements provide significant constraints on the poorly-known parton distribution functions of the pion. AU - Faccioli, Pietro AU - Krätschmer, Ilse AU - Lourenço, Carlos ID - 14753 JF - Physics Letters B KW - Nuclear and High Energy Physics SN - 0370-2693 TI - Low-pT quarkonium polarization measurements: Challenges and opportunities VL - 840 ER - TY - JOUR AB - Consider the random matrix model A1/2UBU∗A1/2, where A and B are two N × N deterministic matrices and U is either an N × N Haar unitary or orthogonal random matrix. It is well known that on the macroscopic scale (Invent. Math. 104 (1991) 201–220), the limiting empirical spectral distribution (ESD) of the above model is given by the free multiplicative convolution of the limiting ESDs of A and B, denoted as μα  μβ, where μα and μβ are the limiting ESDs of A and B, respectively. In this paper, we study the asymptotic microscopic behavior of the edge eigenvalues and eigenvectors statistics. We prove that both the density of μA μB, where μA and μB are the ESDs of A and B, respectively and the associated subordination functions have a regular behavior near the edges. Moreover, we establish the local laws near the edges on the optimal scale. In particular, we prove that the entries of the resolvent are close to some functionals depending only on the eigenvalues of A, B and the subordination functions with optimal convergence rates. Our proofs and calculations are based on the techniques developed for the additive model A+UBU∗ in (J. Funct. Anal. 271 (2016) 672–719; Comm. Math. Phys. 349 (2017) 947–990; Adv. Math. 319 (2017) 251–291; J. Funct. Anal. 279 (2020) 108639), and our results can be regarded as the counterparts of (J. Funct. Anal. 279 (2020) 108639) for the multiplicative model. AU - Ding, Xiucai AU - Ji, Hong Chang ID - 14750 IS - 4 JF - The Annals of Applied Probability KW - Statistics KW - Probability and Uncertainty KW - Statistics and Probability SN - 1050-5164 TI - Local laws for multiplication of random matrices VL - 33 ER - TY - JOUR AB - We prove the r-spin cobordism hypothesis in the setting of (weak) 2-categories for every positive integer r: the 2-groupoid of 2-dimensional fully extended r-spin TQFTs with given target is equivalent to the homotopy fixed points of an induced Spin 2r -action. In particular, such TQFTs are classified by fully dualisable objects together with a trivialisation of the rth power of their Serre automorphisms. For r=1, we recover the oriented case (on which our proof builds), while ordinary spin structures correspond to r=2. To construct examples, we explicitly describe Spin 2r​-homotopy fixed points in the equivariant completion of any symmetric monoidal 2-category. We also show that every object in a 2-category of Landau–Ginzburg models gives rise to fully extended spin TQFTs and that half of these do not factor through the oriented bordism 2-category. AU - Carqueville, Nils AU - Szegedy, Lorant ID - 14756 IS - 3 JF - Quantum Topology KW - Geometry and Topology KW - Mathematical Physics SN - 1663-487X TI - Fully extended r-spin TQFTs VL - 14 ER - TY - JOUR AB - We consider zero-error communication over a two-transmitter deterministic adversarial multiple access channel (MAC) governed by an adversary who has access to the transmissions of both senders (hence called omniscient ) and aims to maliciously corrupt the communication. None of the encoders, jammer and decoder is allowed to randomize using private or public randomness. This enforces a combinatorial nature of the problem. Our model covers a large family of channels studied in the literature, including all deterministic discrete memoryless noisy or noiseless MACs. In this work, given an arbitrary two-transmitter deterministic omniscient adversarial MAC, we characterize when the capacity region: 1) has nonempty interior (in particular, is two-dimensional); 2) consists of two line segments (in particular, has empty interior); 3) consists of one line segment (in particular, is one-dimensional); 4) or only contains (0,0) (in particular, is zero-dimensional). This extends a recent result by Wang et al. (201 9) from the point-to-point setting to the multiple access setting. Indeed, our converse arguments build upon their generalized Plotkin bound and involve delicate case analysis. One of the technical challenges is to take care of both “joint confusability” and “marginal confusability”. In particular, the treatment of marginal confusability does not follow from the point-to-point results by Wang et al. Our achievability results follow from random coding with expurgation. AU - Zhang, Yihan ID - 14751 IS - 7 JF - IEEE Transactions on Information Theory KW - Computer Science Applications KW - Information Systems SN - 0018-9448 TI - Zero-error communication over adversarial MACs VL - 69 ER - TY - JOUR AB - We consider the sharp interface limit for the scalar-valued and vector-valued Allen–Cahn equation with homogeneous Neumann boundary condition in a bounded smooth domain Ω of arbitrary dimension N ⩾ 2 in the situation when a two-phase diffuse interface has developed and intersects the boundary ∂ Ω. The limit problem is mean curvature flow with 90°-contact angle and we show convergence in strong norms for well-prepared initial data as long as a smooth solution to the limit problem exists. To this end we assume that the limit problem has a smooth solution on [ 0 , T ] for some time T > 0. Based on the latter we construct suitable curvilinear coordinates and set up an asymptotic expansion for the scalar-valued and the vector-valued Allen–Cahn equation. In order to estimate the difference of the exact and approximate solutions with a Gronwall-type argument, a spectral estimate for the linearized Allen–Cahn operator in both cases is required. The latter will be shown in a separate paper, cf. (Moser (2021)). AU - Moser, Maximilian ID - 14755 IS - 3-4 JF - Asymptotic Analysis KW - General Mathematics SN - 0921-7134 TI - Convergence of the scalar- and vector-valued Allen–Cahn equation to mean curvature flow with 90°-contact angle in higher dimensions, part I: Convergence result VL - 131 ER - TY - CHAP AB - The cerebral cortex is comprised of a vast cell-type diversity sequentially generated by cortical progenitor cells. Faithful progenitor lineage progression requires the tight orchestration of distinct molecular and cellular mechanisms regulating proper progenitor proliferation behavior and differentiation. Correct execution of developmental programs involves a complex interplay of cell intrinsic and tissue-wide mechanisms. Many studies over the past decades have been able to determine a plethora of genes critically involved in cortical development. However, only a few made use of genetic paradigms with sparse and global gene deletion to probe cell-autonomous vs. tissue-wide contribution. In this chapter, we will elaborate on the importance of dissecting the cell-autonomous and tissue-wide mechanisms to gain a precise understanding of gene function during radial glial progenitor lineage progression. AU - Villalba Requena, Ana AU - Amberg, Nicole AU - Hippenmeyer, Simon ED - Huttner, Wieland ID - 14757 T2 - Neocortical Neurogenesis in Development and Evolution TI - Interplay of Cell‐autonomous Gene Function and Tissue‐wide Mechanisms Regulating Radial Glial Progenitor Lineage Progression ER - TY - JOUR AB - Proper operation of electro-optic I/Q modulators relies on precise adjustment and control of the relative phase biases between the modulator’s internal interferometer arms. We present an all-analog phase bias locking scheme where error signals are obtained from the beat between the optical carrier and optical tones generated by an auxiliary 2 MHz 𝑅𝐹 tone to lock the phases of all three involved interferometers for operation up to 10 GHz. With the developed method, we demonstrate an I/Q modulator in carrier-suppressed single-sideband mode, where the suppressed carrier and sideband are locked at optical power levels <−27dB relative to the transmitted sideband. We describe a simple analytical model for calculating the error signals and detail the implementation of the electronic circuitry for the implementation of the method. AU - Wald, Sebastian AU - Diorico, Fritz R AU - Hosten, Onur ID - 14759 IS - 1 JF - Applied Optics KW - Atomic and Molecular Physics KW - and Optics KW - Engineering (miscellaneous) KW - Electrical and Electronic Engineering SN - 1559-128X TI - Analog stabilization of an electro-optic I/Q modulator with an auxiliary modulation tone VL - 62 ER - TY - DATA AB - 3D-reconstruction of living brain tissue down to individual synapse level would create opportunities for decoding the dynamics and structure-function relationships of the brain’s complex and dense information processing network. However, it has been hindered by insufficient 3D-resolution, inadequate signal-to-noise-ratio, and prohibitive light burden in optical imaging, whereas electron microscopy is inherently static. Here we solved these challenges by developing an integrated optical/machine learning technology, LIONESS (Live Information-Optimized Nanoscopy Enabling Saturated Segmentation). It leverages optical modifications to stimulated emission depletion (STED) microscopy in comprehensively, extracellularly labelled tissue and prior information on sample structure via machine learning to simultaneously achieve isotropic super-resolution, high signal-to-noise-ratio, and compatibility with living tissue. This allows dense deep-learning-based instance segmentation and 3D-reconstruction at synapse level incorporating molecular, activity, and morphodynamic information. LIONESS opens up avenues for studying the dynamic functional (nano-)architecture of living brain tissue. AU - Danzl, Johann G ID - 12817 TI - Research data for the publication "Dense 4D nanoscale reconstruction of living brain tissue" ER - TY - JOUR AB - Three-dimensional (3D) reconstruction of living brain tissue down to an individual synapse level would create opportunities for decoding the dynamics and structure–function relationships of the brain’s complex and dense information processing network; however, this has been hindered by insufficient 3D resolution, inadequate signal-to-noise ratio and prohibitive light burden in optical imaging, whereas electron microscopy is inherently static. Here we solved these challenges by developing an integrated optical/machine-learning technology, LIONESS (live information-optimized nanoscopy enabling saturated segmentation). This leverages optical modifications to stimulated emission depletion microscopy in comprehensively, extracellularly labeled tissue and previous information on sample structure via machine learning to simultaneously achieve isotropic super-resolution, high signal-to-noise ratio and compatibility with living tissue. This allows dense deep-learning-based instance segmentation and 3D reconstruction at a synapse level, incorporating molecular, activity and morphodynamic information. LIONESS opens up avenues for studying the dynamic functional (nano-)architecture of living brain tissue. AU - Velicky, Philipp AU - Miguel Villalba, Eder AU - Michalska, Julia M AU - Lyudchik, Julia AU - Wei, Donglai AU - Lin, Zudi AU - Watson, Jake AU - Troidl, Jakob AU - Beyer, Johanna AU - Ben Simon, Yoav AU - Sommer, Christoph M AU - Jahr, Wiebke AU - Cenameri, Alban AU - Broichhagen, Johannes AU - Grant, Seth G.N. AU - Jonas, Peter M AU - Novarino, Gaia AU - Pfister, Hanspeter AU - Bickel, Bernd AU - Danzl, Johann G ID - 13267 JF - Nature Methods SN - 1548-7091 TI - Dense 4D nanoscale reconstruction of living brain tissue VL - 20 ER - TY - CONF AB - Pruning—that is, setting a significant subset of the parameters of a neural network to zero—is one of the most popular methods of model compression. Yet, several recent works have raised the issue that pruning may induce or exacerbate bias in the output of the compressed model. Despite existing evidence for this phenomenon, the relationship between neural network pruning and induced bias is not well-understood. In this work, we systematically investigate and characterize this phenomenon in Convolutional Neural Networks for computer vision. First, we show that it is in fact possible to obtain highly-sparse models, e.g. with less than 10% remaining weights, which do not decrease in accuracy nor substantially increase in bias when compared to dense models. At the same time, we also find that, at higher sparsities, pruned models exhibit higher uncertainty in their outputs, as well as increased correlations, which we directly link to increased bias. We propose easy-to-use criteria which, based only on the uncompressed model, establish whether bias will increase with pruning, and identify the samples most susceptible to biased predictions post-compression. Our code can be found at https://github.com/IST-DASLab/pruned-vision-model-bias. AU - Iofinova, Eugenia B AU - Peste, Elena-Alexandra AU - Alistarh, Dan-Adrian ID - 14771 T2 - 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition TI - Bias in pruned vision models: In-depth analysis and countermeasures ER - TY - JOUR AB - We developed LIONESS, a technology that leverages improvements to optical super-resolution microscopy and prior information on sample structure via machine learning to overcome the limitations (in 3D-resolution, signal-to-noise ratio and light exposure) of optical microscopy of living biological specimens. LIONESS enables dense reconstruction of living brain tissue and morphodynamics visualization at the nanoscale. AU - Danzl, Johann G AU - Velicky, Philipp ID - 14770 IS - 8 JF - Nature Methods KW - Cell Biology KW - Molecular Biology KW - Biochemistry KW - Biotechnology SN - 1548-7091 TI - LIONESS enables 4D nanoscale reconstruction of living brain tissue VL - 20 ER - TY - JOUR AB - Morphogen gradients impart positional information to cells in a homogenous tissue field. Fgf8a, a highly conserved growth factor, has been proposed to act as a morphogen during zebrafish gastrulation. However, technical limitations have so far prevented direct visualization of the endogenous Fgf8a gradient and confirmation of its morphogenic activity. Here, we monitor Fgf8a propagation in the developing neural plate using a CRISPR/Cas9-mediated EGFP knock-in at the endogenous fgf8a locus. By combining sensitive imaging with single-molecule fluorescence correlation spectroscopy, we demonstrate that Fgf8a, which is produced at the embryonic margin, propagates by diffusion through the extracellular space and forms a graded distribution towards the animal pole. Overlaying the Fgf8a gradient curve with expression profiles of its downstream targets determines the precise input-output relationship of Fgf8a-mediated patterning. Manipulation of the extracellular Fgf8a levels alters the signaling outcome, thus establishing Fgf8a as a bona fide morphogen during zebrafish gastrulation. Furthermore, by hindering Fgf8a diffusion, we demonstrate that extracellular diffusion of the protein from the source is crucial for it to achieve its morphogenic potential. AU - Harish, Rohit K AU - Gupta, Mansi AU - Zöller, Daniela AU - Hartmann, Hella AU - Gheisari, Ali AU - Machate, Anja AU - Hans, Stefan AU - Brand, Michael ID - 14774 IS - 19 JF - Development KW - Developmental Biology KW - Molecular Biology SN - 0950-1991 TI - Real-time monitoring of an endogenous Fgf8a gradient attests to its role as a morphogen during zebrafish gastrulation VL - 150 ER - TY - JOUR AB - Soluble chaperones residing in the endoplasmic reticulum (ER) play vitally important roles in folding and quality control of newly synthesized proteins that transiently pass through the ER en route to their final destinations. These soluble residents of the ER are themselves endowed with an ER retrieval signal that enables the cell to bring the escaped residents back from the Golgi. Here, by using purified proteins, we showed that Nicotiana tabacum phytaspase, a plant aspartate-specific protease, introduces two breaks at the C-terminus of the N. tabacum ER resident calreticulin-3. These cleavages resulted in removal of either a dipeptide or a hexapeptide from the C-terminus of calreticulin-3 encompassing part or all of the ER retrieval signal. Consistently, expression of the calreticulin-3 derivative mimicking the phytaspase cleavage product in Nicotiana benthamiana cells demonstrated loss of the ER accumulation of the protein. Notably, upon its escape from the ER, calreticulin-3 was further processed by an unknown protease(s) to generate the free N-terminal (N) domain of calreticulin-3, which was ultimately secreted into the apoplast. Our study thus identified a specific proteolytic enzyme capable of precise detachment of the ER retrieval signal from a plant ER resident protein, with implications for the further fate of the escaped resident. AU - Teplova, Anastasiia AU - Pigidanov, Artemii A. AU - Serebryakova, Marina V. AU - Golyshev, Sergei A. AU - Galiullina, Raisa A. AU - Chichkova, Nina V. AU - Vartapetian, Andrey B. ID - 14776 IS - 22 JF - International Journal of Molecular Sciences KW - Inorganic Chemistry KW - Organic Chemistry KW - Physical and Theoretical Chemistry KW - Computer Science Applications KW - Spectroscopy KW - Molecular Biology KW - General Medicine KW - Catalysis SN - 1422-0067 TI - Phytaspase Is capable of detaching the endoplasmic reticulum retrieval signal from tobacco calreticulin-3 VL - 24 ER - TY - JOUR AB - We establish a quantitative version of the Tracy–Widom law for the largest eigenvalue of high-dimensional sample covariance matrices. To be precise, we show that the fluctuations of the largest eigenvalue of a sample covariance matrix X∗X converge to its Tracy–Widom limit at a rate nearly N−1/3, where X is an M×N random matrix whose entries are independent real or complex random variables, assuming that both M and N tend to infinity at a constant rate. This result improves the previous estimate N−2/9 obtained by Wang (2019). Our proof relies on a Green function comparison method (Adv. Math. 229 (2012) 1435–1515) using iterative cumulant expansions, the local laws for the Green function and asymptotic properties of the correlation kernel of the white Wishart ensemble. AU - Schnelli, Kevin AU - Xu, Yuanyuan ID - 14775 IS - 1 JF - The Annals of Applied Probability KW - Statistics KW - Probability and Uncertainty KW - Statistics and Probability SN - 1050-5164 TI - Convergence rate to the Tracy–Widom laws for the largest eigenvalue of sample covariance matrices VL - 33 ER - TY - JOUR AB - Through a combination of idealized simulations and real-world data, researchers are uncovering how internal feedbacks and large-scale motions influence cloud dynamics. AU - Muller, Caroline J AU - Abramian, Sophie ID - 14773 IS - 5 JF - Physics Today KW - General Physics and Astronomy SN - 0031-9228 TI - The cloud dynamics of convective storm systems VL - 76 ER - TY - JOUR AB - The effects of the partial V-substitution for Ag on the thermoelectric (TE) properties are investigated for a flexible semiconducting compound Ag2S0.55Se0.45. Density functional theory calculations predict that such a partial V-substitution constructively modifies the electronic structure near the bottom of the conduction band to improve the TE performance. The synthesized Ag1.97V0.03S0.55Se0.45 is found to possess a TE dimensionless figure-of-merit (ZT) of 0.71 at 350 K with maintaining its flexible nature. This ZT value is relatively high in comparison with those reported for flexible TE materials below 360 K. The increase in the ZT value is caused by the enhanced absolute value of the Seebeck coefficient with less significant variation in electrical resistivity. The high ZT value with the flexible nature naturally allows us to employ the Ag1.97V0.03S0.55Se0.45 as a component of flexible TE generators. AU - Sato, Kosuke AU - Singh, Saurabh AU - Yamazaki, Itsuki AU - Hirata, Keisuke AU - Ang, Artoni Kevin R. AU - Matsunami, Masaharu AU - Takeuchi, Tsunehiro ID - 14777 IS - 12 JF - AIP Advances KW - General Physics and Astronomy TI - Improvement of thermoelectric performance of flexible compound Ag2S0.55Se0.45 by means of partial V-substitution for Ag VL - 13 ER - TY - JOUR AB - We introduce a hierachy of equivalence relations on the set of separated nets of a given Euclidean space, indexed by concave increasing functions ϕ:(0,∞)→(0,∞). Two separated nets are called ϕ-displacement equivalent if, roughly speaking, there is a bijection between them which, for large radii R, displaces points of norm at most R by something of order at most ϕ(R). We show that the spectrum of ϕ-displacement equivalence spans from the established notion of bounded displacement equivalence, which corresponds to bounded ϕ, to the indiscrete equivalence relation, coresponding to ϕ(R)∈Ω(R), in which all separated nets are equivalent. In between the two ends of this spectrum, the notions of ϕ-displacement equivalence are shown to be pairwise distinct with respect to the asymptotic classes of ϕ(R) for R→∞. We further undertake a comparison of our notion of ϕ-displacement equivalence with previously studied relations on separated nets. Particular attention is given to the interaction of the notions of ϕ-displacement equivalence with that of bilipschitz equivalence. AU - Dymond, Michael AU - Kaluza, Vojtech ID - 9651 JF - Geometriae Dedicata SN - 0046-5755 TI - Divergence of separated nets with respect to displacement equivalence ER - TY - CONF AB - In all state-of-the-art sketching and coreset techniques for clustering, as well as in the best known fixed-parameter tractable approximation algorithms, randomness plays a key role. For the classic k-median and k-means problems, there are no known deterministic dimensionality reduction procedure or coreset construction that avoid an exponential dependency on the input dimension d, the precision parameter $\varepsilon^{-1}$ or k. Furthermore, there is no coreset construction that succeeds with probability $1-1/n$ and whose size does not depend on the number of input points, n. This has led researchers in the area to ask what is the power of randomness for clustering sketches [Feldman WIREs Data Mining Knowl. Discov’20].Similarly, the best approximation ratio achievable deterministically without a complexity exponential in the dimension are $1+\sqrt{2}$ for k-median [Cohen-Addad, Esfandiari, Mirrokni, Narayanan, STOC’22] and 6.12903 for k-means [Grandoni, Ostrovsky, Rabani, Schulman, Venkat, Inf. Process. Lett.’22]. Those are the best results, even when allowing a complexity FPT in the number of clusters k: this stands in sharp contrast with the $(1+\varepsilon)$-approximation achievable in that case, when allowing randomization.In this paper, we provide deterministic sketches constructions for clustering, whose size bounds are close to the best-known randomized ones. We show how to compute a dimension reduction onto $\varepsilon^{-O(1)} \log k$ dimensions in time $k^{O\left(\varepsilon^{-O(1)}+\log \log k\right)}$ poly $(n d)$, and how to build a coreset of size $O\left(k^{2} \log ^{3} k \varepsilon^{-O(1)}\right)$ in time $2^{\varepsilon^{O(1)} k \log ^{3} k}+k^{O\left(\varepsilon^{-O(1)}+\log \log k\right)}$ poly $(n d)$. In the case where k is small, this answers an open question of [Feldman WIDM’20] and [Munteanu and Schwiegelshohn, Künstliche Intell. ’18] on whether it is possible to efficiently compute coresets deterministically.We also construct a deterministic algorithm for computing $(1+$ $\varepsilon)$-approximation to k-median and k-means in high dimensional Euclidean spaces in time $2^{k^{2} \log ^{3} k / \varepsilon^{O(1)}}$ poly $(n d)$, close to the best randomized complexity of $2^{(k / \varepsilon)^{O(1)}}$ nd (see [Kumar, Sabharwal, Sen, JACM 10] and [Bhattacharya, Jaiswal, Kumar, TCS’18]).Furthermore, our new insights on sketches also yield a randomized coreset construction that uses uniform sampling, that immediately improves over the recent results of [Braverman et al. FOCS ’22] by a factor k. AU - Cohen-Addad, Vincent AU - Saulpic, David AU - Schwiegelshohn, Chris ID - 14768 T2 - 2023 IEEE 64th Annual Symposium on Foundations of Computer Science TI - Deterministic clustering in high dimensional spaces: Sketches and approximation ER - TY - JOUR AB - The next steps of deep space exploration are manned missions to Moon and Mars. For safe space missions for crew members, it is important to understand the impact of space flight on the immune system. We studied the effects of 21 days dry immersion (DI) exposure on the transcriptomes of T cells isolated from blood samples of eight healthy volunteers. Samples were collected 7 days before DI, at day 7, 14, and 21 during DI, and 7 days after DI. RNA sequencing of CD3+T cells revealed transcriptional alterations across all time points, with most changes occurring 14 days after DI exposure. At day 21, T cells showed evidence of adaptation with a transcriptional profile resembling that of 7 days before DI. At 7 days after DI, T cells again changed their transcriptional profile. These data suggest that T cells adapt by rewiring their transcriptomes in response to simulated weightlessness and that remodeling cues persist when reexposed to normal gravity. AU - Gallardo-Dodd, Carlos J. AU - Oertlin, Christian AU - Record, Julien AU - Galvani, Rômulo G. AU - Sommerauer, Christian AU - Kuznetsov, Nikolai V. AU - Doukoumopoulos, Evangelos AU - Ali, Liaqat AU - Oliveira, Mariana M. S. AU - Seitz, Christina AU - Percipalle, Mathias AU - Nikić, Tijana AU - Sadova, Anastasia A. AU - Shulgina, Sofia M. AU - Shmarov, Vjacheslav A. AU - Kutko, Olga V. AU - Vlasova, Daria D. AU - Orlova, Kseniya D. AU - Rykova, Marina P. AU - Andersson, John AU - Percipalle, Piergiorgio AU - Kutter, Claudia AU - Ponomarev, Sergey A. AU - Westerberg, Lisa S. ID - 14784 IS - 34 JF - Science Advances KW - Multidisciplinary SN - 2375-2548 TI - Exposure of volunteers to microgravity by dry immersion bed over 21 days results in gene expression changes and adaptation of T cells VL - 9 ER - TY - JOUR AB - The actin cortex is a complex cytoskeletal machinery that drives and responds to changes in cell shape. It must generate or adapt to plasma membrane curvature to facilitate diverse functions such as cell division, migration, and phagocytosis. Due to the complex molecular makeup of the actin cortex, it remains unclear whether actin networks are inherently able to sense and generate membrane curvature, or whether they rely on their diverse binding partners to accomplish this. Here, we show that curvature sensing is an inherent capability of branched actin networks nucleated by Arp2/3 and VCA. We develop a robust method to encapsulate actin inside giant unilamellar vesicles (GUVs) and assemble an actin cortex at the inner surface of the GUV membrane. We show that actin forms a uniform and thin cortical layer when present at high concentration and distinct patches associated with negative membrane curvature at low concentration. Serendipitously, we find that the GUV production method also produces dumbbell-shaped GUVs, which we explain using mathematical modeling in terms of membrane hemifusion of nested GUVs. We find that branched actin networks preferentially assemble at the neck of the dumbbells, which possess a micrometer-range convex curvature comparable with the curvature of the actin patches found in spherical GUVs. Minimal branched actin networks can thus sense membrane curvature, which may help mammalian cells to robustly recruit actin to curved membranes to facilitate diverse cellular functions such as cytokinesis and migration. AU - Baldauf, Lucia AU - Frey, Felix F AU - Arribas Perez, Marcos AU - Idema, Timon AU - Koenderink, Gijsje H. ID - 14782 IS - 11 JF - Biophysical Journal KW - Biophysics SN - 0006-3495 TI - Branched actin cortices reconstituted in vesicles sense membrane curvature VL - 122 ER - TY - JOUR AB - Connexin 43, an astroglial gap junction protein, is enriched in perisynaptic astroglial processes and plays major roles in synaptic transmission. We have previously found that astroglial Cx43 controls synaptic glutamate levels and allows for activity-dependent glutamine release to sustain physiological synaptic transmissions and cognitiogns. However, whether Cx43 is important for the release of synaptic vesicles, which is a critical component of synaptic efficacy, remains unanswered. Here, using transgenic mice with a glial conditional knockout of Cx43 (Cx43−/−), we investigate whether and how astrocytes regulate the release of synaptic vesicles from hippocampal synapses. We report that CA1 pyramidal neurons and their synapses develop normally in the absence of astroglial Cx43. However, a significant impairment in synaptic vesicle distribution and release dynamics were observed. In particular, the FM1-43 assays performed using two-photon live imaging and combined with multi-electrode array stimulation in acute hippocampal slices, revealed a slower rate of synaptic vesicle release in Cx43−/− mice. Furthermore, paired-pulse recordings showed that synaptic vesicle release probability was also reduced and is dependent on glutamine supply via Cx43 hemichannel (HC). Taken together, we have uncovered a role for Cx43 in regulating presynaptic functions by controlling the rate and probability of synaptic vesicle release. Our findings further highlight the significance of astroglial Cx43 in synaptic transmission and efficacy. AU - Cheung, Giselle T AU - Chever, Oana AU - Rollenhagen, Astrid AU - Quenech’du, Nicole AU - Ezan, Pascal AU - Lübke, Joachim H. R. AU - Rouach, Nathalie ID - 14783 IS - 8 JF - Cells KW - General Medicine SN - 2073-4409 TI - Astroglial connexin 43 regulates synaptic vesicle release at hippocampal synapses VL - 12 ER - TY - JOUR AB - Small cryptic plasmids have no clear effect on the host fitness and their functional repertoire remains obscure. The naturally competent cyanobacterium Synechocystis sp. PCC 6803 harbours several small cryptic plasmids; whether their evolution with this species is supported by horizontal transfer remains understudied. Here, we show that the small cryptic plasmid DNA is transferred in the population exclusively by natural transformation, where the transfer frequency of plasmid‐encoded genes is similar to that of chromosome‐encoded genes. Establishing a system to follow gene transfer, we compared the transfer frequency of genes encoded in cryptic plasmids pCA2.4 (2378 bp) and pCB2.4 (2345 bp) within and between populations of two Synechocystis sp. PCC 6803 labtypes (termed Kiel and Sevilla). Our results reveal that plasmid gene transfer frequency depends on the recipient labtype. Furthermore, gene transfer via whole plasmid uptake in the Sevilla labtype ranged among the lowest detected transfer rates in our experiments. Our study indicates that horizontal DNA transfer via natural transformation is frequent in the evolution of small cryptic plasmids that reside in naturally competent organisms. Furthermore, we suggest that the contribution of natural transformation to cryptic plasmid persistence in Synechocystis is limited. AU - Nies, Fabian AU - Wein, Tanita AU - Hanke, Dustin M. AU - Springstein, Benjamin L AU - Alcorta, Jaime AU - Taubenheim, Claudia AU - Dagan, Tal ID - 14785 IS - 6 JF - Environmental Microbiology Reports KW - Agricultural and Biological Sciences (miscellaneous) KW - Ecology KW - Evolution KW - Behavior and Systematics TI - Role of natural transformation in the evolution of small cryptic plasmids in Synechocystis sp. PCC 6803 VL - 15 ER - TY - JOUR AB - In this paper, we study the eigenvalues and eigenvectors of the spiked invariant multiplicative models when the randomness is from Haar matrices. We establish the limits of the outlier eigenvalues λˆi and the generalized components (⟨v,uˆi⟩ for any deterministic vector v) of the outlier eigenvectors uˆi with optimal convergence rates. Moreover, we prove that the non-outlier eigenvalues stick with those of the unspiked matrices and the non-outlier eigenvectors are delocalized. The results also hold near the so-called BBP transition and for degenerate spikes. On one hand, our results can be regarded as a refinement of the counterparts of [12] under additional regularity conditions. On the other hand, they can be viewed as an analog of [34] by replacing the random matrix with i.i.d. entries with Haar random matrix. AU - Ding, Xiucai AU - Ji, Hong Chang ID - 14780 JF - Stochastic Processes and their Applications KW - Applied Mathematics KW - Modeling and Simulation KW - Statistics and Probability SN - 0304-4149 TI - Spiked multiplicative random matrices and principal components VL - 163 ER - TY - JOUR AB - The presence of a developed boundary layer decouples a glacier's response from ambient conditions, suggesting that sensitivity to climate change is increased by glacier retreat. To test this hypothesis, we explore six years of distributed meteorological data on a small Swiss glacier in the period 2001–2022. Large glacier fragmentation has occurred since 2001 (−35% area change up to 2022) coinciding with notable frontal retreat, an observed switch from down‐glacier katabatic to up‐glacier valley winds and an increased sensitivity (ratio) of on‐glacier to off‐glacier temperature. As the glacier ceases to develop density‐driven katabatic winds, sensible heat fluxes on the glacier are increasingly determined by the conditions occurring outside the boundary layer of the glacier, sealing the glacier's demise as the climate continues to warm and experience an increased frequency of extreme summers. AU - Shaw, Thomas E. AU - Buri, Pascal AU - McCarthy, Michael AU - Miles, Evan S. AU - Ayala, Álvaro AU - Pellicciotti, Francesca ID - 14779 IS - 11 JF - Geophysical Research Letters KW - General Earth and Planetary Sciences KW - Geophysics SN - 0094-8276 TI - The decaying near‐surface boundary layer of a retreating alpine glacier VL - 50 ER - TY - JOUR AB - Germ granules, condensates of phase-separated RNA and protein, are organelles that are essential for germline development in different organisms. The patterning of the granules and their relevance for germ cell fate are not fully understood. Combining three-dimensional in vivo structural and functional analyses, we study the dynamic spatial organization of molecules within zebrafish germ granules. We find that the localization of RNA molecules to the periphery of the granules, where ribosomes are localized, depends on translational activity at this location. In addition, we find that the vertebrate-specific Dead end (Dnd1) protein is essential for nanos3 RNA localization at the condensates’ periphery. Accordingly, in the absence of Dnd1, or when translation is inhibited, nanos3 RNA translocates into the granule interior, away from the ribosomes, a process that is correlated with the loss of germ cell fate. These findings highlight the relevance of sub-granule compartmentalization for post-transcriptional control and its importance for preserving germ cell totipotency. AU - Westerich, Kim Joana AU - Tarbashevich, Katsiaryna AU - Schick, Jan AU - Gupta, Antra AU - Zhu, Mingzhao AU - Hull, Kenneth AU - Romo, Daniel AU - Zeuschner, Dagmar AU - Goudarzi, Mohammad AU - Gross-Thebing, Theresa AU - Raz, Erez ID - 14781 IS - 17 JF - Developmental Cell KW - Developmental Biology KW - Cell Biology KW - General Biochemistry KW - Genetics and Molecular Biology KW - Molecular Biology SN - 1534-5807 TI - Spatial organization and function of RNA molecules within phase-separated condensates in zebrafish are controlled by Dnd1 VL - 58 ER - TY - THES AB - Stochastic systems provide a formal framework for modelling and quantifying uncertainty in systems and have been widely adopted in many application domains. Formal verification and control of finite state stochastic systems, a subfield of formal methods also known as probabilistic model checking, is well studied. In contrast, formal verification and control of infinite state stochastic systems have received comparatively less attention. However, infinite state stochastic systems commonly arise in practice. For instance, probabilistic models that contain continuous probability distributions such as normal or uniform, or stochastic dynamical systems which are a classical model for control under uncertainty, both give rise to infinite state systems. The goal of this thesis is to contribute to laying theoretical and algorithmic foundations of fully automated formal verification and control of infinite state stochastic systems, with a particular focus on systems that may be executed over a long or infinite time. We consider formal verification of infinite state stochastic systems in the setting of static analysis of probabilistic programs and formal control in the setting of controller synthesis in stochastic dynamical systems. For both problems, we present some of the first fully automated methods for probabilistic (a.k.a. quantitative) reachability and safety analysis applicable to infinite time horizon systems. We also advance the state of the art of probability 1 (a.k.a. qualitative) reachability analysis for both problems. Finally, for formal controller synthesis in stochastic dynamical systems, we present a novel framework for learning neural network control policies in stochastic dynamical systems with formal guarantees on correctness with respect to quantitative reachability, safety or reach-avoid specifications. AU - Zikelic, Dorde ID - 14539 SN - 2663 - 337X TI - Automated verification and control of infinite state stochastic systems ER - TY - JOUR AB - Eukaryotic cells use clathrin-mediated endocytosis to take up a large range of extracellular cargo. During endocytosis, a clathrin coat forms on the plasma membrane, but it remains controversial when and how it is remodeled into a spherical vesicle. Here, we use 3D superresolution microscopy to determine the precise geometry of the clathrin coat at large numbers of endocytic sites. Through pseudo-temporal sorting, we determine the average trajectory of clathrin remodeling during endocytosis. We find that clathrin coats assemble first on flat membranes to 50% of the coat area before they become rapidly and continuously bent, and this mechanism is confirmed in three cell lines. We introduce the cooperative curvature model, which is based on positive feedback for curvature generation. It accurately describes the measured shapes and dynamics of the clathrin coat and could represent a general mechanism for clathrin coat remodeling on the plasma membrane. AU - Mund, Markus AU - Tschanz, Aline AU - Wu, Yu-Le AU - Frey, Felix F AU - Mehl, Johanna L. AU - Kaksonen, Marko AU - Avinoam, Ori AU - Schwarz, Ulrich S. AU - Ries, Jonas ID - 14788 IS - 3 JF - Journal of Cell Biology KW - Cell Biology SN - 0021-9525 TI - Clathrin coats partially preassemble and subsequently bend during endocytosis VL - 222 ER - TY - JOUR AB - Acanthocephalans, intestinal parasites of vertebrates, are characterised by orders of magnitude higher metal accumulation than free-living organisms, but the mechanism of such effective metal accumulation is still unknown. The aim of our study was to gain new insights into the high-resolution localization of elements in the bodies of acanthocephalans, thus taking an initial step towards elucidating metal uptake and accumulation in organisms under real environmental conditions. For the first time, nanoscale secondary ion mass spectrometry (NanoSIMS) was used for high-resolution mapping of 12 elements (C, Ca, Cu, Fe, N, Na, O, P, Pb, S, Se, and Tl) in three selected body parts (trunk spines, inner part of the proboscis receptacle and inner surface of the tegument) of Dentitruncus truttae, a parasite of brown trout (Salmo trutta) from the Krka River in Croatia. In addition, the same body parts were examined using transmission electron microscopy (TEM) and correlated with NanoSIMS images. Metal concentrations determined using HR ICP-MS confirmed higher accumulation in D. truttae than in the fish intestine. The chemical composition of the acanthocephalan body showed the highest density of C, Ca, N, Na, O, S, as important and constitutive elements in living cells in all studied structures, while Fe was predominant among trace elements. In general, higher element density was found in trunk spines and tegument, as body structures responsible for substance absorption in parasites. The results obtained with NanoSIMS and TEM-NanoSIMS correlative imaging represent pilot data for mapping of elements at nanoscale resolution in the ultrastructure of various body parts of acanthocephalans and generally provide a contribution for further application of this technique in all parasite species. AU - Filipović Marijić, Vlatka AU - Subirana, Maria Angels AU - Schaumlöffel, Dirk AU - Barišić, Josip AU - Gontier, Etienne AU - Krasnici, Nesrete AU - Mijošek, Tatjana AU - Hernández-Orts, Jesús S. AU - Scholz, Tomáš AU - Erk, Marijana ID - 14786 JF - Science of The Total Environment KW - Pollution KW - Waste Management and Disposal KW - Environmental Chemistry KW - Environmental Engineering SN - 0048-9697 TI - First insight in element localisation in different body parts of the acanthocephalan Dentitruncus truttae using TEM and NanoSIMS VL - 887 ER - TY - JOUR AB - Understanding the phenotypic and genetic architecture of reproductive isolation is a long‐standing goal of speciation research. In several systems, large‐effect loci contributing to barrier phenotypes have been characterized, but such causal connections are rarely known for more complex genetic architectures. In this study, we combine “top‐down” and “bottom‐up” approaches with demographic modelling toward an integrated understanding of speciation across a monkeyflower hybrid zone. Previous work suggests that pollinator visitation acts as a primary barrier to gene flow between two divergent red‐ and yellow‐flowered ecotypes ofMimulus aurantiacus. Several candidate isolating traits and anonymous single nucleotide polymorphism loci under divergent selection have been identified, but their genomic positions remain unknown. Here, we report findings from demographic analyses that indicate this hybrid zone formed by secondary contact, but that subsequent gene flow was restricted by widespread barrier loci across the genome. Using a novel, geographic cline‐based genome scan, we demonstrate that candidate barrier loci are broadly distributed across the genome, rather than mapping to one or a few “islands of speciation.” Quantitative trait locus (QTL) mapping reveals that most floral traits are highly polygenic, with little evidence that QTL colocalize, indicating that most traits are genetically independent. Finally, we find little evidence that QTL and candidate barrier loci overlap, suggesting that some loci contribute to other forms of reproductive isolation. Our findings highlight the challenges of understanding the genetic architecture of reproductive isolation and reveal that barriers to gene flow other than pollinator isolation may play an important role in this system. AU - Stankowski, Sean AU - Chase, Madeline A. AU - McIntosh, Hanna AU - Streisfeld, Matthew A. ID - 14787 IS - 8 JF - Molecular Ecology KW - Genetics KW - Ecology KW - Evolution KW - Behavior and Systematics SN - 0962-1083 TI - Integrating top‐down and bottom‐up approaches to understand the genetic architecture of speciation across a monkeyflower hybrid zone VL - 32 ER - TY - JOUR AB - Homeostatic balance in the intestinal epithelium relies on a fast cellular turnover, which is coordinated by an intricate interplay between biochemical signalling, mechanical forces and organ geometry. We review recent modelling approaches that have been developed to understand different facets of this remarkable homeostatic equilibrium. Existing models offer different, albeit complementary, perspectives on the problem. First, biomechanical models aim to explain the local and global mechanical stresses driving cell renewal as well as tissue shape maintenance. Second, compartmental models provide insights into the conditions necessary to keep a constant flow of cells with well-defined ratios of cell types, and how perturbations can lead to an unbalance of relative compartment sizes. A third family of models address, at the cellular level, the nature and regulation of stem fate choices that are necessary to fuel cellular turnover. We also review how these different approaches are starting to be integrated together across scales, to provide quantitative predictions and new conceptual frameworks to think about the dynamics of cell renewal in complex tissues. AU - Corominas-Murtra, Bernat AU - Hannezo, Edouard B ID - 12162 JF - Seminars in Cell & Developmental Biology KW - Cell Biology KW - Developmental Biology SN - 1084-9521 TI - Modelling the dynamics of mammalian gut homeostasis VL - 150-151 ER - TY - JOUR AB - We give a simple argument to prove Nagai’s conjecture for type II degenerations of compact hyperkähler manifolds and cohomology classes of middle degree. Under an additional assumption, the techniques yield the conjecture in arbitrary degree. This would complete the proof of Nagai’s conjecture in general, as it was proved already for type I degenerations by Kollár, Laza, Saccà, and Voisin [10] and independently by Soldatenkov [18], while it is immediate for type III degenerations. Our arguments are close in spirit to a recent paper by Harder [8] proving similar results for the restrictive class of good degenerations. AU - Huybrechts, D. AU - Mauri, Mirko ID - 13268 IS - 1 JF - Mathematical Research Letters SN - 1073-2780 TI - On type II degenerations of hyperkähler manifolds VL - 30 ER - TY - JOUR AB - This paper is concerned with equilibrium configurations of one-dimensional particle systems with non-convex nearest-neighbour and next-to-nearest-neighbour interactions and its passage to the continuum. The goal is to derive compactness results for a Γ-development of the energy with the novelty that external forces are allowed. In particular, the forces may depend on Lagrangian or Eulerian coordinates and thus may model dead as well as live loads. Our result is based on a new technique for deriving compactness results which are required for calculating the first-order Γ-limit in the presence of external forces: instead of comparing a configuration of n atoms to a global minimizer of the Γ-limit, we compare the configuration to a minimizer in some subclass of functions which in some sense are "close to" the configuration. The paper is complemented with the study of the minimizers of the Γ-limit. AU - Carioni, Marcello AU - Fischer, Julian L AU - Schlömerkemper, Anja ID - 14661 IS - 1 JF - Journal of Convex Analysis SN - 0944-6532 TI - External forces in the continuum limit of discrete systems with non-convex interaction potentials: Compactness for a Γ-development VL - 30 ER - TY - JOUR AB - A round-robin study has been carried out to estimate the impact of the human element in small-angle scattering data analysis. Four corrected datasets were provided to participants ready for analysis. All datasets were measured on samples containing spherical scatterers, with two datasets in dilute dispersions and two from powders. Most of the 46 participants correctly identified the number of populations in the dilute dispersions, with half of the population mean entries within 1.5% and half of the population width entries within 40%. Due to the added complexity of the structure factor, far fewer people submitted answers on the powder datasets. For those that did, half of the entries for the means and widths were within 44 and 86%, respectively. This round-robin experiment highlights several causes for the discrepancies, for which solutions are proposed. AU - Pauw, Brian R. AU - Smales, Glen J. AU - Anker, Andy S. AU - Annadurai, Venkatasamy AU - Balazs, Daniel AU - Bienert, Ralf AU - Bouwman, Wim G. AU - Breßler, Ingo AU - Breternitz, Joachim AU - Brok, Erik S. AU - Bryant, Gary AU - Clulow, Andrew J. AU - Crater, Erin R. AU - De Geuser, Frédéric AU - Giudice, Alessandra Del AU - Deumer, Jérôme AU - Disch, Sabrina AU - Dutt, Shankar AU - Frank, Kilian AU - Fratini, Emiliano AU - Garcia, Paulo R.A.F. AU - Gilbert, Elliot P. AU - Hahn, Marc B. AU - Hallett, James AU - Hohenschutz, Max AU - Hollamby, Martin AU - Huband, Steven AU - Ilavsky, Jan AU - Jochum, Johanna K. AU - Juelsholt, Mikkel AU - Mansel, Bradley W. AU - Penttilä, Paavo AU - Pittkowski, Rebecca K. AU - Portale, Giuseppe AU - Pozzo, Lilo D. AU - Rochels, Leonhard AU - Rosalie, Julian M. AU - Saloga, Patrick E.J. AU - Seibt, Susanne AU - Smith, Andrew J. AU - Smith, Gregory N. AU - Spiering, Glenn A. AU - Stawski, Tomasz M. AU - Taché, Olivier AU - Thünemann, Andreas F. AU - Toth, Kristof AU - Whitten, Andrew E. AU - Wuttke, Joachim ID - 14799 IS - 6 JF - Journal of Applied Crystallography SN - 0021-8898 TI - The human factor: Results of a small-angle scattering data analysis round robin VL - 56 ER - TY - JOUR AB - We consider the almost-sure (a.s.) termination problem for probabilistic programs, which are a stochastic extension of classical imperative programs. Lexicographic ranking functions provide a sound and practical approach for termination of non-probabilistic programs, and their extension to probabilistic programs is achieved via lexicographic ranking supermartingales (LexRSMs). However, LexRSMs introduced in the previous work have a limitation that impedes their automation: all of their components have to be non-negative in all reachable states. This might result in a LexRSM not existing even for simple terminating programs. Our contributions are twofold. First, we introduce a generalization of LexRSMs that allows for some components to be negative. This standard feature of non-probabilistic termination proofs was hitherto not known to be sound in the probabilistic setting, as the soundness proof requires a careful analysis of the underlying stochastic process. Second, we present polynomial-time algorithms using our generalized LexRSMs for proving a.s. termination in broad classes of linear-arithmetic programs. AU - Chatterjee, Krishnendu AU - Kafshdar Goharshady, Ehsan AU - Novotný, Petr AU - Zárevúcky, Jiří AU - Zikelic, Dorde ID - 14778 IS - 2 JF - Formal Aspects of Computing KW - Theoretical Computer Science KW - Software SN - 0934-5043 TI - On lexicographic proof rules for probabilistic termination VL - 35 ER - TY - CONF AB - A faithful reproduction of gloss is inherently difficult because of the limited dynamic range, peak luminance, and 3D capabilities of display devices. This work investigates how the display capabilities affect gloss appearance with respect to a real-world reference object. To this end, we employ an accurate imaging pipeline to achieve a perceptual gloss match between a virtual and real object presented side-by-side on an augmented-reality high-dynamic-range (HDR) stereoscopic display, which has not been previously attained to this extent. Based on this precise gloss reproduction, we conduct a series of gloss matching experiments to study how gloss perception degrades based on individual factors: object albedo, display luminance, dynamic range, stereopsis, and tone mapping. We support the study with a detailed analysis of individual factors, followed by an in-depth discussion on the observed perceptual effects. Our experiments demonstrate that stereoscopic presentation has a limited effect on the gloss matching task on our HDR display. However, both reduced luminance and dynamic range of the display reduce the perceived gloss. This means that the visual system cannot compensate for the changes in gloss appearance across luminance (lack of gloss constancy), and the tone mapping operator should be carefully selected when reproducing gloss on a low dynamic range (LDR) display. AU - Chen, Bin AU - Jindal, Akshay AU - Piovarci, Michael AU - Wang, Chao AU - Seidel, Hans Peter AU - Didyk, Piotr AU - Myszkowski, Karol AU - Serrano, Ana AU - Mantiuk, Rafał K. ID - 14798 SN - 9798400703157 T2 - Proceedings of the SIGGRAPH Asia 2023 Conference TI - The effect of display capabilities on the gloss consistency between real and virtual objects ER - TY - JOUR AB - In the last few years, various communication compression techniques have emerged as an indispensable tool helping to alleviate the communication bottleneck in distributed learning. However, despite the fact biased compressors often show superior performance in practice when compared to the much more studied and understood unbiased compressors, very little is known about them. In this work we study three classes of biased compression operators, two of which are new, and their performance when applied to (stochastic) gradient descent and distributed (stochastic) gradient descent. We show for the first time that biased compressors can lead to linear convergence rates both in the single node and distributed settings. We prove that distributed compressed SGD method, employed with error feedback mechanism, enjoys the ergodic rate O(δLexp[−μKδL]+(C+δD)Kμ), where δ≥1 is a compression parameter which grows when more compression is applied, L and μ are the smoothness and strong convexity constants, C captures stochastic gradient noise (C=0 if full gradients are computed on each node) and D captures the variance of the gradients at the optimum (D=0 for over-parameterized models). Further, via a theoretical study of several synthetic and empirical distributions of communicated gradients, we shed light on why and by how much biased compressors outperform their unbiased variants. Finally, we propose several new biased compressors with promising theoretical guarantees and practical performance. AU - Beznosikov, Aleksandr AU - Horvath, Samuel AU - Richtarik, Peter AU - Safaryan, Mher ID - 14815 JF - Journal of Machine Learning Research TI - On biased compression for distributed learning VL - 24 ER - TY - CONF AB - In this paper, we present novel algorithms that efficiently compute a shortest reconfiguration sequence between two given dominating sets in trees and interval graphs under the TOKEN SLIDING model. In this problem, a graph is provided along with its two dominating sets, which can be imagined as tokens placed on vertices. The objective is to find a shortest sequence of dominating sets that transforms one set into the other, with each set in the sequence resulting from sliding a single token in the previous set. While identifying any sequence has been well studied, our work presents the first polynomial algorithms for this optimization variant in the context of dominating sets. AU - Křišťan, Jan Matyáš AU - Svoboda, Jakub ID - 14456 SN - 0302-9743 T2 - 24th International Symposium on Fundamentals of Computation Theory TI - Shortest dominating set reconfiguration under token sliding VL - 14292 ER - TY - CONF AB - This paper explores a modular design architecture aimed at helping blockchains (and other SMR implementation) to scale to a very large number of processes. This comes in contrast to existing monolithic architectures that interleave transaction dissemination, ordering, and execution in a single functionality. To achieve this we first split the monolith to multiple layers which can use existing distributed computing primitives. The exact specifications of the data dissemination part are formally defined by the Proof of Availability & Retrieval (PoA &R) abstraction. Solutions to the PoA &R problem contain two related sub-protocols: one that “pushes” information into the network and another that “pulls” this information. Regarding the latter, there is a dearth of research literature which is rectified in this paper. We present a family of pulling sub-protocols and rigorously analyze them. Extensive simulations support the theoretical claims of efficiency and robustness in case of a very large number of players. Finally, actual implementation and deployment on a small number of machines (roughly the size of several industrial systems) demonstrates the viability of the architecture’s paradigm. AU - Cohen, Shir AU - Goren, Guy AU - Kokoris Kogias, Eleftherios AU - Sonnino, Alberto AU - Spiegelman, Alexander ID - 14829 SN - 0302-9743 T2 - 27th International Conference on Financial Cryptography and Data Security TI - Proof of availability and retrieval in a modular blockchain architecture VL - 13951 ER - TY - JOUR AB - Understanding complex living systems, which are fundamentally constrained by physical phenomena, requires combining experimental data with theoretical physical and mathematical models. To develop such models, collaborations between experimental cell biologists and theoreticians are increasingly important but these two groups often face challenges achieving mutual understanding. To help navigate these challenges, this Perspective discusses different modelling approaches, including bottom-up hypothesis-driven and top-down data-driven models, and highlights their strengths and applications. Using cell mechanics as an example, we explore the integration of specific physical models with experimental data from the molecular, cellular and tissue level up to multiscale input. We also emphasize the importance of constraining model complexity and outline strategies for crosstalk between experimental design and model development. Furthermore, we highlight how physical models can provide conceptual insights and produce unifying and generalizable frameworks for biological phenomena. Overall, this Perspective aims to promote fruitful collaborations that advance our understanding of complex biological systems. AU - Schwayer, Cornelia AU - Brückner, David ID - 14827 IS - 24 JF - Journal of Cell Science KW - Cell Biology SN - 0021-9533 TI - Connecting theory and experiment in cell and tissue mechanics VL - 136 ER - TY - CONF AB - We study the problem of learning controllers for discrete-time non-linear stochastic dynamical systems with formal reach-avoid guarantees. This work presents the first method for providing formal reach-avoid guarantees, which combine and generalize stability and safety guarantees, with a tolerable probability threshold p in [0,1] over the infinite time horizon. Our method leverages advances in machine learning literature and it represents formal certificates as neural networks. In particular, we learn a certificate in the form of a reach-avoid supermartingale (RASM), a novel notion that we introduce in this work. Our RASMs provide reachability and avoidance guarantees by imposing constraints on what can be viewed as a stochastic extension of level sets of Lyapunov functions for deterministic systems. Our approach solves several important problems -- it can be used to learn a control policy from scratch, to verify a reach-avoid specification for a fixed control policy, or to fine-tune a pre-trained policy if it does not satisfy the reach-avoid specification. We validate our approach on 3 stochastic non-linear reinforcement learning tasks. AU - Zikelic, Dorde AU - Lechner, Mathias AU - Henzinger, Thomas A AU - Chatterjee, Krishnendu ID - 14830 IS - 10 KW - General Medicine SN - 2159-5399 T2 - Proceedings of the 37th AAAI Conference on Artificial Intelligence TI - Learning control policies for stochastic systems with reach-avoid guarantees VL - 37 ER - TY - JOUR AB - Understanding the factors that have shaped the current distributions and diversity of species is a central and longstanding aim of evolutionary biology. The recent inclusion of genomic data into phylogeographic studies has dramatically improved our understanding in organisms where evolutionary relationships have been challenging to infer. We used whole-genome sequences to study the phylogeography of the intertidal snail Littorina saxatilis, which has successfully colonized and diversified across a broad range of coastal environments in the Northern Hemisphere amid repeated cycles of glaciation. Building on past studies based on short DNA sequences, we used genome-wide data to provide a clearer picture of the relationships among samples spanning most of the species natural range. Our results confirm the trans-Atlantic colonization of North America from Europe, and have allowed us to identify rough locations of glacial refugia and to infer likely routes of colonization within Europe. We also investigated the signals in different datasets to account for the effects of genomic architecture and non-neutral evolution, which provides new insights about diversification of four ecotypes of L. saxatilis (the crab, wave, barnacle, and brackish ecotypes) at different spatial scales. Overall, we provide a much clearer picture of the biogeography of L. saxatilis, providing a foundation for more detailed phylogenomic and demographic studies. AU - Stankowski, Sean AU - Zagrodzka, Zuzanna B AU - Galindo, Juan AU - Montaño-Rendón, Mauricio AU - Faria, Rui AU - Mikhailova, Natalia AU - Blakeslee, April M H AU - Arnason, Einar AU - Broquet, Thomas AU - Morales, Hernán E AU - Grahame, John W AU - Westram, Anja M AU - Johannesson, Kerstin AU - Butlin, Roger K ID - 14833 IS - 1 JF - Evolutionary Journal of the Linnean Society TI - Whole-genome phylogeography of the intertidal snail Littorina saxatilis VL - 2 ER - TY - JOUR AB - Catalysis, the acceleration of product formation by a substance that is left unchanged, typically results from multiple elementary processes, including diffusion of the reactants toward the catalyst, chemical steps, and release of the products. While efforts to design catalysts are often focused on accelerating the chemical reaction on the catalyst, catalysis is a global property of the catalytic cycle that involves all processes. These are controlled by both intrinsic parameters such as the composition and shape of the catalyst and extrinsic parameters such as the concentration of the chemical species at play. We examine here the conditions that catalysis imposes on the different steps of a reaction cycle and the respective role of intrinsic and extrinsic parameters of the system on the emergence of catalysis by using an approach based on first-passage times. We illustrate this approach for various decompositions of a catalytic cycle into elementary steps, including non-Markovian decompositions, which are useful when the presence and nature of intermediate states are a priori unknown. Our examples cover different types of reactions and clarify the constraints on elementary steps and the impact of species concentrations on catalysis. AU - Sakref, Yann AU - Muñoz Basagoiti, Maitane AU - Zeravcic, Zorana AU - Rivoire, Olivier ID - 14831 IS - 51 JF - The Journal of Physical Chemistry B KW - Materials Chemistry KW - Surfaces KW - Coatings and Films KW - Physical and Theoretical Chemistry SN - 1520-6106 TI - On kinetic constraints that catalysis imposes on elementary processes VL - 127 ER - TY - JOUR AB - Many cell functions require a concerted effort from multiple membrane proteins, for example, for signaling, cell division, and endocytosis. One contribution to their successful self-organization stems from the membrane deformations that these proteins induce. While the pairwise interaction potential of two membrane-deforming spheres has recently been measured, membrane-deformation-induced interactions have been predicted to be nonadditive, and hence their collective behavior cannot be deduced from this measurement. We here employ a colloidal model system consisting of adhesive spheres and giant unilamellar vesicles to test these predictions by measuring the interaction potential of the simplest case of three membrane-deforming, spherical particles. We quantify their interactions and arrangements and, for the first time, experimentally confirm and quantify the nonadditive nature of membrane-deformation-induced interactions. We furthermore conclude that there exist two favorable configurations on the membrane: (1) a linear and (2) a triangular arrangement of the three spheres. Using Monte Carlo simulations, we corroborate the experimentally observed energy minima and identify a lowering of the membrane deformation as the cause for the observed configurations. The high symmetry of the preferred arrangements for three particles suggests that arrangements of many membrane-deforming objects might follow simple rules. AU - Azadbakht, Ali AU - Meadowcroft, Billie AU - Majek, Juraj AU - Šarić, Anđela AU - Kraft, Daniela J. ID - 14844 JF - Biophysical Journal SN - 0006-3495 TI - Nonadditivity in interactions between three membrane-wrapped colloidal spheres ER - TY - GEN AB - Cover Page AU - Becker, Lea Marie AU - Berbon, Mélanie AU - Vallet, Alicia AU - Grelard, Axelle AU - Morvan, Estelle AU - Bardiaux, Benjamin AU - Lichtenecker, Roman AU - Ernst, Matthias AU - Loquet, Antoine AU - Schanda, Paul ID - 14861 IS - 19 KW - General Chemistry KW - Catalysis SN - 1433-7851 T2 - Angewandte Chemie International Edition TI - Cover Picture: The rigid core and flexible surface of amyloid fibrils probed by Magic‐Angle‐Spinning NMR spectroscopy of aromatic residues VL - 62 ER - TY - JOUR AB - We establish a precise three-term asymptotic expansion, with an optimal estimate of the error term, for the rightmost eigenvalue of an n×n random matrix with independent identically distributed complex entries as n tends to infinity. All terms in the expansion are universal. AU - Cipolloni, Giorgio AU - Erdös, László AU - Schröder, Dominik J AU - Xu, Yuanyuan ID - 14849 IS - 6 JF - The Annals of Probability KW - Statistics KW - Probability and Uncertainty KW - Statistics and Probability SN - 0091-1798 TI - On the rightmost eigenvalue of non-Hermitian random matrices VL - 51 ER - TY - JOUR AB - Aromatische Seitenketten sind wichtige Indikatoren für die Plastizität von Proteinen und bilden oft entscheidende Kontakte bei Protein‐Protein‐Wechselwirkungen. Wir untersuchten aromatische Reste in den beiden strukturell homologen cross‐β Amyloidfibrillen HET‐s und HELLF mit Hilfe eines spezifischen Ansatzes zur Isotopenmarkierung und Festkörper NMR mit Drehung am magischen Winkel. Das dynamische Verhalten der aromatischen Reste Phe und Tyr deutet darauf hin, dass der hydrophobe Amyloidkern starr ist und keine Anzeichen von “atmenden Bewegungen” auf einer Zeitskala von Hunderten von Millisekunden zeigt. Aromatische Reste, die exponiert an der Fibrillenoberfläche sitzen, haben zwar eine starre Ringachse, weisen aber Ringflips auf verschiedenen Zeitskalen von Nanosekunden bis Mikrosekunden auf. Unser Ansatz bietet einen direkten Einblick in die Bewegungen des hydrophoben Kerns und ermöglicht eine bessere Bewertung der Konformationsheterogenität, die aus einem NMR‐Strukturensemble einer solchen Cross‐β‐Amyloidstruktur hervorgeht. AU - Becker, Lea Marie AU - Berbon, Mélanie AU - Vallet, Alicia AU - Grelard, Axelle AU - Morvan, Estelle AU - Bardiaux, Benjamin AU - Lichtenecker, Roman AU - Ernst, Matthias AU - Loquet, Antoine AU - Schanda, Paul ID - 14835 IS - 19 JF - Angewandte Chemie KW - General Medicine SN - 0044-8249 TI - Der starre Kern und die flexible Oberfläche von Amyloidfibrillen – Magic‐Angle‐Spinning NMR Spektroskopie von aromatischen Resten VL - 135 ER - TY - CHAP AB - Organization – or departure from a random pattern – in tropical deep convection is heavily studied due to its immediate relevance to climate sensitivity and extremes. Low-latitude convection has motivated numerical model idealizations, where the Coriolis force is removed and boundary conditions are simplified spatially and temporally. One of the most stunning aspects of such idealized simulated cloud organization is the spontaneous clumping of convection that can occur without any predetermining external perturbation, such as inhomogeneous surface boundary conditions or large-scale waves. Whereas individual convective rain cells measure only few kilometers in horizontal diameter, the clusters they form can often span hundreds or even thousands of kilometers. Hence, organization may emerge from the very small scales but can show effects at the synoptic scale. We refer to such emergent organization as convective self-organization. Convective self-organization thus features characteristics of emergence, such as non-trivial system-scale pattern formation or hysteresis. We summarize observational evidence for large-scale organization and briefly recap classical idealized modeling studies that yield convective self-aggregation – emergent organization under strongly idealized boundary conditions. We then focus on developing research, where temporal variation, such as the diurnal cycle, or two-way interactive surface properties yield distinct organizational modes. Convectively generated cold pools and mesoscale convective systems, both ubiquitous in nature, are thereby found to potentially play key roles in promoting – rather than suppressing – sustained system-scale organization. AU - Haerter, Jan O. AU - Muller, Caroline J ED - Sullivan, Sylvia ED - Hoose, Corinna ID - 14853 SN - 2328-8779 T2 - Clouds and Their Climatic Impacts TI - Mechanisms for the Self‐Organization of Tropical Deep Convection ER -