[{"alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"The main idea behind BUBAAK is to run multiple program analyses in parallel and use runtime monitoring and enforcement to observe and control their progress in real time. The analyses send information about (un)explored states of the program and discovered invariants to a monitor. The monitor processes the received data and can force an analysis to stop the search of certain program parts (which have already been analyzed by other analyses), or to make it utilize a program invariant found by another analysis.\r\nAt SV-COMP 2023, the implementation of data exchange between the monitor and the analyses was not yet completed, which is why BUBAAK only ran several analyses in parallel, without any coordination. Still, BUBAAK won the meta-category FalsificationOverall and placed very well in several other (sub)-categories of the competition.","lang":"eng"}],"title":"Bubaak: Runtime monitoring of program verifiers","status":"public","ddc":["000"],"intvolume":" 13994","_id":"12854","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"success":1,"checksum":"120d2c2a38384058ad0630fdf8288312","date_updated":"2023-04-25T06:58:36Z","date_created":"2023-04-25T06:58:36Z","file_id":"12864","relation":"main_file","creator":"dernst","file_size":16096413,"content_type":"application/pdf","access_level":"open_access","file_name":"2023_LNCS_Chalupa.pdf"}],"oa_version":"Published Version","day":"20","has_accepted_license":"1","article_processing_charge":"No","page":"535-540","publication":"Tools and Algorithms for the Construction and Analysis of Systems","citation":{"ista":"Chalupa M, Henzinger TA. 2023. Bubaak: Runtime monitoring of program verifiers. Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13994, 535–540.","apa":"Chalupa, M., & Henzinger, T. A. (2023). Bubaak: Runtime monitoring of program verifiers. In Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13994, pp. 535–540). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-30820-8_32","ieee":"M. Chalupa and T. A. Henzinger, “Bubaak: Runtime monitoring of program verifiers,” in Tools and Algorithms for the Construction and Analysis of Systems, Paris, France, 2023, vol. 13994, pp. 535–540.","ama":"Chalupa M, Henzinger TA. Bubaak: Runtime monitoring of program verifiers. In: Tools and Algorithms for the Construction and Analysis of Systems. Vol 13994. Springer Nature; 2023:535-540. doi:10.1007/978-3-031-30820-8_32","chicago":"Chalupa, Marek, and Thomas A Henzinger. “Bubaak: Runtime Monitoring of Program Verifiers.” In Tools and Algorithms for the Construction and Analysis of Systems, 13994:535–40. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30820-8_32.","mla":"Chalupa, Marek, and Thomas A. Henzinger. “Bubaak: Runtime Monitoring of Program Verifiers.” Tools and Algorithms for the Construction and Analysis of Systems, vol. 13994, Springer Nature, 2023, pp. 535–40, doi:10.1007/978-3-031-30820-8_32.","short":"M. Chalupa, T.A. Henzinger, in:, Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2023, pp. 535–540."},"date_published":"2023-04-20T00:00:00Z","license":"https://creativecommons.org/licenses/by/4.0/","file_date_updated":"2023-04-25T06:58:36Z","ec_funded":1,"publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Springer Nature","year":"2023","acknowledgement":"This work was supported by the ERC-2020-AdG 10102009 grant.","date_updated":"2023-04-25T07:02:43Z","date_created":"2023-04-20T08:22:53Z","volume":13994,"author":[{"full_name":"Chalupa, Marek","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","first_name":"Marek","last_name":"Chalupa"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"month":"04","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031308192"],"issn":["0302-9743"],"eisbn":["9783031308208"]},"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"}],"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"}],"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_32"},{"abstract":[{"lang":"eng","text":"We present a formula for the signed area of a spherical polygon via prequantization. In contrast to the traditional formula based on the Gauss-Bonnet theorem that requires measuring angles, the new formula mimics Green's theorem and is applicable to a wider range of degenerate spherical curves and polygons."}],"type":"preprint","article_number":"2303.14555","oa_version":"Preprint","date_created":"2023-04-18T19:16:06Z","date_updated":"2023-04-25T06:51:21Z","author":[{"full_name":"Chern, Albert","last_name":"Chern","first_name":"Albert"},{"full_name":"Ishida, Sadashige","first_name":"Sadashige","last_name":"Ishida","id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425"}],"department":[{"_id":"GradSch"},{"_id":"ChWo"}],"status":"public","publication_status":"submitted","title":"Area formula for spherical polygons via prequantization","_id":"12846","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The authors acknowledge Chris Wojtan for his continuous support to the present work through discussions and advice. The second author thanks Anna Sisak for a fruitful discussion on prequantum bundles. This project was funded in part by the European Research Council (ERC Consolidator Grant 101045083 CoDiNA).","year":"2023","article_processing_charge":"No","month":"03","day":"25","language":[{"iso":"eng"}],"date_published":"2023-03-25T00:00:00Z","doi":"10.48550/arXiv.2303.14555","project":[{"_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","grant_number":"101045083","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena"}],"oa":1,"citation":{"ista":"Chern A, Ishida S. Area formula for spherical polygons via prequantization. arXiv, 2303.14555.","ieee":"A. Chern and S. Ishida, “Area formula for spherical polygons via prequantization,” arXiv. .","apa":"Chern, A., & Ishida, S. (n.d.). Area formula for spherical polygons via prequantization. arXiv. https://doi.org/10.48550/arXiv.2303.14555","ama":"Chern A, Ishida S. Area formula for spherical polygons via prequantization. arXiv. doi:10.48550/arXiv.2303.14555","chicago":"Chern, Albert, and Sadashige Ishida. “Area Formula for Spherical Polygons via Prequantization.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2303.14555.","mla":"Chern, Albert, and Sadashige Ishida. “Area Formula for Spherical Polygons via Prequantization.” ArXiv, 2303.14555, doi:10.48550/arXiv.2303.14555.","short":"A. Chern, S. Ishida, ArXiv (n.d.)."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2303.14555"}],"external_id":{"arxiv":["2303.14555"]},"publication":"arXiv"},{"type":"conference","alternative_title":["LNCS"],"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"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12856","intvolume":" 13991","ddc":["000"],"title":"Vamos: Middleware for best-effort third-party monitoring","status":"public","oa_version":"Published Version","file":[{"file_name":"2023_LNCS_ChalupaM.pdf","access_level":"open_access","creator":"dernst","file_size":580828,"content_type":"application/pdf","file_id":"12865","relation":"main_file","date_created":"2023-04-25T07:16:36Z","date_updated":"2023-04-25T07:16:36Z","success":1,"checksum":"17a7c8e08be609cf2408d37ea55e322c"}],"article_processing_charge":"No","has_accepted_license":"1","day":"20","citation":{"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.","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.","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.","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"},"publication":"Fundamental Approaches to Software Engineering","page":"260-281","date_published":"2023-04-20T00:00:00Z","ec_funded":1,"file_date_updated":"2023-04-25T07:16:36Z","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","publisher":"Springer Nature","department":[{"_id":"ToHe"}],"publication_status":"published","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"12407"}]},"author":[{"id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","last_name":"Chalupa","first_name":"Marek","full_name":"Chalupa, Marek"},{"first_name":"Fabian","last_name":"Mühlböck","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","orcid":"0000-0003-1548-0177","full_name":"Mühlböck, Fabian"},{"full_name":"Muroya Lei, Stefanie","last_name":"Muroya Lei","first_name":"Stefanie","id":"a376de31-8972-11ed-ae7b-d0251c13c8ff"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"volume":13991,"date_created":"2023-04-20T08:29:42Z","date_updated":"2023-04-25T07:19:07Z","publication_identifier":{"eisbn":["9783031308260"],"issn":["0302-9743"],"isbn":["9783031308253"],"eissn":["1611-3349"]},"month":"04","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":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020"}],"quality_controlled":"1","doi":"10.1007/978-3-031-30826-0_15","conference":{"name":"FASE: Fundamental Approaches to Software Engineering","end_date":"2023-04-27","location":"Paris, France","start_date":"2023-04-22"},"language":[{"iso":"eng"}]},{"file_date_updated":"2023-01-27T03:18:34Z","ec_funded":1,"publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Institute of Science and Technology Austria","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","date_updated":"2023-04-25T07:19:06Z","date_created":"2023-01-27T03:18:08Z","author":[{"full_name":"Chalupa, Marek","last_name":"Chalupa","first_name":"Marek","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463"},{"orcid":"0000-0003-1548-0177","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","last_name":"Mühlböck","first_name":"Fabian","full_name":"Mühlböck, Fabian"},{"id":"a376de31-8972-11ed-ae7b-d0251c13c8ff","first_name":"Stefanie","last_name":"Muroya Lei","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"}]},"month":"01","publication_identifier":{"eissn":["2664-1690"]},"project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020"}],"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"},"language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:12407","alternative_title":["IST Austria Technical Report"],"type":"technical_report","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"}],"status":"public","ddc":["005"],"title":"VAMOS: Middleware for Best-Effort Third-Party Monitoring","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12407","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"main.pdf","creator":"fmuehlbo","file_size":662409,"content_type":"application/pdf","file_id":"12408","relation":"main_file","success":1,"checksum":"55426e463fdeafe9777fc3ff635154c7","date_updated":"2023-01-27T03:18:34Z","date_created":"2023-01-27T03:18:34Z"}],"keyword":["runtime monitoring","best effort","third party"],"day":"27","has_accepted_license":"1","article_processing_charge":"No","page":"38","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."},"date_published":"2023-01-27T00:00:00Z"},{"abstract":[{"lang":"eng","text":"Autism spectrum disorder (ASD) and epilepsy are frequently comorbid neurodevelopmental disorders. Extensive research has demonstrated shared pathological pathways, etiologies, and phenotypes. Many risk factors for these disorders, like genetic mutations and environmental pressures, are linked to changes in childhood brain development, which is a critical period for their manifestation.\r\nDecades of research have yielded many signatures for ASD and epilepsy, some shared and others unique or opposing. The anatomical, physiological, and behavioral correlates of these disorders are discussed in this chapter in the context of understanding shared pathological pathways. We end with important takeaways on the presentation, prevention, intervention, and policy changes for ASD and epilepsy. This chapter aims to explore the complexity of these disorders, both in etiology and phenotypes, with the further goal of appreciating the expanse of unknowns still to explore about the brain."}],"type":"book_chapter","alternative_title":["Vol. 1: Biological Development and Physical Health"],"author":[{"id":"e8321fc5-3091-11eb-8a53-83f309a11ac9","orcid":"0000-0002-4809-5059","first_name":"Christopher","last_name":"Currin","full_name":"Currin, Christopher"},{"first_name":"Chad","last_name":"Beyer","full_name":"Beyer, Chad"}],"edition":"1","date_updated":"2023-04-25T09:25:40Z","date_created":"2023-04-25T07:52:43Z","oa_version":"None","year":"2023","_id":"12866","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Altered childhood brain development in autism and epilepsy","status":"public","publication_status":"published","publisher":"Elsevier","editor":[{"last_name":"Halpern-Felsher","first_name":"Bonnie","full_name":"Halpern-Felsher, Bonnie"}],"department":[{"_id":"TiVo"}],"day":"01","month":"02","publication_identifier":{"isbn":["9780128188736"]},"article_processing_charge":"No","date_published":"2023-02-01T00:00:00Z","doi":"10.1016/b978-0-12-818872-9.00129-1","language":[{"iso":"eng"}],"publication":"Encyclopedia of Child and Adolescent Health","citation":{"apa":"Currin, C., & Beyer, C. (2023). Altered childhood brain development in autism and epilepsy. In B. Halpern-Felsher (Ed.), Encyclopedia of Child and Adolescent Health (1st ed., pp. 86–98). Elsevier. https://doi.org/10.1016/b978-0-12-818872-9.00129-1","ieee":"C. Currin and C. Beyer, “Altered childhood brain development in autism and epilepsy,” in Encyclopedia of Child and Adolescent Health, 1st ed., B. Halpern-Felsher, Ed. Elsevier, 2023, pp. 86–98.","ista":"Currin C, Beyer C. 2023.Altered childhood brain development in autism and epilepsy. In: Encyclopedia of Child and Adolescent Health. Vol. 1: Biological Development and Physical Health, , 86–98.","ama":"Currin C, Beyer C. Altered childhood brain development in autism and epilepsy. In: Halpern-Felsher B, ed. Encyclopedia of Child and Adolescent Health. 1st ed. Elsevier; 2023:86-98. doi:10.1016/b978-0-12-818872-9.00129-1","chicago":"Currin, Christopher, and Chad Beyer. “Altered Childhood Brain Development in Autism and Epilepsy.” In Encyclopedia of Child and Adolescent Health, edited by Bonnie Halpern-Felsher, 1st ed., 86–98. Elsevier, 2023. https://doi.org/10.1016/b978-0-12-818872-9.00129-1.","short":"C. Currin, C. Beyer, in:, B. Halpern-Felsher (Ed.), Encyclopedia of Child and Adolescent Health, 1st ed., Elsevier, 2023, pp. 86–98.","mla":"Currin, Christopher, and Chad Beyer. “Altered Childhood Brain Development in Autism and Epilepsy.” Encyclopedia of Child and Adolescent Health, edited by Bonnie Halpern-Felsher, 1st ed., Elsevier, 2023, pp. 86–98, doi:10.1016/b978-0-12-818872-9.00129-1."},"quality_controlled":"1","page":"86-98"},{"date_published":"2023-04-06T00:00:00Z","citation":{"mla":"Alcarva, Catarina. Plasticity in the Cerebellum: What Molecular Mechanisms Are behind Physiological Learning. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:12809.","short":"C. Alcarva, Plasticity in the Cerebellum: What Molecular Mechanisms Are behind Physiological Learning, Institute of Science and Technology Austria, 2023.","chicago":"Alcarva, Catarina. “Plasticity in the Cerebellum: What Molecular Mechanisms Are behind Physiological Learning.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:12809.","ama":"Alcarva C. Plasticity in the cerebellum: What molecular mechanisms are behind physiological learning. 2023. doi:10.15479/at:ista:12809","ista":"Alcarva C. 2023. Plasticity in the cerebellum: What molecular mechanisms are behind physiological learning. Institute of Science and Technology Austria.","ieee":"C. Alcarva, “Plasticity in the cerebellum: What molecular mechanisms are behind physiological learning,” Institute of Science and Technology Austria, 2023.","apa":"Alcarva, C. (2023). Plasticity in the cerebellum: What molecular mechanisms are behind physiological learning. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12809"},"page":"115","day":"06","article_processing_charge":"No","has_accepted_license":"1","oa_version":"Published Version","file":[{"file_name":"Thesis_CatarinaAlcarva_final pdfA.pdf","embargo_to":"open_access","access_level":"closed","creator":"cchlebak","content_type":"application/pdf","file_size":9881969,"file_id":"12814","embargo":"2024-04-07","relation":"main_file","date_created":"2023-04-07T06:16:06Z","date_updated":"2023-04-07T06:16:06Z","checksum":"35b5997d2b0acb461f9d33d073da0df5"},{"access_level":"closed","file_name":"Thesis_CatarinaAlcarva_final_for printing.pdf","creator":"cchlebak","content_type":"application/pdf","file_size":44201583,"file_id":"12815","relation":"source_file","checksum":"81198f63c294890f6d58e8b29782efdc","date_created":"2023-04-07T06:17:11Z","date_updated":"2023-04-07T06:17:11Z"},{"file_id":"12816","relation":"source_file","date_updated":"2023-04-07T06:18:05Z","date_created":"2023-04-07T06:18:05Z","checksum":"0317bf7f457bb585f99d453ffa69eb53","file_name":"Thesis_CatarinaAlcarva_final.docx","access_level":"closed","creator":"cchlebak","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_size":84731244}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"12809","status":"public","title":"Plasticity in the cerebellum: What molecular mechanisms are behind physiological learning","ddc":["570"],"abstract":[{"lang":"eng","text":"Understanding the mechanisms of learning and memory formation has always been one of\r\nthe main goals in neuroscience. Already Pavlov (1927) in his early days has used his classic\r\nconditioning experiments to study the neural mechanisms governing behavioral adaptation.\r\nWhat was not known back then was that the part of the brain that is largely responsible for\r\nthis type of associative learning is the cerebellum.\r\nSince then, plenty of theories on cerebellar learning have emerged. Despite their differences,\r\none thing they all have in common is that learning relies on synaptic and intrinsic plasticity.\r\nThe goal of my PhD project was to unravel the molecular mechanisms underlying synaptic\r\nplasticity in two synapses that have been shown to be implicated in motor learning, in an\r\neffort to understand how learning and memory formation are processed in the cerebellum.\r\nOne of the earliest and most well-known cerebellar theories postulates that motor learning\r\nlargely depends on long-term depression at the parallel fiber-Purkinje cell (PC-PC) synapse.\r\nHowever, the discovery of other types of plasticity in the cerebellar circuitry, like long-term\r\npotentiation (LTP) at the PC-PC synapse, potentiation of molecular layer interneurons (MLIs),\r\nand plasticity transfer from the cortex to the cerebellar/ vestibular nuclei has increased the\r\npopularity of the idea that multiple sites of plasticity might be involved in learning.\r\nStill a lot remains unknown about the molecular mechanisms responsible for these types of\r\nplasticity and whether they occur during physiological learning.\r\nIn the first part of this thesis we have analyzed the variation and nanodistribution of voltagegated calcium channels (VGCCs) and α-amino-3-hydroxy-5-methyl-4-isoxazolepropionic acid\r\ntype glutamate receptors (AMPARs) on the parallel fiber-Purkinje cell synapse after vestibuloocular reflex phase reversal adaptation, a behavior that has been suggested to rely on PF-PC\r\nLTP. We have found that on the last day of adaptation there is no learning trace in form of\r\nVGCCs nor AMPARs variation at the PF-PC synapse, but instead a decrease in the number of\r\nPF-PC synapses. These data seem to support the view that learning is only stored in the\r\ncerebellar cortex in an initial learning phase, being transferred later to the vestibular nuclei.\r\nNext, we have studied the role of MLIs in motor learning using a relatively simple and well characterized behavioral paradigm – horizontal optokinetic reflex (HOKR) adaptation. We\r\nhave found behavior-induced MLI potentiation in form of release probability increase that\r\ncould be explained by the increase of VGCCs at the presynaptic side. Our results strengthen\r\nthe idea of distributed cerebellar plasticity contributing to learning and provide a novel\r\nmechanism for release probability increase. "}],"type":"dissertation","alternative_title":["ISTA Thesis"],"doi":"10.15479/at:ista:12809","acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"Bio"},{"_id":"PreCl"}],"supervisor":[{"full_name":"Shigemoto, Ryuichi","last_name":"Shigemoto","first_name":"Ryuichi","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"}],"degree_awarded":"PhD","language":[{"iso":"eng"}],"project":[{"_id":"267DFB90-B435-11E9-9278-68D0E5697425","name":"Plasticity in the cerebellum: Which molecular mechanisms are behind physiological learning?"}],"month":"04","publication_identifier":{"issn":["2663 - 337X"]},"author":[{"first_name":"Catarina","last_name":"Alcarva","id":"3A96634C-F248-11E8-B48F-1D18A9856A87","full_name":"Alcarva, Catarina"}],"date_created":"2023-04-06T07:54:09Z","date_updated":"2023-04-26T12:16:56Z","year":"2023","publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"RySh"}],"file_date_updated":"2023-04-07T06:18:05Z"},{"abstract":[{"text":"Background: Plant and animal embryogenesis have conserved and distinct features. Cell fate transitions occur during embryogenesis in both plants and animals. The epigenomic processes regulating plant embryogenesis remain largely elusive.\r\n\r\nResults: Here, we elucidate chromatin and transcriptomic dynamics during embryogenesis of the most cultivated crop, hexaploid wheat. Time-series analysis reveals stage-specific and proximal–distal distinct chromatin accessibility and dynamics concordant with transcriptome changes. Following fertilization, the remodeling kinetics of H3K4me3, H3K27ac, and H3K27me3 differ from that in mammals, highlighting considerable species-specific epigenomic dynamics during zygotic genome activation. Polycomb repressive complex 2 (PRC2)-mediated H3K27me3 deposition is important for embryo establishment. Later H3K27ac, H3K27me3, and chromatin accessibility undergo dramatic remodeling to establish a permissive chromatin environment facilitating the access of transcription factors to cis-elements for fate patterning. Embryonic maturation is characterized by increasing H3K27me3 and decreasing chromatin accessibility, which likely participates in restricting totipotency while preventing extensive organogenesis. Finally, epigenomic signatures are correlated with biased expression among homeolog triads and divergent expression after polyploidization, revealing an epigenomic contributor to subgenome diversification in an allohexaploid genome.\r\n\r\nConclusions: Collectively, we present an invaluable resource for comparative and mechanistic analysis of the epigenomic regulation of crop embryogenesis.","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","_id":"12668","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 24","title":"Dynamic chromatin regulatory programs during embryogenesis of hexaploid wheat","status":"public","article_processing_charge":"No","day":"13","scopus_import":"1","date_published":"2023-01-13T00:00:00Z","citation":{"chicago":"Zhao, Long, Yiman Yang, Jinchao Chen, Xuelei Lin, Hao Zhang, Hao Wang, Hongzhe Wang, et al. “Dynamic Chromatin Regulatory Programs during Embryogenesis of Hexaploid Wheat.” Genome Biology. Springer Nature, 2023. https://doi.org/10.1186/s13059-022-02844-2.","short":"L. Zhao, Y. Yang, J. Chen, X. Lin, H. Zhang, H. Wang, H. Wang, X. Bie, J. Jiang, X. Feng, X. Fu, X. Zhang, Z. Du, J. Xiao, Genome Biology 24 (2023).","mla":"Zhao, Long, et al. “Dynamic Chromatin Regulatory Programs during Embryogenesis of Hexaploid Wheat.” Genome Biology, vol. 24, 7, Springer Nature, 2023, doi:10.1186/s13059-022-02844-2.","apa":"Zhao, L., Yang, Y., Chen, J., Lin, X., Zhang, H., Wang, H., … Xiao, J. (2023). Dynamic chromatin regulatory programs during embryogenesis of hexaploid wheat. Genome Biology. Springer Nature. https://doi.org/10.1186/s13059-022-02844-2","ieee":"L. Zhao et al., “Dynamic chromatin regulatory programs during embryogenesis of hexaploid wheat,” Genome Biology, vol. 24. Springer Nature, 2023.","ista":"Zhao L, Yang Y, Chen J, Lin X, Zhang H, Wang H, Wang H, Bie X, Jiang J, Feng X, Fu X, Zhang X, Du Z, Xiao J. 2023. Dynamic chromatin regulatory programs during embryogenesis of hexaploid wheat. Genome Biology. 24, 7.","ama":"Zhao L, Yang Y, Chen J, et al. Dynamic chromatin regulatory programs during embryogenesis of hexaploid wheat. Genome Biology. 2023;24. doi:10.1186/s13059-022-02844-2"},"publication":"Genome Biology","article_type":"original","extern":"1","article_number":"7","author":[{"last_name":"Zhao","first_name":"Long","full_name":"Zhao, Long"},{"first_name":"Yiman","last_name":"Yang","full_name":"Yang, Yiman"},{"first_name":"Jinchao","last_name":"Chen","full_name":"Chen, Jinchao"},{"full_name":"Lin, Xuelei","first_name":"Xuelei","last_name":"Lin"},{"full_name":"Zhang, Hao","last_name":"Zhang","first_name":"Hao"},{"full_name":"Wang, Hao","last_name":"Wang","first_name":"Hao"},{"full_name":"Wang, Hongzhe","last_name":"Wang","first_name":"Hongzhe"},{"full_name":"Bie, Xiaomin","first_name":"Xiaomin","last_name":"Bie"},{"last_name":"Jiang","first_name":"Jiafu","full_name":"Jiang, Jiafu"},{"full_name":"Feng, Xiaoqi","id":"e0164712-22ee-11ed-b12a-d80fcdf35958","orcid":"0000-0002-4008-1234","first_name":"Xiaoqi","last_name":"Feng"},{"first_name":"Xiangdong","last_name":"Fu","full_name":"Fu, Xiangdong"},{"last_name":"Zhang","first_name":"Xiansheng","full_name":"Zhang, Xiansheng"},{"last_name":"Du","first_name":"Zhuo","full_name":"Du, Zhuo"},{"full_name":"Xiao, Jun","last_name":"Xiao","first_name":"Jun"}],"volume":24,"date_updated":"2023-05-08T10:52:49Z","date_created":"2023-02-23T09:13:49Z","pmid":1,"year":"2023","publisher":"Springer Nature","department":[{"_id":"XiFe"}],"publication_status":"published","publication_identifier":{"issn":["1474-760X"]},"month":"01","doi":"10.1186/s13059-022-02844-2","language":[{"iso":"eng"}],"external_id":{"pmid":["36639687"]},"oa":1,"main_file_link":[{"url":"https://doi.org/10.1186/s13059-022-02844-2","open_access":"1"}],"quality_controlled":"1"},{"project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"},{"name":"Learning and triangulating manifolds via collapses","grant_number":"M03073","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2303.04014"}],"external_id":{"arxiv":["2303.04014"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1145/3564246.3585113","conference":{"end_date":"2023-06-23","location":"Orlando, FL, United States","start_date":"2023-06-20","name":"STOC: Symposium on Theory of Computing"},"publication_identifier":{"isbn":["9781450399135"]},"month":"06","publisher":"Association for Computing Machinery","department":[{"_id":"HeEd"}],"publication_status":"published","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.","year":"2023","date_updated":"2023-05-22T08:15:19Z","date_created":"2023-05-22T08:02:02Z","author":[{"last_name":"Lieutier","first_name":"André","full_name":"Lieutier, André"},{"full_name":"Wintraecken, Mathijs","last_name":"Wintraecken","first_name":"Mathijs","orcid":"0000-0002-7472-2220","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87"}],"ec_funded":1,"page":"1768-1776","citation":{"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.","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.","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.","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.","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.","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"},"publication":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","date_published":"2023-06-02T00:00:00Z","article_processing_charge":"No","day":"02","status":"public","title":"Hausdorff and Gromov-Hausdorff stable subsets of the medial axis","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"13048","oa_version":"Preprint","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"}]},{"oa_version":"Preprint","date_created":"2023-05-23T11:36:18Z","date_updated":"2023-06-01T12:54:45Z","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"13074"}]},"author":[{"full_name":"Peste, Elena-Alexandra","first_name":"Elena-Alexandra","last_name":"Peste","id":"32D78294-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Vladu, Adrian","last_name":"Vladu","first_name":"Adrian"},{"first_name":"Eldar","last_name":"Kurtic","id":"47beb3a5-07b5-11eb-9b87-b108ec578218","full_name":"Kurtic, Eldar"},{"last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph"},{"last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"}],"department":[{"_id":"GradSch"},{"_id":"DaAl"},{"_id":"ChLa"}],"title":"CrAM: A Compression-Aware Minimizer","status":"public","publication_status":"accepted","_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)-","ec_funded":1,"abstract":[{"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 .","lang":"eng"}],"type":"conference","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"date_published":"2023-05-01T00:00:00Z","conference":{"start_date":"2023-05-01","location":"Kigali, Rwanda ","end_date":"2023-05-05","name":"ICLR: International Conference on Learning Representations"},"project":[{"name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","citation":{"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 .","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 .","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,"publication":"11th International Conference on Learning Representations ","article_processing_charge":"No","month":"05"},{"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.","department":[{"_id":"KrPi"}],"publisher":"Springer Nature","publication_status":"published","author":[{"full_name":"Hoffmann, Charlotte","first_name":"Charlotte","last_name":"Hoffmann","id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7"},{"first_name":"Pavel","last_name":"Hubáček","full_name":"Hubáček, Pavel"},{"full_name":"Kamath, Chethan","first_name":"Chethan","last_name":"Kamath"},{"last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z"}],"volume":13940,"date_updated":"2023-06-19T08:03:37Z","date_created":"2023-06-18T22:00:47Z","oa":1,"main_file_link":[{"url":"https://eprint.iacr.org/2023/238","open_access":"1"}],"quality_controlled":"1","doi":"10.1007/978-3-031-31368-4_19","conference":{"name":"PKC: Public-Key Cryptography","end_date":"2023-05-10","start_date":"2023-05-07","location":"Atlanta, GA, United States"},"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031313677"],"issn":["0302-9743"]},"month":"05","_id":"13143","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 13940","status":"public","title":"Certifying giant nonprimes","oa_version":"Submitted Version","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."}],"citation":{"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","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.","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.","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."},"publication":"Public-Key Cryptography - PKC 2023","page":"530-553","date_published":"2023-05-02T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"02"},{"date_updated":"2023-06-19T08:30:54Z","date_created":"2023-06-18T22:00:47Z","volume":13993,"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias","last_name":"Lechner","full_name":"Lechner, Mathias"},{"full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","last_name":"Zikelic"}],"publication_status":"published","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"Springer Nature","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","file_date_updated":"2023-06-19T08:29:30Z","ec_funded":1,"language":[{"iso":"eng"}],"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","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"},{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","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,"month":"04","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783031308222"]},"oa_version":"Published Version","file":[{"relation":"main_file","file_id":"13150","checksum":"3d8a8bb24d211bc83360dfc2fd744307","success":1,"date_updated":"2023-06-19T08:29:30Z","date_created":"2023-06-19T08:29:30Z","access_level":"open_access","file_name":"2023_LNCS_Chatterjee.pdf","file_size":528455,"content_type":"application/pdf","creator":"dernst"}],"ddc":["000"],"status":"public","title":"A learner-verifier framework for neural network controllers and certificates of stochastic systems","intvolume":" 13993","_id":"13142","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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."}],"alternative_title":["LNCS"],"type":"conference","date_published":"2023-04-22T00:00:00Z","page":"3-25","publication":"Tools and Algorithms for the Construction and Analysis of Systems ","citation":{"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.","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","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","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."},"day":"22","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1"},{"file_date_updated":"2023-06-19T08:43:21Z","publication_status":"published","publisher":"Springer Nature","department":[{"_id":"ToHe"}],"year":"2023","date_updated":"2023-06-19T08:49:46Z","date_created":"2023-06-18T22:00:47Z","volume":13994,"author":[{"first_name":"Ashwani","last_name":"Anand","full_name":"Anand, Ashwani"},{"last_name":"Mallik","first_name":"Kaushik","orcid":"0000-0001-9864-7475","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","full_name":"Mallik, Kaushik"},{"last_name":"Nayak","first_name":"Satya Prakash","full_name":"Nayak, Satya Prakash"},{"last_name":"Schmuck","first_name":"Anne Kathrin","full_name":"Schmuck, Anne Kathrin"}],"month":"04","publication_identifier":{"isbn":["9783031308192"],"eissn":["1611-3349"],"issn":["0302-9743"]},"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"},"language":[{"iso":"eng"}],"conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Paris, France","start_date":"2023-04-22","end_date":"2023-04-27"},"doi":"10.1007/978-3-031-30820-8_15","alternative_title":["LNCS"],"type":"conference","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."}],"title":"Computing adequately permissive assumptions for synthesis","status":"public","ddc":["000"],"intvolume":" 13994","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"13141","file":[{"file_id":"13151","relation":"main_file","date_created":"2023-06-19T08:43:21Z","date_updated":"2023-06-19T08:43:21Z","success":1,"checksum":"60dcafc1b4f6f070be43bad3fe877974","file_name":"2023_LNCS_Anand.pdf","access_level":"open_access","creator":"dernst","file_size":521425,"content_type":"application/pdf"}],"oa_version":"Published Version","scopus_import":"1","day":"20","has_accepted_license":"1","article_processing_charge":"No","page":"211-228","publication":"TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems","citation":{"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.","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.","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.","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.","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.","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"},"date_published":"2023-04-20T00:00:00Z"},{"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":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program"}],"doi":"10.15479/at:ista:12826","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"supervisor":[{"full_name":"Jösch, Maximilian A","id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3937-1330","first_name":"Maximilian A","last_name":"Jösch"}],"degree_awarded":"PhD","publication_identifier":{"issn":["2663 - 337X"]},"month":"04","year":"2023","publisher":"Institute of Science and Technology Austria","department":[{"_id":"MaJö"},{"_id":"GradSch"}],"publication_status":"published","author":[{"full_name":"Pokusaeva, Victoria","orcid":"0000-0001-7660-444X","id":"3184041C-F248-11E8-B48F-1D18A9856A87","last_name":"Pokusaeva","first_name":"Victoria"}],"date_updated":"2023-06-23T09:47:36Z","date_created":"2023-04-14T14:56:04Z","ec_funded":1,"file_date_updated":"2023-04-20T09:26:51Z","citation":{"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.","short":"V. Pokusaeva, Neural Control of Optic Flow-Based Navigation in Drosophila Melanogaster, Institute of Science and Technology Austria, 2023.","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.","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","ista":"Pokusaeva V. 2023. Neural control of optic flow-based navigation in Drosophila melanogaster. Institute of Science and Technology Austria.","ama":"Pokusaeva V. Neural control of optic flow-based navigation in Drosophila melanogaster. 2023. doi:10.15479/at:ista:12826"},"page":"106","date_published":"2023-04-18T00:00:00Z","has_accepted_license":"1","article_processing_charge":"No","day":"18","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"12826","status":"public","ddc":["570","571"],"title":"Neural control of optic flow-based navigation in Drosophila melanogaster","file":[{"checksum":"5f589a9af025f7eeebfd0c186209913e","date_updated":"2023-04-20T09:26:51Z","date_created":"2023-04-20T09:14:38Z","file_id":"12857","relation":"source_file","creator":"vpokusae","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_size":14507243,"access_level":"closed","file_name":"Thesis_Pokusaeva.docx"},{"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_updated":"2023-04-20T09:14:44Z","date_created":"2023-04-20T09:14:44Z","checksum":"bbeed76db45a996b4c91a9abe12ce0ec","success":1}],"oa_version":"Published Version","type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"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.","lang":"eng"}]},{"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":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert"},{"id":"464B40D6-F248-11E8-B48F-1D18A9856A87","first_name":"Georg F","last_name":"Osang","full_name":"Osang, Georg F"}],"date_created":"2022-09-11T22:01:57Z","date_updated":"2023-06-27T12:53:43Z","volume":85,"file_date_updated":"2023-01-20T10:02:48Z","ec_funded":1,"external_id":{"isi":["000846967100001"]},"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","project":[{"name":"Alpha Shape Theory Extended","call_identifier":"H2020","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35"}],"doi":"10.1007/s00453-022-01027-6","language":[{"iso":"eng"}],"month":"01","publication_identifier":{"issn":["0178-4617"],"eissn":["1432-0541"]},"user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","_id":"12086","status":"public","title":"A simple algorithm for higher-order Delaunay mosaics and alpha shapes","ddc":["510"],"intvolume":" 85","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"}],"oa_version":"Published Version","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."}],"publication":"Algorithmica","citation":{"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","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.","ista":"Edelsbrunner H, Osang GF. 2023. A simple algorithm for higher-order Delaunay mosaics and alpha shapes. Algorithmica. 85, 277–295.","short":"H. Edelsbrunner, G.F. Osang, Algorithmica 85 (2023) 277–295.","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.","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."},"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)"},{"publication_status":"published","department":[{"_id":"JaMa"}],"publisher":"Springer Nature","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).","date_created":"2023-01-08T23:00:53Z","date_updated":"2023-06-28T11:54:35Z","volume":23,"author":[{"full_name":"Dello Schiavo, Lorenzo","first_name":"Lorenzo","last_name":"Dello Schiavo","id":"ECEBF480-9E4F-11EA-B557-B0823DDC885E","orcid":"0000-0002-9881-6870"},{"orcid":"0000-0002-0519-4241","id":"88644358-0A0E-11EA-8FA5-49A33DDC885E","last_name":"Wirth","first_name":"Melchior","full_name":"Wirth, Melchior"}],"article_number":"9","file_date_updated":"2023-01-20T10:45:06Z","ec_funded":1,"isi":1,"quality_controlled":"1","project":[{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems"},{"grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425","name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020"},{"name":"Configuration Spaces over Non-Smooth Spaces","grant_number":"E208","_id":"34dbf174-11ca-11ed-8bc3-afe9d43d4b9c"},{"_id":"34c6ea2d-11ca-11ed-8bc3-c04f3c502833","grant_number":"ESP156_N","name":"Gradient flow techniques for quantum Markov semigroups"}],"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","month":"01","publication_identifier":{"issn":["1424-3199"],"eissn":["1424-3202"]},"ddc":["510"],"title":"Ergodic decompositions of Dirichlet forms under order isomorphisms","status":"public","intvolume":" 23","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12104","file":[{"checksum":"1f34f3e2cb521033de6154f274ea3a4e","success":1,"date_created":"2023-01-20T10:45:06Z","date_updated":"2023-01-20T10:45:06Z","relation":"main_file","file_id":"12325","file_size":422612,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2023_JourEvolutionEquations_DelloSchiavo.pdf"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"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.","lang":"eng"}],"issue":"1","article_type":"original","publication":"Journal of Evolution Equations","citation":{"ista":"Dello Schiavo L, Wirth M. 2023. Ergodic decompositions of Dirichlet forms under order isomorphisms. Journal of Evolution Equations. 23(1), 9.","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.","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","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.","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)."},"date_published":"2023-01-01T00:00:00Z","scopus_import":"1","day":"01","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)"},{"abstract":[{"text":"The Indian summer monsoon rainfall (ISMR) has been declining since the 1950s. However, since 2002 it is reported to have revived. For these observed changes in the ISMR, several explanations have been reported. Among these explanations, however, the role of the eastern equatorial Indian Ocean (EEIO) is missing despite being one of the warmest regions in the Indian Ocean, and monotonously warming. A recent study reported that EEIO warming impacts the rainfall over northern India. Here we report that warming in the EEIO weakens the low-level Indian summer monsoon circulation and reduces ISMR. A warm EEIO drives easterly winds in the Indo–Pacific sector as a Gill response. The warm EEIO also enhances nocturnal convection offshore the western coast of Sumatra. The latent heating associated with the increased convection augments the Gill response and the resultant circulation opposes the monsoon low-level circulation and weakens the seasonal rainfall.","lang":"eng"}],"type":"journal_article","oa_version":"None","_id":"11434","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Role of the eastern equatorial Indian Ocean warming in the Indian summer monsoon rainfall trend","status":"public","intvolume":" 60","day":"01","article_processing_charge":"No","scopus_import":"1","date_published":"2023-01-01T00:00:00Z","publication":"Climate Dynamics","citation":{"short":"B.B. GOSWAMI, Climate Dynamics 60 (2023) 427–442.","mla":"GOSWAMI, BIDYUT B. “Role of the Eastern Equatorial Indian Ocean Warming in the Indian Summer Monsoon Rainfall Trend.” Climate Dynamics, vol. 60, Springer Nature, 2023, pp. 427–42, doi:10.1007/s00382-022-06337-7.","chicago":"GOSWAMI, BIDYUT B. “Role of the Eastern Equatorial Indian Ocean Warming in the Indian Summer Monsoon Rainfall Trend.” Climate Dynamics. Springer Nature, 2023. https://doi.org/10.1007/s00382-022-06337-7.","ama":"GOSWAMI BB. Role of the eastern equatorial Indian Ocean warming in the Indian summer monsoon rainfall trend. Climate Dynamics. 2023;60:427-442. doi:10.1007/s00382-022-06337-7","ieee":"B. B. GOSWAMI, “Role of the eastern equatorial Indian Ocean warming in the Indian summer monsoon rainfall trend,” Climate Dynamics, vol. 60. Springer Nature, pp. 427–442, 2023.","apa":"GOSWAMI, B. B. (2023). Role of the eastern equatorial Indian Ocean warming in the Indian summer monsoon rainfall trend. Climate Dynamics. Springer Nature. https://doi.org/10.1007/s00382-022-06337-7","ista":"GOSWAMI BB. 2023. Role of the eastern equatorial Indian Ocean warming in the Indian summer monsoon rainfall trend. Climate Dynamics. 60, 427–442."},"article_type":"original","page":"427-442","author":[{"first_name":"Bidyut B","last_name":"Goswami","id":"3a4ac09c-6d61-11ec-bf66-884cde66b64b","full_name":"Goswami, Bidyut B"}],"related_material":{"link":[{"relation":"erratum","url":" https://doi.org/10.1007/s00382-022-06401-2"}]},"date_created":"2022-06-05T22:01:50Z","date_updated":"2023-06-28T11:49:58Z","volume":60,"acknowledgement":"This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT) (NRF-2018R1A5A1024958). Model simulation and data transfer were supported by the National Supercomputing Center with supercomputing resources including technical support (KSC-2019-CHA-0005), the National Center for Meteorological Supercomputer of Korea Meteorological Administration, and by the Korea Research Environment Open NETwork (KREONET), respectively. The authors declare no conflicts of interest.","year":"2023","publication_status":"published","department":[{"_id":"CaMu"}],"publisher":"Springer Nature","month":"01","publication_identifier":{"issn":["0930-7575"],"eissn":["1432-0894"]},"doi":"10.1007/s00382-022-06337-7","language":[{"iso":"eng"}],"external_id":{"isi":["000803119400002"]},"quality_controlled":"1","isi":1},{"abstract":[{"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.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference","oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":449027,"creator":"esarac","file_name":"qsl.pdf","access_level":"open_access","date_created":"2023-01-31T07:22:21Z","date_updated":"2023-01-31T07:22:21Z","checksum":"981025aed580b6b27c426cb8856cf63e","success":1,"relation":"main_file","file_id":"12468"},{"access_level":"open_access","file_name":"2023_LNCS_HenzingerT.pdf","creator":"dernst","file_size":1048171,"content_type":"application/pdf","file_id":"13153","relation":"main_file","success":1,"checksum":"f16e2af1e0eb243158ab0f0fe74e7d5a","date_updated":"2023-06-19T10:28:09Z","date_created":"2023-06-19T10:28:09Z"}],"intvolume":" 13992","title":"Quantitative safety and liveness","ddc":["000"],"status":"public","_id":"12467","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","has_accepted_license":"1","article_processing_charge":"No","day":"21","scopus_import":"1","date_published":"2023-04-21T00:00:00Z","page":"349-370","citation":{"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.","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","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.","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"},"publication":"26th International Conference Foundations of Software Science and Computation Structures","ec_funded":1,"file_date_updated":"2023-06-19T10:28:09Z","volume":13992,"date_updated":"2023-07-14T11:20:27Z","date_created":"2023-01-31T07:23:56Z","author":[{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A","last_name":"Henzinger"},{"last_name":"Mazzocchi","first_name":"Nicolas Adrien","id":"b26baa86-3308-11ec-87b0-8990f34baa85","full_name":"Mazzocchi, Nicolas Adrien"},{"id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","first_name":"Naci E","last_name":"Sarac","full_name":"Sarac, Naci E"}],"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publisher":"Springer Nature","publication_status":"published","year":"2023","acknowledgement":"We thank the anonymous reviewers for their helpful comments. This work was supported in part by the ERC-2020-AdG 101020093.","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031308284"],"eissn":["1611-3349"]},"month":"04","language":[{"iso":"eng"}],"doi":"10.1007/978-3-031-30829-1_17","conference":{"end_date":"2023-04-27","start_date":"2023-04-22","location":"Paris, France","name":"FOSSACS: Foundations of Software Science and Computation Structures"},"project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"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":{"arxiv":["2301.11175"]}},{"month":"06","publication_identifier":{"eissn":["2475-1421"]},"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"},"language":[{"iso":"eng"}],"doi":"10.1145/3591230","article_number":"116","file_date_updated":"2023-07-03T13:09:39Z","publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"Association for Computing Machinery ","year":"2023","date_created":"2023-07-02T22:00:43Z","date_updated":"2023-07-17T08:43:19Z","volume":7,"author":[{"last_name":"Koval","first_name":"Nikita","id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87","full_name":"Koval, Nikita"},{"full_name":"Khalanskiy, Dmitry","last_name":"Khalanskiy","first_name":"Dmitry"},{"last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"}],"scopus_import":"1","day":"06","has_accepted_license":"1","article_processing_charge":"No","article_type":"original","publication":"Proceedings of the ACM on Programming Languages","citation":{"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","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.","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.","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."},"date_published":"2023-06-06T00:00:00Z","type":"journal_article","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."}],"title":"CQS: A formally-verified framework for fair and abortable synchronization","ddc":["000"],"status":"public","intvolume":" 7","_id":"13179","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_name":"2023_ACMProgram.Lang._Koval.pdf","access_level":"open_access","file_size":1266773,"content_type":"application/pdf","creator":"alisjak","relation":"main_file","file_id":"13187","date_updated":"2023-07-03T13:09:39Z","date_created":"2023-07-03T13:09:39Z","checksum":"5dba6e73f0ed79adbdae14d165bc2f68","success":1}],"oa_version":"Published Version"},{"article_processing_charge":"No","day":"26","scopus_import":"1","date_published":"2023-05-26T00:00:00Z","page":"331-342","article_type":"original","citation":{"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.","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.","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.","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.","short":"T.D. Browning, J. Lyczak, R. Sarapin, Involve 16 (2023) 331–342."},"publication":"Involve","issue":"2","abstract":[{"lang":"eng","text":"We study the density of everywhere locally soluble diagonal quadric surfaces, parameterised by rational points that lie on a split quadric surface"}],"type":"journal_article","oa_version":"Preprint","intvolume":" 16","status":"public","title":"Local solubility for a family of quadrics over a split quadric surface","_id":"13180","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["1944-4176"],"eissn":["1944-4184"]},"month":"05","language":[{"iso":"eng"}],"doi":"10.2140/involve.2023.16.331","quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2203.06881"}],"external_id":{"arxiv":["2203.06881"]},"volume":16,"date_created":"2023-07-02T22:00:43Z","date_updated":"2023-07-17T08:39:19Z","author":[{"full_name":"Browning, Timothy D","first_name":"Timothy D","last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177"},{"full_name":"Lyczak, Julian","last_name":"Lyczak","first_name":"Julian","id":"3572849A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sarapin","first_name":"Roman","full_name":"Sarapin, Roman"}],"department":[{"_id":"TiBr"}],"publisher":"Mathematical Sciences Publishers","publication_status":"published","year":"2023"},{"type":"conference_abstract","file_date_updated":"2023-07-18T09:28:30Z","ddc":["000"],"status":"public","publication_status":"accepted","title":"Cryo-EM software packages: A sys-admins point of view","publisher":"EuroCC","department":[{"_id":"ScienComp"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"13162","year":"2023","date_updated":"2023-07-18T09:32:16Z","date_created":"2023-06-23T11:03:18Z","oa_version":"Submitted Version","file":[{"checksum":"0ab6173cd5c5634ed773cd37ff012681","success":1,"date_updated":"2023-07-18T09:28:30Z","date_created":"2023-07-18T09:28:30Z","relation":"main_file","file_id":"13250","file_size":380354,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2023_ASHPC_Elefante.pdf"}],"author":[{"id":"490F40CE-F248-11E8-B48F-1D18A9856A87","last_name":"Elefante","first_name":"Stefano","full_name":"Elefante, Stefano"},{"full_name":"Stadlbauer, Stephan","id":"4D0BC184-F248-11E8-B48F-1D18A9856A87","last_name":"Stadlbauer","first_name":"Stephan"},{"full_name":"Alexander, Michael F","last_name":"Alexander","first_name":"Michael F","id":"3A02A8FA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alois","last_name":"Schlögl","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5621-8100","full_name":"Schlögl, Alois"}],"month":"07","day":"01","has_accepted_license":"1","article_processing_charge":"No","quality_controlled":"1","page":"42-42","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.","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.","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.","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,"language":[{"iso":"eng"}],"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"}]