[{"date_created":"2023-04-20T08:29:42Z","date_updated":"2023-04-25T07:19:07Z","volume":13991,"author":[{"full_name":"Chalupa, Marek","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","first_name":"Marek","last_name":"Chalupa"},{"full_name":"Mühlböck, Fabian","orcid":"0000-0003-1548-0177","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","last_name":"Mühlböck","first_name":"Fabian"},{"full_name":"Muroya Lei, Stefanie","id":"a376de31-8972-11ed-ae7b-d0251c13c8ff","last_name":"Muroya Lei","first_name":"Stefanie"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"12407"}]},"publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Springer Nature","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093. The authors would like to thank the anonymous FASE reviewers for their valuable feedback and suggestions.","year":"2023","file_date_updated":"2023-04-25T07:16:36Z","ec_funded":1,"language":[{"iso":"eng"}],"conference":{"end_date":"2023-04-27","location":"Paris, France","start_date":"2023-04-22","name":"FASE: Fundamental Approaches to Software Engineering"},"doi":"10.1007/978-3-031-30826-0_15","quality_controlled":"1","project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"month":"04","publication_identifier":{"isbn":["9783031308253"],"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783031308260"]},"oa_version":"Published Version","file":[{"file_id":"12865","relation":"main_file","success":1,"checksum":"17a7c8e08be609cf2408d37ea55e322c","date_updated":"2023-04-25T07:16:36Z","date_created":"2023-04-25T07:16:36Z","access_level":"open_access","file_name":"2023_LNCS_ChalupaM.pdf","creator":"dernst","content_type":"application/pdf","file_size":580828}],"status":"public","ddc":["000"],"title":"Vamos: Middleware for best-effort third-party monitoring","intvolume":" 13991","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12856","abstract":[{"text":"As the complexity and criticality of software increase every year, so does the importance of run-time monitoring. Third-party monitoring, with limited knowledge of the monitored software, and best-effort monitoring, which keeps pace with the monitored software, are especially valuable, yet underexplored areas of run-time monitoring. Most existing monitoring frameworks do not support their combination because they either require access to the monitored code for instrumentation purposes or the processing of all observed events, or both.\r\n\r\nWe present a middleware framework, VAMOS, for the run-time monitoring of software which is explicitly designed to support third-party and best-effort scenarios. The design goals of VAMOS are (i) efficiency (keeping pace at low overhead), (ii) flexibility (the ability to monitor black-box code through a variety of different event channels, and the connectability to monitors written in different specification languages), and (iii) ease-of-use. To achieve its goals, VAMOS combines aspects of event broker and event recognition systems with aspects of stream processing systems.\r\nWe implemented a prototype toolchain for VAMOS and conducted experiments including a case study of monitoring for data races. The results indicate that VAMOS enables writing useful yet efficient monitors, is compatible with a variety of event sources and monitor specifications, and simplifies key aspects of setting up a monitoring system from scratch.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference","date_published":"2023-04-20T00:00:00Z","page":"260-281","publication":"Fundamental Approaches to Software Engineering","citation":{"ama":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. Vamos: Middleware for best-effort third-party monitoring. In: Fundamental Approaches to Software Engineering. Vol 13991. Springer Nature; 2023:260-281. doi:10.1007/978-3-031-30826-0_15","ieee":"M. Chalupa, F. Mühlböck, S. Muroya Lei, and T. A. Henzinger, “Vamos: Middleware for best-effort third-party monitoring,” in Fundamental Approaches to Software Engineering, Paris, France, 2023, vol. 13991, pp. 260–281.","apa":"Chalupa, M., Mühlböck, F., Muroya Lei, S., & Henzinger, T. A. (2023). Vamos: Middleware for best-effort third-party monitoring. In Fundamental Approaches to Software Engineering (Vol. 13991, pp. 260–281). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-30826-0_15","ista":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. 2023. Vamos: Middleware for best-effort third-party monitoring. Fundamental Approaches to Software Engineering. FASE: Fundamental Approaches to Software Engineering, LNCS, vol. 13991, 260–281.","short":"M. Chalupa, F. Mühlböck, S. Muroya Lei, T.A. Henzinger, in:, Fundamental Approaches to Software Engineering, Springer Nature, 2023, pp. 260–281.","mla":"Chalupa, Marek, et al. “Vamos: Middleware for Best-Effort Third-Party Monitoring.” Fundamental Approaches to Software Engineering, vol. 13991, Springer Nature, 2023, pp. 260–81, doi:10.1007/978-3-031-30826-0_15.","chicago":"Chalupa, Marek, Fabian Mühlböck, Stefanie Muroya Lei, and Thomas A Henzinger. “Vamos: Middleware for Best-Effort Third-Party Monitoring.” In Fundamental Approaches to Software Engineering, 13991:260–81. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30826-0_15."},"day":"20","article_processing_charge":"No","has_accepted_license":"1"},{"doi":"10.15479/AT:ISTA:12407","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software"}],"month":"01","publication_identifier":{"eissn":["2664-1690"]},"author":[{"full_name":"Chalupa, Marek","first_name":"Marek","last_name":"Chalupa","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463"},{"last_name":"Mühlböck","first_name":"Fabian","orcid":"0000-0003-1548-0177","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","full_name":"Mühlböck, Fabian"},{"first_name":"Stefanie","last_name":"Muroya Lei","id":"a376de31-8972-11ed-ae7b-d0251c13c8ff","full_name":"Muroya Lei, Stefanie"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A","last_name":"Henzinger"}],"related_material":{"record":[{"id":"12856","status":"public","relation":"later_version"}]},"date_created":"2023-01-27T03:18:08Z","date_updated":"2023-04-25T07:19:06Z","year":"2023","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093. \r\nThe authors would like to thank the anonymous FASE reviewers for their valuable feedback and suggestions.","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Institute of Science and Technology Austria","file_date_updated":"2023-01-27T03:18:34Z","ec_funded":1,"date_published":"2023-01-27T00:00:00Z","citation":{"short":"M. Chalupa, F. Mühlböck, S. Muroya Lei, T.A. Henzinger, VAMOS: Middleware for Best-Effort Third-Party Monitoring, Institute of Science and Technology Austria, 2023.","mla":"Chalupa, Marek, et al. VAMOS: Middleware for Best-Effort Third-Party Monitoring. Institute of Science and Technology Austria, 2023, doi:10.15479/AT:ISTA:12407.","chicago":"Chalupa, Marek, Fabian Mühlböck, Stefanie Muroya Lei, and Thomas A Henzinger. VAMOS: Middleware for Best-Effort Third-Party Monitoring. Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/AT:ISTA:12407.","ama":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. VAMOS: Middleware for Best-Effort Third-Party Monitoring. Institute of Science and Technology Austria; 2023. doi:10.15479/AT:ISTA:12407","ieee":"M. Chalupa, F. Mühlböck, S. Muroya Lei, and T. A. Henzinger, VAMOS: Middleware for Best-Effort Third-Party Monitoring. Institute of Science and Technology Austria, 2023.","apa":"Chalupa, M., Mühlböck, F., Muroya Lei, S., & Henzinger, T. A. (2023). VAMOS: Middleware for Best-Effort Third-Party Monitoring. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:12407","ista":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. 2023. VAMOS: Middleware for Best-Effort Third-Party Monitoring, Institute of Science and Technology Austria, 38p."},"page":"38","day":"27","article_processing_charge":"No","has_accepted_license":"1","keyword":["runtime monitoring","best effort","third party"],"oa_version":"Published Version","file":[{"success":1,"checksum":"55426e463fdeafe9777fc3ff635154c7","date_created":"2023-01-27T03:18:34Z","date_updated":"2023-01-27T03:18:34Z","file_id":"12408","relation":"main_file","creator":"fmuehlbo","content_type":"application/pdf","file_size":662409,"access_level":"open_access","file_name":"main.pdf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12407","status":"public","ddc":["005"],"title":"VAMOS: Middleware for Best-Effort Third-Party Monitoring","abstract":[{"text":"As the complexity and criticality of software increase every year, so does the importance of run-time monitoring. Third-party monitoring, with limited knowledge of the monitored software, and best-effort monitoring, which keeps pace with the monitored software, are especially valuable, yet underexplored areas of run-time monitoring. Most existing monitoring frameworks do not support their combination because they either require access to the monitored code for instrumentation purposes or the processing of all observed events, or both.\r\n\r\nWe present a middleware framework, VAMOS, for the run-time monitoring of software which is explicitly designed to support third-party and best-effort scenarios. The design goals of VAMOS are (i) efficiency (keeping pace at low overhead), (ii) flexibility (the ability to monitor black-box code through a variety of different event channels, and the connectability to monitors written in different specification languages), and (iii) ease-of-use. To achieve its goals, VAMOS combines aspects of event broker and event recognition systems with aspects of stream processing systems.\r\n\r\nWe implemented a prototype toolchain for VAMOS and conducted experiments including a case study of monitoring for data races. The results indicate that VAMOS enables writing useful yet efficient monitors, is compatible with a variety of event sources and monitor specifications, and simplifies key aspects of setting up a monitoring system from scratch.","lang":"eng"}],"type":"technical_report","alternative_title":["IST Austria Technical Report"]},{"month":"06","publication_identifier":{"isbn":["9781450399135"]},"quality_controlled":"1","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"},{"_id":"fc390959-9c52-11eb-aca3-afa58bd282b2","grant_number":"M03073","name":"Learning and triangulating manifolds via collapses"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2303.04014"}],"oa":1,"external_id":{"arxiv":["2303.04014"]},"language":[{"iso":"eng"}],"conference":{"name":"STOC: Symposium on Theory of Computing","start_date":"2023-06-20","location":"Orlando, FL, United States","end_date":"2023-06-23"},"doi":"10.1145/3564246.3585113","ec_funded":1,"publication_status":"published","department":[{"_id":"HeEd"}],"publisher":"Association for Computing Machinery","year":"2023","acknowledgement":"We are greatly indebted to Erin Chambers for posing a number of questions that eventually led to this paper. We would also like to thank the other organizers of the workshop on ‘Algorithms\r\nfor the medial axis’. We are also indebted to Tatiana Ezubova for helping with the search for and translation of Russian literature. The second author thanks all members of the Edelsbrunner and Datashape groups for the atmosphere in which the research was conducted.\r\nThe research leading to these results has received funding from the European Research Council (ERC) under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement No. 339025 GUDHI (Algorithmic Foundations of Geometry Understanding in Higher Dimensions). Supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411. The Austrian science fund (FWF) M-3073.","date_updated":"2023-05-22T08:15:19Z","date_created":"2023-05-22T08:02:02Z","author":[{"full_name":"Lieutier, André","first_name":"André","last_name":"Lieutier"},{"full_name":"Wintraecken, Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220","first_name":"Mathijs","last_name":"Wintraecken"}],"day":"02","article_processing_charge":"No","page":"1768-1776","publication":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","citation":{"apa":"Lieutier, A., & Wintraecken, M. (2023). Hausdorff and Gromov-Hausdorff stable subsets of the medial axis. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing (pp. 1768–1776). Orlando, FL, United States: Association for Computing Machinery. https://doi.org/10.1145/3564246.3585113","ieee":"A. Lieutier and M. Wintraecken, “Hausdorff and Gromov-Hausdorff stable subsets of the medial axis,” in Proceedings of the 55th Annual ACM Symposium on Theory of Computing, Orlando, FL, United States, 2023, pp. 1768–1776.","ista":"Lieutier A, Wintraecken M. 2023. Hausdorff and Gromov-Hausdorff stable subsets of the medial axis. Proceedings of the 55th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 1768–1776.","ama":"Lieutier A, Wintraecken M. Hausdorff and Gromov-Hausdorff stable subsets of the medial axis. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 2023:1768-1776. doi:10.1145/3564246.3585113","chicago":"Lieutier, André, and Mathijs Wintraecken. “Hausdorff and Gromov-Hausdorff Stable Subsets of the Medial Axis.” In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1768–76. Association for Computing Machinery, 2023. https://doi.org/10.1145/3564246.3585113.","short":"A. Lieutier, M. Wintraecken, in:, Proceedings of the 55th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2023, pp. 1768–1776.","mla":"Lieutier, André, and Mathijs Wintraecken. “Hausdorff and Gromov-Hausdorff Stable Subsets of the Medial Axis.” Proceedings of the 55th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2023, pp. 1768–76, doi:10.1145/3564246.3585113."},"date_published":"2023-06-02T00:00:00Z","type":"conference","abstract":[{"text":"In this paper we introduce a pruning of the medial axis called the (λ,α)-medial axis (axλα). We prove that the (λ,α)-medial axis of a set K is stable in a Gromov-Hausdorff sense under weak assumptions. More formally we prove that if K and K′ are close in the Hausdorff (dH) sense then the (λ,α)-medial axes of K and K′ are close as metric spaces, that is the Gromov-Hausdorff distance (dGH) between the two is 1/4-Hölder in the sense that dGH (axλα(K),axλα(K′)) ≲ dH(K,K′)1/4. The Hausdorff distance between the two medial axes is also bounded, by dH (axλα(K),λα(K′)) ≲ dH(K,K′)1/2. These quantified stability results provide guarantees for practical computations of medial axes from approximations. Moreover, they provide key ingredients for studying the computability of the medial axis in the context of computable analysis.","lang":"eng"}],"title":"Hausdorff and Gromov-Hausdorff stable subsets of the medial axis","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"13048","oa_version":"Preprint"},{"conference":{"end_date":"2023-05-05","start_date":"2023-05-01","location":"Kigali, Rwanda ","name":"ICLR: International Conference on Learning Representations"},"date_published":"2023-05-01T00:00:00Z","acknowledged_ssus":[{"_id":"ScienComp"}],"language":[{"iso":"eng"}],"publication":"11th International Conference on Learning Representations ","citation":{"apa":"Peste, E.-A., Vladu, A., Kurtic, E., Lampert, C., & Alistarh, D.-A. (n.d.). CrAM: A Compression-Aware Minimizer. In 11th International Conference on Learning Representations . Kigali, Rwanda .","ieee":"E.-A. Peste, A. Vladu, E. Kurtic, C. Lampert, and D.-A. Alistarh, “CrAM: A Compression-Aware Minimizer,” in 11th International Conference on Learning Representations , Kigali, Rwanda .","ista":"Peste E-A, Vladu A, Kurtic E, Lampert C, Alistarh D-A. CrAM: A Compression-Aware Minimizer. 11th International Conference on Learning Representations . ICLR: International Conference on Learning Representations.","ama":"Peste E-A, Vladu A, Kurtic E, Lampert C, Alistarh D-A. CrAM: A Compression-Aware Minimizer. In: 11th International Conference on Learning Representations .","chicago":"Peste, Elena-Alexandra, Adrian Vladu, Eldar Kurtic, Christoph Lampert, and Dan-Adrian Alistarh. “CrAM: A Compression-Aware Minimizer.” In 11th International Conference on Learning Representations , n.d.","short":"E.-A. Peste, A. Vladu, E. Kurtic, C. Lampert, D.-A. Alistarh, in:, 11th International Conference on Learning Representations , n.d.","mla":"Peste, Elena-Alexandra, et al. “CrAM: A Compression-Aware Minimizer.” 11th International Conference on Learning Representations ."},"main_file_link":[{"open_access":"1","url":"https://openreview.net/pdf?id=_eTZBs-yedr"}],"external_id":{"arxiv":["2207.14200"]},"oa":1,"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"month":"05","article_processing_charge":"No","author":[{"full_name":"Peste, Elena-Alexandra","first_name":"Elena-Alexandra","last_name":"Peste","id":"32D78294-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Adrian","last_name":"Vladu","full_name":"Vladu, Adrian"},{"id":"47beb3a5-07b5-11eb-9b87-b108ec578218","first_name":"Eldar","last_name":"Kurtic","full_name":"Kurtic, Eldar"},{"full_name":"Lampert, Christoph","first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"},{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"}],"related_material":{"record":[{"id":"13074","relation":"dissertation_contains","status":"public"}]},"date_updated":"2023-06-01T12:54:45Z","date_created":"2023-05-23T11:36:18Z","oa_version":"Preprint","_id":"13053","year":"2023","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"AP, EK, DA 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). AV acknowledges the support of the French Agence Nationale de la Recherche (ANR), under grant ANR-21-CE48-0016 (project COMCOPT). We further acknowledge the support from the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp)-","status":"public","title":"CrAM: A Compression-Aware Minimizer","publication_status":"accepted","department":[{"_id":"GradSch"},{"_id":"DaAl"},{"_id":"ChLa"}],"abstract":[{"lang":"eng","text":"Deep neural networks (DNNs) often have to be compressed, via pruning and/or quantization, before they can be deployed in practical settings. In this work we propose a new compression-aware minimizer dubbed CrAM that modifies the optimization step in a principled way, in order to produce models whose local loss behavior is stable under compression operations such as pruning. Thus, dense models trained via CrAM should be compressible post-training, in a single step, without significant accuracy loss. Experimental results on standard benchmarks, such as residual networks for ImageNet classification and BERT models for language modelling, show that CrAM produces dense models that can be more accurate than the standard SGD/Adam-based baselines, but which are stable under weight pruning: specifically, we can prune models in one-shot to 70-80% sparsity with almost no accuracy loss, and to 90% with reasonable (∼1%) accuracy loss, which is competitive with gradual compression methods. Additionally, CrAM can produce sparse models which perform well for transfer learning, and it also works for semi-structured 2:4 pruning patterns supported by GPU hardware. The code for reproducing the results is available at this https URL ."}],"ec_funded":1,"type":"conference"},{"year":"2023","acknowledgement":"We are grateful to Pavel Atnashev for clarifying via e-mail several aspects of the primality tests implementated in the PrimeGrid project. Pavel Hubáček is supported by the Czech Academy of Sciences (RVO 67985840), the Grant Agency of the Czech Republic under the grant agreement no. 19-27871X, and by the Charles University project UNCE/SCI/004. Chethan Kamath is supported by Azrieli International Postdoctoral Fellowship, ISF grants 484/18 and 1789/19, and ERC StG project SPP: Secrecy Preserving Proofs.","publication_status":"published","department":[{"_id":"KrPi"}],"publisher":"Springer Nature","author":[{"full_name":"Hoffmann, Charlotte","first_name":"Charlotte","last_name":"Hoffmann","id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7"},{"full_name":"Hubáček, Pavel","first_name":"Pavel","last_name":"Hubáček"},{"full_name":"Kamath, Chethan","first_name":"Chethan","last_name":"Kamath"},{"first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"}],"date_updated":"2023-06-19T08:03:37Z","date_created":"2023-06-18T22:00:47Z","volume":13940,"month":"05","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031313677"],"eissn":["1611-3349"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2023/238"}],"quality_controlled":"1","conference":{"name":"PKC: Public-Key Cryptography","start_date":"2023-05-07","location":"Atlanta, GA, United States","end_date":"2023-05-10"},"doi":"10.1007/978-3-031-31368-4_19","language":[{"iso":"eng"}],"type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"GIMPS and PrimeGrid are large-scale distributed projects dedicated to searching giant prime numbers, usually of special forms like Mersenne and Proth primes. The numbers in the current search-space are millions of digits large and the participating volunteers need to run resource-consuming primality tests. Once a candidate prime N has been found, the only way for another party to independently verify the primality of N used to be by repeating the expensive primality test. To avoid the need for second recomputation of each primality test, these projects have recently adopted certifying mechanisms that enable efficient verification of performed tests. However, the mechanisms presently in place only detect benign errors and there is no guarantee against adversarial behavior: a malicious volunteer can mislead the project to reject a giant prime as being non-prime.\r\nIn this paper, we propose a practical, cryptographically-sound mechanism for certifying the non-primality of Proth numbers. That is, a volunteer can – parallel to running the primality test for N – generate an efficiently verifiable proof at a little extra cost certifying that N is not prime. The interactive protocol has statistical soundness and can be made non-interactive using the Fiat-Shamir heuristic.\r\nOur approach is based on a cryptographic primitive called Proof of Exponentiation (PoE) which, for a group G, certifies that a tuple (x,y,T)∈G2×N satisfies x2T=y (Pietrzak, ITCS 2019 and Wesolowski, J. Cryptol. 2020). In particular, we show how to adapt Pietrzak’s PoE at a moderate additional cost to make it a cryptographically-sound certificate of non-primality."}],"_id":"13143","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Certifying giant nonprimes","intvolume":" 13940","oa_version":"Submitted Version","scopus_import":"1","day":"02","article_processing_charge":"No","publication":"Public-Key Cryptography - PKC 2023","citation":{"apa":"Hoffmann, C., Hubáček, P., Kamath, C., & Pietrzak, K. Z. (2023). Certifying giant nonprimes. In Public-Key Cryptography - PKC 2023 (Vol. 13940, pp. 530–553). Atlanta, GA, United States: Springer Nature. https://doi.org/10.1007/978-3-031-31368-4_19","ieee":"C. Hoffmann, P. Hubáček, C. Kamath, and K. Z. Pietrzak, “Certifying giant nonprimes,” in Public-Key Cryptography - PKC 2023, Atlanta, GA, United States, 2023, vol. 13940, pp. 530–553.","ista":"Hoffmann C, Hubáček P, Kamath C, Pietrzak KZ. 2023. Certifying giant nonprimes. Public-Key Cryptography - PKC 2023. PKC: Public-Key Cryptography, LNCS, vol. 13940, 530–553.","ama":"Hoffmann C, Hubáček P, Kamath C, Pietrzak KZ. Certifying giant nonprimes. In: Public-Key Cryptography - PKC 2023. Vol 13940. Springer Nature; 2023:530-553. doi:10.1007/978-3-031-31368-4_19","chicago":"Hoffmann, Charlotte, Pavel Hubáček, Chethan Kamath, and Krzysztof Z Pietrzak. “Certifying Giant Nonprimes.” In Public-Key Cryptography - PKC 2023, 13940:530–53. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-31368-4_19.","short":"C. Hoffmann, P. Hubáček, C. Kamath, K.Z. Pietrzak, in:, Public-Key Cryptography - PKC 2023, Springer Nature, 2023, pp. 530–553.","mla":"Hoffmann, Charlotte, et al. “Certifying Giant Nonprimes.” Public-Key Cryptography - PKC 2023, vol. 13940, Springer Nature, 2023, pp. 530–53, doi:10.1007/978-3-031-31368-4_19."},"page":"530-553","date_published":"2023-05-02T00:00:00Z"},{"acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, ERC CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","year":"2023","publication_status":"published","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"Springer Nature","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","first_name":"Mathias","full_name":"Lechner, Mathias"},{"full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","last_name":"Zikelic"}],"date_updated":"2023-06-19T08:30:54Z","date_created":"2023-06-18T22:00:47Z","volume":13993,"file_date_updated":"2023-06-19T08:29:30Z","ec_funded":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program"}],"conference":{"location":"Paris, France","start_date":"2023-04-22","end_date":"2023-04-27","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"doi":"10.1007/978-3-031-30823-9_1","language":[{"iso":"eng"}],"month":"04","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031308222"],"eissn":["1611-3349"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"13142","title":"A learner-verifier framework for neural network controllers and certificates of stochastic systems","status":"public","ddc":["000"],"intvolume":" 13993","file":[{"success":1,"checksum":"3d8a8bb24d211bc83360dfc2fd744307","date_updated":"2023-06-19T08:29:30Z","date_created":"2023-06-19T08:29:30Z","file_id":"13150","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":528455,"access_level":"open_access","file_name":"2023_LNCS_Chatterjee.pdf"}],"oa_version":"Published Version","type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"Reinforcement learning has received much attention for learning controllers of deterministic systems. We consider a learner-verifier framework for stochastic control systems and survey recent methods that formally guarantee a conjunction of reachability and safety properties. Given a property and a lower bound on the probability of the property being satisfied, our framework jointly learns a control policy and a formal certificate to ensure the satisfaction of the property with a desired probability threshold. Both the control policy and the formal certificate are continuous functions from states to reals, which are learned as parameterized neural networks. While in the deterministic case, the certificates are invariant and barrier functions for safety, or Lyapunov and ranking functions for liveness, in the stochastic case the certificates are supermartingales. For certificate verification, we use interval arithmetic abstract interpretation to bound the expected values of neural network functions."}],"publication":"Tools and Algorithms for the Construction and Analysis of Systems ","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Mathias Lechner, and Dorde Zikelic. “A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems.” In Tools and Algorithms for the Construction and Analysis of Systems , 13993:3–25. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30823-9_1.","mla":"Chatterjee, Krishnendu, et al. “A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems.” Tools and Algorithms for the Construction and Analysis of Systems , vol. 13993, Springer Nature, 2023, pp. 3–25, doi:10.1007/978-3-031-30823-9_1.","short":"K. Chatterjee, T.A. Henzinger, M. Lechner, D. Zikelic, in:, Tools and Algorithms for the Construction and Analysis of Systems , Springer Nature, 2023, pp. 3–25.","ista":"Chatterjee K, Henzinger TA, Lechner M, Zikelic D. 2023. A learner-verifier framework for neural network controllers and certificates of stochastic systems. Tools and Algorithms for the Construction and Analysis of Systems . TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13993, 3–25.","ieee":"K. Chatterjee, T. A. Henzinger, M. Lechner, and D. Zikelic, “A learner-verifier framework for neural network controllers and certificates of stochastic systems,” in Tools and Algorithms for the Construction and Analysis of Systems , Paris, France, 2023, vol. 13993, pp. 3–25.","apa":"Chatterjee, K., Henzinger, T. A., Lechner, M., & Zikelic, D. (2023). A learner-verifier framework for neural network controllers and certificates of stochastic systems. In Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13993, pp. 3–25). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-30823-9_1","ama":"Chatterjee K, Henzinger TA, Lechner M, Zikelic D. A learner-verifier framework for neural network controllers and certificates of stochastic systems. In: Tools and Algorithms for the Construction and Analysis of Systems . Vol 13993. Springer Nature; 2023:3-25. doi:10.1007/978-3-031-30823-9_1"},"page":"3-25","date_published":"2023-04-22T00:00:00Z","scopus_import":"1","day":"22","article_processing_charge":"No","has_accepted_license":"1"},{"date_published":"2023-04-20T00:00:00Z","page":"211-228","citation":{"ama":"Anand A, Mallik K, Nayak SP, Schmuck AK. Computing adequately permissive assumptions for synthesis. In: TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems. Vol 13994. Springer Nature; 2023:211-228. doi:10.1007/978-3-031-30820-8_15","ista":"Anand A, Mallik K, Nayak SP, Schmuck AK. 2023. Computing adequately permissive assumptions for synthesis. TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13994, 211–228.","apa":"Anand, A., Mallik, K., Nayak, S. P., & Schmuck, A. K. (2023). Computing adequately permissive assumptions for synthesis. In TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13994, pp. 211–228). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-30820-8_15","ieee":"A. Anand, K. Mallik, S. P. Nayak, and A. K. Schmuck, “Computing adequately permissive assumptions for synthesis,” in TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, Paris, France, 2023, vol. 13994, pp. 211–228.","mla":"Anand, Ashwani, et al. “Computing Adequately Permissive Assumptions for Synthesis.” TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, vol. 13994, Springer Nature, 2023, pp. 211–28, doi:10.1007/978-3-031-30820-8_15.","short":"A. Anand, K. Mallik, S.P. Nayak, A.K. Schmuck, in:, TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2023, pp. 211–228.","chicago":"Anand, Ashwani, Kaushik Mallik, Satya Prakash Nayak, and Anne Kathrin Schmuck. “Computing Adequately Permissive Assumptions for Synthesis.” In TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, 13994:211–28. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30820-8_15."},"publication":"TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems","has_accepted_license":"1","article_processing_charge":"No","day":"20","scopus_import":"1","oa_version":"Published Version","file":[{"success":1,"checksum":"60dcafc1b4f6f070be43bad3fe877974","date_updated":"2023-06-19T08:43:21Z","date_created":"2023-06-19T08:43:21Z","file_id":"13151","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":521425,"access_level":"open_access","file_name":"2023_LNCS_Anand.pdf"}],"intvolume":" 13994","status":"public","title":"Computing adequately permissive assumptions for synthesis","ddc":["000"],"_id":"13141","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We automatically compute a new class of environment assumptions in two-player turn-based finite graph games which characterize an “adequate cooperation” needed from the environment to allow the system player to win. Given an ω-regular winning condition Φ for the system player, we compute an ω-regular assumption Ψ for the environment player, such that (i) every environment strategy compliant with Ψ allows the system to fulfill Φ (sufficiency), (ii) Ψ\r\n can be fulfilled by the environment for every strategy of the system (implementability), and (iii) Ψ does not prevent any cooperative strategy choice (permissiveness).\r\nFor parity games, which are canonical representations of ω-regular games, we present a polynomial-time algorithm for the symbolic computation of adequately permissive assumptions and show that our algorithm runs faster and produces better assumptions than existing approaches—both theoretically and empirically. To the best of our knowledge, for ω\r\n-regular games, we provide the first algorithm to compute sufficient and implementable environment assumptions that are also permissive.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference","language":[{"iso":"eng"}],"doi":"10.1007/978-3-031-30820-8_15","conference":{"end_date":"2023-04-27","location":"Paris, France","start_date":"2023-04-22","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031308192"],"issn":["0302-9743"]},"month":"04","volume":13994,"date_created":"2023-06-18T22:00:47Z","date_updated":"2023-06-19T08:49:46Z","author":[{"full_name":"Anand, Ashwani","first_name":"Ashwani","last_name":"Anand"},{"id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","orcid":"0000-0001-9864-7475","first_name":"Kaushik","last_name":"Mallik","full_name":"Mallik, Kaushik"},{"full_name":"Nayak, Satya Prakash","last_name":"Nayak","first_name":"Satya Prakash"},{"first_name":"Anne Kathrin","last_name":"Schmuck","full_name":"Schmuck, Anne Kathrin"}],"publisher":"Springer Nature","department":[{"_id":"ToHe"}],"publication_status":"published","year":"2023","file_date_updated":"2023-06-19T08:43:21Z"},{"date_published":"2023-04-18T00:00:00Z","page":"106","citation":{"ista":"Pokusaeva V. 2023. Neural control of optic flow-based navigation in Drosophila melanogaster. Institute of Science and Technology Austria.","ieee":"V. Pokusaeva, “Neural control of optic flow-based navigation in Drosophila melanogaster,” Institute of Science and Technology Austria, 2023.","apa":"Pokusaeva, V. (2023). Neural control of optic flow-based navigation in Drosophila melanogaster. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12826","ama":"Pokusaeva V. Neural control of optic flow-based navigation in Drosophila melanogaster. 2023. doi:10.15479/at:ista:12826","chicago":"Pokusaeva, Victoria. “Neural Control of Optic Flow-Based Navigation in Drosophila Melanogaster.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:12826.","mla":"Pokusaeva, Victoria. Neural Control of Optic Flow-Based Navigation in Drosophila Melanogaster. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:12826.","short":"V. Pokusaeva, Neural Control of Optic Flow-Based Navigation in Drosophila Melanogaster, Institute of Science and Technology Austria, 2023."},"article_processing_charge":"No","has_accepted_license":"1","day":"18","oa_version":"Published Version","file":[{"access_level":"closed","file_name":"Thesis_Pokusaeva.docx","creator":"vpokusae","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_size":14507243,"file_id":"12857","relation":"source_file","checksum":"5f589a9af025f7eeebfd0c186209913e","date_updated":"2023-04-20T09:26:51Z","date_created":"2023-04-20T09:14:38Z"},{"access_level":"open_access","file_name":"Thesis_Pokusaeva.pdf","file_size":10090711,"content_type":"application/pdf","creator":"vpokusae","relation":"main_file","file_id":"12858","checksum":"bbeed76db45a996b4c91a9abe12ce0ec","success":1,"date_created":"2023-04-20T09:14:44Z","date_updated":"2023-04-20T09:14:44Z"}],"ddc":["570","571"],"title":"Neural control of optic flow-based navigation in Drosophila melanogaster","status":"public","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"12826","abstract":[{"lang":"eng","text":"During navigation, animals can infer the structure of the environment by computing the optic flow cues elicited by their own movements, and subsequently use this information to instruct proper locomotor actions. These computations require a panoramic assessment of the visual environment in order to disambiguate similar sensory experiences that may require distinct behavioral responses. The estimation of the global motion patterns is therefore essential for successful navigation. Yet, our understanding of the algorithms and implementations that enable coherent panoramic visual perception remains scarce. Here I pursue this problem by dissecting the functional aspects of interneuronal communication in the lobula plate tangential cell network in Drosophila melanogaster. The results presented in the thesis demonstrate that the basis for effective interpretation of the optic flow in this circuit are stereotyped synaptic connections that mediate the formation of distinct subnetworks, each extracting a particular pattern of global motion. \r\nFirstly, I show that gap junctions are essential for a correct interpretation of binocular motion cues by horizontal motion-sensitive cells. HS cells form electrical synapses with contralateral H2 neurons that are involved in detecting yaw rotation and translation. I developed an FlpStop-mediated mutant of a gap junction protein ShakB that disrupts these electrical synapses. While the loss of electrical synapses does not affect the tuning of the direction selectivity in HS neurons, it severely alters their sensitivity to horizontal motion in the contralateral side. These physiological changes result in an inappropriate integration of binocular motion cues in walking animals. While wild-type flies form a binocular perception of visual motion by non-linear integration of monocular optic flow cues, the mutant flies sum the monocular inputs linearly. These results indicate that rather than averaging signals in neighboring neurons, gap-junctions operate in conjunction with chemical synapses to mediate complex non-linear optic flow computations.\r\nSecondly, I show that stochastic manipulation of neuronal activity in the lobula plate tangential cell network is a powerful approach to study the neuronal implementation of optic flow-based navigation in flies. Tangential neurons form multiple subnetworks, each mediating course-stabilizing response to a particular global pattern of visual motion. Application of genetic mosaic techniques can provide sparse optogenetic activation of HS cells in numerous combinations. These distinct combinations of activated neurons drive an array of distinct behavioral responses, providing important insights into how visuomotor transformation is performed in the lobula plate tangential cell network. This approach can be complemented by stochastic silencing of tangential neurons, enabling direct assessment of the functional role of individual tangential neurons in the processing of specific visual motion patterns.\r\n\tTaken together, the findings presented in this thesis suggest that establishing specific activity patterns of tangential cells via stereotyped synaptic connectivity is a key to efficient optic flow-based navigation in Drosophila melanogaster."}],"alternative_title":["ISTA Thesis"],"type":"dissertation","language":[{"iso":"eng"}],"degree_awarded":"PhD","acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"supervisor":[{"full_name":"Jösch, Maximilian A","last_name":"Jösch","first_name":"Maximilian A","orcid":"0000-0002-3937-1330","id":"2BD278E6-F248-11E8-B48F-1D18A9856A87"}],"doi":"10.15479/at:ista:12826","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"publication_identifier":{"issn":["2663 - 337X"]},"month":"04","date_created":"2023-04-14T14:56:04Z","date_updated":"2023-06-23T09:47:36Z","author":[{"full_name":"Pokusaeva, Victoria","last_name":"Pokusaeva","first_name":"Victoria","orcid":"0000-0001-7660-444X","id":"3184041C-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"MaJö"},{"_id":"GradSch"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","year":"2023","ec_funded":1,"file_date_updated":"2023-04-20T09:26:51Z"},{"publication_identifier":{"eissn":["1432-0541"],"issn":["0178-4617"]},"month":"01","doi":"10.1007/s00453-022-01027-6","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000846967100001"]},"oa":1,"project":[{"grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Alpha Shape Theory Extended"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425"},{"name":"Persistence and stability of geometric complexes","call_identifier":"FWF","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"isi":1,"quality_controlled":"1","ec_funded":1,"file_date_updated":"2023-01-20T10:02:48Z","author":[{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"full_name":"Osang, Georg F","first_name":"Georg F","last_name":"Osang","id":"464B40D6-F248-11E8-B48F-1D18A9856A87"}],"volume":85,"date_updated":"2023-06-27T12:53:43Z","date_created":"2022-09-11T22:01:57Z","acknowledgement":"Open access funding provided by Austrian Science Fund (FWF). This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, Grant No. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), Grant No. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), Grant No. I 02979-N35.","year":"2023","department":[{"_id":"HeEd"}],"publisher":"Springer Nature","publication_status":"published","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","day":"01","scopus_import":"1","date_published":"2023-01-01T00:00:00Z","citation":{"mla":"Edelsbrunner, Herbert, and Georg F. Osang. “A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes.” Algorithmica, vol. 85, Springer Nature, 2023, pp. 277–95, doi:10.1007/s00453-022-01027-6.","short":"H. Edelsbrunner, G.F. Osang, Algorithmica 85 (2023) 277–295.","chicago":"Edelsbrunner, Herbert, and Georg F Osang. “A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes.” Algorithmica. Springer Nature, 2023. https://doi.org/10.1007/s00453-022-01027-6.","ama":"Edelsbrunner H, Osang GF. A simple algorithm for higher-order Delaunay mosaics and alpha shapes. Algorithmica. 2023;85:277-295. doi:10.1007/s00453-022-01027-6","ista":"Edelsbrunner H, Osang GF. 2023. A simple algorithm for higher-order Delaunay mosaics and alpha shapes. Algorithmica. 85, 277–295.","ieee":"H. Edelsbrunner and G. F. Osang, “A simple algorithm for higher-order Delaunay mosaics and alpha shapes,” Algorithmica, vol. 85. Springer Nature, pp. 277–295, 2023.","apa":"Edelsbrunner, H., & Osang, G. F. (2023). A simple algorithm for higher-order Delaunay mosaics and alpha shapes. Algorithmica. Springer Nature. https://doi.org/10.1007/s00453-022-01027-6"},"publication":"Algorithmica","page":"277-295","article_type":"original","abstract":[{"text":"We present a simple algorithm for computing higher-order Delaunay mosaics that works in Euclidean spaces of any finite dimensions. The algorithm selects the vertices of the order-k mosaic from incrementally constructed lower-order mosaics and uses an algorithm for weighted first-order Delaunay mosaics as a black-box to construct the order-k mosaic from its vertices. Beyond this black-box, the algorithm uses only combinatorial operations, thus facilitating easy implementation. We extend this algorithm to compute higher-order α-shapes and provide open-source implementations. We present experimental results for properties of higher-order Delaunay mosaics of random point sets.","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","file":[{"creator":"dernst","file_size":911017,"content_type":"application/pdf","file_name":"2023_Algorithmica_Edelsbrunner.pdf","access_level":"open_access","date_created":"2023-01-20T10:02:48Z","date_updated":"2023-01-20T10:02:48Z","success":1,"checksum":"71685ca5121f4c837f40c3f8eb50c915","file_id":"12322","relation":"main_file"}],"_id":"12086","user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","intvolume":" 85","title":"A simple algorithm for higher-order Delaunay mosaics and alpha shapes","status":"public","ddc":["510"]},{"article_number":"9","ec_funded":1,"file_date_updated":"2023-01-20T10:45:06Z","publisher":"Springer Nature","department":[{"_id":"JaMa"}],"publication_status":"published","year":"2023","acknowledgement":"Research supported by the Austrian Science Fund (FWF) grant F65 at the Institute of Science and Technology Austria and by the European Research Council (ERC) (Grant agreement No. 716117 awarded to Prof. Dr. Jan Maas). L.D.S. gratefully acknowledges funding of his current position by the Austrian Science Fund (FWF) through the ESPRIT Programme (Grant No. 208). M.W. gratefully acknowledges funding of his current position by the Austrian Science Fund (FWF) through the ESPRIT Programme (Grant No. 156).","volume":23,"date_updated":"2023-06-28T11:54:35Z","date_created":"2023-01-08T23:00:53Z","author":[{"last_name":"Dello Schiavo","first_name":"Lorenzo","orcid":"0000-0002-9881-6870","id":"ECEBF480-9E4F-11EA-B557-B0823DDC885E","full_name":"Dello Schiavo, Lorenzo"},{"full_name":"Wirth, Melchior","id":"88644358-0A0E-11EA-8FA5-49A33DDC885E","orcid":"0000-0002-0519-4241","first_name":"Melchior","last_name":"Wirth"}],"publication_identifier":{"eissn":["1424-3202"],"issn":["1424-3199"]},"month":"01","project":[{"grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","name":"Taming Complexity in Partial Differential Systems"},{"_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020"},{"_id":"34dbf174-11ca-11ed-8bc3-afe9d43d4b9c","grant_number":"E208","name":"Configuration Spaces over Non-Smooth Spaces"},{"name":"Gradient flow techniques for quantum Markov semigroups","_id":"34c6ea2d-11ca-11ed-8bc3-c04f3c502833","grant_number":"ESP156_N"}],"quality_controlled":"1","isi":1,"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000906214600004"]},"language":[{"iso":"eng"}],"doi":"10.1007/s00028-022-00859-7","type":"journal_article","issue":"1","abstract":[{"lang":"eng","text":"We study ergodic decompositions of Dirichlet spaces under intertwining via unitary order isomorphisms. We show that the ergodic decomposition of a quasi-regular Dirichlet space is unique up to a unique isomorphism of the indexing space. Furthermore, every unitary order isomorphism intertwining two quasi-regular Dirichlet spaces is decomposable over their ergodic decompositions up to conjugation via an isomorphism of the corresponding indexing spaces."}],"intvolume":" 23","title":"Ergodic decompositions of Dirichlet forms under order isomorphisms","status":"public","ddc":["510"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12104","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2023_JourEvolutionEquations_DelloSchiavo.pdf","content_type":"application/pdf","file_size":422612,"creator":"dernst","relation":"main_file","file_id":"12325","checksum":"1f34f3e2cb521033de6154f274ea3a4e","success":1,"date_updated":"2023-01-20T10:45:06Z","date_created":"2023-01-20T10:45:06Z"}],"scopus_import":"1","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","day":"01","article_type":"original","citation":{"mla":"Dello Schiavo, Lorenzo, and Melchior Wirth. “Ergodic Decompositions of Dirichlet Forms under Order Isomorphisms.” Journal of Evolution Equations, vol. 23, no. 1, 9, Springer Nature, 2023, doi:10.1007/s00028-022-00859-7.","short":"L. Dello Schiavo, M. Wirth, Journal of Evolution Equations 23 (2023).","chicago":"Dello Schiavo, Lorenzo, and Melchior Wirth. “Ergodic Decompositions of Dirichlet Forms under Order Isomorphisms.” Journal of Evolution Equations. Springer Nature, 2023. https://doi.org/10.1007/s00028-022-00859-7.","ama":"Dello Schiavo L, Wirth M. Ergodic decompositions of Dirichlet forms under order isomorphisms. Journal of Evolution Equations. 2023;23(1). doi:10.1007/s00028-022-00859-7","ista":"Dello Schiavo L, Wirth M. 2023. Ergodic decompositions of Dirichlet forms under order isomorphisms. Journal of Evolution Equations. 23(1), 9.","ieee":"L. Dello Schiavo and M. Wirth, “Ergodic decompositions of Dirichlet forms under order isomorphisms,” Journal of Evolution Equations, vol. 23, no. 1. Springer Nature, 2023.","apa":"Dello Schiavo, L., & Wirth, M. (2023). Ergodic decompositions of Dirichlet forms under order isomorphisms. Journal of Evolution Equations. Springer Nature. https://doi.org/10.1007/s00028-022-00859-7"},"publication":"Journal of Evolution Equations","date_published":"2023-01-01T00:00:00Z"},{"publication_identifier":{"issn":["0302-9743"],"isbn":["9783031308284"],"eissn":["1611-3349"]},"month":"04","project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software"}],"quality_controlled":"1","external_id":{"arxiv":["2301.11175"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/978-3-031-30829-1_17","conference":{"name":"FOSSACS: Foundations of Software Science and Computation Structures","location":"Paris, France","start_date":"2023-04-22","end_date":"2023-04-27"},"ec_funded":1,"file_date_updated":"2023-06-19T10:28:09Z","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publisher":"Springer Nature","publication_status":"published","acknowledgement":"We thank the anonymous reviewers for their helpful comments. This work was supported in part by the ERC-2020-AdG 101020093.","year":"2023","volume":13992,"date_updated":"2023-07-14T11:20:27Z","date_created":"2023-01-31T07:23:56Z","author":[{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"id":"b26baa86-3308-11ec-87b0-8990f34baa85","last_name":"Mazzocchi","first_name":"Nicolas Adrien","full_name":"Mazzocchi, Nicolas Adrien"},{"id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","last_name":"Sarac","first_name":"Naci E","full_name":"Sarac, Naci E"}],"scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"21","page":"349-370","citation":{"ieee":"T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Quantitative safety and liveness,” in 26th International Conference Foundations of Software Science and Computation Structures, Paris, France, 2023, vol. 13992, pp. 349–370.","apa":"Henzinger, T. A., Mazzocchi, N. A., & Sarac, N. E. (2023). Quantitative safety and liveness. In 26th International Conference Foundations of Software Science and Computation Structures (Vol. 13992, pp. 349–370). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-30829-1_17","ista":"Henzinger TA, Mazzocchi NA, Sarac NE. 2023. Quantitative safety and liveness. 26th International Conference Foundations of Software Science and Computation Structures. FOSSACS: Foundations of Software Science and Computation Structures, LNCS, vol. 13992, 349–370.","ama":"Henzinger TA, Mazzocchi NA, Sarac NE. Quantitative safety and liveness. In: 26th International Conference Foundations of Software Science and Computation Structures. Vol 13992. Springer Nature; 2023:349-370. doi:10.1007/978-3-031-30829-1_17","chicago":"Henzinger, Thomas A, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Quantitative Safety and Liveness.” In 26th International Conference Foundations of Software Science and Computation Structures, 13992:349–70. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30829-1_17.","short":"T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 26th International Conference Foundations of Software Science and Computation Structures, Springer Nature, 2023, pp. 349–370.","mla":"Henzinger, Thomas A., et al. “Quantitative Safety and Liveness.” 26th International Conference Foundations of Software Science and Computation Structures, vol. 13992, Springer Nature, 2023, pp. 349–70, doi:10.1007/978-3-031-30829-1_17."},"publication":"26th International Conference Foundations of Software Science and Computation Structures","date_published":"2023-04-21T00:00:00Z","alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":"Safety and liveness are elementary concepts of computation, and the foundation of many verification paradigms. The safety-liveness classification of boolean properties characterizes whether a given property can be falsified by observing a finite prefix of an infinite computation trace (always for safety, never for liveness). In quantitative specification and verification, properties assign not truth values, but quantitative values to infinite traces (e.g., a cost, or the distance to a boolean property). We introduce quantitative safety and liveness, and we prove that our definitions induce conservative quantitative generalizations of both (1)~the safety-progress hierarchy of boolean properties and (2)~the safety-liveness decomposition of boolean properties. In particular, we show that every quantitative property can be written as the pointwise minimum of a quantitative safety property and a quantitative liveness property. Consequently, like boolean properties, also quantitative properties can be min-decomposed into safety and liveness parts, or alternatively, max-decomposed into co-safety and co-liveness parts. Moreover, quantitative properties can be approximated naturally. We prove that every quantitative property that has both safe and co-safe approximations can be monitored arbitrarily precisely by a monitor that uses only a finite number of states."}],"intvolume":" 13992","title":"Quantitative safety and liveness","status":"public","ddc":["000"],"_id":"12467","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","file":[{"file_size":449027,"content_type":"application/pdf","creator":"esarac","file_name":"qsl.pdf","access_level":"open_access","date_updated":"2023-01-31T07:22:21Z","date_created":"2023-01-31T07:22:21Z","checksum":"981025aed580b6b27c426cb8856cf63e","success":1,"relation":"main_file","file_id":"12468"},{"date_updated":"2023-06-19T10:28:09Z","date_created":"2023-06-19T10:28:09Z","success":1,"checksum":"f16e2af1e0eb243158ab0f0fe74e7d5a","file_id":"13153","relation":"main_file","creator":"dernst","file_size":1048171,"content_type":"application/pdf","file_name":"2023_LNCS_HenzingerT.pdf","access_level":"open_access"}],"oa_version":"Published Version"},{"date_published":"2023-06-06T00:00:00Z","article_type":"original","publication":"Proceedings of the ACM on Programming Languages","citation":{"chicago":"Koval, Nikita, Dmitry Khalanskiy, and Dan-Adrian Alistarh. “CQS: A Formally-Verified Framework for Fair and Abortable Synchronization.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery , 2023. https://doi.org/10.1145/3591230.","short":"N. Koval, D. Khalanskiy, D.-A. Alistarh, Proceedings of the ACM on Programming Languages 7 (2023).","mla":"Koval, Nikita, et al. “CQS: A Formally-Verified Framework for Fair and Abortable Synchronization.” Proceedings of the ACM on Programming Languages, vol. 7, 116, Association for Computing Machinery , 2023, doi:10.1145/3591230.","ieee":"N. Koval, D. Khalanskiy, and D.-A. Alistarh, “CQS: A formally-verified framework for fair and abortable synchronization,” Proceedings of the ACM on Programming Languages, vol. 7. Association for Computing Machinery , 2023.","apa":"Koval, N., Khalanskiy, D., & Alistarh, D.-A. (2023). CQS: A formally-verified framework for fair and abortable synchronization. Proceedings of the ACM on Programming Languages. Association for Computing Machinery . https://doi.org/10.1145/3591230","ista":"Koval N, Khalanskiy D, Alistarh D-A. 2023. CQS: A formally-verified framework for fair and abortable synchronization. Proceedings of the ACM on Programming Languages. 7, 116.","ama":"Koval N, Khalanskiy D, Alistarh D-A. CQS: A formally-verified framework for fair and abortable synchronization. Proceedings of the ACM on Programming Languages. 2023;7. doi:10.1145/3591230"},"day":"06","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","oa_version":"Published Version","file":[{"file_name":"2023_ACMProgram.Lang._Koval.pdf","access_level":"open_access","creator":"alisjak","content_type":"application/pdf","file_size":1266773,"file_id":"13187","relation":"main_file","date_created":"2023-07-03T13:09:39Z","date_updated":"2023-07-03T13:09:39Z","success":1,"checksum":"5dba6e73f0ed79adbdae14d165bc2f68"}],"ddc":["000"],"title":"CQS: A formally-verified framework for fair and abortable synchronization","status":"public","intvolume":" 7","_id":"13179","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Writing concurrent code that is both correct and efficient is notoriously difficult. Thus, programmers often prefer to use synchronization abstractions, which render code simpler and easier to reason about. Despite a wealth of work on this topic, there is still a gap between the rich semantics provided by synchronization abstractions in modern programming languages—specifically, fair FIFO ordering of synchronization requests and support for abortable operations—and frameworks for implementing it correctly and efficiently. Supporting such semantics is critical given the rising popularity of constructs for asynchronous programming, such as coroutines, which abort frequently and are cheaper to suspend and resume compared to native threads.\r\n\r\nThis paper introduces a new framework called CancellableQueueSynchronizer (CQS), which enables simple yet efficient implementations of a wide range of fair and abortable synchronization primitives: mutexes, semaphores, barriers, count-down latches, and blocking pools. Our main contribution is algorithmic, as implementing both fairness and abortability efficiently at this level of generality is non-trivial. Importantly, all our algorithms, including the CQS framework and the primitives built on top of it, come with formal proofs in the Iris framework for Coq for many of their properties. These proofs are modular, so it is easy to show correctness for new primitives implemented on top of CQS. From a practical perspective, implementation of CQS for native threads on the JVM improves throughput by up to two orders of magnitude over Java’s AbstractQueuedSynchronizer, the only practical abstraction offering similar semantics. Further, we successfully integrated CQS as a core component of the popular Kotlin Coroutines library, validating the framework’s practical impact and expressiveness in a real-world environment. In sum, CancellableQueueSynchronizer is the first framework to combine expressiveness with formal guarantees and solid practical performance. Our approach should be extensible to other languages and families of synchronization primitives."}],"type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1145/3591230","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"month":"06","publication_identifier":{"eissn":["2475-1421"]},"date_updated":"2023-07-17T08:43:19Z","date_created":"2023-07-02T22:00:43Z","volume":7,"author":[{"id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87","last_name":"Koval","first_name":"Nikita","full_name":"Koval, Nikita"},{"full_name":"Khalanskiy, Dmitry","first_name":"Dmitry","last_name":"Khalanskiy"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"}],"publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"Association for Computing Machinery ","year":"2023","file_date_updated":"2023-07-03T13:09:39Z","article_number":"116"},{"type":"journal_article","issue":"2","abstract":[{"text":"We study the density of everywhere locally soluble diagonal quadric surfaces, parameterised by rational points that lie on a split quadric surface","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"13180","intvolume":" 16","title":"Local solubility for a family of quadrics over a split quadric surface","status":"public","oa_version":"Preprint","scopus_import":"1","article_processing_charge":"No","day":"26","citation":{"apa":"Browning, T. D., Lyczak, J., & Sarapin, R. (2023). Local solubility for a family of quadrics over a split quadric surface. Involve. Mathematical Sciences Publishers. https://doi.org/10.2140/involve.2023.16.331","ieee":"T. D. Browning, J. Lyczak, and R. Sarapin, “Local solubility for a family of quadrics over a split quadric surface,” Involve, vol. 16, no. 2. Mathematical Sciences Publishers, pp. 331–342, 2023.","ista":"Browning TD, Lyczak J, Sarapin R. 2023. Local solubility for a family of quadrics over a split quadric surface. Involve. 16(2), 331–342.","ama":"Browning TD, Lyczak J, Sarapin R. Local solubility for a family of quadrics over a split quadric surface. Involve. 2023;16(2):331-342. doi:10.2140/involve.2023.16.331","chicago":"Browning, Timothy D, Julian Lyczak, and Roman Sarapin. “Local Solubility for a Family of Quadrics over a Split Quadric Surface.” Involve. Mathematical Sciences Publishers, 2023. https://doi.org/10.2140/involve.2023.16.331.","short":"T.D. Browning, J. Lyczak, R. Sarapin, Involve 16 (2023) 331–342.","mla":"Browning, Timothy D., et al. “Local Solubility for a Family of Quadrics over a Split Quadric Surface.” Involve, vol. 16, no. 2, Mathematical Sciences Publishers, 2023, pp. 331–42, doi:10.2140/involve.2023.16.331."},"publication":"Involve","page":"331-342","article_type":"original","date_published":"2023-05-26T00:00:00Z","year":"2023","publisher":"Mathematical Sciences Publishers","department":[{"_id":"TiBr"}],"publication_status":"published","author":[{"full_name":"Browning, Timothy D","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning","first_name":"Timothy D"},{"first_name":"Julian","last_name":"Lyczak","id":"3572849A-F248-11E8-B48F-1D18A9856A87","full_name":"Lyczak, Julian"},{"full_name":"Sarapin, Roman","last_name":"Sarapin","first_name":"Roman"}],"volume":16,"date_created":"2023-07-02T22:00:43Z","date_updated":"2023-07-17T08:39:19Z","publication_identifier":{"issn":["1944-4176"],"eissn":["1944-4184"]},"month":"05","external_id":{"arxiv":["2203.06881"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/2203.06881","open_access":"1"}],"quality_controlled":"1","doi":"10.2140/involve.2023.16.331","language":[{"iso":"eng"}]},{"publication":"ASHPC23 - Austrian-Slovenian HPC Meeting 2023","citation":{"chicago":"Elefante, Stefano, Stephan Stadlbauer, Michael F Alexander, and Alois Schlögl. “Cryo-EM Software Packages: A Sys-Admins Point of View.” In ASHPC23 - Austrian-Slovenian HPC Meeting 2023, 42–42. EuroCC, n.d.","mla":"Elefante, Stefano, et al. “Cryo-EM Software Packages: A Sys-Admins Point of View.” ASHPC23 - Austrian-Slovenian HPC Meeting 2023, EuroCC, pp. 42–42.","short":"S. Elefante, S. Stadlbauer, M.F. Alexander, A. Schlögl, in:, ASHPC23 - Austrian-Slovenian HPC Meeting 2023, EuroCC, n.d., pp. 42–42.","ista":"Elefante S, Stadlbauer S, Alexander MF, Schlögl A. Cryo-EM software packages: A sys-admins point of view. ASHPC23 - Austrian-Slovenian HPC Meeting 2023. ASHPC: Austrian-Slovenian HPC Meeting, 42–42.","apa":"Elefante, S., Stadlbauer, S., Alexander, M. F., & Schlögl, A. (n.d.). Cryo-EM software packages: A sys-admins point of view. In ASHPC23 - Austrian-Slovenian HPC Meeting 2023 (pp. 42–42). Maribor, Slovenia: EuroCC.","ieee":"S. Elefante, S. Stadlbauer, M. F. Alexander, and A. Schlögl, “Cryo-EM software packages: A sys-admins point of view,” in ASHPC23 - Austrian-Slovenian HPC Meeting 2023, Maribor, Slovenia, pp. 42–42.","ama":"Elefante S, Stadlbauer S, Alexander MF, Schlögl A. Cryo-EM software packages: A sys-admins point of view. In: ASHPC23 - Austrian-Slovenian HPC Meeting 2023. EuroCC; :42-42."},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","page":"42-42","conference":{"end_date":"2023-06-15","location":"Maribor, Slovenia","start_date":"2023-06-12","name":"ASHPC: Austrian-Slovenian HPC Meeting"},"date_published":"2023-07-01T00:00:00Z","language":[{"iso":"eng"}],"month":"07","day":"01","has_accepted_license":"1","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"13162","year":"2023","publication_status":"accepted","status":"public","title":"Cryo-EM software packages: A sys-admins point of view","ddc":["000"],"department":[{"_id":"ScienComp"}],"publisher":"EuroCC","author":[{"last_name":"Elefante","first_name":"Stefano","id":"490F40CE-F248-11E8-B48F-1D18A9856A87","full_name":"Elefante, Stefano"},{"full_name":"Stadlbauer, Stephan","last_name":"Stadlbauer","first_name":"Stephan","id":"4D0BC184-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Alexander, Michael F","id":"3A02A8FA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael F","last_name":"Alexander"},{"last_name":"Schlögl","first_name":"Alois","orcid":"0000-0002-5621-8100","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","full_name":"Schlögl, Alois"}],"date_updated":"2023-07-18T09:32:16Z","date_created":"2023-06-23T11:03:18Z","file":[{"content_type":"application/pdf","file_size":380354,"creator":"dernst","access_level":"open_access","file_name":"2023_ASHPC_Elefante.pdf","checksum":"0ab6173cd5c5634ed773cd37ff012681","success":1,"date_created":"2023-07-18T09:28:30Z","date_updated":"2023-07-18T09:28:30Z","relation":"main_file","file_id":"13250"}],"oa_version":"Submitted Version","type":"conference_abstract","file_date_updated":"2023-07-18T09:28:30Z"},{"oa_version":"Submitted Version","file":[{"relation":"main_file","file_id":"13249","checksum":"ec8e4295d54171032cdd1b01423eb4a6","success":1,"date_updated":"2023-07-18T09:18:55Z","date_created":"2023-07-18T09:18:55Z","access_level":"open_access","file_name":"2023_ASHPC_Schloegl.pdf","file_size":316959,"content_type":"application/pdf","creator":"dernst"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"13161","title":"Running Windows-applications on a Linux HPC cluster using WINE","ddc":["000"],"status":"public","type":"conference_abstract","date_published":"2023-07-01T00:00:00Z","publication":"ASHPC23 - Austrian-Slovenian HPC Meeting 2023","citation":{"ama":"Schlögl A, Elefante S, Hodirnau V-V. Running Windows-applications on a Linux HPC cluster using WINE. In: ASHPC23 - Austrian-Slovenian HPC Meeting 2023. EuroCC; :59-59.","apa":"Schlögl, A., Elefante, S., & Hodirnau, V.-V. (n.d.). Running Windows-applications on a Linux HPC cluster using WINE. In ASHPC23 - Austrian-Slovenian HPC Meeting 2023 (pp. 59–59). Maribor, Slovenia: EuroCC.","ieee":"A. Schlögl, S. Elefante, and V.-V. Hodirnau, “Running Windows-applications on a Linux HPC cluster using WINE,” in ASHPC23 - Austrian-Slovenian HPC Meeting 2023, Maribor, Slovenia, pp. 59–59.","ista":"Schlögl A, Elefante S, Hodirnau V-V. Running Windows-applications on a Linux HPC cluster using WINE. ASHPC23 - Austrian-Slovenian HPC Meeting 2023. ASHPC: Austrian-Slovenian HPC Meeting, 59–59.","short":"A. Schlögl, S. Elefante, V.-V. Hodirnau, in:, ASHPC23 - Austrian-Slovenian HPC Meeting 2023, EuroCC, n.d., pp. 59–59.","mla":"Schlögl, Alois, et al. “Running Windows-Applications on a Linux HPC Cluster Using WINE.” ASHPC23 - Austrian-Slovenian HPC Meeting 2023, EuroCC, pp. 59–59.","chicago":"Schlögl, Alois, Stefano Elefante, and Victor-Valentin Hodirnau. “Running Windows-Applications on a Linux HPC Cluster Using WINE.” In ASHPC23 - Austrian-Slovenian HPC Meeting 2023, 59–59. EuroCC, n.d."},"page":"59-59","day":"01","article_processing_charge":"No","has_accepted_license":"1","author":[{"first_name":"Alois","last_name":"Schlögl","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5621-8100","full_name":"Schlögl, Alois"},{"last_name":"Elefante","first_name":"Stefano","id":"490F40CE-F248-11E8-B48F-1D18A9856A87","full_name":"Elefante, Stefano"},{"last_name":"Hodirnau","first_name":"Victor-Valentin","id":"3661B498-F248-11E8-B48F-1D18A9856A87","full_name":"Hodirnau, Victor-Valentin"}],"date_updated":"2023-07-18T09:30:54Z","date_created":"2023-06-23T11:01:23Z","acknowledgement":"Thanks to Jesse Hansen for his suggestions on improving the abstract.","year":"2023","publication_status":"inpress","department":[{"_id":"ScienComp"},{"_id":"EM-Fac"}],"publisher":"EuroCC","file_date_updated":"2023-07-18T09:18:55Z","conference":{"name":"ASHPC: Austrian-Slovenian HPC Meeting","end_date":"2023-06-15","location":"Maribor, Slovenia","start_date":"2023-06-13"},"language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","month":"07"},{"type":"journal_article","issue":"27","abstract":[{"lang":"eng","text":"A rotating organic cation and a dynamically disordered soft inorganic cage are the hallmark features of organic-inorganic lead-halide perovskites. Understanding the interplay between these two subsystems is a challenging problem, but it is this coupling that is widely conjectured to be responsible for the unique behavior of photocarriers in these materials. In this work, we use the fact that the polarizability of the organic cation strongly depends on the ambient electrostatic environment to put the molecule forward as a sensitive probe of the local crystal fields inside the lattice cell. We measure the average polarizability of the C/N–H bond stretching mode by means of infrared spectroscopy, which allows us to deduce the character of the motion of the cation molecule, find the magnitude of the local crystal field, and place an estimate on the strength of the hydrogen bond between the hydrogen and halide atoms. Our results pave the way for understanding electric fields in lead-halide perovskites using infrared bond spectroscopy."}],"_id":"13251","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 14","status":"public","title":"Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites","ddc":["530"],"file":[{"access_level":"open_access","file_name":"2023_JourPhysChemistry_Wei.pdf","creator":"dernst","file_size":2121252,"content_type":"application/pdf","file_id":"13253","relation":"main_file","success":1,"checksum":"c0c040063f06a51b9c463adc504f1a23","date_created":"2023-07-19T06:55:39Z","date_updated":"2023-07-19T06:55:39Z"}],"oa_version":"Published Version","keyword":["General Materials Science","Physical and Theoretical Chemistry"],"has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","day":"05","citation":{"ista":"Wei Y, Volosniev A, Lorenc D, Zhumekenov AA, Bakr OM, Lemeshko M, Alpichshev Z. 2023. Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites. The Journal of Physical Chemistry Letters. 14(27), 6309–6314.","apa":"Wei, Y., Volosniev, A., Lorenc, D., Zhumekenov, A. A., Bakr, O. M., Lemeshko, M., & Alpichshev, Z. (2023). Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites. The Journal of Physical Chemistry Letters. American Chemical Society. https://doi.org/10.1021/acs.jpclett.3c01158","ieee":"Y. Wei et al., “Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites,” The Journal of Physical Chemistry Letters, vol. 14, no. 27. American Chemical Society, pp. 6309–6314, 2023.","ama":"Wei Y, Volosniev A, Lorenc D, et al. Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites. The Journal of Physical Chemistry Letters. 2023;14(27):6309-6314. doi:10.1021/acs.jpclett.3c01158","chicago":"Wei, Yujing, Artem Volosniev, Dusan Lorenc, Ayan A. Zhumekenov, Osman M. Bakr, Mikhail Lemeshko, and Zhanybek Alpichshev. “Bond Polarizability as a Probe of Local Crystal Fields in Hybrid Lead-Halide Perovskites.” The Journal of Physical Chemistry Letters. American Chemical Society, 2023. https://doi.org/10.1021/acs.jpclett.3c01158.","mla":"Wei, Yujing, et al. “Bond Polarizability as a Probe of Local Crystal Fields in Hybrid Lead-Halide Perovskites.” The Journal of Physical Chemistry Letters, vol. 14, no. 27, American Chemical Society, 2023, pp. 6309–14, doi:10.1021/acs.jpclett.3c01158.","short":"Y. Wei, A. Volosniev, D. Lorenc, A.A. Zhumekenov, O.M. Bakr, M. Lemeshko, Z. Alpichshev, The Journal of Physical Chemistry Letters 14 (2023) 6309–6314."},"publication":"The Journal of Physical Chemistry Letters","page":"6309-6314","article_type":"original","date_published":"2023-07-05T00:00:00Z","ec_funded":1,"file_date_updated":"2023-07-19T06:55:39Z","year":"2023","acknowledgement":"We thank Bingqing Cheng and Hong-Zhou Ye for valuable discussions; Y.W.’s work at IST Austria was supported through ISTernship summer internship program funded by OeADGmbH; D.L. and Z.A. acknowledge support by IST Austria (ISTA); M.L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON).\r\nA.A.Z. and O.M.B. acknowledge support by KAUST.","department":[{"_id":"MiLe"},{"_id":"ZhAl"}],"publisher":"American Chemical Society","publication_status":"published","author":[{"full_name":"Wei, Yujing","first_name":"Yujing","last_name":"Wei","id":"0c5ff007-2600-11ee-b896-98bd8d663294","orcid":"0000-0001-8913-9719"},{"full_name":"Volosniev, Artem","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0393-5525","first_name":"Artem","last_name":"Volosniev"},{"full_name":"Lorenc, Dusan","last_name":"Lorenc","first_name":"Dusan","id":"40D8A3E6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zhumekenov, Ayan A.","first_name":"Ayan A.","last_name":"Zhumekenov"},{"full_name":"Bakr, Osman M.","first_name":"Osman M.","last_name":"Bakr"},{"full_name":"Lemeshko, Mikhail","first_name":"Mikhail","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802"},{"full_name":"Alpichshev, Zhanybek","orcid":"0000-0002-7183-5203","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","last_name":"Alpichshev","first_name":"Zhanybek"}],"volume":14,"date_created":"2023-07-18T11:13:17Z","date_updated":"2023-07-19T06:59:19Z","publication_identifier":{"eissn":["1948-7185"]},"month":"07","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["001022811500001"],"arxiv":["2304.14198"]},"project":[{"call_identifier":"H2020","name":"Angulon: physics and applications of a new quasiparticle","grant_number":"801770","_id":"2688CF98-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"doi":"10.1021/acs.jpclett.3c01158","language":[{"iso":"eng"}]},{"ddc":["000"],"title":"Regular methods for operator precedence languages","status":"public","intvolume":" 261","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"13292","oa_version":"Published Version","file":[{"creator":"esarac","content_type":"application/pdf","file_size":859379,"access_level":"open_access","file_name":"icalp23.pdf","success":1,"checksum":"5d4c8932ef3450615a53b9bb15d92eb2","date_updated":"2023-07-24T15:11:05Z","date_created":"2023-07-24T15:11:05Z","file_id":"13293","relation":"main_file"}],"alternative_title":["LIPIcs"],"type":"conference","abstract":[{"lang":"eng","text":"The operator precedence languages (OPLs) represent the largest known subclass of the context-free languages which enjoys all desirable closure and decidability properties. This includes the decidability of language inclusion, which is the ultimate verification problem. Operator precedence grammars, automata, and logics have been investigated and used, for example, to verify programs with arithmetic expressions and exceptions (both of which are deterministic pushdown but lie outside the scope of the visibly pushdown languages). In this paper, we complete the picture and give, for the first time, an algebraic characterization of the class of OPLs in the form of a syntactic congruence that has finitely many equivalence classes exactly for the operator precedence languages. This is a generalization of the celebrated Myhill-Nerode theorem for the regular languages to OPLs. As one of the consequences, we show that universality and language inclusion for nondeterministic operator precedence automata can be solved by an antichain algorithm. Antichain algorithms avoid determinization and complementation through an explicit subset construction, by leveraging a quasi-order on words, which allows the pruning of the search space for counterexample words without sacrificing completeness. Antichain algorithms can be implemented symbolically, and these implementations are today the best-performing algorithms in practice for the inclusion of finite automata. We give a generic construction of the quasi-order needed for antichain algorithms from a finite syntactic congruence. This yields the first antichain algorithm for OPLs, an algorithm that solves the ExpTime-hard language inclusion problem for OPLs in exponential time."}],"page":"129:1--129:20","publication":"50th International Colloquium on Automata, Languages, and Programming","citation":{"apa":"Henzinger, T. A., Kebis, P., Mazzocchi, N. A., & Sarac, N. E. (2023). Regular methods for operator precedence languages. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261, p. 129:1--129:20). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.129","ieee":"T. A. Henzinger, P. Kebis, N. A. Mazzocchi, and N. E. Sarac, “Regular methods for operator precedence languages,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261, p. 129:1--129:20.","ista":"Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. 2023. Regular methods for operator precedence languages. 50th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 261, 129:1--129:20.","ama":"Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. Regular methods for operator precedence languages. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023:129:1--129:20. doi:10.4230/LIPIcs.ICALP.2023.129","chicago":"Henzinger, Thomas A, Pavol Kebis, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Regular Methods for Operator Precedence Languages.” In 50th International Colloquium on Automata, Languages, and Programming, 261:129:1--129:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.129.","short":"T.A. Henzinger, P. Kebis, N.A. Mazzocchi, N.E. Sarac, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, p. 129:1--129:20.","mla":"Henzinger, Thomas A., et al. “Regular Methods for Operator Precedence Languages.” 50th International Colloquium on Automata, Languages, and Programming, vol. 261, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, p. 129:1--129:20, doi:10.4230/LIPIcs.ICALP.2023.129."},"date_published":"2023-07-05T00:00:00Z","day":"05","has_accepted_license":"1","article_processing_charge":"Yes","publication_status":"published","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","year":"2023","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093.\r\nWe thank Pierre Ganty for early discussions and the anonymous reviewers for their helpful comments.\r\n","date_created":"2023-07-24T15:11:41Z","date_updated":"2023-07-31T08:38:38Z","volume":261,"author":[{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Kebis, Pavol","last_name":"Kebis","first_name":"Pavol"},{"last_name":"Mazzocchi","first_name":"Nicolas Adrien","id":"b26baa86-3308-11ec-87b0-8990f34baa85","full_name":"Mazzocchi, Nicolas Adrien"},{"full_name":"Sarac, Naci E","first_name":"Naci E","last_name":"Sarac","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425"}],"file_date_updated":"2023-07-24T15:11:05Z","ec_funded":1,"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2305.03447"]},"oa":1,"language":[{"iso":"eng"}],"conference":{"location":"Paderborn, Germany","start_date":"2023-07-10","end_date":"2023-07-14","name":"ICALP: International Colloquium on Automata, Languages, and Programming"},"doi":"10.4230/LIPIcs.ICALP.2023.129","month":"07","publication_identifier":{"isbn":["9783959772785"],"eissn":["1868-8969"]}},{"file_date_updated":"2023-07-31T09:02:27Z","ec_funded":1,"article_number":"029","author":[{"full_name":"Tucci, Gennaro","first_name":"Gennaro","last_name":"Tucci"},{"last_name":"De Nicola","first_name":"Stefano","orcid":"0000-0002-4842-6671","id":"42832B76-F248-11E8-B48F-1D18A9856A87","full_name":"De Nicola, Stefano"},{"first_name":"Sascha","last_name":"Wald","full_name":"Wald, Sascha"},{"full_name":"Gambassi, Andrea","last_name":"Gambassi","first_name":"Andrea"}],"date_created":"2023-07-24T10:47:46Z","date_updated":"2023-07-31T09:03:28Z","volume":6,"acknowledgement":"S. De Nicola acknowledges funding from the Institute of Science and Technology Austria (ISTA), and from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 754411. S. De Nicola also acknowledges funding from the EPSRC Center for Doctoral Training in Cross-Disciplinary Approaches to NonEquilibrium Systems (CANES) under Grant EP/L015854/1. ","year":"2023","publication_status":"published","department":[{"_id":"MaSe"}],"publisher":"SciPost Foundation","month":"04","publication_identifier":{"issn":["2666-9366"]},"doi":"10.21468/scipostphyscore.6.2.029","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"arxiv":["2211.01923"]},"quality_controlled":"1","project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"abstract":[{"text":"Recent experimental advances have inspired the development of theoretical tools to describe the non-equilibrium dynamics of quantum systems. Among them an exact representation of quantum spin systems in terms of classical stochastic processes has been proposed. Here we provide first steps towards the extension of this stochastic approach to bosonic systems by considering the one-dimensional quantum quartic oscillator. We show how to exactly parameterize the time evolution of this prototypical model via the dynamics of a set of classical variables. We interpret these variables as stochastic processes, which allows us to propose a novel way to numerically simulate the time evolution of the system. We benchmark our findings by considering analytically solvable limits and providing alternative derivations of known results.","lang":"eng"}],"issue":"2","type":"journal_article","oa_version":"Published Version","file":[{"file_size":523236,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2023_SciPostPhysCore_Tucci.pdf","checksum":"b472bc82108747eda5d52adf9e2ac7f3","success":1,"date_created":"2023-07-31T09:02:27Z","date_updated":"2023-07-31T09:02:27Z","relation":"main_file","file_id":"13329"}],"_id":"13277","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Stochastic representation of the quantum quartic oscillator","status":"public","ddc":["530"],"intvolume":" 6","day":"14","has_accepted_license":"1","article_processing_charge":"No","keyword":["Statistical and Nonlinear Physics","Atomic and Molecular Physics","and Optics","Nuclear and High Energy Physics","Condensed Matter Physics"],"date_published":"2023-04-14T00:00:00Z","publication":"SciPost Physics Core","citation":{"ista":"Tucci G, De Nicola S, Wald S, Gambassi A. 2023. Stochastic representation of the quantum quartic oscillator. SciPost Physics Core. 6(2), 029.","apa":"Tucci, G., De Nicola, S., Wald, S., & Gambassi, A. (2023). Stochastic representation of the quantum quartic oscillator. SciPost Physics Core. SciPost Foundation. https://doi.org/10.21468/scipostphyscore.6.2.029","ieee":"G. Tucci, S. De Nicola, S. Wald, and A. Gambassi, “Stochastic representation of the quantum quartic oscillator,” SciPost Physics Core, vol. 6, no. 2. SciPost Foundation, 2023.","ama":"Tucci G, De Nicola S, Wald S, Gambassi A. Stochastic representation of the quantum quartic oscillator. SciPost Physics Core. 2023;6(2). doi:10.21468/scipostphyscore.6.2.029","chicago":"Tucci, Gennaro, Stefano De Nicola, Sascha Wald, and Andrea Gambassi. “Stochastic Representation of the Quantum Quartic Oscillator.” SciPost Physics Core. SciPost Foundation, 2023. https://doi.org/10.21468/scipostphyscore.6.2.029.","mla":"Tucci, Gennaro, et al. “Stochastic Representation of the Quantum Quartic Oscillator.” SciPost Physics Core, vol. 6, no. 2, 029, SciPost Foundation, 2023, doi:10.21468/scipostphyscore.6.2.029.","short":"G. Tucci, S. De Nicola, S. Wald, A. Gambassi, SciPost Physics Core 6 (2023)."},"article_type":"original"},{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"arxiv":["2202.04603"]},"project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"quality_controlled":"1","doi":"10.21468/scipostphyscodeb.12","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2949-804X"]},"month":"04","year":"2023","acknowledgement":"We acknowledge fruitful discussions with Hans-Werner Hammer and thank Gerhard Zürn and\r\nPietro Massignan for sending us their data. We thank Fabian Brauneis for beta-testing the\r\nprovided code-package, and comments on the manuscript.\r\nL.R. is supported by FP7/ERC Consolidator Grant QSIMCORR, No.\r\n771891, and the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under\r\nGermany’s Excellence Strategy –EXC–2111–390814868. A.G.V. acknowledges support\r\nby European Union’s Horizon 2020 research and innovation programme under the Marie\r\nSkłodowska-Curie Grant Agreement No. 754411.","department":[{"_id":"MiLe"}],"publisher":"SciPost Foundation","publication_status":"published","related_material":{"record":[{"status":"public","relation":"research_data","id":"13275"}]},"author":[{"full_name":"Rammelmüller, Lukas","first_name":"Lukas","last_name":"Rammelmüller"},{"full_name":"Huber, David","first_name":"David","last_name":"Huber"},{"first_name":"Artem","last_name":"Volosniev","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0393-5525","full_name":"Volosniev, Artem"}],"date_updated":"2023-07-31T09:16:02Z","date_created":"2023-07-24T10:47:15Z","article_number":"12","ec_funded":1,"file_date_updated":"2023-07-31T09:09:23Z","citation":{"ista":"Rammelmüller L, Huber D, Volosniev A. 2023. A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D. SciPost Physics Codebases., 12.","apa":"Rammelmüller, L., Huber, D., & Volosniev, A. (2023). A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D. SciPost Physics Codebases. SciPost Foundation. https://doi.org/10.21468/scipostphyscodeb.12","ieee":"L. Rammelmüller, D. Huber, and A. Volosniev, “A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D,” SciPost Physics Codebases. SciPost Foundation, 2023.","ama":"Rammelmüller L, Huber D, Volosniev A. A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D. SciPost Physics Codebases. 2023. doi:10.21468/scipostphyscodeb.12","chicago":"Rammelmüller, Lukas, David Huber, and Artem Volosniev. “A Modular Implementation of an Effective Interaction Approach for Harmonically Trapped Fermions in 1D.” SciPost Physics Codebases. SciPost Foundation, 2023. https://doi.org/10.21468/scipostphyscodeb.12.","mla":"Rammelmüller, Lukas, et al. “A Modular Implementation of an Effective Interaction Approach for Harmonically Trapped Fermions in 1D.” SciPost Physics Codebases, 12, SciPost Foundation, 2023, doi:10.21468/scipostphyscodeb.12.","short":"L. Rammelmüller, D. Huber, A. Volosniev, SciPost Physics Codebases (2023)."},"publication":"SciPost Physics Codebases","article_type":"original","date_published":"2023-04-19T00:00:00Z","article_processing_charge":"No","has_accepted_license":"1","day":"19","_id":"13276","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D","ddc":["530"],"status":"public","oa_version":"Published Version","file":[{"date_created":"2023-07-31T09:09:23Z","date_updated":"2023-07-31T09:09:23Z","success":1,"checksum":"f583a70fe915d2208c803f5afb426daa","file_id":"13330","relation":"main_file","creator":"dernst","file_size":551418,"content_type":"application/pdf","file_name":"2023_SciPostPhysCodebase_Rammelmueller.pdf","access_level":"open_access"}],"type":"journal_article","abstract":[{"lang":"eng","text":"We introduce a generic and accessible implementation of an exact diagonalization method for studying few-fermion models. Our aim is to provide a testbed for the newcomers to the field as well as a stepping stone for trying out novel optimizations and approximations. This userguide consists of a description of the algorithm, and several examples in varying orders of sophistication. In particular, we exemplify our routine using an effective-interaction approach that fixes the low-energy physics. We benchmark this approach against the existing data, and show that it is able to deliver state-of-the-art numerical results at a significantly reduced computational cost."}]},{"doi":"10.21468/scipostphyscodeb.12-r1.0","date_published":"2023-04-19T00:00:00Z","project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"main_file_link":[{"url":"https://doi.org/10.21468/SciPostPhysCodeb.12-r1.0","open_access":"1"}],"citation":{"chicago":"Rammelmüller, Lukas, David Huber, and Artem Volosniev. “Codebase Release 1.0 for FermiFCI.” SciPost Foundation, 2023. https://doi.org/10.21468/scipostphyscodeb.12-r1.0.","short":"L. Rammelmüller, D. Huber, A. Volosniev, (2023).","mla":"Rammelmüller, Lukas, et al. Codebase Release 1.0 for FermiFCI. SciPost Foundation, 2023, doi:10.21468/scipostphyscodeb.12-r1.0.","apa":"Rammelmüller, L., Huber, D., & Volosniev, A. (2023). Codebase release 1.0 for FermiFCI. SciPost Foundation. https://doi.org/10.21468/scipostphyscodeb.12-r1.0","ieee":"L. Rammelmüller, D. Huber, and A. Volosniev, “Codebase release 1.0 for FermiFCI.” SciPost Foundation, 2023.","ista":"Rammelmüller L, Huber D, Volosniev A. 2023. Codebase release 1.0 for FermiFCI, SciPost Foundation, 10.21468/scipostphyscodeb.12-r1.0.","ama":"Rammelmüller L, Huber D, Volosniev A. Codebase release 1.0 for FermiFCI. 2023. doi:10.21468/scipostphyscodeb.12-r1.0"},"oa":1,"month":"04","day":"19","article_processing_charge":"No","date_created":"2023-07-24T10:46:23Z","date_updated":"2023-07-31T09:16:02Z","oa_version":"Published Version","author":[{"last_name":"Rammelmüller","first_name":"Lukas","full_name":"Rammelmüller, Lukas"},{"full_name":"Huber, David","last_name":"Huber","first_name":"David"},{"first_name":"Artem","last_name":"Volosniev","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0393-5525","full_name":"Volosniev, Artem"}],"related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"13276"}]},"status":"public","title":"Codebase release 1.0 for FermiFCI","ddc":["530"],"department":[{"_id":"MiLe"}],"publisher":"SciPost Foundation","year":"2023","_id":"13275","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We introduce a generic and accessible implementation of an exact diagonalization method for studying few-fermion models. Our aim is to provide a testbed for the newcomers to the field as well as a stepping stone for trying out novel optimizations and approximations. This userguide consists of a description of the algorithm, and several examples in varying orders of sophistication. In particular, we exemplify our routine using an effective-interaction approach that fixes the low-energy physics. We benchmark this approach against the existing data, and show that it is able to deliver state-of-the-art numerical results at a significantly reduced computational cost."}],"ec_funded":1,"type":"research_data_reference"},{"title":"Provably-efficient and internally-deterministic parallel Union-Find","ddc":["000"],"status":"public","_id":"13262","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"date_updated":"2023-07-31T10:53:08Z","date_created":"2023-07-31T10:53:08Z","success":1,"checksum":"72e312aabf0c5248c99b5cd3a88e4c88","file_id":"13334","relation":"main_file","creator":"dernst","file_size":2087937,"content_type":"application/pdf","file_name":"2023_SPAA_Fedorov.pdf","access_level":"open_access"}],"type":"conference","abstract":[{"text":"Determining the degree of inherent parallelism in classical sequential algorithms and leveraging it for fast parallel execution is a key topic in parallel computing, and detailed analyses are known for a wide range of classical algorithms. In this paper, we perform the first such analysis for the fundamental Union-Find problem, in which we are given a graph as a sequence of edges, and must maintain its connectivity structure under edge additions. We prove that classic sequential algorithms for this problem are well-parallelizable under reasonable assumptions, addressing a conjecture by [Blelloch, 2017]. More precisely, we show via a new potential argument that, under uniform random edge ordering, parallel union-find operations are unlikely to interfere: T concurrent threads processing the graph in parallel will encounter memory contention O(T2 · log |V| · log |E|) times in expectation, where |E| and |V| are the number of edges and nodes in the graph, respectively. We leverage this result to design a new parallel Union-Find algorithm that is both internally deterministic, i.e., its results are guaranteed to match those of a sequential execution, but also work-efficient and scalable, as long as the number of threads T is O(|E|1 over 3 - ε), for an arbitrarily small constant ε > 0, which holds for most large real-world graphs. We present lower bounds which show that our analysis is close to optimal, and experimental results suggesting that the performance cost of internal determinism is limited.","lang":"eng"}],"page":"261-271","citation":{"apa":"Fedorov, A., Hashemi, D., Nadiradze, G., & Alistarh, D.-A. (2023). Provably-efficient and internally-deterministic parallel Union-Find. In Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures (pp. 261–271). Orlando, FL, United States: Association for Computing Machinery. https://doi.org/10.1145/3558481.3591082","ieee":"A. Fedorov, D. Hashemi, G. Nadiradze, and D.-A. Alistarh, “Provably-efficient and internally-deterministic parallel Union-Find,” in Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, Orlando, FL, United States, 2023, pp. 261–271.","ista":"Fedorov A, Hashemi D, Nadiradze G, Alistarh D-A. 2023. Provably-efficient and internally-deterministic parallel Union-Find. Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures, 261–271.","ama":"Fedorov A, Hashemi D, Nadiradze G, Alistarh D-A. Provably-efficient and internally-deterministic parallel Union-Find. In: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery; 2023:261-271. doi:10.1145/3558481.3591082","chicago":"Fedorov, Alexander, Diba Hashemi, Giorgi Nadiradze, and Dan-Adrian Alistarh. “Provably-Efficient and Internally-Deterministic Parallel Union-Find.” In Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 261–71. Association for Computing Machinery, 2023. https://doi.org/10.1145/3558481.3591082.","short":"A. Fedorov, D. Hashemi, G. Nadiradze, D.-A. Alistarh, in:, Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2023, pp. 261–271.","mla":"Fedorov, Alexander, et al. “Provably-Efficient and Internally-Deterministic Parallel Union-Find.” Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2023, pp. 261–71, doi:10.1145/3558481.3591082."},"publication":"Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures","date_published":"2023-06-17T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","day":"17","department":[{"_id":"DaAl"},{"_id":"GradSch"}],"publisher":"Association for Computing Machinery","publication_status":"published","year":"2023","date_created":"2023-07-23T22:01:12Z","date_updated":"2023-07-31T10:54:32Z","author":[{"id":"2e711909-896a-11ed-bdf8-eb0f5a2984c6","first_name":"Alexander","last_name":"Fedorov","full_name":"Fedorov, Alexander"},{"full_name":"Hashemi, Diba","id":"ed9595ea-2f8f-11ee-ba95-d2b546540783","first_name":"Diba","last_name":"Hashemi"},{"full_name":"Nadiradze, Giorgi","last_name":"Nadiradze","first_name":"Giorgi","id":"3279A00C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"}],"file_date_updated":"2023-07-31T10:53:08Z","quality_controlled":"1","external_id":{"arxiv":["2304.09331"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1145/3558481.3591082","conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures","location":"Orlando, FL, United States","start_date":"2023-06-17","end_date":"2023-06-19"},"publication_identifier":{"isbn":["9781450395458"]},"month":"06"},{"abstract":[{"lang":"eng","text":"Understanding population divergence that eventually leads to speciation is essential for evolutionary biology. High species diversity in the sea was regarded as a paradox when strict allopatry was considered necessary for most speciation events because geographical barriers seemed largely absent in the sea, and many marine species have high dispersal capacities. Combining genome-wide data with demographic modelling to infer the demographic history of divergence has introduced new ways to address this classical issue. These models assume an ancestral population that splits into two subpopulations diverging according to different scenarios that allow tests for periods of gene flow. Models can also test for heterogeneities in population sizes and migration rates along the genome to account, respectively, for background selection and selection against introgressed ancestry. To investigate how barriers to gene flow arise in the sea, we compiled studies modelling the demographic history of divergence in marine organisms and extracted preferred demographic scenarios together with estimates of demographic parameters. These studies show that geographical barriers to gene flow do exist in the sea but that divergence can also occur without strict isolation. Heterogeneity of gene flow was detected in most population pairs suggesting the predominance of semipermeable barriers during divergence. We found a weak positive relationship between the fraction of the genome experiencing reduced gene flow and levels of genome-wide differentiation. Furthermore, we found that the upper bound of the ‘grey zone of speciation’ for our dataset extended beyond that found before, implying that gene flow between diverging taxa is possible at higher levels of divergence than previously thought. Finally, we list recommendations for further strengthening the use of demographic modelling in speciation research. These include a more balanced representation of taxa, more consistent and comprehensive modelling, clear reporting of results and simulation studies to rule out nonbiological explanations for general results."}],"issue":"2","type":"journal_article","oa_version":"Published Version","file":[{"date_updated":"2023-02-27T07:10:17Z","date_created":"2023-02-27T07:10:17Z","success":1,"checksum":"d4d6fa9ddf36643af994a6a757919afb","file_id":"12685","relation":"main_file","creator":"dernst","file_size":2269822,"content_type":"application/pdf","file_name":"2023_EvolutionaryApplications_DeJode.pdf","access_level":"open_access"}],"status":"public","title":"Ten years of demographic modelling of divergence and speciation in the sea","ddc":["576"],"intvolume":" 16","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"11479","day":"01","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","date_published":"2023-02-01T00:00:00Z","article_type":"original","page":"542-559","publication":"Evolutionary Applications","citation":{"ieee":"A. De Jode et al., “Ten years of demographic modelling of divergence and speciation in the sea,” Evolutionary Applications, vol. 16, no. 2. Wiley, pp. 542–559, 2023.","apa":"De Jode, A., Le Moan, A., Johannesson, K., Faria, R., Stankowski, S., Westram, A. M., … Fraisse, C. (2023). Ten years of demographic modelling of divergence and speciation in the sea. Evolutionary Applications. Wiley. https://doi.org/10.1111/eva.13428","ista":"De Jode A, Le Moan A, Johannesson K, Faria R, Stankowski S, Westram AM, Butlin RK, Rafajlović M, Fraisse C. 2023. Ten years of demographic modelling of divergence and speciation in the sea. Evolutionary Applications. 16(2), 542–559.","ama":"De Jode A, Le Moan A, Johannesson K, et al. Ten years of demographic modelling of divergence and speciation in the sea. Evolutionary Applications. 2023;16(2):542-559. doi:10.1111/eva.13428","chicago":"De Jode, Aurélien, Alan Le Moan, Kerstin Johannesson, Rui Faria, Sean Stankowski, Anja M Westram, Roger K. Butlin, Marina Rafajlović, and Christelle Fraisse. “Ten Years of Demographic Modelling of Divergence and Speciation in the Sea.” Evolutionary Applications. Wiley, 2023. https://doi.org/10.1111/eva.13428.","short":"A. De Jode, A. Le Moan, K. Johannesson, R. Faria, S. Stankowski, A.M. Westram, R.K. Butlin, M. Rafajlović, C. Fraisse, Evolutionary Applications 16 (2023) 542–559.","mla":"De Jode, Aurélien, et al. “Ten Years of Demographic Modelling of Divergence and Speciation in the Sea.” Evolutionary Applications, vol. 16, no. 2, Wiley, 2023, pp. 542–59, doi:10.1111/eva.13428."},"file_date_updated":"2023-02-27T07:10:17Z","date_created":"2022-07-03T22:01:33Z","date_updated":"2023-08-01T12:25:44Z","volume":16,"author":[{"first_name":"Aurélien","last_name":"De Jode","full_name":"De Jode, Aurélien"},{"full_name":"Le Moan, Alan","last_name":"Le Moan","first_name":"Alan"},{"last_name":"Johannesson","first_name":"Kerstin","full_name":"Johannesson, Kerstin"},{"full_name":"Faria, Rui","last_name":"Faria","first_name":"Rui"},{"full_name":"Stankowski, Sean","id":"43161670-5719-11EA-8025-FABC3DDC885E","first_name":"Sean","last_name":"Stankowski"},{"first_name":"Anja M","last_name":"Westram","id":"3C147470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1050-4969","full_name":"Westram, Anja M"},{"full_name":"Butlin, Roger K.","last_name":"Butlin","first_name":"Roger K."},{"first_name":"Marina","last_name":"Rafajlović","full_name":"Rafajlović, Marina"},{"full_name":"Fraisse, Christelle","id":"32DF5794-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8441-5075","first_name":"Christelle","last_name":"Fraisse"}],"publication_status":"published","publisher":"Wiley","department":[{"_id":"NiBa"},{"_id":"BeVi"}],"year":"2023","acknowledgement":"We greatly thank all the corresponding authors of the studies that were included in our synthesis for the sharing of additional data: Thomas Broquet, Dmitry Filatov, Quentin Rougemont, Paolo Momigliano, Pierre-Alexandre Gagnaire, Carlos Prada, Ahmed Souissi, Michael Møller Hansen, Sylvie Lapègue, Joseph Di Battista, Michael Hellberg and Carlos Prada. RKB and ADJ were supported by the European Research Council. MR was supported by the Swedish Research Council Vetenskapsrådet (grant number 2021-05243; to MR) and Formas (grant number 2019-00882; to KJ and MR), and by additional grants from the European Research Council (to RKB) and Vetenskapsrådet (to KJ) through the Centre for Marine Evolutionary Biology (https://www.gu.se/en/cemeb-marine-evolutionary-biology).","month":"02","publication_identifier":{"eissn":["1752-4571"]},"language":[{"iso":"eng"}],"doi":"10.1111/eva.13428","quality_controlled":"1","isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000815663700001"]}},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"12329","title":"New approaches to epidemic modeling on networks","status":"public","ddc":["510"],"intvolume":" 13","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2023_ScientificReports_Gomez.pdf","creator":"dernst","file_size":2167792,"content_type":"application/pdf","file_id":"12336","relation":"main_file","success":1,"checksum":"a8b83739f4a951e83e0b2a778f03b327","date_updated":"2023-01-23T07:53:23Z","date_created":"2023-01-23T07:53:23Z"}],"type":"journal_article","abstract":[{"lang":"eng","text":"In this article, we develop two independent and new approaches to model epidemic spread in a network. Contrary to the most studied models, those developed here allow for contacts with different probabilities of transmitting the disease (transmissibilities). We then examine each of these models using some mean field type approximations. The first model looks at the late-stage effects of an epidemic outbreak and allows for the computation of the probability that a given vertex was infected. This computation is based on a mean field approximation and only depends on the number of contacts and their transmissibilities. This approach shares many similarities with percolation models in networks. The second model we develop is a dynamic model which we analyze using a mean field approximation which highly reduces the dimensionality of the system. In particular, the original system which individually analyses each vertex of the network is reduced to one with as many equations as different transmissibilities. Perhaps the greatest contribution of this article is the observation that, in both these models, the existence and size of an epidemic outbreak are linked to the properties of a matrix which we call the R-matrix. This is a generalization of the basic reproduction number which more precisely characterizes the main routes of infection."}],"publication":"Scientific Reports","citation":{"chicago":"Gómez, Arturo, and Goncalo Oliveira. “New Approaches to Epidemic Modeling on Networks.” Scientific Reports. Springer Nature, 2023. https://doi.org/10.1038/s41598-022-19827-9.","short":"A. Gómez, G. Oliveira, Scientific Reports 13 (2023).","mla":"Gómez, Arturo, and Goncalo Oliveira. “New Approaches to Epidemic Modeling on Networks.” Scientific Reports, vol. 13, 468, Springer Nature, 2023, doi:10.1038/s41598-022-19827-9.","ieee":"A. Gómez and G. Oliveira, “New approaches to epidemic modeling on networks,” Scientific Reports, vol. 13. Springer Nature, 2023.","apa":"Gómez, A., & Oliveira, G. (2023). New approaches to epidemic modeling on networks. Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-022-19827-9","ista":"Gómez A, Oliveira G. 2023. New approaches to epidemic modeling on networks. Scientific Reports. 13, 468.","ama":"Gómez A, Oliveira G. New approaches to epidemic modeling on networks. Scientific Reports. 2023;13. doi:10.1038/s41598-022-19827-9"},"article_type":"original","date_published":"2023-01-10T00:00:00Z","scopus_import":"1","day":"10","has_accepted_license":"1","article_processing_charge":"No","year":"2023","acknowledgement":"Gonçalo Oliveira is supported by the NOMIS Foundation, Fundação Serrapilheira 1812-27395, by CNPq grants 428959/2018-0 and 307475/2018-2, and by FAPERJ through the grant Jovem Cientista do Nosso Estado E-26/202.793/2019.","publication_status":"published","department":[{"_id":"TaHa"}],"publisher":"Springer Nature","author":[{"full_name":"Gómez, Arturo","first_name":"Arturo","last_name":"Gómez"},{"first_name":"Goncalo","last_name":"Oliveira","id":"58abbde8-f455-11eb-a497-98c8fd71b905","full_name":"Oliveira, Goncalo"}],"date_updated":"2023-08-01T12:31:40Z","date_created":"2023-01-22T23:00:55Z","volume":13,"article_number":"468","file_date_updated":"2023-01-23T07:53:23Z","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["001003345000051"]},"quality_controlled":"1","isi":1,"doi":"10.1038/s41598-022-19827-9","language":[{"iso":"eng"}],"month":"01","publication_identifier":{"eissn":["2045-2322"]}},{"issue":"8","abstract":[{"lang":"eng","text":"We determine an asymptotic formula for the number of integral points of bounded height on a blow-up of P3 outside certain planes using universal torsors."}],"type":"journal_article","oa_version":"Preprint","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"9034","intvolume":" 2023","status":"public","title":"Integral points of bounded height on a log Fano threefold","article_processing_charge":"No","day":"01","date_published":"2023-04-01T00:00:00Z","citation":{"chicago":"Wilsch, Florian Alexander. “Integral Points of Bounded Height on a Log Fano Threefold.” International Mathematics Research Notices. Oxford Academic, 2023. https://doi.org/10.1093/imrn/rnac048.","short":"F.A. Wilsch, International Mathematics Research Notices 2023 (2023) 6780–6808.","mla":"Wilsch, Florian Alexander. “Integral Points of Bounded Height on a Log Fano Threefold.” International Mathematics Research Notices, vol. 2023, no. 8, Oxford Academic, 2023, pp. 6780–808, doi:10.1093/imrn/rnac048.","ieee":"F. A. Wilsch, “Integral points of bounded height on a log Fano threefold,” International Mathematics Research Notices, vol. 2023, no. 8. Oxford Academic, pp. 6780–6808, 2023.","apa":"Wilsch, F. A. (2023). Integral points of bounded height on a log Fano threefold. International Mathematics Research Notices. Oxford Academic. https://doi.org/10.1093/imrn/rnac048","ista":"Wilsch FA. 2023. Integral points of bounded height on a log Fano threefold. International Mathematics Research Notices. 2023(8), 6780–6808.","ama":"Wilsch FA. Integral points of bounded height on a log Fano threefold. International Mathematics Research Notices. 2023;2023(8):6780-6808. doi:10.1093/imrn/rnac048"},"publication":"International Mathematics Research Notices","page":"6780-6808","article_type":"original","author":[{"id":"560601DA-8D36-11E9-A136-7AC1E5697425","orcid":"0000-0001-7302-8256","first_name":"Florian Alexander","last_name":"Wilsch","full_name":"Wilsch, Florian Alexander"}],"volume":2023,"date_updated":"2023-08-01T12:23:55Z","date_created":"2021-01-22T09:31:09Z","acknowledgement":"This work was supported by the German Academic Exchange Service. Parts of this article were prepared at the Institut de Mathémathiques de Jussieu—Paris Rive Gauche. I wish to thank Antoine Chambert-Loir for his remarks and the institute for its hospitality, as well as the anonymous referee for several useful remarks and suggestions for improvements.","year":"2023","publisher":"Oxford Academic","department":[{"_id":"TiBr"}],"publication_status":"published","publication_identifier":{"issn":["1073-7928"],"eissn":["1687-0247"]},"month":"04","doi":"10.1093/imrn/rnac048","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1901.08503","open_access":"1"}],"oa":1,"external_id":{"isi":["000773116000001"],"arxiv":["1901.08503"]},"isi":1,"quality_controlled":"1"},{"abstract":[{"lang":"eng","text":"Hosts can carry many viruses in their bodies, but not all of them cause disease. We studied ants as a social host to determine both their overall viral repertoire and the subset of actively infecting viruses across natural populations of three subfamilies: the Argentine ant (Linepithema humile, Dolichoderinae), the invasive garden ant (Lasius neglectus, Formicinae) and the red ant (Myrmica rubra, Myrmicinae). We used a dual sequencing strategy to reconstruct complete virus genomes by RNA-seq and to simultaneously determine the small interfering RNAs (siRNAs) by small RNA sequencing (sRNA-seq), which constitute the host antiviral RNAi immune response. This approach led to the discovery of 41 novel viruses in ants and revealed a host ant-specific RNAi response (21 vs. 22 nt siRNAs) in the different ant species. The efficiency of the RNAi response (sRNA/RNA read count ratio) depended on the virus and the respective ant species, but not its population. Overall, we found the highest virus abundance and diversity per population in Li. humile, followed by La. neglectus and M. rubra. Argentine ants also shared a high proportion of viruses between populations, whilst overlap was nearly absent in M. rubra. Only one of the 59 viruses was found to infect two of the ant species as hosts, revealing high host-specificity in active infections. In contrast, six viruses actively infected one ant species, but were found as contaminants only in the others. Disentangling spillover of disease-causing infection from non-infecting contamination across species is providing relevant information for disease ecology and ecosystem management."}],"type":"journal_article","file":[{"file_id":"12843","relation":"main_file","date_updated":"2023-04-17T07:49:09Z","date_created":"2023-04-17T07:49:09Z","success":1,"checksum":"cd52292963acce1111634d9fac08c699","file_name":"2023_FrontMicrobiology_Viljakainen.pdf","access_level":"open_access","creator":"dernst","file_size":4866332,"content_type":"application/pdf"}],"oa_version":"Published Version","intvolume":" 14","title":"Antiviral immune response reveals host-specific virus infections in natural ant populations","status":"public","ddc":["570"],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"12469","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","day":"16","scopus_import":"1","date_published":"2023-03-16T00:00:00Z","article_type":"original","citation":{"mla":"Viljakainen, Lumi, et al. “Antiviral Immune Response Reveals Host-Specific Virus Infections in Natural Ant Populations.” Frontiers in Microbiology, vol. 14, 1119002, Frontiers, 2023, doi:10.3389/fmicb.2023.1119002.","short":"L. Viljakainen, M. Fürst, A.V. Grasse, J. Jurvansuu, J. Oh, L. Tolonen, T. Eder, T. Rattei, S. Cremer, Frontiers in Microbiology 14 (2023).","chicago":"Viljakainen, Lumi, Matthias Fürst, Anna V Grasse, Jaana Jurvansuu, Jinook Oh, Lassi Tolonen, Thomas Eder, Thomas Rattei, and Sylvia Cremer. “Antiviral Immune Response Reveals Host-Specific Virus Infections in Natural Ant Populations.” Frontiers in Microbiology. Frontiers, 2023. https://doi.org/10.3389/fmicb.2023.1119002.","ama":"Viljakainen L, Fürst M, Grasse AV, et al. Antiviral immune response reveals host-specific virus infections in natural ant populations. Frontiers in Microbiology. 2023;14. doi:10.3389/fmicb.2023.1119002","ista":"Viljakainen L, Fürst M, Grasse AV, Jurvansuu J, Oh J, Tolonen L, Eder T, Rattei T, Cremer S. 2023. Antiviral immune response reveals host-specific virus infections in natural ant populations. Frontiers in Microbiology. 14, 1119002.","ieee":"L. Viljakainen et al., “Antiviral immune response reveals host-specific virus infections in natural ant populations,” Frontiers in Microbiology, vol. 14. Frontiers, 2023.","apa":"Viljakainen, L., Fürst, M., Grasse, A. V., Jurvansuu, J., Oh, J., Tolonen, L., … Cremer, S. (2023). Antiviral immune response reveals host-specific virus infections in natural ant populations. Frontiers in Microbiology. Frontiers. https://doi.org/10.3389/fmicb.2023.1119002"},"publication":"Frontiers in Microbiology","file_date_updated":"2023-04-17T07:49:09Z","article_number":"1119002","volume":14,"date_created":"2023-01-31T08:13:40Z","date_updated":"2023-08-01T12:39:58Z","author":[{"first_name":"Lumi","last_name":"Viljakainen","full_name":"Viljakainen, Lumi"},{"full_name":"Fürst, Matthias","orcid":"0000-0002-3712-925X","id":"393B1196-F248-11E8-B48F-1D18A9856A87","last_name":"Fürst","first_name":"Matthias"},{"full_name":"Grasse, Anna V","first_name":"Anna V","last_name":"Grasse","id":"406F989C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jaana","last_name":"Jurvansuu","full_name":"Jurvansuu, Jaana"},{"last_name":"Oh","first_name":"Jinook","orcid":"0000-0001-7425-2372","id":"403169A4-080F-11EA-9993-BF3F3DDC885E","full_name":"Oh, Jinook"},{"full_name":"Tolonen, Lassi","first_name":"Lassi","last_name":"Tolonen"},{"full_name":"Eder, Thomas","last_name":"Eder","first_name":"Thomas"},{"first_name":"Thomas","last_name":"Rattei","full_name":"Rattei, Thomas"},{"last_name":"Cremer","first_name":"Sylvia","orcid":"0000-0002-2193-3868","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","full_name":"Cremer, Sylvia"}],"department":[{"_id":"SyCr"}],"publisher":"Frontiers","publication_status":"published","pmid":1,"acknowledgement":"We thank D.J. Obbard for sharing the details of the dual RNA-seq/sRNA-seq approach, S.\r\nMetzler and R. Ferrigato for the photographs (Figure 1), M. Konrad, B. Casillas-Perez, C.D.\r\nPull and X. Espadaler for help with ant collection, and the Social Immunity Team at IST\r\nAustria, in particular J. Robb, A. Franschitz, E. Naderlinger, E. Dawson and B. Casillas-Perez\r\nfor support and comments on the manuscript. The study was funded by the Austrian Science\r\nFund (FWF; M02076-B25 to MAF) and the Academy of Finland (343022 to LV). ","year":"2023","publication_identifier":{"eissn":["1664-302X"]},"month":"03","language":[{"iso":"eng"}],"doi":"10.3389/fmicb.2023.1119002","project":[{"call_identifier":"FWF","name":"Viral pathogens and social immunity in ants","_id":"25DF61D8-B435-11E9-9278-68D0E5697425","grant_number":"M02076"}],"quality_controlled":"1","isi":1,"external_id":{"isi":["000961542100001"],"pmid":["PPR559293 "]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1},{"author":[{"last_name":"Boissonnat","first_name":"Jean-Daniel","full_name":"Boissonnat, Jean-Daniel"},{"full_name":"Dyer, Ramsay","first_name":"Ramsay","last_name":"Dyer"},{"last_name":"Ghosh","first_name":"Arijit","full_name":"Ghosh, Arijit"},{"orcid":"0000-0002-7472-2220","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken","first_name":"Mathijs","full_name":"Wintraecken, Mathijs"}],"date_created":"2023-01-16T10:04:06Z","date_updated":"2023-08-01T12:47:32Z","volume":69,"acknowledgement":"This work has been funded by the European Research Council under the European Union’s ERC Grant Agreement number 339025 GUDHI (Algorithmic Foundations of Geometric Understanding in Higher Dimensions). Arijit Ghosh is supported by Ramanujan Fellowship (No. SB/S2/RJN-064/2015). Part of this work was done when Arijit Ghosh was a Researcher at Max-Planck-Institute for Informatics, Germany, supported by the IndoGerman Max Planck Center for Computer Science (IMPECS). Mathijs Wintraecken also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411 and the Austrian Science Fund (FWF): M-3073. A part of the results described in this paper were presented at SoCG 2018 and in [3]. \r\nOpen access funding provided by the Austrian Science Fund (FWF).","year":"2023","publication_status":"published","publisher":"Springer Nature","department":[{"_id":"HeEd"}],"file_date_updated":"2023-02-02T11:01:10Z","ec_funded":1,"doi":"10.1007/s00454-022-00431-7","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000862193600001"]},"quality_controlled":"1","isi":1,"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"},{"name":"Learning and triangulating manifolds via collapses","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2","grant_number":"M03073"}],"month":"01","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"file":[{"success":1,"checksum":"46352e0ee71e460848f88685ca852681","date_created":"2023-02-02T11:01:10Z","date_updated":"2023-02-02T11:01:10Z","file_id":"12488","relation":"main_file","creator":"dernst","file_size":582850,"content_type":"application/pdf","access_level":"open_access","file_name":"2023_DiscreteCompGeometry_Boissonnat.pdf"}],"oa_version":"Published Version","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"12287","ddc":["510"],"title":"Local criteria for triangulating general manifolds","status":"public","intvolume":" 69","abstract":[{"text":"We present criteria for establishing a triangulation of a manifold. Given a manifold M, a simplicial complex A, and a map H from the underlying space of A to M, our criteria are presented in local coordinate charts for M, and ensure that H is a homeomorphism. These criteria do not require a differentiable structure, or even an explicit metric on M. No Delaunay property of A is assumed. The result provides a triangulation guarantee for algorithms that construct a simplicial complex by working in local coordinate patches. Because the criteria are easily verified in such a setting, they are expected to be of general use.","lang":"eng"}],"type":"journal_article","date_published":"2023-01-01T00:00:00Z","publication":"Discrete & Computational Geometry","citation":{"ista":"Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. 2023. Local criteria for triangulating general manifolds. Discrete & Computational Geometry. 69, 156–191.","ieee":"J.-D. Boissonnat, R. Dyer, A. Ghosh, and M. Wintraecken, “Local criteria for triangulating general manifolds,” Discrete & Computational Geometry, vol. 69. Springer Nature, pp. 156–191, 2023.","apa":"Boissonnat, J.-D., Dyer, R., Ghosh, A., & Wintraecken, M. (2023). Local criteria for triangulating general manifolds. Discrete & Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-022-00431-7","ama":"Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. Local criteria for triangulating general manifolds. Discrete & Computational Geometry. 2023;69:156-191. doi:10.1007/s00454-022-00431-7","chicago":"Boissonnat, Jean-Daniel, Ramsay Dyer, Arijit Ghosh, and Mathijs Wintraecken. “Local Criteria for Triangulating General Manifolds.” Discrete & Computational Geometry. Springer Nature, 2023. https://doi.org/10.1007/s00454-022-00431-7.","mla":"Boissonnat, Jean-Daniel, et al. “Local Criteria for Triangulating General Manifolds.” Discrete & Computational Geometry, vol. 69, Springer Nature, 2023, pp. 156–91, doi:10.1007/s00454-022-00431-7.","short":"J.-D. Boissonnat, R. Dyer, A. Ghosh, M. Wintraecken, Discrete & Computational Geometry 69 (2023) 156–191."},"article_type":"original","page":"156-191","day":"01","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","keyword":["Computational Theory and Mathematics","Discrete Mathematics and Combinatorics","Geometry and Topology","Theoretical Computer Science"]},{"date_published":"2023-02-01T00:00:00Z","publication":"Biochemical Society Transactions","citation":{"ieee":"F. Fäßler, M. Javoor, and F. K. Schur, “Deciphering the molecular mechanisms of actin cytoskeleton regulation in cell migration using cryo-EM,” Biochemical Society Transactions, vol. 51, no. 1. Portland Press, pp. 87–99, 2023.","apa":"Fäßler, F., Javoor, M., & Schur, F. K. (2023). Deciphering the molecular mechanisms of actin cytoskeleton regulation in cell migration using cryo-EM. Biochemical Society Transactions. Portland Press. https://doi.org/10.1042/bst20220221","ista":"Fäßler F, Javoor M, Schur FK. 2023. Deciphering the molecular mechanisms of actin cytoskeleton regulation in cell migration using cryo-EM. Biochemical Society Transactions. 51(1), 87–99.","ama":"Fäßler F, Javoor M, Schur FK. Deciphering the molecular mechanisms of actin cytoskeleton regulation in cell migration using cryo-EM. Biochemical Society Transactions. 2023;51(1):87-99. doi:10.1042/bst20220221","chicago":"Fäßler, Florian, Manjunath Javoor, and Florian KM Schur. “Deciphering the Molecular Mechanisms of Actin Cytoskeleton Regulation in Cell Migration Using Cryo-EM.” Biochemical Society Transactions. Portland Press, 2023. https://doi.org/10.1042/bst20220221.","short":"F. Fäßler, M. Javoor, F.K. Schur, Biochemical Society Transactions 51 (2023) 87–99.","mla":"Fäßler, Florian, et al. “Deciphering the Molecular Mechanisms of Actin Cytoskeleton Regulation in Cell Migration Using Cryo-EM.” Biochemical Society Transactions, vol. 51, no. 1, Portland Press, 2023, pp. 87–99, doi:10.1042/bst20220221."},"article_type":"original","page":"87-99","day":"01","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","keyword":["Biochemistry"],"file":[{"creator":"dernst","content_type":"application/pdf","file_size":10045006,"file_name":"2023_BioChemicalSocietyTransactions_Faessler.pdf","access_level":"open_access","date_created":"2023-03-16T07:58:16Z","date_updated":"2023-03-16T07:58:16Z","success":1,"checksum":"4e7069845e3dad22bb44fb71ec624c60","file_id":"12728","relation":"main_file"}],"oa_version":"Published Version","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"12421","ddc":["570"],"title":"Deciphering the molecular mechanisms of actin cytoskeleton regulation in cell migration using cryo-EM","status":"public","intvolume":" 51","abstract":[{"lang":"eng","text":"The actin cytoskeleton plays a key role in cell migration and cellular morphodynamics in most eukaryotes. The ability of the actin cytoskeleton to assemble and disassemble in a spatiotemporally controlled manner allows it to form higher-order structures, which can generate forces required for a cell to explore and navigate through its environment. It is regulated not only via a complex synergistic and competitive interplay between actin-binding proteins (ABP), but also by filament biochemistry and filament geometry. The lack of structural insights into how geometry and ABPs regulate the actin cytoskeleton limits our understanding of the molecular mechanisms that define actin cytoskeleton remodeling and, in turn, impact emerging cell migration characteristics. With the advent of cryo-electron microscopy (cryo-EM) and advanced computational methods, it is now possible to define these molecular mechanisms involving actin and its interactors at both atomic and ultra-structural levels in vitro and in cellulo. In this review, we will provide an overview of the available cryo-EM methods, applicable to further our understanding of the actin cytoskeleton, specifically in the context of cell migration. We will discuss how these methods have been employed to elucidate ABP- and geometry-defined regulatory mechanisms in initiating, maintaining, and disassembling cellular actin networks in migratory protrusions."}],"issue":"1","type":"journal_article","doi":"10.1042/bst20220221","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000926043100001"]},"isi":1,"quality_controlled":"1","project":[{"name":"Structure and isoform diversity of the Arp2/3 complex","_id":"9B954C5C-BA93-11EA-9121-9846C619BF3A","grant_number":"P33367"}],"month":"02","publication_identifier":{"issn":["0300-5127"],"eissn":["1470-8752"]},"author":[{"full_name":"Fäßler, Florian","orcid":"0000-0001-7149-769X","id":"404F5528-F248-11E8-B48F-1D18A9856A87","last_name":"Fäßler","first_name":"Florian"},{"last_name":"Javoor","first_name":"Manjunath","id":"305ab18b-dc7d-11ea-9b2f-b58195228ea2","full_name":"Javoor, Manjunath"},{"first_name":"Florian KM","last_name":"Schur","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4790-8078","full_name":"Schur, Florian KM"}],"date_updated":"2023-08-01T12:55:32Z","date_created":"2023-01-27T10:08:19Z","volume":51,"year":"2023","acknowledgement":"We apologize for not being able to mention and cite additional excellent work that would have fit the scope of this review, due to space restraints. We thank Jesse Hansen for comments on the manuscript. We acknowledge support from the Austrian Science Fund (FWF): P33367 and the Institute of Science and Technology Austria.","publication_status":"published","department":[{"_id":"FlSc"}],"publisher":"Portland Press","file_date_updated":"2023-03-16T07:58:16Z"},{"language":[{"iso":"eng"}],"doi":"10.1017/jfm.2022.1001","quality_controlled":"1","isi":1,"project":[{"name":"Revisiting the Turbulence Problem Using Statistical Mechanics: Experimental Studies on Transitional and Turbulent Flows","grant_number":"662960","_id":"238598C6-32DE-11EA-91FC-C7463DDC885E"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000903336600001"],"arxiv":["2101.07516"]},"oa":1,"month":"01","publication_identifier":{"eissn":["1469-7645"],"issn":["0022-1120"]},"date_updated":"2023-08-01T12:53:23Z","date_created":"2023-01-08T23:00:53Z","volume":954,"author":[{"id":"0BE7553A-1004-11EA-B805-18983DDC885E","first_name":"Elena","last_name":"Marensi","full_name":"Marensi, Elena"},{"first_name":"Gökhan","last_name":"Yalniz","id":"66E74FA2-D8BF-11E9-8249-8DE2E5697425","orcid":"0000-0002-8490-9312","full_name":"Yalniz, Gökhan"},{"last_name":"Hof","first_name":"Björn","orcid":"0000-0003-2057-2754","id":"3A374330-F248-11E8-B48F-1D18A9856A87","full_name":"Hof, Björn"},{"full_name":"Budanur, Nazmi B","first_name":"Nazmi B","last_name":"Budanur","id":"3EA1010E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0423-5010"}],"publication_status":"published","publisher":"Cambridge University Press","department":[{"_id":"BjHo"}],"year":"2023","acknowledgement":"E.M. acknowledges funding from the ISTplus fellowship programme. G.Y. and B.H. acknowledge\r\na grant from the Simons Foundation (662960, BH).","file_date_updated":"2023-02-02T12:34:54Z","article_number":"A10","date_published":"2023-01-10T00:00:00Z","article_type":"original","publication":"Journal of Fluid Mechanics","citation":{"ama":"Marensi E, Yalniz G, Hof B, Budanur NB. Symmetry-reduced dynamic mode decomposition of near-wall turbulence. Journal of Fluid Mechanics. 2023;954. doi:10.1017/jfm.2022.1001","apa":"Marensi, E., Yalniz, G., Hof, B., & Budanur, N. B. (2023). Symmetry-reduced dynamic mode decomposition of near-wall turbulence. Journal of Fluid Mechanics. Cambridge University Press. https://doi.org/10.1017/jfm.2022.1001","ieee":"E. Marensi, G. Yalniz, B. Hof, and N. B. Budanur, “Symmetry-reduced dynamic mode decomposition of near-wall turbulence,” Journal of Fluid Mechanics, vol. 954. Cambridge University Press, 2023.","ista":"Marensi E, Yalniz G, Hof B, Budanur NB. 2023. Symmetry-reduced dynamic mode decomposition of near-wall turbulence. Journal of Fluid Mechanics. 954, A10.","short":"E. Marensi, G. Yalniz, B. Hof, N.B. Budanur, Journal of Fluid Mechanics 954 (2023).","mla":"Marensi, Elena, et al. “Symmetry-Reduced Dynamic Mode Decomposition of near-Wall Turbulence.” Journal of Fluid Mechanics, vol. 954, A10, Cambridge University Press, 2023, doi:10.1017/jfm.2022.1001.","chicago":"Marensi, Elena, Gökhan Yalniz, Björn Hof, and Nazmi B Budanur. “Symmetry-Reduced Dynamic Mode Decomposition of near-Wall Turbulence.” Journal of Fluid Mechanics. Cambridge University Press, 2023. https://doi.org/10.1017/jfm.2022.1001."},"day":"10","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","scopus_import":"1","file":[{"access_level":"open_access","file_name":"2023_JourFluidMechanics_Marensi.pdf","content_type":"application/pdf","file_size":1931647,"creator":"dernst","relation":"main_file","file_id":"12489","checksum":"9224f987caefe5dd85a70814d3cce65c","success":1,"date_updated":"2023-02-02T12:34:54Z","date_created":"2023-02-02T12:34:54Z"}],"oa_version":"Published Version","ddc":["530"],"title":"Symmetry-reduced dynamic mode decomposition of near-wall turbulence","status":"public","intvolume":" 954","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"12105","abstract":[{"text":"Data-driven dimensionality reduction methods such as proper orthogonal decomposition and dynamic mode decomposition have proven to be useful for exploring complex phenomena within fluid dynamics and beyond. A well-known challenge for these techniques is posed by the continuous symmetries, e.g. translations and rotations, of the system under consideration, as drifts in the data dominate the modal expansions without providing an insight into the dynamics of the problem. In the present study, we address this issue for fluid flows in rectangular channels by formulating a continuous symmetry reduction method that eliminates the translations in the streamwise and spanwise directions simultaneously. We demonstrate our method by computing the symmetry-reduced dynamic mode decomposition (SRDMD) of sliding windows of data obtained from the transitional plane-Couette and turbulent plane-Poiseuille flow simulations. In the former setting, SRDMD captures the dynamics in the vicinity of the invariant solutions with translation symmetries, i.e. travelling waves and relative periodic orbits, whereas in the latter, our calculations reveal episodes of turbulent time evolution that can be approximated by a low-dimensional linear expansion.","lang":"eng"}],"type":"journal_article"},{"year":"2023","acknowledgement":"The authors of this article were supported by LMU Munich (J.B.W.W.), a James S. McDonnell Foundation postdoctoral fellowship (A.K.H.). P.N. received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (Grant agreement No. 770826 EE-Dynamics).\r\nWe thank participants in the 2019 Gordon Conference on Speciation for the extensive conversation on this topic. Thanks to Dan Funk for providing permission to use data from Funk et al. 2006, and for comments on the manuscript.","pmid":1,"publication_status":"published","department":[{"_id":"NiBa"}],"publisher":"Oxford University Press","author":[{"full_name":"Bolnick, Daniel I.","first_name":"Daniel I.","last_name":"Bolnick"},{"full_name":"Hund, Amanda K.","first_name":"Amanda K.","last_name":"Hund"},{"last_name":"Nosil","first_name":"Patrik","full_name":"Nosil, Patrik"},{"full_name":"Peng, Foen","first_name":"Foen","last_name":"Peng"},{"last_name":"Ravinet","first_name":"Mark","full_name":"Ravinet, Mark"},{"full_name":"Stankowski, Sean","last_name":"Stankowski","first_name":"Sean","id":"43161670-5719-11EA-8025-FABC3DDC885E"},{"last_name":"Subramanian","first_name":"Swapna","full_name":"Subramanian, Swapna"},{"last_name":"Wolf","first_name":"Jochen B.W.","full_name":"Wolf, Jochen B.W."},{"full_name":"Yukilevich, Roman","last_name":"Yukilevich","first_name":"Roman"}],"date_created":"2023-02-05T23:00:59Z","date_updated":"2023-08-01T12:58:30Z","volume":77,"month":"01","publication_identifier":{"eissn":["1558-5646"]},"external_id":{"pmid":["36622661"],"isi":["001021686300024"]},"oa":1,"main_file_link":[{"url":"https://doi.org/10.1093/evolut/qpac004","open_access":"1"}],"quality_controlled":"1","isi":1,"doi":"10.1093/evolut/qpac004","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"text":"The concept of a “speciation continuum” has gained popularity in recent decades. It emphasizes speciation as a continuous process that may be studied by comparing contemporary population pairs that show differing levels of divergence. In their recent perspective article in Evolution, Stankowski and Ravinet provided a valuable service by formally defining the speciation continuum as a continuum of reproductive isolation, based on opinions gathered from a survey of speciation researchers. While we agree that the speciation continuum has been a useful concept to advance the understanding of the speciation process, some intrinsic limitations exist. Here, we advocate for a multivariate extension, the speciation hypercube, first proposed by Dieckmann et al. in 2004, but rarely used since. We extend the idea of the speciation cube and suggest it has strong conceptual and practical advantages over a one-dimensional model. We illustrate how the speciation hypercube can be used to visualize and compare different speciation trajectories, providing new insights into the processes and mechanisms of speciation. A key strength of the speciation hypercube is that it provides a unifying framework for speciation research, as it allows questions from apparently disparate subfields to be addressed in a single conceptual model.","lang":"eng"}],"issue":"1","_id":"12514","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","title":"A multivariate view of the speciation continuum","intvolume":" 77","oa_version":"Published Version","scopus_import":"1","day":"01","article_processing_charge":"No","publication":"Evolution: International journal of organic evolution","citation":{"mla":"Bolnick, Daniel I., et al. “A Multivariate View of the Speciation Continuum.” Evolution: International Journal of Organic Evolution, vol. 77, no. 1, Oxford University Press, 2023, pp. 318–28, doi:10.1093/evolut/qpac004.","short":"D.I. Bolnick, A.K. Hund, P. Nosil, F. Peng, M. Ravinet, S. Stankowski, S. Subramanian, J.B.W. Wolf, R. Yukilevich, Evolution: International Journal of Organic Evolution 77 (2023) 318–328.","chicago":"Bolnick, Daniel I., Amanda K. Hund, Patrik Nosil, Foen Peng, Mark Ravinet, Sean Stankowski, Swapna Subramanian, Jochen B.W. Wolf, and Roman Yukilevich. “A Multivariate View of the Speciation Continuum.” Evolution: International Journal of Organic Evolution. Oxford University Press, 2023. https://doi.org/10.1093/evolut/qpac004.","ama":"Bolnick DI, Hund AK, Nosil P, et al. A multivariate view of the speciation continuum. Evolution: International journal of organic evolution. 2023;77(1):318-328. doi:10.1093/evolut/qpac004","ista":"Bolnick DI, Hund AK, Nosil P, Peng F, Ravinet M, Stankowski S, Subramanian S, Wolf JBW, Yukilevich R. 2023. A multivariate view of the speciation continuum. Evolution: International journal of organic evolution. 77(1), 318–328.","apa":"Bolnick, D. I., Hund, A. K., Nosil, P., Peng, F., Ravinet, M., Stankowski, S., … Yukilevich, R. (2023). A multivariate view of the speciation continuum. Evolution: International Journal of Organic Evolution. Oxford University Press. https://doi.org/10.1093/evolut/qpac004","ieee":"D. I. Bolnick et al., “A multivariate view of the speciation continuum,” Evolution: International journal of organic evolution, vol. 77, no. 1. Oxford University Press, pp. 318–328, 2023."},"article_type":"original","page":"318-328","date_published":"2023-01-01T00:00:00Z"},{"month":"02","publication_identifier":{"eisbn":["9798350346091"],"eissn":["2375-9259"]},"language":[{"iso":"eng"}],"conference":{"location":"Orlando, FL, United States","start_date":"2022-11-28","end_date":"2022-12-01","name":"ICDMW: Conference on Data Mining Workshops"},"doi":"10.1109/icdmw58026.2022.00093","quality_controlled":"1","isi":1,"external_id":{"isi":["000971492200145"]},"oa":1,"file_date_updated":"2023-02-14T07:58:26Z","article_number":"00093","date_created":"2023-02-14T07:56:21Z","date_updated":"2023-08-01T13:15:48Z","author":[{"full_name":"Forghani, Mohammad","last_name":"Forghani","first_name":"Mohammad"},{"first_name":"Christophe","last_name":"Claramunt","full_name":"Claramunt, Christophe"},{"first_name":"Farid","last_name":"Karimipour","id":"2A2BCDC4-CF62-11E9-BE5E-3B1EE6697425","orcid":"0000-0001-6746-4174","full_name":"Karimipour, Farid"},{"last_name":"Heiler","first_name":"Georg","full_name":"Heiler, Georg"}],"publication_status":"published","publisher":"Institute of Electrical and Electronics Engineers","department":[{"_id":"HeEd"}],"year":"2023","day":"08","has_accepted_license":"1","article_processing_charge":"No","date_published":"2023-02-08T00:00:00Z","publication":"2022 IEEE International Conference on Data Mining Workshops","citation":{"short":"M. Forghani, C. Claramunt, F. Karimipour, G. Heiler, in:, 2022 IEEE International Conference on Data Mining Workshops, Institute of Electrical and Electronics Engineers, 2023.","mla":"Forghani, Mohammad, et al. “Visual Analytics of Mobility Network Changes Observed Using Mobile Phone Data during COVID-19 Pandemic.” 2022 IEEE International Conference on Data Mining Workshops, 00093, Institute of Electrical and Electronics Engineers, 2023, doi:10.1109/icdmw58026.2022.00093.","chicago":"Forghani, Mohammad, Christophe Claramunt, Farid Karimipour, and Georg Heiler. “Visual Analytics of Mobility Network Changes Observed Using Mobile Phone Data during COVID-19 Pandemic.” In 2022 IEEE International Conference on Data Mining Workshops. Institute of Electrical and Electronics Engineers, 2023. https://doi.org/10.1109/icdmw58026.2022.00093.","ama":"Forghani M, Claramunt C, Karimipour F, Heiler G. Visual analytics of mobility network changes observed using mobile phone data during COVID-19 pandemic. In: 2022 IEEE International Conference on Data Mining Workshops. Institute of Electrical and Electronics Engineers; 2023. doi:10.1109/icdmw58026.2022.00093","apa":"Forghani, M., Claramunt, C., Karimipour, F., & Heiler, G. (2023). Visual analytics of mobility network changes observed using mobile phone data during COVID-19 pandemic. In 2022 IEEE International Conference on Data Mining Workshops. Orlando, FL, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/icdmw58026.2022.00093","ieee":"M. Forghani, C. Claramunt, F. Karimipour, and G. Heiler, “Visual analytics of mobility network changes observed using mobile phone data during COVID-19 pandemic,” in 2022 IEEE International Conference on Data Mining Workshops, Orlando, FL, United States, 2023.","ista":"Forghani M, Claramunt C, Karimipour F, Heiler G. 2023. Visual analytics of mobility network changes observed using mobile phone data during COVID-19 pandemic. 2022 IEEE International Conference on Data Mining Workshops. ICDMW: Conference on Data Mining Workshops, 00093."},"abstract":[{"lang":"eng","text":"The limited exchange between human communities is a key factor in preventing the spread of COVID-19. This paper introduces a digital framework that combines an integration of real mobility data at the country scale with a series of modeling techniques and visual capabilities that highlight mobility patterns before and during the pandemic. The findings not only significantly exhibit mobility trends and different degrees of similarities at regional and local levels but also provide potential insight into the emergence of a pandemic on human behavior patterns and their likely socio-economic impacts."}],"type":"conference","file":[{"file_name":"Visual Analysis_Mobility_COVID19 - SocDM2022.pdf","access_level":"open_access","creator":"fkarimip","file_size":1183339,"content_type":"application/pdf","file_id":"12549","relation":"main_file","date_updated":"2023-02-14T07:58:26Z","date_created":"2023-02-14T07:58:26Z","success":1,"checksum":"c253bee25e6dfe484f96662daa119cb6"}],"oa_version":"Submitted Version","title":"Visual analytics of mobility network changes observed using mobile phone data during COVID-19 pandemic","ddc":["600"],"status":"public","_id":"12548","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"},{"keyword":["General Mathematics","General Computer Science"],"scopus_import":"1","article_processing_charge":"No","day":"01","page":"38-79","article_type":"original","citation":{"mla":"Krokhin, Andrei, et al. “Topology and Adjunction in Promise Constraint Satisfaction.” SIAM Journal on Computing, vol. 52, no. 1, Society for Industrial & Applied Mathematics, 2023, pp. 38–79, doi:10.1137/20m1378223.","short":"A. Krokhin, J. Opršal, M. Wrochna, S. Živný, SIAM Journal on Computing 52 (2023) 38–79.","chicago":"Krokhin, Andrei, Jakub Opršal, Marcin Wrochna, and Stanislav Živný. “Topology and Adjunction in Promise Constraint Satisfaction.” SIAM Journal on Computing. Society for Industrial & Applied Mathematics, 2023. https://doi.org/10.1137/20m1378223.","ama":"Krokhin A, Opršal J, Wrochna M, Živný S. Topology and adjunction in promise constraint satisfaction. SIAM Journal on Computing. 2023;52(1):38-79. doi:10.1137/20m1378223","ista":"Krokhin A, Opršal J, Wrochna M, Živný S. 2023. Topology and adjunction in promise constraint satisfaction. SIAM Journal on Computing. 52(1), 38–79.","ieee":"A. Krokhin, J. Opršal, M. Wrochna, and S. Živný, “Topology and adjunction in promise constraint satisfaction,” SIAM Journal on Computing, vol. 52, no. 1. Society for Industrial & Applied Mathematics, pp. 38–79, 2023.","apa":"Krokhin, A., Opršal, J., Wrochna, M., & Živný, S. (2023). Topology and adjunction in promise constraint satisfaction. SIAM Journal on Computing. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/20m1378223"},"publication":"SIAM Journal on Computing","date_published":"2023-01-01T00:00:00Z","type":"journal_article","issue":"1","abstract":[{"lang":"eng","text":"he approximate graph coloring problem, whose complexity is unresolved in most cases, concerns finding a c-coloring of a graph that is promised to be k-colorable, where c≥k. This problem naturally generalizes to promise graph homomorphism problems and further to promise constraint satisfaction problems. The complexity of these problems has recently been studied through an algebraic approach. In this paper, we introduce two new techniques to analyze the complexity of promise CSPs: one is based on topology and the other on adjunction. We apply these techniques, together with the previously introduced algebraic approach, to obtain new unconditional NP-hardness results for a significant class of approximate graph coloring and promise graph homomorphism problems."}],"intvolume":" 52","status":"public","title":"Topology and adjunction in promise constraint satisfaction","_id":"12563","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Preprint","publication_identifier":{"issn":["0097-5397"],"eissn":["1095-7111"]},"month":"01","project":[{"grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020"}],"isi":1,"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2003.11351"}],"external_id":{"arxiv":["2003.11351"],"isi":["000955000000001"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1137/20m1378223","ec_funded":1,"publisher":"Society for Industrial & Applied Mathematics","department":[{"_id":"UlWa"}],"publication_status":"published","year":"2023","acknowledgement":"Andrei Krokhin and Jakub Opršal were supported by the UK EPSRC grant EP/R034516/1. Jakub Opršal has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No 101034413. Stanislav Živný was supported by a Royal Society University Research Fellowship. 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 714532). The paper re\u001eects only the authors’ views and not the views of the ERC or the European Commission. ","volume":52,"date_created":"2023-02-16T07:03:52Z","date_updated":"2023-08-01T13:11:30Z","author":[{"last_name":"Krokhin","first_name":"Andrei","full_name":"Krokhin, Andrei"},{"full_name":"Opršal, Jakub","last_name":"Opršal","first_name":"Jakub","orcid":"0000-0003-1245-3456","id":"ec596741-c539-11ec-b829-c79322a91242"},{"full_name":"Wrochna, Marcin","last_name":"Wrochna","first_name":"Marcin"},{"last_name":"Živný","first_name":"Stanislav","full_name":"Živný, Stanislav"}]},{"date_updated":"2023-08-01T13:09:45Z","date_created":"2023-02-12T23:00:59Z","volume":107,"author":[{"id":"441e7207-f91f-11ec-b67c-9e6fe3d8fd6d","first_name":"Mauricio Nicolas","last_name":"Rojas Vega","full_name":"Rojas Vega, Mauricio Nicolas"},{"full_name":"De Castro, Pablo","last_name":"De Castro","first_name":"Pablo"},{"full_name":"Soto, Rodrigo","last_name":"Soto","first_name":"Rodrigo"}],"publication_status":"published","publisher":"American Physical Society","department":[{"_id":"GradSch"}],"year":"2023","acknowledgement":"MR-V and RS are supported by Fondecyt Grant No. 1220536 and ANID – Millennium Science Initiative Program – NCN19 170D, Chile. PdC is supported by grant #2021/10139-2, Sao Paulo Research Foundation (FAPESP), Brazil.","article_number":"014608","language":[{"iso":"eng"}],"doi":"10.1103/PhysRevE.107.014608","isi":1,"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2301.01856"}],"external_id":{"isi":["000963909800006"],"arxiv":["2301.01856"]},"oa":1,"month":"01","publication_identifier":{"eissn":["2470-0053"],"issn":["2470-0045"]},"oa_version":"Preprint","title":"Wetting dynamics by mixtures of fast and slow self-propelled particles","status":"public","intvolume":" 107","_id":"12545","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","abstract":[{"lang":"eng","text":"We study active surface wetting using a minimal model of bacteria that takes into account the intrinsic motility diversity of living matter. A mixture of “fast” and “slow” self-propelled Brownian particles is considered in the presence of a wall. The evolution of the wetting layer thickness shows an overshoot before stationarity and its composition evolves in two stages, equilibrating after a slow elimination of excess particles. Nonmonotonic evolutions are shown to arise from delayed avalanches towards the dilute phase combined with the emergence of a transient particle front."}],"issue":"1","type":"journal_article","date_published":"2023-01-24T00:00:00Z","article_type":"original","publication":"Physical Review E","citation":{"ama":"Rojas Vega MN, De Castro P, Soto R. Wetting dynamics by mixtures of fast and slow self-propelled particles. Physical Review E. 2023;107(1). doi:10.1103/PhysRevE.107.014608","ista":"Rojas Vega MN, De Castro P, Soto R. 2023. Wetting dynamics by mixtures of fast and slow self-propelled particles. Physical Review E. 107(1), 014608.","apa":"Rojas Vega, M. N., De Castro, P., & Soto, R. (2023). Wetting dynamics by mixtures of fast and slow self-propelled particles. Physical Review E. American Physical Society. https://doi.org/10.1103/PhysRevE.107.014608","ieee":"M. N. Rojas Vega, P. De Castro, and R. Soto, “Wetting dynamics by mixtures of fast and slow self-propelled particles,” Physical Review E, vol. 107, no. 1. American Physical Society, 2023.","mla":"Rojas Vega, Mauricio Nicolas, et al. “Wetting Dynamics by Mixtures of Fast and Slow Self-Propelled Particles.” Physical Review E, vol. 107, no. 1, 014608, American Physical Society, 2023, doi:10.1103/PhysRevE.107.014608.","short":"M.N. Rojas Vega, P. De Castro, R. Soto, Physical Review E 107 (2023).","chicago":"Rojas Vega, Mauricio Nicolas, Pablo De Castro, and Rodrigo Soto. “Wetting Dynamics by Mixtures of Fast and Slow Self-Propelled Particles.” Physical Review E. American Physical Society, 2023. https://doi.org/10.1103/PhysRevE.107.014608."},"day":"24","article_processing_charge":"No","scopus_import":"1"},{"type":"journal_article","issue":"3","abstract":[{"text":"Let k be a number field and X a smooth, geometrically integral quasi-projective variety over k. For any linear algebraic group G over k and any G-torsor g : Z → X, we observe that if the étale-Brauer obstruction is the only one for strong approximation off a finite set of places S for all twists of Z by elements in H^1(k, G), then the étale-Brauer obstruction is the only one for strong approximation off a finite set of places S for X. As an application, we show that any homogeneous space of the form G/H with G a connected linear algebraic group over k satisfies strong approximation off the infinite places with étale-Brauer obstruction, under some compactness assumptions when k is totally real. We also prove more refined strong approximation results for homogeneous spaces of the form G/H with G semisimple simply connected and H finite, using the theory of torsors and descent.","lang":"eng"}],"_id":"12427","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":" 151","status":"public","title":"Some remarks on strong approximation and applications to homogeneous spaces of linear algebraic groups","oa_version":"Preprint","scopus_import":"1","article_processing_charge":"No","day":"01","citation":{"ieee":"F. Balestrieri, “Some remarks on strong approximation and applications to homogeneous spaces of linear algebraic groups,” Proceedings of the American Mathematical Society, vol. 151, no. 3. American Mathematical Society, pp. 907–914, 2023.","apa":"Balestrieri, F. (2023). Some remarks on strong approximation and applications to homogeneous spaces of linear algebraic groups. Proceedings of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/proc/15239","ista":"Balestrieri F. 2023. Some remarks on strong approximation and applications to homogeneous spaces of linear algebraic groups. Proceedings of the American Mathematical Society. 151(3), 907–914.","ama":"Balestrieri F. Some remarks on strong approximation and applications to homogeneous spaces of linear algebraic groups. Proceedings of the American Mathematical Society. 2023;151(3):907-914. doi:10.1090/proc/15239","chicago":"Balestrieri, Francesca. “Some Remarks on Strong Approximation and Applications to Homogeneous Spaces of Linear Algebraic Groups.” Proceedings of the American Mathematical Society. American Mathematical Society, 2023. https://doi.org/10.1090/proc/15239.","short":"F. Balestrieri, Proceedings of the American Mathematical Society 151 (2023) 907–914.","mla":"Balestrieri, Francesca. “Some Remarks on Strong Approximation and Applications to Homogeneous Spaces of Linear Algebraic Groups.” Proceedings of the American Mathematical Society, vol. 151, no. 3, American Mathematical Society, 2023, pp. 907–14, doi:10.1090/proc/15239."},"publication":"Proceedings of the American Mathematical Society","page":"907-914","article_type":"original","date_published":"2023-01-01T00:00:00Z","year":"2023","publisher":"American Mathematical Society","department":[{"_id":"TiBr"}],"publication_status":"published","author":[{"id":"3ACCD756-F248-11E8-B48F-1D18A9856A87","first_name":"Francesca","last_name":"Balestrieri","full_name":"Balestrieri, Francesca"}],"volume":151,"date_updated":"2023-08-01T13:03:32Z","date_created":"2023-01-29T23:00:58Z","publication_identifier":{"issn":["0002-9939"],"eissn":["1088-6826"]},"month":"01","main_file_link":[{"url":"https://hal.science/hal-03013498/","open_access":"1"}],"oa":1,"external_id":{"isi":["000898440000001"]},"isi":1,"quality_controlled":"1","doi":"10.1090/proc/15239","language":[{"iso":"eng"}]},{"publication_identifier":{"eissn":["1422-0067"]},"month":"01","isi":1,"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000930324700001"]},"language":[{"iso":"eng"}],"doi":"10.3390/ijms24032128","article_number":"2128","file_date_updated":"2023-02-20T07:09:27Z","department":[{"_id":"PeJo"}],"publisher":"MDPI","publication_status":"published","acknowledgement":"This work has been supported by funding of the German Research Foundation (Deutsche Forschungsgemeinschaft [DFG], CRC 166, Project B06 to M.H. and A.-L.S., FOR 3004 SYNABS P1 to M.H.) and by the Interdisciplinary Clinical Research Center (IZKF) Würzburg (Z-3/69 to M.M.P., N-229 to M.H. and A.-L.S.). A.M. is funded by the University of Leipzig Clinician Scientist Program.","year":"2023","volume":24,"date_updated":"2023-08-01T13:16:36Z","date_created":"2023-02-19T23:00:56Z","author":[{"full_name":"Mrestani, Achmed","first_name":"Achmed","last_name":"Mrestani"},{"full_name":"Lichter, Katharina","first_name":"Katharina","last_name":"Lichter","id":"39302e62-fcfc-11ec-8196-8b01447dbd3d"},{"full_name":"Sirén, Anna Leena","first_name":"Anna Leena","last_name":"Sirén"},{"full_name":"Heckmann, Manfred","last_name":"Heckmann","first_name":"Manfred"},{"first_name":"Mila M.","last_name":"Paul","full_name":"Paul, Mila M."},{"full_name":"Pauli, Martin","first_name":"Martin","last_name":"Pauli"}],"scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"21","article_type":"original","citation":{"chicago":"Mrestani, Achmed, Katharina Lichter, Anna Leena Sirén, Manfred Heckmann, Mila M. Paul, and Martin Pauli. “Single-Molecule Localization Microscopy of Presynaptic Active Zones in Drosophila Melanogaster after Rapid Cryofixation.” International Journal of Molecular Sciences. MDPI, 2023. https://doi.org/10.3390/ijms24032128.","mla":"Mrestani, Achmed, et al. “Single-Molecule Localization Microscopy of Presynaptic Active Zones in Drosophila Melanogaster after Rapid Cryofixation.” International Journal of Molecular Sciences, vol. 24, no. 3, 2128, MDPI, 2023, doi:10.3390/ijms24032128.","short":"A. Mrestani, K. Lichter, A.L. Sirén, M. Heckmann, M.M. Paul, M. Pauli, International Journal of Molecular Sciences 24 (2023).","ista":"Mrestani A, Lichter K, Sirén AL, Heckmann M, Paul MM, Pauli M. 2023. Single-molecule localization microscopy of presynaptic active zones in Drosophila melanogaster after rapid cryofixation. International Journal of Molecular Sciences. 24(3), 2128.","ieee":"A. Mrestani, K. Lichter, A. L. Sirén, M. Heckmann, M. M. Paul, and M. Pauli, “Single-molecule localization microscopy of presynaptic active zones in Drosophila melanogaster after rapid cryofixation,” International Journal of Molecular Sciences, vol. 24, no. 3. MDPI, 2023.","apa":"Mrestani, A., Lichter, K., Sirén, A. L., Heckmann, M., Paul, M. M., & Pauli, M. (2023). Single-molecule localization microscopy of presynaptic active zones in Drosophila melanogaster after rapid cryofixation. International Journal of Molecular Sciences. MDPI. https://doi.org/10.3390/ijms24032128","ama":"Mrestani A, Lichter K, Sirén AL, Heckmann M, Paul MM, Pauli M. Single-molecule localization microscopy of presynaptic active zones in Drosophila melanogaster after rapid cryofixation. International Journal of Molecular Sciences. 2023;24(3). doi:10.3390/ijms24032128"},"publication":"International Journal of Molecular Sciences","date_published":"2023-01-21T00:00:00Z","type":"journal_article","issue":"3","abstract":[{"lang":"eng","text":"Single-molecule localization microscopy (SMLM) greatly advances structural studies of diverse biological tissues. For example, presynaptic active zone (AZ) nanotopology is resolved in increasing detail. Immunofluorescence imaging of AZ proteins usually relies on epitope preservation using aldehyde-based immunocompetent fixation. Cryofixation techniques, such as high-pressure freezing (HPF) and freeze substitution (FS), are widely used for ultrastructural studies of presynaptic architecture in electron microscopy (EM). HPF/FS demonstrated nearer-to-native preservation of AZ ultrastructure, e.g., by facilitating single filamentous structures. Here, we present a protocol combining the advantages of HPF/FS and direct stochastic optical reconstruction microscopy (dSTORM) to quantify nanotopology of the AZ scaffold protein Bruchpilot (Brp) at neuromuscular junctions (NMJs) of Drosophila melanogaster. Using this standardized model, we tested for preservation of Brp clusters in different FS protocols compared to classical aldehyde fixation. In HPF/FS samples, presynaptic boutons were structurally well preserved with ~22% smaller Brp clusters that allowed quantification of subcluster topology. In summary, we established a standardized near-to-native preparation and immunohistochemistry protocol for SMLM analyses of AZ protein clusters in a defined model synapse. Our protocol could be adapted to study protein arrangements at single-molecule resolution in other intact tissue preparations."}],"intvolume":" 24","status":"public","title":"Single-molecule localization microscopy of presynaptic active zones in Drosophila melanogaster after rapid cryofixation","ddc":["570"],"_id":"12567","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"file_size":2823025,"content_type":"application/pdf","creator":"dernst","file_name":"2023_IJMS_Mrestani.pdf","access_level":"open_access","date_updated":"2023-02-20T07:09:27Z","date_created":"2023-02-20T07:09:27Z","checksum":"69a35dcd3e0249f902ab881b06ee2e58","success":1,"relation":"main_file","file_id":"12569"}],"oa_version":"Published Version"},{"file":[{"file_id":"12570","relation":"main_file","date_updated":"2023-02-20T07:30:20Z","date_created":"2023-02-20T07:30:20Z","success":1,"checksum":"b27c5290f2f1500c403494364ee39c9f","file_name":"2023_TheoreticalCompScience_Alistarh.pdf","access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":602333}],"oa_version":"Published Version","_id":"12566","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Wait-free approximate agreement on graphs","status":"public","ddc":["000"],"intvolume":" 948","abstract":[{"lang":"eng","text":"Approximate agreement is one of the few variants of consensus that can be solved in a wait-free manner in asynchronous systems where processes communicate by reading and writing to shared memory. In this work, we consider a natural generalisation of approximate agreement on arbitrary undirected connected graphs. Each process is given a node of the graph as input and, if non-faulty, must output a node such that\r\n– all the outputs are within distance 1 of one another, and\r\n– each output value lies on a shortest path between two input values.\r\nFrom prior work, it is known that there is no wait-free algorithm among processes for this problem on any cycle of length , by reduction from 2-set agreement (Castañeda et al., 2018).\r\n\r\nIn this work, we investigate the solvability of this task on general graphs. We give a new, direct proof of the impossibility of approximate agreement on cycles of length , via a generalisation of Sperner's Lemma to convex polygons. We also extend the reduction from 2-set agreement to a larger class of graphs, showing that approximate agreement on these graphs is unsolvable. On the positive side, we present a wait-free algorithm for a different class of graphs, which properly contains the class of chordal graphs."}],"issue":"2","type":"journal_article","date_published":"2023-02-28T00:00:00Z","publication":"Theoretical Computer Science","citation":{"ama":"Alistarh D-A, Ellen F, Rybicki J. Wait-free approximate agreement on graphs. Theoretical Computer Science. 2023;948(2). doi:10.1016/j.tcs.2023.113733","ista":"Alistarh D-A, Ellen F, Rybicki J. 2023. Wait-free approximate agreement on graphs. Theoretical Computer Science. 948(2), 113733.","apa":"Alistarh, D.-A., Ellen, F., & Rybicki, J. (2023). Wait-free approximate agreement on graphs. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2023.113733","ieee":"D.-A. Alistarh, F. Ellen, and J. Rybicki, “Wait-free approximate agreement on graphs,” Theoretical Computer Science, vol. 948, no. 2. Elsevier, 2023.","mla":"Alistarh, Dan-Adrian, et al. “Wait-Free Approximate Agreement on Graphs.” Theoretical Computer Science, vol. 948, no. 2, 113733, Elsevier, 2023, doi:10.1016/j.tcs.2023.113733.","short":"D.-A. Alistarh, F. Ellen, J. Rybicki, Theoretical Computer Science 948 (2023).","chicago":"Alistarh, Dan-Adrian, Faith Ellen, and Joel Rybicki. “Wait-Free Approximate Agreement on Graphs.” Theoretical Computer Science. Elsevier, 2023. https://doi.org/10.1016/j.tcs.2023.113733."},"article_type":"original","day":"28","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","scopus_import":"1","author":[{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"},{"full_name":"Ellen, Faith","last_name":"Ellen","first_name":"Faith"},{"first_name":"Joel","last_name":"Rybicki","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6432-6646","full_name":"Rybicki, Joel"}],"date_created":"2023-02-19T23:00:55Z","date_updated":"2023-08-01T13:17:20Z","volume":948,"year":"2023","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) and under the Marie Skłodowska-Curie grant agreement No. 840605 and from the Natural Sciences and Engineering Research Council of Canada grant RGPIN-2020-04178. Part of this work was done while Faith Ellen was visiting IST Austria.","publication_status":"published","publisher":"Elsevier","department":[{"_id":"DaAl"}],"file_date_updated":"2023-02-20T07:30:20Z","ec_funded":1,"article_number":"113733","doi":"10.1016/j.tcs.2023.113733","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000934262700001"]},"quality_controlled":"1","isi":1,"project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020"},{"_id":"26A5D39A-B435-11E9-9278-68D0E5697425","grant_number":"840605","call_identifier":"H2020","name":"Coordination in constrained and natural distributed systems"}],"month":"02","publication_identifier":{"issn":["0304-3975"]}},{"day":"19","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","date_published":"2023-01-19T00:00:00Z","publication":"Annual Review of Fluid Mechanics","citation":{"chicago":"Dubief, Yves, Vincent E. Terrapon, and Björn Hof. “Elasto-Inertial Turbulence.” Annual Review of Fluid Mechanics. Annual Reviews, 2023. https://doi.org/10.1146/annurev-fluid-032822-025933.","mla":"Dubief, Yves, et al. “Elasto-Inertial Turbulence.” Annual Review of Fluid Mechanics, vol. 55, no. 1, Annual Reviews, 2023, pp. 675–705, doi:10.1146/annurev-fluid-032822-025933.","short":"Y. Dubief, V.E. Terrapon, B. Hof, Annual Review of Fluid Mechanics 55 (2023) 675–705.","ista":"Dubief Y, Terrapon VE, Hof B. 2023. Elasto-inertial turbulence. Annual Review of Fluid Mechanics. 55(1), 675–705.","apa":"Dubief, Y., Terrapon, V. E., & Hof, B. (2023). Elasto-inertial turbulence. Annual Review of Fluid Mechanics. Annual Reviews. https://doi.org/10.1146/annurev-fluid-032822-025933","ieee":"Y. Dubief, V. E. Terrapon, and B. Hof, “Elasto-inertial turbulence,” Annual Review of Fluid Mechanics, vol. 55, no. 1. Annual Reviews, pp. 675–705, 2023.","ama":"Dubief Y, Terrapon VE, Hof B. Elasto-inertial turbulence. Annual Review of Fluid Mechanics. 2023;55(1):675-705. doi:10.1146/annurev-fluid-032822-025933"},"article_type":"original","page":"675-705","abstract":[{"text":"The dissolution of minute concentration of polymers in wall-bounded flows is well-known for its unparalleled ability to reduce turbulent friction drag. Another phenomenon, elasto-inertial turbulence (EIT), has been far less studied even though elastic instabilities have already been observed in dilute polymer solutions before the discovery of polymer drag reduction. EIT is a chaotic state driven by polymer dynamics that is observed across many orders of magnitude in Reynolds number. It involves energy transfer from small elastic scales to large flow scales. The investigation of the mechanisms of EIT offers the possibility to better understand other complex phenomena such as elastic turbulence and maximum drag reduction. In this review, we survey recent research efforts that are advancing the understanding of the dynamics of EIT. We highlight the fundamental differences between EIT and Newtonian/inertial turbulence from the perspective of experiments, numerical simulations, instabilities, and coherent structures. Finally, we discuss the possible links between EIT and elastic turbulence and polymer drag reduction, as well as the remaining challenges in unraveling the self-sustaining mechanism of EIT.","lang":"eng"}],"issue":"1","type":"journal_article","oa_version":"Published Version","file":[{"creator":"dernst","file_size":4036706,"content_type":"application/pdf","file_name":"2023_AnnReviewFluidMech_Dubief.pdf","access_level":"open_access","date_created":"2023-02-27T09:23:02Z","date_updated":"2023-02-27T09:23:02Z","success":1,"checksum":"2666aa3af2a25252d35eb8681d3edff7","file_id":"12690","relation":"main_file"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"12681","title":"Elasto-inertial turbulence","ddc":["530"],"status":"public","intvolume":" 55","month":"01","publication_identifier":{"eissn":["1545-4479"],"issn":["0066-4189"]},"doi":"10.1146/annurev-fluid-032822-025933","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000915418100026"]},"isi":1,"quality_controlled":"1","file_date_updated":"2023-02-27T09:23:02Z","author":[{"first_name":"Yves","last_name":"Dubief","full_name":"Dubief, Yves"},{"first_name":"Vincent E.","last_name":"Terrapon","full_name":"Terrapon, Vincent E."},{"orcid":"0000-0003-2057-2754","id":"3A374330-F248-11E8-B48F-1D18A9856A87","last_name":"Hof","first_name":"Björn","full_name":"Hof, Björn"}],"date_updated":"2023-08-01T13:19:47Z","date_created":"2023-02-26T23:01:01Z","volume":55,"acknowledgement":"Part of the material presented here is based upon work supported by the National Science Foundation CBET (Chemical, Bioengineering, Environmental and Transport Systems) award 1805636 (to Y.D.), the Binational Science Foundation award 2016145 (to Y.D. and Victor Steinberg), a FRIA (Fund for Research Training in Industry and Agriculture) grant of the Belgian F.R.S.-FNRS (National Fund for Scientific Research) (to V.E.T.), the Marie Curie FP7 Career Integration grant PCIG10-GA-2011-304073 (to V.E.T.), and the Fonds spéciaux pour la recherche grant C-13/19 of the University of Liege (to V.E.T.). Computational resources have been provided by the Consortium des Équipements de Calcul Intensif (CECI) funded by the Belgian F.R.S.-FNRS, the Vermont Advanced Computing Center (VACC), the Partnership for Advanced Computing in Europe (PRACE), and the Tier-1 supercomputer of the Fédération Wallonie-Bruxelles funded by the Walloon Region (grant agreement 117545).","year":"2023","publication_status":"published","department":[{"_id":"BjHo"}],"publisher":"Annual Reviews"},{"language":[{"iso":"eng"}],"doi":"10.1146/annurev-fluid-120720-025957","isi":1,"quality_controlled":"1","project":[{"name":"Revisiting the Turbulence Problem Using Statistical Mechanics: Experimental Studies on Transitional and Turbulent Flows","grant_number":"662960","_id":"238598C6-32DE-11EA-91FC-C7463DDC885E"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000915418100023"]},"month":"01","publication_identifier":{"issn":["0066-4189"]},"date_updated":"2023-08-01T13:20:30Z","date_created":"2023-02-26T23:01:01Z","volume":55,"author":[{"first_name":"Marc","last_name":"Avila","full_name":"Avila, Marc"},{"last_name":"Barkley","first_name":"Dwight","full_name":"Barkley, Dwight"},{"full_name":"Hof, Björn","last_name":"Hof","first_name":"Björn","orcid":"0000-0003-2057-2754","id":"3A374330-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","department":[{"_id":"BjHo"}],"publisher":"Annual Reviews","acknowledgement":"The authors are very grateful to Laurette Tuckerman for her helpful comments. This work was supported by grants from the Simons Foundation (grant numbers 662985, D.B., and 662960, B.H.) and the Priority Programme “SPP 1881: Turbulent Superstructures” of the Deutsche Forschungsgemeinschaft (grant number AV120/3-2 to M.A.).","year":"2023","file_date_updated":"2023-02-27T09:35:52Z","date_published":"2023-01-19T00:00:00Z","article_type":"original","page":"575-602","publication":"Annual Review of Fluid Mechanics","citation":{"short":"M. Avila, D. Barkley, B. Hof, Annual Review of Fluid Mechanics 55 (2023) 575–602.","mla":"Avila, Marc, et al. “Transition to Turbulence in Pipe Flow.” Annual Review of Fluid Mechanics, vol. 55, Annual Reviews, 2023, pp. 575–602, doi:10.1146/annurev-fluid-120720-025957.","chicago":"Avila, Marc, Dwight Barkley, and Björn Hof. “Transition to Turbulence in Pipe Flow.” Annual Review of Fluid Mechanics. Annual Reviews, 2023. https://doi.org/10.1146/annurev-fluid-120720-025957.","ama":"Avila M, Barkley D, Hof B. Transition to turbulence in pipe flow. Annual Review of Fluid Mechanics. 2023;55:575-602. doi:10.1146/annurev-fluid-120720-025957","ieee":"M. Avila, D. Barkley, and B. Hof, “Transition to turbulence in pipe flow,” Annual Review of Fluid Mechanics, vol. 55. Annual Reviews, pp. 575–602, 2023.","apa":"Avila, M., Barkley, D., & Hof, B. (2023). Transition to turbulence in pipe flow. Annual Review of Fluid Mechanics. Annual Reviews. https://doi.org/10.1146/annurev-fluid-120720-025957","ista":"Avila M, Barkley D, Hof B. 2023. Transition to turbulence in pipe flow. Annual Review of Fluid Mechanics. 55, 575–602."},"day":"19","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","file":[{"date_created":"2023-02-27T09:35:52Z","date_updated":"2023-02-27T09:35:52Z","checksum":"f99ef30f76cabc9e5e1946b380c16db4","success":1,"relation":"main_file","file_id":"12691","file_size":4769537,"content_type":"application/pdf","creator":"dernst","file_name":"2023_AnnReviewFluidMech_Avila.pdf","access_level":"open_access"}],"oa_version":"Published Version","title":"Transition to turbulence in pipe flow","ddc":["530"],"status":"public","intvolume":" 55","_id":"12682","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","abstract":[{"lang":"eng","text":"Since the seminal studies by Osborne Reynolds in the nineteenth century, pipe flow has served as a primary prototype for investigating the transition to turbulence in wall-bounded flows. Despite the apparent simplicity of this flow, various facets of this problem have occupied researchers for more than a century. Here we review insights from three distinct perspectives: (a) stability and susceptibility of laminar flow, (b) phase transition and spatiotemporal dynamics, and (c) dynamical systems analysis of the Navier—Stokes equations. We show how these perspectives have led to a profound understanding of the onset of turbulence in pipe flow. Outstanding open points, applications to flows of complex fluids, and similarities with other wall-bounded flows are discussed."}],"type":"journal_article"},{"type":"journal_article","abstract":[{"text":"Self-organisation is the spontaneous emergence of spatio-temporal structures and patterns from the interaction of smaller individual units. Examples are found across many scales in very different systems and scientific disciplines, from physics, materials science and robotics to biology, geophysics and astronomy. Recent research has highlighted how self-organisation can be both mediated and controlled by confinement. Confinement is an action over a system that limits its units’ translational and rotational degrees of freedom, thus also influencing the system's phase space probability density; it can function as either a catalyst or inhibitor of self-organisation. Confinement can then become a means to actively steer the emergence or suppression of collective phenomena in space and time. Here, to provide a common framework and perspective for future research, we examine the role of confinement in the self-organisation of soft-matter systems and identify overarching scientific challenges that need to be addressed to harness its full scientific and technological potential in soft matter and related fields. By drawing analogies with other disciplines, this framework will accelerate a common deeper understanding of self-organisation and trigger the development of innovative strategies to steer it using confinement, with impact on, e.g., the design of smarter materials, tissue engineering for biomedicine and in guiding active matter.","lang":"eng"}],"_id":"12708","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":" 19","status":"public","ddc":["540"],"title":"Steering self-organisation through confinement","file":[{"checksum":"af95aa18b9b01e32fb8f13477c0e2687","success":1,"date_updated":"2023-03-07T09:19:41Z","date_created":"2023-03-07T09:19:41Z","relation":"main_file","file_id":"12711","content_type":"application/pdf","file_size":3581939,"creator":"cchlebak","access_level":"open_access","file_name":"2023_SoftMatter_Araujo.pdf"}],"oa_version":"Published Version","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"06","citation":{"ama":"Araújo NAM, Janssen LMC, Barois T, et al. Steering self-organisation through confinement. Soft Matter. 2023;19:1695-1704. doi:10.1039/d2sm01562e","ista":"Araújo NAM, Janssen LMC, Barois T, Boffetta G, Cohen I, Corbetta A, Dauchot O, Dijkstra M, Durham WM, Dussutour A, Garnier S, Gelderblom H, Golestanian R, Isa L, Koenderink GH, Löwen H, Metzler R, Polin M, Royall CP, Šarić A, Sengupta A, Sykes C, Trianni V, Tuval I, Vogel N, Yeomans JM, Zuriguel I, Marin A, Volpe G. 2023. Steering self-organisation through confinement. Soft Matter. 19, 1695–1704.","ieee":"N. A. M. Araújo et al., “Steering self-organisation through confinement,” Soft Matter, vol. 19. Royal Society of Chemistry, pp. 1695–1704, 2023.","apa":"Araújo, N. A. M., Janssen, L. M. C., Barois, T., Boffetta, G., Cohen, I., Corbetta, A., … Volpe, G. (2023). Steering self-organisation through confinement. Soft Matter. Royal Society of Chemistry. https://doi.org/10.1039/d2sm01562e","mla":"Araújo, Nuno A. M., et al. “Steering Self-Organisation through Confinement.” Soft Matter, vol. 19, Royal Society of Chemistry, 2023, pp. 1695–704, doi:10.1039/d2sm01562e.","short":"N.A.M. Araújo, L.M.C. Janssen, T. Barois, G. Boffetta, I. Cohen, A. Corbetta, O. Dauchot, M. Dijkstra, W.M. Durham, A. Dussutour, S. Garnier, H. Gelderblom, R. Golestanian, L. Isa, G.H. Koenderink, H. Löwen, R. Metzler, M. Polin, C.P. Royall, A. Šarić, A. Sengupta, C. Sykes, V. Trianni, I. Tuval, N. Vogel, J.M. Yeomans, I. Zuriguel, A. Marin, G. Volpe, Soft Matter 19 (2023) 1695–1704.","chicago":"Araújo, Nuno A.M., Liesbeth M.C. Janssen, Thomas Barois, Guido Boffetta, Itai Cohen, Alessandro Corbetta, Olivier Dauchot, et al. “Steering Self-Organisation through Confinement.” Soft Matter. Royal Society of Chemistry, 2023. https://doi.org/10.1039/d2sm01562e."},"publication":"Soft Matter","page":"1695-1704","article_type":"original","date_published":"2023-02-06T00:00:00Z","ec_funded":1,"file_date_updated":"2023-03-07T09:19:41Z","year":"2023","acknowledgement":"All authors are grateful to the Lorentz Center for providing a venue for stimulating scientific discussions and to sponsor a workshop on the topic of “Self-organisation under confinement” along with the 4TU Federation, the J. M. Burgers Center for Fluid Dynamics and the MESA+ Institute for Nanotechnology at the University of Twente. The authors are also grateful to Paolo Malgaretti, Federico Toschi, Twan Wilting and Jaap den Toonder for valuable feedback. N. A. acknowledges financial support from the Portuguese Foundation for Science and Technology (FCT) under Contracts no. PTDC/FIS-MAC/28146/2017 (LISBOA-01-0145-FEDER-028146), UIDB/00618/2020, and UIDP/00618/2020. L. M. C. J. acknowledges financial support from the Netherlands Organisation for Scientific Research (NWO) through a START-UP, Physics Projectruimte, and Vidi grant. I. C. was supported in part by a grant from by the Army Research Office (ARO W911NF-18-1-0032) and the Cornell Center for Materials Research (DMR-1719875). O. D. acknowledges funding by the Agence Nationale pour la Recherche under Grant No ANR-18-CE33-0006 MSR. M. D. acknowledges financial support from the European Research Council (Grant No. ERC-2019-ADV-H2020 884902 SoftML). W. M. D. acknowledges funding from a BBSRC New Investigator Grant (BB/R018383/1). S. G. was supported by DARPA Young Faculty Award # D19AP00046, and NSF IIS grant # 1955210. H. G. acknowledges financial support from the Netherlands Organisation for Scientific Research (NWO) through Veni Grant No. 680-47-451. R. G. acknowledges support from the Max Planck School Matter to Life and the MaxSynBio Consortium, which are jointly funded by the Federal Ministry of Education and Research (BMBF) of Germany, and the Max Planck Society. L. I. acknowledges funding from the Horizon Europe ERC Consolidator Grant ACTIVE_ ADAPTIVE (Grant No. 101001514). G. H. K. gratefully acknowledges the NWO Talent Programme which is financed by the Dutch Research Council (project number VI.C.182.004). H. L. and N. V. acknowledge funding from the Deutsche Forschungsgemeinschaft (DFG) under grant numbers VO 1824/8-1 and LO 418/22-1. R. M. acknowledges funding from the Deutsche Forschungsgemeinschaft (DFG) under grant number ME 1535/13-1 and ME 1535/16-1. M. P. acknowledges funding from the Ramón y Cajal Program, grant no. RYC-2018-02534, and the Leverhulme Trust, grant no. RPG-2018-345. A. Š. acknowledges financial support from the European Research Council (Grant No. ERC-2018-STG-H2020 802960 NEPA). A. S. acknowledges funding from an ATTRACT Investigator Grant (No. A17/MS/11572821/MBRACE) from the Luxembourg National Research Fund. C. S. acknowledges funding from the French Agence Nationale pour la Recherche (ANR), grant ANR-14-CE090006 and ANR-12-BSV5001401, by the Fondation pour la Recherche Médicale (FRM), grant DEQ20120323737, and from the PIC3I of Institut Curie, France. I. T. acknowledges funding from grant IED2019-00058I/AEI/10.13039/501100011033. M. P. and I. T. also acknowledge funding from grant PID2019-104232B-I00/AEI/10.13039/501100011033 and from the H2020 MSCA ITN PHYMOT (Grant agreement No 95591). I. Z. acknowledges funding from Project PID2020-114839GB-I00 MINECO/AEI/FEDER, UE. A. M. acknowledges funding from the European Research Council, Starting Grant No. 678573 NanoPacks. G. V. acknowledges sponsorship for this work by the US Office of Naval Research Global (Award No. N62909-18-1-2170).","department":[{"_id":"AnSa"}],"publisher":"Royal Society of Chemistry","publication_status":"published","author":[{"full_name":"Araújo, Nuno A.M.","last_name":"Araújo","first_name":"Nuno A.M."},{"full_name":"Janssen, Liesbeth M.C.","last_name":"Janssen","first_name":"Liesbeth M.C."},{"full_name":"Barois, Thomas","first_name":"Thomas","last_name":"Barois"},{"first_name":"Guido","last_name":"Boffetta","full_name":"Boffetta, Guido"},{"full_name":"Cohen, Itai","first_name":"Itai","last_name":"Cohen"},{"last_name":"Corbetta","first_name":"Alessandro","full_name":"Corbetta, Alessandro"},{"first_name":"Olivier","last_name":"Dauchot","full_name":"Dauchot, Olivier"},{"last_name":"Dijkstra","first_name":"Marjolein","full_name":"Dijkstra, Marjolein"},{"full_name":"Durham, William M.","first_name":"William M.","last_name":"Durham"},{"last_name":"Dussutour","first_name":"Audrey","full_name":"Dussutour, Audrey"},{"first_name":"Simon","last_name":"Garnier","full_name":"Garnier, Simon"},{"first_name":"Hanneke","last_name":"Gelderblom","full_name":"Gelderblom, Hanneke"},{"full_name":"Golestanian, Ramin","first_name":"Ramin","last_name":"Golestanian"},{"full_name":"Isa, Lucio","first_name":"Lucio","last_name":"Isa"},{"full_name":"Koenderink, Gijsje H.","last_name":"Koenderink","first_name":"Gijsje H."},{"full_name":"Löwen, Hartmut","last_name":"Löwen","first_name":"Hartmut"},{"full_name":"Metzler, Ralf","first_name":"Ralf","last_name":"Metzler"},{"full_name":"Polin, Marco","first_name":"Marco","last_name":"Polin"},{"full_name":"Royall, C. Patrick","first_name":"C. Patrick","last_name":"Royall"},{"last_name":"Šarić","first_name":"Anđela","orcid":"0000-0002-7854-2139","id":"bf63d406-f056-11eb-b41d-f263a6566d8b","full_name":"Šarić, Anđela"},{"full_name":"Sengupta, Anupam","first_name":"Anupam","last_name":"Sengupta"},{"last_name":"Sykes","first_name":"Cécile","full_name":"Sykes, Cécile"},{"full_name":"Trianni, Vito","last_name":"Trianni","first_name":"Vito"},{"full_name":"Tuval, Idan","first_name":"Idan","last_name":"Tuval"},{"full_name":"Vogel, Nicolas","first_name":"Nicolas","last_name":"Vogel"},{"full_name":"Yeomans, Julia M.","first_name":"Julia M.","last_name":"Yeomans"},{"full_name":"Zuriguel, Iker","last_name":"Zuriguel","first_name":"Iker"},{"first_name":"Alvaro","last_name":"Marin","full_name":"Marin, Alvaro"},{"full_name":"Volpe, Giorgio","first_name":"Giorgio","last_name":"Volpe"}],"volume":19,"date_created":"2023-03-05T23:01:06Z","date_updated":"2023-08-01T13:28:39Z","publication_identifier":{"issn":["1744-683X"],"eissn":["1744-6848"]},"month":"02","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000940388100001"],"arxiv":["2204.10059"]},"oa":1,"project":[{"_id":"eba2549b-77a9-11ec-83b8-a81e493eae4e","grant_number":"802960","call_identifier":"H2020","name":"Non-Equilibrium Protein Assembly: from Building Blocks to Biological Machines"}],"isi":1,"quality_controlled":"1","doi":"10.1039/d2sm01562e","language":[{"iso":"eng"}]},{"file":[{"file_id":"12713","relation":"main_file","date_updated":"2023-03-07T10:58:00Z","date_created":"2023-03-07T10:58:00Z","success":1,"checksum":"5ff61ad21511950c15abb73b18613883","file_name":"2023_NatComm_Cheng.pdf","access_level":"open_access","creator":"cchlebak","content_type":"application/pdf","file_size":1946443}],"oa_version":"Published Version","intvolume":" 14","status":"public","ddc":["540"],"title":"Thermodynamics of diamond formation from hydrocarbon mixtures in planets","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"12702","abstract":[{"text":"Hydrocarbon mixtures are extremely abundant in the Universe, and diamond formation from them can play a crucial role in shaping the interior structure and evolution of planets. With first-principles accuracy, we first estimate the melting line of diamond, and then reveal the nature of chemical bonding in hydrocarbons at extreme conditions. We finally establish the pressure-temperature phase boundary where it is thermodynamically possible for diamond to form from hydrocarbon mixtures with different atomic fractions of carbon. Notably, here we show a depletion zone at pressures above 200 GPa and temperatures below 3000 K-3500 K where diamond formation is thermodynamically favorable regardless of the carbon atomic fraction, due to a phase separation mechanism. The cooler condition of the interior of Neptune compared to Uranus means that the former is much more likely to contain the depletion zone. Our findings can help explain the dichotomy of the two ice giants manifested by the low luminosity of Uranus, and lead to a better understanding of (exo-)planetary formation and evolution.","lang":"eng"}],"type":"journal_article","date_published":"2023-02-27T00:00:00Z","article_type":"original","citation":{"chicago":"Cheng, Bingqing, Sebastien Hamel, and Mandy Bethkenhagen. “Thermodynamics of Diamond Formation from Hydrocarbon Mixtures in Planets.” Nature Communications. Springer Nature, 2023. https://doi.org/10.1038/s41467-023-36841-1.","mla":"Cheng, Bingqing, et al. “Thermodynamics of Diamond Formation from Hydrocarbon Mixtures in Planets.” Nature Communications, vol. 14, 1104, Springer Nature, 2023, doi:10.1038/s41467-023-36841-1.","short":"B. Cheng, S. Hamel, M. Bethkenhagen, Nature Communications 14 (2023).","ista":"Cheng B, Hamel S, Bethkenhagen M. 2023. Thermodynamics of diamond formation from hydrocarbon mixtures in planets. Nature Communications. 14, 1104.","apa":"Cheng, B., Hamel, S., & Bethkenhagen, M. (2023). Thermodynamics of diamond formation from hydrocarbon mixtures in planets. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-023-36841-1","ieee":"B. Cheng, S. Hamel, and M. Bethkenhagen, “Thermodynamics of diamond formation from hydrocarbon mixtures in planets,” Nature Communications, vol. 14. Springer Nature, 2023.","ama":"Cheng B, Hamel S, Bethkenhagen M. Thermodynamics of diamond formation from hydrocarbon mixtures in planets. Nature Communications. 2023;14. doi:10.1038/s41467-023-36841-1"},"publication":"Nature Communications","has_accepted_license":"1","article_processing_charge":"No","day":"27","scopus_import":"1","volume":14,"date_created":"2023-03-05T23:01:04Z","date_updated":"2023-08-01T13:36:11Z","author":[{"id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","orcid":"0000-0002-3584-9632","first_name":"Bingqing","last_name":"Cheng","full_name":"Cheng, Bingqing"},{"last_name":"Hamel","first_name":"Sebastien","full_name":"Hamel, Sebastien"},{"full_name":"Bethkenhagen, Mandy","last_name":"Bethkenhagen","first_name":"Mandy","orcid":"0000-0002-1838-2129","id":"201939f4-803f-11ed-ab7e-d8da4bd1517f"}],"publisher":"Springer Nature","department":[{"_id":"BiCh"}],"publication_status":"published","pmid":1,"year":"2023","acknowledgement":"BC thanks Daan Frenkel for stimulating discussions. We thank Aleks Reinhardt, Daan Frenkel, Marius Millot, Federica Coppari, Rhys Bunting, and Chris J. Pickard for critically reading the manuscript and providing useful suggestions. BC acknowledges resources provided by the Cambridge Tier-2 system operated by the University of Cambridge Research Computing Service funded by EPSRC Tier-2 capital grant EP/P020259/1. SH acknowledges support from LDRD 19-ERD-031 and computing support from the Lawrence Livermore National Laboratory (LLNL) Institutional Computing Grand Challenge program. Lawrence Livermore National Laboratory is operated by Lawrence Livermore National Security, LLC, for the U.S. Department of Energy, National Nuclear Security Administration under Contract DE-AC52-07NA27344. MB acknowledges support by the European Horizon 2020 program within the Marie Skłodowska-Curie actions (xICE grant number 894725), funding from the NOMIS foundation and computational resources at the North-German Supercomputing Alliance (HLRN) facilities.","file_date_updated":"2023-03-07T10:58:00Z","article_number":"1104","language":[{"iso":"eng"}],"doi":"10.1038/s41467-023-36841-1","project":[{"_id":"9B861AAC-BA93-11EA-9121-9846C619BF3A","name":"NOMIS Fellowship Program"}],"quality_controlled":"1","isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000939678300002"],"pmid":["36843123"]},"publication_identifier":{"eissn":["2041-1723"]},"month":"02"},{"publication":"Genome Medicine","citation":{"ieee":"E. Bernabeu et al., “Refining epigenetic prediction of chronological and biological age,” Genome Medicine, vol. 15. Springer Nature, 2023.","apa":"Bernabeu, E., Mccartney, D. L., Gadd, D. A., Hillary, R. F., Lu, A. T., Murphy, L., … Marioni, R. E. (2023). Refining epigenetic prediction of chronological and biological age. Genome Medicine. Springer Nature. https://doi.org/10.1186/s13073-023-01161-y","ista":"Bernabeu E, Mccartney DL, Gadd DA, Hillary RF, Lu AT, Murphy L, Wrobel N, Campbell A, Harris SE, Liewald D, Hayward C, Sudlow C, Cox SR, Evans KL, Horvath S, Mcintosh AM, Robinson MR, Vallejos CA, Marioni RE. 2023. Refining epigenetic prediction of chronological and biological age. Genome Medicine. 15, 12.","ama":"Bernabeu E, Mccartney DL, Gadd DA, et al. Refining epigenetic prediction of chronological and biological age. Genome Medicine. 2023;15. doi:10.1186/s13073-023-01161-y","chicago":"Bernabeu, Elena, Daniel L. Mccartney, Danni A. Gadd, Robert F. Hillary, Ake T. Lu, Lee Murphy, Nicola Wrobel, et al. “Refining Epigenetic Prediction of Chronological and Biological Age.” Genome Medicine. Springer Nature, 2023. https://doi.org/10.1186/s13073-023-01161-y.","short":"E. Bernabeu, D.L. Mccartney, D.A. Gadd, R.F. Hillary, A.T. Lu, L. Murphy, N. Wrobel, A. Campbell, S.E. Harris, D. Liewald, C. Hayward, C. Sudlow, S.R. Cox, K.L. Evans, S. Horvath, A.M. Mcintosh, M.R. Robinson, C.A. Vallejos, R.E. Marioni, Genome Medicine 15 (2023).","mla":"Bernabeu, Elena, et al. “Refining Epigenetic Prediction of Chronological and Biological Age.” Genome Medicine, vol. 15, 12, Springer Nature, 2023, doi:10.1186/s13073-023-01161-y."},"article_type":"original","date_published":"2023-02-28T00:00:00Z","scopus_import":"1","day":"28","article_processing_charge":"No","has_accepted_license":"1","_id":"12719","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","title":"Refining epigenetic prediction of chronological and biological age","ddc":["570"],"status":"public","intvolume":" 15","file":[{"file_name":"2023_GenomeMed_Bernabeu.pdf","access_level":"open_access","creator":"cchlebak","content_type":"application/pdf","file_size":4275987,"file_id":"12722","relation":"main_file","date_updated":"2023-03-14T10:29:47Z","date_created":"2023-03-14T10:29:47Z","success":1,"checksum":"833b837910c4db42fb5f0f34125f77a7"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"text":"Background\r\nEpigenetic clocks can track both chronological age (cAge) and biological age (bAge). The latter is typically defined by physiological biomarkers and risk of adverse health outcomes, including all-cause mortality. As cohort sample sizes increase, estimates of cAge and bAge become more precise. Here, we aim to develop accurate epigenetic predictors of cAge and bAge, whilst improving our understanding of their epigenomic architecture.\r\n\r\nMethods\r\nFirst, we perform large-scale (N = 18,413) epigenome-wide association studies (EWAS) of chronological age and all-cause mortality. Next, to create a cAge predictor, we use methylation data from 24,674 participants from the Generation Scotland study, the Lothian Birth Cohorts (LBC) of 1921 and 1936, and 8 other cohorts with publicly available data. In addition, we train a predictor of time to all-cause mortality as a proxy for bAge using the Generation Scotland cohort (1214 observed deaths). For this purpose, we use epigenetic surrogates (EpiScores) for 109 plasma proteins and the 8 component parts of GrimAge, one of the current best epigenetic predictors of survival. We test this bAge predictor in four external cohorts (LBC1921, LBC1936, the Framingham Heart Study and the Women’s Health Initiative study).\r\n\r\nResults\r\nThrough the inclusion of linear and non-linear age-CpG associations from the EWAS, feature pre-selection in advance of elastic net regression, and a leave-one-cohort-out (LOCO) cross-validation framework, we obtain cAge prediction with a median absolute error equal to 2.3 years. Our bAge predictor was found to slightly outperform GrimAge in terms of the strength of its association to survival (HRGrimAge = 1.47 [1.40, 1.54] with p = 1.08 × 10−52, and HRbAge = 1.52 [1.44, 1.59] with p = 2.20 × 10−60). Finally, we introduce MethylBrowsR, an online tool to visualise epigenome-wide CpG-age associations.\r\n\r\nConclusions\r\nThe integration of multiple large datasets, EpiScores, non-linear DNAm effects, and new approaches to feature selection has facilitated improvements to the blood-based epigenetic prediction of biological and chronological age.","lang":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000940286600001"]},"isi":1,"quality_controlled":"1","doi":"10.1186/s13073-023-01161-y","language":[{"iso":"eng"}],"month":"02","publication_identifier":{"eissn":["1756-994X"]},"acknowledgement":"We are grateful to all the families who took part, the general practitioners, and the Scottish School of Primary Care for their help in recruiting them and the whole GS team that includes interviewers, computer and laboratory technicians, clerical workers, research scientists, volunteers, managers, receptionists, healthcare assistants, and nurses.","year":"2023","publication_status":"published","department":[{"_id":"MaRo"}],"publisher":"Springer Nature","author":[{"full_name":"Bernabeu, Elena","last_name":"Bernabeu","first_name":"Elena"},{"full_name":"Mccartney, Daniel L.","last_name":"Mccartney","first_name":"Daniel L."},{"full_name":"Gadd, Danni A.","first_name":"Danni A.","last_name":"Gadd"},{"first_name":"Robert F.","last_name":"Hillary","full_name":"Hillary, Robert F."},{"last_name":"Lu","first_name":"Ake T.","full_name":"Lu, Ake T."},{"full_name":"Murphy, Lee","first_name":"Lee","last_name":"Murphy"},{"first_name":"Nicola","last_name":"Wrobel","full_name":"Wrobel, Nicola"},{"full_name":"Campbell, Archie","last_name":"Campbell","first_name":"Archie"},{"first_name":"Sarah E.","last_name":"Harris","full_name":"Harris, Sarah E."},{"last_name":"Liewald","first_name":"David","full_name":"Liewald, David"},{"last_name":"Hayward","first_name":"Caroline","full_name":"Hayward, Caroline"},{"full_name":"Sudlow, Cathie","last_name":"Sudlow","first_name":"Cathie"},{"full_name":"Cox, Simon R.","last_name":"Cox","first_name":"Simon R."},{"first_name":"Kathryn L.","last_name":"Evans","full_name":"Evans, Kathryn L."},{"full_name":"Horvath, Steve","last_name":"Horvath","first_name":"Steve"},{"first_name":"Andrew M.","last_name":"Mcintosh","full_name":"Mcintosh, Andrew M."},{"full_name":"Robinson, Matthew Richard","last_name":"Robinson","first_name":"Matthew Richard","orcid":"0000-0001-8982-8813","id":"E5D42276-F5DA-11E9-8E24-6303E6697425"},{"full_name":"Vallejos, Catalina A.","first_name":"Catalina A.","last_name":"Vallejos"},{"full_name":"Marioni, Riccardo E.","first_name":"Riccardo E.","last_name":"Marioni"}],"date_updated":"2023-08-01T13:38:12Z","date_created":"2023-03-12T23:01:02Z","volume":15,"article_number":"12","file_date_updated":"2023-03-14T10:29:47Z"},{"file_date_updated":"2023-03-07T12:22:23Z","acknowledgement":"We thank Christoph Lampert for inspiring this work. The\r\nviews and conclusions contained in this document are those of\r\nthe authors and should not be interpreted as representing the\r\nofficial policies, either expressed or implied, of the United States\r\nAir Force or the U.S. Government. The U.S. Government is\r\nauthorized to reproduce and distribute reprints for Government\r\npurposes notwithstanding any copyright notation herein.","year":"2023","publication_status":"published","publisher":"Institute of Electrical and Electronics Engineers","department":[{"_id":"ToHe"}],"author":[{"last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias"},{"first_name":"Alexander","last_name":"Amini","full_name":"Amini, Alexander"},{"full_name":"Rus, Daniela","first_name":"Daniela","last_name":"Rus"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"11366"}]},"date_created":"2023-03-05T23:01:04Z","date_updated":"2023-08-01T13:36:50Z","volume":8,"month":"03","publication_identifier":{"eissn":["2377-3766"]},"external_id":{"isi":["000936534100012"],"arxiv":["2204.07373"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"isi":1,"quality_controlled":"1","doi":"10.1109/LRA.2023.3240930","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"text":"Adversarial training (i.e., training on adversarially perturbed input data) is a well-studied method for making neural networks robust to potential adversarial attacks during inference. However, the improved robustness does not come for free but rather is accompanied by a decrease in overall model accuracy and performance. Recent work has shown that, in practical robot learning applications, the effects of adversarial training do not pose a fair trade-off but inflict a net loss when measured in holistic robot performance. This work revisits the robustness-accuracy trade-off in robot learning by systematically analyzing if recent advances in robust training methods and theory in conjunction with adversarial robot learning, are capable of making adversarial training suitable for real-world robot applications. We evaluate three different robot learning tasks ranging from autonomous driving in a high-fidelity environment amenable to sim-to-real deployment to mobile robot navigation and gesture recognition. Our results demonstrate that, while these techniques make incremental improvements on the trade-off on a relative scale, the negative impact on the nominal accuracy caused by adversarial training still outweighs the improved robustness by an order of magnitude. We conclude that although progress is happening, further advances in robust learning methods are necessary before they can benefit robot learning tasks in practice.","lang":"eng"}],"issue":"3","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"12704","title":"Revisiting the adversarial robustness-accuracy tradeoff in robot learning","ddc":["000"],"status":"public","intvolume":" 8","file":[{"file_id":"12714","relation":"main_file","success":1,"checksum":"5a75dcd326ea66685de2b1aaec259e85","date_updated":"2023-03-07T12:22:23Z","date_created":"2023-03-07T12:22:23Z","access_level":"open_access","file_name":"2023_IEEERobAutLetters_Lechner.pdf","creator":"cchlebak","file_size":944052,"content_type":"application/pdf"}],"oa_version":"Published Version","scopus_import":"1","day":"01","has_accepted_license":"1","article_processing_charge":"No","publication":"IEEE Robotics and Automation Letters","citation":{"apa":"Lechner, M., Amini, A., Rus, D., & Henzinger, T. A. (2023). Revisiting the adversarial robustness-accuracy tradeoff in robot learning. IEEE Robotics and Automation Letters. Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/LRA.2023.3240930","ieee":"M. Lechner, A. Amini, D. Rus, and T. A. Henzinger, “Revisiting the adversarial robustness-accuracy tradeoff in robot learning,” IEEE Robotics and Automation Letters, vol. 8, no. 3. Institute of Electrical and Electronics Engineers, pp. 1595–1602, 2023.","ista":"Lechner M, Amini A, Rus D, Henzinger TA. 2023. Revisiting the adversarial robustness-accuracy tradeoff in robot learning. IEEE Robotics and Automation Letters. 8(3), 1595–1602.","ama":"Lechner M, Amini A, Rus D, Henzinger TA. Revisiting the adversarial robustness-accuracy tradeoff in robot learning. IEEE Robotics and Automation Letters. 2023;8(3):1595-1602. doi:10.1109/LRA.2023.3240930","chicago":"Lechner, Mathias, Alexander Amini, Daniela Rus, and Thomas A Henzinger. “Revisiting the Adversarial Robustness-Accuracy Tradeoff in Robot Learning.” IEEE Robotics and Automation Letters. Institute of Electrical and Electronics Engineers, 2023. https://doi.org/10.1109/LRA.2023.3240930.","short":"M. Lechner, A. Amini, D. Rus, T.A. Henzinger, IEEE Robotics and Automation Letters 8 (2023) 1595–1602.","mla":"Lechner, Mathias, et al. “Revisiting the Adversarial Robustness-Accuracy Tradeoff in Robot Learning.” IEEE Robotics and Automation Letters, vol. 8, no. 3, Institute of Electrical and Electronics Engineers, 2023, pp. 1595–602, doi:10.1109/LRA.2023.3240930."},"article_type":"original","page":"1595-1602","date_published":"2023-03-01T00:00:00Z"},{"oa_version":"Preprint","title":"Spin-electric coupling in lead halide perovskites","status":"public","intvolume":" 130","_id":"12723","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","abstract":[{"lang":"eng","text":"Lead halide perovskites enjoy a number of remarkable optoelectronic properties. To explain their origin, it is necessary to study how electromagnetic fields interact with these systems. We address this problem here by studying two classical quantities: Faraday rotation and the complex refractive index in a paradigmatic perovskite CH3NH3PbBr3 in a broad wavelength range. We find that the minimal coupling of electromagnetic fields to the k⋅p Hamiltonian is insufficient to describe the observed data even on the qualitative level. To amend this, we demonstrate that there exists a relevant atomic-level coupling between electromagnetic fields and the spin degree of freedom. This spin-electric coupling allows for quantitative description of a number of previous as well as present experimental data. In particular, we use it here to show that the Faraday effect in lead halide perovskites is dominated by the Zeeman splitting of the energy levels and has a substantial beyond-Becquerel contribution. Finally, we present general symmetry-based phenomenological arguments that in the low-energy limit our effective model includes all basis coupling terms to the electromagnetic field in the linear order."}],"issue":"10","type":"journal_article","date_published":"2023-03-10T00:00:00Z","article_type":"original","publication":"Physical Review Letters","citation":{"ama":"Volosniev A, Shiva Kumar A, Lorenc D, et al. Spin-electric coupling in lead halide perovskites. Physical Review Letters. 2023;130(10). doi:10.1103/physrevlett.130.106901","ista":"Volosniev A, Shiva Kumar A, Lorenc D, Ashourishokri Y, Zhumekenov AA, Bakr OM, Lemeshko M, Alpichshev Z. 2023. Spin-electric coupling in lead halide perovskites. Physical Review Letters. 130(10), 106901.","apa":"Volosniev, A., Shiva Kumar, A., Lorenc, D., Ashourishokri, Y., Zhumekenov, A. A., Bakr, O. M., … Alpichshev, Z. (2023). Spin-electric coupling in lead halide perovskites. Physical Review Letters. American Physical Society. https://doi.org/10.1103/physrevlett.130.106901","ieee":"A. Volosniev et al., “Spin-electric coupling in lead halide perovskites,” Physical Review Letters, vol. 130, no. 10. American Physical Society, 2023.","mla":"Volosniev, Artem, et al. “Spin-Electric Coupling in Lead Halide Perovskites.” Physical Review Letters, vol. 130, no. 10, 106901, American Physical Society, 2023, doi:10.1103/physrevlett.130.106901.","short":"A. Volosniev, A. Shiva Kumar, D. Lorenc, Y. Ashourishokri, A.A. Zhumekenov, O.M. Bakr, M. Lemeshko, Z. Alpichshev, Physical Review Letters 130 (2023).","chicago":"Volosniev, Artem, Abhishek Shiva Kumar, Dusan Lorenc, Younes Ashourishokri, Ayan A. Zhumekenov, Osman M. Bakr, Mikhail Lemeshko, and Zhanybek Alpichshev. “Spin-Electric Coupling in Lead Halide Perovskites.” Physical Review Letters. American Physical Society, 2023. https://doi.org/10.1103/physrevlett.130.106901."},"day":"10","article_processing_charge":"No","keyword":["General Physics and Astronomy"],"scopus_import":"1","date_updated":"2023-08-01T13:39:04Z","date_created":"2023-03-14T13:11:59Z","volume":130,"author":[{"full_name":"Volosniev, Artem","orcid":"0000-0003-0393-5525","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","last_name":"Volosniev","first_name":"Artem"},{"first_name":"Abhishek","last_name":"Shiva Kumar","id":"5e9a6931-eb97-11eb-a6c2-e96f7058d77a","full_name":"Shiva Kumar, Abhishek"},{"id":"40D8A3E6-F248-11E8-B48F-1D18A9856A87","first_name":"Dusan","last_name":"Lorenc","full_name":"Lorenc, Dusan"},{"id":"e32c111f-f6e0-11ea-865d-eb955baea334","last_name":"Ashourishokri","first_name":"Younes","full_name":"Ashourishokri, Younes"},{"first_name":"Ayan A.","last_name":"Zhumekenov","full_name":"Zhumekenov, Ayan A."},{"first_name":"Osman M.","last_name":"Bakr","full_name":"Bakr, Osman M."},{"full_name":"Lemeshko, Mikhail","first_name":"Mikhail","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802"},{"first_name":"Zhanybek","last_name":"Alpichshev","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7183-5203","full_name":"Alpichshev, Zhanybek"}],"publication_status":"published","publisher":"American Physical Society","department":[{"_id":"GradSch"},{"_id":"ZhAl"},{"_id":"MiLe"}],"year":"2023","article_number":"106901","language":[{"iso":"eng"}],"doi":"10.1103/physrevlett.130.106901","quality_controlled":"1","isi":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2203.09443","open_access":"1"}],"oa":1,"external_id":{"arxiv":["2203.09443"],"isi":["000982435900002"]},"month":"03","publication_identifier":{"issn":["0031-9007"],"eissn":["1079-7114"]}},{"publisher":"American Physical Society","department":[{"_id":"GradSch"},{"_id":"ZhAl"},{"_id":"MiLe"}],"publication_status":"published","year":"2023","volume":107,"date_created":"2023-03-14T13:13:05Z","date_updated":"2023-08-01T13:39:47Z","author":[{"id":"37D278BC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0393-5525","first_name":"Artem","last_name":"Volosniev","full_name":"Volosniev, Artem"},{"full_name":"Shiva Kumar, Abhishek","id":"5e9a6931-eb97-11eb-a6c2-e96f7058d77a","last_name":"Shiva Kumar","first_name":"Abhishek"},{"last_name":"Lorenc","first_name":"Dusan","id":"40D8A3E6-F248-11E8-B48F-1D18A9856A87","full_name":"Lorenc, Dusan"},{"full_name":"Ashourishokri, Younes","id":"e32c111f-f6e0-11ea-865d-eb955baea334","last_name":"Ashourishokri","first_name":"Younes"},{"first_name":"Ayan","last_name":"Zhumekenov","full_name":"Zhumekenov, Ayan"},{"last_name":"Bakr","first_name":"Osman M.","full_name":"Bakr, Osman M."},{"id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","first_name":"Mikhail","last_name":"Lemeshko","full_name":"Lemeshko, Mikhail"},{"orcid":"0000-0002-7183-5203","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","last_name":"Alpichshev","first_name":"Zhanybek","full_name":"Alpichshev, Zhanybek"}],"article_number":"125201","quality_controlled":"1","isi":1,"oa":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2204.04022","open_access":"1"}],"external_id":{"isi":["000972602200006"],"arxiv":["2204.04022"]},"language":[{"iso":"eng"}],"doi":"10.1103/physrevb.107.125201","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"month":"03","intvolume":" 107","status":"public","title":"Effective model for studying optical properties of lead halide perovskites","_id":"12724","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Preprint","type":"journal_article","issue":"12","abstract":[{"text":"We use general symmetry-based arguments to construct an effective model suitable for studying optical properties of lead halide perovskites. To build the model, we identify an atomic-level interaction between electromagnetic fields and the spin degree of freedom that should be added to a minimally coupled k⋅p Hamiltonian. As a first application, we study two basic optical characteristics of the material: the Verdet constant and the refractive index. Beyond these linear characteristics of the material, the model is suitable for calculating nonlinear effects such as the third-order optical susceptibility. Analysis of this quantity shows that the geometrical properties of the spin-electric term imply isotropic optical response of the system, and that optical anisotropy of lead halide perovskites is a manifestation of hopping of charge carriers. To illustrate this, we discuss third-harmonic generation.","lang":"eng"}],"article_type":"original","citation":{"ieee":"A. Volosniev et al., “Effective model for studying optical properties of lead halide perovskites,” Physical Review B, vol. 107, no. 12. American Physical Society, 2023.","apa":"Volosniev, A., Shiva Kumar, A., Lorenc, D., Ashourishokri, Y., Zhumekenov, A., Bakr, O. M., … Alpichshev, Z. (2023). Effective model for studying optical properties of lead halide perovskites. Physical Review B. American Physical Society. https://doi.org/10.1103/physrevb.107.125201","ista":"Volosniev A, Shiva Kumar A, Lorenc D, Ashourishokri Y, Zhumekenov A, Bakr OM, Lemeshko M, Alpichshev Z. 2023. Effective model for studying optical properties of lead halide perovskites. Physical Review B. 107(12), 125201.","ama":"Volosniev A, Shiva Kumar A, Lorenc D, et al. Effective model for studying optical properties of lead halide perovskites. Physical Review B. 2023;107(12). doi:10.1103/physrevb.107.125201","chicago":"Volosniev, Artem, Abhishek Shiva Kumar, Dusan Lorenc, Younes Ashourishokri, Ayan Zhumekenov, Osman M. Bakr, Mikhail Lemeshko, and Zhanybek Alpichshev. “Effective Model for Studying Optical Properties of Lead Halide Perovskites.” Physical Review B. American Physical Society, 2023. https://doi.org/10.1103/physrevb.107.125201.","short":"A. Volosniev, A. Shiva Kumar, D. Lorenc, Y. Ashourishokri, A. Zhumekenov, O.M. Bakr, M. Lemeshko, Z. Alpichshev, Physical Review B 107 (2023).","mla":"Volosniev, Artem, et al. “Effective Model for Studying Optical Properties of Lead Halide Perovskites.” Physical Review B, vol. 107, no. 12, 125201, American Physical Society, 2023, doi:10.1103/physrevb.107.125201."},"publication":"Physical Review B","date_published":"2023-03-15T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"15"},{"has_accepted_license":"1","article_processing_charge":"No","day":"17","scopus_import":"1","date_published":"2023-03-17T00:00:00Z","citation":{"mla":"Rothman, Jason Seth, et al. “Validation of a Stereological Method for Estimating Particle Size and Density from 2D Projections with High Accuracy.” PLoS ONE, vol. 18, no. 3 March, e0277148, Public Library of Science, 2023, doi:10.1371/journal.pone.0277148.","short":"J.S. Rothman, C. Borges Merjane, N. Holderith, P.M. Jonas, R. Angus Silver, PLoS ONE 18 (2023).","chicago":"Rothman, Jason Seth, Carolina Borges Merjane, Noemi Holderith, Peter M Jonas, and R. Angus Silver. “Validation of a Stereological Method for Estimating Particle Size and Density from 2D Projections with High Accuracy.” PLoS ONE. Public Library of Science, 2023. https://doi.org/10.1371/journal.pone.0277148.","ama":"Rothman JS, Borges Merjane C, Holderith N, Jonas PM, Angus Silver R. Validation of a stereological method for estimating particle size and density from 2D projections with high accuracy. PLoS ONE. 2023;18(3 March). doi:10.1371/journal.pone.0277148","ista":"Rothman JS, Borges Merjane C, Holderith N, Jonas PM, Angus Silver R. 2023. Validation of a stereological method for estimating particle size and density from 2D projections with high accuracy. PLoS ONE. 18(3 March), e0277148.","apa":"Rothman, J. S., Borges Merjane, C., Holderith, N., Jonas, P. M., & Angus Silver, R. (2023). Validation of a stereological method for estimating particle size and density from 2D projections with high accuracy. PLoS ONE. Public Library of Science. https://doi.org/10.1371/journal.pone.0277148","ieee":"J. S. Rothman, C. Borges Merjane, N. Holderith, P. M. Jonas, and R. Angus Silver, “Validation of a stereological method for estimating particle size and density from 2D projections with high accuracy,” PLoS ONE, vol. 18, no. 3 March. Public Library of Science, 2023."},"publication":"PLoS ONE","article_type":"original","issue":"3 March","abstract":[{"text":"Stereological methods for estimating the 3D particle size and density from 2D projections are essential to many research fields. These methods are, however, prone to errors arising from undetected particle profiles due to sectioning and limited resolution, known as ‘lost caps’. A potential solution developed by Keiding, Jensen, and Ranek in 1972, which we refer to as the Keiding model, accounts for lost caps by quantifying the smallest detectable profile in terms of its limiting ‘cap angle’ (ϕ), a size-independent measure of a particle’s distance from the section surface. However, this simple solution has not been widely adopted nor tested. Rather, model-independent design-based stereological methods, which do not explicitly account for lost caps, have come to the fore. Here, we provide the first experimental validation of the Keiding model by comparing the size and density of particles estimated from 2D projections with direct measurement from 3D EM reconstructions of the same tissue. We applied the Keiding model to estimate the size and density of somata, nuclei and vesicles in the cerebellum of mice and rats, where high packing density can be problematic for design-based methods. Our analysis reveals a Gaussian distribution for ϕ rather than a single value. Nevertheless, curve fits of the Keiding model to the 2D diameter distribution accurately estimate the mean ϕ and 3D diameter distribution. While systematic testing using simulations revealed an upper limit to determining ϕ, our analysis shows that estimated ϕ can be used to determine the 3D particle density from the 2D density under a wide range of conditions, and this method is potentially more accurate than minimum-size-based lost-cap corrections and disector methods. Our results show the Keiding model provides an efficient means of accurately estimating the size and density of particles from 2D projections even under conditions of a high density.","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","file":[{"file_size":7290413,"content_type":"application/pdf","creator":"dernst","file_name":"2023_PLoSOne_Rothman.pdf","access_level":"open_access","date_created":"2023-03-27T06:51:09Z","date_updated":"2023-03-27T06:51:09Z","checksum":"2380331ec27cc87808826fc64419ac1c","success":1,"relation":"main_file","file_id":"12770"}],"_id":"12759","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":" 18","title":"Validation of a stereological method for estimating particle size and density from 2D projections with high accuracy","status":"public","ddc":["570"],"publication_identifier":{"eissn":["1932-6203"]},"month":"03","doi":"10.1371/journal.pone.0277148","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"EM-Fac"}],"external_id":{"isi":["001024737400001"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"project":[{"call_identifier":"H2020","name":"Biophysics and circuit function of a giant cortical glumatergic synapse","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","grant_number":"692692"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25C5A090-B435-11E9-9278-68D0E5697425","grant_number":"Z00312"},{"grant_number":"V00739","_id":"2696E7FE-B435-11E9-9278-68D0E5697425","name":"Structural plasticity at mossy fiber-CA3 synapses","call_identifier":"FWF"}],"quality_controlled":"1","isi":1,"ec_funded":1,"file_date_updated":"2023-03-27T06:51:09Z","article_number":"e0277148","author":[{"full_name":"Rothman, Jason Seth","last_name":"Rothman","first_name":"Jason Seth"},{"full_name":"Borges Merjane, Carolina","orcid":"0000-0003-0005-401X","id":"4305C450-F248-11E8-B48F-1D18A9856A87","last_name":"Borges Merjane","first_name":"Carolina"},{"full_name":"Holderith, Noemi","last_name":"Holderith","first_name":"Noemi"},{"first_name":"Peter M","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M"},{"last_name":"Angus Silver","first_name":"R.","full_name":"Angus Silver, R."}],"volume":18,"date_created":"2023-03-26T22:01:07Z","date_updated":"2023-08-01T13:46:39Z","acknowledgement":"We thank the IST Austria Electron Microscopy Facility for technical support, and Diccon Coyle, Andrea Lőrincz and Zoltan Nusser for their helpful comments and discussions.\r\nFunding for JSR and RAS was from the Wellcome Trust (203048; 224499; https://\r\nwellcome.org/). RAS is in receipt of a Wellcome Trust Principal Research Fellowship (224499).\r\nFunding for CBM and PJ was from Fond zur Förderung der Wissenschaftlichen Forschung (V\r\n739-B27 Elise-Richter Programme to CBM, Z 312-B27 Wittgenstein Award to PJ; \r\nhttps://www.fwf.ac.at). PJ received funding from the European Research Council (ERC; https://erc.europa.eu) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 692692). NH was supported by a European\r\nResearch Council Advanced Grant (ERC-AG787157).","year":"2023","department":[{"_id":"PeJo"}],"publisher":"Public Library of Science","publication_status":"published"},{"article_processing_charge":"No","has_accepted_license":"1","day":"17","scopus_import":"1","date_published":"2023-03-17T00:00:00Z","citation":{"short":"F. Hurtig, T.C.Q. Burgers, A. Cezanne, X. Jiang, F.N. Mol, J. Traparić, A.A. Pulschen, T. Nierhaus, G. Tarrason-Risa, L. Harker-Kirschneck, J. Löwe, A. Šarić, R. Vlijm, B. Baum, Science Advances 9 (2023).","mla":"Hurtig, Fredrik, et al. “The Patterned Assembly and Stepwise Vps4-Mediated Disassembly of Composite ESCRT-III Polymers Drives Archaeal Cell Division.” Science Advances, vol. 9, no. 11, eade5224, American Association for the Advancement of Science, 2023, doi:10.1126/sciadv.ade5224.","chicago":"Hurtig, Fredrik, Thomas C.Q. Burgers, Alice Cezanne, Xiuyun Jiang, Frank N. Mol, Jovan Traparić, Andre Arashiro Pulschen, et al. “The Patterned Assembly and Stepwise Vps4-Mediated Disassembly of Composite ESCRT-III Polymers Drives Archaeal Cell Division.” Science Advances. American Association for the Advancement of Science, 2023. https://doi.org/10.1126/sciadv.ade5224.","ama":"Hurtig F, Burgers TCQ, Cezanne A, et al. The patterned assembly and stepwise Vps4-mediated disassembly of composite ESCRT-III polymers drives archaeal cell division. Science Advances. 2023;9(11). doi:10.1126/sciadv.ade5224","apa":"Hurtig, F., Burgers, T. C. Q., Cezanne, A., Jiang, X., Mol, F. N., Traparić, J., … Baum, B. (2023). The patterned assembly and stepwise Vps4-mediated disassembly of composite ESCRT-III polymers drives archaeal cell division. Science Advances. American Association for the Advancement of Science. https://doi.org/10.1126/sciadv.ade5224","ieee":"F. Hurtig et al., “The patterned assembly and stepwise Vps4-mediated disassembly of composite ESCRT-III polymers drives archaeal cell division,” Science Advances, vol. 9, no. 11. American Association for the Advancement of Science, 2023.","ista":"Hurtig F, Burgers TCQ, Cezanne A, Jiang X, Mol FN, Traparić J, Pulschen AA, Nierhaus T, Tarrason-Risa G, Harker-Kirschneck L, Löwe J, Šarić A, Vlijm R, Baum B. 2023. The patterned assembly and stepwise Vps4-mediated disassembly of composite ESCRT-III polymers drives archaeal cell division. Science Advances. 9(11), eade5224."},"publication":"Science Advances","article_type":"original","issue":"11","abstract":[{"lang":"eng","text":"ESCRT-III family proteins form composite polymers that deform and cut membrane tubes in the context of a wide range of cell biological processes across the tree of life. In reconstituted systems, sequential changes in the composition of ESCRT-III polymers induced by the AAA–adenosine triphosphatase Vps4 have been shown to remodel membranes. However, it is not known how composite ESCRT-III polymers are organized and remodeled in space and time in a cellular context. Taking advantage of the relative simplicity of the ESCRT-III–dependent division system in Sulfolobus acidocaldarius, one of the closest experimentally tractable prokaryotic relatives of eukaryotes, we use super-resolution microscopy, electron microscopy, and computational modeling to show how CdvB/CdvB1/CdvB2 proteins form a precisely patterned composite ESCRT-III division ring, which undergoes stepwise Vps4-dependent disassembly and contracts to cut cells into two. These observations lead us to suggest sequential changes in a patterned composite polymer as a general mechanism of ESCRT-III–dependent membrane remodeling."}],"type":"journal_article","oa_version":"Published Version","file":[{"date_updated":"2023-03-27T06:24:49Z","date_created":"2023-03-27T06:24:49Z","success":1,"checksum":"6d7dbe9ed86a116c8a002d62971202c5","file_id":"12768","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":1826471,"file_name":"2023_ScienceAdvances_Hurtig.pdf","access_level":"open_access"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"12756","intvolume":" 9","title":"The patterned assembly and stepwise Vps4-mediated disassembly of composite ESCRT-III polymers drives archaeal cell division","ddc":["570"],"status":"public","publication_identifier":{"eissn":["2375-2548"]},"month":"03","doi":"10.1126/sciadv.ade5224","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000968083500010"]},"project":[{"grant_number":"802960","_id":"eba2549b-77a9-11ec-83b8-a81e493eae4e","name":"Non-Equilibrium Protein Assembly: from Building Blocks to Biological Machines","call_identifier":"H2020"}],"isi":1,"quality_controlled":"1","ec_funded":1,"file_date_updated":"2023-03-27T06:24:49Z","article_number":"eade5224","author":[{"full_name":"Hurtig, Fredrik","first_name":"Fredrik","last_name":"Hurtig"},{"full_name":"Burgers, Thomas C.Q.","first_name":"Thomas C.Q.","last_name":"Burgers"},{"first_name":"Alice","last_name":"Cezanne","full_name":"Cezanne, Alice"},{"first_name":"Xiuyun","last_name":"Jiang","full_name":"Jiang, Xiuyun"},{"first_name":"Frank N.","last_name":"Mol","full_name":"Mol, Frank N."},{"full_name":"Traparić, Jovan","last_name":"Traparić","first_name":"Jovan"},{"last_name":"Pulschen","first_name":"Andre Arashiro","full_name":"Pulschen, Andre Arashiro"},{"first_name":"Tim","last_name":"Nierhaus","full_name":"Nierhaus, Tim"},{"full_name":"Tarrason-Risa, Gabriel","first_name":"Gabriel","last_name":"Tarrason-Risa"},{"full_name":"Harker-Kirschneck, Lena","first_name":"Lena","last_name":"Harker-Kirschneck"},{"first_name":"Jan","last_name":"Löwe","full_name":"Löwe, Jan"},{"full_name":"Šarić, Anđela","last_name":"Šarić","first_name":"Anđela","orcid":"0000-0002-7854-2139","id":"bf63d406-f056-11eb-b41d-f263a6566d8b"},{"last_name":"Vlijm","first_name":"Rifka","full_name":"Vlijm, Rifka"},{"last_name":"Baum","first_name":"Buzz","full_name":"Baum, Buzz"}],"volume":9,"date_updated":"2023-08-01T13:45:54Z","date_created":"2023-03-26T22:01:06Z","acknowledgement":"We thank Y. Liu and V. Hale for help with electron cryotomography; the Medical Research Council (MRC) LMB Electron Microscopy Facility for access, training, and support; and T. Darling and J. Grimmett at the MRC LMB for help with computing infrastructure. We also thank the Flow Cytometry Facility and the MRC LMB for training and support.\r\n F.H. and G.T.-R. were supported by a grant from the Wellcome Trust (203276/Z/16/Z). A.C. was supported by an EMBO long-term fellowship: ALTF_1041-2021. J.T. was supported by a grant from the VW Foundation (94933). A.A.P. was supported by the Wellcome Trust (203276/Z/16/Z) and the HFSP (LT001027/2019). B.B. received support from the MRC LMB, the Wellcome Trust (203276/Z/16/Z), the VW Foundation (94933), the Life Sciences–Moore-Simons Foundation (735929LPI), and a Gordon and Betty Moore Foundation’s Symbiosis in Aquatic Systems Initiative (9346). A.Š. and X.J. acknowledge funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant no. 802960). L.H.-K. acknowledges support from Biotechnology and Biological Sciences Research Council LIDo Programme. T.N. and J.L. were supported by the MRC (U105184326) and the Wellcome Trust (203276/Z/16/Z).","year":"2023","publisher":"American Association for the Advancement of Science","department":[{"_id":"AnSa"}],"publication_status":"published"},{"month":"03","publication_identifier":{"eissn":["1932-6203"]},"isi":1,"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000985134400106"]},"language":[{"iso":"eng"}],"doi":"10.1371/journal.pone.0282689","article_number":"e0282689","file_date_updated":"2023-03-27T07:09:08Z","publication_status":"published","department":[{"_id":"FyKo"},{"_id":"MaRo"}],"publisher":"Public Library of Science","acknowledgement":"The authors acknowledge the use of Zhores supercomputer [28] for obtaining the results presented in this paper.The authors thank Zimin Foundation and Petrovax for support of the presented study at the School of Molecular and Theoretical Biology 2021.","year":"2023","date_updated":"2023-08-01T13:47:14Z","date_created":"2023-03-26T22:01:07Z","volume":18,"author":[{"full_name":"Pak, Marina A.","last_name":"Pak","first_name":"Marina A."},{"full_name":"Markhieva, Karina A.","first_name":"Karina A.","last_name":"Markhieva"},{"full_name":"Novikova, Mariia S.","last_name":"Novikova","first_name":"Mariia S."},{"first_name":"Dmitry S.","last_name":"Petrov","full_name":"Petrov, Dmitry S."},{"full_name":"Vorobyev, Ilya S.","last_name":"Vorobyev","first_name":"Ilya S."},{"full_name":"Maksimova, Ekaterina","first_name":"Ekaterina","last_name":"Maksimova","id":"2FBE0DE4-F248-11E8-B48F-1D18A9856A87"},{"id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8243-4694","first_name":"Fyodor","last_name":"Kondrashov","full_name":"Kondrashov, Fyodor"},{"first_name":"Dmitry N.","last_name":"Ivankov","full_name":"Ivankov, Dmitry N."}],"scopus_import":"1","day":"16","has_accepted_license":"1","article_processing_charge":"No","article_type":"original","publication":"PLoS ONE","citation":{"ama":"Pak MA, Markhieva KA, Novikova MS, et al. Using AlphaFold to predict the impact of single mutations on protein stability and function. PLoS ONE. 2023;18(3). doi:10.1371/journal.pone.0282689","apa":"Pak, M. A., Markhieva, K. A., Novikova, M. S., Petrov, D. S., Vorobyev, I. S., Maksimova, E., … Ivankov, D. N. (2023). Using AlphaFold to predict the impact of single mutations on protein stability and function. PLoS ONE. Public Library of Science. https://doi.org/10.1371/journal.pone.0282689","ieee":"M. A. Pak et al., “Using AlphaFold to predict the impact of single mutations on protein stability and function,” PLoS ONE, vol. 18, no. 3. Public Library of Science, 2023.","ista":"Pak MA, Markhieva KA, Novikova MS, Petrov DS, Vorobyev IS, Maksimova E, Kondrashov F, Ivankov DN. 2023. Using AlphaFold to predict the impact of single mutations on protein stability and function. PLoS ONE. 18(3), e0282689.","short":"M.A. Pak, K.A. Markhieva, M.S. Novikova, D.S. Petrov, I.S. Vorobyev, E. Maksimova, F. Kondrashov, D.N. Ivankov, PLoS ONE 18 (2023).","mla":"Pak, Marina A., et al. “Using AlphaFold to Predict the Impact of Single Mutations on Protein Stability and Function.” PLoS ONE, vol. 18, no. 3, e0282689, Public Library of Science, 2023, doi:10.1371/journal.pone.0282689.","chicago":"Pak, Marina A., Karina A. Markhieva, Mariia S. Novikova, Dmitry S. Petrov, Ilya S. Vorobyev, Ekaterina Maksimova, Fyodor Kondrashov, and Dmitry N. Ivankov. “Using AlphaFold to Predict the Impact of Single Mutations on Protein Stability and Function.” PLoS ONE. Public Library of Science, 2023. https://doi.org/10.1371/journal.pone.0282689."},"date_published":"2023-03-16T00:00:00Z","type":"journal_article","abstract":[{"text":"AlphaFold changed the field of structural biology by achieving three-dimensional (3D) structure prediction from protein sequence at experimental quality. The astounding success even led to claims that the protein folding problem is “solved”. However, protein folding problem is more than just structure prediction from sequence. Presently, it is unknown if the AlphaFold-triggered revolution could help to solve other problems related to protein folding. Here we assay the ability of AlphaFold to predict the impact of single mutations on protein stability (ΔΔG) and function. To study the question we extracted the pLDDT and metrics from AlphaFold predictions before and after single mutation in a protein and correlated the predicted change with the experimentally known ΔΔG values. Additionally, we correlated the same AlphaFold pLDDT metrics with the impact of a single mutation on structure using a large scale dataset of single mutations in GFP with the experimentally assayed levels of fluorescence. We found a very weak or no correlation between AlphaFold output metrics and change of protein stability or fluorescence. Our results imply that AlphaFold may not be immediately applied to other problems or applications in protein folding.","lang":"eng"}],"issue":"3","title":"Using AlphaFold to predict the impact of single mutations on protein stability and function","ddc":["570"],"status":"public","intvolume":" 18","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"12758","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2023_PLoSOne_Pak.pdf","creator":"dernst","file_size":856625,"content_type":"application/pdf","file_id":"12771","relation":"main_file","success":1,"checksum":"0281bdfccf8d76c4e08dd011c603f6b6","date_created":"2023-03-27T07:09:08Z","date_updated":"2023-03-27T07:09:08Z"}]},{"quality_controlled":"1","isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"main_file_link":[{"url":"https://doi.org/10.1042/BCJ20210285","open_access":"1"}],"external_id":{"isi":["000957065700001"],"pmid":["36920092"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1042/BCJ20210285","month":"03","publication_identifier":{"issn":["0264-6021"],"eissn":["1470-8728"]},"publication_status":"published","department":[{"_id":"LeSa"}],"publisher":"Portland Press","year":"2023","pmid":1,"date_created":"2023-03-26T22:01:06Z","date_updated":"2023-08-01T13:45:12Z","volume":480,"author":[{"full_name":"Sazanov, Leonid A","last_name":"Sazanov","first_name":"Leonid A","orcid":"0000-0002-0977-7989","id":"338D39FE-F248-11E8-B48F-1D18A9856A87"}],"article_type":"review","page":"319-333","publication":"The Biochemical Journal","citation":{"ama":"Sazanov LA. From the “black box” to “domino effect” mechanism: What have we learned from the structures of respiratory complex I. The Biochemical Journal. 2023;480(5):319-333. doi:10.1042/BCJ20210285","apa":"Sazanov, L. A. (2023). From the “black box” to “domino effect” mechanism: What have we learned from the structures of respiratory complex I. The Biochemical Journal. Portland Press. https://doi.org/10.1042/BCJ20210285","ieee":"L. A. Sazanov, “From the ‘black box’ to ‘domino effect’ mechanism: What have we learned from the structures of respiratory complex I,” The Biochemical Journal, vol. 480, no. 5. Portland Press, pp. 319–333, 2023.","ista":"Sazanov LA. 2023. From the ‘black box’ to ‘domino effect’ mechanism: What have we learned from the structures of respiratory complex I. The Biochemical Journal. 480(5), 319–333.","short":"L.A. Sazanov, The Biochemical Journal 480 (2023) 319–333.","mla":"Sazanov, Leonid A. “From the ‘black Box’ to ‘Domino Effect’ Mechanism: What Have We Learned from the Structures of Respiratory Complex I.” The Biochemical Journal, vol. 480, no. 5, Portland Press, 2023, pp. 319–33, doi:10.1042/BCJ20210285.","chicago":"Sazanov, Leonid A. “From the ‘black Box’ to ‘Domino Effect’ Mechanism: What Have We Learned from the Structures of Respiratory Complex I.” The Biochemical Journal. Portland Press, 2023. https://doi.org/10.1042/BCJ20210285."},"date_published":"2023-03-15T00:00:00Z","scopus_import":"1","day":"15","has_accepted_license":"1","article_processing_charge":"No","status":"public","ddc":["570"],"title":"From the 'black box' to 'domino effect' mechanism: What have we learned from the structures of respiratory complex I","intvolume":" 480","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"12757","oa_version":"Published Version","type":"journal_article","abstract":[{"text":"My group and myself have studied respiratory complex I for almost 30 years, starting in 1994 when it was known as a L-shaped giant ‘black box' of bioenergetics. First breakthrough was the X-ray structure of the peripheral arm, followed by structures of the membrane arm and finally the entire complex from Thermus thermophilus. The developments in cryo-EM technology allowed us to solve the first complete structure of the twice larger, ∼1 MDa mammalian enzyme in 2016. However, the mechanism coupling, over large distances, the transfer of two electrons to pumping of four protons across the membrane remained an enigma. Recently we have solved high-resolution structures of mammalian and bacterial complex I under a range of redox conditions, including catalytic turnover. This allowed us to propose a robust and universal mechanism for complex I and related protein families. Redox reactions initially drive conformational changes around the quinone cavity and a long-distance transfer of substrate protons. These set up a stage for a series of electrostatically driven proton transfers along the membrane arm (‘domino effect'), eventually resulting in proton expulsion from the distal antiporter-like subunit. The mechanism radically differs from previous suggestions, however, it naturally explains all the unusual structural features of complex I. In this review I discuss the state of knowledge on complex I, including the current most controversial issues.","lang":"eng"}],"issue":"5"},{"date_published":"2023-03-29T00:00:00Z","citation":{"chicago":"Svoboda, Jakub, Josef Tkadlec, Kamran Kaveh, and Krishnendu Chatterjee. “Coexistence Times in the Moran Process with Environmental Heterogeneity.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. The Royal Society, 2023. https://doi.org/10.1098/rspa.2022.0685.","mla":"Svoboda, Jakub, et al. “Coexistence Times in the Moran Process with Environmental Heterogeneity.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 479, no. 2271, 20220685, The Royal Society, 2023, doi:10.1098/rspa.2022.0685.","short":"J. Svoboda, J. Tkadlec, K. Kaveh, K. Chatterjee, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 479 (2023).","ista":"Svoboda J, Tkadlec J, Kaveh K, Chatterjee K. 2023. Coexistence times in the Moran process with environmental heterogeneity. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 479(2271), 20220685.","ieee":"J. Svoboda, J. Tkadlec, K. Kaveh, and K. Chatterjee, “Coexistence times in the Moran process with environmental heterogeneity,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 479, no. 2271. The Royal Society, 2023.","apa":"Svoboda, J., Tkadlec, J., Kaveh, K., & Chatterjee, K. (2023). Coexistence times in the Moran process with environmental heterogeneity. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. The Royal Society. https://doi.org/10.1098/rspa.2022.0685","ama":"Svoboda J, Tkadlec J, Kaveh K, Chatterjee K. Coexistence times in the Moran process with environmental heterogeneity. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 2023;479(2271). doi:10.1098/rspa.2022.0685"},"publication":"Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences","article_type":"original","has_accepted_license":"1","article_processing_charge":"No","day":"29","scopus_import":"1","oa_version":"Published Version","file":[{"date_created":"2023-04-03T06:25:29Z","date_updated":"2023-04-03T06:25:29Z","success":1,"checksum":"13953d349fbefcb5d21ccc6b303297eb","file_id":"12796","relation":"main_file","creator":"dernst","file_size":827784,"content_type":"application/pdf","file_name":"2023_ProceedingsRoyalSocietyA_Svoboda.pdf","access_level":"open_access"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"12787","intvolume":" 479","ddc":["000"],"status":"public","title":"Coexistence times in the Moran process with environmental heterogeneity","issue":"2271","abstract":[{"lang":"eng","text":"Populations evolve in spatially heterogeneous environments. While a certain trait might bring a fitness advantage in some patch of the environment, a different trait might be advantageous in another patch. Here, we study the Moran birth–death process with two types of individuals in a population stretched across two patches of size N, each patch favouring one of the two types. We show that the long-term fate of such populations crucially depends on the migration rate μ\r\n between the patches. To classify the possible fates, we use the distinction between polynomial (short) and exponential (long) timescales. We show that when μ is high then one of the two types fixates on the whole population after a number of steps that is only polynomial in N. By contrast, when μ is low then each type holds majority in the patch where it is favoured for a number of steps that is at least exponential in N. Moreover, we precisely identify the threshold migration rate μ⋆ that separates those two scenarios, thereby exactly delineating the situations that support long-term coexistence of the two types. We also discuss the case of various cycle graphs and we present computer simulations that perfectly match our analytical results."}],"type":"journal_article","doi":"10.1098/rspa.2022.0685","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000957125500002"]},"project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"quality_controlled":"1","isi":1,"publication_identifier":{"eissn":["1471-2946"],"issn":["1364-5021"]},"month":"03","related_material":{"link":[{"relation":"research_data","url":"https://doi.org/10.6084/m9.figshare.21261771.v1"}]},"author":[{"last_name":"Svoboda","first_name":"Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","full_name":"Svoboda, Jakub"},{"full_name":"Tkadlec, Josef","first_name":"Josef","last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684"},{"first_name":"Kamran","last_name":"Kaveh","full_name":"Kaveh, Kamran"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"}],"volume":479,"date_updated":"2023-08-01T13:58:34Z","date_created":"2023-04-02T22:01:09Z","year":"2023","acknowledgement":"J.S. and K.C. acknowledge support from the ERC CoG 863818 (ForM-SMArt)","publisher":"The Royal Society","department":[{"_id":"KrCh"}],"publication_status":"published","ec_funded":1,"file_date_updated":"2023-04-03T06:25:29Z","article_number":"20220685"},{"abstract":[{"text":"We show that the simplest of existing molecules—closed-shell diatomics not interacting with one another—host topological charges when driven by periodic far-off-resonant laser pulses. A periodically kicked molecular rotor can be mapped onto a “crystalline” lattice in angular momentum space. This allows us to define quasimomenta and the band structure in the Floquet representation, by analogy with the Bloch waves of solid-state physics. Applying laser pulses spaced by 1/3 of the molecular rotational period creates a lattice with three atoms per unit cell with staggered hopping. Within the synthetic dimension of the laser strength, we discover Dirac cones with topological charges. These Dirac cones, topologically protected by reflection and time-reversal symmetry, are reminiscent of (although not equivalent to) that seen in graphene. They—and the corresponding edge states—are broadly tunable by adjusting the laser strength and can be observed in present-day experiments by measuring molecular alignment and populations of rotational levels. This paves the way to study controllable topological physics in gas-phase experiments with small molecules as well as to classify dynamical molecular states by their topological invariants.","lang":"eng"}],"issue":"10","type":"journal_article","oa_version":"Preprint","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"12788","title":"Topological charges of periodically kicked molecules","status":"public","intvolume":" 130","day":"10","article_processing_charge":"No","scopus_import":"1","date_published":"2023-03-10T00:00:00Z","publication":"Physical Review Letters","citation":{"short":"V. Karle, A. Ghazaryan, M. Lemeshko, Physical Review Letters 130 (2023).","mla":"Karle, Volker, et al. “Topological Charges of Periodically Kicked Molecules.” Physical Review Letters, vol. 130, no. 10, 103202, American Physical Society, 2023, doi:10.1103/PhysRevLett.130.103202.","chicago":"Karle, Volker, Areg Ghazaryan, and Mikhail Lemeshko. “Topological Charges of Periodically Kicked Molecules.” Physical Review Letters. American Physical Society, 2023. https://doi.org/10.1103/PhysRevLett.130.103202.","ama":"Karle V, Ghazaryan A, Lemeshko M. Topological charges of periodically kicked molecules. Physical Review Letters. 2023;130(10). doi:10.1103/PhysRevLett.130.103202","apa":"Karle, V., Ghazaryan, A., & Lemeshko, M. (2023). Topological charges of periodically kicked molecules. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.130.103202","ieee":"V. Karle, A. Ghazaryan, and M. Lemeshko, “Topological charges of periodically kicked molecules,” Physical Review Letters, vol. 130, no. 10. American Physical Society, 2023.","ista":"Karle V, Ghazaryan A, Lemeshko M. 2023. Topological charges of periodically kicked molecules. Physical Review Letters. 130(10), 103202."},"article_type":"original","ec_funded":1,"article_number":"103202","author":[{"full_name":"Karle, Volker","last_name":"Karle","first_name":"Volker","id":"D7C012AE-D7ED-11E9-95E8-1EC5E5697425"},{"full_name":"Ghazaryan, Areg","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9666-3543","first_name":"Areg","last_name":"Ghazaryan"},{"last_name":"Lemeshko","first_name":"Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","full_name":"Lemeshko, Mikhail"}],"related_material":{"link":[{"url":"https://ista.ac.at/en/news/topology-of-rotating-molecules/","relation":"press_release","description":"News on the ISTA website"}]},"date_updated":"2023-08-01T14:02:06Z","date_created":"2023-04-02T22:01:10Z","volume":130,"acknowledgement":"M. L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON).","year":"2023","publication_status":"published","publisher":"American Physical Society","department":[{"_id":"MiLe"}],"month":"03","publication_identifier":{"eissn":["1079-7114"],"issn":["0031-9007"]},"doi":"10.1103/PhysRevLett.130.103202","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2206.07067","open_access":"1"}],"oa":1,"external_id":{"isi":["000957635500003"],"arxiv":["2206.07067"]},"isi":1,"quality_controlled":"1","project":[{"name":"Angulon: physics and applications of a new quasiparticle","call_identifier":"H2020","grant_number":"801770","_id":"2688CF98-B435-11E9-9278-68D0E5697425"}]},{"month":"03","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"quality_controlled":"1","isi":1,"external_id":{"isi":["000945526400003"],"arxiv":["2211.02492"]},"oa":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2211.02492","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1103/PhysRevB.107.104502","article_number":"104502","publication_status":"published","publisher":"American Physical Society","department":[{"_id":"MaSe"},{"_id":"MiLe"}],"acknowledgement":"E.B. and T.H. were supported by the European Research Council (ERC) under grant HQMAT (Grant Agreement No. 817799), by the Israel-USA Binational Science Foundation (BSF), and by a Research grant from Irving and Cherna Moskowitz.","year":"2023","date_created":"2023-04-02T22:01:10Z","date_updated":"2023-08-01T13:59:29Z","volume":107,"author":[{"orcid":"0000-0001-9666-3543","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87","last_name":"Ghazaryan","first_name":"Areg","full_name":"Ghazaryan, Areg"},{"full_name":"Holder, Tobias","last_name":"Holder","first_name":"Tobias"},{"full_name":"Berg, Erez","last_name":"Berg","first_name":"Erez"},{"orcid":"0000-0002-2399-5827","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","last_name":"Serbyn","first_name":"Maksym","full_name":"Serbyn, Maksym"}],"related_material":{"link":[{"description":"News on the ISTA website","relation":"press_release","url":"https://ista.ac.at/en/news/reaching-superconductivity-layer-by-layer/"}]},"scopus_import":"1","day":"01","article_processing_charge":"No","article_type":"original","publication":"Physical Review B","citation":{"chicago":"Ghazaryan, Areg, Tobias Holder, Erez Berg, and Maksym Serbyn. “Multilayer Graphenes as a Platform for Interaction-Driven Physics and Topological Superconductivity.” Physical Review B. American Physical Society, 2023. https://doi.org/10.1103/PhysRevB.107.104502.","mla":"Ghazaryan, Areg, et al. “Multilayer Graphenes as a Platform for Interaction-Driven Physics and Topological Superconductivity.” Physical Review B, vol. 107, no. 10, 104502, American Physical Society, 2023, doi:10.1103/PhysRevB.107.104502.","short":"A. Ghazaryan, T. Holder, E. Berg, M. Serbyn, Physical Review B 107 (2023).","ista":"Ghazaryan A, Holder T, Berg E, Serbyn M. 2023. Multilayer graphenes as a platform for interaction-driven physics and topological superconductivity. Physical Review B. 107(10), 104502.","apa":"Ghazaryan, A., Holder, T., Berg, E., & Serbyn, M. (2023). Multilayer graphenes as a platform for interaction-driven physics and topological superconductivity. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.107.104502","ieee":"A. Ghazaryan, T. Holder, E. Berg, and M. Serbyn, “Multilayer graphenes as a platform for interaction-driven physics and topological superconductivity,” Physical Review B, vol. 107, no. 10. American Physical Society, 2023.","ama":"Ghazaryan A, Holder T, Berg E, Serbyn M. Multilayer graphenes as a platform for interaction-driven physics and topological superconductivity. Physical Review B. 2023;107(10). doi:10.1103/PhysRevB.107.104502"},"date_published":"2023-03-01T00:00:00Z","type":"journal_article","abstract":[{"text":"Motivated by the recent discoveries of superconductivity in bilayer and trilayer graphene, we theoretically investigate superconductivity and other interaction-driven phases in multilayer graphene stacks. To this end, we study the density of states of multilayer graphene with up to four layers at the single-particle band structure level in the presence of a transverse electric field. Among the considered structures, tetralayer graphene with rhombohedral (ABCA) stacking reaches the highest density of states. We study the phases that can arise in ABCA graphene by tuning the carrier density and transverse electric field. For a broad region of the tuning parameters, the presence of strong Coulomb repulsion leads to a spontaneous spin and valley symmetry breaking via Stoner transitions. Using a model that incorporates the spontaneous spin and valley polarization, we explore the Kohn-Luttinger mechanism for superconductivity driven by repulsive Coulomb interactions. We find that the strongest superconducting instability is in the p-wave channel, and occurs in proximity to the onset of Stoner transitions. Interestingly, we find a range of densities and transverse electric fields where superconductivity develops out of a strongly corrugated, singly connected Fermi surface in each valley, leading to a topologically nontrivial chiral p+ip superconducting state with an even number of copropagating chiral Majorana edge modes. Our work establishes ABCA-stacked tetralayer graphene as a promising platform for observing strongly correlated physics and topological superconductivity.","lang":"eng"}],"issue":"10","status":"public","title":"Multilayer graphenes as a platform for interaction-driven physics and topological superconductivity","intvolume":" 107","_id":"12790","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Preprint"}]