[{"main_file_link":[{"url":"https://doi.org/10.5281/zenodo.13935166","open_access":"1"}],"date_updated":"2026-10-02T11:02:23Z","fulldoi":"https://doi.org/10.5281/zenodo.13935166","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","citation":{"chicago":"De Palma, Franco, Fabian Oppliger, Wonjin Jang, Stefano Bosco, Marián Janík, Stefano Calcaterra, Georgios Katsaros, Giovanni Isella, Daniel Loss, and Pasquale Scarlino. “Online Data of ‘Strong Hole-Photon Coupling in Planar Ge for Probing Charge Degree and Strongly Correlated States.’” Zenodo, 2024. <a href=\"https://doi.org/10.5281/zenodo.13935166\">https://doi.org/10.5281/zenodo.13935166</a>.","apa":"De Palma, F., Oppliger, F., Jang, W., Bosco, S., Janík, M., Calcaterra, S., … Scarlino, P. (2024). Online data of “Strong hole-photon coupling in planar Ge for probing charge degree and strongly correlated states.” Zenodo. <a href=\"https://doi.org/10.5281/zenodo.13935166\">https://doi.org/10.5281/zenodo.13935166</a>","ama":"De Palma F, Oppliger F, Jang W, et al. Online data of “Strong hole-photon coupling in planar Ge for probing charge degree and strongly correlated states.” 2024. doi:<a href=\"https://doi.org/10.5281/zenodo.13935166\">10.5281/zenodo.13935166</a>","mla":"De Palma, Franco, et al. <i>Online Data of “Strong Hole-Photon Coupling in Planar Ge for Probing Charge Degree and Strongly Correlated States.”</i> Zenodo, 2024, doi:<a href=\"https://doi.org/10.5281/zenodo.13935166\">10.5281/zenodo.13935166</a>.","ieee":"F. De Palma <i>et al.</i>, “Online data of ‘Strong hole-photon coupling in planar Ge for probing charge degree and strongly correlated states.’” Zenodo, 2024.","ista":"De Palma F, Oppliger F, Jang W, Bosco S, Janík M, Calcaterra S, Katsaros G, Isella G, Loss D, Scarlino P. 2024. Online data of ‘Strong hole-photon coupling in planar Ge for probing charge degree and strongly correlated states’, Zenodo, <a href=\"https://doi.org/10.5281/zenodo.13935166\">10.5281/zenodo.13935166</a>.","short":"F. De Palma, F. Oppliger, W. Jang, S. Bosco, M. Janík, S. Calcaterra, G. Katsaros, G. Isella, D. Loss, P. Scarlino, (2024)."},"related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"18602"}]},"date_published":"2024-10-15T00:00:00Z","abstract":[{"text":"The data for all figures in the main text can be found in csv files in ASCII format in the corresponing folders. For Figures 4-6, the panels are numbered from top to bottom.","lang":"eng"}],"type":"research_data_reference","oa_version":"None","year":"2024","ddc":["530"],"status":"public","author":[{"full_name":"De Palma, Franco","last_name":"De Palma","first_name":"Franco"},{"full_name":"Oppliger, Fabian","last_name":"Oppliger","first_name":"Fabian"},{"full_name":"Jang, Wonjin","last_name":"Jang","first_name":"Wonjin"},{"full_name":"Bosco, Stefano","last_name":"Bosco","first_name":"Stefano"},{"full_name":"Janík, Marián","first_name":"Marián","last_name":"Janík"},{"full_name":"Calcaterra, Stefano","last_name":"Calcaterra","first_name":"Stefano"},{"first_name":"Georgios","last_name":"Katsaros","full_name":"Katsaros, Georgios"},{"first_name":"Giovanni","last_name":"Isella","full_name":"Isella, Giovanni"},{"full_name":"Loss, Daniel","last_name":"Loss","first_name":"Daniel"},{"last_name":"Scarlino","first_name":"Pasquale","full_name":"Scarlino, Pasquale"}],"date_created":"2026-10-02T11:02:18Z","title":"Online data of \"Strong hole-photon coupling in planar Ge for probing charge degree and strongly correlated states\"","_id":"23037","doi":"10.5281/zenodo.13935166","OA_place":"repository","OA_type":"green","publisher":"Zenodo","month":"10","department":[{"_id":"GeKa"}],"contributor":[{"last_name":"Oppliger","first_name":"Fabian","contributor_type":"project_member"}],"oa":1,"day":"15"},{"doi":"10.1016/j.mssp.2024.108231","researchdata_availability":"not applicable","file":[{"access_level":"open_access","relation":"main_file","creator":"dernst","success":1,"date_created":"2024-07-22T11:56:08Z","checksum":"62e8e9ae960387a3dca32ec7f5e413ab","content_type":"application/pdf","date_updated":"2024-07-22T11:56:08Z","file_name":"2024_MaterialsScience_Shimura.pdf","file_size":4220165,"file_id":"17312"}],"volume":174,"isi":1,"article_number":"108231","publisher":"Elsevier","month":"05","department":[{"_id":"GeKa"},{"_id":"NanoFab"}],"external_id":{"isi":["001188520000001"]},"oa":1,"dataavailabilitystatement":"No data was used for the research described in the article.","day":"20","das_tickbox":"1","fulldoi":"https://doi.org/10.1016/j.mssp.2024.108231","article_processing_charge":"Yes (in subscription journal)","keyword":["Mechanical Engineering","Mechanics of Materials","Condensed Matter Physics","General Materials Science"],"has_accepted_license":"1","file_date_updated":"2024-07-22T11:56:08Z","date_published":"2024-05-20T00:00:00Z","intvolume":"       174","publication_status":"published","year":"2024","quality_controlled":"1","ddc":["530"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"language":[{"iso":"eng"}],"OA_type":"hybrid","OA_place":"publisher","publication_identifier":{"issn":["1369-8001"]},"acknowledgement":"The Ge project received funding from the European Union's Horizon Europe programme under the Grant Agreement 101069515 – IGNITE. Siltronic AG is acknowledged for providing the SRB wafers. This work was supported by Imec's Industrial Affiliation Program on Quantum Computing.","scopus_import":"1","issue":"5","publication":"Materials Science in Semiconductor Processing","supplementarymaterial":"no","date_updated":"2026-10-02T11:06:21Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"apa":"Shimura, Y., Godfrin, C., Hikavyy, A., Li, R., Aguilera Servin, J. L., Katsaros, G., … Loo, R. (2024). Compressively strained epitaxial Ge layers for quantum computing applications. <i>Materials Science in Semiconductor Processing</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.mssp.2024.108231\">https://doi.org/10.1016/j.mssp.2024.108231</a>","chicago":"Shimura, Yosuke, Clement Godfrin, Andriy Hikavyy, Roy Li, Juan L Aguilera Servin, Georgios Katsaros, Paola Favia, et al. “Compressively Strained Epitaxial Ge Layers for Quantum Computing Applications.” <i>Materials Science in Semiconductor Processing</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.mssp.2024.108231\">https://doi.org/10.1016/j.mssp.2024.108231</a>.","ista":"Shimura Y, Godfrin C, Hikavyy A, Li R, Aguilera Servin JL, Katsaros G, Favia P, Han H, Wan D, de Greve K, Loo R. 2024. Compressively strained epitaxial Ge layers for quantum computing applications. Materials Science in Semiconductor Processing. 174(5), 108231.","ieee":"Y. Shimura <i>et al.</i>, “Compressively strained epitaxial Ge layers for quantum computing applications,” <i>Materials Science in Semiconductor Processing</i>, vol. 174, no. 5. Elsevier, 2024.","short":"Y. Shimura, C. Godfrin, A. Hikavyy, R. Li, J.L. Aguilera Servin, G. Katsaros, P. Favia, H. Han, D. Wan, K. de Greve, R. Loo, Materials Science in Semiconductor Processing 174 (2024).","mla":"Shimura, Yosuke, et al. “Compressively Strained Epitaxial Ge Layers for Quantum Computing Applications.” <i>Materials Science in Semiconductor Processing</i>, vol. 174, no. 5, 108231, Elsevier, 2024, doi:<a href=\"https://doi.org/10.1016/j.mssp.2024.108231\">10.1016/j.mssp.2024.108231</a>.","ama":"Shimura Y, Godfrin C, Hikavyy A, et al. Compressively strained epitaxial Ge layers for quantum computing applications. <i>Materials Science in Semiconductor Processing</i>. 2024;174(5). doi:<a href=\"https://doi.org/10.1016/j.mssp.2024.108231\">10.1016/j.mssp.2024.108231</a>"},"project":[{"_id":"34c0acea-11ca-11ed-8bc3-8775e10fd452","name":"Integrated Germanium Quantum Technology","grant_number":"101069515"}],"abstract":[{"lang":"eng","text":"The epitaxial growth of a strained Ge layer, which is a promising candidate for the channel material of a hole spin qubit, has been demonstrated on 300 mm Si wafers using commercially available Si0.3Ge0.7 strain relaxed buffer (SRB) layers. The assessment of the layer and the interface qualities for a buried strained Ge layer embedded in Si0.3Ge0.7 layers is reported. The XRD reciprocal space mapping confirmed that the reduction of the growth temperature enables the 2-dimensional growth of the Ge layer fully strained with respect to the Si0.3Ge0.7. Nevertheless, dislocations at the top and/or bottom interface of the Ge layer were observed by means of electron channeling contrast imaging, suggesting the importance of the careful dislocation assessment. The interface abruptness does not depend on the selection of the precursor gases, but it is strongly influenced by the growth temperature which affects the coverage of the surface H-passivation. The mobility of 2.7 × 105 cm2/Vs is promising, while the low percolation density of 3 × 1010 /cm2 measured with a Hall-bar device at 7 K illustrates the high quality of the heterostructure thanks to the high Si0.3Ge0.7 SRB quality."}],"type":"journal_article","oa_version":"Published Version","article_type":"original","date_created":"2024-02-22T14:10:40Z","status":"public","author":[{"full_name":"Shimura, Yosuke","first_name":"Yosuke","last_name":"Shimura"},{"full_name":"Godfrin, Clement","first_name":"Clement","last_name":"Godfrin"},{"last_name":"Hikavyy","first_name":"Andriy","full_name":"Hikavyy, Andriy"},{"full_name":"Li, Roy","last_name":"Li","first_name":"Roy"},{"first_name":"Juan L","last_name":"Aguilera Servin","id":"2A67C376-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2862-8372","full_name":"Aguilera Servin, Juan L"},{"id":"38DB5788-F248-11E8-B48F-1D18A9856A87","first_name":"Georgios","last_name":"Katsaros","full_name":"Katsaros, Georgios","orcid":"0000-0001-8342-202X"},{"first_name":"Paola","last_name":"Favia","full_name":"Favia, Paola"},{"first_name":"Han","last_name":"Han","full_name":"Han, Han"},{"full_name":"Wan, Danny","last_name":"Wan","first_name":"Danny"},{"full_name":"de Greve, Kristiaan","last_name":"de Greve","first_name":"Kristiaan"},{"first_name":"Roger","last_name":"Loo","full_name":"Loo, Roger"}],"title":"Compressively strained epitaxial Ge layers for quantum computing applications","_id":"15018"},{"citation":{"apa":"Arkhipov, P. (n.d.). Majority dynamics and internal partitions of random regular graphs: Experimental results. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2406.07026\">https://doi.org/10.48550/arXiv.2406.07026</a>","chicago":"Arkhipov, Pavel. “Majority Dynamics and Internal Partitions of Random Regular Graphs: Experimental Results.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2406.07026\">https://doi.org/10.48550/arXiv.2406.07026</a>.","short":"P. Arkhipov, ArXiv (n.d.).","ieee":"P. Arkhipov, “Majority dynamics and internal partitions of random regular graphs: Experimental results,” <i>arXiv</i>. .","ista":"Arkhipov P. Majority dynamics and internal partitions of random regular graphs: Experimental results. arXiv, 2406.07026.","mla":"Arkhipov, Pavel. “Majority Dynamics and Internal Partitions of Random Regular Graphs: Experimental Results.” <i>ArXiv</i>, 2406.07026, doi:<a href=\"https://doi.org/10.48550/arXiv.2406.07026\">10.48550/arXiv.2406.07026</a>.","ama":"Arkhipov P. Majority dynamics and internal partitions of random regular graphs: Experimental results. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2406.07026\">10.48550/arXiv.2406.07026</a>"},"date_updated":"2026-10-02T11:06:38Z","supplementarymaterial":"no","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Majority dynamics and internal partitions of random regular graphs: Experimental results","_id":"17136","date_created":"2024-06-12T07:01:52Z","author":[{"last_name":"Arkhipov","first_name":"Pavel","id":"b25f2ab2-1fed-11ee-8599-fe02d211784f","full_name":"Arkhipov, Pavel"}],"status":"public","type":"preprint","oa_version":"Preprint","abstract":[{"lang":"eng","text":"This paper focuses on Majority Dynamics in sparse graphs, in particular, as a\r\ntool to study internal cuts. It is known that, in Majority Dynamics on a finite\r\ngraph, each vertex eventually either comes to a fixed state, or oscillates with\r\nperiod two. The empirical evidence acquired by simulations suggests that for\r\nrandom odd-regular graphs, approximately half of the vertices end up\r\noscillating with high probability. We notice a local symmetry between\r\noscillating and non-oscillating vertices, that potentially can explain why the\r\nfraction of the oscillating vertices is concentrated around $\\frac{1}{2}$. In\r\nour simulations, we observe that the parts of random odd-regular graph under\r\nMajority Dynamics with high probability do not contain $\\lceil \\frac{d}{2}\r\n\\rceil$-cores at any timestep, and thus, one cannot use Majority Dynamics to\r\nprove that internal cuts exist in odd-regular graphs almost surely. However, we\r\nsuggest a modification of Majority Dynamics, that yields parts with desired\r\ncores with high probability."}],"language":[{"iso":"eng"}],"publication":"arXiv","acknowledgement":"I am grateful to Matthew Kwan for setting the problem, providing useful literature,\r\nfruitful discussions, text review, mentorship, general encouragement and support.","date_published":"2024-06-11T00:00:00Z","article_processing_charge":"No","das_tickbox":"0","fulldoi":"https://doi.org/10.48550/arXiv.2406.07026","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2406.07026","open_access":"1"}],"arxiv":1,"publication_status":"submitted","year":"2024","article_number":"2406.07026","researchdata_availability":"yes","doi":"10.48550/arXiv.2406.07026","day":"11","oa":1,"external_id":{"arxiv":["2406.07026"]},"month":"06","department":[{"_id":"GradSch"}]},{"acknowledgement":"The computational results presented here were enabled via a generous share of CPU time, offered by the Vienna Scientific Cluster (VSC) under Project No. 71263. The authors thank Ms. Katrin Muck for her guidance related to the use of HPC. A.J.A. gratefully acknowledges support from the EPSRC under Grant No. EP/P015689/1.","publication_identifier":{"eissn":["1089-7690"]},"publication":"The Journal of chemical physics","scopus_import":"1","issue":"12","language":[{"iso":"eng"}],"oa_version":"Published Version","type":"journal_article","article_type":"original","abstract":[{"text":"We investigate the phase ordering (pattern formation) of systems of two-dimensional core–shell particles using Monte Carlo (MC) computer simulations and classical density functional theory (DFT). The particles interact via a pair potential having a hard core and a repulsive square shoulder. Our simulations show that on cooling, the liquid state structure becomes increasingly characterized by long wavelength density modulations and on further cooling forms a variety of other phases, including clustered, striped, and other patterned phases. In DFT, the hard core part of the potential is treated using either fundamental measure theory or a simple local density approximation, whereas the soft shoulder is treated using the random phase approximation. The different DFTs are benchmarked using large-scale grand-canonical-MC and Gibbs-ensemble-MC simulations, demonstrating their predictive capabilities and shortcomings. We find that having the liquid state static structure factor S(k) for wavenumber k is sufficient to identify the Fourier modes governing both the liquid and solid phases. This allows us to identify from easier-to-obtain liquid state data the wavenumbers relevant to the periodic phases and to predict roughly where in the phase diagram these patterned phases arise.","lang":"eng"}],"title":"Fingerprints of ordered self-assembled structures in the liquid phase of a hard-core, square-shoulder system","_id":"18174","date_created":"2024-10-06T22:01:12Z","status":"public","author":[{"first_name":"Michael","last_name":"Wassermair","id":"23d132c4-4e98-11ef-b275-9e8d4cd8c917","orcid":"0009-0003-6339-4051","full_name":"Wassermair, Michael"},{"full_name":"Kahl, Gerhard","first_name":"Gerhard","last_name":"Kahl"},{"last_name":"Roth","first_name":"Roland","full_name":"Roth, Roland"},{"full_name":"Archer, Andrew J.","last_name":"Archer","first_name":"Andrew J."}],"date_updated":"2026-10-02T11:10:03Z","supplementarymaterial":"yes","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"apa":"Wassermair, M., Kahl, G., Roth, R., &#38; Archer, A. J. (2024). Fingerprints of ordered self-assembled structures in the liquid phase of a hard-core, square-shoulder system. <i>The Journal of Chemical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0226954\">https://doi.org/10.1063/5.0226954</a>","chicago":"Wassermair, Michael, Gerhard Kahl, Roland Roth, and Andrew J. Archer. “Fingerprints of Ordered Self-Assembled Structures in the Liquid Phase of a Hard-Core, Square-Shoulder System.” <i>The Journal of Chemical Physics</i>. AIP Publishing, 2024. <a href=\"https://doi.org/10.1063/5.0226954\">https://doi.org/10.1063/5.0226954</a>.","ieee":"M. Wassermair, G. Kahl, R. Roth, and A. J. Archer, “Fingerprints of ordered self-assembled structures in the liquid phase of a hard-core, square-shoulder system,” <i>The Journal of chemical physics</i>, vol. 161, no. 12. AIP Publishing, 2024.","ista":"Wassermair M, Kahl G, Roth R, Archer AJ. 2024. Fingerprints of ordered self-assembled structures in the liquid phase of a hard-core, square-shoulder system. The Journal of chemical physics. 161(12), 124503.","short":"M. Wassermair, G. Kahl, R. Roth, A.J. Archer, The Journal of Chemical Physics 161 (2024).","ama":"Wassermair M, Kahl G, Roth R, Archer AJ. Fingerprints of ordered self-assembled structures in the liquid phase of a hard-core, square-shoulder system. <i>The Journal of chemical physics</i>. 2024;161(12). doi:<a href=\"https://doi.org/10.1063/5.0226954\">10.1063/5.0226954</a>","mla":"Wassermair, Michael, et al. “Fingerprints of Ordered Self-Assembled Structures in the Liquid Phase of a Hard-Core, Square-Shoulder System.” <i>The Journal of Chemical Physics</i>, vol. 161, no. 12, 124503, AIP Publishing, 2024, doi:<a href=\"https://doi.org/10.1063/5.0226954\">10.1063/5.0226954</a>."},"external_id":{"isi":["001325268300004"],"pmid":["39344889"],"arxiv":["2409.06447"]},"publisher":"AIP Publishing","month":"09","department":[{"_id":"GradSch"}],"day":"28","dataavailabilitystatement":"The data that support the findings of this study are available from the corresponding author upon reasonable request.","corr_author":"1","oa":1,"volume":161,"doi":"10.1063/5.0226954","researchdata_availability":"upon request","file":[{"file_id":"18185","file_name":"2024_JourChemicalPhysics_Wassermair.pdf","date_updated":"2024-10-07T11:25:00Z","content_type":"application/pdf","file_size":15009000,"success":1,"date_created":"2024-10-07T11:25:00Z","checksum":"f3874e64ef94e94b2376f00a1fee24c3","access_level":"open_access","relation":"main_file","creator":"dernst"}],"isi":1,"article_number":"124503 ","publication_status":"published","pmid":1,"quality_controlled":"1","year":"2024","intvolume":"       161","ddc":["530"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"das_tickbox":"1","fulldoi":"https://doi.org/10.1063/5.0226954","arxiv":1,"has_accepted_license":"1","file_date_updated":"2024-10-07T11:25:00Z","date_published":"2024-09-28T00:00:00Z","article_processing_charge":"Yes (in subscription journal)"},{"citation":{"apa":"Kluibenschedl, F., Ploner, A., Meisenbichler, C., Konrat, R., &#38; Müller, T. (2024). Advanced motion tracking for interactive mass spectrometry imaging (IMSI). <i>International Journal of Mass Spectrometry</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ijms.2023.117168\">https://doi.org/10.1016/j.ijms.2023.117168</a>","chicago":"Kluibenschedl, Florian, Anna Ploner, Christina Meisenbichler, Robert Konrat, and Thomas Müller. “Advanced Motion Tracking for Interactive Mass Spectrometry Imaging (IMSI).” <i>International Journal of Mass Spectrometry</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.ijms.2023.117168\">https://doi.org/10.1016/j.ijms.2023.117168</a>.","ista":"Kluibenschedl F, Ploner A, Meisenbichler C, Konrat R, Müller T. 2024. Advanced motion tracking for interactive mass spectrometry imaging (IMSI). International Journal of Mass Spectrometry. 495, 117168.","short":"F. Kluibenschedl, A. Ploner, C. Meisenbichler, R. Konrat, T. Müller, International Journal of Mass Spectrometry 495 (2024).","ieee":"F. Kluibenschedl, A. Ploner, C. Meisenbichler, R. Konrat, and T. Müller, “Advanced motion tracking for interactive mass spectrometry imaging (IMSI),” <i>International Journal of Mass Spectrometry</i>, vol. 495. Elsevier, 2024.","mla":"Kluibenschedl, Florian, et al. “Advanced Motion Tracking for Interactive Mass Spectrometry Imaging (IMSI).” <i>International Journal of Mass Spectrometry</i>, vol. 495, 117168, Elsevier, 2024, doi:<a href=\"https://doi.org/10.1016/j.ijms.2023.117168\">10.1016/j.ijms.2023.117168</a>.","ama":"Kluibenschedl F, Ploner A, Meisenbichler C, Konrat R, Müller T. Advanced motion tracking for interactive mass spectrometry imaging (IMSI). <i>International Journal of Mass Spectrometry</i>. 2024;495. doi:<a href=\"https://doi.org/10.1016/j.ijms.2023.117168\">10.1016/j.ijms.2023.117168</a>"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2026-10-02T11:07:09Z","supplementarymaterial":"yes","_id":"14653","title":"Advanced motion tracking for interactive mass spectrometry imaging (IMSI)","author":[{"full_name":"Kluibenschedl, Florian","orcid":"0000-0003-4695-5526","last_name":"Kluibenschedl","first_name":"Florian","id":"7499e70e-eb2c-11ec-b98b-f925648bc9d9"},{"full_name":"Ploner, Anna","last_name":"Ploner","first_name":"Anna"},{"full_name":"Meisenbichler, Christina","last_name":"Meisenbichler","first_name":"Christina"},{"last_name":"Konrat","first_name":"Robert","full_name":"Konrat, Robert"},{"first_name":"Thomas","last_name":"Müller","full_name":"Müller, Thomas"}],"date_created":"2023-12-10T23:00:57Z","status":"public","article_type":"original","type":"journal_article","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Mass spectrometry imaging (MSI) is a powerful analytical technique for the two-dimensional (2D) localization of chemicals on surfaces. Conventional MSI experiments require to predefine the surface of interest based on photographic or microscopic images. Typically, these boundaries can no longer be changed or adjusted once the experiment has been started. In terms of a more interactive approach we recently developed a pen-like ionization interface which is directly connected to the mass spectrometer. The device allows the user to ionize chemicals by desorption electrospray ionization (DESI) and to freely move the interface over a surface of interest. A mini camera, which is mounted on the tip of the pen, magnifies the desorption area and enables a simple positioning of the pen. The combination of optical data from the camera module and chemical data obtained by mass analysis facilitates a novel type of imaging experiment: interactive mass spectrometry imaging (IMSI). For this application, we present a novel approach for a robust, optical flow-based motion detection. While the live video stream from the camera is used to track the pen's motion across the surface a post-acquisition algorithm correlates the coordinates of the pen trajectory with respective mass spectra obtained from a simultaneous mass spectrometric data acquisition. This algorithm is no longer dependent on a single, manually applied optical marker on the sample surface, which has to be visible on all video frames throughout the analysis. The advanced DESI-IMSI method was successfully tested on inkjet-printed letters as well as mouse brain tissue samples. Validation of the results was done by comparing DESI-IMSI with standard DESI-MSI data."}],"language":[{"iso":"eng"}],"publication":"International Journal of Mass Spectrometry","scopus_import":"1","acknowledgement":"We would like to thank Marco Sealey Cardona, PhD for help with the mouse brain samples and acknowledge the financial support by 1669 Förderkreis of the University of Innsbruck, Austria Wirtschaftsservice (AWS), D. Swarovski KG and Tyrolean Science Fund (TWF).","publication_identifier":{"issn":["1387-3806"]},"date_published":"2024-01-01T00:00:00Z","file_date_updated":"2024-07-16T08:27:34Z","has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","fulldoi":"https://doi.org/10.1016/j.ijms.2023.117168","das_tickbox":"1","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["540"],"quality_controlled":"1","year":"2024","publication_status":"published","intvolume":"       495","article_number":"117168","isi":1,"volume":495,"file":[{"checksum":"6c5eb6dc07af70a59251d2c6fed38894","date_created":"2024-07-16T08:27:34Z","success":1,"creator":"dernst","relation":"main_file","access_level":"open_access","file_id":"17256","file_size":3003139,"date_updated":"2024-07-16T08:27:34Z","content_type":"application/pdf","file_name":"2024_IJMS_Kluibenschedl.pdf"}],"doi":"10.1016/j.ijms.2023.117168","researchdata_availability":"upon request","dataavailabilitystatement":"Data will be made available on request.","day":"01","oa":1,"external_id":{"isi":["001125054400001"]},"department":[{"_id":"GradSch"}],"month":"01","publisher":"Elsevier"},{"external_id":{"arxiv":["2308.13607"]},"publisher":"American Physical Society","month":"05","department":[{"_id":"GradSch"}],"day":"01","corr_author":"1","oa":1,"volume":5,"researchdata_availability":"no","doi":"10.1103/PRXQuantum.5.020327","file":[{"creator":"dernst","relation":"main_file","access_level":"open_access","checksum":"76bdf0b4dc06d59d073a57bd6957a96c","date_created":"2024-05-21T09:35:14Z","success":1,"file_size":2016085,"file_name":"2024_PRXQuantum_Finzgar.pdf","content_type":"application/pdf","date_updated":"2024-05-21T09:35:14Z","file_id":"15409"}],"article_number":"020327","publication_status":"published","quality_controlled":"1","year":"2024","intvolume":"         5","ddc":["530"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"das_tickbox":"0","fulldoi":"https://doi.org/10.1103/PRXQuantum.5.020327","arxiv":1,"has_accepted_license":"1","date_published":"2024-05-01T00:00:00Z","file_date_updated":"2024-05-21T09:35:14Z","article_processing_charge":"Yes","publication_identifier":{"eissn":["2691-3399"]},"acknowledgement":"J.R.F. and A.K. thank Libor Caha and Alexander Kliesch for insightful discussions. The authors thank Lilly Palackal, Maximilian Passek, Carlos Riofrío, and Gili Rosenberg for thorough reviews of the manuscript, and the Amazon Braket, BMW, and QuEra teams for their support. C.M. thanks the Munich Quantum Valley initiative, which is supported by the Bavarian State Government with funds from the Hightech Agenda Bayern Plus. H.G.K. would like to thank Am Platzl 1A for providing the necessary environment for creative thinking. An open-source implementation of QIRO is available online [60].","publication":"PRX Quantum","scopus_import":"1","issue":"2","language":[{"iso":"eng"}],"OA_type":"gold","OA_place":"publisher","type":"journal_article","oa_version":"Published Version","article_type":"original","abstract":[{"text":"We propose and implement a family of quantum-informed recursive optimization (QIRO) algorithms for combinatorial optimization problems. Our approach leverages quantum resources to obtain information that is used in problem-specific classical reduction steps that recursively simplify the problem. These reduction steps address the limitations of the quantum component (e.g., locality) and ensure solution feasibility in constrained optimization problems. Additionally, we use backtracking techniques to further improve the performance of the algorithm without increasing the requirements on the quantum hardware. We showcase the capabilities of our approach by informing QIRO with correlations from classical simulations of shallow circuits of the quantum approximate optimization algorithm, solving instances of maximum independent set and maximum satisfiability problems with hundreds of variables. We also demonstrate how QIRO can be deployed on a neutral atom quantum processor to find large independent sets of graphs. In summary, our scheme achieves results comparable to classical heuristics even with relatively weak quantum resources. Furthermore, enhancing the quality of these quantum resources improves the performance of the algorithms. Notably, the modular nature of QIRO offers various avenues for modifications, positioning our work as a template for a broader class of hybrid quantum-classical algorithms for combinatorial optimization.","lang":"eng"}],"title":"Quantum-informed recursive optimization algorithms","_id":"15407","author":[{"full_name":"Finžgar, Jernej Rudi","first_name":"Jernej Rudi","last_name":"Finžgar"},{"id":"ade85a9c-3200-11ee-973b-91c1eb240410","first_name":"Aron","last_name":"Kerschbaumer","orcid":"0009-0002-2370-8661","full_name":"Kerschbaumer, Aron"},{"full_name":"Schuetz, Martin J.A.","first_name":"Martin J.A.","last_name":"Schuetz"},{"first_name":"Christian B.","last_name":"Mendl","full_name":"Mendl, Christian B."},{"first_name":"Helmut G.","last_name":"Katzgraber","full_name":"Katzgraber, Helmut G."}],"status":"public","date_created":"2024-05-19T22:01:13Z","date_updated":"2026-10-02T11:07:49Z","supplementarymaterial":"yes","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","DOAJ_listed":"1","citation":{"apa":"Finžgar, J. R., Kerschbaumer, A., Schuetz, M. J. A., Mendl, C. B., &#38; Katzgraber, H. G. (2024). Quantum-informed recursive optimization algorithms. <i>PRX Quantum</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PRXQuantum.5.020327\">https://doi.org/10.1103/PRXQuantum.5.020327</a>","chicago":"Finžgar, Jernej Rudi, Aron Kerschbaumer, Martin J.A. Schuetz, Christian B. Mendl, and Helmut G. Katzgraber. “Quantum-Informed Recursive Optimization Algorithms.” <i>PRX Quantum</i>. American Physical Society, 2024. <a href=\"https://doi.org/10.1103/PRXQuantum.5.020327\">https://doi.org/10.1103/PRXQuantum.5.020327</a>.","short":"J.R. Finžgar, A. Kerschbaumer, M.J.A. Schuetz, C.B. Mendl, H.G. Katzgraber, PRX Quantum 5 (2024).","ista":"Finžgar JR, Kerschbaumer A, Schuetz MJA, Mendl CB, Katzgraber HG. 2024. Quantum-informed recursive optimization algorithms. PRX Quantum. 5(2), 020327.","ieee":"J. R. Finžgar, A. Kerschbaumer, M. J. A. Schuetz, C. B. Mendl, and H. G. Katzgraber, “Quantum-informed recursive optimization algorithms,” <i>PRX Quantum</i>, vol. 5, no. 2. American Physical Society, 2024.","ama":"Finžgar JR, Kerschbaumer A, Schuetz MJA, Mendl CB, Katzgraber HG. Quantum-informed recursive optimization algorithms. <i>PRX Quantum</i>. 2024;5(2). doi:<a href=\"https://doi.org/10.1103/PRXQuantum.5.020327\">10.1103/PRXQuantum.5.020327</a>","mla":"Finžgar, Jernej Rudi, et al. “Quantum-Informed Recursive Optimization Algorithms.” <i>PRX Quantum</i>, vol. 5, no. 2, 020327, American Physical Society, 2024, doi:<a href=\"https://doi.org/10.1103/PRXQuantum.5.020327\">10.1103/PRXQuantum.5.020327</a>."}},{"citation":{"mla":"Kolisnyk, Dmytro, et al. “Floquet Analysis of a Superradiant Many-Qutrit Refrigerator.” <i>Physical Review Applied</i>, vol. 21, no. 4, 044050, American Physical Society, 2024, doi:<a href=\"https://doi.org/10.1103/PhysRevApplied.21.044050\">10.1103/PhysRevApplied.21.044050</a>.","ama":"Kolisnyk D, Queißer F, Schaller G, Schützhold R. Floquet analysis of a superradiant many-qutrit refrigerator. <i>Physical Review Applied</i>. 2024;21(4). doi:<a href=\"https://doi.org/10.1103/PhysRevApplied.21.044050\">10.1103/PhysRevApplied.21.044050</a>","ieee":"D. Kolisnyk, F. Queißer, G. Schaller, and R. Schützhold, “Floquet analysis of a superradiant many-qutrit refrigerator,” <i>Physical Review Applied</i>, vol. 21, no. 4. American Physical Society, 2024.","short":"D. Kolisnyk, F. Queißer, G. Schaller, R. Schützhold, Physical Review Applied 21 (2024).","ista":"Kolisnyk D, Queißer F, Schaller G, Schützhold R. 2024. Floquet analysis of a superradiant many-qutrit refrigerator. Physical Review Applied. 21(4), 044050.","chicago":"Kolisnyk, Dmytro, Friedemann Queißer, Gernot Schaller, and Ralf Schützhold. “Floquet Analysis of a Superradiant Many-Qutrit Refrigerator.” <i>Physical Review Applied</i>. American Physical Society, 2024. <a href=\"https://doi.org/10.1103/PhysRevApplied.21.044050\">https://doi.org/10.1103/PhysRevApplied.21.044050</a>.","apa":"Kolisnyk, D., Queißer, F., Schaller, G., &#38; Schützhold, R. (2024). Floquet analysis of a superradiant many-qutrit refrigerator. <i>Physical Review Applied</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevApplied.21.044050\">https://doi.org/10.1103/PhysRevApplied.21.044050</a>"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2026-10-02T11:07:26Z","supplementarymaterial":"yes","status":"public","author":[{"full_name":"Kolisnyk, Dmytro","orcid":"0000-0002-8612-8202","first_name":"Dmytro","last_name":"Kolisnyk","id":"530a7320-5355-11ee-ae5a-82a46997aaa7"},{"last_name":"Queißer","first_name":"Friedemann","full_name":"Queißer, Friedemann"},{"full_name":"Schaller, Gernot","first_name":"Gernot","last_name":"Schaller"},{"full_name":"Schützhold, Ralf","first_name":"Ralf","last_name":"Schützhold"}],"date_created":"2024-05-05T22:01:04Z","_id":"15360","title":"Floquet analysis of a superradiant many-qutrit refrigerator","abstract":[{"text":"We investigate superradiant enhancements in the refrigeration performance of a set of N three-level systems that are collectively coupled to a hot and a cold thermal reservoir and are additionally subject to collective periodic (circular) driving. Assuming the system-reservoir coupling to be weak, we explore the regime of stronger periodic driving strengths by comparing collective weak driving, Floquet-Lindblad, and Floquet-Redfield master equations. We identify regimes where the power injected by the periodic driving is used to pump heat from the cold to the hot reservoir and derive analytic sufficient conditions for them based on a cycle analysis of the Floquet-Lindblad master equation. In those regimes, we also argue for which parameters collective enhancements like a quadratic scaling of the cooling current with N can be expected and support our arguments by numerical simulations.","lang":"eng"}],"article_type":"original","oa_version":"Preprint","type":"journal_article","language":[{"iso":"eng"}],"issue":"4","scopus_import":"1","publication":"Physical Review Applied","acknowledgement":"Financial support by the DFG (project ID 278162697 – SFB 1242) is gratefully acknowledged.\r\n","publication_identifier":{"eissn":["2331-7019"]},"article_processing_charge":"No","date_published":"2024-04-26T00:00:00Z","arxiv":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2310.18126"}],"fulldoi":"https://doi.org/10.1103/PhysRevApplied.21.044050","das_tickbox":"0","intvolume":"        21","quality_controlled":"1","year":"2024","publication_status":"published","article_number":"044050","isi":1,"researchdata_availability":"no","doi":"10.1103/PhysRevApplied.21.044050","volume":21,"oa":1,"day":"26","department":[{"_id":"GradSch"}],"month":"04","publisher":"American Physical Society","external_id":{"isi":["001226579400001"],"arxiv":["2310.18126"]}},{"publication_status":"published","year":"2024","quality_controlled":"1","intvolume":"        85","date_published":"2024-06-01T00:00:00Z","article_processing_charge":"No","das_tickbox":"0","fulldoi":"https://doi.org/10.1134/S0005117924060031","day":"01","corr_author":"1","external_id":{"isi":["001338721700007"]},"publisher":"Springer Nature","department":[{"_id":"GradSch"}],"month":"06","isi":1,"volume":85,"researchdata_availability":"no","doi":"10.1134/S0005117924060031","title":"An algorithm for finding the generalized Chebyshev center of sets defined via their support functions","_id":"18482","author":[{"first_name":"Pavel","last_name":"Arkhipov","id":"b25f2ab2-1fed-11ee-8599-fe02d211784f","full_name":"Arkhipov, Pavel"}],"date_created":"2024-10-27T23:01:45Z","status":"public","type":"journal_article","oa_version":"None","article_type":"original","abstract":[{"lang":"eng","text":"This paper is dedicated to an optimization problem. Let A, B ⊂ Rn be compact convex sets. Consider the minimal number t0 > 0 such that t0B covers A after a shift to a vector x0 ∈ \r\nRn. The goal is to find t0 and x0. In the special case of B being a unit ball centered at zero, x0 and t0 are known as the Chebyshev center and the Chebyshev radius of A. This paper focuses on the case in which A and B are defined with their black-box support functions. An algorithm for solving such problems efficiently is suggested. The algorithm has a superlinear convergence rate, and it can solve hundred-dimensional test problems in a reasonable time, but some additional conditions on A and B are required to guarantee the presence of convergence. Additionally, the behavior of the algorithm for a simple special case is investigated, which leads to a number of theoretical results. Perturbations of this special case are also studied."}],"page":"522-532","citation":{"chicago":"Arkhipov, Pavel. “An Algorithm for Finding the Generalized Chebyshev Center of Sets Defined via Their Support Functions.” <i>Automation and Remote Control</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1134/S0005117924060031\">https://doi.org/10.1134/S0005117924060031</a>.","apa":"Arkhipov, P. (2024). An algorithm for finding the generalized Chebyshev center of sets defined via their support functions. <i>Automation and Remote Control</i>. Springer Nature. <a href=\"https://doi.org/10.1134/S0005117924060031\">https://doi.org/10.1134/S0005117924060031</a>","ama":"Arkhipov P. An algorithm for finding the generalized Chebyshev center of sets defined via their support functions. <i>Automation and Remote Control</i>. 2024;85(6):522-532. doi:<a href=\"https://doi.org/10.1134/S0005117924060031\">10.1134/S0005117924060031</a>","mla":"Arkhipov, Pavel. “An Algorithm for Finding the Generalized Chebyshev Center of Sets Defined via Their Support Functions.” <i>Automation and Remote Control</i>, vol. 85, no. 6, Springer Nature, 2024, pp. 522–32, doi:<a href=\"https://doi.org/10.1134/S0005117924060031\">10.1134/S0005117924060031</a>.","ista":"Arkhipov P. 2024. An algorithm for finding the generalized Chebyshev center of sets defined via their support functions. Automation and Remote Control. 85(6), 522–532.","ieee":"P. Arkhipov, “An algorithm for finding the generalized Chebyshev center of sets defined via their support functions,” <i>Automation and Remote Control</i>, vol. 85, no. 6. Springer Nature, pp. 522–532, 2024.","short":"P. Arkhipov, Automation and Remote Control 85 (2024) 522–532."},"supplementarymaterial":"no","date_updated":"2026-10-02T11:10:45Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Automation and Remote Control","scopus_import":"1","issue":"6","publication_identifier":{"eissn":["1608-3032"],"issn":["0005-1179"]},"acknowledgement":"The author is grateful to Maxim Balashov for setting the problem, providing useful literature, important discussions and text review. Also, I thank Dmitry Tsarev and Kseniia Petukhova for meaningful talks and support.","OA_type":"closed access","language":[{"iso":"eng"}]},{"publication_status":"published","year":"2024","quality_controlled":"1","das_tickbox":"0","fulldoi":"https://doi.org/10.1109/OMN61224.2024.10685279","article_processing_charge":"No","conference":{"start_date":"2024-07-28","end_date":"2024-08-01","name":"OMN: Conference on Optical MEMS and Nanophotonics","location":"San Sebastian, Spain"},"date_published":"2024-09-27T00:00:00Z","publisher":"IEEE","department":[{"_id":"GradSch"}],"month":"09","external_id":{"isi":["001327768000060"]},"day":"27","doi":"10.1109/OMN61224.2024.10685279","researchdata_availability":"no","isi":1,"abstract":[{"text":"In this work we present the engineering of a portable platform for sensing SERS signals in droplets microfluidics. This system comprised not only the read-out platform but also a design for the microfluidic devices optimized to enhanced the obtained SERS signals.","lang":"eng"}],"type":"conference","oa_version":"None","status":"public","date_created":"2024-10-20T22:02:07Z","author":[{"full_name":"Quintero, Sergio","last_name":"Quintero","first_name":"Sergio"},{"last_name":"Relvas","first_name":"Maria","full_name":"Relvas, Maria"},{"full_name":"Aranda, Marta","first_name":"Marta","last_name":"Aranda"},{"id":"8ad43d5a-1ffe-11ee-8b67-8176f59de781","last_name":"Nodal","first_name":"Fernando","orcid":"0009-0006-4119-4376","full_name":"Nodal, Fernando"},{"full_name":"Dieguez, Lorena","last_name":"Dieguez","first_name":"Lorena"},{"full_name":"Abalde-Cela, Sara","first_name":"Sara","last_name":"Abalde-Cela"}],"title":"Portable Raman platform for SERS droplets microfludics","_id":"18450","date_updated":"2026-10-02T11:10:28Z","supplementarymaterial":"no","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"mla":"Quintero, Sergio, et al. “Portable Raman Platform for SERS Droplets Microfludics.” <i>2024 International Conference on Optical MEMS and Nanophotonics</i>, IEEE, 2024, doi:<a href=\"https://doi.org/10.1109/OMN61224.2024.10685279\">10.1109/OMN61224.2024.10685279</a>.","ama":"Quintero S, Relvas M, Aranda M, Nodal F, Dieguez L, Abalde-Cela S. Portable Raman platform for SERS droplets microfludics. In: <i>2024 International Conference on Optical MEMS and Nanophotonics</i>. IEEE; 2024. doi:<a href=\"https://doi.org/10.1109/OMN61224.2024.10685279\">10.1109/OMN61224.2024.10685279</a>","ieee":"S. Quintero, M. Relvas, M. Aranda, F. Nodal, L. Dieguez, and S. Abalde-Cela, “Portable Raman platform for SERS droplets microfludics,” in <i>2024 International Conference on Optical MEMS and Nanophotonics</i>, San Sebastian, Spain, 2024.","ista":"Quintero S, Relvas M, Aranda M, Nodal F, Dieguez L, Abalde-Cela S. 2024. Portable Raman platform for SERS droplets microfludics. 2024 International Conference on Optical MEMS and Nanophotonics. OMN: Conference on Optical MEMS and Nanophotonics.","short":"S. Quintero, M. Relvas, M. Aranda, F. Nodal, L. Dieguez, S. Abalde-Cela, in:, 2024 International Conference on Optical MEMS and Nanophotonics, IEEE, 2024.","chicago":"Quintero, Sergio, Maria Relvas, Marta Aranda, Fernando Nodal, Lorena Dieguez, and Sara Abalde-Cela. “Portable Raman Platform for SERS Droplets Microfludics.” In <i>2024 International Conference on Optical MEMS and Nanophotonics</i>. IEEE, 2024. <a href=\"https://doi.org/10.1109/OMN61224.2024.10685279\">https://doi.org/10.1109/OMN61224.2024.10685279</a>.","apa":"Quintero, S., Relvas, M., Aranda, M., Nodal, F., Dieguez, L., &#38; Abalde-Cela, S. (2024). Portable Raman platform for SERS droplets microfludics. In <i>2024 International Conference on Optical MEMS and Nanophotonics</i>. San Sebastian, Spain: IEEE. <a href=\"https://doi.org/10.1109/OMN61224.2024.10685279\">https://doi.org/10.1109/OMN61224.2024.10685279</a>"},"acknowledgement":"The authors acknowledge the financial support of the project HfPT – Health from Portugal, with the reference n.° C644937233-00000047, co-funded by Component C5 – Capitalisation and Business Innovation under the Portuguese Resilience and Recovery Plan, through the NextGenerationEU Fund.","publication_identifier":{"eissn":["2160-5041"],"issn":["2160-5033"],"isbn":["9798350384925"]},"scopus_import":"1","publication":"2024 International Conference on Optical MEMS and Nanophotonics","language":[{"iso":"eng"}],"OA_type":"closed access"},{"oa":1,"corr_author":"1","day":"29","department":[{"_id":"GradSch"}],"month":"11","publisher":"Institute of Science and Technology Austria","doi_confirm":"1","file":[{"file_size":3836671,"content_type":"application/pdf","date_updated":"2024-11-28T12:50:32Z","file_name":"Cecelia Mweka Master Thesis.pdf","file_id":"18597","relation":"main_file","creator":"cmweka","access_level":"open_access","checksum":"054ed7a5e5ae6e7220e6bb37ea57a3c3","date_created":"2024-11-28T12:50:32Z","success":1},{"file_id":"18598","file_size":7068210,"file_name":"Cecelia Mweka Master Thesis.docx","date_updated":"2024-12-13T11:30:53Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","checksum":"7d7d9299f090d83e628d65d93116e8c2","date_created":"2024-11-28T12:51:43Z","relation":"source_file","creator":"cmweka","access_level":"closed"}],"researchdata_availability":"no","doi":"10.15479/at:ista:18588","ddc":["530"],"year":"2024","publication_status":"published","article_processing_charge":"No","date_published":"2024-11-29T00:00:00Z","alternative_title":["ISTA Master's Thesis"],"file_date_updated":"2024-12-13T11:30:53Z","has_accepted_license":"1","acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"fulldoi":"https://doi.org/10.15479/at:ista:18588","degree_awarded":"MS","das_tickbox":"0","publication_identifier":{"issn":["2791-4585"]},"acknowledgement":"I would like to acknowledge Scott Waitukaitis and Jérémie Palacci, for their supervision, and their extensive support of my learning. \r\n\r\nFor the beautiful characterization images used in this work, I would like to thank Dr. Daniel Grober, Samuel Hajek and Felix Pertl.\r\n\r\nThe Palacci group, particularly Malina Strugaru and Dan Grober, for their continuous guidance in decoding and following my streams of thought.\r\n\r\nTo the Waitukaitis group, for helping me find my footing in science, and making me feel at\r\nhome.\r\n\r\nTo the Nanofabrication Facility (NFF) at ISTA, for training me in significant aspects of my research. The MIBA Facility, and particularly Todor Asenov for consistently picking up the phone for my machining and designing needs.\r\n\r\nTo my friends, Mariana, Lenka, Aaron, Rebecca, Eavan who provided an ear, wine, and a lot more when I needed to vent, talk through my crises as well as experiment. For the walks, for the coffees, for reading through my work and providing edits, for dinners to take me out of blocks and binds and for cheering me on when it felt insurmountable. \r\n\r\nFinally, I am grateful to Griff and Fletcher, whose music helped me through several blocks, especially with my writing.\r\n\r\nMy science would not have been possible without the guidance, support and contributions of\r\nall these people, and more.","OA_place":"publisher","language":[{"iso":"eng"}],"author":[{"full_name":"Mweka, Cecelia N","first_name":"Cecelia N","last_name":"Mweka","id":"2a69ab4b-896a-11ed-bdf8-cb8641cf2b21"}],"date_created":"2024-11-27T09:12:02Z","status":"public","_id":"18588","title":"Non equilibrium dynamics of driven individual particles and 3D printing across scales","abstract":[{"lang":"eng","text":"This thesis is an experimental work about two distinct research projects that evolved from a single project: non-equilibrium dynamics of an acoustically vibrated particle and microfabrication of particles with nano-scale 3D printing. The first project explores non equilibrium dynamics of a particle driven by ultrasonic vibrations. We design an experimental system consisting of an electromechanical vibration scheme to drive the particle’s vibrations and an imaging scheme to track its trajectories. We study the trajectories to determine how the particle’s dynamics evolve under the driven conditions, considering out of equilibrium systems in the context of equilibrium statistical mechanics. Using a Langevin framework and the Boltzmann factor, we characterize the particle’s dynamics as complex; the particle motion\r\nis not purely diffusive. We extract physical parameters like spring constant, effective temperature, damping coefficient and resonance frequency.\r\n\r\nIn the second project, we explore and develop techniques in the design and microfabrication of particles across scales. Microfabrication involves building structures at the micron or submicron scale. These designed miniaturized patterns, objects, or devices are useful in biophysics, pharmacology, medical biology, and nanotechnology. We specifically apply two-photon polymerization, a form of 3D nano printing. We print millimetric particles, characterizing different designs to evaluate and showcase the resolution, aspect ratio integrity and print quality of the printing process. We also design and fabricate a microsensor to deflect under applicable force of order 0.1 pN. We present fundamental concepts needed to design the microsensor, showcasing 3D printing at considerably smaller scales down to the µm or below."}],"supervisor":[{"orcid":"0000-0002-2299-3176","full_name":"Waitukaitis, Scott R","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","last_name":"Waitukaitis","first_name":"Scott R"},{"first_name":"Jérémie A","last_name":"Palacci","id":"8fb92548-2b22-11eb-b7c1-a3f0d08d7c7d","full_name":"Palacci, Jérémie A","orcid":"0000-0002-7253-9465"}],"oa_version":"Published Version","type":"dissertation","citation":{"chicago":"Mweka, Cecelia N. “Non Equilibrium Dynamics of Driven Individual Particles and 3D Printing across Scales.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18588\">https://doi.org/10.15479/at:ista:18588</a>.","apa":"Mweka, C. N. (2024). <i>Non equilibrium dynamics of driven individual particles and 3D printing across scales</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18588\">https://doi.org/10.15479/at:ista:18588</a>","ama":"Mweka CN. Non equilibrium dynamics of driven individual particles and 3D printing across scales. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18588\">10.15479/at:ista:18588</a>","mla":"Mweka, Cecelia N. <i>Non Equilibrium Dynamics of Driven Individual Particles and 3D Printing across Scales</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18588\">10.15479/at:ista:18588</a>.","ieee":"C. N. Mweka, “Non equilibrium dynamics of driven individual particles and 3D printing across scales,” Institute of Science and Technology Austria, 2024.","ista":"Mweka CN. 2024. Non equilibrium dynamics of driven individual particles and 3D printing across scales. Institute of Science and Technology Austria.","short":"C.N. Mweka, Non Equilibrium Dynamics of Driven Individual Particles and 3D Printing across Scales, Institute of Science and Technology Austria, 2024."},"page":"61","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2026-10-02T11:11:44Z","supplementarymaterial":"no"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2026-10-02T11:13:43Z","related_material":{"record":[{"status":"public","id":"15009","relation":"used_in_publication"}]},"project":[{"grant_number":"F8810","name":"The highjacking of meiosis for asexual reproduction","_id":"34ae1506-11ca-11ed-8bc3-c14f4c474396"}],"citation":{"apa":"Elkrewi, M. N. (2024). Data from “Chromosome-level assembly of Artemia franciscana sheds light on sex-chromosome differentiation.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:14705\">https://doi.org/10.15479/AT:ISTA:14705</a>","chicago":"Elkrewi, Marwan N. “Data from ‘Chromosome-Level Assembly of Artemia Franciscana Sheds Light on Sex-Chromosome Differentiation.’” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/AT:ISTA:14705\">https://doi.org/10.15479/AT:ISTA:14705</a>.","ieee":"M. N. Elkrewi, “Data from ‘Chromosome-level assembly of Artemia franciscana sheds light on sex-chromosome differentiation.’” Institute of Science and Technology Austria, 2024.","short":"M.N. Elkrewi, (2024).","ista":"Elkrewi MN. 2024. Data from ‘Chromosome-level assembly of Artemia franciscana sheds light on sex-chromosome differentiation’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:14705\">10.15479/AT:ISTA:14705</a>.","mla":"Elkrewi, Marwan N. <i>Data from “Chromosome-Level Assembly of Artemia Franciscana Sheds Light on Sex-Chromosome Differentiation.”</i> Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:14705\">10.15479/AT:ISTA:14705</a>.","ama":"Elkrewi MN. Data from “Chromosome-level assembly of Artemia franciscana sheds light on sex-chromosome differentiation.” 2024. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:14705\">10.15479/AT:ISTA:14705</a>"},"oa_version":"Published Version","type":"research_data","abstract":[{"lang":"eng","text":"Since the commercialization of brine shrimp (genus Artemia) in the 1950s, this lineage, and in particular the model species Artemia franciscana, has been the subject of extensive research. However, our understanding of the genetic mechanisms underlying various aspects of their reproductive biology, including sex determination, are still lacking. This is partly due to the scarcity of genomic resources for Artemia species and crustaceans in general. Here, we present a chromosome-level genome assembly of Artemia franciscana (Kellogg 1906), from the Great Salt Lake, USA. The genome is 1GB, and the majority of the genome (81%) is scaffolded into 21 linkage groups using a previously published high-density linkage map. We performed coverage and FST analyses using male and female genomic and transcriptomic reads to quantify the extent of differentiation between the Z and W chromosomes. Additionally, we quantified the expression levels in male and female heads and gonads and found further evidence for dosage compensation in this species."}],"_id":"14705","title":"Data from \"Chromosome-level assembly of Artemia franciscana sheds light on sex-chromosome differentiation\"","author":[{"last_name":"Elkrewi","first_name":"Marwan N","id":"0B46FACA-A8E1-11E9-9BD3-79D1E5697425","orcid":"0000-0002-5328-7231","full_name":"Elkrewi, Marwan N"}],"date_created":"2023-12-22T13:40:48Z","status":"public","file":[{"success":1,"date_created":"2023-12-22T13:54:21Z","checksum":"bdaf1392867786634ec5466d528c36ca","access_level":"open_access","relation":"main_file","creator":"melkrewi","file_id":"14707","date_updated":"2023-12-22T13:54:21Z","content_type":"text/plain","file_name":"readme.txt.txt","file_size":847},{"success":1,"date_created":"2023-12-22T14:14:06Z","checksum":"973e1cbdab923a71709782177980829f","access_level":"open_access","relation":"main_file","creator":"melkrewi","file_id":"14708","content_type":"application/x-zip-compressed","date_updated":"2023-12-22T14:14:06Z","file_name":"data_artemia_franciscana_genome.zip","file_size":343632753}],"doi":"10.15479/AT:ISTA:14705","doi_confirm":"1","contributor":[{"id":"57854184-AAE0-11E9-8D04-98D6E5697425","contributor_type":"researcher","first_name":"Vincent K","last_name":"Bett"},{"id":"2A0848E2-F248-11E8-B48F-1D18A9856A87","contributor_type":"project_member","last_name":"Macon","first_name":"Ariana"},{"orcid":"0000-0002-4579-8306","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","contributor_type":"supervisor","last_name":"Vicoso","first_name":"Beatriz"},{"id":"0B46FACA-A8E1-11E9-9BD3-79D1E5697425","contributor_type":"researcher","first_name":"Marwan N","last_name":"Elkrewi","orcid":"0000-0002-5328-7231"}],"month":"01","department":[{"_id":"GradSch"},{"_id":"BeVi"}],"publisher":"Institute of Science and Technology Austria","day":"02","oa":1,"corr_author":"1","fulldoi":"https://doi.org/10.15479/AT:ISTA:14705","file_date_updated":"2023-12-22T14:14:06Z","date_published":"2024-01-02T00:00:00Z","has_accepted_license":"1","keyword":["sex chromosome evolution","genome assembly","dosage compensation"],"article_processing_charge":"No","year":"2024","ddc":["576"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"}},{"fulldoi":"https://doi.org/10.1145/3641519.3657485","das_tickbox":"0","keyword":["physical simulation","frictional contact","rigid body mechanics","non-smooth dynamics"],"article_processing_charge":"Yes (via OA deal)","file_date_updated":"2024-07-10T11:03:58Z","date_published":"2024-07-01T00:00:00Z","has_accepted_license":"1","conference":{"start_date":"2024-07-28","end_date":"2024-08-01","name":"SIGGRAPH: Computer Graphics and Interactive Techniques Conference","location":"Denver, United States"},"quality_controlled":"1","year":"2024","publication_status":"published","ddc":["621","531","006"],"file":[{"date_created":"2024-07-10T11:03:14Z","checksum":"b8b203ed09e3995ba0d7e6a76288663a","success":1,"creator":"yichen","relation":"main_file","access_level":"open_access","file_id":"17215","file_size":47309472,"date_updated":"2024-07-10T11:03:14Z","content_type":"application/pdf","file_name":"sig24_friction_authors.pdf"},{"file_size":10518286,"file_name":"sig24_friction_supplementary.pdf","date_updated":"2024-07-10T11:03:12Z","content_type":"application/pdf","file_id":"17216","creator":"yichen","relation":"main_file","access_level":"open_access","checksum":"89d81b397b4b6469d828808a68b70820","date_created":"2024-07-10T11:03:12Z","success":1},{"file_size":71789192,"file_name":"friction_paper_extra_video_finished.mp4","content_type":"video/mp4","date_updated":"2024-07-10T11:03:51Z","file_id":"17217","creator":"yichen","relation":"main_file","access_level":"open_access","checksum":"7123deed34a5456810e7b5336a31c657","date_created":"2024-07-10T11:03:51Z","success":1},{"content_type":"video/mp4","date_updated":"2024-07-10T11:03:58Z","file_name":"friction_paper_video_finished.mp4","file_size":280610763,"file_id":"17218","access_level":"open_access","creator":"yichen","relation":"main_file","success":1,"checksum":"e606fc1ae8f2610ce3b4421566800b45","date_created":"2024-07-10T11:03:58Z"}],"researchdata_availability":"no","doi":"10.1145/3641519.3657485","isi":1,"department":[{"_id":"GradSch"},{"_id":"ChWo"}],"month":"07","publisher":"Association for Computing Machinery","external_id":{"isi":["001282218200091"]},"oa":1,"corr_author":"1","day":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","supplementarymaterial":"yes","date_updated":"2026-10-02T11:16:26Z","project":[{"name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","grant_number":"101045083"}],"citation":{"chicago":"Chen, Yi-Lu, Mickaël Ly, and Chris Wojtan. “Primal-Dual Non-Smooth Friction for Rigid Body Animation.” In <i>Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers ’24</i>. Association for Computing Machinery, 2024. <a href=\"https://doi.org/10.1145/3641519.3657485\">https://doi.org/10.1145/3641519.3657485</a>.","apa":"Chen, Y.-L., Ly, M., &#38; Wojtan, C. (2024). Primal-dual non-smooth friction for rigid body animation. In <i>Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers ’24</i>. Denver, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3641519.3657485\">https://doi.org/10.1145/3641519.3657485</a>","mla":"Chen, Yi-Lu, et al. “Primal-Dual Non-Smooth Friction for Rigid Body Animation.” <i>Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers ’24</i>, Association for Computing Machinery, 2024, doi:<a href=\"https://doi.org/10.1145/3641519.3657485\">10.1145/3641519.3657485</a>.","ama":"Chen Y-L, Ly M, Wojtan C. Primal-dual non-smooth friction for rigid body animation. In: <i>Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers ’24</i>. Association for Computing Machinery; 2024. doi:<a href=\"https://doi.org/10.1145/3641519.3657485\">10.1145/3641519.3657485</a>","ieee":"Y.-L. Chen, M. Ly, and C. Wojtan, “Primal-dual non-smooth friction for rigid body animation,” in <i>Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers ’24</i>, Denver, United States, 2024.","short":"Y.-L. Chen, M. Ly, C. Wojtan, in:, Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers ’24, Association for Computing Machinery, 2024.","ista":"Chen Y-L, Ly M, Wojtan C. 2024. Primal-dual non-smooth friction for rigid body animation. Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers ’24. SIGGRAPH: Computer Graphics and Interactive Techniques Conference."},"abstract":[{"lang":"eng","text":"Current numerical algorithms for simulating friction fall in one of two camps: smooth solvers sacrifice the stable treatment of static friction in exchange for fast convergence, and non-smooth solvers accurately compute friction at convergence rates that are often prohibitive for large graphics applications. We introduce a novel bridge between these two ideas that computes static and dynamic friction stably and efficiently. Our key idea is to convert the highly constrained non-smooth problem into an unconstrained smooth problem using logarithmic barriers that converges to the exact solution as accuracy increases. We phrase the problem as an interior point primal-dual problem that can be solved efficiently with Newton iteration. We observe quadratic convergence despite the non-smooth nature of the original problem, and our method is well-suited for large systems of tightly packed objects with many contact points. We demonstrate the efficacy of our method with stable piles of grains and stacks of objects, complex granular flows, and robust interlocking assemblies of rigid bodies."}],"oa_version":"Published Version","type":"conference","author":[{"id":"0b467602-dbcd-11ea-9d1d-ed480aa46b70","last_name":"Chen","first_name":"Yi-Lu","full_name":"Chen, Yi-Lu","orcid":"0009-0005-0723-0655"},{"id":"6340d7f0-b48d-11eb-b10d-b7487e71d9f1","last_name":"Ly","first_name":"Mickaël","full_name":"Ly, Mickaël"},{"orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J","last_name":"Wojtan"}],"date_created":"2024-07-10T11:06:20Z","status":"public","_id":"17214","title":"Primal-dual non-smooth friction for rigid body animation","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9798400705250"]},"acknowledgement":"We thank Vincent Acary for his help with Siconos, as well as the anonymous reviewers and the members of the Visual Computing Group at ISTA for their helpful comments. This research was funded in part by the European Union (ERC-2021-COG 101045083 CoDiNA).","scopus_import":"1","publication":"Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers '24"},{"doi":"10.1109/CVPR52733.2024.02320","researchdata_availability":"no","isi":1,"external_id":{"arxiv":["2311.16833"],"isi":["001344387500055"]},"publisher":"Computer Vision Foundation","month":"06","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"day":"01","corr_author":"1","oa":1,"das_tickbox":"0","fulldoi":"https://doi.org/10.1109/CVPR52733.2024.02320","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2311.16833"}],"arxiv":1,"conference":{"name":"CVPR: Conference on Computer Vision and Pattern Recognition","start_date":"2024-06-16","end_date":"2024-06-22","location":"Seattle, WA, United States"},"has_accepted_license":"1","date_published":"2024-06-01T00:00:00Z","article_processing_charge":"No","publication_status":"published","quality_controlled":"1","year":"2024","language":[{"iso":"eng"}],"OA_place":"repository","OA_type":"green","acknowledgement":"This work was partially supported by project SERICS (PE00000014) under the MUR National Recovery and Resilience Plan funded by the European Union - NextGenerationEU.\r\n","publication":"Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition","date_updated":"2026-10-02T11:16:04Z","supplementarymaterial":"no","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","related_material":{"record":[{"id":"19759","relation":"dissertation_contains","status":"public"}],"link":[{"url":"https://github.com/berndprach/1LipschitzLayersCompared","relation":"software"}]},"citation":{"ama":"Prach B, Brau F, Buttazzo G, Lampert C. 1-Lipschitz layers compared: Memory, speed, and certifiable robustness. In: <i>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>. Computer Vision Foundation; 2024:24574-24583. doi:<a href=\"https://doi.org/10.1109/CVPR52733.2024.02320\">10.1109/CVPR52733.2024.02320</a>","mla":"Prach, Bernd, et al. “1-Lipschitz Layers Compared: Memory, Speed, and Certifiable Robustness.” <i>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, Computer Vision Foundation, 2024, pp. 24574–83, doi:<a href=\"https://doi.org/10.1109/CVPR52733.2024.02320\">10.1109/CVPR52733.2024.02320</a>.","short":"B. Prach, F. Brau, G. Buttazzo, C. Lampert, in:, Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, Computer Vision Foundation, 2024, pp. 24574–24583.","ieee":"B. Prach, F. Brau, G. Buttazzo, and C. Lampert, “1-Lipschitz layers compared: Memory, speed, and certifiable robustness,” in <i>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, Seattle, WA, United States, 2024, pp. 24574–24583.","ista":"Prach B, Brau F, Buttazzo G, Lampert C. 2024. 1-Lipschitz layers compared: Memory, speed, and certifiable robustness. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition, 24574–24583.","chicago":"Prach, Bernd, Fabio Brau, Giorgio Buttazzo, and Christoph Lampert. “1-Lipschitz Layers Compared: Memory, Speed, and Certifiable Robustness.” In <i>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, 24574–83. Computer Vision Foundation, 2024. <a href=\"https://doi.org/10.1109/CVPR52733.2024.02320\">https://doi.org/10.1109/CVPR52733.2024.02320</a>.","apa":"Prach, B., Brau, F., Buttazzo, G., &#38; Lampert, C. (2024). 1-Lipschitz layers compared: Memory, speed, and certifiable robustness. In <i>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</i> (pp. 24574–24583). Seattle, WA, United States: Computer Vision Foundation. <a href=\"https://doi.org/10.1109/CVPR52733.2024.02320\">https://doi.org/10.1109/CVPR52733.2024.02320</a>"},"page":"24574-24583","type":"conference","oa_version":"Preprint","abstract":[{"text":"The robustness of neural networks against input perturbations with bounded\r\nmagnitude represents a serious concern in the deployment of deep learning\r\nmodels in safety-critical systems. Recently, the scientific community has\r\nfocused on enhancing certifiable robustness guarantees by crafting 1-Lipschitz\r\nneural networks that leverage Lipschitz bounded dense and convolutional layers.\r\nAlthough different methods have been proposed in the literature to achieve this\r\ngoal, understanding the performance of such methods is not straightforward,\r\nsince different metrics can be relevant (e.g., training time, memory usage,\r\naccuracy, certifiable robustness) for different applications. For this reason,\r\nthis work provides a thorough theoretical and empirical comparison between\r\nmethods by evaluating them in terms of memory usage, speed, and certifiable\r\nrobust accuracy. The paper also provides some guidelines and recommendations to\r\nsupport the user in selecting the methods that work best depending on the\r\navailable resources. We provide code at\r\nhttps://github.com/berndprach/1LipschitzLayersCompared.","lang":"eng"}],"title":"1-Lipschitz layers compared: Memory, speed, and certifiable robustness","_id":"17426","status":"public","author":[{"first_name":"Bernd","last_name":"Prach","id":"2D561D42-C427-11E9-89B4-9C1AE6697425","full_name":"Prach, Bernd"},{"last_name":"Brau","first_name":"Fabio","full_name":"Brau, Fabio"},{"last_name":"Buttazzo","first_name":"Giorgio","full_name":"Buttazzo, Giorgio"},{"orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","last_name":"Lampert","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2024-08-14T08:42:32Z"},{"publication":"arXiv","OA_place":"repository","language":[{"iso":"eng"}],"_id":"18874","title":"Intriguing properties of robust classification","status":"public","date_created":"2025-01-24T16:57:29Z","author":[{"last_name":"Prach","first_name":"Bernd","id":"2D561D42-C427-11E9-89B4-9C1AE6697425","full_name":"Prach, Bernd"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"oa_version":"Preprint","type":"preprint","abstract":[{"lang":"eng","text":"Despite extensive research since the community learned about adversarial\r\nexamples 10 years ago, we still do not know how to train high-accuracy\r\nclassifiers that are guaranteed to be robust to small perturbations of their\r\ninputs. Previous works often argued that this might be because no classifier\r\nexists that is robust and accurate at the same time. However, in computer\r\nvision this assumption does not match reality where humans are usually accurate\r\nand robust on most tasks of interest. We offer an alternative explanation and\r\nshow that in certain settings robust generalization is only possible with\r\nunrealistically large amounts of data. More precisely we find a setting where a\r\nrobust classifier exists, it is easy to learn an accurate classifier, yet it\r\nrequires an exponential amount of data to learn a robust classifier. Based on\r\nthis theoretical result, we explore how well robust classifiers generalize on\r\ndatasets such as CIFAR-10. We come to the conclusion that on this datasets, the\r\nlimitation of current robust models also lies in the generalization, and that\r\nthey require a lot of data to do well on the test set. We also show that the\r\nproblem is not in the expressiveness or generalization capabilities of current\r\narchitectures, and that there are low magnitude features in the data which are\r\nuseful for non-robust generalization but are not available for robust\r\nclassifiers."}],"related_material":{"record":[{"status":"public","id":"20455","relation":"later_version"},{"status":"public","id":"19759","relation":"dissertation_contains"}]},"citation":{"mla":"Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.” <i>ArXiv</i>, 2412.04245, doi:<a href=\"https://doi.org/10.48550/arXiv.2412.04245\">10.48550/arXiv.2412.04245</a>.","ama":"Prach B, Lampert C. Intriguing properties of robust classification. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2412.04245\">10.48550/arXiv.2412.04245</a>","short":"B. Prach, C. Lampert, ArXiv (n.d.).","ista":"Prach B, Lampert C. Intriguing properties of robust classification. arXiv, 2412.04245.","ieee":"B. Prach and C. Lampert, “Intriguing properties of robust classification,” <i>arXiv</i>. .","chicago":"Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2412.04245\">https://doi.org/10.48550/arXiv.2412.04245</a>.","apa":"Prach, B., &#38; Lampert, C. (n.d.). Intriguing properties of robust classification. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2412.04245\">https://doi.org/10.48550/arXiv.2412.04245</a>"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","supplementarymaterial":"yes","date_updated":"2026-10-02T11:15:43Z","day":"05","oa":1,"corr_author":"1","external_id":{"arxiv":["2412.04245"]},"department":[{"_id":"GradSch"},{"_id":"ChLa"}],"month":"12","article_number":"2412.04245","doi":"10.48550/arXiv.2412.04245","researchdata_availability":"no","year":"2024","publication_status":"draft","date_published":"2024-12-05T00:00:00Z","article_processing_charge":"No","fulldoi":"https://doi.org/10.48550/arXiv.2412.04245","das_tickbox":"0","arxiv":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2412.04245"}]},{"related_material":{"record":[{"relation":"dissertation_contains","id":"20551","status":"public"},{"status":"public","relation":"later_version","id":"21743"}]},"project":[{"name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","grant_number":"101045083"}],"citation":{"mla":"Bauer, Martin, et al. “Symplectic Structures on the Space of Space Curves.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/arXiv.2407.19908\">10.48550/arXiv.2407.19908</a>.","ama":"Bauer M, Ishida S, Michor PW. Symplectic structures on the space of space curves. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2407.19908\">10.48550/arXiv.2407.19908</a>","ista":"Bauer M, Ishida S, Michor PW. Symplectic structures on the space of space curves. arXiv, <a href=\"https://doi.org/10.48550/arXiv.2407.19908\">10.48550/arXiv.2407.19908</a>.","ieee":"M. Bauer, S. Ishida, and P. W. Michor, “Symplectic structures on the space of space curves,” <i>arXiv</i>. .","short":"M. Bauer, S. Ishida, P.W. Michor, ArXiv (n.d.).","chicago":"Bauer, Martin, Sadashige Ishida, and Peter W. Michor. “Symplectic Structures on the Space of Space Curves.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2407.19908\">https://doi.org/10.48550/arXiv.2407.19908</a>.","apa":"Bauer, M., Ishida, S., &#38; Michor, P. W. (n.d.). Symplectic structures on the space of space curves. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2407.19908\">https://doi.org/10.48550/arXiv.2407.19908</a>"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","supplementarymaterial":"no","date_updated":"2026-10-02T11:16:46Z","_id":"17361","title":"Symplectic structures on the space of space curves","status":"public","date_created":"2024-08-01T06:34:08Z","author":[{"full_name":"Bauer, Martin","last_name":"Bauer","first_name":"Martin"},{"id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425","first_name":"Sadashige","last_name":"Ishida","full_name":"Ishida, Sadashige","orcid":"0000-0002-3121-3100"},{"first_name":"Peter W.","last_name":"Michor","full_name":"Michor, Peter W."}],"oa_version":"Preprint","type":"preprint","abstract":[{"lang":"eng","text":"We present symplectic structures on the shape space of unparameterized space curves that generalize the classical Marsden-Weinstein structure. Our method integrates the Liouville 1-form of the Marsden-Weinstein structure with Riemannian structures that have been introduced in mathematical shape analysis. We also derive Hamiltonian vector fields for several classical Hamiltonian functions with respect to these new symplectic structures."}],"OA_place":"repository","language":[{"iso":"eng"}],"publication":"arXiv","acknowledgement":"The authors are grateful to Boris Khesin for valuable comments on the MW symplectic structure and S. Ishida thanks Albert Chern for insightful discussions on space curves and Chris Wojtan for his continuous support. M. Bauer was partially supported by NSF grant DMS-1953244 and by the Binational Science Foundation (BSF). S. Ishida was partially supported by ERC Consolidator Grant 101045083 “CoDiNA” funded by the European Research Council. Some figures were generated by the software Houdini and its education license was provided by SideFX.","date_published":"2024-07-29T00:00:00Z","keyword":["space of space curves","symplectic stuctures"],"article_processing_charge":"No","fulldoi":"https://doi.org/10.48550/arXiv.2407.19908","das_tickbox":"0","arxiv":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2407.19908","open_access":"1"}],"year":"2024","publication_status":"draft","researchdata_availability":"no","doi":"10.48550/arXiv.2407.19908","day":"29","oa":1,"external_id":{"arxiv":["2407.19908"]},"department":[{"_id":"GradSch"},{"_id":"ChWo"}],"month":"07"},{"year":"2024","quality_controlled":"1","publication_status":"published","intvolume":"        43","tmp":{"image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","short":"CC BY-NC-SA (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode"},"ddc":["004"],"fulldoi":"https://doi.org/10.1145/3658223","das_tickbox":"0","date_published":"2024-07-01T00:00:00Z","file_date_updated":"2025-11-11T09:50:52Z","has_accepted_license":"1","keyword":["surface tracking","topology change","non- manifold meshes","multi-material flows","solid modeling"],"article_processing_charge":"Yes (via OA deal)","external_id":{"isi":["001289270900021"]},"department":[{"_id":"GradSch"},{"_id":"ChWo"}],"month":"07","publisher":"Association for Computing Machinery","day":"01","oa":1,"corr_author":"1","volume":43,"file":[{"relation":"main_file","creator":"dernst","access_level":"open_access","date_created":"2024-07-23T06:35:15Z","checksum":"1917067d4b52d7729019b03560004e43","success":1,"file_size":48763368,"date_updated":"2024-07-23T06:35:15Z","content_type":"application/pdf","file_name":"2024_ACMToG_HeissSynak.pdf","file_id":"17317"},{"access_level":"open_access","relation":"main_file","creator":"akalinov","success":1,"date_created":"2024-07-10T12:23:44Z","checksum":"a4f0e293184bfa034c0c585848806b17","content_type":"video/mp4","date_updated":"2024-07-10T12:23:44Z","file_name":"sdtopofixer_final.mp4","file_size":48021463,"file_id":"17221"},{"file_id":"20633","file_name":"SuperDuperTopoFixer.pdf","date_updated":"2025-11-11T09:50:52Z","content_type":"application/pdf","file_size":48639581,"title":"Authors' version of the text","date_created":"2025-11-11T09:50:52Z","checksum":"18fc310a78ec91651148c45a8b89fa44","access_level":"open_access","creator":"akalinov","relation":"preprint"}],"doi":"10.1145/3658223","researchdata_availability":"no","article_number":"54","isi":1,"article_type":"original","type":"journal_article","oa_version":"Published Version","abstract":[{"text":"We introduce a multi-material non-manifold mesh-based surface tracking algorithm that converts self-intersections into topological changes. Our algorithm generalizes prior work on manifold surface tracking with topological changes: it preserves surface features like mesh-based methods, and it robustly handles topological changes like level set methods. Our method also offers improved efficiency and robustness over the state of the art. We demonstrate the effectiveness of the approach on a range of examples, including complex soap film simulations with thousands of interacting bubbles, and boolean unions of non-manifold meshes consisting of millions of triangles.","lang":"eng"}],"_id":"17219","title":"Multi-material mesh-based surface tracking with implicit topology changes","date_created":"2024-07-10T12:24:00Z","status":"public","author":[{"last_name":"Synak","first_name":"Peter","id":"331776E2-F248-11E8-B48F-1D18A9856A87","full_name":"Synak, Peter"},{"full_name":"Kalinov, Aleksei","orcid":"0000-0003-2189-3904","id":"44b7120e-eb97-11eb-a6c2-e1557aa81d02","first_name":"Aleksei","last_name":"Kalinov"},{"full_name":"Strugaru, Irina-Malina","id":"2afc607f-f128-11eb-9611-8f2a0dfcf074","last_name":"Strugaru","first_name":"Irina-Malina"},{"full_name":"Etemadihaghighi, Arian","id":"36cea3aa-f38e-11ec-8ae0-c65ae6f6098f","first_name":"Arian","last_name":"Etemadihaghighi"},{"full_name":"Yang, Huidong","first_name":"Huidong","last_name":"Yang"},{"orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","last_name":"Wojtan","first_name":"Christopher J"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2026-10-02T11:19:25Z","supplementarymaterial":"no","related_material":{"record":[{"relation":"dissertation_contains","id":"19630","status":"public"},{"relation":"dissertation_contains","id":"18301","status":"public"}]},"project":[{"grant_number":"101045083","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena"}],"citation":{"ama":"Synak P, Kalinov A, Strugaru I-M, Etemadi A, Yang H, Wojtan C. Multi-material mesh-based surface tracking with implicit topology changes. <i>ACM Transactions on Graphics</i>. 2024;43(4). doi:<a href=\"https://doi.org/10.1145/3658223\">10.1145/3658223</a>","mla":"Synak, Peter, et al. “Multi-Material Mesh-Based Surface Tracking with Implicit Topology Changes.” <i>ACM Transactions on Graphics</i>, vol. 43, no. 4, 54, Association for Computing Machinery, 2024, doi:<a href=\"https://doi.org/10.1145/3658223\">10.1145/3658223</a>.","ista":"Synak P, Kalinov A, Strugaru I-M, Etemadi A, Yang H, Wojtan C. 2024. Multi-material mesh-based surface tracking with implicit topology changes. ACM Transactions on Graphics. 43(4), 54.","short":"P. Synak, A. Kalinov, I.-M. Strugaru, A. Etemadi, H. Yang, C. Wojtan, ACM Transactions on Graphics 43 (2024).","ieee":"P. Synak, A. Kalinov, I.-M. Strugaru, A. Etemadi, H. Yang, and C. Wojtan, “Multi-material mesh-based surface tracking with implicit topology changes,” <i>ACM Transactions on Graphics</i>, vol. 43, no. 4. Association for Computing Machinery, 2024.","chicago":"Synak, Peter, Aleksei Kalinov, Irina-Malina Strugaru, Arian Etemadi, Huidong Yang, and Chris Wojtan. “Multi-Material Mesh-Based Surface Tracking with Implicit Topology Changes.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2024. <a href=\"https://doi.org/10.1145/3658223\">https://doi.org/10.1145/3658223</a>.","apa":"Synak, P., Kalinov, A., Strugaru, I.-M., Etemadi, A., Yang, H., &#38; Wojtan, C. (2024). Multi-material mesh-based surface tracking with implicit topology changes. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3658223\">https://doi.org/10.1145/3658223</a>"},"publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"acknowledgement":"Peter Heiss-Synak helped conceive the project, helped formulate the algorithm structure, contributed ideas and code to Sections 6 & 8, the mesh data structure, algorithm robustness and benchmarks, helped write the paper, and provided supervision and conceptual solutions throughout the project. Aleksei Kalinov contributed ideas and code to Sections 7, 8.5, and 5, the sparse grid data structure, algorithm robustness and benchmarks, optimized the performance, produced all results, most figures, and the supplementary video, helped write the text, and provided conceptual solutions throughout the project. Malina Strugaru helped implement the mesh data structure and designed re-meshing operations for non-manifold triangle meshes. Arian Etemadi developed early prototypes for ideas in Sections 8.1 and 8.3 and helped write the paper. Huidong Yang developed early prototypes for isosurface extraction and visualization. Chris Wojtan helped conceive the project, helped write the paper, and provided supervision, prototype grid data structure code, and conceptual solutions throughout the project. We thank the anonymous reviewers for their helpful comments, the members of the Visual Computing Group at ISTA for their feedback, Christopher Batty for discussions about LosTopos, and SideFX for the Houdini Education software licenses.  This research was funded in part by the European Union (ERC-2021-COG 101045083 CoDiNA).","publication":"ACM Transactions on Graphics","issue":"4","scopus_import":"1","language":[{"iso":"eng"}],"OA_type":"hybrid","OA_place":"publisher"},{"publication_identifier":{"issn":["2791-4585"]},"OA_place":"publisher","language":[{"iso":"eng"}],"title":"Filling the holes of non-manifold self-intersecting meshes for implicit topology changes in surface tracking","_id":"18301","date_created":"2024-10-11T19:52:20Z","status":"public","author":[{"id":"36cea3aa-f38e-11ec-8ae0-c65ae6f6098f","first_name":"Arian","last_name":"Etemadihaghighi","full_name":"Etemadihaghighi, Arian"}],"supervisor":[{"full_name":"Wojtan, Christopher J","orcid":"0000-0001-6646-5546","last_name":"Wojtan","first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Published Version","type":"dissertation","abstract":[{"text":"Physics simulation in computer graphics can bring triangle meshes into topologically invalid states. The method in this thesis contributed to Heiss-Synak* and Kalinov* et al. [2024] who devised a non-manifold hybrid surface tracker—a surface tracker that repairs explicit non-manifold triangle meshes with the help of the implicit domain. Specifically, this thesis provides an algorithm for filling the holes that are left after removing problematic parts of the mesh.","lang":"eng"}],"license":"https://creativecommons.org/licenses/by-sa/4.0/","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"17219"}]},"page":"39","citation":{"chicago":"Etemadi, Arian. “Filling the Holes of Non-Manifold Self-Intersecting Meshes for Implicit Topology Changes in Surface Tracking.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18301\">https://doi.org/10.15479/at:ista:18301</a>.","apa":"Etemadi, A. (2024). <i>Filling the holes of non-manifold self-intersecting meshes for implicit topology changes in surface tracking</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18301\">https://doi.org/10.15479/at:ista:18301</a>","mla":"Etemadi, Arian. <i>Filling the Holes of Non-Manifold Self-Intersecting Meshes for Implicit Topology Changes in Surface Tracking</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18301\">10.15479/at:ista:18301</a>.","ama":"Etemadi A. Filling the holes of non-manifold self-intersecting meshes for implicit topology changes in surface tracking. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18301\">10.15479/at:ista:18301</a>","ista":"Etemadi A. 2024. Filling the holes of non-manifold self-intersecting meshes for implicit topology changes in surface tracking. Institute of Science and Technology Austria.","short":"A. Etemadi, Filling the Holes of Non-Manifold Self-Intersecting Meshes for Implicit Topology Changes in Surface Tracking, Institute of Science and Technology Austria, 2024.","ieee":"A. Etemadi, “Filling the holes of non-manifold self-intersecting meshes for implicit topology changes in surface tracking,” Institute of Science and Technology Austria, 2024."},"supplementarymaterial":"no","date_updated":"2026-10-02T11:19:26Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"15","oa":1,"corr_author":"1","doi_confirm":"1","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"month":"10","researchdata_availability":"no","doi":"10.15479/at:ista:18301","file":[{"file_id":"18469","file_size":8914218,"file_name":"thesis-arian-etemadi.pdf","date_updated":"2024-10-24T14:34:42Z","content_type":"application/pdf","checksum":"80fb7923e229ad9d39253d7c8a8083d0","date_created":"2024-10-24T14:34:42Z","success":1,"creator":"aetemadi","relation":"main_file","access_level":"open_access"},{"access_level":"closed","relation":"source_file","creator":"aetemadi","checksum":"1c02586ed7d441d5ec441867650568d1","date_created":"2024-10-24T14:34:54Z","file_name":"thesis-arian-etemadi-latex-source.zip","date_updated":"2024-10-24T14:34:54Z","content_type":"application/x-zip-compressed","file_size":9802650,"file_id":"18470"}],"ddc":["000"],"tmp":{"image":"/images/cc_by_sa.png","short":"CC BY-SA (4.0)","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode"},"publication_status":"published","year":"2024","has_accepted_license":"1","file_date_updated":"2024-10-24T14:34:54Z","alternative_title":["ISTA Master's Thesis"],"date_published":"2024-10-15T00:00:00Z","article_processing_charge":"No","keyword":["surface tracking","non-manifold","hole-filling","topology change","multi-material","solid-modeling"],"degree_awarded":"MS","das_tickbox":"0","fulldoi":"https://doi.org/10.15479/at:ista:18301"},{"department":[{"_id":"GradSch"},{"_id":"ChWo"}],"month":"09","publisher":"Society for Industrial and Applied Mathematics","external_id":{"isi":["001342265800009"],"arxiv":["2303.14555"]},"corr_author":"1","oa":1,"day":"23","doi":"10.1137/23M1565255","researchdata_availability":"no","volume":8,"isi":1,"intvolume":"         8","year":"2024","quality_controlled":"1","publication_status":"published","ddc":["516"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"arxiv":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2303.14555"}],"fulldoi":"https://doi.org/10.1137/23M1565255","das_tickbox":"0","article_processing_charge":"No","date_published":"2024-09-23T00:00:00Z","has_accepted_license":"1","publication_identifier":{"eissn":["2470-6566"]},"acknowledgement":"This work was funded by European Research Council Consolidator grant 101045083 CoDiNA and National Science Foundation CAREER award 2239062. Some figures in the article were generated by the software Houdini and its education license was provided by SideFX. The authors acknowledge anonymous referees for their reviews and insightful suggestions, and Chris Wojtan for his continuous support through discussions. The second author thanks Anna Sisak for a fruitful discussion on prequantum bundles.","issue":"3","scopus_import":"1","publication":"SIAM Journal on Applied Algebra and Geometry","language":[{"iso":"eng"}],"OA_place":"repository","OA_type":"green","abstract":[{"text":"We present a formula for the signed area of a spherical polygon via prequantization. In contrast to the traditional formula based on the Gauss-Bonnet theorem that requires measuring angles, the new formula mimics Green's theorem and is applicable to a wider range of degenerate spherical curves and polygons.","lang":"eng"}],"article_type":"original","oa_version":"Preprint","type":"journal_article","status":"public","date_created":"2023-04-18T19:16:06Z","author":[{"first_name":"Albert","last_name":"Chern","full_name":"Chern, Albert"},{"orcid":"0000-0002-3121-3100","full_name":"Ishida, Sadashige","id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425","last_name":"Ishida","first_name":"Sadashige"}],"_id":"12846","title":"Area formula for spherical polygons via prequantization","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2026-10-02T11:17:04Z","supplementarymaterial":"no","project":[{"name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","grant_number":"101045083"}],"page":"782-796","citation":{"short":"A. Chern, S. Ishida, SIAM Journal on Applied Algebra and Geometry 8 (2024) 782–796.","ista":"Chern A, Ishida S. 2024. Area formula for spherical polygons via prequantization. SIAM Journal on Applied Algebra and Geometry. 8(3), 782–796.","ieee":"A. Chern and S. Ishida, “Area formula for spherical polygons via prequantization,” <i>SIAM Journal on Applied Algebra and Geometry</i>, vol. 8, no. 3. Society for Industrial and Applied Mathematics, pp. 782–796, 2024.","mla":"Chern, Albert, and Sadashige Ishida. “Area Formula for Spherical Polygons via Prequantization.” <i>SIAM Journal on Applied Algebra and Geometry</i>, vol. 8, no. 3, Society for Industrial and Applied Mathematics, 2024, pp. 782–96, doi:<a href=\"https://doi.org/10.1137/23M1565255\">10.1137/23M1565255</a>.","ama":"Chern A, Ishida S. Area formula for spherical polygons via prequantization. <i>SIAM Journal on Applied Algebra and Geometry</i>. 2024;8(3):782-796. doi:<a href=\"https://doi.org/10.1137/23M1565255\">10.1137/23M1565255</a>","apa":"Chern, A., &#38; Ishida, S. (2024). Area formula for spherical polygons via prequantization. <i>SIAM Journal on Applied Algebra and Geometry</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/23M1565255\">https://doi.org/10.1137/23M1565255</a>","chicago":"Chern, Albert, and Sadashige Ishida. “Area Formula for Spherical Polygons via Prequantization.” <i>SIAM Journal on Applied Algebra and Geometry</i>. Society for Industrial and Applied Mathematics, 2024. <a href=\"https://doi.org/10.1137/23M1565255\">https://doi.org/10.1137/23M1565255</a>."},"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"20551"}]}},{"doi":"10.15479/at:ista:17485","researchdata_availability":"no","file":[{"file_size":1615167,"date_updated":"2024-09-05T12:04:11Z","content_type":"application/zip","file_name":"thesis-final.zip","file_id":"17570","creator":"efrantar","relation":"source_file","access_level":"closed","date_created":"2024-09-05T12:04:11Z","checksum":"5d785645805a78c5b4ce7cc3df557b09"},{"date_created":"2024-09-06T16:24:59Z","checksum":"a9dd1c2d23734986924eb44ebb55fd8f","success":1,"creator":"efrantar","relation":"main_file","access_level":"open_access","file_id":"17880","file_size":2376611,"file_name":"frantar_thesis_final.pdf","content_type":"application/pdf","date_updated":"2024-09-06T16:24:59Z"}],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"DaAl"}],"month":"09","doi_confirm":"1","corr_author":"1","oa":1,"day":"05","acknowledged_ssus":[{"_id":"ScienComp"}],"das_tickbox":"0","degree_awarded":"PhD","fulldoi":"https://doi.org/10.15479/at:ista:17485","article_processing_charge":"No","has_accepted_license":"1","date_published":"2024-09-05T00:00:00Z","file_date_updated":"2024-09-06T16:24:59Z","alternative_title":["ISTA Thesis"],"publication_status":"published","year":"2024","ddc":["000"],"language":[{"iso":"eng"}],"OA_place":"publisher","publication_identifier":{"issn":["2663-337X"]},"ec_funded":1,"date_updated":"2026-10-02T11:19:46Z","supplementarymaterial":"no","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"129","citation":{"chicago":"Frantar, Elias. “Compressing Large Neural Networks: Algorithms, Systems and Scaling Laws.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:17485\">https://doi.org/10.15479/at:ista:17485</a>.","apa":"Frantar, E. (2024). <i>Compressing large neural networks: Algorithms, systems and scaling laws</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:17485\">https://doi.org/10.15479/at:ista:17485</a>","mla":"Frantar, Elias. <i>Compressing Large Neural Networks: Algorithms, Systems and Scaling Laws</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:17485\">10.15479/at:ista:17485</a>.","ama":"Frantar E. Compressing large neural networks: Algorithms, systems and scaling laws. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:17485\">10.15479/at:ista:17485</a>","short":"E. Frantar, Compressing Large Neural Networks: Algorithms, Systems and Scaling Laws, Institute of Science and Technology Austria, 2024.","ista":"Frantar E. 2024. Compressing large neural networks: Algorithms, systems and scaling laws. Institute of Science and Technology Austria.","ieee":"E. Frantar, “Compressing large neural networks: Algorithms, systems and scaling laws,” Institute of Science and Technology Austria, 2024."},"project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223"}],"related_material":{"record":[{"id":"17378","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"17087","status":"public"},{"id":"14458","relation":"part_of_dissertation","status":"public"},{"id":"18061","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"18062"}]},"abstract":[{"lang":"eng","text":"Large language models (LLMs) have made tremendous progress in the past few years, from being able to generate coherent text to matching or surpassing humans in a wide variety of creative, knowledge or reasoning tasks. Much of this can be attributed to massively increased scale, both in the size of the model as well as the amount of training data, from 100s of millions to 100s of billions, or even trillions. This trend is expected to continue, which, although exciting, also raises major practical concerns. Already today's 100+ billion parameter LLMs require top-of-the-line hardware just to run. Hence, it is clear that sustaining these developments will require significant efficiency advances.\r\n\r\nHistorically, one of the most practical ways of improving model efficiency has been compression, especially in the form of sparsity or quantization. While this has been studied extensively in the past, existing accurate methods are all designed for models around 100 million parameters; scaling them up to ones literally 1000x larger is highly challenging. In this thesis, we introduce a new unified sparsification and quantization approach OBC, which through additional algorithmic enhancements leads to GPTQ and SparseGPT, the first techniques fast and accurate enough to compress 100+ billion parameter models to 4- or even 3-bit precision and 50% weight-sparsity, respectively. Additionally, we show how weight-only quantizion does not just bring space savings but also up to 4.5x faster generation speed, via custom GPU kernels.\r\n\r\nIn fact, we show for the first time that it is possible to develop an FP16 times INT4 mixed-precision matrix multiplication kernel, called Marlin, which comes close to simultaneously maximizing both memory and compute utilization, making weight-only quantization highly practical even for multi-user serving. Further, we demonstrate that GPTQ can be scaled to widely overparametrized trillion-parameter models, where extreme sub-1-bit compression rates can be achieved without any inference slow-down, by co-designing a bespoke entropy coding scheme together with an efficient kernel.\r\n\r\nFinally, we also study compression from the perspective of someone with access to massive amounts of compute resources for training large models completely from scratch. Here the key questions evolve around the joint scaling behavior between compression, model size, and amount of training data used. Based on extensive experimental results for both vision and text models, we introduce the first scaling law which accurately captures the relationship between weight-sparsity, number of non-zero weights and data. This further allows us to characterize the optimal sparsity, which we find to increase the longer a fixed cost model is being trained.\r\n\r\nOverall, this thesis presents contributions to three different angles of large model efficiency: affordable but accurate algorithms, highly efficient systems implementations, and fundamental scaling laws for compressed training."}],"type":"dissertation","oa_version":"Published Version","supervisor":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"}],"status":"public","author":[{"id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f","first_name":"Elias","last_name":"Frantar","full_name":"Frantar, Elias"}],"date_created":"2024-09-02T11:01:48Z","title":"Compressing large neural networks: Algorithms, systems and scaling laws","_id":"17485"},{"month":"01","department":[{"_id":"DaAl"}],"external_id":{"arxiv":["2309.08520"]},"oa":1,"corr_author":"1","day":"16","researchdata_availability":"no","publication_status":"published","year":"2024","quality_controlled":"1","ddc":["000"],"main_file_link":[{"open_access":"1","url":"https://openreview.net/forum?id=i9K2ZWkYIP"}],"arxiv":1,"das_tickbox":"0","article_processing_charge":"No","conference":{"end_date":"2024-05-07","start_date":"2024-05-07","name":"ICLR: International Conference on Learning Representations","location":"Vienna, Austria"},"date_published":"2024-01-16T00:00:00Z","scopus_import":"1","publication":"The Twelfth International Conference on Learning Representations","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We explore the impact of parameter sparsity on the scaling behavior of Transformers trained on massive datasets (i.e., \"foundation models\"), in both vision and language domains. In this setting, we identify the first scaling law describing the relationship between weight sparsity, number of non-zero parameters, and amount of training data, which we validate empirically across model and data scales; on ViT/JFT-4B and T5/C4. These results allow us to characterize the \"optimal sparsity\", the sparsity level which yields the best performance for a given effective model size and training budget. For a fixed number of non-zero parameters, we identify that the optimal sparsity increases with the amount of data used for training. We also extend our study to different sparsity structures (such as the hardware-friendly n:m pattern) and strategies (such as starting from a pretrained dense model). Our findings shed light on the power and limitations of weight sparsity across various parameter and computational settings, offering both theoretical understanding and practical implications for leveraging sparsity towards computational efficiency improvements. We provide pruning and scaling law fitting code at: github.com/google-research/jaxpruner/tree/main/jaxpruner/projects/bigsparse."}],"type":"conference","oa_version":"Published Version","date_created":"2024-09-13T10:31:08Z","status":"public","author":[{"last_name":"Frantar","first_name":"Elias","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f","full_name":"Frantar, Elias"},{"full_name":"Ruiz, Carlos Riquelme","first_name":"Carlos Riquelme","last_name":"Ruiz"},{"full_name":"Houlsby, Neil","first_name":"Neil","last_name":"Houlsby"},{"orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh"},{"full_name":"Evci, Utku","last_name":"Evci","first_name":"Utku"}],"title":"Scaling laws for sparsely-connected foundation models","_id":"18062","date_updated":"2026-10-02T11:19:46Z","supplementarymaterial":"no","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"apa":"Frantar, E., Ruiz, C. R., Houlsby, N., Alistarh, D.-A., &#38; Evci, U. (2024). Scaling laws for sparsely-connected foundation models. In <i>The Twelfth International Conference on Learning Representations</i>. Vienna, Austria.","chicago":"Frantar, Elias, Carlos Riquelme Ruiz, Neil Houlsby, Dan-Adrian Alistarh, and Utku Evci. “Scaling Laws for Sparsely-Connected Foundation Models.” In <i>The Twelfth International Conference on Learning Representations</i>, 2024.","ieee":"E. Frantar, C. R. Ruiz, N. Houlsby, D.-A. Alistarh, and U. Evci, “Scaling laws for sparsely-connected foundation models,” in <i>The Twelfth International Conference on Learning Representations</i>, Vienna, Austria, 2024.","ista":"Frantar E, Ruiz CR, Houlsby N, Alistarh D-A, Evci U. 2024. Scaling laws for sparsely-connected foundation models. The Twelfth International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","short":"E. Frantar, C.R. Ruiz, N. Houlsby, D.-A. Alistarh, U. Evci, in:, The Twelfth International Conference on Learning Representations, 2024.","ama":"Frantar E, Ruiz CR, Houlsby N, Alistarh D-A, Evci U. Scaling laws for sparsely-connected foundation models. In: <i>The Twelfth International Conference on Learning Representations</i>. ; 2024.","mla":"Frantar, Elias, et al. “Scaling Laws for Sparsely-Connected Foundation Models.” <i>The Twelfth International Conference on Learning Representations</i>, 2024."},"related_material":{"record":[{"status":"public","id":"17485","relation":"dissertation_contains"}]}}]