@article{11144, abstract = {Thermoelectric materials allow for direct conversion between heat and electricity, offering the potential for power generation. The average dimensionless figure of merit ZTave determines device efficiency. N-type tin selenide crystals exhibit outstanding three-dimensional charge and two-dimensional phonon transport along the out-of-plane direction, contributing to a high maximum figure of merit Zmax of ~3.6 × 10−3 per kelvin but a moderate ZTave of ~1.1. We found an attractive high Zmax of ~4.1 × 10−3 per kelvin at 748 kelvin and a ZTave of ~1.7 at 300 to 773 kelvin in chlorine-doped and lead-alloyed tin selenide crystals by phonon-electron decoupling. The chlorine-induced low deformation potential improved the carrier mobility. The lead-induced mass and strain fluctuations reduced the lattice thermal conductivity. Phonon-electron decoupling plays a critical role to achieve high-performance thermoelectrics.}, author = {Su, Lizhong and Wang, Dongyang and Wang, Sining and Qin, Bingchao and Wang, Yuping and Qin, Yongxin and Jin, Yang and Chang, Cheng and Zhao, Li Dong}, issn = {1095-9203}, journal = {Science}, number = {6587}, pages = {1385--1389}, publisher = {American Association for the Advancement of Science}, title = {{High thermoelectric performance realized through manipulating layered phonon-electron decoupling}}, doi = {10.1126/science.abn8997}, volume = {375}, year = {2022}, } @inproceedings{11145, abstract = {List-decodability of Reed-Solomon codes has re-ceived a lot of attention, but the best-possible dependence between the parameters is still not well-understood. In this work, we focus on the case where the list-decoding radius is of the form r=1−ε for ε tending to zero. Our main result states that there exist Reed-Solomon codes with rate Ω(ε) which are (1−ε,O(1/ε) -list-decodable, meaning that any Hamming ball of radius 1−ε contains at most O(1/ε) codewords. This trade-off between rate and list-decoding radius is best-possible for any code with list size less than exponential in the block length. By achieving this trade-off between rate and list-decoding radius we improve a recent result of Guo, Li, Shangguan, Tamo, and Wootters, and resolve the main motivating question of their work. Moreover, while their result requires the field to be exponentially large in the block length, we only need the field size to be polynomially large (and in fact, almost-linear suffices). We deduce our main result from a more general theorem, in which we prove good list-decodability properties of random puncturings of any given code with very large distance.}, author = {Ferber, Asaf and Kwan, Matthew Alan and Sauermann, Lisa}, booktitle = {62nd Annual IEEE Symposium on Foundations of Computer Science}, isbn = {9781665420556}, issn = {0272-5428}, location = {Denver, CO, United States}, pages = {720--726}, publisher = {IEEE}, title = {{List-decodability with large radius for Reed-Solomon codes}}, doi = {10.1109/FOCS52979.2021.00075}, volume = {2022}, year = {2022}, } @article{11155, abstract = {The potential of energy filtering and direct electron detection for cryo-electron microscopy (cryo-EM) has been well documented. Here, we assess the performance of recently introduced hardware for cryo-electron tomography (cryo-ET) and subtomogram averaging (STA), an increasingly popular structural determination method for complex 3D specimens. We acquired cryo-ET datasets of EIAV virus-like particles (VLPs) on two contemporary cryo-EM systems equipped with different energy filters and direct electron detectors (DED), specifically a Krios G4, equipped with a cold field emission gun (CFEG), Thermo Fisher Scientific Selectris X energy filter, and a Falcon 4 DED; and a Krios G3i, with a Schottky field emission gun (XFEG), a Gatan Bioquantum energy filter, and a K3 DED. We performed constrained cross-correlation-based STA on equally sized datasets acquired on the respective systems. The resulting EIAV CA hexamer reconstructions show that both systems perform comparably in the 4–6 Å resolution range based on Fourier-Shell correlation (FSC). In addition, by employing a recently introduced multiparticle refinement approach, we obtained a reconstruction of the EIAV CA hexamer at 2.9 Å. Our results demonstrate the potential of the new generation of energy filters and DEDs for STA, and the effects of using different processing pipelines on their STA outcomes.}, author = {Obr, Martin and Hagen, Wim J.H. and Dick, Robert A. and Yu, Lingbo and Kotecha, Abhay and Schur, Florian KM}, issn = {1047-8477}, journal = {Journal of Structural Biology}, keywords = {Structural Biology}, number = {2}, publisher = {Elsevier}, title = {{Exploring high-resolution cryo-ET and subtomogram averaging capabilities of contemporary DEDs}}, doi = {10.1016/j.jsb.2022.107852}, volume = {214}, year = {2022}, } @article{11160, abstract = {Mutations in the chromodomain helicase DNA-binding 8 (CHD8) gene are a frequent cause of autism spectrum disorder (ASD). While its phenotypic spectrum often encompasses macrocephaly, implicating cortical abnormalities, how CHD8 haploinsufficiency affects neurodevelopmental is unclear. Here, employing human cerebral organoids, we find that CHD8 haploinsufficiency disrupted neurodevelopmental trajectories with an accelerated and delayed generation of, respectively, inhibitory and excitatory neurons that yields, at days 60 and 120, symmetrically opposite expansions in their proportions. This imbalance is consistent with an enlargement of cerebral organoids as an in vitro correlate of patients’ macrocephaly. Through an isogenic design of patient-specific mutations and mosaic organoids, we define genotype-phenotype relationships and uncover their cell-autonomous nature. Our results define cell-type-specific CHD8-dependent molecular defects related to an abnormal program of proliferation and alternative splicing. By identifying cell-type-specific effects of CHD8 mutations, our study uncovers reproducible developmental alterations that may be employed for neurodevelopmental disease modeling.}, author = {Villa, Carlo Emanuele and Cheroni, Cristina and Dotter, Christoph and López-Tóbon, Alejandro and Oliveira, Bárbara and Sacco, Roberto and Yahya, Aysan Çerağ and Morandell, Jasmin and Gabriele, Michele and Tavakoli, Mojtaba and Lyudchik, Julia and Sommer, Christoph M and Gabitto, Mariano and Danzl, Johann G and Testa, Giuseppe and Novarino, Gaia}, issn = {2211-1247}, journal = {Cell Reports}, keywords = {General Biochemistry, Genetics and Molecular Biology}, number = {1}, publisher = {Elsevier}, title = {{CHD8 haploinsufficiency links autism to transient alterations in excitatory and inhibitory trajectories}}, doi = {10.1016/j.celrep.2022.110615}, volume = {39}, year = {2022}, } @article{11167, abstract = {Complex I is one of the major respiratory complexes, conserved from bacteria to mammals. It oxidises NADH, reduces quinone and pumps protons across the membrane, thus playing a central role in the oxidative energy metabolism. In this review we discuss our current state of understanding the structure of complex I from various species of mammals, plants, fungi, and bacteria, as well as of several complex I-related proteins. By comparing the structural evidence from these systems in different redox states and data from mutagenesis and molecular simulations, we formulate the mechanisms of electron transfer and proton pumping and explain how they are conformationally and electrostatically coupled. Finally, we discuss the structural basis of the deactivation phenomenon in mammalian complex I.}, author = {Kampjut, Domen and Sazanov, Leonid A}, issn = {0959-440X}, journal = {Current Opinion in Structural Biology}, keywords = {Molecular Biology, Structural Biology}, publisher = {Elsevier}, title = {{Structure of respiratory complex I – An emerging blueprint for the mechanism}}, doi = {10.1016/j.sbi.2022.102350}, volume = {74}, year = {2022}, } @article{11179, abstract = {Large oligomeric enzymes control a myriad of cellular processes, from protein synthesis and degradation to metabolism. The 0.5 MDa large TET2 aminopeptidase, a prototypical protease important for cellular homeostasis, degrades peptides within a ca. 60 Å wide tetrahedral chamber with four lateral openings. The mechanisms of substrate trafficking and processing remain debated. Here, we integrate magic-angle spinning (MAS) NMR, mutagenesis, co-evolution analysis and molecular dynamics simulations and reveal that a loop in the catalytic chamber is a key element for enzymatic function. The loop is able to stabilize ligands in the active site and may additionally have a direct role in activating the catalytic water molecule whereby a conserved histidine plays a key role. Our data provide a strong case for the functional importance of highly dynamic - and often overlooked - parts of an enzyme, and the potential of MAS NMR to investigate their dynamics at atomic resolution.}, author = {Gauto, Diego F. and Macek, Pavel and Malinverni, Duccio and Fraga, Hugo and Paloni, Matteo and Sučec, Iva and Hessel, Audrey and Bustamante, Juan Pablo and Barducci, Alessandro and Schanda, Paul}, issn = {2041-1723}, journal = {Nature Communications}, publisher = {Springer Nature}, title = {{Functional control of a 0.5 MDa TET aminopeptidase by a flexible loop revealed by MAS NMR}}, doi = {10.1038/s41467-022-29423-0}, volume = {13}, year = {2022}, } @inproceedings{11180, abstract = {Designing and implementing efficient parallel priority schedulers is an active research area. An intriguing proposed design is the Multi-Queue: given n threads and m ≥ n distinct priority queues, task insertions are performed uniformly at random, while, to delete, a thread picks two queues uniformly at random, and removes the observed task of higher priority. This approach scales well, and has probabilistic rank guarantees: roughly, the rank of each task removed, relative to remaining tasks in all other queues, is O (m) in expectation. Yet, the performance of this pattern is below that of well-engineered schedulers, which eschew theoretical guarantees for practical efficiency. We investigate whether it is possible to design and implement a Multi-Queue-based task scheduler that is both highly-efficient and has analytical guarantees. We propose a new variant called the Stealing Multi-Queue (SMQ), a cache-efficient variant of the Multi-Queue, which leverages both queue affinity---each thread has a local queue, from which tasks are usually removed; but, with some probability, threads also attempt to steal higher-priority tasks from the other queues---and task batching, that is, the processing of several tasks in a single insert / remove step. These ideas are well-known for task scheduling without priorities; our theoretical contribution is showing that, despite relaxations, this design can still provide rank guarantees, which in turn implies bounds on total work performed. We provide a general SMQ implementation which can surpass state-of-the-art schedulers such as OBIM and PMOD in terms of performance on popular graph-processing benchmarks. Notably, the performance improvement comes mainly from the superior rank guarantees provided by our scheduler, confirming that analytically-reasoned approaches can still provide performance improvements for priority task scheduling.}, author = {Postnikova, Anastasiia and Koval, Nikita and Nadiradze, Giorgi and Alistarh, Dan-Adrian}, booktitle = {Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming}, isbn = {9781450392044}, location = {Seoul, Republic of Korea}, pages = {353--367}, publisher = {Association for Computing Machinery}, title = {{Multi-queues can be state-of-the-art priority schedulers}}, doi = {10.1145/3503221.3508432}, year = {2022}, } @inproceedings{11181, abstract = {To maximize the performance of concurrent data structures, researchers have often turned to highly complex fine-grained techniques, resulting in efficient and elegant algorithms, which can however be often difficult to understand and prove correct. While simpler techniques exist, such as transactional memory, they can have limited performance or portability relative to their fine-grained counterparts. Approaches at both ends of this complexity-performance spectrum have been extensively explored, but relatively less is known about the middle ground: approaches that are willing to sacrifice some performance for simplicity, while remaining competitive with state-of-the-art handcrafted designs. In this paper, we explore this middle ground, and present PathCAS, a primitive that combines ideas from multi-word CAS (KCAS) and transactional memory approaches, while carefully avoiding overhead. We show how PathCAS can be used to implement efficient search data structures relatively simply, using an internal binary search tree as an example, then extending this to an AVL tree. Our best implementations outperform many handcrafted search trees: in search-heavy workloads, it rivals the BCCO tree [5], the fastest known concurrent binary tree in terms of search performance [3]. Our results suggest that PathCAS can yield concurrent data structures that are relatively easy to build and prove correct, while offering surprisingly high performance.}, author = {Brown, Trevor A and Sigouin, William and Alistarh, Dan-Adrian}, booktitle = {Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming}, isbn = {9781450392044}, location = {Seoul, Republic of Korea}, pages = {385--399}, publisher = {Association for Computing Machinery}, title = {{PathCAS: An efficient middle ground for concurrent search data structures}}, doi = {10.1145/3503221.3508410}, year = {2022}, } @article{11182, abstract = {Immune cells are constantly on the move through multicellular organisms to explore and respond to pathogens and other harmful insults. While moving, immune cells efficiently traverse microenvironments composed of tissue cells and extracellular fibers, which together form complex environments of various porosity, stiffness, topography, and chemical composition. In this protocol we describe experimental procedures to investigate immune cell migration through microenvironments of heterogeneous porosity. In particular, we describe micro-channels, micro-pillars, and collagen networks as cell migration paths with alternative pore size choices. Employing micro-channels or micro-pillars that divide at junctions into alternative paths with initially differentially sized pores allows us to precisely (1) measure the cellular translocation time through these porous path junctions, (2) quantify the cellular preference for individual pore sizes, and (3) image cellular components like the nucleus and the cytoskeleton. This reductionistic experimental setup thus can elucidate how immune cells perform decisions in complex microenvironments of various porosity like the interstitium. The setup further allows investigation of the underlying forces of cellular squeezing and the consequences of cellular deformation on the integrity of the cell and its organelles. As a complementary approach that does not require any micro-engineering expertise, we describe the usage of three-dimensional collagen networks with different pore sizes. Whereas we here focus on dendritic cells as a model for motile immune cells, the described protocols are versatile as they are also applicable for other immune cell types like neutrophils and non-immune cell types such as mesenchymal and cancer cells. In summary, we here describe protocols to identify the mechanisms and principles of cellular probing, decision making, and squeezing during cellular movement through microenvironments of heterogeneous porosity.}, author = {Kroll, Janina and Ruiz-Fernandez, Mauricio J.A. and Braun, Malte B. and Merrin, Jack and Renkawitz, Jörg}, issn = {2691-1299}, journal = {Current Protocols}, number = {4}, publisher = {Wiley}, title = {{Quantifying the probing and selection of microenvironmental pores by motile immune cells}}, doi = {10.1002/cpz1.407}, volume = {2}, year = {2022}, } @inproceedings{11183, abstract = {Subgraph detection has recently been one of the most studied problems in the CONGEST model of distributed computing. In this work, we study the distributed complexity of problems closely related to subgraph detection, mainly focusing on induced subgraph detection. The main line of this work presents lower bounds and parameterized algorithms w.r.t structural parameters of the input graph: - On general graphs, we give unconditional lower bounds for induced detection of cycles and patterns of treewidth 2 in CONGEST. Moreover, by adapting reductions from centralized parameterized complexity, we prove lower bounds in CONGEST for detecting patterns with a 4-clique, and for induced path detection conditional on the hardness of triangle detection in the congested clique. - On graphs of bounded degeneracy, we show that induced paths can be detected fast in CONGEST using techniques from parameterized algorithms, while detecting cycles and patterns of treewidth 2 is hard. - On graphs of bounded vertex cover number, we show that induced subgraph detection is easy in CONGEST for any pattern graph. More specifically, we adapt a centralized parameterized algorithm for a more general maximum common induced subgraph detection problem to the distributed setting. In addition to these induced subgraph detection results, we study various related problems in the CONGEST and congested clique models, including for multicolored versions of subgraph-detection-like problems.}, author = {Nikabadi, Amir and Korhonen, Janne}, booktitle = {25th International Conference on Principles of Distributed Systems}, editor = {Bramas, Quentin and Gramoli, Vincent and Milani, Alessia}, isbn = {9783959772198}, issn = {1868-8969}, location = {Strasbourg, France}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters}}, doi = {10.4230/LIPIcs.OPODIS.2021.15}, volume = {217}, year = {2022}, } @inproceedings{11184, abstract = {Let G be a graph on n nodes. In the stochastic population protocol model, a collection of n indistinguishable, resource-limited nodes collectively solve tasks via pairwise interactions. In each interaction, two randomly chosen neighbors first read each other’s states, and then update their local states. A rich line of research has established tight upper and lower bounds on the complexity of fundamental tasks, such as majority and leader election, in this model, when G is a clique. Specifically, in the clique, these tasks can be solved fast, i.e., in n polylog n pairwise interactions, with high probability, using at most polylog n states per node. In this work, we consider the more general setting where G is an arbitrary regular graph, and present a technique for simulating protocols designed for fully-connected networks in any connected regular graph. Our main result is a simulation that is efficient on many interesting graph families: roughly, the simulation overhead is polylogarithmic in the number of nodes, and quadratic in the conductance of the graph. As a sample application, we show that, in any regular graph with conductance φ, both leader election and exact majority can be solved in φ^{-2} ⋅ n polylog n pairwise interactions, with high probability, using at most φ^{-2} ⋅ polylog n states per node. This shows that there are fast and space-efficient population protocols for leader election and exact majority on graphs with good expansion properties. We believe our results will prove generally useful, as they allow efficient technology transfer between the well-mixed (clique) case, and the under-explored spatial setting.}, author = {Alistarh, Dan-Adrian and Gelashvili, Rati and Rybicki, Joel}, booktitle = {25th International Conference on Principles of Distributed Systems}, editor = {Bramas, Quentin and Gramoli, Vincent and Milani, Alessia}, isbn = {9783959772198}, issn = {1868-8969}, location = {Strasbourg, France}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Fast graphical population protocols}}, doi = {10.4230/LIPIcs.OPODIS.2021.14}, volume = {217}, year = {2022}, } @inproceedings{11185, abstract = {Bundling crossings is a strategy which can enhance the readability of graph drawings. In this paper we consider bundlings for families of pseudosegments, i.e., simple curves such that any two have share at most one point at which they cross. Our main result is that there is a polynomial-time algorithm to compute an 8-approximation of the bundled crossing number of such instances (up to adding a term depending on the facial structure). This 8-approximation also holds for bundlings of good drawings of graphs. In the special case of circular drawings the approximation factor is 8 (no extra term), this improves upon the 10-approximation of Fink et al. [6]. We also show how to compute a 92-approximation when the intersection graph of the pseudosegments is bipartite.}, author = {Arroyo Guevara, Alan M and Felsner, Stefan}, booktitle = {WALCOM 2022: Algorithms and Computation}, isbn = {9783030967307}, issn = {1611-3349}, location = {Jember, Indonesia}, pages = {383--395}, publisher = {Springer Nature}, title = {{Approximating the bundled crossing number}}, doi = {10.1007/978-3-030-96731-4_31}, volume = {13174}, year = {2022}, } @article{11186, abstract = {In this note, we study large deviations of the number 𝐍 of intercalates ( 2×2 combinatorial subsquares which are themselves Latin squares) in a random 𝑛×𝑛 Latin square. In particular, for constant 𝛿>0 we prove that exp(−𝑂(𝑛2log𝑛))⩽Pr(𝐍⩽(1−𝛿)𝑛2/4)⩽exp(−Ω(𝑛2)) and exp(−𝑂(𝑛4/3(log𝑛)))⩽Pr(𝐍⩾(1+𝛿)𝑛2/4)⩽exp(−Ω(𝑛4/3(log𝑛)2/3)) . As a consequence, we deduce that a typical order- 𝑛 Latin square has (1+𝑜(1))𝑛2/4 intercalates, matching a lower bound due to Kwan and Sudakov and resolving an old conjecture of McKay and Wanless.}, author = {Kwan, Matthew Alan and Sah, Ashwin and Sawhney, Mehtaab}, issn = {1469-2120}, journal = {Bulletin of the London Mathematical Society}, number = {4}, pages = {1420--1438}, publisher = {Wiley}, title = {{Large deviations in random latin squares}}, doi = {10.1112/blms.12638}, volume = {54}, year = {2022}, } @article{11187, abstract = {During the COVID-19 pandemic, genomics and bioinformatics have emerged as essential public health tools. The genomic data acquired using these methods have supported the global health response, facilitated the development of testing methods and allowed the timely tracking of novel SARS-CoV-2 variants. Yet the virtually unlimited potential for rapid generation and analysis of genomic data is also coupled with unique technical, scientific and organizational challenges. Here, we discuss the application of genomic and computational methods for efficient data-driven COVID-19 response, the advantages of the democratization of viral sequencing around the world and the challenges associated with viral genome data collection and processing.}, author = {Knyazev, Sergey and Chhugani, Karishma and Sarwal, Varuni and Ayyala, Ram and Singh, Harman and Karthikeyan, Smruthi and Deshpande, Dhrithi and Baykal, Pelin Icer and Comarova, Zoia and Lu, Angela and Porozov, Yuri and Vasylyeva, Tetyana I. and Wertheim, Joel O. and Tierney, Braden T. and Chiu, Charles Y. and Sun, Ren and Wu, Aiping and Abedalthagafi, Malak S. and Pak, Victoria M. and Nagaraj, Shivashankar H. and Smith, Adam L. and Skums, Pavel and Pasaniuc, Bogdan and Komissarov, Andrey and Mason, Christopher E. and Bortz, Eric and Lemey, Philippe and Kondrashov, Fyodor and Beerenwinkel, Niko and Lam, Tommy Tsan Yuk and Wu, Nicholas C. and Zelikovsky, Alex and Knight, Rob and Crandall, Keith A. and Mangul, Serghei}, issn = {1548-7105}, journal = {Nature Methods}, number = {4}, pages = {374--380}, publisher = {Springer Nature}, title = {{Unlocking capacities of genomics for the COVID-19 response and future pandemics}}, doi = {10.1038/s41592-022-01444-z}, volume = {19}, year = {2022}, } @phdthesis{11193, abstract = {The infiltration of immune cells into tissues underlies the establishment of tissue-resident macrophages and responses to infections and tumors. However, the mechanisms immune cells utilize to collectively migrate through tissue barriers in vivo are not yet well understood. In this thesis, I describe two mechanisms that Drosophila immune cells (hemocytes) use to overcome the tissue barrier of the germband in the embryo. One strategy is the strengthening of the actin cortex through developmentally controlled transcriptional regulation induced by the Drosophila proto-oncogene family member Dfos, which I show in Chapter 2. Dfos induces expression of the tetraspanin TM4SF and the filamin Cher leading to higher levels of the activated formin Dia at the cortex and increased cortical F-actin. This enhanced cortical strength allows hemocytes to overcome the physical resistance of the surrounding tissue and translocate their nucleus to move forward. This mechanism affects the speed of migration when hemocytes face a confined environment in vivo. Another aspect of the invasion process is the initial step of the leading hemocytes entering the tissue, which potentially guides the follower cells. In Chapter 3, I describe a novel subpopulation of hemocytes activated by BMP signaling prior to tissue invasion that leads penetration into the germband. Hemocytes that are deficient in BMP signaling activation show impaired persistence at the tissue entry, while their migration speed remains unaffected. This suggests that there might be different mechanisms controlling immune cell migration within the confined environment in vivo, one of these being the general ability to overcome the resistance of the surrounding tissue and another affecting the order of hemocytes that collectively invade the tissue in a stream of individual cells. Together, my findings provide deeper insights into transcriptional changes in immune cells that enable efficient tissue invasion and pave the way for future studies investigating the early colonization of tissues by macrophages in higher organisms. Moreover, they extend the current view of Drosophila immune cell heterogeneity and point toward a potentially conserved role for canonical BMP signaling in specifying immune cells that lead the migration of tissue resident macrophages during embryogenesis.}, author = {Wachner, Stephanie}, issn = {2663-337X}, pages = {170}, publisher = {Institute of Science and Technology Austria}, title = {{Transcriptional regulation by Dfos and BMP-signaling support tissue invasion of Drosophila immune cells}}, doi = {10.15479/at:ista:11193}, year = {2022}, } @phdthesis{11196, abstract = {One of the fundamental questions in Neuroscience is how the structure of synapses and their physiological properties are related. While synaptic transmission remains a dynamic process, electron microscopy provides images with comparably low temporal resolution (Studer et al., 2014). The current work overcomes this challenge and describes an improved “Flash and Freeze” technique (Watanabe et al., 2013a; Watanabe et al., 2013b) to study synaptic transmission at the hippocampal mossy fiber-CA3 pyramidal neuron synapses, using mouse acute brain slices and organotypic slices culture. The improved method allowed for selective stimulation of presynaptic mossy fiber boutons and the observation of synaptic vesicle pool dynamics at the active zones. Our results uncovered several intriguing morphological features of mossy fiber boutons. First, the docked vesicle pool was largely depleted (more than 70%) after stimulation, implying that the docked synaptic vesicles pool and readily releasable pool are vastly overlapping in mossy fiber boutons. Second, the synaptic vesicles are skewed towards larger diameters, displaying a wide range of sizes. An increase in the mean diameter of synaptic vesicles, after single and repetitive stimulation, suggests that smaller vesicles have a higher release probability. Third, we observed putative endocytotic structures after moderate light stimulation, matching the timing of previously described ultrafast endocytosis (Watanabe et al., 2013a; Delvendahl et al., 2016). In addition, synaptic transmission depends on a sophisticated system of protein machinery and calcium channels (Südhof, 2013b), which amplifies the challenge in studying synaptic communication as these interactions can be potentially modified during synaptic plasticity. And although recent study elucidated the potential correlation between physiological and morphological properties of synapses during synaptic plasticity (Vandael et al., 2020), the molecular underpinning of it remains unknown. Thus, the presented work tries to overcome this challenge and aims to pinpoint changes in the molecular architecture at hippocampal mossy fiber bouton synapses during short- and long-term potentiation (STP and LTP), we combined chemical potentiation, with the application of a cyclic adenosine monophosphate agonist (i.e. forskolin) and freeze-fracture replica immunolabelling. This method allowed the localization of membrane-bound proteins with nanometer precision within the active zone, in particular, P/Q-type calcium channels and synaptic vesicle priming proteins Munc13-1/2. First, we found that the number of clusters of Munc13-1 in the mossy fiber bouton active zone increased significantly during STP, but decreased to lower than the control value during LTP. Secondly, although the distance between the calcium channels and Munc13-1s did not change after induction of STP, it shortened during the LTP phase. Additionally, forskolin did not affect Munc13-2 distribution during STP and LTP. These results indicate the existence of two distinct mechanisms that govern STP and LTP at mossy fiber bouton synapses: an increase in the readily realizable pool in the case of STP and a potential increase in release probability during LTP. “Flash and freeze” and functional electron microscopy, are versatile methods that can be successfully applied to intact brain circuits to study synaptic transmission even at the molecular level. }, author = {Kim, Olena}, issn = {2663-337X}, pages = {132}, publisher = {Institute of Science and Technology Austria}, title = {{Nanoarchitecture of hippocampal mossy fiber-CA3 pyramidal neuron synapses}}, doi = {10.15479/at:ista:11196}, year = {2022}, } @misc{11321, abstract = {Here are the research data underlying the publication "Effects of fine-scale population structure on the distribution of heterozygosity in a long-term study of Antirrhinum majus" Further information are summed up in the README document. }, author = {Surendranadh, Parvathy and Arathoon, Louise S and Baskett, Carina and Field, David and Pickup, Melinda and Barton, Nicholas H}, publisher = {Institute of Science and Technology Austria}, title = {{Effects of fine-scale population structure on the distribution of heterozygosity in a long-term study of Antirrhinum majus}}, doi = {10.15479/at:ista:11321}, year = {2022}, } @article{11330, abstract = {In this article we study the noncommutative transport distance introduced by Carlen and Maas and its entropic regularization defined by Becker and Li. We prove a duality formula that can be understood as a quantum version of the dual Benamou–Brenier formulation of the Wasserstein distance in terms of subsolutions of a Hamilton–Jacobi–Bellmann equation.}, author = {Wirth, Melchior}, issn = {15729613}, journal = {Journal of Statistical Physics}, number = {2}, publisher = {Springer Nature}, title = {{A dual formula for the noncommutative transport distance}}, doi = {10.1007/s10955-022-02911-9}, volume = {187}, year = {2022}, } @inproceedings{11331, abstract = {We propose separating the task of reliable transaction dissemination from transaction ordering, to enable high-performance Byzantine fault-tolerant quorum-based consensus. We design and evaluate a mempool protocol, Narwhal, specializing in high-throughput reliable dissemination and storage of causal histories of transactions. Narwhal tolerates an asynchronous network and maintains high performance despite failures. Narwhal is designed to easily scale-out using multiple workers at each validator, and we demonstrate that there is no foreseeable limit to the throughput we can achieve. Composing Narwhal with a partially synchronous consensus protocol (Narwhal-HotStuff) yields significantly better throughput even in the presence of faults or intermittent loss of liveness due to asynchrony. However, loss of liveness can result in higher latency. To achieve overall good performance when faults occur we design Tusk, a zero-message overhead asynchronous consensus protocol, to work with Narwhal. We demonstrate its high performance under a variety of configurations and faults. As a summary of results, on a WAN, Narwhal-Hotstuff achieves over 130,000 tx/sec at less than 2-sec latency compared with 1,800 tx/sec at 1-sec latency for Hotstuff. Additional workers increase throughput linearly to 600,000 tx/sec without any latency increase. Tusk achieves 160,000 tx/sec with about 3 seconds latency. Under faults, both protocols maintain high throughput, but Narwhal-HotStuff suffers from increased latency.}, author = {Danezis, George and Kokoris Kogias, Eleftherios and Sonnino, Alberto and Spiegelman, Alexander}, booktitle = {Proceedings of the 17th European Conference on Computer Systems}, isbn = {9781450391627}, location = {Rennes, France}, pages = {34--50}, publisher = {Association for Computing Machinery}, title = {{Narwhal and Tusk: A DAG-based mempool and efficient BFT consensus}}, doi = {10.1145/3492321.3519594}, year = {2022}, } @article{11332, abstract = {We show that the fluctuations of the largest eigenvalue of a real symmetric or complex Hermitian Wigner matrix of size N converge to the Tracy–Widom laws at a rate O(N^{-1/3+\omega }), as N tends to infinity. For Wigner matrices this improves the previous rate O(N^{-2/9+\omega }) obtained by Bourgade (J Eur Math Soc, 2021) for generalized Wigner matrices. Our result follows from a Green function comparison theorem, originally introduced by Erdős et al. (Adv Math 229(3):1435–1515, 2012) to prove edge universality, on a finer spectral parameter scale with improved error estimates. The proof relies on the continuous Green function flow induced by a matrix-valued Ornstein–Uhlenbeck process. Precise estimates on leading contributions from the third and fourth order moments of the matrix entries are obtained using iterative cumulant expansions and recursive comparisons for correlation functions, along with uniform convergence estimates for correlation kernels of the Gaussian invariant ensembles.}, author = {Schnelli, Kevin and Xu, Yuanyuan}, issn = {1432-0916}, journal = {Communications in Mathematical Physics}, pages = {839--907}, publisher = {Springer Nature}, title = {{Convergence rate to the Tracy–Widom laws for the largest Eigenvalue of Wigner matrices}}, doi = {10.1007/s00220-022-04377-y}, volume = {393}, year = {2022}, }