[{"file":[{"checksum":"eb6d950b6a68ddc4a2fb31ec80a2a1bd","file_id":"9320","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2021-04-12T08:33:23Z","file_name":"2020_ScienceAdv_Kimchi.pdf","creator":"dernst","date_updated":"2021-04-12T08:33:23Z","file_size":1259758}],"language":[{"iso":"eng"}],"publication_status":"published","volume":6,"issue":"51","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Recent advances in synthetic posttranslational protein circuits are substantially impacting the landscape of cellular engineering and offer several advantages compared to traditional gene circuits. However, engineering dynamic phenomena such as oscillations in protein-level circuits remains an outstanding challenge. Few examples of biological posttranslational oscillators are known, necessitating theoretical progress to determine realizable oscillators. We construct mathematical models for two posttranslational oscillators, using few components that interact only through reversible binding and phosphorylation/dephosphorylation reactions. Our designed oscillators rely on the self-assembly of two protein species into multimeric functional enzymes that respectively inhibit and enhance this self-assembly. We limit our analysis to within experimental constraints, finding (i) significant portions of the restricted parameter space yielding oscillations and (ii) that oscillation periods can be tuned by several orders of magnitude using recent advances in computational protein design. Our work paves the way for the rational design and realization of protein-based dynamic systems."}],"month":"12","intvolume":" 6","extern":"1","ddc":["570"],"date_updated":"2021-04-12T08:35:19Z","file_date_updated":"2021-04-12T08:33:23Z","_id":"7778","status":"public","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)"},"day":"16","publication":"Science Advances","has_accepted_license":"1","year":"2020","doi":"10.1126/sciadv.abc1939","date_published":"2020-12-16T00:00:00Z","date_created":"2020-04-30T12:07:55Z","quality_controlled":"1","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Kimchi O, Goodrich CP, Courbet A, et al. Self-assembly-based posttranslational protein oscillators. Science Advances. 2020;6(51). doi:10.1126/sciadv.abc1939","apa":"Kimchi, O., Goodrich, C. P., Courbet, A., Curatolo, A. I., Woodall, N. B., Baker, D., & Brenner, M. P. (2020). Self-assembly-based posttranslational protein oscillators. Science Advances. https://doi.org/10.1126/sciadv.abc1939","short":"O. Kimchi, C.P. Goodrich, A. Courbet, A.I. Curatolo, N.B. Woodall, D. Baker, M.P. Brenner, Science Advances 6 (2020).","ieee":"O. Kimchi et al., “Self-assembly-based posttranslational protein oscillators,” Science Advances, vol. 6, no. 51. 2020.","mla":"Kimchi, Ofer, et al. “Self-Assembly-Based Posttranslational Protein Oscillators.” Science Advances, vol. 6, no. 51, eabc1939, 2020, doi:10.1126/sciadv.abc1939.","ista":"Kimchi O, Goodrich CP, Courbet A, Curatolo AI, Woodall NB, Baker D, Brenner MP. 2020. Self-assembly-based posttranslational protein oscillators. Science Advances. 6(51), eabc1939.","chicago":"Kimchi, Ofer, Carl Peter Goodrich, Alexis Courbet, Agnese I. Curatolo, Nicholas B. Woodall, David Baker, and Michael P. Brenner. “Self-Assembly-Based Posttranslational Protein Oscillators.” Science Advances, 2020. https://doi.org/10.1126/sciadv.abc1939."},"title":"Self-assembly-based posttranslational protein oscillators","author":[{"last_name":"Kimchi","full_name":"Kimchi, Ofer","first_name":"Ofer"},{"first_name":"Carl Peter","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","orcid":"0000-0002-1307-5074","full_name":"Goodrich, Carl Peter","last_name":"Goodrich"},{"last_name":"Courbet","full_name":"Courbet, Alexis","first_name":"Alexis"},{"full_name":"Curatolo, Agnese I.","last_name":"Curatolo","first_name":"Agnese I."},{"first_name":"Nicholas B.","last_name":"Woodall","full_name":"Woodall, Nicholas B."},{"first_name":"David","last_name":"Baker","full_name":"Baker, David"},{"first_name":"Michael P.","full_name":"Brenner, Michael P.","last_name":"Brenner"}],"article_processing_charge":"No","article_number":"eabc1939"},{"quality_controlled":"1","publisher":"Association for Computing Machinery","oa":1,"page":"309-318","date_published":"2020-07-01T00:00:00Z","doi":"10.1145/3382734.3405751","date_created":"2020-05-06T09:02:14Z","has_accepted_license":"1","year":"2020","day":"01","publication":"Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"author":[{"full_name":"Czumaj, Artur","orcid":"0000-0002-5646-9524","last_name":"Czumaj","first_name":"Artur"},{"id":"11396234-BB50-11E9-B24C-90FCE5697425","first_name":"Peter","full_name":"Davies, Peter","orcid":"0000-0002-5646-9524","last_name":"Davies"},{"first_name":"Merav","last_name":"Parter","full_name":"Parter, Merav"}],"article_processing_charge":"No","external_id":{"arxiv":["2009.06043"]},"title":"Simple, deterministic, constant-round coloring in the congested clique","citation":{"apa":"Czumaj, A., Davies, P., & Parter, M. (2020). Simple, deterministic, constant-round coloring in the congested clique. In Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing (pp. 309–318). Salerno, Italy: Association for Computing Machinery. https://doi.org/10.1145/3382734.3405751","ama":"Czumaj A, Davies P, Parter M. Simple, deterministic, constant-round coloring in the congested clique. In: Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2020:309-318. doi:10.1145/3382734.3405751","ieee":"A. Czumaj, P. Davies, and M. Parter, “Simple, deterministic, constant-round coloring in the congested clique,” in Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Salerno, Italy, 2020, pp. 309–318.","short":"A. Czumaj, P. Davies, M. Parter, in:, Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 309–318.","mla":"Czumaj, Artur, et al. “Simple, Deterministic, Constant-Round Coloring in the Congested Clique.” Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 309–18, doi:10.1145/3382734.3405751.","ista":"Czumaj A, Davies P, Parter M. 2020. Simple, deterministic, constant-round coloring in the congested clique. Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 309–318.","chicago":"Czumaj, Artur, Peter Davies, and Merav Parter. “Simple, Deterministic, Constant-Round Coloring in the Congested Clique.” In Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, 309–18. Association for Computing Machinery, 2020. https://doi.org/10.1145/3382734.3405751."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","abstract":[{"text":"We settle the complexity of the (Δ+1)-coloring and (Δ+1)-list coloring problems in the CONGESTED CLIQUE model by presenting a simple deterministic algorithm for both problems running in a constant number of rounds. This matches the complexity of the recent breakthrough randomized constant-round (Δ+1)-list coloring algorithm due to Chang et al. (PODC'19), and significantly improves upon the state-of-the-art O(logΔ)-round deterministic (Δ+1)-coloring bound of Parter (ICALP'18).\r\nA remarkable property of our algorithm is its simplicity. Whereas the state-of-the-art randomized algorithms for this problem are based on the quite involved local coloring algorithm of Chang et al. (STOC'18), our algorithm can be described in just a few lines. At a high level, it applies a careful derandomization of a recursive procedure which partitions the nodes and their respective palettes into separate bins. We show that after O(1) recursion steps, the remaining uncolored subgraph within each bin has linear size, and thus can be solved locally by collecting it to a single node. This algorithm can also be implemented in the Massively Parallel Computation (MPC) model provided that each machine has linear (in n, the number of nodes in the input graph) space.\r\nWe also show an extension of our algorithm to the MPC regime in which machines have sublinear space: we present the first deterministic (Δ+1)-list coloring algorithm designed for sublinear-space MPC, which runs in O(logΔ+loglogn) rounds.","lang":"eng"}],"oa_version":"Submitted Version","ec_funded":1,"publication_status":"published","file":[{"date_created":"2020-10-08T08:17:36Z","file_name":"ColoringArxiv.pdf","date_updated":"2020-10-08T08:17:36Z","file_size":520051,"creator":"pdavies","file_id":"8624","checksum":"46fe4fc58a64eb04068115573f631d4c","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"type":"conference","conference":{"start_date":"2020-08-03","end_date":"2020-08-07","location":"Salerno, Italy","name":"PODC: Symposium on Principles of Distributed Computing"},"status":"public","_id":"7803","department":[{"_id":"DaAl"}],"file_date_updated":"2020-10-08T08:17:36Z","date_updated":"2021-01-12T08:15:37Z","ddc":["000"]},{"volume":"2020-January","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781611975994"]},"publication_status":"published","month":"01","scopus_import":1,"main_file_link":[{"url":"https://doi.org/10.1137/1.9781611975994.47","open_access":"1"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We consider the following decision problem EMBEDk→d in computational topology (where k ≤ d are fixed positive integers): Given a finite simplicial complex K of dimension k, does there exist a (piecewise-linear) embedding of K into ℝd?\r\nThe special case EMBED1→2 is graph planarity, which is decidable in linear time, as shown by Hopcroft and Tarjan. In higher dimensions, EMBED2→3 and EMBED3→3 are known to be decidable (as well as NP-hard), and recent results of Čadek et al. in computational homotopy theory, in combination with the classical Haefliger–Weber theorem in geometric topology, imply that EMBEDk→d can be solved in polynomial time for any fixed pair (k, d) of dimensions in the so-called metastable range .\r\nHere, by contrast, we prove that EMBEDk→d is algorithmically undecidable for almost all pairs of dimensions outside the metastable range, namely for . This almost completely resolves the decidability vs. undecidability of EMBEDk→d in higher dimensions and establishes a sharp dichotomy between polynomial-time solvability and undecidability.\r\nOur result complements (and in a wide range of dimensions strengthens) earlier results of Matoušek, Tancer, and the second author, who showed that EMBEDk→d is undecidable for 4 ≤ k ϵ {d – 1, d}, and NP-hard for all remaining pairs (k, d) outside the metastable range and satisfying d ≥ 4."}],"department":[{"_id":"UlWa"}],"date_updated":"2021-01-12T08:15:38Z","status":"public","type":"conference","conference":{"location":"Salt Lake City, UT, United States","end_date":"2020-01-08","start_date":"2020-01-05","name":"SODA: Symposium on Discrete Algorithms"},"_id":"7806","date_published":"2020-01-01T00:00:00Z","doi":"10.1137/1.9781611975994.47","date_created":"2020-05-10T22:00:48Z","page":"767-785","day":"01","publication":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms","year":"2020","publisher":"SIAM","quality_controlled":"1","oa":1,"title":"Embeddability of simplicial complexes is undecidable","author":[{"last_name":"Filakovský","full_name":"Filakovský, Marek","first_name":"Marek","id":"3E8AF77E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Wagner","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Zhechev","full_name":"Zhechev, Stephan Y","id":"3AA52972-F248-11E8-B48F-1D18A9856A87","first_name":"Stephan Y"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Filakovský, Marek, et al. “Embeddability of Simplicial Complexes Is Undecidable.” Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2020–January, SIAM, 2020, pp. 767–85, doi:10.1137/1.9781611975994.47.","ieee":"M. Filakovský, U. Wagner, and S. Y. Zhechev, “Embeddability of simplicial complexes is undecidable,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Salt Lake City, UT, United States, 2020, vol. 2020–January, pp. 767–785.","short":"M. Filakovský, U. Wagner, S.Y. Zhechev, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2020, pp. 767–785.","ama":"Filakovský M, Wagner U, Zhechev SY. Embeddability of simplicial complexes is undecidable. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 2020-January. SIAM; 2020:767-785. doi:10.1137/1.9781611975994.47","apa":"Filakovský, M., Wagner, U., & Zhechev, S. Y. (2020). Embeddability of simplicial complexes is undecidable. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2020–January, pp. 767–785). Salt Lake City, UT, United States: SIAM. https://doi.org/10.1137/1.9781611975994.47","chicago":"Filakovský, Marek, Uli Wagner, and Stephan Y Zhechev. “Embeddability of Simplicial Complexes Is Undecidable.” In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2020–January:767–85. SIAM, 2020. https://doi.org/10.1137/1.9781611975994.47.","ista":"Filakovský M, Wagner U, Zhechev SY. 2020. Embeddability of simplicial complexes is undecidable. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2020–January, 767–785."},"project":[{"_id":"26611F5C-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Algorithms for Embeddings and Homotopy Theory","grant_number":"P31312"}]},{"project":[{"_id":"264E56E2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"M02416","name":"Molecular Mechanisms Regulating Gliogenesis in the Cerebral Cortex"},{"grant_number":"725780","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development","_id":"260018B0-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"article_number":"48","title":"SCOPES: Sparking curiosity through Open-Source platforms in education and science","author":[{"first_name":"Robert J","id":"2E26DF60-F248-11E8-B48F-1D18A9856A87","last_name":"Beattie","orcid":"0000-0002-8483-8753","full_name":"Beattie, Robert J"},{"id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","last_name":"Hippenmeyer","full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061"},{"full_name":"Pauler, Florian","last_name":"Pauler","first_name":"Florian","id":"48EA0138-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Beattie RJ, Hippenmeyer S, Pauler F. 2020. SCOPES: Sparking curiosity through Open-Source platforms in education and science. Frontiers in Education. 5, 48.","chicago":"Beattie, Robert J, Simon Hippenmeyer, and Florian Pauler. “SCOPES: Sparking Curiosity through Open-Source Platforms in Education and Science.” Frontiers in Education. Frontiers Media, 2020. https://doi.org/10.3389/feduc.2020.00048.","ama":"Beattie RJ, Hippenmeyer S, Pauler F. SCOPES: Sparking curiosity through Open-Source platforms in education and science. Frontiers in Education. 2020;5. doi:10.3389/feduc.2020.00048","apa":"Beattie, R. J., Hippenmeyer, S., & Pauler, F. (2020). SCOPES: Sparking curiosity through Open-Source platforms in education and science. Frontiers in Education. Frontiers Media. https://doi.org/10.3389/feduc.2020.00048","short":"R.J. Beattie, S. Hippenmeyer, F. Pauler, Frontiers in Education 5 (2020).","ieee":"R. J. Beattie, S. Hippenmeyer, and F. Pauler, “SCOPES: Sparking curiosity through Open-Source platforms in education and science,” Frontiers in Education, vol. 5. Frontiers Media, 2020.","mla":"Beattie, Robert J., et al. “SCOPES: Sparking Curiosity through Open-Source Platforms in Education and Science.” Frontiers in Education, vol. 5, 48, Frontiers Media, 2020, doi:10.3389/feduc.2020.00048."},"quality_controlled":"1","publisher":"Frontiers Media","oa":1,"date_published":"2020-05-08T00:00:00Z","doi":"10.3389/feduc.2020.00048","date_created":"2020-05-11T08:18:48Z","day":"08","publication":"Frontiers in Education","has_accepted_license":"1","year":"2020","status":"public","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)"},"_id":"7814","file_date_updated":"2020-07-14T12:48:03Z","department":[{"_id":"SiHi"}],"ddc":["570"],"date_updated":"2021-01-12T08:15:42Z","month":"05","intvolume":" 5","oa_version":"Published Version","acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"},{"_id":"PreCl"},{"_id":"EM-Fac"}],"abstract":[{"text":"Scientific research is to date largely restricted to wealthy laboratories in developed nations due to the necessity of complex and expensive equipment. This inequality limits the capacity of science to be used as a diplomatic channel. Maker movements use open-source technologies including additive manufacturing (3D printing) and laser cutting, together with low-cost computers for developing novel products. This movement is setting the groundwork for a revolution, allowing scientific equipment to be sourced at a fraction of the cost and has the potential to increase the availability of equipment for scientists around the world. Science education is increasingly recognized as another channel for science diplomacy. In this perspective, we introduce the idea that the Maker movement and open-source technologies have the potential to revolutionize science, technology, engineering and mathematics (STEM) education worldwide. We present an open-source STEM didactic tool called SCOPES (Sparking Curiosity through Open-source Platforms in Education and Science). SCOPES is self-contained, independent of local resources, and cost-effective. SCOPES can be adapted to communicate complex subjects from genetics to neurobiology, perform real-world biological experiments and explore digitized scientific samples. We envision such platforms will enhance science diplomacy by providing a means for scientists to share their findings with classrooms and for educators to incorporate didactic concepts into STEM lessons. By providing students the opportunity to design, perform, and share scientific experiments, students also experience firsthand the benefits of a multinational scientific community. We provide instructions on how to build and use SCOPES on our webpage: http://scopeseducation.org.","lang":"eng"}],"volume":5,"ec_funded":1,"file":[{"date_updated":"2020-07-14T12:48:03Z","file_size":1402146,"creator":"dernst","date_created":"2020-05-11T11:34:08Z","file_name":"2020_FrontiersEduc_Beattie.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"a24ec24e38d843341ae620ec76c53688","file_id":"7818"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2504-284X"]},"publication_status":"published"},{"acknowledgement":"Open access funding provided by Austrian Science Fund (FWF). The second author has been supported by the International Research Training Group IGDK 1754 “Optimization and Numerical Analysis for Partial Differential Equations with Nonsmooth Structures”, funded by the German Research Council (DFG) and the Austrian Science Fund (FWF) under grant number [W 1244-N18].","publisher":"Springer Nature","quality_controlled":"1","oa":1,"has_accepted_license":"1","year":"2020","day":"01","publication":"Journal of Elliptic and Parabolic Equations","page":"529-598","date_published":"2020-12-01T00:00:00Z","doi":"10.1007/s41808-020-00068-8","date_created":"2020-05-17T22:00:45Z","project":[{"name":"FWF Open Access Fund","_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1","call_identifier":"FWF"}],"citation":{"mla":"Fellner, Klemens, and Michael Kniely. “Uniform Convergence to Equilibrium for a Family of Drift–Diffusion Models with Trap-Assisted Recombination and the Limiting Shockley–Read–Hall Model.” Journal of Elliptic and Parabolic Equations, vol. 6, Springer Nature, 2020, pp. 529–98, doi:10.1007/s41808-020-00068-8.","apa":"Fellner, K., & Kniely, M. (2020). Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model. Journal of Elliptic and Parabolic Equations. Springer Nature. https://doi.org/10.1007/s41808-020-00068-8","ama":"Fellner K, Kniely M. Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model. Journal of Elliptic and Parabolic Equations. 2020;6:529-598. doi:10.1007/s41808-020-00068-8","short":"K. Fellner, M. Kniely, Journal of Elliptic and Parabolic Equations 6 (2020) 529–598.","ieee":"K. Fellner and M. Kniely, “Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model,” Journal of Elliptic and Parabolic Equations, vol. 6. Springer Nature, pp. 529–598, 2020.","chicago":"Fellner, Klemens, and Michael Kniely. “Uniform Convergence to Equilibrium for a Family of Drift–Diffusion Models with Trap-Assisted Recombination and the Limiting Shockley–Read–Hall Model.” Journal of Elliptic and Parabolic Equations. Springer Nature, 2020. https://doi.org/10.1007/s41808-020-00068-8.","ista":"Fellner K, Kniely M. 2020. Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model. Journal of Elliptic and Parabolic Equations. 6, 529–598."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Klemens","last_name":"Fellner","full_name":"Fellner, Klemens"},{"orcid":"0000-0001-5645-4333","full_name":"Kniely, Michael","last_name":"Kniely","first_name":"Michael","id":"2CA2C08C-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","title":"Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model","abstract":[{"text":"In this paper, we establish convergence to equilibrium for a drift–diffusion–recombination system modelling the charge transport within certain semiconductor devices. More precisely, we consider a two-level system for electrons and holes which is augmented by an intermediate energy level for electrons in so-called trapped states. The recombination dynamics use the mass action principle by taking into account this additional trap level. The main part of the paper is concerned with the derivation of an entropy–entropy production inequality, which entails exponential convergence to the equilibrium via the so-called entropy method. The novelty of our approach lies in the fact that the entropy method is applied uniformly in a fast-reaction parameter which governs the lifetime of electrons on the trap level. Thus, the resulting decay estimate for the densities of electrons and holes extends to the corresponding quasi-steady-state approximation.","lang":"eng"}],"oa_version":"Published Version","scopus_import":"1","month":"12","intvolume":" 6","publication_identifier":{"eissn":["22969039"],"issn":["22969020"]},"publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"checksum":"6bc6832caacddceee1471291e93dcf1d","file_id":"8802","creator":"dernst","file_size":8408694,"date_updated":"2020-11-25T08:59:59Z","file_name":"2020_JourEllipticParabEquat_Fellner.pdf","date_created":"2020-11-25T08:59:59Z"}],"language":[{"iso":"eng"}],"volume":6,"_id":"7866","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","date_updated":"2021-01-12T08:15:47Z","ddc":["510"],"file_date_updated":"2020-11-25T08:59:59Z","department":[{"_id":"JuFi"}]},{"article_number":"023154 ","project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Mistakidis SI, Volosniev A, Schmelcher P. 2020. Induced correlations between impurities in a one-dimensional quenched Bose gas. Physical Review Research. 2, 023154.","chicago":"Mistakidis, S. I., Artem Volosniev, and P. Schmelcher. “Induced Correlations between Impurities in a One-Dimensional Quenched Bose Gas.” Physical Review Research. American Physical Society, 2020. https://doi.org/10.1103/physrevresearch.2.023154.","short":"S.I. Mistakidis, A. Volosniev, P. Schmelcher, Physical Review Research 2 (2020).","ieee":"S. I. Mistakidis, A. Volosniev, and P. Schmelcher, “Induced correlations between impurities in a one-dimensional quenched Bose gas,” Physical Review Research, vol. 2. American Physical Society, 2020.","ama":"Mistakidis SI, Volosniev A, Schmelcher P. Induced correlations between impurities in a one-dimensional quenched Bose gas. Physical Review Research. 2020;2. doi:10.1103/physrevresearch.2.023154","apa":"Mistakidis, S. I., Volosniev, A., & Schmelcher, P. (2020). Induced correlations between impurities in a one-dimensional quenched Bose gas. Physical Review Research. American Physical Society. https://doi.org/10.1103/physrevresearch.2.023154","mla":"Mistakidis, S. I., et al. “Induced Correlations between Impurities in a One-Dimensional Quenched Bose Gas.” Physical Review Research, vol. 2, 023154, American Physical Society, 2020, doi:10.1103/physrevresearch.2.023154."},"title":"Induced correlations between impurities in a one-dimensional quenched Bose gas","author":[{"last_name":"Mistakidis","full_name":"Mistakidis, S. I.","first_name":"S. I."},{"id":"37D278BC-F248-11E8-B48F-1D18A9856A87","first_name":"Artem","orcid":"0000-0003-0393-5525","full_name":"Volosniev, Artem","last_name":"Volosniev"},{"last_name":"Schmelcher","full_name":"Schmelcher, P.","first_name":"P."}],"article_processing_charge":"No","publisher":"American Physical Society","quality_controlled":"1","oa":1,"day":"11","publication":"Physical Review Research","has_accepted_license":"1","year":"2020","date_published":"2020-05-11T00:00:00Z","doi":"10.1103/physrevresearch.2.023154","date_created":"2020-06-03T11:30:10Z","_id":"7919","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)"},"ddc":["530"],"date_updated":"2023-02-23T13:20:16Z","file_date_updated":"2020-07-14T12:48:05Z","department":[{"_id":"MiLe"}],"oa_version":"Published Version","abstract":[{"text":"We explore the time evolution of two impurities in a trapped one-dimensional Bose gas that follows a change of the boson-impurity interaction. We study the induced impurity-impurity interactions and their effect on the quench dynamics. In particular, we report on the size of the impurity cloud, the impurity-impurity entanglement, and the impurity-impurity correlation function. The presented numerical simulations are based upon the variational multilayer multiconfiguration time-dependent Hartree method for bosons. To analyze and quantify induced impurity-impurity correlations, we employ an effective two-body Hamiltonian with a contact interaction. We show that the effective model consistent with the mean-field attraction of two heavy impurities explains qualitatively our results for weak interactions. Our findings suggest that the quench dynamics in cold-atom systems can be a tool for studying impurity-impurity correlations.","lang":"eng"}],"month":"05","intvolume":" 2","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"e1c362fe094d6b246b3cd4a49722e78b","file_id":"7926","file_size":1741098,"date_updated":"2020-07-14T12:48:05Z","creator":"dernst","file_name":"2020_PhysRevResearch_Mistakidis.pdf","date_created":"2020-06-04T13:51:59Z"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2643-1564"]},"publication_status":"published","volume":2,"ec_funded":1},{"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":"SoCG: Symposium on Computational Geometry","start_date":"2020-06-22","location":"Zürich, Switzerland","end_date":"2020-06-26"},"type":"conference","status":"public","_id":"7991","file_date_updated":"2020-07-14T12:48:06Z","department":[{"_id":"UlWa"}],"date_updated":"2021-01-12T08:16:23Z","ddc":["510"],"alternative_title":["LIPIcs"],"scopus_import":"1","intvolume":" 164","month":"06","abstract":[{"lang":"eng","text":"We define and study a discrete process that generalizes the convex-layer decomposition of a planar point set. Our process, which we call homotopic curve shortening (HCS), starts with a closed curve (which might self-intersect) in the presence of a set P⊂ ℝ² of point obstacles, and evolves in discrete steps, where each step consists of (1) taking shortcuts around the obstacles, and (2) reducing the curve to its shortest homotopic equivalent. We find experimentally that, if the initial curve is held fixed and P is chosen to be either a very fine regular grid or a uniformly random point set, then HCS behaves at the limit like the affine curve-shortening flow (ACSF). This connection between HCS and ACSF generalizes the link between \"grid peeling\" and the ACSF observed by Eppstein et al. (2017), which applied only to convex curves, and which was studied only for regular grids. We prove that HCS satisfies some properties analogous to those of ACSF: HCS is invariant under affine transformations, preserves convexity, and does not increase the total absolute curvature. Furthermore, the number of self-intersections of a curve, or intersections between two curves (appropriately defined), does not increase. Finally, if the initial curve is simple, then the number of inflection points (appropriately defined) does not increase."}],"oa_version":"Published Version","license":"https://creativecommons.org/licenses/by/3.0/","volume":164,"publication_status":"published","publication_identifier":{"isbn":["9783959771436"],"issn":["18688969"]},"language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"6872df6549142f709fb6354a1b2f2c06","file_id":"8007","creator":"dernst","date_updated":"2020-07-14T12:48:06Z","file_size":575896,"date_created":"2020-06-23T11:13:49Z","file_name":"2020_LIPIcsSoCG_Avvakumov.pdf"}],"project":[{"name":"Algorithms for Embeddings and Homotopy Theory","grant_number":"P31312","_id":"26611F5C-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"article_number":"12:1 - 12:15","article_processing_charge":"No","external_id":{"arxiv":["1909.00263"]},"author":[{"id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","first_name":"Sergey","full_name":"Avvakumov, Sergey","last_name":"Avvakumov"},{"first_name":"Gabriel","full_name":"Nivasch, Gabriel","last_name":"Nivasch"}],"title":"Homotopic curve shortening and the affine curve-shortening flow","citation":{"ieee":"S. Avvakumov and G. Nivasch, “Homotopic curve shortening and the affine curve-shortening flow,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164.","short":"S. Avvakumov, G. Nivasch, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","apa":"Avvakumov, S., & Nivasch, G. (2020). Homotopic curve shortening and the affine curve-shortening flow. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.12","ama":"Avvakumov S, Nivasch G. Homotopic curve shortening and the affine curve-shortening flow. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.12","mla":"Avvakumov, Sergey, and Gabriel Nivasch. “Homotopic Curve Shortening and the Affine Curve-Shortening Flow.” 36th International Symposium on Computational Geometry, vol. 164, 12:1-12:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.12.","ista":"Avvakumov S, Nivasch G. 2020. Homotopic curve shortening and the affine curve-shortening flow. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 12:1-12:15.","chicago":"Avvakumov, Sergey, and Gabriel Nivasch. “Homotopic Curve Shortening and the Affine Curve-Shortening Flow.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.12."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","date_created":"2020-06-22T09:14:19Z","date_published":"2020-06-01T00:00:00Z","doi":"10.4230/LIPIcs.SoCG.2020.12","year":"2020","has_accepted_license":"1","publication":"36th International Symposium on Computational Geometry","day":"01"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Patakova Z. 2020. Bounding radon number via Betti numbers. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 61:1-61:13.","chicago":"Patakova, Zuzana. “Bounding Radon Number via Betti Numbers.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.61.","short":"Z. Patakova, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ieee":"Z. Patakova, “Bounding radon number via Betti numbers,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164.","ama":"Patakova Z. Bounding radon number via Betti numbers. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.61","apa":"Patakova, Z. (2020). Bounding radon number via Betti numbers. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.61","mla":"Patakova, Zuzana. “Bounding Radon Number via Betti Numbers.” 36th International Symposium on Computational Geometry, vol. 164, 61:1-61:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.61."},"title":"Bounding radon number via Betti numbers","author":[{"orcid":"0000-0002-3975-1683","full_name":"Patakova, Zuzana","last_name":"Patakova","id":"48B57058-F248-11E8-B48F-1D18A9856A87","first_name":"Zuzana"}],"external_id":{"arxiv":["1908.01677"]},"article_processing_charge":"No","article_number":"61:1-61:13","day":"01","publication":"36th International Symposium on Computational Geometry","has_accepted_license":"1","year":"2020","doi":"10.4230/LIPIcs.SoCG.2020.61","date_published":"2020-06-01T00:00:00Z","date_created":"2020-06-22T09:14:18Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"ddc":["510"],"date_updated":"2021-01-12T08:16:22Z","department":[{"_id":"UlWa"}],"file_date_updated":"2020-07-14T12:48:06Z","_id":"7989","status":"public","type":"conference","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)"},"conference":{"name":"SoCG: Symposium on Computational Geometry","end_date":"2020-06-26","location":"Zürich, Switzerland","start_date":"2020-06-22"},"file":[{"date_created":"2020-06-23T06:56:23Z","file_name":"2020_LIPIcsSoCG_Patakova_61.pdf","date_updated":"2020-07-14T12:48:06Z","file_size":645421,"creator":"dernst","checksum":"d0996ca5f6eb32ce955ce782b4f2afbe","file_id":"8005","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783959771436"],"issn":["18688969"]},"publication_status":"published","volume":164,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We prove general topological Radon-type theorems for sets in ℝ^d, smooth real manifolds or finite dimensional simplicial complexes. Combined with a recent result of Holmsen and Lee, it gives fractional Helly theorem, and consequently the existence of weak ε-nets as well as a (p,q)-theorem. More precisely: Let X be either ℝ^d, smooth real d-manifold, or a finite d-dimensional simplicial complex. Then if F is a finite, intersection-closed family of sets in X such that the ith reduced Betti number (with ℤ₂ coefficients) of any set in F is at most b for every non-negative integer i less or equal to k, then the Radon number of F is bounded in terms of b and X. Here k is the smallest integer larger or equal to d/2 - 1 if X = ℝ^d; k=d-1 if X is a smooth real d-manifold and not a surface, k=0 if X is a surface and k=d if X is a d-dimensional simplicial complex. Using the recent result of the author and Kalai, we manage to prove the following optimal bound on fractional Helly number for families of open sets in a surface: Let F be a finite family of open sets in a surface S such that the intersection of any subfamily of F is either empty, or path-connected. Then the fractional Helly number of F is at most three. This also settles a conjecture of Holmsen, Kim, and Lee about an existence of a (p,q)-theorem for open subsets of a surface."}],"month":"06","intvolume":" 164","alternative_title":["LIPIcs"],"scopus_import":"1"},{"publication_identifier":{"isbn":["9783959771436"],"issn":["18688969"]},"publication_status":"published","file":[{"date_created":"2020-06-23T06:45:52Z","file_name":"2020_LIPIcsSoCG_Patakova.pdf","creator":"dernst","date_updated":"2020-07-14T12:48:06Z","file_size":750318,"checksum":"ce1c9194139a664fb59d1efdfc88eaae","file_id":"8004","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"volume":164,"abstract":[{"text":"Let K be a convex body in ℝⁿ (i.e., a compact convex set with nonempty interior). Given a point p in the interior of K, a hyperplane h passing through p is called barycentric if p is the barycenter of K ∩ h. In 1961, Grünbaum raised the question whether, for every K, there exists an interior point p through which there are at least n+1 distinct barycentric hyperplanes. Two years later, this was seemingly resolved affirmatively by showing that this is the case if p=p₀ is the point of maximal depth in K. However, while working on a related question, we noticed that one of the auxiliary claims in the proof is incorrect. Here, we provide a counterexample; this re-opens Grünbaum’s question. It follows from known results that for n ≥ 2, there are always at least three distinct barycentric cuts through the point p₀ ∈ K of maximal depth. Using tools related to Morse theory we are able to improve this bound: four distinct barycentric cuts through p₀ are guaranteed if n ≥ 3.","lang":"eng"}],"oa_version":"Published Version","scopus_import":1,"alternative_title":["LIPIcs"],"month":"06","intvolume":" 164","date_updated":"2021-01-12T08:16:23Z","ddc":["510"],"file_date_updated":"2020-07-14T12:48:06Z","department":[{"_id":"UlWa"}],"_id":"7992","type":"conference","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)"},"conference":{"end_date":"2020-06-26","location":"Zürich, Switzerland","start_date":"2020-06-22","name":"SoCG: Symposium on Computational Geometry"},"status":"public","has_accepted_license":"1","year":"2020","day":"01","publication":"36th International Symposium on Computational Geometry","date_published":"2020-06-01T00:00:00Z","doi":"10.4230/LIPIcs.SoCG.2020.62","date_created":"2020-06-22T09:14:20Z","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"citation":{"ista":"Patakova Z, Tancer M, Wagner U. 2020. Barycentric cuts through a convex body. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 62:1-62:16.","chicago":"Patakova, Zuzana, Martin Tancer, and Uli Wagner. “Barycentric Cuts through a Convex Body.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.62.","apa":"Patakova, Z., Tancer, M., & Wagner, U. (2020). Barycentric cuts through a convex body. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.62","ama":"Patakova Z, Tancer M, Wagner U. Barycentric cuts through a convex body. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.62","short":"Z. Patakova, M. Tancer, U. Wagner, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ieee":"Z. Patakova, M. Tancer, and U. Wagner, “Barycentric cuts through a convex body,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164.","mla":"Patakova, Zuzana, et al. “Barycentric Cuts through a Convex Body.” 36th International Symposium on Computational Geometry, vol. 164, 62:1-62:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.62."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"48B57058-F248-11E8-B48F-1D18A9856A87","first_name":"Zuzana","last_name":"Patakova","full_name":"Patakova, Zuzana","orcid":"0000-0002-3975-1683"},{"last_name":"Tancer","full_name":"Tancer, Martin","orcid":"0000-0002-1191-6714","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli","last_name":"Wagner"}],"article_processing_charge":"No","external_id":{"arxiv":["2003.13536"]},"title":"Barycentric cuts through a convex body","article_number":"62:1 - 62:16"},{"project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}],"article_number":"9:1 - 9:14","article_processing_charge":"No","external_id":{"arxiv":["1804.09317"]},"author":[{"id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","first_name":"Alan M","last_name":"Arroyo Guevara","full_name":"Arroyo Guevara, Alan M","orcid":"0000-0003-2401-8670"},{"first_name":"Julien","full_name":"Bensmail, Julien","last_name":"Bensmail"},{"last_name":"Bruce Richter","full_name":"Bruce Richter, R.","first_name":"R."}],"title":"Extending drawings of graphs to arrangements of pseudolines","citation":{"chicago":"Arroyo Guevara, Alan M, Julien Bensmail, and R. Bruce Richter. “Extending Drawings of Graphs to Arrangements of Pseudolines.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.9.","ista":"Arroyo Guevara AM, Bensmail J, Bruce Richter R. 2020. Extending drawings of graphs to arrangements of pseudolines. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 9:1-9:14.","mla":"Arroyo Guevara, Alan M., et al. “Extending Drawings of Graphs to Arrangements of Pseudolines.” 36th International Symposium on Computational Geometry, vol. 164, 9:1-9:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.9.","ama":"Arroyo Guevara AM, Bensmail J, Bruce Richter R. Extending drawings of graphs to arrangements of pseudolines. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.9","apa":"Arroyo Guevara, A. M., Bensmail, J., & Bruce Richter, R. (2020). Extending drawings of graphs to arrangements of pseudolines. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.9","ieee":"A. M. Arroyo Guevara, J. Bensmail, and R. Bruce Richter, “Extending drawings of graphs to arrangements of pseudolines,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164.","short":"A.M. Arroyo Guevara, J. Bensmail, R. Bruce Richter, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_created":"2020-06-22T09:14:21Z","doi":"10.4230/LIPIcs.SoCG.2020.9","date_published":"2020-06-01T00:00:00Z","year":"2020","has_accepted_license":"1","publication":"36th International Symposium on Computational Geometry","day":"01","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)"},"conference":{"end_date":"2020-06-26","location":"Zürich, Switzerland","start_date":"2020-06-22","name":"SoCG: Symposium on Computational Geometry"},"type":"conference","status":"public","_id":"7994","department":[{"_id":"UlWa"}],"file_date_updated":"2020-07-14T12:48:06Z","date_updated":"2023-02-23T13:22:12Z","ddc":["510"],"alternative_title":["LIPIcs"],"scopus_import":"1","intvolume":" 164","month":"06","abstract":[{"lang":"eng","text":"In the recent study of crossing numbers, drawings of graphs that can be extended to an arrangement of pseudolines (pseudolinear drawings) have played an important role as they are a natural combinatorial extension of rectilinear (or straight-line) drawings. A characterization of the pseudolinear drawings of K_n was found recently. We extend this characterization to all graphs, by describing the set of minimal forbidden subdrawings for pseudolinear drawings. Our characterization also leads to a polynomial-time algorithm to recognize pseudolinear drawings and construct the pseudolines when it is possible."}],"oa_version":"Published Version","ec_funded":1,"volume":164,"publication_status":"published","publication_identifier":{"isbn":["9783959771436"],"issn":["18688969"]},"language":[{"iso":"eng"}],"file":[{"file_id":"8006","checksum":"93571b76cf97d5b7c8aabaeaa694dd7e","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2020_LIPIcsSoCG_Arroyo.pdf","date_created":"2020-06-23T11:06:23Z","creator":"dernst","file_size":592661,"date_updated":"2020-07-14T12:48:06Z"}]},{"article_number":"022065","project":[{"name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control","grant_number":"850899","call_identifier":"H2020","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E"}],"citation":{"ieee":"A. Michailidis, C. J. Turner, Z. Papić, D. A. Abanin, and M. Serbyn, “Stabilizing two-dimensional quantum scars by deformation and synchronization,” Physical Review Research, vol. 2, no. 2. American Physical Society, 2020.","short":"A. Michailidis, C.J. Turner, Z. Papić, D.A. Abanin, M. Serbyn, Physical Review Research 2 (2020).","apa":"Michailidis, A., Turner, C. J., Papić, Z., Abanin, D. A., & Serbyn, M. (2020). Stabilizing two-dimensional quantum scars by deformation and synchronization. Physical Review Research. American Physical Society. https://doi.org/10.1103/physrevresearch.2.022065","ama":"Michailidis A, Turner CJ, Papić Z, Abanin DA, Serbyn M. Stabilizing two-dimensional quantum scars by deformation and synchronization. Physical Review Research. 2020;2(2). doi:10.1103/physrevresearch.2.022065","mla":"Michailidis, Alexios, et al. “Stabilizing Two-Dimensional Quantum Scars by Deformation and Synchronization.” Physical Review Research, vol. 2, no. 2, 022065, American Physical Society, 2020, doi:10.1103/physrevresearch.2.022065.","ista":"Michailidis A, Turner CJ, Papić Z, Abanin DA, Serbyn M. 2020. Stabilizing two-dimensional quantum scars by deformation and synchronization. Physical Review Research. 2(2), 022065.","chicago":"Michailidis, Alexios, C. J. Turner, Z. Papić, D. A. Abanin, and Maksym Serbyn. “Stabilizing Two-Dimensional Quantum Scars by Deformation and Synchronization.” Physical Review Research. American Physical Society, 2020. https://doi.org/10.1103/physrevresearch.2.022065."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Alexios","id":"36EBAD38-F248-11E8-B48F-1D18A9856A87","last_name":"Michailidis","full_name":"Michailidis, Alexios"},{"last_name":"Turner","full_name":"Turner, C. J.","first_name":"C. J."},{"first_name":"Z.","full_name":"Papić, Z.","last_name":"Papić"},{"first_name":"D. A.","full_name":"Abanin, D. A.","last_name":"Abanin"},{"first_name":"Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","last_name":"Serbyn","orcid":"0000-0002-2399-5827","full_name":"Serbyn, Maksym"}],"article_processing_charge":"No","title":"Stabilizing two-dimensional quantum scars by deformation and synchronization","publisher":"American Physical Society","quality_controlled":"1","oa":1,"has_accepted_license":"1","year":"2020","day":"22","publication":"Physical Review Research","doi":"10.1103/physrevresearch.2.022065","date_published":"2020-06-22T00:00:00Z","date_created":"2020-06-23T12:00:19Z","_id":"8011","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","date_updated":"2021-01-12T08:16:30Z","ddc":["530"],"department":[{"_id":"MaSe"}],"file_date_updated":"2020-07-14T12:48:08Z","abstract":[{"text":"Relaxation to a thermal state is the inevitable fate of nonequilibrium interacting quantum systems without special conservation laws. While thermalization in one-dimensional systems can often be suppressed by integrability mechanisms, in two spatial dimensions thermalization is expected to be far more effective due to the increased phase space. In this work we propose a general framework for escaping or delaying the emergence of the thermal state in two-dimensional arrays of Rydberg atoms via the mechanism of quantum scars, i.e., initial states that fail to thermalize. The suppression of thermalization is achieved in two complementary ways: by adding local perturbations or by adjusting the driving Rabi frequency according to the local connectivity of the lattice. We demonstrate that these mechanisms allow us to realize robust quantum scars in various two-dimensional lattices, including decorated lattices with nonconstant connectivity. In particular, we show that a small decrease of the Rabi frequency at the corners of the lattice is crucial for mitigating the strong boundary effects in two-dimensional systems. Our results identify synchronization as an important tool for future experiments on two-dimensional quantum scars.","lang":"eng"}],"oa_version":"Published Version","month":"06","intvolume":" 2","publication_identifier":{"issn":["2643-1564"]},"publication_status":"published","file":[{"file_size":2066011,"date_updated":"2020-07-14T12:48:08Z","creator":"dernst","file_name":"2020_PhysicalReviewResearch_Michailidis.pdf","date_created":"2020-06-29T14:41:27Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"8050","checksum":"e6959dc8220f14a008d1933858795e6d"}],"language":[{"iso":"eng"}],"issue":"2","volume":2,"ec_funded":1},{"ddc":["004"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"T. Anciukevicius, C. Lampert, P.M. Henderson, ArXiv (n.d.).","ieee":"T. Anciukevicius, C. Lampert, and P. M. Henderson, “Object-centric image generation with factored depths, locations, and appearances,” arXiv. .","ama":"Anciukevicius T, Lampert C, Henderson PM. Object-centric image generation with factored depths, locations, and appearances. arXiv.","apa":"Anciukevicius, T., Lampert, C., & Henderson, P. M. (n.d.). Object-centric image generation with factored depths, locations, and appearances. arXiv.","mla":"Anciukevicius, Titas, et al. “Object-Centric Image Generation with Factored Depths, Locations, and Appearances.” ArXiv, 2004.00642.","ista":"Anciukevicius T, Lampert C, Henderson PM. Object-centric image generation with factored depths, locations, and appearances. arXiv, 2004.00642.","chicago":"Anciukevicius, Titas, Christoph Lampert, and Paul M Henderson. “Object-Centric Image Generation with Factored Depths, Locations, and Appearances.” ArXiv, n.d."},"date_updated":"2021-01-12T08:16:44Z","department":[{"_id":"ChLa"}],"title":"Object-centric image generation with factored depths, locations, and appearances","author":[{"first_name":"Titas","full_name":"Anciukevicius, Titas","last_name":"Anciukevicius"},{"last_name":"Lampert","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"},{"id":"13C09E74-18D9-11E9-8878-32CFE5697425","first_name":"Paul M","orcid":"0000-0002-5198-7445","full_name":"Henderson, Paul M","last_name":"Henderson"}],"external_id":{"arxiv":["2004.00642"]},"article_processing_charge":"No","article_number":"2004.00642","_id":"8063","status":"public","type":"preprint","tmp":{"short":"CC BY-SA (4.0)","image":"/images/cc_by_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)"},"day":"01","language":[{"iso":"eng"}],"publication":"arXiv","publication_status":"submitted","year":"2020","date_published":"2020-04-01T00:00:00Z","date_created":"2020-06-29T23:55:23Z","license":"https://creativecommons.org/licenses/by-sa/4.0/","oa_version":"Preprint","abstract":[{"text":"We present a generative model of images that explicitly reasons over the set\r\nof objects they show. Our model learns a structured latent representation that\r\nseparates objects from each other and from the background; unlike prior works,\r\nit explicitly represents the 2D position and depth of each object, as well as\r\nan embedding of its segmentation mask and appearance. The model can be trained\r\nfrom images alone in a purely unsupervised fashion without the need for object\r\nmasks or depth information. Moreover, it always generates complete objects,\r\neven though a significant fraction of training images contain occlusions.\r\nFinally, we show that our model can infer decompositions of novel images into\r\ntheir constituent objects, including accurate prediction of depth ordering and\r\nsegmentation of occluded parts.","lang":"eng"}],"month":"04","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2004.00642"}]},{"file":[{"checksum":"6970d621984c03ebc2eee71adfe706dd","file_id":"8082","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"AM.pdf","date_created":"2020-07-02T20:21:59Z","file_size":1129852,"date_updated":"2020-07-14T12:48:09Z","creator":"sfreunbe"},{"date_created":"2020-07-08T12:14:04Z","file_name":"Supporting_Information.pdf","creator":"cziletti","date_updated":"2020-07-14T12:48:09Z","file_size":945565,"checksum":"cd74c7bd47d6e7163d54d67f074dcc36","file_id":"8102","access_level":"open_access","relation":"supplementary_material","content_type":"application/pdf"}],"day":"13","language":[{"iso":"eng"}],"has_accepted_license":"1","year":"2020","publication_status":"submitted","date_published":"2020-07-13T00:00:00Z","date_created":"2020-07-02T20:24:42Z","oa_version":"Submitted Version","acknowledgement":"The authors M.A.H., S.S., R.E., and W.B. acknowledge the industrial partners Sappi Gratkorn, Zellstoff Pöls and Mondi Frantschach, the Austrian Research Promotion Agency (FFG), COMET, BMVIT, BMWFJ, the Province of Styria and Carinthia for their financial support of the K-project Flippr²-Process Integration. E.M. and S.A.F. are indebted to the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement No 636069). W. T. and S. E. thank FWO (G.0C60.13N) and the European Union’s European Fund for Regional Development and Flanders Innovation & Entrepreneurship (Accelerate3 project, Interreg Vlaanderen-Nederland program) for financial support. W. T. also thanks the Provincie West-Vlaanderen (Belgium) for his Provincial Chair in Advanced Materials. S. B. thanks the European Regional Development Fund (EFRE) and the province of Upper Austria for financial support through the program IWB 2014-2020 (project BioCarb-K). AMR gratefully acknowledges funding support through the SC EPSCoR/IDeAProgram under Award #18-SR03, and the NASA EPSCoR Program under Award #NNH17ZHA002C. Icons in Scheme 1 were provided by Good Ware, monkik, photo3idea_studio, and OCHA from www.flaticon.com.","abstract":[{"text":"Here, we employ micro- and nanosized cellulose particles, namely paper fines and cellulose\r\nnanocrystals, to induce hierarchical organization over a wide length scale. After processing\r\nthem into carbonaceous materials, we demonstrate that these hierarchically organized materials\r\noutperform the best materials for supercapacitors operating with organic electrolytes reported\r\nin literature in terms of specific energy/power (Ragone plot) while showing hardly any capacity\r\nfade over 4,000 cycles. The highly porous materials feature a specific surface area as high as\r\n2500 m2ˑg-1 and exhibit pore sizes in the range of 0.5 to 200 nm as proven by scanning electron\r\nmicroscopy and N2 physisorption. The carbonaceous materials have been further investigated\r\nby X-ray photoelectron spectroscopy and RAMAN spectroscopy. Since paper fines are an\r\nunderutilized side stream in any paper production process, they are a cheap and highly available\r\nfeedstock to prepare carbonaceous materials with outstanding performance in electrochemical\r\napplications. ","lang":"eng"}],"month":"07","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["540"],"date_updated":"2022-06-17T08:39:49Z","citation":{"ista":"Hobisch MA, Mourad E, Fischer WJ, Prehal C, Eyley S, Childress A, Zankel A, Mautner A, Breitenbach S, Rao AM, Thielemans W, Freunberger SA, Eckhart R, Bauer W, Spirk S. High specific capacitance supercapacitors from hierarchically organized all-cellulose composites.","chicago":"Hobisch, Mathias A. , Eléonore Mourad, Wolfgang J. Fischer, Christian Prehal, Samuel Eyley, Anthony Childress, Armin Zankel, et al. “High Specific Capacitance Supercapacitors from Hierarchically Organized All-Cellulose Composites,” n.d.","short":"M.A. Hobisch, E. Mourad, W.J. Fischer, C. Prehal, S. Eyley, A. Childress, A. Zankel, A. Mautner, S. Breitenbach, A.M. Rao, W. Thielemans, S.A. Freunberger, R. Eckhart, W. Bauer, S. Spirk, (n.d.).","ieee":"M. A. Hobisch et al., “High specific capacitance supercapacitors from hierarchically organized all-cellulose composites.” .","apa":"Hobisch, M. A., Mourad, E., Fischer, W. J., Prehal, C., Eyley, S., Childress, A., … Spirk, S. (n.d.). High specific capacitance supercapacitors from hierarchically organized all-cellulose composites.","ama":"Hobisch MA, Mourad E, Fischer WJ, et al. High specific capacitance supercapacitors from hierarchically organized all-cellulose composites.","mla":"Hobisch, Mathias A., et al. High Specific Capacitance Supercapacitors from Hierarchically Organized All-Cellulose Composites."},"department":[{"_id":"StFr"}],"title":"High specific capacitance supercapacitors from hierarchically organized all-cellulose composites","file_date_updated":"2020-07-14T12:48:09Z","author":[{"last_name":"Hobisch","full_name":"Hobisch, Mathias A. ","first_name":"Mathias A. "},{"last_name":"Mourad","full_name":"Mourad, Eléonore ","first_name":"Eléonore "},{"last_name":"Fischer","full_name":"Fischer, Wolfgang J. ","first_name":"Wolfgang J. "},{"first_name":"Christian ","full_name":"Prehal, Christian ","last_name":"Prehal"},{"full_name":"Eyley, Samuel ","last_name":"Eyley","first_name":"Samuel "},{"first_name":"Anthony ","full_name":"Childress, Anthony ","last_name":"Childress"},{"full_name":"Zankel, Armin ","last_name":"Zankel","first_name":"Armin "},{"first_name":"Andreas ","last_name":"Mautner","full_name":"Mautner, Andreas "},{"full_name":"Breitenbach, Stefan ","last_name":"Breitenbach","first_name":"Stefan "},{"last_name":"Rao","full_name":"Rao, Apparao M. ","first_name":"Apparao M. "},{"first_name":"Wim ","full_name":"Thielemans, Wim ","last_name":"Thielemans"},{"first_name":"Stefan Alexander","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","last_name":"Freunberger","full_name":"Freunberger, Stefan Alexander","orcid":"0000-0003-2902-5319"},{"last_name":"Eckhart","full_name":"Eckhart, Rene ","first_name":"Rene "},{"full_name":"Bauer, Wolfgang ","last_name":"Bauer","first_name":"Wolfgang "},{"full_name":"Spirk, Stefan ","last_name":"Spirk","first_name":"Stefan "}],"article_processing_charge":"No","_id":"8081","status":"public","type":"preprint"},{"status":"public","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)"},"_id":"8105","file_date_updated":"2020-07-22T06:17:11Z","department":[{"_id":"GaTk"}],"ddc":["530"],"date_updated":"2021-01-12T08:16:55Z","month":"03","intvolume":" 230","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Physical and biological systems often exhibit intermittent dynamics with bursts or avalanches (active states) characterized by power-law size and duration distributions. These emergent features are typical of systems at the critical point of continuous phase transitions, and have led to the hypothesis that such systems may self-organize at criticality, i.e. without any fine tuning of parameters. Since the introduction of the Bak-Tang-Wiesenfeld (BTW) model, the paradigm of self-organized criticality (SOC) has been very fruitful for the analysis of emergent collective behaviors in a number of systems, including the brain. Although considerable effort has been devoted in identifying and modeling scaling features of burst and avalanche statistics, dynamical aspects related to the temporal organization of bursts remain often poorly understood or controversial. Of crucial importance to understand the mechanisms responsible for emergent behaviors is the relationship between active and quiet periods, and the nature of the correlations. Here we investigate the dynamics of active (θ-bursts) and quiet states (δ-bursts) in brain activity during the sleep-wake cycle. We show the duality of power-law (θ, active phase) and exponential-like (δ, quiescent phase) duration distributions, typical of SOC, jointly emerge with power-law temporal correlations and anti-correlated coupling between active and quiet states. Importantly, we demonstrate that such temporal organization shares important similarities with earthquake dynamics, and propose that specific power-law correlations and coupling between active and quiet states are distinctive characteristics of a class of systems with self-organization at criticality."}],"volume":230,"file":[{"file_id":"8144","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2020-07-22T06:17:11Z","file_name":"2020_EPJWebConf_Lombardi.pdf","creator":"dernst","date_updated":"2020-07-22T06:17:11Z","file_size":2197543}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2100-014X"]},"publication_status":"published","article_number":"00005","title":"Power-law correlations and coupling of active and quiet states underlie a class of complex systems with self-organization at criticality","author":[{"orcid":"0000-0003-2623-5249","full_name":"Lombardi, Fabrizio","last_name":"Lombardi","id":"A057D288-3E88-11E9-986D-0CF4E5697425","first_name":"Fabrizio"},{"first_name":"Jilin W.J.L.","full_name":"Wang, Jilin W.J.L.","last_name":"Wang"},{"first_name":"Xiyun","last_name":"Zhang","full_name":"Zhang, Xiyun"},{"first_name":"Plamen Ch","last_name":"Ivanov","full_name":"Ivanov, Plamen Ch"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Lombardi F, Wang JWJL, Zhang X, Ivanov PC. 2020. Power-law correlations and coupling of active and quiet states underlie a class of complex systems with self-organization at criticality. EPJ Web of Conferences. 230, 00005.","chicago":"Lombardi, Fabrizio, Jilin W.J.L. Wang, Xiyun Zhang, and Plamen Ch Ivanov. “Power-Law Correlations and Coupling of Active and Quiet States Underlie a Class of Complex Systems with Self-Organization at Criticality.” EPJ Web of Conferences. EDP Sciences, 2020. https://doi.org/10.1051/epjconf/202023000005.","ama":"Lombardi F, Wang JWJL, Zhang X, Ivanov PC. Power-law correlations and coupling of active and quiet states underlie a class of complex systems with self-organization at criticality. EPJ Web of Conferences. 2020;230. doi:10.1051/epjconf/202023000005","apa":"Lombardi, F., Wang, J. W. J. L., Zhang, X., & Ivanov, P. C. (2020). Power-law correlations and coupling of active and quiet states underlie a class of complex systems with self-organization at criticality. EPJ Web of Conferences. EDP Sciences. https://doi.org/10.1051/epjconf/202023000005","ieee":"F. Lombardi, J. W. J. L. Wang, X. Zhang, and P. C. Ivanov, “Power-law correlations and coupling of active and quiet states underlie a class of complex systems with self-organization at criticality,” EPJ Web of Conferences, vol. 230. EDP Sciences, 2020.","short":"F. Lombardi, J.W.J.L. Wang, X. Zhang, P.C. Ivanov, EPJ Web of Conferences 230 (2020).","mla":"Lombardi, Fabrizio, et al. “Power-Law Correlations and Coupling of Active and Quiet States Underlie a Class of Complex Systems with Self-Organization at Criticality.” EPJ Web of Conferences, vol. 230, 00005, EDP Sciences, 2020, doi:10.1051/epjconf/202023000005."},"quality_controlled":"1","publisher":"EDP Sciences","oa":1,"date_published":"2020-03-11T00:00:00Z","doi":"10.1051/epjconf/202023000005","date_created":"2020-07-12T16:20:33Z","day":"11","publication":"EPJ Web of Conferences","has_accepted_license":"1","year":"2020"},{"language":[{"iso":"eng"}],"file":[{"success":1,"checksum":"7b5e0de10675d787a2ddb2091370b8d8","file_id":"8628","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2020-B-01-PoissonExperimentalSurvey.pdf","date_created":"2020-10-08T08:56:14Z","creator":"dernst","file_size":2207071,"date_updated":"2020-10-08T08:56:14Z"}],"publication_status":"published","publication_identifier":{"eissn":["21978549"],"isbn":["9783030434076"],"issn":["21932808"]},"ec_funded":1,"volume":15,"oa_version":"Submitted Version","abstract":[{"text":"Discrete Morse theory has recently lead to new developments in the theory of random geometric complexes. This article surveys the methods and results obtained with this new approach, and discusses some of its shortcomings. It uses simulations to illustrate the results and to form conjectures, getting numerical estimates for combinatorial, topological, and geometric properties of weighted and unweighted Delaunay mosaics, their dual Voronoi tessellations, and the Alpha and Wrap complexes contained in the mosaics.","lang":"eng"}],"intvolume":" 15","month":"06","scopus_import":"1","alternative_title":["Abel Symposia"],"ddc":["510"],"date_updated":"2021-01-12T08:17:06Z","department":[{"_id":"HeEd"}],"file_date_updated":"2020-10-08T08:56:14Z","_id":"8135","status":"public","type":"conference","publication":"Topological Data Analysis","day":"22","year":"2020","has_accepted_license":"1","date_created":"2020-07-19T22:00:59Z","doi":"10.1007/978-3-030-43408-3_8","date_published":"2020-06-22T00:00:00Z","page":"181-218","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreements No 78818 Alpha and No 638176). It is also partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF).","oa":1,"quality_controlled":"1","publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Edelsbrunner, Herbert, Anton Nikitenko, Katharina Ölsböck, and Peter Synak. “Radius Functions on Poisson–Delaunay Mosaics and Related Complexes Experimentally.” In Topological Data Analysis, 15:181–218. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-43408-3_8.","ista":"Edelsbrunner H, Nikitenko A, Ölsböck K, Synak P. 2020. Radius functions on Poisson–Delaunay mosaics and related complexes experimentally. Topological Data Analysis. , Abel Symposia, vol. 15, 181–218.","mla":"Edelsbrunner, Herbert, et al. “Radius Functions on Poisson–Delaunay Mosaics and Related Complexes Experimentally.” Topological Data Analysis, vol. 15, Springer Nature, 2020, pp. 181–218, doi:10.1007/978-3-030-43408-3_8.","apa":"Edelsbrunner, H., Nikitenko, A., Ölsböck, K., & Synak, P. (2020). Radius functions on Poisson–Delaunay mosaics and related complexes experimentally. In Topological Data Analysis (Vol. 15, pp. 181–218). Springer Nature. https://doi.org/10.1007/978-3-030-43408-3_8","ama":"Edelsbrunner H, Nikitenko A, Ölsböck K, Synak P. Radius functions on Poisson–Delaunay mosaics and related complexes experimentally. In: Topological Data Analysis. Vol 15. Springer Nature; 2020:181-218. doi:10.1007/978-3-030-43408-3_8","short":"H. Edelsbrunner, A. Nikitenko, K. Ölsböck, P. Synak, in:, Topological Data Analysis, Springer Nature, 2020, pp. 181–218.","ieee":"H. Edelsbrunner, A. Nikitenko, K. Ölsböck, and P. Synak, “Radius functions on Poisson–Delaunay mosaics and related complexes experimentally,” in Topological Data Analysis, 2020, vol. 15, pp. 181–218."},"title":"Radius functions on Poisson–Delaunay mosaics and related complexes experimentally","article_processing_charge":"No","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"full_name":"Nikitenko, Anton","last_name":"Nikitenko","first_name":"Anton","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87"},{"id":"4D4AA390-F248-11E8-B48F-1D18A9856A87","first_name":"Katharina","full_name":"Ölsböck, Katharina","last_name":"Ölsböck"},{"full_name":"Synak, Peter","last_name":"Synak","id":"331776E2-F248-11E8-B48F-1D18A9856A87","first_name":"Peter"}],"project":[{"name":"Alpha Shape Theory Extended","grant_number":"788183","call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"_id":"2533E772-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"638176","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales"},{"name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}]},{"status":"public","type":"report","_id":"8151","file_date_updated":"2020-07-22T14:45:07Z","title":"Core Project Proceedings","article_processing_charge":"No","author":[{"full_name":"Maslov, Mikhail","orcid":"0000-0003-4074-2570","last_name":"Maslov","first_name":"Mikhail","id":"2E65BB0E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kondrashov","orcid":"0000-0001-8243-4694","full_name":"Kondrashov, Fyodor","first_name":"Fyodor","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Artner, Christina","last_name":"Artner","id":"45DF286A-F248-11E8-B48F-1D18A9856A87","first_name":"Christina"},{"full_name":"Hennessey-Wesen, Mike","last_name":"Hennessey-Wesen","id":"3F338C72-F248-11E8-B48F-1D18A9856A87","first_name":"Mike"},{"id":"350F91D2-F248-11E8-B48F-1D18A9856A87","first_name":"Bor","last_name":"Kavcic","orcid":"0000-0001-6041-254X","full_name":"Kavcic, Bor"},{"id":"3591A0AA-F248-11E8-B48F-1D18A9856A87","first_name":"Nick N","last_name":"Machnik","full_name":"Machnik, Nick N"},{"full_name":"Satapathy, Roshan K","last_name":"Satapathy","id":"46046B7A-F248-11E8-B48F-1D18A9856A87","first_name":"Roshan K"},{"last_name":"Tomanek","orcid":"0000-0001-6197-363X","full_name":"Tomanek, Isabella","id":"3981F020-F248-11E8-B48F-1D18A9856A87","first_name":"Isabella"}],"ddc":["510","530","570"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","citation":{"ieee":"M. Maslov et al., Core Project Proceedings. IST Austria, 2020.","short":"M. Maslov, F. Kondrashov, C. Artner, M. Hennessey-Wesen, B. Kavcic, N.N. Machnik, R.K. Satapathy, I. Tomanek, Core Project Proceedings, IST Austria, 2020.","ama":"Maslov M, Kondrashov F, Artner C, et al. Core Project Proceedings. IST Austria; 2020.","apa":"Maslov, M., Kondrashov, F., Artner, C., Hennessey-Wesen, M., Kavcic, B., Machnik, N. N., … Tomanek, I. (2020). Core Project Proceedings. IST Austria.","mla":"Maslov, Mikhail, et al. Core Project Proceedings. IST Austria, 2020.","ista":"Maslov M, Kondrashov F, Artner C, Hennessey-Wesen M, Kavcic B, Machnik NN, Satapathy RK, Tomanek I. 2020. Core Project Proceedings, IST Austria, 425p.","chicago":"Maslov, Mikhail, Fyodor Kondrashov, Christina Artner, Mike Hennessey-Wesen, Bor Kavcic, Nick N Machnik, Roshan K Satapathy, and Isabella Tomanek. Core Project Proceedings. IST Austria, 2020."},"date_updated":"2023-02-23T13:26:00Z","month":"06","publisher":"IST Austria","oa_version":"None","abstract":[{"lang":"eng","text":"The main idea behind the Core Project is to teach first year students at IST scientific communication skills and let them practice by presenting their research within an interdisciplinary environment. Over the course of the first semester, students participated in seminars, where they shared their results with the colleagues from other fields and took part in discussions on relevant subjects. The main focus during this sessions was on delivering the information in a simplified and comprehensible way, going into the very basics of a subject if necessary. At the end, the students were asked to present their research in the written form to exercise their writing skills. The reports were gathered in this document. All of them were reviewed by the teaching assistants and write-ups illustrating unique stylistic features and, in general, an outstanding level of writing skills, were honorably mentioned in the section \"Selected Reports\"."}],"date_created":"2020-07-22T14:48:14Z","date_published":"2020-06-01T00:00:00Z","page":"425","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","access_level":"local","relation":"main_file","file_id":"8152","date_updated":"2020-07-22T14:45:07Z","file_size":169620437,"creator":"dernst","date_created":"2020-07-22T14:45:07Z","file_name":"Core_Project_Proceedings_mod.pdf"}],"day":"01","publication_status":"published","year":"2020","has_accepted_license":"1"},{"title":"Design and application of light-regulated receptor tyrosine kinases","editor":[{"first_name":"Dominik","full_name":"Niopek, Dominik","last_name":"Niopek"}],"department":[{"_id":"CaGu"}],"author":[{"first_name":"Stephanie","id":"32CFBA64-F248-11E8-B48F-1D18A9856A87","last_name":"Kainrath","full_name":"Kainrath, Stephanie"},{"full_name":"Janovjak, Harald L","orcid":"0000-0002-8023-9315","last_name":"Janovjak","first_name":"Harald L","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Kainrath, Stephanie, and Harald L. Janovjak. “Design and Application of Light-Regulated Receptor Tyrosine Kinases.” Photoswitching Proteins, edited by Dominik Niopek, vol. 2173, Springer Nature, 2020, pp. 233–46, doi:10.1007/978-1-0716-0755-8_16.","short":"S. Kainrath, H.L. Janovjak, in:, D. Niopek (Ed.), Photoswitching Proteins, Springer Nature, 2020, pp. 233–246.","ieee":"S. Kainrath and H. L. Janovjak, “Design and application of light-regulated receptor tyrosine kinases,” in Photoswitching Proteins, vol. 2173, D. Niopek, Ed. Springer Nature, 2020, pp. 233–246.","ama":"Kainrath S, Janovjak HL. Design and application of light-regulated receptor tyrosine kinases. In: Niopek D, ed. Photoswitching Proteins. Vol 2173. MIMB. Springer Nature; 2020:233-246. doi:10.1007/978-1-0716-0755-8_16","apa":"Kainrath, S., & Janovjak, H. L. (2020). Design and application of light-regulated receptor tyrosine kinases. In D. Niopek (Ed.), Photoswitching Proteins (Vol. 2173, pp. 233–246). Springer Nature. https://doi.org/10.1007/978-1-0716-0755-8_16","chicago":"Kainrath, Stephanie, and Harald L Janovjak. “Design and Application of Light-Regulated Receptor Tyrosine Kinases.” In Photoswitching Proteins, edited by Dominik Niopek, 2173:233–46. MIMB. Springer Nature, 2020. https://doi.org/10.1007/978-1-0716-0755-8_16.","ista":"Kainrath S, Janovjak HL. 2020.Design and application of light-regulated receptor tyrosine kinases. In: Photoswitching Proteins. Methods in Molecular Biology, vol. 2173, 233–246."},"date_updated":"2021-01-12T08:17:17Z","status":"public","type":"book_chapter","_id":"8173","series_title":"MIMB","volume":2173,"date_published":"2020-07-11T00:00:00Z","doi":"10.1007/978-1-0716-0755-8_16","date_created":"2020-07-26T22:01:03Z","page":"233-246","day":"11","publication":"Photoswitching Proteins","language":[{"iso":"eng"}],"publication_identifier":{"eisbn":["9781071607558"],"eissn":["19406029"]},"year":"2020","publication_status":"published","month":"07","intvolume":" 2173","publisher":"Springer Nature","alternative_title":["Methods in Molecular Biology"],"scopus_import":"1","oa_version":"None","abstract":[{"lang":"eng","text":"Understanding how the activity of membrane receptors and cellular signaling pathways shapes cell behavior is of fundamental interest in basic and applied research. Reengineering receptors to react to light instead of their cognate ligands allows for generating defined signaling inputs with high spatial and temporal precision and facilitates the dissection of complex signaling networks. Here, we describe fundamental considerations in the design of light-regulated receptor tyrosine kinases (Opto-RTKs) and appropriate control experiments. We also introduce methods for transient receptor expression in HEK293 cells, quantitative assessment of signaling activity in reporter gene assays, semiquantitative assessment of (in)activation time courses through Western blot (WB) analysis, and easy to implement light stimulation hardware."}]},{"date_published":"2020-08-24T00:00:00Z","doi":"10.15479/AT:ISTA:8181","license":"https://opensource.org/licenses/BSD-3-Clause","date_created":"2020-07-28T16:24:37Z","file":[{"date_created":"2020-08-24T15:43:49Z","file_name":"centriolesDistance.m","creator":"rhauschild","date_updated":"2020-08-24T15:43:49Z","file_size":6577,"file_id":"8290","checksum":"878c60885ce30afb59a884dd5eef451c","success":1,"access_level":"open_access","relation":"main_file","content_type":"text/plain"},{"relation":"main_file","access_level":"open_access","content_type":"text/plain","success":1,"checksum":"5a93ac7be2b66b28e4bd8b113ee6aade","file_id":"8291","creator":"rhauschild","file_size":2680,"date_updated":"2020-08-24T15:43:52Z","file_name":"goTracking.m","date_created":"2020-08-24T15:43:52Z"}],"day":"24","has_accepted_license":"1","year":"2020","month":"08","publisher":"IST Austria","oa":1,"file_date_updated":"2020-08-24T15:43:52Z","title":"Amplified centrosomes in dendritic cells promote immune cell effector functions","department":[{"_id":"Bio"}],"author":[{"first_name":"Robert","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","full_name":"Hauschild, Robert","orcid":"0000-0001-9843-3522","last_name":"Hauschild"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Hauschild R. 2020. Amplified centrosomes in dendritic cells promote immune cell effector functions, IST Austria, 10.15479/AT:ISTA:8181.","chicago":"Hauschild, Robert. “Amplified Centrosomes in Dendritic Cells Promote Immune Cell Effector Functions.” IST Austria, 2020. https://doi.org/10.15479/AT:ISTA:8181.","apa":"Hauschild, R. (2020). Amplified centrosomes in dendritic cells promote immune cell effector functions. IST Austria. https://doi.org/10.15479/AT:ISTA:8181","ama":"Hauschild R. Amplified centrosomes in dendritic cells promote immune cell effector functions. 2020. doi:10.15479/AT:ISTA:8181","short":"R. Hauschild, (2020).","ieee":"R. Hauschild, “Amplified centrosomes in dendritic cells promote immune cell effector functions.” IST Austria, 2020.","mla":"Hauschild, Robert. Amplified Centrosomes in Dendritic Cells Promote Immune Cell Effector Functions. IST Austria, 2020, doi:10.15479/AT:ISTA:8181."},"date_updated":"2021-01-11T15:29:08Z","status":"public","type":"software","tmp":{"short":"3-Clause BSD","legal_code_url":"https://opensource.org/licenses/BSD-3-Clause","name":"The 3-Clause BSD License"},"_id":"8181"},{"pmid":1,"oa_version":"Published Version","abstract":[{"text":"Birch pollen allergy is among the most prevalent pollen allergies in Northern and Central Europe. This IgE-mediated disease can be treated with allergen immunotherapy (AIT), which typically gives rise to IgG antibodies inducing tolerance. Although the main mechanisms of allergen immunotherapy (AIT) are known, questions regarding possible Fc-mediated effects of IgG antibodies remain unanswered. This can mainly be attributed to the unavailability of appropriate tools, i.e., well-characterised recombinant antibodies (rAbs). We hereby aimed at providing human rAbs of several classes for mechanistic studies and as possible candidates for passive immunotherapy. We engineered IgE, IgG1, and IgG4 sharing the same variable region against the major birch pollen allergen Bet v 1 using Polymerase Incomplete Primer Extension (PIPE) cloning. We tested IgE functionality and IgG blocking capabilities using appropriate model cell lines. In vitro studies showed IgE engagement with FcεRI and CD23 and Bet v 1-dependent degranulation. Overall, we hereby present fully functional, human IgE, IgG1, and IgG4 sharing the same variable region against Bet v 1 and showcase possible applications in first mechanistic studies. Furthermore, our IgG antibodies might be useful candidates for passive immunotherapy of birch pollen allergy.","lang":"eng"}],"month":"08","intvolume":" 21","file":[{"file_id":"8356","checksum":"dac7ccef7cdcea9be292664d8c488425","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2020-09-10T07:06:22Z","file_name":"2020_IntMolecSciences_Koehler.pdf","date_updated":"2020-09-10T07:06:22Z","file_size":2680908,"creator":"dernst"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1422-0067"]},"publication_status":"published","issue":"16","volume":21,"_id":"8225","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)"},"extern":"1","ddc":["570"],"date_updated":"2021-01-12T08:17:34Z","file_date_updated":"2020-09-10T07:06:22Z","publisher":"MDPI","quality_controlled":"1","oa":1,"day":"08","publication":"International Journal of Molecular Sciences","has_accepted_license":"1","year":"2020","doi":"10.3390/ijms21165693","date_published":"2020-08-08T00:00:00Z","date_created":"2020-08-10T11:47:29Z","article_number":"5693","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Köhler, Verena K., et al. “Filling the Antibody Pipeline in Allergy: PIPE Cloning of IgE, IgG1 and IgG4 against the Major Birch Pollen Allergen Bet v 1.” International Journal of Molecular Sciences, vol. 21, no. 16, 5693, MDPI, 2020, doi:10.3390/ijms21165693.","ieee":"V. K. Köhler et al., “Filling the antibody pipeline in allergy: PIPE cloning of IgE, IgG1 and IgG4 against the major birch pollen allergen Bet v 1,” International Journal of Molecular Sciences, vol. 21, no. 16. MDPI, 2020.","short":"V.K. Köhler, S. Crescioli, J. Singer, H.J. Bax, G. Hofer, C.L. Pranger, K. Hufnagl, R. Bianchini, S. Flicker, W. Keller, S.N. Karagiannis, E. Jensen-Jarolim, International Journal of Molecular Sciences 21 (2020).","apa":"Köhler, V. K., Crescioli, S., Singer, J., Bax, H. J., Hofer, G., Pranger, C. L., … Jensen-Jarolim, E. (2020). Filling the antibody pipeline in allergy: PIPE cloning of IgE, IgG1 and IgG4 against the major birch pollen allergen Bet v 1. International Journal of Molecular Sciences. MDPI. https://doi.org/10.3390/ijms21165693","ama":"Köhler VK, Crescioli S, Singer J, et al. Filling the antibody pipeline in allergy: PIPE cloning of IgE, IgG1 and IgG4 against the major birch pollen allergen Bet v 1. International Journal of Molecular Sciences. 2020;21(16). doi:10.3390/ijms21165693","chicago":"Köhler, Verena K., Silvia Crescioli, Judit Singer, Heather J. Bax, Gerhard Hofer, Christina L. Pranger, Karin Hufnagl, et al. “Filling the Antibody Pipeline in Allergy: PIPE Cloning of IgE, IgG1 and IgG4 against the Major Birch Pollen Allergen Bet v 1.” International Journal of Molecular Sciences. MDPI, 2020. https://doi.org/10.3390/ijms21165693.","ista":"Köhler VK, Crescioli S, Singer J, Bax HJ, Hofer G, Pranger CL, Hufnagl K, Bianchini R, Flicker S, Keller W, Karagiannis SN, Jensen-Jarolim E. 2020. Filling the antibody pipeline in allergy: PIPE cloning of IgE, IgG1 and IgG4 against the major birch pollen allergen Bet v 1. International Journal of Molecular Sciences. 21(16), 5693."},"title":"Filling the antibody pipeline in allergy: PIPE cloning of IgE, IgG1 and IgG4 against the major birch pollen allergen Bet v 1","author":[{"last_name":"Köhler","full_name":"Köhler, Verena K.","orcid":"0000-0001-5581-398X","first_name":"Verena K."},{"orcid":"0000-0002-1909-5957","full_name":"Crescioli, Silvia","last_name":"Crescioli","first_name":"Silvia"},{"id":"36432834-F248-11E8-B48F-1D18A9856A87","first_name":"Judit","last_name":"Fazekas-Singer","full_name":"Fazekas-Singer, Judit","orcid":"0000-0002-8777-3502"},{"last_name":"Bax","orcid":"0000-0003-0432-4160","full_name":"Bax, Heather J.","first_name":"Heather J."},{"first_name":"Gerhard","last_name":"Hofer","full_name":"Hofer, Gerhard"},{"first_name":"Christina L.","last_name":"Pranger","full_name":"Pranger, Christina L."},{"first_name":"Karin","full_name":"Hufnagl, Karin","last_name":"Hufnagl"},{"full_name":"Bianchini, Rodolfo","orcid":"0000-0003-0351-6937","last_name":"Bianchini","first_name":"Rodolfo"},{"first_name":"Sabine","orcid":"0000-0003-4768-8693","full_name":"Flicker, Sabine","last_name":"Flicker"},{"first_name":"Walter","last_name":"Keller","orcid":"0000-0002-2261-958X","full_name":"Keller, Walter"},{"first_name":"Sophia N.","last_name":"Karagiannis","orcid":"0000-0002-4100-7810","full_name":"Karagiannis, Sophia N."},{"full_name":"Jensen-Jarolim, Erika","orcid":"0000-0003-4019-5765","last_name":"Jensen-Jarolim","first_name":"Erika"}],"article_processing_charge":"No","external_id":{"pmid":["32784509"]}},{"_id":"8226","status":"public","article_type":"letter_note","type":"journal_article","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Gotovina, Jelena, Rodolfo Bianchini, Judit Singer, Ina Herrmann, Giulia Pellizzari, Ian D. Haidl, Karin Hufnagl, Sophia N. Karagiannis, Jean S. Marshall, and Erika Jensen‐Jarolim. “Epinephrine Drives Human M2a Allergic Macrophages to a Regulatory Phenotype Reducing Mast Cell Degranulation in Vitro.” Allergy. Wiley, 2020. https://doi.org/10.1111/all.14299.","ista":"Gotovina J, Bianchini R, Singer J, Herrmann I, Pellizzari G, Haidl ID, Hufnagl K, Karagiannis SN, Marshall JS, Jensen‐Jarolim E. 2020. Epinephrine drives human M2a allergic macrophages to a regulatory phenotype reducing mast cell degranulation in vitro. Allergy.","mla":"Gotovina, Jelena, et al. “Epinephrine Drives Human M2a Allergic Macrophages to a Regulatory Phenotype Reducing Mast Cell Degranulation in Vitro.” Allergy, Wiley, 2020, doi:10.1111/all.14299.","apa":"Gotovina, J., Bianchini, R., Singer, J., Herrmann, I., Pellizzari, G., Haidl, I. D., … Jensen‐Jarolim, E. (2020). Epinephrine drives human M2a allergic macrophages to a regulatory phenotype reducing mast cell degranulation in vitro. Allergy. Wiley. https://doi.org/10.1111/all.14299","ama":"Gotovina J, Bianchini R, Singer J, et al. Epinephrine drives human M2a allergic macrophages to a regulatory phenotype reducing mast cell degranulation in vitro. Allergy. 2020. doi:10.1111/all.14299","ieee":"J. Gotovina et al., “Epinephrine drives human M2a allergic macrophages to a regulatory phenotype reducing mast cell degranulation in vitro,” Allergy. Wiley, 2020.","short":"J. Gotovina, R. Bianchini, J. Singer, I. Herrmann, G. Pellizzari, I.D. Haidl, K. Hufnagl, S.N. Karagiannis, J.S. Marshall, E. Jensen‐Jarolim, Allergy (2020)."},"date_updated":"2021-01-12T08:17:35Z","title":"Epinephrine drives human M2a allergic macrophages to a regulatory phenotype reducing mast cell degranulation in vitro","author":[{"orcid":"0000-0003-1503-5276","full_name":"Gotovina, Jelena","last_name":"Gotovina","first_name":"Jelena"},{"orcid":"0000-0003-0351-6937","full_name":"Bianchini, Rodolfo","last_name":"Bianchini","first_name":"Rodolfo"},{"last_name":"Fazekas-Singer","full_name":"Fazekas-Singer, Judit","orcid":"0000-0002-8777-3502","first_name":"Judit","id":"36432834-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ina","last_name":"Herrmann","orcid":"0000-0003-2772-9144","full_name":"Herrmann, Ina"},{"full_name":"Pellizzari, Giulia","orcid":"0000-0003-0387-1912","last_name":"Pellizzari","first_name":"Giulia"},{"first_name":"Ian D.","last_name":"Haidl","full_name":"Haidl, Ian D.","orcid":"0000-0002-5301-0822"},{"last_name":"Hufnagl","full_name":"Hufnagl, Karin","orcid":"0000-0002-2288-2468","first_name":"Karin"},{"first_name":"Sophia N.","orcid":"0000-0002-4100-7810","full_name":"Karagiannis, Sophia N.","last_name":"Karagiannis"},{"first_name":"Jean S.","last_name":"Marshall","orcid":"0000-0002-5642-1379","full_name":"Marshall, Jean S."},{"last_name":"Jensen‐Jarolim","full_name":"Jensen‐Jarolim, Erika","orcid":"0000-0003-4019-5765","first_name":"Erika"}],"article_processing_charge":"No","oa_version":"Published Version","month":"04","quality_controlled":"1","publisher":"Wiley","oa":1,"main_file_link":[{"url":"https://doi.org/10.1111/all.14299","open_access":"1"}],"day":"04","language":[{"iso":"eng"}],"publication":"Allergy","publication_identifier":{"issn":["0105-4538","1398-9995"]},"year":"2020","publication_status":"epub_ahead","date_published":"2020-04-04T00:00:00Z","doi":"10.1111/all.14299","date_created":"2020-08-10T11:50:30Z"},{"has_accepted_license":"1","year":"2020","day":"10","file":[{"creator":"rhauschild","file_size":882,"date_updated":"2020-09-08T14:26:31Z","file_name":"readme.txt","date_created":"2020-09-08T14:26:31Z","relation":"main_file","access_level":"open_access","content_type":"text/plain","success":1,"checksum":"108352149987ac6f066e4925bd56e35e","file_id":"8346"},{"content_type":"application/octet-stream","access_level":"open_access","relation":"main_file","checksum":"ffd6c643b28e0cc7c6d0060a18a7e8ea","file_id":"8347","success":1,"date_updated":"2020-09-08T14:26:33Z","file_size":246121,"creator":"rhauschild","date_created":"2020-09-08T14:26:33Z","file_name":"RGtracker.mlappinstall"}],"doi":"10.15479/AT:ISTA:8294","date_published":"2020-09-10T00:00:00Z","date_created":"2020-08-25T12:52:48Z","abstract":[{"text":"Automated root growth analysis and tracking of root tips. ","lang":"eng"}],"publisher":"IST Austria","oa":1,"month":"09","citation":{"chicago":"Hauschild, Robert. “RGtracker.” IST Austria, 2020. https://doi.org/10.15479/AT:ISTA:8294.","ista":"Hauschild R. 2020. RGtracker, IST Austria, 10.15479/AT:ISTA:8294.","mla":"Hauschild, Robert. RGtracker. IST Austria, 2020, doi:10.15479/AT:ISTA:8294.","apa":"Hauschild, R. (2020). RGtracker. IST Austria. https://doi.org/10.15479/AT:ISTA:8294","ama":"Hauschild R. RGtracker. 2020. doi:10.15479/AT:ISTA:8294","ieee":"R. Hauschild, “RGtracker.” IST Austria, 2020.","short":"R. Hauschild, (2020)."},"date_updated":"2021-01-12T08:17:56Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["570"],"author":[{"orcid":"0000-0001-9843-3522","full_name":"Hauschild, Robert","last_name":"Hauschild","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"}],"department":[{"_id":"Bio"}],"title":"RGtracker","file_date_updated":"2020-09-08T14:26:33Z","_id":"8294","type":"software","tmp":{"short":"3-Clause BSD","legal_code_url":"https://opensource.org/licenses/BSD-3-Clause","name":"The 3-Clause BSD License"},"status":"public"},{"date_published":"2020-07-03T00:00:00Z","date_created":"2020-08-26T12:32:10Z","publication_status":"submitted","year":"2020","day":"03","language":[{"iso":"eng"}],"publication":"arXiv","main_file_link":[{"url":"https://arxiv.org/abs/2007.01560","open_access":"1"}],"oa":1,"month":"07","abstract":[{"lang":"eng","text":"Classic Byzantine fault-tolerant consensus protocols forfeit liveness in the face of asynchrony in order to preserve safety, whereas most deployed blockchain protocols forfeit safety in order to remain live. In this work, we achieve the best of both worlds by proposing a novel abstractions called the finality gadget. A finality gadget allows for transactions to always optimistically commit but informs the clients that these transactions might be unsafe. As a result, a blockchain can execute transactions optimistically and only commit them after they have been sufficiently and provably audited. In\r\nthis work, we formally model the finality gadget abstraction, prove that it is impossible to solve it deterministically in full asynchrony (even though it is stronger than consensus) and provide a partially synchronous protocol which is currently securing a major blockchain. This way we show that the protocol designer can decouple safety and liveness in order to speed up recovery from failures. We believe that there can be other types of finality gadgets that provide weaker safety (e.g., probabilistic) in order to gain more efficiency and this can depend on the probability that the network is not in synchrony."}],"oa_version":"Preprint","author":[{"first_name":"Alistair","last_name":"Stewart","full_name":"Stewart, Alistair"},{"last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios"}],"external_id":{"arxiv":["2007.01560"]},"article_processing_charge":"No","title":"GRANDPA: A Byzantine finality gadget","citation":{"chicago":"Stewart, Alistair, and Eleftherios Kokoris Kogias. “GRANDPA: A Byzantine Finality Gadget.” ArXiv, n.d.","ista":"Stewart A, Kokoris Kogias E. GRANDPA: A Byzantine finality gadget. arXiv, 2007.01560.","mla":"Stewart, Alistair, and Eleftherios Kokoris Kogias. “GRANDPA: A Byzantine Finality Gadget.” ArXiv, 2007.01560.","ama":"Stewart A, Kokoris Kogias E. GRANDPA: A Byzantine finality gadget. arXiv.","apa":"Stewart, A., & Kokoris Kogias, E. (n.d.). GRANDPA: A Byzantine finality gadget. arXiv.","short":"A. Stewart, E. Kokoris Kogias, ArXiv (n.d.).","ieee":"A. Stewart and E. Kokoris Kogias, “GRANDPA: A Byzantine finality gadget,” arXiv. ."},"date_updated":"2021-01-12T08:18:02Z","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"preprint","status":"public","_id":"8307","article_number":"2007.01560"},{"date_published":"2020-08-10T00:00:00Z","doi":"10.1007/978-3-030-56880-1_26","date_created":"2020-08-30T22:01:12Z","page":"732-762","day":"10","publication":"Advances in Cryptology – CRYPTO 2020","year":"2020","publisher":"Springer Nature","quality_controlled":"1","oa":1,"acknowledgement":"We would like to thank the anonymous reviewers for their helpful comments and suggestions. The work was initiated while the first author was in IIT Madras, India. Part of this work was done while the author was visiting the University of Warsaw. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT) and from the Foundation for Polish Science under grant TEAM/2016-1/4 founded within the UE 2014–2020 Smart Growth Operational Program. The last author was supported by the Independent Research Fund Denmark project BETHE and the Concordium Blockchain Research Center, Aarhus University, Denmark.","title":"Reverse firewalls for actively secure MPCs","author":[{"first_name":"Suvradip","id":"B9CD0494-D033-11E9-B219-A439E6697425","last_name":"Chakraborty","full_name":"Chakraborty, Suvradip"},{"first_name":"Stefan","full_name":"Dziembowski, Stefan","last_name":"Dziembowski"},{"first_name":"Jesper Buus","full_name":"Nielsen, Jesper Buus","last_name":"Nielsen"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Chakraborty S, Dziembowski S, Nielsen JB. 2020. Reverse firewalls for actively secure MPCs. Advances in Cryptology – CRYPTO 2020. CRYPTO: Annual International Cryptology Conference, LNCS, vol. 12171, 732–762.","chicago":"Chakraborty, Suvradip, Stefan Dziembowski, and Jesper Buus Nielsen. “Reverse Firewalls for Actively Secure MPCs.” In Advances in Cryptology – CRYPTO 2020, 12171:732–62. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-56880-1_26.","short":"S. Chakraborty, S. Dziembowski, J.B. Nielsen, in:, Advances in Cryptology – CRYPTO 2020, Springer Nature, 2020, pp. 732–762.","ieee":"S. Chakraborty, S. Dziembowski, and J. B. Nielsen, “Reverse firewalls for actively secure MPCs,” in Advances in Cryptology – CRYPTO 2020, Santa Barbara, CA, United States, 2020, vol. 12171, pp. 732–762.","ama":"Chakraborty S, Dziembowski S, Nielsen JB. Reverse firewalls for actively secure MPCs. In: Advances in Cryptology – CRYPTO 2020. Vol 12171. Springer Nature; 2020:732-762. doi:10.1007/978-3-030-56880-1_26","apa":"Chakraborty, S., Dziembowski, S., & Nielsen, J. B. (2020). Reverse firewalls for actively secure MPCs. In Advances in Cryptology – CRYPTO 2020 (Vol. 12171, pp. 732–762). Santa Barbara, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-030-56880-1_26","mla":"Chakraborty, Suvradip, et al. “Reverse Firewalls for Actively Secure MPCs.” Advances in Cryptology – CRYPTO 2020, vol. 12171, Springer Nature, 2020, pp. 732–62, doi:10.1007/978-3-030-56880-1_26."},"project":[{"name":"Teaching Old Crypto New Tricks","grant_number":"682815","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"volume":12171,"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["16113349"],"isbn":["9783030568795"],"issn":["03029743"]},"publication_status":"published","month":"08","intvolume":" 12171","alternative_title":["LNCS"],"scopus_import":"1","main_file_link":[{"url":"https://eprint.iacr.org/2019/1317","open_access":"1"}],"oa_version":"Preprint","abstract":[{"text":"Reverse firewalls were introduced at Eurocrypt 2015 by Miro-nov and Stephens-Davidowitz, as a method for protecting cryptographic protocols against attacks on the devices of the honest parties. In a nutshell: a reverse firewall is placed outside of a device and its goal is to “sanitize” the messages sent by it, in such a way that a malicious device cannot leak its secrets to the outside world. It is typically assumed that the cryptographic devices are attacked in a “functionality-preserving way” (i.e. informally speaking, the functionality of the protocol remains unchanged under this attacks). In their paper, Mironov and Stephens-Davidowitz construct a protocol for passively-secure two-party computations with firewalls, leaving extension of this result to stronger models as an open question.\r\nIn this paper, we address this problem by constructing a protocol for secure computation with firewalls that has two main advantages over the original protocol from Eurocrypt 2015. Firstly, it is a multiparty computation protocol (i.e. it works for an arbitrary number n of the parties, and not just for 2). Secondly, it is secure in much stronger corruption settings, namely in the active corruption model. More precisely: we consider an adversary that can fully corrupt up to 𝑛−1 parties, while the remaining parties are corrupt in a functionality-preserving way.\r\nOur core techniques are: malleable commitments and malleable non-interactive zero-knowledge, which in particular allow us to create a novel protocol for multiparty augmented coin-tossing into the well with reverse firewalls (that is based on a protocol of Lindell from Crypto 2001).","lang":"eng"}],"department":[{"_id":"KrPi"}],"date_updated":"2021-01-12T08:18:08Z","status":"public","type":"conference","conference":{"start_date":"2020-08-17","location":"Santa Barbara, CA, United States","end_date":"2020-08-21","name":"CRYPTO: Annual International Cryptology Conference"},"_id":"8322"},{"project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Genise N, Micciancio D, Peikert C, Walter M. 2020. Improved discrete Gaussian and subgaussian analysis for lattice cryptography. 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography. PKC: Public-Key Cryptography, LNCS, vol. 12110, 623–651.","chicago":"Genise, Nicholas, Daniele Micciancio, Chris Peikert, and Michael Walter. “Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography.” In 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, 12110:623–51. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-45374-9_21.","apa":"Genise, N., Micciancio, D., Peikert, C., & Walter, M. (2020). Improved discrete Gaussian and subgaussian analysis for lattice cryptography. In 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography (Vol. 12110, pp. 623–651). Edinburgh, United Kingdom: Springer Nature. https://doi.org/10.1007/978-3-030-45374-9_21","ama":"Genise N, Micciancio D, Peikert C, Walter M. Improved discrete Gaussian and subgaussian analysis for lattice cryptography. In: 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography. Vol 12110. Springer Nature; 2020:623-651. doi:10.1007/978-3-030-45374-9_21","ieee":"N. Genise, D. Micciancio, C. Peikert, and M. Walter, “Improved discrete Gaussian and subgaussian analysis for lattice cryptography,” in 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, Edinburgh, United Kingdom, 2020, vol. 12110, pp. 623–651.","short":"N. Genise, D. Micciancio, C. Peikert, M. Walter, in:, 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, Springer Nature, 2020, pp. 623–651.","mla":"Genise, Nicholas, et al. “Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography.” 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, vol. 12110, Springer Nature, 2020, pp. 623–51, doi:10.1007/978-3-030-45374-9_21."},"title":"Improved discrete Gaussian and subgaussian analysis for lattice cryptography","article_processing_charge":"No","author":[{"full_name":"Genise, Nicholas","last_name":"Genise","first_name":"Nicholas"},{"first_name":"Daniele","last_name":"Micciancio","full_name":"Micciancio, Daniele"},{"first_name":"Chris","last_name":"Peikert","full_name":"Peikert, Chris"},{"id":"488F98B0-F248-11E8-B48F-1D18A9856A87","first_name":"Michael","full_name":"Walter, Michael","orcid":"0000-0003-3186-2482","last_name":"Walter"}],"oa":1,"quality_controlled":"1","publisher":"Springer Nature","publication":"23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography","day":"15","year":"2020","date_created":"2020-09-06T22:01:13Z","doi":"10.1007/978-3-030-45374-9_21","date_published":"2020-05-15T00:00:00Z","page":"623-651","_id":"8339","status":"public","conference":{"end_date":"2020-05-07","location":"Edinburgh, United Kingdom","start_date":"2020-05-04","name":"PKC: Public-Key Cryptography"},"type":"conference","date_updated":"2023-02-23T13:31:06Z","department":[{"_id":"KrPi"}],"oa_version":"Preprint","abstract":[{"text":"Discrete Gaussian distributions over lattices are central to lattice-based cryptography, and to the computational and mathematical aspects of lattices more broadly. The literature contains a wealth of useful theorems about the behavior of discrete Gaussians under convolutions and related operations. Yet despite their structural similarities, most of these theorems are formally incomparable, and their proofs tend to be monolithic and written nearly “from scratch,” making them unnecessarily hard to verify, understand, and extend.\r\nIn this work we present a modular framework for analyzing linear operations on discrete Gaussian distributions. The framework abstracts away the particulars of Gaussians, and usually reduces proofs to the choice of appropriate linear transformations and elementary linear algebra. To showcase the approach, we establish several general properties of discrete Gaussians, and show how to obtain all prior convolution theorems (along with some new ones) as straightforward corollaries. As another application, we describe a self-reduction for Learning With Errors (LWE) that uses a fixed number of samples to generate an unlimited number of additional ones (having somewhat larger error). The distinguishing features of our reduction are its simple analysis in our framework, and its exclusive use of discrete Gaussians without any loss in parameters relative to a prior mixed discrete-and-continuous approach.\r\nAs a contribution of independent interest, for subgaussian random matrices we prove a singular value concentration bound with explicitly stated constants, and we give tighter heuristics for specific distributions that are commonly used for generating lattice trapdoors. These bounds yield improvements in the concrete bit-security estimates for trapdoor lattice cryptosystems.","lang":"eng"}],"intvolume":" 12110","month":"05","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2020/337"}],"alternative_title":["LNCS"],"scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["03029743"],"isbn":["9783030453732"],"eissn":["16113349"]},"ec_funded":1,"volume":12110},{"extern":"1","date_updated":"2021-01-12T08:19:02Z","_id":"8402","status":"public","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"],"article_type":"original","type":"journal_article","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1741-7007"]},"publication_status":"published","volume":18,"oa_version":"Published Version","pmid":1,"abstract":[{"lang":"eng","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."}],"month":"01","intvolume":" 18","main_file_link":[{"url":"https://doi.org/10.1186/s12915-019-0733-6","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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","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.","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).","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.","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.","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."},"title":"The mitochondrial carrier pathway transports non-canonical substrates with an odd number of transmembrane segments","author":[{"last_name":"Rampelt","full_name":"Rampelt, Heike","first_name":"Heike"},{"first_name":"Iva","last_name":"Sucec","full_name":"Sucec, Iva"},{"last_name":"Bersch","full_name":"Bersch, Beate","first_name":"Beate"},{"first_name":"Patrick","full_name":"Horten, Patrick","last_name":"Horten"},{"full_name":"Perschil, Inge","last_name":"Perschil","first_name":"Inge"},{"first_name":"Jean-Claude","last_name":"Martinou","full_name":"Martinou, Jean-Claude"},{"full_name":"van der Laan, Martin","last_name":"van der Laan","first_name":"Martin"},{"last_name":"Wiedemann","full_name":"Wiedemann, Nils","first_name":"Nils"},{"full_name":"Schanda, Paul","orcid":"0000-0002-9350-7606","last_name":"Schanda","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","first_name":"Paul"},{"full_name":"Pfanner, Nikolaus","last_name":"Pfanner","first_name":"Nikolaus"}],"article_processing_charge":"No","external_id":{"pmid":["31907035"]},"article_number":"2","day":"06","publication":"BMC Biology","year":"2020","doi":"10.1186/s12915-019-0733-6","date_published":"2020-01-06T00:00:00Z","date_created":"2020-09-17T10:26:53Z","publisher":"Springer Nature","quality_controlled":"1","oa":1},{"date_updated":"2021-01-12T08:19:03Z","citation":{"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.","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.).","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","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","article_processing_charge":"No","author":[{"full_name":"Weinhäupl, Katharina","last_name":"Weinhäupl","first_name":"Katharina"},{"last_name":"Wang","full_name":"Wang, Yong","first_name":"Yong"},{"first_name":"Audrey","full_name":"Hessel, Audrey","last_name":"Hessel"},{"full_name":"Brennich, Martha","last_name":"Brennich","first_name":"Martha"},{"first_name":"Kresten","last_name":"Lindorff-Larsen","full_name":"Lindorff-Larsen, Kresten"},{"first_name":"Paul","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","full_name":"Schanda, Paul","orcid":"0000-0002-9350-7606","last_name":"Schanda"}],"title":"Architecture and subunit dynamics of the mitochondrial TIM9·10·12 chaperone","_id":"8404","type":"preprint","status":"public","year":"2020","publication_status":"submitted","publication":"bioRxiv","language":[{"iso":"eng"}],"day":"14","date_created":"2020-09-17T10:27:59Z","doi":"10.1101/2020.03.13.990150","date_published":"2020-03-14T00:00:00Z","abstract":[{"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.","lang":"eng"}],"oa_version":"Preprint","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/2020.03.13.990150"}],"publisher":"Cold Spring Harbor Laboratory","month":"03"},{"author":[{"first_name":"Vadim","id":"FE553552-CDE8-11E9-B324-C0EBE5697425","last_name":"Kaloshin","orcid":"0000-0002-6051-2628","full_name":"Kaloshin, Vadim"},{"last_name":"Zhang","full_name":"Zhang, Ke","first_name":"Ke"}],"article_processing_charge":"No","title":"Arnold Diffusion for Smooth Systems of Two and a Half Degrees of Freedom","citation":{"chicago":"Kaloshin, Vadim, and Ke Zhang. Arnold Diffusion for Smooth Systems of Two and a Half Degrees of Freedom. 1st ed. Vol. 208. AMS. Princeton University Press, 2020. https://doi.org/10.1515/9780691204932.","ista":"Kaloshin V, Zhang K. 2020. Arnold Diffusion for Smooth Systems of Two and a Half Degrees of Freedom 1st ed., Princeton University Press, 224p.","mla":"Kaloshin, Vadim, and Ke Zhang. Arnold Diffusion for Smooth Systems of Two and a Half Degrees of Freedom. 1st ed., vol. 208, Princeton University Press, 2020, doi:10.1515/9780691204932.","short":"V. Kaloshin, K. Zhang, Arnold Diffusion for Smooth Systems of Two and a Half Degrees of Freedom, 1st ed., Princeton University Press, 2020.","ieee":"V. Kaloshin and K. Zhang, Arnold Diffusion for Smooth Systems of Two and a Half Degrees of Freedom, 1st ed., vol. 208. Princeton University Press, 2020.","apa":"Kaloshin, V., & Zhang, K. (2020). Arnold Diffusion for Smooth Systems of Two and a Half Degrees of Freedom (1st ed., Vol. 208). Princeton University Press. https://doi.org/10.1515/9780691204932","ama":"Kaloshin V, Zhang K. Arnold Diffusion for Smooth Systems of Two and a Half Degrees of Freedom. Vol 208. 1st ed. Princeton University Press; 2020. doi:10.1515/9780691204932"},"date_updated":"2021-12-21T10:50:49Z","extern":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","type":"book","status":"public","_id":"8414","series_title":"AMS","page":"224","date_published":"2020-03-01T00:00:00Z","volume":208,"doi":"10.1515/9780691204932","date_created":"2020-09-17T10:41:05Z","publication_identifier":{"isbn":["9-780-6912-0253-2"]},"publication_status":"published","year":"2020","day":"01","language":[{"iso":"eng"}],"scopus_import":"1","publisher":"Princeton University Press","quality_controlled":"1","alternative_title":["Annals of Mathematics Studies"],"edition":"1","month":"03","intvolume":" 208","abstract":[{"lang":"eng","text":"Arnold diffusion, which concerns the appearance of chaos in classical mechanics, is one of the most important problems in the fields of dynamical systems and mathematical physics. Since it was discovered by Vladimir Arnold in 1963, it has attracted the efforts of some of the most prominent researchers in mathematics. The question is whether a typical perturbation of a particular system will result in chaotic or unstable dynamical phenomena. In this groundbreaking book, Vadim Kaloshin and Ke Zhang provide the first complete proof of Arnold diffusion, demonstrating that that there is topological instability for typical perturbations of five-dimensional integrable systems (two and a half degrees of freedom).\r\nThis proof realizes a plan John Mather announced in 2003 but was unable to complete before his death. Kaloshin and Zhang follow Mather’s strategy but emphasize a more Hamiltonian approach, tying together normal forms theory, hyperbolic theory, Mather theory, and weak KAM theory. Offering a complete, clean, and modern explanation of the steps involved in the proof, and a clear account of background material, this book is designed to be accessible to students as well as researchers. The result is a critical contribution to mathematical physics and dynamical systems, especially Hamiltonian systems."}],"oa_version":"None"},{"_id":"8403","type":"preprint","status":"public","citation":{"ieee":"I. Sučec et al., “Structural basis of client specificity in mitochondrial membrane-protein chaperones,” bioRxiv. Cold Spring Harbor Laboratory.","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.).","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","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.","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.","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."},"date_updated":"2021-01-12T08:19:02Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","article_processing_charge":"No","author":[{"first_name":"Iva","last_name":"Sučec","full_name":"Sučec, Iva"},{"full_name":"Wang, Yong","last_name":"Wang","first_name":"Yong"},{"last_name":"Dakhlaoui","full_name":"Dakhlaoui, Ons","first_name":"Ons"},{"first_name":"Katharina","last_name":"Weinhäupl","full_name":"Weinhäupl, Katharina"},{"first_name":"Tobias","full_name":"Jores, Tobias","last_name":"Jores"},{"last_name":"Costa","full_name":"Costa, Doriane","first_name":"Doriane"},{"last_name":"Hessel","full_name":"Hessel, Audrey","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","full_name":"Lindorff-Larsen, Kresten","last_name":"Lindorff-Larsen"},{"first_name":"Beate","last_name":"Bersch","full_name":"Bersch, Beate"},{"full_name":"Schanda, Paul","orcid":"0000-0002-9350-7606","last_name":"Schanda","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","first_name":"Paul"}],"title":"Structural basis of client specificity in mitochondrial membrane-protein chaperones","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","oa":1,"main_file_link":[{"url":"https://doi.org/10.1101/2020.06.08.140772","open_access":"1"}],"publisher":"Cold Spring Harbor Laboratory","month":"09","publication_status":"submitted","year":"2020","language":[{"iso":"eng"}],"publication":"bioRxiv","day":"17","date_created":"2020-09-17T10:27:47Z","date_published":"2020-09-17T00:00:00Z","doi":"10.1101/2020.06.08.140772"},{"project":[{"grant_number":"Z00312","name":"The Wittgenstein Prize","_id":"25C5A090-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"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.","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.","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.","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","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"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"full_name":"Althoff, Matthias","last_name":"Althoff","first_name":"Matthias"},{"first_name":"Stanley","full_name":"Bak, Stanley","last_name":"Bak"},{"last_name":"Bao","full_name":"Bao, Zongnan","first_name":"Zongnan"},{"first_name":"Marcelo","full_name":"Forets, Marcelo","last_name":"Forets"},{"first_name":"Goran","last_name":"Frehse","full_name":"Frehse, Goran"},{"last_name":"Freire","full_name":"Freire, Daniel","first_name":"Daniel"},{"last_name":"Kochdumper","full_name":"Kochdumper, Niklas","first_name":"Niklas"},{"last_name":"Li","full_name":"Li, Yangge","first_name":"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"},{"first_name":"Mark","last_name":"Wetzlinger","full_name":"Wetzlinger, Mark"}],"title":"ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics","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","year":"2020","publication":"EPiC Series in Computing","day":"25","page":"16-48","date_created":"2020-09-26T14:49:43Z","date_published":"2020-09-25T00:00:00Z","doi":"10.29007/7dt2","_id":"8572","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","status":"public","date_updated":"2021-01-12T08:20:06Z","department":[{"_id":"ToHe"}],"abstract":[{"lang":"eng","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."}],"oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://easychair.org/publications/download/DRpS"}],"intvolume":" 74","month":"09","publication_status":"published","language":[{"iso":"eng"}],"ec_funded":1,"volume":74},{"main_file_link":[{"url":"https://easychair.org/publications/download/nrdD","open_access":"1"}],"intvolume":" 74","month":"09","abstract":[{"lang":"eng","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."}],"oa_version":"Published Version","ec_funded":1,"volume":74,"publication_status":"published","language":[{"iso":"eng"}],"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","status":"public","_id":"8571","department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T08:20:06Z","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.","page":"49-75","date_created":"2020-09-26T14:41:29Z","date_published":"2020-09-25T00:00:00Z","doi":"10.29007/zkf6","year":"2020","publication":"EPiC Series in Computing","day":"25","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"}],"article_processing_charge":"No","author":[{"first_name":"Luca","last_name":"Geretti","full_name":"Geretti, Luca"},{"last_name":"Alexandre Dit Sandretto","full_name":"Alexandre Dit Sandretto, Julien","first_name":"Julien"},{"first_name":"Matthias","last_name":"Althoff","full_name":"Althoff, Matthias"},{"last_name":"Benet","full_name":"Benet, Luis","first_name":"Luis"},{"first_name":"Alexandre","full_name":"Chapoutot, Alexandre","last_name":"Chapoutot"},{"last_name":"Chen","full_name":"Chen, Xin","first_name":"Xin"},{"last_name":"Collins","full_name":"Collins, Pieter","first_name":"Pieter"},{"last_name":"Forets","full_name":"Forets, Marcelo","first_name":"Marcelo"},{"first_name":"Daniel","full_name":"Freire, Daniel","last_name":"Freire"},{"full_name":"Immler, Fabian","last_name":"Immler","first_name":"Fabian"},{"last_name":"Kochdumper","full_name":"Kochdumper, Niklas","first_name":"Niklas"},{"full_name":"Sanders, David","last_name":"Sanders","first_name":"David"},{"last_name":"Schilling","full_name":"Schilling, Christian","orcid":"0000-0003-3658-1065","first_name":"Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87"}],"title":"ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics","citation":{"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.","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","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","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"day":"06","publication":"31st International Conference on Concurrency Theory","has_accepted_license":"1","year":"2020","date_published":"2020-08-06T00:00:00Z","doi":"10.4230/LIPIcs.CONCUR.2020.23","date_created":"2020-10-04T22:01:36Z","article_number":"23","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S11402-N23"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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","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","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.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, 31st International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","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.","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.","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."},"title":"Multi-dimensional long-run average problems for vector addition systems with states","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Otop, Jan","last_name":"Otop"}],"external_id":{"arxiv":["2007.08917"]},"article_processing_charge":"No","oa_version":"Published Version","abstract":[{"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.","lang":"eng"}],"month":"08","intvolume":" 171","scopus_import":"1","alternative_title":["LIPIcs"],"file":[{"file_size":601231,"date_updated":"2020-10-05T14:04:25Z","creator":"dernst","file_name":"2020_LIPIcsCONCUR_Chatterjee.pdf","date_created":"2020-10-05T14:04:25Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"5039752f644c4b72b9361d21a5e31baf","file_id":"8610"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783959771603"],"issn":["18688969"]},"publication_status":"published","volume":171,"_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":{"location":"Virtual","end_date":"2020-09-04","start_date":"2020-09-01","name":"CONCUR: Conference on Concurrency Theory"},"ddc":["000"],"date_updated":"2021-01-12T08:20:15Z","file_date_updated":"2020-10-05T14:04:25Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}]},{"date_updated":"2021-01-12T08:20:13Z","ddc":["000"],"file_date_updated":"2020-10-05T14:13:19Z","department":[{"_id":"ToHe"}],"_id":"8599","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","end_date":"2020-09-04","location":"Virtual"},"type":"conference","status":"public","publication_status":"published","publication_identifier":{"issn":["18688969"],"isbn":["9783959771603"]},"language":[{"iso":"eng"}],"file":[{"success":1,"file_id":"8611","checksum":"8f33b098e73724e0ac817f764d8e1a2d","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2020_LIPIcsCONCUR_Avni.pdf","date_created":"2020-10-05T14:13:19Z","creator":"dernst","file_size":868510,"date_updated":"2020-10-05T14:13:19Z"}],"volume":171,"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."}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"scopus_import":"1","intvolume":" 171","month":"08","citation":{"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.","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.","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","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"last_name":"Avni","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"title":"A survey of bidding games on graphs","article_number":"2","project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"}],"year":"2020","has_accepted_license":"1","publication":"31st International Conference on Concurrency Theory","day":"06","date_created":"2020-10-04T22:01:36Z","doi":"10.4230/LIPIcs.CONCUR.2020.2","date_published":"2020-08-06T00:00:00Z","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.","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1"},{"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"acknowledgement":"Vitaly Aksenov: Government of Russian Federation (Grant 08-08).\r\nDan Alistarh: ERC Starting Grant 805223 ScaleML.","page":"3:1-3:18","doi":"10.4230/LIPIcs.DISC.2020.3","date_published":"2020-08-03T00:00:00Z","date_created":"2020-11-05T15:26:17Z","has_accepted_license":"1","year":"2020","day":"03","publication":"34th International Symposium on Distributed Computing","project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223"}],"author":[{"first_name":"Vitaly","full_name":"Aksenov, Vitaly","last_name":"Aksenov"},{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"},{"first_name":"Alexandra","last_name":"Drozdova","full_name":"Drozdova, Alexandra"},{"full_name":"Mohtashami, Amirkeivan","last_name":"Mohtashami","first_name":"Amirkeivan"}],"article_processing_charge":"No","external_id":{"arxiv":["2008.01009"]},"title":"The splay-list: A distribution-adaptive concurrent skip-list","citation":{"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.","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.","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.","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","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","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"08","intvolume":" 179","abstract":[{"lang":"eng","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."}],"oa_version":"Published Version","volume":179,"ec_funded":1,"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959771689"]},"publication_status":"published","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"}],"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":{"start_date":"2020-10-12","location":"Freiburg, Germany","end_date":"2020-10-16","name":"DISC: Symposium on Distributed Computing"},"status":"public","_id":"8725","series_title":"LIPIcs","file_date_updated":"2021-03-11T12:33:35Z","department":[{"_id":"DaAl"}],"date_updated":"2023-02-23T13:41:40Z","ddc":["000"]},{"ec_funded":1,"issue":"3","volume":5,"publication_status":"published","publication_identifier":{"issn":["2410-3896"]},"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}],"scopus_import":"1","intvolume":" 5","month":"08","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."}],"oa_version":"Published Version","department":[{"_id":"MiLe"}],"file_date_updated":"2020-11-06T07:24:40Z","date_updated":"2021-01-12T08:20:46Z","ddc":["530"],"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","_id":"8726","date_created":"2020-11-06T07:21:00Z","date_published":"2020-08-26T00:00:00Z","doi":"10.3390/condmat5030053","year":"2020","has_accepted_license":"1","publication":"Condensed Matter","day":"26","oa":1,"quality_controlled":"1","publisher":"MDPI","external_id":{"arxiv":["2009.11773"]},"article_processing_charge":"No","author":[{"full_name":"Gotfryd, Dorota","last_name":"Gotfryd","first_name":"Dorota"},{"id":"8275014E-6063-11E9-9B7F-6338E6697425","first_name":"Ekaterina","last_name":"Paerschke","full_name":"Paerschke, Ekaterina","orcid":"0000-0003-0853-8182"},{"full_name":"Wohlfeld, Krzysztof","last_name":"Wohlfeld","first_name":"Krzysztof"},{"last_name":"Oleś","full_name":"Oleś, Andrzej M.","first_name":"Andrzej M."}],"title":"Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling","citation":{"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","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","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).","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.","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}],"article_number":"53"},{"oa_version":"Published Version","abstract":[{"lang":"eng","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."}],"month":"09","scopus_import":"1","file":[{"checksum":"d616d549a0ade78606b16f8a9540820f","file_id":"9109","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2021-02-09T09:39:02Z","file_name":"2020_FMCAD_Alamdari.pdf","date_updated":"2021-02-09T09:39:02Z","file_size":990999,"creator":"dernst"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2708-7824"],"isbn":["9783854480426"]},"publication_status":"published","_id":"9040","status":"public","type":"conference","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)"},"conference":{"name":" FMCAD: Formal Methods in Computer-Aided Design","start_date":"2020-09-21","end_date":"2020-09-24","location":"Online Conference"},"ddc":["000"],"date_updated":"2021-02-09T09:39:59Z","file_date_updated":"2021-02-09T09:39:02Z","department":[{"_id":"ToHe"}],"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","quality_controlled":"1","publisher":"TU Wien Academic Press","oa":1,"day":"21","publication":"Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design","has_accepted_license":"1","year":"2020","date_published":"2020-09-21T00:00:00Z","doi":"10.34727/2020/isbn.978-3-85448-042-6_21","date_created":"2021-01-24T23:01:10Z","page":"138-147","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"}],"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","author":[{"full_name":"Alamdari, Par Alizadeh","last_name":"Alamdari","first_name":"Par Alizadeh"},{"full_name":"Avni, Guy","orcid":"0000-0001-5588-8287","last_name":"Avni","first_name":"Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"last_name":"Lukina","full_name":"Lukina, Anna","id":"CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425","first_name":"Anna"}],"article_processing_charge":"No"},{"title":"Ionic solids from common colloids","author":[{"first_name":"Theodore","last_name":"Hueckel","full_name":"Hueckel, Theodore"},{"last_name":"Hocky","full_name":"Hocky, Glen M.","first_name":"Glen M."},{"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"},{"full_name":"Sacanna, Stefano","last_name":"Sacanna","first_name":"Stefano"}],"article_processing_charge":"No","external_id":{"pmid":["32322078"]},"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","citation":{"chicago":"Hueckel, Theodore, Glen M. Hocky, Jérémie A Palacci, and Stefano Sacanna. “Ionic Solids from Common Colloids.” Nature. Springer Nature, 2020. https://doi.org/10.1038/s41586-020-2205-0.","ista":"Hueckel T, Hocky GM, Palacci JA, Sacanna S. 2020. Ionic solids from common colloids. Nature. 580(7804), 487–490.","mla":"Hueckel, Theodore, et al. “Ionic Solids from Common Colloids.” Nature, vol. 580, no. 7804, Springer Nature, 2020, pp. 487–90, doi:10.1038/s41586-020-2205-0.","ieee":"T. Hueckel, G. M. Hocky, J. A. Palacci, and S. Sacanna, “Ionic solids from common colloids,” Nature, vol. 580, no. 7804. Springer Nature, pp. 487–490, 2020.","short":"T. Hueckel, G.M. Hocky, J.A. Palacci, S. Sacanna, Nature 580 (2020) 487–490.","apa":"Hueckel, T., Hocky, G. M., Palacci, J. A., & Sacanna, S. (2020). Ionic solids from common colloids. Nature. Springer Nature. https://doi.org/10.1038/s41586-020-2205-0","ama":"Hueckel T, Hocky GM, Palacci JA, Sacanna S. Ionic solids from common colloids. Nature. 2020;580(7804):487-490. doi:10.1038/s41586-020-2205-0"},"date_published":"2020-04-23T00:00:00Z","doi":"10.1038/s41586-020-2205-0","date_created":"2021-02-02T13:30:50Z","page":"487-490","day":"23","publication":"Nature","year":"2020","publisher":"Springer Nature","quality_controlled":"1","extern":"1","date_updated":"2023-02-23T13:47:55Z","status":"public","keyword":["Multidisciplinary"],"article_type":"original","type":"journal_article","_id":"9059","issue":"7804","volume":580,"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]},"publication_status":"published","month":"04","intvolume":" 580","scopus_import":"1","pmid":1,"oa_version":"None","abstract":[{"lang":"eng","text":"From rock salt to nanoparticle superlattices, complex structure can emerge from simple building blocks that attract each other through Coulombic forces1-4. On the micrometre scale, however, colloids in water defy the intuitively simple idea of forming crystals from oppositely charged partners, instead forming non-equilibrium structures such as clusters and gels5-7. Although various systems have been engineered to grow binary crystals8-11, native surface charge in aqueous conditions has not been used to assemble crystalline materials. Here we form ionic colloidal crystals in water through an approach that we refer to as polymer-attenuated Coulombic self-assembly. The key to crystallization is the use of a neutral polymer to keep particles separated by well defined distances, allowing us to tune the attractive overlap of electrical double layers, directing particles to disperse, crystallize or become permanently fixed on demand. The nucleation and growth of macroscopic single crystals is demonstrated by using the Debye screening length to fine-tune assembly. Using a variety of colloidal particles and commercial polymers, ionic colloidal crystals isostructural to caesium chloride, sodium chloride, aluminium diboride and K4C60 are selected according to particle size ratios. Once fixed by simply diluting out solution salts, crystals are pulled out of the water for further manipulation, demonstrating an accurate translation from solution-phase assembly to dried solid structures. In contrast to other assembly approaches, in which particles must be carefully engineered to encode binding information12-18, polymer-attenuated Coulombic self-assembly enables conventional colloids to be used as model colloidal ions, primed for crystallization. "}]},{"date_published":"2020-02-22T00:00:00Z","doi":"10.1007/978-3-319-90306-4_94-1","date_created":"2021-02-05T12:15:18Z","day":"22","publication":"Encyclopedia of Social Insects","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783319903064"]},"year":"2020","publication_status":"published","month":"02","place":"Cham","publisher":"Springer Nature","quality_controlled":"1","oa_version":"None","department":[{"_id":"SyCr"}],"title":"Parasites and Pathogens","editor":[{"full_name":"Starr, C","last_name":"Starr","first_name":"C"}],"author":[{"first_name":"Paul","full_name":"Schmid-Hempel, Paul","last_name":"Schmid-Hempel"},{"id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","first_name":"Sylvia M","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia M","last_name":"Cremer"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-02-05T12:19:21Z","citation":{"ama":"Schmid-Hempel P, Cremer S. Parasites and Pathogens. In: Starr C, ed. Encyclopedia of Social Insects. Cham: Springer Nature; 2020. doi:10.1007/978-3-319-90306-4_94-1","apa":"Schmid-Hempel, P., & Cremer, S. (2020). Parasites and Pathogens. In C. Starr (Ed.), Encyclopedia of Social Insects. Cham: Springer Nature. https://doi.org/10.1007/978-3-319-90306-4_94-1","short":"P. Schmid-Hempel, S. Cremer, in:, C. Starr (Ed.), Encyclopedia of Social Insects, Springer Nature, Cham, 2020.","ieee":"P. Schmid-Hempel and S. Cremer, “Parasites and Pathogens,” in Encyclopedia of Social Insects, C. Starr, Ed. Cham: Springer Nature, 2020.","mla":"Schmid-Hempel, Paul, and Sylvia Cremer. “Parasites and Pathogens.” Encyclopedia of Social Insects, edited by C Starr, Springer Nature, 2020, doi:10.1007/978-3-319-90306-4_94-1.","ista":"Schmid-Hempel P, Cremer S. 2020.Parasites and Pathogens. In: Encyclopedia of Social Insects. .","chicago":"Schmid-Hempel, Paul, and Sylvia Cremer. “Parasites and Pathogens.” In Encyclopedia of Social Insects, edited by C Starr. Cham: Springer Nature, 2020. https://doi.org/10.1007/978-3-319-90306-4_94-1."},"status":"public","type":"book_chapter","_id":"9096"},{"issue":"8","volume":12,"publication_identifier":{"issn":["1942-2466","1942-2466"]},"publication_status":"published","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1029/2020MS002106","open_access":"1"}],"month":"08","intvolume":" 12","abstract":[{"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.","lang":"eng"}],"oa_version":"Published Version","date_updated":"2022-01-24T12:28:12Z","extern":"1","article_type":"original","type":"journal_article","status":"public","keyword":["Global and Planetary Change","General Earth and Planetary Sciences","Environmental Chemistry"],"_id":"9126","doi":"10.1029/2020ms002106","date_published":"2020-08-01T00:00:00Z","date_created":"2021-02-15T14:06:38Z","year":"2020","day":"01","publication":"Journal of Advances in Modeling Earth Systems","publisher":"American Geophysical Union","quality_controlled":"1","oa":1,"author":[{"full_name":"Risi, Camille","last_name":"Risi","first_name":"Camille"},{"full_name":"Muller, Caroline J","orcid":"0000-0001-5836-5350","last_name":"Muller","first_name":"Caroline J","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b"},{"first_name":"Peter","last_name":"Blossey","full_name":"Blossey, Peter"}],"article_processing_charge":"No","title":"What controls the water vapor isotopic composition near the surface of tropical oceans? Results from an analytical model constrained by large‐eddy simulations","citation":{"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.","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.","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.","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"},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_number":"e2020MS002106"},{"month":"09","intvolume":" 20","main_file_link":[{"open_access":"1","url":"https://hal-insu.archives-ouvertes.fr/insu-02881534"}],"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."}],"volume":20,"issue":"9","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1436-3798","1436-378X"]},"publication_status":"published","status":"public","keyword":["Global and Planetary Change"],"type":"journal_article","article_type":"original","_id":"9127","extern":"1","date_updated":"2022-01-24T12:28:49Z","quality_controlled":"1","publisher":"Springer Nature","oa":1,"date_published":"2020-09-11T00:00:00Z","doi":"10.1007/s10113-020-01659-w","date_created":"2021-02-15T14:06:58Z","day":"11","publication":"Regional Environmental Change","year":"2020","article_number":"78","title":"How warmer and drier will the Mediterranean region be at the end of the twenty-first century?","author":[{"first_name":"Philippe","full_name":"Drobinski, Philippe","last_name":"Drobinski"},{"last_name":"Da Silva","full_name":"Da Silva, Nicolas","first_name":"Nicolas"},{"first_name":"Sophie","full_name":"Bastin, Sophie","last_name":"Bastin"},{"first_name":"Sylvain","full_name":"Mailler, Sylvain","last_name":"Mailler"},{"first_name":"Caroline J","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","orcid":"0000-0001-5836-5350","full_name":"Muller, Caroline J","last_name":"Muller"},{"full_name":"Ahrens, Bodo","last_name":"Ahrens","first_name":"Bodo"},{"first_name":"Ole B.","full_name":"Christensen, Ole B.","last_name":"Christensen"},{"full_name":"Lionello, Piero","last_name":"Lionello","first_name":"Piero"}],"article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"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","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.","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.","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."}},{"year":"2020","publication":"Environmental Research Letters","day":"18","date_created":"2021-02-15T14:07:14Z","doi":"10.1088/1748-9326/ab7130","date_published":"2020-02-18T00:00:00Z","oa":1,"quality_controlled":"1","publisher":"IOP Publishing","citation":{"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.","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","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","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.","short":"C.J. Muller, Y. Takayabu, Environmental Research Letters 15 (2020).","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."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","author":[{"full_name":"Muller, Caroline J","orcid":"0000-0001-5836-5350","last_name":"Muller","first_name":"Caroline J","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b"},{"first_name":"Yukari","full_name":"Takayabu, Yukari","last_name":"Takayabu"}],"title":"Response of precipitation extremes to warming: What have we learned from theory and idealized cloud-resolving simulations, and what remains to be learned?","article_number":"035001","publication_status":"published","publication_identifier":{"issn":["1748-9326"]},"language":[{"iso":"eng"}],"volume":15,"issue":"3","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","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1088/1748-9326/ab7130"}],"intvolume":" 15","month":"02","date_updated":"2022-01-24T12:29:46Z","extern":"1","_id":"9128","type":"journal_article","article_type":"letter_note","keyword":["Renewable Energy","Sustainability and the Environment","Public Health","Environmental and Occupational Health","General Environmental Science"],"status":"public"},{"publisher":"American Geophysical Union","quality_controlled":"1","oa":1,"doi":"10.1029/2020ms002164","date_published":"2020-11-01T00:00:00Z","date_created":"2021-02-15T14:06:23Z","day":"01","publication":"Journal of Advances in Modeling Earth Systems","year":"2020","article_number":"e2020MS002164","title":"Self‐aggregation of convective clouds with interactive sea surface temperature","author":[{"last_name":"Shamekh","full_name":"Shamekh, S.","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"},{"full_name":"Duvel, J.‐P.","last_name":"Duvel","first_name":"J.‐P."},{"first_name":"F.","full_name":"D'Andrea, F.","last_name":"D'Andrea"}],"article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"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).","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","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","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."},"month":"11","intvolume":" 12","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1029/2020MS002164"}],"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_identifier":{"issn":["1942-2466","1942-2466"]},"publication_status":"published","status":"public","keyword":["Global and Planetary Change","General Earth and Planetary Sciences","Environmental Chemistry"],"type":"journal_article","article_type":"original","_id":"9125","extern":"1","date_updated":"2022-01-24T12:27:38Z"},{"_id":"9124","type":"preprint","status":"public","citation":{"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.","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.","mla":"Albright, Anna Lea, et al. “Atmospheric Radiative Profiles during EUREC4A.” Earth System Science Data, Copernicus Publications, doi: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","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","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.)."},"date_updated":"2022-01-24T12:27:08Z","extern":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"first_name":"Anna Lea","last_name":"Albright","full_name":"Albright, Anna Lea"},{"first_name":"Benjamin","last_name":"Fildier","full_name":"Fildier, Benjamin"},{"first_name":"Ludovic","last_name":"Touzé-Peiffer","full_name":"Touzé-Peiffer, Ludovic"},{"full_name":"Pincus, Robert","last_name":"Pincus","first_name":"Robert"},{"first_name":"Jessica","full_name":"Vial, Jessica","last_name":"Vial"},{"orcid":"0000-0001-5836-5350","full_name":"Muller, Caroline J","last_name":"Muller","first_name":"Caroline J","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b"}],"article_processing_charge":"No","title":"Atmospheric radiative profiles during EUREC4A","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","publisher":"Copernicus Publications","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5194/essd-2020-269"}],"month":"09","year":"2020","publication_status":"submitted","day":"24","language":[{"iso":"eng"}],"publication":"Earth System Science Data","doi":"10.5194/essd-2020-269","date_published":"2020-09-24T00:00:00Z","date_created":"2021-02-15T14:05:54Z"},{"quality_controlled":"1","publisher":"Wiley","month":"05","abstract":[{"text":"Inversions are chromosomal rearrangements where the order of genes is reversed. Inversions originate by mutation and can be under positive, negative or balancing selection. Selective effects result from potential disruptive effects on meiosis, gene disruption at inversion breakpoints and, importantly, the effects of inversions as modifiers of recombination rate: Recombination is strongly reduced in individuals heterozygous for an inversion, allowing for alleles at different loci to be inherited as a ‘block’. This may lead to a selective advantage whenever it is favourable to keep certain combinations of alleles associated, for example under local adaptation with gene flow. Inversions can cover a considerable part of a chromosome and contain numerous loci under different selection pressures, so that the resulting overall effects may be complex. Empirical data from various systems show that inversions may have a prominent role in local adaptation, speciation, parallel evolution, the maintenance of polymorphism and sex chromosome evolution.","lang":"eng"}],"oa_version":"None","date_created":"2021-02-15T12:39:04Z","date_published":"2020-05-16T00:00:00Z","doi":"10.1002/9780470015902.a0029007","publication_status":"published","year":"2020","publication_identifier":{"isbn":["9780470016176","9780470015902"]},"publication":"eLS","language":[{"iso":"eng"}],"day":"16","type":"book_chapter","status":"public","_id":"9123","article_processing_charge":"No","author":[{"last_name":"Westram","full_name":"Westram, Anja M","orcid":"0000-0003-1050-4969","first_name":"Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Faria","full_name":"Faria, Rui","first_name":"Rui"},{"full_name":"Butlin, Roger","last_name":"Butlin","first_name":"Roger"},{"full_name":"Johannesson, Kerstin","last_name":"Johannesson","first_name":"Kerstin"}],"title":"Inversions and Evolution","department":[{"_id":"NiBa"}],"date_updated":"2021-02-15T13:18:16Z","citation":{"mla":"Westram, Anja M., et al. “Inversions and Evolution.” ELS, Wiley, 2020, doi:10.1002/9780470015902.a0029007.","apa":"Westram, A. M., Faria, R., Butlin, R., & Johannesson, K. (2020). Inversions and Evolution. In eLS. Wiley. https://doi.org/10.1002/9780470015902.a0029007","ama":"Westram AM, Faria R, Butlin R, Johannesson K. Inversions and Evolution. In: ELS. Wiley; 2020. doi:10.1002/9780470015902.a0029007","short":"A.M. Westram, R. Faria, R. Butlin, K. Johannesson, in:, ELS, Wiley, 2020.","ieee":"A. M. Westram, R. Faria, R. Butlin, and K. Johannesson, “Inversions and Evolution,” in eLS, Wiley, 2020.","chicago":"Westram, Anja M, Rui Faria, Roger Butlin, and Kerstin Johannesson. “Inversions and Evolution.” In ELS. Wiley, 2020. https://doi.org/10.1002/9780470015902.a0029007.","ista":"Westram AM, Faria R, Butlin R, Johannesson K. 2020.Inversions and Evolution. In: eLS. ."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"date_created":"2021-02-18T14:07:16Z","date_published":"2020-10-14T00:00:00Z","doi":"10.1103/physrevfluids.5.104202","year":"2020","has_accepted_license":"1","publication":"Physical Review Fluids","day":"14","oa":1,"publisher":"American Physical Society","quality_controlled":"1","article_processing_charge":"No","author":[{"full_name":"Gandhi, Tanvi","last_name":"Gandhi","first_name":"Tanvi"},{"full_name":"Mac Huang, Jinzi","last_name":"Mac Huang","first_name":"Jinzi"},{"last_name":"Aubret","full_name":"Aubret, Antoine","first_name":"Antoine"},{"last_name":"Li","full_name":"Li, Yaocheng","first_name":"Yaocheng"},{"last_name":"Ramananarivo","full_name":"Ramananarivo, Sophie","first_name":"Sophie"},{"full_name":"Vergassola, Massimo","last_name":"Vergassola","first_name":"Massimo"},{"first_name":"Jérémie A","id":"8fb92548-2b22-11eb-b7c1-a3f0d08d7c7d","orcid":"0000-0002-7253-9465","full_name":"Palacci, Jérémie A","last_name":"Palacci"}],"title":"Decision-making at a T-junction by gradient-sensing microscopic agents","citation":{"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.","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."},"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","article_number":"104202","issue":"10","volume":5,"publication_status":"published","publication_identifier":{"issn":["2469-990X"]},"language":[{"iso":"eng"}],"file":[{"file_name":"2020_PhysRevFluids_Gandhi.pdf","date_created":"2021-02-18T14:12:24Z","file_size":730504,"date_updated":"2021-02-18T14:12:24Z","creator":"cziletti","success":1,"checksum":"dfecfadbd79fd760fb4db20d1e667f17","file_id":"9163","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"scopus_import":"1","intvolume":" 5","month":"10","abstract":[{"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.","lang":"eng"}],"oa_version":"Published Version","file_date_updated":"2021-02-18T14:12:24Z","date_updated":"2023-02-23T13:50:55Z","ddc":["530"],"extern":"1","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","_id":"9162"},{"oa_version":"Published Version","month":"06","intvolume":" 22","scopus_import":"1","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"9169","checksum":"02759f3ab228c1a061e747155a20f851","success":1,"date_updated":"2021-02-18T14:53:33Z","file_size":953338,"creator":"cziletti","date_created":"2021-02-18T14:53:33Z","file_name":"2020_NewJournPhys_Speck.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"],"type":"journal_article","article_type":"letter_note","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","publisher":"IOP Publishing","quality_controlled":"1","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":{"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","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","short":"T. Speck, J. Tailleur, J.A. Palacci, New Journal of Physics 22 (2020).","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.","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.","ista":"Speck T, Tailleur J, Palacci JA. 2020. Focus on active colloids and nanoparticles. New Journal of Physics. 22(6), 060201.","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."},"title":"Focus on active colloids and nanoparticles","author":[{"first_name":"Thomas","last_name":"Speck","full_name":"Speck, Thomas"},{"first_name":"Julien","last_name":"Tailleur","full_name":"Tailleur, Julien"},{"last_name":"Palacci","full_name":"Palacci, Jérémie A","orcid":"0000-0002-7253-9465","first_name":"Jérémie A","id":"8fb92548-2b22-11eb-b7c1-a3f0d08d7c7d"}],"article_processing_charge":"No"},{"ec_funded":1,"volume":4,"issue":"1","language":[{"iso":"eng"}],"file":[{"success":1,"file_id":"9272","checksum":"4a1043fa0548a725d464017fe2483ce0","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2020_MathMorpholTheoryAppl_Biswas.pdf","date_created":"2021-03-22T08:56:37Z","creator":"dernst","file_size":3668725,"date_updated":"2021-03-22T08:56:37Z"}],"publication_status":"published","publication_identifier":{"issn":["2353-3390"]},"intvolume":" 4","month":"11","oa_version":"Published Version","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."}],"department":[{"_id":"HeEd"}],"file_date_updated":"2021-03-22T08:56:37Z","ddc":["510"],"date_updated":"2021-03-22T09:01:50Z","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)"},"article_type":"original","type":"journal_article","_id":"9249","date_created":"2021-03-16T08:55:19Z","doi":"10.1515/mathm-2020-0106","date_published":"2020-11-17T00:00:00Z","page":"143-158","publication":"Mathematical Morphology - Theory and Applications","day":"17","year":"2020","has_accepted_license":"1","oa":1,"quality_controlled":"1","publisher":"De Gruyter","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. ","title":"Digital objects in rhombic dodecahedron grid","article_processing_charge":"No","author":[{"last_name":"Biswas","full_name":"Biswas, Ranita","orcid":"0000-0002-5372-7890","first_name":"Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Gaëlle","last_name":"Largeteau-Skapin","full_name":"Largeteau-Skapin, Gaëlle"},{"first_name":"Rita","full_name":"Zrour, Rita","last_name":"Zrour"},{"last_name":"Andres","full_name":"Andres, Eric","first_name":"Eric"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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."},"project":[{"call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","name":"Alpha Shape Theory Extended"},{"call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes"}]},{"publication":"28th International Symposium on Graph Drawing and Network Visualization","day":"20","year":"2020","date_created":"2021-03-28T22:01:44Z","date_published":"2020-09-20T00:00:00Z","doi":"10.1007/978-3-030-68766-3_28","page":"359-371","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.","oa":1,"publisher":"Springer Nature","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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","short":"J. Pach, G. Tardos, G. Tóth, in:, 28th International Symposium on Graph Drawing and Network Visualization, Springer Nature, 2020, pp. 359–371.","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.","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.","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.","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."},"title":"Crossings between non-homotopic edges","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"},{"full_name":"Tardos, Gábor","last_name":"Tardos","first_name":"Gábor"},{"first_name":"Géza","last_name":"Tóth","full_name":"Tóth, Géza"}],"project":[{"_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z00342","name":"The Wittgenstein Prize"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783030687656"]},"volume":12590,"oa_version":"Preprint","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"}],"intvolume":" 12590","month":"09","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2006.14908"}],"scopus_import":"1","date_updated":"2021-04-06T11:32:32Z","department":[{"_id":"HeEd"}],"_id":"9299","series_title":"LNCS","status":"public","conference":{"name":"GD: Graph Drawing and Network Visualization","end_date":"2020-09-18","location":"Virtual, Online","start_date":"2020-09-16"},"type":"conference"},{"issue":"21","volume":2020,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1073-7928"],"eissn":["1687-0247"]},"intvolume":" 2020","month":"11","main_file_link":[{"open_access":"1","url":"http://arxiv-export-lb.library.cornell.edu/abs/1810.07462"}],"scopus_import":"1","oa_version":"Preprint","abstract":[{"lang":"eng","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."}],"extern":"1","date_updated":"2023-02-23T14:01:30Z","status":"public","type":"journal_article","article_type":"original","_id":"9576","date_created":"2021-06-21T08:12:30Z","date_published":"2020-11-01T00:00:00Z","doi":"10.1093/imrn/rnaa004","page":"8007-8026","publication":"International Mathematics Research Notices","day":"01","year":"2020","oa":1,"quality_controlled":"1","publisher":"Oxford University Press","title":"Halfway to Rota’s basis conjecture","article_processing_charge":"No","external_id":{"arxiv":["1810.07462"]},"author":[{"first_name":"Matija","full_name":"Bucić, Matija","last_name":"Bucić"},{"first_name":"Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","last_name":"Kwan","full_name":"Kwan, Matthew Alan","orcid":"0000-0002-4003-7567"},{"last_name":"Pokrovskiy","full_name":"Pokrovskiy, Alexey","first_name":"Alexey"},{"last_name":"Sudakov","full_name":"Sudakov, Benny","first_name":"Benny"}],"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.","short":"M. Bucić, M.A. Kwan, A. Pokrovskiy, B. Sudakov, International Mathematics Research Notices 2020 (2020) 8007–8026.","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.","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","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","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."}},{"intvolume":" 2020","month":"03","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1093/imrn/rny064"}],"scopus_import":"1","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"}],"volume":2020,"issue":"6","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1073-7928"],"eissn":["1687-0247"]},"status":"public","article_type":"original","type":"journal_article","_id":"9577","extern":"1","date_updated":"2023-02-23T14:01:33Z","oa":1,"publisher":"Oxford University Press","quality_controlled":"1","date_created":"2021-06-21T08:30:12Z","doi":"10.1093/imrn/rny064","date_published":"2020-03-01T00:00:00Z","page":"1621–1638","publication":"International Mathematics Research Notices","day":"01","year":"2020","title":"Ramsey graphs induce subgraphs of quadratically many sizes","external_id":{"arxiv":["1711.02937"]},"article_processing_charge":"No","author":[{"orcid":"0000-0002-4003-7567","full_name":"Kwan, Matthew Alan","last_name":"Kwan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan"},{"first_name":"Benny","last_name":"Sudakov","full_name":"Sudakov, Benny"}],"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.","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","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.","short":"M.A. Kwan, B. Sudakov, International Mathematics Research Notices 2020 (2020) 1621–1638.","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."}},{"abstract":[{"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.","lang":"eng"}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1911.12878"}],"month":"06","intvolume":" 52","publication_identifier":{"issn":["0024-6093"],"eissn":["1469-2120"]},"publication_status":"published","language":[{"iso":"eng"}],"issue":"3","volume":52,"_id":"9573","type":"journal_article","article_type":"original","status":"public","date_updated":"2023-02-23T14:01:23Z","extern":"1","publisher":"Wiley","quality_controlled":"1","oa":1,"year":"2020","day":"01","publication":"Bulletin of the London Mathematical Society","page":"515-529","doi":"10.1112/blms.12345","date_published":"2020-06-01T00:00:00Z","date_created":"2021-06-21T06:23:42Z","citation":{"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.","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","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","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.","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."},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","author":[{"first_name":"Xiaoyu","last_name":"He","full_name":"He, Xiaoyu"},{"id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan","orcid":"0000-0002-4003-7567","full_name":"Kwan, Matthew Alan","last_name":"Kwan"}],"external_id":{"arxiv":["1911.12878"]},"article_processing_charge":"No","title":"Universality of random permutations"},{"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2020/hash/d1ff1ec86b62cd5f3903ff19c3a326b2-Abstract.html"}],"month":"12","intvolume":" 33","abstract":[{"lang":"eng","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."}],"oa_version":"Published Version","volume":33,"ec_funded":1,"publication_identifier":{"isbn":["9781713829546"],"issn":["10495258"]},"publication_status":"published","language":[{"iso":"eng"}],"type":"conference","conference":{"end_date":"2020-12-12","location":"Vancouver, Canada","start_date":"2020-12-06","name":"NeurIPS: Conference on Neural Information Processing Systems"},"status":"public","_id":"9632","department":[{"_id":"DaAl"},{"_id":"ToHe"}],"date_updated":"2023-02-23T14:03:06Z","publisher":"Curran Associates","quality_controlled":"1","oa":1,"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.","page":"18098-18109","date_published":"2020-12-06T00:00:00Z","date_created":"2021-07-04T22:01:26Z","year":"2020","day":"06","publication":"Advances in Neural Information Processing Systems","project":[{"grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"author":[{"id":"DD138E24-D89D-11E9-9DC0-DEF6E5697425","first_name":"Sidak Pal","full_name":"Singh, Sidak Pal","last_name":"Singh"},{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"}],"external_id":{"arxiv":["2004.14340"]},"article_processing_charge":"No","title":"WoodFisher: Efficient second-order approximation for neural network compression","citation":{"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.","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."},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf"},{"author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"id":"2E36B656-F248-11E8-B48F-1D18A9856A87","first_name":"Ziga","last_name":"Virk","full_name":"Virk, Ziga"},{"last_name":"Wagner","full_name":"Wagner, Hubert","first_name":"Hubert","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"Yes","title":"Topological data analysis in information space","citation":{"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","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.","short":"H. Edelsbrunner, Z. Virk, H. Wagner, Journal of Computational Geometry 11 (2020) 162–182.","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","project":[{"_id":"0aa4bc98-070f-11eb-9043-e6fff9c6a316","grant_number":"I4887","name":"Discretization in Geometry and Dynamics"}],"page":"162-182","doi":"10.20382/jocg.v11i2a7","date_published":"2020-12-14T00:00:00Z","date_created":"2021-07-04T22:01:26Z","has_accepted_license":"1","year":"2020","day":"14","publication":"Journal of Computational Geometry","publisher":"Carleton University","quality_controlled":"1","oa":1,"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).","file_date_updated":"2021-08-11T11:55:11Z","department":[{"_id":"HeEd"}],"date_updated":"2021-08-11T12:26:34Z","ddc":["510","000"],"type":"journal_article","article_type":"original","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","_id":"9630","issue":"2","volume":11,"publication_identifier":{"eissn":["1920180X"]},"publication_status":"published","file":[{"file_size":1449234,"date_updated":"2021-08-11T11:55:11Z","creator":"asandaue","file_name":"2020_JournalOfComputationalGeometry_Edelsbrunner.pdf","date_created":"2021-08-11T11:55:11Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"f02d0b2b3838e7891a6c417fc34ffdcd","file_id":"9882"}],"language":[{"iso":"eng"}],"scopus_import":"1","month":"12","intvolume":" 11","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"},{"project":[{"name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"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.","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.","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.","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."},"title":"Scalable belief propagation via relaxed scheduling","external_id":{"arxiv":["2002.11505"]},"article_processing_charge":"No","author":[{"full_name":"Aksenov, Vitaly","last_name":"Aksenov","first_name":"Vitaly"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh"},{"full_name":"Korhonen, Janne","last_name":"Korhonen","id":"C5402D42-15BC-11E9-A202-CA2BE6697425","first_name":"Janne"}],"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","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":"22361-22372","_id":"9631","status":"public","conference":{"name":"NeurIPS: Conference on Neural Information Processing Systems","start_date":"2020-12-06","end_date":"2020-12-12","location":"Vancouver, Canada"},"type":"conference","date_updated":"2023-02-23T14:03:03Z","department":[{"_id":"DaAl"}],"oa_version":"Published Version","abstract":[{"lang":"eng","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."}],"intvolume":" 33","month":"12","main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2020/hash/fdb2c3bab9d0701c4a050a4d8d782c7f-Abstract.html"}],"scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["10495258"],"isbn":["9781713829546"]},"ec_funded":1,"volume":33},{"page":"1981-1991","date_created":"2021-07-16T06:25:53Z","date_published":"2020-08-14T00:00:00Z","doi":"10.1021/acs.accounts.0c00403","year":"2020","publication":"Accounts of Chemical Research","day":"14","publisher":"American Chemical Society","quality_controlled":"1","article_processing_charge":"No","external_id":{"pmid":["32794697"]},"author":[{"id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","first_name":"Bingqing","last_name":"Cheng","orcid":"0000-0002-3584-9632","full_name":"Cheng, Bingqing"},{"last_name":"Griffiths","full_name":"Griffiths, Ryan-Rhys","first_name":"Ryan-Rhys"},{"first_name":"Simon","last_name":"Wengert","full_name":"Wengert, Simon"},{"first_name":"Christian","full_name":"Kunkel, Christian","last_name":"Kunkel"},{"first_name":"Tamas","last_name":"Stenczel","full_name":"Stenczel, Tamas"},{"full_name":"Zhu, Bonan","last_name":"Zhu","first_name":"Bonan"},{"first_name":"Volker L.","full_name":"Deringer, Volker L.","last_name":"Deringer"},{"last_name":"Bernstein","full_name":"Bernstein, Noam","first_name":"Noam"},{"first_name":"Johannes T.","last_name":"Margraf","full_name":"Margraf, Johannes T."},{"full_name":"Reuter, Karsten","last_name":"Reuter","first_name":"Karsten"},{"first_name":"Gabor","full_name":"Csanyi, Gabor","last_name":"Csanyi"}],"title":"Mapping materials and molecules","citation":{"ista":"Cheng B, Griffiths R-R, Wengert S, Kunkel C, Stenczel T, Zhu B, Deringer VL, Bernstein N, Margraf JT, Reuter K, Csanyi G. 2020. Mapping materials and molecules. Accounts of Chemical Research. 53(9), 1981–1991.","chicago":"Cheng, Bingqing, Ryan-Rhys Griffiths, Simon Wengert, Christian Kunkel, Tamas Stenczel, Bonan Zhu, Volker L. Deringer, et al. “Mapping Materials and Molecules.” Accounts of Chemical Research. American Chemical Society, 2020. https://doi.org/10.1021/acs.accounts.0c00403.","ieee":"B. Cheng et al., “Mapping materials and molecules,” Accounts of Chemical Research, vol. 53, no. 9. American Chemical Society, pp. 1981–1991, 2020.","short":"B. Cheng, R.-R. Griffiths, S. Wengert, C. Kunkel, T. Stenczel, B. Zhu, V.L. Deringer, N. Bernstein, J.T. Margraf, K. Reuter, G. Csanyi, Accounts of Chemical Research 53 (2020) 1981–1991.","ama":"Cheng B, Griffiths R-R, Wengert S, et al. Mapping materials and molecules. Accounts of Chemical Research. 2020;53(9):1981-1991. doi:10.1021/acs.accounts.0c00403","apa":"Cheng, B., Griffiths, R.-R., Wengert, S., Kunkel, C., Stenczel, T., Zhu, B., … Csanyi, G. (2020). Mapping materials and molecules. Accounts of Chemical Research. American Chemical Society. https://doi.org/10.1021/acs.accounts.0c00403","mla":"Cheng, Bingqing, et al. “Mapping Materials and Molecules.” Accounts of Chemical Research, vol. 53, no. 9, American Chemical Society, 2020, pp. 1981–91, doi:10.1021/acs.accounts.0c00403."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","volume":53,"issue":"9","publication_status":"published","publication_identifier":{"issn":["0001-4842"],"eissn":["1520-4898"]},"language":[{"iso":"eng"}],"scopus_import":"1","intvolume":" 53","month":"08","abstract":[{"lang":"eng","text":"The visualization of data is indispensable in scientific research, from the early stages when human insight forms to the final step of communicating results. In computational physics, chemistry and materials science, it can be as simple as making a scatter plot or as straightforward as looking through the snapshots of atomic positions manually. However, as a result of the \"big data\" revolution, these conventional approaches are often inadequate. The widespread adoption of high-throughput computation for materials discovery and the associated community-wide repositories have given rise to data sets that contain an enormous number of compounds and atomic configurations. A typical data set contains thousands to millions of atomic structures, along with a diverse range of properties such as formation energies, band gaps, or bioactivities.It would thus be desirable to have a data-driven and automated framework for visualizing and analyzing such structural data sets. The key idea is to construct a low-dimensional representation of the data, which facilitates navigation, reveals underlying patterns, and helps to identify data points with unusual attributes. Such data-intensive maps, often employing machine learning methods, are appearing more and more frequently in the literature. However, to the wider community, it is not always transparent how these maps are made and how they should be interpreted. Furthermore, while these maps undoubtedly serve a decorative purpose in academic publications, it is not always apparent what extra information can be garnered from reading or making them.This Account attempts to answer such questions. We start with a concise summary of the theory of representing chemical environments, followed by the introduction of a simple yet practical conceptual approach for generating structure maps in a generic and automated manner. Such analysis and mapping is made nearly effortless by employing the newly developed software tool ASAP. To showcase the applicability to a wide variety of systems in chemistry and materials science, we provide several illustrative examples, including crystalline and amorphous materials, interfaces, and organic molecules. In these examples, the maps not only help to sift through large data sets but also reveal hidden patterns that could be easily missed using conventional analyses.The explosion in the amount of computed information in chemistry and materials science has made visualization into a science in itself. Not only have we benefited from exploiting these visualization methods in previous works, we also believe that the automated mapping of data sets will in turn stimulate further creativity and exploration, as well as ultimately feed back into future advances in the respective fields."}],"oa_version":"None","pmid":1,"date_updated":"2021-11-24T15:54:41Z","extern":"1","type":"journal_article","article_type":"original","status":"public","_id":"9675"},{"extern":"1","ddc":["530"],"date_updated":"2023-02-23T14:04:16Z","file_date_updated":"2021-07-15T12:43:51Z","_id":"9666","status":"public","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)"},"file":[{"success":1,"file_id":"9667","checksum":"0a6872972b1b2e60f9095d39b01753fa","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"202_PhysicalChemistryChemicalPhysics_Reinhardt.pdf","date_created":"2021-07-15T12:43:51Z","creator":"asandaue","file_size":3151206,"date_updated":"2021-07-15T12:43:51Z"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1463-9084"],"issn":["1463-9076"]},"publication_status":"published","volume":22,"issue":"22","pmid":1,"oa_version":"Published Version","abstract":[{"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.","lang":"eng"}],"month":"06","intvolume":" 22","scopus_import":"1","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"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.","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.","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.","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.","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"},"title":"Predicting the phase diagram of titanium dioxide with random search and pattern recognition","author":[{"last_name":"Reinhardt","full_name":"Reinhardt, Aleks","first_name":"Aleks"},{"full_name":"Pickard, Chris J.","last_name":"Pickard","first_name":"Chris J."},{"last_name":"Cheng","full_name":"Cheng, Bingqing","orcid":"0000-0002-3584-9632","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","first_name":"Bingqing"}],"article_processing_charge":"No","external_id":{"pmid":["32459228"],"arxiv":["1909.08934"]},"day":"14","publication":"Physical Chemistry Chemical Physics","has_accepted_license":"1","year":"2020","doi":"10.1039/d0cp02513e","date_published":"2020-06-14T00:00:00Z","date_created":"2021-07-15T12:37:27Z","page":"12697-12705","quality_controlled":"1","publisher":"Royal Society of Chemistry","oa":1},{"file_date_updated":"2021-07-15T14:05:45Z","ddc":["530","540"],"extern":"1","date_updated":"2023-02-23T14:04:25Z","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":"9671","issue":"1","volume":11,"language":[{"iso":"eng"}],"file":[{"success":1,"file_id":"9672","checksum":"1edd9b6d8fa791f8094d87bd6453955b","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"2020_NatureCommunications_Monserrat.pdf","date_created":"2021-07-15T14:05:45Z","file_size":1385954,"date_updated":"2021-07-15T14:05:45Z","creator":"asandaue"}],"publication_status":"published","publication_identifier":{"eissn":["2041-1723"]},"intvolume":" 11","month":"11","scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","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."}],"title":"Liquid water contains the building blocks of diverse ice phases","article_processing_charge":"No","author":[{"first_name":"Bartomeu","last_name":"Monserrat","full_name":"Monserrat, Bartomeu"},{"first_name":"Jan Gerit","last_name":"Brandenburg","full_name":"Brandenburg, Jan Gerit"},{"last_name":"Engel","full_name":"Engel, Edgar A.","first_name":"Edgar A."},{"first_name":"Bingqing","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","last_name":"Cheng","orcid":"0000-0002-3584-9632","full_name":"Cheng, Bingqing"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"short":"B. Monserrat, J.G. Brandenburg, E.A. Engel, B. Cheng, Nature Communications 11 (2020).","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.","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."},"article_number":"5757","date_created":"2021-07-15T14:01:35Z","date_published":"2020-11-13T00:00:00Z","doi":"10.1038/s41467-020-19606-y","publication":"Nature Communications","day":"13","year":"2020","has_accepted_license":"1","oa":1,"quality_controlled":"1","publisher":"Springer Nature"},{"citation":{"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.","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.","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","external_id":{"arxiv":["2007.02894"]},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus"},{"first_name":"Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","last_name":"Jecker","full_name":"Jecker, Ismael R"},{"id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","first_name":"Jakub","full_name":"Svoboda, Jakub","last_name":"Svoboda"}],"title":"Simplified game of life: Algorithms and complexity","article_number":"22:1-22:13","project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}],"year":"2020","has_accepted_license":"1","publication":"45th International Symposium on Mathematical Foundations of Computer Science","day":"18","date_created":"2020-09-20T22:01:36Z","doi":"10.4230/LIPIcs.MFCS.2020.22","date_published":"2020-08-18T00:00:00Z","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.","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_updated":"2021-01-12T08:19:55Z","ddc":["000"],"file_date_updated":"2020-09-21T13:57:34Z","department":[{"_id":"KrCh"}],"_id":"8533","conference":{"start_date":"2020-08-24","location":"Prague, Czech Republic","end_date":"2020-08-28","name":"MFCS: Symposium on Mathematical Foundations of Computer Science"},"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","publication_status":"published","publication_identifier":{"isbn":["9783959771597"],"issn":["18688969"]},"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"}],"ec_funded":1,"volume":170,"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","alternative_title":["LIPIcs"],"scopus_import":"1","intvolume":" 170","month":"08"},{"_id":"8534","type":"conference","conference":{"start_date":"2020-08-24","location":"Prague, Czech Republic","end_date":"2020-08-28","name":"MFCS: Symposium on Mathematical Foundations of Computer Science"},"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-01-12T08:19:56Z","ddc":["000"],"department":[{"_id":"KrCh"}],"file_date_updated":"2020-09-21T14:17:08Z","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","alternative_title":["LIPIcs"],"scopus_import":"1","month":"08","intvolume":" 170","publication_identifier":{"isbn":["9783959771597"],"issn":["18688969"]},"publication_status":"published","file":[{"creator":"dernst","file_size":597977,"date_updated":"2020-09-21T14:17:08Z","file_name":"2020_LIPIcsMFCS_Jecker.pdf","date_created":"2020-09-21T14:17:08Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"8552","checksum":"2dc9e2fad6becd4563aef3e27a473f70"}],"language":[{"iso":"eng"}],"volume":170,"ec_funded":1,"article_number":"51:1-51:12","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"citation":{"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.","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","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.","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Jecker, Ismael R","last_name":"Jecker","first_name":"Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425"},{"last_name":"Kupferman","full_name":"Kupferman, Orna","first_name":"Orna"},{"first_name":"Nicolas","last_name":"Mazzocchi","full_name":"Mazzocchi, Nicolas"}],"article_processing_charge":"No","title":"Unary prime languages","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.","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"has_accepted_license":"1","year":"2020","day":"18","publication":"45th International Symposium on Mathematical Foundations of Computer Science","doi":"10.4230/LIPIcs.MFCS.2020.51","date_published":"2020-08-18T00:00:00Z","date_created":"2020-09-20T22:01:36Z"},{"year":"2020","publication":"European Journal of Mathematics","day":"09","date_created":"2020-09-20T22:01:38Z","date_published":"2020-09-09T00:00:00Z","doi":"10.1007/s40879-020-00426-9","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","citation":{"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.","ista":"Akopyan A, Schwartz R, Tabachnikov S. 2020. Billiards in ellipses revisited. European Journal of Mathematics.","mla":"Akopyan, Arseniy, et al. “Billiards in Ellipses Revisited.” European Journal of Mathematics, Springer Nature, 2020, doi: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","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","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."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","external_id":{"arxiv":["2001.02934"]},"article_processing_charge":"No","author":[{"first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","last_name":"Akopyan","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy"},{"first_name":"Richard","full_name":"Schwartz, Richard","last_name":"Schwartz"},{"first_name":"Serge","full_name":"Tabachnikov, Serge","last_name":"Tabachnikov"}],"title":"Billiards in ellipses revisited","project":[{"call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","name":"Alpha Shape Theory Extended"}],"publication_status":"published","publication_identifier":{"issn":["2199-675X"],"eissn":["2199-6768"]},"language":[{"iso":"eng"}],"ec_funded":1,"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"}],"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/2001.02934","open_access":"1"}],"scopus_import":"1","month":"09","date_updated":"2021-12-02T15:10:17Z","department":[{"_id":"HeEd"}],"_id":"8538","article_type":"original","type":"journal_article","status":"public"},{"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/2020.09.15.262782"}],"publisher":"Cold Spring Harbor Laboratory","month":"09","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"}],"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.","oa_version":"Preprint","ec_funded":1,"date_created":"2020-10-06T08:58:59Z","date_published":"2020-09-15T00:00:00Z","doi":"10.1101/2020.09.15.262782","year":"2020","publication_status":"submitted","language":[{"iso":"eng"}],"publication":"bioRxiv","day":"15","type":"preprint","project":[{"name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development","grant_number":"725780","_id":"260018B0-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"status":"public","_id":"8616","article_processing_charge":"No","author":[{"last_name":"Gao","full_name":"Gao, Xiaofei","first_name":"Xiaofei"},{"first_name":"Jun-Liszt","last_name":"Li","full_name":"Li, Jun-Liszt"},{"full_name":"Chen, Xingjun","last_name":"Chen","first_name":"Xingjun"},{"last_name":"Ci","full_name":"Ci, Bo","first_name":"Bo"},{"first_name":"Fei","full_name":"Chen, Fei","last_name":"Chen"},{"last_name":"Lu","full_name":"Lu, Nannan","first_name":"Nannan"},{"full_name":"Shen, Bo","last_name":"Shen","first_name":"Bo"},{"first_name":"Lijun","full_name":"Zheng, Lijun","last_name":"Zheng"},{"full_name":"Jia, Jie-Min","last_name":"Jia","first_name":"Jie-Min"},{"last_name":"Yi","full_name":"Yi, Yating","first_name":"Yating"},{"first_name":"Shiwen","last_name":"Zhang","full_name":"Zhang, Shiwen"},{"first_name":"Ying-Chao","last_name":"Shi","full_name":"Shi, Ying-Chao"},{"full_name":"Shi, Kaibin","last_name":"Shi","first_name":"Kaibin"},{"first_name":"Nicholas E","full_name":"Propson, Nicholas E","last_name":"Propson"},{"first_name":"Yubin","full_name":"Huang, Yubin","last_name":"Huang"},{"first_name":"Katherine","last_name":"Poinsatte","full_name":"Poinsatte, Katherine"},{"first_name":"Zhaohuan","full_name":"Zhang, Zhaohuan","last_name":"Zhang"},{"last_name":"Yue","full_name":"Yue, Yuanlei","first_name":"Yuanlei"},{"first_name":"Dale B","last_name":"Bosco","full_name":"Bosco, Dale B"},{"first_name":"Ying-mei","full_name":"Lu, Ying-mei","last_name":"Lu"},{"first_name":"Shi-bing","last_name":"Yang","full_name":"Yang, Shi-bing"},{"first_name":"Ralf H.","last_name":"Adams","full_name":"Adams, Ralf H."},{"full_name":"Lindner, Volkhard","last_name":"Lindner","first_name":"Volkhard"},{"first_name":"Fen","last_name":"Huang","full_name":"Huang, Fen"},{"full_name":"Wu, Long-Jun","last_name":"Wu","first_name":"Long-Jun"},{"full_name":"Zheng, Hui","last_name":"Zheng","first_name":"Hui"},{"full_name":"Han, Feng","last_name":"Han","first_name":"Feng"},{"id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061","last_name":"Hippenmeyer"},{"first_name":"Ann M.","full_name":"Stowe, Ann M.","last_name":"Stowe"},{"first_name":"Bo","last_name":"Peng","full_name":"Peng, Bo"},{"last_name":"Margeta","full_name":"Margeta, Marta","first_name":"Marta"},{"first_name":"Xiaoqun","full_name":"Wang, Xiaoqun","last_name":"Wang"},{"first_name":"Qiang","last_name":"Liu","full_name":"Liu, Qiang"},{"last_name":"Körbelin","full_name":"Körbelin, Jakob","first_name":"Jakob"},{"full_name":"Trepel, Martin","last_name":"Trepel","first_name":"Martin"},{"first_name":"Hui","full_name":"Lu, Hui","last_name":"Lu"},{"first_name":"Bo O.","last_name":"Zhou","full_name":"Zhou, Bo O."},{"last_name":"Zhao","full_name":"Zhao, Hu","first_name":"Hu"},{"last_name":"Su","full_name":"Su, Wenzhi","first_name":"Wenzhi"},{"first_name":"Robert M.","last_name":"Bachoo","full_name":"Bachoo, Robert M."},{"full_name":"Ge, Woo-ping","last_name":"Ge","first_name":"Woo-ping"}],"title":"Reduction of neuronal activity mediated by blood-vessel regression in the brain","department":[{"_id":"SiHi"}],"date_updated":"2021-01-12T08:20:19Z","citation":{"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.","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.","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","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","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.).","ieee":"X. Gao et al., “Reduction of neuronal activity mediated by blood-vessel regression in the brain,” bioRxiv. Cold Spring Harbor Laboratory.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"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","status":"public","_id":"8695","article_processing_charge":"No","author":[{"first_name":"Katja","full_name":"Mayer, Katja","last_name":"Mayer"},{"last_name":"Rieck","full_name":"Rieck, Katharina","first_name":"Katharina"},{"full_name":"Reichmann, Stefan","last_name":"Reichmann","first_name":"Stefan"},{"last_name":"Danowski","full_name":"Danowski, Patrick","orcid":"0000-0002-6026-4409","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","first_name":"Patrick"},{"first_name":"Anton","full_name":"Graschopf, Anton","last_name":"Graschopf"},{"first_name":"Thomas","last_name":"König","full_name":"König, Thomas"},{"full_name":"Kraker, Peter","last_name":"Kraker","first_name":"Peter"},{"first_name":"Patrick","last_name":"Lehner","full_name":"Lehner, Patrick"},{"full_name":"Reckling, Falk","last_name":"Reckling","first_name":"Falk"},{"last_name":"Ross-Hellauer","full_name":"Ross-Hellauer, Tony","first_name":"Tony"},{"first_name":"Daniel","last_name":"Spichtinger","full_name":"Spichtinger, Daniel"},{"first_name":"Michalis","last_name":"Tzatzanis","full_name":"Tzatzanis, Michalis"},{"first_name":"Stefanie","last_name":"Schürz","full_name":"Schürz, Stefanie"}],"title":"Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria","file_date_updated":"2020-10-23T09:29:45Z","department":[{"_id":"E-Lib"}],"date_updated":"2020-10-23T09:34:40Z","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["020"],"oa":1,"publisher":"OANA","month":"10","abstract":[{"lang":"eng","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":"ger","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."}],"oa_version":"Published Version","page":"36","date_created":"2020-10-23T09:08:28Z","doi":"10.5281/ZENODO.4109242","date_published":"2020-10-21T00:00:00Z","publication_status":"published","year":"2020","has_accepted_license":"1","language":[{"iso":"ger"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"8696","checksum":"8eba912bb4b20b4f82f8010f2110461a","creator":"dernst","file_size":2298363,"date_updated":"2020-10-23T09:29:45Z","file_name":"2020_OANA_Mayer.pdf","date_created":"2020-10-23T09:29:45Z"}],"day":"21"},{"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.","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","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","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.","short":"A. Golmakani, E. Koudjinan, S. Luzzatto, P. Pilarczyk, Chaos 30 (2020).","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2004.13444"]},"article_processing_charge":"No","author":[{"first_name":"Ali","last_name":"Golmakani","full_name":"Golmakani, Ali"},{"first_name":"Edmond","id":"52DF3E68-AEFA-11EA-95A4-124A3DDC885E","full_name":"Koudjinan, Edmond","orcid":"0000-0003-2640-4049","last_name":"Koudjinan"},{"full_name":"Luzzatto, Stefano","last_name":"Luzzatto","first_name":"Stefano"},{"last_name":"Pilarczyk","full_name":"Pilarczyk, Pawel","first_name":"Pawel"}],"title":"Rigorous numerics for critical orbits in the quadratic family","article_number":"073143","year":"2020","publication":"Chaos","day":"31","date_created":"2020-10-21T15:43:05Z","date_published":"2020-07-31T00:00:00Z","doi":"10.1063/5.0012822","oa":1,"publisher":"AIP","quality_controlled":"1","date_updated":"2021-01-12T08:20:34Z","extern":"1","_id":"8694","type":"journal_article","article_type":"original","status":"public","publication_status":"published","language":[{"iso":"eng"}],"volume":30,"issue":"7","abstract":[{"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.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2004.13444"}],"intvolume":" 30","month":"07"},{"author":[{"first_name":"Edmond","id":"52DF3E68-AEFA-11EA-95A4-124A3DDC885E","full_name":"Koudjinan, Edmond","orcid":"0000-0003-2640-4049","last_name":"Koudjinan"}],"external_id":{"arxiv":["1909.04099"]},"article_processing_charge":"No","title":"A KAM theorem for finitely differentiable Hamiltonian systems","citation":{"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.","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","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.","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.","ista":"Koudjinan E. 2020. A KAM theorem for finitely differentiable Hamiltonian systems. Journal of Differential Equations. 269(6), 4720–4750."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"Elsevier","oa":1,"page":"4720-4750","date_published":"2020-09-05T00:00:00Z","doi":"10.1016/j.jde.2020.03.044","date_created":"2020-10-21T15:03:05Z","year":"2020","day":"05","publication":"Journal of Differential Equations","type":"journal_article","article_type":"original","status":"public","keyword":["Analysis"],"_id":"8691","date_updated":"2021-01-12T08:20:33Z","extern":"1","main_file_link":[{"url":"https://arxiv.org/abs/1909.04099","open_access":"1"}],"month":"09","intvolume":" 269","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."}],"oa_version":"Preprint","volume":269,"issue":"6","publication_identifier":{"issn":["0022-0396"]},"publication_status":"published","language":[{"iso":"eng"}]},{"file_date_updated":"2020-10-27T16:27:25Z","department":[{"_id":"E-Lib"}],"date_updated":"2021-01-12T08:20:40Z","ddc":["020"],"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","_id":"8706","issue":"2","volume":73,"publication_identifier":{"eissn":["10222588"]},"publication_status":"published","file":[{"checksum":"37443c34d91d5bdbeb38c78b14792537","file_id":"8714","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2020-10-27T16:27:25Z","file_name":"2020_VOEB_Danowski.pdf","date_updated":"2020-10-27T16:27:25Z","file_size":960317,"creator":"kschuh"}],"language":[{"iso":"ger"}],"scopus_import":"1","month":"07","intvolume":" 73","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."},{"lang":"ger","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."}],"oa_version":"Published Version","author":[{"id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","first_name":"Patrick","full_name":"Danowski, Patrick","orcid":"0000-0002-6026-4409","last_name":"Danowski"},{"full_name":"Ferus, Andreas","last_name":"Ferus","first_name":"Andreas"},{"last_name":"Hikl","full_name":"Hikl, Anna-Laetitia","first_name":"Anna-Laetitia"},{"first_name":"Gerda","last_name":"McNeill","full_name":"McNeill, Gerda"},{"first_name":"Clemens","last_name":"Miniberger","full_name":"Miniberger, Clemens"},{"first_name":"Steve","last_name":"Reding","full_name":"Reding, Steve"},{"first_name":"Tobias","last_name":"Zarka","full_name":"Zarka, Tobias"},{"first_name":"Michael","last_name":"Zojer","full_name":"Zojer, Michael"}],"article_processing_charge":"No","title":"„Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B","citation":{"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.","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.","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","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","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","page":"278-284","doi":"10.31263/voebm.v73i2.3941","date_published":"2020-07-14T00:00:00Z","date_created":"2020-10-25T23:01:19Z","has_accepted_license":"1","year":"2020","day":"14","publication":"Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","publisher":"Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare","quality_controlled":"1","oa":1},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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","short":"S. Laukoter, N. Amberg, F. Pauler, S. Hippenmeyer, STAR Protocols 1 (2020).","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.","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."},"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":[{"full_name":"Laukoter, Susanne","last_name":"Laukoter","id":"2D6B7A9A-F248-11E8-B48F-1D18A9856A87","first_name":"Susanne"},{"first_name":"Nicole","id":"4CD6AAC6-F248-11E8-B48F-1D18A9856A87","last_name":"Amberg","full_name":"Amberg, Nicole","orcid":"0000-0002-3183-8207"},{"last_name":"Pauler","full_name":"Pauler, Florian","first_name":"Florian","id":"48EA0138-F248-11E8-B48F-1D18A9856A87"},{"id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","last_name":"Hippenmeyer","full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061"}],"article_number":"100215","project":[{"grant_number":"T0101031","name":"Role of Eed in neural stem cell lineage progression","call_identifier":"FWF","_id":"268F8446-B435-11E9-9278-68D0E5697425"},{"name":"Molecular Mechanisms of Neural Stem Cell Lineage Progression","grant_number":"F07805","_id":"059F6AB4-7A3F-11EA-A408-12923DDC885E"},{"_id":"25D92700-B435-11E9-9278-68D0E5697425","grant_number":"LS13-002","name":"Mapping Cell-Type Specificity of the Genomic Imprintome in the Brain"},{"grant_number":"618444","name":"Molecular Mechanisms of Cerebral Cortex Development","call_identifier":"FP7","_id":"25D61E48-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","_id":"260018B0-B435-11E9-9278-68D0E5697425","grant_number":"725780","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development"}],"publication":"STAR Protocols","day":"18","year":"2020","has_accepted_license":"1","date_created":"2020-12-30T10:17:07Z","date_published":"2020-12-18T00:00:00Z","doi":"10.1016/j.xpro.2020.100215","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","ddc":["570"],"date_updated":"2021-01-12T08:21:36Z","department":[{"_id":"SiHi"}],"file_date_updated":"2021-01-07T15:57:27Z","_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","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"8996","checksum":"f1e9a433e9cb0f41f7b6df6b76db1f6e","success":1,"date_updated":"2021-01-07T15:57:27Z","file_size":4031449,"creator":"dernst","date_created":"2021-01-07T15:57:27Z","file_name":"2020_STARProtocols_Laukoter.pdf"}],"publication_status":"published","publication_identifier":{"issn":["2666-1667"]},"ec_funded":1,"issue":"3","volume":1,"oa_version":"Published Version","pmid":1,"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"},{"author":[{"first_name":"Mena","last_name":"Youssef","full_name":"Youssef, Mena"},{"first_name":"Alexandre","full_name":"Morin, Alexandre","last_name":"Morin"},{"full_name":"Aubret, Antoine","last_name":"Aubret","first_name":"Antoine"},{"full_name":"Sacanna, Stefano","last_name":"Sacanna","first_name":"Stefano"},{"first_name":"Jérémie A","id":"8fb92548-2b22-11eb-b7c1-a3f0d08d7c7d","last_name":"Palacci","orcid":"0000-0002-7253-9465","full_name":"Palacci, Jérémie A"}],"article_processing_charge":"No","external_id":{"pmid":["32307507"]},"title":"Rapid characterization of neutral polymer brush with a conventional zetameter and a variable pinch of salt","citation":{"mla":"Youssef, Mena, et al. “Rapid Characterization of Neutral Polymer Brush with a Conventional Zetameter and a Variable Pinch of Salt.” Soft Matter, vol. 16, no. 17, Royal Society of Chemistry , 2020, pp. 4274–82, doi:10.1039/c9sm01850f.","short":"M. Youssef, A. Morin, A. Aubret, S. Sacanna, J.A. Palacci, Soft Matter 16 (2020) 4274–4282.","ieee":"M. Youssef, A. Morin, A. Aubret, S. Sacanna, and J. A. Palacci, “Rapid characterization of neutral polymer brush with a conventional zetameter and a variable pinch of salt,” Soft Matter, vol. 16, no. 17. Royal Society of Chemistry , pp. 4274–4282, 2020.","ama":"Youssef M, Morin A, Aubret A, Sacanna S, Palacci JA. Rapid characterization of neutral polymer brush with a conventional zetameter and a variable pinch of salt. Soft Matter. 2020;16(17):4274-4282. doi:10.1039/c9sm01850f","apa":"Youssef, M., Morin, A., Aubret, A., Sacanna, S., & Palacci, J. A. (2020). Rapid characterization of neutral polymer brush with a conventional zetameter and a variable pinch of salt. Soft Matter. Royal Society of Chemistry . https://doi.org/10.1039/c9sm01850f","chicago":"Youssef, Mena, Alexandre Morin, Antoine Aubret, Stefano Sacanna, and Jérémie A Palacci. “Rapid Characterization of Neutral Polymer Brush with a Conventional Zetameter and a Variable Pinch of Salt.” Soft Matter. Royal Society of Chemistry , 2020. https://doi.org/10.1039/c9sm01850f.","ista":"Youssef M, Morin A, Aubret A, Sacanna S, Palacci JA. 2020. Rapid characterization of neutral polymer brush with a conventional zetameter and a variable pinch of salt. Soft Matter. 16(17), 4274–4282."},"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","page":"4274-4282","date_published":"2020-05-07T00:00:00Z","doi":"10.1039/c9sm01850f","date_created":"2021-02-01T13:45:11Z","year":"2020","day":"07","publication":"Soft Matter","publisher":"Royal Society of Chemistry ","quality_controlled":"1","date_updated":"2023-02-23T13:47:45Z","extern":"1","type":"journal_article","article_type":"original","status":"public","keyword":["General Chemistry","Condensed Matter Physics"],"_id":"9054","volume":16,"issue":"17","publication_identifier":{"issn":["1744-683X"],"eissn":["1744-6848"]},"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","month":"05","intvolume":" 16","abstract":[{"text":"The fundamental and practical importance of particle stabilization has motivated various characterization methods for studying polymer brushes on particle surfaces. In this work, we show how one can perform sensitive measurements of neutral polymer coating on colloidal particles using a commercial zetameter and salt solutions. By systematically varying the Debye length, we study the mobility of the polymer-coated particles in an applied electric field and show that the electrophoretic mobility of polymer-coated particles normalized by the mobility of non-coated particles is entirely controlled by the polymer brush and independent of the native surface charge, here controlled with pH, or the surface–ion interaction. Our result is rationalized with a simple hydrodynamic model, allowing for the estimation of characteristics of the polymer coating: the brush length L, and the Brinkman length ξ, determined by its resistance to flows. We demonstrate that the Debye layer provides a convenient and faithful probe to the characterization of polymer coatings on particles. Because the method simply relies on a conventional zetameter, it is widely accessible and offers a practical tool to rapidly probe neutral polymer brushes, an asset in the development and utilization of polymer-coated colloidal particles.","lang":"eng"}],"oa_version":"None","pmid":1},{"oa_version":"None","abstract":[{"text":"In the quest for alternate and efficient electrode materials, ternary metal electrocatalysts (TMEs), part of the perovskite family, were synthesized and tested for methanol electro-oxidation in alkaline media. La0.5Ca0.5MO3 (M = Ni, Co, or Mn) was synthesized via sol-gel method. X-ray diffraction analysis revealed that the perovskite crystal structure possesses characteristic sharp and crystalline peaks for all synthesized ternary electrocatalysts. The average particle size calculated using Debye–Scherrer equation was in the order of La0.5Ca0.5NiO3 (LCNO) > La0.5Ca0.5CoO3 (LCCO)> La0.5Ca0.5MnO3 (LCMO). The elemental composition of as prepared sample, LCCO was investigated via x-ray fluorescence spectroscopy. The qualitative and quantitative analysis revealed the presence of La, Ca and Co in parent crystal structure with percentage compositions of 9.0, 3.12 and 87.82% respectively. The particle size distribution was homogenous, as determined by scanning electron and transmission electron microscopes. The electrocatalytic activity of the synthesized ternary electrocatalysts was studied electrochemically by cyclic voltammetry. The calculated diffusion coefficient values showed that electrode surface of LCNO and LCCO have limited efficiency for diffusion related phenomenon. The heterogeneous rate constants inferred better electrode kinetics of LCCO and LCNO which exhibited good electrocatalytic behavior; sharp anodic peaks were observed in the potential range of +0.3 to 0.6 V and +0.6 to 0.8 V, respectively. Methanol electro-oxidation was found minimal in case of LCMO sample. We have observed that Co substitution at B-site of perovskite electrode materials attains better electrochemical properties, thus in relation with reported literature.","lang":"eng"}],"month":"01","intvolume":" 6","quality_controlled":"1","publisher":"IOP Publishing","day":"15","publication":"Materials Research Express","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2053-1591"]},"year":"2020","publication_status":"published","date_published":"2020-01-15T00:00:00Z","issue":"12","volume":6,"doi":"10.1088/2053-1591/ab6886","date_created":"2021-02-02T15:53:57Z","article_number":"1250g6","_id":"9069","status":"public","keyword":["Electronic","Optical and Magnetic Materials","Surfaces","Coatings and Films","Polymers and Plastics","Metals and Alloys","Biomaterials"],"type":"journal_article","article_type":"original","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-02-04T07:21:35Z","citation":{"mla":"Hussain, Tayyaba, et al. “Synthesis of Ternary Electrocatalysts for Exploration of Methanol Electro-Oxidation in Alkaline Media.” Materials Research Express, vol. 6, no. 12, 1250g6, IOP Publishing, 2020, doi:10.1088/2053-1591/ab6886.","apa":"Hussain, T., Nauman, M., Sabahat, S., & Arif, S. (2020). Synthesis of ternary electrocatalysts for exploration of methanol electro-oxidation in alkaline media. Materials Research Express. IOP Publishing. https://doi.org/10.1088/2053-1591/ab6886","ama":"Hussain T, Nauman M, Sabahat S, Arif S. Synthesis of ternary electrocatalysts for exploration of methanol electro-oxidation in alkaline media. Materials Research Express. 2020;6(12). doi:10.1088/2053-1591/ab6886","ieee":"T. Hussain, M. Nauman, S. Sabahat, and S. Arif, “Synthesis of ternary electrocatalysts for exploration of methanol electro-oxidation in alkaline media,” Materials Research Express, vol. 6, no. 12. IOP Publishing, 2020.","short":"T. Hussain, M. Nauman, S. Sabahat, S. Arif, Materials Research Express 6 (2020).","chicago":"Hussain, Tayyaba, Muhammad Nauman, Sana Sabahat, and Saira Arif. “Synthesis of Ternary Electrocatalysts for Exploration of Methanol Electro-Oxidation in Alkaline Media.” Materials Research Express. IOP Publishing, 2020. https://doi.org/10.1088/2053-1591/ab6886.","ista":"Hussain T, Nauman M, Sabahat S, Arif S. 2020. Synthesis of ternary electrocatalysts for exploration of methanol electro-oxidation in alkaline media. Materials Research Express. 6(12), 1250g6."},"title":"Synthesis of ternary electrocatalysts for exploration of methanol electro-oxidation in alkaline media","author":[{"last_name":"Hussain","full_name":"Hussain, Tayyaba","first_name":"Tayyaba"},{"id":"32c21954-2022-11eb-9d5f-af9f93c24e71","first_name":"Muhammad","orcid":"0000-0002-2111-4846","full_name":"Nauman, Muhammad","last_name":"Nauman"},{"first_name":"Sana","full_name":"Sabahat, Sana","last_name":"Sabahat"},{"full_name":"Arif, Saira","last_name":"Arif","first_name":"Saira"}],"article_processing_charge":"No"},{"citation":{"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.","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.","short":"M. Nauman, M.H. Alnasir, M.A. Hamayun, Y. Wang, M. Shatruk, S. Manzoor, RSC Advances 10 (2020) 28383–28389.","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","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Muhammad","id":"32c21954-2022-11eb-9d5f-af9f93c24e71","last_name":"Nauman","full_name":"Nauman, Muhammad","orcid":"0000-0002-2111-4846"},{"full_name":"Alnasir, Muhammad Hisham","last_name":"Alnasir","first_name":"Muhammad Hisham"},{"last_name":"Hamayun","full_name":"Hamayun, Muhammad Asif","first_name":"Muhammad Asif"},{"last_name":"Wang","full_name":"Wang, YiXu","first_name":"YiXu"},{"last_name":"Shatruk","full_name":"Shatruk, Michael","first_name":"Michael"},{"last_name":"Manzoor","full_name":"Manzoor, Sadia","first_name":"Sadia"}],"article_processing_charge":"No","title":"Size-dependent magnetic and magnetothermal properties of gadolinium silicide nanoparticles","publisher":"Royal Society of Chemistry","quality_controlled":"1","oa":1,"year":"2020","day":"29","publication":"RSC Advances","page":"28383-28389","doi":"10.1039/d0ra05394e","date_published":"2020-07-29T00:00:00Z","date_created":"2021-02-02T15:51:23Z","_id":"9067","type":"journal_article","article_type":"original","status":"public","keyword":["General Chemistry","General Chemical Engineering"],"date_updated":"2021-02-04T07:16:37Z","extern":"1","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."}],"oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1039/d0ra05394e"}],"month":"07","intvolume":" 10","publication_identifier":{"issn":["2046-2069"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":10,"issue":"47"},{"_id":"9103","type":"conference","conference":{"name":"CDC: Conference on Decision and Control","end_date":"2020-12-18","location":"Jeju Islang, Korea (South)","start_date":"2020-12-14"},"status":"public","date_updated":"2021-02-09T09:20:58Z","department":[{"_id":"ToHe"}],"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":[{"open_access":"1","url":"https://arxiv.org/abs/2012.07458"}],"month":"12","intvolume":" 2020","publication_identifier":{"isbn":["9781728174471"],"issn":["07431546"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":2020,"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"}],"citation":{"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.","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.","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.","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","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","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Sophie","full_name":"Gruenbacher, Sophie","last_name":"Gruenbacher"},{"last_name":"Cyranka","full_name":"Cyranka, Jacek","first_name":"Jacek"},{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias","last_name":"Lechner"},{"first_name":"Md Ariful","full_name":"Islam, Md Ariful","last_name":"Islam"},{"first_name":"Scott A.","last_name":"Smolka","full_name":"Smolka, Scott A."},{"first_name":"Radu","full_name":"Grosu, Radu","last_name":"Grosu"}],"article_processing_charge":"No","external_id":{"arxiv":["2012.07458"]},"title":"Lagrangian reachtubes: The next generation","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,"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"},{"article_type":"original","type":"journal_article","status":"public","keyword":["Atmospheric Science"],"_id":"9129","author":[{"first_name":"Sara","last_name":"Shamekh","full_name":"Shamekh, Sara"},{"last_name":"Muller","orcid":"0000-0001-5836-5350","full_name":"Muller, Caroline J","first_name":"Caroline J","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b"},{"first_name":"Jean-Philippe","full_name":"Duvel, Jean-Philippe","last_name":"Duvel"},{"last_name":"D’Andrea","full_name":"D’Andrea, Fabio","first_name":"Fabio"}],"article_processing_charge":"No","title":"How do ocean warm anomalies favor the aggregation of deep convective clouds?","citation":{"chicago":"Shamekh, Sara, Caroline J Muller, Jean-Philippe Duvel, and Fabio D’Andrea. “How Do Ocean Warm Anomalies Favor the Aggregation of Deep Convective Clouds?” Journal of the Atmospheric Sciences. American Meteorological Society, 2020. https://doi.org/10.1175/jas-d-18-0369.1.","ista":"Shamekh S, Muller CJ, Duvel J-P, D’Andrea F. 2020. How do ocean warm anomalies favor the aggregation of deep convective clouds? Journal of the Atmospheric Sciences. 77(11), 3733–3745.","mla":"Shamekh, Sara, et al. “How Do Ocean Warm Anomalies Favor the Aggregation of Deep Convective Clouds?” Journal of the Atmospheric Sciences, vol. 77, no. 11, American Meteorological Society, 2020, pp. 3733–45, doi:10.1175/jas-d-18-0369.1.","ama":"Shamekh S, Muller CJ, Duvel J-P, D’Andrea F. How do ocean warm anomalies favor the aggregation of deep convective clouds? Journal of the Atmospheric Sciences. 2020;77(11):3733-3745. doi:10.1175/jas-d-18-0369.1","apa":"Shamekh, S., Muller, C. J., Duvel, J.-P., & D’Andrea, F. (2020). How do ocean warm anomalies favor the aggregation of deep convective clouds? Journal of the Atmospheric Sciences. American Meteorological Society. https://doi.org/10.1175/jas-d-18-0369.1","short":"S. Shamekh, C.J. Muller, J.-P. Duvel, F. D’Andrea, Journal of the Atmospheric Sciences 77 (2020) 3733–3745.","ieee":"S. Shamekh, C. J. Muller, J.-P. Duvel, and F. D’Andrea, “How do ocean warm anomalies favor the aggregation of deep convective clouds?,” Journal of the Atmospheric Sciences, vol. 77, no. 11. American Meteorological Society, pp. 3733–3745, 2020."},"date_updated":"2022-01-24T12:30:26Z","extern":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publisher":"American Meteorological Society","quality_controlled":"1","month":"11","intvolume":" 77","abstract":[{"lang":"eng","text":"We investigate the role of a warm sea surface temperature (SST) anomaly (hot spot of typically 3 to 5 K) on the aggregation of convection using cloud-resolving simulations in a nonrotating framework. It is well known that SST gradients can spatially organize convection. Even with uniform SST, the spontaneous self-aggregation of convection is possible above a critical SST (here 295 K), arising mainly from radiative feedbacks. We investigate how a circular hot spot helps organize convection, and how self-aggregation feedbacks modulate this organization. The hot spot significantly accelerates aggregation, particularly for warmer/larger hot spots, and extends the range of SSTs for which aggregation occurs; however, at cold SST (290 K) the aggregated cluster disaggregates if we remove the hot spot. A large convective instability over the hot spot leads to stronger convection and generates a large-scale circulation which forces the subsidence drying outside the hot spot. Indeed, convection over the hot spot brings the atmosphere toward a warmer temperature. The warmer temperatures are imprinted over the whole domain by gravity waves and subsidence warming. The initial transient warming and concomitant subsidence drying suppress convection outside the hot spot, thus driving the aggregation. The hot-spot-induced large-scale circulation can enforce the aggregation even without radiative feedbacks for hot spots sufficiently large/warm. The strength of the large-scale circulation, which defines the speed of aggregation, is a function of the hot spot fractional area. At equilibrium, once the aggregation is well established, the moist convective region with upward midtropospheric motion, centered over the hot spot, has an area surprisingly independent of the hot spot size."}],"oa_version":"None","page":"3733-3745","issue":"11","volume":77,"date_published":"2020-11-01T00:00:00Z","doi":"10.1175/jas-d-18-0369.1","date_created":"2021-02-15T14:07:30Z","publication_identifier":{"issn":["0022-4928","1520-0469"]},"publication_status":"published","year":"2020","day":"01","language":[{"iso":"eng"}],"publication":"Journal of the Atmospheric Sciences"},{"doi":"10.1093/oso/9780198855217.003.0002","date_published":"2020-03-01T00:00:00Z","volume":109,"date_created":"2021-02-15T14:15:38Z","day":"01","language":[{"iso":"eng"}],"publication":"Fundamental Aspects of Turbulent Flows in Climate Dynamics","publication_identifier":{"isbn":["978-0-1988-5521-7"]},"year":"2020","publication_status":"published","month":"03","intvolume":" 109","alternative_title":["Lecture Notes of the Les Houches Summer School"],"quality_controlled":"1","publisher":"Oxford University Press","oa_version":"None","abstract":[{"lang":"eng","text":"We see them in our everyday lives. They make skies and sunsets even more beautiful, inspiring painters all over the world. But what are clouds? What are the physical processes occurring within a cloud? Do they all look alike, or are there different types of clouds? Why? Beyond our small human scale, how are clouds distributed at large, planetary scales? How do they couple and interact with the large-scale circulation of the atmosphere? What do the physics of cloud formation tell us about the hydrological cycle, including mean and extreme precipitation, in our current climate and in a warming world? What role do they play in the global energetics of the planet, for instance by reflecting the incoming shortwave radiation from the Sun, and by reducing the outgoing longwave radiation to space, because of their high altitudes and thus cold temperatures? These are the questions that will be addressed in these five lectures."}],"editor":[{"full_name":"Bouchet, Freddy","last_name":"Bouchet","first_name":"Freddy"},{"first_name":"Tapio","full_name":"Schneider, Tapio","last_name":"Schneider"},{"last_name":"Venaille","full_name":"Venaille, Antoine","first_name":"Antoine"},{"last_name":"Salomon","full_name":"Salomon, Christophe","first_name":"Christophe"}],"title":"Clouds in current and in a warming climate","author":[{"first_name":"Caroline J","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","full_name":"Muller, Caroline J","orcid":"0000-0001-5836-5350","last_name":"Muller"}],"article_processing_charge":"No","extern":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2022-04-06T10:31:22Z","citation":{"chicago":"Muller, Caroline J. “Clouds in Current and in a Warming Climate.” In Fundamental Aspects of Turbulent Flows in Climate Dynamics, edited by Freddy Bouchet, Tapio Schneider, Antoine Venaille, and Christophe Salomon, Vol. 109. Oxford University Press, 2020. https://doi.org/10.1093/oso/9780198855217.003.0002.","ista":"Muller CJ. 2020.Clouds in current and in a warming climate. In: Fundamental Aspects of Turbulent Flows in Climate Dynamics. Lecture Notes of the Les Houches Summer School, vol. 109.","mla":"Muller, Caroline J. “Clouds in Current and in a Warming Climate.” Fundamental Aspects of Turbulent Flows in Climate Dynamics, edited by Freddy Bouchet et al., vol. 109, Oxford University Press, 2020, doi:10.1093/oso/9780198855217.003.0002.","short":"C.J. Muller, in:, F. Bouchet, T. Schneider, A. Venaille, C. Salomon (Eds.), Fundamental Aspects of Turbulent Flows in Climate Dynamics, Oxford University Press, 2020.","ieee":"C. J. Muller, “Clouds in current and in a warming climate,” in Fundamental Aspects of Turbulent Flows in Climate Dynamics, vol. 109, F. Bouchet, T. Schneider, A. Venaille, and C. Salomon, Eds. Oxford University Press, 2020.","ama":"Muller CJ. Clouds in current and in a warming climate. In: Bouchet F, Schneider T, Venaille A, Salomon C, eds. Fundamental Aspects of Turbulent Flows in Climate Dynamics. Vol 109. Oxford University Press; 2020. doi:10.1093/oso/9780198855217.003.0002","apa":"Muller, C. J. (2020). Clouds in current and in a warming climate. In F. Bouchet, T. Schneider, A. Venaille, & C. Salomon (Eds.), Fundamental Aspects of Turbulent Flows in Climate Dynamics (Vol. 109). Oxford University Press. https://doi.org/10.1093/oso/9780198855217.003.0002"},"status":"public","type":"book_chapter","_id":"9132"},{"type":"preprint","status":"public","_id":"9150","article_processing_charge":"No","author":[{"first_name":"Camille","full_name":"Risi, Camille","last_name":"Risi"},{"last_name":"Muller","orcid":"0000-0001-5836-5350","full_name":"Muller, Caroline J","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","first_name":"Caroline J"},{"full_name":"Blossey, Peter N.","last_name":"Blossey","first_name":"Peter N."}],"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":{"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.","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","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","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.).","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."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","extern":"1","oa":1,"main_file_link":[{"url":"https://doi.org/10.1002/essoar.10504670.1","open_access":"1"}],"publisher":"ESSOAr","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","date_created":"2021-02-15T15:08:06Z","doi":"10.1002/essoar.10504670.1","date_published":"2020-11-24T00:00:00Z","publication_status":"submitted","year":"2020","language":[{"iso":"eng"}],"day":"24"},{"volume":2,"issue":"9","publication_status":"published","publication_identifier":{"eissn":["25233971"]},"language":[{"iso":"eng"}],"scopus_import":"1","intvolume":" 2","month":"09","abstract":[{"lang":"eng","text":"Bending-active structures are able to efficiently produce complex curved shapes from flat panels. The desired deformation of the panels derives from the proper selection of their elastic properties. Optimized panels, called FlexMaps, are designed such that, once they are bent and assembled, the resulting static equilibrium configuration matches a desired input 3D shape. The FlexMaps elastic properties are controlled by locally varying spiraling geometric mesostructures, which are optimized in size and shape to match specific bending requests, namely the global curvature of the target shape. The design pipeline starts from a quad mesh representing the input 3D shape, which defines the edge size and the total amount of spirals: every quad will embed one spiral. Then, an optimization algorithm tunes the geometry of the spirals by using a simplified pre-computed rod model. This rod model is derived from a non-linear regression algorithm which approximates the non-linear behavior of solid FEM spiral models subject to hundreds of load combinations. This innovative pipeline has been applied to the project of a lightweight plywood pavilion named FlexMaps Pavilion, which is a single-layer piecewise twisted arch that fits a bounding box of 3.90x3.96x3.25 meters. This case study serves to test the applicability of this methodology at the architectural scale. The structure is validated via FE analyses and the fabrication of the full scale prototype."}],"oa_version":"None","department":[{"_id":"BeBi"}],"date_updated":"2021-03-03T09:43:14Z","article_type":"original","type":"journal_article","status":"public","_id":"9208","date_created":"2021-02-28T23:01:25Z","doi":"10.1007/s42452-020-03305-w","date_published":"2020-09-01T00:00:00Z","year":"2020","publication":"SN Applied Sciences","day":"01","quality_controlled":"1","publisher":"Springer Nature","acknowledgement":"The FlexMaps Pavilion has been awarded First Prize at the “Competition and Exhibition of innovative lightweight structures” organized by the IASS Working Group 21 within the FORM and FORCE, joint international conference of IASS Symposium 2019 and Structural Membranes 2019 (Barcelona, 7-11 October 2019) with the following motivation: “for its structural innovation of bending-twisting system, connection constructability and exquisite craftmanship”[20]. The authors would like to acknowledge the Visual Computing Lab Staff of ISTI - CNR, in particular Thomas Alderighi, Marco Callieri, Paolo Pingi; Antonio Rizzo of IPCF - CNR; and the Administrative Staff of ISTI - CNR. This research was partially funded by the EU H2020 Programme EVOCATION: Advanced Visual and Geometric Computing for 3D Capture, Display, and Fabrication (grant no. 813170).","article_processing_charge":"No","author":[{"last_name":"Laccone","full_name":"Laccone, Francesco","first_name":"Francesco"},{"first_name":"Luigi","full_name":"Malomo, Luigi","last_name":"Malomo"},{"last_name":"Perez Rodriguez","full_name":"Perez Rodriguez, Jesus","id":"2DC83906-F248-11E8-B48F-1D18A9856A87","first_name":"Jesus"},{"full_name":"Pietroni, Nico","last_name":"Pietroni","first_name":"Nico"},{"last_name":"Ponchio","full_name":"Ponchio, Federico","first_name":"Federico"},{"last_name":"Bickel","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd"},{"first_name":"Paolo","full_name":"Cignoni, Paolo","last_name":"Cignoni"}],"title":"A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion","citation":{"mla":"Laccone, Francesco, et al. “A Bending-Active Twisted-Arch Plywood Structure: Computational Design and Fabrication of the FlexMaps Pavilion.” SN Applied Sciences, vol. 2, no. 9, 1505, Springer Nature, 2020, doi:10.1007/s42452-020-03305-w.","ieee":"F. Laccone et al., “A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion,” SN Applied Sciences, vol. 2, no. 9. Springer Nature, 2020.","short":"F. Laccone, L. Malomo, J. Perez Rodriguez, N. Pietroni, F. Ponchio, B. Bickel, P. Cignoni, SN Applied Sciences 2 (2020).","ama":"Laccone F, Malomo L, Perez Rodriguez J, et al. A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion. SN Applied Sciences. 2020;2(9). doi:10.1007/s42452-020-03305-w","apa":"Laccone, F., Malomo, L., Perez Rodriguez, J., Pietroni, N., Ponchio, F., Bickel, B., & Cignoni, P. (2020). A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion. SN Applied Sciences. Springer Nature. https://doi.org/10.1007/s42452-020-03305-w","chicago":"Laccone, Francesco, Luigi Malomo, Jesus Perez Rodriguez, Nico Pietroni, Federico Ponchio, Bernd Bickel, and Paolo Cignoni. “A Bending-Active Twisted-Arch Plywood Structure: Computational Design and Fabrication of the FlexMaps Pavilion.” SN Applied Sciences. Springer Nature, 2020. https://doi.org/10.1007/s42452-020-03305-w.","ista":"Laccone F, Malomo L, Perez Rodriguez J, Pietroni N, Ponchio F, Bickel B, Cignoni P. 2020. A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion. SN Applied Sciences. 2(9), 1505."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"1505"},{"project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"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.","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.","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.","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.","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.","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."},"title":"Global convergence of deep networks with one wide layer followed by pyramidal topology","author":[{"first_name":"Quynh","full_name":"Nguyen, Quynh","last_name":"Nguyen"},{"first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020"}],"external_id":{"arxiv":["2002.07867"]},"article_processing_charge":"No","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.","publisher":"Curran Associates","quality_controlled":"1","oa":1,"day":"07","publication":"34th Conference on Neural Information Processing Systems","year":"2020","date_published":"2020-07-07T00:00:00Z","date_created":"2021-03-03T12:06:02Z","page":"11961–11972","_id":"9221","status":"public","type":"conference","conference":{"end_date":"2020-12-12","location":"Vancouver, Canada","start_date":"2020-12-06","name":"NeurIPS: Neural Information Processing Systems"},"date_updated":"2022-01-04T09:24:41Z","department":[{"_id":"MaMo"}],"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"}],"month":"07","intvolume":" 33","main_file_link":[{"url":"https://arxiv.org/abs/2002.07867","open_access":"1"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":33},{"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"9421","checksum":"2aaaa7d7226e49161311d91627cf783b","file_size":741899,"date_updated":"2021-05-25T09:51:36Z","creator":"kschuh","file_name":"2020_PMLR_Kurtz.pdf","date_created":"2021-05-25T09:51:36Z"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2640-3498"]},"volume":119,"oa_version":"Published Version","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. "}],"month":"07","intvolume":" 119","scopus_import":"1","ddc":["000"],"date_updated":"2023-02-23T13:57:24Z","department":[{"_id":"DaAl"}],"file_date_updated":"2021-05-25T09:51:36Z","_id":"9415","status":"public","type":"conference","conference":{"name":"ICML: International Conference on Machine Learning","end_date":"2020-07-18","location":"Online","start_date":"2020-07-12"},"day":"12","publication":"37th International Conference on Machine Learning, ICML 2020","has_accepted_license":"1","year":"2020","date_published":"2020-07-12T00:00:00Z","date_created":"2021-05-23T22:01:45Z","page":"5533-5543","quality_controlled":"1","oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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.","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.","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.","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."},"title":"Inducing and exploiting activation sparsity for fast neural network inference","author":[{"last_name":"Kurtz","full_name":"Kurtz, Mark","first_name":"Mark"},{"first_name":"Justin","full_name":"Kopinsky, Justin","last_name":"Kopinsky"},{"last_name":"Gelashvili","full_name":"Gelashvili, Rati","first_name":"Rati"},{"first_name":"Alexander","last_name":"Matveev","full_name":"Matveev, Alexander"},{"first_name":"John","last_name":"Carr","full_name":"Carr, John"},{"last_name":"Goin","full_name":"Goin, Michael","first_name":"Michael"},{"first_name":"William","last_name":"Leiserson","full_name":"Leiserson, William"},{"first_name":"Sage","full_name":"Moore, Sage","last_name":"Moore"},{"last_name":"Nell","full_name":"Nell, Bill","first_name":"Bill"},{"first_name":"Nir","last_name":"Shavit","full_name":"Shavit, Nir"},{"orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No"},{"extern":"1","date_updated":"2021-12-14T07:51:15Z","department":[{"_id":"DaZi"}],"_id":"9526","status":"public","type":"journal_article","article_type":"original","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1097-2765"],"eissn":["1097-4164"]},"publication_status":"published","volume":77,"issue":"2","pmid":1,"oa_version":"Published Version","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"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"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.","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.","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.","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","short":"J. Choi, D.B. Lyons, M.Y. Kim, J.D. Moore, D. Zilberman, Molecular Cell 77 (2020) 310–323.e7.","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."},"title":"DNA methylation and histone H1 jointly repress transposable elements and aberrant intragenic transcripts","author":[{"full_name":"Choi, Jaemyung","last_name":"Choi","first_name":"Jaemyung"},{"full_name":"Lyons, David B.","last_name":"Lyons","first_name":"David B."},{"last_name":"Kim","full_name":"Kim, M. Yvonne","first_name":"M. Yvonne"},{"first_name":"Jonathan D.","last_name":"Moore","full_name":"Moore, Jonathan D."},{"last_name":"Zilberman","full_name":"Zilberman, Daniel","orcid":"0000-0002-0123-8649","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","first_name":"Daniel"}],"article_processing_charge":"No","external_id":{"pmid":["31732458"]},"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},{"publication_status":"published","publication_identifier":{"eissn":["2050-5094"]},"language":[{"iso":"eng"}],"file":[{"creator":"asandaue","file_size":601516,"date_updated":"2021-06-22T09:23:59Z","file_name":"2020_CambridgeUniversityPress_Ferber.pdf","date_created":"2021-06-22T09:23:59Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"checksum":"5553c596bb4db0f38226a56bee9c87a1","file_id":"9584"}],"volume":8,"abstract":[{"lang":"eng","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)."}],"pmid":1,"oa_version":"Published Version","scopus_import":"1","intvolume":" 8","month":"11","date_updated":"2023-02-23T14:01:48Z","ddc":["510"],"extern":"1","file_date_updated":"2021-06-22T09:23:59Z","_id":"9583","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","year":"2020","has_accepted_license":"1","publication":"Forum of Mathematics","day":"03","date_created":"2021-06-22T09:12:23Z","date_published":"2020-11-03T00:00:00Z","doi":"10.1017/fms.2020.29","oa":1,"quality_controlled":"1","publisher":"Cambridge University Press","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.","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","ama":"Ferber A, Kwan MA. Almost all Steiner triple systems are almost resolvable. Forum of Mathematics. 2020;8. doi: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","external_id":{"pmid":["1907.06744"]},"article_processing_charge":"No","author":[{"first_name":"Asaf","full_name":"Ferber, Asaf","last_name":"Ferber"},{"full_name":"Kwan, Matthew Alan","orcid":"0000-0002-4003-7567","last_name":"Kwan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan"}],"title":"Almost all Steiner triple systems are almost resolvable","article_number":"e39"},{"oa":1,"quality_controlled":"1","publisher":"Springer","date_created":"2021-06-21T13:24:35Z","date_published":"2020-07-01T00:00:00Z","doi":"10.1007/s11856-020-2035-7","page":"663-685","publication":"Israel Journal of Mathematics","day":"01","year":"2020","title":"Nearly-linear monotone paths in edge-ordered graphs","article_processing_charge":"No","external_id":{"arxiv":["1809.01468"]},"author":[{"full_name":"Bucić, Matija","last_name":"Bucić","first_name":"Matija"},{"full_name":"Kwan, Matthew Alan","orcid":"0000-0002-4003-7567","last_name":"Kwan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan"},{"full_name":"Pokrovskiy, Alexey","last_name":"Pokrovskiy","first_name":"Alexey"},{"last_name":"Sudakov","full_name":"Sudakov, Benny","first_name":"Benny"},{"last_name":"Tran","full_name":"Tran, Tuan","first_name":"Tuan"},{"first_name":"Adam Zsolt","full_name":"Wagner, Adam Zsolt","last_name":"Wagner"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","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.","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.","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","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","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."},"intvolume":" 238","month":"07","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.01468"}],"scopus_import":"1","oa_version":"Preprint","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"}],"volume":238,"issue":"2","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["1565-8511"],"issn":["0021-2172"]},"status":"public","type":"journal_article","article_type":"original","_id":"9578","extern":"1","date_updated":"2023-02-23T14:01:35Z"},{"title":"Dense induced bipartite subgraphs in triangle-free graphs","external_id":{"arxiv":["1810.12144"]},"article_processing_charge":"No","author":[{"last_name":"Kwan","orcid":"0000-0002-4003-7567","full_name":"Kwan, Matthew Alan","first_name":"Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3"},{"last_name":"Letzter","full_name":"Letzter, Shoham","first_name":"Shoham"},{"first_name":"Benny","full_name":"Sudakov, Benny","last_name":"Sudakov"},{"last_name":"Tran","full_name":"Tran, Tuan","first_name":"Tuan"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"short":"M.A. Kwan, S. Letzter, B. Sudakov, T. Tran, Combinatorica 40 (2020) 283–305.","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.","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."},"oa":1,"quality_controlled":"1","publisher":"Springer","date_created":"2021-06-22T06:42:26Z","date_published":"2020-04-01T00:00:00Z","doi":"10.1007/s00493-019-4086-0","page":"283-305","publication":"Combinatorica","day":"01","year":"2020","status":"public","type":"journal_article","article_type":"original","_id":"9582","extern":"1","date_updated":"2023-02-23T14:01:45Z","intvolume":" 40","month":"04","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1810.12144"}],"scopus_import":"1","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."}],"volume":40,"issue":"2","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["1439-6912"],"issn":["0209-9683"]}},{"_id":"9581","article_type":"original","type":"journal_article","status":"public","date_updated":"2023-02-23T14:01:43Z","extern":"1","abstract":[{"lang":"eng","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."}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1611.02246"}],"scopus_import":"1","intvolume":" 121","month":"12","publication_status":"published","publication_identifier":{"issn":["0024-6115"],"eissn":["1460-244X"]},"language":[{"iso":"eng"}],"volume":121,"issue":"6","citation":{"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","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","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.","short":"M.A. Kwan, Proceedings of the London Mathematical Society 121 (2020) 1468–1495.","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.","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."},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","article_processing_charge":"No","external_id":{"arxiv":["1611.02246"]},"author":[{"last_name":"Kwan","full_name":"Kwan, Matthew Alan","orcid":"0000-0002-4003-7567","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan"}],"title":"Almost all Steiner triple systems have perfect matchings","oa":1,"quality_controlled":"1","publisher":"Wiley","year":"2020","publication":"Proceedings of the London Mathematical Society","day":"01","page":"1468-1495","date_created":"2021-06-22T06:35:16Z","doi":"10.1112/plms.12373","date_published":"2020-12-01T00:00:00Z"},{"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."},"title":"Classical nucleation theory predicts the shape of the nucleus in homogeneous solidification","external_id":{"arxiv":["1910.13481"],"pmid":["32007057"]},"article_processing_charge":"No","author":[{"full_name":"Cheng, Bingqing","orcid":"0000-0002-3584-9632","last_name":"Cheng","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","first_name":"Bingqing"},{"first_name":"Michele","full_name":"Ceriotti, Michele","last_name":"Ceriotti"},{"last_name":"Tribello","full_name":"Tribello, Gareth A.","first_name":"Gareth A."}],"article_number":"044103","publication":"The Journal of Chemical Physics","day":"31","year":"2020","date_created":"2021-07-15T07:22:24Z","date_published":"2020-01-31T00:00:00Z","doi":"10.1063/1.5134461","oa":1,"quality_controlled":"1","publisher":"AIP Publishing","extern":"1","date_updated":"2023-02-23T14:03:55Z","_id":"9658","status":"public","article_type":"original","type":"journal_article","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0021-9606"],"eissn":["1089-7690"]},"issue":"4","volume":152,"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."}],"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"},{"scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/2005.07562","open_access":"1"}],"month":"09","intvolume":" 125","abstract":[{"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.","lang":"eng"}],"pmid":1,"oa_version":"Preprint","volume":125,"issue":"13","publication_identifier":{"issn":["0031-9007"],"eissn":["1079-7114"]},"publication_status":"published","language":[{"iso":"eng"}],"type":"journal_article","article_type":"original","status":"public","_id":"9664","date_updated":"2021-08-09T12:35:58Z","extern":"1","quality_controlled":"1","publisher":"American Physical Society","oa":1,"doi":"10.1103/physrevlett.125.130602","date_published":"2020-09-25T00:00:00Z","date_created":"2021-07-15T12:15:14Z","year":"2020","day":"25","publication":"Physical Review Letters","article_number":"130602","author":[{"full_name":"Cheng, Bingqing","orcid":"0000-0002-3584-9632","last_name":"Cheng","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","first_name":"Bingqing"},{"last_name":"Frenkel","full_name":"Frenkel, Daan","first_name":"Daan"}],"article_processing_charge":"No","external_id":{"arxiv":["2005.07562"],"pmid":["33034481"]},"title":"Computing the heat conductivity of fluids from density fluctuations","citation":{"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.","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","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).","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.","ista":"Cheng B, Frenkel D. 2020. Computing the heat conductivity of fluids from density fluctuations. Physical Review Letters. 125(13), 130602."},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf"},{"status":"public","type":"journal_article","article_type":"original","_id":"9685","extern":"1","date_updated":"2021-08-09T12:38:01Z","intvolume":" 585","month":"09","main_file_link":[{"url":"https://arxiv.org/abs/1906.03341","open_access":"1"}],"scopus_import":"1","oa_version":"Preprint","pmid":1,"abstract":[{"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.","lang":"eng"}],"volume":585,"issue":"7824","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]},"title":"Evidence for supercritical behaviour of high-pressure liquid hydrogen","external_id":{"pmid":["32908269"],"arxiv":["1906.03341"]},"article_processing_charge":"No","author":[{"orcid":"0000-0002-3584-9632","full_name":"Cheng, Bingqing","last_name":"Cheng","first_name":"Bingqing","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9"},{"last_name":"Mazzola","full_name":"Mazzola, Guglielmo","first_name":"Guglielmo"},{"first_name":"Chris J.","last_name":"Pickard","full_name":"Pickard, Chris J."},{"first_name":"Michele","last_name":"Ceriotti","full_name":"Ceriotti, Michele"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"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.","ista":"Cheng B, Mazzola G, Pickard CJ, Ceriotti M. 2020. Evidence for supercritical behaviour of high-pressure liquid hydrogen. Nature. 585(7824), 217–220.","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.","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","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","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."},"oa":1,"quality_controlled":"1","publisher":"Springer Nature","date_created":"2021-07-19T09:17:49Z","date_published":"2020-09-10T00:00:00Z","doi":"10.1038/s41586-020-2677-y","page":"217-220","publication":"Nature","day":"10","year":"2020"},{"publication_identifier":{"issn":["0043-1397"],"eissn":["1944-7973"]},"publication_status":"published","language":[{"iso":"eng"}],"issue":"2","volume":56,"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"}],"oa_version":"Published Version","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1029/2019WR024880"}],"month":"02","intvolume":" 56","date_updated":"2023-02-28T12:26:14Z","extern":"1","_id":"12598","type":"journal_article","article_type":"original","status":"public","keyword":["Water Science and Technology"],"year":"2020","day":"01","publication":"Water Resources Research","date_published":"2020-02-01T00:00:00Z","doi":"10.1029/2019wr024880","date_created":"2023-02-20T08:12:47Z","quality_controlled":"1","publisher":"American Geophysical Union","oa":1,"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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Shaw, Thomas E.","last_name":"Shaw","first_name":"Thomas E."},{"first_name":"Simon","full_name":"Gascoin, Simon","last_name":"Gascoin"},{"first_name":"Pablo A.","full_name":"Mendoza, Pablo A.","last_name":"Mendoza"},{"first_name":"Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","full_name":"Pellicciotti, Francesca","last_name":"Pellicciotti"},{"first_name":"James","last_name":"McPhee","full_name":"McPhee, James"}],"article_processing_charge":"No","title":"Snow depth patterns in a high mountain Andean catchment from satellite optical tristereoscopic remote sensing","article_number":"e2019WR024880"},{"abstract":[{"text":"Information about end-of-winter spatial distribution of snow depth is important for seasonal forecasts of spring/summer streamflow in high-mountain regions. Nevertheless, such information typically relies upon extrapolation from a sparse network of observations at low elevations. Here, we test the potential of high-resolution snow depth data derived from optical stereophotogrammetry of Pléiades satellites for improving the representation of snow depth initial conditions (SDICs) in a glacio-hydrological model and assess potential improvements in the skill of snowmelt and streamflow simulations in a high-elevation Andean catchment. We calibrate model parameters controlling glacier mass balance and snow cover evolution using ground-based and satellite observations, and consider the relative importance of accurate estimates of SDICs compared to model parameters and forcings. We find that Pléiades SDICs improve the simulation of snow-covered area, glacier mass balance, and monthly streamflow compared to alternative SDICs based upon extrapolation of meteorological variables or statistical methods to estimate SDICs based upon topography. Model simulations are found to be sensitive to SDICs in the early spring (up to 48% variability in modeled streamflow compared to the best estimate model), and to temperature gradients in all months that control albedo and melt rates over a large elevation range (>2,400 m). As such, appropriately characterizing the distribution of total snow volume with elevation is important for reproducing total streamflow and the proportions of snowmelt. Therefore, optical stereo-photogrammetry offers an advantage for obtaining SDICs that aid both the timing and magnitude of streamflow simulations, process representation (e.g., snow cover evolution) and has the potential for large spatial domains.","lang":"eng"}],"oa_version":"Published Version","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.1029/2020WR027188","open_access":"1"}],"month":"08","intvolume":" 56","publication_identifier":{"issn":["0043-1397"],"eissn":["1944-7973"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":56,"issue":"8","_id":"12594","type":"journal_article","article_type":"original","status":"public","keyword":["Water Science and Technology"],"date_updated":"2023-02-28T12:41:45Z","extern":"1","quality_controlled":"1","publisher":"American Geophysical Union","oa":1,"year":"2020","day":"01","publication":"Water Resources Research","doi":"10.1029/2020wr027188","date_published":"2020-08-01T00:00:00Z","date_created":"2023-02-20T08:12:22Z","article_number":"e2020WR027188","citation":{"chicago":"Shaw, Thomas E., Alexis Caro, Pablo Mendoza, Álvaro Ayala, Francesca Pellicciotti, Simon Gascoin, and James McPhee. “The Utility of Optical Satellite Winter Snow Depths for Initializing a Glacio‐hydrological Model of a High‐Elevation, Andean Catchment.” Water Resources Research. American Geophysical Union, 2020. https://doi.org/10.1029/2020wr027188.","ista":"Shaw TE, Caro A, Mendoza P, Ayala Á, Pellicciotti F, Gascoin S, McPhee J. 2020. The utility of optical satellite winter snow depths for initializing a glacio‐hydrological model of a High‐Elevation, Andean catchment. Water Resources Research. 56(8), e2020WR027188.","mla":"Shaw, Thomas E., et al. “The Utility of Optical Satellite Winter Snow Depths for Initializing a Glacio‐hydrological Model of a High‐Elevation, Andean Catchment.” Water Resources Research, vol. 56, no. 8, e2020WR027188, American Geophysical Union, 2020, doi:10.1029/2020wr027188.","ieee":"T. E. Shaw et al., “The utility of optical satellite winter snow depths for initializing a glacio‐hydrological model of a High‐Elevation, Andean catchment,” Water Resources Research, vol. 56, no. 8. American Geophysical Union, 2020.","short":"T.E. Shaw, A. Caro, P. Mendoza, Á. Ayala, F. Pellicciotti, S. Gascoin, J. McPhee, Water Resources Research 56 (2020).","apa":"Shaw, T. E., Caro, A., Mendoza, P., Ayala, Á., Pellicciotti, F., Gascoin, S., & McPhee, J. (2020). The utility of optical satellite winter snow depths for initializing a glacio‐hydrological model of a High‐Elevation, Andean catchment. Water Resources Research. American Geophysical Union. https://doi.org/10.1029/2020wr027188","ama":"Shaw TE, Caro A, Mendoza P, et al. The utility of optical satellite winter snow depths for initializing a glacio‐hydrological model of a High‐Elevation, Andean catchment. Water Resources Research. 2020;56(8). doi:10.1029/2020wr027188"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Shaw","full_name":"Shaw, Thomas E.","first_name":"Thomas E."},{"last_name":"Caro","full_name":"Caro, Alexis","first_name":"Alexis"},{"first_name":"Pablo","full_name":"Mendoza, Pablo","last_name":"Mendoza"},{"full_name":"Ayala, Álvaro","last_name":"Ayala","first_name":"Álvaro"},{"full_name":"Pellicciotti, Francesca","last_name":"Pellicciotti","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","first_name":"Francesca"},{"first_name":"Simon","full_name":"Gascoin, Simon","last_name":"Gascoin"},{"first_name":"James","last_name":"McPhee","full_name":"McPhee, James"}],"article_processing_charge":"No","title":"The utility of optical satellite winter snow depths for initializing a glacio‐hydrological model of a High‐Elevation, Andean catchment"},{"date_created":"2023-02-20T08:12:36Z","doi":"10.5194/tc-14-2005-2020","date_published":"2020-06-24T00:00:00Z","page":"2005-2027","publication":"The Cryosphere","day":"24","year":"2020","oa":1,"quality_controlled":"1","publisher":"Copernicus Publications","title":"Glacier runoff variations since 1955 in the Maipo River basin, in the semiarid Andes of central Chile","article_processing_charge":"No","author":[{"last_name":"Ayala","full_name":"Ayala, Álvaro","first_name":"Álvaro"},{"last_name":"Farías-Barahona","full_name":"Farías-Barahona, David","first_name":"David"},{"last_name":"Huss","full_name":"Huss, Matthias","first_name":"Matthias"},{"id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","first_name":"Francesca","last_name":"Pellicciotti","full_name":"Pellicciotti, Francesca"},{"first_name":"James","full_name":"McPhee, James","last_name":"McPhee"},{"first_name":"Daniel","last_name":"Farinotti","full_name":"Farinotti, Daniel"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Ayala, Álvaro, et al. “Glacier Runoff Variations since 1955 in the Maipo River Basin, in the Semiarid Andes of Central Chile.” The Cryosphere, vol. 14, no. 6, Copernicus Publications, 2020, pp. 2005–27, doi:10.5194/tc-14-2005-2020.","short":"Á. Ayala, D. Farías-Barahona, M. Huss, F. Pellicciotti, J. McPhee, D. Farinotti, The Cryosphere 14 (2020) 2005–2027.","ieee":"Á. Ayala, D. Farías-Barahona, M. Huss, F. Pellicciotti, J. McPhee, and D. Farinotti, “Glacier runoff variations since 1955 in the Maipo River basin, in the semiarid Andes of central Chile,” The Cryosphere, vol. 14, no. 6. Copernicus Publications, pp. 2005–2027, 2020.","ama":"Ayala Á, Farías-Barahona D, Huss M, Pellicciotti F, McPhee J, Farinotti D. Glacier runoff variations since 1955 in the Maipo River basin, in the semiarid Andes of central Chile. The Cryosphere. 2020;14(6):2005-2027. doi:10.5194/tc-14-2005-2020","apa":"Ayala, Á., Farías-Barahona, D., Huss, M., Pellicciotti, F., McPhee, J., & Farinotti, D. (2020). Glacier runoff variations since 1955 in the Maipo River basin, in the semiarid Andes of central Chile. The Cryosphere. Copernicus Publications. https://doi.org/10.5194/tc-14-2005-2020","chicago":"Ayala, Álvaro, David Farías-Barahona, Matthias Huss, Francesca Pellicciotti, James McPhee, and Daniel Farinotti. “Glacier Runoff Variations since 1955 in the Maipo River Basin, in the Semiarid Andes of Central Chile.” The Cryosphere. Copernicus Publications, 2020. https://doi.org/10.5194/tc-14-2005-2020.","ista":"Ayala Á, Farías-Barahona D, Huss M, Pellicciotti F, McPhee J, Farinotti D. 2020. Glacier runoff variations since 1955 in the Maipo River basin, in the semiarid Andes of central Chile. The Cryosphere. 14(6), 2005–2027."},"volume":14,"issue":"6","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1994-0424"]},"intvolume":" 14","month":"06","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5194/tc-14-2005-2020"}],"scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"As glaciers adjust their size in response to climate variations, long-term changes in meltwater production can be expected, affecting the local availability of water resources. We investigate glacier runoff in the period 1955–2016 in the Maipo River basin (4843 km2, 33.0–34.3∘ S, 69.8–70.5∘ W), in the semiarid Andes of Chile. The basin contains more than 800 glaciers, which cover 378 km2 in total (inventoried in 2000). We model the mass balance and runoff contribution of 26 glaciers with the physically oriented and fully distributed TOPKAPI (Topographic Kinematic Approximation and Integration)-ETH glacio-hydrological model and extrapolate the results to the entire basin. TOPKAPI-ETH is run at a daily time step using several glaciological and meteorological datasets, and its results are evaluated against streamflow records, remotely sensed snow cover, and geodetic mass balances for the periods 1955–2000 and 2000–2013. Results show that in 1955–2016 glacier mass balance had a general decreasing trend as a basin average but also had differences between the main sub-catchments. Glacier volume decreased by one-fifth (from 18.6±4.5 to 14.9±2.9 km3). Runoff from the initially glacierized areas was 177±25 mm yr−1 (16±7 % of the total contributions to the basin), but it shows a decreasing sequence of maxima, which can be linked to the interplay between a decrease in precipitation since the 1980s and the reduction of ice melt. Glaciers in the Maipo River basin will continue retreating because they are not in equilibrium with the current climate. In a hypothetical constant climate scenario, glacier volume would reduce to 81±38 % of the year 2000 volume, and glacier runoff would be 78±30 % of the 1955–2016 average. This would considerably decrease the drought mitigation capacity of the basin."}],"extern":"1","date_updated":"2023-02-28T12:32:31Z","keyword":["Earth-Surface Processes","Water Science and Technology"],"status":"public","type":"journal_article","article_type":"original","_id":"12596"},{"title":"Modelling spatial patterns of near-surface air temperature over a decade of melt seasons on McCall Glacier, Alaska","article_processing_charge":"No","author":[{"first_name":"Patrick","last_name":"Troxler","full_name":"Troxler, Patrick"},{"first_name":"Álvaro","last_name":"Ayala","full_name":"Ayala, Álvaro"},{"first_name":"Thomas E.","last_name":"Shaw","full_name":"Shaw, Thomas E."},{"first_name":"Matt","full_name":"Nolan, Matt","last_name":"Nolan"},{"first_name":"Ben W.","full_name":"Brock, Ben W.","last_name":"Brock"},{"id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","first_name":"Francesca","full_name":"Pellicciotti, Francesca","last_name":"Pellicciotti"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Troxler, Patrick, et al. “Modelling Spatial Patterns of Near-Surface Air Temperature over a Decade of Melt Seasons on McCall Glacier, Alaska.” Journal of Glaciology, vol. 66, no. 257, Cambridge University Press, 2020, pp. 386–400, doi:10.1017/jog.2020.12.","ieee":"P. Troxler, Á. Ayala, T. E. Shaw, M. Nolan, B. W. Brock, and F. Pellicciotti, “Modelling spatial patterns of near-surface air temperature over a decade of melt seasons on McCall Glacier, Alaska,” Journal of Glaciology, vol. 66, no. 257. Cambridge University Press, pp. 386–400, 2020.","short":"P. Troxler, Á. Ayala, T.E. Shaw, M. Nolan, B.W. Brock, F. Pellicciotti, Journal of Glaciology 66 (2020) 386–400.","apa":"Troxler, P., Ayala, Á., Shaw, T. E., Nolan, M., Brock, B. W., & Pellicciotti, F. (2020). Modelling spatial patterns of near-surface air temperature over a decade of melt seasons on McCall Glacier, Alaska. Journal of Glaciology. Cambridge University Press. https://doi.org/10.1017/jog.2020.12","ama":"Troxler P, Ayala Á, Shaw TE, Nolan M, Brock BW, Pellicciotti F. Modelling spatial patterns of near-surface air temperature over a decade of melt seasons on McCall Glacier, Alaska. Journal of Glaciology. 2020;66(257):386-400. doi:10.1017/jog.2020.12","chicago":"Troxler, Patrick, Álvaro Ayala, Thomas E. Shaw, Matt Nolan, Ben W. Brock, and Francesca Pellicciotti. “Modelling Spatial Patterns of Near-Surface Air Temperature over a Decade of Melt Seasons on McCall Glacier, Alaska.” Journal of Glaciology. Cambridge University Press, 2020. https://doi.org/10.1017/jog.2020.12.","ista":"Troxler P, Ayala Á, Shaw TE, Nolan M, Brock BW, Pellicciotti F. 2020. Modelling spatial patterns of near-surface air temperature over a decade of melt seasons on McCall Glacier, Alaska. Journal of Glaciology. 66(257), 386–400."},"oa":1,"quality_controlled":"1","publisher":"Cambridge University Press","date_created":"2023-02-20T08:12:42Z","doi":"10.1017/jog.2020.12","date_published":"2020-06-01T00:00:00Z","page":"386-400","publication":"Journal of Glaciology","day":"01","year":"2020","keyword":["Earth-Surface Processes"],"status":"public","article_type":"original","type":"journal_article","_id":"12597","extern":"1","date_updated":"2023-02-28T12:28:45Z","intvolume":" 66","month":"06","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1017/jog.2020.12"}],"scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"We examine the spatial patterns of near-surface air temperature (Ta) over a melting glacier using a multi-annual dataset from McCall Glacier, Alaska. The dataset consists of a 10-year (2005–2014) meteorological record along the glacier centreline up to an upper glacier cirque, spanning an elevation difference of 900 m. We test the validity of on-glacier linear lapse rates, and a model that calculates Ta based on the influence of katabatic winds and other heat sources along the glacier flow line. During the coldest hours of each summer (10% of time), average lapse rates across the entire glacier range from −4.7 to −6.7°C km−1, with a strong relationship between Ta and elevation (R2 > 0.7). During warm conditions, Ta shows more complex, non-linear patterns that are better explained by the flow line-dependent model, reducing errors by up to 0.5°C compared with linear lapse rates, although more uncertainty might be associated with these observations due to occasionally poor sensor ventilation. We conclude that Ta spatial distribution can vary significantly from year to year, and from one glacier section to another. Importantly, extrapolations using linear lapse rates from the ablation zone might lead to large underestimations of Ta on the upper glacier areas.","lang":"eng"}],"issue":"257","volume":66,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0022-1430"],"eissn":["1727-5652"]}},{"oa":1,"quality_controlled":"1","publisher":"MDPI","year":"2020","publication":"Remote Sensing","day":"24","date_created":"2023-02-20T08:12:29Z","date_published":"2020-07-24T00:00:00Z","doi":"10.3390/rs12152389","article_number":"2389","citation":{"chicago":"Yang, Wei, Chuanxi Zhao, Matthew Westoby, Tandong Yao, Yongjie Wang, Francesca Pellicciotti, Jianmin Zhou, Zhen He, and Evan Miles. “Seasonal Dynamics of a Temperate Tibetan Glacier Revealed by High-Resolution UAV Photogrammetry and in Situ Measurements.” Remote Sensing. MDPI, 2020. https://doi.org/10.3390/rs12152389.","ista":"Yang W, Zhao C, Westoby M, Yao T, Wang Y, Pellicciotti F, Zhou J, He Z, Miles E. 2020. Seasonal dynamics of a temperate Tibetan glacier revealed by high-resolution UAV photogrammetry and in situ measurements. Remote Sensing. 12(15), 2389.","mla":"Yang, Wei, et al. “Seasonal Dynamics of a Temperate Tibetan Glacier Revealed by High-Resolution UAV Photogrammetry and in Situ Measurements.” Remote Sensing, vol. 12, no. 15, 2389, MDPI, 2020, doi:10.3390/rs12152389.","ieee":"W. Yang et al., “Seasonal dynamics of a temperate Tibetan glacier revealed by high-resolution UAV photogrammetry and in situ measurements,” Remote Sensing, vol. 12, no. 15. MDPI, 2020.","short":"W. Yang, C. Zhao, M. Westoby, T. Yao, Y. Wang, F. Pellicciotti, J. Zhou, Z. He, E. Miles, Remote Sensing 12 (2020).","ama":"Yang W, Zhao C, Westoby M, et al. Seasonal dynamics of a temperate Tibetan glacier revealed by high-resolution UAV photogrammetry and in situ measurements. Remote Sensing. 2020;12(15). doi:10.3390/rs12152389","apa":"Yang, W., Zhao, C., Westoby, M., Yao, T., Wang, Y., Pellicciotti, F., … Miles, E. (2020). Seasonal dynamics of a temperate Tibetan glacier revealed by high-resolution UAV photogrammetry and in situ measurements. Remote Sensing. MDPI. https://doi.org/10.3390/rs12152389"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"first_name":"Wei","full_name":"Yang, Wei","last_name":"Yang"},{"first_name":"Chuanxi","full_name":"Zhao, Chuanxi","last_name":"Zhao"},{"first_name":"Matthew","full_name":"Westoby, Matthew","last_name":"Westoby"},{"first_name":"Tandong","last_name":"Yao","full_name":"Yao, Tandong"},{"full_name":"Wang, Yongjie","last_name":"Wang","first_name":"Yongjie"},{"last_name":"Pellicciotti","full_name":"Pellicciotti, Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","first_name":"Francesca"},{"full_name":"Zhou, Jianmin","last_name":"Zhou","first_name":"Jianmin"},{"first_name":"Zhen","full_name":"He, Zhen","last_name":"He"},{"first_name":"Evan","last_name":"Miles","full_name":"Miles, Evan"}],"title":"Seasonal dynamics of a temperate Tibetan glacier revealed by high-resolution UAV photogrammetry and in situ measurements","abstract":[{"lang":"eng","text":"The seasonal dynamic changes of Tibetan glaciers have seen little prior investigation, despite the increase in geodetic studies of multi-year changes. This study compares seasonal glacier dynamics (“cold” and “warm” seasons) in the ablation zone of Parlung No. 4 Glacier, a temperate glacier in the monsoon-influenced southeastern Tibetan Plateau, by using repeat unpiloted aerial vehicle (UAV) surveys combined with Structure-from-Motion (SfM) photogrammetry and ground stake measurements. Our results showed that the surveyed ablation zone had a mean change of −2.7 m of ice surface elevation during the period of September 2018 to October 2019 but is characterized by significant seasonal cyclic variations with ice surface elevation lifting (+2.0 m) in the cold season (September 2018 to June 2019) but lowering (−4.7 m) in the warm season (June 2019 to October 2019). Over an annual timescale, surface lowering was greatly suppressed by the resupply of ice from the glacier’s accumulation area—the annual emergence velocity compensates for about 55% of surface ablation in our study area. Cold season emergence velocities (3.0 ± 1.2 m) were ~5-times larger than those observed in the warm season (0.6 ± 1.0 m). Distinct spring precipitation patterns may contribute to these distinct seasonal signals. Such seasonal dynamic conditions are possibly critical for different glacier responses to climate change in this region of the Tibetan Plateau, and perhaps further afield."}],"oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://doi.org/10.3390/rs12152389"}],"scopus_import":"1","intvolume":" 12","month":"07","publication_status":"published","publication_identifier":{"issn":["2072-4292"]},"language":[{"iso":"eng"}],"volume":12,"issue":"15","_id":"12595","type":"journal_article","article_type":"original","status":"public","date_updated":"2023-02-28T12:36:22Z","extern":"1"},{"quality_controlled":"1","scopus_import":"1","publisher":"Springer Nature","intvolume":" 577","month":"01","abstract":[{"text":"Mountains are the water towers of the world, supplying a substantial part of both natural and anthropogenic water demands1,2. They are highly sensitive and prone to climate change3,4, yet their importance and vulnerability have not been quantified at the global scale. Here we present a global water tower index (WTI), which ranks all water towers in terms of their water-supplying role and the downstream dependence of ecosystems and society. For each water tower, we assess its vulnerability related to water stress, governance, hydropolitical tension and future climatic and socio-economic changes. We conclude that the most important (highest WTI) water towers are also among the most vulnerable, and that climatic and socio-economic changes will affect them profoundly. This could negatively impact 1.9 billion people living in (0.3 billion) or directly downstream of (1.6 billion) mountainous areas. Immediate action is required to safeguard the future of the world’s most important and vulnerable water towers.","lang":"eng"}],"oa_version":"None","page":"364-369","date_created":"2023-02-20T08:12:53Z","issue":"7790","volume":577,"date_published":"2020-01-16T00:00:00Z","doi":"10.1038/s41586-019-1822-y","publication_status":"published","year":"2020","publication_identifier":{"issn":["0028-0836"],"eissn":["1476-4687"]},"language":[{"iso":"eng"}],"publication":"Nature","day":"16","type":"journal_article","article_type":"original","status":"public","_id":"12599","article_processing_charge":"No","author":[{"first_name":"W. W.","last_name":"Immerzeel","full_name":"Immerzeel, W. W."},{"first_name":"A. F.","last_name":"Lutz","full_name":"Lutz, A. F."},{"first_name":"M.","full_name":"Andrade, M.","last_name":"Andrade"},{"first_name":"A.","full_name":"Bahl, A.","last_name":"Bahl"},{"first_name":"H.","full_name":"Biemans, H.","last_name":"Biemans"},{"first_name":"T.","full_name":"Bolch, T.","last_name":"Bolch"},{"last_name":"Hyde","full_name":"Hyde, S.","first_name":"S."},{"first_name":"S.","last_name":"Brumby","full_name":"Brumby, S."},{"first_name":"B. J.","last_name":"Davies","full_name":"Davies, B. J."},{"first_name":"A. C.","full_name":"Elmore, A. C.","last_name":"Elmore"},{"first_name":"A.","full_name":"Emmer, A.","last_name":"Emmer"},{"full_name":"Feng, M.","last_name":"Feng","first_name":"M."},{"first_name":"A.","last_name":"Fernández","full_name":"Fernández, A."},{"last_name":"Haritashya","full_name":"Haritashya, U.","first_name":"U."},{"last_name":"Kargel","full_name":"Kargel, J. S.","first_name":"J. S."},{"first_name":"M.","full_name":"Koppes, M.","last_name":"Koppes"},{"first_name":"P. D. A.","full_name":"Kraaijenbrink, P. D. A.","last_name":"Kraaijenbrink"},{"first_name":"A. V.","last_name":"Kulkarni","full_name":"Kulkarni, A. V."},{"full_name":"Mayewski, P. A.","last_name":"Mayewski","first_name":"P. A."},{"first_name":"S.","last_name":"Nepal","full_name":"Nepal, S."},{"first_name":"P.","last_name":"Pacheco","full_name":"Pacheco, P."},{"first_name":"T. H.","full_name":"Painter, T. H.","last_name":"Painter"},{"full_name":"Pellicciotti, Francesca","last_name":"Pellicciotti","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","first_name":"Francesca"},{"last_name":"Rajaram","full_name":"Rajaram, H.","first_name":"H."},{"first_name":"S.","full_name":"Rupper, S.","last_name":"Rupper"},{"last_name":"Sinisalo","full_name":"Sinisalo, A.","first_name":"A."},{"last_name":"Shrestha","full_name":"Shrestha, A. B.","first_name":"A. B."},{"full_name":"Viviroli, D.","last_name":"Viviroli","first_name":"D."},{"first_name":"Y.","full_name":"Wada, Y.","last_name":"Wada"},{"first_name":"C.","full_name":"Xiao, C.","last_name":"Xiao"},{"last_name":"Yao","full_name":"Yao, T.","first_name":"T."},{"last_name":"Baillie","full_name":"Baillie, J. E. M.","first_name":"J. E. M."}],"title":"Importance and vulnerability of the world’s water towers","citation":{"ista":"Immerzeel WW, Lutz AF, Andrade M, Bahl A, Biemans H, Bolch T, Hyde S, Brumby S, Davies BJ, Elmore AC, Emmer A, Feng M, Fernández A, Haritashya U, Kargel JS, Koppes M, Kraaijenbrink PDA, Kulkarni AV, Mayewski PA, Nepal S, Pacheco P, Painter TH, Pellicciotti F, Rajaram H, Rupper S, Sinisalo A, Shrestha AB, Viviroli D, Wada Y, Xiao C, Yao T, Baillie JEM. 2020. Importance and vulnerability of the world’s water towers. Nature. 577(7790), 364–369.","chicago":"Immerzeel, W. W., A. F. Lutz, M. Andrade, A. Bahl, H. Biemans, T. Bolch, S. Hyde, et al. “Importance and Vulnerability of the World’s Water Towers.” Nature. Springer Nature, 2020. https://doi.org/10.1038/s41586-019-1822-y.","apa":"Immerzeel, W. W., Lutz, A. F., Andrade, M., Bahl, A., Biemans, H., Bolch, T., … Baillie, J. E. M. (2020). Importance and vulnerability of the world’s water towers. Nature. Springer Nature. https://doi.org/10.1038/s41586-019-1822-y","ama":"Immerzeel WW, Lutz AF, Andrade M, et al. Importance and vulnerability of the world’s water towers. Nature. 2020;577(7790):364-369. doi:10.1038/s41586-019-1822-y","ieee":"W. W. Immerzeel et al., “Importance and vulnerability of the world’s water towers,” Nature, vol. 577, no. 7790. Springer Nature, pp. 364–369, 2020.","short":"W.W. Immerzeel, A.F. Lutz, M. Andrade, A. Bahl, H. Biemans, T. Bolch, S. Hyde, S. Brumby, B.J. Davies, A.C. Elmore, A. Emmer, M. Feng, A. Fernández, U. Haritashya, J.S. Kargel, M. Koppes, P.D.A. Kraaijenbrink, A.V. Kulkarni, P.A. Mayewski, S. Nepal, P. Pacheco, T.H. Painter, F. Pellicciotti, H. Rajaram, S. Rupper, A. Sinisalo, A.B. Shrestha, D. Viviroli, Y. Wada, C. Xiao, T. Yao, J.E.M. Baillie, Nature 577 (2020) 364–369.","mla":"Immerzeel, W. W., et al. “Importance and Vulnerability of the World’s Water Towers.” Nature, vol. 577, no. 7790, Springer Nature, 2020, pp. 364–69, doi:10.1038/s41586-019-1822-y."},"date_updated":"2023-02-28T12:17:38Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1"},{"article_processing_charge":"No","author":[{"full_name":"Herreid, Sam","last_name":"Herreid","first_name":"Sam"},{"full_name":"Pellicciotti, Francesca","last_name":"Pellicciotti","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","first_name":"Francesca"}],"title":"The state of rock debris covering Earth’s glaciers","citation":{"short":"S. Herreid, F. Pellicciotti, Nature Geoscience 13 (2020) 621–627.","ieee":"S. Herreid and F. Pellicciotti, “The state of rock debris covering Earth’s glaciers,” Nature Geoscience, vol. 13, no. 9. Springer Nature, pp. 621–627, 2020.","ama":"Herreid S, Pellicciotti F. The state of rock debris covering Earth’s glaciers. Nature Geoscience. 2020;13(9):621-627. doi:10.1038/s41561-020-0615-0","apa":"Herreid, S., & Pellicciotti, F. (2020). The state of rock debris covering Earth’s glaciers. Nature Geoscience. Springer Nature. https://doi.org/10.1038/s41561-020-0615-0","mla":"Herreid, Sam, and Francesca Pellicciotti. “The State of Rock Debris Covering Earth’s Glaciers.” Nature Geoscience, vol. 13, no. 9, Springer Nature, 2020, pp. 621–27, doi:10.1038/s41561-020-0615-0.","ista":"Herreid S, Pellicciotti F. 2020. The state of rock debris covering Earth’s glaciers. Nature Geoscience. 13(9), 621–627.","chicago":"Herreid, Sam, and Francesca Pellicciotti. “The State of Rock Debris Covering Earth’s Glaciers.” Nature Geoscience. Springer Nature, 2020. https://doi.org/10.1038/s41561-020-0615-0."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"621-627","date_created":"2023-02-20T08:12:17Z","doi":"10.1038/s41561-020-0615-0","date_published":"2020-09-02T00:00:00Z","year":"2020","publication":"Nature Geoscience","day":"02","publisher":"Springer Nature","quality_controlled":"1","date_updated":"2023-02-28T12:45:37Z","extern":"1","article_type":"original","type":"journal_article","keyword":["General Earth and Planetary Sciences"],"status":"public","_id":"12593","issue":"9","volume":13,"related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1038/s41561-020-0630-1"}]},"publication_status":"published","publication_identifier":{"eissn":["1752-0908"],"issn":["1752-0894"]},"language":[{"iso":"eng"}],"scopus_import":"1","intvolume":" 13","month":"09","abstract":[{"lang":"eng","text":"Rock debris can accumulate on glacier surfaces and dramatically reduce glacier melt. The structure of a debris cover is unique to each glacier and sensitive to climate. Despite this, debris cover has been omitted from global glacier models and forecasts of their response to a changing climate. Fundamental to resolving these omissions is a global map of debris cover and an estimate of its future spatial evolution. Here we use Landsat imagery and a detailed correction to the Randolph Glacier Inventory to show that 7.3% of mountain glacier area is debris covered and over half of Earth’s debris is concentrated in three regions: Alaska (38.6% of total debris-covered area), Southwest Asia (12.6%) and Greenland (12.0%). We use a set of new metrics, which include stage, the current position of a glacier on its trajectory towards reaching its spatial carrying capacity of debris cover, to quantify the state of glaciers. Debris cover is present on 44% of Earth’s glaciers and prominent (>1.0 km2) on 15%. Of Earth’s glaciers, 20% have a substantial percentage of debris cover for which the net stage is 36% and the bulk of individual glaciers have evolved beyond an optimal moraine configuration favourable for debris-cover expansion. Use of this dataset in global-scale models will enable improved estimates of melt over 10.6% of the global glacier domain."}],"oa_version":"None"},{"status":"public","type":"conference","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","short":"CC BY-NC-ND (3.0)"},"conference":{"end_date":"2020-05-01","location":"Virtual ; Addis Ababa, Ethiopia","start_date":"2020-04-26","name":"ICLR: International Conference on Learning Representations"},"_id":"10672","file_date_updated":"2022-01-26T07:35:17Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"ddc":["000"],"date_updated":"2023-04-03T07:33:40Z","month":"03","scopus_import":"1","main_file_link":[{"url":"https://openreview.net/forum?id=Bke61krFvS","open_access":"1"}],"oa_version":"Published Version","abstract":[{"text":"The family of feedback alignment (FA) algorithms aims to provide a more biologically motivated alternative to backpropagation (BP), by substituting the computations that are unrealistic to be implemented in physical brains. While FA algorithms have been shown to work well in practice, there is a lack of rigorous theory proofing their learning capabilities. Here we introduce the first feedback alignment algorithm with provable learning guarantees. In contrast to existing work, we do not require any assumption about the size or depth of the network except that it has a single output neuron, i.e., such as for binary classification tasks. We show that our FA algorithm can deliver its theoretical promises in practice, surpassing the learning performance of existing FA methods and matching backpropagation in binary classification tasks. Finally, we demonstrate the limits of our FA variant when the number of output neurons grows beyond a certain quantity.","lang":"eng"}],"license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","file":[{"date_updated":"2022-01-26T07:35:17Z","file_size":249431,"creator":"mlechner","date_created":"2022-01-26T07:35:17Z","file_name":"iclr_2020.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"10677","checksum":"ea13d42dd4541ddb239b6a75821fd6c9","success":1}],"language":[{"iso":"eng"}],"publication_status":"published","project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"}],"title":"Learning representations for binary-classification without backpropagation","author":[{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” 8th International Conference on Learning Representations, ICLR, 2020.","ieee":"M. Lechner, “Learning representations for binary-classification without backpropagation,” in 8th International Conference on Learning Representations, Virtual ; Addis Ababa, Ethiopia, 2020.","short":"M. Lechner, in:, 8th International Conference on Learning Representations, ICLR, 2020.","ama":"Lechner M. Learning representations for binary-classification without backpropagation. In: 8th International Conference on Learning Representations. ICLR; 2020.","apa":"Lechner, M. (2020). Learning representations for binary-classification without backpropagation. In 8th International Conference on Learning Representations. Virtual ; Addis Ababa, Ethiopia: ICLR.","chicago":"Lechner, Mathias. “Learning Representations for Binary-Classification without Backpropagation.” In 8th International Conference on Learning Representations. ICLR, 2020.","ista":"Lechner M. 2020. Learning representations for binary-classification without backpropagation. 8th International Conference on Learning Representations. ICLR: International Conference on Learning Representations."},"quality_controlled":"1","publisher":"ICLR","oa":1,"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23\r\n(Wittgenstein Award).\r\n","date_published":"2020-03-11T00:00:00Z","date_created":"2022-01-25T15:50:00Z","day":"11","publication":"8th International Conference on Learning Representations","has_accepted_license":"1","year":"2020"},{"department":[{"_id":"ChLa"}],"date_updated":"2023-04-25T09:49:58Z","conference":{"name":"NeurIPS: Neural Information Processing Systems","location":"Vancouver, Canada","end_date":"2020-12-12","start_date":"2020-12-06"},"type":"conference","status":"public","_id":"8188","volume":33,"publication_status":"published","publication_identifier":{"isbn":["9781713829546"]},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2007.06705"}],"intvolume":" 33","month":"07","acknowledged_ssus":[{"_id":"ScienComp"}],"abstract":[{"text":"A natural approach to generative modeling of videos is to represent them as a composition of moving objects. Recent works model a set of 2D sprites over a slowly-varying background, but without considering the underlying 3D scene that\r\ngives rise to them. We instead propose to model a video as the view seen while moving through a scene with multiple 3D objects and a 3D background. Our model is trained from monocular videos without any supervision, yet learns to\r\ngenerate coherent 3D scenes containing several moving objects. We conduct detailed experiments on two datasets, going beyond the visual complexity supported by state-of-the-art generative approaches. We evaluate our method on\r\ndepth-prediction and 3D object detection---tasks which cannot be addressed by those earlier works---and show it out-performs them even on 2D instance segmentation and tracking.","lang":"eng"}],"oa_version":"Preprint","external_id":{"arxiv":["2007.06705"]},"article_processing_charge":"No","author":[{"full_name":"Henderson, Paul M","orcid":"0000-0002-5198-7445","last_name":"Henderson","id":"13C09E74-18D9-11E9-8878-32CFE5697425","first_name":"Paul M"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","last_name":"Lampert"}],"title":"Unsupervised object-centric video generation and decomposition in 3D","citation":{"short":"P.M. Henderson, C. Lampert, in:, 34th Conference on Neural Information Processing Systems, Curran Associates, 2020, pp. 3106–3117.","ieee":"P. M. Henderson and C. Lampert, “Unsupervised object-centric video generation and decomposition in 3D,” in 34th Conference on Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 3106–3117.","apa":"Henderson, P. M., & Lampert, C. (2020). Unsupervised object-centric video generation and decomposition in 3D. In 34th Conference on Neural Information Processing Systems (Vol. 33, pp. 3106–3117). Vancouver, Canada: Curran Associates.","ama":"Henderson PM, Lampert C. Unsupervised object-centric video generation and decomposition in 3D. In: 34th Conference on Neural Information Processing Systems. Vol 33. Curran Associates; 2020:3106–3117.","mla":"Henderson, Paul M., and Christoph Lampert. “Unsupervised Object-Centric Video Generation and Decomposition in 3D.” 34th Conference on Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 3106–3117.","ista":"Henderson PM, Lampert C. 2020. Unsupervised object-centric video generation and decomposition in 3D. 34th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 33, 3106–3117.","chicago":"Henderson, Paul M, and Christoph Lampert. “Unsupervised Object-Centric Video Generation and Decomposition in 3D.” In 34th Conference on Neural Information Processing Systems, 33:3106–3117. Curran Associates, 2020."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"3106–3117","date_created":"2020-07-31T16:59:19Z","date_published":"2020-07-07T00:00:00Z","year":"2020","publication":"34th Conference on Neural Information Processing Systems","day":"07","oa":1,"quality_controlled":"1","publisher":"Curran Associates","acknowledgement":"This research was supported by the Scientific Service Units (SSU) of IST Austria through resources\r\nprovided by Scientific Computing (SciComp). PH is employed part-time by Blackford Analysis, but\r\nthey did not support this project in any way."},{"_id":"12188","status":"public","keyword":["Multidisciplinary"],"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)"},"extern":"1","ddc":["580"],"date_updated":"2023-05-08T10:53:55Z","department":[{"_id":"XiFe"}],"file_date_updated":"2023-02-07T11:29:55Z","oa_version":"Published Version","pmid":1,"abstract":[{"lang":"eng","text":"Molecular mechanisms enabling the switching and maintenance of epigenetic states are not fully understood. Distinct histone modifications are often associated with ON/OFF epigenetic states, but how these states are stably maintained through DNA replication, yet in certain situations switch from one to another remains unclear. Here, we address this problem through identification of Arabidopsis INCURVATA11 (ICU11) as a Polycomb Repressive Complex 2 accessory protein. ICU11 robustly immunoprecipitated in vivo with PRC2 core components and the accessory proteins, EMBRYONIC FLOWER 1 (EMF1), LIKE HETEROCHROMATIN PROTEIN1 (LHP1), and TELOMERE_REPEAT_BINDING FACTORS (TRBs). ICU11 encodes a 2-oxoglutarate-dependent dioxygenase, an activity associated with histone demethylation in other organisms, and mutant plants show defects in multiple aspects of the Arabidopsis epigenome. To investigate its primary molecular function we identified the Arabidopsis FLOWERING LOCUS C (FLC) as a direct target and found icu11 disrupted the cold-induced, Polycomb-mediated silencing underlying vernalization. icu11 prevented reduction in H3K36me3 levels normally seen during the early cold phase, supporting a role for ICU11 in H3K36me3 demethylation. This was coincident with an attenuation of H3K27me3 at the internal nucleation site in FLC, and reduction in H3K27me3 levels across the body of the gene after plants were returned to the warm. Thus, ICU11 is required for the cold-induced epigenetic switching between the mutually exclusive chromatin states at FLC, from the active H3K36me3 state to the silenced H3K27me3 state. These data support the importance of physical coupling of histone modification activities to promote epigenetic switching between opposing chromatin states."}],"month":"05","intvolume":" 117","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7368280/"}],"file":[{"date_updated":"2023-02-07T11:29:55Z","file_size":1105414,"creator":"alisjak","date_created":"2023-02-07T11:29:55Z","file_name":"2020_PNAS_Bloomer.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"cedee184cb12f454f2fba4158ff47db9","file_id":"12526","success":1}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0027-8424","1091-6490"]},"publication_status":"published","issue":"28","volume":117,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Bloomer RH, Hutchison CE, Bäurle I, Walker J, Fang X, Perera P, Velanis CN, Gümüs S, Spanos C, Rappsilber J, Feng X, Goodrich J, Dean C. 2020. The Arabidopsis epigenetic regulator ICU11 as an accessory protein of polycomb repressive complex 2. Proceedings of the National Academy of Sciences. 117(28), 16660–16666.","chicago":"Bloomer, Rebecca H., Claire E. Hutchison, Isabel Bäurle, James Walker, Xiaofeng Fang, Pumi Perera, Christos N. Velanis, et al. “The Arabidopsis Epigenetic Regulator ICU11 as an Accessory Protein of Polycomb Repressive Complex 2.” Proceedings of the National Academy of Sciences. Proceedings of the National Academy of Sciences, 2020. https://doi.org/10.1073/pnas.1920621117.","ama":"Bloomer RH, Hutchison CE, Bäurle I, et al. The Arabidopsis epigenetic regulator ICU11 as an accessory protein of polycomb repressive complex 2. Proceedings of the National Academy of Sciences. 2020;117(28):16660-16666. doi:10.1073/pnas.1920621117","apa":"Bloomer, R. H., Hutchison, C. E., Bäurle, I., Walker, J., Fang, X., Perera, P., … Dean, C. (2020). The Arabidopsis epigenetic regulator ICU11 as an accessory protein of polycomb repressive complex 2. Proceedings of the National Academy of Sciences. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.1920621117","short":"R.H. Bloomer, C.E. Hutchison, I. Bäurle, J. Walker, X. Fang, P. Perera, C.N. Velanis, S. Gümüs, C. Spanos, J. Rappsilber, X. Feng, J. Goodrich, C. Dean, Proceedings of the National Academy of Sciences 117 (2020) 16660–16666.","ieee":"R. H. Bloomer et al., “The Arabidopsis epigenetic regulator ICU11 as an accessory protein of polycomb repressive complex 2,” Proceedings of the National Academy of Sciences, vol. 117, no. 28. Proceedings of the National Academy of Sciences, pp. 16660–16666, 2020.","mla":"Bloomer, Rebecca H., et al. “The Arabidopsis Epigenetic Regulator ICU11 as an Accessory Protein of Polycomb Repressive Complex 2.” Proceedings of the National Academy of Sciences, vol. 117, no. 28, Proceedings of the National Academy of Sciences, 2020, pp. 16660–66, doi:10.1073/pnas.1920621117."},"title":"The Arabidopsis epigenetic regulator ICU11 as an accessory protein of polycomb repressive complex 2","author":[{"last_name":"Bloomer","full_name":"Bloomer, Rebecca H.","first_name":"Rebecca H."},{"first_name":"Claire E.","last_name":"Hutchison","full_name":"Hutchison, Claire E."},{"first_name":"Isabel","last_name":"Bäurle","full_name":"Bäurle, Isabel"},{"full_name":"Walker, James","last_name":"Walker","first_name":"James"},{"first_name":"Xiaofeng","last_name":"Fang","full_name":"Fang, Xiaofeng"},{"full_name":"Perera, Pumi","last_name":"Perera","first_name":"Pumi"},{"last_name":"Velanis","full_name":"Velanis, Christos N.","first_name":"Christos N."},{"first_name":"Serin","full_name":"Gümüs, Serin","last_name":"Gümüs"},{"first_name":"Christos","last_name":"Spanos","full_name":"Spanos, Christos"},{"first_name":"Juri","full_name":"Rappsilber, Juri","last_name":"Rappsilber"},{"orcid":"0000-0002-4008-1234","full_name":"Feng, Xiaoqi","last_name":"Feng","id":"e0164712-22ee-11ed-b12a-d80fcdf35958","first_name":"Xiaoqi"},{"first_name":"Justin","full_name":"Goodrich, Justin","last_name":"Goodrich"},{"first_name":"Caroline","full_name":"Dean, Caroline","last_name":"Dean"}],"article_processing_charge":"No","external_id":{"pmid":["32601198"]},"acknowledgement":"We would like to thank Scott Berry for help with ICU-GFP nuclear localization microscopy, Hao Yu and Lisha Shen for assistance with 6mA DNA methylation analysis, Donna Gibson for graphic design assistance, and members of the C.D. and Howard laboratories for helpful discussions. This work was funded by the European Research Council grants to “MEXTIM” (to C.D.) and “SexMeth” (to X. Feng), by the Biotechnological and Biological Sciences Research Council (BBSRC) Institute Strategic Programmes GRO (BB/J004588/1), GEN (BB/P013511/1), BBSRC grant (to X. Feng) (BB/S009620/1), and the Marie Sklodowska–Curie Postdoctoral Fellowships “UNRAVEL” (to R.H.B.) and \"WISDOM\" (to X. Fang). Additional funding via the Wellcome Trust through a Senior Research Fellowship (to J.R.) (103139) and a multiuser equipment grant (108504). The Wellcome Centre for Cell Biology is supported by core funding from the Wellcome Trust (203149).","publisher":"Proceedings of the National Academy of Sciences","quality_controlled":"1","oa":1,"day":"22","publication":"Proceedings of the National Academy of Sciences","has_accepted_license":"1","year":"2020","date_published":"2020-05-22T00:00:00Z","doi":"10.1073/pnas.1920621117","date_created":"2023-01-16T09:15:44Z","page":"16660-16666"},{"acknowledgement":"The authors wish to thank Cécile Raynaud, Eric Jenczewski, Rajeev Kumar, Raphaël Mercier and Jean Molinier for critical reading of the manuscript.","publisher":"Public Library of Science (PLoS)","quality_controlled":"1","oa":1,"day":"29","publication":"PLOS Genetics","year":"2020","doi":"10.1371/journal.pgen.1008894","date_published":"2020-06-29T00:00:00Z","date_created":"2023-01-16T09:16:10Z","article_number":"e1008894","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Christophorou, N., She, W., Long, J., Hurel, A., Beaubiat, S., Idir, Y., … Mézard, C. (2020). AXR1 affects DNA methylation independently of its role in regulating meiotic crossover localization. PLOS Genetics. Public Library of Science (PLoS). https://doi.org/10.1371/journal.pgen.1008894","ama":"Christophorou N, She W, Long J, et al. AXR1 affects DNA methylation independently of its role in regulating meiotic crossover localization. PLOS Genetics. 2020;16(6). doi:10.1371/journal.pgen.1008894","short":"N. Christophorou, W. She, J. Long, A. Hurel, S. Beaubiat, Y. Idir, M. Tagliaro-Jahns, A. Chambon, V. Solier, D. Vezon, M. Grelon, X. Feng, N. Bouché, C. Mézard, PLOS Genetics 16 (2020).","ieee":"N. Christophorou et al., “AXR1 affects DNA methylation independently of its role in regulating meiotic crossover localization,” PLOS Genetics, vol. 16, no. 6. Public Library of Science (PLoS), 2020.","mla":"Christophorou, Nicolas, et al. “AXR1 Affects DNA Methylation Independently of Its Role in Regulating Meiotic Crossover Localization.” PLOS Genetics, vol. 16, no. 6, e1008894, Public Library of Science (PLoS), 2020, doi:10.1371/journal.pgen.1008894.","ista":"Christophorou N, She W, Long J, Hurel A, Beaubiat S, Idir Y, Tagliaro-Jahns M, Chambon A, Solier V, Vezon D, Grelon M, Feng X, Bouché N, Mézard C. 2020. AXR1 affects DNA methylation independently of its role in regulating meiotic crossover localization. PLOS Genetics. 16(6), e1008894.","chicago":"Christophorou, Nicolas, Wenjing She, Jincheng Long, Aurélie Hurel, Sébastien Beaubiat, Yassir Idir, Marina Tagliaro-Jahns, et al. “AXR1 Affects DNA Methylation Independently of Its Role in Regulating Meiotic Crossover Localization.” PLOS Genetics. Public Library of Science (PLoS), 2020. https://doi.org/10.1371/journal.pgen.1008894."},"title":"AXR1 affects DNA methylation independently of its role in regulating meiotic crossover localization","author":[{"full_name":"Christophorou, Nicolas","last_name":"Christophorou","first_name":"Nicolas"},{"full_name":"She, Wenjing","last_name":"She","first_name":"Wenjing"},{"first_name":"Jincheng","last_name":"Long","full_name":"Long, Jincheng"},{"full_name":"Hurel, Aurélie","last_name":"Hurel","first_name":"Aurélie"},{"full_name":"Beaubiat, Sébastien","last_name":"Beaubiat","first_name":"Sébastien"},{"last_name":"Idir","full_name":"Idir, Yassir","first_name":"Yassir"},{"first_name":"Marina","last_name":"Tagliaro-Jahns","full_name":"Tagliaro-Jahns, Marina"},{"last_name":"Chambon","full_name":"Chambon, Aurélie","first_name":"Aurélie"},{"first_name":"Victor","full_name":"Solier, Victor","last_name":"Solier"},{"last_name":"Vezon","full_name":"Vezon, Daniel","first_name":"Daniel"},{"last_name":"Grelon","full_name":"Grelon, Mathilde","first_name":"Mathilde"},{"last_name":"Feng","full_name":"Feng, Xiaoqi","orcid":"0000-0002-4008-1234","id":"e0164712-22ee-11ed-b12a-d80fcdf35958","first_name":"Xiaoqi"},{"last_name":"Bouché","full_name":"Bouché, Nicolas","first_name":"Nicolas"},{"full_name":"Mézard, Christine","last_name":"Mézard","first_name":"Christine"}],"article_processing_charge":"No","external_id":{"pmid":["32598340"]},"oa_version":"Published Version","pmid":1,"abstract":[{"lang":"eng","text":"Meiotic crossovers (COs) are important for reshuffling genetic information between homologous chromosomes and they are essential for their correct segregation. COs are unevenly distributed along chromosomes and the underlying mechanisms controlling CO localization are not well understood. We previously showed that meiotic COs are mis-localized in the absence of AXR1, an enzyme involved in the neddylation/rubylation protein modification pathway in Arabidopsis thaliana. Here, we report that in axr1-/-, male meiocytes show a strong defect in chromosome pairing whereas the formation of the telomere bouquet is not affected. COs are also redistributed towards subtelomeric chromosomal ends where they frequently form clusters, in contrast to large central regions depleted in recombination. The CO suppressed regions correlate with DNA hypermethylation of transposable elements (TEs) in the CHH context in axr1-/- meiocytes. Through examining somatic methylomes, we found axr1-/- affects DNA methylation in a plant, causing hypermethylation in all sequence contexts (CG, CHG and CHH) in TEs. Impairment of the main pathways involved in DNA methylation is epistatic over axr1-/- for DNA methylation in somatic cells but does not restore regular chromosome segregation during meiosis. Collectively, our findings reveal that the neddylation pathway not only regulates hormonal perception and CO distribution but is also, directly or indirectly, a major limiting pathway of TE DNA methylation in somatic cells."}],"month":"06","intvolume":" 16","scopus_import":"1","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7351236/","open_access":"1"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1553-7404"]},"publication_status":"published","issue":"6","volume":16,"_id":"12189","status":"public","keyword":["Cancer Research","Genetics (clinical)","Genetics","Molecular Biology","Ecology","Evolution","Behavior and Systematics"],"type":"journal_article","article_type":"original","extern":"1","date_updated":"2023-05-08T10:54:39Z","department":[{"_id":"XiFe"}]},{"abstract":[{"lang":"eng","text":"Let be a sequence of points on an elliptic curve defined over a number field K. In this paper, we study the denominators of the x-coordinates of this sequence. We prove that, if Q is a torsion point of prime order, then for n large enough there always exists a primitive divisor. Later on, we show the link between the study of the primitive divisors and a Lang-Trotter conjecture. Indeed, given two points P and Q on the elliptic curve, we prove a lower bound for the number of primes p such that P is in the orbit of Q modulo p."}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1906.00632"}],"scopus_import":"1","intvolume":" 209","month":"04","publication_status":"published","publication_identifier":{"issn":["0022-314X"]},"language":[{"iso":"eng"}],"volume":209,"issue":"4","_id":"12310","type":"journal_article","article_type":"original","keyword":["Algebra and Number Theory"],"status":"public","date_updated":"2023-05-10T11:14:56Z","extern":"1","oa":1,"quality_controlled":"1","publisher":"Elsevier","year":"2020","publication":"Journal of Number Theory","day":"01","page":"378-390","date_created":"2023-01-16T11:45:07Z","date_published":"2020-04-01T00:00:00Z","doi":"10.1016/j.jnt.2019.09.003","citation":{"ieee":"M. Verzobio, “Primitive divisors of sequences associated to elliptic curves,” Journal of Number Theory, vol. 209, no. 4. Elsevier, pp. 378–390, 2020.","short":"M. Verzobio, Journal of Number Theory 209 (2020) 378–390.","apa":"Verzobio, M. (2020). Primitive divisors of sequences associated to elliptic curves. Journal of Number Theory. Elsevier. https://doi.org/10.1016/j.jnt.2019.09.003","ama":"Verzobio M. Primitive divisors of sequences associated to elliptic curves. Journal of Number Theory. 2020;209(4):378-390. doi:10.1016/j.jnt.2019.09.003","mla":"Verzobio, Matteo. “Primitive Divisors of Sequences Associated to Elliptic Curves.” Journal of Number Theory, vol. 209, no. 4, Elsevier, 2020, pp. 378–90, doi:10.1016/j.jnt.2019.09.003.","ista":"Verzobio M. 2020. Primitive divisors of sequences associated to elliptic curves. Journal of Number Theory. 209(4), 378–390.","chicago":"Verzobio, Matteo. “Primitive Divisors of Sequences Associated to Elliptic Curves.” Journal of Number Theory. Elsevier, 2020. https://doi.org/10.1016/j.jnt.2019.09.003."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1906.00632"]},"article_processing_charge":"No","author":[{"orcid":"0000-0002-0854-0306","full_name":"Verzobio, Matteo","last_name":"Verzobio","id":"7aa8f170-131e-11ed-88e1-a9efd01027cb","first_name":"Matteo"}],"title":"Primitive divisors of sequences associated to elliptic curves"},{"author":[{"full_name":"Monserrat, Bartomeu","last_name":"Monserrat","first_name":"Bartomeu"},{"last_name":"Brandenburg","full_name":"Brandenburg, Jan Gerit","first_name":"Jan Gerit"},{"full_name":"Engel, Edgar A.","last_name":"Engel","first_name":"Edgar A."},{"first_name":"Bingqing","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","last_name":"Cheng","orcid":"0000-0002-3584-9632","full_name":"Cheng, Bingqing"}],"article_processing_charge":"No","external_id":{"arxiv":["2006.13316"]},"title":"Extracting ice phases from liquid water: Why a machine-learning water model generalizes so well","date_updated":"2023-05-10T10:17:48Z","citation":{"short":"B. Monserrat, J.G. Brandenburg, E.A. Engel, B. Cheng, ArXiv (n.d.).","ieee":"B. Monserrat, J. G. Brandenburg, E. A. Engel, and B. Cheng, “Extracting ice phases from liquid water: Why a machine-learning water model generalizes so well,” arXiv. .","ama":"Monserrat B, Brandenburg JG, Engel EA, Cheng B. Extracting ice phases from liquid water: Why a machine-learning water model generalizes so well. arXiv. doi:10.48550/arXiv.2006.13316","apa":"Monserrat, B., Brandenburg, J. G., Engel, E. A., & Cheng, B. (n.d.). Extracting ice phases from liquid water: Why a machine-learning water model generalizes so well. arXiv. https://doi.org/10.48550/arXiv.2006.13316","mla":"Monserrat, Bartomeu, et al. “Extracting Ice Phases from Liquid Water: Why a Machine-Learning Water Model Generalizes so Well.” ArXiv, 2006.13316, doi:10.48550/arXiv.2006.13316.","ista":"Monserrat B, Brandenburg JG, Engel EA, Cheng B. Extracting ice phases from liquid water: Why a machine-learning water model generalizes so well. arXiv, 2006.13316.","chicago":"Monserrat, Bartomeu, Jan Gerit Brandenburg, Edgar A. Engel, and Bingqing Cheng. “Extracting Ice Phases from Liquid Water: Why a Machine-Learning Water Model Generalizes so Well.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2006.13316."},"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"preprint","status":"public","_id":"9699","article_number":"2006.13316","doi":"10.48550/arXiv.2006.13316","date_published":"2020-06-23T00:00:00Z","date_created":"2021-07-20T11:25:15Z","year":"2020","publication_status":"submitted","day":"23","publication":"arXiv","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/2006.13316","open_access":"1"}],"month":"06","abstract":[{"lang":"eng","text":"We investigate the structural similarities between liquid water and 53 ices, including 20 known crystalline phases. We base such similarity comparison on the local environments that consist of atoms within a certain cutoff radius of a central atom. We reveal that liquid water explores the local environments of the diverse ice phases, by directly comparing the environments in these phases using general atomic descriptors, and also by demonstrating that a machine-learning potential trained on liquid water alone can predict the densities, the lattice energies, and vibrational properties of the\r\nices. The finding that the local environments characterising the different ice phases are found in water sheds light on water phase behaviors, and rationalizes the transferability of water models between different phases."}],"oa_version":"Submitted Version"},{"status":"public","keyword":["Analytical Chemistry"],"type":"journal_article","article_type":"letter_note","_id":"12940","extern":"1","date_updated":"2023-05-15T08:01:20Z","month":"10","intvolume":" 92","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1021/acs.analchem.0c02615"}],"oa_version":"Published Version","pmid":1,"abstract":[{"text":"Desorption electrospray ionization (DESI), easy ambient sonic-spray ionization (EASI) and low-temperature plasma (LTP) ionization are powerful ambient ionization techniques for mass spectrometry. However, every single method has its limitation in terms of polarity and molecular weight of analyte molecules. After the miniaturization of every possible component of the different ion sources, we finally were able to embed two emitters and an ion transfer tubing into a small, hand-held device. The pen-like interface is connected to the mass spectrometer and a separate control unit via a bundle of flexible tubing and cables. The novel device allows the user to ionize an extended range of chemicals by simple switching between DESI, voltage-free EASI, or LTP ionization as well as to freely move the interface over a surface of interest. A mini camera, which is mounted on the tip of the pen, magnifies the desorption area and enables a simple positioning of the pen. The interface was successfully tested using different types of chemicals, pharmaceuticals, and real life samples. Moreover, the combination of optical data from the camera module and chemical data obtained by mass analysis facilitates a novel type of imaging mass spectrometry, which we name “interactive mass spectrometry imaging (IMSI)”.","lang":"eng"}],"volume":92,"issue":"21","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0003-2700","1520-6882"]},"publication_status":"published","title":"A 3-in-1 hand-held ambient mass spectrometry interface for identification and 2D localization of chemicals on surfaces","author":[{"full_name":"Meisenbichler, Christina","last_name":"Meisenbichler","first_name":"Christina"},{"last_name":"Kluibenschedl","full_name":"Kluibenschedl, Florian","id":"7499e70e-eb2c-11ec-b98b-f925648bc9d9","first_name":"Florian"},{"full_name":"Müller, Thomas","last_name":"Müller","first_name":"Thomas"}],"external_id":{"pmid":["33063994"]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"C. Meisenbichler, F. Kluibenschedl, and T. Müller, “A 3-in-1 hand-held ambient mass spectrometry interface for identification and 2D localization of chemicals on surfaces,” Analytical Chemistry, vol. 92, no. 21. American Chemical Society, pp. 14314–14318, 2020.","short":"C. Meisenbichler, F. Kluibenschedl, T. Müller, Analytical Chemistry 92 (2020) 14314–14318.","apa":"Meisenbichler, C., Kluibenschedl, F., & Müller, T. (2020). A 3-in-1 hand-held ambient mass spectrometry interface for identification and 2D localization of chemicals on surfaces. Analytical Chemistry. American Chemical Society. https://doi.org/10.1021/acs.analchem.0c02615","ama":"Meisenbichler C, Kluibenschedl F, Müller T. A 3-in-1 hand-held ambient mass spectrometry interface for identification and 2D localization of chemicals on surfaces. Analytical Chemistry. 2020;92(21):14314-14318. doi:10.1021/acs.analchem.0c02615","mla":"Meisenbichler, Christina, et al. “A 3-in-1 Hand-Held Ambient Mass Spectrometry Interface for Identification and 2D Localization of Chemicals on Surfaces.” Analytical Chemistry, vol. 92, no. 21, American Chemical Society, 2020, pp. 14314–18, doi:10.1021/acs.analchem.0c02615.","ista":"Meisenbichler C, Kluibenschedl F, Müller T. 2020. A 3-in-1 hand-held ambient mass spectrometry interface for identification and 2D localization of chemicals on surfaces. Analytical Chemistry. 92(21), 14314–14318.","chicago":"Meisenbichler, Christina, Florian Kluibenschedl, and Thomas Müller. “A 3-in-1 Hand-Held Ambient Mass Spectrometry Interface for Identification and 2D Localization of Chemicals on Surfaces.” Analytical Chemistry. American Chemical Society, 2020. https://doi.org/10.1021/acs.analchem.0c02615."},"quality_controlled":"1","publisher":"American Chemical Society","oa":1,"doi":"10.1021/acs.analchem.0c02615","date_published":"2020-10-16T00:00:00Z","date_created":"2023-05-10T14:50:19Z","page":"14314-14318","day":"16","publication":"Analytical Chemistry","year":"2020"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Karg CA, Wang P, Kluibenschedl F, Müller T, Allmendinger L, Vollmar AM, Moser S. 2020. Phylloxanthobilins are abundant linear tetrapyrroles from chlorophyll breakdown with activities against cancer cells. European Journal of Organic Chemistry. 2020(29), 4499–4509.","chicago":"Karg, Cornelia A., Pengyu Wang, Florian Kluibenschedl, Thomas Müller, Lars Allmendinger, Angelika M. Vollmar, and Simone Moser. “Phylloxanthobilins Are Abundant Linear Tetrapyrroles from Chlorophyll Breakdown with Activities against Cancer Cells.” European Journal of Organic Chemistry. Wiley, 2020. https://doi.org/10.1002/ejoc.202000692.","short":"C.A. Karg, P. Wang, F. Kluibenschedl, T. Müller, L. Allmendinger, A.M. Vollmar, S. Moser, European Journal of Organic Chemistry 2020 (2020) 4499–4509.","ieee":"C. A. Karg et al., “Phylloxanthobilins are abundant linear tetrapyrroles from chlorophyll breakdown with activities against cancer cells,” European Journal of Organic Chemistry, vol. 2020, no. 29. Wiley, pp. 4499–4509, 2020.","apa":"Karg, C. A., Wang, P., Kluibenschedl, F., Müller, T., Allmendinger, L., Vollmar, A. M., & Moser, S. (2020). Phylloxanthobilins are abundant linear tetrapyrroles from chlorophyll breakdown with activities against cancer cells. European Journal of Organic Chemistry. Wiley. https://doi.org/10.1002/ejoc.202000692","ama":"Karg CA, Wang P, Kluibenschedl F, et al. Phylloxanthobilins are abundant linear tetrapyrroles from chlorophyll breakdown with activities against cancer cells. European Journal of Organic Chemistry. 2020;2020(29):4499-4509. doi:10.1002/ejoc.202000692","mla":"Karg, Cornelia A., et al. “Phylloxanthobilins Are Abundant Linear Tetrapyrroles from Chlorophyll Breakdown with Activities against Cancer Cells.” European Journal of Organic Chemistry, vol. 2020, no. 29, Wiley, 2020, pp. 4499–509, doi:10.1002/ejoc.202000692."},"title":"Phylloxanthobilins are abundant linear tetrapyrroles from chlorophyll breakdown with activities against cancer cells","article_processing_charge":"No","author":[{"last_name":"Karg","full_name":"Karg, Cornelia A.","first_name":"Cornelia A."},{"full_name":"Wang, Pengyu","last_name":"Wang","first_name":"Pengyu"},{"last_name":"Kluibenschedl","full_name":"Kluibenschedl, Florian","id":"7499e70e-eb2c-11ec-b98b-f925648bc9d9","first_name":"Florian"},{"first_name":"Thomas","last_name":"Müller","full_name":"Müller, Thomas"},{"last_name":"Allmendinger","full_name":"Allmendinger, Lars","first_name":"Lars"},{"full_name":"Vollmar, Angelika M.","last_name":"Vollmar","first_name":"Angelika M."},{"first_name":"Simone","last_name":"Moser","full_name":"Moser, Simone"}],"publication":"European Journal of Organic Chemistry","day":"09","year":"2020","date_created":"2023-05-10T14:49:30Z","doi":"10.1002/ejoc.202000692","date_published":"2020-08-09T00:00:00Z","page":"4499-4509","oa":1,"quality_controlled":"1","publisher":"Wiley","extern":"1","date_updated":"2023-05-15T07:57:14Z","_id":"12939","keyword":["Organic Chemistry","Physical and Theoretical Chemistry"],"status":"public","article_type":"original","type":"journal_article","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1434-193X","1099-0690"]},"issue":"29","volume":2020,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Linear tetrapyrroles, called phyllobilins, are obtained as major catabolites upon chlorophyll degradation. Primarily, colorless phylloleucobilins featuring four deconjugated pyrrole units were identified. Their yellow counterparts, phylloxanthobilins, were discovered more recently. Although the two catabolites differ only by one double bond, physicochemical properties are very distinct. Moreover, the presence of the double bond seems to enhance physiologically relevant bioactivities: in contrast to phylloleucobilin, we identified a potent anti-proliferative activity for a phylloxanthobilin, and show that this natural product induces apoptotic cell death and a cell cycle arrest in cancer cells. Interestingly, upon modifying inactive phylloleucobilin by esterification, an anti-proliferative activity can be observed that increases with the chain lengths of the alkyl esters. We provide first evidence for anti-cancer activity of phyllobilins, report a novel plant source for a phylloxanthobilin, and by using paper spray MS, show that these bioactive yellow chlorophyll catabolites are more prevalent in Nature than previously assumed."}],"intvolume":" 2020","month":"08","main_file_link":[{"url":"https://doi.org/10.1002/ejoc.202000692","open_access":"1"}],"scopus_import":"1"},{"title":"Austrian High-Performance-Computing meeting (AHPC2020)","editor":[{"first_name":"Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","full_name":"Schlögl, Alois","orcid":"0000-0002-5621-8100","last_name":"Schlögl"},{"last_name":"Kiss","full_name":"Kiss, Janos","id":"3D3A06F8-F248-11E8-B48F-1D18A9856A87","first_name":"Janos"},{"last_name":"Elefante","full_name":"Elefante, Stefano","id":"490F40CE-F248-11E8-B48F-1D18A9856A87","first_name":"Stefano"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Schlögl A, Kiss J, Elefante S eds. 2020. Austrian High-Performance-Computing meeting (AHPC2020), Klosterneuburg, Austria: IST Austria, 72p.","chicago":"Schlögl, Alois, Janos Kiss, and Stefano Elefante, eds. Austrian High-Performance-Computing Meeting (AHPC2020). Klosterneuburg, Austria: IST Austria, 2020. https://doi.org/10.15479/AT:ISTA:7474.","short":"A. Schlögl, J. Kiss, S. Elefante, eds., Austrian High-Performance-Computing Meeting (AHPC2020), IST Austria, Klosterneuburg, Austria, 2020.","ieee":"A. Schlögl, J. Kiss, and S. Elefante, Eds., Austrian High-Performance-Computing meeting (AHPC2020). Klosterneuburg, Austria: IST Austria, 2020.","ama":"Schlögl A, Kiss J, Elefante S, eds. Austrian High-Performance-Computing Meeting (AHPC2020). Klosterneuburg, Austria: IST Austria; 2020. doi:10.15479/AT:ISTA:7474","apa":"Schlögl, A., Kiss, J., & Elefante, S. (Eds.). (2020). Austrian High-Performance-Computing meeting (AHPC2020). Presented at the AHPC: Austrian High-Performance-Computing Meeting, Klosterneuburg, Austria: IST Austria. https://doi.org/10.15479/AT:ISTA:7474","mla":"Schlögl, Alois, et al., editors. Austrian High-Performance-Computing Meeting (AHPC2020). IST Austria, 2020, doi:10.15479/AT:ISTA:7474."},"publisher":"IST Austria","quality_controlled":"1","oa":1,"date_published":"2020-02-19T00:00:00Z","doi":"10.15479/AT:ISTA:7474","date_created":"2020-02-11T07:59:04Z","page":"72","day":"19","has_accepted_license":"1","year":"2020","status":"public","type":"book_editor","conference":{"name":"AHPC: Austrian High-Performance-Computing Meeting","end_date":"2020-02-21","location":"Klosterneuburg, Austria","start_date":"2020-02-19"},"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":"7474","department":[{"_id":"ScienComp"}],"file_date_updated":"2020-07-14T12:47:59Z","ddc":["000"],"date_updated":"2023-05-16T07:48:28Z","place":"Klosterneuburg, Austria","month":"02","oa_version":"Published Version","abstract":[{"text":"This booklet is a collection of abstracts presented at the AHPC conference.","lang":"eng"}],"file":[{"date_updated":"2020-07-14T12:47:59Z","file_size":90899507,"creator":"schloegl","date_created":"2020-02-19T06:53:38Z","file_name":"BOOKLET_AHPC2020.final.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"49798edb9e57bbd6be18362d1d7b18a9","file_id":"7504"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-3-99078-004-6"]},"publication_status":"published"},{"oa_version":"Published Version","abstract":[{"text":"Quantization converts neural networks into low-bit fixed-point computations which can be carried out by efficient integer-only hardware, and is standard practice for the deployment of neural networks on real-time embedded devices. However, like their real-numbered counterpart, quantized networks are not immune to malicious misclassification caused by adversarial attacks. We investigate how quantization affects a network’s robustness to adversarial attacks, which is a formal verification question. We show that neither robustness nor non-robustness are monotonic with changing the number of bits for the representation and, also, neither are preserved by quantization from a real-numbered network. For this reason, we introduce a verification method for quantized neural networks which, using SMT solving over bit-vectors, accounts for their exact, bit-precise semantics. We built a tool and analyzed the effect of quantization on a classifier for the MNIST dataset. We demonstrate that, compared to our method, existing methods for the analysis of real-numbered networks often derive false conclusions about their quantizations, both when determining robustness and when detecting attacks, and that existing methods for quantized networks often miss attacks. Furthermore, we applied our method beyond robustness, showing how the number of bits in quantization enlarges the gender bias of a predictor for students’ grades.","lang":"eng"}],"intvolume":" 12079","month":"04","scopus_import":1,"alternative_title":["LNCS"],"language":[{"iso":"eng"}],"file":[{"creator":"dernst","date_updated":"2020-07-14T12:48:03Z","file_size":2744030,"date_created":"2020-05-26T12:48:15Z","file_name":"2020_TACAS_Giacobbe.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"7893","checksum":"f19905a42891fe5ce93d69143fa3f6fb"}],"publication_status":"published","publication_identifier":{"issn":["03029743"],"eissn":["16113349"],"isbn":["9783030452360"]},"volume":12079,"related_material":{"record":[{"id":"11362","status":"public","relation":"dissertation_contains"}]},"_id":"7808","status":"public","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2020-04-25","end_date":"2020-04-30","location":"Dublin, Ireland"},"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","ddc":["000"],"date_updated":"2023-06-23T07:01:11Z","file_date_updated":"2020-07-14T12:48:03Z","department":[{"_id":"ToHe"}],"oa":1,"publisher":"Springer Nature","quality_controlled":"1","publication":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","day":"17","year":"2020","has_accepted_license":"1","date_created":"2020-05-10T22:00:49Z","doi":"10.1007/978-3-030-45237-7_5","date_published":"2020-04-17T00:00:00Z","page":"79-97","project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Giacobbe, M., Henzinger, T. A., & Lechner, M. (2020). How many bits does it take to quantize your neural network? In International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 12079, pp. 79–97). Dublin, Ireland: Springer Nature. https://doi.org/10.1007/978-3-030-45237-7_5","ama":"Giacobbe M, Henzinger TA, Lechner M. How many bits does it take to quantize your neural network? In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Vol 12079. Springer Nature; 2020:79-97. doi:10.1007/978-3-030-45237-7_5","short":"M. Giacobbe, T.A. Henzinger, M. Lechner, in:, International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2020, pp. 79–97.","ieee":"M. Giacobbe, T. A. Henzinger, and M. Lechner, “How many bits does it take to quantize your neural network?,” in International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Dublin, Ireland, 2020, vol. 12079, pp. 79–97.","mla":"Giacobbe, Mirco, et al. “How Many Bits Does It Take to Quantize Your Neural Network?” International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 12079, Springer Nature, 2020, pp. 79–97, doi:10.1007/978-3-030-45237-7_5.","ista":"Giacobbe M, Henzinger TA, Lechner M. 2020. How many bits does it take to quantize your neural network? International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 12079, 79–97.","chicago":"Giacobbe, Mirco, Thomas A Henzinger, and Mathias Lechner. “How Many Bits Does It Take to Quantize Your Neural Network?” In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 12079:79–97. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-45237-7_5."},"title":"How many bits does it take to quantize your neural network?","article_processing_charge":"No","author":[{"orcid":"0000-0001-8180-0904","full_name":"Giacobbe, Mirco","last_name":"Giacobbe","first_name":"Mirco","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lechner","full_name":"Lechner, Mathias","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"}]}]