[{"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","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2023_LNCS_ChalupaM.pdf","file_size":580828,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"12865","checksum":"17a7c8e08be609cf2408d37ea55e322c","success":1,"date_created":"2023-04-25T07:16:36Z","date_updated":"2023-04-25T07:16:36Z"}],"intvolume":" 13991","ddc":["000"],"title":"Vamos: Middleware for best-effort third-party monitoring","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12856","has_accepted_license":"1","article_processing_charge":"No","day":"20","date_published":"2023-04-20T00:00:00Z","page":"260-281","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","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.","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","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.","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.","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.","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."},"publication":"Fundamental Approaches to Software Engineering","ec_funded":1,"file_date_updated":"2023-04-25T07:16:36Z","volume":13991,"date_created":"2023-04-20T08:29:42Z","date_updated":"2023-04-25T07:19:07Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"12407"}]},"author":[{"id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","first_name":"Marek","last_name":"Chalupa","full_name":"Chalupa, Marek"},{"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"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"}],"publisher":"Springer Nature","department":[{"_id":"ToHe"}],"publication_status":"published","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","publication_identifier":{"isbn":["9783031308253"],"eissn":["1611-3349"],"eisbn":["9783031308260"],"issn":["0302-9743"]},"month":"04","language":[{"iso":"eng"}],"doi":"10.1007/978-3-031-30826-0_15","conference":{"end_date":"2023-04-27","start_date":"2023-04-22","location":"Paris, France","name":"FASE: Fundamental Approaches to Software Engineering"},"project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"}],"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"}},{"type":"technical_report","alternative_title":["IST Austria Technical Report"],"abstract":[{"lang":"eng","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."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12407","title":"VAMOS: Middleware for Best-Effort Third-Party Monitoring","ddc":["005"],"status":"public","file":[{"file_size":662409,"content_type":"application/pdf","creator":"fmuehlbo","file_name":"main.pdf","access_level":"open_access","date_created":"2023-01-27T03:18:34Z","date_updated":"2023-01-27T03:18:34Z","checksum":"55426e463fdeafe9777fc3ff635154c7","success":1,"relation":"main_file","file_id":"12408"}],"oa_version":"Published Version","keyword":["runtime monitoring","best effort","third party"],"has_accepted_license":"1","article_processing_charge":"No","day":"27","citation":{"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.","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.","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","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.","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","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."},"page":"38","date_published":"2023-01-27T00:00:00Z","ec_funded":1,"file_date_updated":"2023-01-27T03:18:34Z","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.","year":"2023","department":[{"_id":"ToHe"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","related_material":{"record":[{"id":"12856","relation":"later_version","status":"public"}]},"author":[{"full_name":"Chalupa, Marek","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","last_name":"Chalupa","first_name":"Marek"},{"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","last_name":"Muroya Lei","first_name":"Stefanie","id":"a376de31-8972-11ed-ae7b-d0251c13c8ff"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"}],"date_created":"2023-01-27T03:18:08Z","date_updated":"2023-04-25T07:19:06Z","publication_identifier":{"eissn":["2664-1690"]},"month":"01","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":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020"}],"doi":"10.15479/AT:ISTA:12407","language":[{"iso":"eng"}]},{"article_processing_charge":"No","day":"02","date_published":"2023-06-02T00:00:00Z","page":"1768-1776","citation":{"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.","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","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."},"publication":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","abstract":[{"lang":"eng","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."}],"type":"conference","oa_version":"Preprint","title":"Hausdorff and Gromov-Hausdorff stable subsets of the medial axis","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"13048","publication_identifier":{"isbn":["9781450399135"]},"month":"06","language":[{"iso":"eng"}],"doi":"10.1145/3564246.3585113","conference":{"name":"STOC: Symposium on Theory of Computing","location":"Orlando, FL, United States","start_date":"2023-06-20","end_date":"2023-06-23"},"project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"name":"Learning and triangulating manifolds via collapses","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2","grant_number":"M03073"}],"quality_controlled":"1","external_id":{"arxiv":["2303.04014"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2303.04014"}],"oa":1,"ec_funded":1,"date_updated":"2023-05-22T08:15:19Z","date_created":"2023-05-22T08:02:02Z","author":[{"first_name":"André","last_name":"Lieutier","full_name":"Lieutier, André"},{"full_name":"Wintraecken, Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220","first_name":"Mathijs","last_name":"Wintraecken"}],"department":[{"_id":"HeEd"}],"publisher":"Association for Computing Machinery","publication_status":"published","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."},{"publication":"11th International Conference on Learning Representations ","main_file_link":[{"url":"https://openreview.net/pdf?id=_eTZBs-yedr","open_access":"1"}],"external_id":{"arxiv":["2207.14200"]},"oa":1,"citation":{"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 .","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.","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 .","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."},"quality_controlled":"1","project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning"}],"conference":{"name":"ICLR: International Conference on Learning Representations","end_date":"2023-05-05","location":"Kigali, Rwanda ","start_date":"2023-05-01"},"date_published":"2023-05-01T00:00:00Z","acknowledged_ssus":[{"_id":"ScienComp"}],"language":[{"iso":"eng"}],"month":"05","article_processing_charge":"No","_id":"13053","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)-","year":"2023","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"CrAM: A Compression-Aware Minimizer","publication_status":"accepted","department":[{"_id":"GradSch"},{"_id":"DaAl"},{"_id":"ChLa"}],"author":[{"full_name":"Peste, Elena-Alexandra","last_name":"Peste","first_name":"Elena-Alexandra","id":"32D78294-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Vladu","first_name":"Adrian","full_name":"Vladu, Adrian"},{"full_name":"Kurtic, Eldar","id":"47beb3a5-07b5-11eb-9b87-b108ec578218","last_name":"Kurtic","first_name":"Eldar"},{"first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"},{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"}],"related_material":{"record":[{"id":"13074","relation":"dissertation_contains","status":"public"}]},"date_created":"2023-05-23T11:36:18Z","date_updated":"2023-06-01T12:54:45Z","oa_version":"Preprint","type":"conference","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},{"alternative_title":["LNCS"],"type":"conference","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."}],"status":"public","title":"Certifying giant nonprimes","intvolume":" 13940","_id":"13143","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","scopus_import":"1","day":"02","article_processing_charge":"No","page":"530-553","publication":"Public-Key Cryptography - PKC 2023","citation":{"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.","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.","short":"C. Hoffmann, P. Hubáček, C. Kamath, K.Z. Pietrzak, in:, Public-Key Cryptography - PKC 2023, Springer Nature, 2023, 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.","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.","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"},"date_published":"2023-05-02T00:00:00Z","publication_status":"published","department":[{"_id":"KrPi"}],"publisher":"Springer Nature","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.","year":"2023","date_updated":"2023-06-19T08:03:37Z","date_created":"2023-06-18T22:00:47Z","volume":13940,"author":[{"last_name":"Hoffmann","first_name":"Charlotte","id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7","full_name":"Hoffmann, Charlotte"},{"last_name":"Hubáček","first_name":"Pavel","full_name":"Hubáček, Pavel"},{"first_name":"Chethan","last_name":"Kamath","full_name":"Kamath, Chethan"},{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak"}],"month":"05","publication_identifier":{"isbn":["9783031313677"],"eissn":["1611-3349"],"issn":["0302-9743"]},"quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://eprint.iacr.org/2023/238","open_access":"1"}],"language":[{"iso":"eng"}],"conference":{"name":"PKC: Public-Key Cryptography","end_date":"2023-05-10","location":"Atlanta, GA, United States","start_date":"2023-05-07"},"doi":"10.1007/978-3-031-31368-4_19"},{"day":"22","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","date_published":"2023-04-22T00:00:00Z","publication":"Tools and Algorithms for the Construction and Analysis of Systems ","citation":{"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","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","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.","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.","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.","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.","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."},"page":"3-25","abstract":[{"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.","lang":"eng"}],"type":"conference","alternative_title":["LNCS"],"oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2023_LNCS_Chatterjee.pdf","file_size":528455,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"13150","checksum":"3d8a8bb24d211bc83360dfc2fd744307","success":1,"date_created":"2023-06-19T08:29:30Z","date_updated":"2023-06-19T08:29:30Z"}],"_id":"13142","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"A learner-verifier framework for neural network controllers and certificates of stochastic systems","status":"public","ddc":["000"],"intvolume":" 13993","month":"04","publication_identifier":{"isbn":["9783031308222"],"eissn":["1611-3349"],"issn":["0302-9743"]},"conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2023-04-27","location":"Paris, France","start_date":"2023-04-22"},"doi":"10.1007/978-3-031-30823-9_1","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","project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program"}],"file_date_updated":"2023-06-19T08:29:30Z","ec_funded":1,"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias"},{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","first_name":"Dorde","full_name":"Zikelic, Dorde"}],"date_created":"2023-06-18T22:00:47Z","date_updated":"2023-06-19T08:30:54Z","volume":13993,"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"},{"scopus_import":"1","day":"20","has_accepted_license":"1","article_processing_charge":"No","publication":"TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems","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."},"page":"211-228","date_published":"2023-04-20T00:00:00Z","type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","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."}],"_id":"13141","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Computing adequately permissive assumptions for synthesis","ddc":["000"],"intvolume":" 13994","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"13151","checksum":"60dcafc1b4f6f070be43bad3fe877974","success":1,"date_updated":"2023-06-19T08:43:21Z","date_created":"2023-06-19T08:43:21Z","access_level":"open_access","file_name":"2023_LNCS_Anand.pdf","file_size":521425,"content_type":"application/pdf","creator":"dernst"}],"month":"04","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031308192"],"issn":["0302-9743"]},"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","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"},"doi":"10.1007/978-3-031-30820-8_15","language":[{"iso":"eng"}],"file_date_updated":"2023-06-19T08:43:21Z","year":"2023","publication_status":"published","publisher":"Springer Nature","department":[{"_id":"ToHe"}],"author":[{"last_name":"Anand","first_name":"Ashwani","full_name":"Anand, Ashwani"},{"id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","orcid":"0000-0001-9864-7475","first_name":"Kaushik","last_name":"Mallik","full_name":"Mallik, Kaushik"},{"first_name":"Satya Prakash","last_name":"Nayak","full_name":"Nayak, Satya Prakash"},{"last_name":"Schmuck","first_name":"Anne Kathrin","full_name":"Schmuck, Anne Kathrin"}],"date_created":"2023-06-18T22:00:47Z","date_updated":"2023-06-19T08:49:46Z","volume":13994},{"month":"04","publication_identifier":{"issn":["2663 - 337X"]},"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"}],"language":[{"iso":"eng"}],"doi":"10.15479/at:ista:12826","project":[{"name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"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"},"file_date_updated":"2023-04-20T09:26:51Z","ec_funded":1,"date_updated":"2023-06-23T09:47:36Z","date_created":"2023-04-14T14:56:04Z","author":[{"full_name":"Pokusaeva, Victoria","last_name":"Pokusaeva","first_name":"Victoria","orcid":"0000-0001-7660-444X","id":"3184041C-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"MaJö"},{"_id":"GradSch"}],"year":"2023","day":"18","has_accepted_license":"1","article_processing_charge":"No","date_published":"2023-04-18T00:00:00Z","page":"106","citation":{"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.","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.","ama":"Pokusaeva V. Neural control of optic flow-based navigation in Drosophila melanogaster. 2023. doi:10.15479/at:ista:12826","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"},"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","oa_version":"Published Version","file":[{"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_size":14507243,"creator":"vpokusae","access_level":"closed","file_name":"Thesis_Pokusaeva.docx","checksum":"5f589a9af025f7eeebfd0c186209913e","date_created":"2023-04-20T09:14:38Z","date_updated":"2023-04-20T09:26:51Z","relation":"source_file","file_id":"12857"},{"file_name":"Thesis_Pokusaeva.pdf","access_level":"open_access","content_type":"application/pdf","file_size":10090711,"creator":"vpokusae","relation":"main_file","file_id":"12858","date_created":"2023-04-20T09:14:44Z","date_updated":"2023-04-20T09:14:44Z","checksum":"bbeed76db45a996b4c91a9abe12ce0ec","success":1}],"title":"Neural control of optic flow-based navigation in Drosophila melanogaster","ddc":["570","571"],"status":"public","_id":"12826","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9"},{"publication":"Algorithmica","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.","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","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."},"article_type":"original","page":"277-295","date_published":"2023-01-01T00:00:00Z","scopus_import":"1","day":"01","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","_id":"12086","status":"public","ddc":["510"],"title":"A simple algorithm for higher-order Delaunay mosaics and alpha shapes","intvolume":" 85","oa_version":"Published Version","file":[{"file_size":911017,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2023_Algorithmica_Edelsbrunner.pdf","checksum":"71685ca5121f4c837f40c3f8eb50c915","success":1,"date_created":"2023-01-20T10:02:48Z","date_updated":"2023-01-20T10:02:48Z","relation":"main_file","file_id":"12322"}],"type":"journal_article","abstract":[{"lang":"eng","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."}],"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,"isi":1,"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183"},{"_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Persistence and stability of geometric complexes"}],"doi":"10.1007/s00453-022-01027-6","language":[{"iso":"eng"}],"month":"01","publication_identifier":{"issn":["0178-4617"],"eissn":["1432-0541"]},"year":"2023","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.","publication_status":"published","department":[{"_id":"HeEd"}],"publisher":"Springer Nature","author":[{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"full_name":"Osang, Georg F","last_name":"Osang","first_name":"Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2023-06-27T12:53:43Z","date_created":"2022-09-11T22:01:57Z","volume":85,"file_date_updated":"2023-01-20T10:02:48Z","ec_funded":1},{"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).","publication_status":"published","publisher":"Springer Nature","department":[{"_id":"JaMa"}],"author":[{"full_name":"Dello Schiavo, Lorenzo","id":"ECEBF480-9E4F-11EA-B557-B0823DDC885E","orcid":"0000-0002-9881-6870","first_name":"Lorenzo","last_name":"Dello Schiavo"},{"full_name":"Wirth, Melchior","orcid":"0000-0002-0519-4241","id":"88644358-0A0E-11EA-8FA5-49A33DDC885E","last_name":"Wirth","first_name":"Melchior"}],"date_created":"2023-01-08T23:00:53Z","date_updated":"2023-06-28T11:54:35Z","volume":23,"article_number":"9","file_date_updated":"2023-01-20T10:45:06Z","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"},"external_id":{"isi":["000906214600004"]},"oa":1,"quality_controlled":"1","isi":1,"project":[{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems"},{"name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425","grant_number":"716117"},{"name":"Configuration Spaces over Non-Smooth Spaces","_id":"34dbf174-11ca-11ed-8bc3-afe9d43d4b9c","grant_number":"E208"},{"name":"Gradient flow techniques for quantum Markov semigroups","_id":"34c6ea2d-11ca-11ed-8bc3-c04f3c502833","grant_number":"ESP156_N"}],"doi":"10.1007/s00028-022-00859-7","language":[{"iso":"eng"}],"month":"01","publication_identifier":{"issn":["1424-3199"],"eissn":["1424-3202"]},"_id":"12104","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Ergodic decompositions of Dirichlet forms under order isomorphisms","ddc":["510"],"status":"public","intvolume":" 23","file":[{"checksum":"1f34f3e2cb521033de6154f274ea3a4e","success":1,"date_updated":"2023-01-20T10:45:06Z","date_created":"2023-01-20T10:45:06Z","relation":"main_file","file_id":"12325","content_type":"application/pdf","file_size":422612,"creator":"dernst","access_level":"open_access","file_name":"2023_JourEvolutionEquations_DelloSchiavo.pdf"}],"oa_version":"Published Version","type":"journal_article","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."}],"issue":"1","publication":"Journal of Evolution Equations","citation":{"short":"L. Dello Schiavo, M. Wirth, Journal of Evolution Equations 23 (2023).","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.","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","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","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.","ista":"Dello Schiavo L, Wirth M. 2023. Ergodic decompositions of Dirichlet forms under order isomorphisms. Journal of Evolution Equations. 23(1), 9."},"article_type":"original","date_published":"2023-01-01T00:00:00Z","scopus_import":"1","day":"01","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)"}]