[{"article_type":"original","abstract":[{"text":"We investigate superradiant enhancements in the refrigeration performance of a set of N three-level systems that are collectively coupled to a hot and a cold thermal reservoir and are additionally subject to collective periodic (circular) driving. Assuming the system-reservoir coupling to be weak, we explore the regime of stronger periodic driving strengths by comparing collective weak driving, Floquet-Lindblad, and Floquet-Redfield master equations. We identify regimes where the power injected by the periodic driving is used to pump heat from the cold to the hot reservoir and derive analytic sufficient conditions for them based on a cycle analysis of the Floquet-Lindblad master equation. In those regimes, we also argue for which parameters collective enhancements like a quadratic scaling of the cooling current with N can be expected and support our arguments by numerical simulations.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2310.18126"}],"volume":21,"oa_version":"Preprint","day":"26","external_id":{"isi":["001226579400001"],"arxiv":["2310.18126"]},"quality_controlled":"1","month":"04","department":[{"_id":"GradSch"}],"date_updated":"2025-09-04T13:51:06Z","isi":1,"article_number":"044050","title":"Floquet analysis of a superradiant many-qutrit refrigerator","citation":{"ista":"Kolisnyk D, Queißer F, Schaller G, Schützhold R. 2024. Floquet analysis of a superradiant many-qutrit refrigerator. Physical Review Applied. 21(4), 044050.","mla":"Kolisnyk, Dmytro, et al. “Floquet Analysis of a Superradiant Many-Qutrit Refrigerator.” Physical Review Applied, vol. 21, no. 4, 044050, American Physical Society, 2024, doi:10.1103/PhysRevApplied.21.044050.","ieee":"D. Kolisnyk, F. Queißer, G. Schaller, and R. Schützhold, “Floquet analysis of a superradiant many-qutrit refrigerator,” Physical Review Applied, vol. 21, no. 4. American Physical Society, 2024.","apa":"Kolisnyk, D., Queißer, F., Schaller, G., & Schützhold, R. (2024). Floquet analysis of a superradiant many-qutrit refrigerator. Physical Review Applied. American Physical Society. https://doi.org/10.1103/PhysRevApplied.21.044050","short":"D. Kolisnyk, F. Queißer, G. Schaller, R. Schützhold, Physical Review Applied 21 (2024).","chicago":"Kolisnyk, Dmytro, Friedemann Queißer, Gernot Schaller, and Ralf Schützhold. “Floquet Analysis of a Superradiant Many-Qutrit Refrigerator.” Physical Review Applied. American Physical Society, 2024. https://doi.org/10.1103/PhysRevApplied.21.044050.","ama":"Kolisnyk D, Queißer F, Schaller G, Schützhold R. Floquet analysis of a superradiant many-qutrit refrigerator. Physical Review Applied. 2024;21(4). doi:10.1103/PhysRevApplied.21.044050"},"date_published":"2024-04-26T00:00:00Z","year":"2024","doi":"10.1103/PhysRevApplied.21.044050","article_processing_charge":"No","publication_identifier":{"eissn":["2331-7019"]},"publisher":"American Physical Society","publication_status":"published","intvolume":" 21","date_created":"2024-05-05T22:01:04Z","scopus_import":"1","status":"public","language":[{"iso":"eng"}],"publication":"Physical Review Applied","issue":"4","type":"journal_article","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"full_name":"Kolisnyk, Dmytro","id":"530a7320-5355-11ee-ae5a-82a46997aaa7","last_name":"Kolisnyk","first_name":"Dmytro"},{"first_name":"Friedemann","last_name":"Queißer","full_name":"Queißer, Friedemann"},{"full_name":"Schaller, Gernot","last_name":"Schaller","first_name":"Gernot"},{"first_name":"Ralf","last_name":"Schützhold","full_name":"Schützhold, Ralf"}],"acknowledgement":"Financial support by the DFG (project ID 278162697 – SFB 1242) is gratefully acknowledged.\r\n","oa":1,"arxiv":1,"_id":"15360"},{"publication":"PRX Quantum","language":[{"iso":"eng"}],"has_accepted_license":"1","date_created":"2024-05-19T22:01:13Z","status":"public","scopus_import":"1","intvolume":" 5","ddc":["530"],"file":[{"file_name":"2024_PRXQuantum_Finzgar.pdf","date_updated":"2024-05-21T09:35:14Z","content_type":"application/pdf","file_id":"15409","creator":"dernst","date_created":"2024-05-21T09:35:14Z","checksum":"76bdf0b4dc06d59d073a57bd6957a96c","access_level":"open_access","success":1,"relation":"main_file","file_size":2016085}],"DOAJ_listed":"1","arxiv":1,"_id":"15407","OA_place":"publisher","oa":1,"acknowledgement":"J.R.F. and A.K. thank Libor Caha and Alexander Kliesch for insightful discussions. The authors thank Lilly Palackal, Maximilian Passek, Carlos Riofrío, and Gili Rosenberg for thorough reviews of the manuscript, and the Amazon Braket, BMW, and QuEra teams for their support. C.M. thanks the Munich Quantum Valley initiative, which is supported by the Bavarian State Government with funds from the Hightech Agenda Bayern Plus. H.G.K. would like to thank Am Platzl 1A for providing the necessary environment for creative thinking. An open-source implementation of QIRO is available online [60].","author":[{"first_name":"Jernej Rudi","last_name":"Finžgar","full_name":"Finžgar, Jernej Rudi"},{"first_name":"Aron","full_name":"Kerschbaumer, Aron","id":"ade85a9c-3200-11ee-973b-91c1eb240410","last_name":"Kerschbaumer"},{"full_name":"Schuetz, Martin J.A.","last_name":"Schuetz","first_name":"Martin J.A."},{"first_name":"Christian B.","last_name":"Mendl","full_name":"Mendl, Christian B."},{"first_name":"Helmut G.","full_name":"Katzgraber, Helmut G.","last_name":"Katzgraber"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","corr_author":"1","issue":"2","file_date_updated":"2024-05-21T09:35:14Z","external_id":{"arxiv":["2308.13607"]},"quality_controlled":"1","volume":5,"oa_version":"Published Version","day":"01","OA_type":"gold","article_type":"original","abstract":[{"lang":"eng","text":"We propose and implement a family of quantum-informed recursive optimization (QIRO) algorithms for combinatorial optimization problems. Our approach leverages quantum resources to obtain information that is used in problem-specific classical reduction steps that recursively simplify the problem. These reduction steps address the limitations of the quantum component (e.g., locality) and ensure solution feasibility in constrained optimization problems. Additionally, we use backtracking techniques to further improve the performance of the algorithm without increasing the requirements on the quantum hardware. We showcase the capabilities of our approach by informing QIRO with correlations from classical simulations of shallow circuits of the quantum approximate optimization algorithm, solving instances of maximum independent set and maximum satisfiability problems with hundreds of variables. We also demonstrate how QIRO can be deployed on a neutral atom quantum processor to find large independent sets of graphs. In summary, our scheme achieves results comparable to classical heuristics even with relatively weak quantum resources. Furthermore, enhancing the quality of these quantum resources improves the performance of the algorithms. Notably, the modular nature of QIRO offers various avenues for modifications, positioning our work as a template for a broader class of hybrid quantum-classical algorithms for combinatorial optimization."}],"publisher":"American Physical Society","article_processing_charge":"Yes","publication_identifier":{"eissn":["2691-3399"]},"doi":"10.1103/PRXQuantum.5.020327","publication_status":"published","year":"2024","date_published":"2024-05-01T00:00:00Z","citation":{"apa":"Finžgar, J. R., Kerschbaumer, A., Schuetz, M. J. A., Mendl, C. B., & Katzgraber, H. G. (2024). Quantum-informed recursive optimization algorithms. PRX Quantum. American Physical Society. https://doi.org/10.1103/PRXQuantum.5.020327","short":"J.R. Finžgar, A. Kerschbaumer, M.J.A. Schuetz, C.B. Mendl, H.G. Katzgraber, PRX Quantum 5 (2024).","chicago":"Finžgar, Jernej Rudi, Aron Kerschbaumer, Martin J.A. Schuetz, Christian B. Mendl, and Helmut G. Katzgraber. “Quantum-Informed Recursive Optimization Algorithms.” PRX Quantum. American Physical Society, 2024. https://doi.org/10.1103/PRXQuantum.5.020327.","ama":"Finžgar JR, Kerschbaumer A, Schuetz MJA, Mendl CB, Katzgraber HG. Quantum-informed recursive optimization algorithms. PRX Quantum. 2024;5(2). doi:10.1103/PRXQuantum.5.020327","ista":"Finžgar JR, Kerschbaumer A, Schuetz MJA, Mendl CB, Katzgraber HG. 2024. Quantum-informed recursive optimization algorithms. PRX Quantum. 5(2), 020327.","mla":"Finžgar, Jernej Rudi, et al. “Quantum-Informed Recursive Optimization Algorithms.” PRX Quantum, vol. 5, no. 2, 020327, American Physical Society, 2024, doi:10.1103/PRXQuantum.5.020327.","ieee":"J. R. Finžgar, A. Kerschbaumer, M. J. A. Schuetz, C. B. Mendl, and H. G. Katzgraber, “Quantum-informed recursive optimization algorithms,” PRX Quantum, vol. 5, no. 2. American Physical Society, 2024."},"article_number":"020327","title":"Quantum-informed recursive optimization algorithms","date_updated":"2025-05-14T09:29:40Z","department":[{"_id":"GradSch"}],"month":"05","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"}},{"date_updated":"2024-06-17T10:45:32Z","month":"06","department":[{"_id":"GradSch"}],"title":"Majority dynamics and internal partitions of random regular graphs: Experimental results","author":[{"first_name":"Pavel","last_name":"Arkhipov","id":"b25f2ab2-1fed-11ee-8599-fe02d211784f","full_name":"Arkhipov, Pavel"}],"article_number":"2406.07026","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"I am grateful to Matthew Kwan for setting the problem, providing useful literature,\r\nfruitful discussions, text review, mentorship, general encouragement and support.","type":"preprint","year":"2024","oa":1,"date_published":"2024-06-11T00:00:00Z","citation":{"ama":"Arkhipov P. Majority dynamics and internal partitions of random regular graphs: Experimental results. arXiv. doi:10.48550/arXiv.2406.07026","chicago":"Arkhipov, Pavel. “Majority Dynamics and Internal Partitions of Random Regular Graphs: Experimental Results.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2406.07026.","short":"P. Arkhipov, ArXiv (n.d.).","apa":"Arkhipov, P. (n.d.). Majority dynamics and internal partitions of random regular graphs: Experimental results. arXiv. https://doi.org/10.48550/arXiv.2406.07026","ieee":"P. Arkhipov, “Majority dynamics and internal partitions of random regular graphs: Experimental results,” arXiv. .","mla":"Arkhipov, Pavel. “Majority Dynamics and Internal Partitions of Random Regular Graphs: Experimental Results.” ArXiv, 2406.07026, doi:10.48550/arXiv.2406.07026.","ista":"Arkhipov P. Majority dynamics and internal partitions of random regular graphs: Experimental results. arXiv, 2406.07026."},"_id":"17136","publication_status":"submitted","article_processing_charge":"No","doi":"10.48550/arXiv.2406.07026","arxiv":1,"abstract":[{"text":"This paper focuses on Majority Dynamics in sparse graphs, in particular, as a\r\ntool to study internal cuts. It is known that, in Majority Dynamics on a finite\r\ngraph, each vertex eventually either comes to a fixed state, or oscillates with\r\nperiod two. The empirical evidence acquired by simulations suggests that for\r\nrandom odd-regular graphs, approximately half of the vertices end up\r\noscillating with high probability. We notice a local symmetry between\r\noscillating and non-oscillating vertices, that potentially can explain why the\r\nfraction of the oscillating vertices is concentrated around $\\frac{1}{2}$. In\r\nour simulations, we observe that the parts of random odd-regular graph under\r\nMajority Dynamics with high probability do not contain $\\lceil \\frac{d}{2}\r\n\\rceil$-cores at any timestep, and thus, one cannot use Majority Dynamics to\r\nprove that internal cuts exist in odd-regular graphs almost surely. However, we\r\nsuggest a modification of Majority Dynamics, that yields parts with desired\r\ncores with high probability.","lang":"eng"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2406.07026","open_access":"1"}],"oa_version":"Preprint","day":"11","status":"public","date_created":"2024-06-12T07:01:52Z","external_id":{"arxiv":["2406.07026"]},"publication":"arXiv","language":[{"iso":"eng"}]},{"citation":{"ieee":"Z. Zhang, H. Chen, S. Peng, and H. Han, “Slow and rapid auxin responses in Arabidopsis,” Journal of Experimental Botany, vol. 75, no. 18. Oxford University Press, 2024.","mla":"Zhang, Zilin, et al. “Slow and Rapid Auxin Responses in Arabidopsis.” Journal of Experimental Botany, vol. 75, no. 18, erae246, Oxford University Press, 2024, doi:10.1093/jxb/erae246.","ista":"Zhang Z, Chen H, Peng S, Han H. 2024. Slow and rapid auxin responses in Arabidopsis. Journal of Experimental Botany. 75(18), erae246.","ama":"Zhang Z, Chen H, Peng S, Han H. Slow and rapid auxin responses in Arabidopsis. Journal of Experimental Botany. 2024;75(18). doi:10.1093/jxb/erae246","chicago":"Zhang, Zilin, Huihuang Chen, Shuaiying Peng, and Huibin Han. “Slow and Rapid Auxin Responses in Arabidopsis.” Journal of Experimental Botany. Oxford University Press, 2024. https://doi.org/10.1093/jxb/erae246.","short":"Z. Zhang, H. Chen, S. Peng, H. Han, Journal of Experimental Botany 75 (2024).","apa":"Zhang, Z., Chen, H., Peng, S., & Han, H. (2024). Slow and rapid auxin responses in Arabidopsis. Journal of Experimental Botany. Oxford University Press. https://doi.org/10.1093/jxb/erae246"},"year":"2024","date_published":"2024-09-27T00:00:00Z","doi":"10.1093/jxb/erae246","article_processing_charge":"No","publisher":"Oxford University Press","publication_identifier":{"issn":["0022-0957"]},"publication_status":"published","month":"09","department":[{"_id":"GradSch"},{"_id":"JiFr"}],"date_updated":"2025-09-08T07:57:50Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_number":"erae246","isi":1,"title":"Slow and rapid auxin responses in Arabidopsis","oa_version":"Published Version","day":"27","volume":75,"external_id":{"isi":["001270051200001"],"pmid":["38794966"]},"quality_controlled":"1","article_type":"original","abstract":[{"text":"The TIR1/AFB–Aux/IAA–ARF canonical auxin signaling pathway is widely accepted to (de)active transcriptional regulation, thus controlling auxin-associated developmental processes. However, the theme of a rapid auxin response has emerged since the 2018 Auxins and Cytokinin in Plant Development conference. To date, a few signaling components have been identified to mediate both slow and rapid auxin responses, which unveils the complexity of auxin signaling.","lang":"eng"}],"OA_type":"hybrid","oa":1,"OA_place":"publisher","_id":"17141","issue":"18","file_date_updated":"2025-01-02T10:26:22Z","type":"journal_article","author":[{"last_name":"Zhang","full_name":"Zhang, Zilin","first_name":"Zilin"},{"first_name":"Huihuang","last_name":"Chen","id":"83c96512-15b2-11ec-abd3-b7eede36184f","full_name":"Chen, Huihuang"},{"last_name":"Peng","full_name":"Peng, Shuaiying","first_name":"Shuaiying"},{"last_name":"Han","full_name":"Han, Huibin","first_name":"Huibin"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","acknowledgement":"We thank other lab members for their critical comments on this manuscript. We also thank the editor and reviewers for their constructive comments to improve our manuscript. We apologize to authors whose important work we could not include due to space limitations.\r\nThis work is supported by funding from Jiangxi Agricultural University (9232308314) and the Science and Technology Department of Jiangxi Province (20223BCJ25037) to HBH, and the Science and Technology Department of Jiangxi Province (20202ACB215002) to SYP.","scopus_import":"1","status":"public","date_created":"2024-06-15T19:50:15Z","language":[{"iso":"eng"}],"publication":"Journal of Experimental Botany","has_accepted_license":"1","ddc":["580"],"file":[{"creator":"dernst","file_id":"18720","date_updated":"2025-01-02T10:26:22Z","file_name":"2024_JourExperimentalBotany_Zhang.pdf","content_type":"application/pdf","success":1,"access_level":"open_access","file_size":763097,"relation":"main_file","date_created":"2025-01-02T10:26:22Z","checksum":"91b9435ed0f6640809c7588df19abf2f"}],"pmid":1,"intvolume":" 75"},{"status":"public","date_created":"2024-06-25T11:45:58Z","scopus_import":"1","has_accepted_license":"1","publication":"40th International Symposium on Computational Geometry","language":[{"iso":"eng"}],"file":[{"date_created":"2024-06-25T11:47:26Z","checksum":"6a2ddc8b51aa58f197a8b294750f1f8d","access_level":"open_access","success":1,"file_size":20886142,"relation":"main_file","date_updated":"2024-06-25T11:47:26Z","file_name":"LIPIcs.SoCG.2024.11.pdf","content_type":"application/pdf","file_id":"17171","creator":"cfillmor"}],"ddc":["516"],"page":"11:1-11:19","intvolume":" 293","oa":1,"_id":"17170","arxiv":1,"file_date_updated":"2024-06-25T11:47:26Z","acknowledgement":"This research has been supported by the European Research Council (ERC), grant No. 788183, by the Wittgenstein Prize, Austrian Science Fund (FWF), grant No. Z 342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant No. I 02979-N35.\r\nWintraecken, Mathijs: Supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411, the Austrian science fund (FWF) grant No. M-3073, and the welcome package from IDEX of the Université Côte d'Azur.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Dominique","last_name":"Attali","full_name":"Attali, Dominique"},{"first_name":"Hana","orcid":"0000-0001-7841-0091","last_name":"Kourimska","full_name":"Kourimska, Hana","id":"D9B8E14C-3C26-11EA-98F5-1F833DDC885E"},{"full_name":"Fillmore, Christopher D","id":"35638A5C-AAC7-11E9-B0BF-5503E6697425","last_name":"Fillmore","first_name":"Christopher D"},{"last_name":"Ghosh","id":"ee449b28-344d-11ef-a6d5-9ca430e9e9ff","full_name":"Ghosh, Ishika","first_name":"Ishika"},{"full_name":"Lieutier, André","last_name":"Lieutier","first_name":"André"},{"last_name":"Stephenson","id":"2D04F932-F248-11E8-B48F-1D18A9856A87","full_name":"Stephenson, Elizabeth R","first_name":"Elizabeth R","orcid":"0000-0002-6862-208X"},{"first_name":"Mathijs","orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken"}],"type":"conference","oa_version":"Published Version","day":"06","volume":293,"ec_funded":1,"external_id":{"arxiv":["2206.10485"]},"quality_controlled":"1","project":[{"grant_number":"788183","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"grant_number":"Z00342","call_identifier":"FWF","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425"},{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I02979-N35"},{"grant_number":"M03073","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2","name":"Learning and triangulating manifolds via collapses"}],"alternative_title":["LIPIcs"],"abstract":[{"text":"In this article we extend and strengthen the seminal work by Niyogi, Smale, and Weinberger on the learning of the homotopy type from a sample of an underlying space. In their work, Niyogi, Smale, and Weinberger studied samples of C² manifolds with positive reach embedded in ℝ^d. We extend their results in the following ways: - As the ambient space we consider both ℝ^d and Riemannian manifolds with lower bounded sectional curvature. - In both types of ambient spaces, we study sets of positive reach - a significantly more general setting than C² manifolds - as well as general manifolds of positive reach. - The sample P of a set (or a manifold) 𝒮 of positive reach may be noisy. We work with two one-sided Hausdorff distances - ε and δ - between P and 𝒮. We provide tight bounds in terms of ε and δ, that guarantee that there exists a parameter r such that the union of balls of radius r centred at the sample P deformation-retracts to 𝒮. We exhibit their tightness by an explicit construction. We carefully distinguish the roles of δ and ε. This is not only essential to achieve tight bounds, but also sensible in practical situations, since it allows one to adapt the bound according to sample density and the amount of noise present in the sample separately.","lang":"eng"}],"conference":{"location":"Athens, Greece","start_date":"2024-06-11","name":"SoCG: Symposium on Computational Geometry","end_date":"2024-06-14"},"year":"2024","date_published":"2024-06-06T00:00:00Z","citation":{"chicago":"Attali, Dominique, Hana Kourimska, Christopher D Fillmore, Ishika Ghosh, André Lieutier, Elizabeth R Stephenson, and Mathijs Wintraecken. “Tight Bounds for the Learning of Homotopy à La Niyogi, Smale, and Weinberger for Subsets of Euclidean Spaces and of Riemannian Manifolds.” In 40th International Symposium on Computational Geometry, 293:11:1-11:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.SoCG.2024.11.","ama":"Attali D, Kourimska H, Fillmore CD, et al. Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds. In: 40th International Symposium on Computational Geometry. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024:11:1-11:19. doi:10.4230/LIPIcs.SoCG.2024.11","apa":"Attali, D., Kourimska, H., Fillmore, C. D., Ghosh, I., Lieutier, A., Stephenson, E. R., & Wintraecken, M. (2024). Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds. In 40th International Symposium on Computational Geometry (Vol. 293, p. 11:1-11:19). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2024.11","short":"D. Attali, H. Kourimska, C.D. Fillmore, I. Ghosh, A. Lieutier, E.R. Stephenson, M. Wintraecken, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 11:1-11:19.","mla":"Attali, Dominique, et al. “Tight Bounds for the Learning of Homotopy à La Niyogi, Smale, and Weinberger for Subsets of Euclidean Spaces and of Riemannian Manifolds.” 40th International Symposium on Computational Geometry, vol. 293, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 11:1-11:19, doi:10.4230/LIPIcs.SoCG.2024.11.","ieee":"D. Attali et al., “Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds,” in 40th International Symposium on Computational Geometry, Athens, Greece, 2024, vol. 293, p. 11:1-11:19.","ista":"Attali D, Kourimska H, Fillmore CD, Ghosh I, Lieutier A, Stephenson ER, Wintraecken M. 2024. Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 293, 11:1-11:19."},"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","article_processing_charge":"No","publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959773164"]},"doi":"10.4230/LIPIcs.SoCG.2024.11","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_updated":"2025-04-15T07:16:57Z","month":"06","department":[{"_id":"GradSch"},{"_id":"HeEd"}],"title":"Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds"},{"has_accepted_license":"1","language":[{"iso":"eng"}],"publication":"Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers '24","keyword":["physical simulation","frictional contact","rigid body mechanics","non-smooth dynamics"],"date_created":"2024-07-10T11:06:20Z","scopus_import":"1","status":"public","file":[{"file_name":"sig24_friction_authors.pdf","date_updated":"2024-07-10T11:03:14Z","content_type":"application/pdf","creator":"yichen","file_id":"17215","date_created":"2024-07-10T11:03:14Z","checksum":"b8b203ed09e3995ba0d7e6a76288663a","success":1,"access_level":"open_access","relation":"main_file","file_size":47309472},{"creator":"yichen","file_id":"17216","content_type":"application/pdf","file_name":"sig24_friction_supplementary.pdf","date_updated":"2024-07-10T11:03:12Z","file_size":10518286,"relation":"main_file","success":1,"access_level":"open_access","checksum":"89d81b397b4b6469d828808a68b70820","date_created":"2024-07-10T11:03:12Z"},{"file_id":"17217","creator":"yichen","content_type":"video/mp4","file_name":"friction_paper_extra_video_finished.mp4","date_updated":"2024-07-10T11:03:51Z","file_size":71789192,"relation":"main_file","access_level":"open_access","success":1,"checksum":"7123deed34a5456810e7b5336a31c657","date_created":"2024-07-10T11:03:51Z"},{"date_created":"2024-07-10T11:03:58Z","checksum":"e606fc1ae8f2610ce3b4421566800b45","success":1,"access_level":"open_access","relation":"main_file","file_size":280610763,"file_name":"friction_paper_video_finished.mp4","date_updated":"2024-07-10T11:03:58Z","content_type":"video/mp4","file_id":"17218","creator":"yichen"}],"ddc":["621","531","006"],"_id":"17214","oa":1,"type":"conference","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).","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"id":"0b467602-dbcd-11ea-9d1d-ed480aa46b70","full_name":"Chen, Yi-Lu","last_name":"Chen","first_name":"Yi-Lu"},{"first_name":"Mickaël","id":"6340d7f0-b48d-11eb-b10d-b7487e71d9f1","full_name":"Ly, Mickaël","last_name":"Ly"},{"orcid":"0000-0001-6646-5546","first_name":"Christopher J","full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","last_name":"Wojtan"}],"file_date_updated":"2024-07-10T11:03:58Z","corr_author":"1","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":{"isi":["001282218200091"]},"quality_controlled":"1","day":"01","oa_version":"Published Version","conference":{"start_date":"2024-07-28","location":"Denver, United States","name":"SIGGRAPH: Computer Graphics and Interactive Techniques Conference","end_date":"2024-08-01"},"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"}],"publication_status":"published","doi":"10.1145/3641519.3657485","publication_identifier":{"isbn":["9798400705250"]},"article_processing_charge":"Yes (via OA deal)","publisher":"Association for Computing Machinery","citation":{"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.","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","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","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.","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.","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.","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."},"year":"2024","date_published":"2024-07-01T00:00:00Z","title":"Primal-dual non-smooth friction for rigid body animation","isi":1,"month":"07","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"date_updated":"2025-09-08T08:54:38Z"},{"department":[{"_id":"BiCh"},{"_id":"GradSch"}],"month":"07","date_updated":"2025-09-08T08:26:09Z","title":"Integrating molecular dynamics simulations and experimental data for azeotrope predictions in binary mixtures","article_number":"034111","isi":1,"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.","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.","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.","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","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.","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"},"year":"2024","date_published":"2024-07-14T00:00:00Z","publication_status":"published","doi":"10.1063/5.0217232","article_processing_charge":"No","publication_identifier":{"issn":["0021-9606"],"eissn":["1089-7690"]},"publisher":"AIP Publishing","abstract":[{"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.","lang":"eng"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2405.02216","open_access":"1"}],"article_type":"original","day":"14","volume":161,"oa_version":"Preprint","quality_controlled":"1","external_id":{"arxiv":["2405.02216"],"isi":["001281819100016"],"pmid":["39007379"]},"issue":"3","corr_author":"1","type":"journal_article","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).","author":[{"full_name":"Wang, Xiaoyu","id":"8dff9c62-32b0-11ee-9fa8-fc73025e10f3","last_name":"Wang","first_name":"Xiaoyu"},{"last_name":"Cheng","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","full_name":"Cheng, Bingqing","first_name":"Bingqing","orcid":"0000-0002-3584-9632"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"related_material":{"link":[{"url":"https://github.com/Xiaoyu-Wang-Stone/Azeotrope_S0","relation":"software"}]},"_id":"17278","arxiv":1,"pmid":1,"intvolume":" 161","date_created":"2024-07-21T22:01:00Z","status":"public","scopus_import":"1","language":[{"iso":"eng"}],"publication":"Journal of Chemical Physics"},{"article_number":"232","title":"Equivalence and similarity refutation for probabilistic programs","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"month":"06","date_updated":"2025-04-14T07:52:47Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"doi":"10.1145/3656462","publisher":"Association for Computing Machinery","article_processing_charge":"Yes (via OA deal)","publication_identifier":{"eissn":["2475-1421"]},"publication_status":"published","citation":{"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.","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.","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.","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","short":"K. Chatterjee, E. Goharshady, P. Novotný, D. Zikelic, Proceedings of the ACM on Programming Languages 8 (2024).","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.","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"},"year":"2024","date_published":"2024-06-20T00:00:00Z","OA_type":"hybrid","article_type":"original","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"}],"project":[{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"}],"quality_controlled":"1","external_id":{"arxiv":["2404.03430"]},"ec_funded":1,"day":"20","oa_version":"Published Version","volume":8,"type":"journal_article","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"last_name":"Kafshdar Goharshadi","full_name":"Kafshdar Goharshadi, Ehsan","id":"103b4fa0-896a-11ed-bdf8-87b697bef40d","orcid":"0000-0002-8595-0587","first_name":"Ehsan"},{"last_name":"Novotný","full_name":"Novotný, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr"},{"first_name":"Dorde","orcid":"0000-0002-4681-1699","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde"}],"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","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","file_date_updated":"2024-07-22T07:17:14Z","arxiv":1,"OA_place":"publisher","_id":"17283","oa":1,"intvolume":" 8","ddc":["000"],"file":[{"file_id":"17290","creator":"dernst","content_type":"application/pdf","file_name":"2024_ACMProgLang_Chatterjee.pdf","date_updated":"2024-07-22T07:17:14Z","relation":"main_file","file_size":355421,"access_level":"open_access","success":1,"checksum":"8cbf220f284a4a87d093db5320c5afdd","date_created":"2024-07-22T07:17:14Z"}],"language":[{"iso":"eng"}],"publication":"Proceedings of the ACM on Programming Languages","has_accepted_license":"1","scopus_import":"1","date_created":"2024-07-21T22:01:01Z","status":"public"},{"ddc":["576"],"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. "}],"file":[{"file_name":"Submission.nb","date_updated":"2024-07-29T13:51:11Z","content_type":"application/octet-stream","creator":"psurendr","file_id":"17345","date_created":"2024-07-29T13:51:11Z","checksum":"75bdbc7ad7cc6afe4459bc4a8824a302","success":1,"access_level":"open_access","file_size":726132,"relation":"main_file"}],"date_created":"2024-07-29T14:01:43Z","status":"public","oa_version":"Published Version","acknowledged_ssus":[{"_id":"ScienComp"}],"has_accepted_license":"1","department":[{"_id":"GradSch"},{"_id":"NiBa"}],"month":"07","date_updated":"2025-01-14T13:02:59Z","file_date_updated":"2024-07-29T13:51:11Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"research_data","author":[{"id":"455235B8-F248-11E8-B48F-1D18A9856A87","full_name":"Surendranadh, Parvathy","last_name":"Surendranadh","orcid":"0000-0001-6395-386X","first_name":"Parvathy"},{"last_name":"Sachdeva","full_name":"Sachdeva, Himani","first_name":"Himani"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Mathematica notebook for 'Effect of assortative mating and sexual selection on polygenic barriers to gene flow'","citation":{"short":"P. Surendranadh, H. Sachdeva, (2024).","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","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.","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.","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."},"date_published":"2024-07-01T00:00:00Z","year":"2024","oa":1,"doi":"10.15479/AT:ISTA:17344","publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","_id":"17344"},{"has_accepted_license":"1","project":[{"grant_number":"429960716","_id":"9B767A34-BA93-11EA-9121-9846C619BF3A","name":"Evolution of Sensorimotor Transformation Across Diptera"}],"acknowledged_ssus":[{"_id":"M-Shop"}],"oa_version":"None","date_created":"2024-09-03T17:42:46Z","keyword":["drosophila","behaviour","locomotion","gap junctions"],"status":"public","file":[{"date_created":"2024-09-03T17:39:32Z","checksum":"df9d6c8ddffa046c3b1639281f83cfcf","access_level":"open_access","success":1,"relation":"main_file","file_size":965778072,"file_name":"BehaviouralData.zip","date_updated":"2024-09-03T17:39:32Z","content_type":"application/x-zip-compressed","creator":"rsatapat","file_id":"17489"}],"abstract":[{"lang":"eng","text":"Behavioural data for Pokusaeva, Satapathy et al. Relevant information can be found in the 'README.txt' file."}],"ddc":["570"],"_id":"17488","publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","doi":"10.15479/AT:ISTA:17488","date_published":"2024-09-01T00:00:00Z","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"18444"}]},"oa":1,"year":"2024","citation":{"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.","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.","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.","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","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","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."},"title":"Bilateral interactions of optic-flow sensitive neurons coordinate course control in flies","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0009-0006-2974-5075","first_name":"Roshan K","full_name":"Satapathy, Roshan K","id":"46046B7A-F248-11E8-B48F-1D18A9856A87","last_name":"Satapathy"},{"orcid":"0000-0002-3937-1330","first_name":"Maximilian A","last_name":"Jösch","id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","full_name":"Jösch, Maximilian A"},{"id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87","full_name":"Symonova, Olga","last_name":"Symonova","orcid":"0000-0003-2012-9947","first_name":"Olga"},{"full_name":"Pokusaeva, Victoria","id":"3184041C-F248-11E8-B48F-1D18A9856A87","last_name":"Pokusaeva","orcid":"0000-0001-7660-444X","first_name":"Victoria"}],"type":"research_data","file_date_updated":"2024-09-03T17:39:32Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"corr_author":"1","date_updated":"2025-09-08T14:24:24Z","month":"09","department":[{"_id":"GradSch"},{"_id":"MaJö"}]},{"corr_author":"1","type":"preprint","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"full_name":"Dvorak, Martin","id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425","last_name":"Dvorak","orcid":"0000-0001-5293-214X","first_name":"Martin"},{"first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"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.","oa":1,"related_material":{"record":[{"relation":"dissertation_contains","id":"21393","status":"public"}],"link":[{"relation":"software","description":"full version of all definitions, statement, and proofs","url":"https://github.com/madvorak/duality/tree/v3.2"}]},"arxiv":1,"OA_place":"repository","_id":"20071","date_created":"2025-07-23T11:21:52Z","status":"public","keyword":["Farkas lemma","linear programming","extended reals","calculus of inductive constructions"],"language":[{"iso":"eng"}],"publication":"arXiv","department":[{"_id":"GradSch"},{"_id":"VlKo"}],"month":"09","date_updated":"2026-03-27T12:36:59Z","article_number":"2409.08119","title":"Duality theory in linear optimization and its extensions -- formally verified","citation":{"short":"M. Dvorak, V. Kolmogorov, ArXiv (n.d.).","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","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.","ista":"Dvorak M, Kolmogorov V. Duality theory in linear optimization and its extensions -- formally verified. arXiv, 2409.08119.","ieee":"M. Dvorak and V. Kolmogorov, “Duality theory in linear optimization and its extensions -- formally verified,” arXiv. .","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."},"year":"2024","date_published":"2024-09-12T00:00:00Z","doi":"10.48550/arXiv.2409.08119","article_processing_charge":"No","publication_status":"draft","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"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2409.08119"}],"OA_type":"green","day":"12","oa_version":"Preprint","external_id":{"arxiv":["2409.08119"]}},{"oa_version":"Preprint","day":"01","quality_controlled":"1","external_id":{"isi":["001344387500055"],"arxiv":["2311.16833"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2311.16833"}],"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"}],"conference":{"name":"CVPR: Conference on Computer Vision and Pattern Recognition","end_date":"2024-06-22","location":"Seattle, WA, United States","start_date":"2024-06-16"},"OA_type":"green","date_published":"2024-06-01T00:00:00Z","year":"2024","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.","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.","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.","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.","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","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."},"publication_status":"published","article_processing_charge":"No","publisher":"Computer Vision Foundation","doi":"10.1109/CVPR52733.2024.02320","date_updated":"2026-04-07T11:49:51Z","month":"06","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"title":"1-Lipschitz layers compared: Memory, speed, and certifiable robustness","isi":1,"date_created":"2024-08-14T08:42:32Z","status":"public","has_accepted_license":"1","publication":"Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition","language":[{"iso":"eng"}],"page":"24574-24583","related_material":{"link":[{"url":"https://github.com/berndprach/1LipschitzLayersCompared","relation":"software"}],"record":[{"relation":"dissertation_contains","status":"public","id":"19759"}]},"oa":1,"_id":"17426","OA_place":"repository","arxiv":1,"corr_author":"1","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","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"id":"2D561D42-C427-11E9-89B4-9C1AE6697425","full_name":"Prach, Bernd","last_name":"Prach","first_name":"Bernd"},{"full_name":"Brau, Fabio","last_name":"Brau","first_name":"Fabio"},{"last_name":"Buttazzo","full_name":"Buttazzo, Giorgio","first_name":"Giorgio"},{"first_name":"Christoph","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert"}],"type":"conference"},{"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"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2412.04245"}],"day":"05","oa_version":"Preprint","date_created":"2025-01-24T16:57:29Z","status":"public","external_id":{"arxiv":["2412.04245"]},"publication":"arXiv","language":[{"iso":"eng"}],"date_updated":"2026-04-07T11:49:51Z","corr_author":"1","month":"12","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"title":"Intriguing properties of robust classification","author":[{"full_name":"Prach, Bernd","id":"2D561D42-C427-11E9-89B4-9C1AE6697425","last_name":"Prach","first_name":"Bernd"},{"first_name":"Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_number":"2412.04245","type":"preprint","related_material":{"record":[{"id":"20455","status":"public","relation":"later_version"},{"relation":"dissertation_contains","status":"public","id":"19759"}]},"oa":1,"date_published":"2024-12-05T00:00:00Z","year":"2024","citation":{"apa":"Prach, B., & Lampert, C. (n.d.). Intriguing properties of robust classification. arXiv. https://doi.org/10.48550/arXiv.2412.04245","short":"B. Prach, C. Lampert, ArXiv (n.d.).","chicago":"Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2412.04245.","ama":"Prach B, Lampert C. Intriguing properties of robust classification. arXiv. doi:10.48550/arXiv.2412.04245","ista":"Prach B, Lampert C. Intriguing properties of robust classification. arXiv, 2412.04245.","mla":"Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.” ArXiv, 2412.04245, doi:10.48550/arXiv.2412.04245.","ieee":"B. Prach and C. Lampert, “Intriguing properties of robust classification,” arXiv. ."},"_id":"18874","publication_status":"draft","OA_place":"repository","article_processing_charge":"No","arxiv":1,"doi":"10.48550/arXiv.2412.04245"},{"_id":"12846","OA_place":"repository","arxiv":1,"oa":1,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"20551"}]},"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.","author":[{"first_name":"Albert","last_name":"Chern","full_name":"Chern, Albert"},{"id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425","full_name":"Ishida, Sadashige","last_name":"Ishida","first_name":"Sadashige","orcid":"0000-0002-3121-3100"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","corr_author":"1","issue":"3","has_accepted_license":"1","publication":"SIAM Journal on Applied Algebra and Geometry","language":[{"iso":"eng"}],"scopus_import":"1","date_created":"2023-04-18T19:16:06Z","status":"public","page":"782-796","intvolume":" 8","ddc":["516"],"publication_status":"published","publisher":"Society for Industrial and Applied Mathematics","publication_identifier":{"eissn":["2470-6566"]},"article_processing_charge":"No","doi":"10.1137/23M1565255","year":"2024","date_published":"2024-09-23T00:00:00Z","citation":{"short":"A. Chern, S. Ishida, SIAM Journal on Applied Algebra and Geometry 8 (2024) 782–796.","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","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","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.","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.","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."},"title":"Area formula for spherical polygons via prequantization","isi":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_updated":"2026-04-07T12:02:22Z","month":"09","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"external_id":{"arxiv":["2303.14555"],"isi":["001342265800009"]},"quality_controlled":"1","project":[{"_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","grant_number":"101045083"}],"volume":8,"oa_version":"Preprint","day":"23","OA_type":"green","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2303.14555","open_access":"1"}],"abstract":[{"lang":"eng","text":"We present a formula for the signed area of a spherical polygon via prequantization. In contrast to the traditional formula based on the Gauss-Bonnet theorem that requires measuring angles, the new formula mimics Green's theorem and is applicable to a wider range of degenerate spherical curves and polygons."}],"article_type":"original"},{"month":"07","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"date_updated":"2026-04-07T12:02:23Z","title":"Symplectic structures on the space of space curves","type":"preprint","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","full_name":"Bauer, Martin","last_name":"Bauer"},{"last_name":"Ishida","id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425","full_name":"Ishida, Sadashige","orcid":"0000-0002-3121-3100","first_name":"Sadashige"},{"first_name":"Peter W.","last_name":"Michor","full_name":"Michor, Peter W."}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"ama":"Bauer M, Ishida S, Michor PW. Symplectic structures on the space of space curves. arXiv. doi:10.48550/arXiv.2407.19908","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.","short":"M. Bauer, S. Ishida, P.W. Michor, ArXiv (n.d.).","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","ieee":"M. Bauer, S. Ishida, and P. W. Michor, “Symplectic structures on the space of space curves,” arXiv. .","mla":"Bauer, Martin, et al. “Symplectic Structures on the Space of Space Curves.” ArXiv, doi: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."},"date_published":"2024-07-29T00:00:00Z","related_material":{"record":[{"status":"public","id":"20551","relation":"dissertation_contains"}]},"year":"2024","oa":1,"publication_status":"draft","OA_place":"repository","_id":"17361","arxiv":1,"doi":"10.48550/arXiv.2407.19908","article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2407.19908","open_access":"1"}],"abstract":[{"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.","lang":"eng"}],"day":"29","oa_version":"Preprint","date_created":"2024-08-01T06:34:08Z","keyword":["space of space curves","symplectic stuctures"],"status":"public","project":[{"grant_number":"101045083","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088"}],"external_id":{"arxiv":["2407.19908"]},"language":[{"iso":"eng"}],"publication":"arXiv"},{"scopus_import":"1","status":"public","date_created":"2024-09-05T14:27:08Z","APC_amount":"2748 EUR","has_accepted_license":"1","publication":"12th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation","language":[{"iso":"eng"}],"file":[{"checksum":"43e432f82be376434b358f3dd7a94b71","date_created":"2024-09-05T14:26:02Z","relation":"main_file","file_size":847422,"access_level":"open_access","success":1,"content_type":"application/pdf","date_updated":"2024-09-05T14:26:02Z","file_name":"isola24.pdf","file_id":"17635","creator":"esarac"},{"date_created":"2025-01-21T14:39:49Z","checksum":"6bc04f07bb5612c0e7ea00ac121a69b6","access_level":"open_access","success":1,"relation":"main_file","file_size":1358706,"file_name":"2024_LNCS_Chalupa.pdf","date_updated":"2025-01-21T14:39:49Z","content_type":"application/pdf","file_id":"18865","creator":"dernst"}],"ddc":["000"],"page":"3-20","intvolume":" 15222","related_material":{"record":[{"status":"public","id":"20147","relation":"dissertation_contains"}]},"oa":1,"_id":"17634","OA_place":"publisher","arxiv":1,"file_date_updated":"2025-01-21T14:39:49Z","corr_author":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"first_name":"Marek","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","full_name":"Chalupa, Marek","last_name":"Chalupa"},{"first_name":"Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"last_name":"Mazzocchi","id":"b26baa86-3308-11ec-87b0-8990f34baa85","full_name":"Mazzocchi, Nicolas Adrien","first_name":"Nicolas Adrien"},{"first_name":"Naci E","last_name":"Sarac","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","full_name":"Sarac, Naci E"}],"acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093. N. Mazzocchi was affiliated with ISTA when his collaboration started.","type":"conference","oa_version":"Published Version","volume":15222,"day":"26","ec_funded":1,"external_id":{"isi":["001419008700001"],"arxiv":["2409.03569"]},"quality_controlled":"1","project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software"}],"alternative_title":["LNCS"],"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"}],"conference":{"start_date":"2024-10-27","location":"Crete, Greece","end_date":"2024-10-31","name":"ISoLA: International Symposium on Leveraging Applications"},"OA_type":"hybrid","year":"2024","date_published":"2024-10-26T00:00:00Z","citation":{"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.","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.","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.","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.","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","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","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."},"publication_status":"published","article_processing_charge":"Yes (in subscription journal)","publisher":"Springer Nature","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783031753862"]},"doi":"10.1007/978-3-031-75387-9_1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_updated":"2026-04-07T12:02:57Z","month":"10","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"title":"QuAK: Quantitative Automata Kit","isi":1},{"type":"journal_article","author":[{"orcid":"0000-0002-0404-4356","first_name":"Rajesh B","last_name":"Jethwa","id":"4cc538d5-803f-11ed-ab7e-8139573aad8f","full_name":"Jethwa, Rajesh B"},{"first_name":"Soumyadip","last_name":"Mondal","id":"d25d21ef-dc8d-11ea-abe3-ec4576307f48","full_name":"Mondal, Soumyadip"},{"id":"50c64d4d-eb97-11eb-a6c2-d33e5e14f112","full_name":"Pant, Bhargavi","last_name":"Pant","first_name":"Bhargavi"},{"first_name":"Stefan Alexander","orcid":"0000-0003-2902-5319","full_name":"Freunberger, Stefan Alexander","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","last_name":"Freunberger"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","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.","issue":"28","corr_author":"1","file_date_updated":"2024-07-16T11:54:46Z","_id":"14687","related_material":{"record":[{"status":"public","id":"20607","relation":"dissertation_contains"}]},"oa":1,"pmid":1,"intvolume":" 63","ddc":["540"],"file":[{"creator":"dernst","file_id":"17261","content_type":"application/pdf","date_updated":"2024-07-16T11:54:46Z","file_name":"2024_AngChemieInt_Jethwa.pdf","file_size":4766445,"relation":"main_file","access_level":"open_access","success":1,"checksum":"fe2c23454279eb9d76ed6ca9970c21c7","date_created":"2024-07-16T11:54:46Z"}],"language":[{"iso":"eng"}],"publication":"Angewandte Chemie International Edition","has_accepted_license":"1","keyword":["General Chemistry","Catalysis"],"date_created":"2023-12-15T16:10:13Z","status":"public","scopus_import":"1","isi":1,"article_number":"e202316476","title":"To DISP or not? The far‐reaching reaction mechanisms underpinning Lithium‐air batteries","department":[{"_id":"StFr"},{"_id":"GradSch"}],"month":"07","date_updated":"2026-04-07T12:27:23Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"doi":"10.1002/anie.202316476","publication_identifier":{"eissn":["1521-3773"],"issn":["1433-7851"]},"publisher":"Wiley","article_processing_charge":"Yes (via OA deal)","publication_status":"published","citation":{"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.","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.","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","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.","short":"R.B. Jethwa, S. Mondal, B. Pant, S.A. Freunberger, Angewandte Chemie International Edition 63 (2024).","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"},"date_published":"2024-07-08T00:00:00Z","year":"2024","article_type":"review","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."}],"project":[{"call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413"}],"quality_controlled":"1","external_id":{"isi":["001241932700001"],"pmid":["38095355"]},"ec_funded":1,"oa_version":"Published Version","volume":63,"day":"08"},{"article_processing_charge":"No","publication_identifier":{"eissn":["1526-5471"],"issn":["0364-765X"]},"publisher":"Institute for Operations Research and the Management Sciences","doi":"10.1287/moor.2022.0332","publication_status":"published","year":"2024","date_published":"2024-10-01T00:00:00Z","citation":{"ista":"Chatterjee K, Oliu-Barton M, Saona Urmeneta RJ. 2024. Value-positivity for matrix games. Mathematics of Operations Research. 50(4), 2433–3282.","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.","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.","short":"K. Chatterjee, M. Oliu-Barton, R.J. Saona Urmeneta, Mathematics of Operations Research 50 (2024) 2433–3282.","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","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."},"isi":1,"title":"Value-positivity for matrix games","date_updated":"2026-04-07T12:31:21Z","month":"10","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"quality_controlled":"1","external_id":{"isi":["001328875900001"]},"project":[{"grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"ec_funded":1,"day":"01","volume":50,"oa_version":"None","OA_type":"closed access","article_type":"original","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."}],"_id":"18266","related_material":{"record":[{"status":"public","id":"20234","relation":"dissertation_contains"}]},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Miquel","full_name":"Oliu-Barton, Miquel","last_name":"Oliu-Barton"},{"orcid":"0000-0001-5103-038X","first_name":"Raimundo J","full_name":"Saona Urmeneta, Raimundo J","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","last_name":"Saona Urmeneta"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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].","type":"journal_article","corr_author":"1","issue":"4","publication":"Mathematics of Operations Research","language":[{"iso":"eng"}],"date_created":"2024-10-09T07:02:20Z","status":"public","scopus_import":"1","page":"2433-3282","intvolume":" 50"},{"OA_place":"publisher","_id":"18588","oa":1,"type":"dissertation","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.","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"first_name":"Cecelia N","last_name":"Mweka","full_name":"Mweka, Cecelia N","id":"2a69ab4b-896a-11ed-bdf8-cb8641cf2b21"}],"file_date_updated":"2024-12-13T11:30:53Z","corr_author":"1","acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"supervisor":[{"orcid":"0000-0002-2299-3176","first_name":"Scott R","full_name":"Waitukaitis, Scott R","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","last_name":"Waitukaitis"},{"last_name":"Palacci","id":"8fb92548-2b22-11eb-b7c1-a3f0d08d7c7d","full_name":"Palacci, Jérémie A","orcid":"0000-0002-7253-9465","first_name":"Jérémie A"}],"status":"public","date_created":"2024-11-27T09:12:02Z","page":"61","file":[{"content_type":"application/pdf","date_updated":"2024-11-28T12:50:32Z","file_name":"Cecelia Mweka Master Thesis.pdf","file_id":"18597","creator":"cmweka","checksum":"054ed7a5e5ae6e7220e6bb37ea57a3c3","date_created":"2024-11-28T12:50:32Z","file_size":3836671,"relation":"main_file","access_level":"open_access","success":1},{"file_id":"18598","creator":"cmweka","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_name":"Cecelia Mweka Master Thesis.docx","date_updated":"2024-12-13T11:30:53Z","file_size":7068210,"relation":"source_file","access_level":"closed","checksum":"7d7d9299f090d83e628d65d93116e8c2","date_created":"2024-11-28T12:51:43Z"}],"ddc":["530"],"publication_status":"published","degree_awarded":"MS","doi":"10.15479/at:ista:18588","publication_identifier":{"issn":["2791-4585"]},"publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","citation":{"ama":"Mweka CN. Non equilibrium dynamics of driven individual particles and 3D printing across scales. 2024. doi:10.15479/at:ista:18588","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.","short":"C.N. Mweka, Non Equilibrium Dynamics of Driven Individual Particles and 3D Printing across Scales, Institute of Science and Technology Austria, 2024.","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","ieee":"C. N. Mweka, “Non equilibrium dynamics of driven individual particles and 3D printing across scales,” Institute of Science and Technology Austria, 2024.","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.","ista":"Mweka CN. 2024. Non equilibrium dynamics of driven individual particles and 3D printing across scales. Institute of Science and Technology Austria."},"date_published":"2024-11-29T00:00:00Z","year":"2024","title":"Non equilibrium dynamics of driven individual particles and 3D printing across scales","month":"11","department":[{"_id":"GradSch"}],"date_updated":"2026-04-07T12:42:13Z","alternative_title":["ISTA Master's Thesis"],"oa_version":"Published Version","day":"29","abstract":[{"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.","lang":"eng"}]},{"OA_place":"publisher","_id":"17225","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"11438"}]},"oa":1,"type":"dissertation","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"last_name":"Li","id":"3A4FAA92-F248-11E8-B48F-1D18A9856A87","full_name":"Li, Vyacheslav","first_name":"Vyacheslav"}],"file_date_updated":"2024-07-11T10:26:22Z","corr_author":"1","has_accepted_license":"1","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Onur","orcid":"0000-0002-2031-204X","full_name":"Hosten, Onur","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","last_name":"Hosten"}],"date_created":"2024-07-11T09:46:48Z","status":"public","page":"79","file":[{"access_level":"open_access","success":1,"file_size":6729761,"relation":"main_file","date_created":"2024-07-11T10:26:22Z","checksum":"15b2dbe8d2c9ed7ca5dd413827928077","creator":"vli","file_id":"17228","date_updated":"2024-07-11T10:26:22Z","file_name":"PhD_Thesis_Vyacheslav_Li_no_signatures_PDFA.pdf","content_type":"application/pdf"},{"file_id":"17229","creator":"vli","file_name":"PhD Thesis Vyacheslav Li.zip","date_updated":"2024-07-11T10:26:22Z","content_type":"application/x-zip-compressed","access_level":"closed","file_size":9542859,"relation":"source_file","date_created":"2024-07-11T10:26:22Z","checksum":"16e904a11d8d0ebb167cb654ddfc7fe5"}],"ddc":["530"],"degree_awarded":"PhD","publication_status":"published","doi":"10.15479/at:ista:17225","publication_identifier":{"issn":["2663-337X"]},"publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","citation":{"mla":"Li, Vyacheslav. Towards a Quantum Entanglement Enhanced Atom Interferomter. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:17225.","ieee":"V. Li, “Towards a quantum entanglement enhanced atom interferomter,” Institute of Science and Technology Austria, 2024.","ista":"Li V. 2024. Towards a quantum entanglement enhanced atom interferomter. Institute of Science and Technology Austria.","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.","ama":"Li V. Towards a quantum entanglement enhanced atom interferomter. 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","short":"V. Li, Towards a Quantum Entanglement Enhanced Atom Interferomter, Institute of Science and Technology Austria, 2024."},"date_published":"2024-07-11T00:00:00Z","year":"2024","title":"Towards a quantum entanglement enhanced atom interferomter","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","short":"CC BY-NC-SA (4.0)"},"department":[{"_id":"GradSch"},{"_id":"OnHo"}],"month":"07","date_updated":"2026-04-07T12:42:28Z","project":[{"name":"A quantum hybrid of atoms and milligram-scale pendulums: towards gravitational quantum mechanics","_id":"bdb2a702-d553-11ed-ba76-f12e3e5a3bc6","grant_number":"101087907"}],"alternative_title":["ISTA Thesis"],"oa_version":"Published Version","day":"11","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"}]}]