[{"oa_version":"Preprint","doi":"10.48550/arXiv.2309.11292","author":[{"id":"ECEBF480-9E4F-11EA-B557-B0823DDC885E","last_name":"Dello Schiavo","orcid":"0000-0002-9881-6870","full_name":"Dello Schiavo, Lorenzo","first_name":"Lorenzo"},{"orcid":"0009-0000-9773-1931","last_name":"Quattrocchi","first_name":"Filippo","full_name":"Quattrocchi, Filippo","id":"3ebd6ba8-edfb-11eb-afb5-91a9745ba308"}],"external_id":{"arxiv":["2309.11292"]},"type":"preprint","publication_status":"draft","project":[{"_id":"34dbf174-11ca-11ed-8bc3-afe9d43d4b9c","name":"Configuration Spaces over Non-Smooth Spaces","grant_number":"E208"},{"_id":"260482E2-B435-11E9-9278-68D0E5697425","name":"Taming Complexity in Partial Differential Systems","grant_number":"F06504","call_identifier":"FWF"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"repository","citation":{"mla":"Dello Schiavo, Lorenzo, and Filippo Quattrocchi. “Multivariate Dirichlet Moments and a Polychromatic Ewens Sampling Formula.” <i>ArXiv</i>, 2309.11292, doi:<a href=\"https://doi.org/10.48550/arXiv.2309.11292\">10.48550/arXiv.2309.11292</a>.","ista":"Dello Schiavo L, Quattrocchi F. Multivariate Dirichlet moments and a polychromatic Ewens sampling formula. arXiv, 2309.11292.","chicago":"Dello Schiavo, Lorenzo, and Filippo Quattrocchi. “Multivariate Dirichlet Moments and a Polychromatic Ewens Sampling Formula.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2309.11292\">https://doi.org/10.48550/arXiv.2309.11292</a>.","short":"L. Dello Schiavo, F. Quattrocchi, ArXiv (n.d.).","ama":"Dello Schiavo L, Quattrocchi F. Multivariate Dirichlet moments and a polychromatic Ewens sampling formula. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2309.11292\">10.48550/arXiv.2309.11292</a>","apa":"Dello Schiavo, L., &#38; Quattrocchi, F. (n.d.). Multivariate Dirichlet moments and a polychromatic Ewens sampling formula. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2309.11292\">https://doi.org/10.48550/arXiv.2309.11292</a>","ieee":"L. Dello Schiavo and F. Quattrocchi, “Multivariate Dirichlet moments and a polychromatic Ewens sampling formula,” <i>arXiv</i>. ."},"article_processing_charge":"No","date_published":"2023-09-20T00:00:00Z","day":"20","corr_author":"1","date_created":"2025-10-28T13:13:08Z","publication":"arXiv","abstract":[{"text":"We present an elementary non-recursive formula for the multivariate moments\r\nof the Dirichlet distribution on the standard simplex, in terms of the pattern\r\ninventory of the moments' exponents. We obtain analog formulas for the\r\nmultivariate moments of the Dirichlet-Ferguson and Gamma measures. We further\r\nintroduce a polychromatic analogue of Ewens sampling formula on colored integer\r\npartitions, discuss its relation with suitable extensions of Hoppe's urn model\r\nand of the Chinese restaurant process, and prove that it satisfies an adapted\r\nnotion of consistency in the sense of Kingman.","lang":"eng"}],"language":[{"iso":"eng"}],"status":"public","acknowledgement":"This research was funded by the Austrian Science Fund (FWF) ESPRIT 208. For the purpose of open access, the authors have applied a CC BY public copyright licence to any Author Accepted Manuscript version arising from this submission. F.Q. gratefully acknowledges support by the Austrian Science Fund (FWF), Project SFB F65. The authors are grateful to Professor Nathanaël Berestycki for several helpful suggestions, and to Nicola Battisti and Dr. Elizabeth Hollwey for enlightening discussions on DNA-methylation.","year":"2023","fulldoi":"https://doi.org/10.48550/arXiv.2309.11292","department":[{"_id":"GradSch"},{"_id":"JaMa"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2309.11292"}],"OA_type":"green","month":"09","oa":1,"arxiv":1,"title":"Multivariate Dirichlet moments and a polychromatic Ewens sampling formula","_id":"20572","keyword":["Dirichlet distribution","Ewens sampling formula","Hoppe urn model","colored partitions"],"date_updated":"2025-11-24T13:53:48Z","article_number":"2309.11292"},{"month":"04","oa":1,"has_accepted_license":"1","title":"Intensification mechanisms of tropical cyclones","_id":"14863","article_number":"EGU23-6157","date_updated":"2026-07-02T06:42:45Z","publisher":"European Geosciences Union","year":"2023","fulldoi":"https://doi.org/10.5194/egusphere-egu23-6157","department":[{"_id":"CaMu"},{"_id":"GradSch"}],"file_date_updated":"2024-01-24T11:19:54Z","date_published":"2023-04-13T00:00:00Z","corr_author":"1","day":"13","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_created":"2024-01-22T12:08:12Z","publication":"EGU General Assembly 2023","status":"public","language":[{"iso":"eng"}],"oa_version":"Published Version","doi":"10.5194/egusphere-egu23-6157","author":[{"id":"74c777f4-32da-11ee-b498-874db0835561","first_name":"Andrea","full_name":"Polesello, Andrea","last_name":"Polesello"},{"orcid":"0000-0001-5836-5350","last_name":"Muller","first_name":"Caroline J","full_name":"Muller, Caroline J","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b"},{"last_name":"Pasquero","full_name":"Pasquero, Claudia","first_name":"Claudia"},{"last_name":"Meroni","full_name":"Meroni, Agostino N.","first_name":"Agostino N."}],"type":"conference_abstract","file":[{"file_id":"14883","access_level":"open_access","relation":"main_file","creator":"dernst","checksum":"8cb88c1bc80ccee328478a62064d98f7","file_name":"2023_EGU_Polesello.pdf","date_created":"2024-01-24T11:19:54Z","content_type":"application/pdf","date_updated":"2024-01-24T11:19:54Z","success":1,"file_size":296769}],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","conference":{"name":"EGU General Assembly","end_date":"2023-04-28","location":"Vienna, Austria & Virtual","start_date":"2023-04-23"},"ddc":["550"],"citation":{"ista":"Polesello A, Muller CJ, Pasquero C, Meroni AN. 2023. Intensification mechanisms of tropical cyclones. EGU General Assembly 2023. EGU General Assembly, EGU23-6157.","mla":"Polesello, Andrea, et al. “Intensification Mechanisms of Tropical Cyclones.” <i>EGU General Assembly 2023</i>, EGU23-6157, European Geosciences Union, 2023, doi:<a href=\"https://doi.org/10.5194/egusphere-egu23-6157\">10.5194/egusphere-egu23-6157</a>.","ieee":"A. Polesello, C. J. Muller, C. Pasquero, and A. N. Meroni, “Intensification mechanisms of tropical cyclones,” in <i>EGU General Assembly 2023</i>, Vienna, Austria &#38; Virtual, 2023.","apa":"Polesello, A., Muller, C. J., Pasquero, C., &#38; Meroni, A. N. (2023). Intensification mechanisms of tropical cyclones. In <i>EGU General Assembly 2023</i>. Vienna, Austria &#38; Virtual: European Geosciences Union. <a href=\"https://doi.org/10.5194/egusphere-egu23-6157\">https://doi.org/10.5194/egusphere-egu23-6157</a>","ama":"Polesello A, Muller CJ, Pasquero C, Meroni AN. Intensification mechanisms of tropical cyclones. In: <i>EGU General Assembly 2023</i>. European Geosciences Union; 2023. doi:<a href=\"https://doi.org/10.5194/egusphere-egu23-6157\">10.5194/egusphere-egu23-6157</a>","chicago":"Polesello, Andrea, Caroline J Muller, Claudia Pasquero, and Agostino N. Meroni. “Intensification Mechanisms of Tropical Cyclones.” In <i>EGU General Assembly 2023</i>. European Geosciences Union, 2023. <a href=\"https://doi.org/10.5194/egusphere-egu23-6157\">https://doi.org/10.5194/egusphere-egu23-6157</a>.","short":"A. Polesello, C.J. Muller, C. Pasquero, A.N. Meroni, in:, EGU General Assembly 2023, European Geosciences Union, 2023."}},{"department":[{"_id":"GradSch"},{"_id":"MaIb"}],"fulldoi":"https://doi.org/10.15479/at:ista:12885","ec_funded":1,"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-028-2"]},"year":"2023","publisher":"Institute of Science and Technology Austria","alternative_title":["ISTA Thesis"],"title":"Nanoparticle-based semiconductor solids: From synthesis to consolidation","has_accepted_license":"1","oa":1,"month":"04","acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"NanoFab"}],"date_updated":"2026-07-06T12:16:05Z","_id":"12885","file":[{"checksum":"9347b0e09425f56fdcede5d3528404dc","file_name":"Thesis_Calcabrini.docx","date_created":"2023-05-02T07:43:18Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_updated":"2023-05-02T07:43:18Z","file_size":99627036,"file_id":"12887","access_level":"closed","relation":"source_file","creator":"mcalcabr"},{"file_size":8742220,"success":1,"content_type":"application/pdf","date_updated":"2023-05-02T07:42:45Z","date_created":"2023-05-02T07:42:45Z","file_name":"Thesis_Calcabrini_pdfa.pdf","checksum":"2d188b76621086cd384f0b9264b0a576","relation":"main_file","creator":"mcalcabr","access_level":"open_access","file_id":"12888"}],"type":"dissertation","author":[{"id":"45D7531A-F248-11E8-B48F-1D18A9856A87","full_name":"Calcabrini, Mariano","first_name":"Mariano","last_name":"Calcabrini","orcid":"0000-0003-4566-5877"}],"doi":"10.15479/at:ista:12885","oa_version":"Published Version","ddc":["546","541"],"citation":{"apa":"Calcabrini, M. (2023). <i>Nanoparticle-based semiconductor solids: From synthesis to consolidation</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:12885\">https://doi.org/10.15479/at:ista:12885</a>","ama":"Calcabrini M. Nanoparticle-based semiconductor solids: From synthesis to consolidation. 2023. doi:<a href=\"https://doi.org/10.15479/at:ista:12885\">10.15479/at:ista:12885</a>","ieee":"M. Calcabrini, “Nanoparticle-based semiconductor solids: From synthesis to consolidation,” Institute of Science and Technology Austria, 2023.","short":"M. Calcabrini, Nanoparticle-Based Semiconductor Solids: From Synthesis to Consolidation, Institute of Science and Technology Austria, 2023.","chicago":"Calcabrini, Mariano. “Nanoparticle-Based Semiconductor Solids: From Synthesis to Consolidation.” Institute of Science and Technology Austria, 2023. <a href=\"https://doi.org/10.15479/at:ista:12885\">https://doi.org/10.15479/at:ista:12885</a>.","ista":"Calcabrini M. 2023. Nanoparticle-based semiconductor solids: From synthesis to consolidation. Institute of Science and Technology Austria.","mla":"Calcabrini, Mariano. <i>Nanoparticle-Based Semiconductor Solids: From Synthesis to Consolidation</i>. Institute of Science and Technology Austria, 2023, doi:<a href=\"https://doi.org/10.15479/at:ista:12885\">10.15479/at:ista:12885</a>."},"article_processing_charge":"No","OA_place":"publisher","degree_awarded":"PhD","project":[{"call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publication_status":"published","related_material":{"record":[{"id":"12237","relation":"part_of_dissertation","status":"public"},{"id":"10806","relation":"part_of_dissertation","status":"public"},{"id":"10123","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"9118"},{"id":"10042","relation":"part_of_dissertation","status":"public"}]},"day":"28","corr_author":"1","date_published":"2023-04-28T00:00:00Z","page":"82","file_date_updated":"2023-05-02T07:43:18Z","status":"public","language":[{"iso":"eng"}],"supervisor":[{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria","full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","last_name":"Ibáñez"}],"abstract":[{"text":"High-performance semiconductors rely upon precise control of heat and charge transport. This can be achieved by precisely engineering defects in polycrystalline solids. There are multiple approaches to preparing such polycrystalline semiconductors, and the transformation of solution-processed colloidal nanoparticles is appealing because colloidal nanoparticles combine low cost with structural and compositional tunability along with rich surface chemistry. However, the multiple processes from nanoparticle synthesis to the final bulk nanocomposites are very complex. They involve nanoparticle purification, post-synthetic modifications, and finally consolidation (thermal treatments and densification). All these properties dictate the final material’s composition and microstructure, ultimately affecting its functional properties. This thesis explores the synthesis, surface chemistry and consolidation of colloidal semiconductor nanoparticles into dense solids. In particular, the transformations that take place during these processes, and their effect on the material’s transport properties are evaluated. ","lang":"eng"}],"date_created":"2023-05-02T07:58:57Z"},{"article_processing_charge":"Yes (in subscription journal)","conference":{"start_date":"2023-07-17","location":"Paris, France","end_date":"2023-07-22","name":"CAV: Computer Aided Verification"},"citation":{"chicago":"Koval, Nikita, Alexander Fedorov, Maria Sokolova, Dmitry Tsitelov, and Dan-Adrian Alistarh. “Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM.” In <i>35th International Conference on Computer Aided Verification</i>, 13964:156–69. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-37706-8_8\">https://doi.org/10.1007/978-3-031-37706-8_8</a>.","short":"N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, D.-A. Alistarh, in:, 35th International Conference on Computer Aided Verification, Springer Nature, 2023, pp. 156–169.","ieee":"N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, and D.-A. Alistarh, “Lincheck: A practical framework for testing concurrent data structures on JVM,” in <i>35th International Conference on Computer Aided Verification</i>, Paris, France, 2023, vol. 13964, pp. 156–169.","ama":"Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. Lincheck: A practical framework for testing concurrent data structures on JVM. In: <i>35th International Conference on Computer Aided Verification</i>. Vol 13964. Springer Nature; 2023:156-169. doi:<a href=\"https://doi.org/10.1007/978-3-031-37706-8_8\">10.1007/978-3-031-37706-8_8</a>","apa":"Koval, N., Fedorov, A., Sokolova, M., Tsitelov, D., &#38; Alistarh, D.-A. (2023). Lincheck: A practical framework for testing concurrent data structures on JVM. In <i>35th International Conference on Computer Aided Verification</i> (Vol. 13964, pp. 156–169). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-37706-8_8\">https://doi.org/10.1007/978-3-031-37706-8_8</a>","mla":"Koval, Nikita, et al. “Lincheck: A Practical Framework for Testing Concurrent Data Structures on JVM.” <i>35th International Conference on Computer Aided Verification</i>, vol. 13964, Springer Nature, 2023, pp. 156–69, doi:<a href=\"https://doi.org/10.1007/978-3-031-37706-8_8\">10.1007/978-3-031-37706-8_8</a>.","ista":"Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. 2023. Lincheck: A practical framework for testing concurrent data structures on JVM. 35th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13964, 156–169."},"ddc":["000"],"volume":13964,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","type":"conference","file":[{"relation":"main_file","creator":"dernst","file_id":"14275","access_level":"open_access","content_type":"application/pdf","date_updated":"2023-09-06T08:16:25Z","success":1,"file_size":421408,"checksum":"c346016393123a0a2338ad4d976f61bc","date_created":"2023-09-06T08:16:25Z","file_name":"2023_LNCS_Koval.pdf"}],"scopus_import":"1","external_id":{"isi":["001310786500008"]},"author":[{"full_name":"Koval, Nikita","first_name":"Nikita","last_name":"Koval","id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Fedorov, Alexander","first_name":"Alexander","last_name":"Fedorov","id":"2e711909-896a-11ed-bdf8-eb0f5a2984c6"},{"full_name":"Sokolova, Maria","first_name":"Maria","last_name":"Sokolova"},{"last_name":"Tsitelov","first_name":"Dmitry","full_name":"Tsitelov, Dmitry"},{"last_name":"Alistarh","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"intvolume":"     13964","doi":"10.1007/978-3-031-37706-8_8","oa_version":"Published Version","language":[{"iso":"eng"}],"status":"public","abstract":[{"lang":"eng","text":"This paper presents Lincheck, a new practical and user-friendly framework for testing concurrent algorithms on the Java Virtual Machine (JVM). Lincheck provides a simple and declarative way to write concurrent tests: instead of describing how to perform the test, users specify what to test by declaring all the operations to examine; the framework automatically handles the rest. As a result, tests written with Lincheck are concise and easy to understand. The framework automatically generates a set of concurrent scenarios, examines them using stress-testing or bounded model checking, and verifies that the results of each invocation are correct. Notably, if an error is detected via model checking, Lincheck provides an easy-to-follow trace to reproduce it, significantly simplifying the bug investigation.\r\n\r\nTo the best of our knowledge, Lincheck is the first production-ready tool on the JVM that offers such a simple way of writing concurrent tests, without requiring special skills or expertise. We successfully integrated Lincheck in the development process of several large projects, such as Kotlin Coroutines, and identified new bugs in popular concurrency libraries, such as a race in Java’s standard ConcurrentLinkedDeque and a liveliness bug in Java’s AbstractQueuedSynchronizer framework, which is used in most of the synchronization primitives. We believe that Lincheck can significantly improve the quality and productivity of concurrent algorithms research and development and become the state-of-the-art tool for checking their correctness."}],"publication":"35th International Conference on Computer Aided Verification","date_created":"2023-09-03T22:01:16Z","related_material":{"record":[{"relation":"research_data","status":"public","id":"14995"}]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"day":"17","das_tickbox":"1","date_published":"2023-07-17T00:00:00Z","file_date_updated":"2023-09-06T08:16:25Z","page":"156-169","alternative_title":["LNCS"],"quality_controlled":"1","department":[{"_id":"DaAl"},{"_id":"GradSch"}],"fulldoi":"https://doi.org/10.1007/978-3-031-37706-8_8","publisher":"Springer Nature","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031377051"],"issn":["0302-9743"]},"year":"2023","date_updated":"2026-07-07T13:39:36Z","_id":"14260","title":"Lincheck: A practical framework for testing concurrent data structures on JVM","isi":1,"oa":1,"has_accepted_license":"1","month":"07"},{"keyword":["superconductor-semiconductor","superconductivity","Al","InAs","p-wave","superconductivity","JPA","microwave"],"_id":"14547","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","date_updated":"2026-07-08T08:38:43Z","month":"11","acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"Bio"}],"has_accepted_license":"1","oa":1,"title":"Resonant microwave spectroscopy of Al-InAs","alternative_title":["ISTA Thesis"],"publication_identifier":{"issn":["2663-337X"]},"year":"2023","publisher":"Institute of Science and Technology Austria","fulldoi":"https://doi.org/10.15479/14547","department":[{"_id":"GradSch"},{"_id":"AnHi"}],"date_created":"2023-11-17T13:45:26Z","abstract":[{"lang":"eng","text":"Superconductor-semiconductor heterostructures currently capture a significant amount of research interest and they serve as the physical platform in many proposals towards topological quantum computation.\r\nDespite being under extensive investigations, historically using transport techniques, the basic properties of the interface between the superconductor and the semiconductor remain to be understood.\r\n\r\nIn this thesis, two separate studies on the Al-InAs heterostructures are reported with the first focusing on the physics of the material motivated by the emergence of a new phase, the Bogoliubov-Fermi surface. \r\nThe second focuses on a technological application, a gate-tunable Josephson parametric amplifier.\r\n\r\nIn the first study, we investigate the hypothesized unconventional nature of the induced superconductivity at the interface between the Al thin film and the InAs quantum well.\r\nWe embed a two-dimensional Al-InAs hybrid system in a resonant microwave circuit allowing measurements of change in inductance.\r\nThe behaviour of the resonance in a range of temperature and in-plane magnetic field has been studied and compared with the theory of conventional s-wave superconductor and a two-component theory that includes both contribution of the $s$-wave pairing in Al and the intraband $p \\pm ip$ pairing in InAs.\r\nMeasuring the temperature dependence of resonant frequency, no discrepancy is found between data and the conventional theory.\r\nWe observe the breakdown of superconductivity due to an applied magnetic field which contradicts the conventional theory.\r\nIn contrast, the data can be captured quantitatively by fitting to a two-component model.\r\nWe find the evidence of the intraband $p \\pm ip$ pairing in the InAs and the emergence of the Bogoliubov-Fermi surfaces due to magnetic field with the characteristic value $B^* = 0.33~\\mathrm{T}$.\r\nFrom the fits, the sheet resistance of Al, the carrier density and mobility in InAs are determined.\r\nBy systematically studying the anisotropy of the circuit response, we find weak anisotropy for $B < B^*$ and increasingly strong anisotropy for $B > B^*$ resulting in a pronounced two-lobe structure in polar plot of frequency versus field angle.\r\nStrong resemblance between the field dependence of dissipation and superfluid density hints at a hidden signature of the Bogoliubov-Fermi surface that is burried in the dissipation data.\r\n\r\nIn the second study, we realize a parametric amplifier with a Josephson field effect transistor as the active element.\r\nThe device's modest construction consists of a gated SNS weak link embedded at the center of a coplanar waveguide resonator.\r\nBy applying a gate voltage, the resonant frequency is field-effect tunable over a range of 2 GHz.\r\nModelling the JoFET minimally as a parallel RL circuit, the dissipation introduced by the JoFET can be quantitatively related to the gate voltage.\r\nWe observed gate-tunable Kerr nonlinearity qualitatively in line with expectation.\r\nThe JoFET amplifier has 20 dB of gain, 4 MHz of instantaneous bandwidth, and a 1dB compression point of -125.5 dBm when operated at a fixed resonant frequency.\r\nIn general, the signal-to-noise ratio is improved by 5-7 dB when the JoFET amplifier is activated compared.\r\nThe noise of the measurement chain and insertion loss of relevant circuit elements are calibrated to determine the expected and the real noise performance of the JoFET amplifier.\r\nAs a quantification of the noise performance, the measured total input-referred noise of the JoFET amplifier is in good agreement with the estimated expectation which takes device loss into account.\r\nWe found that the noise performance of the device reported in this document approaches one photon of total input-referred added noise which is the quantum limit imposed in nondegenerate parametric amplifier."}],"language":[{"iso":"eng"}],"status":"public","supervisor":[{"id":"4AD6785A-F248-11E8-B48F-1D18A9856A87","full_name":"Higginbotham, Andrew P","first_name":"Andrew P","last_name":"Higginbotham","orcid":"0000-0003-2607-2363"}],"page":"80","file_date_updated":"2023-11-22T09:46:06Z","date_published":"2023-11-16T00:00:00Z","day":"16","corr_author":"1","tmp":{"image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)"},"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"10851"},{"status":"public","relation":"part_of_dissertation","id":"13264"}]},"publication_status":"published","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","OA_place":"publisher","degree_awarded":"PhD","ddc":["530"],"citation":{"chicago":"Phan, Duc T. “Resonant Microwave Spectroscopy of Al-InAs.” Institute of Science and Technology Austria, 2023. <a href=\"https://doi.org/10.15479/14547\">https://doi.org/10.15479/14547</a>.","short":"D.T. Phan, Resonant Microwave Spectroscopy of Al-InAs, Institute of Science and Technology Austria, 2023.","ieee":"D. T. Phan, “Resonant microwave spectroscopy of Al-InAs,” Institute of Science and Technology Austria, 2023.","ama":"Phan DT. Resonant microwave spectroscopy of Al-InAs. 2023. doi:<a href=\"https://doi.org/10.15479/14547\">10.15479/14547</a>","apa":"Phan, D. T. (2023). <i>Resonant microwave spectroscopy of Al-InAs</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/14547\">https://doi.org/10.15479/14547</a>","mla":"Phan, Duc T. <i>Resonant Microwave Spectroscopy of Al-InAs</i>. Institute of Science and Technology Austria, 2023, doi:<a href=\"https://doi.org/10.15479/14547\">10.15479/14547</a>.","ista":"Phan DT. 2023. Resonant microwave spectroscopy of Al-InAs. Institute of Science and Technology Austria."},"article_processing_charge":"No","oa_version":"Published Version","doi":"10.15479/14547","author":[{"id":"29C8C0B4-F248-11E8-B48F-1D18A9856A87","last_name":"Phan","full_name":"Phan, Duc T","first_name":"Duc T"}],"file":[{"checksum":"db0c37d213bc002125bd59690e9db246","date_created":"2023-11-17T13:36:44Z","file_name":"Phan_Thesis_pdfa.pdf","date_updated":"2023-11-22T09:46:06Z","content_type":"application/pdf","file_size":34828019,"file_id":"14548","access_level":"open_access","creator":"pduc","relation":"main_file"},{"content_type":"application/zip","date_updated":"2023-11-17T13:47:54Z","file_size":279319709,"checksum":"8d3bd6afa279a0078ffd13e06bb6d56d","date_created":"2023-11-17T13:44:53Z","file_name":"dissertation_src.zip","relation":"source_file","creator":"pduc","file_id":"14549","access_level":"closed"}],"type":"dissertation"},{"quality_controlled":"1","department":[{"_id":"GradSch"},{"_id":"PaSc"}],"fulldoi":"https://doi.org/10.1002/anie.202219314","year":"2023","publication_identifier":{"issn":["1433-7851"],"eissn":["1521-3773"]},"publisher":"Wiley","date_updated":"2026-07-20T09:49:12Z","article_number":"e202219314","keyword":["General Chemistry","Catalysis"],"_id":"12675","isi":1,"title":"The rigid core and flexible surface of amyloid fibrils probed by Magic‐Angle Spinning NMR of aromatic residues","has_accepted_license":"1","pmid":1,"oa":1,"month":"05","article_type":"original","ddc":["540"],"citation":{"ista":"Becker LM, Berbon M, Vallet A, Grelard A, Morvan E, Bardiaux B, Lichtenecker R, Ernst M, Loquet A, Schanda P. 2023. The rigid core and flexible surface of amyloid fibrils probed by Magic‐Angle Spinning NMR of aromatic residues. Angewandte Chemie International Edition. 62(19), e202219314.","mla":"Becker, Lea Marie, et al. “The Rigid Core and Flexible Surface of Amyloid Fibrils Probed by Magic‐Angle Spinning NMR of Aromatic Residues.” <i>Angewandte Chemie International Edition</i>, vol. 62, no. 19, e202219314, Wiley, 2023, doi:<a href=\"https://doi.org/10.1002/anie.202219314\">10.1002/anie.202219314</a>.","ama":"Becker LM, Berbon M, Vallet A, et al. The rigid core and flexible surface of amyloid fibrils probed by Magic‐Angle Spinning NMR of aromatic residues. <i>Angewandte Chemie International Edition</i>. 2023;62(19). doi:<a href=\"https://doi.org/10.1002/anie.202219314\">10.1002/anie.202219314</a>","apa":"Becker, L. M., Berbon, M., Vallet, A., Grelard, A., Morvan, E., Bardiaux, B., … Schanda, P. (2023). The rigid core and flexible surface of amyloid fibrils probed by Magic‐Angle Spinning NMR of aromatic residues. <i>Angewandte Chemie International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.202219314\">https://doi.org/10.1002/anie.202219314</a>","ieee":"L. M. Becker <i>et al.</i>, “The rigid core and flexible surface of amyloid fibrils probed by Magic‐Angle Spinning NMR of aromatic residues,” <i>Angewandte Chemie International Edition</i>, vol. 62, no. 19. Wiley, 2023.","short":"L.M. Becker, M. Berbon, A. Vallet, A. Grelard, E. Morvan, B. Bardiaux, R. Lichtenecker, M. Ernst, A. Loquet, P. Schanda, Angewandte Chemie International Edition 62 (2023).","chicago":"Becker, Lea Marie, Mélanie Berbon, Alicia Vallet, Axelle Grelard, Estelle Morvan, Benjamin Bardiaux, Roman Lichtenecker, Matthias Ernst, Antoine Loquet, and Paul Schanda. “The Rigid Core and Flexible Surface of Amyloid Fibrils Probed by Magic‐Angle Spinning NMR of Aromatic Residues.” <i>Angewandte Chemie International Edition</i>. Wiley, 2023. <a href=\"https://doi.org/10.1002/anie.202219314\">https://doi.org/10.1002/anie.202219314</a>."},"article_processing_charge":"Yes (via OA deal)","volume":62,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"19","publication_status":"published","file":[{"file_size":1422445,"success":1,"date_updated":"2023-08-16T12:33:31Z","content_type":"application/pdf","file_name":"2023_AngewChemInt_Becker.pdf","date_created":"2023-08-16T12:33:31Z","checksum":"7dd083ed8850faa55c34e411ed390de9","creator":"dernst","relation":"main_file","access_level":"open_access","file_id":"14072"}],"scopus_import":"1","type":"journal_article","author":[{"id":"36336939-eb97-11eb-a6c2-c83f1214ca79","orcid":"0000-0002-6401-5151","last_name":"Becker","first_name":"Lea Marie","full_name":"Becker, Lea Marie"},{"last_name":"Berbon","full_name":"Berbon, Mélanie","first_name":"Mélanie"},{"first_name":"Alicia","full_name":"Vallet, Alicia","last_name":"Vallet"},{"last_name":"Grelard","first_name":"Axelle","full_name":"Grelard, Axelle"},{"last_name":"Morvan","full_name":"Morvan, Estelle","first_name":"Estelle"},{"last_name":"Bardiaux","first_name":"Benjamin","full_name":"Bardiaux, Benjamin"},{"last_name":"Lichtenecker","full_name":"Lichtenecker, Roman","first_name":"Roman"},{"first_name":"Matthias","full_name":"Ernst, Matthias","last_name":"Ernst"},{"first_name":"Antoine","full_name":"Loquet, Antoine","last_name":"Loquet"},{"full_name":"Schanda, Paul","first_name":"Paul","last_name":"Schanda","orcid":"0000-0002-9350-7606","id":"7B541462-FAF6-11E9-A490-E8DFE5697425"}],"external_id":{"isi":["000956919900001"],"pmid":["36738230"]},"doi":"10.1002/anie.202219314","intvolume":"        62","oa_version":"Published Version","language":[{"iso":"eng"}],"acknowledgement":"We thank AlbertA. Smith (Leipzig)for insightful discussions. This work was supported by funding from the European Research Council (StG-2012-311318 to P.S.) and used the platforms of the Grenoble Instruct-ERIC center (ISBG;UMS 3518 CNRS-CEA-UJF-EMBL) within the Grenoble Partnership for Structural Biology(PSB) and facilities and expertiseof the Biophysical and Structural Chemistry platform (BPCS) at IECB,CNRSUAR3033,INSERMUS001 and Bordeaux University.","status":"public","publication":"Angewandte Chemie International Edition","abstract":[{"text":"Aromatic side chains are important reporters of the plasticity of proteins, and often form important contacts in protein--protein interactions. By studying a pair of structurally homologous cross-β amyloid fibrils, HET-s and HELLF, with a specific isotope-labeling approach and magic-angle-spinning (MAS) NMR, we have characterized the dynamic behavior of Phe and Tyr aromatic rings to show that the hydrophobic amyloid core is rigid, without any sign of \"breathing motions\" over hundreds of milliseconds at least. Aromatic residues exposed at the fibril surface have a rigid ring axis but undergo ring flips, on a variety of time scales from ns to µs. Our approach provides direct insight into hydrophobic-core motions, enabling a better evaluation of the conformational heterogeneity generated from a NMR structural ensemble of such amyloid cross-β architecture.","lang":"eng"}],"date_created":"2023-02-24T10:45:01Z","related_material":{"record":[{"relation":"research_data","status":"public","id":"12497"},{"id":"14861","status":"public","relation":"other"},{"id":"22334","status":"public","relation":"dissertation_contains"}],"link":[{"description":"News on ISTA website","relation":"press_release","url":"https://ista.ac.at/en/news/dancing-styles-of-atoms/"}]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"day":"01","corr_author":"1","date_published":"2023-05-01T00:00:00Z","file_date_updated":"2023-08-16T12:33:31Z"},{"_id":"15039","date_updated":"2026-07-27T12:47:43Z","article_number":"2311.06103","oa":1,"month":"11","title":"1-Lipschitz neural networks are more expressive with N-activations","arxiv":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2311.06103"}],"fulldoi":"https://doi.org/10.48550/ARXIV.2311.06103","year":"2023","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"date_created":"2024-02-28T17:59:32Z","language":[{"iso":"eng"}],"status":"public","publication":"arXiv","abstract":[{"text":"A crucial property for achieving secure, trustworthy and interpretable deep learning systems is their robustness: small changes to a system's inputs should not result in large changes to its outputs. Mathematically, this means one strives for networks with a small Lipschitz constant. Several recent works have focused on how to construct such Lipschitz networks, typically by imposing constraints on the weight matrices. In this work, we study an orthogonal aspect, namely the role of the activation function. We show that commonly used activation functions, such as MaxMin, as well as all piece-wise linear ones with two segments unnecessarily restrict the class of representable functions, even in the simplest one-dimensional setting. We furthermore introduce the new N-activation function that is provably more expressive than currently popular activation functions. We provide code at this https URL.","lang":"eng"}],"date_published":"2023-11-10T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"19759"}]},"day":"10","corr_author":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publication_status":"draft","citation":{"short":"B. Prach, C. Lampert, ArXiv (n.d.).","chicago":"Prach, Bernd, and Christoph Lampert. “1-Lipschitz Neural Networks Are More Expressive with N-Activations.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/ARXIV.2311.06103\">https://doi.org/10.48550/ARXIV.2311.06103</a>.","ama":"Prach B, Lampert C. 1-Lipschitz neural networks are more expressive with N-activations. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/ARXIV.2311.06103\">10.48550/ARXIV.2311.06103</a>","apa":"Prach, B., &#38; Lampert, C. (n.d.). 1-Lipschitz neural networks are more expressive with N-activations. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/ARXIV.2311.06103\">https://doi.org/10.48550/ARXIV.2311.06103</a>","ieee":"B. Prach and C. Lampert, “1-Lipschitz neural networks are more expressive with N-activations,” <i>arXiv</i>. .","mla":"Prach, Bernd, and Christoph Lampert. “1-Lipschitz Neural Networks Are More Expressive with N-Activations.” <i>ArXiv</i>, 2311.06103, doi:<a href=\"https://doi.org/10.48550/ARXIV.2311.06103\">10.48550/ARXIV.2311.06103</a>.","ista":"Prach B, Lampert C. 1-Lipschitz neural networks are more expressive with N-activations. arXiv, 2311.06103."},"article_processing_charge":"No","OA_place":"repository","doi":"10.48550/ARXIV.2311.06103","oa_version":"Preprint","type":"preprint","author":[{"last_name":"Prach","full_name":"Prach, Bernd","first_name":"Bernd","id":"2D561D42-C427-11E9-89B4-9C1AE6697425"},{"last_name":"Lampert","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"arxiv":["2311.06103"]}},{"publication_status":"published","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"grant_number":"M03318","name":"Functional Advantages of Critical Brain Dynamics","_id":"eb943429-77a9-11ec-83b8-9f471cdf5c67"},{"_id":"626c45b5-2b32-11ec-9570-e509828c1ba6","grant_number":"P34015","name":"Efficient coding with biophysical realism"}],"volume":3,"article_processing_charge":"No","citation":{"short":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, D. De Martino, Nature Computational Science 3 (2023) 254–263.","chicago":"Lombardi, Fabrizio, Selver Pepic, Oren Shriki, Gašper Tkačik, and Daniele De Martino. “Statistical Modeling of Adaptive Neural Networks Explains Co-Existence of Avalanches and Oscillations in Resting Human Brain.” <i>Nature Computational Science</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1038/s43588-023-00410-9\">https://doi.org/10.1038/s43588-023-00410-9</a>.","ieee":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, and D. De Martino, “Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain,” <i>Nature Computational Science</i>, vol. 3. Springer Nature, pp. 254–263, 2023.","apa":"Lombardi, F., Pepic, S., Shriki, O., Tkačik, G., &#38; De Martino, D. (2023). Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain. <i>Nature Computational Science</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s43588-023-00410-9\">https://doi.org/10.1038/s43588-023-00410-9</a>","ama":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain. <i>Nature Computational Science</i>. 2023;3:254-263. doi:<a href=\"https://doi.org/10.1038/s43588-023-00410-9\">10.1038/s43588-023-00410-9</a>","mla":"Lombardi, Fabrizio, et al. “Statistical Modeling of Adaptive Neural Networks Explains Co-Existence of Avalanches and Oscillations in Resting Human Brain.” <i>Nature Computational Science</i>, vol. 3, Springer Nature, 2023, pp. 254–63, doi:<a href=\"https://doi.org/10.1038/s43588-023-00410-9\">10.1038/s43588-023-00410-9</a>.","ista":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. 2023. Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain. Nature Computational Science. 3, 254–263."},"ddc":["570"],"oa_version":"Published Version","intvolume":"         3","doi":"10.1038/s43588-023-00410-9","external_id":{"pmid":["38177880"],"isi":["000968161800002"],"arxiv":["2108.06686"]},"author":[{"orcid":"0000-0003-2623-5249","last_name":"Lombardi","first_name":"Fabrizio","full_name":"Lombardi, Fabrizio","id":"A057D288-3E88-11E9-986D-0CF4E5697425"},{"last_name":"Pepic","first_name":"Selver","full_name":"Pepic, Selver","id":"F93245C4-C3CA-11E9-B4F0-C6F4E5697425"},{"full_name":"Shriki, Oren","first_name":"Oren","last_name":"Shriki"},{"first_name":"Gašper","full_name":"Tkačik, Gašper","orcid":"0000-0002-6699-1455","last_name":"Tkačik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"},{"id":"3FF5848A-F248-11E8-B48F-1D18A9856A87","first_name":"Daniele","full_name":"De Martino, Daniele","orcid":"0000-0002-5214-4706","last_name":"De Martino"}],"type":"journal_article","file":[{"date_updated":"2023-08-16T12:39:57Z","content_type":"application/pdf","file_size":4474284,"success":1,"checksum":"7c63b2b2edfd68aaffe96d70ca6a865a","file_name":"2023_NatureCompScience_Lombardi.pdf","date_created":"2023-08-16T12:39:57Z","creator":"dernst","relation":"main_file","file_id":"14073","access_level":"open_access"}],"scopus_import":"1","date_created":"2023-03-26T22:01:08Z","abstract":[{"lang":"eng","text":"Neurons in the brain are wired into adaptive networks that exhibit collective dynamics as diverse as scale-specific oscillations and scale-free neuronal avalanches. Although existing models account for oscillations and avalanches separately, they typically do not explain both phenomena, are too complex to analyze analytically or intractable to infer from data rigorously. Here we propose a feedback-driven Ising-like class of neural networks that captures avalanches and oscillations simultaneously and quantitatively. In the simplest yet fully microscopic model version, we can analytically compute the phase diagram and make direct contact with human brain resting-state activity recordings via tractable inference of the model’s two essential parameters. The inferred model quantitatively captures the dynamics over a broad range of scales, from single sensor oscillations to collective behaviors of extreme events and neuronal avalanches. Importantly, the inferred parameters indicate that the co-existence of scale-specific (oscillations) and scale-free (avalanches) dynamics occurs close to a non-equilibrium critical point at the onset of self-sustained oscillations."}],"publication":"Nature Computational Science","acknowledgement":"This research was funded in whole, or in part, by the Austrian Science Fund (FWF) (grant no. PT1013M03318 to F.L. and no. P34015 to G.T.). For the purpose of open access, the author has applied a CC BY public copyright licence to any Author Accepted Manuscript version arising from this submission. The study was supported by the European Union Horizon 2020 research and innovation program under the Marie Sklodowska-Curie action (grant agreement No. 754411 to F.L.).","language":[{"iso":"eng"}],"status":"public","file_date_updated":"2023-08-16T12:39:57Z","page":"254-263","date_published":"2023-03-20T00:00:00Z","corr_author":"1","day":"20","related_material":{"record":[{"id":"10912","status":"public","relation":"earlier_version"}]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publisher":"Springer Nature","publication_identifier":{"eissn":["2662-8457"]},"year":"2023","ec_funded":1,"fulldoi":"https://doi.org/10.1038/s43588-023-00410-9","quality_controlled":"1","department":[{"_id":"GaTk"},{"_id":"GradSch"}],"_id":"12762","date_updated":"2026-07-29T06:53:41Z","month":"03","article_type":"original","oa":1,"pmid":1,"has_accepted_license":"1","arxiv":1,"title":"Statistical modeling of adaptive neural networks explains co-existence of avalanches and oscillations in resting human brain","isi":1},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"21393"}],"link":[{"relation":"software","url":"https://github.com/madvorak/grammars/tree/publish"}]},"corr_author":"1","day":"27","date_published":"2023-07-27T00:00:00Z","file_date_updated":"2023-08-07T11:55:43Z","language":[{"iso":"eng"}],"acknowledgement":"Jasmin Blanchette: This research has received funding from the Netherlands Organization\r\nfor Scientific Research (NWO) under the Vidi program (project No. 016.Vidi.189.037, Lean Forward).\r\n__\r\nWe thank Vladimir Kolmogorov for making this collaboration possible. We\r\nthank Václav Končický for discussing ideas about the Kleene star construction. We thank Patrick Johnson, Floris van Doorn, and Damiano Testa for their small yet very valuable contributions to our code. We thank Eric Wieser for simplifying one of our proofs. We thank Mark Summerfield for suggesting textual improvements. We thank the anonymous reviewers for very helpful comments. Finally, we thank the Lean community for helping us with various technical issues and answering many questions. ","status":"public","abstract":[{"lang":"eng","text":"We formalized general (i.e., type-0) grammars using the Lean 3 proof assistant. We defined basic notions of rewrite rules and of words derived by a grammar, and used grammars to show closure of the class of type-0 languages under four operations: union, reversal, concatenation, and the Kleene star. The literature mostly focuses on Turing machine arguments, which are possibly more difficult to formalize. For the Kleene star, we could not follow the literature and came up with our own grammar-based construction."}],"publication":"14th International Conference on Interactive Theorem Proving","date_created":"2023-06-05T07:29:05Z","type":"conference","file":[{"access_level":"open_access","file_id":"13982","creator":"dernst","relation":"main_file","file_name":"2023_LIPIcS_Dvorak.pdf","date_created":"2023-08-07T11:55:43Z","checksum":"773a0197f05b67feaa6cb1e17ec3642d","success":1,"file_size":715976,"date_updated":"2023-08-07T11:55:43Z","content_type":"application/pdf"}],"scopus_import":"1","external_id":{"arxiv":["2302.06420"],"isi":["001515590500015"]},"author":[{"id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425","last_name":"Dvorak","orcid":"0000-0001-5293-214X","full_name":"Dvorak, Martin","first_name":"Martin"},{"first_name":"Jasmin","full_name":"Blanchette, Jasmin","last_name":"Blanchette"}],"intvolume":"       268","doi":"10.4230/LIPIcs.ITP.2023.15","oa_version":"Published Version","article_processing_charge":"No","conference":{"end_date":"2023-08-04","name":"ITP: Interactive Theorem Proving","start_date":"2023-07-31","location":"Bialystok, Poland"},"ddc":["000"],"citation":{"chicago":"Dvorak, Martin, and Jasmin Blanchette. “Closure Properties of General Grammars - Formally Verified.” In <i>14th International Conference on Interactive Theorem Proving</i>, Vol. 268. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. <a href=\"https://doi.org/10.4230/LIPIcs.ITP.2023.15\">https://doi.org/10.4230/LIPIcs.ITP.2023.15</a>.","short":"M. Dvorak, J. Blanchette, in:, 14th International Conference on Interactive Theorem Proving, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","ieee":"M. Dvorak and J. Blanchette, “Closure properties of general grammars - formally verified,” in <i>14th International Conference on Interactive Theorem Proving</i>, Bialystok, Poland, 2023, vol. 268.","apa":"Dvorak, M., &#38; Blanchette, J. (2023). Closure properties of general grammars - formally verified. In <i>14th International Conference on Interactive Theorem Proving</i> (Vol. 268). Bialystok, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ITP.2023.15\">https://doi.org/10.4230/LIPIcs.ITP.2023.15</a>","ama":"Dvorak M, Blanchette J. Closure properties of general grammars - formally verified. In: <i>14th International Conference on Interactive Theorem Proving</i>. Vol 268. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITP.2023.15\">10.4230/LIPIcs.ITP.2023.15</a>","mla":"Dvorak, Martin, and Jasmin Blanchette. “Closure Properties of General Grammars - Formally Verified.” <i>14th International Conference on Interactive Theorem Proving</i>, vol. 268, 15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITP.2023.15\">10.4230/LIPIcs.ITP.2023.15</a>.","ista":"Dvorak M, Blanchette J. 2023. Closure properties of general grammars - formally verified. 14th International Conference on Interactive Theorem Proving. ITP: Interactive Theorem Proving, LIPIcs, vol. 268, 15."},"volume":268,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","isi":1,"title":"Closure properties of general grammars - formally verified","arxiv":1,"oa":1,"has_accepted_license":"1","month":"07","article_number":"15","date_updated":"2026-07-29T12:56:51Z","_id":"13120","quality_controlled":"1","department":[{"_id":"GradSch"},{"_id":"VlKo"}],"fulldoi":"https://doi.org/10.4230/LIPIcs.ITP.2023.15","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_identifier":{"isbn":["9783959772846"],"eissn":["1868-8969"]},"year":"2023","alternative_title":["LIPIcs"]},{"article_number":"142","date_updated":"2026-07-29T13:03:30Z","_id":"13049","keyword":["PCB design and layout","Mesh geometry models"],"isi":1,"title":"PCBend: Light up your 3D shapes with foldable circuit boards","acknowledged_ssus":[{"_id":"M-Shop"}],"month":"07","article_type":"original","oa":1,"has_accepted_license":"1","quality_controlled":"1","department":[{"_id":"GradSch"},{"_id":"BeBi"}],"publisher":"Association for Computing Machinery","year":"2023","ec_funded":1,"publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"fulldoi":"https://doi.org/10.1145/3592411","abstract":[{"lang":"eng","text":"We propose a computational design approach for covering a surface with individually addressable RGB LEDs, effectively forming a low-resolution surface screen. To achieve a low-cost and scalable approach, we propose creating designs from flat PCB panels bent in-place along the surface of a 3D printed core. Working with standard rigid PCBs enables the use of\r\nestablished PCB manufacturing services, allowing the fabrication of designs with several hundred LEDs. \r\nOur approach optimizes the PCB geometry for folding, and then jointly optimizes the LED packing, circuit and routing, solving a challenging layout problem under strict manufacturing requirements. Unlike paper, PCBs cannot bend beyond a certain point without breaking. Therefore, we introduce parametric cut patterns acting as hinges, designed to allow bending while remaining compact. To tackle the joint optimization of placement, circuit and routing, we propose a specialized algorithm that splits the global problem into one sub-problem per triangle, which is then individually solved.\r\nOur technique generates PCB blueprints in a completely automated way. After being fabricated by a PCB manufacturing service, the boards are bent and glued by the user onto the 3D printed support. We demonstrate our technique on a range of physical models and virtual examples, creating intricate surface light patterns from hundreds of LEDs."}],"publication":"Transactions on Graphics","language":[{"iso":"eng"}],"status":"public","acknowledgement":"We thank the reviewers for the valuable feedback. We also thank the Miba Machine Shop at ISTA, PCBWay, and PragoBoard for helping us with fabrication and assembly. This project was supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (Grant Agreement No. 715767 – MATERIALIZABLE).","date_created":"2023-05-22T08:37:04Z","corr_author":"1","day":"26","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"20276"}]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"file_date_updated":"2023-06-20T12:20:51Z","date_published":"2023-07-26T00:00:00Z","volume":42,"article_processing_charge":"No","conference":{"name":"SIGGRAPH: Computer Graphics and Interactive Techniques Conference","end_date":"2023-08-10","start_date":"2023-08-06","location":"Los Angeles, CA, United States"},"ddc":["006"],"citation":{"ista":"Freire M, Bhargava M, Schreck C, Hugron P-A, Bickel B, Lefebvre S. 2023. PCBend: Light up your 3D shapes with foldable circuit boards. Transactions on Graphics. 42(4), 142.","mla":"Freire, Marco, et al. “PCBend: Light up Your 3D Shapes with Foldable Circuit Boards.” <i>Transactions on Graphics</i>, vol. 42, no. 4, 142, Association for Computing Machinery, 2023, doi:<a href=\"https://doi.org/10.1145/3592411\">10.1145/3592411</a>.","ieee":"M. Freire, M. Bhargava, C. Schreck, P.-A. Hugron, B. Bickel, and S. Lefebvre, “PCBend: Light up your 3D shapes with foldable circuit boards,” <i>Transactions on Graphics</i>, vol. 42, no. 4. Association for Computing Machinery, 2023.","ama":"Freire M, Bhargava M, Schreck C, Hugron P-A, Bickel B, Lefebvre S. PCBend: Light up your 3D shapes with foldable circuit boards. <i>Transactions on Graphics</i>. 2023;42(4). doi:<a href=\"https://doi.org/10.1145/3592411\">10.1145/3592411</a>","apa":"Freire, M., Bhargava, M., Schreck, C., Hugron, P.-A., Bickel, B., &#38; Lefebvre, S. (2023). PCBend: Light up your 3D shapes with foldable circuit boards. <i>Transactions on Graphics</i>. Los Angeles, CA, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3592411\">https://doi.org/10.1145/3592411</a>","chicago":"Freire, Marco, Manas Bhargava, Camille Schreck, Pierre-Alexandre Hugron, Bernd Bickel, and Sylvain Lefebvre. “PCBend: Light up Your 3D Shapes with Foldable Circuit Boards.” <i>Transactions on Graphics</i>. Association for Computing Machinery, 2023. <a href=\"https://doi.org/10.1145/3592411\">https://doi.org/10.1145/3592411</a>.","short":"M. Freire, M. Bhargava, C. Schreck, P.-A. Hugron, B. Bickel, S. Lefebvre, Transactions on Graphics 42 (2023)."},"publication_status":"published","issue":"4","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767"}],"external_id":{"isi":["001044671300108"]},"author":[{"last_name":"Freire","full_name":"Freire, Marco","first_name":"Marco"},{"last_name":"Bhargava","orcid":"0009-0007-6138-6890","full_name":"Bhargava, Manas","first_name":"Manas","id":"FF8FA64C-AA6A-11E9-99AD-50D4E5697425"},{"first_name":"Camille","full_name":"Schreck, Camille","last_name":"Schreck","id":"2B14B676-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hugron, Pierre-Alexandre","first_name":"Pierre-Alexandre","last_name":"Hugron"},{"first_name":"Bernd","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lefebvre","full_name":"Lefebvre, Sylvain","first_name":"Sylvain"}],"type":"journal_article","scopus_import":"1","file":[{"checksum":"a0b0ba3b36f43a94388e8824613d812a","date_created":"2023-06-19T11:02:23Z","file_name":"2023_ACMToG_Freire.pdf","content_type":"application/pdf","date_updated":"2023-06-19T11:02:23Z","success":1,"file_size":78940724,"file_id":"13156","access_level":"open_access","creator":"dernst","relation":"main_file"},{"access_level":"open_access","file_id":"13157","creator":"dernst","relation":"main_file","file_name":"2023_ACMToG_SuppMaterial_Freire.pdf","date_created":"2023-06-20T12:20:51Z","checksum":"b9206bbb67af82df49b7e7cdbde3410c","success":1,"file_size":34345905,"date_updated":"2023-06-20T12:20:51Z","content_type":"application/pdf"}],"oa_version":"Submitted Version","intvolume":"        42","doi":"10.1145/3592411"},{"_id":"14343","article_number":"e74","date_updated":"2026-07-29T13:18:16Z","oa":1,"has_accepted_license":"1","month":"08","article_type":"original","isi":1,"title":"Gaussian fluctuations in the equipartition principle for Wigner matrices","arxiv":1,"fulldoi":"https://doi.org/10.1017/fms.2023.70","publisher":"Cambridge University Press","year":"2023","publication_identifier":{"eissn":["2050-5094"]},"ec_funded":1,"quality_controlled":"1","department":[{"_id":"LaEr"},{"_id":"GradSch"}],"date_created":"2023-09-17T22:01:09Z","status":"public","language":[{"iso":"eng"}],"acknowledgement":"G.C. and L.E. gratefully acknowledge many discussions with Dominik Schröder at the preliminary stage of this project, especially his essential contribution to identify the correct generalisation of traceless observables to the deformed Wigner ensembles.\r\nL.E. and J.H. acknowledges support by ERC Advanced Grant ‘RMTBeyond’ No. 101020331.","abstract":[{"text":"The total energy of an eigenstate in a composite quantum system tends to be distributed equally among its constituents. We identify the quantum fluctuation around this equipartition principle in the simplest disordered quantum system consisting of linear combinations of Wigner matrices. As our main ingredient, we prove the Eigenstate Thermalisation Hypothesis and Gaussian fluctuation for general quadratic forms of the bulk eigenvectors of Wigner matrices with an arbitrary deformation.","lang":"eng"}],"publication":"Forum of Mathematics, Sigma","date_published":"2023-08-23T00:00:00Z","file_date_updated":"2023-09-20T11:09:35Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"related_material":{"record":[{"id":"19540","relation":"dissertation_contains","status":"public"}]},"corr_author":"1","day":"23","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"62796744-2b32-11ec-9570-940b20777f1d","call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta","grant_number":"101020331"}],"publication_status":"published","article_processing_charge":"Yes","citation":{"apa":"Cipolloni, G., Erdös, L., Henheik, S. J., &#38; Kolupaiev, O. (2023). Gaussian fluctuations in the equipartition principle for Wigner matrices. <i>Forum of Mathematics, Sigma</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/fms.2023.70\">https://doi.org/10.1017/fms.2023.70</a>","ama":"Cipolloni G, Erdös L, Henheik SJ, Kolupaiev O. Gaussian fluctuations in the equipartition principle for Wigner matrices. <i>Forum of Mathematics, Sigma</i>. 2023;11. doi:<a href=\"https://doi.org/10.1017/fms.2023.70\">10.1017/fms.2023.70</a>","ieee":"G. Cipolloni, L. Erdös, S. J. Henheik, and O. Kolupaiev, “Gaussian fluctuations in the equipartition principle for Wigner matrices,” <i>Forum of Mathematics, Sigma</i>, vol. 11. Cambridge University Press, 2023.","chicago":"Cipolloni, Giorgio, László Erdös, Sven Joscha Henheik, and Oleksii Kolupaiev. “Gaussian Fluctuations in the Equipartition Principle for Wigner Matrices.” <i>Forum of Mathematics, Sigma</i>. Cambridge University Press, 2023. <a href=\"https://doi.org/10.1017/fms.2023.70\">https://doi.org/10.1017/fms.2023.70</a>.","short":"G. Cipolloni, L. Erdös, S.J. Henheik, O. Kolupaiev, Forum of Mathematics, Sigma 11 (2023).","ista":"Cipolloni G, Erdös L, Henheik SJ, Kolupaiev O. 2023. Gaussian fluctuations in the equipartition principle for Wigner matrices. Forum of Mathematics, Sigma. 11, e74.","mla":"Cipolloni, Giorgio, et al. “Gaussian Fluctuations in the Equipartition Principle for Wigner Matrices.” <i>Forum of Mathematics, Sigma</i>, vol. 11, e74, Cambridge University Press, 2023, doi:<a href=\"https://doi.org/10.1017/fms.2023.70\">10.1017/fms.2023.70</a>."},"ddc":["510"],"volume":11,"intvolume":"        11","doi":"10.1017/fms.2023.70","oa_version":"Published Version","type":"journal_article","file":[{"checksum":"eb747420e6a88a7796fa934151957676","date_created":"2023-09-20T11:09:35Z","file_name":"2023_ForumMathematics_Cipolloni.pdf","date_updated":"2023-09-20T11:09:35Z","content_type":"application/pdf","success":1,"file_size":852652,"file_id":"14352","access_level":"open_access","creator":"dernst","relation":"main_file"}],"scopus_import":"1","external_id":{"arxiv":["2301.05181"],"isi":["001051980200001"]},"author":[{"id":"42198EFA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4901-7992","last_name":"Cipolloni","first_name":"Giorgio","full_name":"Cipolloni, Giorgio"},{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László","first_name":"László","last_name":"Erdös","orcid":"0000-0001-5366-9603"},{"id":"31d731d7-d235-11ea-ad11-b50331c8d7fb","first_name":"Sven Joscha","full_name":"Henheik, Sven Joscha","orcid":"0000-0003-1106-327X","last_name":"Henheik"},{"id":"149b70d4-896a-11ed-bdf8-8c63fd44ca61","last_name":"Kolupaiev","orcid":"0000-0003-1491-4623","full_name":"Kolupaiev, Oleksii","first_name":"Oleksii"}]},{"publication_identifier":{"eissn":["1751-8121"],"issn":["1751-8113"]},"year":"2023","ec_funded":1,"publisher":"IOP Publishing","fulldoi":"https://doi.org/10.1088/1751-8121/acfe62","department":[{"_id":"GradSch"},{"_id":"LaEr"}],"quality_controlled":"1","month":"10","article_type":"original","has_accepted_license":"1","oa":1,"arxiv":1,"title":"Creation rate of Dirac particles at a point source","isi":1,"_id":"14421","date_updated":"2026-07-29T13:18:16Z","article_number":"445201","oa_version":"Published Version","doi":"10.1088/1751-8121/acfe62","intvolume":"        56","author":[{"full_name":"Henheik, Sven Joscha","first_name":"Sven Joscha","last_name":"Henheik","orcid":"0000-0003-1106-327X","id":"31d731d7-d235-11ea-ad11-b50331c8d7fb"},{"last_name":"Tumulka","first_name":"Roderich","full_name":"Tumulka, Roderich"}],"external_id":{"arxiv":["2211.16606"],"isi":["001080908000001"]},"scopus_import":"1","file":[{"access_level":"open_access","file_id":"14429","relation":"main_file","creator":"dernst","date_created":"2023-10-16T07:07:24Z","file_name":"2023_JourPhysics_Henheik.pdf","checksum":"5b68de147dd4c608b71a6e0e844d2ce9","file_size":721399,"success":1,"date_updated":"2023-10-16T07:07:24Z","content_type":"application/pdf"}],"type":"journal_article","issue":"44","publication_status":"published","project":[{"_id":"62796744-2b32-11ec-9570-940b20777f1d","call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta","grant_number":"101020331"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":56,"citation":{"ista":"Henheik SJ, Tumulka R. 2023. Creation rate of Dirac particles at a point source. Journal of Physics A: Mathematical and Theoretical. 56(44), 445201.","mla":"Henheik, Sven Joscha, and Roderich Tumulka. “Creation Rate of Dirac Particles at a Point Source.” <i>Journal of Physics A: Mathematical and Theoretical</i>, vol. 56, no. 44, 445201, IOP Publishing, 2023, doi:<a href=\"https://doi.org/10.1088/1751-8121/acfe62\">10.1088/1751-8121/acfe62</a>.","ieee":"S. J. Henheik and R. Tumulka, “Creation rate of Dirac particles at a point source,” <i>Journal of Physics A: Mathematical and Theoretical</i>, vol. 56, no. 44. IOP Publishing, 2023.","apa":"Henheik, S. J., &#38; Tumulka, R. (2023). Creation rate of Dirac particles at a point source. <i>Journal of Physics A: Mathematical and Theoretical</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1751-8121/acfe62\">https://doi.org/10.1088/1751-8121/acfe62</a>","ama":"Henheik SJ, Tumulka R. Creation rate of Dirac particles at a point source. <i>Journal of Physics A: Mathematical and Theoretical</i>. 2023;56(44). doi:<a href=\"https://doi.org/10.1088/1751-8121/acfe62\">10.1088/1751-8121/acfe62</a>","chicago":"Henheik, Sven Joscha, and Roderich Tumulka. “Creation Rate of Dirac Particles at a Point Source.” <i>Journal of Physics A: Mathematical and Theoretical</i>. IOP Publishing, 2023. <a href=\"https://doi.org/10.1088/1751-8121/acfe62\">https://doi.org/10.1088/1751-8121/acfe62</a>.","short":"S.J. Henheik, R. Tumulka, Journal of Physics A: Mathematical and Theoretical 56 (2023)."},"ddc":["510"],"article_processing_charge":"Yes (via OA deal)","file_date_updated":"2023-10-16T07:07:24Z","date_published":"2023-10-11T00:00:00Z","day":"11","corr_author":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"19540"}]},"date_created":"2023-10-12T12:42:53Z","publication":"Journal of Physics A: Mathematical and Theoretical","abstract":[{"lang":"eng","text":"Only recently has it been possible to construct a self-adjoint Hamiltonian that involves the creation of Dirac particles at a point source in 3d space. Its definition makes use of an interior-boundary condition. Here, we develop for this Hamiltonian a corresponding theory of the Bohmian configuration. That is, we (non-rigorously) construct a Markov jump process $(Q_t)_{t\\in\\mathbb{R}}$ in the configuration space of a variable number of particles that is $|\\psi_t|^2$-distributed at every time t and follows Bohmian trajectories between the jumps. The jumps correspond to particle creation or annihilation events and occur either to or from a configuration with a particle located at the source. The process is the natural analog of Bell's jump process, and a central piece in its construction is the determination of the rate of particle creation. The construction requires an analysis of the asymptotic behavior of the Bohmian trajectories near the source. We find that the particle reaches the source with radial speed 0, but orbits around the source infinitely many times in finite time before absorption (or after emission)."}],"language":[{"iso":"eng"}],"acknowledgement":"J H gratefully acknowledges partial financial support by the ERC Advanced Grant 'RMTBeyond' No. 101020331.","status":"public"},{"date_created":"2023-10-15T22:01:10Z","language":[{"iso":"eng"}],"acknowledgement":"F.S., J.H., and B.C. thank the Swiss National Supercomputing Centre (CSCS) for the generous allocation of CPU hours via production project s1108 at the Piz Daint supercomputer. B.C. acknowledges resources provided by the Cambridge Tier-2 system operated by the University of Cambridge Research Computing Service funded by EPSRC Tier-2 capital grant EP/P020259/1. J.C. acknowledges the Beijing Natural Science Foundation for support under grant No. JQ22001. F.S., and J.H. thank the Swiss Platform for Advanced Scientific Computing (PASC) via the 2021-2024 “Ab Initio Molecular Dynamics at the Exa-Scale” project. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 101034413.","status":"public","abstract":[{"text":"Water adsorption and dissociation processes on pristine low-index TiO2 interfaces are important but poorly understood outside the well-studied anatase (101) and rutile (110). To understand these, we construct three sets of machine learning potentials that are simultaneously applicable to various TiO2 surfaces, based on three density-functional-theory approximations. Here we show the water dissociation free energies on seven pristine TiO2 surfaces, and predict that anatase (100), anatase (110), rutile (001), and rutile (011) favor water dissociation, anatase (101) and rutile (100) have mostly molecular adsorption, while the simulations of rutile (110) sensitively depend on the slab thickness and molecular adsorption is preferred with thick slabs. Moreover, using an automated algorithm, we reveal that these surfaces follow different types of atomistic mechanisms for proton transfer and water dissociation: one-step, two-step, or both. These mechanisms can be rationalized based on the arrangements of water molecules on the different surfaces. Our finding thus demonstrates that the different pristine TiO2 surfaces react with water in distinct ways, and cannot be represented using just the low-energy anatase (101) and rutile (110) surfaces.","lang":"eng"}],"publication":"Nature Communications","dataavailabilitystatement":"The machine learning potentials, training sets, sample DFT and metadynamics input files, PYTHON data analysis scripts and other necessary source data files generated for this study are available in the SI repository (https://github.com/BingqingCheng/TiO2-water) see ref 58.\r\n58. Zeng, Z. et al. Source data for Mechanistic insight on water dissociation on pristine low-index TiO2 surfaces from machine learning molecular dynamics simulations, Zenodo, https://zenodo.org/record/8301965 (2023).","das_tickbox":"1","date_published":"2023-10-02T00:00:00Z","file_date_updated":"2023-10-16T07:34:49Z","related_material":{"link":[{"relation":"software","url":"https://github.com/BingqingCheng/TiO2-water"}]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"corr_author":"1","day":"02","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413"}],"publication_status":"published","article_processing_charge":"Yes","supplementarymaterial":"yes","ddc":["540","000"],"citation":{"mla":"Zeng, Zezhu, et al. “Mechanistic Insight on Water Dissociation on Pristine Low-Index TiO2 Surfaces from Machine Learning Molecular Dynamics Simulations.” <i>Nature Communications</i>, vol. 14, 6131, Springer Nature, 2023, doi:<a href=\"https://doi.org/10.1038/s41467-023-41865-8\">10.1038/s41467-023-41865-8</a>.","ista":"Zeng Z, Wodaczek F, Liu K, Stein F, Hutter J, Chen J, Cheng B. 2023. Mechanistic insight on water dissociation on pristine low-index TiO2 surfaces from machine learning molecular dynamics simulations. Nature Communications. 14, 6131.","short":"Z. Zeng, F. Wodaczek, K. Liu, F. Stein, J. Hutter, J. Chen, B. Cheng, Nature Communications 14 (2023).","chicago":"Zeng, Zezhu, Felix Wodaczek, Keyang Liu, Frederick Stein, Jürg Hutter, Ji Chen, and Bingqing Cheng. “Mechanistic Insight on Water Dissociation on Pristine Low-Index TiO2 Surfaces from Machine Learning Molecular Dynamics Simulations.” <i>Nature Communications</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1038/s41467-023-41865-8\">https://doi.org/10.1038/s41467-023-41865-8</a>.","ieee":"Z. Zeng <i>et al.</i>, “Mechanistic insight on water dissociation on pristine low-index TiO2 surfaces from machine learning molecular dynamics simulations,” <i>Nature Communications</i>, vol. 14. Springer Nature, 2023.","apa":"Zeng, Z., Wodaczek, F., Liu, K., Stein, F., Hutter, J., Chen, J., &#38; Cheng, B. (2023). Mechanistic insight on water dissociation on pristine low-index TiO2 surfaces from machine learning molecular dynamics simulations. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-023-41865-8\">https://doi.org/10.1038/s41467-023-41865-8</a>","ama":"Zeng Z, Wodaczek F, Liu K, et al. Mechanistic insight on water dissociation on pristine low-index TiO2 surfaces from machine learning molecular dynamics simulations. <i>Nature Communications</i>. 2023;14. doi:<a href=\"https://doi.org/10.1038/s41467-023-41865-8\">10.1038/s41467-023-41865-8</a>"},"volume":14,"researchdata_availability":"yes","intvolume":"        14","doi":"10.1038/s41467-023-41865-8","oa_version":"Published Version","type":"journal_article","scopus_import":"1","file":[{"content_type":"application/pdf","date_updated":"2023-10-16T07:34:49Z","file_size":3194116,"success":1,"checksum":"7d1dffd36b672ec679f08f70ce79da87","file_name":"2023_NatureComm_Zeng.pdf","date_created":"2023-10-16T07:34:49Z","creator":"dernst","relation":"main_file","file_id":"14432","access_level":"open_access"}],"external_id":{"pmid":["37783698"],"isi":["001084354900008"],"arxiv":["2303.07433"]},"author":[{"full_name":"Zeng, Zezhu","first_name":"Zezhu","last_name":"Zeng","orcid":"0000-0001-5126-4928","id":"54a2c730-803f-11ed-ab7e-95b29d2680e7"},{"id":"8b4b6a9f-32b0-11ee-9fa8-bbe85e26258e","orcid":"0009-0000-1457-795X","last_name":"Wodaczek","first_name":"Felix","full_name":"Wodaczek, Felix"},{"last_name":"Liu","full_name":"Liu, Keyang","first_name":"Keyang"},{"last_name":"Stein","full_name":"Stein, Frederick","first_name":"Frederick"},{"first_name":"Jürg","full_name":"Hutter, Jürg","last_name":"Hutter"},{"last_name":"Chen","first_name":"Ji","full_name":"Chen, Ji"},{"last_name":"Cheng","orcid":"0000-0002-3584-9632","full_name":"Cheng, Bingqing","first_name":"Bingqing","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9"}],"_id":"14425","article_number":"6131","date_updated":"2026-08-07T11:00:29Z","oa":1,"has_accepted_license":"1","pmid":1,"article_type":"original","month":"10","title":"Mechanistic insight on water dissociation on pristine low-index TiO2 surfaces from machine learning molecular dynamics simulations","isi":1,"arxiv":1,"fulldoi":"https://doi.org/10.1038/s41467-023-41865-8","publisher":"Springer Nature","ec_funded":1,"year":"2023","publication_identifier":{"eissn":["2041-1723"]},"department":[{"_id":"BiCh"},{"_id":"GradSch"}],"quality_controlled":"1"},{"alternative_title":["ISTA Thesis"],"publisher":"Institute of Science and Technology Austria","ec_funded":1,"year":"2023","publication_identifier":{"issn":["2663-337X"]},"fulldoi":"https://doi.org/10.15479/at:ista:13074","department":[{"_id":"GradSch"},{"_id":"DaAl"},{"_id":"ChLa"}],"_id":"13074","date_updated":"2026-08-12T06:34:07Z","month":"05","acknowledged_ssus":[{"_id":"ScienComp"}],"oa":1,"has_accepted_license":"1","title":"Efficiency and generalization of sparse neural networks","publication_status":"published","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","project":[{"name":"International IST Doctoral Program","grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020"}],"degree_awarded":"PhD","OA_place":"publisher","article_processing_charge":"No","ddc":["000"],"citation":{"ieee":"A. Krumes, “Efficiency and generalization of sparse neural networks,” Institute of Science and Technology Austria, 2023.","ama":"Krumes A. Efficiency and generalization of sparse neural networks. 2023. doi:<a href=\"https://doi.org/10.15479/at:ista:13074\">10.15479/at:ista:13074</a>","apa":"Krumes, A. (2023). <i>Efficiency and generalization of sparse neural networks</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:13074\">https://doi.org/10.15479/at:ista:13074</a>","short":"A. Krumes, Efficiency and Generalization of Sparse Neural Networks, Institute of Science and Technology Austria, 2023.","chicago":"Krumes, Alexandra. “Efficiency and Generalization of Sparse Neural Networks.” Institute of Science and Technology Austria, 2023. <a href=\"https://doi.org/10.15479/at:ista:13074\">https://doi.org/10.15479/at:ista:13074</a>.","ista":"Krumes A. 2023. Efficiency and generalization of sparse neural networks. Institute of Science and Technology Austria.","mla":"Krumes, Alexandra. <i>Efficiency and Generalization of Sparse Neural Networks</i>. Institute of Science and Technology Austria, 2023, doi:<a href=\"https://doi.org/10.15479/at:ista:13074\">10.15479/at:ista:13074</a>."},"oa_version":"Published Version","doi":"10.15479/at:ista:13074","author":[{"id":"32D78294-F248-11E8-B48F-1D18A9856A87","first_name":"Elena-Alexandra","full_name":"Peste, Elena-Alexandra","last_name":"Peste"}],"type":"dissertation","file":[{"checksum":"6b3354968403cb9d48cc5a83611fb571","date_created":"2023-05-24T16:11:16Z","file_name":"PhD_Thesis_Alexandra_Peste_final.pdf","date_updated":"2023-05-24T16:11:16Z","content_type":"application/pdf","file_size":2152072,"success":1,"file_id":"13087","access_level":"open_access","relation":"main_file","creator":"epeste"},{"access_level":"closed","file_id":"13088","relation":"source_file","creator":"epeste","file_name":"PhD_Thesis_APeste.zip","date_created":"2023-05-24T16:12:59Z","checksum":"8d0df94bbcf4db72c991f22503b3fd60","file_size":1658293,"date_updated":"2023-05-24T16:12:59Z","content_type":"application/zip"}],"date_created":"2023-05-23T17:07:53Z","abstract":[{"text":"Deep learning has become an integral part of a large number of important applications, and many of the recent breakthroughs have been enabled by the ability to train very large models, capable to capture complex patterns and relationships from the data. At the same time, the massive sizes of modern deep learning models have made their deployment to smaller devices more challenging; this is particularly important, as in many applications the users rely on accurate deep learning predictions, but they only have access to devices with limited memory and compute power. One solution to this problem is to prune neural networks, by setting as many of their parameters as possible to zero, to obtain accurate sparse models with lower memory footprint. Despite the great research progress in obtaining sparse models that preserve accuracy, while satisfying memory and computational constraints, there are still many challenges associated with efficiently training sparse models, as well as understanding their generalization properties.\r\n\r\nThe focus of this thesis is to investigate how the training process of sparse models can be made more efficient, and to understand the differences between sparse and dense models in terms of how well they can generalize to changes in the data distribution. We first study a method for co-training sparse and dense models, at a lower cost compared to regular training. With our method we can obtain very accurate sparse networks, and dense models that can recover the baseline accuracy. Furthermore, we are able to more easily analyze the differences, at prediction level, between the sparse-dense model pairs. Next, we investigate the generalization properties of sparse neural networks in more detail, by studying how well different sparse models trained on a larger task can adapt to smaller, more specialized tasks, in a transfer learning scenario. Our analysis across multiple pruning methods and sparsity levels reveals that sparse models provide features that can transfer similarly to or better than the dense baseline. However, the choice of the pruning method plays an important role, and can influence the results when the features are fixed (linear finetuning), or when they are allowed to adapt to the new task (full finetuning). Using sparse models with fixed masks for finetuning on new tasks has an important practical advantage, as it enables training neural networks on smaller devices. However, one drawback of current pruning methods is that the entire training cycle has to be repeated to obtain the initial sparse model, for every sparsity target; in consequence, the entire training process is costly and also multiple models need to be stored. In the last part of the thesis we propose a method that can train accurate dense models that are compressible in a single step, to multiple sparsity levels, without additional finetuning. Our method results in sparse models that can be competitive with existing pruning methods, and which can also successfully generalize to new tasks.","lang":"eng"}],"supervisor":[{"orcid":"0000-0001-8622-7887","last_name":"Lampert","first_name":"Christoph","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X"}],"status":"public","language":[{"iso":"eng"}],"page":"147","file_date_updated":"2023-05-24T16:12:59Z","date_published":"2023-05-23T00:00:00Z","corr_author":"1","day":"23","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"13053"},{"status":"public","relation":"part_of_dissertation","id":"11458"},{"id":"12299","status":"public","relation":"part_of_dissertation"}]}},{"title":"Safety and liveness of quantitative automata","isi":1,"arxiv":1,"has_accepted_license":"1","oa":1,"month":"09","date_updated":"2026-08-12T08:46:04Z","article_number":"17","_id":"13221","quality_controlled":"1","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"fulldoi":"https://doi.org/10.4230/LIPIcs.CONCUR.2023.17","ec_funded":1,"publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959772990"]},"year":"2023","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","alternative_title":["LIPIcs"],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"20147"},{"relation":"later_version","status":"public","id":"20342"}]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"day":"01","corr_author":"1","date_published":"2023-09-01T00:00:00Z","file_date_updated":"2023-07-14T12:03:48Z","language":[{"iso":"eng"}],"acknowledgement":"We thank Christof Löding for pointing us to some results on PSpace-hardess of universality problems and the anonymous reviewers for their helpful comments. This work was supported in part by the ERC-2020-AdG 101020093 and the Israel Science Foundation grant 2410/22.","status":"public","publication":"34th International Conference on Concurrency Theory","abstract":[{"lang":"eng","text":"The safety-liveness dichotomy is a fundamental concept in formal languages which plays a key role in verification. Recently, this dichotomy has been lifted to quantitative properties, which are arbitrary functions from infinite words to partially-ordered domains. We look into harnessing the dichotomy for the specific classes of quantitative properties expressed by quantitative automata. These automata contain finitely many states and rational-valued transition weights, and their common value functions Inf, Sup, LimInf, LimSup, LimInfAvg, LimSupAvg, and DSum map infinite words into the totallyordered domain of real numbers. In this automata-theoretic setting, we establish a connection between quantitative safety and topological continuity and provide an alternative characterization of quantitative safety and liveness in terms of their boolean counterparts. For all common value functions, we show how the safety closure of a quantitative automaton can be constructed in PTime, and we provide PSpace-complete checks of whether a given quantitative automaton is safe or live, with the exception of LimInfAvg and LimSupAvg automata, for which the safety check is in ExpSpace. Moreover, for deterministic Sup, LimInf, and LimSup automata, we give PTime decompositions into safe and live automata. These decompositions enable the separation of techniques for safety and liveness verification for quantitative specifications."}],"date_created":"2023-07-14T10:00:15Z","scopus_import":"1","file":[{"date_updated":"2023-07-14T12:03:48Z","content_type":"application/pdf","file_size":755529,"success":1,"checksum":"d40e57a04448ea5c77d7e1cfb9590a81","file_name":"CONCUR23.pdf","date_created":"2023-07-14T12:03:48Z","relation":"main_file","creator":"esarac","file_id":"13224","access_level":"open_access"}],"type":"conference","author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","last_name":"Boker","first_name":"Udi","full_name":"Boker, Udi"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Mazzocchi","first_name":"Nicolas Adrien","full_name":"Mazzocchi, Nicolas Adrien","id":"b26baa86-3308-11ec-87b0-8990f34baa85"},{"last_name":"Sarac","first_name":"Naci E","full_name":"Sarac, Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425"}],"external_id":{"arxiv":["2307.06016"],"isi":["001570542500017"]},"doi":"10.4230/LIPIcs.CONCUR.2023.17","intvolume":"       279","oa_version":"Published Version","ddc":["000"],"citation":{"ama":"Boker U, Henzinger TA, Mazzocchi NA, Sarac NE. Safety and liveness of quantitative automata. In: <i>34th International Conference on Concurrency Theory</i>. Vol 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2023.17\">10.4230/LIPIcs.CONCUR.2023.17</a>","apa":"Boker, U., Henzinger, T. A., Mazzocchi, N. A., &#38; Sarac, N. E. (2023). Safety and liveness of quantitative automata. In <i>34th International Conference on Concurrency Theory</i> (Vol. 279). Antwerp, Belgium: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2023.17\">https://doi.org/10.4230/LIPIcs.CONCUR.2023.17</a>","ieee":"U. Boker, T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Safety and liveness of quantitative automata,” in <i>34th International Conference on Concurrency Theory</i>, Antwerp, Belgium, 2023, vol. 279.","chicago":"Boker, Udi, Thomas A Henzinger, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Safety and Liveness of Quantitative Automata.” In <i>34th International Conference on Concurrency Theory</i>, Vol. 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2023.17\">https://doi.org/10.4230/LIPIcs.CONCUR.2023.17</a>.","short":"U. Boker, T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 34th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","ista":"Boker U, Henzinger TA, Mazzocchi NA, Sarac NE. 2023. Safety and liveness of quantitative automata. 34th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 279, 17.","mla":"Boker, Udi, et al. “Safety and Liveness of Quantitative Automata.” <i>34th International Conference on Concurrency Theory</i>, vol. 279, 17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2023.17\">10.4230/LIPIcs.CONCUR.2023.17</a>."},"article_processing_charge":"No","conference":{"end_date":"2023-09-23","name":"CONCUR: Conference on Concurrency Theory","location":"Antwerp, Belgium","start_date":"2023-09-18"},"volume":279,"project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published"},{"oa_version":"Published Version","intvolume":"       974","doi":"10.1017/jfm.2023.780","external_id":{"arxiv":["2212.12406"],"isi":["001088363700001"]},"author":[{"id":"0BE7553A-1004-11EA-B805-18983DDC885E","orcid":"0000-0001-7173-4923","last_name":"Marensi","first_name":"Elena","full_name":"Marensi, Elena"},{"first_name":"Gökhan","full_name":"Yalniz, Gökhan","orcid":"0000-0002-8490-9312","last_name":"Yalniz","id":"66E74FA2-D8BF-11E9-8249-8DE2E5697425"},{"full_name":"Hof, Björn","first_name":"Björn","last_name":"Hof","orcid":"0000-0003-2057-2754","id":"3A374330-F248-11E8-B48F-1D18A9856A87"}],"type":"journal_article","file":[{"file_id":"14996","access_level":"open_access","relation":"main_file","creator":"dernst","checksum":"17c64c1fb0d5f73252364bf98b0b9e1a","file_name":"2023_JourFluidMechanics_Marensi.pdf","date_created":"2024-02-15T09:05:21Z","content_type":"application/pdf","date_updated":"2024-02-15T09:05:21Z","file_size":2804641,"success":1}],"scopus_import":"1","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"662960","name":"Revisiting the Turbulence Problem Using Statistical Mechanics","_id":"238598C6-32DE-11EA-91FC-C7463DDC885E"}],"volume":974,"article_processing_charge":"Yes (via OA deal)","citation":{"mla":"Marensi, Elena, et al. “Dynamics and Proliferation of Turbulent Stripes in Plane-Poiseuille and Plane-Couette Flows.” <i>Journal of Fluid Mechanics</i>, vol. 974, A21, Cambridge University Press, 2023, doi:<a href=\"https://doi.org/10.1017/jfm.2023.780\">10.1017/jfm.2023.780</a>.","ista":"Marensi E, Yalniz G, Hof B. 2023. Dynamics and proliferation of turbulent stripes in plane-Poiseuille and plane-Couette flows. Journal of Fluid Mechanics. 974, A21.","chicago":"Marensi, Elena, Gökhan Yalniz, and Björn Hof. “Dynamics and Proliferation of Turbulent Stripes in Plane-Poiseuille and Plane-Couette Flows.” <i>Journal of Fluid Mechanics</i>. Cambridge University Press, 2023. <a href=\"https://doi.org/10.1017/jfm.2023.780\">https://doi.org/10.1017/jfm.2023.780</a>.","short":"E. Marensi, G. Yalniz, B. Hof, Journal of Fluid Mechanics 974 (2023).","ieee":"E. Marensi, G. Yalniz, and B. Hof, “Dynamics and proliferation of turbulent stripes in plane-Poiseuille and plane-Couette flows,” <i>Journal of Fluid Mechanics</i>, vol. 974. Cambridge University Press, 2023.","ama":"Marensi E, Yalniz G, Hof B. Dynamics and proliferation of turbulent stripes in plane-Poiseuille and plane-Couette flows. <i>Journal of Fluid Mechanics</i>. 2023;974. doi:<a href=\"https://doi.org/10.1017/jfm.2023.780\">10.1017/jfm.2023.780</a>","apa":"Marensi, E., Yalniz, G., &#38; Hof, B. (2023). Dynamics and proliferation of turbulent stripes in plane-Poiseuille and plane-Couette flows. <i>Journal of Fluid Mechanics</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/jfm.2023.780\">https://doi.org/10.1017/jfm.2023.780</a>"},"ddc":["530"],"file_date_updated":"2024-02-15T09:05:21Z","date_published":"2023-11-10T00:00:00Z","corr_author":"1","day":"10","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"19684"}]},"date_created":"2023-10-30T09:32:28Z","abstract":[{"text":"The first long-lived turbulent structures observable in planar shear flows take the form of localized stripes, inclined with respect to the mean flow direction. The dynamics of these stripes is central to transition, and recent studies proposed an analogy to directed percolation where the stripes’ proliferation is ultimately responsible for the turbulence becoming sustained. In the present study we focus on the internal stripe dynamics as well as on the eventual stripe expansion, and we compare the underlying mechanisms in pressure- and shear-driven planar flows, respectively, plane-Poiseuille and plane-Couette flow. Despite the similarities of the overall laminar–turbulence patterns, the stripe proliferation processes in the two cases are fundamentally different. Starting from the growth and sustenance of individual stripes, we find that in plane-Couette flow new streaks are created stochastically throughout the stripe whereas in plane-Poiseuille flow streak creation is deterministic and occurs locally at the downstream tip. Because of the up/downstream symmetry, Couette stripes, in contrast to Poiseuille stripes, have two weak and two strong laminar turbulent interfaces. These differences in symmetry as well as in internal growth give rise to two fundamentally different stripe splitting mechanisms. In plane-Poiseuille flow splitting is connected to the elongational growth of the original stripe, and it results from a break-off/shedding of the stripe's tail. In plane-Couette flow splitting follows from a broadening of the original stripe and a division along the stripe into two slimmer stripes.","lang":"eng"}],"publication":"Journal of Fluid Mechanics","language":[{"iso":"eng"}],"acknowledgement":"E.M. acknowledges funding from the ISTplus fellowship programme. G.Y. and B.H. acknowledge a grant from the Simons Foundation (662960, BH).","status":"public","publisher":"Cambridge University Press","year":"2023","publication_identifier":{"eissn":["1469-7645"],"issn":["0022-1120"]},"fulldoi":"https://doi.org/10.1017/jfm.2023.780","department":[{"_id":"GradSch"},{"_id":"BjHo"}],"quality_controlled":"1","article_type":"original","month":"11","oa":1,"has_accepted_license":"1","arxiv":1,"title":"Dynamics and proliferation of turbulent stripes in plane-Poiseuille and plane-Couette flows","isi":1,"_id":"14466","keyword":["turbulence","transition to turbulence","patterns"],"article_number":"A21","date_updated":"2026-09-02T08:16:31Z"},{"type":"journal_article","scopus_import":"1","external_id":{"arxiv":["2306.05098"],"isi":["001052929900004"],"pmid":["37540883"]},"author":[{"id":"3D85B7C4-F248-11E8-B48F-1D18A9856A87","full_name":"Paranjape, Chaitanya S","first_name":"Chaitanya S","last_name":"Paranjape"},{"id":"66E74FA2-D8BF-11E9-8249-8DE2E5697425","last_name":"Yalniz","orcid":"0000-0002-8490-9312","full_name":"Yalniz, Gökhan","first_name":"Gökhan"},{"full_name":"Duguet, Yohann","first_name":"Yohann","last_name":"Duguet"},{"id":"3EA1010E-F248-11E8-B48F-1D18A9856A87","full_name":"Budanur, Nazmi B","first_name":"Nazmi B","last_name":"Budanur","orcid":"0000-0003-0423-5010"},{"id":"3A374330-F248-11E8-B48F-1D18A9856A87","last_name":"Hof","orcid":"0000-0003-2057-2754","full_name":"Hof, Björn","first_name":"Björn"}],"intvolume":"       131","doi":"10.1103/physrevlett.131.034002","oa_version":"Preprint","article_processing_charge":"No","citation":{"ista":"Paranjape CS, Yalniz G, Duguet Y, Budanur NB, Hof B. 2023. Direct path from turbulence to time-periodic solutions. Physical Review Letters. 131(3), 034002.","mla":"Paranjape, Chaitanya S., et al. “Direct Path from Turbulence to Time-Periodic Solutions.” <i>Physical Review Letters</i>, vol. 131, no. 3, 034002, American Physical Society, 2023, doi:<a href=\"https://doi.org/10.1103/physrevlett.131.034002\">10.1103/physrevlett.131.034002</a>.","ieee":"C. S. Paranjape, G. Yalniz, Y. Duguet, N. B. Budanur, and B. Hof, “Direct path from turbulence to time-periodic solutions,” <i>Physical Review Letters</i>, vol. 131, no. 3. American Physical Society, 2023.","apa":"Paranjape, C. S., Yalniz, G., Duguet, Y., Budanur, N. B., &#38; Hof, B. (2023). Direct path from turbulence to time-periodic solutions. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevlett.131.034002\">https://doi.org/10.1103/physrevlett.131.034002</a>","ama":"Paranjape CS, Yalniz G, Duguet Y, Budanur NB, Hof B. Direct path from turbulence to time-periodic solutions. <i>Physical Review Letters</i>. 2023;131(3). doi:<a href=\"https://doi.org/10.1103/physrevlett.131.034002\">10.1103/physrevlett.131.034002</a>","short":"C.S. Paranjape, G. Yalniz, Y. Duguet, N.B. Budanur, B. Hof, Physical Review Letters 131 (2023).","chicago":"Paranjape, Chaitanya S, Gökhan Yalniz, Yohann Duguet, Nazmi B Budanur, and Björn Hof. “Direct Path from Turbulence to Time-Periodic Solutions.” <i>Physical Review Letters</i>. American Physical Society, 2023. <a href=\"https://doi.org/10.1103/physrevlett.131.034002\">https://doi.org/10.1103/physrevlett.131.034002</a>."},"volume":131,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"662960","name":"Revisiting the Turbulence Problem Using Statistical Mechanics","_id":"238598C6-32DE-11EA-91FC-C7463DDC885E"}],"publication_status":"published","issue":"3","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"19684"}]},"corr_author":"1","day":"21","date_published":"2023-07-21T00:00:00Z","language":[{"iso":"eng"}],"acknowledgement":"We thank Baofang Song as well as the developers of Channelflow for sharing their numerical codes, and Mukund Vasudevan and Holger Kantz for fruitful discussions. This work was supported by a grant from the Simons Foundation (662960, B. H.).","status":"public","abstract":[{"lang":"eng","text":"Viscous flows through pipes and channels are steady and ordered until, with increasing velocity, the laminar motion catastrophically breaks down and gives way to turbulence. How this apparently discontinuous change from low- to high-dimensional motion can be rationalized within the framework of the Navier-Stokes equations is not well understood. Exploiting geometrical properties of transitional channel flow we trace turbulence to far lower Reynolds numbers (Re) than previously possible and identify the complete path that reversibly links fully turbulent motion to an invariant solution. This precursor of turbulence destabilizes rapidly with Re, and the accompanying explosive increase in attractor dimension effectively marks the transition between deterministic and de facto stochastic dynamics."}],"publication":"Physical Review Letters","date_created":"2023-07-24T09:43:59Z","quality_controlled":"1","department":[{"_id":"GradSch"},{"_id":"BjHo"}],"fulldoi":"https://doi.org/10.1103/physrevlett.131.034002","publisher":"American Physical Society","year":"2023","publication_identifier":{"eissn":["1079-7114"],"issn":["0031-9007"]},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2306.05098","open_access":"1"}],"isi":1,"title":"Direct path from turbulence to time-periodic solutions","arxiv":1,"oa":1,"pmid":1,"month":"07","article_type":"original","article_number":"034002","date_updated":"2026-09-02T08:16:31Z","keyword":["General Physics and Astronomy"],"_id":"13274"},{"volume":13965,"article_processing_charge":"Yes (in subscription journal)","conference":{"name":"CAV: Computer Aided Verification","end_date":"2023-07-22","location":"Paris, France","start_date":"2023-07-17"},"citation":{"short":"T.A. Henzinger, M. Karimi, K. Kueffner, K. Mallik, in:, Computer Aided Verification, Springer Nature, 2023, pp. 358–382.","chicago":"Henzinger, Thomas A, Mahyar Karimi, Konstantin Kueffner, and Kaushik Mallik. “Monitoring Algorithmic Fairness.” In <i>Computer Aided Verification</i>, 13965:358–382. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-37703-7_17\">https://doi.org/10.1007/978-3-031-37703-7_17</a>.","ieee":"T. A. Henzinger, M. Karimi, K. Kueffner, and K. Mallik, “Monitoring algorithmic fairness,” in <i>Computer Aided Verification</i>, Paris, France, 2023, vol. 13965, pp. 358–382.","ama":"Henzinger TA, Karimi M, Kueffner K, Mallik K. Monitoring algorithmic fairness. In: <i>Computer Aided Verification</i>. Vol 13965. Springer Nature; 2023:358–382. doi:<a href=\"https://doi.org/10.1007/978-3-031-37703-7_17\">10.1007/978-3-031-37703-7_17</a>","apa":"Henzinger, T. A., Karimi, M., Kueffner, K., &#38; Mallik, K. (2023). Monitoring algorithmic fairness. In <i>Computer Aided Verification</i> (Vol. 13965, pp. 358–382). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-37703-7_17\">https://doi.org/10.1007/978-3-031-37703-7_17</a>","mla":"Henzinger, Thomas A., et al. “Monitoring Algorithmic Fairness.” <i>Computer Aided Verification</i>, vol. 13965, Springer Nature, 2023, pp. 358–382, doi:<a href=\"https://doi.org/10.1007/978-3-031-37703-7_17\">10.1007/978-3-031-37703-7_17</a>.","ista":"Henzinger TA, Karimi M, Kueffner K, Mallik K. 2023. Monitoring algorithmic fairness. Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13965, 358–382."},"ddc":["000"],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"external_id":{"isi":["001310804800017"],"arxiv":["2305.15979"]},"author":[{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Mahyar","full_name":"Karimi, Mahyar","orcid":"0009-0005-0820-1696","last_name":"Karimi","id":"6e5417ba-5355-11ee-ae5a-94c2e510b26b"},{"full_name":"Kueffner, Konstantin","first_name":"Konstantin","last_name":"Kueffner","orcid":"0000-0001-8974-2542","id":"8121a2d0-dc85-11ea-9058-af578f3b4515"},{"id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","last_name":"Mallik","orcid":"0000-0001-9864-7475","full_name":"Mallik, Kaushik","first_name":"Kaushik"}],"type":"conference","file":[{"access_level":"open_access","file_id":"13327","relation":"main_file","creator":"dernst","date_created":"2023-07-31T08:11:20Z","file_name":"2023_LNCS_CAV_HenzingerT.pdf","checksum":"ccaf94bf7d658ba012c016e11869b54c","file_size":647760,"success":1,"date_updated":"2023-07-31T08:11:20Z","content_type":"application/pdf"}],"scopus_import":"1","oa_version":"Published Version","intvolume":"     13965","doi":"10.1007/978-3-031-37703-7_17","abstract":[{"lang":"eng","text":"Machine-learned systems are in widespread use for making decisions about humans, and it is important that they are fair, i.e., not biased against individuals based on sensitive attributes. We present runtime verification of algorithmic fairness for systems whose models are unknown, but are assumed to have a Markov chain structure. We introduce a specification language that can model many common algorithmic fairness properties, such as demographic parity, equal opportunity, and social burden. We build monitors that observe a long sequence of events as generated by a given system, and output, after each observation, a quantitative estimate of how fair or biased the system was on that run until that point in time. The estimate is proven to be correct modulo a variable error bound and a given confidence level, where the error bound gets tighter as the observed sequence gets longer. Our monitors are of two types, and use, respectively, frequentist and Bayesian statistical inference techniques. While the frequentist monitors compute estimates that are objectively correct with respect to the ground truth, the Bayesian monitors compute estimates that are correct subject to a given prior belief about the system’s model. Using a prototype implementation, we show how we can monitor if a bank is fair in giving loans to applicants from different social backgrounds, and if a college is fair in admitting students while maintaining a reasonable financial burden on the society. Although they exhibit different theoretical complexities in certain cases, in our experiments, both frequentist and Bayesian monitors took less than a millisecond to update their verdicts after each observation."}],"publication":"Computer Aided Verification","acknowledgement":"This work is supported by the European Research Council under Grant No.: ERC-2020-AdG101020093.","language":[{"iso":"eng"}],"status":"public","date_created":"2023-07-25T18:32:40Z","corr_author":"1","day":"18","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"related_material":{"record":[{"id":"22808","status":"public","relation":"dissertation_contains"}]},"file_date_updated":"2023-07-31T08:11:20Z","page":"358–382","date_published":"2023-07-18T00:00:00Z","alternative_title":["LNCS"],"quality_controlled":"1","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publisher":"Springer Nature","publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783031377037"],"issn":["0302-9743"],"isbn":["9783031377020"]},"year":"2023","ec_funded":1,"fulldoi":"https://doi.org/10.1007/978-3-031-37703-7_17","date_updated":"2026-09-18T07:41:29Z","_id":"13310","arxiv":1,"isi":1,"title":"Monitoring algorithmic fairness","month":"07","oa":1,"has_accepted_license":"1"},{"title":"Beyond the universal law of robustness: Sharper laws for random features and neural tangent kernels","arxiv":1,"oa":1,"month":"10","date_updated":"2026-09-21T13:07:01Z","_id":"12859","department":[{"_id":"GradSch"},{"_id":"MaMo"}],"quality_controlled":"1","publisher":"ML Research Press","year":"2023","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2302.01629","open_access":"1"}],"alternative_title":["PMLR"],"related_material":{"link":[{"url":"https://github.com/simone-bombari/beyond-universal-robustness","relation":"software"}],"record":[{"id":"22857","relation":"dissertation_contains","status":"public"}]},"corr_author":"1","day":"27","date_published":"2023-10-27T00:00:00Z","page":"2738-2776","status":"public","acknowledgement":"Simone Bombari and Marco Mondelli were partially supported by the 2019 Lopez-Loreta prize, and\r\nthe authors would like to thank Hamed Hassani for helpful discussions.\r\n","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Machine learning models are vulnerable to adversarial perturbations, and a thought-provoking paper by Bubeck and Sellke has analyzed this phenomenon through the lens of over-parameterization: interpolating smoothly the data requires significantly more parameters than simply memorizing it. However, this \"universal\" law provides only a necessary condition for robustness, and it is unable to discriminate between models. In this paper, we address these gaps by focusing on empirical risk minimization in two prototypical settings, namely, random features and the neural tangent kernel (NTK). We prove that, for random features, the model is not robust for any degree of over-parameterization, even when the necessary condition coming from the universal law of robustness is satisfied. In contrast, for even activations, the NTK model meets the universal lower bound, and it is robust as soon as the necessary condition on over-parameterization is fulfilled. This also addresses a conjecture in prior work by Bubeck, Li and Nagaraj. Our analysis decouples the effect of the kernel of the model from an \"interaction matrix\", which describes the interaction with the test data and captures the effect of the activation. Our theoretical results are corroborated by numerical evidence on both synthetic and standard datasets (MNIST, CIFAR-10)."}],"publication":"Proceedings of the 40th International Conference on Machine Learning","date_created":"2023-04-23T16:11:03Z","type":"conference","external_id":{"arxiv":["2302.01629"]},"author":[{"full_name":"Bombari, Simone","first_name":"Simone","last_name":"Bombari","id":"ca726dda-de17-11ea-bc14-f9da834f63aa"},{"last_name":"Kiyani","first_name":"Shayan","full_name":"Kiyani, Shayan","id":"f5a2b424-e339-11ed-8435-ff3b4fe70cf8"},{"id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","last_name":"Mondelli","first_name":"Marco","full_name":"Mondelli, Marco"}],"intvolume":"       202","oa_version":"Preprint","conference":{"location":"Honolulu, HI, United States","start_date":"2023-07-23","end_date":"2023-07-29","name":"ICML: International Conference on Machine Learning"},"article_processing_charge":"No","citation":{"chicago":"Bombari, Simone, Shayan Kiyani, and Marco Mondelli. “Beyond the Universal Law of Robustness: Sharper Laws for Random Features and Neural Tangent Kernels.” In <i>Proceedings of the 40th International Conference on Machine Learning</i>, 202:2738–76. ML Research Press, 2023.","short":"S. Bombari, S. Kiyani, M. Mondelli, in:, Proceedings of the 40th International Conference on Machine Learning, ML Research Press, 2023, pp. 2738–2776.","ama":"Bombari S, Kiyani S, Mondelli M. Beyond the universal law of robustness: Sharper laws for random features and neural tangent kernels. In: <i>Proceedings of the 40th International Conference on Machine Learning</i>. Vol 202. ML Research Press; 2023:2738-2776.","apa":"Bombari, S., Kiyani, S., &#38; Mondelli, M. (2023). Beyond the universal law of robustness: Sharper laws for random features and neural tangent kernels. In <i>Proceedings of the 40th International Conference on Machine Learning</i> (Vol. 202, pp. 2738–2776). Honolulu, HI, United States: ML Research Press.","ieee":"S. Bombari, S. Kiyani, and M. Mondelli, “Beyond the universal law of robustness: Sharper laws for random features and neural tangent kernels,” in <i>Proceedings of the 40th International Conference on Machine Learning</i>, Honolulu, HI, United States, 2023, vol. 202, pp. 2738–2776.","mla":"Bombari, Simone, et al. “Beyond the Universal Law of Robustness: Sharper Laws for Random Features and Neural Tangent Kernels.” <i>Proceedings of the 40th International Conference on Machine Learning</i>, vol. 202, ML Research Press, 2023, pp. 2738–76.","ista":"Bombari S, Kiyani S, Mondelli M. 2023. Beyond the universal law of robustness: Sharper laws for random features and neural tangent kernels. Proceedings of the 40th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 202, 2738–2776."},"volume":202,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"publication_status":"published"},{"alternative_title":["ISTA Thesis"],"publisher":"Institute of Science and Technology Austria","publication_identifier":{"isbn":["978-3-99078-027-5"],"issn":["2663-337X"]},"year":"2023","fulldoi":"https://doi.org/10.15479/at:ista:12491","department":[{"_id":"GradSch"},{"_id":"FlSc"}],"keyword":["cryo-EM","cryo-ET","FIB milling","method development","FIBSEM","extracellular matrix","ECM","cell-derived matrices","CDMs","cell culture","high pressure freezing","HPF","structural biology","tomography","collagen"],"_id":"12491","date_updated":"2026-04-07T13:49:23Z","acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"LifeSc"},{"_id":"Bio"}],"month":"02","oa":1,"has_accepted_license":"1","title":"Ultrastructural characterization of natively preserved extracellular matrix by cryo-electron tomography","publication_status":"published","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","project":[{"_id":"eba3b5f6-77a9-11ec-83b8-cf0905748aa3","name":"Integrated visual proteomics of reciprocal cell-extracellular matrix interactions"},{"_id":"059B463C-7A3F-11EA-A408-12923DDC885E","name":"NÃ-Fonds Preis fÃ¼r die Jungforscherin des Jahres am IST Austria"}],"degree_awarded":"PhD","OA_place":"publisher","article_processing_charge":"No","citation":{"short":"B. Zens, Ultrastructural Characterization of Natively Preserved Extracellular Matrix by Cryo-Electron Tomography, Institute of Science and Technology Austria, 2023.","chicago":"Zens, Bettina. “Ultrastructural Characterization of Natively Preserved Extracellular Matrix by Cryo-Electron Tomography.” Institute of Science and Technology Austria, 2023. <a href=\"https://doi.org/10.15479/at:ista:12491\">https://doi.org/10.15479/at:ista:12491</a>.","ama":"Zens B. Ultrastructural characterization of natively preserved extracellular matrix by cryo-electron tomography. 2023. doi:<a href=\"https://doi.org/10.15479/at:ista:12491\">10.15479/at:ista:12491</a>","apa":"Zens, B. (2023). <i>Ultrastructural characterization of natively preserved extracellular matrix by cryo-electron tomography</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:12491\">https://doi.org/10.15479/at:ista:12491</a>","ieee":"B. Zens, “Ultrastructural characterization of natively preserved extracellular matrix by cryo-electron tomography,” Institute of Science and Technology Austria, 2023.","mla":"Zens, Bettina. <i>Ultrastructural Characterization of Natively Preserved Extracellular Matrix by Cryo-Electron Tomography</i>. Institute of Science and Technology Austria, 2023, doi:<a href=\"https://doi.org/10.15479/at:ista:12491\">10.15479/at:ista:12491</a>.","ista":"Zens B. 2023. Ultrastructural characterization of natively preserved extracellular matrix by cryo-electron tomography. Institute of Science and Technology Austria."},"ddc":["570"],"oa_version":"Published Version","doi":"10.15479/at:ista:12491","author":[{"id":"45FD126C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9561-1239","last_name":"Zens","first_name":"Bettina","full_name":"Zens, Bettina"}],"type":"dissertation","file":[{"date_updated":"2024-02-08T23:30:04Z","content_type":"application/pdf","file_size":23082464,"checksum":"069d87f025e0799bf9e3c375664264f2","embargo":"2024-02-07","file_name":"PhDThesis_BettinaZens_2023_final.pdf","date_created":"2023-02-07T13:07:38Z","relation":"main_file","creator":"bzens","file_id":"12527","access_level":"open_access"},{"embargo_to":"open_access","checksum":"8c66ed203495d6e078ed1002a866520c","date_created":"2023-02-07T13:09:05Z","file_name":"PhDThesis_BettinaZens_2023_final.docx","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_updated":"2024-02-08T23:30:04Z","file_size":106169509,"file_id":"12528","access_level":"closed","relation":"source_file","creator":"bzens"}],"date_created":"2023-02-02T14:50:20Z","abstract":[{"lang":"eng","text":"The extracellular matrix (ECM) is a hydrated and complex three-dimensional network consisting of proteins, polysaccharides, and water. It provides structural scaffolding for the cells embedded within it and is essential in regulating numerous physiological processes, including cell migration and proliferation, wound healing, and stem cell fate. \r\nDespite extensive study, detailed structural knowledge of ECM components in physiologically relevant conditions is still rudimentary. This is due to methodological limitations in specimen preparation protocols which are incompatible with keeping large samples, such as the ECM, in their native state for subsequent imaging. Conventional electron microscopy (EM) techniques rely on fixation, dehydration, contrasting, and sectioning. This results in the alteration of a highly hydrated environment and the potential introduction of artifacts. Other structural biology techniques, such as nuclear magnetic resonance (NMR) spectroscopy and X-ray crystallography, allow high-resolution analysis of protein structures but only work on homogenous and purified samples, hence lacking contextual information. Currently, no approach exists for the ultrastructural and structural study of extracellular components under native conditions in a physiological, 3D environment. \r\nIn this thesis, I have developed a workflow that allows for the ultrastructural analysis of the ECM in near-native conditions at molecular resolution. The developments I introduced include implementing a novel specimen preparation workflow for cell-derived matrices (CDMs) to render them compatible with ion-beam milling and subsequent high-resolution cryo-electron tomography (ET). \r\nTo this end, I have established protocols to generate CDMs grown over several weeks on EM grids that are compatible with downstream cryo-EM sample preparation and imaging techniques. Characterization of these ECMs confirmed that they contain essential ECM components such as collagen I, collagen VI, and fibronectin I in high abundance and hence represent a bona fide biologically-relevant sample. I successfully optimized vitrification of these specimens by testing various vitrification techniques and cryoprotectants. \r\nIn order to obtain high-resolution molecular insights into the ultrastructure and organization of CDMs, I established cryo-focused ion beam scanning electron microscopy (FIBSEM) on these challenging and complex specimens. I explored different approaches for the creation of thin cryo-lamellae by FIB milling and succeeded in optimizing the cryo-lift-out technique, resulting in high-quality lamellae of approximately 200 nm thickness. \r\nHigh-resolution Cryo-ET of these lamellae revealed for the first time the architecture of native CDM in the context of matrix-secreting cells. This allowed for the in situ visualization of fibrillar matrix proteins such as collagen, laying the foundation for future structural and ultrastructural characterization of these proteins in their near-native environment. \r\nIn summary, in this thesis, I present a novel workflow that combines state-of-the-art cryo-EM specimen preparation and imaging technologies to permit characterization of the ECM, an important tissue component in higher organisms. This innovative and highly versatile workflow will enable addressing far-reaching questions on ECM architecture, composition, and reciprocal ECM-cell interactions."}],"supervisor":[{"id":"48AD8942-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4790-8078","last_name":"Schur","first_name":"Florian KM","full_name":"Schur, Florian KM"}],"status":"public","language":[{"iso":"eng"}],"page":"187","file_date_updated":"2024-02-08T23:30:04Z","date_published":"2023-02-02T00:00:00Z","corr_author":"1","day":"02","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"8586"}]}}]
