[{"ddc":["621","531","006"],"oa":1,"status":"public","acknowledgement":"We thank Vincent Acary for his help with Siconos, as well as the anonymous reviewers and the members of the Visual Computing Group at ISTA for their helpful comments. This research was funded in part by the European Union (ERC-2021-COG 101045083 CoDiNA).","publication_status":"published","type":"conference","keyword":["physical simulation","frictional contact","rigid body mechanics","non-smooth dynamics"],"file":[{"file_id":"17215","success":1,"checksum":"b8b203ed09e3995ba0d7e6a76288663a","date_created":"2024-07-10T11:03:14Z","file_size":47309472,"file_name":"sig24_friction_authors.pdf","relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_updated":"2024-07-10T11:03:14Z","creator":"yichen"},{"relation":"main_file","access_level":"open_access","date_updated":"2024-07-10T11:03:12Z","content_type":"application/pdf","creator":"yichen","file_id":"17216","success":1,"file_name":"sig24_friction_supplementary.pdf","checksum":"89d81b397b4b6469d828808a68b70820","date_created":"2024-07-10T11:03:12Z","file_size":10518286},{"access_level":"open_access","relation":"main_file","creator":"yichen","content_type":"video/mp4","date_updated":"2024-07-10T11:03:51Z","success":1,"file_id":"17217","date_created":"2024-07-10T11:03:51Z","checksum":"7123deed34a5456810e7b5336a31c657","file_size":71789192,"file_name":"friction_paper_extra_video_finished.mp4"},{"creator":"yichen","date_updated":"2024-07-10T11:03:58Z","content_type":"video/mp4","access_level":"open_access","relation":"main_file","file_name":"friction_paper_video_finished.mp4","checksum":"e606fc1ae8f2610ce3b4421566800b45","file_size":280610763,"date_created":"2024-07-10T11:03:58Z","success":1,"file_id":"17218"}],"month":"07","corr_author":"1","oa_version":"Published Version","_id":"17214","day":"01","publication":"Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers '24","publisher":"Association for Computing Machinery","external_id":{"isi":["001282218200091"]},"project":[{"_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","grant_number":"101045083","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena"}],"has_accepted_license":"1","isi":1,"date_updated":"2025-09-08T08:54:38Z","author":[{"id":"0b467602-dbcd-11ea-9d1d-ed480aa46b70","first_name":"Yi-Lu","last_name":"Chen","full_name":"Chen, Yi-Lu"},{"first_name":"Mickaël","id":"6340d7f0-b48d-11eb-b10d-b7487e71d9f1","full_name":"Ly, Mickaël","last_name":"Ly"},{"first_name":"Christopher J","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","full_name":"Wojtan, Christopher J","last_name":"Wojtan"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Primal-dual non-smooth friction for rigid body animation","citation":{"ieee":"Y.-L. Chen, M. Ly, and C. Wojtan, “Primal-dual non-smooth friction for rigid body animation,” in Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers ’24, Denver, United States, 2024.","ama":"Chen Y-L, Ly M, Wojtan C. Primal-dual non-smooth friction for rigid body animation. In: Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers ’24. Association for Computing Machinery; 2024. doi:10.1145/3641519.3657485","mla":"Chen, Yi-Lu, et al. “Primal-Dual Non-Smooth Friction for Rigid Body Animation.” Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers ’24, Association for Computing Machinery, 2024, doi:10.1145/3641519.3657485.","chicago":"Chen, Yi-Lu, Mickaël Ly, and Chris Wojtan. “Primal-Dual Non-Smooth Friction for Rigid Body Animation.” In Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers ’24. Association for Computing Machinery, 2024. https://doi.org/10.1145/3641519.3657485.","short":"Y.-L. Chen, M. Ly, C. Wojtan, in:, Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers ’24, Association for Computing Machinery, 2024.","ista":"Chen Y-L, Ly M, Wojtan C. 2024. Primal-dual non-smooth friction for rigid body animation. Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers ’24. SIGGRAPH: Computer Graphics and Interactive Techniques Conference.","apa":"Chen, Y.-L., Ly, M., & Wojtan, C. (2024). Primal-dual non-smooth friction for rigid body animation. In Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers ’24. Denver, United States: Association for Computing Machinery. https://doi.org/10.1145/3641519.3657485"},"year":"2024","article_processing_charge":"Yes (via OA deal)","publication_identifier":{"isbn":["9798400705250"]},"language":[{"iso":"eng"}],"abstract":[{"text":"Current numerical algorithms for simulating friction fall in one of two camps: smooth solvers sacrifice the stable treatment of static friction in exchange for fast convergence, and non-smooth solvers accurately compute friction at convergence rates that are often prohibitive for large graphics applications. We introduce a novel bridge between these two ideas that computes static and dynamic friction stably and efficiently. Our key idea is to convert the highly constrained non-smooth problem into an unconstrained smooth problem using logarithmic barriers that converges to the exact solution as accuracy increases. We phrase the problem as an interior point primal-dual problem that can be solved efficiently with Newton iteration. We observe quadratic convergence despite the non-smooth nature of the original problem, and our method is well-suited for large systems of tightly packed objects with many contact points. We demonstrate the efficacy of our method with stable piles of grains and stacks of objects, complex granular flows, and robust interlocking assemblies of rigid bodies.","lang":"eng"}],"date_published":"2024-07-01T00:00:00Z","conference":{"end_date":"2024-08-01","name":"SIGGRAPH: Computer Graphics and Interactive Techniques Conference","location":"Denver, United States","start_date":"2024-07-28"},"department":[{"_id":"GradSch"},{"_id":"ChWo"}],"doi":"10.1145/3641519.3657485","date_created":"2024-07-10T11:06:20Z","scopus_import":"1","quality_controlled":"1","file_date_updated":"2024-07-10T11:03:58Z"},{"oa_version":"Preprint","pmid":1,"publication":"Journal of Chemical Physics","article_number":"034111","day":"14","_id":"17278","external_id":{"pmid":["39007379"],"arxiv":["2405.02216"],"isi":["001281819100016"]},"publisher":"AIP Publishing","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2405.02216"}],"status":"public","oa":1,"acknowledgement":"B.C. thanks Alessandro Laio, who introduced the phenomenon of azeotrope and suggested using the S0 method to compute it. B.C. and X.W. thank Felix Wodaczek for the insightful comments and suggestions on the manuscript. B.C. and X.W. acknowledge the resources provided by the Cambridge Tier-2 system operated by the University of Cambridge Research Computing Service, funded by EPSRC Tier-2 capital (Grant No. EP/P020259/1).","type":"journal_article","publication_status":"published","volume":161,"corr_author":"1","month":"07","date_published":"2024-07-14T00:00:00Z","arxiv":1,"abstract":[{"lang":"eng","text":"An azeotrope is a constant boiling point mixture, and its behavior is important for fluid separation processes. Predicting azeotropes from atomistic simulations is difficult due to the complexities and convergence problems of Monte Carlo and free-energy perturbation techniques. Here, we present a methodology for predicting the azeotropes of binary mixtures, which computes the compositional dependence of chemical potentials from molecular dynamics simulations using the S0 method and employs experimental boiling point and vaporization enthalpy data. Using this methodology, we reproduce the azeotropes, or lack thereof, in five case studies, including ethanol/water, ethanol/isooctane, methanol/water, hydrazine/water, and acetone/chloroform mixtures. We find that it is crucial to use the experimental boiling point and vaporization enthalpy for reliable azeotrope predictions, as empirical force fields are not accurate enough for these quantities. Finally, we use regular solution models to rationalize the azeotropes and reveal that they tend to form when the mixture components have similar boiling points and strong interactions."}],"department":[{"_id":"BiCh"},{"_id":"GradSch"}],"intvolume":" 161","date_created":"2024-07-21T22:01:00Z","doi":"10.1063/5.0217232","article_type":"original","issue":"3","quality_controlled":"1","scopus_import":"1","isi":1,"date_updated":"2025-09-08T08:26:09Z","related_material":{"link":[{"relation":"software","url":"https://github.com/Xiaoyu-Wang-Stone/Azeotrope_S0"}]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"id":"8dff9c62-32b0-11ee-9fa8-fc73025e10f3","first_name":"Xiaoyu","last_name":"Wang","full_name":"Wang, Xiaoyu"},{"first_name":"Bingqing","orcid":"0000-0002-3584-9632","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","full_name":"Cheng, Bingqing","last_name":"Cheng"}],"title":"Integrating molecular dynamics simulations and experimental data for azeotrope predictions in binary mixtures","year":"2024","citation":{"ista":"Wang X, Cheng B. 2024. Integrating molecular dynamics simulations and experimental data for azeotrope predictions in binary mixtures. Journal of Chemical Physics. 161(3), 034111.","short":"X. Wang, B. Cheng, Journal of Chemical Physics 161 (2024).","chicago":"Wang, Xiaoyu, and Bingqing Cheng. “Integrating Molecular Dynamics Simulations and Experimental Data for Azeotrope Predictions in Binary Mixtures.” Journal of Chemical Physics. AIP Publishing, 2024. https://doi.org/10.1063/5.0217232.","mla":"Wang, Xiaoyu, and Bingqing Cheng. “Integrating Molecular Dynamics Simulations and Experimental Data for Azeotrope Predictions in Binary Mixtures.” Journal of Chemical Physics, vol. 161, no. 3, 034111, AIP Publishing, 2024, doi:10.1063/5.0217232.","apa":"Wang, X., & Cheng, B. (2024). Integrating molecular dynamics simulations and experimental data for azeotrope predictions in binary mixtures. Journal of Chemical Physics. AIP Publishing. https://doi.org/10.1063/5.0217232","ama":"Wang X, Cheng B. Integrating molecular dynamics simulations and experimental data for azeotrope predictions in binary mixtures. Journal of Chemical Physics. 2024;161(3). doi:10.1063/5.0217232","ieee":"X. Wang and B. Cheng, “Integrating molecular dynamics simulations and experimental data for azeotrope predictions in binary mixtures,” Journal of Chemical Physics, vol. 161, no. 3. AIP Publishing, 2024."},"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0021-9606"],"eissn":["1089-7690"]},"article_processing_charge":"No"},{"publisher":"Association for Computing Machinery","external_id":{"arxiv":["2404.03430"]},"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818"}],"has_accepted_license":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"oa_version":"Published Version","day":"20","article_number":"232","publication":"Proceedings of the ACM on Programming Languages","_id":"17283","ec_funded":1,"publication_status":"published","type":"journal_article","volume":8,"month":"06","file":[{"creator":"dernst","content_type":"application/pdf","date_updated":"2024-07-22T07:17:14Z","access_level":"open_access","relation":"main_file","checksum":"8cbf220f284a4a87d093db5320c5afdd","date_created":"2024-07-22T07:17:14Z","file_size":355421,"file_name":"2024_ACMProgLang_Chatterjee.pdf","success":1,"file_id":"17290"}],"corr_author":"1","status":"public","ddc":["000"],"oa":1,"acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt) grant. Petr Novotný\r\nis supported by the Czech Science Foundation grant no. GA23-06963S.\r\n","date_created":"2024-07-21T22:01:01Z","OA_type":"hybrid","intvolume":" 8","doi":"10.1145/3656462","article_type":"original","file_date_updated":"2024-07-22T07:17:14Z","quality_controlled":"1","scopus_import":"1","arxiv":1,"date_published":"2024-06-20T00:00:00Z","abstract":[{"text":"We consider the problems of statically refuting equivalence and similarity of output distributions defined by a pair of probabilistic programs. Equivalence and similarity are two fundamental relational properties of probabilistic programs that are essential for their correctness both in implementation and in compilation. In this work, we present a new method for static equivalence and similarity refutation. Our method refutes equivalence and similarity by computing a function over program outputs whose expected value with respect to the output distributions of two programs is different. The function is computed simultaneously with an upper expectation supermartingale and a lower expectation submartingale for the two programs, which we show to together provide a formal certificate for refuting equivalence and similarity. To the best of our knowledge, our method is the first approach to relational program analysis to offer the combination of the following desirable features: (1) it is fully automated, (2) it is applicable to infinite-state probabilistic programs, and (3) it provides formal guarantees on the correctness of its results. We implement a prototype of our method and our experiments demonstrate the effectiveness of our method to refute equivalence and similarity for a number of examples collected from the literature.","lang":"eng"}],"department":[{"_id":"KrCh"},{"_id":"GradSch"}],"license":"https://creativecommons.org/licenses/by/4.0/","year":"2024","citation":{"ieee":"K. Chatterjee, E. Goharshady, P. Novotný, and D. Zikelic, “Equivalence and similarity refutation for probabilistic programs,” Proceedings of the ACM on Programming Languages, vol. 8. Association for Computing Machinery, 2024.","ama":"Chatterjee K, Goharshady E, Novotný P, Zikelic D. Equivalence and similarity refutation for probabilistic programs. Proceedings of the ACM on Programming Languages. 2024;8. doi:10.1145/3656462","apa":"Chatterjee, K., Goharshady, E., Novotný, P., & Zikelic, D. (2024). Equivalence and similarity refutation for probabilistic programs. Proceedings of the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3656462","mla":"Chatterjee, Krishnendu, et al. “Equivalence and Similarity Refutation for Probabilistic Programs.” Proceedings of the ACM on Programming Languages, vol. 8, 232, Association for Computing Machinery, 2024, doi:10.1145/3656462.","ista":"Chatterjee K, Goharshady E, Novotný P, Zikelic D. 2024. Equivalence and similarity refutation for probabilistic programs. Proceedings of the ACM on Programming Languages. 8, 232.","chicago":"Chatterjee, Krishnendu, Ehsan Goharshady, Petr Novotný, and Dorde Zikelic. “Equivalence and Similarity Refutation for Probabilistic Programs.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2024. https://doi.org/10.1145/3656462.","short":"K. Chatterjee, E. Goharshady, P. Novotný, D. Zikelic, Proceedings of the ACM on Programming Languages 8 (2024)."},"publication_identifier":{"eissn":["2475-1421"]},"language":[{"iso":"eng"}],"article_processing_charge":"Yes (via OA deal)","date_updated":"2025-04-14T07:52:47Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Equivalence and similarity refutation for probabilistic programs","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"id":"103b4fa0-896a-11ed-bdf8-87b697bef40d","orcid":"0000-0002-8595-0587","first_name":"Ehsan","last_name":"Kafshdar Goharshadi","full_name":"Kafshdar Goharshadi, Ehsan"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr","last_name":"Novotný","full_name":"Novotný, Petr"},{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","orcid":"0000-0002-4681-1699","last_name":"Zikelic","full_name":"Zikelic, Dorde"}],"OA_place":"publisher"},{"file_date_updated":"2024-07-29T13:51:11Z","has_accepted_license":"1","publisher":"Institute of Science and Technology Austria","date_created":"2024-07-29T14:01:43Z","doi":"10.15479/AT:ISTA:17344","acknowledged_ssus":[{"_id":"ScienComp"}],"department":[{"_id":"GradSch"},{"_id":"NiBa"}],"_id":"17344","date_published":"2024-07-01T00:00:00Z","oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"abstract":[{"lang":"eng","text":"This file contains the Mathematica notebook associated with the paper Effect of assortative mating and sexual selection on polygenic barriers to gene flow. It contains the numerical approximations, analyses, and simulations used in the study. "}],"article_processing_charge":"No","file":[{"date_created":"2024-07-29T13:51:11Z","file_size":726132,"checksum":"75bdbc7ad7cc6afe4459bc4a8824a302","file_name":"Submission.nb","file_id":"17345","success":1,"content_type":"application/octet-stream","date_updated":"2024-07-29T13:51:11Z","creator":"psurendr","relation":"main_file","access_level":"open_access"}],"month":"07","year":"2024","type":"research_data","citation":{"short":"P. Surendranadh, H. Sachdeva, (2024).","chicago":"Surendranadh, Parvathy, and Himani Sachdeva. “Mathematica Notebook for ‘Effect of Assortative Mating and Sexual Selection on Polygenic Barriers to Gene Flow.’” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/AT:ISTA:17344.","ista":"Surendranadh P, Sachdeva H. 2024. Mathematica notebook for ‘Effect of assortative mating and sexual selection on polygenic barriers to gene flow’, Institute of Science and Technology Austria, 10.15479/AT:ISTA:17344.","mla":"Surendranadh, Parvathy, and Himani Sachdeva. Mathematica Notebook for “Effect of Assortative Mating and Sexual Selection on Polygenic Barriers to Gene Flow.” Institute of Science and Technology Austria, 2024, doi:10.15479/AT:ISTA:17344.","apa":"Surendranadh, P., & Sachdeva, H. (2024). Mathematica notebook for “Effect of assortative mating and sexual selection on polygenic barriers to gene flow.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:17344","ama":"Surendranadh P, Sachdeva H. Mathematica notebook for “Effect of assortative mating and sexual selection on polygenic barriers to gene flow.” 2024. doi:10.15479/AT:ISTA:17344","ieee":"P. Surendranadh and H. Sachdeva, “Mathematica notebook for ‘Effect of assortative mating and sexual selection on polygenic barriers to gene flow.’” Institute of Science and Technology Austria, 2024."},"title":"Mathematica notebook for 'Effect of assortative mating and sexual selection on polygenic barriers to gene flow'","author":[{"id":"455235B8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6395-386X","first_name":"Parvathy","last_name":"Surendranadh","full_name":"Surendranadh, Parvathy"},{"first_name":"Himani","last_name":"Sachdeva","full_name":"Sachdeva, Himani"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-01-14T13:02:59Z","ddc":["576"],"status":"public","oa":1},{"corr_author":"1","article_processing_charge":"No","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/x-zip-compressed","date_updated":"2024-09-03T17:39:32Z","creator":"rsatapat","file_id":"17489","success":1,"date_created":"2024-09-03T17:39:32Z","file_size":965778072,"checksum":"df9d6c8ddffa046c3b1639281f83cfcf","file_name":"BehaviouralData.zip"}],"month":"09","citation":{"ieee":"R. K. Satapathy, M. A. Jösch, O. Symonova, and V. Pokusaeva, “Bilateral interactions of optic-flow sensitive neurons coordinate course control in flies.” Institute of Science and Technology Austria, 2024.","ama":"Satapathy RK, Jösch MA, Symonova O, Pokusaeva V. Bilateral interactions of optic-flow sensitive neurons coordinate course control in flies. 2024. doi:10.15479/AT:ISTA:17488","mla":"Satapathy, Roshan K., et al. Bilateral Interactions of Optic-Flow Sensitive Neurons Coordinate Course Control in Flies. Institute of Science and Technology Austria, 2024, doi:10.15479/AT:ISTA:17488.","ista":"Satapathy RK, Jösch MA, Symonova O, Pokusaeva V. 2024. Bilateral interactions of optic-flow sensitive neurons coordinate course control in flies, Institute of Science and Technology Austria, 10.15479/AT:ISTA:17488.","chicago":"Satapathy, Roshan K, Maximilian A Jösch, Olga Symonova, and Victoria Pokusaeva. “Bilateral Interactions of Optic-Flow Sensitive Neurons Coordinate Course Control in Flies.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/AT:ISTA:17488.","short":"R.K. Satapathy, M.A. Jösch, O. Symonova, V. Pokusaeva, (2024).","apa":"Satapathy, R. K., Jösch, M. A., Symonova, O., & Pokusaeva, V. (2024). Bilateral interactions of optic-flow sensitive neurons coordinate course control in flies. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:17488"},"type":"research_data","keyword":["drosophila","behaviour","locomotion","gap junctions"],"year":"2024","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Bilateral interactions of optic-flow sensitive neurons coordinate course control in flies","author":[{"orcid":"0009-0006-2974-5075","first_name":"Roshan K","id":"46046B7A-F248-11E8-B48F-1D18A9856A87","full_name":"Satapathy, Roshan K","last_name":"Satapathy"},{"full_name":"Jösch, Maximilian A","last_name":"Jösch","orcid":"0000-0002-3937-1330","first_name":"Maximilian A","id":"2BD278E6-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-2012-9947","first_name":"Olga","id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87","full_name":"Symonova, Olga","last_name":"Symonova"},{"last_name":"Pokusaeva","full_name":"Pokusaeva, Victoria","id":"3184041C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7660-444X","first_name":"Victoria"}],"oa":1,"status":"public","related_material":{"record":[{"status":"public","id":"18444","relation":"used_in_publication"}]},"ddc":["570"],"date_updated":"2025-09-08T14:24:24Z","has_accepted_license":"1","file_date_updated":"2024-09-03T17:39:32Z","doi":"10.15479/AT:ISTA:17488","acknowledged_ssus":[{"_id":"M-Shop"}],"project":[{"name":"Evolution of Sensorimotor Transformation Across Diptera","_id":"9B767A34-BA93-11EA-9121-9846C619BF3A","grant_number":"429960716"}],"date_created":"2024-09-03T17:42:46Z","publisher":"Institute of Science and Technology Austria","_id":"17488","department":[{"_id":"GradSch"},{"_id":"MaJö"}],"abstract":[{"lang":"eng","text":"Behavioural data for Pokusaeva, Satapathy et al. Relevant information can be found in the 'README.txt' file."}],"date_published":"2024-09-01T00:00:00Z","oa_version":"None","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"}},{"month":"09","corr_author":"1","keyword":["Farkas lemma","linear programming","extended reals","calculus of inductive constructions"],"publication_status":"draft","type":"preprint","acknowledgement":"We would like to thank David Bartl and Jasmin Blanchette for frequent consultations. We would also like to express gratitude to Andrew Yang for the proof of Finset.univ sum of zero when not and to Henrik B¨oving for a help with generalization from extended rationals to extended linearly ordered fields. We would also like to acknowledge Antoine Chambert-Loir, Apurva Nakade, Ya¨el Dillies, Richard Copley, Edward van de Meent, Markus Himmel, Mario Carneiro, and Kevin Buzzard.","status":"public","oa":1,"external_id":{"arxiv":["2409.08119"]},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2409.08119","open_access":"1"}],"day":"12","publication":"arXiv","article_number":"2409.08119","_id":"20071","oa_version":"Preprint","language":[{"iso":"eng"}],"article_processing_charge":"No","year":"2024","citation":{"short":"M. Dvorak, V. Kolmogorov, ArXiv (n.d.).","ista":"Dvorak M, Kolmogorov V. Duality theory in linear optimization and its extensions -- formally verified. arXiv, 2409.08119.","chicago":"Dvorak, Martin, and Vladimir Kolmogorov. “Duality Theory in Linear Optimization and Its Extensions -- Formally Verified.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2409.08119.","mla":"Dvorak, Martin, and Vladimir Kolmogorov. “Duality Theory in Linear Optimization and Its Extensions -- Formally Verified.” ArXiv, 2409.08119, doi:10.48550/arXiv.2409.08119.","apa":"Dvorak, M., & Kolmogorov, V. (n.d.). Duality theory in linear optimization and its extensions -- formally verified. arXiv. https://doi.org/10.48550/arXiv.2409.08119","ama":"Dvorak M, Kolmogorov V. Duality theory in linear optimization and its extensions -- formally verified. arXiv. doi:10.48550/arXiv.2409.08119","ieee":"M. Dvorak and V. Kolmogorov, “Duality theory in linear optimization and its extensions -- formally verified,” arXiv. ."},"author":[{"full_name":"Dvorak, Martin","last_name":"Dvorak","orcid":"0000-0001-5293-214X","first_name":"Martin","id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425"},{"full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","title":"Duality theory in linear optimization and its extensions -- formally verified","OA_place":"repository","date_updated":"2026-03-27T12:36:59Z","related_material":{"link":[{"relation":"software","url":"https://github.com/madvorak/duality/tree/v3.2","description":"full version of all definitions, statement, and proofs"}],"record":[{"id":"21393","relation":"dissertation_contains","status":"public"}]},"OA_type":"green","date_created":"2025-07-23T11:21:52Z","doi":"10.48550/arXiv.2409.08119","department":[{"_id":"GradSch"},{"_id":"VlKo"}],"arxiv":1,"date_published":"2024-09-12T00:00:00Z","abstract":[{"text":"Farkas established that a system of linear inequalities has a solution if and only if we cannot obtain a contradiction by taking a linear combination of the inequalities. We state and formally prove several Farkas-like theorems over linearly ordered fields in Lean 4. Furthermore, we extend duality theory to the case when some coefficients are allowed to take \"infinite values\".","lang":"eng"}]},{"publication_status":"published","type":"conference","month":"06","corr_author":"1","oa":1,"status":"public","page":"24574-24583","acknowledgement":"This work was partially supported by project SERICS (PE00000014) under the MUR National Recovery and Resilience Plan funded by the European Union - NextGenerationEU.\r\n","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2311.16833"}],"publisher":"Computer Vision Foundation","external_id":{"arxiv":["2311.16833"],"isi":["001344387500055"]},"has_accepted_license":"1","oa_version":"Preprint","_id":"17426","day":"01","publication":"Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition","citation":{"ista":"Prach B, Brau F, Buttazzo G, Lampert C. 2024. 1-Lipschitz layers compared: Memory, speed, and certifiable robustness. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition, 24574–24583.","chicago":"Prach, Bernd, Fabio Brau, Giorgio Buttazzo, and Christoph Lampert. “1-Lipschitz Layers Compared: Memory, Speed, and Certifiable Robustness.” In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 24574–83. Computer Vision Foundation, 2024. https://doi.org/10.1109/CVPR52733.2024.02320.","short":"B. Prach, F. Brau, G. Buttazzo, C. Lampert, in:, Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, Computer Vision Foundation, 2024, pp. 24574–24583.","mla":"Prach, Bernd, et al. “1-Lipschitz Layers Compared: Memory, Speed, and Certifiable Robustness.” Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, Computer Vision Foundation, 2024, pp. 24574–83, doi:10.1109/CVPR52733.2024.02320.","apa":"Prach, B., Brau, F., Buttazzo, G., & Lampert, C. (2024). 1-Lipschitz layers compared: Memory, speed, and certifiable robustness. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (pp. 24574–24583). Seattle, WA, United States: Computer Vision Foundation. https://doi.org/10.1109/CVPR52733.2024.02320","ama":"Prach B, Brau F, Buttazzo G, Lampert C. 1-Lipschitz layers compared: Memory, speed, and certifiable robustness. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. Computer Vision Foundation; 2024:24574-24583. doi:10.1109/CVPR52733.2024.02320","ieee":"B. Prach, F. Brau, G. Buttazzo, and C. Lampert, “1-Lipschitz layers compared: Memory, speed, and certifiable robustness,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, Seattle, WA, United States, 2024, pp. 24574–24583."},"year":"2024","article_processing_charge":"No","language":[{"iso":"eng"}],"related_material":{"link":[{"url":"https://github.com/berndprach/1LipschitzLayersCompared","relation":"software"}],"record":[{"relation":"dissertation_contains","id":"19759","status":"public"}]},"date_updated":"2026-04-07T11:49:51Z","isi":1,"OA_place":"repository","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"1-Lipschitz layers compared: Memory, speed, and certifiable robustness","author":[{"full_name":"Prach, Bernd","last_name":"Prach","first_name":"Bernd","id":"2D561D42-C427-11E9-89B4-9C1AE6697425"},{"first_name":"Fabio","full_name":"Brau, Fabio","last_name":"Brau"},{"last_name":"Buttazzo","full_name":"Buttazzo, Giorgio","first_name":"Giorgio"},{"orcid":"0000-0001-8622-7887","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","last_name":"Lampert"}],"doi":"10.1109/CVPR52733.2024.02320","date_created":"2024-08-14T08:42:32Z","OA_type":"green","quality_controlled":"1","abstract":[{"text":"The robustness of neural networks against input perturbations with bounded\r\nmagnitude represents a serious concern in the deployment of deep learning\r\nmodels in safety-critical systems. Recently, the scientific community has\r\nfocused on enhancing certifiable robustness guarantees by crafting 1-Lipschitz\r\nneural networks that leverage Lipschitz bounded dense and convolutional layers.\r\nAlthough different methods have been proposed in the literature to achieve this\r\ngoal, understanding the performance of such methods is not straightforward,\r\nsince different metrics can be relevant (e.g., training time, memory usage,\r\naccuracy, certifiable robustness) for different applications. For this reason,\r\nthis work provides a thorough theoretical and empirical comparison between\r\nmethods by evaluating them in terms of memory usage, speed, and certifiable\r\nrobust accuracy. The paper also provides some guidelines and recommendations to\r\nsupport the user in selecting the methods that work best depending on the\r\navailable resources. We provide code at\r\nhttps://github.com/berndprach/1LipschitzLayersCompared.","lang":"eng"}],"arxiv":1,"date_published":"2024-06-01T00:00:00Z","conference":{"end_date":"2024-06-22","location":"Seattle, WA, United States","name":"CVPR: Conference on Computer Vision and Pattern Recognition","start_date":"2024-06-16"},"department":[{"_id":"GradSch"},{"_id":"ChLa"}]},{"publication":"arXiv","article_number":"2412.04245","day":"05","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"_id":"18874","date_published":"2024-12-05T00:00:00Z","oa_version":"Preprint","arxiv":1,"abstract":[{"text":"Despite extensive research since the community learned about adversarial\r\nexamples 10 years ago, we still do not know how to train high-accuracy\r\nclassifiers that are guaranteed to be robust to small perturbations of their\r\ninputs. Previous works often argued that this might be because no classifier\r\nexists that is robust and accurate at the same time. However, in computer\r\nvision this assumption does not match reality where humans are usually accurate\r\nand robust on most tasks of interest. We offer an alternative explanation and\r\nshow that in certain settings robust generalization is only possible with\r\nunrealistically large amounts of data. More precisely we find a setting where a\r\nrobust classifier exists, it is easy to learn an accurate classifier, yet it\r\nrequires an exponential amount of data to learn a robust classifier. Based on\r\nthis theoretical result, we explore how well robust classifiers generalize on\r\ndatasets such as CIFAR-10. We come to the conclusion that on this datasets, the\r\nlimitation of current robust models also lies in the generalization, and that\r\nthey require a lot of data to do well on the test set. We also show that the\r\nproblem is not in the expressiveness or generalization capabilities of current\r\narchitectures, and that there are low magnitude features in the data which are\r\nuseful for non-robust generalization but are not available for robust\r\nclassifiers.","lang":"eng"}],"external_id":{"arxiv":["2412.04245"]},"date_created":"2025-01-24T16:57:29Z","doi":"10.48550/arXiv.2412.04245","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2412.04245"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","title":"Intriguing properties of robust classification","author":[{"id":"2D561D42-C427-11E9-89B4-9C1AE6697425","first_name":"Bernd","last_name":"Prach","full_name":"Prach, Bernd"},{"orcid":"0000-0001-8622-7887","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","last_name":"Lampert"}],"OA_place":"repository","date_updated":"2026-04-07T11:49:51Z","related_material":{"record":[{"relation":"later_version","id":"20455","status":"public"},{"id":"19759","relation":"dissertation_contains","status":"public"}]},"status":"public","oa":1,"language":[{"iso":"eng"}],"corr_author":"1","article_processing_charge":"No","month":"12","year":"2024","citation":{"ama":"Prach B, Lampert C. Intriguing properties of robust classification. arXiv. doi:10.48550/arXiv.2412.04245","ieee":"B. Prach and C. Lampert, “Intriguing properties of robust classification,” arXiv. .","ista":"Prach B, Lampert C. Intriguing properties of robust classification. arXiv, 2412.04245.","chicago":"Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2412.04245.","short":"B. Prach, C. Lampert, ArXiv (n.d.).","mla":"Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.” ArXiv, 2412.04245, doi:10.48550/arXiv.2412.04245.","apa":"Prach, B., & Lampert, C. (n.d.). Intriguing properties of robust classification. arXiv. https://doi.org/10.48550/arXiv.2412.04245"},"type":"preprint","publication_status":"draft"},{"doi":"10.1137/23M1565255","intvolume":" 8","OA_type":"green","date_created":"2023-04-18T19:16:06Z","quality_controlled":"1","scopus_import":"1","issue":"3","article_type":"original","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"}],"date_published":"2024-09-23T00:00:00Z","arxiv":1,"department":[{"_id":"GradSch"},{"_id":"ChWo"}],"citation":{"apa":"Chern, A., & Ishida, S. (2024). Area formula for spherical polygons via prequantization. SIAM Journal on Applied Algebra and Geometry. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/23M1565255","mla":"Chern, Albert, and Sadashige Ishida. “Area Formula for Spherical Polygons via Prequantization.” SIAM Journal on Applied Algebra and Geometry, vol. 8, no. 3, Society for Industrial and Applied Mathematics, 2024, pp. 782–96, doi:10.1137/23M1565255.","chicago":"Chern, Albert, and Sadashige Ishida. “Area Formula for Spherical Polygons via Prequantization.” SIAM Journal on Applied Algebra and Geometry. Society for Industrial and Applied Mathematics, 2024. https://doi.org/10.1137/23M1565255.","ista":"Chern A, Ishida S. 2024. Area formula for spherical polygons via prequantization. SIAM Journal on Applied Algebra and Geometry. 8(3), 782–796.","short":"A. Chern, S. Ishida, SIAM Journal on Applied Algebra and Geometry 8 (2024) 782–796.","ieee":"A. Chern and S. Ishida, “Area formula for spherical polygons via prequantization,” SIAM Journal on Applied Algebra and Geometry, vol. 8, no. 3. Society for Industrial and Applied Mathematics, pp. 782–796, 2024.","ama":"Chern A, Ishida S. Area formula for spherical polygons via prequantization. SIAM Journal on Applied Algebra and Geometry. 2024;8(3):782-796. doi:10.1137/23M1565255"},"year":"2024","article_processing_charge":"No","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2470-6566"]},"related_material":{"record":[{"status":"public","id":"20551","relation":"dissertation_contains"}]},"date_updated":"2026-04-07T12:02:22Z","isi":1,"OA_place":"repository","author":[{"first_name":"Albert","last_name":"Chern","full_name":"Chern, Albert"},{"full_name":"Ishida, Sadashige","last_name":"Ishida","first_name":"Sadashige","orcid":"0000-0002-3121-3100","id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425"}],"title":"Area formula for spherical polygons via prequantization","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2303.14555","open_access":"1"}],"project":[{"name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","grant_number":"101045083","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088"}],"external_id":{"arxiv":["2303.14555"],"isi":["001342265800009"]},"publisher":"Society for Industrial and Applied Mathematics","has_accepted_license":"1","oa_version":"Preprint","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"_id":"12846","publication":"SIAM Journal on Applied Algebra and Geometry","day":"23","publication_status":"published","type":"journal_article","corr_author":"1","month":"09","volume":8,"ddc":["516"],"oa":1,"status":"public","page":"782-796","acknowledgement":"This work was funded by European Research Council Consolidator grant 101045083 CoDiNA and National Science Foundation CAREER award 2239062. Some figures in the article were generated by the software Houdini and its education license was provided by SideFX. The authors acknowledge anonymous referees for their reviews and insightful suggestions, and Chris Wojtan for his continuous support through discussions. The second author thanks Anna Sisak for a fruitful discussion on prequantum bundles."},{"language":[{"iso":"eng"}],"month":"07","article_processing_charge":"No","year":"2024","keyword":["space of space curves","symplectic stuctures"],"type":"preprint","citation":{"apa":"Bauer, M., Ishida, S., & Michor, P. W. (n.d.). Symplectic structures on the space of space curves. arXiv. https://doi.org/10.48550/arXiv.2407.19908","short":"M. Bauer, S. Ishida, P.W. Michor, ArXiv (n.d.).","chicago":"Bauer, Martin, Sadashige Ishida, and Peter W. Michor. “Symplectic Structures on the Space of Space Curves.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2407.19908.","ista":"Bauer M, Ishida S, Michor PW. Symplectic structures on the space of space curves. arXiv, 10.48550/arXiv.2407.19908.","mla":"Bauer, Martin, et al. “Symplectic Structures on the Space of Space Curves.” ArXiv, doi:10.48550/arXiv.2407.19908.","ama":"Bauer M, Ishida S, Michor PW. Symplectic structures on the space of space curves. arXiv. doi:10.48550/arXiv.2407.19908","ieee":"M. Bauer, S. Ishida, and P. W. Michor, “Symplectic structures on the space of space curves,” arXiv. ."},"publication_status":"draft","acknowledgement":"The authors are grateful to Boris Khesin for valuable comments on the MW symplectic structure and S. Ishida thanks Albert Chern for insightful discussions on space curves and Chris Wojtan for his continuous support. M. Bauer was partially supported by NSF grant DMS-1953244 and by the Binational Science Foundation (BSF). S. Ishida was partially supported by ERC Consolidator Grant 101045083 “CoDiNA” funded by the European Research Council. Some figures were generated by the software Houdini and its education license was provided by SideFX.","author":[{"first_name":"Martin","last_name":"Bauer","full_name":"Bauer, Martin"},{"last_name":"Ishida","full_name":"Ishida, Sadashige","id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425","orcid":"0000-0002-3121-3100","first_name":"Sadashige"},{"first_name":"Peter W.","last_name":"Michor","full_name":"Michor, Peter W."}],"title":"Symplectic structures on the space of space curves","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","OA_place":"repository","date_updated":"2026-04-07T12:02:23Z","status":"public","oa":1,"related_material":{"record":[{"relation":"dissertation_contains","id":"20551","status":"public"}]},"date_created":"2024-08-01T06:34:08Z","project":[{"name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","grant_number":"101045083"}],"external_id":{"arxiv":["2407.19908"]},"doi":"10.48550/arXiv.2407.19908","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2407.19908","open_access":"1"}],"department":[{"_id":"GradSch"},{"_id":"ChWo"}],"publication":"arXiv","day":"29","_id":"17361","arxiv":1,"oa_version":"Preprint","date_published":"2024-07-29T00:00:00Z","abstract":[{"lang":"eng","text":"We present symplectic structures on the shape space of unparameterized space curves that generalize the classical Marsden-Weinstein structure. Our method integrates the Liouville 1-form of the Marsden-Weinstein structure with Riemannian structures that have been introduced in mathematical shape analysis. We also derive Hamiltonian vector fields for several classical Hamiltonian functions with respect to these new symplectic structures."}]},{"author":[{"last_name":"Chalupa","full_name":"Chalupa, Marek","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","first_name":"Marek"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"b26baa86-3308-11ec-87b0-8990f34baa85","first_name":"Nicolas Adrien","last_name":"Mazzocchi","full_name":"Mazzocchi, Nicolas Adrien"},{"id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","first_name":"Naci E","last_name":"Sarac","full_name":"Sarac, Naci E"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"QuAK: Quantitative Automata Kit","OA_place":"publisher","isi":1,"date_updated":"2026-04-07T12:02:57Z","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"20147"}]},"publication_identifier":{"isbn":["9783031753862"],"eissn":["1611-3349"],"issn":["0302-9743"]},"language":[{"iso":"eng"}],"article_processing_charge":"Yes (in subscription journal)","year":"2024","citation":{"ama":"Chalupa M, Henzinger TA, Mazzocchi NA, Sarac NE. QuAK: Quantitative Automata Kit. In: 12th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation. Vol 15222. Springer Nature; 2024:3-20. doi:10.1007/978-3-031-75387-9_1","ieee":"M. Chalupa, T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “QuAK: Quantitative Automata Kit,” in 12th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation, Crete, Greece, 2024, vol. 15222, pp. 3–20.","chicago":"Chalupa, Marek, Thomas A Henzinger, Nicolas Adrien Mazzocchi, and Naci E Sarac. “QuAK: Quantitative Automata Kit.” In 12th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation, 15222:3–20. Springer Nature, 2024. https://doi.org/10.1007/978-3-031-75387-9_1.","short":"M. Chalupa, T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 12th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation, Springer Nature, 2024, pp. 3–20.","ista":"Chalupa M, Henzinger TA, Mazzocchi NA, Sarac NE. 2024. QuAK: Quantitative Automata Kit. 12th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation. ISoLA: International Symposium on Leveraging Applications, LNCS, vol. 15222, 3–20.","mla":"Chalupa, Marek, et al. “QuAK: Quantitative Automata Kit.” 12th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation, vol. 15222, Springer Nature, 2024, pp. 3–20, doi:10.1007/978-3-031-75387-9_1.","apa":"Chalupa, M., Henzinger, T. A., Mazzocchi, N. A., & Sarac, N. E. (2024). QuAK: Quantitative Automata Kit. In 12th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (Vol. 15222, pp. 3–20). Crete, Greece: Springer Nature. https://doi.org/10.1007/978-3-031-75387-9_1"},"APC_amount":"2748 EUR","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"alternative_title":["LNCS"],"conference":{"start_date":"2024-10-27","end_date":"2024-10-31","name":"ISoLA: International Symposium on Leveraging Applications","location":"Crete, Greece"},"arxiv":1,"date_published":"2024-10-26T00:00:00Z","abstract":[{"text":"System behaviors are traditionally evaluated through binary classifications of correctness, which do not suffice for properties involving quantitative aspects of systems and executions. Quantitative automata offer a more nuanced approach, mapping each execution to a real number by incorporating weighted transitions and value functions generalizing acceptance conditions. In this paper, we introduce QuAK, the first tool designed to automate the analysis of quantitative automata. QuAK currently supports a variety of quantitative automaton types, including Inf, Sup, LimInf, LimSup, LimInfAvg, and LimSupAvg automata, and implements decision procedures for problems such as emptiness, universality, inclusion, equivalence, as well as for checking whether an automaton is safe, live, or constant. Additionally, QuAK is able to compute extremal values when possible, construct safety-liveness decompositions, and monitor system behaviors. We demonstrate the effectiveness of QuAK through experiments focusing on the inclusion, constant-function check, and monitoring problems.","lang":"eng"}],"file_date_updated":"2025-01-21T14:39:49Z","quality_controlled":"1","scopus_import":"1","date_created":"2024-09-05T14:27:08Z","OA_type":"hybrid","intvolume":" 15222","doi":"10.1007/978-3-031-75387-9_1","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093. N. Mazzocchi was affiliated with ISTA when his collaboration started.","page":"3-20","ddc":["000"],"status":"public","oa":1,"volume":15222,"month":"10","file":[{"file_name":"isola24.pdf","file_size":847422,"date_created":"2024-09-05T14:26:02Z","checksum":"43e432f82be376434b358f3dd7a94b71","file_id":"17635","success":1,"date_updated":"2024-09-05T14:26:02Z","content_type":"application/pdf","creator":"esarac","relation":"main_file","access_level":"open_access"},{"date_updated":"2025-01-21T14:39:49Z","content_type":"application/pdf","creator":"dernst","relation":"main_file","access_level":"open_access","file_name":"2024_LNCS_Chalupa.pdf","checksum":"6bc04f07bb5612c0e7ea00ac121a69b6","file_size":1358706,"date_created":"2025-01-21T14:39:49Z","file_id":"18865","success":1}],"corr_author":"1","publication_status":"published","type":"conference","publication":"12th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation","day":"26","ec_funded":1,"_id":"17634","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"oa_version":"Published Version","has_accepted_license":"1","publisher":"Springer Nature","external_id":{"arxiv":["2409.03569"],"isi":["001419008700001"]},"project":[{"grant_number":"101020093","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"}]},{"article_processing_charge":"Yes (via OA deal)","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1433-7851"],"eissn":["1521-3773"]},"citation":{"mla":"Jethwa, Rajesh B., et al. “To DISP or Not? The Far‐reaching Reaction Mechanisms Underpinning Lithium‐air Batteries.” Angewandte Chemie International Edition, vol. 63, no. 28, e202316476, Wiley, 2024, doi:10.1002/anie.202316476.","ista":"Jethwa RB, Mondal S, Pant B, Freunberger SA. 2024. To DISP or not? The far‐reaching reaction mechanisms underpinning Lithium‐air batteries. Angewandte Chemie International Edition. 63(28), e202316476.","short":"R.B. Jethwa, S. Mondal, B. Pant, S.A. Freunberger, Angewandte Chemie International Edition 63 (2024).","chicago":"Jethwa, Rajesh B, Soumyadip Mondal, Bhargavi Pant, and Stefan Alexander Freunberger. “To DISP or Not? The Far‐reaching Reaction Mechanisms Underpinning Lithium‐air Batteries.” Angewandte Chemie International Edition. Wiley, 2024. https://doi.org/10.1002/anie.202316476.","apa":"Jethwa, R. B., Mondal, S., Pant, B., & Freunberger, S. A. (2024). To DISP or not? The far‐reaching reaction mechanisms underpinning Lithium‐air batteries. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.202316476","ieee":"R. B. Jethwa, S. Mondal, B. Pant, and S. A. Freunberger, “To DISP or not? The far‐reaching reaction mechanisms underpinning Lithium‐air batteries,” Angewandte Chemie International Edition, vol. 63, no. 28. Wiley, 2024.","ama":"Jethwa RB, Mondal S, Pant B, Freunberger SA. To DISP or not? The far‐reaching reaction mechanisms underpinning Lithium‐air batteries. Angewandte Chemie International Edition. 2024;63(28). doi:10.1002/anie.202316476"},"year":"2024","title":"To DISP or not? The far‐reaching reaction mechanisms underpinning Lithium‐air batteries","author":[{"first_name":"Rajesh B","orcid":"0000-0002-0404-4356","id":"4cc538d5-803f-11ed-ab7e-8139573aad8f","full_name":"Jethwa, Rajesh B","last_name":"Jethwa"},{"full_name":"Mondal, Soumyadip","last_name":"Mondal","first_name":"Soumyadip","id":"d25d21ef-dc8d-11ea-abe3-ec4576307f48"},{"first_name":"Bhargavi","id":"50c64d4d-eb97-11eb-a6c2-d33e5e14f112","full_name":"Pant, Bhargavi","last_name":"Pant"},{"full_name":"Freunberger, Stefan Alexander","last_name":"Freunberger","first_name":"Stefan Alexander","orcid":"0000-0003-2902-5319","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","related_material":{"record":[{"status":"public","id":"20607","relation":"dissertation_contains"}]},"isi":1,"date_updated":"2026-04-07T12:27:23Z","quality_controlled":"1","scopus_import":"1","file_date_updated":"2024-07-16T11:54:46Z","issue":"28","article_type":"review","doi":"10.1002/anie.202316476","intvolume":" 63","date_created":"2023-12-15T16:10:13Z","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","department":[{"_id":"StFr"},{"_id":"GradSch"}],"abstract":[{"lang":"eng","text":"The short history of research on Li-O2 batteries has seen a remarkable number of mechanistic U-turns over the years. From the initial use of carbonate electrolytes, that were then found to be entirely unsuitable, to the belief that (su)peroxide was solely responsible for degradation, before the more reactive singlet oxygen was found to form, to the hypothesis that capacity depends on a competing surface/solution mechanism before a practically exclusive solution mechanism was identified. Herein, we argue for an ever-fresh look at the reported data without bias towards supposedly established explanations. We explain how the latest findings on rate and capacity limits, as well as the origin of side reactions, are connected via the disproportionation (DISP) step in the (dis)charge mechanism. Therefrom, directions emerge for the design of electrolytes and mediators on how to suppress side reactions and to enable high rate and high reversible capacity."}],"date_published":"2024-07-08T00:00:00Z","corr_author":"1","month":"07","file":[{"creator":"dernst","date_updated":"2024-07-16T11:54:46Z","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_name":"2024_AngChemieInt_Jethwa.pdf","date_created":"2024-07-16T11:54:46Z","file_size":4766445,"checksum":"fe2c23454279eb9d76ed6ca9970c21c7","success":1,"file_id":"17261"}],"volume":63,"publication_status":"published","type":"journal_article","keyword":["General Chemistry","Catalysis"],"acknowledgement":"S.A.F. is indebted to ISTA for support. R.B.J. thanks the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 101034413 for funding. B.P. thanks Alistore ERI for providing a PhD scholarship.","oa":1,"status":"public","ddc":["540"],"has_accepted_license":"1","external_id":{"isi":["001241932700001"],"pmid":["38095355"]},"project":[{"name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","call_identifier":"H2020"}],"publisher":"Wiley","ec_funded":1,"_id":"14687","article_number":"e202316476","publication":"Angewandte Chemie International Edition","day":"08","pmid":1,"oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"}},{"page":"2433-3282","acknowledgement":"This research was supported by Fondation CFM pour la Recherche, the H2020 European Research Council [Grant ERC-CoG-863818 (ForM-SMArt)], the Austrian Science Fund [Grant 10.55776/COE12], ANID Chile [Grant ACT210005], and Agence Nationale de la Recherche [Grant ANR-21-CE40-0020].","status":"public","month":"10","corr_author":"1","volume":50,"type":"journal_article","publication_status":"published","ec_funded":1,"_id":"18266","publication":"Mathematics of Operations Research","day":"01","oa_version":"None","publisher":"Institute for Operations Research and the Management Sciences","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020"}],"external_id":{"isi":["001328875900001"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Oliu-Barton","full_name":"Oliu-Barton, Miquel","first_name":"Miquel"},{"last_name":"Saona Urmeneta","full_name":"Saona Urmeneta, Raimundo J","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","orcid":"0000-0001-5103-038X","first_name":"Raimundo J"}],"title":"Value-positivity for matrix games","related_material":{"record":[{"relation":"dissertation_contains","id":"20234","status":"public"}]},"date_updated":"2026-04-07T12:31:21Z","isi":1,"article_processing_charge":"No","publication_identifier":{"issn":["0364-765X"],"eissn":["1526-5471"]},"language":[{"iso":"eng"}],"citation":{"chicago":"Chatterjee, Krishnendu, Miquel Oliu-Barton, and Raimundo J Saona Urmeneta. “Value-Positivity for Matrix Games.” Mathematics of Operations Research. Institute for Operations Research and the Management Sciences, 2024. https://doi.org/10.1287/moor.2022.0332.","ista":"Chatterjee K, Oliu-Barton M, Saona Urmeneta RJ. 2024. Value-positivity for matrix games. Mathematics of Operations Research. 50(4), 2433–3282.","short":"K. Chatterjee, M. Oliu-Barton, R.J. Saona Urmeneta, Mathematics of Operations Research 50 (2024) 2433–3282.","mla":"Chatterjee, Krishnendu, et al. “Value-Positivity for Matrix Games.” Mathematics of Operations Research, vol. 50, no. 4, Institute for Operations Research and the Management Sciences, 2024, pp. 2433–3282, doi:10.1287/moor.2022.0332.","apa":"Chatterjee, K., Oliu-Barton, M., & Saona Urmeneta, R. J. (2024). Value-positivity for matrix games. Mathematics of Operations Research. Institute for Operations Research and the Management Sciences. https://doi.org/10.1287/moor.2022.0332","ama":"Chatterjee K, Oliu-Barton M, Saona Urmeneta RJ. Value-positivity for matrix games. Mathematics of Operations Research. 2024;50(4):2433-3282. doi:10.1287/moor.2022.0332","ieee":"K. Chatterjee, M. Oliu-Barton, and R. J. Saona Urmeneta, “Value-positivity for matrix games,” Mathematics of Operations Research, vol. 50, no. 4. Institute for Operations Research and the Management Sciences, pp. 2433–3282, 2024."},"year":"2024","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"abstract":[{"lang":"eng","text":"Matrix games are the most basic model in game theory, and yet robustness with respect to small perturbations of the matrix entries is not fully understood. In this paper, we introduce value positivity and uniform value positivity, two properties that refine the notion of optimality in the context of polynomially perturbed matrix games. The first concept captures how the value depends on the perturbation parameter, and the second consists of the existence of a fixed strategy that guarantees the value of the unperturbed matrix game for every sufficiently small positive parameter. We provide polynomial-time algorithms to check whether a polynomially perturbed matrix game satisfies these properties. We further provide the functional form for a parameterized optimal strategy and the value function. Finally, we translate our results to linear programming and stochastic games, where value positivity is related to the existence of robust solutions."}],"date_published":"2024-10-01T00:00:00Z","quality_controlled":"1","scopus_import":"1","issue":"4","article_type":"original","doi":"10.1287/moor.2022.0332","OA_type":"closed access","date_created":"2024-10-09T07:02:20Z","intvolume":" 50"},{"department":[{"_id":"GradSch"}],"alternative_title":["ISTA Master's Thesis"],"date_published":"2024-11-29T00:00:00Z","abstract":[{"lang":"eng","text":"This thesis is an experimental work about two distinct research projects that evolved from a single project: non-equilibrium dynamics of an acoustically vibrated particle and microfabrication of particles with nano-scale 3D printing. The first project explores non equilibrium dynamics of a particle driven by ultrasonic vibrations. We design an experimental system consisting of an electromechanical vibration scheme to drive the particle’s vibrations and an imaging scheme to track its trajectories. We study the trajectories to determine how the particle’s dynamics evolve under the driven conditions, considering out of equilibrium systems in the context of equilibrium statistical mechanics. Using a Langevin framework and the Boltzmann factor, we characterize the particle’s dynamics as complex; the particle motion\r\nis not purely diffusive. We extract physical parameters like spring constant, effective temperature, damping coefficient and resonance frequency.\r\n\r\nIn the second project, we explore and develop techniques in the design and microfabrication of particles across scales. Microfabrication involves building structures at the micron or submicron scale. These designed miniaturized patterns, objects, or devices are useful in biophysics, pharmacology, medical biology, and nanotechnology. We specifically apply two-photon polymerization, a form of 3D nano printing. We print millimetric particles, characterizing different designs to evaluate and showcase the resolution, aspect ratio integrity and print quality of the printing process. We also design and fabricate a microsensor to deflect under applicable force of order 0.1 pN. We present fundamental concepts needed to design the microsensor, showcasing 3D printing at considerably smaller scales down to the µm or below."}],"file_date_updated":"2024-12-13T11:30:53Z","date_created":"2024-11-27T09:12:02Z","doi":"10.15479/at:ista:18588","title":"Non equilibrium dynamics of driven individual particles and 3D printing across scales","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"last_name":"Mweka","full_name":"Mweka, Cecelia N","id":"2a69ab4b-896a-11ed-bdf8-cb8641cf2b21","first_name":"Cecelia N"}],"OA_place":"publisher","date_updated":"2026-04-07T12:42:13Z","degree_awarded":"MS","publication_identifier":{"issn":["2791-4585"]},"language":[{"iso":"eng"}],"article_processing_charge":"No","supervisor":[{"full_name":"Waitukaitis, Scott R","last_name":"Waitukaitis","orcid":"0000-0002-2299-3176","first_name":"Scott R","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jérémie A","orcid":"0000-0002-7253-9465","id":"8fb92548-2b22-11eb-b7c1-a3f0d08d7c7d","full_name":"Palacci, Jérémie A","last_name":"Palacci"}],"year":"2024","citation":{"short":"C.N. Mweka, Non Equilibrium Dynamics of Driven Individual Particles and 3D Printing across Scales, Institute of Science and Technology Austria, 2024.","chicago":"Mweka, Cecelia N. “Non Equilibrium Dynamics of Driven Individual Particles and 3D Printing across Scales.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:18588.","ista":"Mweka CN. 2024. Non equilibrium dynamics of driven individual particles and 3D printing across scales. Institute of Science and Technology Austria.","mla":"Mweka, Cecelia N. Non Equilibrium Dynamics of Driven Individual Particles and 3D Printing across Scales. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:18588.","apa":"Mweka, C. N. (2024). Non equilibrium dynamics of driven individual particles and 3D printing across scales. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:18588","ama":"Mweka CN. Non equilibrium dynamics of driven individual particles and 3D printing across scales. 2024. doi:10.15479/at:ista:18588","ieee":"C. N. Mweka, “Non equilibrium dynamics of driven individual particles and 3D printing across scales,” Institute of Science and Technology Austria, 2024."},"day":"29","_id":"18588","oa_version":"Published Version","has_accepted_license":"1","publisher":"Institute of Science and Technology Austria","acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"acknowledgement":"I would like to acknowledge Scott Waitukaitis and Jérémie Palacci, for their supervision, and their extensive support of my learning. \r\n\r\nFor the beautiful characterization images used in this work, I would like to thank Dr. Daniel Grober, Samuel Hajek and Felix Pertl.\r\n\r\nThe Palacci group, particularly Malina Strugaru and Dan Grober, for their continuous guidance in decoding and following my streams of thought.\r\n\r\nTo the Waitukaitis group, for helping me find my footing in science, and making me feel at\r\nhome.\r\n\r\nTo the Nanofabrication Facility (NFF) at ISTA, for training me in significant aspects of my research. The MIBA Facility, and particularly Todor Asenov for consistently picking up the phone for my machining and designing needs.\r\n\r\nTo my friends, Mariana, Lenka, Aaron, Rebecca, Eavan who provided an ear, wine, and a lot more when I needed to vent, talk through my crises as well as experiment. For the walks, for the coffees, for reading through my work and providing edits, for dinners to take me out of blocks and binds and for cheering me on when it felt insurmountable. \r\n\r\nFinally, I am grateful to Griff and Fletcher, whose music helped me through several blocks, especially with my writing.\r\n\r\nMy science would not have been possible without the guidance, support and contributions of\r\nall these people, and more.","page":"61","oa":1,"status":"public","ddc":["530"],"month":"11","file":[{"file_size":3836671,"checksum":"054ed7a5e5ae6e7220e6bb37ea57a3c3","date_created":"2024-11-28T12:50:32Z","file_name":"Cecelia Mweka Master Thesis.pdf","file_id":"18597","success":1,"content_type":"application/pdf","date_updated":"2024-11-28T12:50:32Z","creator":"cmweka","relation":"main_file","access_level":"open_access"},{"date_updated":"2024-12-13T11:30:53Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","creator":"cmweka","relation":"source_file","access_level":"closed","file_name":"Cecelia Mweka Master Thesis.docx","date_created":"2024-11-28T12:51:43Z","file_size":7068210,"checksum":"7d7d9299f090d83e628d65d93116e8c2","file_id":"18598"}],"corr_author":"1","type":"dissertation","publication_status":"published"},{"type":"dissertation","publication_status":"published","corr_author":"1","file":[{"success":1,"file_id":"17228","checksum":"15b2dbe8d2c9ed7ca5dd413827928077","date_created":"2024-07-11T10:26:22Z","file_size":6729761,"file_name":"PhD_Thesis_Vyacheslav_Li_no_signatures_PDFA.pdf","access_level":"open_access","relation":"main_file","creator":"vli","content_type":"application/pdf","date_updated":"2024-07-11T10:26:22Z"},{"relation":"source_file","access_level":"closed","content_type":"application/x-zip-compressed","date_updated":"2024-07-11T10:26:22Z","creator":"vli","file_id":"17229","date_created":"2024-07-11T10:26:22Z","checksum":"16e904a11d8d0ebb167cb654ddfc7fe5","file_size":9542859,"file_name":"PhD Thesis Vyacheslav Li.zip"}],"month":"07","oa":1,"ddc":["530"],"status":"public","page":"79","project":[{"_id":"bdb2a702-d553-11ed-ba76-f12e3e5a3bc6","grant_number":"101087907","name":"A quantum hybrid of atoms and milligram-scale pendulums: towards gravitational quantum mechanics"}],"publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","oa_version":"Published Version","tmp":{"short":"CC BY-NC-SA (4.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode"},"_id":"17225","day":"11","citation":{"ista":"Li V. 2024. Towards a quantum entanglement enhanced atom interferomter. Institute of Science and Technology Austria.","short":"V. Li, Towards a Quantum Entanglement Enhanced Atom Interferomter, Institute of Science and Technology Austria, 2024.","chicago":"Li, Vyacheslav. “Towards a Quantum Entanglement Enhanced Atom Interferomter.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:17225.","mla":"Li, Vyacheslav. Towards a Quantum Entanglement Enhanced Atom Interferomter. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:17225.","apa":"Li, V. (2024). Towards a quantum entanglement enhanced atom interferomter. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:17225","ama":"Li V. Towards a quantum entanglement enhanced atom interferomter. 2024. doi:10.15479/at:ista:17225","ieee":"V. Li, “Towards a quantum entanglement enhanced atom interferomter,” Institute of Science and Technology Austria, 2024."},"supervisor":[{"id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2031-204X","first_name":"Onur","last_name":"Hosten","full_name":"Hosten, Onur"}],"year":"2024","article_processing_charge":"No","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"related_material":{"record":[{"status":"public","id":"11438","relation":"part_of_dissertation"}]},"degree_awarded":"PhD","date_updated":"2026-04-07T12:42:28Z","OA_place":"publisher","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"id":"3A4FAA92-F248-11E8-B48F-1D18A9856A87","first_name":"Vyacheslav","last_name":"Li","full_name":"Li, Vyacheslav"}],"title":"Towards a quantum entanglement enhanced atom interferomter","doi":"10.15479/at:ista:17225","date_created":"2024-07-11T09:46:48Z","file_date_updated":"2024-07-11T10:26:22Z","abstract":[{"text":"This thesis describes the development of an atom interferometer designed to exploit the\r\nadvantages of utilizing quantum entanglement for enhanced precision measurements beyond\r\nthe standard quantum limit. While the project remains ongoing, significant progress has been\r\nmade.\r\nA key contribution of this work is the development of Quantrol, an experimental control\r\nsystem leveraging the ARTIQ framework. This software enables precise timing and control\r\nwithout requiring prior knowledge of ARTIQ’s implementation details or coding experience.\r\nThe interface offers user friendly visual comprehension of the experimental sequence and\r\nextended capabilities, allowing researchers to scan variables with a simple click of a mouse.\r\nThe main proposed project is to implement atom interferometric sequence with squeezed input\r\nstates inside of a dipole trap generated by a high finesse cavity. The presence of the dipole\r\ntrap allows one dimensional atomic cloud split while maintaining relatively strong confinement\r\nin other directions.\r\nWe are currently able to trap and cool 87Rb atoms to few micro kelvin temperatures, load\r\nthem into the dipole trap and state prepare them to be used for squeezing and interferometric\r\nsequence.","lang":"eng"}],"date_published":"2024-07-11T00:00:00Z","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","alternative_title":["ISTA Thesis"],"department":[{"_id":"GradSch"},{"_id":"OnHo"}]},{"has_accepted_license":"1","publisher":"Institute of Science and Technology Austria","project":[{"_id":"6286e8c4-2b32-11ec-9570-f5297902f67f","grant_number":"26069","name":"Branes on hyperkähler manifolds"}],"day":"24","_id":"18443","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"oa_version":"Published Version","month":"10","file":[{"creator":"msisak","content_type":"application/pdf","date_updated":"2024-10-23T14:42:45Z","access_level":"open_access","relation":"main_file","checksum":"8c4893e726aaa4b3efb82758da9b6851","date_created":"2024-10-23T14:42:45Z","file_size":1672547,"file_name":"MASisak_dissertation.pdf","success":1,"file_id":"18467"},{"file_id":"18468","checksum":"1831b072e861a1e5481024ca9d02b036","file_size":617913,"date_created":"2024-10-23T14:43:56Z","file_name":"MASisak_source.zip","access_level":"closed","relation":"source_file","creator":"msisak","content_type":"application/x-zip-compressed","date_updated":"2024-10-24T08:09:13Z"}],"corr_author":"1","keyword":["hyperkaehler geometry","branes","mirror symmetry","T-duality"],"publication_status":"published","type":"dissertation","page":"178","status":"public","ddc":["516"],"oa":1,"file_date_updated":"2024-10-24T08:09:13Z","date_created":"2024-10-19T12:00:37Z","OA_type":"free access","doi":"10.15479/at:ista:18443","department":[{"_id":"GradSch"},{"_id":"TaHa"}],"alternative_title":["ISTA Thesis"],"date_published":"2024-10-24T00:00:00Z","abstract":[{"text":"In [KW06] Kapustin and Witten conjectured that there is a mirror symmetry relation between\r\nthe hyperkähler structures on certain Higgs bundle moduli spaces. As a consequence, they\r\nconjecture an equivalence between categories of BBB and BAA-branes. At the classical\r\nlevel, this mirror symmetry is given by T-duality between semi-flat hyperkähler structures on\r\nalgebraic integrable systems.\r\nIn this thesis, we investigate the T-duality relation between hyperkähler structures and the\r\ncorresponding branes on affine torus bundles. We use the techniques of generalized geometry\r\nto show that semi-flat hyperkähler structures are T-dual on algebraic integrable systems.\r\nWe also describe T-duality for generalized branes. Motivated by Fourier-Mukai transform\r\nwe upgrade the T-duality between generalized branes to T-duality of submanifolds endowed\r\nwith U(1)-bundles and connections. This T-duality in the appropriate context specializes to\r\nT-duality between BBB and BAA-branes.\r\n","lang":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"article_processing_charge":"No","year":"2024","supervisor":[{"last_name":"Hausel","full_name":"Hausel, Tamás","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","first_name":"Tamás","orcid":"0000-0002-9582-2634"}],"citation":{"apa":"Sisak, M. A. (2024). T-dual branes on hyperkähler manifolds. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:18443","mla":"Sisak, Maria A. T-Dual Branes on Hyperkähler Manifolds. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:18443.","ista":"Sisak MA. 2024. T-dual branes on hyperkähler manifolds. Institute of Science and Technology Austria.","chicago":"Sisak, Maria A. “T-Dual Branes on Hyperkähler Manifolds.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:18443.","short":"M.A. Sisak, T-Dual Branes on Hyperkähler Manifolds, Institute of Science and Technology Austria, 2024.","ieee":"M. A. Sisak, “T-dual branes on hyperkähler manifolds,” Institute of Science and Technology Austria, 2024.","ama":"Sisak MA. T-dual branes on hyperkähler manifolds. 2024. doi:10.15479/at:ista:18443"},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"full_name":"Sisak, Maria A","last_name":"Sisak","first_name":"Maria A","id":"44A03D04-AEA4-11E9-B225-EA2DE6697425"}],"title":"T-dual branes on hyperkähler manifolds","OA_place":"publisher","date_updated":"2026-04-07T12:42:44Z","degree_awarded":"PhD"},{"has_accepted_license":"1","acknowledged_ssus":[{"_id":"ScienComp"}],"publisher":"Institute of Science and Technology Austria","project":[{"name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"_id":"17485","ec_funded":1,"day":"05","oa_version":"Published Version","file":[{"file_size":1615167,"checksum":"5d785645805a78c5b4ce7cc3df557b09","date_created":"2024-09-05T12:04:11Z","file_name":"thesis-final.zip","file_id":"17570","creator":"efrantar","content_type":"application/zip","date_updated":"2024-09-05T12:04:11Z","access_level":"closed","relation":"source_file"},{"date_updated":"2024-09-06T16:24:59Z","content_type":"application/pdf","creator":"efrantar","relation":"main_file","access_level":"open_access","file_name":"frantar_thesis_final.pdf","file_size":2376611,"checksum":"a9dd1c2d23734986924eb44ebb55fd8f","date_created":"2024-09-06T16:24:59Z","file_id":"17880","success":1}],"month":"09","corr_author":"1","type":"dissertation","publication_status":"published","page":"129","ddc":["000"],"status":"public","oa":1,"file_date_updated":"2024-09-06T16:24:59Z","doi":"10.15479/at:ista:17485","date_created":"2024-09-02T11:01:48Z","department":[{"_id":"GradSch"},{"_id":"DaAl"}],"alternative_title":["ISTA Thesis"],"abstract":[{"text":"Large language models (LLMs) have made tremendous progress in the past few years, from being able to generate coherent text to matching or surpassing humans in a wide variety of creative, knowledge or reasoning tasks. Much of this can be attributed to massively increased scale, both in the size of the model as well as the amount of training data, from 100s of millions to 100s of billions, or even trillions. This trend is expected to continue, which, although exciting, also raises major practical concerns. Already today's 100+ billion parameter LLMs require top-of-the-line hardware just to run. Hence, it is clear that sustaining these developments will require significant efficiency advances.\r\n\r\nHistorically, one of the most practical ways of improving model efficiency has been compression, especially in the form of sparsity or quantization. While this has been studied extensively in the past, existing accurate methods are all designed for models around 100 million parameters; scaling them up to ones literally 1000x larger is highly challenging. In this thesis, we introduce a new unified sparsification and quantization approach OBC, which through additional algorithmic enhancements leads to GPTQ and SparseGPT, the first techniques fast and accurate enough to compress 100+ billion parameter models to 4- or even 3-bit precision and 50% weight-sparsity, respectively. Additionally, we show how weight-only quantizion does not just bring space savings but also up to 4.5x faster generation speed, via custom GPU kernels.\r\n\r\nIn fact, we show for the first time that it is possible to develop an FP16 times INT4 mixed-precision matrix multiplication kernel, called Marlin, which comes close to simultaneously maximizing both memory and compute utilization, making weight-only quantization highly practical even for multi-user serving. Further, we demonstrate that GPTQ can be scaled to widely overparametrized trillion-parameter models, where extreme sub-1-bit compression rates can be achieved without any inference slow-down, by co-designing a bespoke entropy coding scheme together with an efficient kernel.\r\n\r\nFinally, we also study compression from the perspective of someone with access to massive amounts of compute resources for training large models completely from scratch. Here the key questions evolve around the joint scaling behavior between compression, model size, and amount of training data used. Based on extensive experimental results for both vision and text models, we introduce the first scaling law which accurately captures the relationship between weight-sparsity, number of non-zero weights and data. This further allows us to characterize the optimal sparsity, which we find to increase the longer a fixed cost model is being trained.\r\n\r\nOverall, this thesis presents contributions to three different angles of large model efficiency: affordable but accurate algorithms, highly efficient systems implementations, and fundamental scaling laws for compressed training.","lang":"eng"}],"date_published":"2024-09-05T00:00:00Z","article_processing_charge":"No","publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"citation":{"ista":"Frantar E. 2024. Compressing large neural networks : Algorithms, systems and scaling laws. Institute of Science and Technology Austria.","short":"E. Frantar, Compressing Large Neural Networks : Algorithms, Systems and Scaling Laws, Institute of Science and Technology Austria, 2024.","chicago":"Frantar, Elias. “Compressing Large Neural Networks : Algorithms, Systems and Scaling Laws.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:17485.","mla":"Frantar, Elias. Compressing Large Neural Networks : Algorithms, Systems and Scaling Laws. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:17485.","apa":"Frantar, E. (2024). Compressing large neural networks : Algorithms, systems and scaling laws. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:17485","ama":"Frantar E. Compressing large neural networks : Algorithms, systems and scaling laws. 2024. doi:10.15479/at:ista:17485","ieee":"E. Frantar, “Compressing large neural networks : Algorithms, systems and scaling laws,” Institute of Science and Technology Austria, 2024."},"year":"2024","supervisor":[{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X"}],"OA_place":"publisher","title":"Compressing large neural networks : Algorithms, systems and scaling laws","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f","first_name":"Elias","last_name":"Frantar","full_name":"Frantar, Elias"}],"degree_awarded":"PhD","related_material":{"record":[{"relation":"part_of_dissertation","id":"18062","status":"public"},{"id":"18061","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"17378"},{"status":"public","id":"17087","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"14458"}]},"date_updated":"2026-04-07T12:43:04Z"},{"ec_funded":1,"_id":"17208","day":"09","oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"has_accepted_license":"1","acknowledged_ssus":[{"_id":"ScienComp"}],"project":[{"name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control","call_identifier":"H2020","grant_number":"850899","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E"}],"publisher":"Institute of Science and Technology Austria","page":"133","ddc":["539"],"oa":1,"status":"public","corr_author":"1","file":[{"checksum":"6f45273d04f4418bc2adc018baed0525","date_created":"2024-07-09T09:21:44Z","file_size":"14218691","file_name":"Raimel_Thesis-Final.zip","file_id":"17212","content_type":"application/zip","date_updated":"2024-07-10T11:34:09Z","creator":"rmedinar","relation":"source_file","access_level":"closed"},{"creator":"rmedinar","date_updated":"2024-07-17T09:23:24Z","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_name":"Raimel_Thesis-20_pdfa.pdf","file_size":11253627,"checksum":"6724a95bec772dbabc0111b9f08a805e","date_created":"2024-07-17T09:23:24Z","success":1,"file_id":"17275"}],"month":"07","type":"dissertation","publication_status":"published","keyword":["Quantum computing","Variational Quantum Algorithms","Optimization"],"department":[{"_id":"GradSch"},{"_id":"MaSe"}],"alternative_title":["ISTA Thesis"],"abstract":[{"text":"Can current quantum computers provide a speedup over their classical counterparts for some kinds of problems? In this thesis, with a focus on ground state search/preparation, we address some of the challenges that both quantum annealing and variational quantum algorithms suffer from, hindering any possible practical speedup in comparison to the best classical counterparts. \r\n\r\nIn the first part of the thesis, we study the performance of quantum annealing for solving a particular combinatorial optimization problem called 3-XOR satisfability (3-XORSAT). The classical problem is mapped into a ground state search of a 3-local classical Hamiltonian $H_C$. We consider how modifying the initial problem, by adding more interaction terms to the corresponding Hamiltonian, leads to the emergence of a first-order phase transition during the annealing process. This phenomenon causes the total annealing duration, $T$, required to prepare the ground state of $H_C$ with a high probability to increase exponentially with the size of the problem. Our findings indicate that with the growing complexity of problem instances, the likelihood of encountering first-order phase transitions also increases, making quantum annealing an impractical solution for these types of combinatorial optimization problems.\r\n\r\nIn the second part, we focus on the problem of barren plateaus in generic variational quantum algorithms. Barren plateaus correspond to flat regions in the parameter space where the gradient of the cost function is zero in expectation, and with the variance decaying exponentially with the system size, thus obstructing an efficient parameter optimization. We propose an algorithm to circumvent Barren Plateaus by monitoring the entanglement entropy of k-local reduced density matrices, alongside a method for estimating entanglement entropy via classical shadow tomography. We illustrate the approach with the paradigmatic example of the variational quantum eigensolver, and show that our algorithm effectively avoids barren plateaus in the initialization as well as during the optimization stage. \r\n\r\nLastly, in the last two Chapters of this thesis, we focus on the quantum approximate optimization algorithm (QAOA), originally introduced as an algorithm for solving generic combinatorial optimization problems in near-term quantum devices. Specifically, we focus on how to develop rigorous initialization strategies with guarantee improvement. Our motivation for this study lies in that for random initialization, the optimization typically leads to local minima with poor performance. Our main result corresponds to the analytical construction of index-1 saddle points or transition states, stationary points with a single direction of descent, as a tool for systematically exploring the QAOA optimization landscape. This leads us to propose a novel greedy parameter initialization strategy that guarantees for the energy to decrease with an increasing number of circuit layers. Furthermore, with precise estimates for the negative Hessian eigenvalue and its eigenvector, we establish a lower bound for energy improvement following a QAOA iteration.","lang":"eng"}],"date_published":"2024-07-09T00:00:00Z","file_date_updated":"2024-07-17T09:23:24Z","doi":"10.15479/at:ista:17208","date_created":"2024-07-09T09:14:24Z","OA_place":"publisher","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"id":"CE680B90-D85A-11E9-B684-C920E6697425","first_name":"Raimel A","orcid":"0000-0002-5383-2869","last_name":"Medina Ramos","full_name":"Medina Ramos, Raimel A"}],"title":"Exploring the optimization landscape of variational quantum algorithms","degree_awarded":"PhD","related_material":{"record":[{"status":"public","id":"10545","relation":"part_of_dissertation"},{"id":"10067","relation":"part_of_dissertation","status":"public"},{"id":"17222","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"13125"},{"status":"public","relation":"part_of_dissertation","id":"11471"}]},"date_updated":"2026-04-07T12:43:22Z","article_processing_charge":"No","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"citation":{"apa":"Medina Ramos, R. A. (2024). Exploring the optimization landscape of variational quantum algorithms. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:17208","mla":"Medina Ramos, Raimel A. Exploring the Optimization Landscape of Variational Quantum Algorithms. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:17208.","ista":"Medina Ramos RA. 2024. Exploring the optimization landscape of variational quantum algorithms. Institute of Science and Technology Austria.","short":"R.A. Medina Ramos, Exploring the Optimization Landscape of Variational Quantum Algorithms, Institute of Science and Technology Austria, 2024.","chicago":"Medina Ramos, Raimel A. “Exploring the Optimization Landscape of Variational Quantum Algorithms.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:17208.","ieee":"R. A. Medina Ramos, “Exploring the optimization landscape of variational quantum algorithms,” Institute of Science and Technology Austria, 2024.","ama":"Medina Ramos RA. Exploring the optimization landscape of variational quantum algorithms. 2024. doi:10.15479/at:ista:17208"},"year":"2024","supervisor":[{"full_name":"Serbyn, Maksym","last_name":"Serbyn","orcid":"0000-0002-2399-5827","first_name":"Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87"}]},{"has_accepted_license":"1","project":[{"grant_number":"P36278","_id":"bd8a4fdc-d553-11ed-ba76-80a0167441a3","name":"Rational curves via function field analytic number theory"}],"publisher":"Institute of Science and Technology Austria","day":"23","_id":"18132","oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png"},"corr_author":"1","file":[{"date_updated":"2024-09-23T18:49:22Z","content_type":"application/x-zip-compressed","creator":"jglas","relation":"source_file","access_level":"closed","file_name":"PhDthesis (3).zip","checksum":"2f8cf5cefdab108b1979caa8146cae9a","date_created":"2024-09-23T18:49:22Z","file_size":5382106,"file_id":"18133"},{"file_id":"18140","success":1,"date_created":"2024-09-25T14:08:57Z","file_size":2380127,"checksum":"08bb6f14c42b47ff25882a2ce3ea0d8a","file_name":"example-phd.pdf","relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_updated":"2024-09-25T14:08:57Z","creator":"jglas"}],"month":"09","type":"dissertation","publication_status":"published","page":"195","ddc":["512"],"status":"public","oa":1,"file_date_updated":"2024-09-25T14:08:57Z","date_created":"2024-09-23T18:58:08Z","doi":"10.15479/at:ista:18132","license":"https://creativecommons.org/licenses/by-nc/4.0/","department":[{"_id":"GradSch"},{"_id":"TiBr"}],"alternative_title":["ISTA Thesis"],"date_published":"2024-09-23T00:00:00Z","abstract":[{"lang":"eng","text":"In this thesis, we are dealing with both arithmetic and geometric problems coming from the\r\nstudy of rational points with a particular focus on function fields over finite fields:\r\n(1) Using the circle method we produce upper bounds for the number of rational points of\r\nbounded height on diagonal cubic surfaces and fourfolds over Fq(t). This is based on\r\njoint work with Leonhard Hochfilzer.\r\n(2) We study rational points on smooth complete intersections X defined by cubic and\r\nquadratic hypersurfaces over Fq(t). We refine the Farey dissection of the “unit square”\r\ndeveloped by Vishe [202] and use the circle method with a Kloosterman refinement to\r\nestablish an asymptotic formula for the number of rational points of bounded height on\r\nX when dim(X) ≥ 23. Under the same hypotheses, we also verify weak approximation.\r\n(3) In joint work with Hochfilzer, we obtain upper bounds for the number of rational points of\r\nbounded height on del Pezzo surfaces of low degree over any global field. Our approach\r\nis to take hyperplane sections, which reduces the problem to uniform estimates for the\r\nnumber of rational points on curves.\r\n(4) We develop a version of the circle method capable of counting Fq-points on jet schemes\r\nof moduli spaces of rational curves on hypersurfaces. Combining this with a spreading\r\nout argument and a result of Mustaţă [150], this allows us to show that these moduli\r\nspaces only have canonical singularities under suitable assumptions on the degree and the\r\ndimension.\r\nIn addition, we give an overview of guiding questions and conjectures in the field of rational\r\npoints and explain the basic mechanism underlying the circle method.\r\n"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"article_processing_charge":"No","supervisor":[{"full_name":"Browning, Timothy D","last_name":"Browning","first_name":"Timothy D","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87"}],"year":"2024","citation":{"ieee":"J. Glas, “Counting rational points over function fields,” Institute of Science and Technology Austria, 2024.","ama":"Glas J. Counting rational points over function fields. 2024. doi:10.15479/at:ista:18132","mla":"Glas, Jakob. Counting Rational Points over Function Fields. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:18132.","short":"J. Glas, Counting Rational Points over Function Fields, Institute of Science and Technology Austria, 2024.","ista":"Glas J. 2024. Counting rational points over function fields. Institute of Science and Technology Austria.","chicago":"Glas, Jakob. “Counting Rational Points over Function Fields.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:18132.","apa":"Glas, J. (2024). Counting rational points over function fields. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:18132"},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"last_name":"Glas","full_name":"Glas, Jakob","id":"d6423cba-dc74-11ea-a0a7-ee61689ff5fb","first_name":"Jakob"}],"title":"Counting rational points over function fields","OA_place":"publisher","date_updated":"2026-04-07T12:53:54Z","related_material":{"record":[{"id":"18293","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"18294"},{"status":"public","id":"18295","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"18173"}]},"degree_awarded":"PhD"},{"has_accepted_license":"1","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","call_identifier":"H2020","name":"Alpha Shape Theory Extended"}],"publisher":"Institute of Science and Technology Austria","ec_funded":1,"_id":"18667","day":"17","oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"corr_author":"1","file":[{"creator":"theiss","date_updated":"2024-12-19T10:24:46Z","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_name":"Teresa_Heiss_PhD_Thesis_final.pdf","file_size":7752253,"checksum":"247bb057aed2fba1cd4711917aaa2d77","date_created":"2024-12-19T10:24:46Z","success":1,"file_id":"18686"},{"creator":"theiss","date_updated":"2024-12-19T10:24:50Z","content_type":"application/zip","access_level":"closed","relation":"source_file","file_name":"PhD_Thesis.zip","checksum":"9648b45c07a008ee11a07f99856a139d","date_created":"2024-12-19T10:24:50Z","file_size":17197731,"file_id":"18687"}],"month":"12","publication_status":"published","type":"dissertation","keyword":["persistent homology","topological data analysis","periodic","crystalline materials","images","fingerprint"],"page":"111","acknowledgement":"I was supported by the European Research Council (ERC) Horizon 2020 project\r\n“Alpha Shape Theory Extended” No. 788183 and by the Pöttinger Scholarship. In addition,\r\nI am very thankful for having been able to attend the second Workshop for Women in\r\nComputational Topology in July 2019, funded by the Mathematical Sciences Institute at\r\nANU, the US National Science Foundation through the award CCF-1841455, the Australian\r\nMathematical Sciences Institute and the Association for Women in Mathematics. Two of the\r\nprojects presented in this thesis started there. One of them reached completion thanks to\r\nfunding from the MSRI Summer Research in Mathematics program awarded to me and my\r\ncollaborators in 2020.","ddc":["514","516","004"],"status":"public","oa":1,"file_date_updated":"2024-12-19T10:24:50Z","doi":"10.15479/at:ista:18667","date_created":"2024-12-17T16:17:55Z","alternative_title":["ISTA Thesis"],"department":[{"_id":"GradSch"},{"_id":"HeEd"}],"abstract":[{"text":"Many chemical and physical properties of materials are determined by the material’s shape,\r\nfor example the size of its pores and the width of its tunnels. This makes materials science\r\na prime application area for geometrical and topological methods. Nevertheless many\r\nmethods in topological data analysis have not been satisfyingly extended to the needs of\r\nmaterials science. This thesis provides new methods and new mathematical theorems\r\ntargeted at those specific needs by answering four different research questions. While the\r\nmotivation for each of the research questions arises from materials science, the methods\r\nare versatile and can be applied in different areas as well. \r\n\r\nThe first research question is concerned with image data, for example a three-dimensional\r\ncomputed tomography (CT) scan of a material, like sand or stone. There are two commonly\r\nused topologies for digital images and depending on the application either of them might be\r\nrequired. However, software for computing the topological data analysis method persistence\r\nhomology, usually supports only one of the two topologies. We answer the question how to\r\ncompute persistent homology of an image with respect to one of the two topologies using\r\nsoftware that is intended for the other topology. \r\n\r\nThe second research question is concerned with image data as well, and asks how much\r\nof the topological information of an image is lost when the resolution is coarsened. As\r\ncomputer tomography scanners are more expensive the higher the resolution, it is an\r\nimportant question in materials science to know which resolution is enough to get satisfying\r\npersistent homology. We give theoretical bounds on the information loss based on different\r\ngeometrical properties of the object to be scanned. In addition, we conduct experiments on\r\nsand and stone CT image data. \r\n\r\nThe third research question is motivated by comparing crystalline materials efficiently. As\r\nthe atoms within a crystal repeat periodically, crystalline materials are either modeled by\r\nunmanageable infinite periodic point sets, or by one of their fundamental domains, which is\r\nunstable under perturbation. Therefore a fingerprint of crystalline materials is needed, with\r\nappropriate properties such that comparing the crystals can be eased by comparing the\r\nfingerprints instead. We define the density fingerprint and prove the necessary properties. \r\n\r\nThe fourth research question is motivated by studying the hole-structure or connectedness,\r\ni.e. persistent homology or merge trees, of crystalline materials. A common way to deal\r\nwith periodicity is to take a fundamental domain and identify opposite boundaries to form a\r\ntorus. However, computing persistent homology or merge trees on that torus loses some\r\nof the information materials scientists are interested in and is additionally not stable under\r\ncertain noise. We therefore decorate the merge tree stemming from the torus with additional\r\ninformation describing the density and growth rate of the periodic copies of a component\r\nwithin a growing spherical window. We prove all desired properties, like stability and efficient\r\ncomputability.","lang":"eng"}],"date_published":"2024-12-17T00:00:00Z","article_processing_charge":"No","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-052-7"]},"citation":{"ama":"Heiss T. New methods for applying topological data analysis to materials science. 2024. doi:10.15479/at:ista:18667","ieee":"T. Heiss, “New methods for applying topological data analysis to materials science,” Institute of Science and Technology Austria, 2024.","chicago":"Heiss, Teresa. “New Methods for Applying Topological Data Analysis to Materials Science.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:18667.","ista":"Heiss T. 2024. New methods for applying topological data analysis to materials science. Institute of Science and Technology Austria.","short":"T. Heiss, New Methods for Applying Topological Data Analysis to Materials Science, Institute of Science and Technology Austria, 2024.","mla":"Heiss, Teresa. New Methods for Applying Topological Data Analysis to Materials Science. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:18667.","apa":"Heiss, T. (2024). New methods for applying topological data analysis to materials science. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:18667"},"year":"2024","supervisor":[{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"OA_place":"publisher","title":"New methods for applying topological data analysis to materials science","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"last_name":"Heiss","full_name":"Heiss, Teresa","id":"4879BB4E-F248-11E8-B48F-1D18A9856A87","first_name":"Teresa","orcid":"0000-0002-1780-2689"}],"related_material":{"record":[{"id":"10828","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"11440"},{"status":"public","relation":"part_of_dissertation","id":"18673"},{"relation":"part_of_dissertation","id":"9345","status":"public"}]},"degree_awarded":"PhD","date_updated":"2026-04-07T12:54:10Z"}]