[{"abstract":[{"lang":"eng","text":"Finding a feasible scheme for testing the quantum mechanical nature of the gravitational interaction has been attracting an increasing level of attention. Gravity mediated entanglement generation so far appears to be the key ingredient for a potential experiment. In a recent proposal [D. Carney et al., PRX Quantum 2, 030330 (2021)] combining an atom interferometer with a low-frequency mechanical oscillator, a coherence revival test is proposed for verifying this entanglement generation. With measurements performed only on the atoms, this protocol bypasses the need for correlation measurements. Here, we explore formulations of such a protocol, and specifically find that in the envisioned regime of operation with high thermal excitation, semiclassical models, where there is no concept of entanglement, also give the same experimental signatures. We elucidate in a fully quantum mechanical calculation that entanglement is not the source of the revivals in the relevant parameter regime. We argue that, in its current form, the suggested test is only relevant if the oscillator is nearly in a pure quantum state, and in this regime the effects are too small to be measurable. We further discuss potential open ends. The results highlight the importance and subtleties of explicitly considering how the quantum case differs from the classical expectations when testing for the quantum mechanical nature of a physical system."}],"title":"Constraints on probing quantum coherence to infer gravitational entanglement","department":[{"_id":"OnHo"}],"publication":"Physical Review Research","publisher":"American Physical Society","oa_version":"Published Version","date_created":"2022-01-23T23:01:27Z","status":"public","acknowledgement":"O.H. is supported by Institute of Science and Technology Austria. The author thanks Jess Riedel for discussions.","oa":1,"article_type":"original","issue":"1","citation":{"chicago":"Hosten, Onur. “Constraints on Probing Quantum Coherence to Infer Gravitational Entanglement.” <i>Physical Review Research</i>. American Physical Society, 2022. <a href=\"https://doi.org/10.1103/PhysRevResearch.4.013023\">https://doi.org/10.1103/PhysRevResearch.4.013023</a>.","ieee":"O. Hosten, “Constraints on probing quantum coherence to infer gravitational entanglement,” <i>Physical Review Research</i>, vol. 4, no. 1. American Physical Society, 2022.","apa":"Hosten, O. (2022). Constraints on probing quantum coherence to infer gravitational entanglement. <i>Physical Review Research</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevResearch.4.013023\">https://doi.org/10.1103/PhysRevResearch.4.013023</a>","ama":"Hosten O. Constraints on probing quantum coherence to infer gravitational entanglement. <i>Physical Review Research</i>. 2022;4(1). doi:<a href=\"https://doi.org/10.1103/PhysRevResearch.4.013023\">10.1103/PhysRevResearch.4.013023</a>","mla":"Hosten, Onur. “Constraints on Probing Quantum Coherence to Infer Gravitational Entanglement.” <i>Physical Review Research</i>, vol. 4, no. 1, 013023, American Physical Society, 2022, doi:<a href=\"https://doi.org/10.1103/PhysRevResearch.4.013023\">10.1103/PhysRevResearch.4.013023</a>.","short":"O. Hosten, Physical Review Research 4 (2022).","ista":"Hosten O. 2022. Constraints on probing quantum coherence to infer gravitational entanglement. Physical Review Research. 4(1), 013023."},"publication_identifier":{"issn":["2643-1564"]},"volume":4,"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"10652","has_accepted_license":"1","year":"2022","date_published":"2022-01-10T00:00:00Z","author":[{"first_name":"Onur","orcid":"0000-0002-2031-204X","last_name":"Hosten","full_name":"Hosten, Onur","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2022-05-16T11:21:38Z","doi":"10.1103/PhysRevResearch.4.013023","article_processing_charge":"Yes (via OA deal)","scopus_import":"1","quality_controlled":"1","file_date_updated":"2022-01-24T11:12:44Z","article_number":"013023","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"day":"10","ddc":["530"],"language":[{"iso":"eng"}],"month":"01","intvolume":"         4","publication_status":"published","file":[{"file_id":"10660","date_updated":"2022-01-24T11:12:44Z","file_size":236329,"file_name":"2022_PhysRevResearch_Hosten.pdf","checksum":"7254d267a0633ca5d63131d345e58686","relation":"main_file","access_level":"open_access","creator":"cchlebak","content_type":"application/pdf","success":1,"date_created":"2022-01-24T11:12:44Z"}]},{"abstract":[{"lang":"eng","text":"Squall lines are known to be the consequence of the interaction of low-level shear with cold pools associated with convective downdrafts. Also, as the magnitude of the shear increases beyond a critical shear, squall lines tend to orient themselves. The existing literature suggests that this orientation reduces incoming wind shear to the squall line, and maintains equilibrium between wind shear and cold pool spreading. Although this theory is widely accepted, very few quantitative studies have been conducted on supercritical regime especially. Here, we test this hypothesis with tropical squall lines obtained by imposing a vertical wind shear in cloud resolving simulations in radiative convective equilibrium. In the sub-critical regime, squall lines are perpendicular to the shear. In the super-critical regime, their orientation maintain the equilibrium, supporting existing theories. We also find that as shear increases, cold pools become more intense. However, this intensification has little impact on squall line orientation."}],"publication":"Geophysical Research Letters","department":[{"_id":"CaMu"}],"title":"Shear-convection interactions and orientation of tropical squall lines","publisher":"Wiley","ec_funded":1,"date_created":"2022-01-23T23:01:27Z","oa_version":"Published Version","acknowledgement":"The authors gratefully acknowledge funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation program (Project CLUSTER, Grant Agreement No. 805041), and from the PhD fellowship of Ecole Normale Supérieure de Paris-Saclay. Two supplementary movies are also provided showing the angle detection method and the squall line of the Usfc = 10 m s−1 simulation.","status":"public","oa":1,"issue":"1","external_id":{"isi":["000743989800040"]},"article_type":"original","citation":{"apa":"Abramian, S., Muller, C. J., &#38; Risi, C. (2022). Shear-convection interactions and orientation of tropical squall lines. <i>Geophysical Research Letters</i>. Wiley. <a href=\"https://doi.org/10.1029/2021GL095184\">https://doi.org/10.1029/2021GL095184</a>","ieee":"S. Abramian, C. J. Muller, and C. Risi, “Shear-convection interactions and orientation of tropical squall lines,” <i>Geophysical Research Letters</i>, vol. 49, no. 1. Wiley, 2022.","chicago":"Abramian, Sophie, Caroline J Muller, and Camille Risi. “Shear-Convection Interactions and Orientation of Tropical Squall Lines.” <i>Geophysical Research Letters</i>. Wiley, 2022. <a href=\"https://doi.org/10.1029/2021GL095184\">https://doi.org/10.1029/2021GL095184</a>.","mla":"Abramian, Sophie, et al. “Shear-Convection Interactions and Orientation of Tropical Squall Lines.” <i>Geophysical Research Letters</i>, vol. 49, no. 1, e2021GL095184, Wiley, 2022, doi:<a href=\"https://doi.org/10.1029/2021GL095184\">10.1029/2021GL095184</a>.","short":"S. Abramian, C.J. Muller, C. Risi, Geophysical Research Letters 49 (2022).","ista":"Abramian S, Muller CJ, Risi C. 2022. Shear-convection interactions and orientation of tropical squall lines. Geophysical Research Letters. 49(1), e2021GL095184.","ama":"Abramian S, Muller CJ, Risi C. Shear-convection interactions and orientation of tropical squall lines. <i>Geophysical Research Letters</i>. 2022;49(1). doi:<a href=\"https://doi.org/10.1029/2021GL095184\">10.1029/2021GL095184</a>"},"publication_identifier":{"eissn":["1944-8007"],"issn":["0094-8276"]},"volume":49,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","_id":"10653","has_accepted_license":"1","year":"2022","author":[{"full_name":"Abramian, Sophie","first_name":"Sophie","last_name":"Abramian"},{"first_name":"Caroline J","orcid":"0000-0001-5836-5350","last_name":"Muller","full_name":"Muller, Caroline J","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b"},{"last_name":"Risi","first_name":"Camille","full_name":"Risi, Camille"}],"date_published":"2022-01-16T00:00:00Z","article_processing_charge":"No","doi":"10.1029/2021GL095184","date_updated":"2023-08-02T14:00:17Z","related_material":{"link":[{"relation":"earlier_version","url":"https://doi.org/10.1002/essoar.10507697.1"}]},"scopus_import":"1","quality_controlled":"1","file_date_updated":"2022-01-24T12:14:41Z","article_number":"e2021GL095184","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["550"],"day":"16","isi":1,"month":"01","project":[{"name":"organization of CLoUdS, and implications of Tropical  cyclones and for the Energetics of the tropics, in current and waRming climate","grant_number":"805041","_id":"629205d8-2b32-11ec-9570-e1356ff73576","call_identifier":"H2020"}],"language":[{"iso":"eng"}],"intvolume":"        49","file":[{"file_id":"10662","date_updated":"2022-01-24T12:14:41Z","file_size":1117408,"file_name":"2022_GeophysResearchLet_Abramian.pdf","checksum":"08f88b57b8e409b42e382452cd5f297b","relation":"main_file","creator":"cchlebak","access_level":"open_access","content_type":"application/pdf","success":1,"date_created":"2022-01-24T12:14:41Z"}],"publication_status":"published"},{"year":"2022","_id":"10654","type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","volume":128,"publication_identifier":{"issn":["0031-9007"],"eissn":["1079-7114"]},"citation":{"apa":"Klotz, L., Lemoult, G. M., Avila, K., &#38; Hof, B. (2022). Phase transition to turbulence in spatially extended shear flows. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.128.014502\">https://doi.org/10.1103/PhysRevLett.128.014502</a>","ieee":"L. Klotz, G. M. Lemoult, K. Avila, and B. Hof, “Phase transition to turbulence in spatially extended shear flows,” <i>Physical Review Letters</i>, vol. 128, no. 1. American Physical Society, 2022.","chicago":"Klotz, Lukasz, Grégoire M Lemoult, Kerstin Avila, and Björn Hof. “Phase Transition to Turbulence in Spatially Extended Shear Flows.” <i>Physical Review Letters</i>. American Physical Society, 2022. <a href=\"https://doi.org/10.1103/PhysRevLett.128.014502\">https://doi.org/10.1103/PhysRevLett.128.014502</a>.","short":"L. Klotz, G.M. Lemoult, K. Avila, B. Hof, Physical Review Letters 128 (2022).","mla":"Klotz, Lukasz, et al. “Phase Transition to Turbulence in Spatially Extended Shear Flows.” <i>Physical Review Letters</i>, vol. 128, no. 1, 014502, American Physical Society, 2022, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.128.014502\">10.1103/PhysRevLett.128.014502</a>.","ista":"Klotz L, Lemoult GM, Avila K, Hof B. 2022. Phase transition to turbulence in spatially extended shear flows. Physical Review Letters. 128(1), 014502.","ama":"Klotz L, Lemoult GM, Avila K, Hof B. Phase transition to turbulence in spatially extended shear flows. <i>Physical Review Letters</i>. 2022;128(1). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.128.014502\">10.1103/PhysRevLett.128.014502</a>"},"external_id":{"arxiv":["2111.14894"],"pmid":["35061458"],"isi":["000748271700010"]},"article_type":"original","issue":"1","acknowledgement":"We thank T.Menner, T.Asenov, P. Maier and the Miba machine shop of IST Austria for their valuable support in all technical aspects. We thank Marc Avila for comments on the manuscript. This work was supported by a grant from the Simons Foundation (662960, B.H.). We acknowledge the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013)/ERC Grant Agreement 306589 for financial support. K.A.\r\nacknowledges funding from the Central Research Development Fund of the University of Bremen, grant number ZF04B /2019/FB04 Avila Kerstin (”Independent Project for Postdocs”). L.K. was supported by the European Union’s Horizon 2020 Research and innovation programme under the Marie Sklodowska-Curie grant agreement  No. 754411.\r\n","oa":1,"status":"public","oa_version":"Preprint","date_created":"2022-01-23T23:01:28Z","ec_funded":1,"publisher":"American Physical Society","department":[{"_id":"BjHo"}],"title":"Phase transition to turbulence in spatially extended shear flows","publication":"Physical Review Letters","abstract":[{"lang":"eng","text":"Directed percolation (DP) has recently emerged as a possible solution to the century old puzzle surrounding the transition to turbulence. Multiple model studies reported DP exponents, however, experimental evidence is limited since the largest possible observation times are orders of magnitude shorter than the flows’ characteristic timescales. An exception is cylindrical Couette flow where the limit is not temporal, but rather the realizable system size. We present experiments in a Couette setup of unprecedented azimuthal and axial aspect ratios. Approaching the critical point to within less than 0.1% we determine five critical exponents, all of which are in excellent agreement with the 2+1D DP universality class. The complex dynamics encountered at \r\nthe onset of turbulence can hence be fully rationalized within the framework of statistical mechanics."}],"arxiv":1,"publication_status":"published","intvolume":"       128","main_file_link":[{"url":"https://arxiv.org/abs/2111.14894","open_access":"1"}],"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"},{"name":"Decoding the complexity of turbulence at its origin","grant_number":"306589","_id":"25152F3A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"238598C6-32DE-11EA-91FC-C7463DDC885E","grant_number":"662960","name":"Revisiting the Turbulence Problem Using Statistical Mechanics: Experimental Studies on Transitional and Turbulent Flows"}],"language":[{"iso":"eng"}],"month":"01","isi":1,"day":"05","pmid":1,"acknowledged_ssus":[{"_id":"M-Shop"}],"article_number":"014502","quality_controlled":"1","scopus_import":"1","date_updated":"2023-08-02T13:59:19Z","doi":"10.1103/PhysRevLett.128.014502","article_processing_charge":"No","date_published":"2022-01-05T00:00:00Z","author":[{"first_name":"Lukasz","orcid":"0000-0003-1740-7635","last_name":"Klotz","full_name":"Klotz, Lukasz","id":"2C9AF1C2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Grégoire M","last_name":"Lemoult","full_name":"Lemoult, Grégoire M","id":"4787FE80-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Avila, Kerstin","first_name":"Kerstin","last_name":"Avila"},{"first_name":"Björn","last_name":"Hof","orcid":"0000-0003-2057-2754","full_name":"Hof, Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87"}]},{"scopus_import":"1","quality_controlled":"1","date_published":"2022-04-29T00:00:00Z","author":[{"full_name":"Hanauer, Kathrin","first_name":"Kathrin","last_name":"Hanauer"},{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"full_name":"Schulz, Christian","first_name":"Christian","last_name":"Schulz"}],"article_processing_charge":"No","date_updated":"2023-02-14T08:14:41Z","alternative_title":["LIPIcs"],"doi":"10.4230/LIPIcs.SAND.2022.1","conference":{"start_date":"2022-03-28","location":"Virtual","end_date":"2022-03-30","name":"SAND: Symposium on Algorithmic Foundations of Dynamic Networks"},"article_number":"1","month":"04","language":[{"iso":"eng"}],"day":"29","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPIcs.SAND.2022.1"}],"intvolume":"       221","publication_status":"published","abstract":[{"lang":"eng","text":"In recent years, significant advances have been made in the design and analysis of fully dynamic algorithms. However, these theoretical results have received very little attention from the practical perspective. Few of the algorithms are implemented and tested on real datasets, and their practical potential is far from understood. Here, we present a quick reference guide to recent engineering and theory results in the area of fully dynamic graph algorithms."}],"extern":"1","arxiv":1,"date_created":"2022-08-11T14:35:52Z","oa_version":"Published Version","publication":"1st Symposium on Algorithmic Foundations of Dynamic Networks","title":"Recent advances in fully dynamic graph algorithms","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","citation":{"ama":"Hanauer K, Henzinger MH, Schulz C. Recent advances in fully dynamic graph algorithms. In: <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>. Vol 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.1\">10.4230/LIPIcs.SAND.2022.1</a>","ista":"Hanauer K, Henzinger MH, Schulz C. 2022. Recent advances in fully dynamic graph algorithms. 1st Symposium on Algorithmic Foundations of Dynamic Networks. SAND: Symposium on Algorithmic Foundations of Dynamic Networks, LIPIcs, vol. 221, 1.","mla":"Hanauer, Kathrin, et al. “Recent Advances in Fully Dynamic Graph Algorithms.” <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>, vol. 221, 1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.1\">10.4230/LIPIcs.SAND.2022.1</a>.","short":"K. Hanauer, M.H. Henzinger, C. Schulz, in:, 1st Symposium on Algorithmic Foundations of Dynamic Networks, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","ieee":"K. Hanauer, M. H. Henzinger, and C. Schulz, “Recent advances in fully dynamic graph algorithms,” in <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>, Virtual, 2022, vol. 221.","chicago":"Hanauer, Kathrin, Monika H Henzinger, and Christian Schulz. “Recent Advances in Fully Dynamic Graph Algorithms.” In <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>, Vol. 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.1\">https://doi.org/10.4230/LIPIcs.SAND.2022.1</a>.","apa":"Hanauer, K., Henzinger, M. H., &#38; Schulz, C. (2022). Recent advances in fully dynamic graph algorithms. In <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i> (Vol. 221). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.1\">https://doi.org/10.4230/LIPIcs.SAND.2022.1</a>"},"publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959772242"]},"oa":1,"status":"public","external_id":{"arxiv":["2102.11169"]},"_id":"11808","year":"2022","volume":221,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference"},{"publication_status":"published","main_file_link":[{"url":"https://doi.org/10.4230/LIPIcs.SAND.2022.18","open_access":"1"}],"intvolume":"       221","day":"29","language":[{"iso":"eng"}],"month":"04","article_number":"18","conference":{"start_date":"2022-04-28","location":"Virtual","end_date":"2022-04-30","name":"SAND: Symposium on Algorithmic Foundations of Dynamic Networks"},"doi":"10.4230/LIPIcs.SAND.2022.18","date_updated":"2023-02-14T08:25:42Z","alternative_title":["LIPIcs"],"article_processing_charge":"No","date_published":"2022-04-29T00:00:00Z","author":[{"full_name":"Hanauer, Kathrin","last_name":"Hanauer","first_name":"Kathrin"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H"},{"full_name":"Hua, Qi Cheng","first_name":"Qi Cheng","last_name":"Hua"}],"quality_controlled":"1","scopus_import":"1","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":221,"year":"2022","_id":"11812","external_id":{"arxiv":["2106.15524"]},"status":"public","oa":1,"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959772242"]},"citation":{"ieee":"K. Hanauer, M. H. Henzinger, and Q. C. Hua, “Fully dynamic four-vertex subgraph counting,” in <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>, Virtual, 2022, vol. 221.","chicago":"Hanauer, Kathrin, Monika H Henzinger, and Qi Cheng Hua. “Fully Dynamic Four-Vertex Subgraph Counting.” In <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>, Vol. 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.18\">https://doi.org/10.4230/LIPIcs.SAND.2022.18</a>.","apa":"Hanauer, K., Henzinger, M. H., &#38; Hua, Q. C. (2022). Fully dynamic four-vertex subgraph counting. In <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i> (Vol. 221). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.18\">https://doi.org/10.4230/LIPIcs.SAND.2022.18</a>","ama":"Hanauer K, Henzinger MH, Hua QC. Fully dynamic four-vertex subgraph counting. In: <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>. Vol 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.18\">10.4230/LIPIcs.SAND.2022.18</a>","ista":"Hanauer K, Henzinger MH, Hua QC. 2022. Fully dynamic four-vertex subgraph counting. 1st Symposium on Algorithmic Foundations of Dynamic Networks. SAND: Symposium on Algorithmic Foundations of Dynamic Networks, LIPIcs, vol. 221, 18.","mla":"Hanauer, Kathrin, et al. “Fully Dynamic Four-Vertex Subgraph Counting.” <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>, vol. 221, 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.18\">10.4230/LIPIcs.SAND.2022.18</a>.","short":"K. Hanauer, M.H. Henzinger, Q.C. Hua, in:, 1st Symposium on Algorithmic Foundations of Dynamic Networks, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022."},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","title":"Fully dynamic four-vertex subgraph counting","publication":"1st Symposium on Algorithmic Foundations of Dynamic Networks","oa_version":"Published Version","date_created":"2022-08-12T06:57:55Z","arxiv":1,"extern":"1","abstract":[{"text":"This paper presents a comprehensive study of algorithms for maintaining the number of all connected four-vertex subgraphs in a dynamic graph. Specifically, our algorithms maintain the number of paths of length three in deterministic amortized O(m^{1/2}) update time, and any other connected four-vertex subgraph which is not a clique in deterministic amortized update time O(m^{2/3}). Queries can be answered in constant time. We also study the query times for subgraphs containing an arbitrary edge that is supplied only with the query as well as the case where only subgraphs containing a vertex s that is fixed beforehand are considered. For length-3 paths, paws, 4-cycles, and diamonds our bounds match or are not far from (conditional) lower bounds: Based on the OMv conjecture we show that any dynamic algorithm that detects the existence of paws, diamonds, or 4-cycles or that counts length-3 paths takes update time Ω(m^{1/2-δ}).\r\nAdditionally, for 4-cliques and all connected induced subgraphs, we show a lower bound of Ω(m^{1-δ}) for any small constant δ > 0 for the amortized update time, assuming the static combinatorial 4-clique conjecture holds. This shows that the O(m) algorithm by Eppstein et al. [David Eppstein et al., 2012] for these subgraphs cannot be improved by a polynomial factor.","lang":"eng"}]},{"publication_identifier":{"isbn":["9783031198021"],"eisbn":["9783031198038"]},"citation":{"chicago":"Prach, Bernd, and Christoph Lampert. “Almost-Orthogonal Layers for Efficient General-Purpose Lipschitz Networks.” In <i>Computer Vision – ECCV 2022</i>, 13681:350–65. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-031-19803-8_21\">https://doi.org/10.1007/978-3-031-19803-8_21</a>.","ieee":"B. Prach and C. Lampert, “Almost-orthogonal layers for efficient general-purpose Lipschitz networks,” in <i>Computer Vision – ECCV 2022</i>, Tel Aviv, Israel, 2022, vol. 13681, pp. 350–365.","apa":"Prach, B., &#38; Lampert, C. (2022). Almost-orthogonal layers for efficient general-purpose Lipschitz networks. In <i>Computer Vision – ECCV 2022</i> (Vol. 13681, pp. 350–365). Tel Aviv, Israel: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-19803-8_21\">https://doi.org/10.1007/978-3-031-19803-8_21</a>","ama":"Prach B, Lampert C. Almost-orthogonal layers for efficient general-purpose Lipschitz networks. In: <i>Computer Vision – ECCV 2022</i>. Vol 13681. Springer Nature; 2022:350-365. doi:<a href=\"https://doi.org/10.1007/978-3-031-19803-8_21\">10.1007/978-3-031-19803-8_21</a>","short":"B. Prach, C. Lampert, in:, Computer Vision – ECCV 2022, Springer Nature, 2022, pp. 350–365.","ista":"Prach B, Lampert C. 2022. Almost-orthogonal layers for efficient general-purpose Lipschitz networks. Computer Vision – ECCV 2022. ECCV: European Conference on Computer Vision, LNCS, vol. 13681, 350–365.","mla":"Prach, Bernd, and Christoph Lampert. “Almost-Orthogonal Layers for Efficient General-Purpose Lipschitz Networks.” <i>Computer Vision – ECCV 2022</i>, vol. 13681, Springer Nature, 2022, pp. 350–65, doi:<a href=\"https://doi.org/10.1007/978-3-031-19803-8_21\">10.1007/978-3-031-19803-8_21</a>."},"external_id":{"arxiv":["2208.03160"]},"status":"public","oa":1,"year":"2022","_id":"11839","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","volume":13681,"page":"350-365","abstract":[{"text":"It is a highly desirable property for deep networks to be robust against\r\nsmall input changes. One popular way to achieve this property is by designing\r\nnetworks with a small Lipschitz constant. In this work, we propose a new\r\ntechnique for constructing such Lipschitz networks that has a number of\r\ndesirable properties: it can be applied to any linear network layer\r\n(fully-connected or convolutional), it provides formal guarantees on the\r\nLipschitz constant, it is easy to implement and efficient to run, and it can be\r\ncombined with any training objective and optimization method. In fact, our\r\ntechnique is the first one in the literature that achieves all of these\r\nproperties simultaneously. Our main contribution is a rescaling-based weight\r\nmatrix parametrization that guarantees each network layer to have a Lipschitz\r\nconstant of at most 1 and results in the learned weight matrices to be close to\r\northogonal. Hence we call such layers almost-orthogonal Lipschitz (AOL).\r\nExperiments and ablation studies in the context of image classification with\r\ncertified robust accuracy confirm that AOL layers achieve results that are on\r\npar with most existing methods. Yet, they are simpler to implement and more\r\nbroadly applicable, because they do not require computationally expensive\r\nmatrix orthogonalization or inversion steps as part of the network\r\narchitecture. We provide code at https://github.com/berndprach/AOL.","lang":"eng"}],"arxiv":1,"date_created":"2022-08-12T15:09:47Z","oa_version":"Preprint","publisher":"Springer Nature","publication":"Computer Vision – ECCV 2022","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"title":"Almost-orthogonal layers for efficient general-purpose Lipschitz networks","month":"10","language":[{"iso":"eng"}],"day":"23","publication_status":"published","intvolume":"     13681","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2208.03160","open_access":"1"}],"quality_controlled":"1","scopus_import":"1","article_processing_charge":"No","date_updated":"2023-05-03T08:00:46Z","doi":"10.1007/978-3-031-19803-8_21","alternative_title":["LNCS"],"author":[{"id":"2D561D42-C427-11E9-89B4-9C1AE6697425","full_name":"Prach, Bernd","last_name":"Prach","first_name":"Bernd"},{"first_name":"Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2022-10-23T00:00:00Z","conference":{"start_date":"2022-10-23","location":"Tel Aviv, Israel","end_date":"2022-10-27","name":"ECCV: European Conference on Computer Vision"}},{"title":"Adsorption free energy predicts amyloid protein nucleation rates","department":[{"_id":"AnSa"}],"publication":"Proceedings of the National Academy of Sciences of the United States of America","publisher":"Proceedings of the National Academy of Sciences","oa_version":"Published Version","ec_funded":1,"date_created":"2022-08-14T22:01:45Z","abstract":[{"text":"Primary nucleation is the fundamental event that initiates the conversion of proteins from their normal physiological forms into pathological amyloid aggregates associated with the onset and development of disorders including systemic amyloidosis, as well as the neurodegenerative conditions Alzheimer’s and Parkinson’s diseases. It has become apparent that the presence of surfaces can dramatically modulate nucleation. However, the underlying physicochemical parameters governing this process have been challenging to elucidate, with interfaces in some cases having been found to accelerate aggregation, while in others they can inhibit the kinetics of this process. Here we show through kinetic analysis that for three different fibril-forming proteins, interfaces affect the aggregation reaction mainly through modulating the primary nucleation step. Moreover, we show through direct measurements of the Gibbs free energy of adsorption, combined with theory and coarse-grained computer simulations, that overall nucleation rates are suppressed at high and at low surface interaction strengths but significantly enhanced at intermediate strengths, and we verify these regimes experimentally. Taken together, these results provide a quantitative description of the fundamental process which triggers amyloid formation and shed light on the key factors that control this process.","lang":"eng"}],"volume":119,"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11841","has_accepted_license":"1","year":"2022","acknowledgement":"The research leading to these results has received funding from the European Research Council (ERC) under the European Union’s Seventh Framework Programme (FP7/2007-2013) through the ERC grant PhysProt\r\n(agreement 337969). We are grateful for financial support from the Biotechnology and Biological Sciences Research Council (BBSRC) (T.P.J.K.), the Newman\r\nFoundation (T.P.J.K.), the Wellcome Trust (T.P.J.K. and M.V.), Peterhouse College\r\nCambridge (T.C.T.M.), the ERC Starting Grant (StG) Non-Equilibrium Protein Assembly (NEPA) (A.S.), the Royal Society (A.S.), the Academy of Medical Sciences\r\n(A.S. and J.K.), and the Cambridge Centre for Misfolding Diseases (CMD).","oa":1,"status":"public","external_id":{"isi":["000903753500002"]},"article_type":"original","issue":"31","citation":{"apa":"Toprakcioglu, Z., Kamada, A., Michaels, T. C. T., Xie, M., Krausser, J., Wei, J., … Knowles, T. P. J. (2022). Adsorption free energy predicts amyloid protein nucleation rates. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. Proceedings of the National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.2109718119\">https://doi.org/10.1073/pnas.2109718119</a>","chicago":"Toprakcioglu, Zenon, Ayaka Kamada, Thomas C.T. Michaels, Mengqi Xie, Johannes Krausser, Jiapeng Wei, Anđela Šarić, Michele Vendruscolo, and Tuomas P.J. Knowles. “Adsorption Free Energy Predicts Amyloid Protein Nucleation Rates.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>. Proceedings of the National Academy of Sciences, 2022. <a href=\"https://doi.org/10.1073/pnas.2109718119\">https://doi.org/10.1073/pnas.2109718119</a>.","ieee":"Z. Toprakcioglu <i>et al.</i>, “Adsorption free energy predicts amyloid protein nucleation rates,” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 119, no. 31. Proceedings of the National Academy of Sciences, 2022.","short":"Z. Toprakcioglu, A. Kamada, T.C.T. Michaels, M. Xie, J. Krausser, J. Wei, A. Šarić, M. Vendruscolo, T.P.J. Knowles, Proceedings of the National Academy of Sciences of the United States of America 119 (2022).","mla":"Toprakcioglu, Zenon, et al. “Adsorption Free Energy Predicts Amyloid Protein Nucleation Rates.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 119, no. 31, e2109718119, Proceedings of the National Academy of Sciences, 2022, doi:<a href=\"https://doi.org/10.1073/pnas.2109718119\">10.1073/pnas.2109718119</a>.","ista":"Toprakcioglu Z, Kamada A, Michaels TCT, Xie M, Krausser J, Wei J, Šarić A, Vendruscolo M, Knowles TPJ. 2022. Adsorption free energy predicts amyloid protein nucleation rates. Proceedings of the National Academy of Sciences of the United States of America. 119(31), e2109718119.","ama":"Toprakcioglu Z, Kamada A, Michaels TCT, et al. Adsorption free energy predicts amyloid protein nucleation rates. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. 2022;119(31). doi:<a href=\"https://doi.org/10.1073/pnas.2109718119\">10.1073/pnas.2109718119</a>"},"publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]},"file_date_updated":"2023-10-04T09:05:44Z","article_number":"e2109718119","tmp":{"short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"date_published":"2022-07-28T00:00:00Z","author":[{"last_name":"Toprakcioglu","first_name":"Zenon","full_name":"Toprakcioglu, Zenon"},{"last_name":"Kamada","first_name":"Ayaka","full_name":"Kamada, Ayaka"},{"last_name":"Michaels","first_name":"Thomas C.T.","full_name":"Michaels, Thomas C.T."},{"first_name":"Mengqi","last_name":"Xie","full_name":"Xie, Mengqi"},{"first_name":"Johannes","last_name":"Krausser","full_name":"Krausser, Johannes"},{"full_name":"Wei, Jiapeng","first_name":"Jiapeng","last_name":"Wei"},{"last_name":"Šarić","orcid":"0000-0002-7854-2139","first_name":"Anđela","id":"bf63d406-f056-11eb-b41d-f263a6566d8b","full_name":"Šarić, Anđela"},{"last_name":"Vendruscolo","first_name":"Michele","full_name":"Vendruscolo, Michele"},{"first_name":"Tuomas P.J.","last_name":"Knowles","full_name":"Knowles, Tuomas P.J."}],"date_updated":"2023-10-04T09:06:52Z","doi":"10.1073/pnas.2109718119","article_processing_charge":"No","scopus_import":"1","quality_controlled":"1","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","intvolume":"       119","publication_status":"published","file":[{"date_updated":"2023-10-04T09:05:44Z","file_id":"14386","file_name":"2022_PNAS_Toprakcioglu.pdf","checksum":"0fe3878896cbeb6c44e29222ec2f336a","file_size":2476021,"creator":"dernst","access_level":"open_access","relation":"main_file","success":1,"date_created":"2023-10-04T09:05:44Z","content_type":"application/pdf"}],"day":"28","ddc":["570"],"project":[{"call_identifier":"H2020","_id":"eba2549b-77a9-11ec-83b8-a81e493eae4e","grant_number":"802960","name":"Non-Equilibrium Protein Assembly: from Building Blocks to Biological Machines"}],"language":[{"iso":"eng"}],"month":"07","isi":1},{"has_accepted_license":"1","year":"2022","_id":"11842","type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","volume":24,"publication_identifier":{"eissn":["1422-6952"],"issn":["1422-6928"]},"citation":{"ista":"Hensel S, Marveggio A. 2022. Weak-strong uniqueness for the Navier–Stokes equation for two fluids with ninety degree contact angle and same viscosities. Journal of Mathematical Fluid Mechanics. 24(3), 93.","mla":"Hensel, Sebastian, and Alice Marveggio. “Weak-Strong Uniqueness for the Navier–Stokes Equation for Two Fluids with Ninety Degree Contact Angle and Same Viscosities.” <i>Journal of Mathematical Fluid Mechanics</i>, vol. 24, no. 3, 93, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1007/s00021-022-00722-2\">10.1007/s00021-022-00722-2</a>.","short":"S. Hensel, A. Marveggio, Journal of Mathematical Fluid Mechanics 24 (2022).","ama":"Hensel S, Marveggio A. Weak-strong uniqueness for the Navier–Stokes equation for two fluids with ninety degree contact angle and same viscosities. <i>Journal of Mathematical Fluid Mechanics</i>. 2022;24(3). doi:<a href=\"https://doi.org/10.1007/s00021-022-00722-2\">10.1007/s00021-022-00722-2</a>","apa":"Hensel, S., &#38; Marveggio, A. (2022). Weak-strong uniqueness for the Navier–Stokes equation for two fluids with ninety degree contact angle and same viscosities. <i>Journal of Mathematical Fluid Mechanics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00021-022-00722-2\">https://doi.org/10.1007/s00021-022-00722-2</a>","ieee":"S. Hensel and A. Marveggio, “Weak-strong uniqueness for the Navier–Stokes equation for two fluids with ninety degree contact angle and same viscosities,” <i>Journal of Mathematical Fluid Mechanics</i>, vol. 24, no. 3. Springer Nature, 2022.","chicago":"Hensel, Sebastian, and Alice Marveggio. “Weak-Strong Uniqueness for the Navier–Stokes Equation for Two Fluids with Ninety Degree Contact Angle and Same Viscosities.” <i>Journal of Mathematical Fluid Mechanics</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s00021-022-00722-2\">https://doi.org/10.1007/s00021-022-00722-2</a>."},"external_id":{"isi":["000834834300001"],"arxiv":["2112.11154"]},"article_type":"original","issue":"3","acknowledgement":"The authors warmly thank their former resp. current PhD advisor Julian Fischer for the suggestion of this problem and for valuable initial discussions on the subjects of this paper. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 948819) , and from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – EXC-2047/1 – 390685813.","oa":1,"status":"public","oa_version":"Published Version","date_created":"2022-08-14T22:01:45Z","ec_funded":1,"publisher":"Springer Nature","title":"Weak-strong uniqueness for the Navier–Stokes equation for two fluids with ninety degree contact angle and same viscosities","department":[{"_id":"JuFi"}],"publication":"Journal of Mathematical Fluid Mechanics","abstract":[{"text":"We consider the flow of two viscous and incompressible fluids within a bounded domain modeled by means of a two-phase Navier–Stokes system. The two fluids are assumed to be immiscible, meaning that they are separated by an interface. With respect to the motion of the interface, we consider pure transport by the fluid flow. Along the boundary of the domain, a complete slip boundary condition for the fluid velocities and a constant ninety degree contact angle condition for the interface are assumed. In the present work, we devise for the resulting evolution problem a suitable weak solution concept based on the framework of varifolds and establish as the main result a weak-strong uniqueness principle in 2D. The proof is based on a relative entropy argument and requires a non-trivial further development of ideas from the recent work of Fischer and the first author (Arch. Ration. Mech. Anal. 236, 2020) to incorporate the contact angle condition. To focus on the effects of the necessarily singular geometry of the evolving fluid domains, we work for simplicity in the regime of same viscosities for the two fluids.","lang":"eng"}],"arxiv":1,"publication_status":"published","file":[{"file_id":"11848","date_updated":"2022-08-16T06:55:22Z","file_size":2045570,"checksum":"75c5f286300e6f0539cf57b4dba108d5","file_name":"2022_JMathFluidMech_Hensel.pdf","relation":"main_file","access_level":"open_access","creator":"cchlebak","content_type":"application/pdf","date_created":"2022-08-16T06:55:22Z","success":1}],"intvolume":"        24","language":[{"iso":"eng"}],"project":[{"call_identifier":"H2020","grant_number":"948819","name":"Bridging Scales in Random Materials","_id":"0aa76401-070f-11eb-9043-b5bb049fa26d"}],"isi":1,"month":"08","day":"01","ddc":["510"],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_number":"93","file_date_updated":"2022-08-16T06:55:22Z","quality_controlled":"1","scopus_import":"1","related_material":{"record":[{"id":"14587","status":"public","relation":"dissertation_contains"}]},"doi":"10.1007/s00021-022-00722-2","date_updated":"2023-11-30T13:25:02Z","article_processing_charge":"No","date_published":"2022-08-01T00:00:00Z","author":[{"id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","full_name":"Hensel, Sebastian","last_name":"Hensel","orcid":"0000-0001-7252-8072","first_name":"Sebastian"},{"id":"25647992-AA84-11E9-9D75-8427E6697425","full_name":"Marveggio, Alice","last_name":"Marveggio","first_name":"Alice"}]},{"type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","volume":11,"has_accepted_license":"1","year":"2022","_id":"11843","article_type":"original","external_id":{"isi":["000838410200001"]},"acknowledgement":"We thank Ulrich Dobrindt for providing UPEC strains CFT073, UTI89, and 536, Frank Assen, Vlad Gavra, Maximilian Götz, Bor Kavčič, Jonna Alanko, and Eva Kiermaier for help with experiments and Robert Hauschild, Julian Stopp, and Saren Tasciyan for help with data analysis. We thank the IST Austria Scientific Service Units, especially the Bioimaging facility, the Preclinical facility and the Electron microscopy facility for technical support, Jakob Wallner and all members of the Guet and Sixt lab for fruitful discussions and Daria Siekhaus for critically reading the manuscript. This work was supported by grants from the Austrian Research Promotion Agency (FEMtech 868984) to IG, the European Research Council (CoG 724373), and the Austrian Science Fund (FWF P29911) to MS.","oa":1,"status":"public","publication_identifier":{"eissn":["2050-084X"]},"citation":{"ama":"Tomasek K, Leithner AF, Glatzová I, Lukesch MS, Guet CC, Sixt MK. Type 1 piliated uropathogenic Escherichia coli hijack the host immune response by binding to CD14. <i>eLife</i>. 2022;11. doi:<a href=\"https://doi.org/10.7554/eLife.78995\">10.7554/eLife.78995</a>","mla":"Tomasek, Kathrin, et al. “Type 1 Piliated Uropathogenic Escherichia Coli Hijack the Host Immune Response by Binding to CD14.” <i>ELife</i>, vol. 11, e78995, eLife Sciences Publications, 2022, doi:<a href=\"https://doi.org/10.7554/eLife.78995\">10.7554/eLife.78995</a>.","short":"K. Tomasek, A.F. Leithner, I. Glatzová, M.S. Lukesch, C.C. Guet, M.K. Sixt, ELife 11 (2022).","ista":"Tomasek K, Leithner AF, Glatzová I, Lukesch MS, Guet CC, Sixt MK. 2022. Type 1 piliated uropathogenic Escherichia coli hijack the host immune response by binding to CD14. eLife. 11, e78995.","ieee":"K. Tomasek, A. F. Leithner, I. Glatzová, M. S. Lukesch, C. C. Guet, and M. K. Sixt, “Type 1 piliated uropathogenic Escherichia coli hijack the host immune response by binding to CD14,” <i>eLife</i>, vol. 11. eLife Sciences Publications, 2022.","chicago":"Tomasek, Kathrin, Alexander F Leithner, Ivana Glatzová, Michael S. Lukesch, Calin C Guet, and Michael K Sixt. “Type 1 Piliated Uropathogenic Escherichia Coli Hijack the Host Immune Response by Binding to CD14.” <i>ELife</i>. eLife Sciences Publications, 2022. <a href=\"https://doi.org/10.7554/eLife.78995\">https://doi.org/10.7554/eLife.78995</a>.","apa":"Tomasek, K., Leithner, A. F., Glatzová, I., Lukesch, M. S., Guet, C. C., &#38; Sixt, M. K. (2022). Type 1 piliated uropathogenic Escherichia coli hijack the host immune response by binding to CD14. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.78995\">https://doi.org/10.7554/eLife.78995</a>"},"publisher":"eLife Sciences Publications","title":"Type 1 piliated uropathogenic Escherichia coli hijack the host immune response by binding to CD14","department":[{"_id":"MiSi"},{"_id":"CaGu"}],"publication":"eLife","oa_version":"Published Version","ec_funded":1,"date_created":"2022-08-14T22:01:46Z","abstract":[{"text":"A key attribute of persistent or recurring bacterial infections is the ability of the pathogen to evade the host’s immune response. Many Enterobacteriaceae express type 1 pili, a pre-adapted virulence trait, to invade host epithelial cells and establish persistent infections. However, the molecular mechanisms and strategies by which bacteria actively circumvent the immune response of the host remain poorly understood. Here, we identified CD14, the major co-receptor for lipopolysaccharide detection, on mouse dendritic cells (DCs) as a binding partner of FimH, the protein located at the tip of the type 1 pilus of Escherichia coli. The FimH amino acids involved in CD14 binding are highly conserved across pathogenic and non-pathogenic strains. Binding of the pathogenic strain CFT073 to CD14 reduced DC migration by overactivation of integrins and blunted expression of co-stimulatory molecules by overactivating the NFAT (nuclear factor of activated T-cells) pathway, both rate-limiting factors of T cell activation. This response was binary at the single-cell level, but averaged in larger populations exposed to both piliated and non-piliated pathogens, presumably via the exchange of immunomodulatory cytokines. While defining an active molecular mechanism of immune evasion by pathogens, the interaction between FimH and CD14 represents a potential target to interfere with persistent and recurrent infections, such as urinary tract infections or Crohn’s disease.","lang":"eng"}],"publication_status":"published","file":[{"file_id":"11861","date_updated":"2022-08-16T08:57:37Z","file_size":2057577,"checksum":"002a3c7c7ea5caa9af9cfbea308f6ea4","file_name":"2022_eLife_Tomasek.pdf","relation":"main_file","creator":"cchlebak","access_level":"open_access","content_type":"application/pdf","date_created":"2022-08-16T08:57:37Z","success":1}],"intvolume":"        11","day":"26","ddc":["570"],"language":[{"iso":"eng"}],"project":[{"grant_number":"724373","name":"Cellular navigation along spatial gradients","_id":"25FE9508-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"26018E70-B435-11E9-9278-68D0E5697425","grant_number":"P29911","name":"Mechanical adaptation of lamellipodial actin","call_identifier":"FWF"}],"isi":1,"month":"07","article_number":"e78995","file_date_updated":"2022-08-16T08:57:37Z","acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"},{"_id":"EM-Fac"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2023-08-03T12:54:21Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"10316"}]},"doi":"10.7554/eLife.78995","article_processing_charge":"Yes","author":[{"first_name":"Kathrin","last_name":"Tomasek","full_name":"Tomasek, Kathrin","id":"3AEC8556-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Leithner","first_name":"Alexander F","id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87","full_name":"Leithner, Alexander F"},{"first_name":"Ivana","last_name":"Glatzová","full_name":"Glatzová, Ivana","id":"727b3c7d-4939-11ec-89b3-b9b0750ab74d"},{"full_name":"Lukesch, Michael S.","last_name":"Lukesch","first_name":"Michael S."},{"first_name":"Calin C","orcid":"0000-0001-6220-2052","last_name":"Guet","full_name":"Guet, Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-6620-9179","last_name":"Sixt","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K"}],"date_published":"2022-07-26T00:00:00Z","quality_controlled":"1","scopus_import":"1"},{"day":"21","ddc":["000"],"project":[{"name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"language":[{"iso":"eng"}],"month":"07","publication_status":"published","file":[{"date_updated":"2022-08-16T08:05:15Z","file_id":"11854","file_size":1593474,"file_name":"2022_PODC_Alistarh.pdf","checksum":"4c6b29172b8e355b4fbc364a2e0827b2","relation":"main_file","access_level":"open_access","creator":"cchlebak","content_type":"application/pdf","success":1,"date_created":"2022-08-16T08:05:15Z"}],"date_updated":"2023-06-14T12:06:01Z","doi":"10.1145/3519270.3538435","article_processing_charge":"Yes (via OA deal)","date_published":"2022-07-21T00:00:00Z","author":[{"orcid":"0000-0003-3650-940X","last_name":"Alistarh","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"},{"first_name":"Joel","orcid":"0000-0002-6432-6646","last_name":"Rybicki","full_name":"Rybicki, Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Voitovych","first_name":"Sasha","full_name":"Voitovych, Sasha"}],"quality_controlled":"1","scopus_import":"1","file_date_updated":"2022-08-16T08:05:15Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"conference":{"start_date":"2022-07-25","location":"Salerno, Italy","end_date":"2022-07-29","name":"PODC: Symposium on Principles of Distributed Computing"},"external_id":{"arxiv":["2205.12597"]},"status":"public","acknowledgement":"We thank the anonymous reviewers for their helpful comments. We gratefully acknowledge funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML).","oa":1,"publication_identifier":{"isbn":["9781450392624"]},"citation":{"ista":"Alistarh D-A, Rybicki J, Voitovych S. 2022. Near-optimal leader election in population protocols on graphs. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 246–256.","mla":"Alistarh, Dan-Adrian, et al. “Near-Optimal Leader Election in Population Protocols on Graphs.” <i>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</i>, Association for Computing Machinery, 2022, pp. 246–56, doi:<a href=\"https://doi.org/10.1145/3519270.3538435\">10.1145/3519270.3538435</a>.","short":"D.-A. Alistarh, J. Rybicki, S. Voitovych, in:, Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2022, pp. 246–256.","ama":"Alistarh D-A, Rybicki J, Voitovych S. Near-optimal leader election in population protocols on graphs. In: <i>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</i>. Association for Computing Machinery; 2022:246-256. doi:<a href=\"https://doi.org/10.1145/3519270.3538435\">10.1145/3519270.3538435</a>","apa":"Alistarh, D.-A., Rybicki, J., &#38; Voitovych, S. (2022). Near-optimal leader election in population protocols on graphs. In <i>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</i> (pp. 246–256). Salerno, Italy: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3519270.3538435\">https://doi.org/10.1145/3519270.3538435</a>","chicago":"Alistarh, Dan-Adrian, Joel Rybicki, and Sasha Voitovych. “Near-Optimal Leader Election in Population Protocols on Graphs.” In <i>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</i>, 246–56. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3519270.3538435\">https://doi.org/10.1145/3519270.3538435</a>.","ieee":"D.-A. Alistarh, J. Rybicki, and S. Voitovych, “Near-optimal leader election in population protocols on graphs,” in <i>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</i>, Salerno, Italy, 2022, pp. 246–256."},"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"246-256","has_accepted_license":"1","year":"2022","_id":"11844","arxiv":1,"abstract":[{"lang":"eng","text":"In the stochastic population protocol model, we are given a connected graph with n nodes, and in every time step, a scheduler samples an edge of the graph uniformly at random and the nodes connected by this edge interact. A fundamental task in this model is stable leader election, in which all nodes start in an identical state and the aim is to reach a configuration in which (1) exactly one node is elected as leader and (2) this node remains as the unique leader no matter what sequence of interactions follows. On cliques, the complexity of this problem has recently been settled: time-optimal protocols stabilize in Θ(n log n) expected steps using Θ(log log n) states, whereas protocols that use O(1) states require Θ(n2) expected steps.\r\n\r\nIn this work, we investigate the complexity of stable leader election on general graphs. We provide the first non-trivial time lower bounds for leader election on general graphs, showing that, when moving beyond cliques, the complexity landscape of leader election becomes very diverse: the time required to elect a leader can range from O(1) to Θ(n3) expected steps. On the upper bound side, we first observe that there exists a protocol that is time-optimal on many graph families, but uses polynomially-many states. In contrast, we give a near-time-optimal protocol that uses only O(log2n) states that is at most a factor log n slower. Finally, we show that the constant-state protocol of Beauquier et al. [OPODIS 2013] is at most a factor n log n slower than the fast polynomial-state protocol. Moreover, among constant-state protocols, this protocol has near-optimal average case complexity on dense random graphs."}],"publisher":"Association for Computing Machinery","department":[{"_id":"DaAl"}],"title":"Near-optimal leader election in population protocols on graphs","publication":"Proceedings of the Annual ACM Symposium on Principles of Distributed Computing","oa_version":"Published Version","date_created":"2022-08-14T22:01:46Z","ec_funded":1},{"abstract":[{"text":"This paper is a continuation of Part I of this project, where we developed a new local well-posedness theory for nonlinear stochastic PDEs with Gaussian noise. In the current Part II we consider blow-up criteria and regularization phenomena. As in Part I we can allow nonlinearities with polynomial growth and rough initial values from critical spaces. In the first main result we obtain several new blow-up criteria for quasi- and semilinear stochastic evolution equations. In particular, for semilinear equations we obtain a Serrin type blow-up criterium, which extends a recent result of Prüss–Simonett–Wilke (J Differ Equ 264(3):2028–2074, 2018) to the stochastic setting. Blow-up criteria can be used to prove global well-posedness for SPDEs. As in Part I, maximal regularity techniques and weights in time play a central role in the proofs. Our second contribution is a new method to bootstrap Sobolev and Hölder regularity in time and space, which does not require smoothness of the initial data. The blow-up criteria are at the basis of these new methods. Moreover, in applications the bootstrap results can be combined with our blow-up criteria, to obtain efficient ways to prove global existence. This gives new results even in classical 𝐿2-settings, which we illustrate for a concrete SPDE. In future works in preparation we apply the results of the current paper to obtain global well-posedness results and regularity for several concrete SPDEs. These include stochastic Navier–Stokes equations, reaction– diffusion equations and the Allen–Cahn equation. Our setting allows to put these SPDEs into a more flexible framework, where less restrictions on the nonlinearities are needed, and we are able to treat rough initial values from critical spaces. Moreover, we will obtain higher-order regularity results.","lang":"eng"}],"date_created":"2022-08-16T08:39:43Z","oa_version":"Published Version","publication":"Journal of Evolution Equations","department":[{"_id":"JuFi"}],"title":"Nonlinear parabolic stochastic evolution equations in critical spaces part II","publisher":"Springer Nature","citation":{"ieee":"A. Agresti and M. Veraar, “Nonlinear parabolic stochastic evolution equations in critical spaces part II,” <i>Journal of Evolution Equations</i>, vol. 22, no. 2. Springer Nature, 2022.","chicago":"Agresti, Antonio, and Mark Veraar. “Nonlinear Parabolic Stochastic Evolution Equations in Critical Spaces Part II.” <i>Journal of Evolution Equations</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s00028-022-00786-7\">https://doi.org/10.1007/s00028-022-00786-7</a>.","apa":"Agresti, A., &#38; Veraar, M. (2022). Nonlinear parabolic stochastic evolution equations in critical spaces part II. <i>Journal of Evolution Equations</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00028-022-00786-7\">https://doi.org/10.1007/s00028-022-00786-7</a>","ama":"Agresti A, Veraar M. Nonlinear parabolic stochastic evolution equations in critical spaces part II. <i>Journal of Evolution Equations</i>. 2022;22(2). doi:<a href=\"https://doi.org/10.1007/s00028-022-00786-7\">10.1007/s00028-022-00786-7</a>","ista":"Agresti A, Veraar M. 2022. Nonlinear parabolic stochastic evolution equations in critical spaces part II. Journal of Evolution Equations. 22(2), 56.","short":"A. Agresti, M. Veraar, Journal of Evolution Equations 22 (2022).","mla":"Agresti, Antonio, and Mark Veraar. “Nonlinear Parabolic Stochastic Evolution Equations in Critical Spaces Part II.” <i>Journal of Evolution Equations</i>, vol. 22, no. 2, 56, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1007/s00028-022-00786-7\">10.1007/s00028-022-00786-7</a>."},"publication_identifier":{"issn":["1424-3199"],"eissn":["1424-3202"]},"status":"public","oa":1,"acknowledgement":"The authors thank Emiel Lorist for helpful comments. The authors thank the anonymous referees for their helpful remarks to improve the presentation.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria).","issue":"2","external_id":{"isi":["000809108500001"]},"article_type":"original","_id":"11858","year":"2022","has_accepted_license":"1","volume":22,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","keyword":["Mathematics (miscellaneous)"],"scopus_import":"1","quality_controlled":"1","author":[{"orcid":"0000-0002-9573-2962","last_name":"Agresti","first_name":"Antonio","id":"673cd0cc-9b9a-11eb-b144-88f30e1fbb72","full_name":"Agresti, Antonio"},{"full_name":"Veraar, Mark","first_name":"Mark","last_name":"Veraar"}],"date_published":"2022-06-01T00:00:00Z","article_processing_charge":"Yes (via OA deal)","doi":"10.1007/s00028-022-00786-7","date_updated":"2023-08-03T12:53:51Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file_date_updated":"2022-08-16T08:52:46Z","article_number":"56","isi":1,"month":"06","language":[{"iso":"eng"}],"ddc":["510"],"day":"01","intvolume":"        22","file":[{"relation":"main_file","access_level":"open_access","creator":"kschuh","content_type":"application/pdf","success":1,"date_created":"2022-08-16T08:52:46Z","date_updated":"2022-08-16T08:52:46Z","file_id":"11862","file_size":1758371,"file_name":"2022_Journal of Evolution Equations_Agresti.pdf","checksum":"59b99d1b48b6bd40983e7ce298524a21"}],"publication_status":"published"},{"date_created":"2022-08-17T07:58:53Z","oa_version":"Published Version","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"EvBe"}],"title":"Modulation of auxin transport via ZF proteins adjust plant response to high ambient temperature","abstract":[{"lang":"eng","text":"As the overall global mean surface temperature is increasing due to climate change, plant\r\nadaptation to those stressful conditions is of utmost importance for their survival. Plants are\r\nsessile organisms, thus to compensate for their lack of mobility, they evolved a variety of\r\nmechanisms enabling them to flexibly adjust their physiological, growth and developmental\r\nprocesses to fluctuating temperatures and to survive in harsh environments. While these unique\r\nadaptation abilities provide an important evolutionary advantage, overall modulation of plant\r\ngrowth and developmental program due to non-optimal temperature negatively affects biomass\r\nproduction, crop productivity or sensitivity to pathogens. Thus, understanding molecular\r\nprocesses underlying plant adaptation to increased temperature can provide important\r\nresources for breeding strategies to ensure sufficient agricultural food production.\r\nAn increase in ambient temperature by a few degrees leads to profound changes in organ growth\r\nincluding enhanced hypocotyl elongation, expansion of petioles, hyponastic growth of leaves and\r\ncotyledons, collectively named thermomorphogenesis (Casal & Balasubramanian, 2019). Auxin,\r\none of the best-studied growth hormones, plays an essential role in this process by direct\r\nactivation of transcriptional and non-transcriptional processes resulting in elongation growth\r\n(Majda & Robert, 2018).To modulate hypocotyl growth in response to high ambient temperature\r\n(hAT), auxin needs to be redistributed accordingly. PINs, auxin efflux transporters, are key\r\ncomponents of the polar auxin transport (PAT) machinery, which controls the amount and\r\ndirection of auxin translocated in the plant tissues and organs(Adamowski & Friml, 2015). Hence,\r\nPIN-mediated transport is tightly linked with thermo-morphogenesis, and interference with PAT\r\nthrough either chemical or genetic means dramatically affecting the adaptive responses to hAT.\r\nIntriguingly, despite the key role of PIN mediated transport in growth response to hAT, whether\r\nand how PINs at the level of expression adapt to fluctuation in temperature is scarcely\r\nunderstood.\r\nWith genetic, molecular and advanced bio-imaging approaches, we demonstrate the role of PIN\r\nauxin transporters in the regulation of hypocotyl growth in response to hAT. We show that via\r\nadjustment of PIN3, PIN4 and PIN7 expression in cotyledons and hypocotyls, auxin distribution is modulated thereby determining elongation pattern of epidermal cells at hAT. Furthermore, we\r\nidentified three Zinc-Finger (ZF) transcription factors as novel molecular components of the\r\nthermo-regulatory network, which through negative regulation of PIN transcription adjust the\r\ntransport of auxin at hAT. Our results suggest that the ZF-PIN module might be a part of the\r\nnegative feedback loop attenuating the activity of the thermo-sensing pathway to restrain\r\nexaggerated growth and developmental responses to hAT."}],"has_accepted_license":"1","year":"2022","_id":"11879","supervisor":[{"id":"38F4F166-F248-11E8-B48F-1D18A9856A87","full_name":"Benková, Eva","last_name":"Benková","orcid":"0000-0002-8510-9739","first_name":"Eva"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"dissertation","page":"128","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-022-0"]},"citation":{"chicago":"Artner, Christina. “Modulation of Auxin Transport via ZF Proteins Adjust Plant Response to High Ambient Temperature.” Institute of Science and Technology Austria, 2022. <a href=\"https://doi.org/10.15479/at:ista:11879\">https://doi.org/10.15479/at:ista:11879</a>.","ieee":"C. Artner, “Modulation of auxin transport via ZF proteins adjust plant response to high ambient temperature,” Institute of Science and Technology Austria, 2022.","apa":"Artner, C. (2022). <i>Modulation of auxin transport via ZF proteins adjust plant response to high ambient temperature</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:11879\">https://doi.org/10.15479/at:ista:11879</a>","ama":"Artner C. Modulation of auxin transport via ZF proteins adjust plant response to high ambient temperature. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:11879\">10.15479/at:ista:11879</a>","short":"C. Artner, Modulation of Auxin Transport via ZF Proteins Adjust Plant Response to High Ambient Temperature, Institute of Science and Technology Austria, 2022.","ista":"Artner C. 2022. Modulation of auxin transport via ZF proteins adjust plant response to high ambient temperature. Institute of Science and Technology Austria.","mla":"Artner, Christina. <i>Modulation of Auxin Transport via ZF Proteins Adjust Plant Response to High Ambient Temperature</i>. Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/at:ista:11879\">10.15479/at:ista:11879</a>."},"status":"public","oa":1,"acknowledgement":"I would like to acknowledge ISTA and all the people from the Scientific Service Units and at ISTA, in particular Dorota Jaworska for excellent technical and scientific support as well as ÖAW for funding my research for over 3 years (DOC ÖAW Fellowship PR1022OEAW02).","acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"},{"_id":"SSU"}],"file_date_updated":"2023-09-09T22:30:03Z","keyword":["high ambient temperature","auxin","PINs","Zinc-Finger proteins","thermomorphogenesis","stress"],"degree_awarded":"PhD","article_processing_charge":"No","date_updated":"2023-09-09T22:30:04Z","doi":"10.15479/at:ista:11879","alternative_title":["ISTA Thesis"],"author":[{"last_name":"Artner","first_name":"Christina","id":"45DF286A-F248-11E8-B48F-1D18A9856A87","full_name":"Artner, Christina"}],"date_published":"2022-08-17T00:00:00Z","file":[{"checksum":"a2c2fdc28002538840490bfa6a08b2cb","file_name":"ChristinaArtner_PhD_Thesis_2022.pdf","file_size":11113608,"date_updated":"2023-09-09T22:30:03Z","embargo":"2023-09-08","file_id":"11907","date_created":"2022-08-17T12:08:49Z","content_type":"application/pdf","access_level":"open_access","creator":"cartner","relation":"main_file"},{"relation":"source_file","creator":"cartner","access_level":"closed","embargo_to":"open_access","content_type":"application/octet-stream","date_created":"2022-08-17T12:08:59Z","file_id":"11908","date_updated":"2023-09-09T22:30:03Z","file_size":19097730,"checksum":"66b461c074b815fbe63481b3f46a9f43","file_name":"ChristinaArtner_PhD_Thesis_2022.7z"}],"publication_status":"published","month":"08","project":[{"_id":"2685A872-B435-11E9-9278-68D0E5697425","name":"Hormonal regulation of plant adaptive responses to environmental signals"}],"language":[{"iso":"eng"}],"ddc":["580"],"day":"17"},{"month":"07","language":[{"iso":"eng"}],"ddc":["510"],"day":"01","intvolume":"         7","file":[{"content_type":"application/pdf","success":1,"date_created":"2022-08-18T08:02:34Z","relation":"main_file","access_level":"open_access","creator":"dernst","file_size":389060,"file_name":"2022_AdvancesOperatorTheory_Wirth.pdf","checksum":"913474844a1b38264fb710746d5e2e98","date_updated":"2022-08-18T08:02:34Z","file_id":"11921"}],"publication_status":"published","keyword":["Algebra and Number Theory","Analysis"],"scopus_import":"1","quality_controlled":"1","date_published":"2022-07-01T00:00:00Z","author":[{"first_name":"Melchior","last_name":"Wirth","orcid":"0000-0002-0519-4241","full_name":"Wirth, Melchior","id":"88644358-0A0E-11EA-8FA5-49A33DDC885E"}],"article_processing_charge":"Yes (via OA deal)","date_updated":"2023-02-21T10:08:07Z","doi":"10.1007/s43036-022-00199-w","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file_date_updated":"2022-08-18T08:02:34Z","article_number":"38","citation":{"short":"M. Wirth, Advances in Operator Theory 7 (2022).","ista":"Wirth M. 2022. Kac regularity and domination of quadratic forms. Advances in Operator Theory. 7(3), 38.","mla":"Wirth, Melchior. “Kac Regularity and Domination of Quadratic Forms.” <i>Advances in Operator Theory</i>, vol. 7, no. 3, 38, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1007/s43036-022-00199-w\">10.1007/s43036-022-00199-w</a>.","ama":"Wirth M. Kac regularity and domination of quadratic forms. <i>Advances in Operator Theory</i>. 2022;7(3). doi:<a href=\"https://doi.org/10.1007/s43036-022-00199-w\">10.1007/s43036-022-00199-w</a>","apa":"Wirth, M. (2022). Kac regularity and domination of quadratic forms. <i>Advances in Operator Theory</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s43036-022-00199-w\">https://doi.org/10.1007/s43036-022-00199-w</a>","ieee":"M. Wirth, “Kac regularity and domination of quadratic forms,” <i>Advances in Operator Theory</i>, vol. 7, no. 3. Springer Nature, 2022.","chicago":"Wirth, Melchior. “Kac Regularity and Domination of Quadratic Forms.” <i>Advances in Operator Theory</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s43036-022-00199-w\">https://doi.org/10.1007/s43036-022-00199-w</a>."},"publication_identifier":{"eissn":["2538-225X"]},"oa":1,"status":"public","acknowledgement":"The author was supported by the German Academic Scholarship Foundation (Studienstiftung des deutschen Volkes) and by the German Research Foundation (DFG) via RTG 1523/2. The author would like to thank Daniel Lenz for his support and encouragement during the author’s ongoing graduate studies and him as well as Marcel Schmidt for fruitful discussions on domination of quadratic forms. He wants to thank Batu Güneysu and Peter Stollmann for valuable comments on a preliminary version of this article. He would also like to thank the organizers of the conference Analysis and Geometry on Graphs and Manifolds in Potsdam, where the initial motivation of this article was conceived, and the organizers of the intense activity period Metric Measure Spaces and Ricci Curvature at MPIM in Bonn, where this work was finished.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria).","issue":"3","article_type":"original","_id":"11916","year":"2022","has_accepted_license":"1","volume":7,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","abstract":[{"text":"A domain is called Kac regular for a quadratic form on L2 if every functions vanishing almost everywhere outside the domain can be approximated in form norm by functions with compact support in the domain. It is shown that this notion is stable under domination of quadratic forms. As applications measure perturbations of quasi-regular Dirichlet forms, Cheeger energies on metric measure spaces and Schrödinger operators on manifolds are studied. Along the way a characterization of the Sobolev space with Dirichlet boundary conditions on domains in infinitesimally Riemannian metric measure spaces is obtained.","lang":"eng"}],"date_created":"2022-08-18T07:22:24Z","oa_version":"Published Version","publication":"Advances in Operator Theory","department":[{"_id":"JaMa"}],"title":"Kac regularity and domination of quadratic forms","publisher":"Springer Nature"},{"acknowledgement":"The authors thank Gérard Ben Arous for pointing out the question of a lower bound. Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC Grant Agreement No. 694227 (R.S.) and under the Marie Skłodowska-Curie Grant Agreement No. 754411 (S.R.) is gratefully acknowledged.\r\nOpen access funding provided by IST Austria.","oa":1,"status":"public","article_type":"original","external_id":{"isi":["000805175000001"]},"citation":{"ieee":"S. A. E. Rademacher and R. Seiringer, “Large deviation estimates for weakly interacting bosons,” <i>Journal of Statistical Physics</i>, vol. 188. Springer Nature, 2022.","chicago":"Rademacher, Simone Anna Elvira, and Robert Seiringer. “Large Deviation Estimates for Weakly Interacting Bosons.” <i>Journal of Statistical Physics</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s10955-022-02940-4\">https://doi.org/10.1007/s10955-022-02940-4</a>.","apa":"Rademacher, S. A. E., &#38; Seiringer, R. (2022). Large deviation estimates for weakly interacting bosons. <i>Journal of Statistical Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10955-022-02940-4\">https://doi.org/10.1007/s10955-022-02940-4</a>","ama":"Rademacher SAE, Seiringer R. Large deviation estimates for weakly interacting bosons. <i>Journal of Statistical Physics</i>. 2022;188. doi:<a href=\"https://doi.org/10.1007/s10955-022-02940-4\">10.1007/s10955-022-02940-4</a>","mla":"Rademacher, Simone Anna Elvira, and Robert Seiringer. “Large Deviation Estimates for Weakly Interacting Bosons.” <i>Journal of Statistical Physics</i>, vol. 188, 9, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1007/s10955-022-02940-4\">10.1007/s10955-022-02940-4</a>.","ista":"Rademacher SAE, Seiringer R. 2022. Large deviation estimates for weakly interacting bosons. Journal of Statistical Physics. 188, 9.","short":"S.A.E. Rademacher, R. Seiringer, Journal of Statistical Physics 188 (2022)."},"publication_identifier":{"issn":["0022-4715"],"eissn":["1572-9613"]},"volume":188,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"journal_article","_id":"11917","year":"2022","has_accepted_license":"1","abstract":[{"text":"We study the many-body dynamics of an initially factorized bosonic wave function in the mean-field regime. We prove large deviation estimates for the fluctuations around the condensate. We derive an upper bound extending a recent result to more general interactions. Furthermore, we derive a new lower bound which agrees with the upper bound in leading order.","lang":"eng"}],"publication":"Journal of Statistical Physics","department":[{"_id":"RoSe"}],"title":"Large deviation estimates for weakly interacting bosons","publisher":"Springer Nature","ec_funded":1,"date_created":"2022-08-18T07:23:26Z","oa_version":"Published Version","ddc":["510"],"day":"01","month":"07","isi":1,"language":[{"iso":"eng"}],"project":[{"call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","name":"Analysis of quantum many-body systems"},{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"intvolume":"       188","file":[{"creator":"dernst","access_level":"open_access","relation":"main_file","success":1,"date_created":"2022-08-18T08:09:00Z","content_type":"application/pdf","file_id":"11922","date_updated":"2022-08-18T08:09:00Z","file_name":"2022_JournalStatisticalPhysics_Rademacher.pdf","checksum":"44418cb44f07fa21ed3907f85abf7f39","file_size":483481}],"publication_status":"published","author":[{"orcid":"0000-0001-5059-4466","last_name":"Rademacher","first_name":"Simone Anna Elvira","id":"856966FE-A408-11E9-977E-802DE6697425","full_name":"Rademacher, Simone Anna Elvira"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","last_name":"Seiringer","first_name":"Robert"}],"date_published":"2022-07-01T00:00:00Z","article_processing_charge":"Yes (via OA deal)","date_updated":"2023-08-03T12:55:58Z","doi":"10.1007/s10955-022-02940-4","keyword":["Mathematical Physics","Statistical and Nonlinear Physics"],"scopus_import":"1","quality_controlled":"1","file_date_updated":"2022-08-18T08:09:00Z","article_number":"9","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}},{"_id":"11918","publication_status":"published","year":"2022","page":"459-498","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Henzinger MH, Lincoln A, Saha B. The complexity of average-case dynamic subgraph counting. In: <i>33rd Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2022:459-498. doi:<a href=\"https://doi.org/10.1137/1.9781611977073.23\">10.1137/1.9781611977073.23</a>","ista":"Henzinger MH, Lincoln A, Saha B. 2022. The complexity of average-case dynamic subgraph counting. 33rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 459–498.","mla":"Henzinger, Monika H., et al. “The Complexity of Average-Case Dynamic Subgraph Counting.” <i>33rd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2022, pp. 459–98, doi:<a href=\"https://doi.org/10.1137/1.9781611977073.23\">10.1137/1.9781611977073.23</a>.","short":"M.H. Henzinger, A. Lincoln, B. Saha, in:, 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2022, pp. 459–498.","chicago":"Henzinger, Monika H, Andrea Lincoln, and Barna Saha. “The Complexity of Average-Case Dynamic Subgraph Counting.” In <i>33rd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 459–98. Society for Industrial and Applied Mathematics, 2022. <a href=\"https://doi.org/10.1137/1.9781611977073.23\">https://doi.org/10.1137/1.9781611977073.23</a>.","ieee":"M. H. Henzinger, A. Lincoln, and B. Saha, “The complexity of average-case dynamic subgraph counting,” in <i>33rd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Alexandria, VA, United States, 2022, pp. 459–498.","apa":"Henzinger, M. H., Lincoln, A., &#38; Saha, B. (2022). The complexity of average-case dynamic subgraph counting. In <i>33rd Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 459–498). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611977073.23\">https://doi.org/10.1137/1.9781611977073.23</a>"},"language":[{"iso":"eng"}],"publication_identifier":{"eisbn":["978-1-61197-707-3"]},"month":"01","status":"public","day":"01","oa_version":"None","date_created":"2022-08-18T07:26:19Z","conference":{"location":"Alexandria, VA, United States","start_date":"2022-01-09","name":"SODA: Symposium on Discrete Algorithms","end_date":"2022-01-12"},"title":"The complexity of average-case dynamic subgraph counting","publication":"33rd Annual ACM-SIAM Symposium on Discrete Algorithms","publisher":"Society for Industrial and Applied Mathematics","scopus_import":"1","abstract":[{"text":"Statistics of small subgraph counts such as triangles, four-cycles, and s-t paths of short lengths reveal important structural properties of the underlying graph. These problems have been widely studied in social network analysis. In most relevant applications, the graphs are not only massive but also change dynamically over time. Most of these problems become hard in the dynamic setting when considering the worst case. In this paper, we ask whether the question of small subgraph counting over dynamic graphs is hard also in the average case.\r\n\r\nWe consider the simplest possible average case model where the updates follow an Erdős-Rényi graph: each update selects a pair of vertices (u, v) uniformly at random and flips the existence of the edge (u, v). We develop new lower bounds and matching algorithms in this model for counting four-cycles, counting triangles through a specified point s, or a random queried point, and st paths of length 3, 4 and 5. Our results indicate while computing st paths of length 3, and 4 are easy in the average case with O(1) update time (note that they are hard in the worst case), it becomes hard when considering st paths of length 5.\r\n\r\nWe introduce new techniques which allow us to get average-case hardness for these graph problems from the worst-case hardness of the Online Matrix vector problem (OMv). Our techniques rely on recent advances in fine-grained average-case complexity. Our techniques advance this literature, giving the ability to prove new lower bounds on average-case dynamic algorithms.","lang":"eng"}],"extern":"1","quality_controlled":"1","author":[{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger"},{"full_name":"Lincoln, Andrea","first_name":"Andrea","last_name":"Lincoln"},{"full_name":"Saha, Barna","first_name":"Barna","last_name":"Saha"}],"date_published":"2022-01-01T00:00:00Z","doi":"10.1137/1.9781611977073.23","date_updated":"2023-02-17T11:23:02Z","article_processing_charge":"No"},{"publication_identifier":{"eisbn":["978-1-61197-704-2"]},"citation":{"ieee":"M. H. Henzinger, A. Noe, and C. Schulz, “Practical fully dynamic minimum cut algorithms,” in <i>2022 Proceedings of the Symposium on Algorithm Engineering and Experiments</i>, Alexandria, VA, United States, 2022, pp. 13–26.","chicago":"Henzinger, Monika H, Alexander Noe, and Christian Schulz. “Practical Fully Dynamic Minimum Cut Algorithms.” In <i>2022 Proceedings of the Symposium on Algorithm Engineering and Experiments</i>, 13–26. Society for Industrial and Applied Mathematics, 2022. <a href=\"https://doi.org/10.1137/1.9781611977042.2\">https://doi.org/10.1137/1.9781611977042.2</a>.","apa":"Henzinger, M. H., Noe, A., &#38; Schulz, C. (2022). Practical fully dynamic minimum cut algorithms. In <i>2022 Proceedings of the Symposium on Algorithm Engineering and Experiments</i> (pp. 13–26). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611977042.2\">https://doi.org/10.1137/1.9781611977042.2</a>","ama":"Henzinger MH, Noe A, Schulz C. Practical fully dynamic minimum cut algorithms. In: <i>2022 Proceedings of the Symposium on Algorithm Engineering and Experiments</i>. Society for Industrial and Applied Mathematics; 2022:13-26. doi:<a href=\"https://doi.org/10.1137/1.9781611977042.2\">10.1137/1.9781611977042.2</a>","short":"M.H. Henzinger, A. Noe, C. Schulz, in:, 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2022, pp. 13–26.","mla":"Henzinger, Monika H., et al. “Practical Fully Dynamic Minimum Cut Algorithms.” <i>2022 Proceedings of the Symposium on Algorithm Engineering and Experiments</i>, Society for Industrial and Applied Mathematics, 2022, pp. 13–26, doi:<a href=\"https://doi.org/10.1137/1.9781611977042.2\">10.1137/1.9781611977042.2</a>.","ista":"Henzinger MH, Noe A, Schulz C. 2022. Practical fully dynamic minimum cut algorithms. 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments. ALENEX: Symposium on Algorithm Engineering and Experiments, 13–26."},"external_id":{"arxiv":["2101.05033"]},"oa":1,"status":"public","year":"2022","_id":"11930","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","page":"13-26","extern":"1","abstract":[{"text":"We present a practically efficient algorithm for maintaining a global minimum cut in large dynamic graphs under both edge insertions and deletions. While there has been theoretical work on this problem, our algorithm is the first implementation of a fully-dynamic algorithm. The algorithm uses the theoretical foundation and combines it with efficient and finely-tuned implementations to give an algorithm that can maintain the global minimum cut of a graph with rapid update times. We show that our algorithm gives up to multiple orders of magnitude speedup compared to static approaches both on edge insertions and deletions.","lang":"eng"}],"arxiv":1,"date_created":"2022-08-19T07:27:51Z","oa_version":"Preprint","publisher":"Society for Industrial and Applied Mathematics","publication":"2022 Proceedings of the Symposium on Algorithm Engineering and Experiments","title":"Practical fully dynamic minimum cut algorithms","month":"01","language":[{"iso":"eng"}],"day":"01","publication_status":"published","main_file_link":[{"url":"https://arxiv.org/abs/2101.05033","open_access":"1"}],"quality_controlled":"1","scopus_import":"1","article_processing_charge":"No","date_updated":"2023-02-17T13:57:17Z","doi":"10.1137/1.9781611977042.2","date_published":"2022-01-01T00:00:00Z","author":[{"first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Noe","first_name":"Alexander","full_name":"Noe, Alexander"},{"first_name":"Christian","last_name":"Schulz","full_name":"Schulz, Christian"}],"conference":{"end_date":"2022-01-10","name":"ALENEX: Symposium on Algorithm Engineering and Experiments","start_date":"2022-01-09","location":"Alexandria, VA, United States"}},{"abstract":[{"lang":"eng","text":"The ability to form and retrieve memories is central to survival. In mammals, the hippocampus\r\nis a brain region essential to the acquisition and consolidation of new memories. It is also\r\ninvolved in keeping track of one’s position in space and aids navigation. Although this\r\nspace-memory has been a source of contradiction, evidence supports the view that the role of\r\nthe hippocampus in navigation is memory, thanks to the formation of cognitive maps. First\r\nintroduced by Tolman in 1948, cognitive maps are generally used to organize experiences in\r\nmemory; however, the detailed mechanisms by which these maps are formed and stored are not\r\nyet agreed upon. Some influential theories describe this process as involving three fundamental\r\nsteps: initial encoding by the hippocampus, interactions between the hippocampus and other\r\ncortical areas, and long-term extra-hippocampal consolidation. In this thesis, I will show how\r\nthe investigation of cognitive maps of space helped to shed light on each of these three memory\r\nprocesses.\r\nThe first study included in this thesis deals with the initial encoding of spatial memories in\r\nthe hippocampus. Much is known about encoding at the level of single cells, but less about\r\ntheir co-activity or joint contribution to the encoding of novel spatial information. I will\r\ndescribe the structure of an interaction network that allows for efficient encoding of noisy\r\nspatial information during the first exploration of a novel environment.\r\nThe second study describes the interactions between the hippocampus and the prefrontal\r\ncortex (PFC), two areas directly and indirectly connected. It is known that the PFC, in concert\r\nwith the hippocampus, is involved in various processes, including memory storage and spatial\r\nnavigation. Nonetheless, the detailed mechanisms by which PFC receives information from the\r\nhippocampus are not clear. I will show how a transient improvement in theta phase locking of\r\nPFC cells enables interactions of cell pairs across the two regions.\r\nThe third study describes the learning of behaviorally-relevant spatial locations in the hippocampus and the medial entorhinal cortex. I will show how the accumulation of firing around\r\ngoal locations, a correlate of learning, can shed light on the transition from short- to long-term\r\nspatial memories and the speed of consolidation in different brain areas.\r\nThe studies included in this thesis represent the main scientific contributions of my Ph.D. They\r\ninvolve statistical analyses and models of neural responses of cells in different brain areas of\r\nrats executing spatial tasks. I will conclude the thesis by discussing the impact of the findings\r\non principles of memory formation and retention, including the mechanisms, the speed, and\r\nthe duration of these processes."}],"date_created":"2022-08-19T08:52:30Z","ec_funded":1,"oa_version":"Published Version","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"JoCs"}],"title":"On the encoding, transfer, and consolidation of spatial memories","publication_identifier":{"issn":["2663-337X"]},"citation":{"mla":"Nardin, Michele. <i>On the Encoding, Transfer, and Consolidation of Spatial Memories</i>. Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/at:ista:11932\">10.15479/at:ista:11932</a>.","ista":"Nardin M. 2022. On the encoding, transfer, and consolidation of spatial memories. Institute of Science and Technology Austria.","short":"M. Nardin, On the Encoding, Transfer, and Consolidation of Spatial Memories, Institute of Science and Technology Austria, 2022.","ama":"Nardin M. On the encoding, transfer, and consolidation of spatial memories. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:11932\">10.15479/at:ista:11932</a>","apa":"Nardin, M. (2022). <i>On the encoding, transfer, and consolidation of spatial memories</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:11932\">https://doi.org/10.15479/at:ista:11932</a>","chicago":"Nardin, Michele. “On the Encoding, Transfer, and Consolidation of Spatial Memories.” Institute of Science and Technology Austria, 2022. <a href=\"https://doi.org/10.15479/at:ista:11932\">https://doi.org/10.15479/at:ista:11932</a>.","ieee":"M. Nardin, “On the encoding, transfer, and consolidation of spatial memories,” Institute of Science and Technology Austria, 2022."},"acknowledgement":"I acknowledge the support from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 665385.","status":"public","oa":1,"year":"2022","has_accepted_license":"1","supervisor":[{"full_name":"Csicsvari, Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L","last_name":"Csicsvari","orcid":"0000-0002-5193-4036"}],"_id":"11932","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","type":"dissertation","page":"136","degree_awarded":"PhD","article_processing_charge":"No","doi":"10.15479/at:ista:11932","alternative_title":["ISTA Thesis"],"date_updated":"2023-09-05T12:02:14Z","related_material":{"record":[{"id":"10077","relation":"part_of_dissertation","status":"public"},{"id":"6194","status":"public","relation":"part_of_dissertation"}]},"author":[{"full_name":"Nardin, Michele","id":"30BD0376-F248-11E8-B48F-1D18A9856A87","first_name":"Michele","last_name":"Nardin","orcid":"0000-0001-8849-6570"}],"date_published":"2022-08-19T00:00:00Z","file_date_updated":"2023-06-20T22:30:04Z","month":"08","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","grant_number":"665385","call_identifier":"H2020"}],"language":[{"iso":"eng"}],"ddc":["573"],"day":"19","file":[{"file_id":"11935","date_updated":"2023-06-20T22:30:04Z","checksum":"2dbb70c74aaa3b64c1f463e943baf09c","file_name":"Michele Nardin, Ph.D. Thesis - ISTA (1).zip","file_size":13515457,"access_level":"closed","creator":"mnardin","relation":"source_file","date_created":"2022-08-19T16:31:34Z","embargo_to":"open_access","content_type":"application/zip"},{"content_type":"application/pdf","date_created":"2022-08-22T09:43:50Z","relation":"main_file","access_level":"open_access","creator":"mnardin","file_size":9906458,"file_name":"Michele_Nardin_Phd_Thesis_PDFA.pdf","checksum":"0ec94035ea35a47a9f589ed168e60b48","date_updated":"2023-06-20T22:30:04Z","embargo":"2023-06-19","file_id":"11941"}],"publication_status":"published"},{"volume":13,"type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"11937","year":"2022","has_accepted_license":"1","oa":1,"acknowledgement":"We thank Chris Pickard for providing the initial structures of high-pressure ice phases and for useful advice. A.R. and B.C. acknowledge resources provided by the Cambridge Tier-2 system operated by the University of Cambridge Research Computing Service funded by EPSRC Tier-2 capital grant EP/P020259/1. M.B. was supported by the European Union within the Marie Skłodowska-Curie actions (xICE grant 894725) and acknowledges computational resources at North-German Supercomputing Alliance (HLRN) facilities. S.H. and M.M. acknowledge support from LDRD 19-ERD-031 and computing support from the Lawrence Livermore National Laboratory (LLNL) Institutional Computing Grand Challenge programme. F.C. acknowledges support from the US DOE Office of Science, Office of Fusion Energy Sciences. Lawrence Livermore National Laboratory is operated by Lawrence Livermore National Security, LLC, for the U.S. Department of Energy, National Nuclear Security Administration under Contract DE-AC52-07NA27344.","status":"public","article_type":"original","external_id":{"pmid":["35948550"],"isi":["000838655300022"]},"citation":{"ista":"Reinhardt A, Bethkenhagen M, Coppari F, Millot M, Hamel S, Cheng B. 2022. Thermodynamics of high-pressure ice phases explored with atomistic simulations. Nature Communications. 13, 4707.","mla":"Reinhardt, Aleks, et al. “Thermodynamics of High-Pressure Ice Phases Explored with Atomistic Simulations.” <i>Nature Communications</i>, vol. 13, 4707, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1038/s41467-022-32374-1\">10.1038/s41467-022-32374-1</a>.","short":"A. Reinhardt, M. Bethkenhagen, F. Coppari, M. Millot, S. Hamel, B. Cheng, Nature Communications 13 (2022).","ama":"Reinhardt A, Bethkenhagen M, Coppari F, Millot M, Hamel S, Cheng B. Thermodynamics of high-pressure ice phases explored with atomistic simulations. <i>Nature Communications</i>. 2022;13. doi:<a href=\"https://doi.org/10.1038/s41467-022-32374-1\">10.1038/s41467-022-32374-1</a>","apa":"Reinhardt, A., Bethkenhagen, M., Coppari, F., Millot, M., Hamel, S., &#38; Cheng, B. (2022). Thermodynamics of high-pressure ice phases explored with atomistic simulations. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-022-32374-1\">https://doi.org/10.1038/s41467-022-32374-1</a>","chicago":"Reinhardt, Aleks, Mandy Bethkenhagen, Federica Coppari, Marius Millot, Sebastien Hamel, and Bingqing Cheng. “Thermodynamics of High-Pressure Ice Phases Explored with Atomistic Simulations.” <i>Nature Communications</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1038/s41467-022-32374-1\">https://doi.org/10.1038/s41467-022-32374-1</a>.","ieee":"A. Reinhardt, M. Bethkenhagen, F. Coppari, M. Millot, S. Hamel, and B. Cheng, “Thermodynamics of high-pressure ice phases explored with atomistic simulations,” <i>Nature Communications</i>, vol. 13. Springer Nature, 2022."},"publication_identifier":{"eissn":["2041-1723"]},"title":"Thermodynamics of high-pressure ice phases explored with atomistic simulations","department":[{"_id":"BiCh"}],"publication":"Nature Communications","publisher":"Springer Nature","oa_version":"Published Version","date_created":"2022-08-21T22:01:55Z","abstract":[{"lang":"eng","text":"Most experimentally known high-pressure ice phases have a body-centred cubic (bcc) oxygen lattice. Our large-scale molecular-dynamics simulations with a machine-learning potential indicate that, amongst these bcc ice phases, ices VII, VII′ and X are the same thermodynamic phase under different conditions, whereas superionic ice VII″ has a first-order phase boundary with ice VII′. Moreover, at about 300 GPa, the transformation between ice X and the Pbcm phase has a sharp structural change but no apparent activation barrier, whilst at higher pressures the barrier gradually increases. Our study thus clarifies the phase behaviour of the high-pressure ices and reveals peculiar solid–solid transition mechanisms not known in other systems."}],"intvolume":"        13","publication_status":"published","file":[{"content_type":"application/pdf","date_created":"2022-08-22T06:33:02Z","success":1,"relation":"main_file","creator":"dernst","access_level":"open_access","file_size":1767206,"checksum":"8ff9b689cde59fd3a9959a9f01929dea","file_name":"2022_NatureCommunications_Reinhardt.pdf","file_id":"11939","date_updated":"2022-08-22T06:33:02Z"}],"pmid":1,"day":"10","ddc":["540"],"language":[{"iso":"eng"}],"month":"08","isi":1,"file_date_updated":"2022-08-22T06:33:02Z","article_number":"4707","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_published":"2022-08-10T00:00:00Z","author":[{"full_name":"Reinhardt, Aleks","last_name":"Reinhardt","first_name":"Aleks"},{"last_name":"Bethkenhagen","first_name":"Mandy","full_name":"Bethkenhagen, Mandy"},{"first_name":"Federica","last_name":"Coppari","full_name":"Coppari, Federica"},{"full_name":"Millot, Marius","first_name":"Marius","last_name":"Millot"},{"first_name":"Sebastien","last_name":"Hamel","full_name":"Hamel, Sebastien"},{"first_name":"Bingqing","last_name":"Cheng","orcid":"0000-0002-3584-9632","full_name":"Cheng, Bingqing","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9"}],"doi":"10.1038/s41467-022-32374-1","date_updated":"2023-08-03T13:00:40Z","article_processing_charge":"No","scopus_import":"1","quality_controlled":"1"},{"file_date_updated":"2022-08-22T06:42:42Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_processing_charge":"No","related_material":{"record":[{"id":"9296","relation":"earlier_version","status":"public"}]},"doi":"10.7155/jgaa.00591","date_updated":"2023-02-23T13:54:21Z","author":[{"full_name":"Aichholzer, Oswin","last_name":"Aichholzer","first_name":"Oswin"},{"id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","full_name":"Arroyo Guevara, Alan M","last_name":"Arroyo Guevara","orcid":"0000-0003-2401-8670","first_name":"Alan M"},{"full_name":"Masárová, Zuzana","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","first_name":"Zuzana","orcid":"0000-0002-6660-1322","last_name":"Masárová"},{"full_name":"Parada, Irene","first_name":"Irene","last_name":"Parada"},{"last_name":"Perz","first_name":"Daniel","full_name":"Perz, Daniel"},{"full_name":"Pilz, Alexander","first_name":"Alexander","last_name":"Pilz"},{"last_name":"Tkadlec","orcid":"0000-0002-1097-9684","first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef"},{"full_name":"Vogtenhuber, Birgit","last_name":"Vogtenhuber","first_name":"Birgit"}],"date_published":"2022-06-01T00:00:00Z","quality_controlled":"1","scopus_import":"1","file":[{"date_updated":"2022-08-22T06:42:42Z","file_id":"11940","file_name":"2022_JourGraphAlgorithmsApplic_Aichholzer.pdf","checksum":"dc6e255e3558faff924fd9e370886c11","file_size":694538,"creator":"dernst","access_level":"open_access","relation":"main_file","success":1,"date_created":"2022-08-22T06:42:42Z","content_type":"application/pdf"}],"publication_status":"published","intvolume":"        26","ddc":["000"],"day":"01","month":"06","project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"},{"call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","name":"The Wittgenstein Prize"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"publisher":"Brown University","publication":"Journal of Graph Algorithms and Applications","title":"On compatible matchings","department":[{"_id":"UlWa"},{"_id":"HeEd"},{"_id":"KrCh"}],"date_created":"2022-08-21T22:01:56Z","ec_funded":1,"oa_version":"Published Version","arxiv":1,"abstract":[{"text":"A matching is compatible to two or more labeled point sets of size n with labels {1, . . . , n} if its straight-line drawing on each of these point sets is crossing-free. We study the maximum number of edges in a matching compatible to two or more labeled point sets in general position in the plane. We show that for any two labeled sets of n points in convex position there exists a compatible matching with ⌊√2n + 1 − 1⌋ edges. More generally, for any ℓ labeled point sets we construct compatible matchings of size Ω(n1/ℓ). As a corresponding upper bound, we use probabilistic arguments to show that for any ℓ given sets of n points there exists a labeling of each set such that the largest compatible matching has O(n2/(ℓ+1)) edges. Finally, we show that Θ(log n) copies of any set of n points are necessary and sufficient for the existence of labelings of these point sets such that any compatible matching consists only of a single edge.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","volume":26,"page":"225-240","has_accepted_license":"1","year":"2022","_id":"11938","issue":"2","external_id":{"arxiv":["2101.03928"]},"article_type":"original","oa":1,"status":"public","acknowledgement":"A.A. funded by the Marie Sklodowska-Curie grant agreement No 754411. Z.M. partially funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31. I.P., D.P., and B.V. partially supported by FWF within the collaborative DACH project Arrangements and Drawings as FWF project I 3340-N35. A.P. supported by a Schrödinger fellowship of the FWF: J-3847-N35. J.T. partially supported by ERC Start grant no. (279307: Graph Games), FWF grant no. P23499-N23 and S11407-N23 (RiSE).","publication_identifier":{"issn":["1526-1719"]},"citation":{"apa":"Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A., … Vogtenhuber, B. (2022). On compatible matchings. <i>Journal of Graph Algorithms and Applications</i>. Brown University. <a href=\"https://doi.org/10.7155/jgaa.00591\">https://doi.org/10.7155/jgaa.00591</a>","chicago":"Aichholzer, Oswin, Alan M Arroyo Guevara, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. “On Compatible Matchings.” <i>Journal of Graph Algorithms and Applications</i>. Brown University, 2022. <a href=\"https://doi.org/10.7155/jgaa.00591\">https://doi.org/10.7155/jgaa.00591</a>.","ieee":"O. Aichholzer <i>et al.</i>, “On compatible matchings,” <i>Journal of Graph Algorithms and Applications</i>, vol. 26, no. 2. Brown University, pp. 225–240, 2022.","mla":"Aichholzer, Oswin, et al. “On Compatible Matchings.” <i>Journal of Graph Algorithms and Applications</i>, vol. 26, no. 2, Brown University, 2022, pp. 225–40, doi:<a href=\"https://doi.org/10.7155/jgaa.00591\">10.7155/jgaa.00591</a>.","short":"O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, Journal of Graph Algorithms and Applications 26 (2022) 225–240.","ista":"Aichholzer O, Arroyo Guevara AM, Masárová Z, Parada I, Perz D, Pilz A, Tkadlec J, Vogtenhuber B. 2022. On compatible matchings. Journal of Graph Algorithms and Applications. 26(2), 225–240.","ama":"Aichholzer O, Arroyo Guevara AM, Masárová Z, et al. On compatible matchings. <i>Journal of Graph Algorithms and Applications</i>. 2022;26(2):225-240. doi:<a href=\"https://doi.org/10.7155/jgaa.00591\">10.7155/jgaa.00591</a>"}},{"article_processing_charge":"No","date_updated":"2024-03-25T23:30:11Z","related_material":{"record":[{"id":"12470","status":"public","relation":"dissertation_contains"}]},"doi":"10.1101/2022.03.16.484431","author":[{"first_name":"Philipp","last_name":"Velicky","orcid":"0000-0002-2340-7431","full_name":"Velicky, Philipp","id":"39BDC62C-F248-11E8-B48F-1D18A9856A87"},{"id":"3FB91342-F248-11E8-B48F-1D18A9856A87","full_name":"Miguel Villalba, Eder","orcid":"0000-0001-5665-0430","last_name":"Miguel Villalba","first_name":"Eder"},{"full_name":"Michalska, Julia M","id":"443DB6DE-F248-11E8-B48F-1D18A9856A87","first_name":"Julia M","last_name":"Michalska","orcid":"0000-0003-3862-1235"},{"full_name":"Wei, Donglai","first_name":"Donglai","last_name":"Wei"},{"last_name":"Lin","first_name":"Zudi","full_name":"Lin, Zudi"},{"id":"63836096-4690-11EA-BD4E-32803DDC885E","full_name":"Watson, Jake","last_name":"Watson","orcid":"0000-0002-8698-3823","first_name":"Jake"},{"full_name":"Troidl, Jakob","last_name":"Troidl","first_name":"Jakob"},{"last_name":"Beyer","first_name":"Johanna","full_name":"Beyer, Johanna"},{"first_name":"Yoav","last_name":"Ben Simon","full_name":"Ben Simon, Yoav","id":"43DF3136-F248-11E8-B48F-1D18A9856A87"},{"id":"4DF26D8C-F248-11E8-B48F-1D18A9856A87","full_name":"Sommer, Christoph M","last_name":"Sommer","orcid":"0000-0003-1216-9105","first_name":"Christoph M"},{"full_name":"Jahr, Wiebke","id":"425C1CE8-F248-11E8-B48F-1D18A9856A87","first_name":"Wiebke","last_name":"Jahr"},{"first_name":"Alban","last_name":"Cenameri","full_name":"Cenameri, Alban","id":"9ac8f577-2357-11eb-997a-e566c5550886"},{"full_name":"Broichhagen, Johannes","last_name":"Broichhagen","first_name":"Johannes"},{"first_name":"Seth G. N.","last_name":"Grant","full_name":"Grant, Seth G. N."},{"full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","orcid":"0000-0001-5001-4804","last_name":"Jonas"},{"orcid":"0000-0002-7673-7178","last_name":"Novarino","first_name":"Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","full_name":"Novarino, Gaia"},{"first_name":"Hanspeter","last_name":"Pfister","full_name":"Pfister, Hanspeter"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","last_name":"Bickel","first_name":"Bernd"},{"last_name":"Danzl","orcid":"0000-0001-8559-3973","first_name":"Johann G","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","full_name":"Danzl, Johann G"}],"date_published":"2022-05-09T00:00:00Z","abstract":[{"lang":"eng","text":"Complex wiring between neurons underlies the information-processing network enabling all brain functions, including cognition and memory. For understanding how the network is structured, processes information, and changes over time, comprehensive visualization of the architecture of living brain tissue with its cellular and molecular components would open up major opportunities. However, electron microscopy (EM) provides nanometre-scale resolution required for full <jats:italic>in-silico</jats:italic> reconstruction<jats:sup>1–5</jats:sup>, yet is limited to fixed specimens and static representations. Light microscopy allows live observation, with super-resolution approaches<jats:sup>6–12</jats:sup> facilitating nanoscale visualization, but comprehensive 3D-reconstruction of living brain tissue has been hindered by tissue photo-burden, photobleaching, insufficient 3D-resolution, and inadequate signal-to-noise ratio (SNR). Here we demonstrate saturated reconstruction of living brain tissue. We developed an integrated imaging and analysis technology, adapting stimulated emission depletion (STED) microscopy<jats:sup>6,13</jats:sup> in extracellularly labelled tissue<jats:sup>14</jats:sup> for high SNR and near-isotropic resolution. Centrally, a two-stage deep-learning approach leveraged previously obtained information on sample structure to drastically reduce photo-burden and enable automated volumetric reconstruction down to single synapse level. Live reconstruction provides unbiased analysis of tissue architecture across time in relation to functional activity and targeted activation, and contextual understanding of molecular labelling. This adoptable technology will facilitate novel insights into the dynamic functional architecture of living brain tissue."}],"publisher":"Cold Spring Harbor Laboratory","publication":"bioRxiv","department":[{"_id":"PeJo"},{"_id":"GaNo"},{"_id":"BeBi"},{"_id":"JoDa"}],"title":"Saturated reconstruction of living brain tissue","date_created":"2022-08-23T11:07:59Z","oa_version":"Preprint","day":"09","status":"public","oa":1,"month":"05","language":[{"iso":"eng"}],"citation":{"apa":"Velicky, P., Miguel Villalba, E., Michalska, J. M., Wei, D., Lin, Z., Watson, J., … Danzl, J. G. (n.d.). Saturated reconstruction of living brain tissue. <i>bioRxiv</i>. Cold Spring Harbor Laboratory. <a href=\"https://doi.org/10.1101/2022.03.16.484431\">https://doi.org/10.1101/2022.03.16.484431</a>","ieee":"P. Velicky <i>et al.</i>, “Saturated reconstruction of living brain tissue,” <i>bioRxiv</i>. Cold Spring Harbor Laboratory.","chicago":"Velicky, Philipp, Eder Miguel Villalba, Julia M Michalska, Donglai Wei, Zudi Lin, Jake Watson, Jakob Troidl, et al. “Saturated Reconstruction of Living Brain Tissue.” <i>BioRxiv</i>. Cold Spring Harbor Laboratory, n.d. <a href=\"https://doi.org/10.1101/2022.03.16.484431\">https://doi.org/10.1101/2022.03.16.484431</a>.","ista":"Velicky P, Miguel Villalba E, Michalska JM, Wei D, Lin Z, Watson J, Troidl J, Beyer J, Ben Simon Y, Sommer CM, Jahr W, Cenameri A, Broichhagen J, Grant SGN, Jonas PM, Novarino G, Pfister H, Bickel B, Danzl JG. Saturated reconstruction of living brain tissue. bioRxiv, <a href=\"https://doi.org/10.1101/2022.03.16.484431\">10.1101/2022.03.16.484431</a>.","short":"P. Velicky, E. Miguel Villalba, J.M. Michalska, D. Wei, Z. Lin, J. Watson, J. Troidl, J. Beyer, Y. Ben Simon, C.M. Sommer, W. Jahr, A. Cenameri, J. Broichhagen, S.G.N. Grant, P.M. Jonas, G. Novarino, H. Pfister, B. Bickel, J.G. Danzl, BioRxiv (n.d.).","mla":"Velicky, Philipp, et al. “Saturated Reconstruction of Living Brain Tissue.” <i>BioRxiv</i>, Cold Spring Harbor Laboratory, doi:<a href=\"https://doi.org/10.1101/2022.03.16.484431\">10.1101/2022.03.16.484431</a>.","ama":"Velicky P, Miguel Villalba E, Michalska JM, et al. Saturated reconstruction of living brain tissue. <i>bioRxiv</i>. doi:<a href=\"https://doi.org/10.1101/2022.03.16.484431\">10.1101/2022.03.16.484431</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"preprint","year":"2022","publication_status":"submitted","main_file_link":[{"url":"https://doi.org/10.1101/2022.03.16.484431","open_access":"1"}],"_id":"11943"}]