[{"publication_identifier":{"issn":["2469-990X"]},"acknowledgement":"We thank G. Falkovich for discussion and Guy Han for technical support. We are grateful to N. Jha for his help in µPIV measurements. This work is partially supported by the grants from\r\nIsrael Science Foundation (ISF; grant #882/15 and grant #784/19) and Binational USA-Israel Foundation (BSF;grant #2016145). ","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We report frictional drag reduction and a complete flow relaminarization of elastic turbulence (ET) at vanishing inertia in a viscoelastic channel flow past an obstacle. We show that the intensity of the observed elastic waves and wall-normal vorticity correlate well with the measured drag above the onset of ET. Moreover, we find that the elastic wave frequency grows with the Weissenberg number, and at sufficiently high frequency it causes a decay of the elastic waves, resulting in ET attenuation and drag reduction. Thus, this allows us to substantiate a physical mechanism, involving the interaction of elastic waves with wall-normal vorticity fluctuations, leading to the drag reduction and relaminarization phenomena at low Reynolds number."}],"external_id":{"isi":["000836397000001"],"arxiv":["2205.12871"]},"department":[{"_id":"BjHo"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","language":[{"iso":"eng"}],"_id":"12279","publication_status":"published","oa_version":"Preprint","doi":"10.1103/physrevfluids.7.l081301","isi":1,"year":"2022","arxiv":1,"type":"journal_article","scopus_import":"1","oa":1,"author":[{"full_name":"Kumar, M. Vijay","first_name":"M. Vijay","last_name":"Kumar"},{"last_name":"Varshney","orcid":"0000-0002-3072-5999","first_name":"Atul","id":"2A2006B2-F248-11E8-B48F-1D18A9856A87","full_name":"Varshney, Atul"},{"full_name":"Li, Dongyang","first_name":"Dongyang","last_name":"Li"},{"full_name":"Steinberg, Victor","first_name":"Victor","last_name":"Steinberg"}],"title":"Relaminarization of elastic turbulence","article_number":"L081301","status":"public","keyword":["Fluid Flow and Transfer Processes","Modeling and Simulation","Computational Mechanics"],"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2205.12871","open_access":"1"}],"quality_controlled":"1","publisher":"American Physical Society","publication":"Physical Review Fluids","intvolume":"         7","issue":"8","date_created":"2023-01-16T10:02:40Z","date_published":"2022-08-03T00:00:00Z","month":"08","article_type":"original","volume":7,"citation":{"chicago":"Kumar, M. Vijay, Atul Varshney, Dongyang Li, and Victor Steinberg. “Relaminarization of Elastic Turbulence.” <i>Physical Review Fluids</i>. American Physical Society, 2022. <a href=\"https://doi.org/10.1103/physrevfluids.7.l081301\">https://doi.org/10.1103/physrevfluids.7.l081301</a>.","mla":"Kumar, M. Vijay, et al. “Relaminarization of Elastic Turbulence.” <i>Physical Review Fluids</i>, vol. 7, no. 8, L081301, American Physical Society, 2022, doi:<a href=\"https://doi.org/10.1103/physrevfluids.7.l081301\">10.1103/physrevfluids.7.l081301</a>.","ama":"Kumar MV, Varshney A, Li D, Steinberg V. Relaminarization of elastic turbulence. <i>Physical Review Fluids</i>. 2022;7(8). doi:<a href=\"https://doi.org/10.1103/physrevfluids.7.l081301\">10.1103/physrevfluids.7.l081301</a>","ista":"Kumar MV, Varshney A, Li D, Steinberg V. 2022. Relaminarization of elastic turbulence. Physical Review Fluids. 7(8), L081301.","ieee":"M. V. Kumar, A. Varshney, D. Li, and V. Steinberg, “Relaminarization of elastic turbulence,” <i>Physical Review Fluids</i>, vol. 7, no. 8. American Physical Society, 2022.","apa":"Kumar, M. V., Varshney, A., Li, D., &#38; Steinberg, V. (2022). Relaminarization of elastic turbulence. <i>Physical Review Fluids</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevfluids.7.l081301\">https://doi.org/10.1103/physrevfluids.7.l081301</a>","short":"M.V. Kumar, A. Varshney, D. Li, V. Steinberg, Physical Review Fluids 7 (2022)."},"day":"03","date_updated":"2023-08-04T10:26:40Z"},{"has_accepted_license":"1","article_type":"original","volume":18,"date_published":"2022-06-14T00:00:00Z","date_created":"2023-01-16T10:02:51Z","month":"06","citation":{"ieee":"L. Schmid, C. Hilbe, K. Chatterjee, and M. Nowak, “Direct reciprocity between individuals that use different strategy spaces,” <i>PLOS Computational Biology</i>, vol. 18, no. 6. Public Library of Science, 2022.","short":"L. Schmid, C. Hilbe, K. Chatterjee, M. Nowak, PLOS Computational Biology 18 (2022).","apa":"Schmid, L., Hilbe, C., Chatterjee, K., &#38; Nowak, M. (2022). Direct reciprocity between individuals that use different strategy spaces. <i>PLOS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1010149\">https://doi.org/10.1371/journal.pcbi.1010149</a>","mla":"Schmid, Laura, et al. “Direct Reciprocity between Individuals That Use Different Strategy Spaces.” <i>PLOS Computational Biology</i>, vol. 18, no. 6, e1010149, Public Library of Science, 2022, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1010149\">10.1371/journal.pcbi.1010149</a>.","ista":"Schmid L, Hilbe C, Chatterjee K, Nowak M. 2022. Direct reciprocity between individuals that use different strategy spaces. PLOS Computational Biology. 18(6), e1010149.","ama":"Schmid L, Hilbe C, Chatterjee K, Nowak M. Direct reciprocity between individuals that use different strategy spaces. <i>PLOS Computational Biology</i>. 2022;18(6). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1010149\">10.1371/journal.pcbi.1010149</a>","chicago":"Schmid, Laura, Christian Hilbe, Krishnendu Chatterjee, and Martin Nowak. “Direct Reciprocity between Individuals That Use Different Strategy Spaces.” <i>PLOS Computational Biology</i>. Public Library of Science, 2022. <a href=\"https://doi.org/10.1371/journal.pcbi.1010149\">https://doi.org/10.1371/journal.pcbi.1010149</a>."},"day":"14","file":[{"checksum":"31b6b311b6731f1658277a9dfff6632c","date_updated":"2023-01-30T11:28:13Z","success":1,"file_name":"2022_PlosCompBio_Schmid.pdf","content_type":"application/pdf","access_level":"open_access","file_size":3143222,"creator":"dernst","file_id":"12460","relation":"main_file","date_created":"2023-01-30T11:28:13Z"}],"date_updated":"2025-07-14T09:09:49Z","title":"Direct reciprocity between individuals that use different strategy spaces","article_number":"e1010149","status":"public","oa":1,"author":[{"last_name":"Schmid","orcid":"0000-0002-6978-7329","first_name":"Laura","full_name":"Schmid, Laura","id":"38B437DE-F248-11E8-B48F-1D18A9856A87"},{"id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","full_name":"Hilbe, Christian","first_name":"Christian","last_name":"Hilbe","orcid":"0000-0001-5116-955X"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"issue":"6","keyword":["Computational Theory and Mathematics","Cellular and Molecular Neuroscience","Genetics","Molecular Biology","Ecology","Modeling and Simulation","Ecology","Evolution","Behavior and Systematics"],"quality_controlled":"1","publisher":"Public Library of Science","publication":"PLOS Computational Biology","intvolume":"        18","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.1371/journal.pcbi.1010149","oa_version":"Published Version","pmid":1,"year":"2022","type":"journal_article","isi":1,"scopus_import":"1","abstract":[{"text":"In repeated interactions, players can use strategies that respond to the outcome of previous rounds. Much of the existing literature on direct reciprocity assumes that all competing individuals use the same strategy space. Here, we study both learning and evolutionary dynamics of players that differ in the strategy space they explore. We focus on the infinitely repeated donation game and compare three natural strategy spaces: memory-1 strategies, which consider the last moves of both players, reactive strategies, which respond to the last move of the co-player, and unconditional strategies. These three strategy spaces differ in the memory capacity that is needed. We compute the long term average payoff that is achieved in a pairwise learning process. We find that smaller strategy spaces can dominate larger ones. For weak selection, unconditional players dominate both reactive and memory-1 players. For intermediate selection, reactive players dominate memory-1 players. Only for strong selection and low cost-to-benefit ratio, memory-1 players dominate the others. We observe that the supergame between strategy spaces can be a social dilemma: maximum payoff is achieved if both players explore a larger strategy space, but smaller strategy spaces dominate.","lang":"eng"}],"ec_funded":1,"file_date_updated":"2023-01-30T11:28:13Z","publication_identifier":{"eissn":["1553-7358"]},"acknowledgement":"This work was supported by the European Research Council (https://erc.europa.eu/)\r\nCoG 863818 (ForM-SMArt) (to K.C.), and the European Research Council Starting Grant 850529: E-DIRECT (to C.H.). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.","article_processing_charge":"No","language":[{"iso":"eng"}],"_id":"12280","ddc":["000","570"],"publication_status":"published","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020"}],"external_id":{"isi":["000843626800031"],"pmid":["35700167"]},"department":[{"_id":"KrCh"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"},{"date_updated":"2023-08-04T10:27:35Z","day":"01","citation":{"ieee":"C. Franceschini, P. Gonçalves, and F. Sau, “Symmetric inclusion process with slow boundary: Hydrodynamics and hydrostatics,” <i>Bernoulli</i>, vol. 28, no. 2. Bernoulli Society for Mathematical Statistics and Probability, pp. 1340–1381, 2022.","short":"C. Franceschini, P. Gonçalves, F. Sau, Bernoulli 28 (2022) 1340–1381.","apa":"Franceschini, C., Gonçalves, P., &#38; Sau, F. (2022). Symmetric inclusion process with slow boundary: Hydrodynamics and hydrostatics. <i>Bernoulli</i>. Bernoulli Society for Mathematical Statistics and Probability. <a href=\"https://doi.org/10.3150/21-bej1390\">https://doi.org/10.3150/21-bej1390</a>","mla":"Franceschini, Chiara, et al. “Symmetric Inclusion Process with Slow Boundary: Hydrodynamics and Hydrostatics.” <i>Bernoulli</i>, vol. 28, no. 2, Bernoulli Society for Mathematical Statistics and Probability, 2022, pp. 1340–81, doi:<a href=\"https://doi.org/10.3150/21-bej1390\">10.3150/21-bej1390</a>.","ista":"Franceschini C, Gonçalves P, Sau F. 2022. Symmetric inclusion process with slow boundary: Hydrodynamics and hydrostatics. Bernoulli. 28(2), 1340–1381.","ama":"Franceschini C, Gonçalves P, Sau F. Symmetric inclusion process with slow boundary: Hydrodynamics and hydrostatics. <i>Bernoulli</i>. 2022;28(2):1340-1381. doi:<a href=\"https://doi.org/10.3150/21-bej1390\">10.3150/21-bej1390</a>","chicago":"Franceschini, Chiara, Patrícia Gonçalves, and Federico Sau. “Symmetric Inclusion Process with Slow Boundary: Hydrodynamics and Hydrostatics.” <i>Bernoulli</i>. Bernoulli Society for Mathematical Statistics and Probability, 2022. <a href=\"https://doi.org/10.3150/21-bej1390\">https://doi.org/10.3150/21-bej1390</a>."},"month":"05","date_created":"2023-01-16T10:03:04Z","date_published":"2022-05-01T00:00:00Z","article_type":"original","volume":28,"intvolume":"        28","publication":"Bernoulli","publisher":"Bernoulli Society for Mathematical Statistics and Probability","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2007.11998"}],"page":"1340-1381","keyword":["Statistics and Probability"],"issue":"2","author":[{"first_name":"Chiara","last_name":"Franceschini","full_name":"Franceschini, Chiara"},{"first_name":"Patrícia","last_name":"Gonçalves","full_name":"Gonçalves, Patrícia"},{"id":"E1836206-9F16-11E9-8814-AEFDE5697425","full_name":"Sau, Federico","first_name":"Federico","last_name":"Sau"}],"oa":1,"status":"public","title":"Symmetric inclusion process with slow boundary: Hydrodynamics and hydrostatics","scopus_import":"1","arxiv":1,"type":"journal_article","isi":1,"year":"2022","oa_version":"Preprint","doi":"10.3150/21-bej1390","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"JaMa"}],"external_id":{"arxiv":["2007.11998"],"isi":["000766619100025"]},"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"publication_status":"published","_id":"12281","language":[{"iso":"eng"}],"article_processing_charge":"No","acknowledgement":"C.F. and P.G. thank FCT/Portugal for support through the project UID/MAT/04459/2013.\r\nThis project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovative programme (grant agreement No. 715734). F.S. was founded by the European Union’s Horizon 2020 research and innovation programme under the Marie-Skłodowska-Curie grant agreement No. 754411.\r\nF.S. wishes to thank Joe P. Chen for some fruitful discussions at an early stage of this work. F.S. thanks CAMGSD, IST, Lisbon, where part of this work has been done, and the European research and innovative programme No. 715734 for the kind hospitality.","publication_identifier":{"issn":["1350-7265"]},"ec_funded":1,"abstract":[{"text":"We study the hydrodynamic and hydrostatic limits of the one-dimensional open symmetric inclusion process with slow boundary. Depending on the value of the parameter tuning the interaction rate of the bulk of the system with the boundary, we obtain a linear heat equation with either Dirichlet, Robin or Neumann boundary conditions as hydrodynamic equation. In our approach, we combine duality and first-second class particle techniques to reduce the scaling limit of the inclusion process to the limiting behavior of a single, non-interacting, particle.","lang":"eng"}]},{"language":[{"iso":"eng"}],"_id":"12282","publication_status":"published","external_id":{"isi":["000798123600015"],"pmid":["35438168"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"SiHi"},{"_id":"LeSa"}],"abstract":[{"lang":"eng","text":"From a simple thought to a multicellular movement"}],"publication_identifier":{"issn":["0021-9533"],"eissn":["1477-9137"]},"article_processing_charge":"No","acknowledgement":"The authors want to thank Professors Carrie Bernecky, Tom Henzinger, Martin Loose and Gaia Novarino for accepting to be interviewed, thus giving significant contribution to the discussion that lead to this article.","isi":1,"type":"journal_article","year":"2022","scopus_import":"1","doi":"10.1242/jcs.260017","oa_version":"None","pmid":1,"issue":"8","quality_controlled":"1","publisher":"The Company of Biologists","publication":"Journal of Cell Science","intvolume":"       135","title":"Operation STEM fatale – how an equity, diversity and inclusion initiative has brought us to reflect on the current challenges in cell biology and science as a whole","article_number":"260017","status":"public","author":[{"last_name":"Amberg","orcid":"0000-0002-3183-8207","first_name":"Nicole","full_name":"Amberg, Nicole","id":"4CD6AAC6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Melissa A","last_name":"Stouffer","id":"4C9372C4-F248-11E8-B48F-1D18A9856A87","full_name":"Stouffer, Melissa A"},{"first_name":"Irene","orcid":"0000-0001-5618-3449","last_name":"Vercellino","id":"3ED6AF16-F248-11E8-B48F-1D18A9856A87","full_name":"Vercellino, Irene"}],"citation":{"ieee":"N. Amberg, M. A. Stouffer, and I. Vercellino, “Operation STEM fatale – how an equity, diversity and inclusion initiative has brought us to reflect on the current challenges in cell biology and science as a whole,” <i>Journal of Cell Science</i>, vol. 135, no. 8. The Company of Biologists, 2022.","apa":"Amberg, N., Stouffer, M. A., &#38; Vercellino, I. (2022). Operation STEM fatale – how an equity, diversity and inclusion initiative has brought us to reflect on the current challenges in cell biology and science as a whole. <i>Journal of Cell Science</i>. The Company of Biologists. <a href=\"https://doi.org/10.1242/jcs.260017\">https://doi.org/10.1242/jcs.260017</a>","short":"N. Amberg, M.A. Stouffer, I. Vercellino, Journal of Cell Science 135 (2022).","chicago":"Amberg, Nicole, Melissa A Stouffer, and Irene Vercellino. “Operation STEM Fatale – How an Equity, Diversity and Inclusion Initiative Has Brought Us to Reflect on the Current Challenges in Cell Biology and Science as a Whole.” <i>Journal of Cell Science</i>. The Company of Biologists, 2022. <a href=\"https://doi.org/10.1242/jcs.260017\">https://doi.org/10.1242/jcs.260017</a>.","mla":"Amberg, Nicole, et al. “Operation STEM Fatale – How an Equity, Diversity and Inclusion Initiative Has Brought Us to Reflect on the Current Challenges in Cell Biology and Science as a Whole.” <i>Journal of Cell Science</i>, vol. 135, no. 8, 260017, The Company of Biologists, 2022, doi:<a href=\"https://doi.org/10.1242/jcs.260017\">10.1242/jcs.260017</a>.","ista":"Amberg N, Stouffer MA, Vercellino I. 2022. Operation STEM fatale – how an equity, diversity and inclusion initiative has brought us to reflect on the current challenges in cell biology and science as a whole. Journal of Cell Science. 135(8), 260017.","ama":"Amberg N, Stouffer MA, Vercellino I. Operation STEM fatale – how an equity, diversity and inclusion initiative has brought us to reflect on the current challenges in cell biology and science as a whole. <i>Journal of Cell Science</i>. 2022;135(8). doi:<a href=\"https://doi.org/10.1242/jcs.260017\">10.1242/jcs.260017</a>"},"day":"19","date_updated":"2023-08-04T10:28:04Z","volume":135,"article_type":"letter_note","date_published":"2022-04-19T00:00:00Z","date_created":"2023-01-16T10:03:14Z","month":"04"},{"issue":"7","publisher":"The Company of Biologists","keyword":["Cell Biology"],"quality_controlled":"1","intvolume":"       135","publication":"Journal of Cell Science","article_number":"259234","title":"Visualising the cytoskeletal machinery in neuronal growth cones using cryo-electron tomography","status":"public","oa":1,"author":[{"full_name":"Atherton, Joseph","last_name":"Atherton","first_name":"Joseph"},{"first_name":"Melissa A","last_name":"Stouffer","full_name":"Stouffer, Melissa A","id":"4C9372C4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Francis, Fiona","last_name":"Francis","first_name":"Fiona"},{"last_name":"Moores","first_name":"Carolyn A.","full_name":"Moores, Carolyn A."}],"file":[{"checksum":"4346ed32cb7c89a8ca051c7da68a9a1c","date_updated":"2023-01-30T11:41:01Z","success":1,"file_name":"2022_JourCellBiology_Atherton.pdf","content_type":"application/pdf","access_level":"open_access","file_size":13868733,"relation":"main_file","creator":"dernst","file_id":"12461","date_created":"2023-01-30T11:41:01Z"}],"day":"01","citation":{"chicago":"Atherton, Joseph, Melissa A Stouffer, Fiona Francis, and Carolyn A. Moores. “Visualising the Cytoskeletal Machinery in Neuronal Growth Cones Using Cryo-Electron Tomography.” <i>Journal of Cell Science</i>. The Company of Biologists, 2022. <a href=\"https://doi.org/10.1242/jcs.259234\">https://doi.org/10.1242/jcs.259234</a>.","mla":"Atherton, Joseph, et al. “Visualising the Cytoskeletal Machinery in Neuronal Growth Cones Using Cryo-Electron Tomography.” <i>Journal of Cell Science</i>, vol. 135, no. 7, 259234, The Company of Biologists, 2022, doi:<a href=\"https://doi.org/10.1242/jcs.259234\">10.1242/jcs.259234</a>.","ama":"Atherton J, Stouffer MA, Francis F, Moores CA. Visualising the cytoskeletal machinery in neuronal growth cones using cryo-electron tomography. <i>Journal of Cell Science</i>. 2022;135(7). doi:<a href=\"https://doi.org/10.1242/jcs.259234\">10.1242/jcs.259234</a>","ista":"Atherton J, Stouffer MA, Francis F, Moores CA. 2022. Visualising the cytoskeletal machinery in neuronal growth cones using cryo-electron tomography. Journal of Cell Science. 135(7), 259234.","ieee":"J. Atherton, M. A. Stouffer, F. Francis, and C. A. Moores, “Visualising the cytoskeletal machinery in neuronal growth cones using cryo-electron tomography,” <i>Journal of Cell Science</i>, vol. 135, no. 7. The Company of Biologists, 2022.","apa":"Atherton, J., Stouffer, M. A., Francis, F., &#38; Moores, C. A. (2022). Visualising the cytoskeletal machinery in neuronal growth cones using cryo-electron tomography. <i>Journal of Cell Science</i>. The Company of Biologists. <a href=\"https://doi.org/10.1242/jcs.259234\">https://doi.org/10.1242/jcs.259234</a>","short":"J. Atherton, M.A. Stouffer, F. Francis, C.A. Moores, Journal of Cell Science 135 (2022)."},"date_updated":"2023-08-04T10:28:34Z","has_accepted_license":"1","article_type":"original","volume":135,"date_created":"2023-01-16T10:03:24Z","date_published":"2022-04-01T00:00:00Z","month":"04","publication_status":"published","ddc":["570"],"language":[{"iso":"eng"}],"_id":"12283","external_id":{"pmid":["35383828"],"isi":["000783840400010"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"SiHi"}],"abstract":[{"text":"Neurons extend axons to form the complex circuitry of the mature brain. This depends on the coordinated response and continuous remodelling of the microtubule and F-actin networks in the axonal growth cone. Growth cone architecture remains poorly understood at nanoscales. We therefore investigated mouse hippocampal neuron growth cones using cryo-electron tomography to directly visualise their three-dimensional subcellular architecture with molecular detail. Our data showed that the hexagonal arrays of actin bundles that form filopodia penetrate and terminate deep within the growth cone interior. We directly observed the modulation of these and other growth cone actin bundles by alteration of individual F-actin helical structures. Microtubules with blunt, slightly flared or gently curved ends predominated in the growth cone, frequently contained lumenal particles and exhibited lattice defects. Investigation of the effect of absence of doublecortin, a neurodevelopmental cytoskeleton regulator, on growth cone cytoskeleton showed no major anomalies in overall growth cone organisation or in F-actin subpopulations. However, our data suggested that microtubules sustained more structural defects, highlighting the importance of microtubule integrity during growth cone migration.","lang":"eng"}],"publication_identifier":{"issn":["0021-9533"],"eissn":["1477-9137"]},"file_date_updated":"2023-01-30T11:41:01Z","acknowledgement":"J.A. was supported by a grant from the Medical Research Council (MRC), UK (MR/R000352/1) to C.A.M. Cryo-EM data were collected on equipment funded by the Wellcome Trust, UK (079605/Z/06/Z) and the Biotechnology and Biological Sciences Research Council (BBSRC) UK (BB/L014211/1). F.F.’s salary and institute were supported by Inserm (Institut National de la Santé et de la Recherche Médicale), CNRS (Centre National de la Recherche Scientifique) and Sorbonne Université. F.F.’s group was particularly supported by Agence Nationale de la\r\nRecherche (ANR-16-CE16-0011-03) and Seventh Framework Programme (EUHEALTH-\r\n2013, DESIRE, N° 60253; also funding M.S.’s salary) and the European Cooperation in Science and Technology (COST Action CA16118). Open Access funding provided by Birkbeck College: Birkbeck University of London. Deposited in PMC for immediate release.","article_processing_charge":"No","scopus_import":"1","year":"2022","isi":1,"type":"journal_article","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.1242/jcs.259234","oa_version":"Published Version","pmid":1},{"publication_status":"published","ddc":["510"],"language":[{"iso":"eng"}],"_id":"12286","department":[{"_id":"MaKw"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"isi":["000876763300001"]},"abstract":[{"lang":"eng","text":"Inspired by the study of loose cycles in hypergraphs, we define the loose core in hypergraphs as a structurewhich mirrors the close relationship between cycles and $2$-cores in graphs. We prove that in the $r$-uniform binomial random hypergraph $H^r(n,p)$, the order of the loose core undergoes a phase transition at a certain critical threshold and determine this order, as well as the number of edges, asymptotically in the subcritical and supercritical regimes.&#x0D;\r\nOur main tool is an algorithm called CoreConstruct, which enables us to analyse a peeling process for the loose core. By analysing this algorithm we determine the asymptotic degree distribution of vertices in the loose core and in particular how many vertices and edges the loose core contains. As a corollary we obtain an improved upper bound on the length of the longest loose cycle in $H^r(n,p)$."}],"article_processing_charge":"No","acknowledgement":"Supported by Austrian Science Fund (FWF): I3747, W1230.","publication_identifier":{"eissn":["1077-8926"]},"file_date_updated":"2023-01-30T11:45:13Z","scopus_import":"1","year":"2022","type":"journal_article","isi":1,"doi":"10.37236/10794","tmp":{"image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"oa_version":"Published Version","issue":"4","intvolume":"        29","publication":"The Electronic Journal of Combinatorics","publisher":"The Electronic Journal of Combinatorics","quality_controlled":"1","keyword":["Computational Theory and Mathematics","Geometry and Topology","Theoretical Computer Science","Applied Mathematics","Discrete Mathematics and Combinatorics"],"status":"public","article_number":"P4.13","title":"Loose cores and cycles in random hypergraphs","author":[{"id":"43f4ddd0-a46b-11ec-8df6-ef3703bd721d","full_name":"Cooley, Oliver","last_name":"Cooley","first_name":"Oliver"},{"first_name":"Mihyun","last_name":"Kang","full_name":"Kang, Mihyun"},{"full_name":"Zalla, Julian","last_name":"Zalla","first_name":"Julian"}],"oa":1,"date_updated":"2023-08-04T10:29:18Z","file":[{"checksum":"00122b2459f09b5ae43073bfba565e94","date_updated":"2023-01-30T11:45:13Z","file_name":"2022_ElecJournCombinatorics_Cooley_Kang_Zalla.pdf","success":1,"content_type":"application/pdf","access_level":"open_access","file_size":626953,"file_id":"12462","relation":"main_file","creator":"dernst","date_created":"2023-01-30T11:45:13Z"}],"citation":{"ieee":"O. Cooley, M. Kang, and J. Zalla, “Loose cores and cycles in random hypergraphs,” <i>The Electronic Journal of Combinatorics</i>, vol. 29, no. 4. The Electronic Journal of Combinatorics, 2022.","apa":"Cooley, O., Kang, M., &#38; Zalla, J. (2022). Loose cores and cycles in random hypergraphs. <i>The Electronic Journal of Combinatorics</i>. The Electronic Journal of Combinatorics. <a href=\"https://doi.org/10.37236/10794\">https://doi.org/10.37236/10794</a>","short":"O. Cooley, M. Kang, J. Zalla, The Electronic Journal of Combinatorics 29 (2022).","chicago":"Cooley, Oliver, Mihyun Kang, and Julian Zalla. “Loose Cores and Cycles in Random Hypergraphs.” <i>The Electronic Journal of Combinatorics</i>. The Electronic Journal of Combinatorics, 2022. <a href=\"https://doi.org/10.37236/10794\">https://doi.org/10.37236/10794</a>.","mla":"Cooley, Oliver, et al. “Loose Cores and Cycles in Random Hypergraphs.” <i>The Electronic Journal of Combinatorics</i>, vol. 29, no. 4, P4.13, The Electronic Journal of Combinatorics, 2022, doi:<a href=\"https://doi.org/10.37236/10794\">10.37236/10794</a>.","ama":"Cooley O, Kang M, Zalla J. Loose cores and cycles in random hypergraphs. <i>The Electronic Journal of Combinatorics</i>. 2022;29(4). doi:<a href=\"https://doi.org/10.37236/10794\">10.37236/10794</a>","ista":"Cooley O, Kang M, Zalla J. 2022. Loose cores and cycles in random hypergraphs. The Electronic Journal of Combinatorics. 29(4), P4.13."},"day":"21","volume":29,"article_type":"original","has_accepted_license":"1","month":"10","license":"https://creativecommons.org/licenses/by-nd/4.0/","date_published":"2022-10-21T00:00:00Z","date_created":"2023-01-16T10:03:57Z"},{"date_updated":"2023-08-04T10:29:48Z","citation":{"ieee":"A. L. Sumser, M. A. Jösch, P. M. Jonas, and Y. Ben Simon, “Fast, high-throughput production of improved rabies viral vectors for specific, efficient and versatile transsynaptic retrograde labeling,” <i>eLife</i>, vol. 11. eLife Sciences Publications, 2022.","apa":"Sumser, A. L., Jösch, M. A., Jonas, P. M., &#38; Ben Simon, Y. (2022). Fast, high-throughput production of improved rabies viral vectors for specific, efficient and versatile transsynaptic retrograde labeling. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/elife.79848\">https://doi.org/10.7554/elife.79848</a>","short":"A.L. Sumser, M.A. Jösch, P.M. Jonas, Y. Ben Simon, ELife 11 (2022).","mla":"Sumser, Anton L., et al. “Fast, High-Throughput Production of Improved Rabies Viral Vectors for Specific, Efficient and Versatile Transsynaptic Retrograde Labeling.” <i>ELife</i>, vol. 11, 79848, eLife Sciences Publications, 2022, doi:<a href=\"https://doi.org/10.7554/elife.79848\">10.7554/elife.79848</a>.","ista":"Sumser AL, Jösch MA, Jonas PM, Ben Simon Y. 2022. Fast, high-throughput production of improved rabies viral vectors for specific, efficient and versatile transsynaptic retrograde labeling. eLife. 11, 79848.","ama":"Sumser AL, Jösch MA, Jonas PM, Ben Simon Y. Fast, high-throughput production of improved rabies viral vectors for specific, efficient and versatile transsynaptic retrograde labeling. <i>eLife</i>. 2022;11. doi:<a href=\"https://doi.org/10.7554/elife.79848\">10.7554/elife.79848</a>","chicago":"Sumser, Anton L, Maximilian A Jösch, Peter M Jonas, and Yoav Ben Simon. “Fast, High-Throughput Production of Improved Rabies Viral Vectors for Specific, Efficient and Versatile Transsynaptic Retrograde Labeling.” <i>ELife</i>. eLife Sciences Publications, 2022. <a href=\"https://doi.org/10.7554/elife.79848\">https://doi.org/10.7554/elife.79848</a>."},"day":"15","file":[{"checksum":"5a2a65e3e7225090c3d8199f3bbd7b7b","file_name":"2022_eLife_Sumser.pdf","success":1,"date_updated":"2023-01-30T11:50:53Z","access_level":"open_access","content_type":"application/pdf","date_created":"2023-01-30T11:50:53Z","file_size":8506811,"creator":"dernst","file_id":"12463","relation":"main_file"}],"month":"09","date_published":"2022-09-15T00:00:00Z","date_created":"2023-01-16T10:04:15Z","volume":11,"article_type":"original","has_accepted_license":"1","publication":"eLife","intvolume":"        11","keyword":["General Immunology and Microbiology","General Biochemistry","Genetics and Molecular Biology","General Medicine","General Neuroscience"],"quality_controlled":"1","publisher":"eLife Sciences Publications","acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"}],"author":[{"first_name":"Anton L","last_name":"Sumser","orcid":"0000-0002-4792-1881","full_name":"Sumser, Anton L","id":"3320A096-F248-11E8-B48F-1D18A9856A87"},{"id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","full_name":"Jösch, Maximilian A","orcid":"0000-0002-3937-1330","last_name":"Jösch","first_name":"Maximilian A"},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M","first_name":"Peter M","orcid":"0000-0001-5001-4804","last_name":"Jonas"},{"first_name":"Yoav","last_name":"Ben Simon","id":"43DF3136-F248-11E8-B48F-1D18A9856A87","full_name":"Ben Simon, Yoav"}],"oa":1,"status":"public","title":"Fast, high-throughput production of improved rabies viral vectors for specific, efficient and versatile transsynaptic retrograde labeling","article_number":"79848","type":"journal_article","year":"2022","isi":1,"scopus_import":"1","pmid":1,"oa_version":"Published Version","doi":"10.7554/elife.79848","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"MaJö"},{"_id":"PeJo"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"name":"Biophysics and circuit function of a giant cortical glumatergic synapse","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"692692"},{"_id":"2634E9D2-B435-11E9-9278-68D0E5697425","grant_number":"756502","call_identifier":"H2020","name":"Circuits of Visual Attention"},{"grant_number":"Z00312","call_identifier":"FWF","_id":"25C5A090-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize"},{"name":"Neuronal networks of salience and spatial detection in the murine superior colliculus","grant_number":"LT000256","_id":"266D407A-B435-11E9-9278-68D0E5697425"},{"name":"Connecting sensory with motor processing in the superior colliculus","grant_number":"ALTF 1098-2017","_id":"264FEA02-B435-11E9-9278-68D0E5697425"}],"external_id":{"isi":["000892204300001"],"pmid":["36040301"]},"language":[{"iso":"eng"}],"_id":"12288","ddc":["570"],"publication_status":"published","acknowledgement":"We thank F Marr for technical assistance, A Murray for RVdG-CVS-N2c viruses and Neuro2A packaging cell-lines and J Watson for reading the manuscript. This research was supported by the Scientific Service Units (SSU) of IST-Austria through resources provided by the Imaging and Optics Facility (IOF) and the Preclinical Facility (PCF). This project was funded by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (ERC advanced grant No 692692, PJ, ERC starting grant No 756502, MJ), the Fond zur Förderung der Wissenschaftlichen Forschung (Z 312-B27, Wittgenstein award, PJ), the Human Frontier Science Program (LT000256/2018-L, AS) and EMBO (ALTF 1098-2017, AS).","article_processing_charge":"No","file_date_updated":"2023-01-30T11:50:53Z","publication_identifier":{"eissn":["2050-084X"]},"ec_funded":1,"abstract":[{"lang":"eng","text":"To understand the function of neuronal circuits, it is crucial to disentangle the connectivity patterns within the network. However, most tools currently used to explore connectivity have low throughput, low selectivity, or limited accessibility. Here, we report the development of an improved packaging system for the production of the highly neurotropic RVdGenvA-CVS-N2c rabies viral vectors, yielding titers orders of magnitude higher with no background contamination, at a fraction of the production time, while preserving the efficiency of transsynaptic labeling. Along with the production pipeline, we developed suites of ‘starter’ AAV and bicistronic RVdG-CVS-N2c vectors, enabling retrograde labeling from a wide range of neuronal populations, tailored for diverse experimental requirements. We demonstrate the power and flexibility of the new system by uncovering hidden local and distal inhibitory connections in the mouse hippocampal formation and by imaging the functional properties of a cortical microcircuit across weeks. Our novel production pipeline provides a convenient approach to generate new rabies vectors, while our toolkit flexibly and efficiently expands the current capacity to label, manipulate and image the neuronal activity of interconnected neuronal circuits in vitro and in vivo."}]},{"type":"journal_article","year":"2022","isi":1,"scopus_import":"1","doi":"10.1214/22-ejp838","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","_id":"12290","language":[{"iso":"eng"}],"publication_status":"published","ddc":["510"],"department":[{"_id":"LaEr"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"_id":"62796744-2b32-11ec-9570-940b20777f1d","grant_number":"101020331","call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta"}],"external_id":{"isi":["000910863700003"]},"ec_funded":1,"abstract":[{"text":"We prove local laws, i.e. optimal concentration estimates for arbitrary products of resolvents of a Wigner random matrix with deterministic matrices in between. We find that the size of such products heavily depends on whether some of the deterministic matrices are traceless. Our estimates correctly account for this dependence and they hold optimally down to the smallest possible spectral scale.","lang":"eng"}],"acknowledgement":"L. Erdős was supported by ERC Advanced Grant “RMTBeyond” No. 101020331. D. Schröder was supported by Dr. Max Rössler, the Walter Haefner Foundation and the ETH Zürich Foundation.","article_processing_charge":"No","file_date_updated":"2023-01-30T11:59:21Z","publication_identifier":{"eissn":["1083-6489"]},"date_updated":"2023-08-04T10:32:23Z","day":"12","citation":{"ieee":"G. Cipolloni, L. Erdös, and D. J. Schröder, “Optimal multi-resolvent local laws for Wigner matrices,” <i>Electronic Journal of Probability</i>, vol. 27. Institute of Mathematical Statistics, pp. 1–38, 2022.","short":"G. Cipolloni, L. Erdös, D.J. Schröder, Electronic Journal of Probability 27 (2022) 1–38.","apa":"Cipolloni, G., Erdös, L., &#38; Schröder, D. J. (2022). Optimal multi-resolvent local laws for Wigner matrices. <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/22-ejp838\">https://doi.org/10.1214/22-ejp838</a>","mla":"Cipolloni, Giorgio, et al. “Optimal Multi-Resolvent Local Laws for Wigner Matrices.” <i>Electronic Journal of Probability</i>, vol. 27, Institute of Mathematical Statistics, 2022, pp. 1–38, doi:<a href=\"https://doi.org/10.1214/22-ejp838\">10.1214/22-ejp838</a>.","ama":"Cipolloni G, Erdös L, Schröder DJ. Optimal multi-resolvent local laws for Wigner matrices. <i>Electronic Journal of Probability</i>. 2022;27:1-38. doi:<a href=\"https://doi.org/10.1214/22-ejp838\">10.1214/22-ejp838</a>","ista":"Cipolloni G, Erdös L, Schröder DJ. 2022. Optimal multi-resolvent local laws for Wigner matrices. Electronic Journal of Probability. 27, 1–38.","chicago":"Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Optimal Multi-Resolvent Local Laws for Wigner Matrices.” <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics, 2022. <a href=\"https://doi.org/10.1214/22-ejp838\">https://doi.org/10.1214/22-ejp838</a>."},"file":[{"access_level":"open_access","content_type":"application/pdf","date_created":"2023-01-30T11:59:21Z","file_size":502149,"file_id":"12464","relation":"main_file","creator":"dernst","checksum":"bb647b48fbdb59361210e425c220cdcb","file_name":"2022_ElecJournProbability_Cipolloni.pdf","success":1,"date_updated":"2023-01-30T11:59:21Z"}],"article_type":"original","volume":27,"has_accepted_license":"1","month":"09","date_published":"2022-09-12T00:00:00Z","date_created":"2023-01-16T10:04:38Z","publication":"Electronic Journal of Probability","intvolume":"        27","keyword":["Statistics","Probability and Uncertainty","Statistics and Probability"],"quality_controlled":"1","page":"1-38","publisher":"Institute of Mathematical Statistics","status":"public","title":"Optimal multi-resolvent local laws for Wigner matrices","author":[{"first_name":"Giorgio","last_name":"Cipolloni","orcid":"0000-0002-4901-7992","full_name":"Cipolloni, Giorgio","id":"42198EFA-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-5366-9603","last_name":"Erdös","first_name":"László","full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Schröder, Dominik J","id":"408ED176-F248-11E8-B48F-1D18A9856A87","last_name":"Schröder","orcid":"0000-0002-2904-1856","first_name":"Dominik J"}],"oa":1},{"year":"2022","isi":1,"type":"journal_article","scopus_import":"1","pmid":1,"oa_version":"Submitted Version","doi":"10.1038/s41586-022-05187-x","department":[{"_id":"JiFr"},{"_id":"GradSch"},{"_id":"EvBe"},{"_id":"EM-Fac"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Tracing Evolution of Auxin Transport and Polarity in Plants","_id":"261099A6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"742985"},{"name":"RNA-directed DNA methylation in plant development","_id":"262EF96E-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P29988"}],"external_id":{"pmid":["36071161"],"isi":["000851357500002"]},"_id":"12291","language":[{"iso":"eng"}],"publication_status":"published","ddc":["580"],"acknowledgement":"We acknowledge K. Kubiasová for excellent technical assistance, J. Neuhold, A. Lehner and A. Sedivy for technical assistance with protein production and purification at Vienna Biocenter Core Facilities; Creoptix for performing GCI; and the Bioimaging, Electron Microscopy and Life Science Facilities at ISTA, the Plant Sciences Core Facility of CEITEC Masaryk University, the Core Facility CELLIM (MEYS CR, LM2018129 Czech-BioImaging) and J. Sprakel for their assistance. J.F. is grateful to R. Napier for many insightful suggestions and support. We thank all past and present members of the Friml group for their support and for other contributions to this effort to clarify the controversial role of ABP1 over the past seven years. The project received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement no. 742985 to J.F. and 833867 to D.W.); the Austrian Science Fund (FWF; P29988 to J.F.); the Netherlands Organization for Scientific Research (NWO; VICI grant 865.14.001 to D.W. and VENI grant VI.Veni.212.003 to A.K.); the Ministry of Education, Science and Technological Development of the Republic of Serbia (contract no. 451-03-68/2022-14/200053 to B.D.Ž.); and the MEXT/JSPS KAKENHI to K.T. (20K06685) and T.K. (20H05687 and 20H05910).","article_processing_charge":"No","file_date_updated":"2023-11-02T17:12:37Z","publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]},"ec_funded":1,"abstract":[{"text":"The phytohormone auxin triggers transcriptional reprogramming through a well-characterized perception machinery in the nucleus. By contrast, mechanisms that underlie fast effects of auxin, such as the regulation of ion fluxes, rapid phosphorylation of proteins or auxin feedback on its transport, remain unclear1,2,3. Whether auxin-binding protein 1 (ABP1) is an auxin receptor has been a source of debate for decades1,4. Here we show that a fraction of Arabidopsis thaliana ABP1 is secreted and binds auxin specifically at an acidic pH that is typical of the apoplast. ABP1 and its plasma-membrane-localized partner, transmembrane kinase 1 (TMK1), are required for the auxin-induced ultrafast global phospho-response and for downstream processes that include the activation of H+-ATPase and accelerated cytoplasmic streaming. abp1 and tmk mutants cannot establish auxin-transporting channels and show defective auxin-induced vasculature formation and regeneration. An ABP1(M2X) variant that lacks the capacity to bind auxin is unable to complement these defects in abp1 mutants. These data indicate that ABP1 is the auxin receptor for TMK1-based cell-surface signalling, which mediates the global phospho-response and auxin canalization.","lang":"eng"}],"date_updated":"2023-11-07T08:16:09Z","citation":{"chicago":"Friml, Jiří, Michelle C Gallei, Zuzana Gelová, Alexander J Johnson, Ewa Mazur, Aline Monzer, Lesia Rodriguez Solovey, et al. “ABP1–TMK Auxin Perception for Global Phosphorylation and Auxin Canalization.” <i>Nature</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1038/s41586-022-05187-x\">https://doi.org/10.1038/s41586-022-05187-x</a>.","mla":"Friml, Jiří, et al. “ABP1–TMK Auxin Perception for Global Phosphorylation and Auxin Canalization.” <i>Nature</i>, vol. 609, no. 7927, Springer Nature, 2022, pp. 575–81, doi:<a href=\"https://doi.org/10.1038/s41586-022-05187-x\">10.1038/s41586-022-05187-x</a>.","ama":"Friml J, Gallei MC, Gelová Z, et al. ABP1–TMK auxin perception for global phosphorylation and auxin canalization. <i>Nature</i>. 2022;609(7927):575-581. doi:<a href=\"https://doi.org/10.1038/s41586-022-05187-x\">10.1038/s41586-022-05187-x</a>","ista":"Friml J, Gallei MC, Gelová Z, Johnson AJ, Mazur E, Monzer A, Rodriguez Solovey L, Roosjen M, Verstraeten I, Živanović BD, Zou M, Fiedler L, Giannini C, Grones P, Hrtyan M, Kaufmann W, Kuhn A, Narasimhan M, Randuch M, Rýdza N, Takahashi K, Tan S, Teplova A, Kinoshita T, Weijers D, Rakusová H. 2022. ABP1–TMK auxin perception for global phosphorylation and auxin canalization. Nature. 609(7927), 575–581.","ieee":"J. Friml <i>et al.</i>, “ABP1–TMK auxin perception for global phosphorylation and auxin canalization,” <i>Nature</i>, vol. 609, no. 7927. Springer Nature, pp. 575–581, 2022.","short":"J. Friml, M.C. Gallei, Z. Gelová, A.J. Johnson, E. Mazur, A. Monzer, L. Rodriguez Solovey, M. Roosjen, I. Verstraeten, B.D. Živanović, M. Zou, L. Fiedler, C. Giannini, P. Grones, M. Hrtyan, W. Kaufmann, A. Kuhn, M. Narasimhan, M. Randuch, N. Rýdza, K. Takahashi, S. Tan, A. Teplova, T. Kinoshita, D. Weijers, H. Rakusová, Nature 609 (2022) 575–581.","apa":"Friml, J., Gallei, M. C., Gelová, Z., Johnson, A. J., Mazur, E., Monzer, A., … Rakusová, H. (2022). ABP1–TMK auxin perception for global phosphorylation and auxin canalization. <i>Nature</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41586-022-05187-x\">https://doi.org/10.1038/s41586-022-05187-x</a>"},"day":"15","file":[{"access_level":"open_access","content_type":"application/pdf","date_created":"2023-11-02T17:12:37Z","file_id":"14483","creator":"amally","relation":"main_file","file_size":79774945,"checksum":"a6055c606aefb900bf62ae3e7d15f921","success":1,"file_name":"Friml Nature 2022_merged.pdf","date_updated":"2023-11-02T17:12:37Z"}],"month":"09","date_created":"2023-01-16T10:04:48Z","date_published":"2022-09-15T00:00:00Z","article_type":"original","volume":609,"has_accepted_license":"1","publication":"Nature","intvolume":"       609","quality_controlled":"1","page":"575-581","publisher":"Springer Nature","acknowledged_ssus":[{"_id":"Bio"},{"_id":"EM-Fac"},{"_id":"LifeSc"}],"issue":"7927","author":[{"orcid":"0000-0002-8302-7596","last_name":"Friml","first_name":"Jiří","full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Gallei, Michelle C","id":"35A03822-F248-11E8-B48F-1D18A9856A87","first_name":"Michelle C","orcid":"0000-0003-1286-7368","last_name":"Gallei"},{"id":"0AE74790-0E0B-11E9-ABC7-1ACFE5697425","full_name":"Gelová, Zuzana","first_name":"Zuzana","orcid":"0000-0003-4783-1752","last_name":"Gelová"},{"id":"46A62C3A-F248-11E8-B48F-1D18A9856A87","full_name":"Johnson, Alexander J","first_name":"Alexander J","orcid":"0000-0002-2739-8843","last_name":"Johnson"},{"full_name":"Mazur, Ewa","last_name":"Mazur","first_name":"Ewa"},{"first_name":"Aline","last_name":"Monzer","id":"2DB5D88C-D7B3-11E9-B8FD-7907E6697425","full_name":"Monzer, Aline"},{"first_name":"Lesia","orcid":"0000-0002-7244-7237","last_name":"Rodriguez Solovey","id":"3922B506-F248-11E8-B48F-1D18A9856A87","full_name":"Rodriguez Solovey, Lesia"},{"last_name":"Roosjen","first_name":"Mark","full_name":"Roosjen, Mark"},{"full_name":"Verstraeten, Inge","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","first_name":"Inge","orcid":"0000-0001-7241-2328","last_name":"Verstraeten"},{"full_name":"Živanović, Branka D.","first_name":"Branka D.","last_name":"Živanović"},{"full_name":"Zou, Minxia","id":"5c243f41-03f3-11ec-841c-96faf48a7ef9","first_name":"Minxia","last_name":"Zou"},{"full_name":"Fiedler, Lukas","id":"7c417475-8972-11ed-ae7b-8b674ca26986","last_name":"Fiedler","first_name":"Lukas"},{"id":"e3fdddd5-f6e0-11ea-865d-ca99ee6367f4","full_name":"Giannini, Caterina","first_name":"Caterina","last_name":"Giannini"},{"last_name":"Grones","first_name":"Peter","full_name":"Grones, Peter"},{"id":"45A71A74-F248-11E8-B48F-1D18A9856A87","full_name":"Hrtyan, Mónika","first_name":"Mónika","last_name":"Hrtyan"},{"orcid":"0000-0001-9735-5315","last_name":"Kaufmann","first_name":"Walter","full_name":"Kaufmann, Walter","id":"3F99E422-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kuhn, Andre","first_name":"Andre","last_name":"Kuhn"},{"first_name":"Madhumitha","orcid":"0000-0002-8600-0671","last_name":"Narasimhan","id":"44BF24D0-F248-11E8-B48F-1D18A9856A87","full_name":"Narasimhan, Madhumitha"},{"first_name":"Marek","last_name":"Randuch","full_name":"Randuch, Marek","id":"6ac4636d-15b2-11ec-abd3-fb8df79972ae"},{"full_name":"Rýdza, Nikola","first_name":"Nikola","last_name":"Rýdza"},{"last_name":"Takahashi","first_name":"Koji","full_name":"Takahashi, Koji"},{"first_name":"Shutang","orcid":"0000-0002-0471-8285","last_name":"Tan","id":"2DE75584-F248-11E8-B48F-1D18A9856A87","full_name":"Tan, Shutang"},{"last_name":"Teplova","first_name":"Anastasiia","full_name":"Teplova, Anastasiia","id":"e3736151-106c-11ec-b916-c2558e2762c6"},{"full_name":"Kinoshita, Toshinori","last_name":"Kinoshita","first_name":"Toshinori"},{"full_name":"Weijers, Dolf","first_name":"Dolf","last_name":"Weijers"},{"full_name":"Rakusová, Hana","last_name":"Rakusová","first_name":"Hana"}],"oa":1,"status":"public","title":"ABP1–TMK auxin perception for global phosphorylation and auxin canalization"},{"publication_identifier":{"isbn":["9780323955614"],"issn":["0076-6879"]},"article_processing_charge":"No","alternative_title":["Methods in Enzymology"],"abstract":[{"text":"Brassicaceae are blessed with specialized metabolites called glucosinolates (GSLs), which along with their degradation products, are beneficial in agriculture and human health. To date, more than 130 GSL structures have been identified, mostly derived from the amino acid methionine. The biosynthesis of methionine-derived aliphatic GSLs starts with a side-chain elongation step involving a recursive three-step cyclic process that incorporates a new methylene group into the 2-oxo acid to form a series of elongated 2-oxo acids. Methylthioalkylmalate synthase (MAMS) catalyzes the first committed step in the side-chain elongation of methionine-derived GSLs. The substrate specificity of MAMS with different 2-oxo acids determines whether reaction products of a given cycle enter for an additional round of chain elongation or enter into core GSLs structure formation. Multiple MAMS encoding genes are present in the Brassicaceae species and are known to play a central role in shaping the diverse profile of aliphatic GSLs. We recently established a highly sensitive LC-MS/MS-based methodology that quantifies the MAMS activity by estimating the amount of the next intermediate of the pathway, the 2-malate derivatives. Overall, this chapter describes the protocol for the expression, purification, and steady-state kinetic analysis of the recombinant MAMS protein.","lang":"eng"}],"external_id":{"pmid":["36280361"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"_id":"12294","publication_status":"published","oa_version":"None","pmid":1,"doi":"10.1016/bs.mie.2022.07.019","type":"book_chapter","year":"2022","scopus_import":"1","author":[{"id":"50e95140-3016-11ec-9e1a-881b648a1367","full_name":"Kumar, Roshan","first_name":"Roshan","last_name":"Kumar","orcid":"0000-0002-0346-9125"},{"full_name":"Reichelt, Michael","last_name":"Reichelt","first_name":"Michael"},{"full_name":"Bisht, Naveen C.","first_name":"Naveen C.","last_name":"Bisht"}],"title":"An LC-MS/MS Assay for Enzymatic Characterization of Methylthioalkylmalate Synthase (MAMS) Involved in Glucosinolate Biosynthesis","status":"public","page":"49-69","quality_controlled":"1","publisher":"Elsevier","publication":"Biochemical Pathways and Environmental Responses in Plants: Part A","intvolume":"       676","date_published":"2022-10-21T00:00:00Z","date_created":"2023-01-16T10:05:13Z","month":"10","volume":676,"citation":{"short":"R. Kumar, M. Reichelt, N.C. Bisht, in:, J. Jez (Ed.), Biochemical Pathways and Environmental Responses in Plants: Part A, Elsevier, 2022, pp. 49–69.","apa":"Kumar, R., Reichelt, M., &#38; Bisht, N. C. (2022). An LC-MS/MS Assay for Enzymatic Characterization of Methylthioalkylmalate Synthase (MAMS) Involved in Glucosinolate Biosynthesis. In J. Jez (Ed.), <i>Biochemical Pathways and Environmental Responses in Plants: Part A</i> (Vol. 676, pp. 49–69). Elsevier. <a href=\"https://doi.org/10.1016/bs.mie.2022.07.019\">https://doi.org/10.1016/bs.mie.2022.07.019</a>","ieee":"R. Kumar, M. Reichelt, and N. C. Bisht, “An LC-MS/MS Assay for Enzymatic Characterization of Methylthioalkylmalate Synthase (MAMS) Involved in Glucosinolate Biosynthesis,” in <i>Biochemical Pathways and Environmental Responses in Plants: Part A</i>, vol. 676, J. Jez, Ed. Elsevier, 2022, pp. 49–69.","ista":"Kumar R, Reichelt M, Bisht NC. 2022.An LC-MS/MS Assay for Enzymatic Characterization of Methylthioalkylmalate Synthase (MAMS) Involved in Glucosinolate Biosynthesis. In: Biochemical Pathways and Environmental Responses in Plants: Part A. Methods in Enzymology, vol. 676, 49–69.","ama":"Kumar R, Reichelt M, Bisht NC. An LC-MS/MS Assay for Enzymatic Characterization of Methylthioalkylmalate Synthase (MAMS) Involved in Glucosinolate Biosynthesis. In: Jez J, ed. <i>Biochemical Pathways and Environmental Responses in Plants: Part A</i>. Vol 676. Elsevier; 2022:49-69. doi:<a href=\"https://doi.org/10.1016/bs.mie.2022.07.019\">10.1016/bs.mie.2022.07.019</a>","mla":"Kumar, Roshan, et al. “An LC-MS/MS Assay for Enzymatic Characterization of Methylthioalkylmalate Synthase (MAMS) Involved in Glucosinolate Biosynthesis.” <i>Biochemical Pathways and Environmental Responses in Plants: Part A</i>, edited by Joseph Jez, vol. 676, Elsevier, 2022, pp. 49–69, doi:<a href=\"https://doi.org/10.1016/bs.mie.2022.07.019\">10.1016/bs.mie.2022.07.019</a>.","chicago":"Kumar, Roshan, Michael Reichelt, and Naveen C. Bisht. “An LC-MS/MS Assay for Enzymatic Characterization of Methylthioalkylmalate Synthase (MAMS) Involved in Glucosinolate Biosynthesis.” In <i>Biochemical Pathways and Environmental Responses in Plants: Part A</i>, edited by Joseph Jez, 676:49–69. Elsevier, 2022. <a href=\"https://doi.org/10.1016/bs.mie.2022.07.019\">https://doi.org/10.1016/bs.mie.2022.07.019</a>."},"day":"21","date_updated":"2023-12-12T08:11:08Z","editor":[{"last_name":"Jez","first_name":"Joseph","full_name":"Jez, Joseph"}]},{"date_updated":"2023-09-05T15:13:17Z","citation":{"mla":"Gelashvili, Rati, et al. “Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback.” <i>Financial Cryptography and Data Security</i>, vol. 13411, Springer Nature, 2022, pp. 296–315, doi:<a href=\"https://doi.org/10.1007/978-3-031-18283-9_14\">10.1007/978-3-031-18283-9_14</a>.","ama":"Gelashvili R, Kokoris Kogias E, Sonnino A, Spiegelman A, Xiang Z. Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback. In: <i>Financial Cryptography and Data Security</i>. Vol 13411. Springer Nature; 2022:296-315. doi:<a href=\"https://doi.org/10.1007/978-3-031-18283-9_14\">10.1007/978-3-031-18283-9_14</a>","ista":"Gelashvili R, Kokoris Kogias E, Sonnino A, Spiegelman A, Xiang Z. 2022. Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback. Financial Cryptography and Data Security. FC: Financial Cryptography, LNCS, vol. 13411, 296–315.","chicago":"Gelashvili, Rati, Eleftherios Kokoris Kogias, Alberto Sonnino, Alexander Spiegelman, and Zhuolun Xiang. “Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback.” In <i>Financial Cryptography and Data Security</i>, 13411:296–315. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-031-18283-9_14\">https://doi.org/10.1007/978-3-031-18283-9_14</a>.","ieee":"R. Gelashvili, E. Kokoris Kogias, A. Sonnino, A. Spiegelman, and Z. Xiang, “Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback,” in <i>Financial Cryptography and Data Security</i>, Radisson Grenada Beach Resort, Grenada, 2022, vol. 13411, pp. 296–315.","short":"R. Gelashvili, E. Kokoris Kogias, A. Sonnino, A. Spiegelman, Z. Xiang, in:, Financial Cryptography and Data Security, Springer Nature, 2022, pp. 296–315.","apa":"Gelashvili, R., Kokoris Kogias, E., Sonnino, A., Spiegelman, A., &#38; Xiang, Z. (2022). Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback. In <i>Financial Cryptography and Data Security</i> (Vol. 13411, pp. 296–315). Radisson Grenada Beach Resort, Grenada: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-18283-9_14\">https://doi.org/10.1007/978-3-031-18283-9_14</a>"},"day":"22","conference":{"start_date":"2022-05-02","location":"Radisson Grenada Beach Resort, Grenada","end_date":"2022-05-06","name":"FC: Financial Cryptography"},"month":"10","date_published":"2022-10-22T00:00:00Z","date_created":"2023-01-16T10:05:51Z","volume":13411,"intvolume":"     13411","publication":"Financial Cryptography and Data Security","publisher":"Springer Nature","page":"296-315","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2106.10362","open_access":"1"}],"quality_controlled":"1","author":[{"full_name":"Gelashvili, Rati","last_name":"Gelashvili","first_name":"Rati"},{"last_name":"Kokoris Kogias","first_name":"Eleftherios","full_name":"Kokoris Kogias, Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30"},{"first_name":"Alberto","last_name":"Sonnino","full_name":"Sonnino, Alberto"},{"full_name":"Spiegelman, Alexander","last_name":"Spiegelman","first_name":"Alexander"},{"full_name":"Xiang, Zhuolun","first_name":"Zhuolun","last_name":"Xiang"}],"oa":1,"status":"public","title":"Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback","scopus_import":"1","year":"2022","arxiv":1,"type":"conference","oa_version":"Preprint","doi":"10.1007/978-3-031-18283-9_14","department":[{"_id":"ElKo"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"arxiv":["2106.10362"]},"publication_status":"published","language":[{"iso":"eng"}],"_id":"12298","article_processing_charge":"No","alternative_title":["LNCS"],"acknowledgement":"We thank our shepherd Aniket Kate and the anonymous reviewers at FC 2022 for their helpful feedback. This work is supported by the Novi team at Facebook. We also thank the Novi Research and Engineering teams for valuable feedback, and in particular Mathieu Baudet, Andrey Chursin, George Danezis, Zekun Li, and Dahlia Malkhi for discussions that shaped this work.","publication_identifier":{"isbn":["9783031182822"],"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783031182839"]},"abstract":[{"text":"Existing committee-based Byzantine state machine replication (SMR) protocols, typically deployed in production blockchains, face a clear trade-off: (1) they either achieve linear communication cost in the steady state, but sacrifice liveness during periods of asynchrony, or (2) they are robust (progress with probability one) but pay quadratic communication cost. We believe this trade-off is unwarranted since existing linear protocols still have asymptotic quadratic cost in the worst case. We design Ditto, a Byzantine SMR protocol that enjoys the best of both worlds: optimal communication on and off the steady state (linear and quadratic, respectively) and progress guarantee under asynchrony and DDoS attacks. We achieve this by replacing the view-synchronization of partially synchronous protocols with an asynchronous fallback mechanism at no extra asymptotic cost. Specifically, we start from HotStuff, a state-of-the-art linear protocol, and gradually build Ditto. As a separate contribution and an intermediate step, we design a 2-chain version of HotStuff, Jolteon, which leverages a quadratic view-change mechanism to reduce the latency of the standard 3-chain HotStuff. We implement and experimentally evaluate all our systems to prove that breaking the robustness-efficiency trade-off is in the realm of practicality.","lang":"eng"}]},{"abstract":[{"text":"Transfer learning is a classic paradigm by which models pretrained on large “upstream” datasets are adapted to yield good results on “downstream” specialized datasets. Generally, more accurate models on the “upstream” dataset tend to provide better transfer accuracy “downstream”. In this work, we perform an in-depth investigation of this phenomenon in the context of convolutional neural networks (CNNs) trained on the ImageNet dataset, which have been pruned-that is, compressed by sparsifiying their connections. We consider transfer using unstructured pruned models obtained by applying several state-of-the-art pruning methods, including magnitude-based, second-order, regrowth, lottery-ticket, and regularization approaches, in the context of twelve standard transfer tasks. In a nutshell, our study shows that sparse models can match or even outperform the transfer performance of dense models, even at high sparsities, and, while doing so, can lead to significant inference and even training speedups. At the same time, we observe and analyze significant differences in the behaviour of different pruning methods. The code is available at: https://github.com/IST-DASLab/sparse-imagenet-transfer.","lang":"eng"}],"ec_funded":1,"publication_identifier":{"eissn":["2575-7075"]},"acknowledgement":"he authors would like to sincerely thank Christoph Lampert and Nir Shavit for fruitful discussions during the development of this work, and Eldar Kurtic for experimental support. EI was supported in part by the FWF DK VGSCO, grant agreement number W1260-N35, while AP and DA acknowledge generous support by the ERC, via Starting Grant 805223 ScaleML.","article_processing_charge":"No","publication_status":"published","_id":"12299","language":[{"iso":"eng"}],"external_id":{"arxiv":["2111.13445"],"isi":["000870759105034"]},"project":[{"grant_number":" W1260-N35","_id":"9B9290DE-BA93-11EA-9121-9846C619BF3A","name":"Vienna Graduate School on Computational Optimization"},{"name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","call_identifier":"H2020"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"DaAl"},{"_id":"ChLa"}],"doi":"10.1109/cvpr52688.2022.01195","oa_version":"Preprint","scopus_import":"1","type":"conference","arxiv":1,"isi":1,"year":"2022","title":"How well do sparse ImageNet models transfer?","status":"public","oa":1,"author":[{"id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117","full_name":"Iofinova, Eugenia B","last_name":"Iofinova","orcid":"0000-0002-7778-3221","first_name":"Eugenia B"},{"id":"32D78294-F248-11E8-B48F-1D18A9856A87","full_name":"Peste, Elena-Alexandra","last_name":"Peste","first_name":"Elena-Alexandra"},{"first_name":"Mark","last_name":"Kurtz","full_name":"Kurtz, Mark"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X"}],"publisher":"Institute of Electrical and Electronics Engineers","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2111.13445"}],"quality_controlled":"1","page":"12256-12266","publication":"2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition","date_created":"2023-01-16T10:06:00Z","date_published":"2022-09-27T00:00:00Z","month":"09","related_material":{"record":[{"status":"public","id":"13074","relation":"dissertation_contains"}]},"conference":{"name":"CVPR: Computer Vision and Pattern Recognition","end_date":"2022-06-24","start_date":"2022-06-18","location":"New Orleans, LA, United States"},"day":"27","citation":{"mla":"Iofinova, Eugenia B., et al. “How Well Do Sparse ImageNet Models Transfer?” <i>2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, Institute of Electrical and Electronics Engineers, 2022, pp. 12256–66, doi:<a href=\"https://doi.org/10.1109/cvpr52688.2022.01195\">10.1109/cvpr52688.2022.01195</a>.","ista":"Iofinova EB, Peste E-A, Kurtz M, Alistarh D-A. 2022. How well do sparse ImageNet models transfer? 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition. CVPR: Computer Vision and Pattern Recognition, 12256–12266.","ama":"Iofinova EB, Peste E-A, Kurtz M, Alistarh D-A. How well do sparse ImageNet models transfer? In: <i>2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>. Institute of Electrical and Electronics Engineers; 2022:12256-12266. doi:<a href=\"https://doi.org/10.1109/cvpr52688.2022.01195\">10.1109/cvpr52688.2022.01195</a>","chicago":"Iofinova, Eugenia B, Elena-Alexandra Peste, Mark Kurtz, and Dan-Adrian Alistarh. “How Well Do Sparse ImageNet Models Transfer?” In <i>2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, 12256–66. Institute of Electrical and Electronics Engineers, 2022. <a href=\"https://doi.org/10.1109/cvpr52688.2022.01195\">https://doi.org/10.1109/cvpr52688.2022.01195</a>.","ieee":"E. B. Iofinova, E.-A. Peste, M. Kurtz, and D.-A. Alistarh, “How well do sparse ImageNet models transfer?,” in <i>2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, New Orleans, LA, United States, 2022, pp. 12256–12266.","short":"E.B. Iofinova, E.-A. Peste, M. Kurtz, D.-A. Alistarh, in:, 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition, Institute of Electrical and Electronics Engineers, 2022, pp. 12256–12266.","apa":"Iofinova, E. B., Peste, E.-A., Kurtz, M., &#38; Alistarh, D.-A. (2022). How well do sparse ImageNet models transfer? In <i>2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i> (pp. 12256–12266). New Orleans, LA, United States: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/cvpr52688.2022.01195\">https://doi.org/10.1109/cvpr52688.2022.01195</a>"},"date_updated":"2023-08-04T10:33:28Z"},{"oa_version":"Preprint","date_published":"2022-07-27T00:00:00Z","date_created":"2023-01-16T10:06:11Z","month":"07","doi":"10.1109/sp46214.2022.9833584","day":"27","citation":{"apa":"Das, S., Yurek, T., Xiang, Z., Miller, A., Kokoris Kogias, E., &#38; Ren, L. (2022). Practical asynchronous distributed key generation. In <i>2022 IEEE Symposium on Security and Privacy</i> (pp. 2518–2534). San Francisco, CA, United States: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/sp46214.2022.9833584\">https://doi.org/10.1109/sp46214.2022.9833584</a>","short":"S. Das, T. Yurek, Z. Xiang, A. Miller, E. Kokoris Kogias, L. Ren, in:, 2022 IEEE Symposium on Security and Privacy, Institute of Electrical and Electronics Engineers, 2022, pp. 2518–2534.","ieee":"S. Das, T. Yurek, Z. Xiang, A. Miller, E. Kokoris Kogias, and L. Ren, “Practical asynchronous distributed key generation,” in <i>2022 IEEE Symposium on Security and Privacy</i>, San Francisco, CA, United States, 2022, pp. 2518–2534.","ista":"Das S, Yurek T, Xiang Z, Miller A, Kokoris Kogias E, Ren L. 2022. Practical asynchronous distributed key generation. 2022 IEEE Symposium on Security and Privacy. SP: Symposium on Security and Privacy, 2518–2534.","ama":"Das S, Yurek T, Xiang Z, Miller A, Kokoris Kogias E, Ren L. Practical asynchronous distributed key generation. In: <i>2022 IEEE Symposium on Security and Privacy</i>. Institute of Electrical and Electronics Engineers; 2022:2518-2534. doi:<a href=\"https://doi.org/10.1109/sp46214.2022.9833584\">10.1109/sp46214.2022.9833584</a>","mla":"Das, Sourav, et al. “Practical Asynchronous Distributed Key Generation.” <i>2022 IEEE Symposium on Security and Privacy</i>, Institute of Electrical and Electronics Engineers, 2022, pp. 2518–34, doi:<a href=\"https://doi.org/10.1109/sp46214.2022.9833584\">10.1109/sp46214.2022.9833584</a>.","chicago":"Das, Sourav, Thomas Yurek, Zhuolun Xiang, Andrew Miller, Eleftherios Kokoris Kogias, and Ling Ren. “Practical Asynchronous Distributed Key Generation.” In <i>2022 IEEE Symposium on Security and Privacy</i>, 2518–34. Institute of Electrical and Electronics Engineers, 2022. <a href=\"https://doi.org/10.1109/sp46214.2022.9833584\">https://doi.org/10.1109/sp46214.2022.9833584</a>."},"date_updated":"2023-02-16T07:43:53Z","scopus_import":"1","type":"conference","year":"2022","conference":{"location":"San Francisco, CA, United States","start_date":"2022-05-23","end_date":"2022-05-26","name":"SP: Symposium on Security and Privacy"},"publication_identifier":{"eissn":["2375-1207"],"eisbn":["9781665413169"]},"oa":1,"author":[{"first_name":"Sourav","last_name":"Das","full_name":"Das, Sourav"},{"full_name":"Yurek, Thomas","last_name":"Yurek","first_name":"Thomas"},{"first_name":"Zhuolun","last_name":"Xiang","full_name":"Xiang, Zhuolun"},{"full_name":"Miller, Andrew","first_name":"Andrew","last_name":"Miller"},{"id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","full_name":"Kokoris Kogias, Eleftherios","last_name":"Kokoris Kogias","first_name":"Eleftherios"},{"full_name":"Ren, Ling","last_name":"Ren","first_name":"Ling"}],"acknowledgement":"The authors would like to thank Amit Agarwal, Adithya Bhat, Kobi Gurkan, Dakshita Khurana, Nibesh Shrestha, and Gilad Stern for the helpful discussions related to the paper.\r\nAlso, the authors would like to thank Sylvain Bellemare for helping with the hbACSS codebase and Nicolas Gailly for helping with running the Drand experiments.","article_processing_charge":"No","abstract":[{"text":"Distributed Key Generation (DKG) is a technique to bootstrap threshold cryptosystems without a trusted third party and is a building block to decentralized protocols such as randomness beacons, threshold signatures, and general multiparty computation. Until recently, DKG protocols have assumed the synchronous model and thus are vulnerable when their underlying network assumptions do not hold. The recent advancements in asynchronous DKG protocols are insufficient as they either have poor efficiency or limited functionality, resulting in a lack of concrete implementations. In this paper, we present a simple and concretely efficient asynchronous DKG (ADKG) protocol. In a network of n nodes, our ADKG protocol can tolerate up to t<n/3 malicious nodes and have an expected O(κn3) communication cost, where κ is the security parameter. Our ADKG protocol produces a field element as the secret and is thus compatible with off-the-shelf threshold cryptosystems. We implement our ADKG protocol and evaluate it using a network of up to 128 nodes in geographically distributed AWS instances. Our evaluation shows that our protocol takes as low as 3 and 9.5 seconds to terminate for 32 and 64 nodes, respectively. Also, each node sends only 0.7 Megabytes and 2.9 Megabytes of data during the two experiments, respectively.","lang":"eng"}],"title":"Practical asynchronous distributed key generation","status":"public","publisher":"Institute of Electrical and Electronics Engineers","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2021/1591"}],"page":"2518-2534","quality_controlled":"1","department":[{"_id":"ElKo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"2022 IEEE Symposium on Security and Privacy","publication_status":"published","language":[{"iso":"eng"}],"_id":"12300"},{"oa":1,"author":[{"last_name":"Doveri","first_name":"Kyveli","full_name":"Doveri, Kyveli"},{"first_name":"Pierre","last_name":"Ganty","full_name":"Ganty, Pierre"},{"last_name":"Mazzocchi","first_name":"Nicolas Adrien","full_name":"Mazzocchi, Nicolas Adrien","id":"b26baa86-3308-11ec-87b0-8990f34baa85"}],"title":"FORQ-based language inclusion formal testing","status":"public","page":"109-129","quality_controlled":"1","publisher":"Springer Nature","publication":"Computer Aided Verification","intvolume":"     13372","date_published":"2022-08-06T00:00:00Z","date_created":"2023-01-16T10:06:31Z","month":"08","has_accepted_license":"1","volume":13372,"day":"06","citation":{"chicago":"Doveri, Kyveli, Pierre Ganty, and Nicolas Adrien Mazzocchi. “FORQ-Based Language Inclusion Formal Testing.” In <i>Computer Aided Verification</i>, 13372:109–29. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-031-13188-2_6\">https://doi.org/10.1007/978-3-031-13188-2_6</a>.","ama":"Doveri K, Ganty P, Mazzocchi NA. FORQ-based language inclusion formal testing. In: <i>Computer Aided Verification</i>. Vol 13372. Springer Nature; 2022:109-129. doi:<a href=\"https://doi.org/10.1007/978-3-031-13188-2_6\">10.1007/978-3-031-13188-2_6</a>","ista":"Doveri K, Ganty P, Mazzocchi NA. 2022. FORQ-based language inclusion formal testing. Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13372, 109–129.","mla":"Doveri, Kyveli, et al. “FORQ-Based Language Inclusion Formal Testing.” <i>Computer Aided Verification</i>, vol. 13372, Springer Nature, 2022, pp. 109–29, doi:<a href=\"https://doi.org/10.1007/978-3-031-13188-2_6\">10.1007/978-3-031-13188-2_6</a>.","short":"K. Doveri, P. Ganty, N.A. Mazzocchi, in:, Computer Aided Verification, Springer Nature, 2022, pp. 109–129.","apa":"Doveri, K., Ganty, P., &#38; Mazzocchi, N. A. (2022). FORQ-based language inclusion formal testing. In <i>Computer Aided Verification</i> (Vol. 13372, pp. 109–129). Haifa, Israel: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-13188-2_6\">https://doi.org/10.1007/978-3-031-13188-2_6</a>","ieee":"K. Doveri, P. Ganty, and N. A. Mazzocchi, “FORQ-based language inclusion formal testing,” in <i>Computer Aided Verification</i>, Haifa, Israel, 2022, vol. 13372, pp. 109–129."},"file":[{"content_type":"application/pdf","access_level":"open_access","creator":"dernst","relation":"main_file","file_id":"12465","file_size":497682,"date_created":"2023-01-30T12:51:02Z","checksum":"edc363b1be5447a09063e115c247918a","date_updated":"2023-01-30T12:51:02Z","success":1,"file_name":"2022_LNCS_Doveri.pdf"}],"date_updated":"2023-09-05T15:13:36Z","conference":{"name":"CAV: Computer Aided Verification","location":"Haifa, Israel","start_date":"2022-08-07","end_date":"2022-08-10"},"file_date_updated":"2023-01-30T12:51:02Z","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031131875"],"issn":["0302-9743"],"eisbn":["9783031131882"]},"article_processing_charge":"No","acknowledgement":"This work was partially funded by the ESF Investing in your future, the Madrid regional project S2018/TCS-4339 BLOQUES, the Spanish project PGC2018-102210-B-I00 BOSCO, the Ramón y Cajal fellowship RYC-2016-20281, and the ERC grant PR1001ERC02.","alternative_title":["LNCS"],"abstract":[{"text":"We propose a novel algorithm to decide the language inclusion between (nondeterministic) Büchi automata, a PSPACE-complete problem. Our approach, like others before, leverage a notion of quasiorder to prune the search for a counterexample by discarding candidates which are subsumed by others for the quasiorder. Discarded candidates are guaranteed to not compromise the completeness of the algorithm. The novelty of our work lies in the quasiorder used to discard candidates. We introduce FORQs (family of right quasiorders) that we obtain by adapting the notion of family of right congruences put forward by Maler and Staiger in 1993. We define a FORQ-based inclusion algorithm which we prove correct and instantiate it for a specific FORQ, called the structural FORQ, induced by the Büchi automaton to the right of the inclusion sign. The resulting implementation, called FORKLIFT, scales up better than the state-of-the-art on a variety of benchmarks including benchmarks from program verification and theorem proving for word combinatorics. Artifact: https://doi.org/10.5281/zenodo.6552870","lang":"eng"}],"ec_funded":1,"project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"external_id":{"arxiv":["2207.13549"],"isi":["000870310500006"]},"department":[{"_id":"ToHe"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"_id":"12302","publication_status":"published","ddc":["000"],"oa_version":"Published Version","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.1007/978-3-031-13188-2_6","isi":1,"arxiv":1,"type":"conference","year":"2022","scopus_import":"1"},{"oa_version":"Preprint","doi":"10.1007/978-3-030-82007-7_8","year":"2022","type":"book_chapter","arxiv":1,"scopus_import":"1","publication_identifier":{"isbn":["9783030820060"],"eissn":["2297-024X"],"issn":["2297-0215"],"eisbn":["9783030820077"]},"article_processing_charge":"No","acknowledgement":"I.M. thanks Zhijie Dong for long-term discussions on the material that entered this work. We thank Misha Finkelberg for pointing out errors in earlier versions. His advice and his insistence have led to a much better paper. A part of the writing was done at the conference at IST (Vienna) attended by all coauthors. We therefore thank the organizers of the conference and the support of ERC Advanced Grant Arithmetic and Physics of Higgs moduli spaces No. 320593. The work of I.M. was partially supported by NSF grants. The work of Y.Y. was partially supported by the Australian Research Council (ARC) via the award DE190101231. The work of G.Z. was partially supported by ARC via the award DE190101222.","alternative_title":["Trends in Mathematics"],"abstract":[{"lang":"eng","text":"We construct for each choice of a quiver Q, a cohomology theory A, and a poset P a “loop Grassmannian” GP(Q,A). This generalizes loop Grassmannians of semisimple groups and the loop Grassmannians of based quadratic forms. The addition of a “dilation” torus D⊆G2m gives a quantization GPD(Q,A). This construction is motivated by the program of introducing an inner cohomology theory in algebraic geometry adequate for the Geometric Langlands program (Mirković, Some extensions of the notion of loop Grassmannians. Rad Hrvat. Akad. Znan. Umjet. Mat. Znan., the Mardešić issue. No. 532, 53–74, 2017) and on the construction of affine quantum groups from generalized cohomology theories (Yang and Zhao, Quiver varieties and elliptic quantum groups, preprint. arxiv1708.01418)."}],"edition":"1","ec_funded":1,"project":[{"name":"Arithmetic and physics of Higgs moduli spaces","call_identifier":"FP7","grant_number":"320593","_id":"25E549F4-B435-11E9-9278-68D0E5697425"}],"external_id":{"arxiv":["1810.10095"]},"series_title":"TM","department":[{"_id":"TaHa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12303","language":[{"iso":"eng"}],"publication_status":"published","date_published":"2022-06-16T00:00:00Z","date_created":"2023-01-16T10:06:41Z","month":"06","place":"Cham","day":"16","citation":{"mla":"Mirković, Ivan, et al. “Loop Grassmannians of Quivers and Affine Quantum Groups.” <i>Representation Theory and Algebraic Geometry</i>, edited by Vladimir Baranovskky et al., 1st ed., Springer Nature; Birkhäuser, 2022, pp. 347–92, doi:<a href=\"https://doi.org/10.1007/978-3-030-82007-7_8\">10.1007/978-3-030-82007-7_8</a>.","ama":"Mirković I, Yang Y, Zhao G. Loop Grassmannians of Quivers and Affine Quantum Groups. In: Baranovskky V, Guay N, Schedler T, eds. <i>Representation Theory and Algebraic Geometry</i>. 1st ed. TM. Cham: Springer Nature; Birkhäuser; 2022:347-392. doi:<a href=\"https://doi.org/10.1007/978-3-030-82007-7_8\">10.1007/978-3-030-82007-7_8</a>","ista":"Mirković I, Yang Y, Zhao G. 2022.Loop Grassmannians of Quivers and Affine Quantum Groups. In: Representation Theory and Algebraic Geometry. Trends in Mathematics, , 347–392.","chicago":"Mirković, Ivan, Yaping Yang, and Gufang Zhao. “Loop Grassmannians of Quivers and Affine Quantum Groups.” In <i>Representation Theory and Algebraic Geometry</i>, edited by Vladimir Baranovskky, Nicolas Guay, and Travis Schedler, 1st ed., 347–92. TM. Cham: Springer Nature; Birkhäuser, 2022. <a href=\"https://doi.org/10.1007/978-3-030-82007-7_8\">https://doi.org/10.1007/978-3-030-82007-7_8</a>.","ieee":"I. Mirković, Y. Yang, and G. Zhao, “Loop Grassmannians of Quivers and Affine Quantum Groups,” in <i>Representation Theory and Algebraic Geometry</i>, 1st ed., V. Baranovskky, N. Guay, and T. Schedler, Eds. Cham: Springer Nature; Birkhäuser, 2022, pp. 347–392.","apa":"Mirković, I., Yang, Y., &#38; Zhao, G. (2022). Loop Grassmannians of Quivers and Affine Quantum Groups. In V. Baranovskky, N. Guay, &#38; T. Schedler (Eds.), <i>Representation Theory and Algebraic Geometry</i> (1st ed., pp. 347–392). Cham: Springer Nature; Birkhäuser. <a href=\"https://doi.org/10.1007/978-3-030-82007-7_8\">https://doi.org/10.1007/978-3-030-82007-7_8</a>","short":"I. Mirković, Y. Yang, G. Zhao, in:, V. Baranovskky, N. Guay, T. Schedler (Eds.), Representation Theory and Algebraic Geometry, 1st ed., Springer Nature; Birkhäuser, Cham, 2022, pp. 347–392."},"date_updated":"2023-01-27T07:07:31Z","editor":[{"last_name":"Baranovskky","first_name":"Vladimir","full_name":"Baranovskky, Vladimir"},{"full_name":"Guay, Nicolas","last_name":"Guay","first_name":"Nicolas"},{"full_name":"Schedler, Travis","first_name":"Travis","last_name":"Schedler"}],"oa":1,"author":[{"first_name":"Ivan","last_name":"Mirković","full_name":"Mirković, Ivan"},{"full_name":"Yang, Yaping","last_name":"Yang","first_name":"Yaping"},{"last_name":"Zhao","first_name":"Gufang","full_name":"Zhao, Gufang","id":"2BC2AC5E-F248-11E8-B48F-1D18A9856A87"}],"title":"Loop Grassmannians of Quivers and Affine Quantum Groups","status":"public","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1810.10095","open_access":"1"}],"quality_controlled":"1","page":"347-392","publisher":"Springer Nature; Birkhäuser","publication":"Representation Theory and Algebraic Geometry"},{"year":"2022","arxiv":1,"isi":1,"type":"journal_article","scopus_import":"1","doi":"10.1080/03605302.2022.2056702","oa_version":"Preprint","_id":"12304","language":[{"iso":"eng"}],"publication_status":"published","department":[{"_id":"JuFi"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","external_id":{"arxiv":["1907.05342"],"isi":["000805689800001"]},"abstract":[{"lang":"eng","text":"We establish sharp criteria for the instantaneous propagation of free boundaries in solutions to the thin-film equation. The criteria are formulated in terms of the initial distribution of mass (as opposed to previous almost-optimal results), reflecting the fact that mass is a locally conserved quantity for the thin-film equation. In the regime of weak slippage, our criteria are at the same time necessary and sufficient. The proof of our upper bounds on free boundary propagation is based on a strategy of “propagation of degeneracy” down to arbitrarily small spatial scales: We combine estimates on the local mass and estimates on energies to show that “degeneracy” on a certain space-time cylinder entails “degeneracy” on a spatially smaller space-time cylinder with the same time horizon. The derivation of our lower bounds on free boundary propagation is based on a combination of a monotone quantity and almost optimal estimates established previously by the second author with a new estimate connecting motion of mass to entropy production."}],"article_processing_charge":"No","acknowledgement":"N. De Nitti acknowledges the kind hospitality of IST Austria within the framework of the ISTernship Summer Program 2018, during which most of the present article was written. N. DeNitti has received funding by The Austrian Agency for International Cooperation in Education &Research (OeAD-GmbH) via its financial support of the ISTernship Summer Program 2018. N.De Nitti would also like to thank Giuseppe Coclite, Giuseppe Devillanova, Giuseppe Florio, Sebastian Hensel, and Francesco Maddalena for several helpful conversations on topics related to this work.","publication_identifier":{"eissn":["1532-4133"],"issn":["0360-5302"]},"date_updated":"2023-08-04T10:34:31Z","day":"01","citation":{"mla":"De Nitti, Nicola, and Julian L. Fischer. “Sharp Criteria for the Waiting Time Phenomenon in Solutions to the Thin-Film Equation.” <i>Communications in Partial Differential Equations</i>, vol. 47, no. 7, Taylor &#38; Francis, 2022, pp. 1394–434, doi:<a href=\"https://doi.org/10.1080/03605302.2022.2056702\">10.1080/03605302.2022.2056702</a>.","ista":"De Nitti N, Fischer JL. 2022. Sharp criteria for the waiting time phenomenon in solutions to the thin-film equation. Communications in Partial Differential Equations. 47(7), 1394–1434.","ama":"De Nitti N, Fischer JL. Sharp criteria for the waiting time phenomenon in solutions to the thin-film equation. <i>Communications in Partial Differential Equations</i>. 2022;47(7):1394-1434. doi:<a href=\"https://doi.org/10.1080/03605302.2022.2056702\">10.1080/03605302.2022.2056702</a>","chicago":"De Nitti, Nicola, and Julian L Fischer. “Sharp Criteria for the Waiting Time Phenomenon in Solutions to the Thin-Film Equation.” <i>Communications in Partial Differential Equations</i>. Taylor &#38; Francis, 2022. <a href=\"https://doi.org/10.1080/03605302.2022.2056702\">https://doi.org/10.1080/03605302.2022.2056702</a>.","ieee":"N. De Nitti and J. L. Fischer, “Sharp criteria for the waiting time phenomenon in solutions to the thin-film equation,” <i>Communications in Partial Differential Equations</i>, vol. 47, no. 7. Taylor &#38; Francis, pp. 1394–1434, 2022.","apa":"De Nitti, N., &#38; Fischer, J. L. (2022). Sharp criteria for the waiting time phenomenon in solutions to the thin-film equation. <i>Communications in Partial Differential Equations</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/03605302.2022.2056702\">https://doi.org/10.1080/03605302.2022.2056702</a>","short":"N. De Nitti, J.L. Fischer, Communications in Partial Differential Equations 47 (2022) 1394–1434."},"article_type":"original","volume":47,"month":"07","date_created":"2023-01-16T10:06:50Z","date_published":"2022-07-01T00:00:00Z","issue":"7","publication":"Communications in Partial Differential Equations","intvolume":"        47","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1907.05342","open_access":"1"}],"keyword":["Applied Mathematics","Analysis"],"page":"1394-1434","quality_controlled":"1","publisher":"Taylor & Francis","status":"public","title":"Sharp criteria for the waiting time phenomenon in solutions to the thin-film equation","author":[{"first_name":"Nicola","last_name":"De Nitti","full_name":"De Nitti, Nicola"},{"full_name":"Fischer, Julian L","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","last_name":"Fischer","orcid":"0000-0002-0479-558X","first_name":"Julian L"}],"oa":1},{"status":"public","title":"Convergence of the Allen--Cahn equation with a nonlinear Robin boundary condition to mean curvature flow with contact angle close to 90°","author":[{"first_name":"Helmut","last_name":"Abels","full_name":"Abels, Helmut"},{"last_name":"Moser","first_name":"Maximilian","id":"a60047a9-da77-11eb-85b4-c4dc385ebb8c","full_name":"Moser, Maximilian"}],"oa":1,"issue":"1","publication":"SIAM Journal on Mathematical Analysis","intvolume":"        54","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2105.08434"}],"page":"114-172","quality_controlled":"1","keyword":["Applied Mathematics","Computational Mathematics","Analysis"],"publisher":"Society for Industrial and Applied Mathematics","article_type":"original","volume":54,"month":"01","date_published":"2022-01-04T00:00:00Z","date_created":"2023-01-16T10:07:00Z","date_updated":"2023-08-04T10:34:56Z","citation":{"apa":"Abels, H., &#38; Moser, M. (2022). Convergence of the Allen--Cahn equation with a nonlinear Robin boundary condition to mean curvature flow with contact angle close to 90°. <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/21m1424925\">https://doi.org/10.1137/21m1424925</a>","short":"H. Abels, M. Moser, SIAM Journal on Mathematical Analysis 54 (2022) 114–172.","ieee":"H. Abels and M. Moser, “Convergence of the Allen--Cahn equation with a nonlinear Robin boundary condition to mean curvature flow with contact angle close to 90°,” <i>SIAM Journal on Mathematical Analysis</i>, vol. 54, no. 1. Society for Industrial and Applied Mathematics, pp. 114–172, 2022.","chicago":"Abels, Helmut, and Maximilian Moser. “Convergence of the Allen--Cahn Equation with a Nonlinear Robin Boundary Condition to Mean Curvature Flow with Contact Angle Close to 90°.” <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics, 2022. <a href=\"https://doi.org/10.1137/21m1424925\">https://doi.org/10.1137/21m1424925</a>.","ista":"Abels H, Moser M. 2022. Convergence of the Allen--Cahn equation with a nonlinear Robin boundary condition to mean curvature flow with contact angle close to 90°. SIAM Journal on Mathematical Analysis. 54(1), 114–172.","ama":"Abels H, Moser M. Convergence of the Allen--Cahn equation with a nonlinear Robin boundary condition to mean curvature flow with contact angle close to 90°. <i>SIAM Journal on Mathematical Analysis</i>. 2022;54(1):114-172. doi:<a href=\"https://doi.org/10.1137/21m1424925\">10.1137/21m1424925</a>","mla":"Abels, Helmut, and Maximilian Moser. “Convergence of the Allen--Cahn Equation with a Nonlinear Robin Boundary Condition to Mean Curvature Flow with Contact Angle Close to 90°.” <i>SIAM Journal on Mathematical Analysis</i>, vol. 54, no. 1, Society for Industrial and Applied Mathematics, 2022, pp. 114–72, doi:<a href=\"https://doi.org/10.1137/21m1424925\">10.1137/21m1424925</a>."},"day":"04","abstract":[{"text":"This paper is concerned with the sharp interface limit for the Allen--Cahn equation with a nonlinear Robin boundary condition in a bounded smooth domain Ω⊂\\R2. We assume that a diffuse interface already has developed and that it is in contact with the boundary ∂Ω. The boundary condition is designed in such a way that the limit problem is given by the mean curvature flow with constant α-contact angle. For α close to 90° we prove a local in time convergence result for well-prepared initial data for times when a smooth solution to the limit problem exists. Based on the latter we construct a suitable curvilinear coordinate system and carry out a rigorous asymptotic expansion for the Allen--Cahn equation with the nonlinear Robin boundary condition. Moreover, we show a spectral estimate for the corresponding linearized Allen--Cahn operator and with its aid we derive strong norm estimates for the difference of the exact and approximate solutions using a Gronwall-type argument.","lang":"eng"}],"article_processing_charge":"No","publication_identifier":{"issn":["0036-1410"],"eissn":["1095-7154"]},"language":[{"iso":"eng"}],"_id":"12305","publication_status":"published","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"JuFi"}],"external_id":{"isi":["000762768000004"],"arxiv":["2105.08434"]},"doi":"10.1137/21m1424925","oa_version":"Preprint","type":"journal_article","isi":1,"year":"2022","arxiv":1,"scopus_import":"1"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"HeEd"},{"_id":"GradSch"}],"_id":"12307","language":[{"iso":"eng"}],"publication_status":"published","article_processing_charge":"No","publication_identifier":{"eissn":["1935-4053"],"issn":["1051-1970"]},"abstract":[{"lang":"eng","text":"Point-set topology is among the most abstract branches of mathematics in that it lacks tangible notions of distance, length, magnitude, order, and size. There is no shape, no geometry, no algebra, and no direction. Everything we are used to visualizing is gone. In the teaching and learning of mathematics, this can present a conundrum. Yet, this very property makes point set topology perfect for teaching and learning abstract mathematical concepts. It clears our minds of preconceived intuitions and expectations and forces us to think in new and creative ways. In this paper, we present guided investigations into topology through questions and thinking strategies that open up fascinating problems. They are intended for faculty who already teach or are thinking about teaching a class in topology or abstract mathematical reasoning for undergraduates. They can be used to build simple to challenging projects in topology, proofs, honors programs, and research experiences."}],"year":"2022","type":"journal_article","scopus_import":"1","oa_version":"None","doi":"10.1080/10511970.2021.1872750","publication":"PRIMUS","intvolume":"        32","page":"593-609","keyword":["Education","General Mathematics"],"quality_controlled":"1","publisher":"Taylor & Francis","issue":"5","author":[{"last_name":"Shipman","first_name":"Barbara A.","full_name":"Shipman, Barbara A."},{"orcid":"0000-0002-6862-208X","last_name":"Stephenson","first_name":"Elizabeth R","full_name":"Stephenson, Elizabeth R","id":"2D04F932-F248-11E8-B48F-1D18A9856A87"}],"status":"public","title":"Tangible topology through the lens of limits","date_updated":"2023-01-30T13:02:30Z","citation":{"chicago":"Shipman, Barbara A., and Elizabeth R Stephenson. “Tangible Topology through the Lens of Limits.” <i>PRIMUS</i>. Taylor &#38; Francis, 2022. <a href=\"https://doi.org/10.1080/10511970.2021.1872750\">https://doi.org/10.1080/10511970.2021.1872750</a>.","mla":"Shipman, Barbara A., and Elizabeth R. Stephenson. “Tangible Topology through the Lens of Limits.” <i>PRIMUS</i>, vol. 32, no. 5, Taylor &#38; Francis, 2022, pp. 593–609, doi:<a href=\"https://doi.org/10.1080/10511970.2021.1872750\">10.1080/10511970.2021.1872750</a>.","ama":"Shipman BA, Stephenson ER. Tangible topology through the lens of limits. <i>PRIMUS</i>. 2022;32(5):593-609. doi:<a href=\"https://doi.org/10.1080/10511970.2021.1872750\">10.1080/10511970.2021.1872750</a>","ista":"Shipman BA, Stephenson ER. 2022. Tangible topology through the lens of limits. PRIMUS. 32(5), 593–609.","ieee":"B. A. Shipman and E. R. Stephenson, “Tangible topology through the lens of limits,” <i>PRIMUS</i>, vol. 32, no. 5. Taylor &#38; Francis, pp. 593–609, 2022.","apa":"Shipman, B. A., &#38; Stephenson, E. R. (2022). Tangible topology through the lens of limits. <i>PRIMUS</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/10511970.2021.1872750\">https://doi.org/10.1080/10511970.2021.1872750</a>","short":"B.A. Shipman, E.R. Stephenson, PRIMUS 32 (2022) 593–609."},"day":"28","month":"05","date_created":"2023-01-16T10:07:21Z","date_published":"2022-05-28T00:00:00Z","volume":32,"article_type":"original"},{"abstract":[{"lang":"eng","text":"Activity of sensory neurons is driven not only by external stimuli but also by feedback signals from higher brain areas. Attention is one particularly important internal signal whose presumed role is to modulate sensory representations such that they only encode information currently relevant to the organism at minimal cost. This hypothesis has, however, not yet been expressed in a normative computational framework. Here, by building on normative principles of probabilistic inference and efficient coding, we developed a model of dynamic population coding in the visual cortex. By continuously adapting the sensory code to changing demands of the perceptual observer, an attention-like modulation emerges. This modulation can dramatically reduce the amount of neural activity without deteriorating the accuracy of task-specific inferences. Our results suggest that a range of seemingly disparate cortical phenomena such as intrinsic gain modulation, attention-related tuning modulation, and response variability could be manifestations of the same underlying principles, which combine efficient sensory coding with optimal probabilistic inference in dynamic environments."}],"ec_funded":1,"file_date_updated":"2023-01-23T08:46:40Z","publication_identifier":{"eissn":["1545-7885"]},"article_processing_charge":"No","acknowledgement":"We thank Robbe Goris for generously providing figures from his work and Ann M. Hermundstad for helpful discussions.\r\nGT & WM were supported by the Austrian Science Fund Standalone Grant P 34015 \"Efficient Coding with Biophysical Realism\" (https://pf.fwf.ac.at/) WM was additionally supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411 (https://ec.europa.eu/research/mariecurieactions/). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.","language":[{"iso":"eng"}],"_id":"12332","publication_status":"published","ddc":["570"],"project":[{"_id":"626c45b5-2b32-11ec-9570-e509828c1ba6","grant_number":"P34015","name":"Efficient coding with biophysical realism"},{"call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships"}],"external_id":{"isi":["000925192000001"]},"department":[{"_id":"GaTk"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.1371/journal.pbio.3001889","oa_version":"Published Version","isi":1,"year":"2022","type":"journal_article","scopus_import":"1","title":"Efficient coding theory of dynamic attentional modulation","status":"public","oa":1,"author":[{"first_name":"Wiktor F","last_name":"Mlynarski","full_name":"Mlynarski, Wiktor F","id":"358A453A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Gašper","last_name":"Tkačik","orcid":"1","full_name":"Tkačik, Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"}],"issue":"12","quality_controlled":"1","page":"e3001889","publisher":"Public Library of Science","publication":"PLoS Biology","intvolume":"        20","has_accepted_license":"1","article_type":"original","volume":20,"date_published":"2022-12-21T00:00:00Z","date_created":"2023-01-22T23:00:55Z","month":"12","day":"21","citation":{"ama":"Mlynarski WF, Tkačik G. Efficient coding theory of dynamic attentional modulation. <i>PLoS Biology</i>. 2022;20(12):e3001889. doi:<a href=\"https://doi.org/10.1371/journal.pbio.3001889\">10.1371/journal.pbio.3001889</a>","ista":"Mlynarski WF, Tkačik G. 2022. Efficient coding theory of dynamic attentional modulation. PLoS Biology. 20(12), e3001889.","mla":"Mlynarski, Wiktor F., and Gašper Tkačik. “Efficient Coding Theory of Dynamic Attentional Modulation.” <i>PLoS Biology</i>, vol. 20, no. 12, Public Library of Science, 2022, p. e3001889, doi:<a href=\"https://doi.org/10.1371/journal.pbio.3001889\">10.1371/journal.pbio.3001889</a>.","chicago":"Mlynarski, Wiktor F, and Gašper Tkačik. “Efficient Coding Theory of Dynamic Attentional Modulation.” <i>PLoS Biology</i>. Public Library of Science, 2022. <a href=\"https://doi.org/10.1371/journal.pbio.3001889\">https://doi.org/10.1371/journal.pbio.3001889</a>.","short":"W.F. Mlynarski, G. Tkačik, PLoS Biology 20 (2022) e3001889.","apa":"Mlynarski, W. F., &#38; Tkačik, G. (2022). Efficient coding theory of dynamic attentional modulation. <i>PLoS Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.3001889\">https://doi.org/10.1371/journal.pbio.3001889</a>","ieee":"W. F. Mlynarski and G. Tkačik, “Efficient coding theory of dynamic attentional modulation,” <i>PLoS Biology</i>, vol. 20, no. 12. Public Library of Science, p. e3001889, 2022."},"file":[{"content_type":"application/pdf","access_level":"open_access","file_size":4248838,"file_id":"12337","creator":"dernst","relation":"main_file","date_created":"2023-01-23T08:46:40Z","checksum":"5d7f1111a87e5f2c1bf92f8886738894","date_updated":"2023-01-23T08:46:40Z","file_name":"2022_PloSBiology_Mlynarski.pdf","success":1}],"date_updated":"2023-08-03T14:23:49Z"},{"date_created":"2023-01-22T23:00:55Z","date_published":"2022-12-22T00:00:00Z","month":"12","has_accepted_license":"1","volume":11,"article_type":"original","day":"22","citation":{"ieee":"I. Tomanek and C. C. Guet, “Adaptation dynamics between copynumber and point mutations,” <i>eLife</i>, vol. 11. eLife Sciences Publications, 2022.","short":"I. Tomanek, C.C. Guet, ELife 11 (2022).","apa":"Tomanek, I., &#38; Guet, C. C. (2022). Adaptation dynamics between copynumber and point mutations. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/ELIFE.82240\">https://doi.org/10.7554/ELIFE.82240</a>","chicago":"Tomanek, Isabella, and Calin C Guet. “Adaptation Dynamics between Copynumber and Point Mutations.” <i>ELife</i>. eLife Sciences Publications, 2022. <a href=\"https://doi.org/10.7554/ELIFE.82240\">https://doi.org/10.7554/ELIFE.82240</a>.","mla":"Tomanek, Isabella, and Calin C. Guet. “Adaptation Dynamics between Copynumber and Point Mutations.” <i>ELife</i>, vol. 11, e82240, eLife Sciences Publications, 2022, doi:<a href=\"https://doi.org/10.7554/ELIFE.82240\">10.7554/ELIFE.82240</a>.","ista":"Tomanek I, Guet CC. 2022. Adaptation dynamics between copynumber and point mutations. eLife. 11, e82240.","ama":"Tomanek I, Guet CC. Adaptation dynamics between copynumber and point mutations. <i>eLife</i>. 2022;11. doi:<a href=\"https://doi.org/10.7554/ELIFE.82240\">10.7554/ELIFE.82240</a>"},"file":[{"date_updated":"2023-01-23T08:56:21Z","success":1,"file_name":"2022_eLife_Tomanek.pdf","checksum":"9321fd5f06ff59d5e2d33daee84b3da1","file_size":8835954,"creator":"dernst","file_id":"12338","relation":"main_file","date_created":"2023-01-23T08:56:21Z","content_type":"application/pdf","access_level":"open_access"}],"date_updated":"2023-08-03T14:23:07Z","related_material":{"link":[{"relation":"software","url":"https://doi.org/10.5281/zenodo.6974122"}],"record":[{"status":"public","relation":"research_data","id":"12339"}]},"oa":1,"author":[{"orcid":"0000-0001-6197-363X","last_name":"Tomanek","first_name":"Isabella","full_name":"Tomanek, Isabella","id":"3981F020-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Guet","orcid":"0000-0001-6220-2052","first_name":"Calin C","full_name":"Guet, Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"}],"title":"Adaptation dynamics between copynumber and point mutations","article_number":"e82240","status":"public","quality_controlled":"1","publisher":"eLife Sciences Publications","publication":"eLife","intvolume":"        11","oa_version":"Published Version","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.7554/ELIFE.82240","type":"journal_article","year":"2022","isi":1,"scopus_import":"1","file_date_updated":"2023-01-23T08:56:21Z","publication_identifier":{"eissn":["2050-084X"]},"article_processing_charge":"No","acknowledgement":"We are grateful to N Barton, F Kondrashov, M Lagator, M Pleska, R Roemhild, D Siekhaus, and G\r\nTkacik for input on the manuscript and to K Tomasek for help with flow cytometry.","abstract":[{"text":"Together, copy-number and point mutations form the basis for most evolutionary novelty, through the process of gene duplication and divergence. While a plethora of genomic data reveals the long-term fate of diverging coding sequences and their cis-regulatory elements, little is known about the early dynamics around the duplication event itself. In microorganisms, selection for increased gene expression often drives the expansion of gene copy-number mutations, which serves as a crude adaptation, prior to divergence through refining point mutations. Using a simple synthetic genetic reporter system that can distinguish between copy-number and point mutations, we study their early and transient adaptive dynamics in real time in Escherichia coli. We find two qualitatively different routes of adaptation, depending on the level of functional improvement needed. In conditions of high gene expression demand, the two mutation types occur as a combination. However, under low gene expression demand, copy-number and point mutations are mutually exclusive; here, owing to their higher frequency, adaptation is dominated by copy-number mutations, in a process we term amplification hindrance. Ultimately, due to high reversal rates and pleiotropic cost, copy-number mutations may not only serve as a crude and transient adaptation, but also constrain sequence divergence over evolutionary time scales.","lang":"eng"}],"external_id":{"isi":["000912674700001"]},"department":[{"_id":"CaGu"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"12333","language":[{"iso":"eng"}],"ddc":["570"],"publication_status":"published"}]