[{"article_number":"2303.14555","type":"preprint","abstract":[{"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.","lang":"eng"}],"_id":"12846","year":"2023","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).","publication_status":"submitted","status":"public","title":"Area formula for spherical polygons via prequantization","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"author":[{"full_name":"Chern, Albert","last_name":"Chern","first_name":"Albert"},{"full_name":"Ishida, Sadashige","last_name":"Ishida","first_name":"Sadashige","id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425"}],"date_updated":"2023-04-25T06:51:21Z","date_created":"2023-04-18T19:16:06Z","oa_version":"Preprint","month":"03","day":"25","article_processing_charge":"No","publication":"arXiv","citation":{"ama":"Chern A, Ishida S. Area formula for spherical polygons via prequantization. arXiv. doi:10.48550/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","ista":"Chern A, Ishida S. Area formula for spherical polygons via prequantization. arXiv, 2303.14555.","short":"A. Chern, S. Ishida, ArXiv (n.d.).","mla":"Chern, Albert, and Sadashige Ishida. “Area Formula for Spherical Polygons via Prequantization.” ArXiv, 2303.14555, 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."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2303.14555"}],"external_id":{"arxiv":["2303.14555"]},"oa":1,"project":[{"name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","grant_number":"101045083","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088"}],"date_published":"2023-03-25T00:00:00Z","doi":"10.48550/arXiv.2303.14555","language":[{"iso":"eng"}]},{"alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":"As the complexity and criticality of software increase every year, so does the importance of run-time monitoring. Third-party monitoring, with limited knowledge of the monitored software, and best-effort monitoring, which keeps pace with the monitored software, are especially valuable, yet underexplored areas of run-time monitoring. Most existing monitoring frameworks do not support their combination because they either require access to the monitored code for instrumentation purposes or the processing of all observed events, or both.\r\n\r\nWe present a middleware framework, VAMOS, for the run-time monitoring of software which is explicitly designed to support third-party and best-effort scenarios. The design goals of VAMOS are (i) efficiency (keeping pace at low overhead), (ii) flexibility (the ability to monitor black-box code through a variety of different event channels, and the connectability to monitors written in different specification languages), and (iii) ease-of-use. To achieve its goals, VAMOS combines aspects of event broker and event recognition systems with aspects of stream processing systems.\r\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."}],"intvolume":" 13991","status":"public","title":"Vamos: Middleware for best-effort third-party monitoring","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12856","file":[{"file_name":"2023_LNCS_ChalupaM.pdf","access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":580828,"file_id":"12865","relation":"main_file","date_created":"2023-04-25T07:16:36Z","date_updated":"2023-04-25T07:16:36Z","success":1,"checksum":"17a7c8e08be609cf2408d37ea55e322c"}],"oa_version":"Published Version","has_accepted_license":"1","article_processing_charge":"No","day":"20","page":"260-281","citation":{"ieee":"M. Chalupa, F. Mühlböck, S. Muroya Lei, and T. A. Henzinger, “Vamos: Middleware for best-effort third-party monitoring,” in Fundamental Approaches to Software Engineering, Paris, France, 2023, vol. 13991, pp. 260–281.","apa":"Chalupa, M., Mühlböck, F., Muroya Lei, S., & Henzinger, T. A. (2023). Vamos: Middleware for best-effort third-party monitoring. In Fundamental Approaches to Software Engineering (Vol. 13991, pp. 260–281). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-30826-0_15","ista":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. 2023. Vamos: Middleware for best-effort third-party monitoring. Fundamental Approaches to Software Engineering. FASE: Fundamental Approaches to Software Engineering, LNCS, vol. 13991, 260–281.","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","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.","short":"M. Chalupa, F. Mühlböck, S. Muroya Lei, T.A. Henzinger, in:, Fundamental Approaches to Software Engineering, Springer Nature, 2023, pp. 260–281.","mla":"Chalupa, Marek, et al. “Vamos: Middleware for Best-Effort Third-Party Monitoring.” Fundamental Approaches to Software Engineering, vol. 13991, Springer Nature, 2023, pp. 260–81, doi:10.1007/978-3-031-30826-0_15."},"publication":"Fundamental Approaches to Software Engineering","date_published":"2023-04-20T00:00:00Z","ec_funded":1,"file_date_updated":"2023-04-25T07:16:36Z","publisher":"Springer Nature","department":[{"_id":"ToHe"}],"publication_status":"published","year":"2023","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.","volume":13991,"date_created":"2023-04-20T08:29:42Z","date_updated":"2023-04-25T07:19:07Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"12407"}]},"author":[{"full_name":"Chalupa, Marek","first_name":"Marek","last_name":"Chalupa","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463"},{"id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","orcid":"0000-0003-1548-0177","first_name":"Fabian","last_name":"Mühlböck","full_name":"Mühlböck, Fabian"},{"last_name":"Muroya Lei","first_name":"Stefanie","id":"a376de31-8972-11ed-ae7b-d0251c13c8ff","full_name":"Muroya Lei, Stefanie"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"publication_identifier":{"isbn":["9783031308253"],"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783031308260"]},"month":"04","project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"}],"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,"language":[{"iso":"eng"}],"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"}},{"keyword":["runtime monitoring","best effort","third party"],"has_accepted_license":"1","article_processing_charge":"No","day":"27","citation":{"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.","short":"M. Chalupa, F. Mühlböck, S. Muroya Lei, T.A. Henzinger, VAMOS: Middleware for Best-Effort Third-Party Monitoring, Institute of Science and Technology Austria, 2023.","mla":"Chalupa, Marek, et al. VAMOS: Middleware for Best-Effort Third-Party Monitoring. Institute of Science and Technology Austria, 2023, doi:10.15479/AT:ISTA:12407.","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.","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.","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"},"page":"38","date_published":"2023-01-27T00:00:00Z","type":"technical_report","alternative_title":["IST Austria Technical Report"],"abstract":[{"lang":"eng","text":"As the complexity and criticality of software increase every year, so does the importance of run-time monitoring. Third-party monitoring, with limited knowledge of the monitored software, and best-effort monitoring, which keeps pace with the monitored software, are especially valuable, yet underexplored areas of run-time monitoring. Most existing monitoring frameworks do not support their combination because they either require access to the monitored code for instrumentation purposes or the processing of all observed events, or both.\r\n\r\nWe present a middleware framework, VAMOS, for the run-time monitoring of software which is explicitly designed to support third-party and best-effort scenarios. The design goals of VAMOS are (i) efficiency (keeping pace at low overhead), (ii) flexibility (the ability to monitor black-box code through a variety of different event channels, and the connectability to monitors written in different specification languages), and (iii) ease-of-use. To achieve its goals, VAMOS combines aspects of event broker and event recognition systems with aspects of stream processing systems.\r\n\r\nWe implemented a prototype toolchain for VAMOS and conducted experiments including a case study of monitoring for data races. The results indicate that VAMOS enables writing useful yet efficient monitors, is compatible with a variety of event sources and monitor specifications, and simplifies key aspects of setting up a monitoring system from scratch."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12407","title":"VAMOS: Middleware for Best-Effort Third-Party Monitoring","status":"public","ddc":["005"],"oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":662409,"creator":"fmuehlbo","file_name":"main.pdf","access_level":"open_access","date_created":"2023-01-27T03:18:34Z","date_updated":"2023-01-27T03:18:34Z","checksum":"55426e463fdeafe9777fc3ff635154c7","success":1,"relation":"main_file","file_id":"12408"}],"publication_identifier":{"eissn":["2664-1690"]},"month":"01","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"project":[{"call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"}],"doi":"10.15479/AT:ISTA:12407","language":[{"iso":"eng"}],"ec_funded":1,"file_date_updated":"2023-01-27T03:18:34Z","year":"2023","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093. \r\nThe authors would like to thank the anonymous FASE reviewers for their valuable feedback and suggestions.","department":[{"_id":"ToHe"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","related_material":{"record":[{"id":"12856","relation":"later_version","status":"public"}]},"author":[{"id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","first_name":"Marek","last_name":"Chalupa","full_name":"Chalupa, Marek"},{"full_name":"Mühlböck, Fabian","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","orcid":"0000-0003-1548-0177","first_name":"Fabian","last_name":"Mühlböck"},{"full_name":"Muroya Lei, Stefanie","first_name":"Stefanie","last_name":"Muroya Lei","id":"a376de31-8972-11ed-ae7b-d0251c13c8ff"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"date_updated":"2023-04-25T07:19:06Z","date_created":"2023-01-27T03:18:08Z"},{"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","status":"public","title":"Dynamic chromatin regulatory programs during embryogenesis of hexaploid wheat","intvolume":" 24","day":"13","article_processing_charge":"No","scopus_import":"1","date_published":"2023-01-13T00:00:00Z","publication":"Genome Biology","citation":{"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.","ieee":"L. Zhao et al., “Dynamic chromatin regulatory programs during embryogenesis of hexaploid wheat,” Genome Biology, vol. 24. Springer Nature, 2023.","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","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","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.","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.","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)."},"article_type":"original","extern":"1","article_number":"7","author":[{"first_name":"Long","last_name":"Zhao","full_name":"Zhao, Long"},{"full_name":"Yang, Yiman","first_name":"Yiman","last_name":"Yang"},{"first_name":"Jinchao","last_name":"Chen","full_name":"Chen, Jinchao"},{"full_name":"Lin, Xuelei","last_name":"Lin","first_name":"Xuelei"},{"first_name":"Hao","last_name":"Zhang","full_name":"Zhang, Hao"},{"full_name":"Wang, Hao","last_name":"Wang","first_name":"Hao"},{"first_name":"Hongzhe","last_name":"Wang","full_name":"Wang, Hongzhe"},{"full_name":"Bie, Xiaomin","last_name":"Bie","first_name":"Xiaomin"},{"first_name":"Jiafu","last_name":"Jiang","full_name":"Jiang, Jiafu"},{"full_name":"Feng, Xiaoqi","first_name":"Xiaoqi","last_name":"Feng","id":"e0164712-22ee-11ed-b12a-d80fcdf35958","orcid":"0000-0002-4008-1234"},{"full_name":"Fu, Xiangdong","last_name":"Fu","first_name":"Xiangdong"},{"first_name":"Xiansheng","last_name":"Zhang","full_name":"Zhang, Xiansheng"},{"full_name":"Du, Zhuo","first_name":"Zhuo","last_name":"Du"},{"last_name":"Xiao","first_name":"Jun","full_name":"Xiao, Jun"}],"date_created":"2023-02-23T09:13:49Z","date_updated":"2023-05-08T10:52:49Z","volume":24,"year":"2023","pmid":1,"publication_status":"published","publisher":"Springer Nature","department":[{"_id":"XiFe"}],"month":"01","publication_identifier":{"issn":["1474-760X"]},"doi":"10.1186/s13059-022-02844-2","language":[{"iso":"eng"}],"oa":1,"external_id":{"pmid":["36639687"]},"main_file_link":[{"url":"https://doi.org/10.1186/s13059-022-02844-2","open_access":"1"}],"quality_controlled":"1"},{"type":"journal_article","issue":"4","abstract":[{"text":"The multicomponent approach allows to incorporate several functionalities into a single covalent organic framework (COF) and consequently allows the construction of bifunctional materials for cooperative catalysis. The well-defined structure of such multicomponent COFs is furthermore ideally suited for structure-activity relationship studies. We report a series of multicomponent COFs that contain acridine- and 2,2’-bipyridine linkers connected through 1,3,5-benzenetrialdehyde derivatives. The acridine motif is responsible for broad light absorption, while the bipyridine unit enables complexation of nickel catalysts. These features enable the usage of the framework materials as catalysts for light-mediated carbon−heteroatom cross-couplings. Variation of the node units shows that the catalytic activity correlates to the keto-enamine tautomer isomerism. This allows switching between high charge-carrier mobility and persistent, localized charge-separated species depending on the nodes, a tool to tailor the materials for specific reactions. Moreover, nickel-loaded COFs are recyclable and catalyze cross-couplings even using red light irradiation.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12920","intvolume":" 29","title":"Programmable photocatalytic activity of multicomponent covalent organic frameworks used as metallaphotocatalysts","status":"public","oa_version":"Published Version","scopus_import":"1","keyword":["General Chemistry","Catalysis","Organic Chemistry"],"article_processing_charge":"No","day":"18","citation":{"chicago":"Traxler, Michael, Susanne Reischauer, Sarah Vogl, Jérôme Roeser, Jabor Rabeah, Christopher Penschke, Peter Saalfrank, Bartholomäus Pieber, and Arne Thomas. “Programmable Photocatalytic Activity of Multicomponent Covalent Organic Frameworks Used as Metallaphotocatalysts.” Chemistry – A European Journal. Wiley, 2023. https://doi.org/10.1002/chem.202202967.","mla":"Traxler, Michael, et al. “Programmable Photocatalytic Activity of Multicomponent Covalent Organic Frameworks Used as Metallaphotocatalysts.” Chemistry – A European Journal, vol. 29, no. 4, e202202967, Wiley, 2023, doi:10.1002/chem.202202967.","short":"M. Traxler, S. Reischauer, S. Vogl, J. Roeser, J. Rabeah, C. Penschke, P. Saalfrank, B. Pieber, A. Thomas, Chemistry – A European Journal 29 (2023).","ista":"Traxler M, Reischauer S, Vogl S, Roeser J, Rabeah J, Penschke C, Saalfrank P, Pieber B, Thomas A. 2023. Programmable photocatalytic activity of multicomponent covalent organic frameworks used as metallaphotocatalysts. Chemistry – A European Journal. 29(4), e202202967.","ieee":"M. Traxler et al., “Programmable photocatalytic activity of multicomponent covalent organic frameworks used as metallaphotocatalysts,” Chemistry – A European Journal, vol. 29, no. 4. Wiley, 2023.","apa":"Traxler, M., Reischauer, S., Vogl, S., Roeser, J., Rabeah, J., Penschke, C., … Thomas, A. (2023). Programmable photocatalytic activity of multicomponent covalent organic frameworks used as metallaphotocatalysts. Chemistry – A European Journal. Wiley. https://doi.org/10.1002/chem.202202967","ama":"Traxler M, Reischauer S, Vogl S, et al. Programmable photocatalytic activity of multicomponent covalent organic frameworks used as metallaphotocatalysts. Chemistry – A European Journal. 2023;29(4). doi:10.1002/chem.202202967"},"publication":"Chemistry – A European Journal","article_type":"original","date_published":"2023-01-18T00:00:00Z","article_number":"e202202967","extern":"1","year":"2023","publisher":"Wiley","publication_status":"published","author":[{"full_name":"Traxler, Michael","first_name":"Michael","last_name":"Traxler"},{"last_name":"Reischauer","first_name":"Susanne","full_name":"Reischauer, Susanne"},{"full_name":"Vogl, Sarah","first_name":"Sarah","last_name":"Vogl"},{"full_name":"Roeser, Jérôme","first_name":"Jérôme","last_name":"Roeser"},{"full_name":"Rabeah, Jabor","last_name":"Rabeah","first_name":"Jabor"},{"last_name":"Penschke","first_name":"Christopher","full_name":"Penschke, Christopher"},{"full_name":"Saalfrank, Peter","last_name":"Saalfrank","first_name":"Peter"},{"first_name":"Bartholomäus","last_name":"Pieber","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X","full_name":"Pieber, Bartholomäus"},{"full_name":"Thomas, Arne","last_name":"Thomas","first_name":"Arne"}],"volume":29,"date_created":"2023-05-08T08:25:34Z","date_updated":"2023-05-15T08:39:24Z","publication_identifier":{"issn":["0947-6539"],"eissn":["1521-3765"]},"month":"01","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1002/chem.202202967"}],"quality_controlled":"1","doi":"10.1002/chem.202202967","language":[{"iso":"eng"}]},{"year":"2023","publisher":"Wiley","publication_status":"published","author":[{"last_name":"Madani","first_name":"Amiera","full_name":"Madani, Amiera"},{"full_name":"Pieber, Bartholomäus","orcid":"0000-0001-8689-388X","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","last_name":"Pieber","first_name":"Bartholomäus"}],"volume":15,"date_updated":"2023-05-15T08:35:48Z","date_created":"2023-05-08T08:25:55Z","article_number":"e202201583","extern":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1002/cctc.202201583"}],"quality_controlled":"1","doi":"10.1002/cctc.202201583","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1867-3880"],"eissn":["1867-3899"]},"month":"04","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12921","intvolume":" 15","title":"In situ reaction monitoring in photocatalytic organic synthesis","status":"public","oa_version":"Published Version","type":"journal_article","issue":"7","abstract":[{"lang":"eng","text":"Visible-light photocatalysis provides numerous useful methodologies for synthetic organic chemistry. However, the mechanisms of these reactions are often not fully understood. Common mechanistic experiments mainly aim to characterize excited state properties of photocatalysts and their interaction with other species. Recently, in situ reaction monitoring using dedicated techniques was shown to be well-suited for the identification of intermediates and to obtain kinetic insights, thereby providing more holistic pictures of the reactions of interest. This minireview surveys these technologies and discusses selected examples where reaction monitoring was used to elucidate the mechanism of photocatalytic reactions."}],"citation":{"mla":"Madani, Amiera, and Bartholomäus Pieber. “In Situ Reaction Monitoring in Photocatalytic Organic Synthesis.” ChemCatChem, vol. 15, no. 7, e202201583, Wiley, 2023, doi:10.1002/cctc.202201583.","short":"A. Madani, B. Pieber, ChemCatChem 15 (2023).","chicago":"Madani, Amiera, and Bartholomäus Pieber. “In Situ Reaction Monitoring in Photocatalytic Organic Synthesis.” ChemCatChem. Wiley, 2023. https://doi.org/10.1002/cctc.202201583.","ama":"Madani A, Pieber B. In situ reaction monitoring in photocatalytic organic synthesis. ChemCatChem. 2023;15(7). doi:10.1002/cctc.202201583","ista":"Madani A, Pieber B. 2023. In situ reaction monitoring in photocatalytic organic synthesis. ChemCatChem. 15(7), e202201583.","apa":"Madani, A., & Pieber, B. (2023). In situ reaction monitoring in photocatalytic organic synthesis. ChemCatChem. Wiley. https://doi.org/10.1002/cctc.202201583","ieee":"A. Madani and B. Pieber, “In situ reaction monitoring in photocatalytic organic synthesis,” ChemCatChem, vol. 15, no. 7. Wiley, 2023."},"publication":"ChemCatChem","article_type":"original","date_published":"2023-04-06T00:00:00Z","scopus_import":"1","keyword":["Inorganic Chemistry","Organic Chemistry","Physical and Theoretical Chemistry","Catalysis"],"article_processing_charge":"No","day":"06"},{"publication":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","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.","short":"A. Lieutier, M. Wintraecken, in:, Proceedings of the 55th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2023, pp. 1768–1776.","mla":"Lieutier, André, and Mathijs Wintraecken. “Hausdorff and Gromov-Hausdorff Stable Subsets of the Medial Axis.” Proceedings of the 55th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2023, pp. 1768–76, doi:10.1145/3564246.3585113.","ieee":"A. Lieutier and M. Wintraecken, “Hausdorff and Gromov-Hausdorff stable subsets of the medial axis,” in Proceedings of the 55th Annual ACM Symposium on Theory of Computing, Orlando, FL, United States, 2023, pp. 1768–1776.","apa":"Lieutier, A., & Wintraecken, M. (2023). Hausdorff and Gromov-Hausdorff stable subsets of the medial axis. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing (pp. 1768–1776). Orlando, FL, United States: Association for Computing Machinery. https://doi.org/10.1145/3564246.3585113","ista":"Lieutier A, Wintraecken M. 2023. Hausdorff and Gromov-Hausdorff stable subsets of the medial axis. Proceedings of the 55th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 1768–1776.","ama":"Lieutier A, Wintraecken M. Hausdorff and Gromov-Hausdorff stable subsets of the medial axis. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 2023:1768-1776. doi:10.1145/3564246.3585113"},"page":"1768-1776","date_published":"2023-06-02T00:00:00Z","day":"02","article_processing_charge":"No","_id":"13048","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Hausdorff and Gromov-Hausdorff stable subsets of the medial axis","oa_version":"Preprint","type":"conference","abstract":[{"lang":"eng","text":"In this paper we introduce a pruning of the medial axis called the (λ,α)-medial axis (axλα). We prove that the (λ,α)-medial axis of a set K is stable in a Gromov-Hausdorff sense under weak assumptions. More formally we prove that if K and K′ are close in the Hausdorff (dH) sense then the (λ,α)-medial axes of K and K′ are close as metric spaces, that is the Gromov-Hausdorff distance (dGH) between the two is 1/4-Hölder in the sense that dGH (axλα(K),axλα(K′)) ≲ dH(K,K′)1/4. The Hausdorff distance between the two medial axes is also bounded, by dH (axλα(K),λα(K′)) ≲ dH(K,K′)1/2. These quantified stability results provide guarantees for practical computations of medial axes from approximations. Moreover, they provide key ingredients for studying the computability of the medial axis in the context of computable analysis."}],"external_id":{"arxiv":["2303.04014"]},"main_file_link":[{"url":"https://arxiv.org/abs/2303.04014","open_access":"1"}],"oa":1,"quality_controlled":"1","project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"},{"name":"Learning and triangulating manifolds via collapses","grant_number":"M03073","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2"}],"conference":{"start_date":"2023-06-20","location":"Orlando, FL, United States","end_date":"2023-06-23","name":"STOC: Symposium on Theory of Computing"},"doi":"10.1145/3564246.3585113","language":[{"iso":"eng"}],"month":"06","publication_identifier":{"isbn":["9781450399135"]},"year":"2023","acknowledgement":"We are greatly indebted to Erin Chambers for posing a number of questions that eventually led to this paper. We would also like to thank the other organizers of the workshop on ‘Algorithms\r\nfor the medial axis’. We are also indebted to Tatiana Ezubova for helping with the search for and translation of Russian literature. The second author thanks all members of the Edelsbrunner and Datashape groups for the atmosphere in which the research was conducted.\r\nThe research leading to these results has received funding from the European Research Council (ERC) under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement No. 339025 GUDHI (Algorithmic Foundations of Geometry Understanding in Higher Dimensions). Supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411. The Austrian science fund (FWF) M-3073.","publication_status":"published","publisher":"Association for Computing Machinery","department":[{"_id":"HeEd"}],"author":[{"last_name":"Lieutier","first_name":"André","full_name":"Lieutier, André"},{"full_name":"Wintraecken, Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220","first_name":"Mathijs","last_name":"Wintraecken"}],"date_updated":"2023-05-22T08:15:19Z","date_created":"2023-05-22T08:02:02Z","ec_funded":1},{"date_published":"2023-05-01T00:00:00Z","conference":{"end_date":"2023-05-05","location":"Kigali, Rwanda ","start_date":"2023-05-01","name":"ICLR: International Conference on Learning Representations"},"language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"citation":{"short":"E.-A. Peste, A. Vladu, E. Kurtic, C. Lampert, D.-A. Alistarh, in:, 11th International Conference on Learning Representations , n.d.","mla":"Peste, Elena-Alexandra, et al. “CrAM: A Compression-Aware Minimizer.” 11th International Conference on Learning Representations .","chicago":"Peste, Elena-Alexandra, Adrian Vladu, Eldar Kurtic, Christoph Lampert, and Dan-Adrian Alistarh. “CrAM: A Compression-Aware Minimizer.” In 11th International Conference on Learning Representations , n.d.","ama":"Peste E-A, Vladu A, Kurtic E, Lampert C, Alistarh D-A. CrAM: A Compression-Aware Minimizer. In: 11th International Conference on Learning Representations .","apa":"Peste, E.-A., Vladu, A., Kurtic, E., Lampert, C., & Alistarh, D.-A. (n.d.). CrAM: A Compression-Aware Minimizer. In 11th International Conference on Learning Representations . Kigali, Rwanda .","ieee":"E.-A. Peste, A. Vladu, E. Kurtic, C. Lampert, and D.-A. Alistarh, “CrAM: A Compression-Aware Minimizer,” in 11th International Conference on Learning Representations , Kigali, Rwanda .","ista":"Peste E-A, Vladu A, Kurtic E, Lampert C, Alistarh D-A. CrAM: A Compression-Aware Minimizer. 11th International Conference on Learning Representations . ICLR: International Conference on Learning Representations."},"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 ","project":[{"grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020"}],"quality_controlled":"1","article_processing_charge":"No","month":"05","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"13074"}]},"author":[{"last_name":"Peste","first_name":"Elena-Alexandra","id":"32D78294-F248-11E8-B48F-1D18A9856A87","full_name":"Peste, Elena-Alexandra"},{"last_name":"Vladu","first_name":"Adrian","full_name":"Vladu, Adrian"},{"first_name":"Eldar","last_name":"Kurtic","id":"47beb3a5-07b5-11eb-9b87-b108ec578218","full_name":"Kurtic, Eldar"},{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph"},{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"}],"oa_version":"Preprint","date_updated":"2023-06-01T12:54:45Z","date_created":"2023-05-23T11:36:18Z","_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)-","department":[{"_id":"GradSch"},{"_id":"DaAl"},{"_id":"ChLa"}],"status":"public","title":"CrAM: A Compression-Aware Minimizer","publication_status":"accepted","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"},{"author":[{"id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7","first_name":"Charlotte","last_name":"Hoffmann","full_name":"Hoffmann, Charlotte"},{"first_name":"Pavel","last_name":"Hubáček","full_name":"Hubáček, Pavel"},{"first_name":"Chethan","last_name":"Kamath","full_name":"Kamath, Chethan"},{"first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"}],"volume":13940,"date_updated":"2023-06-19T08:03:37Z","date_created":"2023-06-18T22:00:47Z","acknowledgement":"We are grateful to Pavel Atnashev for clarifying via e-mail several aspects of the primality tests implementated in the PrimeGrid project. Pavel Hubáček is supported by the Czech Academy of Sciences (RVO 67985840), the Grant Agency of the Czech Republic under the grant agreement no. 19-27871X, and by the Charles University project UNCE/SCI/004. Chethan Kamath is supported by Azrieli International Postdoctoral Fellowship, ISF grants 484/18 and 1789/19, and ERC StG project SPP: Secrecy Preserving Proofs.","year":"2023","publisher":"Springer Nature","department":[{"_id":"KrPi"}],"publication_status":"published","doi":"10.1007/978-3-031-31368-4_19","conference":{"start_date":"2023-05-07","location":"Atlanta, GA, United States","end_date":"2023-05-10","name":"PKC: Public-Key Cryptography"},"language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"url":"https://eprint.iacr.org/2023/238","open_access":"1"}],"quality_controlled":"1","publication_identifier":{"isbn":["9783031313677"],"eissn":["1611-3349"],"issn":["0302-9743"]},"month":"05","oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"13143","intvolume":" 13940","status":"public","title":"Certifying giant nonprimes","abstract":[{"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.","lang":"eng"}],"type":"conference","alternative_title":["LNCS"],"date_published":"2023-05-02T00:00:00Z","citation":{"ista":"Hoffmann C, Hubáček P, Kamath C, Pietrzak KZ. 2023. Certifying giant nonprimes. Public-Key Cryptography - PKC 2023. PKC: Public-Key Cryptography, LNCS, vol. 13940, 530–553.","apa":"Hoffmann, C., Hubáček, P., Kamath, C., & Pietrzak, K. Z. (2023). Certifying giant nonprimes. In Public-Key Cryptography - PKC 2023 (Vol. 13940, pp. 530–553). Atlanta, GA, United States: Springer Nature. https://doi.org/10.1007/978-3-031-31368-4_19","ieee":"C. Hoffmann, P. Hubáček, C. Kamath, and K. Z. Pietrzak, “Certifying giant nonprimes,” in Public-Key Cryptography - PKC 2023, Atlanta, GA, United States, 2023, vol. 13940, pp. 530–553.","ama":"Hoffmann C, Hubáček P, Kamath C, Pietrzak KZ. Certifying giant nonprimes. In: Public-Key Cryptography - PKC 2023. Vol 13940. Springer Nature; 2023:530-553. doi:10.1007/978-3-031-31368-4_19","chicago":"Hoffmann, Charlotte, Pavel Hubáček, Chethan Kamath, and Krzysztof Z Pietrzak. “Certifying Giant Nonprimes.” In Public-Key Cryptography - PKC 2023, 13940:530–53. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-31368-4_19.","mla":"Hoffmann, Charlotte, et al. “Certifying Giant Nonprimes.” Public-Key Cryptography - PKC 2023, vol. 13940, Springer Nature, 2023, pp. 530–53, doi:10.1007/978-3-031-31368-4_19.","short":"C. Hoffmann, P. Hubáček, C. Kamath, K.Z. Pietrzak, in:, Public-Key Cryptography - PKC 2023, Springer Nature, 2023, pp. 530–553."},"publication":"Public-Key Cryptography - PKC 2023","page":"530-553","article_processing_charge":"No","day":"02","scopus_import":"1"},{"_id":"13142","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 13993","status":"public","ddc":["000"],"title":"A learner-verifier framework for neural network controllers and certificates of stochastic systems","oa_version":"Published Version","file":[{"file_name":"2023_LNCS_Chatterjee.pdf","access_level":"open_access","file_size":528455,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"13150","date_created":"2023-06-19T08:29:30Z","date_updated":"2023-06-19T08:29:30Z","checksum":"3d8a8bb24d211bc83360dfc2fd744307","success":1}],"type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"Reinforcement learning has received much attention for learning controllers of deterministic systems. We consider a learner-verifier framework for stochastic control systems and survey recent methods that formally guarantee a conjunction of reachability and safety properties. Given a property and a lower bound on the probability of the property being satisfied, our framework jointly learns a control policy and a formal certificate to ensure the satisfaction of the property with a desired probability threshold. Both the control policy and the formal certificate are continuous functions from states to reals, which are learned as parameterized neural networks. While in the deterministic case, the certificates are invariant and barrier functions for safety, or Lyapunov and ranking functions for liveness, in the stochastic case the certificates are supermartingales. For certificate verification, we use interval arithmetic abstract interpretation to bound the expected values of neural network functions."}],"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."},"publication":"Tools and Algorithms for the Construction and Analysis of Systems ","page":"3-25","date_published":"2023-04-22T00:00:00Z","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"22","year":"2023","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.","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"Springer Nature","publication_status":"published","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Lechner, Mathias","last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","first_name":"Dorde"}],"volume":13993,"date_updated":"2023-06-19T08:30:54Z","date_created":"2023-06-18T22:00:47Z","ec_funded":1,"file_date_updated":"2023-06-19T08:29:30Z","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":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"call_identifier":"H2020","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"}],"quality_controlled":"1","doi":"10.1007/978-3-031-30823-9_1","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2023-04-27","location":"Paris, France","start_date":"2023-04-22"},"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783031308222"]},"month":"04"},{"language":[{"iso":"eng"}],"doi":"10.1007/978-3-031-30820-8_15","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2023-04-27","start_date":"2023-04-22","location":"Paris, France"},"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783031308192"]},"month":"04","volume":13994,"date_updated":"2023-06-19T08:49:46Z","date_created":"2023-06-18T22:00:47Z","author":[{"last_name":"Anand","first_name":"Ashwani","full_name":"Anand, Ashwani"},{"first_name":"Kaushik","last_name":"Mallik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","orcid":"0000-0001-9864-7475","full_name":"Mallik, Kaushik"},{"first_name":"Satya Prakash","last_name":"Nayak","full_name":"Nayak, Satya Prakash"},{"first_name":"Anne Kathrin","last_name":"Schmuck","full_name":"Schmuck, Anne Kathrin"}],"department":[{"_id":"ToHe"}],"publisher":"Springer Nature","publication_status":"published","year":"2023","file_date_updated":"2023-06-19T08:43:21Z","date_published":"2023-04-20T00:00:00Z","page":"211-228","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.","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.","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","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"},"publication":"TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems","article_processing_charge":"No","has_accepted_license":"1","day":"20","scopus_import":"1","oa_version":"Published Version","file":[{"creator":"dernst","content_type":"application/pdf","file_size":521425,"file_name":"2023_LNCS_Anand.pdf","access_level":"open_access","date_updated":"2023-06-19T08:43:21Z","date_created":"2023-06-19T08:43:21Z","success":1,"checksum":"60dcafc1b4f6f070be43bad3fe877974","file_id":"13151","relation":"main_file"}],"intvolume":" 13994","status":"public","ddc":["000"],"title":"Computing adequately permissive assumptions for synthesis","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"13141","abstract":[{"text":"We automatically compute a new class of environment assumptions in two-player turn-based finite graph games which characterize an “adequate cooperation” needed from the environment to allow the system player to win. Given an ω-regular winning condition Φ for the system player, we compute an ω-regular assumption Ψ for the environment player, such that (i) every environment strategy compliant with Ψ allows the system to fulfill Φ (sufficiency), (ii) Ψ\r\n can be fulfilled by the environment for every strategy of the system (implementability), and (iii) Ψ does not prevent any cooperative strategy choice (permissiveness).\r\nFor parity games, which are canonical representations of ω-regular games, we present a polynomial-time algorithm for the symbolic computation of adequately permissive assumptions and show that our algorithm runs faster and produces better assumptions than existing approaches—both theoretically and empirically. To the best of our knowledge, for ω\r\n-regular games, we provide the first algorithm to compute sufficient and implementable environment assumptions that are also permissive.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference"},{"date_published":"2023-04-18T00:00:00Z","page":"106","citation":{"mla":"Pokusaeva, Victoria. Neural Control of Optic Flow-Based Navigation in Drosophila Melanogaster. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:12826.","short":"V. Pokusaeva, Neural Control of Optic Flow-Based Navigation in Drosophila Melanogaster, Institute of Science and Technology Austria, 2023.","chicago":"Pokusaeva, Victoria. “Neural Control of Optic Flow-Based Navigation in Drosophila Melanogaster.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:12826.","ama":"Pokusaeva V. Neural control of optic flow-based navigation in Drosophila melanogaster. 2023. doi:10.15479/at:ista:12826","ista":"Pokusaeva V. 2023. Neural control of optic flow-based navigation in Drosophila melanogaster. Institute of Science and Technology Austria.","ieee":"V. Pokusaeva, “Neural control of optic flow-based navigation in Drosophila melanogaster,” Institute of Science and Technology Austria, 2023.","apa":"Pokusaeva, V. (2023). Neural control of optic flow-based navigation in Drosophila melanogaster. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12826"},"has_accepted_license":"1","article_processing_charge":"No","day":"18","oa_version":"Published Version","file":[{"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_size":14507243,"creator":"vpokusae","file_name":"Thesis_Pokusaeva.docx","access_level":"closed","date_created":"2023-04-20T09:14:38Z","date_updated":"2023-04-20T09:26:51Z","checksum":"5f589a9af025f7eeebfd0c186209913e","relation":"source_file","file_id":"12857"},{"date_updated":"2023-04-20T09:14:44Z","date_created":"2023-04-20T09:14:44Z","success":1,"checksum":"bbeed76db45a996b4c91a9abe12ce0ec","file_id":"12858","relation":"main_file","creator":"vpokusae","file_size":10090711,"content_type":"application/pdf","file_name":"Thesis_Pokusaeva.pdf","access_level":"open_access"}],"ddc":["570","571"],"title":"Neural control of optic flow-based navigation in Drosophila melanogaster","status":"public","_id":"12826","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","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"}],"alternative_title":["ISTA Thesis"],"type":"dissertation","language":[{"iso":"eng"}],"supervisor":[{"full_name":"Jösch, Maximilian A","orcid":"0000-0002-3937-1330","id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","last_name":"Jösch","first_name":"Maximilian A"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"degree_awarded":"PhD","doi":"10.15479/at:ista:12826","project":[{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"publication_identifier":{"issn":["2663 - 337X"]},"month":"04","date_updated":"2023-06-23T09:47:36Z","date_created":"2023-04-14T14:56:04Z","author":[{"first_name":"Victoria","last_name":"Pokusaeva","id":"3184041C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7660-444X","full_name":"Pokusaeva, Victoria"}],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"MaJö"},{"_id":"GradSch"}],"publication_status":"published","year":"2023","ec_funded":1,"file_date_updated":"2023-04-20T09:26:51Z"},{"file_date_updated":"2023-01-20T10:02:48Z","ec_funded":1,"publication_status":"published","publisher":"Springer Nature","department":[{"_id":"HeEd"}],"acknowledgement":"Open access funding provided by Austrian Science Fund (FWF). This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, Grant No. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), Grant No. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), Grant No. I 02979-N35.","year":"2023","date_created":"2022-09-11T22:01:57Z","date_updated":"2023-06-27T12:53:43Z","volume":85,"author":[{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"full_name":"Osang, Georg F","first_name":"Georg F","last_name":"Osang","id":"464B40D6-F248-11E8-B48F-1D18A9856A87"}],"month":"01","publication_identifier":{"issn":["0178-4617"],"eissn":["1432-0541"]},"isi":1,"quality_controlled":"1","project":[{"name":"Alpha Shape Theory Extended","call_identifier":"H2020","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"name":"Persistence and stability of geometric complexes","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35"}],"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":["000846967100001"]},"language":[{"iso":"eng"}],"doi":"10.1007/s00453-022-01027-6","type":"journal_article","abstract":[{"text":"We present a simple algorithm for computing higher-order Delaunay mosaics that works in Euclidean spaces of any finite dimensions. The algorithm selects the vertices of the order-k mosaic from incrementally constructed lower-order mosaics and uses an algorithm for weighted first-order Delaunay mosaics as a black-box to construct the order-k mosaic from its vertices. Beyond this black-box, the algorithm uses only combinatorial operations, thus facilitating easy implementation. We extend this algorithm to compute higher-order α-shapes and provide open-source implementations. We present experimental results for properties of higher-order Delaunay mosaics of random point sets.","lang":"eng"}],"status":"public","ddc":["510"],"title":"A simple algorithm for higher-order Delaunay mosaics and alpha shapes","intvolume":" 85","user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","_id":"12086","file":[{"file_name":"2023_Algorithmica_Edelsbrunner.pdf","access_level":"open_access","content_type":"application/pdf","file_size":911017,"creator":"dernst","relation":"main_file","file_id":"12322","date_updated":"2023-01-20T10:02:48Z","date_created":"2023-01-20T10:02:48Z","checksum":"71685ca5121f4c837f40c3f8eb50c915","success":1}],"oa_version":"Published Version","scopus_import":"1","day":"01","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","article_type":"original","page":"277-295","publication":"Algorithmica","citation":{"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.","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","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.","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."},"date_published":"2023-01-01T00:00:00Z"},{"scopus_import":"1","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","day":"01","citation":{"ista":"Dello Schiavo L, Wirth M. 2023. Ergodic decompositions of Dirichlet forms under order isomorphisms. Journal of Evolution Equations. 23(1), 9.","ieee":"L. Dello Schiavo and M. Wirth, “Ergodic decompositions of Dirichlet forms under order isomorphisms,” Journal of Evolution Equations, vol. 23, no. 1. Springer Nature, 2023.","apa":"Dello Schiavo, L., & Wirth, M. (2023). Ergodic decompositions of Dirichlet forms under order isomorphisms. Journal of Evolution Equations. Springer Nature. https://doi.org/10.1007/s00028-022-00859-7","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)."},"publication":"Journal of Evolution Equations","article_type":"original","date_published":"2023-01-01T00:00:00Z","type":"journal_article","issue":"1","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"}],"_id":"12104","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 23","ddc":["510"],"title":"Ergodic decompositions of Dirichlet forms under order isomorphisms","status":"public","file":[{"relation":"main_file","file_id":"12325","date_created":"2023-01-20T10:45:06Z","date_updated":"2023-01-20T10:45:06Z","checksum":"1f34f3e2cb521033de6154f274ea3a4e","success":1,"file_name":"2023_JourEvolutionEquations_DelloSchiavo.pdf","access_level":"open_access","file_size":422612,"content_type":"application/pdf","creator":"dernst"}],"oa_version":"Published Version","publication_identifier":{"eissn":["1424-3202"],"issn":["1424-3199"]},"month":"01","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000906214600004"]},"project":[{"name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504"},{"name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020","grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425"},{"_id":"34dbf174-11ca-11ed-8bc3-afe9d43d4b9c","grant_number":"E208","name":"Configuration Spaces over Non-Smooth Spaces"},{"name":"Gradient flow techniques for quantum Markov semigroups","grant_number":"ESP156_N","_id":"34c6ea2d-11ca-11ed-8bc3-c04f3c502833"}],"isi":1,"quality_controlled":"1","doi":"10.1007/s00028-022-00859-7","language":[{"iso":"eng"}],"article_number":"9","ec_funded":1,"file_date_updated":"2023-01-20T10:45:06Z","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).","year":"2023","department":[{"_id":"JaMa"}],"publisher":"Springer Nature","publication_status":"published","author":[{"last_name":"Dello Schiavo","first_name":"Lorenzo","orcid":"0000-0002-9881-6870","id":"ECEBF480-9E4F-11EA-B557-B0823DDC885E","full_name":"Dello Schiavo, Lorenzo"},{"orcid":"0000-0002-0519-4241","id":"88644358-0A0E-11EA-8FA5-49A33DDC885E","last_name":"Wirth","first_name":"Melchior","full_name":"Wirth, Melchior"}],"volume":23,"date_updated":"2023-06-28T11:54:35Z","date_created":"2023-01-08T23:00:53Z"},{"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"12467","title":"Quantitative safety and liveness","status":"public","ddc":["000"],"intvolume":" 13992","file":[{"access_level":"open_access","file_name":"qsl.pdf","creator":"esarac","file_size":449027,"content_type":"application/pdf","file_id":"12468","relation":"main_file","success":1,"checksum":"981025aed580b6b27c426cb8856cf63e","date_created":"2023-01-31T07:22:21Z","date_updated":"2023-01-31T07:22:21Z"},{"file_id":"13153","relation":"main_file","date_updated":"2023-06-19T10:28:09Z","date_created":"2023-06-19T10:28:09Z","success":1,"checksum":"f16e2af1e0eb243158ab0f0fe74e7d5a","file_name":"2023_LNCS_HenzingerT.pdf","access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":1048171}],"oa_version":"Published Version","type":"conference","alternative_title":["LNCS"],"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"}],"publication":"26th International Conference Foundations of Software Science and Computation Structures","citation":{"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","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.","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.","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.","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.","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."},"page":"349-370","date_published":"2023-04-21T00:00:00Z","scopus_import":"1","day":"21","has_accepted_license":"1","article_processing_charge":"No","acknowledgement":"We thank the anonymous reviewers for their helpful comments. This work was supported in part by the ERC-2020-AdG 101020093.","year":"2023","publication_status":"published","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publisher":"Springer Nature","author":[{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Mazzocchi, Nicolas Adrien","last_name":"Mazzocchi","first_name":"Nicolas Adrien","id":"b26baa86-3308-11ec-87b0-8990f34baa85"},{"full_name":"Sarac, Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","first_name":"Naci E","last_name":"Sarac"}],"date_updated":"2023-07-14T11:20:27Z","date_created":"2023-01-31T07:23:56Z","volume":13992,"file_date_updated":"2023-06-19T10:28:09Z","ec_funded":1,"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2301.11175"]},"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"conference":{"end_date":"2023-04-27","start_date":"2023-04-22","location":"Paris, France","name":"FOSSACS: Foundations of Software Science and Computation Structures"},"doi":"10.1007/978-3-031-30829-1_17","language":[{"iso":"eng"}],"month":"04","publication_identifier":{"isbn":["9783031308284"],"eissn":["1611-3349"],"issn":["0302-9743"]}},{"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","doi":"10.1145/3591230","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2475-1421"]},"month":"06","year":"2023","department":[{"_id":"DaAl"}],"publisher":"Association for Computing Machinery ","publication_status":"published","author":[{"id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87","first_name":"Nikita","last_name":"Koval","full_name":"Koval, Nikita"},{"last_name":"Khalanskiy","first_name":"Dmitry","full_name":"Khalanskiy, Dmitry"},{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian"}],"volume":7,"date_created":"2023-07-02T22:00:43Z","date_updated":"2023-07-17T08:43:19Z","article_number":"116","file_date_updated":"2023-07-03T13:09:39Z","citation":{"chicago":"Koval, Nikita, Dmitry Khalanskiy, and Dan-Adrian Alistarh. “CQS: A Formally-Verified Framework for Fair and Abortable Synchronization.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery , 2023. https://doi.org/10.1145/3591230.","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.","short":"N. Koval, D. Khalanskiy, D.-A. Alistarh, Proceedings of the ACM on Programming Languages 7 (2023).","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.","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","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"},"publication":"Proceedings of the ACM on Programming Languages","article_type":"original","date_published":"2023-06-06T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"06","_id":"13179","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 7","title":"CQS: A formally-verified framework for fair and abortable synchronization","ddc":["000"],"status":"public","file":[{"date_created":"2023-07-03T13:09:39Z","date_updated":"2023-07-03T13:09:39Z","checksum":"5dba6e73f0ed79adbdae14d165bc2f68","success":1,"relation":"main_file","file_id":"13187","file_size":1266773,"content_type":"application/pdf","creator":"alisjak","file_name":"2023_ACMProgram.Lang._Koval.pdf","access_level":"open_access"}],"oa_version":"Published Version","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."}]},{"year":"2023","publication_status":"published","department":[{"_id":"TiBr"}],"publisher":"Mathematical Sciences Publishers","author":[{"last_name":"Browning","first_name":"Timothy D","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Browning, Timothy D"},{"full_name":"Lyczak, Julian","id":"3572849A-F248-11E8-B48F-1D18A9856A87","last_name":"Lyczak","first_name":"Julian"},{"full_name":"Sarapin, Roman","last_name":"Sarapin","first_name":"Roman"}],"date_created":"2023-07-02T22:00:43Z","date_updated":"2023-07-17T08:39:19Z","volume":16,"month":"05","publication_identifier":{"issn":["1944-4176"],"eissn":["1944-4184"]},"oa":1,"external_id":{"arxiv":["2203.06881"]},"main_file_link":[{"url":"https://arxiv.org/abs/2203.06881","open_access":"1"}],"quality_controlled":"1","doi":"10.2140/involve.2023.16.331","language":[{"iso":"eng"}],"type":"journal_article","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"}],"issue":"2","_id":"13180","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Local solubility for a family of quadrics over a split quadric surface","intvolume":" 16","oa_version":"Preprint","scopus_import":"1","day":"26","article_processing_charge":"No","publication":"Involve","citation":{"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","apa":"Browning, T. D., Lyczak, J., & Sarapin, R. (2023). Local solubility for a family of quadrics over a split quadric surface. Involve. Mathematical Sciences Publishers. https://doi.org/10.2140/involve.2023.16.331","ieee":"T. D. Browning, J. Lyczak, and R. Sarapin, “Local solubility for a family of quadrics over a split quadric surface,” Involve, vol. 16, no. 2. Mathematical Sciences Publishers, pp. 331–342, 2023.","ista":"Browning TD, Lyczak J, Sarapin R. 2023. Local solubility for a family of quadrics over a split quadric surface. Involve. 16(2), 331–342.","short":"T.D. Browning, J. Lyczak, R. Sarapin, Involve 16 (2023) 331–342.","mla":"Browning, Timothy D., et al. “Local Solubility for a Family of Quadrics over a Split Quadric Surface.” Involve, vol. 16, no. 2, Mathematical Sciences Publishers, 2023, pp. 331–42, doi:10.2140/involve.2023.16.331.","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."},"article_type":"original","page":"331-342","date_published":"2023-05-26T00:00:00Z"},{"author":[{"full_name":"Elefante, Stefano","last_name":"Elefante","first_name":"Stefano","id":"490F40CE-F248-11E8-B48F-1D18A9856A87"},{"id":"4D0BC184-F248-11E8-B48F-1D18A9856A87","last_name":"Stadlbauer","first_name":"Stephan","full_name":"Stadlbauer, Stephan"},{"id":"3A02A8FA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael F","last_name":"Alexander","full_name":"Alexander, Michael F"},{"id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5621-8100","first_name":"Alois","last_name":"Schlögl","full_name":"Schlögl, Alois"}],"oa_version":"Submitted Version","file":[{"file_name":"2023_ASHPC_Elefante.pdf","access_level":"open_access","content_type":"application/pdf","file_size":380354,"creator":"dernst","relation":"main_file","file_id":"13250","date_updated":"2023-07-18T09:28:30Z","date_created":"2023-07-18T09:28:30Z","checksum":"0ab6173cd5c5634ed773cd37ff012681","success":1}],"date_created":"2023-06-23T11:03:18Z","date_updated":"2023-07-18T09:32:16Z","_id":"13162","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2023","department":[{"_id":"ScienComp"}],"publisher":"EuroCC","status":"public","publication_status":"accepted","title":"Cryo-EM software packages: A sys-admins point of view","ddc":["000"],"file_date_updated":"2023-07-18T09:28:30Z","type":"conference_abstract","date_published":"2023-07-01T00:00:00Z","conference":{"name":"ASHPC: Austrian-Slovenian HPC Meeting","end_date":"2023-06-15","start_date":"2023-06-12","location":"Maribor, Slovenia"},"language":[{"iso":"eng"}],"citation":{"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.","ista":"Elefante S, Stadlbauer S, Alexander MF, Schlögl A. Cryo-EM software packages: A sys-admins point of view. ASHPC23 - Austrian-Slovenian HPC Meeting 2023. ASHPC: Austrian-Slovenian HPC Meeting, 42–42.","apa":"Elefante, S., Stadlbauer, S., Alexander, M. F., & Schlögl, A. (n.d.). Cryo-EM software packages: A sys-admins point of view. In ASHPC23 - Austrian-Slovenian HPC Meeting 2023 (pp. 42–42). Maribor, Slovenia: EuroCC.","ieee":"S. Elefante, S. Stadlbauer, M. F. Alexander, and A. Schlögl, “Cryo-EM software packages: A sys-admins point of view,” in ASHPC23 - Austrian-Slovenian HPC Meeting 2023, Maribor, Slovenia, pp. 42–42.","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.","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."},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"publication":"ASHPC23 - Austrian-Slovenian HPC Meeting 2023","page":"42-42","quality_controlled":"1","article_processing_charge":"No","has_accepted_license":"1","month":"07","day":"01"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"13161","ddc":["000"],"status":"public","title":"Running Windows-applications on a Linux HPC cluster using WINE","oa_version":"Submitted Version","file":[{"relation":"main_file","file_id":"13249","checksum":"ec8e4295d54171032cdd1b01423eb4a6","success":1,"date_updated":"2023-07-18T09:18:55Z","date_created":"2023-07-18T09:18:55Z","access_level":"open_access","file_name":"2023_ASHPC_Schloegl.pdf","file_size":316959,"content_type":"application/pdf","creator":"dernst"}],"type":"conference_abstract","publication":"ASHPC23 - Austrian-Slovenian HPC Meeting 2023","citation":{"ama":"Schlögl A, Elefante S, Hodirnau V-V. Running Windows-applications on a Linux HPC cluster using WINE. In: ASHPC23 - Austrian-Slovenian HPC Meeting 2023. EuroCC; :59-59.","ieee":"A. Schlögl, S. Elefante, and V.-V. Hodirnau, “Running Windows-applications on a Linux HPC cluster using WINE,” in ASHPC23 - Austrian-Slovenian HPC Meeting 2023, Maribor, Slovenia, pp. 59–59.","apa":"Schlögl, A., Elefante, S., & Hodirnau, V.-V. (n.d.). Running Windows-applications on a Linux HPC cluster using WINE. In ASHPC23 - Austrian-Slovenian HPC Meeting 2023 (pp. 59–59). Maribor, Slovenia: EuroCC.","ista":"Schlögl A, Elefante S, Hodirnau V-V. Running Windows-applications on a Linux HPC cluster using WINE. ASHPC23 - Austrian-Slovenian HPC Meeting 2023. ASHPC: Austrian-Slovenian HPC Meeting, 59–59.","short":"A. Schlögl, S. Elefante, V.-V. Hodirnau, in:, ASHPC23 - Austrian-Slovenian HPC Meeting 2023, EuroCC, n.d., pp. 59–59.","mla":"Schlögl, Alois, et al. “Running Windows-Applications on a Linux HPC Cluster Using WINE.” ASHPC23 - Austrian-Slovenian HPC Meeting 2023, EuroCC, pp. 59–59.","chicago":"Schlögl, Alois, Stefano Elefante, and Victor-Valentin Hodirnau. “Running Windows-Applications on a Linux HPC Cluster Using WINE.” In ASHPC23 - Austrian-Slovenian HPC Meeting 2023, 59–59. EuroCC, n.d."},"page":"59-59","date_published":"2023-07-01T00:00:00Z","day":"01","has_accepted_license":"1","article_processing_charge":"No","acknowledgement":"Thanks to Jesse Hansen for his suggestions on improving the abstract.","year":"2023","publication_status":"inpress","department":[{"_id":"ScienComp"},{"_id":"EM-Fac"}],"publisher":"EuroCC","author":[{"full_name":"Schlögl, Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5621-8100","first_name":"Alois","last_name":"Schlögl"},{"last_name":"Elefante","first_name":"Stefano","id":"490F40CE-F248-11E8-B48F-1D18A9856A87","full_name":"Elefante, Stefano"},{"id":"3661B498-F248-11E8-B48F-1D18A9856A87","first_name":"Victor-Valentin","last_name":"Hodirnau","full_name":"Hodirnau, Victor-Valentin"}],"date_updated":"2023-07-18T09:30:54Z","date_created":"2023-06-23T11:01:23Z","file_date_updated":"2023-07-18T09:18:55Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","conference":{"end_date":"2023-06-15","location":"Maribor, Slovenia","start_date":"2023-06-13","name":"ASHPC: Austrian-Slovenian HPC Meeting"},"language":[{"iso":"eng"}],"month":"07"},{"type":"journal_article","abstract":[{"text":"A rotating organic cation and a dynamically disordered soft inorganic cage are the hallmark features of organic-inorganic lead-halide perovskites. Understanding the interplay between these two subsystems is a challenging problem, but it is this coupling that is widely conjectured to be responsible for the unique behavior of photocarriers in these materials. In this work, we use the fact that the polarizability of the organic cation strongly depends on the ambient electrostatic environment to put the molecule forward as a sensitive probe of the local crystal fields inside the lattice cell. We measure the average polarizability of the C/N–H bond stretching mode by means of infrared spectroscopy, which allows us to deduce the character of the motion of the cation molecule, find the magnitude of the local crystal field, and place an estimate on the strength of the hydrogen bond between the hydrogen and halide atoms. Our results pave the way for understanding electric fields in lead-halide perovskites using infrared bond spectroscopy.","lang":"eng"}],"issue":"27","title":"Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites","ddc":["530"],"status":"public","intvolume":" 14","_id":"13251","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_id":"13253","relation":"main_file","success":1,"checksum":"c0c040063f06a51b9c463adc504f1a23","date_updated":"2023-07-19T06:55:39Z","date_created":"2023-07-19T06:55:39Z","access_level":"open_access","file_name":"2023_JourPhysChemistry_Wei.pdf","creator":"dernst","file_size":2121252,"content_type":"application/pdf"}],"oa_version":"Published Version","keyword":["General Materials Science","Physical and Theoretical Chemistry"],"day":"05","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","article_type":"original","page":"6309-6314","publication":"The Journal of Physical Chemistry Letters","citation":{"chicago":"Wei, Yujing, Artem Volosniev, Dusan Lorenc, Ayan A. Zhumekenov, Osman M. Bakr, Mikhail Lemeshko, and Zhanybek Alpichshev. “Bond Polarizability as a Probe of Local Crystal Fields in Hybrid Lead-Halide Perovskites.” The Journal of Physical Chemistry Letters. American Chemical Society, 2023. https://doi.org/10.1021/acs.jpclett.3c01158.","mla":"Wei, Yujing, et al. “Bond Polarizability as a Probe of Local Crystal Fields in Hybrid Lead-Halide Perovskites.” The Journal of Physical Chemistry Letters, vol. 14, no. 27, American Chemical Society, 2023, pp. 6309–14, doi:10.1021/acs.jpclett.3c01158.","short":"Y. Wei, A. Volosniev, D. Lorenc, A.A. Zhumekenov, O.M. Bakr, M. Lemeshko, Z. Alpichshev, The Journal of Physical Chemistry Letters 14 (2023) 6309–6314.","ista":"Wei Y, Volosniev A, Lorenc D, Zhumekenov AA, Bakr OM, Lemeshko M, Alpichshev Z. 2023. Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites. The Journal of Physical Chemistry Letters. 14(27), 6309–6314.","apa":"Wei, Y., Volosniev, A., Lorenc, D., Zhumekenov, A. A., Bakr, O. M., Lemeshko, M., & Alpichshev, Z. (2023). Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites. The Journal of Physical Chemistry Letters. American Chemical Society. https://doi.org/10.1021/acs.jpclett.3c01158","ieee":"Y. Wei et al., “Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites,” The Journal of Physical Chemistry Letters, vol. 14, no. 27. American Chemical Society, pp. 6309–6314, 2023.","ama":"Wei Y, Volosniev A, Lorenc D, et al. Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites. The Journal of Physical Chemistry Letters. 2023;14(27):6309-6314. doi:10.1021/acs.jpclett.3c01158"},"date_published":"2023-07-05T00:00:00Z","file_date_updated":"2023-07-19T06:55:39Z","ec_funded":1,"publication_status":"published","publisher":"American Chemical Society","department":[{"_id":"MiLe"},{"_id":"ZhAl"}],"year":"2023","acknowledgement":"We thank Bingqing Cheng and Hong-Zhou Ye for valuable discussions; Y.W.’s work at IST Austria was supported through ISTernship summer internship program funded by OeADGmbH; D.L. and Z.A. acknowledge support by IST Austria (ISTA); M.L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON).\r\nA.A.Z. and O.M.B. acknowledge support by KAUST.","date_created":"2023-07-18T11:13:17Z","date_updated":"2023-07-19T06:59:19Z","volume":14,"author":[{"first_name":"Yujing","last_name":"Wei","id":"0c5ff007-2600-11ee-b896-98bd8d663294","orcid":"0000-0001-8913-9719","full_name":"Wei, Yujing"},{"first_name":"Artem","last_name":"Volosniev","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0393-5525","full_name":"Volosniev, Artem"},{"full_name":"Lorenc, Dusan","id":"40D8A3E6-F248-11E8-B48F-1D18A9856A87","last_name":"Lorenc","first_name":"Dusan"},{"full_name":"Zhumekenov, Ayan A.","last_name":"Zhumekenov","first_name":"Ayan A."},{"full_name":"Bakr, Osman M.","first_name":"Osman M.","last_name":"Bakr"},{"full_name":"Lemeshko, Mikhail","first_name":"Mikhail","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802"},{"full_name":"Alpichshev, Zhanybek","first_name":"Zhanybek","last_name":"Alpichshev","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7183-5203"}],"month":"07","publication_identifier":{"eissn":["1948-7185"]},"isi":1,"quality_controlled":"1","project":[{"grant_number":"801770","_id":"2688CF98-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Angulon: physics and applications of a new quasiparticle"}],"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":{"arxiv":["2304.14198"],"isi":["001022811500001"]},"language":[{"iso":"eng"}],"doi":"10.1021/acs.jpclett.3c01158"}]