[{"date_created":"2020-09-17T10:26:53Z","date_published":"2020-01-06T00:00:00Z","doi":"10.1186/s12915-019-0733-6","year":"2020","publication":"BMC Biology","day":"06","oa":1,"publisher":"Springer Nature","quality_controlled":"1","article_processing_charge":"No","external_id":{"pmid":["31907035"]},"author":[{"last_name":"Rampelt","full_name":"Rampelt, Heike","first_name":"Heike"},{"full_name":"Sucec, Iva","last_name":"Sucec","first_name":"Iva"},{"first_name":"Beate","full_name":"Bersch, Beate","last_name":"Bersch"},{"full_name":"Horten, Patrick","last_name":"Horten","first_name":"Patrick"},{"full_name":"Perschil, Inge","last_name":"Perschil","first_name":"Inge"},{"first_name":"Jean-Claude","full_name":"Martinou, Jean-Claude","last_name":"Martinou"},{"last_name":"van der Laan","full_name":"van der Laan, Martin","first_name":"Martin"},{"full_name":"Wiedemann, Nils","last_name":"Wiedemann","first_name":"Nils"},{"id":"7B541462-FAF6-11E9-A490-E8DFE5697425","first_name":"Paul","full_name":"Schanda, Paul","orcid":"0000-0002-9350-7606","last_name":"Schanda"},{"first_name":"Nikolaus","full_name":"Pfanner, Nikolaus","last_name":"Pfanner"}],"title":"The mitochondrial carrier pathway transports non-canonical substrates with an odd number of transmembrane segments","citation":{"mla":"Rampelt, Heike, et al. “The Mitochondrial Carrier Pathway Transports Non-Canonical Substrates with an Odd Number of Transmembrane Segments.” BMC Biology, vol. 18, 2, Springer Nature, 2020, doi:10.1186/s12915-019-0733-6.","apa":"Rampelt, H., Sucec, I., Bersch, B., Horten, P., Perschil, I., Martinou, J.-C., … Pfanner, N. (2020). The mitochondrial carrier pathway transports non-canonical substrates with an odd number of transmembrane segments. BMC Biology. Springer Nature. https://doi.org/10.1186/s12915-019-0733-6","ama":"Rampelt H, Sucec I, Bersch B, et al. The mitochondrial carrier pathway transports non-canonical substrates with an odd number of transmembrane segments. BMC Biology. 2020;18. doi:10.1186/s12915-019-0733-6","short":"H. Rampelt, I. Sucec, B. Bersch, P. Horten, I. Perschil, J.-C. Martinou, M. van der Laan, N. Wiedemann, P. Schanda, N. Pfanner, BMC Biology 18 (2020).","ieee":"H. Rampelt et al., “The mitochondrial carrier pathway transports non-canonical substrates with an odd number of transmembrane segments,” BMC Biology, vol. 18. Springer Nature, 2020.","chicago":"Rampelt, Heike, Iva Sucec, Beate Bersch, Patrick Horten, Inge Perschil, Jean-Claude Martinou, Martin van der Laan, Nils Wiedemann, Paul Schanda, and Nikolaus Pfanner. “The Mitochondrial Carrier Pathway Transports Non-Canonical Substrates with an Odd Number of Transmembrane Segments.” BMC Biology. Springer Nature, 2020. https://doi.org/10.1186/s12915-019-0733-6.","ista":"Rampelt H, Sucec I, Bersch B, Horten P, Perschil I, Martinou J-C, van der Laan M, Wiedemann N, Schanda P, Pfanner N. 2020. The mitochondrial carrier pathway transports non-canonical substrates with an odd number of transmembrane segments. BMC Biology. 18, 2."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"2","volume":18,"publication_status":"published","publication_identifier":{"issn":["1741-7007"]},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1186/s12915-019-0733-6"}],"intvolume":" 18","month":"01","abstract":[{"text":"Background: The mitochondrial pyruvate carrier (MPC) plays a central role in energy metabolism by transporting pyruvate across the inner mitochondrial membrane. Its heterodimeric composition and homology to SWEET and semiSWEET transporters set the MPC apart from the canonical mitochondrial carrier family (named MCF or SLC25). The import of the canonical carriers is mediated by the carrier translocase of the inner membrane (TIM22) pathway and is dependent on their structure, which features an even number of transmembrane segments and both termini in the intermembrane space. The import pathway of MPC proteins has not been elucidated. The odd number of transmembrane segments and positioning of the N-terminus in the matrix argues against an import via the TIM22 carrier pathway but favors an import via the flexible presequence pathway.\r\nResults: Here, we systematically analyzed the import pathways of Mpc2 and Mpc3 and report that, contrary to an expected import via the flexible presequence pathway, yeast MPC proteins with an odd number of transmembrane segments and matrix-exposed N-terminus are imported by the carrier pathway, using the receptor Tom70, small TIM chaperones, and the TIM22 complex. The TIM9·10 complex chaperones MPC proteins through the mitochondrial intermembrane space using conserved hydrophobic motifs that are also required for the interaction with canonical carrier proteins.\r\nConclusions: The carrier pathway can import paired and non-paired transmembrane helices and translocate N-termini to either side of the mitochondrial inner membrane, revealing an unexpected versatility of the mitochondrial import pathway for non-cleavable inner membrane proteins.","lang":"eng"}],"pmid":1,"oa_version":"Published Version","date_updated":"2021-01-12T08:19:02Z","extern":"1","type":"journal_article","article_type":"original","keyword":["Biotechnology","Plant Science","General Biochemistry","Genetics and Molecular Biology","Developmental Biology","Cell Biology","Physiology","Ecology","Evolution","Behavior and Systematics","Structural Biology","General Agricultural and Biological Sciences"],"status":"public","_id":"8402"},{"date_updated":"2021-01-12T08:19:03Z","citation":{"ista":"Weinhäupl K, Wang Y, Hessel A, Brennich M, Lindorff-Larsen K, Schanda P. Architecture and subunit dynamics of the mitochondrial TIM9·10·12 chaperone. bioRxiv, 10.1101/2020.03.13.990150.","chicago":"Weinhäupl, Katharina, Yong Wang, Audrey Hessel, Martha Brennich, Kresten Lindorff-Larsen, and Paul Schanda. “Architecture and Subunit Dynamics of the Mitochondrial TIM9·10·12 Chaperone.” BioRxiv. Cold Spring Harbor Laboratory, n.d. https://doi.org/10.1101/2020.03.13.990150.","apa":"Weinhäupl, K., Wang, Y., Hessel, A., Brennich, M., Lindorff-Larsen, K., & Schanda, P. (n.d.). Architecture and subunit dynamics of the mitochondrial TIM9·10·12 chaperone. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/2020.03.13.990150","ama":"Weinhäupl K, Wang Y, Hessel A, Brennich M, Lindorff-Larsen K, Schanda P. Architecture and subunit dynamics of the mitochondrial TIM9·10·12 chaperone. bioRxiv. doi:10.1101/2020.03.13.990150","ieee":"K. Weinhäupl, Y. Wang, A. Hessel, M. Brennich, K. Lindorff-Larsen, and P. Schanda, “Architecture and subunit dynamics of the mitochondrial TIM9·10·12 chaperone,” bioRxiv. Cold Spring Harbor Laboratory.","short":"K. Weinhäupl, Y. Wang, A. Hessel, M. Brennich, K. Lindorff-Larsen, P. Schanda, BioRxiv (n.d.).","mla":"Weinhäupl, Katharina, et al. “Architecture and Subunit Dynamics of the Mitochondrial TIM9·10·12 Chaperone.” BioRxiv, Cold Spring Harbor Laboratory, doi:10.1101/2020.03.13.990150."},"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Katharina","full_name":"Weinhäupl, Katharina","last_name":"Weinhäupl"},{"full_name":"Wang, Yong","last_name":"Wang","first_name":"Yong"},{"last_name":"Hessel","full_name":"Hessel, Audrey","first_name":"Audrey"},{"last_name":"Brennich","full_name":"Brennich, Martha","first_name":"Martha"},{"full_name":"Lindorff-Larsen, Kresten","last_name":"Lindorff-Larsen","first_name":"Kresten"},{"orcid":"0000-0002-9350-7606","full_name":"Schanda, Paul","last_name":"Schanda","first_name":"Paul","id":"7B541462-FAF6-11E9-A490-E8DFE5697425"}],"article_processing_charge":"No","title":"Architecture and subunit dynamics of the mitochondrial TIM9·10·12 chaperone","_id":"8404","type":"preprint","status":"public","year":"2020","publication_status":"submitted","day":"14","publication":"bioRxiv","language":[{"iso":"eng"}],"date_published":"2020-03-14T00:00:00Z","doi":"10.1101/2020.03.13.990150","date_created":"2020-09-17T10:27:59Z","abstract":[{"lang":"eng","text":"The mitochondrial Tim chaperones are responsible for the transport of membrane proteins across the inter-membrane space to the inner and outer mitochondrial membranes. TIM9·10, a hexameric 70 kDa protein complex formed by 3 copies of Tim9 and Tim10, guides its clients across the aqueous compartment. The TIM9·10·12 complex is the anchor point at the inner-membrane insertase complex TIM22. The mechanism of client transport by TIM9·10 has been resolved recently, but the structure and subunit composition of the TIM9·10·12 complex remains largely unresolved. Furthermore, the assembly process of the hexameric TIM chaperones from its subunits remained elusive. We investigate the structural and dynamical properties of the Tim subunits, and show that they are highly dynamic. In their non-assembled form, the subunits behave as intrinsically disordered proteins; when the conserved cysteines of the CX3C-Xn-CX3C motifs are formed, short marginally stable α-helices are formed, which are only fully stabilized upon hexamer formation to the mature chaperone. Subunits are in equilibrium between their hexamer-embedded and a free form, with exchange kinetics on a minutes time scale. Joint NMR, small-angle X-ray scattering and MD simulation data allow us to derive a structural model of the TIM9·10·12 assembly, which has a 2:3:1 stoichiometry (Tim9:Tim10:Tim12) with a conserved hydrophobic client-binding groove and flexible N- and C-terminal tentacles."}],"oa_version":"Preprint","publisher":"Cold Spring Harbor Laboratory","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/2020.03.13.990150"}],"month":"03"},{"author":[{"first_name":"Iva","last_name":"Sučec","full_name":"Sučec, Iva"},{"last_name":"Wang","full_name":"Wang, Yong","first_name":"Yong"},{"first_name":"Ons","full_name":"Dakhlaoui, Ons","last_name":"Dakhlaoui"},{"full_name":"Weinhäupl, Katharina","last_name":"Weinhäupl","first_name":"Katharina"},{"full_name":"Jores, Tobias","last_name":"Jores","first_name":"Tobias"},{"first_name":"Doriane","full_name":"Costa, Doriane","last_name":"Costa"},{"full_name":"Hessel, Audrey","last_name":"Hessel","first_name":"Audrey"},{"full_name":"Brennich, Martha","last_name":"Brennich","first_name":"Martha"},{"last_name":"Rapaport","full_name":"Rapaport, Doron","first_name":"Doron"},{"first_name":"Kresten","last_name":"Lindorff-Larsen","full_name":"Lindorff-Larsen, Kresten"},{"first_name":"Beate","last_name":"Bersch","full_name":"Bersch, Beate"},{"orcid":"0000-0002-9350-7606","full_name":"Schanda, Paul","last_name":"Schanda","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","first_name":"Paul"}],"article_processing_charge":"No","title":"Structural basis of client specificity in mitochondrial membrane-protein chaperones","date_updated":"2021-01-12T08:19:02Z","citation":{"chicago":"Sučec, Iva, Yong Wang, Ons Dakhlaoui, Katharina Weinhäupl, Tobias Jores, Doriane Costa, Audrey Hessel, et al. “Structural Basis of Client Specificity in Mitochondrial Membrane-Protein Chaperones.” BioRxiv. Cold Spring Harbor Laboratory, n.d. https://doi.org/10.1101/2020.06.08.140772.","ista":"Sučec I, Wang Y, Dakhlaoui O, Weinhäupl K, Jores T, Costa D, Hessel A, Brennich M, Rapaport D, Lindorff-Larsen K, Bersch B, Schanda P. Structural basis of client specificity in mitochondrial membrane-protein chaperones. bioRxiv, 10.1101/2020.06.08.140772.","mla":"Sučec, Iva, et al. “Structural Basis of Client Specificity in Mitochondrial Membrane-Protein Chaperones.” BioRxiv, Cold Spring Harbor Laboratory, doi:10.1101/2020.06.08.140772.","apa":"Sučec, I., Wang, Y., Dakhlaoui, O., Weinhäupl, K., Jores, T., Costa, D., … Schanda, P. (n.d.). Structural basis of client specificity in mitochondrial membrane-protein chaperones. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/2020.06.08.140772","ama":"Sučec I, Wang Y, Dakhlaoui O, et al. Structural basis of client specificity in mitochondrial membrane-protein chaperones. bioRxiv. doi:10.1101/2020.06.08.140772","short":"I. Sučec, Y. Wang, O. Dakhlaoui, K. Weinhäupl, T. Jores, D. Costa, A. Hessel, M. Brennich, D. Rapaport, K. Lindorff-Larsen, B. Bersch, P. Schanda, BioRxiv (n.d.).","ieee":"I. Sučec et al., “Structural basis of client specificity in mitochondrial membrane-protein chaperones,” bioRxiv. Cold Spring Harbor Laboratory."},"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"preprint","status":"public","_id":"8403","doi":"10.1101/2020.06.08.140772","date_published":"2020-09-17T00:00:00Z","date_created":"2020-09-17T10:27:47Z","year":"2020","publication_status":"submitted","day":"17","language":[{"iso":"eng"}],"publication":"bioRxiv","publisher":"Cold Spring Harbor Laboratory","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/2020.06.08.140772"}],"month":"09","abstract":[{"text":"Chaperones are essential for assisting protein folding, and for transferring poorly soluble proteins to their functional locations within cells. Hydrophobic interactions drive promiscuous chaperone–client binding, but our understanding of how additional interactions enable client specificity is sparse. Here we decipher what determines binding of two chaperones (TIM8·13, TIM9·10) to different integral membrane proteins, the all-transmembrane mitochondrial carrier Ggc1, and Tim23 which has an additional disordered hydrophilic domain. Combining NMR, SAXS and molecular dynamics simulations, we determine the structures of Tim23/TIM8·13 and Tim23/TIM9·10 complexes. TIM8·13 uses transient salt bridges to interact with the hydrophilic part of its client, but its interactions to the transmembrane part are weaker than in TIM9·10. Consequently, TIM9·10 outcompetes TIM8·13 in binding hydrophobic clients, while TIM8·13 is tuned to few clients with both hydrophilic and hydrophobic parts. Our study exemplifies how chaperones fine-tune the balance of promiscuity vs. specificity.","lang":"eng"}],"oa_version":"Preprint"},{"project":[{"grant_number":"Z00312","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25C5A090-B435-11E9-9278-68D0E5697425"},{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Althoff, Matthias, Stanley Bak, Zongnan Bao, Marcelo Forets, Goran Frehse, Daniel Freire, Niklas Kochdumper, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Linear Dynamics.” In EPiC Series in Computing, 74:16–48. EasyChair, 2020. https://doi.org/10.29007/7dt2.","ista":"Althoff M, Bak S, Bao Z, Forets M, Frehse G, Freire D, Kochdumper N, Li Y, Mitra S, Ray R, Schilling C, Schupp S, Wetzlinger M. 2020. ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 74, 16–48.","mla":"Althoff, Matthias, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Linear Dynamics.” EPiC Series in Computing, vol. 74, EasyChair, 2020, pp. 16–48, doi:10.29007/7dt2.","ieee":"M. Althoff et al., “ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics,” in EPiC Series in Computing, 2020, vol. 74, pp. 16–48.","short":"M. Althoff, S. Bak, Z. Bao, M. Forets, G. Frehse, D. Freire, N. Kochdumper, Y. Li, S. Mitra, R. Ray, C. Schilling, S. Schupp, M. Wetzlinger, in:, EPiC Series in Computing, EasyChair, 2020, pp. 16–48.","ama":"Althoff M, Bak S, Bao Z, et al. ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. In: EPiC Series in Computing. Vol 74. EasyChair; 2020:16-48. doi:10.29007/7dt2","apa":"Althoff, M., Bak, S., Bao, Z., Forets, M., Frehse, G., Freire, D., … Wetzlinger, M. (2020). ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics. In EPiC Series in Computing (Vol. 74, pp. 16–48). EasyChair. https://doi.org/10.29007/7dt2"},"title":"ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics","article_processing_charge":"No","author":[{"first_name":"Matthias","last_name":"Althoff","full_name":"Althoff, Matthias"},{"first_name":"Stanley","last_name":"Bak","full_name":"Bak, Stanley"},{"first_name":"Zongnan","last_name":"Bao","full_name":"Bao, Zongnan"},{"full_name":"Forets, Marcelo","last_name":"Forets","first_name":"Marcelo"},{"full_name":"Frehse, Goran","last_name":"Frehse","first_name":"Goran"},{"last_name":"Freire","full_name":"Freire, Daniel","first_name":"Daniel"},{"full_name":"Kochdumper, Niklas","last_name":"Kochdumper","first_name":"Niklas"},{"first_name":"Yangge","last_name":"Li","full_name":"Li, Yangge"},{"first_name":"Sayan","last_name":"Mitra","full_name":"Mitra, Sayan"},{"first_name":"Rajarshi","last_name":"Ray","full_name":"Ray, Rajarshi"},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","orcid":"0000-0003-3658-1065","full_name":"Schilling, Christian","last_name":"Schilling"},{"last_name":"Schupp","full_name":"Schupp, Stefan","first_name":"Stefan"},{"last_name":"Wetzlinger","full_name":"Wetzlinger, Mark","first_name":"Mark"}],"acknowledgement":"The authors gratefully acknowledge financial support by the European Commission project\r\njustITSELF under grant number 817629, by the Austrian Science Fund (FWF) under grant\r\nZ211-N23 (Wittgenstein Award), by the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No. 754411, and by the\r\nScience and Engineering Research Board (SERB) project with file number IMP/2018/000523.\r\nThis material is based upon work supported by the Air Force Office of Scientific Research under\r\naward number FA9550-19-1-0288. Any opinions, finding, and conclusions or recommendations\r\nexpressed in this material are those of the author(s) and do not necessarily reflect the views of\r\nthe United States Air Force.","oa":1,"quality_controlled":"1","publisher":"EasyChair","publication":"EPiC Series in Computing","day":"25","year":"2020","date_created":"2020-09-26T14:49:43Z","doi":"10.29007/7dt2","date_published":"2020-09-25T00:00:00Z","page":"16-48","_id":"8572","status":"public","conference":{"name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","start_date":"2020-07-12","end_date":"2020-07-12"},"type":"conference","date_updated":"2021-01-12T08:20:06Z","department":[{"_id":"ToHe"}],"oa_version":"Published Version","abstract":[{"text":"We present the results of the ARCH 2020 friendly competition for formal verification of continuous and hybrid systems with linear continuous dynamics. In its fourth edition, eight tools have been applied to solve eight different benchmark problems in the category for linear continuous dynamics (in alphabetical order): CORA, C2E2, HyDRA, Hylaa, Hylaa-Continuous, JuliaReach, SpaceEx, and XSpeed. This report is a snapshot of the current landscape of tools and the types of benchmarks they are particularly suited for. Due to the diversity of problems, we are not ranking tools, yet the presented results provide one of the most complete assessments of tools for the safety verification of continuous and hybrid systems with linear continuous dynamics up to this date.","lang":"eng"}],"intvolume":" 74","month":"09","main_file_link":[{"open_access":"1","url":"https://easychair.org/publications/download/DRpS"}],"language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"volume":74},{"oa":1,"publisher":"EasyChair","quality_controlled":"1","acknowledgement":"Christian Schilling acknowledges support in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award) and the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No. 754411.","date_created":"2020-09-26T14:41:29Z","date_published":"2020-09-25T00:00:00Z","doi":"10.29007/zkf6","page":"49-75","publication":"EPiC Series in Computing","day":"25","year":"2020","project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"},{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"title":"ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics","article_processing_charge":"No","author":[{"first_name":"Luca","last_name":"Geretti","full_name":"Geretti, Luca"},{"full_name":"Alexandre Dit Sandretto, Julien","last_name":"Alexandre Dit Sandretto","first_name":"Julien"},{"last_name":"Althoff","full_name":"Althoff, Matthias","first_name":"Matthias"},{"first_name":"Luis","last_name":"Benet","full_name":"Benet, Luis"},{"first_name":"Alexandre","last_name":"Chapoutot","full_name":"Chapoutot, Alexandre"},{"first_name":"Xin","last_name":"Chen","full_name":"Chen, Xin"},{"first_name":"Pieter","last_name":"Collins","full_name":"Collins, Pieter"},{"full_name":"Forets, Marcelo","last_name":"Forets","first_name":"Marcelo"},{"first_name":"Daniel","full_name":"Freire, Daniel","last_name":"Freire"},{"last_name":"Immler","full_name":"Immler, Fabian","first_name":"Fabian"},{"full_name":"Kochdumper, Niklas","last_name":"Kochdumper","first_name":"Niklas"},{"last_name":"Sanders","full_name":"Sanders, David","first_name":"David"},{"last_name":"Schilling","orcid":"0000-0003-3658-1065","full_name":"Schilling, Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","first_name":"Christian"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Geretti L, Alexandre Dit Sandretto J, Althoff M, Benet L, Chapoutot A, Chen X, Collins P, Forets M, Freire D, Immler F, Kochdumper N, Sanders D, Schilling C. 2020. ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 74, 49–75.","chicago":"Geretti, Luca, Julien Alexandre Dit Sandretto, Matthias Althoff, Luis Benet, Alexandre Chapoutot, Xin Chen, Pieter Collins, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” In EPiC Series in Computing, 74:49–75. EasyChair, 2020. https://doi.org/10.29007/zkf6.","ieee":"L. Geretti et al., “ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics,” in EPiC Series in Computing, 2020, vol. 74, pp. 49–75.","short":"L. Geretti, J. Alexandre Dit Sandretto, M. Althoff, L. Benet, A. Chapoutot, X. Chen, P. Collins, M. Forets, D. Freire, F. Immler, N. Kochdumper, D. Sanders, C. Schilling, in:, EPiC Series in Computing, EasyChair, 2020, pp. 49–75.","ama":"Geretti L, Alexandre Dit Sandretto J, Althoff M, et al. ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. In: EPiC Series in Computing. Vol 74. EasyChair; 2020:49-75. doi:10.29007/zkf6","apa":"Geretti, L., Alexandre Dit Sandretto, J., Althoff, M., Benet, L., Chapoutot, A., Chen, X., … Schilling, C. (2020). ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics. In EPiC Series in Computing (Vol. 74, pp. 49–75). EasyChair. https://doi.org/10.29007/zkf6","mla":"Geretti, Luca, et al. “ARCH-COMP20 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” EPiC Series in Computing, vol. 74, EasyChair, 2020, pp. 49–75, doi:10.29007/zkf6."},"intvolume":" 74","month":"09","main_file_link":[{"open_access":"1","url":"https://easychair.org/publications/download/nrdD"}],"oa_version":"Published Version","abstract":[{"text":"We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2020. This year, 6 tools Ariadne, CORA, DynIbex, Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. These tools are applied to solve reachability analysis problems on six benchmark problems, two of them featuring hybrid dynamics. We do not rank the tools based on the results, but show the current status and discover the potential advantages of different tools.","lang":"eng"}],"ec_funded":1,"volume":74,"language":[{"iso":"eng"}],"publication_status":"published","status":"public","conference":{"start_date":"2020-07-12","end_date":"2020-07-12","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems"},"type":"conference","_id":"8571","department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T08:20:06Z"},{"day":"06","publication":"31st International Conference on Concurrency Theory","has_accepted_license":"1","year":"2020","doi":"10.4230/LIPIcs.CONCUR.2020.23","date_published":"2020-08-06T00:00:00Z","date_created":"2020-10-04T22:01:36Z","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.” In 31st International Conference on Concurrency Theory, Vol. 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.CONCUR.2020.23.","ista":"Chatterjee K, Henzinger TA, Otop J. 2020. Multi-dimensional long-run average problems for vector addition systems with states. 31st International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 171, 23.","mla":"Chatterjee, Krishnendu, et al. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.” 31st International Conference on Concurrency Theory, vol. 171, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CONCUR.2020.23.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, 31st International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Multi-dimensional long-run average problems for vector addition systems with states,” in 31st International Conference on Concurrency Theory, Virtual, 2020, vol. 171.","ama":"Chatterjee K, Henzinger TA, Otop J. Multi-dimensional long-run average problems for vector addition systems with states. In: 31st International Conference on Concurrency Theory. Vol 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.CONCUR.2020.23","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2020). Multi-dimensional long-run average problems for vector addition systems with states. In 31st International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2020.23"},"title":"Multi-dimensional long-run average problems for vector addition systems with states","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724"},{"first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan","last_name":"Otop"}],"article_processing_charge":"No","external_id":{"arxiv":["2007.08917"]},"article_number":"23","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S11402-N23"},{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"file":[{"checksum":"5039752f644c4b72b9361d21a5e31baf","file_id":"8610","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2020-10-05T14:04:25Z","file_name":"2020_LIPIcsCONCUR_Chatterjee.pdf","creator":"dernst","date_updated":"2020-10-05T14:04:25Z","file_size":601231}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["18688969"],"isbn":["9783959771603"]},"publication_status":"published","volume":171,"license":"https://creativecommons.org/licenses/by/3.0/","oa_version":"Published Version","abstract":[{"lang":"eng","text":"A vector addition system with states (VASS) consists of a finite set of states and counters. A transition changes the current state to the next state, and every counter is either incremented, or decremented, or left unchanged. A state and value for each counter is a configuration; and a computation is an infinite sequence of configurations with transitions between successive configurations. A probabilistic VASS consists of a VASS along with a probability distribution over the transitions for each state. Qualitative properties such as state and configuration reachability have been widely studied for VASS. In this work we consider multi-dimensional long-run average objectives for VASS and probabilistic VASS. For a counter, the cost of a configuration is the value of the counter; and the long-run average value of a computation for the counter is the long-run average of the costs of the configurations in the computation. The multi-dimensional long-run average problem given a VASS and a threshold value for each counter, asks whether there is a computation such that for each counter the long-run average value for the counter does not exceed the respective threshold. For probabilistic VASS, instead of the existence of a computation, we consider whether the expected long-run average value for each counter does not exceed the respective threshold. Our main results are as follows: we show that the multi-dimensional long-run average problem (a) is NP-complete for integer-valued VASS; (b) is undecidable for natural-valued VASS (i.e., nonnegative counters); and (c) can be solved in polynomial time for probabilistic integer-valued VASS, and probabilistic natural-valued VASS when all computations are non-terminating."}],"month":"08","intvolume":" 171","scopus_import":"1","alternative_title":["LIPIcs"],"ddc":["000"],"date_updated":"2021-01-12T08:20:15Z","file_date_updated":"2020-10-05T14:04:25Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"_id":"8600","status":"public","type":"conference","tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"conference":{"name":"CONCUR: Conference on Concurrency Theory","start_date":"2020-09-01","location":"Virtual","end_date":"2020-09-04"}},{"project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"}],"article_number":"2","title":"A survey of bidding games on graphs","article_processing_charge":"No","author":[{"last_name":"Avni","full_name":"Avni, Guy","orcid":"0000-0001-5588-8287","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Avni, G., & Henzinger, T. A. (2020). A survey of bidding games on graphs. In 31st International Conference on Concurrency Theory (Vol. 171). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2020.2","ama":"Avni G, Henzinger TA. A survey of bidding games on graphs. In: 31st International Conference on Concurrency Theory. Vol 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.CONCUR.2020.2","short":"G. Avni, T.A. Henzinger, in:, 31st International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ieee":"G. Avni and T. A. Henzinger, “A survey of bidding games on graphs,” in 31st International Conference on Concurrency Theory, Virtual, 2020, vol. 171.","mla":"Avni, Guy, and Thomas A. Henzinger. “A Survey of Bidding Games on Graphs.” 31st International Conference on Concurrency Theory, vol. 171, 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CONCUR.2020.2.","ista":"Avni G, Henzinger TA. 2020. A survey of bidding games on graphs. 31st International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 171, 2.","chicago":"Avni, Guy, and Thomas A Henzinger. “A Survey of Bidding Games on Graphs.” In 31st International Conference on Concurrency Theory, Vol. 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.CONCUR.2020.2."},"oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","acknowledgement":"We would like to thank all our collaborators Milad Aghajohari, Ventsislav Chonev, Rasmus Ibsen-Jensen, Ismäel Jecker, Petr Novotný, Josef Tkadlec, and Ðorđe Žikelić; we hope the collaboration was as fun and meaningful for you as it was for us.","date_created":"2020-10-04T22:01:36Z","doi":"10.4230/LIPIcs.CONCUR.2020.2","date_published":"2020-08-06T00:00:00Z","publication":"31st International Conference on Concurrency Theory","day":"06","year":"2020","has_accepted_license":"1","status":"public","conference":{"start_date":"2020-09-01","location":"Virtual","end_date":"2020-09-04","name":"CONCUR: Conference on Concurrency Theory"},"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"type":"conference","_id":"8599","file_date_updated":"2020-10-05T14:13:19Z","department":[{"_id":"ToHe"}],"ddc":["000"],"date_updated":"2021-01-12T08:20:13Z","intvolume":" 171","month":"08","scopus_import":"1","alternative_title":["LIPIcs"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"A graph game is a two-player zero-sum game in which the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. In bidding games, both players have budgets, and in each turn, we hold an \"auction\" (bidding) to determine which player moves the token. In this survey, we consider several bidding mechanisms and study their effect on the properties of the game. Specifically, bidding games, and in particular bidding games of infinite duration, have an intriguing equivalence with random-turn games in which in each turn, the player who moves is chosen randomly. We show how minor changes in the bidding mechanism lead to unexpected differences in the equivalence with random-turn games."}],"volume":171,"language":[{"iso":"eng"}],"file":[{"creator":"dernst","file_size":868510,"date_updated":"2020-10-05T14:13:19Z","file_name":"2020_LIPIcsCONCUR_Avni.pdf","date_created":"2020-10-05T14:13:19Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"8611","checksum":"8f33b098e73724e0ac817f764d8e1a2d"}],"publication_status":"published","publication_identifier":{"isbn":["9783959771603"],"issn":["18688969"]}},{"project":[{"grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Aksenov, V., Alistarh, D.-A., Drozdova, A., & Mohtashami, A. (2020). The splay-list: A distribution-adaptive concurrent skip-list. In 34th International Symposium on Distributed Computing (Vol. 179, p. 3:1-3:18). Freiburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2020.3","ama":"Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. The splay-list: A distribution-adaptive concurrent skip-list. In: 34th International Symposium on Distributed Computing. Vol 179. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020:3:1-3:18. doi:10.4230/LIPIcs.DISC.2020.3","short":"V. Aksenov, D.-A. Alistarh, A. Drozdova, A. Mohtashami, in:, 34th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 3:1-3:18.","ieee":"V. Aksenov, D.-A. Alistarh, A. Drozdova, and A. Mohtashami, “The splay-list: A distribution-adaptive concurrent skip-list,” in 34th International Symposium on Distributed Computing, Freiburg, Germany, 2020, vol. 179, p. 3:1-3:18.","mla":"Aksenov, Vitaly, et al. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” 34th International Symposium on Distributed Computing, vol. 179, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 3:1-3:18, doi:10.4230/LIPIcs.DISC.2020.3.","ista":"Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. 2020. The splay-list: A distribution-adaptive concurrent skip-list. 34th International Symposium on Distributed Computing. DISC: Symposium on Distributed ComputingLIPIcs vol. 179, 3:1-3:18.","chicago":"Aksenov, Vitaly, Dan-Adrian Alistarh, Alexandra Drozdova, and Amirkeivan Mohtashami. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” In 34th International Symposium on Distributed Computing, 179:3:1-3:18. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.DISC.2020.3."},"title":"The splay-list: A distribution-adaptive concurrent skip-list","author":[{"last_name":"Aksenov","full_name":"Aksenov, Vitaly","first_name":"Vitaly"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"},{"full_name":"Drozdova, Alexandra","last_name":"Drozdova","first_name":"Alexandra"},{"first_name":"Amirkeivan","last_name":"Mohtashami","full_name":"Mohtashami, Amirkeivan"}],"article_processing_charge":"No","external_id":{"arxiv":["2008.01009"]},"acknowledgement":"Vitaly Aksenov: Government of Russian Federation (Grant 08-08).\r\nDan Alistarh: ERC Starting Grant 805223 ScaleML.","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"day":"03","publication":"34th International Symposium on Distributed Computing","has_accepted_license":"1","year":"2020","date_published":"2020-08-03T00:00:00Z","doi":"10.4230/LIPIcs.DISC.2020.3","date_created":"2020-11-05T15:26:17Z","page":"3:1-3:18","_id":"8725","series_title":"LIPIcs","status":"public","type":"conference","conference":{"name":"DISC: Symposium on Distributed Computing","location":"Freiburg, Germany","end_date":"2020-10-16","start_date":"2020-10-12"},"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"ddc":["000"],"date_updated":"2023-02-23T13:41:40Z","department":[{"_id":"DaAl"}],"file_date_updated":"2021-03-11T12:33:35Z","oa_version":"Published Version","abstract":[{"text":"The design and implementation of efficient concurrent data structures have\r\nseen significant attention. However, most of this work has focused on\r\nconcurrent data structures providing good \\emph{worst-case} guarantees. In real\r\nworkloads, objects are often accessed at different rates, since access\r\ndistributions may be non-uniform. Efficient distribution-adaptive data\r\nstructures are known in the sequential case, e.g. the splay-trees; however,\r\nthey often are hard to translate efficiently in the concurrent case.\r\n In this paper, we investigate distribution-adaptive concurrent data\r\nstructures and propose a new design called the splay-list. At a high level, the\r\nsplay-list is similar to a standard skip-list, with the key distinction that\r\nthe height of each element adapts dynamically to its access rate: popular\r\nelements ``move up,'' whereas rarely-accessed elements decrease in height. We\r\nshow that the splay-list provides order-optimal amortized complexity bounds for\r\na subset of operations while being amenable to efficient concurrent\r\nimplementation. Experimental results show that the splay-list can leverage\r\ndistribution-adaptivity to improve on the performance of classic concurrent\r\ndesigns, and can outperform the only previously-known distribution-adaptive\r\ndesign in certain settings.","lang":"eng"}],"month":"08","intvolume":" 179","file":[{"file_name":"2020_LIPIcs_Aksenov.pdf","date_created":"2021-03-11T12:33:35Z","creator":"dernst","file_size":740358,"date_updated":"2021-03-11T12:33:35Z","success":1,"file_id":"9237","checksum":"a626a9c47df52b6f6d97edd910dae4ba","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959771689"]},"publication_status":"published","volume":179,"ec_funded":1},{"oa":1,"publisher":"MDPI","quality_controlled":"1","date_created":"2020-11-06T07:21:00Z","doi":"10.3390/condmat5030053","date_published":"2020-08-26T00:00:00Z","publication":"Condensed Matter","day":"26","year":"2020","has_accepted_license":"1","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"article_number":"53","title":"Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling","article_processing_charge":"No","external_id":{"arxiv":["2009.11773"]},"author":[{"first_name":"Dorota","last_name":"Gotfryd","full_name":"Gotfryd, Dorota"},{"last_name":"Paerschke","orcid":"0000-0003-0853-8182","full_name":"Paerschke, Ekaterina","first_name":"Ekaterina","id":"8275014E-6063-11E9-9B7F-6338E6697425"},{"last_name":"Wohlfeld","full_name":"Wohlfeld, Krzysztof","first_name":"Krzysztof"},{"last_name":"Oleś","full_name":"Oleś, Andrzej M.","first_name":"Andrzej M."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Gotfryd, Dorota, et al. “Evolution of Spin-Orbital Entanglement with Increasing Ising Spin-Orbit Coupling.” Condensed Matter, vol. 5, no. 3, 53, MDPI, 2020, doi:10.3390/condmat5030053.","apa":"Gotfryd, D., Paerschke, E., Wohlfeld, K., & Oleś, A. M. (2020). Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling. Condensed Matter. MDPI. https://doi.org/10.3390/condmat5030053","ama":"Gotfryd D, Paerschke E, Wohlfeld K, Oleś AM. Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling. Condensed Matter. 2020;5(3). doi:10.3390/condmat5030053","ieee":"D. Gotfryd, E. Paerschke, K. Wohlfeld, and A. M. Oleś, “Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling,” Condensed Matter, vol. 5, no. 3. MDPI, 2020.","short":"D. Gotfryd, E. Paerschke, K. Wohlfeld, A.M. Oleś, Condensed Matter 5 (2020).","chicago":"Gotfryd, Dorota, Ekaterina Paerschke, Krzysztof Wohlfeld, and Andrzej M. Oleś. “Evolution of Spin-Orbital Entanglement with Increasing Ising Spin-Orbit Coupling.” Condensed Matter. MDPI, 2020. https://doi.org/10.3390/condmat5030053.","ista":"Gotfryd D, Paerschke E, Wohlfeld K, Oleś AM. 2020. Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling. Condensed Matter. 5(3), 53."},"intvolume":" 5","month":"08","scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Several realistic spin-orbital models for transition metal oxides go beyond the classical expectations and could be understood only by employing the quantum entanglement. Experiments on these materials confirm that spin-orbital entanglement has measurable consequences. Here, we capture the essential features of spin-orbital entanglement in complex quantum matter utilizing 1D spin-orbital model which accommodates SU(2)⊗SU(2) symmetric Kugel-Khomskii superexchange as well as the Ising on-site spin-orbit coupling. Building on the results obtained for full and effective models in the regime of strong spin-orbit coupling, we address the question whether the entanglement found on superexchange bonds always increases when the Ising spin-orbit coupling is added. We show that (i) quantum entanglement is amplified by strong spin-orbit coupling and, surprisingly, (ii) almost classical disentangled states are possible. We complete the latter case by analyzing how the entanglement existing for intermediate values of spin-orbit coupling can disappear for higher values of this coupling."}],"ec_funded":1,"issue":"3","volume":5,"language":[{"iso":"eng"}],"file":[{"creator":"dernst","date_updated":"2020-11-06T07:24:40Z","file_size":768336,"date_created":"2020-11-06T07:24:40Z","file_name":"2020_CondensedMatter_Gotfryd.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"8727","checksum":"a57a698ff99a11b6665bafd1bac7afbc","success":1}],"publication_status":"published","publication_identifier":{"issn":["2410-3896"]},"status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","_id":"8726","file_date_updated":"2020-11-06T07:24:40Z","department":[{"_id":"MiLe"}],"ddc":["530"],"date_updated":"2021-01-12T08:20:46Z"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Alamdari, Par Alizadeh, Guy Avni, Thomas A Henzinger, and Anna Lukina. “Formal Methods with a Touch of Magic.” In Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, 138–47. TU Wien Academic Press, 2020. https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21.","ista":"Alamdari PA, Avni G, Henzinger TA, Lukina A. 2020. Formal methods with a touch of magic. Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 138–147.","mla":"Alamdari, Par Alizadeh, et al. “Formal Methods with a Touch of Magic.” Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2020, pp. 138–47, doi:10.34727/2020/isbn.978-3-85448-042-6_21.","apa":"Alamdari, P. A., Avni, G., Henzinger, T. A., & Lukina, A. (2020). Formal methods with a touch of magic. In Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design (pp. 138–147). Online Conference: TU Wien Academic Press. https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_21","ama":"Alamdari PA, Avni G, Henzinger TA, Lukina A. Formal methods with a touch of magic. In: Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design. TU Wien Academic Press; 2020:138-147. doi:10.34727/2020/isbn.978-3-85448-042-6_21","ieee":"P. A. Alamdari, G. Avni, T. A. Henzinger, and A. Lukina, “Formal methods with a touch of magic,” in Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, Online Conference, 2020, pp. 138–147.","short":"P.A. Alamdari, G. Avni, T.A. Henzinger, A. Lukina, in:, Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, TU Wien Academic Press, 2020, pp. 138–147."},"title":"Formal methods with a touch of magic","article_processing_charge":"No","author":[{"last_name":"Alamdari","full_name":"Alamdari, Par Alizadeh","first_name":"Par Alizadeh"},{"id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy","last_name":"Avni","full_name":"Avni, Guy","orcid":"0000-0001-5588-8287"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"id":"CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425","first_name":"Anna","full_name":"Lukina, Anna","last_name":"Lukina"}],"project":[{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"publication":"Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design","day":"21","year":"2020","has_accepted_license":"1","date_created":"2021-01-24T23:01:10Z","doi":"10.34727/2020/isbn.978-3-85448-042-6_21","date_published":"2020-09-21T00:00:00Z","page":"138-147","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","oa":1,"quality_controlled":"1","publisher":"TU Wien Academic Press","ddc":["000"],"date_updated":"2021-02-09T09:39:59Z","department":[{"_id":"ToHe"}],"file_date_updated":"2021-02-09T09:39:02Z","_id":"9040","status":"public","conference":{"end_date":"2020-09-24","location":"Online Conference","start_date":"2020-09-21","name":" FMCAD: Formal Methods in Computer-Aided Design"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"conference","language":[{"iso":"eng"}],"file":[{"file_name":"2020_FMCAD_Alamdari.pdf","date_created":"2021-02-09T09:39:02Z","creator":"dernst","file_size":990999,"date_updated":"2021-02-09T09:39:02Z","success":1,"checksum":"d616d549a0ade78606b16f8a9540820f","file_id":"9109","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"publication_status":"published","publication_identifier":{"isbn":["9783854480426"],"eissn":["2708-7824"]},"oa_version":"Published Version","abstract":[{"text":"Machine learning and formal methods have complimentary benefits and drawbacks. In this work, we address the controller-design problem with a combination of techniques from both fields. The use of black-box neural networks in deep reinforcement learning (deep RL) poses a challenge for such a combination. Instead of reasoning formally about the output of deep RL, which we call the wizard, we extract from it a decision-tree based model, which we refer to as the magic book. Using the extracted model as an intermediary, we are able to handle problems that are infeasible for either deep RL or formal methods by themselves. First, we suggest, for the first time, a synthesis procedure that is based on a magic book. We synthesize a stand-alone correct-by-design controller that enjoys the favorable performance of RL. Second, we incorporate a magic book in a bounded model checking (BMC) procedure. BMC allows us to find numerous traces of the plant under the control of the wizard, which a user can use to increase the trustworthiness of the wizard and direct further training.","lang":"eng"}],"month":"09","scopus_import":"1"},{"date_published":"2020-08-01T00:00:00Z","doi":"10.1029/2020ms002106","date_created":"2021-02-15T14:06:38Z","day":"01","publication":"Journal of Advances in Modeling Earth Systems","year":"2020","quality_controlled":"1","publisher":"American Geophysical Union","oa":1,"title":"What controls the water vapor isotopic composition near the surface of tropical oceans? Results from an analytical model constrained by large‐eddy simulations","author":[{"first_name":"Camille","full_name":"Risi, Camille","last_name":"Risi"},{"first_name":"Caroline J","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","full_name":"Muller, Caroline J","orcid":"0000-0001-5836-5350","last_name":"Muller"},{"full_name":"Blossey, Peter","last_name":"Blossey","first_name":"Peter"}],"article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"ieee":"C. Risi, C. J. Muller, and P. Blossey, “What controls the water vapor isotopic composition near the surface of tropical oceans? Results from an analytical model constrained by large‐eddy simulations,” Journal of Advances in Modeling Earth Systems, vol. 12, no. 8. American Geophysical Union, 2020.","short":"C. Risi, C.J. Muller, P. Blossey, Journal of Advances in Modeling Earth Systems 12 (2020).","ama":"Risi C, Muller CJ, Blossey P. What controls the water vapor isotopic composition near the surface of tropical oceans? Results from an analytical model constrained by large‐eddy simulations. Journal of Advances in Modeling Earth Systems. 2020;12(8). doi:10.1029/2020ms002106","apa":"Risi, C., Muller, C. J., & Blossey, P. (2020). What controls the water vapor isotopic composition near the surface of tropical oceans? Results from an analytical model constrained by large‐eddy simulations. Journal of Advances in Modeling Earth Systems. American Geophysical Union. https://doi.org/10.1029/2020ms002106","mla":"Risi, Camille, et al. “What Controls the Water Vapor Isotopic Composition near the Surface of Tropical Oceans? Results from an Analytical Model Constrained by Large‐eddy Simulations.” Journal of Advances in Modeling Earth Systems, vol. 12, no. 8, e2020MS002106, American Geophysical Union, 2020, doi:10.1029/2020ms002106.","ista":"Risi C, Muller CJ, Blossey P. 2020. What controls the water vapor isotopic composition near the surface of tropical oceans? Results from an analytical model constrained by large‐eddy simulations. Journal of Advances in Modeling Earth Systems. 12(8), e2020MS002106.","chicago":"Risi, Camille, Caroline J Muller, and Peter Blossey. “What Controls the Water Vapor Isotopic Composition near the Surface of Tropical Oceans? Results from an Analytical Model Constrained by Large‐eddy Simulations.” Journal of Advances in Modeling Earth Systems. American Geophysical Union, 2020. https://doi.org/10.1029/2020ms002106."},"article_number":"e2020MS002106","issue":"8","volume":12,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1942-2466","1942-2466"]},"publication_status":"published","month":"08","intvolume":" 12","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1029/2020MS002106"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"The goal of this study is to understand the mechanisms controlling the isotopic composition of the water vapor near the surface of tropical oceans, at the scale of about a hundred kilometers and a month. In the tropics, it has long been observed that the isotopic compositions of rain and vapor near the surface are more depleted when the precipitation rate is high. This is called the “amount effect.” Previous studies, based on observations or models with parameterized convection, have highlighted the roles of deep convective and mesoscale downdrafts and rain evaporation. But the relative importance of these processes has never been quantified. We hypothesize that it can be quantified using an analytical model constrained by large‐eddy simulations. Results from large‐eddy simulations confirm that the classical amount effect can be simulated only if precipitation rate changes result from changes in the large‐scale circulation. We find that the main process depleting the water vapor compared to the equilibrium with the ocean is the fact that updrafts stem from areas where the water vapor is more enriched. The main process responsible for the amount effect is the fact that when the large‐scale ascent increases, isotopic vertical gradients are steeper, so that updrafts and downdrafts deplete the subcloud layer more efficiently."}],"extern":"1","date_updated":"2022-01-24T12:28:12Z","status":"public","keyword":["Global and Planetary Change","General Earth and Planetary Sciences","Environmental Chemistry"],"article_type":"original","type":"journal_article","_id":"9126"},{"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"Nearly all regions in the world are projected to become dryer in a warming climate. Here, we investigate the Mediterranean region, often referred to as a climate change “hot spot”. From regional climate simulations, it is shown that although enhanced warming and drying over land is projected, the spatial pattern displays high variability. Indeed, drying is largely caused by enhanced warming over land. However, in Northern Europe, soil moisture alleviates warming induced drying by up to 50% due to humidity uptake from land. In already arid regions, the Mediterranean Sea is generally the only humidity source, and drying is only due to land warming. However, over Sahara and the Iberian Peninsula, enhanced warming over land is insufficient to explain the extreme drying. These regions are also isolated from humidity advection by heat lows, which are cyclonic circulation anomalies associated with surface heating over land. The cyclonic circulation scales with the temperature gradient between land and ocean which increases with climate change, reinforcing the cyclonic circulation over Sahara and the Iberian Peninsula, both diverting the zonal advection of humidity to the south of the Iberian Peninsula. The dynamics are therefore key in the warming and drying of the Mediterranean region, with extreme aridification over the Sahara and Iberian Peninsula. In these regions, the risk for human health due to the thermal load which accounts for air temperature and humidity is therefore projected to increase significantly with climate change at a level of extreme danger."}],"month":"09","intvolume":" 20","main_file_link":[{"open_access":"1","url":"https://hal-insu.archives-ouvertes.fr/insu-02881534"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1436-3798","1436-378X"]},"publication_status":"published","issue":"9","volume":20,"_id":"9127","status":"public","keyword":["Global and Planetary Change"],"article_type":"original","type":"journal_article","extern":"1","date_updated":"2022-01-24T12:28:49Z","quality_controlled":"1","publisher":"Springer Nature","oa":1,"day":"11","publication":"Regional Environmental Change","year":"2020","doi":"10.1007/s10113-020-01659-w","date_published":"2020-09-11T00:00:00Z","date_created":"2021-02-15T14:06:58Z","article_number":"78","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"chicago":"Drobinski, Philippe, Nicolas Da Silva, Sophie Bastin, Sylvain Mailler, Caroline J Muller, Bodo Ahrens, Ole B. Christensen, and Piero Lionello. “How Warmer and Drier Will the Mediterranean Region Be at the End of the Twenty-First Century?” Regional Environmental Change. Springer Nature, 2020. https://doi.org/10.1007/s10113-020-01659-w.","ista":"Drobinski P, Da Silva N, Bastin S, Mailler S, Muller CJ, Ahrens B, Christensen OB, Lionello P. 2020. How warmer and drier will the Mediterranean region be at the end of the twenty-first century? Regional Environmental Change. 20(9), 78.","mla":"Drobinski, Philippe, et al. “How Warmer and Drier Will the Mediterranean Region Be at the End of the Twenty-First Century?” Regional Environmental Change, vol. 20, no. 9, 78, Springer Nature, 2020, doi:10.1007/s10113-020-01659-w.","ieee":"P. Drobinski et al., “How warmer and drier will the Mediterranean region be at the end of the twenty-first century?,” Regional Environmental Change, vol. 20, no. 9. Springer Nature, 2020.","short":"P. Drobinski, N. Da Silva, S. Bastin, S. Mailler, C.J. Muller, B. Ahrens, O.B. Christensen, P. Lionello, Regional Environmental Change 20 (2020).","apa":"Drobinski, P., Da Silva, N., Bastin, S., Mailler, S., Muller, C. J., Ahrens, B., … Lionello, P. (2020). How warmer and drier will the Mediterranean region be at the end of the twenty-first century? Regional Environmental Change. Springer Nature. https://doi.org/10.1007/s10113-020-01659-w","ama":"Drobinski P, Da Silva N, Bastin S, et al. How warmer and drier will the Mediterranean region be at the end of the twenty-first century? Regional Environmental Change. 2020;20(9). doi:10.1007/s10113-020-01659-w"},"title":"How warmer and drier will the Mediterranean region be at the end of the twenty-first century?","author":[{"first_name":"Philippe","last_name":"Drobinski","full_name":"Drobinski, Philippe"},{"first_name":"Nicolas","last_name":"Da Silva","full_name":"Da Silva, Nicolas"},{"full_name":"Bastin, Sophie","last_name":"Bastin","first_name":"Sophie"},{"full_name":"Mailler, Sylvain","last_name":"Mailler","first_name":"Sylvain"},{"last_name":"Muller","full_name":"Muller, Caroline J","orcid":"0000-0001-5836-5350","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","first_name":"Caroline J"},{"full_name":"Ahrens, Bodo","last_name":"Ahrens","first_name":"Bodo"},{"first_name":"Ole B.","last_name":"Christensen","full_name":"Christensen, Ole B."},{"full_name":"Lionello, Piero","last_name":"Lionello","first_name":"Piero"}],"article_processing_charge":"No"},{"article_number":"035001","author":[{"id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","first_name":"Caroline J","last_name":"Muller","full_name":"Muller, Caroline J","orcid":"0000-0001-5836-5350"},{"last_name":"Takayabu","full_name":"Takayabu, Yukari","first_name":"Yukari"}],"article_processing_charge":"No","title":"Response of precipitation extremes to warming: What have we learned from theory and idealized cloud-resolving simulations, and what remains to be learned?","citation":{"short":"C.J. Muller, Y. Takayabu, Environmental Research Letters 15 (2020).","ieee":"C. J. Muller and Y. Takayabu, “Response of precipitation extremes to warming: What have we learned from theory and idealized cloud-resolving simulations, and what remains to be learned?,” Environmental Research Letters, vol. 15, no. 3. IOP Publishing, 2020.","apa":"Muller, C. J., & Takayabu, Y. (2020). Response of precipitation extremes to warming: What have we learned from theory and idealized cloud-resolving simulations, and what remains to be learned? Environmental Research Letters. IOP Publishing. https://doi.org/10.1088/1748-9326/ab7130","ama":"Muller CJ, Takayabu Y. Response of precipitation extremes to warming: What have we learned from theory and idealized cloud-resolving simulations, and what remains to be learned? Environmental Research Letters. 2020;15(3). doi:10.1088/1748-9326/ab7130","mla":"Muller, Caroline J., and Yukari Takayabu. “Response of Precipitation Extremes to Warming: What Have We Learned from Theory and Idealized Cloud-Resolving Simulations, and What Remains to Be Learned?” Environmental Research Letters, vol. 15, no. 3, 035001, IOP Publishing, 2020, doi:10.1088/1748-9326/ab7130.","ista":"Muller CJ, Takayabu Y. 2020. Response of precipitation extremes to warming: What have we learned from theory and idealized cloud-resolving simulations, and what remains to be learned? Environmental Research Letters. 15(3), 035001.","chicago":"Muller, Caroline J, and Yukari Takayabu. “Response of Precipitation Extremes to Warming: What Have We Learned from Theory and Idealized Cloud-Resolving Simulations, and What Remains to Be Learned?” Environmental Research Letters. IOP Publishing, 2020. https://doi.org/10.1088/1748-9326/ab7130."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","quality_controlled":"1","publisher":"IOP Publishing","oa":1,"date_published":"2020-02-18T00:00:00Z","doi":"10.1088/1748-9326/ab7130","date_created":"2021-02-15T14:07:14Z","year":"2020","day":"18","publication":"Environmental Research Letters","type":"journal_article","article_type":"letter_note","status":"public","keyword":["Renewable Energy","Sustainability and the Environment","Public Health","Environmental and Occupational Health","General Environmental Science"],"_id":"9128","date_updated":"2022-01-24T12:29:46Z","extern":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1088/1748-9326/ab7130"}],"month":"02","intvolume":" 15","abstract":[{"lang":"eng","text":"This paper reviews recent important advances in our understanding of the response of precipitation extremes to warming from theory and from idealized cloud-resolving simulations. A theoretical scaling for precipitation extremes has been proposed and refined in the past decades, allowing to address separately the contributions from the thermodynamics, the dynamics and the microphysics. Theoretical constraints, as well as remaining uncertainties, associated with each of these three contributions to precipitation extremes, are discussed. Notably, although to leading order precipitation extremes seem to follow the thermodynamic theoretical expectation in idealized simulations, considerable uncertainty remains regarding the response of the dynamics and of the microphysics to warming, and considerable departure from this theoretical expectation is found in observations and in more realistic simulations. We also emphasize key outstanding questions, in particular the response of mesoscale convective organization to warming. Observations suggest that extreme rainfall often comes from an organized system in very moist environments. Improved understanding of the physical processes behind convective organization is needed in order to achieve accurate extreme rainfall prediction in our current, and in a warming climate."}],"oa_version":"Published Version","volume":15,"issue":"3","publication_identifier":{"issn":["1748-9326"]},"publication_status":"published","language":[{"iso":"eng"}]},{"oa":1,"quality_controlled":"1","publisher":"American Geophysical Union","date_created":"2021-02-15T14:06:23Z","doi":"10.1029/2020ms002164","date_published":"2020-11-01T00:00:00Z","publication":"Journal of Advances in Modeling Earth Systems","day":"01","year":"2020","article_number":"e2020MS002164","title":"Self‐aggregation of convective clouds with interactive sea surface temperature","article_processing_charge":"No","author":[{"full_name":"Shamekh, S.","last_name":"Shamekh","first_name":"S."},{"first_name":"Caroline J","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","last_name":"Muller","full_name":"Muller, Caroline J","orcid":"0000-0001-5836-5350"},{"last_name":"Duvel","full_name":"Duvel, J.‐P.","first_name":"J.‐P."},{"last_name":"D'Andrea","full_name":"D'Andrea, F.","first_name":"F."}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"chicago":"Shamekh, S., Caroline J Muller, J.‐P. Duvel, and F. D’Andrea. “Self‐aggregation of Convective Clouds with Interactive Sea Surface Temperature.” Journal of Advances in Modeling Earth Systems. American Geophysical Union, 2020. https://doi.org/10.1029/2020ms002164.","ista":"Shamekh S, Muller CJ, Duvel J ‐P., D’Andrea F. 2020. Self‐aggregation of convective clouds with interactive sea surface temperature. Journal of Advances in Modeling Earth Systems. 12(11), e2020MS002164.","mla":"Shamekh, S., et al. “Self‐aggregation of Convective Clouds with Interactive Sea Surface Temperature.” Journal of Advances in Modeling Earth Systems, vol. 12, no. 11, e2020MS002164, American Geophysical Union, 2020, doi:10.1029/2020ms002164.","ieee":"S. Shamekh, C. J. Muller, J. ‐P. Duvel, and F. D’Andrea, “Self‐aggregation of convective clouds with interactive sea surface temperature,” Journal of Advances in Modeling Earth Systems, vol. 12, no. 11. American Geophysical Union, 2020.","short":"S. Shamekh, C.J. Muller, J. ‐P. Duvel, F. D’Andrea, Journal of Advances in Modeling Earth Systems 12 (2020).","ama":"Shamekh S, Muller CJ, Duvel J ‐P., D’Andrea F. Self‐aggregation of convective clouds with interactive sea surface temperature. Journal of Advances in Modeling Earth Systems. 2020;12(11). doi:10.1029/2020ms002164","apa":"Shamekh, S., Muller, C. J., Duvel, J. ‐P., & D’Andrea, F. (2020). Self‐aggregation of convective clouds with interactive sea surface temperature. Journal of Advances in Modeling Earth Systems. American Geophysical Union. https://doi.org/10.1029/2020ms002164"},"intvolume":" 12","month":"11","main_file_link":[{"url":"https://doi.org/10.1029/2020MS002164","open_access":"1"}],"oa_version":"Published Version","abstract":[{"text":"This study investigates the feedbacks between an interactive sea surface temperature (SST) and the self‐aggregation of deep convective clouds, using a cloud‐resolving model in nonrotating radiative‐convective equilibrium. The ocean is modeled as one layer slab with a temporally fixed mean but spatially varying temperature. We find that the interactive SST decelerates the aggregation and that the deceleration is larger with a shallower slab, consistent with earlier studies. The surface temperature anomaly in dry regions is positive at first, thus opposing the diverging shallow circulation known to favor self‐aggregation, consistent with the slower aggregation. But surprisingly, the driest columns then have a negative SST anomaly, thus strengthening the diverging shallow circulation and favoring aggregation. This diverging circulation out of dry regions is found to be well correlated with the aggregation speed. It can be linked to a positive surface pressure anomaly (PSFC), itself the consequence of SST anomalies and boundary layer radiative cooling. The latter cools and dries the boundary layer, thus increasing PSFC anomalies through virtual effects and hydrostasy. Sensitivity experiments confirm the key role played by boundary layer radiative cooling in determining PSFC anomalies in dry regions, and thus the shallow diverging circulation and the aggregation speed.","lang":"eng"}],"volume":12,"issue":"11","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1942-2466","1942-2466"]},"keyword":["Global and Planetary Change","General Earth and Planetary Sciences","Environmental Chemistry"],"status":"public","type":"journal_article","article_type":"original","_id":"9125","extern":"1","date_updated":"2022-01-24T12:27:38Z"},{"year":"2020","publication_status":"submitted","publication":"Earth System Science Data","language":[{"iso":"eng"}],"day":"24","date_created":"2021-02-15T14:05:54Z","date_published":"2020-09-24T00:00:00Z","doi":"10.5194/essd-2020-269","abstract":[{"text":"The couplings among clouds, convection, and circulation in trade-wind regimes remain a fundamental puzzle that limits our ability to constrain future climate change. Radiative heating plays an important role in these couplings. Here we calculate the clear-sky radiative profiles from 2001 in-situ soundings (978 dropsondes and 1023 radiosondes) collected during the EUREC4A field campaign, which took place south and east of Barbados in January–February 2020. We describe the method used to calculate these radiative profiles and present preliminary results sampling variability at multiple scales, from the variability across all soundings to groupings by diurnal cycle and mesoscale organization state, as well as individual soundings associated with elevated moisture layers. This clear-sky radiative profiles data set can provide important missing detail to what can be learned from calculations based on passive remote sensing and help in investigating the role of radiation in dynamic and thermodynamic variability in trade-wind regimes. All data are archived and freely available for public access on AERIS (Albright et al. (2020), https://doi.org/10.25326/78).","lang":"eng"}],"oa_version":"Preprint","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5194/essd-2020-269"}],"publisher":"Copernicus Publications","month":"09","date_updated":"2022-01-24T12:27:08Z","citation":{"ieee":"A. L. Albright, B. Fildier, L. Touzé-Peiffer, R. Pincus, J. Vial, and C. J. Muller, “Atmospheric radiative profiles during EUREC4A,” Earth System Science Data. Copernicus Publications.","short":"A.L. Albright, B. Fildier, L. Touzé-Peiffer, R. Pincus, J. Vial, C.J. Muller, Earth System Science Data (n.d.).","apa":"Albright, A. L., Fildier, B., Touzé-Peiffer, L., Pincus, R., Vial, J., & Muller, C. J. (n.d.). Atmospheric radiative profiles during EUREC4A. Earth System Science Data. Copernicus Publications. https://doi.org/10.5194/essd-2020-269","ama":"Albright AL, Fildier B, Touzé-Peiffer L, Pincus R, Vial J, Muller CJ. Atmospheric radiative profiles during EUREC4A. Earth System Science Data. doi:10.5194/essd-2020-269","mla":"Albright, Anna Lea, et al. “Atmospheric Radiative Profiles during EUREC4A.” Earth System Science Data, Copernicus Publications, doi:10.5194/essd-2020-269.","ista":"Albright AL, Fildier B, Touzé-Peiffer L, Pincus R, Vial J, Muller CJ. Atmospheric radiative profiles during EUREC4A. Earth System Science Data, 10.5194/essd-2020-269.","chicago":"Albright, Anna Lea, Benjamin Fildier, Ludovic Touzé-Peiffer, Robert Pincus, Jessica Vial, and Caroline J Muller. “Atmospheric Radiative Profiles during EUREC4A.” Earth System Science Data. Copernicus Publications, n.d. https://doi.org/10.5194/essd-2020-269."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","extern":"1","article_processing_charge":"No","author":[{"first_name":"Anna Lea","last_name":"Albright","full_name":"Albright, Anna Lea"},{"full_name":"Fildier, Benjamin","last_name":"Fildier","first_name":"Benjamin"},{"first_name":"Ludovic","full_name":"Touzé-Peiffer, Ludovic","last_name":"Touzé-Peiffer"},{"first_name":"Robert","full_name":"Pincus, Robert","last_name":"Pincus"},{"full_name":"Vial, Jessica","last_name":"Vial","first_name":"Jessica"},{"id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","first_name":"Caroline J","full_name":"Muller, Caroline J","orcid":"0000-0001-5836-5350","last_name":"Muller"}],"title":"Atmospheric radiative profiles during EUREC4A","_id":"9124","type":"preprint","status":"public"},{"abstract":[{"lang":"eng","text":"Active navigation relies on effectively extracting information from the surrounding environment, and often features the tracking of gradients of a relevant signal—such as the concentration of molecules. Microfluidic networks of closed pathways pose the challenge of determining the shortest exit pathway, which involves the proper local decision-making at each bifurcating junction. Here, we focus on the basic decision faced at a T-junction by a microscopic particle, which orients among possible paths via its sensing of a diffusible substance's concentration. We study experimentally the navigation of colloidal particles following concentration gradients by diffusiophoresis. We treat the situation as a mean first passage time (MFPT) problem that unveils the important role of a separatrix in the concentration field to determine the statistics of path taking. Further, we use numerical experiments to study different strategies, including biomimetic ones such as run and tumble or Markovian chemotactic migration. The discontinuity in the MFPT at the junction makes it remarkably difficult for microscopic agents to follow the shortest path, irrespective of adopted navigation strategy. In contrast, increasing the size of the sensing agents improves the efficiency of short-path taking by harvesting information on a larger scale. It inspires the development of a run-and-whirl dynamics that takes advantage of the mathematical properties of harmonic functions to emulate particles beyond their own size."}],"oa_version":"Published Version","scopus_import":"1","intvolume":" 5","month":"10","publication_status":"published","publication_identifier":{"issn":["2469-990X"]},"language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"dfecfadbd79fd760fb4db20d1e667f17","file_id":"9163","success":1,"creator":"cziletti","date_updated":"2021-02-18T14:12:24Z","file_size":730504,"date_created":"2021-02-18T14:12:24Z","file_name":"2020_PhysRevFluids_Gandhi.pdf"}],"volume":5,"issue":"10","_id":"9162","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","type":"journal_article","status":"public","date_updated":"2023-02-23T13:50:55Z","ddc":["530"],"extern":"1","file_date_updated":"2021-02-18T14:12:24Z","oa":1,"publisher":"American Physical Society","quality_controlled":"1","year":"2020","has_accepted_license":"1","publication":"Physical Review Fluids","day":"14","date_created":"2021-02-18T14:07:16Z","date_published":"2020-10-14T00:00:00Z","doi":"10.1103/physrevfluids.5.104202","article_number":"104202","citation":{"ama":"Gandhi T, Mac Huang J, Aubret A, et al. Decision-making at a T-junction by gradient-sensing microscopic agents. Physical Review Fluids. 2020;5(10). doi:10.1103/physrevfluids.5.104202","apa":"Gandhi, T., Mac Huang, J., Aubret, A., Li, Y., Ramananarivo, S., Vergassola, M., & Palacci, J. A. (2020). Decision-making at a T-junction by gradient-sensing microscopic agents. Physical Review Fluids. American Physical Society. https://doi.org/10.1103/physrevfluids.5.104202","short":"T. Gandhi, J. Mac Huang, A. Aubret, Y. Li, S. Ramananarivo, M. Vergassola, J.A. Palacci, Physical Review Fluids 5 (2020).","ieee":"T. Gandhi et al., “Decision-making at a T-junction by gradient-sensing microscopic agents,” Physical Review Fluids, vol. 5, no. 10. American Physical Society, 2020.","mla":"Gandhi, Tanvi, et al. “Decision-Making at a T-Junction by Gradient-Sensing Microscopic Agents.” Physical Review Fluids, vol. 5, no. 10, 104202, American Physical Society, 2020, doi:10.1103/physrevfluids.5.104202.","ista":"Gandhi T, Mac Huang J, Aubret A, Li Y, Ramananarivo S, Vergassola M, Palacci JA. 2020. Decision-making at a T-junction by gradient-sensing microscopic agents. Physical Review Fluids. 5(10), 104202.","chicago":"Gandhi, Tanvi, Jinzi Mac Huang, Antoine Aubret, Yaocheng Li, Sophie Ramananarivo, Massimo Vergassola, and Jérémie A Palacci. “Decision-Making at a T-Junction by Gradient-Sensing Microscopic Agents.” Physical Review Fluids. American Physical Society, 2020. https://doi.org/10.1103/physrevfluids.5.104202."},"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","article_processing_charge":"No","author":[{"last_name":"Gandhi","full_name":"Gandhi, Tanvi","first_name":"Tanvi"},{"last_name":"Mac Huang","full_name":"Mac Huang, Jinzi","first_name":"Jinzi"},{"first_name":"Antoine","full_name":"Aubret, Antoine","last_name":"Aubret"},{"last_name":"Li","full_name":"Li, Yaocheng","first_name":"Yaocheng"},{"first_name":"Sophie","last_name":"Ramananarivo","full_name":"Ramananarivo, Sophie"},{"last_name":"Vergassola","full_name":"Vergassola, Massimo","first_name":"Massimo"},{"full_name":"Palacci, Jérémie A","orcid":"0000-0002-7253-9465","last_name":"Palacci","id":"8fb92548-2b22-11eb-b7c1-a3f0d08d7c7d","first_name":"Jérémie A"}],"title":"Decision-making at a T-junction by gradient-sensing microscopic agents"},{"oa_version":"Published Version","month":"06","intvolume":" 22","scopus_import":"1","file":[{"file_name":"2020_NewJournPhys_Speck.pdf","date_created":"2021-02-18T14:53:33Z","creator":"cziletti","file_size":953338,"date_updated":"2021-02-18T14:53:33Z","success":1,"checksum":"02759f3ab228c1a061e747155a20f851","file_id":"9169","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1367-2630"]},"publication_status":"published","volume":22,"issue":"6","_id":"9164","status":"public","keyword":["General Physics and Astronomy"],"article_type":"letter_note","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"extern":"1","ddc":["530"],"date_updated":"2021-02-18T14:57:39Z","file_date_updated":"2021-02-18T14:53:33Z","quality_controlled":"1","publisher":"IOP Publishing","oa":1,"day":"01","publication":"New Journal of Physics","has_accepted_license":"1","year":"2020","date_published":"2020-06-01T00:00:00Z","doi":"10.1088/1367-2630/ab90d9","date_created":"2021-02-18T14:17:32Z","article_number":"060201","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","citation":{"mla":"Speck, Thomas, et al. “Focus on Active Colloids and Nanoparticles.” New Journal of Physics, vol. 22, no. 6, 060201, IOP Publishing, 2020, doi:10.1088/1367-2630/ab90d9.","ieee":"T. Speck, J. Tailleur, and J. A. Palacci, “Focus on active colloids and nanoparticles,” New Journal of Physics, vol. 22, no. 6. IOP Publishing, 2020.","short":"T. Speck, J. Tailleur, J.A. Palacci, New Journal of Physics 22 (2020).","ama":"Speck T, Tailleur J, Palacci JA. Focus on active colloids and nanoparticles. New Journal of Physics. 2020;22(6). doi:10.1088/1367-2630/ab90d9","apa":"Speck, T., Tailleur, J., & Palacci, J. A. (2020). Focus on active colloids and nanoparticles. New Journal of Physics. IOP Publishing. https://doi.org/10.1088/1367-2630/ab90d9","chicago":"Speck, Thomas, Julien Tailleur, and Jérémie A Palacci. “Focus on Active Colloids and Nanoparticles.” New Journal of Physics. IOP Publishing, 2020. https://doi.org/10.1088/1367-2630/ab90d9.","ista":"Speck T, Tailleur J, Palacci JA. 2020. Focus on active colloids and nanoparticles. New Journal of Physics. 22(6), 060201."},"title":"Focus on active colloids and nanoparticles","author":[{"first_name":"Thomas","full_name":"Speck, Thomas","last_name":"Speck"},{"full_name":"Tailleur, Julien","last_name":"Tailleur","first_name":"Julien"},{"first_name":"Jérémie A","id":"8fb92548-2b22-11eb-b7c1-a3f0d08d7c7d","full_name":"Palacci, Jérémie A","orcid":"0000-0002-7253-9465","last_name":"Palacci"}],"article_processing_charge":"No"},{"volume":4,"issue":"1","ec_funded":1,"publication_identifier":{"issn":["2353-3390"]},"publication_status":"published","file":[{"file_name":"2020_MathMorpholTheoryAppl_Biswas.pdf","date_created":"2021-03-22T08:56:37Z","file_size":3668725,"date_updated":"2021-03-22T08:56:37Z","creator":"dernst","success":1,"file_id":"9272","checksum":"4a1043fa0548a725d464017fe2483ce0","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"month":"11","intvolume":" 4","abstract":[{"lang":"eng","text":"Rhombic dodecahedron is a space filling polyhedron which represents the close packing of spheres in 3D space and the Voronoi structures of the face centered cubic (FCC) lattice. In this paper, we describe a new coordinate system where every 3-integer coordinates grid point corresponds to a rhombic dodecahedron centroid. In order to illustrate the interest of the new coordinate system, we propose the characterization of 3D digital plane with its topological features, such as the interrelation between the thickness of the digital plane and the separability constraint we aim to obtain. We also present the characterization of 3D digital lines and study it as the intersection of multiple digital planes. Characterization of 3D digital sphere with relevant topological features is proposed as well along with the 48-symmetry appearing in the new coordinate system."}],"oa_version":"Published Version","department":[{"_id":"HeEd"}],"file_date_updated":"2021-03-22T08:56:37Z","date_updated":"2021-03-22T09:01:50Z","ddc":["510"],"type":"journal_article","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","_id":"9249","page":"143-158","date_published":"2020-11-17T00:00:00Z","doi":"10.1515/mathm-2020-0106","date_created":"2021-03-16T08:55:19Z","has_accepted_license":"1","year":"2020","day":"17","publication":"Mathematical Morphology - Theory and Applications","publisher":"De Gruyter","quality_controlled":"1","oa":1,"acknowledgement":"This work has been partially supported by the European Research Council (ERC) under\r\nthe European Union’s Horizon 2020 research and innovation programme, grant no. 788183, and the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35. ","author":[{"full_name":"Biswas, Ranita","orcid":"0000-0002-5372-7890","last_name":"Biswas","first_name":"Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Gaëlle","full_name":"Largeteau-Skapin, Gaëlle","last_name":"Largeteau-Skapin"},{"first_name":"Rita","last_name":"Zrour","full_name":"Zrour, Rita"},{"full_name":"Andres, Eric","last_name":"Andres","first_name":"Eric"}],"article_processing_charge":"No","title":"Digital objects in rhombic dodecahedron grid","citation":{"mla":"Biswas, Ranita, et al. “Digital Objects in Rhombic Dodecahedron Grid.” Mathematical Morphology - Theory and Applications, vol. 4, no. 1, De Gruyter, 2020, pp. 143–58, doi:10.1515/mathm-2020-0106.","ama":"Biswas R, Largeteau-Skapin G, Zrour R, Andres E. Digital objects in rhombic dodecahedron grid. Mathematical Morphology - Theory and Applications. 2020;4(1):143-158. doi:10.1515/mathm-2020-0106","apa":"Biswas, R., Largeteau-Skapin, G., Zrour, R., & Andres, E. (2020). Digital objects in rhombic dodecahedron grid. Mathematical Morphology - Theory and Applications. De Gruyter. https://doi.org/10.1515/mathm-2020-0106","ieee":"R. Biswas, G. Largeteau-Skapin, R. Zrour, and E. Andres, “Digital objects in rhombic dodecahedron grid,” Mathematical Morphology - Theory and Applications, vol. 4, no. 1. De Gruyter, pp. 143–158, 2020.","short":"R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, Mathematical Morphology - Theory and Applications 4 (2020) 143–158.","chicago":"Biswas, Ranita, Gaëlle Largeteau-Skapin, Rita Zrour, and Eric Andres. “Digital Objects in Rhombic Dodecahedron Grid.” Mathematical Morphology - Theory and Applications. De Gruyter, 2020. https://doi.org/10.1515/mathm-2020-0106.","ista":"Biswas R, Largeteau-Skapin G, Zrour R, Andres E. 2020. Digital objects in rhombic dodecahedron grid. Mathematical Morphology - Theory and Applications. 4(1), 143–158."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Alpha Shape Theory Extended","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes"}]},{"article_processing_charge":"No","external_id":{"arxiv":["2006.14908"]},"author":[{"last_name":"Pach","full_name":"Pach, János","id":"E62E3130-B088-11EA-B919-BF823C25FEA4","first_name":"János"},{"first_name":"Gábor","last_name":"Tardos","full_name":"Tardos, Gábor"},{"first_name":"Géza","last_name":"Tóth","full_name":"Tóth, Géza"}],"title":"Crossings between non-homotopic edges","citation":{"mla":"Pach, János, et al. “Crossings between Non-Homotopic Edges.” 28th International Symposium on Graph Drawing and Network Visualization, vol. 12590, Springer Nature, 2020, pp. 359–71, doi:10.1007/978-3-030-68766-3_28.","ieee":"J. Pach, G. Tardos, and G. Tóth, “Crossings between non-homotopic edges,” in 28th International Symposium on Graph Drawing and Network Visualization, Virtual, Online, 2020, vol. 12590, pp. 359–371.","short":"J. Pach, G. Tardos, G. Tóth, in:, 28th International Symposium on Graph Drawing and Network Visualization, Springer Nature, 2020, pp. 359–371.","ama":"Pach J, Tardos G, Tóth G. Crossings between non-homotopic edges. In: 28th International Symposium on Graph Drawing and Network Visualization. Vol 12590. LNCS. Springer Nature; 2020:359-371. doi:10.1007/978-3-030-68766-3_28","apa":"Pach, J., Tardos, G., & Tóth, G. (2020). Crossings between non-homotopic edges. In 28th International Symposium on Graph Drawing and Network Visualization (Vol. 12590, pp. 359–371). Virtual, Online: Springer Nature. https://doi.org/10.1007/978-3-030-68766-3_28","chicago":"Pach, János, Gábor Tardos, and Géza Tóth. “Crossings between Non-Homotopic Edges.” In 28th International Symposium on Graph Drawing and Network Visualization, 12590:359–71. LNCS. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-68766-3_28.","ista":"Pach J, Tardos G, Tóth G. 2020. Crossings between non-homotopic edges. 28th International Symposium on Graph Drawing and Network Visualization. GD: Graph Drawing and Network VisualizationLNCS vol. 12590, 359–371."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z00342"}],"page":"359-371","date_created":"2021-03-28T22:01:44Z","doi":"10.1007/978-3-030-68766-3_28","date_published":"2020-09-20T00:00:00Z","year":"2020","publication":"28th International Symposium on Graph Drawing and Network Visualization","day":"20","oa":1,"publisher":"Springer Nature","quality_controlled":"1","acknowledgement":"Supported by the National Research, Development and Innovation Office, NKFIH, KKP-133864, K-131529, K-116769, K-132696, by the Higher Educational Institutional Excellence Program 2019 NKFIH-1158-6/2019, the Austrian Science Fund (FWF), grant Z 342-N31, by the Ministry of Education and Science of the Russian Federation MegaGrant No. 075-15-2019-1926, and by the ERC Synergy Grant “Dynasnet” No. 810115. A full version can be found at https://arxiv.org/abs/2006.14908.","department":[{"_id":"HeEd"}],"date_updated":"2021-04-06T11:32:32Z","conference":{"name":"GD: Graph Drawing and Network Visualization","location":"Virtual, Online","end_date":"2020-09-18","start_date":"2020-09-16"},"type":"conference","status":"public","_id":"9299","series_title":"LNCS","volume":12590,"publication_status":"published","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783030687656"],"issn":["0302-9743"]},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/2006.14908","open_access":"1"}],"scopus_import":"1","intvolume":" 12590","month":"09","abstract":[{"text":"We call a multigraph non-homotopic if it can be drawn in the plane in such a way that no two edges connecting the same pair of vertices can be continuously transformed into each other without passing through a vertex, and no loop can be shrunk to its end-vertex in the same way. It is easy to see that a non-homotopic multigraph on n>1 vertices can have arbitrarily many edges. We prove that the number of crossings between the edges of a non-homotopic multigraph with n vertices and m>4n edges is larger than cm2n for some constant c>0 , and that this bound is tight up to a polylogarithmic factor. We also show that the lower bound is not asymptotically sharp as n is fixed and m⟶∞ .","lang":"eng"}],"oa_version":"Preprint"},{"oa_version":"Preprint","abstract":[{"text":"In 1989, Rota made the following conjecture. Given n bases B1,…,Bn in an n-dimensional vector space V, one can always find n disjoint bases of V, each containing exactly one element from each Bi (we call such bases transversal bases). Rota’s basis conjecture remains wide open despite its apparent simplicity and the efforts of many researchers (e.g., the conjecture was recently the subject of the collaborative “Polymath” project). In this paper we prove that one can always find (1/2−o(1))n disjoint transversal bases, improving on the previous best bound of Ω(n/logn). Our results also apply to the more general setting of matroids.","lang":"eng"}],"month":"11","intvolume":" 2020","scopus_import":"1","main_file_link":[{"open_access":"1","url":"http://arxiv-export-lb.library.cornell.edu/abs/1810.07462"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1687-0247"],"issn":["1073-7928"]},"publication_status":"published","volume":2020,"issue":"21","_id":"9576","status":"public","article_type":"original","type":"journal_article","extern":"1","date_updated":"2023-02-23T14:01:30Z","publisher":"Oxford University Press","quality_controlled":"1","oa":1,"day":"01","publication":"International Mathematics Research Notices","year":"2020","date_published":"2020-11-01T00:00:00Z","doi":"10.1093/imrn/rnaa004","date_created":"2021-06-21T08:12:30Z","page":"8007-8026","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"mla":"Bucić, Matija, et al. “Halfway to Rota’s Basis Conjecture.” International Mathematics Research Notices, vol. 2020, no. 21, Oxford University Press, 2020, pp. 8007–26, doi:10.1093/imrn/rnaa004.","ieee":"M. Bucić, M. A. Kwan, A. Pokrovskiy, and B. Sudakov, “Halfway to Rota’s basis conjecture,” International Mathematics Research Notices, vol. 2020, no. 21. Oxford University Press, pp. 8007–8026, 2020.","short":"M. Bucić, M.A. Kwan, A. Pokrovskiy, B. Sudakov, International Mathematics Research Notices 2020 (2020) 8007–8026.","ama":"Bucić M, Kwan MA, Pokrovskiy A, Sudakov B. Halfway to Rota’s basis conjecture. International Mathematics Research Notices. 2020;2020(21):8007-8026. doi:10.1093/imrn/rnaa004","apa":"Bucić, M., Kwan, M. A., Pokrovskiy, A., & Sudakov, B. (2020). Halfway to Rota’s basis conjecture. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnaa004","chicago":"Bucić, Matija, Matthew Alan Kwan, Alexey Pokrovskiy, and Benny Sudakov. “Halfway to Rota’s Basis Conjecture.” International Mathematics Research Notices. Oxford University Press, 2020. https://doi.org/10.1093/imrn/rnaa004.","ista":"Bucić M, Kwan MA, Pokrovskiy A, Sudakov B. 2020. Halfway to Rota’s basis conjecture. International Mathematics Research Notices. 2020(21), 8007–8026."},"title":"Halfway to Rota’s basis conjecture","author":[{"full_name":"Bucić, Matija","last_name":"Bucić","first_name":"Matija"},{"first_name":"Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","last_name":"Kwan","orcid":"0000-0002-4003-7567","full_name":"Kwan, Matthew Alan"},{"full_name":"Pokrovskiy, Alexey","last_name":"Pokrovskiy","first_name":"Alexey"},{"first_name":"Benny","last_name":"Sudakov","full_name":"Sudakov, Benny"}],"external_id":{"arxiv":["1810.07462"]},"article_processing_charge":"No"},{"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"mla":"Kwan, Matthew Alan, and Benny Sudakov. “Ramsey Graphs Induce Subgraphs of Quadratically Many Sizes.” International Mathematics Research Notices, vol. 2020, no. 6, Oxford University Press, 2020, pp. 1621–1638, doi:10.1093/imrn/rny064.","short":"M.A. Kwan, B. Sudakov, International Mathematics Research Notices 2020 (2020) 1621–1638.","ieee":"M. A. Kwan and B. Sudakov, “Ramsey graphs induce subgraphs of quadratically many sizes,” International Mathematics Research Notices, vol. 2020, no. 6. Oxford University Press, pp. 1621–1638, 2020.","ama":"Kwan MA, Sudakov B. Ramsey graphs induce subgraphs of quadratically many sizes. International Mathematics Research Notices. 2020;2020(6):1621–1638. doi:10.1093/imrn/rny064","apa":"Kwan, M. A., & Sudakov, B. (2020). Ramsey graphs induce subgraphs of quadratically many sizes. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rny064","chicago":"Kwan, Matthew Alan, and Benny Sudakov. “Ramsey Graphs Induce Subgraphs of Quadratically Many Sizes.” International Mathematics Research Notices. Oxford University Press, 2020. https://doi.org/10.1093/imrn/rny064.","ista":"Kwan MA, Sudakov B. 2020. Ramsey graphs induce subgraphs of quadratically many sizes. International Mathematics Research Notices. 2020(6), 1621–1638."},"title":"Ramsey graphs induce subgraphs of quadratically many sizes","article_processing_charge":"No","external_id":{"arxiv":["1711.02937"]},"author":[{"full_name":"Kwan, Matthew Alan","orcid":"0000-0002-4003-7567","last_name":"Kwan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan"},{"last_name":"Sudakov","full_name":"Sudakov, Benny","first_name":"Benny"}],"oa":1,"quality_controlled":"1","publisher":"Oxford University Press","publication":"International Mathematics Research Notices","day":"01","year":"2020","date_created":"2021-06-21T08:30:12Z","doi":"10.1093/imrn/rny064","date_published":"2020-03-01T00:00:00Z","page":"1621–1638","_id":"9577","status":"public","article_type":"original","type":"journal_article","extern":"1","date_updated":"2023-02-23T14:01:33Z","oa_version":"Published Version","abstract":[{"text":"An n-vertex graph is called C-Ramsey if it has no clique or independent set of size Clogn. All known constructions of Ramsey graphs involve randomness in an essential way, and there is an ongoing line of research towards showing that in fact all Ramsey graphs must obey certain “richness” properties characteristic of random graphs. Motivated by an old problem of Erd̋s and McKay, recently Narayanan, Sahasrabudhe, and Tomon conjectured that for any fixed C, every n-vertex C-Ramsey graph induces subgraphs of Θ(n2) different sizes. In this paper we prove this conjecture.","lang":"eng"}],"intvolume":" 2020","month":"03","main_file_link":[{"url":"https://doi.org/10.1093/imrn/rny064","open_access":"1"}],"scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["1687-0247"],"issn":["1073-7928"]},"volume":2020,"issue":"6"},{"volume":52,"issue":"3","publication_identifier":{"eissn":["1469-2120"],"issn":["0024-6093"]},"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1911.12878"}],"month":"06","intvolume":" 52","abstract":[{"lang":"eng","text":"It is a classical fact that for any ε>0, a random permutation of length n=(1+ε)k2/4 typically contains a monotone subsequence of length k. As a far-reaching generalization, Alon conjectured that a random permutation of this same length n is typically k-universal, meaning that it simultaneously contains every pattern of length k. He also made the simple observation that for n=O(k2logk), a random length-n permutation is typically k-universal. We make the first significant progress towards Alon's conjecture by showing that n=2000k2loglogk suffices."}],"oa_version":"Preprint","date_updated":"2023-02-23T14:01:23Z","extern":"1","article_type":"original","type":"journal_article","status":"public","_id":"9573","page":"515-529","date_published":"2020-06-01T00:00:00Z","doi":"10.1112/blms.12345","date_created":"2021-06-21T06:23:42Z","year":"2020","day":"01","publication":"Bulletin of the London Mathematical Society","publisher":"Wiley","quality_controlled":"1","oa":1,"author":[{"full_name":"He, Xiaoyu","last_name":"He","first_name":"Xiaoyu"},{"full_name":"Kwan, Matthew Alan","orcid":"0000-0002-4003-7567","last_name":"Kwan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan"}],"external_id":{"arxiv":["1911.12878"]},"article_processing_charge":"No","title":"Universality of random permutations","citation":{"ista":"He X, Kwan MA. 2020. Universality of random permutations. Bulletin of the London Mathematical Society. 52(3), 515–529.","chicago":"He, Xiaoyu, and Matthew Alan Kwan. “Universality of Random Permutations.” Bulletin of the London Mathematical Society. Wiley, 2020. https://doi.org/10.1112/blms.12345.","ama":"He X, Kwan MA. Universality of random permutations. Bulletin of the London Mathematical Society. 2020;52(3):515-529. doi:10.1112/blms.12345","apa":"He, X., & Kwan, M. A. (2020). Universality of random permutations. Bulletin of the London Mathematical Society. Wiley. https://doi.org/10.1112/blms.12345","ieee":"X. He and M. A. Kwan, “Universality of random permutations,” Bulletin of the London Mathematical Society, vol. 52, no. 3. Wiley, pp. 515–529, 2020.","short":"X. He, M.A. Kwan, Bulletin of the London Mathematical Society 52 (2020) 515–529.","mla":"He, Xiaoyu, and Matthew Alan Kwan. “Universality of Random Permutations.” Bulletin of the London Mathematical Society, vol. 52, no. 3, Wiley, 2020, pp. 515–29, doi:10.1112/blms.12345."},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf"},{"acknowledgement":"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 805223 ScaleML). Also, we would like to thank Alexander Shevchenko, Alexandra Peste, and other members of the group for fruitful discussions.","oa":1,"publisher":"Curran Associates","quality_controlled":"1","publication":"Advances in Neural Information Processing Systems","day":"06","year":"2020","date_created":"2021-07-04T22:01:26Z","date_published":"2020-12-06T00:00:00Z","page":"18098-18109","project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"short":"S.P. Singh, D.-A. Alistarh, in:, Advances in Neural Information Processing Systems, Curran Associates, 2020, pp. 18098–18109.","ieee":"S. P. Singh and D.-A. Alistarh, “WoodFisher: Efficient second-order approximation for neural network compression,” in Advances in Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 18098–18109.","ama":"Singh SP, Alistarh D-A. WoodFisher: Efficient second-order approximation for neural network compression. In: Advances in Neural Information Processing Systems. Vol 33. Curran Associates; 2020:18098-18109.","apa":"Singh, S. P., & Alistarh, D.-A. (2020). WoodFisher: Efficient second-order approximation for neural network compression. In Advances in Neural Information Processing Systems (Vol. 33, pp. 18098–18109). Vancouver, Canada: Curran Associates.","mla":"Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order Approximation for Neural Network Compression.” Advances in Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 18098–109.","ista":"Singh SP, Alistarh D-A. 2020. WoodFisher: Efficient second-order approximation for neural network compression. Advances in Neural Information Processing Systems. NeurIPS: Conference on Neural Information Processing Systems vol. 33, 18098–18109.","chicago":"Singh, Sidak Pal, and Dan-Adrian Alistarh. “WoodFisher: Efficient Second-Order Approximation for Neural Network Compression.” In Advances in Neural Information Processing Systems, 33:18098–109. Curran Associates, 2020."},"title":"WoodFisher: Efficient second-order approximation for neural network compression","external_id":{"arxiv":["2004.14340"]},"article_processing_charge":"No","author":[{"first_name":"Sidak Pal","id":"DD138E24-D89D-11E9-9DC0-DEF6E5697425","full_name":"Singh, Sidak Pal","last_name":"Singh"},{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X"}],"oa_version":"Published Version","abstract":[{"text":"Second-order information, in the form of Hessian- or Inverse-Hessian-vector products, is a fundamental tool for solving optimization problems. Recently, there has been significant interest in utilizing this information in the context of deep\r\nneural networks; however, relatively little is known about the quality of existing approximations in this context. Our work examines this question, identifies issues with existing approaches, and proposes a method called WoodFisher to compute a faithful and efficient estimate of the inverse Hessian. Our main application is to neural network compression, where we build on the classic Optimal Brain Damage/Surgeon framework. We demonstrate that WoodFisher significantly outperforms popular state-of-the-art methods for oneshot pruning. Further, even when iterative, gradual pruning is allowed, our method results in a gain in test accuracy over the state-of-the-art approaches, for standard image classification datasets such as ImageNet ILSVRC. We examine how our method can be extended to take into account first-order information, as well as\r\nillustrate its ability to automatically set layer-wise pruning thresholds and perform compression in the limited-data regime. The code is available at the following link, https://github.com/IST-DASLab/WoodFisher.","lang":"eng"}],"intvolume":" 33","month":"12","main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2020/hash/d1ff1ec86b62cd5f3903ff19c3a326b2-Abstract.html","open_access":"1"}],"scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9781713829546"],"issn":["10495258"]},"ec_funded":1,"volume":33,"_id":"9632","status":"public","conference":{"name":"NeurIPS: Conference on Neural Information Processing Systems","location":"Vancouver, Canada","end_date":"2020-12-12","start_date":"2020-12-06"},"type":"conference","date_updated":"2023-02-23T14:03:06Z","department":[{"_id":"DaAl"},{"_id":"ToHe"}]},{"acknowledgement":"This research is partially supported by the Office of Naval Research, through grant no. N62909-18-1-2038, and the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF).","quality_controlled":"1","publisher":"Carleton University","oa":1,"has_accepted_license":"1","year":"2020","day":"14","publication":"Journal of Computational Geometry","page":"162-182","doi":"10.20382/jocg.v11i2a7","date_published":"2020-12-14T00:00:00Z","date_created":"2021-07-04T22:01:26Z","project":[{"name":"Discretization in Geometry and Dynamics","grant_number":"I4887","_id":"0aa4bc98-070f-11eb-9043-e6fff9c6a316"}],"citation":{"short":"H. Edelsbrunner, Z. Virk, H. Wagner, Journal of Computational Geometry 11 (2020) 162–182.","ieee":"H. Edelsbrunner, Z. Virk, and H. Wagner, “Topological data analysis in information space,” Journal of Computational Geometry, vol. 11, no. 2. Carleton University, pp. 162–182, 2020.","apa":"Edelsbrunner, H., Virk, Z., & Wagner, H. (2020). Topological data analysis in information space. Journal of Computational Geometry. Carleton University. https://doi.org/10.20382/jocg.v11i2a7","ama":"Edelsbrunner H, Virk Z, Wagner H. Topological data analysis in information space. Journal of Computational Geometry. 2020;11(2):162-182. doi:10.20382/jocg.v11i2a7","mla":"Edelsbrunner, Herbert, et al. “Topological Data Analysis in Information Space.” Journal of Computational Geometry, vol. 11, no. 2, Carleton University, 2020, pp. 162–82, doi:10.20382/jocg.v11i2a7.","ista":"Edelsbrunner H, Virk Z, Wagner H. 2020. Topological data analysis in information space. Journal of Computational Geometry. 11(2), 162–182.","chicago":"Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Topological Data Analysis in Information Space.” Journal of Computational Geometry. Carleton University, 2020. https://doi.org/10.20382/jocg.v11i2a7."},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"id":"2E36B656-F248-11E8-B48F-1D18A9856A87","first_name":"Ziga","full_name":"Virk, Ziga","last_name":"Virk"},{"id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","first_name":"Hubert","last_name":"Wagner","full_name":"Wagner, Hubert"}],"article_processing_charge":"Yes","title":"Topological data analysis in information space","abstract":[{"text":"Various kinds of data are routinely represented as discrete probability distributions. Examples include text documents summarized by histograms of word occurrences and images represented as histograms of oriented gradients. Viewing a discrete probability distribution as a point in the standard simplex of the appropriate dimension, we can understand collections of such objects in geometric and topological terms. Importantly, instead of using the standard Euclidean distance, we look into dissimilarity measures with information-theoretic justification, and we develop the theory needed for applying topological data analysis in this setting. In doing so, we emphasize constructions that enable the usage of existing computational topology software in this context.","lang":"eng"}],"oa_version":"Published Version","scopus_import":"1","month":"12","intvolume":" 11","publication_identifier":{"eissn":["1920180X"]},"publication_status":"published","file":[{"date_created":"2021-08-11T11:55:11Z","file_name":"2020_JournalOfComputationalGeometry_Edelsbrunner.pdf","creator":"asandaue","date_updated":"2021-08-11T11:55:11Z","file_size":1449234,"file_id":"9882","checksum":"f02d0b2b3838e7891a6c417fc34ffdcd","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"issue":"2","volume":11,"_id":"9630","article_type":"original","type":"journal_article","tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"status":"public","date_updated":"2021-08-11T12:26:34Z","ddc":["510","000"],"department":[{"_id":"HeEd"}],"file_date_updated":"2021-08-11T11:55:11Z"},{"year":"2020","publication":"Advances in Neural Information Processing Systems","day":"06","page":"22361-22372","date_created":"2021-07-04T22:01:26Z","date_published":"2020-12-06T00:00:00Z","acknowledgement":"We thank Marco Mondelli for discussions related to LDPC decoding, and Giorgi Nadiradze for discussions on analysis of relaxed schedulers. This project has received funding from the European Research Council (ERC) under the European\r\nUnion’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML).","oa":1,"publisher":"Curran Associates","quality_controlled":"1","citation":{"ista":"Aksenov V, Alistarh D-A, Korhonen J. 2020. Scalable belief propagation via relaxed scheduling. Advances in Neural Information Processing Systems. NeurIPS: Conference on Neural Information Processing Systems vol. 33, 22361–22372.","chicago":"Aksenov, Vitaly, Dan-Adrian Alistarh, and Janne Korhonen. “Scalable Belief Propagation via Relaxed Scheduling.” In Advances in Neural Information Processing Systems, 33:22361–72. Curran Associates, 2020.","apa":"Aksenov, V., Alistarh, D.-A., & Korhonen, J. (2020). Scalable belief propagation via relaxed scheduling. In Advances in Neural Information Processing Systems (Vol. 33, pp. 22361–22372). Vancouver, Canada: Curran Associates.","ama":"Aksenov V, Alistarh D-A, Korhonen J. Scalable belief propagation via relaxed scheduling. In: Advances in Neural Information Processing Systems. Vol 33. Curran Associates; 2020:22361-22372.","short":"V. Aksenov, D.-A. Alistarh, J. Korhonen, in:, Advances in Neural Information Processing Systems, Curran Associates, 2020, pp. 22361–22372.","ieee":"V. Aksenov, D.-A. Alistarh, and J. Korhonen, “Scalable belief propagation via relaxed scheduling,” in Advances in Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 22361–22372.","mla":"Aksenov, Vitaly, et al. “Scalable Belief Propagation via Relaxed Scheduling.” Advances in Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 22361–72."},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","external_id":{"arxiv":["2002.11505"]},"article_processing_charge":"No","author":[{"first_name":"Vitaly","last_name":"Aksenov","full_name":"Aksenov, Vitaly"},{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Korhonen","full_name":"Korhonen, Janne","first_name":"Janne","id":"C5402D42-15BC-11E9-A202-CA2BE6697425"}],"title":"Scalable belief propagation via relaxed scheduling","project":[{"grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"publication_status":"published","publication_identifier":{"issn":["10495258"],"isbn":["9781713829546"]},"language":[{"iso":"eng"}],"ec_funded":1,"volume":33,"abstract":[{"text":"The ability to leverage large-scale hardware parallelism has been one of the key enablers of the accelerated recent progress in machine learning. Consequently, there has been considerable effort invested into developing efficient parallel variants of classic machine learning algorithms. However, despite the wealth of knowledge on parallelization, some classic machine learning algorithms often prove hard to parallelize efficiently while maintaining convergence. In this paper, we focus on efficient parallel algorithms for the key machine learning task of inference on graphical models, in particular on the fundamental belief propagation algorithm. We address the challenge of efficiently parallelizing this classic paradigm by showing how to leverage scalable relaxed schedulers in this context. We present an extensive empirical study, showing that our approach outperforms previous parallel belief propagation implementations both in terms of scalability and in terms of wall-clock convergence time, on a range of practical applications.","lang":"eng"}],"oa_version":"Published Version","main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2020/hash/fdb2c3bab9d0701c4a050a4d8d782c7f-Abstract.html","open_access":"1"}],"scopus_import":"1","intvolume":" 33","month":"12","date_updated":"2023-02-23T14:03:03Z","department":[{"_id":"DaAl"}],"_id":"9631","conference":{"start_date":"2020-12-06","location":"Vancouver, Canada","end_date":"2020-12-12","name":"NeurIPS: Conference on Neural Information Processing Systems"},"type":"conference","status":"public"},{"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"ista":"Reinhardt A, Pickard CJ, Cheng B. 2020. Predicting the phase diagram of titanium dioxide with random search and pattern recognition. Physical Chemistry Chemical Physics. 22(22), 12697–12705.","chicago":"Reinhardt, Aleks, Chris J. Pickard, and Bingqing Cheng. “Predicting the Phase Diagram of Titanium Dioxide with Random Search and Pattern Recognition.” Physical Chemistry Chemical Physics. Royal Society of Chemistry, 2020. https://doi.org/10.1039/d0cp02513e.","ama":"Reinhardt A, Pickard CJ, Cheng B. Predicting the phase diagram of titanium dioxide with random search and pattern recognition. Physical Chemistry Chemical Physics. 2020;22(22):12697-12705. doi:10.1039/d0cp02513e","apa":"Reinhardt, A., Pickard, C. J., & Cheng, B. (2020). Predicting the phase diagram of titanium dioxide with random search and pattern recognition. Physical Chemistry Chemical Physics. Royal Society of Chemistry. https://doi.org/10.1039/d0cp02513e","ieee":"A. Reinhardt, C. J. Pickard, and B. Cheng, “Predicting the phase diagram of titanium dioxide with random search and pattern recognition,” Physical Chemistry Chemical Physics, vol. 22, no. 22. Royal Society of Chemistry, pp. 12697–12705, 2020.","short":"A. Reinhardt, C.J. Pickard, B. Cheng, Physical Chemistry Chemical Physics 22 (2020) 12697–12705.","mla":"Reinhardt, Aleks, et al. “Predicting the Phase Diagram of Titanium Dioxide with Random Search and Pattern Recognition.” Physical Chemistry Chemical Physics, vol. 22, no. 22, Royal Society of Chemistry, 2020, pp. 12697–705, doi:10.1039/d0cp02513e."},"title":"Predicting the phase diagram of titanium dioxide with random search and pattern recognition","external_id":{"pmid":["32459228"],"arxiv":["1909.08934"]},"article_processing_charge":"No","author":[{"full_name":"Reinhardt, Aleks","last_name":"Reinhardt","first_name":"Aleks"},{"first_name":"Chris J.","full_name":"Pickard, Chris J.","last_name":"Pickard"},{"last_name":"Cheng","full_name":"Cheng, Bingqing","orcid":"0000-0002-3584-9632","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","first_name":"Bingqing"}],"oa":1,"publisher":"Royal Society of Chemistry","quality_controlled":"1","publication":"Physical Chemistry Chemical Physics","day":"14","year":"2020","has_accepted_license":"1","date_created":"2021-07-15T12:37:27Z","date_published":"2020-06-14T00:00:00Z","doi":"10.1039/d0cp02513e","page":"12697-12705","_id":"9666","status":"public","tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"article_type":"original","type":"journal_article","ddc":["530"],"extern":"1","date_updated":"2023-02-23T14:04:16Z","file_date_updated":"2021-07-15T12:43:51Z","pmid":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Predicting phase stabilities of crystal polymorphs is central to computational materials science and chemistry. Such predictions are challenging because they first require searching for potential energy minima and then performing arduous free-energy calculations to account for entropic effects at finite temperatures. Here, we develop a framework that facilitates such predictions by exploiting all the information obtained from random searches of crystal structures. This framework combines automated clustering, classification and visualisation of crystal structures with machine-learning estimation of their enthalpy and entropy. We demonstrate the framework on the technologically important system of TiO2, which has many polymorphs, without relying on prior knowledge of known phases. We find a number of new phases and predict the phase diagram and metastabilities of crystal polymorphs at 1600 K, benchmarking the results against full free-energy calculations."}],"intvolume":" 22","month":"06","scopus_import":"1","language":[{"iso":"eng"}],"file":[{"date_updated":"2021-07-15T12:43:51Z","file_size":3151206,"creator":"asandaue","date_created":"2021-07-15T12:43:51Z","file_name":"202_PhysicalChemistryChemicalPhysics_Reinhardt.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"0a6872972b1b2e60f9095d39b01753fa","file_id":"9667","success":1}],"publication_status":"published","publication_identifier":{"issn":["1463-9076"],"eissn":["1463-9084"]},"volume":22,"issue":"22"},{"month":"11","intvolume":" 11","scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"Water molecules can arrange into a liquid with complex hydrogen-bond networks and at least 17 experimentally confirmed ice phases with enormous structural diversity. It remains a puzzle how or whether this multitude of arrangements in different phases of water are related. Here we investigate the structural similarities between liquid water and a comprehensive set of 54 ice phases in simulations, by directly comparing their local environments using general atomic descriptors, and also by demonstrating that a machine-learning potential trained on liquid water alone can predict the densities, lattice energies, and vibrational properties of the ices. The finding that the local environments characterising the different ice phases are found in water sheds light on the phase behavior of water, and rationalizes the transferability of water models between different phases.","lang":"eng"}],"issue":"1","volume":11,"file":[{"checksum":"1edd9b6d8fa791f8094d87bd6453955b","file_id":"9672","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2021-07-15T14:05:45Z","file_name":"2020_NatureCommunications_Monserrat.pdf","creator":"asandaue","date_updated":"2021-07-15T14:05:45Z","file_size":1385954}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2041-1723"]},"publication_status":"published","status":"public","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"9671","file_date_updated":"2021-07-15T14:05:45Z","extern":"1","ddc":["530","540"],"date_updated":"2023-02-23T14:04:25Z","publisher":"Springer Nature","quality_controlled":"1","oa":1,"doi":"10.1038/s41467-020-19606-y","date_published":"2020-11-13T00:00:00Z","date_created":"2021-07-15T14:01:35Z","day":"13","publication":"Nature Communications","has_accepted_license":"1","year":"2020","article_number":"5757","title":"Liquid water contains the building blocks of diverse ice phases","author":[{"first_name":"Bartomeu","last_name":"Monserrat","full_name":"Monserrat, Bartomeu"},{"full_name":"Brandenburg, Jan Gerit","last_name":"Brandenburg","first_name":"Jan Gerit"},{"last_name":"Engel","full_name":"Engel, Edgar A.","first_name":"Edgar A."},{"first_name":"Bingqing","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","full_name":"Cheng, Bingqing","orcid":"0000-0002-3584-9632","last_name":"Cheng"}],"article_processing_charge":"No","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"ieee":"B. Monserrat, J. G. Brandenburg, E. A. Engel, and B. Cheng, “Liquid water contains the building blocks of diverse ice phases,” Nature Communications, vol. 11, no. 1. Springer Nature, 2020.","short":"B. Monserrat, J.G. Brandenburg, E.A. Engel, B. Cheng, Nature Communications 11 (2020).","apa":"Monserrat, B., Brandenburg, J. G., Engel, E. A., & Cheng, B. (2020). Liquid water contains the building blocks of diverse ice phases. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-020-19606-y","ama":"Monserrat B, Brandenburg JG, Engel EA, Cheng B. Liquid water contains the building blocks of diverse ice phases. Nature Communications. 2020;11(1). doi:10.1038/s41467-020-19606-y","mla":"Monserrat, Bartomeu, et al. “Liquid Water Contains the Building Blocks of Diverse Ice Phases.” Nature Communications, vol. 11, no. 1, 5757, Springer Nature, 2020, doi:10.1038/s41467-020-19606-y.","ista":"Monserrat B, Brandenburg JG, Engel EA, Cheng B. 2020. Liquid water contains the building blocks of diverse ice phases. Nature Communications. 11(1), 5757.","chicago":"Monserrat, Bartomeu, Jan Gerit Brandenburg, Edgar A. Engel, and Bingqing Cheng. “Liquid Water Contains the Building Blocks of Diverse Ice Phases.” Nature Communications. Springer Nature, 2020. https://doi.org/10.1038/s41467-020-19606-y."}},{"date_created":"2020-09-20T22:01:36Z","date_published":"2020-08-18T00:00:00Z","doi":"10.4230/LIPIcs.MFCS.2020.22","year":"2020","has_accepted_license":"1","publication":"45th International Symposium on Mathematical Foundations of Computer Science","day":"18","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","acknowledgement":"Krishnendu Chatterjee: The research was partially supported by the Vienna Science and\r\nTechnology Fund (WWTF) Project ICT15-003.\r\nIsmaël Jecker: This project has received funding from the European Union’s Horizon 2020 research\r\nand innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411.","article_processing_charge":"No","external_id":{"arxiv":["2007.02894"]},"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Jecker, Ismael R","last_name":"Jecker","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","first_name":"Ismael R"},{"last_name":"Svoboda","full_name":"Svoboda, Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","first_name":"Jakub"}],"title":"Simplified game of life: Algorithms and complexity","citation":{"ista":"Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. 2020. Simplified game of life: Algorithms and complexity. 45th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 170, 22:1-22:13.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub Svoboda. “Simplified Game of Life: Algorithms and Complexity.” In 45th International Symposium on Mathematical Foundations of Computer Science, Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.MFCS.2020.22.","ama":"Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. Simplified game of life: Algorithms and complexity. In: 45th International Symposium on Mathematical Foundations of Computer Science. Vol 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.MFCS.2020.22","apa":"Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., & Svoboda, J. (2020). Simplified game of life: Algorithms and complexity. In 45th International Symposium on Mathematical Foundations of Computer Science (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2020.22","ieee":"K. Chatterjee, R. Ibsen-Jensen, I. R. Jecker, and J. Svoboda, “Simplified game of life: Algorithms and complexity,” in 45th International Symposium on Mathematical Foundations of Computer Science, Prague, Czech Republic, 2020, vol. 170.","short":"K. Chatterjee, R. Ibsen-Jensen, I.R. Jecker, J. Svoboda, in:, 45th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","mla":"Chatterjee, Krishnendu, et al. “Simplified Game of Life: Algorithms and Complexity.” 45th International Symposium on Mathematical Foundations of Computer Science, vol. 170, 22:1-22:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.MFCS.2020.22."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"article_number":"22:1-22:13","ec_funded":1,"volume":170,"publication_status":"published","publication_identifier":{"issn":["18688969"],"isbn":["9783959771597"]},"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"bbd7c4f55d45f2ff2a0a4ef0e10a77b1","file_id":"8550","file_size":491374,"date_updated":"2020-09-21T13:57:34Z","creator":"dernst","file_name":"2020_LIPIcs_Chatterjee.pdf","date_created":"2020-09-21T13:57:34Z"}],"alternative_title":["LIPIcs"],"scopus_import":"1","intvolume":" 170","month":"08","abstract":[{"text":"Game of Life is a simple and elegant model to study dynamical system over networks. The model consists of a graph where every vertex has one of two types, namely, dead or alive. A configuration is a mapping of the vertices to the types. An update rule describes how the type of a vertex is updated given the types of its neighbors. In every round, all vertices are updated synchronously, which leads to a configuration update. While in general, Game of Life allows a broad range of update rules, we focus on two simple families of update rules, namely, underpopulation and overpopulation, that model several interesting dynamics studied in the literature. In both settings, a dead vertex requires at least a desired number of live neighbors to become alive. For underpopulation (resp., overpopulation), a live vertex requires at least (resp. at most) a desired number of live neighbors to remain alive. We study the basic computation problems, e.g., configuration reachability, for these two families of rules. For underpopulation rules, we show that these problems can be solved in polynomial time, whereas for overpopulation rules they are PSPACE-complete.","lang":"eng"}],"oa_version":"Published Version","file_date_updated":"2020-09-21T13:57:34Z","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T08:19:55Z","ddc":["000"],"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"conference":{"start_date":"2020-08-24","end_date":"2020-08-28","location":"Prague, Czech Republic","name":"MFCS: Symposium on Mathematical Foundations of Computer Science"},"type":"conference","status":"public","_id":"8533"},{"scopus_import":"1","alternative_title":["LIPIcs"],"intvolume":" 170","month":"08","abstract":[{"text":"A regular language L of finite words is composite if there are regular languages L₁,L₂,…,L_t such that L = ⋂_{i = 1}^t L_i and the index (number of states in a minimal DFA) of every language L_i is strictly smaller than the index of L. Otherwise, L is prime. Primality of regular languages was introduced and studied in [O. Kupferman and J. Mosheiff, 2015], where the complexity of deciding the primality of the language of a given DFA was left open, with a doubly-exponential gap between the upper and lower bounds. We study primality for unary regular languages, namely regular languages with a singleton alphabet. A unary language corresponds to a subset of ℕ, making the study of unary prime languages closer to that of primality in number theory. We show that the setting of languages is richer. In particular, while every composite number is the product of two smaller numbers, the number t of languages necessary to decompose a composite unary language induces a strict hierarchy. In addition, a primality witness for a unary language L, namely a word that is not in L but is in all products of languages that contain L and have an index smaller than L’s, may be of exponential length. Still, we are able to characterize compositionality by structural properties of a DFA for L, leading to a LogSpace algorithm for primality checking of unary DFAs.","lang":"eng"}],"oa_version":"Published Version","ec_funded":1,"volume":170,"publication_status":"published","publication_identifier":{"issn":["18688969"],"isbn":["9783959771597"]},"language":[{"iso":"eng"}],"file":[{"date_updated":"2020-09-21T14:17:08Z","file_size":597977,"creator":"dernst","date_created":"2020-09-21T14:17:08Z","file_name":"2020_LIPIcsMFCS_Jecker.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"2dc9e2fad6becd4563aef3e27a473f70","file_id":"8552","success":1}],"conference":{"name":"MFCS: Symposium on Mathematical Foundations of Computer Science","end_date":"2020-08-28","location":"Prague, Czech Republic","start_date":"2020-08-24"},"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"type":"conference","status":"public","_id":"8534","file_date_updated":"2020-09-21T14:17:08Z","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T08:19:56Z","ddc":["000"],"oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","acknowledgement":"Ismaël Jecker: This project has received funding from the European Union’s Horizon\r\n2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No.\r\n754411. Nicolas Mazzocchi: PhD fellowship FRIA from the F.R.S.-FNRS.","date_created":"2020-09-20T22:01:36Z","date_published":"2020-08-18T00:00:00Z","doi":"10.4230/LIPIcs.MFCS.2020.51","year":"2020","has_accepted_license":"1","publication":"45th International Symposium on Mathematical Foundations of Computer Science","day":"18","project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}],"article_number":"51:1-51:12","article_processing_charge":"No","author":[{"first_name":"Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","last_name":"Jecker","full_name":"Jecker, Ismael R"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"},{"full_name":"Mazzocchi, Nicolas","last_name":"Mazzocchi","first_name":"Nicolas"}],"title":"Unary prime languages","citation":{"apa":"Jecker, I. R., Kupferman, O., & Mazzocchi, N. (2020). Unary prime languages. In 45th International Symposium on Mathematical Foundations of Computer Science (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2020.51","ama":"Jecker IR, Kupferman O, Mazzocchi N. Unary prime languages. In: 45th International Symposium on Mathematical Foundations of Computer Science. Vol 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.MFCS.2020.51","short":"I.R. Jecker, O. Kupferman, N. Mazzocchi, in:, 45th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ieee":"I. R. Jecker, O. Kupferman, and N. Mazzocchi, “Unary prime languages,” in 45th International Symposium on Mathematical Foundations of Computer Science, Prague, Czech Republic, 2020, vol. 170.","mla":"Jecker, Ismael R., et al. “Unary Prime Languages.” 45th International Symposium on Mathematical Foundations of Computer Science, vol. 170, 51:1-51:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.MFCS.2020.51.","ista":"Jecker IR, Kupferman O, Mazzocchi N. 2020. Unary prime languages. 45th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 170, 51:1-51:12.","chicago":"Jecker, Ismael R, Orna Kupferman, and Nicolas Mazzocchi. “Unary Prime Languages.” In 45th International Symposium on Mathematical Foundations of Computer Science, Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.MFCS.2020.51."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"788183","name":"Alpha Shape Theory Extended"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"apa":"Akopyan, A., Schwartz, R., & Tabachnikov, S. (2020). Billiards in ellipses revisited. European Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s40879-020-00426-9","ama":"Akopyan A, Schwartz R, Tabachnikov S. Billiards in ellipses revisited. European Journal of Mathematics. 2020. doi:10.1007/s40879-020-00426-9","short":"A. Akopyan, R. Schwartz, S. Tabachnikov, European Journal of Mathematics (2020).","ieee":"A. Akopyan, R. Schwartz, and S. Tabachnikov, “Billiards in ellipses revisited,” European Journal of Mathematics. Springer Nature, 2020.","mla":"Akopyan, Arseniy, et al. “Billiards in Ellipses Revisited.” European Journal of Mathematics, Springer Nature, 2020, doi:10.1007/s40879-020-00426-9.","ista":"Akopyan A, Schwartz R, Tabachnikov S. 2020. Billiards in ellipses revisited. European Journal of Mathematics.","chicago":"Akopyan, Arseniy, Richard Schwartz, and Serge Tabachnikov. “Billiards in Ellipses Revisited.” European Journal of Mathematics. Springer Nature, 2020. https://doi.org/10.1007/s40879-020-00426-9."},"title":"Billiards in ellipses revisited","external_id":{"arxiv":["2001.02934"]},"article_processing_charge":"No","author":[{"last_name":"Akopyan","full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","first_name":"Arseniy"},{"full_name":"Schwartz, Richard","last_name":"Schwartz","first_name":"Richard"},{"last_name":"Tabachnikov","full_name":"Tabachnikov, Serge","first_name":"Serge"}],"acknowledgement":" This paper would not be written if not for Dan Reznik’s curiosity and persistence; we are very grateful to him. We also thank R. Garcia and J. Koiller for interesting discussions. It is a pleasure to thank the Mathematical Institute of the University of Heidelberg for its stimulating atmosphere. ST thanks M. Bialy for interesting discussions and the Tel Aviv\r\nUniversity for its invariable hospitality. AA was supported by European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 78818 Alpha). RS is supported by NSF Grant DMS-1807320. ST was supported by NSF grant DMS-1510055 and SFB/TRR 191.","oa":1,"quality_controlled":"1","publisher":"Springer Nature","publication":"European Journal of Mathematics","day":"09","year":"2020","date_created":"2020-09-20T22:01:38Z","date_published":"2020-09-09T00:00:00Z","doi":"10.1007/s40879-020-00426-9","_id":"8538","status":"public","article_type":"original","type":"journal_article","date_updated":"2021-12-02T15:10:17Z","department":[{"_id":"HeEd"}],"oa_version":"Preprint","abstract":[{"text":"We prove some recent experimental observations of Dan Reznik concerning periodic billiard orbits in ellipses. For example, the sum of cosines of the angles of a periodic billiard polygon remains constant in the 1-parameter family of such polygons (that exist due to the Poncelet porism). In our proofs, we use geometric and complex analytic methods.","lang":"eng"}],"month":"09","main_file_link":[{"url":"https://arxiv.org/abs/2001.02934","open_access":"1"}],"scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["2199-6768"],"issn":["2199-675X"]},"ec_funded":1},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:20:19Z","citation":{"chicago":"Gao, Xiaofei, Jun-Liszt Li, Xingjun Chen, Bo Ci, Fei Chen, Nannan Lu, Bo Shen, et al. “Reduction of Neuronal Activity Mediated by Blood-Vessel Regression in the Brain.” BioRxiv. Cold Spring Harbor Laboratory, n.d. https://doi.org/10.1101/2020.09.15.262782.","ista":"Gao X, Li J-L, Chen X, Ci B, Chen F, Lu N, Shen B, Zheng L, Jia J-M, Yi Y, Zhang S, Shi Y-C, Shi K, Propson NE, Huang Y, Poinsatte K, Zhang Z, Yue Y, Bosco DB, Lu Y, Yang S, Adams RH, Lindner V, Huang F, Wu L-J, Zheng H, Han F, Hippenmeyer S, Stowe AM, Peng B, Margeta M, Wang X, Liu Q, Körbelin J, Trepel M, Lu H, Zhou BO, Zhao H, Su W, Bachoo RM, Ge W. Reduction of neuronal activity mediated by blood-vessel regression in the brain. bioRxiv, 10.1101/2020.09.15.262782.","mla":"Gao, Xiaofei, et al. “Reduction of Neuronal Activity Mediated by Blood-Vessel Regression in the Brain.” BioRxiv, Cold Spring Harbor Laboratory, doi:10.1101/2020.09.15.262782.","ama":"Gao X, Li J-L, Chen X, et al. Reduction of neuronal activity mediated by blood-vessel regression in the brain. bioRxiv. doi:10.1101/2020.09.15.262782","apa":"Gao, X., Li, J.-L., Chen, X., Ci, B., Chen, F., Lu, N., … Ge, W. (n.d.). Reduction of neuronal activity mediated by blood-vessel regression in the brain. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/2020.09.15.262782","ieee":"X. Gao et al., “Reduction of neuronal activity mediated by blood-vessel regression in the brain,” bioRxiv. Cold Spring Harbor Laboratory.","short":"X. Gao, J.-L. Li, X. Chen, B. Ci, F. Chen, N. Lu, B. Shen, L. Zheng, J.-M. Jia, Y. Yi, S. Zhang, Y.-C. Shi, K. Shi, N.E. Propson, Y. Huang, K. Poinsatte, Z. Zhang, Y. Yue, D.B. Bosco, Y. Lu, S. Yang, R.H. Adams, V. Lindner, F. Huang, L.-J. Wu, H. Zheng, F. Han, S. Hippenmeyer, A.M. Stowe, B. Peng, M. Margeta, X. Wang, Q. Liu, J. Körbelin, M. Trepel, H. Lu, B.O. Zhou, H. Zhao, W. Su, R.M. Bachoo, W. Ge, BioRxiv (n.d.)."},"title":"Reduction of neuronal activity mediated by blood-vessel regression in the brain","department":[{"_id":"SiHi"}],"author":[{"first_name":"Xiaofei","full_name":"Gao, Xiaofei","last_name":"Gao"},{"last_name":"Li","full_name":"Li, Jun-Liszt","first_name":"Jun-Liszt"},{"first_name":"Xingjun","full_name":"Chen, Xingjun","last_name":"Chen"},{"first_name":"Bo","last_name":"Ci","full_name":"Ci, Bo"},{"first_name":"Fei","last_name":"Chen","full_name":"Chen, Fei"},{"full_name":"Lu, Nannan","last_name":"Lu","first_name":"Nannan"},{"last_name":"Shen","full_name":"Shen, Bo","first_name":"Bo"},{"first_name":"Lijun","full_name":"Zheng, Lijun","last_name":"Zheng"},{"first_name":"Jie-Min","last_name":"Jia","full_name":"Jia, Jie-Min"},{"first_name":"Yating","last_name":"Yi","full_name":"Yi, Yating"},{"last_name":"Zhang","full_name":"Zhang, Shiwen","first_name":"Shiwen"},{"last_name":"Shi","full_name":"Shi, Ying-Chao","first_name":"Ying-Chao"},{"last_name":"Shi","full_name":"Shi, Kaibin","first_name":"Kaibin"},{"first_name":"Nicholas E","last_name":"Propson","full_name":"Propson, Nicholas E"},{"first_name":"Yubin","last_name":"Huang","full_name":"Huang, Yubin"},{"first_name":"Katherine","last_name":"Poinsatte","full_name":"Poinsatte, Katherine"},{"last_name":"Zhang","full_name":"Zhang, Zhaohuan","first_name":"Zhaohuan"},{"full_name":"Yue, Yuanlei","last_name":"Yue","first_name":"Yuanlei"},{"first_name":"Dale B","full_name":"Bosco, Dale B","last_name":"Bosco"},{"first_name":"Ying-mei","full_name":"Lu, Ying-mei","last_name":"Lu"},{"last_name":"Yang","full_name":"Yang, Shi-bing","first_name":"Shi-bing"},{"first_name":"Ralf H.","last_name":"Adams","full_name":"Adams, Ralf H."},{"full_name":"Lindner, Volkhard","last_name":"Lindner","first_name":"Volkhard"},{"full_name":"Huang, Fen","last_name":"Huang","first_name":"Fen"},{"last_name":"Wu","full_name":"Wu, Long-Jun","first_name":"Long-Jun"},{"first_name":"Hui","full_name":"Zheng, Hui","last_name":"Zheng"},{"first_name":"Feng","last_name":"Han","full_name":"Han, Feng"},{"last_name":"Hippenmeyer","full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061","first_name":"Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Stowe, Ann M.","last_name":"Stowe","first_name":"Ann M."},{"full_name":"Peng, Bo","last_name":"Peng","first_name":"Bo"},{"first_name":"Marta","full_name":"Margeta, Marta","last_name":"Margeta"},{"full_name":"Wang, Xiaoqun","last_name":"Wang","first_name":"Xiaoqun"},{"first_name":"Qiang","last_name":"Liu","full_name":"Liu, Qiang"},{"first_name":"Jakob","full_name":"Körbelin, Jakob","last_name":"Körbelin"},{"last_name":"Trepel","full_name":"Trepel, Martin","first_name":"Martin"},{"first_name":"Hui","full_name":"Lu, Hui","last_name":"Lu"},{"full_name":"Zhou, Bo O.","last_name":"Zhou","first_name":"Bo O."},{"last_name":"Zhao","full_name":"Zhao, Hu","first_name":"Hu"},{"first_name":"Wenzhi","full_name":"Su, Wenzhi","last_name":"Su"},{"first_name":"Robert M.","last_name":"Bachoo","full_name":"Bachoo, Robert M."},{"full_name":"Ge, Woo-ping","last_name":"Ge","first_name":"Woo-ping"}],"article_processing_charge":"No","_id":"8616","status":"public","project":[{"call_identifier":"H2020","_id":"260018B0-B435-11E9-9278-68D0E5697425","grant_number":"725780","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development"}],"type":"preprint","day":"15","language":[{"iso":"eng"}],"publication":"bioRxiv","publication_status":"submitted","year":"2020","doi":"10.1101/2020.09.15.262782","date_published":"2020-09-15T00:00:00Z","date_created":"2020-10-06T08:58:59Z","ec_funded":1,"oa_version":"Preprint","acknowledgement":"The project was initiated in the Jan lab at UCSF. We thank Lily Jan and Yuh-Nung Jan’s generous support. We thank Liqun Luo’s lab for providing MADM-7 mice and Rolf A Brekken for VEGF-antibodies. Drs. Yuanquan Song (UPenn), Zhaozhu Hu (JHU), Ji Hu (ShanghaiTech), Yang Xiang (U. Mass), Hao Wang (Zhejiang U.) and Ruikang Wang (U. Washington) for critical input, colleagues at Children’s Research Institute, Departments of Neuroscience, Neurology and Neurotherapeutics, Pediatrics from UT Southwestern, and colleagues from the Jan lab for discussion. Dr. Bridget Samuels, Sean Morrison (UT Southwestern), and Nannan Lu (Zhejiang U.) for critical reading. We acknowledge the assistance of the CIBR Imaging core. We also thank UT Southwestern Live Cell Imaging Facility, a Shared Resource of the Harold C. Simmons Cancer Center, supported in part by an NCI Cancer Center Support Grant, P30 CA142543K. This work is supported by CIBR funds and the American Heart Association AWRP Summer 2016 Innovative Research Grant (17IRG33410377) to W-P.G.; National Natural Science Foundation of China (No.81370031) to Z.Z.;National Key Research and Development Program of China (2016YFE0125400)to F.H.;National Natural Science Foundations of China (No. 81473202) to Y.L.; National Natural Science Foundation of China (No.31600839) and Shenzhen Science and Technology Research Program (JCYJ20170818163320865) to B.P.; National Natural Science Foundation of China (No. 31800864) and Westlake University start-up funds to J-M. J. NIH R01NS088627 to W.L.J.; NIH: R01 AG020670 and RF1AG054111 to H.Z.; R01 NS088555 to A.M.S., and European Research Council No.725780 to S.H.;W-P.G. was a recipient of Bugher-American Heart Association Dan Adams Thinking Outside the Box Award.","abstract":[{"text":"The brain vasculature supplies neurons with glucose and oxygen, but little is known about how vascular plasticity contributes to brain function. Using longitudinal in vivo imaging, we reported that a substantial proportion of blood vessels in the adult brain sporadically occluded and regressed. Their regression proceeded through sequential stages of blood-flow occlusion, endothelial cell collapse, relocation or loss of pericytes, and retraction of glial endfeet. Regressing vessels were found to be widespread in mouse, monkey and human brains. Both brief occlusions of the middle cerebral artery and lipopolysaccharide-mediated inflammation induced an increase of vessel regression. Blockage of leukocyte adhesion to endothelial cells alleviated LPS-induced vessel regression. We further revealed that blood vessel regression caused a reduction of neuronal activity due to a dysfunction in mitochondrial metabolism and glutamate production. Our results elucidate the mechanism of vessel regression and its role in neuronal function in the adult brain.","lang":"eng"}],"month":"09","publisher":"Cold Spring Harbor Laboratory","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/2020.09.15.262782"}],"oa":1},{"file_date_updated":"2020-10-23T09:29:45Z","title":"Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria","department":[{"_id":"E-Lib"}],"article_processing_charge":"No","author":[{"first_name":"Katja","full_name":"Mayer, Katja","last_name":"Mayer"},{"full_name":"Rieck, Katharina","last_name":"Rieck","first_name":"Katharina"},{"first_name":"Stefan","full_name":"Reichmann, Stefan","last_name":"Reichmann"},{"first_name":"Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","last_name":"Danowski","full_name":"Danowski, Patrick","orcid":"0000-0002-6026-4409"},{"last_name":"Graschopf","full_name":"Graschopf, Anton","first_name":"Anton"},{"first_name":"Thomas","full_name":"König, Thomas","last_name":"König"},{"first_name":"Peter","last_name":"Kraker","full_name":"Kraker, Peter"},{"full_name":"Lehner, Patrick","last_name":"Lehner","first_name":"Patrick"},{"first_name":"Falk","full_name":"Reckling, Falk","last_name":"Reckling"},{"first_name":"Tony","last_name":"Ross-Hellauer","full_name":"Ross-Hellauer, Tony"},{"first_name":"Daniel","full_name":"Spichtinger, Daniel","last_name":"Spichtinger"},{"first_name":"Michalis","full_name":"Tzatzanis, Michalis","last_name":"Tzatzanis"},{"first_name":"Stefanie","last_name":"Schürz","full_name":"Schürz, Stefanie"}],"ddc":["020"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Mayer, Katja, Katharina Rieck, Stefan Reichmann, Patrick Danowski, Anton Graschopf, Thomas König, Peter Kraker, et al. Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria. OANA, 2020. https://doi.org/10.5281/ZENODO.4109242.","ista":"Mayer K, Rieck K, Reichmann S, Danowski P, Graschopf A, König T, Kraker P, Lehner P, Reckling F, Ross-Hellauer T, Spichtinger D, Tzatzanis M, Schürz S. 2020. Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria, OANA, 36p.","mla":"Mayer, Katja, et al. Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria. OANA, 2020, doi:10.5281/ZENODO.4109242.","apa":"Mayer, K., Rieck, K., Reichmann, S., Danowski, P., Graschopf, A., König, T., … Schürz, S. (2020). Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria. OANA. https://doi.org/10.5281/ZENODO.4109242","ama":"Mayer K, Rieck K, Reichmann S, et al. Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria. OANA; 2020. doi:10.5281/ZENODO.4109242","short":"K. Mayer, K. Rieck, S. Reichmann, P. Danowski, A. Graschopf, T. König, P. Kraker, P. Lehner, F. Reckling, T. Ross-Hellauer, D. Spichtinger, M. Tzatzanis, S. Schürz, Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria, OANA, 2020.","ieee":"K. Mayer et al., Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria. OANA, 2020."},"date_updated":"2020-10-23T09:34:40Z","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"working_paper","_id":"8695","date_created":"2020-10-23T09:08:28Z","doi":"10.5281/ZENODO.4109242","date_published":"2020-10-21T00:00:00Z","page":"36","language":[{"iso":"ger"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"8696","checksum":"8eba912bb4b20b4f82f8010f2110461a","success":1,"creator":"dernst","date_updated":"2020-10-23T09:29:45Z","file_size":2298363,"date_created":"2020-10-23T09:29:45Z","file_name":"2020_OANA_Mayer.pdf"}],"day":"21","publication_status":"published","year":"2020","has_accepted_license":"1","month":"10","oa":1,"publisher":"OANA","oa_version":"Published Version","abstract":[{"text":"A look at international activities on Open Science reveals a broad spectrum from individual institutional policies to national action plans. The present Recommendations for a National Open Science Strategy in Austria are based on these international initiatives and present practical considerations for their coordinated implementation with regard to strategic developments in research, technology and innovation (RTI) in Austria until 2030. They are addressed to all relevant actors in the RTI system, in particular to Research Performing Organisations, Research Funding Organisations, Research Policy, memory institutions such as Libraries and Researchers. The recommendation paper was developed from 2018 to 2020 by the OANA working group \"Open Science Strategy\" and published for the first time in spring 2020 for a public consultation. The now available final version of the recommendation document, which contains feedback and comments from the consultation, is intended to provide an impetus for further discussion and implementation of Open Science in Austria and serves as a contribution and basis for a potential national Open Science Strategy in Austria. The document builds on the diverse expertise of the authors (academia, administration, library and archive, information technology, science policy, funding system, etc.) and reflects their personal experiences and opinions.","lang":"eng"},{"text":"Der Blick auf internationale Aktivitäten zu Open Science zeigt ein breites Spektrum von einzelnen institutionellen Policies bis hin zu nationalen Aktionsplänen. Die vorliegenden Empfehlungen für eine nationale Open Science Strategie in Österreich orientieren sich an diesen internationalen Initiativen und stellen praktische Überlegungen für ihre koordinierte Implementierung im Hinblick auf strategische Entwicklungen in Forschung, Technologie und Innovation (FTI) bis 2030 in Österreich dar. Dabei richten sie sich an alle relevanten Akteur*innen im FTI System, im Besonderen an Forschungsstätten, Forschungsförderer, Forschungspolitik, Gedächtnisinstitutionen wie Bibliotheken und Wissenschafter*innen. Das Empfehlungspapier wurde von 2018 bis 2020 von der OANA-Arbeitsgruppe \"Open Science Strategie\" entwickelt und im Frühling 2020 das erste Mal für eine öffentliche Konsultation veröffentlicht. Die nun vorliegende finale Version des Empfehlungsdokuments, die Feedback und Kommentare aus der Konsultation enthält, soll ein Anstoß für die weitere Diskussion und Umsetzung von Open Science in Österreich sein und als Beitrag und Grundlage einer potentiellen nationalen Open Science Strategie in Österreich dienen. Das Dokument baut auf der vielfältigen Expertise der Autor*innen auf (Wissenschaft, Administration, Bibliothek und Archiv, Informationstechnologie, Wissenschaftspolitik, Förderwesen etc.) und spiegelt deren persönliche Erfahrungen und Meinung wider.","lang":"ger"}]},{"extern":"1","date_updated":"2021-01-12T08:20:34Z","status":"public","type":"journal_article","article_type":"original","_id":"8694","issue":"7","volume":30,"language":[{"iso":"eng"}],"publication_status":"published","month":"07","intvolume":" 30","main_file_link":[{"url":"https://arxiv.org/abs/2004.13444","open_access":"1"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We develop algorithms and techniques to compute rigorous bounds for finite pieces of orbits of the critical points, for intervals of parameter values, in the quadratic family of one-dimensional maps fa(x)=a−x2. We illustrate the effectiveness of our approach by constructing a dynamically defined partition 𝒫 of the parameter interval Ω=[1.4,2] into almost 4×106 subintervals, for each of which we compute to high precision the orbits of the critical points up to some time N and other dynamically relevant quantities, several of which can vary greatly, possibly spanning several orders of magnitude. We also subdivide 𝒫 into a family 𝒫+ of intervals, which we call stochastic intervals, and a family 𝒫− of intervals, which we call regular intervals. We numerically prove that each interval ω∈𝒫+ has an escape time, which roughly means that some iterate of the critical point taken over all the parameters in ω has considerable width in the phase space. This suggests, in turn, that most parameters belonging to the intervals in 𝒫+ are stochastic and most parameters belonging to the intervals in 𝒫− are regular, thus the names. We prove that the intervals in 𝒫+ occupy almost 90% of the total measure of Ω. The software and the data are freely available at http://www.pawelpilarczyk.com/quadr/, and a web page is provided for carrying out the calculations. The ideas and procedures can be easily generalized to apply to other parameterized families of dynamical systems."}],"title":"Rigorous numerics for critical orbits in the quadratic family","author":[{"first_name":"Ali","full_name":"Golmakani, Ali","last_name":"Golmakani"},{"orcid":"0000-0003-2640-4049","full_name":"Koudjinan, Edmond","last_name":"Koudjinan","first_name":"Edmond","id":"52DF3E68-AEFA-11EA-95A4-124A3DDC885E"},{"last_name":"Luzzatto","full_name":"Luzzatto, Stefano","first_name":"Stefano"},{"first_name":"Pawel","full_name":"Pilarczyk, Pawel","last_name":"Pilarczyk"}],"external_id":{"arxiv":["2004.13444"]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Golmakani A, Koudjinan E, Luzzatto S, Pilarczyk P. 2020. Rigorous numerics for critical orbits in the quadratic family. Chaos. 30(7), 073143.","chicago":"Golmakani, Ali, Edmond Koudjinan, Stefano Luzzatto, and Pawel Pilarczyk. “Rigorous Numerics for Critical Orbits in the Quadratic Family.” Chaos. AIP, 2020. https://doi.org/10.1063/5.0012822.","short":"A. Golmakani, E. Koudjinan, S. Luzzatto, P. Pilarczyk, Chaos 30 (2020).","ieee":"A. Golmakani, E. Koudjinan, S. Luzzatto, and P. Pilarczyk, “Rigorous numerics for critical orbits in the quadratic family,” Chaos, vol. 30, no. 7. AIP, 2020.","apa":"Golmakani, A., Koudjinan, E., Luzzatto, S., & Pilarczyk, P. (2020). Rigorous numerics for critical orbits in the quadratic family. Chaos. AIP. https://doi.org/10.1063/5.0012822","ama":"Golmakani A, Koudjinan E, Luzzatto S, Pilarczyk P. Rigorous numerics for critical orbits in the quadratic family. Chaos. 2020;30(7). doi:10.1063/5.0012822","mla":"Golmakani, Ali, et al. “Rigorous Numerics for Critical Orbits in the Quadratic Family.” Chaos, vol. 30, no. 7, 073143, AIP, 2020, doi:10.1063/5.0012822."},"article_number":"073143","date_published":"2020-07-31T00:00:00Z","doi":"10.1063/5.0012822","date_created":"2020-10-21T15:43:05Z","day":"31","publication":"Chaos","year":"2020","publisher":"AIP","quality_controlled":"1","oa":1},{"date_published":"2020-09-05T00:00:00Z","doi":"10.1016/j.jde.2020.03.044","date_created":"2020-10-21T15:03:05Z","page":"4720-4750","day":"05","publication":"Journal of Differential Equations","year":"2020","quality_controlled":"1","publisher":"Elsevier","oa":1,"title":"A KAM theorem for finitely differentiable Hamiltonian systems","author":[{"first_name":"Edmond","id":"52DF3E68-AEFA-11EA-95A4-124A3DDC885E","full_name":"Koudjinan, Edmond","orcid":"0000-0003-2640-4049","last_name":"Koudjinan"}],"article_processing_charge":"No","external_id":{"arxiv":["1909.04099"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Koudjinan E. 2020. A KAM theorem for finitely differentiable Hamiltonian systems. Journal of Differential Equations. 269(6), 4720–4750.","chicago":"Koudjinan, Edmond. “A KAM Theorem for Finitely Differentiable Hamiltonian Systems.” Journal of Differential Equations. Elsevier, 2020. https://doi.org/10.1016/j.jde.2020.03.044.","ieee":"E. Koudjinan, “A KAM theorem for finitely differentiable Hamiltonian systems,” Journal of Differential Equations, vol. 269, no. 6. Elsevier, pp. 4720–4750, 2020.","short":"E. Koudjinan, Journal of Differential Equations 269 (2020) 4720–4750.","apa":"Koudjinan, E. (2020). A KAM theorem for finitely differentiable Hamiltonian systems. Journal of Differential Equations. Elsevier. https://doi.org/10.1016/j.jde.2020.03.044","ama":"Koudjinan E. A KAM theorem for finitely differentiable Hamiltonian systems. Journal of Differential Equations. 2020;269(6):4720-4750. doi:10.1016/j.jde.2020.03.044","mla":"Koudjinan, Edmond. “A KAM Theorem for Finitely Differentiable Hamiltonian Systems.” Journal of Differential Equations, vol. 269, no. 6, Elsevier, 2020, pp. 4720–50, doi:10.1016/j.jde.2020.03.044."},"volume":269,"issue":"6","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0022-0396"]},"publication_status":"published","month":"09","intvolume":" 269","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1909.04099"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"Given l>2ν>2d≥4, we prove the persistence of a Cantor--family of KAM tori of measure O(ε1/2−ν/l) for any non--degenerate nearly integrable Hamiltonian system of class Cl(D×Td), where D⊂Rd is a bounded domain, provided that the size ε of the perturbation is sufficiently small. This extends a result by D. Salamon in \\cite{salamon2004kolmogorov} according to which we do have the persistence of a single KAM torus in the same framework. Moreover, it is well--known that, for the persistence of a single torus, the regularity assumption can not be improved."}],"extern":"1","date_updated":"2021-01-12T08:20:33Z","status":"public","keyword":["Analysis"],"type":"journal_article","article_type":"original","_id":"8691"},{"publication_status":"published","publication_identifier":{"eissn":["10222588"]},"language":[{"iso":"ger"}],"file":[{"date_updated":"2020-10-27T16:27:25Z","file_size":960317,"creator":"kschuh","date_created":"2020-10-27T16:27:25Z","file_name":"2020_VOEB_Danowski.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"8714","checksum":"37443c34d91d5bdbeb38c78b14792537","success":1}],"volume":73,"issue":"2","abstract":[{"lang":"eng","text":"As part of the Austrian Transition to Open Access (AT2OA) project, subproject TP1-B is working on designing a monitoring solution for the output of Open Access publications in Austria. This report on a potential Open Access monitoring approach in Austria is one of the results of these efforts and can serve as a basis for discussion on an international level."},{"text":"Als Teil des Hochschulraumstrukturmittel-Projekts Austrian Transition to Open Access (AT2OA) befasst sich das Teilprojekt TP1-B mit der Konzeption einer Monitoring-Lösung für den Open Access-Publikationsoutput in Österreich. Der nun vorliegende Bericht zu einem potentiellen Open Access-Monitoring in Österreich ist eines der Ergebnisse dieser Bemühungen und kann als Grundlage einer Diskussion auf internationaler Ebene dienen.","lang":"ger"}],"oa_version":"Published Version","scopus_import":"1","intvolume":" 73","month":"07","date_updated":"2021-01-12T08:20:40Z","ddc":["020"],"department":[{"_id":"E-Lib"}],"file_date_updated":"2020-10-27T16:27:25Z","_id":"8706","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","status":"public","year":"2020","has_accepted_license":"1","publication":"Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","day":"14","page":"278-284","date_created":"2020-10-25T23:01:19Z","doi":"10.31263/voebm.v73i2.3941","date_published":"2020-07-14T00:00:00Z","oa":1,"quality_controlled":"1","publisher":"Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare","citation":{"short":"P. Danowski, A. Ferus, A.-L. Hikl, G. McNeill, C. Miniberger, S. Reding, T. Zarka, M. Zojer, Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare 73 (2020) 278–284.","ieee":"P. Danowski et al., “„Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B,” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, vol. 73, no. 2. Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare, pp. 278–284, 2020.","apa":"Danowski, P., Ferus, A., Hikl, A.-L., McNeill, G., Miniberger, C., Reding, S., … Zojer, M. (2020). „Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare. https://doi.org/10.31263/voebm.v73i2.3941","ama":"Danowski P, Ferus A, Hikl A-L, et al. „Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 2020;73(2):278-284. doi:10.31263/voebm.v73i2.3941","mla":"Danowski, Patrick, et al. “„Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B.” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, vol. 73, no. 2, Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare, 2020, pp. 278–84, doi:10.31263/voebm.v73i2.3941.","ista":"Danowski P, Ferus A, Hikl A-L, McNeill G, Miniberger C, Reding S, Zarka T, Zojer M. 2020. „Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B. Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 73(2), 278–284.","chicago":"Danowski, Patrick, Andreas Ferus, Anna-Laetitia Hikl, Gerda McNeill, Clemens Miniberger, Steve Reding, Tobias Zarka, and Michael Zojer. “„Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B.” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare, 2020. https://doi.org/10.31263/voebm.v73i2.3941."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"first_name":"Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","full_name":"Danowski, Patrick","orcid":"0000-0002-6026-4409","last_name":"Danowski"},{"first_name":"Andreas","full_name":"Ferus, Andreas","last_name":"Ferus"},{"full_name":"Hikl, Anna-Laetitia","last_name":"Hikl","first_name":"Anna-Laetitia"},{"first_name":"Gerda","last_name":"McNeill","full_name":"McNeill, Gerda"},{"full_name":"Miniberger, Clemens","last_name":"Miniberger","first_name":"Clemens"},{"full_name":"Reding, Steve","last_name":"Reding","first_name":"Steve"},{"last_name":"Zarka","full_name":"Zarka, Tobias","first_name":"Tobias"},{"first_name":"Michael","last_name":"Zojer","full_name":"Zojer, Michael"}],"title":"„Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B"},{"pmid":1,"oa_version":"Published Version","acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"}],"abstract":[{"lang":"eng","text":"Mosaic analysis with double markers (MADM) technology enables concomitant fluorescent cell labeling and induction of uniparental chromosome disomy (UPD) with single-cell resolution. In UPD, imprinted genes are either overexpressed 2-fold or are not expressed. Here, the MADM platform is utilized to probe imprinting phenotypes at the transcriptional level. This protocol highlights major steps for the generation and isolation of projection neurons and astrocytes with MADM-induced UPD from mouse cerebral cortex for downstream single-cell and low-input sample RNA-sequencing experiments.\r\n\r\nFor complete details on the use and execution of this protocol, please refer to Laukoter et al. (2020b)."}],"intvolume":" 1","month":"12","language":[{"iso":"eng"}],"file":[{"success":1,"checksum":"f1e9a433e9cb0f41f7b6df6b76db1f6e","file_id":"8996","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"2020_STARProtocols_Laukoter.pdf","date_created":"2021-01-07T15:57:27Z","file_size":4031449,"date_updated":"2021-01-07T15:57:27Z","creator":"dernst"}],"publication_status":"published","publication_identifier":{"issn":["2666-1667"]},"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","ec_funded":1,"volume":1,"issue":"3","_id":"8978","status":"public","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"article_type":"original","type":"journal_article","ddc":["570"],"date_updated":"2021-01-12T08:21:36Z","department":[{"_id":"SiHi"}],"file_date_updated":"2021-01-07T15:57:27Z","acknowledgement":"This research was supported by the Scientific Service Units (SSU) at IST Austria through resources provided by the Bioimaging (BIF) and Preclinical Facilities (PCF). N.A received support from the FWF Firnberg-Programm (T 1031). This work was also supported by IST Austria institutional funds; FWF SFB F78 to S.H.; NÖ Forschung und Bildung n[f+b] life science call grant (C13-002) to S.H.; the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no. 618444 to S.H.; and the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 725780 LinPro) to S.H.","oa":1,"publisher":"Elsevier","quality_controlled":"1","publication":"STAR Protocols","day":"18","year":"2020","has_accepted_license":"1","date_created":"2020-12-30T10:17:07Z","doi":"10.1016/j.xpro.2020.100215","date_published":"2020-12-18T00:00:00Z","article_number":"100215","project":[{"name":"Role of Eed in neural stem cell lineage progression","grant_number":"T0101031","call_identifier":"FWF","_id":"268F8446-B435-11E9-9278-68D0E5697425"},{"_id":"059F6AB4-7A3F-11EA-A408-12923DDC885E","grant_number":"F07805","name":"Molecular Mechanisms of Neural Stem Cell Lineage Progression"},{"name":"Mapping Cell-Type Specificity of the Genomic Imprintome in the Brain","grant_number":"LS13-002","_id":"25D92700-B435-11E9-9278-68D0E5697425"},{"grant_number":"618444","name":"Molecular Mechanisms of Cerebral Cortex Development","_id":"25D61E48-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development","grant_number":"725780","_id":"260018B0-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Laukoter, Susanne, Nicole Amberg, Florian Pauler, and Simon Hippenmeyer. “Generation and Isolation of Single Cells from Mouse Brain with Mosaic Analysis with Double Markers-Induced Uniparental Chromosome Disomy.” STAR Protocols. Elsevier, 2020. https://doi.org/10.1016/j.xpro.2020.100215.","ista":"Laukoter S, Amberg N, Pauler F, Hippenmeyer S. 2020. Generation and isolation of single cells from mouse brain with mosaic analysis with double markers-induced uniparental chromosome disomy. STAR Protocols. 1(3), 100215.","mla":"Laukoter, Susanne, et al. “Generation and Isolation of Single Cells from Mouse Brain with Mosaic Analysis with Double Markers-Induced Uniparental Chromosome Disomy.” STAR Protocols, vol. 1, no. 3, 100215, Elsevier, 2020, doi:10.1016/j.xpro.2020.100215.","ama":"Laukoter S, Amberg N, Pauler F, Hippenmeyer S. Generation and isolation of single cells from mouse brain with mosaic analysis with double markers-induced uniparental chromosome disomy. STAR Protocols. 2020;1(3). doi:10.1016/j.xpro.2020.100215","apa":"Laukoter, S., Amberg, N., Pauler, F., & Hippenmeyer, S. (2020). Generation and isolation of single cells from mouse brain with mosaic analysis with double markers-induced uniparental chromosome disomy. STAR Protocols. Elsevier. https://doi.org/10.1016/j.xpro.2020.100215","ieee":"S. Laukoter, N. Amberg, F. Pauler, and S. Hippenmeyer, “Generation and isolation of single cells from mouse brain with mosaic analysis with double markers-induced uniparental chromosome disomy,” STAR Protocols, vol. 1, no. 3. Elsevier, 2020.","short":"S. Laukoter, N. Amberg, F. Pauler, S. Hippenmeyer, STAR Protocols 1 (2020)."},"title":"Generation and isolation of single cells from mouse brain with mosaic analysis with double markers-induced uniparental chromosome disomy","external_id":{"pmid":["33377108"]},"article_processing_charge":"No","author":[{"last_name":"Laukoter","full_name":"Laukoter, Susanne","first_name":"Susanne","id":"2D6B7A9A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Amberg, Nicole","orcid":"0000-0002-3183-8207","last_name":"Amberg","id":"4CD6AAC6-F248-11E8-B48F-1D18A9856A87","first_name":"Nicole"},{"full_name":"Pauler, Florian","last_name":"Pauler","first_name":"Florian","id":"48EA0138-F248-11E8-B48F-1D18A9856A87"},{"id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","last_name":"Hippenmeyer","orcid":"0000-0003-2279-1061","full_name":"Hippenmeyer, Simon"}]},{"_id":"9067","keyword":["General Chemistry","General Chemical Engineering"],"status":"public","type":"journal_article","article_type":"original","extern":"1","date_updated":"2021-02-04T07:16:37Z","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Gadolinium silicide (Gd5Si4) nanoparticles are an interesting class of materials due to their high magnetization, low Curie temperature, low toxicity in biological environments and their multifunctional properties. We report the magnetic and magnetothermal properties of gadolinium silicide (Gd5Si4) nanoparticles prepared by surfactant-assisted ball milling of arc melted bulk ingots of the compound. Using different milling times and speeds, a wide range of crystallite sizes (13–43 nm) could be produced and a reduction in Curie temperature (TC) from 340 K to 317 K was achieved, making these nanoparticles suitable for self-controlled magnetic hyperthermia applications. The magnetothermal effect was measured in applied AC magnetic fields of amplitude 164–239 Oe and frequencies 163–519 kHz. All particles showed magnetic heating with a strong dependence of the specific absorption rate (SAR) on the average crystallite size. The highest SAR of 3.7 W g−1 was measured for 43 nm sized nanoparticles of Gd5Si4. The high SAR and low TC, (within the therapeutic range for magnetothermal therapy) makes the Gd5Si4 behave like self-regulating heat switches that would be suitable for self-controlled magnetic hyperthermia applications after biocompatibility and cytotoxicity tests."}],"intvolume":" 10","month":"07","main_file_link":[{"url":"https://doi.org/10.1039/d0ra05394e","open_access":"1"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["2046-2069"]},"volume":10,"issue":"47","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Nauman M, Alnasir MH, Hamayun MA, Wang Y, Shatruk M, Manzoor S. Size-dependent magnetic and magnetothermal properties of gadolinium silicide nanoparticles. RSC Advances. 2020;10(47):28383-28389. doi:10.1039/d0ra05394e","apa":"Nauman, M., Alnasir, M. H., Hamayun, M. A., Wang, Y., Shatruk, M., & Manzoor, S. (2020). Size-dependent magnetic and magnetothermal properties of gadolinium silicide nanoparticles. RSC Advances. Royal Society of Chemistry. https://doi.org/10.1039/d0ra05394e","short":"M. Nauman, M.H. Alnasir, M.A. Hamayun, Y. Wang, M. Shatruk, S. Manzoor, RSC Advances 10 (2020) 28383–28389.","ieee":"M. Nauman, M. H. Alnasir, M. A. Hamayun, Y. Wang, M. Shatruk, and S. Manzoor, “Size-dependent magnetic and magnetothermal properties of gadolinium silicide nanoparticles,” RSC Advances, vol. 10, no. 47. Royal Society of Chemistry, pp. 28383–28389, 2020.","mla":"Nauman, Muhammad, et al. “Size-Dependent Magnetic and Magnetothermal Properties of Gadolinium Silicide Nanoparticles.” RSC Advances, vol. 10, no. 47, Royal Society of Chemistry, 2020, pp. 28383–89, doi:10.1039/d0ra05394e.","ista":"Nauman M, Alnasir MH, Hamayun MA, Wang Y, Shatruk M, Manzoor S. 2020. Size-dependent magnetic and magnetothermal properties of gadolinium silicide nanoparticles. RSC Advances. 10(47), 28383–28389.","chicago":"Nauman, Muhammad, Muhammad Hisham Alnasir, Muhammad Asif Hamayun, YiXu Wang, Michael Shatruk, and Sadia Manzoor. “Size-Dependent Magnetic and Magnetothermal Properties of Gadolinium Silicide Nanoparticles.” RSC Advances. Royal Society of Chemistry, 2020. https://doi.org/10.1039/d0ra05394e."},"title":"Size-dependent magnetic and magnetothermal properties of gadolinium silicide nanoparticles","article_processing_charge":"No","author":[{"orcid":"0000-0002-2111-4846","full_name":"Nauman, Muhammad","last_name":"Nauman","first_name":"Muhammad","id":"32c21954-2022-11eb-9d5f-af9f93c24e71"},{"last_name":"Alnasir","full_name":"Alnasir, Muhammad Hisham","first_name":"Muhammad Hisham"},{"last_name":"Hamayun","full_name":"Hamayun, Muhammad Asif","first_name":"Muhammad Asif"},{"first_name":"YiXu","last_name":"Wang","full_name":"Wang, YiXu"},{"first_name":"Michael","last_name":"Shatruk","full_name":"Shatruk, Michael"},{"full_name":"Manzoor, Sadia","last_name":"Manzoor","first_name":"Sadia"}],"oa":1,"publisher":"Royal Society of Chemistry","quality_controlled":"1","publication":"RSC Advances","day":"29","year":"2020","date_created":"2021-02-02T15:51:23Z","doi":"10.1039/d0ra05394e","date_published":"2020-07-29T00:00:00Z","page":"28383-28389"},{"publication_identifier":{"issn":["07431546"],"isbn":["9781728174471"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":2020,"abstract":[{"text":"We introduce LRT-NG, a set of techniques and an associated toolset that computes a reachtube (an over-approximation of the set of reachable states over a given time horizon) of a nonlinear dynamical system. LRT-NG significantly advances the state-of-the-art Langrangian Reachability and its associated tool LRT. From a theoretical perspective, LRT-NG is superior to LRT in three ways. First, it uses for the first time an analytically computed metric for the propagated ball which is proven to minimize the ball’s volume. We emphasize that the metric computation is the centerpiece of all bloating-based techniques. Secondly, it computes the next reachset as the intersection of two balls: one based on the Cartesian metric and the other on the new metric. While the two metrics were previously considered opposing approaches, their joint use considerably tightens the reachtubes. Thirdly, it avoids the \"wrapping effect\" associated with the validated integration of the center of the reachset, by optimally absorbing the interval approximation in the radius of the next ball. From a tool-development perspective, LRT-NG is superior to LRT in two ways. First, it is a standalone tool that no longer relies on CAPD. This required the implementation of the Lohner method and a Runge-Kutta time-propagation method. Secondly, it has an improved interface, allowing the input model and initial conditions to be provided as external input files. Our experiments on a comprehensive set of benchmarks, including two Neural ODEs, demonstrates LRT-NG’s superior performance compared to LRT, CAPD, and Flow*.","lang":"eng"}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/2012.07458","open_access":"1"}],"month":"12","intvolume":" 2020","date_updated":"2021-02-09T09:20:58Z","department":[{"_id":"ToHe"}],"_id":"9103","type":"conference","conference":{"name":"CDC: Conference on Decision and Control","start_date":"2020-12-14","end_date":"2020-12-18","location":"Jeju Islang, Korea (South)"},"status":"public","year":"2020","day":"14","publication":"Proceedings of the 59th IEEE Conference on Decision and Control","page":"1556-1563","doi":"10.1109/CDC42340.2020.9304042","date_published":"2020-12-14T00:00:00Z","date_created":"2021-02-07T23:01:14Z","acknowledgement":"The authors would like to thank Ramin Hasani and Guillaume Berger for intellectual discussions about the research which lead to the generation of new ideas. ML was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Smolka’s research was supported by NSF grants CPS-1446832 and CCF-1918225. Gruenbacher is funded by FWF project W1255-N23. JC was partially supported by NAWA Polish Returns grant\r\nPPN/PPO/2018/1/00029.\r\n","quality_controlled":"1","publisher":"IEEE","oa":1,"citation":{"ieee":"S. Gruenbacher, J. Cyranka, M. Lechner, M. A. Islam, S. A. Smolka, and R. Grosu, “Lagrangian reachtubes: The next generation,” in Proceedings of the 59th IEEE Conference on Decision and Control, Jeju Islang, Korea (South), 2020, vol. 2020, pp. 1556–1563.","short":"S. Gruenbacher, J. Cyranka, M. Lechner, M.A. Islam, S.A. Smolka, R. Grosu, in:, Proceedings of the 59th IEEE Conference on Decision and Control, IEEE, 2020, pp. 1556–1563.","ama":"Gruenbacher S, Cyranka J, Lechner M, Islam MA, Smolka SA, Grosu R. Lagrangian reachtubes: The next generation. In: Proceedings of the 59th IEEE Conference on Decision and Control. Vol 2020. IEEE; 2020:1556-1563. doi:10.1109/CDC42340.2020.9304042","apa":"Gruenbacher, S., Cyranka, J., Lechner, M., Islam, M. A., Smolka, S. A., & Grosu, R. (2020). Lagrangian reachtubes: The next generation. In Proceedings of the 59th IEEE Conference on Decision and Control (Vol. 2020, pp. 1556–1563). Jeju Islang, Korea (South): IEEE. https://doi.org/10.1109/CDC42340.2020.9304042","mla":"Gruenbacher, Sophie, et al. “Lagrangian Reachtubes: The next Generation.” Proceedings of the 59th IEEE Conference on Decision and Control, vol. 2020, IEEE, 2020, pp. 1556–63, doi:10.1109/CDC42340.2020.9304042.","ista":"Gruenbacher S, Cyranka J, Lechner M, Islam MA, Smolka SA, Grosu R. 2020. Lagrangian reachtubes: The next generation. Proceedings of the 59th IEEE Conference on Decision and Control. CDC: Conference on Decision and Control vol. 2020, 1556–1563.","chicago":"Gruenbacher, Sophie, Jacek Cyranka, Mathias Lechner, Md Ariful Islam, Scott A. Smolka, and Radu Grosu. “Lagrangian Reachtubes: The next Generation.” In Proceedings of the 59th IEEE Conference on Decision and Control, 2020:1556–63. IEEE, 2020. https://doi.org/10.1109/CDC42340.2020.9304042."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Sophie","full_name":"Gruenbacher, Sophie","last_name":"Gruenbacher"},{"first_name":"Jacek","last_name":"Cyranka","full_name":"Cyranka, Jacek"},{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner"},{"last_name":"Islam","full_name":"Islam, Md Ariful","first_name":"Md Ariful"},{"full_name":"Smolka, Scott A.","last_name":"Smolka","first_name":"Scott A."},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"}],"external_id":{"arxiv":["2012.07458"]},"article_processing_charge":"No","title":"Lagrangian reachtubes: The next generation","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"}]},{"publisher":"ESSOAr","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1002/essoar.10504670.1"}],"month":"11","abstract":[{"text":"The goal of this study is twofold. First, we aim at developing a simple model as an interpretative framework for the water vapor isotopic variations in the tropical troposphere over the ocean. We use large-eddy simulations to justify the underlying assumptions of this simple model, to constrain its input parameters and to evaluate its results. Second, we aim at interpreting the depletion of the water vapor isotopic composition in the lower and mid-troposphere as precipitation increases, which is a salient feature in tropical oceanic observations. This feature constitutes a stringent test on the relevance of our interpretative framework. Previous studies, based on observations or on models with parameterized convection, have highlighted the roles of deep convective and meso-scale downdrafts, rain evaporation, rain-vapor diffusive exchanges and mixing processes. The interpretative framework that we develop is a two-column model representing the net ascent in clouds and the net descent in the environment. We show that the mechanisms for depleting the troposphere when precipitation rate increases all stem from the higher tropospheric relative humidity. First, when the relative humidity is larger, less snow sublimates before melting and a smaller fraction of rain evaporates. Both effects lead to more depleted rain evaporation and eventually more depleted water vapor. This mechanism dominates in regimes of large-scale ascent. Second, the entrainment of dry air into clouds reduces the vertical isotopic gradient and limits the depletion of tropospheric water vapor. This mechanism dominates in regimes of large-scale descent.","lang":"eng"}],"oa_version":"Preprint","doi":"10.1002/essoar.10504670.1","date_published":"2020-11-24T00:00:00Z","date_created":"2021-02-15T15:08:06Z","publication_status":"submitted","year":"2020","day":"24","language":[{"iso":"eng"}],"type":"preprint","status":"public","_id":"9150","author":[{"first_name":"Camille","last_name":"Risi","full_name":"Risi, Camille"},{"full_name":"Muller, Caroline J","orcid":"0000-0001-5836-5350","last_name":"Muller","first_name":"Caroline J","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b"},{"last_name":"Blossey","full_name":"Blossey, Peter N.","first_name":"Peter N."}],"article_processing_charge":"No","title":"Rain evaporation, snow melt and entrainment at the heart of water vapor isotopic variations in the tropical troposphere, according to large-eddy simulations and a two-column model","date_updated":"2022-01-24T12:32:10Z","citation":{"chicago":"Risi, Camille, Caroline J Muller, and Peter N. Blossey. “Rain Evaporation, Snow Melt and Entrainment at the Heart of Water Vapor Isotopic Variations in the Tropical Troposphere, According to Large-Eddy Simulations and a Two-Column Model.” ESSOAr, n.d. https://doi.org/10.1002/essoar.10504670.1.","ista":"Risi C, Muller CJ, Blossey PN. Rain evaporation, snow melt and entrainment at the heart of water vapor isotopic variations in the tropical troposphere, according to large-eddy simulations and a two-column model. 10.1002/essoar.10504670.1.","mla":"Risi, Camille, et al. Rain Evaporation, Snow Melt and Entrainment at the Heart of Water Vapor Isotopic Variations in the Tropical Troposphere, According to Large-Eddy Simulations and a Two-Column Model. ESSOAr, doi:10.1002/essoar.10504670.1.","ieee":"C. Risi, C. J. Muller, and P. N. Blossey, “Rain evaporation, snow melt and entrainment at the heart of water vapor isotopic variations in the tropical troposphere, according to large-eddy simulations and a two-column model.” ESSOAr.","short":"C. Risi, C.J. Muller, P.N. Blossey, (n.d.).","apa":"Risi, C., Muller, C. J., & Blossey, P. N. (n.d.). Rain evaporation, snow melt and entrainment at the heart of water vapor isotopic variations in the tropical troposphere, according to large-eddy simulations and a two-column model. ESSOAr. https://doi.org/10.1002/essoar.10504670.1","ama":"Risi C, Muller CJ, Blossey PN. Rain evaporation, snow melt and entrainment at the heart of water vapor isotopic variations in the tropical troposphere, according to large-eddy simulations and a two-column model. doi:10.1002/essoar.10504670.1"},"extern":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9"},{"oa":1,"quality_controlled":"1","publisher":"Curran Associates","acknowledgement":"The authors would like to thank Jan Maas, Mahdi Soltanolkotabi, and Daniel Soudry for the helpful discussions, Marius Kloft, Matthias Hein and Quoc Dinh Tran for proofreading portions of a prior version of this paper, and James Martens for a clarification concerning LeCun’s initialization. M. Mondelli was partially supported by the 2019 Lopez-Loreta Prize. Q. Nguyen was partially supported by the German Research Foundation (DFG) award KL 2698/2-1.","date_created":"2021-03-03T12:06:02Z","date_published":"2020-07-07T00:00:00Z","page":"11961–11972","publication":"34th Conference on Neural Information Processing Systems","day":"07","year":"2020","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"title":"Global convergence of deep networks with one wide layer followed by pyramidal topology","external_id":{"arxiv":["2002.07867"]},"article_processing_charge":"No","author":[{"first_name":"Quynh","full_name":"Nguyen, Quynh","last_name":"Nguyen"},{"first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco","last_name":"Mondelli"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"ista":"Nguyen Q, Mondelli M. 2020. Global convergence of deep networks with one wide layer followed by pyramidal topology. 34th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 33, 11961–11972.","chicago":"Nguyen, Quynh, and Marco Mondelli. “Global Convergence of Deep Networks with One Wide Layer Followed by Pyramidal Topology.” In 34th Conference on Neural Information Processing Systems, 33:11961–11972. Curran Associates, 2020.","ieee":"Q. Nguyen and M. Mondelli, “Global convergence of deep networks with one wide layer followed by pyramidal topology,” in 34th Conference on Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 11961–11972.","short":"Q. Nguyen, M. Mondelli, in:, 34th Conference on Neural Information Processing Systems, Curran Associates, 2020, pp. 11961–11972.","ama":"Nguyen Q, Mondelli M. Global convergence of deep networks with one wide layer followed by pyramidal topology. In: 34th Conference on Neural Information Processing Systems. Vol 33. Curran Associates; 2020:11961–11972.","apa":"Nguyen, Q., & Mondelli, M. (2020). Global convergence of deep networks with one wide layer followed by pyramidal topology. In 34th Conference on Neural Information Processing Systems (Vol. 33, pp. 11961–11972). Vancouver, Canada: Curran Associates.","mla":"Nguyen, Quynh, and Marco Mondelli. “Global Convergence of Deep Networks with One Wide Layer Followed by Pyramidal Topology.” 34th Conference on Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 11961–11972."},"intvolume":" 33","month":"07","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2002.07867"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"Recent works have shown that gradient descent can find a global minimum for over-parameterized neural networks where the widths of all the hidden layers scale polynomially with N (N being the number of training samples). In this paper, we prove that, for deep networks, a single layer of width N following the input layer suffices to ensure a similar guarantee. In particular, all the remaining layers are allowed to have constant widths, and form a pyramidal topology. We show an application of our result to the widely used LeCun’s initialization and obtain an over-parameterization requirement for the single wide layer of order N2.\r\n"}],"volume":33,"language":[{"iso":"eng"}],"publication_status":"published","status":"public","conference":{"start_date":"2020-12-06","end_date":"2020-12-12","location":"Vancouver, Canada","name":"NeurIPS: Neural Information Processing Systems"},"type":"conference","_id":"9221","department":[{"_id":"MaMo"}],"date_updated":"2022-01-04T09:24:41Z"},{"_id":"9415","type":"conference","conference":{"start_date":"2020-07-12","location":"Online","end_date":"2020-07-18","name":"ICML: International Conference on Machine Learning"},"status":"public","date_updated":"2023-02-23T13:57:24Z","ddc":["000"],"department":[{"_id":"DaAl"}],"file_date_updated":"2021-05-25T09:51:36Z","abstract":[{"lang":"eng","text":"Optimizing convolutional neural networks for fast inference has recently become an extremely active area of research. One of the go-to solutions in this context is weight pruning, which aims to reduce computational and memory footprint by removing large subsets of the connections in a neural network. Surprisingly, much less attention has been given to exploiting sparsity in the activation maps, which tend to be naturally sparse in many settings thanks to the structure of rectified linear (ReLU) activation functions. In this paper, we present an in-depth analysis of methods for maximizing the sparsity of the activations in a trained neural network, and show that, when coupled with an efficient sparse-input convolution algorithm, we can leverage this sparsity for significant performance gains. To induce highly sparse activation maps without accuracy loss, we introduce a new regularization technique, coupled with a new threshold-based sparsification method based on a parameterized activation function called Forced-Activation-Threshold Rectified Linear Unit (FATReLU). We examine the impact of our methods on popular image classification models, showing that most architectures can adapt to significantly sparser activation maps without any accuracy loss. Our second contribution is showing that these these compression gains can be translated into inference speedups: we provide a new algorithm to enable fast convolution operations over networks with sparse activations, and show that it can enable significant speedups for end-to-end inference on a range of popular models on the large-scale ImageNet image classification task on modern Intel CPUs, with little or no retraining cost. "}],"oa_version":"Published Version","scopus_import":"1","month":"07","intvolume":" 119","publication_identifier":{"issn":["2640-3498"]},"file":[{"date_updated":"2021-05-25T09:51:36Z","file_size":741899,"creator":"kschuh","date_created":"2021-05-25T09:51:36Z","file_name":"2020_PMLR_Kurtz.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"9421","checksum":"2aaaa7d7226e49161311d91627cf783b","success":1}],"language":[{"iso":"eng"}],"volume":119,"citation":{"ista":"Kurtz M, Kopinsky J, Gelashvili R, Matveev A, Carr J, Goin M, Leiserson W, Moore S, Nell B, Shavit N, Alistarh D-A. 2020. Inducing and exploiting activation sparsity for fast neural network inference. 37th International Conference on Machine Learning, ICML 2020. ICML: International Conference on Machine Learning vol. 119, 5533–5543.","chicago":"Kurtz, Mark, Justin Kopinsky, Rati Gelashvili, Alexander Matveev, John Carr, Michael Goin, William Leiserson, et al. “Inducing and Exploiting Activation Sparsity for Fast Neural Network Inference.” In 37th International Conference on Machine Learning, ICML 2020, 119:5533–43, 2020.","apa":"Kurtz, M., Kopinsky, J., Gelashvili, R., Matveev, A., Carr, J., Goin, M., … Alistarh, D.-A. (2020). Inducing and exploiting activation sparsity for fast neural network inference. In 37th International Conference on Machine Learning, ICML 2020 (Vol. 119, pp. 5533–5543). Online.","ama":"Kurtz M, Kopinsky J, Gelashvili R, et al. Inducing and exploiting activation sparsity for fast neural network inference. In: 37th International Conference on Machine Learning, ICML 2020. Vol 119. ; 2020:5533-5543.","ieee":"M. Kurtz et al., “Inducing and exploiting activation sparsity for fast neural network inference,” in 37th International Conference on Machine Learning, ICML 2020, Online, 2020, vol. 119, pp. 5533–5543.","short":"M. Kurtz, J. Kopinsky, R. Gelashvili, A. Matveev, J. Carr, M. Goin, W. Leiserson, S. Moore, B. Nell, N. Shavit, D.-A. Alistarh, in:, 37th International Conference on Machine Learning, ICML 2020, 2020, pp. 5533–5543.","mla":"Kurtz, Mark, et al. “Inducing and Exploiting Activation Sparsity for Fast Neural Network Inference.” 37th International Conference on Machine Learning, ICML 2020, vol. 119, 2020, pp. 5533–43."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Kurtz","full_name":"Kurtz, Mark","first_name":"Mark"},{"first_name":"Justin","full_name":"Kopinsky, Justin","last_name":"Kopinsky"},{"full_name":"Gelashvili, Rati","last_name":"Gelashvili","first_name":"Rati"},{"first_name":"Alexander","last_name":"Matveev","full_name":"Matveev, Alexander"},{"first_name":"John","last_name":"Carr","full_name":"Carr, John"},{"full_name":"Goin, Michael","last_name":"Goin","first_name":"Michael"},{"full_name":"Leiserson, William","last_name":"Leiserson","first_name":"William"},{"first_name":"Sage","full_name":"Moore, Sage","last_name":"Moore"},{"full_name":"Nell, Bill","last_name":"Nell","first_name":"Bill"},{"first_name":"Nir","last_name":"Shavit","full_name":"Shavit, Nir"},{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh"}],"article_processing_charge":"No","title":"Inducing and exploiting activation sparsity for fast neural network inference","quality_controlled":"1","oa":1,"has_accepted_license":"1","year":"2020","day":"12","publication":"37th International Conference on Machine Learning, ICML 2020","page":"5533-5543","date_published":"2020-07-12T00:00:00Z","date_created":"2021-05-23T22:01:45Z"},{"day":"16","publication":"Molecular Cell","year":"2020","doi":"10.1016/j.molcel.2019.10.011","date_published":"2020-01-16T00:00:00Z","date_created":"2021-06-08T06:37:09Z","page":"310-323.e7","publisher":"Elsevier","quality_controlled":"1","oa":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"apa":"Choi, J., Lyons, D. B., Kim, M. Y., Moore, J. D., & Zilberman, D. (2020). DNA methylation and histone H1 jointly repress transposable elements and aberrant intragenic transcripts. Molecular Cell. Elsevier. https://doi.org/10.1016/j.molcel.2019.10.011","ama":"Choi J, Lyons DB, Kim MY, Moore JD, Zilberman D. DNA methylation and histone H1 jointly repress transposable elements and aberrant intragenic transcripts. Molecular Cell. 2020;77(2):310-323.e7. doi:10.1016/j.molcel.2019.10.011","ieee":"J. Choi, D. B. Lyons, M. Y. Kim, J. D. Moore, and D. Zilberman, “DNA methylation and histone H1 jointly repress transposable elements and aberrant intragenic transcripts,” Molecular Cell, vol. 77, no. 2. Elsevier, p. 310–323.e7, 2020.","short":"J. Choi, D.B. Lyons, M.Y. Kim, J.D. Moore, D. Zilberman, Molecular Cell 77 (2020) 310–323.e7.","mla":"Choi, Jaemyung, et al. “DNA Methylation and Histone H1 Jointly Repress Transposable Elements and Aberrant Intragenic Transcripts.” Molecular Cell, vol. 77, no. 2, Elsevier, 2020, p. 310–323.e7, doi:10.1016/j.molcel.2019.10.011.","ista":"Choi J, Lyons DB, Kim MY, Moore JD, Zilberman D. 2020. DNA methylation and histone H1 jointly repress transposable elements and aberrant intragenic transcripts. Molecular Cell. 77(2), 310–323.e7.","chicago":"Choi, Jaemyung, David B. Lyons, M. Yvonne Kim, Jonathan D. Moore, and Daniel Zilberman. “DNA Methylation and Histone H1 Jointly Repress Transposable Elements and Aberrant Intragenic Transcripts.” Molecular Cell. Elsevier, 2020. https://doi.org/10.1016/j.molcel.2019.10.011."},"title":"DNA methylation and histone H1 jointly repress transposable elements and aberrant intragenic transcripts","author":[{"last_name":"Choi","full_name":"Choi, Jaemyung","first_name":"Jaemyung"},{"first_name":"David B.","full_name":"Lyons, David B.","last_name":"Lyons"},{"full_name":"Kim, M. Yvonne","last_name":"Kim","first_name":"M. Yvonne"},{"first_name":"Jonathan D.","full_name":"Moore, Jonathan D.","last_name":"Moore"},{"orcid":"0000-0002-0123-8649","full_name":"Zilberman, Daniel","last_name":"Zilberman","first_name":"Daniel","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1"}],"external_id":{"pmid":["31732458"]},"article_processing_charge":"No","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1097-4164"],"issn":["1097-2765"]},"publication_status":"published","issue":"2","volume":77,"oa_version":"Published Version","pmid":1,"abstract":[{"text":"DNA methylation and histone H1 mediate transcriptional silencing of genes and transposable elements, but how they interact is unclear. In plants and animals with mosaic genomic methylation, functionally mysterious methylation is also common within constitutively active housekeeping genes. Here, we show that H1 is enriched in methylated sequences, including genes, of Arabidopsis thaliana, yet this enrichment is independent of DNA methylation. Loss of H1 disperses heterochromatin, globally alters nucleosome organization, and activates H1-bound genes, but only weakly de-represses transposable elements. However, H1 loss strongly activates transposable elements hypomethylated through mutation of DNA methyltransferase MET1. Hypomethylation of genes also activates antisense transcription, which is modestly enhanced by H1 loss. Our results demonstrate that H1 and DNA methylation jointly maintain transcriptional homeostasis by silencing transposable elements and aberrant intragenic transcripts. Such functionality plausibly explains why DNA methylation, a well-known mutagen, has been maintained within coding sequences of crucial plant and animal genes.","lang":"eng"}],"month":"01","intvolume":" 77","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.1016/j.molcel.2019.10.011","open_access":"1"}],"extern":"1","date_updated":"2021-12-14T07:51:15Z","department":[{"_id":"DaZi"}],"_id":"9526","status":"public","type":"journal_article","article_type":"original"},{"date_updated":"2023-02-23T14:01:48Z","extern":"1","ddc":["510"],"file_date_updated":"2021-06-22T09:23:59Z","_id":"9583","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","publication_identifier":{"eissn":["2050-5094"]},"publication_status":"published","file":[{"checksum":"5553c596bb4db0f38226a56bee9c87a1","file_id":"9584","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2021-06-22T09:23:59Z","file_name":"2020_CambridgeUniversityPress_Ferber.pdf","date_updated":"2021-06-22T09:23:59Z","file_size":601516,"creator":"asandaue"}],"language":[{"iso":"eng"}],"volume":8,"abstract":[{"text":"We show that for any n divisible by 3, almost all order-n Steiner triple systems admit a decomposition of almost all their triples into disjoint perfect matchings (that is, almost all Steiner triple systems are almost resolvable).","lang":"eng"}],"oa_version":"Published Version","pmid":1,"scopus_import":"1","month":"11","intvolume":" 8","citation":{"mla":"Ferber, Asaf, and Matthew Alan Kwan. “Almost All Steiner Triple Systems Are Almost Resolvable.” Forum of Mathematics, vol. 8, e39, Cambridge University Press, 2020, doi:10.1017/fms.2020.29.","ama":"Ferber A, Kwan MA. Almost all Steiner triple systems are almost resolvable. Forum of Mathematics. 2020;8. doi:10.1017/fms.2020.29","apa":"Ferber, A., & Kwan, M. A. (2020). Almost all Steiner triple systems are almost resolvable. Forum of Mathematics. Cambridge University Press. https://doi.org/10.1017/fms.2020.29","short":"A. Ferber, M.A. Kwan, Forum of Mathematics 8 (2020).","ieee":"A. Ferber and M. A. Kwan, “Almost all Steiner triple systems are almost resolvable,” Forum of Mathematics, vol. 8. Cambridge University Press, 2020.","chicago":"Ferber, Asaf, and Matthew Alan Kwan. “Almost All Steiner Triple Systems Are Almost Resolvable.” Forum of Mathematics. Cambridge University Press, 2020. https://doi.org/10.1017/fms.2020.29.","ista":"Ferber A, Kwan MA. 2020. Almost all Steiner triple systems are almost resolvable. Forum of Mathematics. 8, e39."},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","author":[{"first_name":"Asaf","full_name":"Ferber, Asaf","last_name":"Ferber"},{"orcid":"0000-0002-4003-7567","full_name":"Kwan, Matthew Alan","last_name":"Kwan","first_name":"Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3"}],"article_processing_charge":"No","external_id":{"pmid":["1907.06744"]},"title":"Almost all Steiner triple systems are almost resolvable","article_number":"e39","has_accepted_license":"1","year":"2020","day":"03","publication":"Forum of Mathematics","doi":"10.1017/fms.2020.29","date_published":"2020-11-03T00:00:00Z","date_created":"2021-06-22T09:12:23Z","quality_controlled":"1","publisher":"Cambridge University Press","oa":1},{"issue":"2","volume":238,"publication_status":"published","publication_identifier":{"eissn":["1565-8511"],"issn":["0021-2172"]},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.01468"}],"scopus_import":"1","intvolume":" 238","month":"07","abstract":[{"text":"How long a monotone path can one always find in any edge-ordering of the complete graph Kn? This appealing question was first asked by Chvátal and Komlós in 1971, and has since attracted the attention of many researchers, inspiring a variety of related problems. The prevailing conjecture is that one can always find a monotone path of linear length, but until now the best known lower bound was n2/3-o(1). In this paper we almost close this gap, proving that any edge-ordering of the complete graph contains a monotone path of length n1-o(1).","lang":"eng"}],"oa_version":"Preprint","date_updated":"2023-02-23T14:01:35Z","extern":"1","type":"journal_article","article_type":"original","status":"public","_id":"9578","page":"663-685","date_created":"2021-06-21T13:24:35Z","date_published":"2020-07-01T00:00:00Z","doi":"10.1007/s11856-020-2035-7","year":"2020","publication":"Israel Journal of Mathematics","day":"01","oa":1,"quality_controlled":"1","publisher":"Springer","external_id":{"arxiv":["1809.01468"]},"article_processing_charge":"No","author":[{"first_name":"Matija","last_name":"Bucić","full_name":"Bucić, Matija"},{"last_name":"Kwan","orcid":"0000-0002-4003-7567","full_name":"Kwan, Matthew Alan","first_name":"Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3"},{"first_name":"Alexey","full_name":"Pokrovskiy, Alexey","last_name":"Pokrovskiy"},{"last_name":"Sudakov","full_name":"Sudakov, Benny","first_name":"Benny"},{"first_name":"Tuan","full_name":"Tran, Tuan","last_name":"Tran"},{"first_name":"Adam Zsolt","last_name":"Wagner","full_name":"Wagner, Adam Zsolt"}],"title":"Nearly-linear monotone paths in edge-ordered graphs","citation":{"ista":"Bucić M, Kwan MA, Pokrovskiy A, Sudakov B, Tran T, Wagner AZ. 2020. Nearly-linear monotone paths in edge-ordered graphs. Israel Journal of Mathematics. 238(2), 663–685.","chicago":"Bucić, Matija, Matthew Alan Kwan, Alexey Pokrovskiy, Benny Sudakov, Tuan Tran, and Adam Zsolt Wagner. “Nearly-Linear Monotone Paths in Edge-Ordered Graphs.” Israel Journal of Mathematics. Springer, 2020. https://doi.org/10.1007/s11856-020-2035-7.","ama":"Bucić M, Kwan MA, Pokrovskiy A, Sudakov B, Tran T, Wagner AZ. Nearly-linear monotone paths in edge-ordered graphs. Israel Journal of Mathematics. 2020;238(2):663-685. doi:10.1007/s11856-020-2035-7","apa":"Bucić, M., Kwan, M. A., Pokrovskiy, A., Sudakov, B., Tran, T., & Wagner, A. Z. (2020). Nearly-linear monotone paths in edge-ordered graphs. Israel Journal of Mathematics. Springer. https://doi.org/10.1007/s11856-020-2035-7","short":"M. Bucić, M.A. Kwan, A. Pokrovskiy, B. Sudakov, T. Tran, A.Z. Wagner, Israel Journal of Mathematics 238 (2020) 663–685.","ieee":"M. Bucić, M. A. Kwan, A. Pokrovskiy, B. Sudakov, T. Tran, and A. Z. Wagner, “Nearly-linear monotone paths in edge-ordered graphs,” Israel Journal of Mathematics, vol. 238, no. 2. Springer, pp. 663–685, 2020.","mla":"Bucić, Matija, et al. “Nearly-Linear Monotone Paths in Edge-Ordered Graphs.” Israel Journal of Mathematics, vol. 238, no. 2, Springer, 2020, pp. 663–85, doi:10.1007/s11856-020-2035-7."},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf"},{"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"ieee":"M. A. Kwan, S. Letzter, B. Sudakov, and T. Tran, “Dense induced bipartite subgraphs in triangle-free graphs,” Combinatorica, vol. 40, no. 2. Springer, pp. 283–305, 2020.","short":"M.A. Kwan, S. Letzter, B. Sudakov, T. Tran, Combinatorica 40 (2020) 283–305.","ama":"Kwan MA, Letzter S, Sudakov B, Tran T. Dense induced bipartite subgraphs in triangle-free graphs. Combinatorica. 2020;40(2):283-305. doi:10.1007/s00493-019-4086-0","apa":"Kwan, M. A., Letzter, S., Sudakov, B., & Tran, T. (2020). Dense induced bipartite subgraphs in triangle-free graphs. Combinatorica. Springer. https://doi.org/10.1007/s00493-019-4086-0","mla":"Kwan, Matthew Alan, et al. “Dense Induced Bipartite Subgraphs in Triangle-Free Graphs.” Combinatorica, vol. 40, no. 2, Springer, 2020, pp. 283–305, doi:10.1007/s00493-019-4086-0.","ista":"Kwan MA, Letzter S, Sudakov B, Tran T. 2020. Dense induced bipartite subgraphs in triangle-free graphs. Combinatorica. 40(2), 283–305.","chicago":"Kwan, Matthew Alan, Shoham Letzter, Benny Sudakov, and Tuan Tran. “Dense Induced Bipartite Subgraphs in Triangle-Free Graphs.” Combinatorica. Springer, 2020. https://doi.org/10.1007/s00493-019-4086-0."},"title":"Dense induced bipartite subgraphs in triangle-free graphs","author":[{"id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan","full_name":"Kwan, Matthew Alan","orcid":"0000-0002-4003-7567","last_name":"Kwan"},{"first_name":"Shoham","full_name":"Letzter, Shoham","last_name":"Letzter"},{"last_name":"Sudakov","full_name":"Sudakov, Benny","first_name":"Benny"},{"full_name":"Tran, Tuan","last_name":"Tran","first_name":"Tuan"}],"external_id":{"arxiv":["1810.12144"]},"article_processing_charge":"No","publisher":"Springer","quality_controlled":"1","oa":1,"day":"01","publication":"Combinatorica","year":"2020","date_published":"2020-04-01T00:00:00Z","doi":"10.1007/s00493-019-4086-0","date_created":"2021-06-22T06:42:26Z","page":"283-305","_id":"9582","status":"public","article_type":"original","type":"journal_article","extern":"1","date_updated":"2023-02-23T14:01:45Z","oa_version":"Preprint","abstract":[{"lang":"eng","text":"The problem of finding dense induced bipartite subgraphs in H-free graphs has a long history, and was posed 30 years ago by Erdős, Faudree, Pach and Spencer. In this paper, we obtain several results in this direction. First we prove that any H-free graph with minimum degree at least d contains an induced bipartite subgraph of minimum degree at least cH log d/log log d, thus nearly confirming one and proving another conjecture of Esperet, Kang and Thomassé. Complementing this result, we further obtain optimal bounds for this problem in the case of dense triangle-free graphs, and we also answer a question of Erdœs, Janson, Łuczak and Spencer."}],"month":"04","intvolume":" 40","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1810.12144"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1439-6912"],"issn":["0209-9683"]},"publication_status":"published","volume":40,"issue":"2"},{"title":"Almost all Steiner triple systems have perfect matchings","article_processing_charge":"No","external_id":{"arxiv":["1611.02246"]},"author":[{"full_name":"Kwan, Matthew Alan","orcid":"0000-0002-4003-7567","last_name":"Kwan","first_name":"Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"ista":"Kwan MA. 2020. Almost all Steiner triple systems have perfect matchings. Proceedings of the London Mathematical Society. 121(6), 1468–1495.","chicago":"Kwan, Matthew Alan. “Almost All Steiner Triple Systems Have Perfect Matchings.” Proceedings of the London Mathematical Society. Wiley, 2020. https://doi.org/10.1112/plms.12373.","apa":"Kwan, M. A. (2020). Almost all Steiner triple systems have perfect matchings. Proceedings of the London Mathematical Society. Wiley. https://doi.org/10.1112/plms.12373","ama":"Kwan MA. Almost all Steiner triple systems have perfect matchings. Proceedings of the London Mathematical Society. 2020;121(6):1468-1495. doi:10.1112/plms.12373","short":"M.A. Kwan, Proceedings of the London Mathematical Society 121 (2020) 1468–1495.","ieee":"M. A. Kwan, “Almost all Steiner triple systems have perfect matchings,” Proceedings of the London Mathematical Society, vol. 121, no. 6. Wiley, pp. 1468–1495, 2020.","mla":"Kwan, Matthew Alan. “Almost All Steiner Triple Systems Have Perfect Matchings.” Proceedings of the London Mathematical Society, vol. 121, no. 6, Wiley, 2020, pp. 1468–95, doi:10.1112/plms.12373."},"oa":1,"publisher":"Wiley","quality_controlled":"1","date_created":"2021-06-22T06:35:16Z","doi":"10.1112/plms.12373","date_published":"2020-12-01T00:00:00Z","page":"1468-1495","publication":"Proceedings of the London Mathematical Society","day":"01","year":"2020","status":"public","type":"journal_article","article_type":"original","_id":"9581","extern":"1","date_updated":"2023-02-23T14:01:43Z","intvolume":" 121","month":"12","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1611.02246"}],"scopus_import":"1","oa_version":"Preprint","abstract":[{"text":"We show that for any 𝑛 divisible by 3, almost all order- 𝑛 Steiner triple systems have a perfect matching (also known as a parallel class or resolution class). In fact, we prove a general upper bound on the number of perfect matchings in a Steiner triple system and show that almost all Steiner triple systems essentially attain this maximum. We accomplish this via a general theorem comparing a uniformly random Steiner triple system to the outcome of the triangle removal process, which we hope will be useful for other problems. Our methods can also be adapted to other types of designs; for example, we sketch a proof of the theorem that almost all Latin squares have transversals.","lang":"eng"}],"issue":"6","volume":121,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["1460-244X"],"issn":["0024-6115"]}},{"status":"public","article_type":"original","type":"journal_article","_id":"9658","extern":"1","date_updated":"2023-02-23T14:03:55Z","intvolume":" 152","month":"01","main_file_link":[{"url":"https://pure.qub.ac.uk/en/publications/classical-nucleation-theory-predicts-the-shape-of-the-nucleus-in-homogeneous-solidification(56af848b-eee8-4e9b-93cf-667373e4a49b).html","open_access":"1"}],"scopus_import":"1","pmid":1,"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"Macroscopic models of nucleation provide powerful tools for understanding activated phase transition processes. These models do not provide atomistic insights and can thus sometimes lack material-specific descriptions. Here, we provide a comprehensive framework for constructing a continuum picture from an atomistic simulation of homogeneous nucleation. We use this framework to determine the equilibrium shape of the solid nucleus that forms inside bulk liquid for a Lennard-Jones potential. From this shape, we then extract the anisotropy of the solid-liquid interfacial free energy, by performing a reverse Wulff construction in the space of spherical harmonic expansions. We find that the shape of the nucleus is nearly spherical and that its anisotropy can be perfectly described using classical models."}],"issue":"4","volume":152,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["1089-7690"],"issn":["0021-9606"]},"article_number":"044103","title":"Classical nucleation theory predicts the shape of the nucleus in homogeneous solidification","external_id":{"pmid":["32007057"],"arxiv":["1910.13481"]},"article_processing_charge":"No","author":[{"id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","first_name":"Bingqing","last_name":"Cheng","orcid":"0000-0002-3584-9632","full_name":"Cheng, Bingqing"},{"full_name":"Ceriotti, Michele","last_name":"Ceriotti","first_name":"Michele"},{"last_name":"Tribello","full_name":"Tribello, Gareth A.","first_name":"Gareth A."}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"ista":"Cheng B, Ceriotti M, Tribello GA. 2020. Classical nucleation theory predicts the shape of the nucleus in homogeneous solidification. The Journal of Chemical Physics. 152(4), 044103.","chicago":"Cheng, Bingqing, Michele Ceriotti, and Gareth A. Tribello. “Classical Nucleation Theory Predicts the Shape of the Nucleus in Homogeneous Solidification.” The Journal of Chemical Physics. AIP Publishing, 2020. https://doi.org/10.1063/1.5134461.","apa":"Cheng, B., Ceriotti, M., & Tribello, G. A. (2020). Classical nucleation theory predicts the shape of the nucleus in homogeneous solidification. The Journal of Chemical Physics. AIP Publishing. https://doi.org/10.1063/1.5134461","ama":"Cheng B, Ceriotti M, Tribello GA. Classical nucleation theory predicts the shape of the nucleus in homogeneous solidification. The Journal of Chemical Physics. 2020;152(4). doi:10.1063/1.5134461","short":"B. Cheng, M. Ceriotti, G.A. Tribello, The Journal of Chemical Physics 152 (2020).","ieee":"B. Cheng, M. Ceriotti, and G. A. Tribello, “Classical nucleation theory predicts the shape of the nucleus in homogeneous solidification,” The Journal of Chemical Physics, vol. 152, no. 4. AIP Publishing, 2020.","mla":"Cheng, Bingqing, et al. “Classical Nucleation Theory Predicts the Shape of the Nucleus in Homogeneous Solidification.” The Journal of Chemical Physics, vol. 152, no. 4, 044103, AIP Publishing, 2020, doi:10.1063/1.5134461."},"oa":1,"quality_controlled":"1","publisher":"AIP Publishing","date_created":"2021-07-15T07:22:24Z","doi":"10.1063/1.5134461","date_published":"2020-01-31T00:00:00Z","publication":"The Journal of Chemical Physics","day":"31","year":"2020"},{"citation":{"ista":"Cheng B, Frenkel D. 2020. Computing the heat conductivity of fluids from density fluctuations. Physical Review Letters. 125(13), 130602.","chicago":"Cheng, Bingqing, and Daan Frenkel. “Computing the Heat Conductivity of Fluids from Density Fluctuations.” Physical Review Letters. American Physical Society, 2020. https://doi.org/10.1103/physrevlett.125.130602.","ieee":"B. Cheng and D. Frenkel, “Computing the heat conductivity of fluids from density fluctuations,” Physical Review Letters, vol. 125, no. 13. American Physical Society, 2020.","short":"B. Cheng, D. Frenkel, Physical Review Letters 125 (2020).","apa":"Cheng, B., & Frenkel, D. (2020). Computing the heat conductivity of fluids from density fluctuations. Physical Review Letters. American Physical Society. https://doi.org/10.1103/physrevlett.125.130602","ama":"Cheng B, Frenkel D. Computing the heat conductivity of fluids from density fluctuations. Physical Review Letters. 2020;125(13). doi:10.1103/physrevlett.125.130602","mla":"Cheng, Bingqing, and Daan Frenkel. “Computing the Heat Conductivity of Fluids from Density Fluctuations.” Physical Review Letters, vol. 125, no. 13, 130602, American Physical Society, 2020, doi:10.1103/physrevlett.125.130602."},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","external_id":{"pmid":["33034481"],"arxiv":["2005.07562"]},"article_processing_charge":"No","author":[{"id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","first_name":"Bingqing","orcid":"0000-0002-3584-9632","full_name":"Cheng, Bingqing","last_name":"Cheng"},{"full_name":"Frenkel, Daan","last_name":"Frenkel","first_name":"Daan"}],"title":"Computing the heat conductivity of fluids from density fluctuations","article_number":"130602","year":"2020","publication":"Physical Review Letters","day":"25","date_created":"2021-07-15T12:15:14Z","date_published":"2020-09-25T00:00:00Z","doi":"10.1103/physrevlett.125.130602","oa":1,"publisher":"American Physical Society","quality_controlled":"1","date_updated":"2021-08-09T12:35:58Z","extern":"1","_id":"9664","type":"journal_article","article_type":"original","status":"public","publication_status":"published","publication_identifier":{"eissn":["1079-7114"],"issn":["0031-9007"]},"language":[{"iso":"eng"}],"issue":"13","volume":125,"abstract":[{"lang":"eng","text":"Equilibrium molecular dynamics simulations, in combination with the Green-Kubo (GK) method, have been extensively used to compute the thermal conductivity of liquids. However, the GK method relies on an ambiguous definition of the microscopic heat flux, which depends on how one chooses to distribute energies over atoms. This ambiguity makes it problematic to employ the GK method for systems with nonpairwise interactions. In this work, we show that the hydrodynamic description of thermally driven density fluctuations can be used to obtain the thermal conductivity of a bulk fluid unambiguously, thereby bypassing the need to define the heat flux. We verify that, for a model fluid with only pairwise interactions, our method yields estimates of thermal conductivity consistent with the GK approach. We apply our approach to compute the thermal conductivity of a nonpairwise additive water model at supercritical conditions, and of a liquid hydrogen system described by a machine-learning interatomic potential, at 33 GPa and 2000 K."}],"pmid":1,"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/2005.07562","open_access":"1"}],"scopus_import":"1","intvolume":" 125","month":"09"},{"year":"2020","publication":"Nature","day":"10","page":"217-220","date_created":"2021-07-19T09:17:49Z","doi":"10.1038/s41586-020-2677-y","date_published":"2020-09-10T00:00:00Z","oa":1,"publisher":"Springer Nature","quality_controlled":"1","citation":{"ista":"Cheng B, Mazzola G, Pickard CJ, Ceriotti M. 2020. Evidence for supercritical behaviour of high-pressure liquid hydrogen. Nature. 585(7824), 217–220.","chicago":"Cheng, Bingqing, Guglielmo Mazzola, Chris J. Pickard, and Michele Ceriotti. “Evidence for Supercritical Behaviour of High-Pressure Liquid Hydrogen.” Nature. Springer Nature, 2020. https://doi.org/10.1038/s41586-020-2677-y.","apa":"Cheng, B., Mazzola, G., Pickard, C. J., & Ceriotti, M. (2020). Evidence for supercritical behaviour of high-pressure liquid hydrogen. Nature. Springer Nature. https://doi.org/10.1038/s41586-020-2677-y","ama":"Cheng B, Mazzola G, Pickard CJ, Ceriotti M. Evidence for supercritical behaviour of high-pressure liquid hydrogen. Nature. 2020;585(7824):217-220. doi:10.1038/s41586-020-2677-y","short":"B. Cheng, G. Mazzola, C.J. Pickard, M. Ceriotti, Nature 585 (2020) 217–220.","ieee":"B. Cheng, G. Mazzola, C. J. Pickard, and M. Ceriotti, “Evidence for supercritical behaviour of high-pressure liquid hydrogen,” Nature, vol. 585, no. 7824. Springer Nature, pp. 217–220, 2020.","mla":"Cheng, Bingqing, et al. “Evidence for Supercritical Behaviour of High-Pressure Liquid Hydrogen.” Nature, vol. 585, no. 7824, Springer Nature, 2020, pp. 217–20, doi:10.1038/s41586-020-2677-y."},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","external_id":{"arxiv":["1906.03341"],"pmid":["32908269"]},"article_processing_charge":"No","author":[{"id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","first_name":"Bingqing","last_name":"Cheng","orcid":"0000-0002-3584-9632","full_name":"Cheng, Bingqing"},{"first_name":"Guglielmo","last_name":"Mazzola","full_name":"Mazzola, Guglielmo"},{"first_name":"Chris J.","full_name":"Pickard, Chris J.","last_name":"Pickard"},{"first_name":"Michele","full_name":"Ceriotti, Michele","last_name":"Ceriotti"}],"title":"Evidence for supercritical behaviour of high-pressure liquid hydrogen","publication_status":"published","publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]},"language":[{"iso":"eng"}],"issue":"7824","volume":585,"abstract":[{"lang":"eng","text":"Hydrogen, the simplest and most abundant element in the Universe, develops a remarkably complex behaviour upon compression^1. Since Wigner predicted the dissociation and metallization of solid hydrogen at megabar pressures almost a century ago^2, several efforts have been made to explain the many unusual properties of dense hydrogen, including a rich and poorly understood solid polymorphism^1,3-5, an anomalous melting line6 and the possible transition to a superconducting state^7. Experiments at such extreme conditions are challenging and often lead to hard-to-interpret and controversial observations, whereas theoretical investigations are constrained by the huge computational cost of sufficiently accurate quantum mechanical calculations. Here we present a theoretical study of the phase diagram of dense hydrogen that uses machine learning to 'learn' potential-energy surfaces and interatomic forces from reference calculations and then predict them at low computational cost, overcoming length- and timescale limitations. We reproduce both the re-entrant melting behaviour and the polymorphism of the solid phase. Simulations using our machine-learning-based potentials provide evidence for a continuous molecular-to-atomic transition in the liquid, with no first-order transition observed above the melting line. This suggests a smooth transition between insulating and metallic layers in giant gas planets, and reconciles existing discrepancies between experiments as a manifestation of supercritical behaviour."}],"pmid":1,"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/1906.03341","open_access":"1"}],"scopus_import":"1","intvolume":" 585","month":"09","date_updated":"2021-08-09T12:38:01Z","extern":"1","_id":"9685","article_type":"original","type":"journal_article","status":"public"},{"month":"02","intvolume":" 56","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1029/2019WR024880"}],"oa_version":"Published Version","abstract":[{"text":"Obtaining detailed information about high mountain snowpacks is often limited by insufficient ground-based observations and uncertainty in the (re)distribution of solid precipitation. We utilize high-resolution optical images from Pléiades satellites to generate a snow depth map, at a spatial resolution of 4 m, for a high mountain catchment of central Chile. Results are negatively biased (median difference of −0.22 m) when compared against observations from a terrestrial Light Detection And Ranging scan, though replicate general snow depth variability well. Additionally, the Pléiades dataset is subject to data gaps (17% of total pixels), negative values for shallow snow (12%), and noise on slopes >40–50° (2%). We correct and filter the Pléiades snow depths using surface classification techniques of snow-free areas and a random forest model for data gap filling. Snow depths (with an estimated error of ~0.36 m) average 1.66 m and relate well to topographical parameters such as elevation and northness in a similar way to previous studies. However, estimations of snow depth based upon topography (TOPO) or physically based modeling (DBSM) cannot resolve localized processes (i.e., avalanching or wind scouring) that are detected by Pléiades, even when forced with locally calibrated data. Comparing these alternative model approaches to corrected Pléiades snow depths reveals total snow volume differences between −28% (DBSM) and +54% (TOPO) for the catchment and large differences across most elevation bands. Pléiades represents an important contribution to understanding snow accumulation at sparsely monitored catchments, though ideally requires a careful systematic validation procedure to identify catchment-scale biases and errors in the snow depth derivation.","lang":"eng"}],"issue":"2","volume":56,"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1944-7973"],"issn":["0043-1397"]},"publication_status":"published","status":"public","keyword":["Water Science and Technology"],"article_type":"original","type":"journal_article","_id":"12598","extern":"1","date_updated":"2023-02-28T12:26:14Z","quality_controlled":"1","publisher":"American Geophysical Union","oa":1,"doi":"10.1029/2019wr024880","date_published":"2020-02-01T00:00:00Z","date_created":"2023-02-20T08:12:47Z","day":"01","publication":"Water Resources Research","year":"2020","article_number":"e2019WR024880","title":"Snow depth patterns in a high mountain Andean catchment from satellite optical tristereoscopic remote sensing","author":[{"last_name":"Shaw","full_name":"Shaw, Thomas E.","first_name":"Thomas E."},{"last_name":"Gascoin","full_name":"Gascoin, Simon","first_name":"Simon"},{"first_name":"Pablo A.","last_name":"Mendoza","full_name":"Mendoza, Pablo A."},{"first_name":"Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","last_name":"Pellicciotti","full_name":"Pellicciotti, Francesca"},{"full_name":"McPhee, James","last_name":"McPhee","first_name":"James"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Shaw, T. E., Gascoin, S., Mendoza, P. A., Pellicciotti, F., & McPhee, J. (2020). Snow depth patterns in a high mountain Andean catchment from satellite optical tristereoscopic remote sensing. Water Resources Research. American Geophysical Union. https://doi.org/10.1029/2019wr024880","ama":"Shaw TE, Gascoin S, Mendoza PA, Pellicciotti F, McPhee J. Snow depth patterns in a high mountain Andean catchment from satellite optical tristereoscopic remote sensing. Water Resources Research. 2020;56(2). doi:10.1029/2019wr024880","short":"T.E. Shaw, S. Gascoin, P.A. Mendoza, F. Pellicciotti, J. McPhee, Water Resources Research 56 (2020).","ieee":"T. E. Shaw, S. Gascoin, P. A. Mendoza, F. Pellicciotti, and J. McPhee, “Snow depth patterns in a high mountain Andean catchment from satellite optical tristereoscopic remote sensing,” Water Resources Research, vol. 56, no. 2. American Geophysical Union, 2020.","mla":"Shaw, Thomas E., et al. “Snow Depth Patterns in a High Mountain Andean Catchment from Satellite Optical Tristereoscopic Remote Sensing.” Water Resources Research, vol. 56, no. 2, e2019WR024880, American Geophysical Union, 2020, doi:10.1029/2019wr024880.","ista":"Shaw TE, Gascoin S, Mendoza PA, Pellicciotti F, McPhee J. 2020. Snow depth patterns in a high mountain Andean catchment from satellite optical tristereoscopic remote sensing. Water Resources Research. 56(2), e2019WR024880.","chicago":"Shaw, Thomas E., Simon Gascoin, Pablo A. Mendoza, Francesca Pellicciotti, and James McPhee. “Snow Depth Patterns in a High Mountain Andean Catchment from Satellite Optical Tristereoscopic Remote Sensing.” Water Resources Research. American Geophysical Union, 2020. https://doi.org/10.1029/2019wr024880."}}]