[{"_id":"17139","file":[{"access_level":"open_access","date_updated":"2024-06-17T09:36:51Z","relation":"main_file","file_name":"2024_ASHPC_Schloegl.pdf","checksum":"f7d3dded6df2dcdb4818904cf2e1c183","creator":"dernst","file_size":206746,"success":1,"date_created":"2024-06-17T09:36:51Z","content_type":"application/pdf","file_id":"17153"}],"month":"06","department":[{"_id":"ScienComp"}],"publication":"ASHPC24 - Austrian-Slovenian HPC Meeting 2024","date_updated":"2024-06-17T09:40:37Z","oa":1,"doi":"10.25365/phaidra.463","has_accepted_license":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_identifier":{"isbn":["9783200096455"]},"file_date_updated":"2024-06-17T09:36:51Z","citation":{"chicago":"Schlögl, Alois, Waleed Khalid, Stefano Elefante, and Stephan Stadlbauer. “How Much Memory per CPU Core Is Requested?” In ASHPC24 - Austrian-Slovenian HPC Meeting 2024, 46. EuroCC Austria, 2024. https://doi.org/10.25365/phaidra.463.","apa":"Schlögl, A., Khalid, W., Elefante, S., & Stadlbauer, S. (2024). How much memory per CPU core is requested? In ASHPC24 - Austrian-Slovenian HPC Meeting 2024 (p. 46). Grundlsee, Austria: EuroCC Austria. https://doi.org/10.25365/phaidra.463","ista":"Schlögl A, Khalid W, Elefante S, Stadlbauer S. 2024. How much memory per CPU core is requested? ASHPC24 - Austrian-Slovenian HPC Meeting 2024. ASHPC: Austrian-Slovenian HPC Meeting, 46.","mla":"Schlögl, Alois, et al. “How Much Memory per CPU Core Is Requested?” ASHPC24 - Austrian-Slovenian HPC Meeting 2024, EuroCC Austria, 2024, p. 46, doi:10.25365/phaidra.463.","ieee":"A. Schlögl, W. Khalid, S. Elefante, and S. Stadlbauer, “How much memory per CPU core is requested?,” in ASHPC24 - Austrian-Slovenian HPC Meeting 2024, Grundlsee, Austria, 2024, p. 46.","short":"A. Schlögl, W. Khalid, S. Elefante, S. Stadlbauer, in:, ASHPC24 - Austrian-Slovenian HPC Meeting 2024, EuroCC Austria, 2024, p. 46.","ama":"Schlögl A, Khalid W, Elefante S, Stadlbauer S. How much memory per CPU core is requested? In: ASHPC24 - Austrian-Slovenian HPC Meeting 2024. EuroCC Austria; 2024:46. doi:10.25365/phaidra.463"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"name":"ASHPC: Austrian-Slovenian HPC Meeting","end_date":"2024-06-13","start_date":"2024-06-10","location":"Grundlsee, Austria"},"quality_controlled":"1","type":"conference_abstract","day":"13","page":"46","ddc":["000"],"language":[{"iso":"eng"}],"date_published":"2024-06-13T00:00:00Z","publication_status":"published","publisher":"EuroCC Austria","date_created":"2024-06-14T09:06:36Z","status":"public","year":"2024","author":[{"id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","last_name":"Schlögl","full_name":"Schlögl, Alois","first_name":"Alois","orcid":"0000-0002-5621-8100"},{"first_name":"Waleed","full_name":"Khalid, Waleed","id":"097c0562-3cf0-11ee-8fd3-e7a79c1e2fd1","last_name":"Khalid"},{"first_name":"Stefano","full_name":"Elefante, Stefano","last_name":"Elefante","id":"490F40CE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Stadlbauer","id":"4D0BC184-F248-11E8-B48F-1D18A9856A87","first_name":"Stephan","full_name":"Stadlbauer, Stephan"}],"oa_version":"Published Version","article_processing_charge":"No","title":"How much memory per CPU core is requested?"},{"external_id":{"isi":["001270051200001"],"pmid":["38794966"]},"date_updated":"2025-09-08T07:57:50Z","oa":1,"month":"09","article_type":"original","abstract":[{"lang":"eng","text":"The TIR1/AFB–Aux/IAA–ARF canonical auxin signaling pathway is widely accepted to (de)active transcriptional regulation, thus controlling auxin-associated developmental processes. However, the theme of a rapid auxin response has emerged since the 2018 Auxins and Cytokinin in Plant Development conference. To date, a few signaling components have been identified to mediate both slow and rapid auxin responses, which unveils the complexity of auxin signaling."}],"_id":"17141","intvolume":" 75","file":[{"checksum":"91b9435ed0f6640809c7588df19abf2f","creator":"dernst","content_type":"application/pdf","file_size":763097,"success":1,"date_created":"2025-01-02T10:26:22Z","file_id":"18720","date_updated":"2025-01-02T10:26:22Z","access_level":"open_access","relation":"main_file","file_name":"2024_JourExperimentalBotany_Zhang.pdf"}],"department":[{"_id":"GradSch"},{"_id":"JiFr"}],"publication":"Journal of Experimental Botany","volume":75,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","file_date_updated":"2025-01-02T10:26:22Z","citation":{"chicago":"Zhang, Zilin, Huihuang Chen, Shuaiying Peng, and Huibin Han. “Slow and Rapid Auxin Responses in Arabidopsis.” Journal of Experimental Botany. Oxford University Press, 2024. https://doi.org/10.1093/jxb/erae246.","mla":"Zhang, Zilin, et al. “Slow and Rapid Auxin Responses in Arabidopsis.” Journal of Experimental Botany, vol. 75, no. 18, erae246, Oxford University Press, 2024, doi:10.1093/jxb/erae246.","ista":"Zhang Z, Chen H, Peng S, Han H. 2024. Slow and rapid auxin responses in Arabidopsis. Journal of Experimental Botany. 75(18), erae246.","apa":"Zhang, Z., Chen, H., Peng, S., & Han, H. (2024). Slow and rapid auxin responses in Arabidopsis. Journal of Experimental Botany. Oxford University Press. https://doi.org/10.1093/jxb/erae246","ieee":"Z. Zhang, H. Chen, S. Peng, and H. Han, “Slow and rapid auxin responses in Arabidopsis,” Journal of Experimental Botany, vol. 75, no. 18. Oxford University Press, 2024.","short":"Z. Zhang, H. Chen, S. Peng, H. Han, Journal of Experimental Botany 75 (2024).","ama":"Zhang Z, Chen H, Peng S, Han H. Slow and rapid auxin responses in Arabidopsis. Journal of Experimental Botany. 2024;75(18). doi:10.1093/jxb/erae246"},"article_number":"erae246","quality_controlled":"1","OA_type":"hybrid","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"doi":"10.1093/jxb/erae246","has_accepted_license":"1","publication_identifier":{"issn":["0022-0957"]},"date_published":"2024-09-27T00:00:00Z","issue":"18","type":"journal_article","ddc":["580"],"day":"27","scopus_import":"1","language":[{"iso":"eng"}],"isi":1,"OA_place":"publisher","year":"2024","author":[{"last_name":"Zhang","full_name":"Zhang, Zilin","first_name":"Zilin"},{"first_name":"Huihuang","full_name":"Chen, Huihuang","last_name":"Chen","id":"83c96512-15b2-11ec-abd3-b7eede36184f"},{"last_name":"Peng","full_name":"Peng, Shuaiying","first_name":"Shuaiying"},{"full_name":"Han, Huibin","first_name":"Huibin","last_name":"Han"}],"oa_version":"Published Version","title":"Slow and rapid auxin responses in Arabidopsis","article_processing_charge":"No","pmid":1,"publisher":"Oxford University Press","publication_status":"published","status":"public","date_created":"2024-06-15T19:50:15Z","acknowledgement":"We thank other lab members for their critical comments on this manuscript. We also thank the editor and reviewers for their constructive comments to improve our manuscript. We apologize to authors whose important work we could not include due to space limitations.\r\nThis work is supported by funding from Jiangxi Agricultural University (9232308314) and the Science and Technology Department of Jiangxi Province (20223BCJ25037) to HBH, and the Science and Technology Department of Jiangxi Province (20202ACB215002) to SYP."},{"publication":"PLoS Biology","department":[{"_id":"RySh"},{"_id":"GaNo"},{"_id":"MaJö"}],"DOAJ_listed":"1","volume":22,"article_type":"original","month":"06","file":[{"file_size":4016568,"date_created":"2025-01-09T10:39:41Z","success":1,"content_type":"application/pdf","file_id":"18805","checksum":"496e1aa4fd5b92b7e4087ecc2c964133","creator":"dernst","file_name":"2024_PloS_Burnett.pdf","access_level":"open_access","date_updated":"2025-01-09T10:39:41Z","relation":"main_file"}],"intvolume":" 22","_id":"17142","abstract":[{"text":"Despite the diverse genetic origins of autism spectrum disorders (ASDs), affected individuals share strikingly similar and correlated behavioural traits that include perceptual and sensory processing challenges. Notably, the severity of these sensory symptoms is often predictive of the expression of other autistic traits. However, the origin of these perceptual deficits remains largely elusive. Here, we show a recurrent impairment in visual threat perception that is similarly impaired in 3 independent mouse models of ASD with different molecular aetiologies. Interestingly, this deficit is associated with reduced avoidance of threatening environments—a nonperceptual trait. Focusing on a common cause of ASDs, the Setd5 gene mutation, we define the molecular mechanism. We show that the perceptual impairment is caused by a potassium channel (Kv1)-mediated hypoexcitability in a subcortical node essential for the initiation of escape responses, the dorsal periaqueductal grey (dPAG). Targeted pharmacological Kv1 blockade rescued both perceptual and place avoidance deficits, causally linking seemingly unrelated trait deficits to the dPAG. Furthermore, we show that different molecular mechanisms converge on similar behavioural phenotypes by demonstrating that the autism models Cul3 and Ptchd1, despite having similar behavioural phenotypes, differ in their functional and molecular alteration. Our findings reveal a link between rapid perception controlled by subcortical pathways and appropriate learned interactions with the environment and define a nondevelopmental source of such deficits in ASD.","lang":"eng"}],"oa":1,"corr_author":"1","related_material":{"record":[{"status":"public","relation":"research_data","id":"15385"}],"link":[{"relation":"software","url":"https://doi.org/10.5281/zenodo.11130587"}]},"date_updated":"2025-09-08T07:57:11Z","external_id":{"pmid":["38857283"],"isi":["001246176800003"]},"publication_identifier":{"eissn":["1545-7885"],"issn":["1544-9173"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"has_accepted_license":"1","doi":"10.1371/journal.pbio.3002668","quality_controlled":"1","OA_type":"gold","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_number":"e3002668","file_date_updated":"2025-01-09T10:39:41Z","citation":{"mla":"Burnett, Laura, et al. “Shared Behavioural Impairments in Visual Perception and Place Avoidance across Different Autism Models Are Driven by Periaqueductal Grey Hypoexcitability in Setd5 Haploinsufficient Mice.” PLoS Biology, vol. 22, e3002668, Public Library of Science, 2024, doi:10.1371/journal.pbio.3002668.","ista":"Burnett L, Koppensteiner P, Symonova O, Masson T, Vega Zuniga TA, Contreras X, Rülicke T, Shigemoto R, Novarino G, Jösch MA. 2024. Shared behavioural impairments in visual perception and place avoidance across different autism models are driven by periaqueductal grey hypoexcitability in Setd5 haploinsufficient mice. PLoS Biology. 22, e3002668.","apa":"Burnett, L., Koppensteiner, P., Symonova, O., Masson, T., Vega Zuniga, T. A., Contreras, X., … Jösch, M. A. (2024). Shared behavioural impairments in visual perception and place avoidance across different autism models are driven by periaqueductal grey hypoexcitability in Setd5 haploinsufficient mice. PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.3002668","chicago":"Burnett, Laura, Peter Koppensteiner, Olga Symonova, Tomas Masson, Tomas A Vega Zuniga, Ximena Contreras, Thomas Rülicke, Ryuichi Shigemoto, Gaia Novarino, and Maximilian A Jösch. “Shared Behavioural Impairments in Visual Perception and Place Avoidance across Different Autism Models Are Driven by Periaqueductal Grey Hypoexcitability in Setd5 Haploinsufficient Mice.” PLoS Biology. Public Library of Science, 2024. https://doi.org/10.1371/journal.pbio.3002668.","ieee":"L. Burnett et al., “Shared behavioural impairments in visual perception and place avoidance across different autism models are driven by periaqueductal grey hypoexcitability in Setd5 haploinsufficient mice,” PLoS Biology, vol. 22. Public Library of Science, 2024.","short":"L. Burnett, P. Koppensteiner, O. Symonova, T. Masson, T.A. Vega Zuniga, X. Contreras, T. Rülicke, R. Shigemoto, G. Novarino, M.A. Jösch, PLoS Biology 22 (2024).","ama":"Burnett L, Koppensteiner P, Symonova O, et al. Shared behavioural impairments in visual perception and place avoidance across different autism models are driven by periaqueductal grey hypoexcitability in Setd5 haploinsufficient mice. PLoS Biology. 2024;22. doi:10.1371/journal.pbio.3002668"},"scopus_import":"1","isi":1,"language":[{"iso":"eng"}],"ddc":["570"],"day":"10","type":"journal_article","APC_amount":"6081,83 EUR","date_published":"2024-06-10T00:00:00Z","project":[{"call_identifier":"H2020","_id":"2634E9D2-B435-11E9-9278-68D0E5697425","grant_number":"756502","name":"Circuits of Visual Attention"}],"acknowledgement":"This work was supported by a European Research Council Starting Grant 756502 (MJ). ","status":"public","date_created":"2024-06-16T22:01:05Z","publisher":"Public Library of Science","publication_status":"published","article_processing_charge":"Yes","title":"Shared behavioural impairments in visual perception and place avoidance across different autism models are driven by periaqueductal grey hypoexcitability in Setd5 haploinsufficient mice","ec_funded":1,"oa_version":"Published Version","pmid":1,"OA_place":"publisher","author":[{"full_name":"Burnett, Laura","first_name":"Laura","id":"3B717F68-F248-11E8-B48F-1D18A9856A87","last_name":"Burnett","orcid":"0000-0002-8937-410X"},{"first_name":"Peter","full_name":"Koppensteiner, Peter","id":"3B8B25A8-F248-11E8-B48F-1D18A9856A87","last_name":"Koppensteiner","orcid":"0000-0002-3509-1948"},{"orcid":"0000-0003-2012-9947","full_name":"Symonova, Olga","first_name":"Olga","last_name":"Symonova","id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-2634-6283","last_name":"Masson","id":"93ac43e8-8599-11eb-9b86-f6efb0a4c207","first_name":"Tomas","full_name":"Masson, Tomas"},{"first_name":"Tomas A","full_name":"Vega Zuniga, Tomas A","last_name":"Vega Zuniga","id":"2E7C4E78-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ximena","full_name":"Contreras, Ximena","last_name":"Contreras","id":"475990FE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rülicke","full_name":"Rülicke, Thomas","first_name":"Thomas"},{"full_name":"Shigemoto, Ryuichi","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","last_name":"Shigemoto","orcid":"0000-0001-8761-9444"},{"orcid":"0000-0002-7673-7178","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","last_name":"Novarino","first_name":"Gaia","full_name":"Novarino, Gaia"},{"orcid":"0000-0002-3937-1330","last_name":"Jösch","id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","first_name":"Maximilian A","full_name":"Jösch, Maximilian A"}],"year":"2024"},{"citation":{"short":"H. Kourimska, A. Lieutier, M. Wintraecken, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ama":"Kourimska H, Lieutier A, Wintraecken M. The medial axis of any closed bounded set Is Lipschitz stable with respect to the Hausdorff distance Under ambient diffeomorphisms. In: 40th International Symposium on Computational Geometry. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.SoCG.2024.69","chicago":"Kourimska, Hana, André Lieutier, and Mathijs Wintraecken. “The Medial Axis of Any Closed Bounded Set Is Lipschitz Stable with Respect to the Hausdorff Distance Under Ambient Diffeomorphisms.” In 40th International Symposium on Computational Geometry, Vol. 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.SoCG.2024.69.","apa":"Kourimska, H., Lieutier, A., & Wintraecken, M. (2024). The medial axis of any closed bounded set Is Lipschitz stable with respect to the Hausdorff distance Under ambient diffeomorphisms. In 40th International Symposium on Computational Geometry (Vol. 293). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2024.69","mla":"Kourimska, Hana, et al. “The Medial Axis of Any Closed Bounded Set Is Lipschitz Stable with Respect to the Hausdorff Distance Under Ambient Diffeomorphisms.” 40th International Symposium on Computational Geometry, vol. 293, 69, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.SoCG.2024.69.","ista":"Kourimska H, Lieutier A, Wintraecken M. 2024. The medial axis of any closed bounded set Is Lipschitz stable with respect to the Hausdorff distance Under ambient diffeomorphisms. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 293, 69.","ieee":"H. Kourimska, A. Lieutier, and M. Wintraecken, “The medial axis of any closed bounded set Is Lipschitz stable with respect to the Hausdorff distance Under ambient diffeomorphisms,” in 40th International Symposium on Computational Geometry, Athens, Greece, 2024, vol. 293."},"file_date_updated":"2024-06-17T08:33:40Z","article_number":"69","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Athens, Greece","end_date":"2024-06-14","name":"SoCG: Symposium on Computational Geometry"},"quality_controlled":"1","doi":"10.4230/LIPIcs.SoCG.2024.69","has_accepted_license":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_identifier":{"isbn":["9783959773164"],"issn":["1868-8969"]},"external_id":{"arxiv":["2212.01118"]},"date_updated":"2025-04-15T07:16:58Z","alternative_title":["LIPIcs"],"oa":1,"abstract":[{"text":"We prove that the medial axis of closed sets is Hausdorff stable in the following sense: Let 𝒮 ⊆ ℝ^d be a fixed closed set that contains a bounding sphere. That is, the bounding sphere is part of the set 𝒮. Consider the space of C^{1,1} diffeomorphisms of ℝ^d to itself, which keep the bounding sphere invariant. The map from this space of diffeomorphisms (endowed with a Banach norm) to the space of closed subsets of ℝ^d (endowed with the Hausdorff distance), mapping a diffeomorphism F to the closure of the medial axis of F(𝒮), is Lipschitz. This extends a previous stability result of Chazal and Soufflet on the stability of the medial axis of C² manifolds under C² ambient diffeomorphisms.","lang":"eng"}],"_id":"17144","intvolume":" 293","file":[{"file_name":"2024_LIPICS_Kourimska.pdf","access_level":"open_access","date_updated":"2024-06-17T08:33:40Z","relation":"main_file","content_type":"application/pdf","date_created":"2024-06-17T08:33:40Z","success":1,"file_size":1612558,"file_id":"17150","checksum":"b40ff456c19294adb5d9613fcfd751c6","creator":"dernst"}],"month":"06","volume":293,"department":[{"_id":"HeEd"}],"publication":"40th International Symposium on Computational Geometry","year":"2024","author":[{"orcid":"0000-0001-7841-0091","first_name":"Hana","full_name":"Kourimska, Hana","id":"D9B8E14C-3C26-11EA-98F5-1F833DDC885E","last_name":"Kourimska"},{"full_name":"Lieutier, André","first_name":"André","last_name":"Lieutier"},{"first_name":"Mathijs","full_name":"Wintraecken, Mathijs","last_name":"Wintraecken","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220"}],"arxiv":1,"oa_version":"Published Version","ec_funded":1,"article_processing_charge":"No","title":"The medial axis of any closed bounded set Is Lipschitz stable with respect to the Hausdorff distance Under ambient diffeomorphisms","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","status":"public","date_created":"2024-06-16T22:01:06Z","acknowledgement":"This research has been supported by the European Research Council (ERC), grant No. 788183, by the Wittgenstein Prize, Austrian Science Fund (FWF), grant No. Z 342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant No. I 02979-N35.\r\nSupported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411, the Austrian science fund (FWF) grant No. M-3073, and the welcome package from IDEX of the Université Cô d'Azur.\r\nWe are greatly indebted to Fred Chazal for sharing his insights. We further thank Erin Chambers, Christopher Fillmore, and Elizabeth Stephenson for early discussions and all members of the Edelsbrunner group (Institute of Science and Technology Austria) and the Datashape team (Inria) for the atmosphere in which this research was conducted.","project":[{"name":"Alpha Shape Theory Extended","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"grant_number":"Z00342","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"},{"_id":"fc390959-9c52-11eb-aca3-afa58bd282b2","name":"Learning and triangulating manifolds via collapses","grant_number":"M03073"}],"date_published":"2024-06-01T00:00:00Z","type":"conference","day":"01","ddc":["510"],"language":[{"iso":"eng"}],"scopus_import":"1"},{"date_published":"2024-06-01T00:00:00Z","scopus_import":"1","language":[{"iso":"eng"}],"type":"conference","day":"01","ddc":["510"],"oa_version":"Published Version","article_processing_charge":"No","title":"Grid peeling of parabolas","arxiv":1,"year":"2024","author":[{"first_name":"Günter","full_name":"Rote, Günter","last_name":"Rote"},{"first_name":"Moritz","full_name":"Rüber, Moritz","last_name":"Rüber"},{"last_name":"Saghafian","id":"f86f7148-b140-11ec-9577-95435b8df824","first_name":"Morteza","full_name":"Saghafian, Morteza"}],"date_created":"2024-06-16T22:01:06Z","status":"public","acknowledgement":"Part of this work was done while G.R. enjoyed the hospitality of the Institute of Science and Technology Austria (ISTA) as a visiting professor during his sabbatical in the winter semester 2022/23.","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","oa":1,"external_id":{"arxiv":["2402.15787"]},"alternative_title":["LIPIcs"],"date_updated":"2024-06-17T08:41:56Z","department":[{"_id":"HeEd"}],"publication":"40th International Symposium on Computational Geometry","volume":293,"month":"06","abstract":[{"text":"Grid peeling is the process of repeatedly removing the convex hull vertices of the grid points that lie inside a given convex curve. It has been conjectured that, for a more and more refined grid, grid peeling converges to a continuous process, the affine curve-shortening flow, which deforms the curve based on the curvature. We prove this conjecture for one class of curves, parabolas with a vertical axis, and we determine the value of the constant factor in the formula that relates the two processes.","lang":"eng"}],"_id":"17145","intvolume":" 293","file":[{"creator":"dernst","checksum":"fbad1de06383a6b7e8a1cb3e8c7205ce","file_id":"17151","content_type":"application/pdf","success":1,"file_size":1430896,"date_created":"2024-06-17T08:40:04Z","relation":"main_file","access_level":"open_access","date_updated":"2024-06-17T08:40:04Z","file_name":"2024_LIPICS_Rote.pdf"}],"quality_controlled":"1","conference":{"location":"Athens, Greece","start_date":"2024-06-11","name":"SoCG: Symposium on Computational Geometry","end_date":"2024-06-14"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Rote G, Rüber M, Saghafian M. Grid peeling of parabolas. In: 40th International Symposium on Computational Geometry. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.SoCG.2024.76","short":"G. Rote, M. Rüber, M. Saghafian, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ieee":"G. Rote, M. Rüber, and M. Saghafian, “Grid peeling of parabolas,” in 40th International Symposium on Computational Geometry, Athens, Greece, 2024, vol. 293.","chicago":"Rote, Günter, Moritz Rüber, and Morteza Saghafian. “Grid Peeling of Parabolas.” In 40th International Symposium on Computational Geometry, Vol. 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.SoCG.2024.76.","apa":"Rote, G., Rüber, M., & Saghafian, M. (2024). Grid peeling of parabolas. In 40th International Symposium on Computational Geometry (Vol. 293). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2024.76","mla":"Rote, Günter, et al. “Grid Peeling of Parabolas.” 40th International Symposium on Computational Geometry, vol. 293, 76, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.SoCG.2024.76.","ista":"Rote G, Rüber M, Saghafian M. 2024. Grid peeling of parabolas. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 293, 76."},"file_date_updated":"2024-06-17T08:40:04Z","article_number":"76","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773164"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"doi":"10.4230/LIPIcs.SoCG.2024.76","has_accepted_license":"1"},{"author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner"},{"full_name":"Pach, János","first_name":"János","last_name":"Pach","id":"E62E3130-B088-11EA-B919-BF823C25FEA4"}],"year":"2024","article_processing_charge":"No","title":"Maximum Betti numbers of Čech complexes","ec_funded":1,"oa_version":"Published Version","arxiv":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","project":[{"name":"Alpha Shape Theory Extended","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35"},{"call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"Mathematics, Computer Science","grant_number":"Z00342"}],"acknowledgement":"The first author is supported by the European Research Council (ERC), grant no. 788183, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant no. {I 02979-N35.} The second author is supported by the European Research Council (ERC), grant \"GeoScape\" and by the Hungarian Science Foundation (NKFIH), grant K-131529. Both authors are supported by the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.\r\nThe authors thank Matt Kahle for communicating the question about extremal Čech complexes, Ben Schweinhart for early discussions on the linked circles construction in three dimensions, and Gábor Tardos for helpful remarks and suggestions.","date_created":"2024-06-16T22:01:06Z","status":"public","date_published":"2024-06-01T00:00:00Z","day":"01","ddc":["510"],"type":"conference","scopus_import":"1","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"53","citation":{"ama":"Edelsbrunner H, Pach J. Maximum Betti numbers of Čech complexes. In: 40th International Symposium on Computational Geometry. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.SoCG.2024.53","short":"H. Edelsbrunner, J. Pach, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ieee":"H. Edelsbrunner and J. Pach, “Maximum Betti numbers of Čech complexes,” in 40th International Symposium on Computational Geometry, Athens, Greece, 2024, vol. 293.","chicago":"Edelsbrunner, Herbert, and János Pach. “Maximum Betti Numbers of Čech Complexes.” In 40th International Symposium on Computational Geometry, Vol. 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.SoCG.2024.53.","mla":"Edelsbrunner, Herbert, and János Pach. “Maximum Betti Numbers of Čech Complexes.” 40th International Symposium on Computational Geometry, vol. 293, 53, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.SoCG.2024.53.","apa":"Edelsbrunner, H., & Pach, J. (2024). Maximum Betti numbers of Čech complexes. In 40th International Symposium on Computational Geometry (Vol. 293). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2024.53","ista":"Edelsbrunner H, Pach J. 2024. Maximum Betti numbers of Čech complexes. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 293, 53."},"file_date_updated":"2024-06-17T08:46:33Z","quality_controlled":"1","conference":{"location":"Athens, Greece","start_date":"2024-06-11","name":"SoCG: Symposium on Computational Geometry","end_date":"2024-06-14"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"has_accepted_license":"1","doi":"10.4230/LIPIcs.SoCG.2024.53","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773164"]},"date_updated":"2025-12-01T15:19:20Z","related_material":{"record":[{"status":"public","id":"20657","relation":"later_version"}]},"alternative_title":["LIPIcs"],"external_id":{"arxiv":["2310.14801"]},"oa":1,"month":"06","file":[{"date_updated":"2024-06-17T08:46:33Z","access_level":"open_access","relation":"main_file","file_name":"2024_LIPICS_Edelsbrunner.pdf","checksum":"5442d44fb89d77477a87668d6e61aac9","creator":"dernst","date_created":"2024-06-17T08:46:33Z","success":1,"file_size":766562,"content_type":"application/pdf","file_id":"17152"}],"_id":"17146","abstract":[{"lang":"eng","text":"The Upper Bound Theorem for convex polytopes implies that the p-th Betti number of the Čech complex of any set of N points in ℝ^d and any radius satisfies β_p = O(N^m), with m = min{p+1, ⌈d/2⌉}. We construct sets in even and odd dimensions, which prove that this upper bound is asymptotically tight. For example, we describe a set of N = 2(n+1) points in ℝ³ and two radii such that the first Betti number of the Čech complex at one radius is (n+1)² - 1, and the second Betti number of the Čech complex at the other radius is n². In particular, there is an arrangement of n contruent balls in ℝ³ that enclose a quadratic number of voids, which answers a long-standing open question in computational geometry."}],"intvolume":" 293","publication":"40th International Symposium on Computational Geometry","department":[{"_id":"HeEd"}],"volume":293},{"oa":1,"corr_author":"1","date_updated":"2025-11-05T07:21:31Z","external_id":{"isi":["001396233806078"]},"publication":"2024 IEEE International Conference on Acoustics, Speech, and Signal Processing","department":[{"_id":"MaMo"},{"_id":"MaRo"}],"month":"04","abstract":[{"text":"Efficient utilization of large-scale biobank data is crucial for inferring the genetic basis of disease and predicting health outcomes from the DNA. Yet we lack efficient, accurate methods that scale to data where electronic health records are linked to whole genome sequence information. To address this issue, our paper develops a new algorithmic paradigm based on Approximate Message Passing (AMP), which is specifically tailored for genomic prediction and association testing. Our method yields comparable out-of-sample prediction accuracy to the state of the art on UK Biobank traits, whilst dramatically improving computational complexity, with a 8x-speed up in the run time. In addition, AMP theory provides a joint association testing framework, which outperforms the currently used REGENIE method, in roughly a third of the compute time. This first, truly large-scale application of the AMP framework lays the foundations for a far wider range of statistical analyses for hundreds of millions of variables measured on millions of people.","lang":"eng"}],"_id":"17147","quality_controlled":"1","OA_type":"green","conference":{"start_date":"2024-04-14","name":"ICASSP: International Conference on Acoustics, Speech and Signal Processing","end_date":"2024-04-19","location":"Seoul, Korea"},"main_file_link":[{"url":"https://openreview.net/forum?id=aQYCDxfZV0","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Depope, Al, Marco Mondelli, and Matthew Richard Robinson. “Inference of Genetic Effects via Approximate Message Passing.” In 2024 IEEE International Conference on Acoustics, Speech, and Signal Processing, 13151–55. IEEE, 2024. https://doi.org/10.1109/ICASSP48485.2024.10447198.","ista":"Depope A, Mondelli M, Robinson MR. 2024. Inference of genetic effects via approximate message passing. 2024 IEEE International Conference on Acoustics, Speech, and Signal Processing. ICASSP: International Conference on Acoustics, Speech and Signal Processing, 13151–13155.","mla":"Depope, Al, et al. “Inference of Genetic Effects via Approximate Message Passing.” 2024 IEEE International Conference on Acoustics, Speech, and Signal Processing, IEEE, 2024, pp. 13151–55, doi:10.1109/ICASSP48485.2024.10447198.","apa":"Depope, A., Mondelli, M., & Robinson, M. R. (2024). Inference of genetic effects via approximate message passing. In 2024 IEEE International Conference on Acoustics, Speech, and Signal Processing (pp. 13151–13155). Seoul, Korea: IEEE. https://doi.org/10.1109/ICASSP48485.2024.10447198","ieee":"A. Depope, M. Mondelli, and M. R. Robinson, “Inference of genetic effects via approximate message passing,” in 2024 IEEE International Conference on Acoustics, Speech, and Signal Processing, Seoul, Korea, 2024, pp. 13151–13155.","short":"A. Depope, M. Mondelli, M.R. Robinson, in:, 2024 IEEE International Conference on Acoustics, Speech, and Signal Processing, IEEE, 2024, pp. 13151–13155.","ama":"Depope A, Mondelli M, Robinson MR. Inference of genetic effects via approximate message passing. In: 2024 IEEE International Conference on Acoustics, Speech, and Signal Processing. IEEE; 2024:13151-13155. doi:10.1109/ICASSP48485.2024.10447198"},"acknowledged_ssus":[{"_id":"ScienComp"}],"publication_identifier":{"isbn":["9798350344851"],"issn":["1520-6149"]},"doi":"10.1109/ICASSP48485.2024.10447198","date_published":"2024-04-19T00:00:00Z","scopus_import":"1","isi":1,"language":[{"iso":"eng"}],"day":"19","page":"13151-13155","type":"conference","article_processing_charge":"No","title":"Inference of genetic effects via approximate message passing","oa_version":"Submitted Version","OA_place":"repository","author":[{"first_name":"Al","full_name":"Depope, Al","id":"0b77531d-dbcd-11ea-9d1d-a8eee0bf3830","last_name":"Depope"},{"full_name":"Mondelli, Marco","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","orcid":"0000-0002-3242-7020"},{"last_name":"Robinson","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","first_name":"Matthew Richard","full_name":"Robinson, Matthew Richard","orcid":"0000-0001-8982-8813"}],"year":"2024","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"},{"_id":"9B8D11D6-BA93-11EA-9121-9846C619BF3A","name":"Improving estimation and prediction of common complex disease risk","grant_number":"PCEGP3_181181"}],"acknowledgement":"This work was supported by a Lopez-Loreta Prize to MM, an SNSF Eccellenza Grant to MRR (PCEGP3-181181), and core funding from ISTA. The authors thank Philip Schniter, Matthew Stephens and Pragya Sur for valuable suggestions on an early version of the work. The authors acknowledge the participants and investigators of the UK Biobank study. High-performance\r\ncomputing was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp).","date_created":"2024-06-16T22:01:07Z","status":"public","publisher":"IEEE","publication_status":"published"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"K. Aebischer, L.M. Becker, P. Schanda, M. Ernst, Magnetic Resonance 5 (2024) 69–86.","ama":"Aebischer K, Becker LM, Schanda P, Ernst M. Evaluating the motional timescales contributing to averaged anisotropic interactions in MAS solid-state NMR. Magnetic Resonance. 2024;5(1):69-86. doi:10.5194/mr-5-69-2024","ista":"Aebischer K, Becker LM, Schanda P, Ernst M. 2024. Evaluating the motional timescales contributing to averaged anisotropic interactions in MAS solid-state NMR. Magnetic Resonance. 5(1), 69–86.","mla":"Aebischer, Kathrin, et al. “Evaluating the Motional Timescales Contributing to Averaged Anisotropic Interactions in MAS Solid-State NMR.” Magnetic Resonance, vol. 5, no. 1, Copernicus Publications, 2024, pp. 69–86, doi:10.5194/mr-5-69-2024.","apa":"Aebischer, K., Becker, L. M., Schanda, P., & Ernst, M. (2024). Evaluating the motional timescales contributing to averaged anisotropic interactions in MAS solid-state NMR. Magnetic Resonance. Copernicus Publications. https://doi.org/10.5194/mr-5-69-2024","chicago":"Aebischer, Kathrin, Lea Marie Becker, Paul Schanda, and Matthias Ernst. “Evaluating the Motional Timescales Contributing to Averaged Anisotropic Interactions in MAS Solid-State NMR.” Magnetic Resonance. Copernicus Publications, 2024. https://doi.org/10.5194/mr-5-69-2024.","ieee":"K. Aebischer, L. M. Becker, P. Schanda, and M. Ernst, “Evaluating the motional timescales contributing to averaged anisotropic interactions in MAS solid-state NMR,” Magnetic Resonance, vol. 5, no. 1. Copernicus Publications, pp. 69–86, 2024."},"file_date_updated":"2024-06-27T06:42:55Z","quality_controlled":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"doi":"10.5194/mr-5-69-2024","has_accepted_license":"1","publication_identifier":{"eissn":["2699-0016"]},"external_id":{"pmid":["40384772"]},"date_updated":"2025-06-11T13:26:12Z","oa":1,"article_type":"original","month":"06","_id":"17161","abstract":[{"text":"Dynamic processes in molecules can occur on a wide range of timescales, and it is important to understand which timescales of motion contribute to different parameters used in dynamics measurements. For spin relaxation, this can easily be understood from the sampling frequencies of the spectral-density function by different relaxation-rate constants. In addition to data from relaxation measurements, determining dynamically averaged anisotropic interactions in magic-angle spinning (MAS) solid-state NMR allows for better quantification of the amplitude of molecular motion. For partially averaged anisotropic interactions, the relevant timescales of motion are not so clearly defined. Whether the averaging depends on the experimental methods (e.g., pulse sequences) or conditions (e.g., MAS frequency, magnitude of anisotropic interaction, radio-frequency field amplitudes) is not fully understood. To investigate these questions, we performed numerical simulations of dynamic systems based on the stochastic Liouville equation using several experiments for recoupling the dipolar coupling, chemical-shift anisotropy or quadrupolar coupling. As described in the literature, the transition between slow motion, where parameters characterizing the anisotropic interaction are not averaged, and fast motion, where the tensors are averaged leading to a scaled anisotropic quantity, occurs over a window of motional rate constants that depends mainly on the strength of the interaction. This transition region can span 2 orders of magnitude in exchange-rate constants (typically in the microsecond range) but depends only marginally on the employed recoupling scheme or sample spinning frequency. The transition region often coincides with a fast relaxation of coherences, making precise quantitative measurements difficult. Residual couplings in off-magic-angle experiments, however, average over longer timescales of motion. While in principle one may gain information on the timescales of motion from the transition area, extracting such information is hampered by low signal-to-noise ratio in experimental spectra due to fast relaxation that occurs in the same region.","lang":"eng"}],"intvolume":" 5","file":[{"checksum":"d01074f6919387fcaf8c9ebed320ccae","creator":"dernst","file_size":6736194,"success":1,"date_created":"2024-06-27T06:42:55Z","content_type":"application/pdf","file_id":"17181","date_updated":"2024-06-27T06:42:55Z","access_level":"open_access","relation":"main_file","file_name":"2024_MagneticResonance_Aebischer.pdf"}],"department":[{"_id":"PaSc"}],"publication":"Magnetic Resonance","volume":5,"year":"2024","author":[{"last_name":"Aebischer","first_name":"Kathrin","full_name":"Aebischer, Kathrin"},{"last_name":"Becker","id":"36336939-eb97-11eb-a6c2-c83f1214ca79","first_name":"Lea Marie","full_name":"Becker, Lea Marie","orcid":"0000-0002-6401-5151"},{"orcid":"0000-0002-9350-7606","last_name":"Schanda","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","first_name":"Paul","full_name":"Schanda, Paul"},{"last_name":"Ernst","first_name":"Matthias","full_name":"Ernst, Matthias"}],"oa_version":"Published Version","article_processing_charge":"Yes","title":"Evaluating the motional timescales contributing to averaged anisotropic interactions in MAS solid-state NMR","pmid":1,"publisher":"Copernicus Publications","publication_status":"published","project":[{"_id":"7be609c4-9f16-11ee-852c-85015ce2b9b0","name":"Exploring protein dynamics by solid-state MAS NMR through specific labeling approaches","grant_number":"26777"}],"status":"public","date_created":"2024-06-23T22:01:02Z","acknowledgement":"We would like to thank Kay Saalwächter for pointing out important aspects of the intermediate regime during the open review process. Lea Marie Becker is recipient of a DOC fellowship of the Austrian Academy of Sciences at the Institute of Science and Technology Austria.\r\nThis research has been supported by the Österreichischen Akademie der Wissenschaften (grant no. PR10660EAW01) and the Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung (grant nos. 200020_188988 and 200020_219375).","date_published":"2024-06-11T00:00:00Z","issue":"1","type":"journal_article","day":"11","page":"69-86","ddc":["530"],"scopus_import":"1","language":[{"iso":"eng"}]},{"issue":"OOPSLA1","date_published":"2024-04-29T00:00:00Z","scopus_import":"1","language":[{"iso":"eng"}],"day":"29","ddc":["000"],"type":"journal_article","article_processing_charge":"Yes (in subscription journal)","title":"Quantitative bounds on resource usage of probabilistic programs","oa_version":"Published Version","ec_funded":1,"author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","full_name":"Goharshady, Amir Kafshdar","first_name":"Amir Kafshdar"},{"id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","last_name":"Meggendorfer","full_name":"Meggendorfer, Tobias","first_name":"Tobias","orcid":"0000-0002-1712-2165"},{"orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","full_name":"Zikelic, Dorde","first_name":"Dorde"}],"year":"2024","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}],"acknowledgement":"This work was supported in part by the European Research Council (ERC) under Grant No. 863818\r\n(ForM-SMArt) and the Hong Kong Research Grants Council under ECS Project No. 26208122.","date_created":"2024-06-23T22:01:02Z","status":"public","publisher":"Association for Computing Machinery","publication_status":"published","oa":1,"date_updated":"2025-04-14T07:52:47Z","publication":"Proceedings of the ACM on Programming Languages","department":[{"_id":"KrCh"}],"volume":8,"article_type":"original","month":"04","file":[{"file_id":"17182","content_type":"application/pdf","date_created":"2024-06-27T07:48:16Z","success":1,"file_size":413096,"creator":"dernst","checksum":"9243ded966f71df1572be5466019be5c","file_name":"2024_ProcACMProgLanguage_Chatterjee.pdf","relation":"main_file","access_level":"open_access","date_updated":"2024-06-27T07:48:16Z"}],"intvolume":" 8","_id":"17162","abstract":[{"text":"Cost analysis, also known as resource usage analysis, is the task of finding bounds on the total cost of a program and is a well-studied problem in static analysis. In this work, we consider two classical quantitative problems in cost analysis for probabilistic programs. The first problem is to find a bound on the expected total cost of the program. This is a natural measure for the resource usage of the program and can also be directly applied to average-case runtime analysis. The second problem asks for a tail bound, i.e. given a threshold t the goal is to find a probability bound p such that ℙ[total cost ≥ t] ≤ p. Intuitively, given a threshold t on the resource, the problem is to find the likelihood that the total cost exceeds this threshold.\r\nFirst, for expectation bounds, a major obstacle in previous works on cost analysis is that they can handle only non-negative costs or bounded variable updates. In contrast, we provide a new variant of the standard notion of cost martingales, that allows us to find expectation bounds for a class of programs with general positive or negative costs and no restriction on the variable updates. More specifically, our approach is applicable as long as there is a lower bound on the total cost incurred along every path.\r\nSecond, for tail bounds, all previous methods are limited to programs in which the expected total cost is finite. In contrast, we present a novel approach, based on a combination of our martingale-based method for expectation bounds with a quantitative safety analysis, to obtain a solution to the tail bound problem that is applicable even to programs with infinite expected cost. Specifically, this allows us to obtain runtime tail bounds for programs that do not terminate almost-surely.\r\nIn summary, we provide a novel combination of martingale-based cost analysis and quantitative safety analysis that is able to find expectation and tail cost bounds for probabilistic programs, without the restrictions of non-negative costs, bounded updates, or finiteness of the expected total cost. Finally, we provide experimental results showcasing that our approach can solve instances that were beyond the reach of previous methods.","lang":"eng"}],"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"107","citation":{"short":"K. Chatterjee, A.K. Goharshady, T. Meggendorfer, D. Zikelic, Proceedings of the ACM on Programming Languages 8 (2024).","ama":"Chatterjee K, Goharshady AK, Meggendorfer T, Zikelic D. Quantitative bounds on resource usage of probabilistic programs. Proceedings of the ACM on Programming Languages. 2024;8(OOPSLA1). doi:10.1145/3649824","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Tobias Meggendorfer, and Dorde Zikelic. “Quantitative Bounds on Resource Usage of Probabilistic Programs.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2024. https://doi.org/10.1145/3649824.","apa":"Chatterjee, K., Goharshady, A. K., Meggendorfer, T., & Zikelic, D. (2024). Quantitative bounds on resource usage of probabilistic programs. Proceedings of the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3649824","mla":"Chatterjee, Krishnendu, et al. “Quantitative Bounds on Resource Usage of Probabilistic Programs.” Proceedings of the ACM on Programming Languages, vol. 8, no. OOPSLA1, 107, Association for Computing Machinery, 2024, doi:10.1145/3649824.","ista":"Chatterjee K, Goharshady AK, Meggendorfer T, Zikelic D. 2024. Quantitative bounds on resource usage of probabilistic programs. Proceedings of the ACM on Programming Languages. 8(OOPSLA1), 107.","ieee":"K. Chatterjee, A. K. Goharshady, T. Meggendorfer, and D. Zikelic, “Quantitative bounds on resource usage of probabilistic programs,” Proceedings of the ACM on Programming Languages, vol. 8, no. OOPSLA1. Association for Computing Machinery, 2024."},"file_date_updated":"2024-06-27T07:48:16Z","publication_identifier":{"eissn":["2475-1421"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"has_accepted_license":"1","doi":"10.1145/3649824"},{"acknowledgement":"This research has been supported by the European Research Council (ERC), grant No. 788183, by the Wittgenstein Prize, Austrian Science Fund (FWF), grant No. Z 342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant No. I 02979-N35.\r\nWintraecken, Mathijs: Supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411, the Austrian science fund (FWF) grant No. M-3073, and the welcome package from IDEX of the Université Côte d'Azur.","date_created":"2024-06-25T11:45:58Z","status":"public","project":[{"grant_number":"788183","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z00342","name":"Mathematics, Computer Science"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35"},{"grant_number":"M03073","name":"Learning and triangulating manifolds via collapses","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2"}],"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","arxiv":1,"title":"Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds","article_processing_charge":"No","ec_funded":1,"oa_version":"Published Version","author":[{"full_name":"Attali, Dominique","first_name":"Dominique","last_name":"Attali"},{"last_name":"Kourimska","id":"D9B8E14C-3C26-11EA-98F5-1F833DDC885E","first_name":"Hana","full_name":"Kourimska, Hana","orcid":"0000-0001-7841-0091"},{"first_name":"Christopher D","full_name":"Fillmore, Christopher D","last_name":"Fillmore","id":"35638A5C-AAC7-11E9-B0BF-5503E6697425"},{"last_name":"Ghosh","id":"ee449b28-344d-11ef-a6d5-9ca430e9e9ff","full_name":"Ghosh, Ishika","first_name":"Ishika"},{"full_name":"Lieutier, André","first_name":"André","last_name":"Lieutier"},{"orcid":"0000-0002-6862-208X","first_name":"Elizabeth R","full_name":"Stephenson, Elizabeth R","last_name":"Stephenson","id":"2D04F932-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Wintraecken","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","full_name":"Wintraecken, Mathijs","first_name":"Mathijs","orcid":"0000-0002-7472-2220"}],"year":"2024","language":[{"iso":"eng"}],"scopus_import":"1","day":"06","ddc":["516"],"page":"11:1-11:19","type":"conference","date_published":"2024-06-06T00:00:00Z","publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959773164"]},"has_accepted_license":"1","doi":"10.4230/LIPIcs.SoCG.2024.11","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"conference":{"start_date":"2024-06-11","end_date":"2024-06-14","name":"SoCG: Symposium on Computational Geometry","location":"Athens, Greece"},"quality_controlled":"1","file_date_updated":"2024-06-25T11:47:26Z","citation":{"short":"D. Attali, H. Kourimska, C.D. Fillmore, I. Ghosh, A. Lieutier, E.R. Stephenson, M. Wintraecken, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 11:1-11:19.","ama":"Attali D, Kourimska H, Fillmore CD, et al. Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds. In: 40th International Symposium on Computational Geometry. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024:11:1-11:19. doi:10.4230/LIPIcs.SoCG.2024.11","ista":"Attali D, Kourimska H, Fillmore CD, Ghosh I, Lieutier A, Stephenson ER, Wintraecken M. 2024. Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 293, 11:1-11:19.","apa":"Attali, D., Kourimska, H., Fillmore, C. D., Ghosh, I., Lieutier, A., Stephenson, E. R., & Wintraecken, M. (2024). Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds. In 40th International Symposium on Computational Geometry (Vol. 293, p. 11:1-11:19). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2024.11","mla":"Attali, Dominique, et al. “Tight Bounds for the Learning of Homotopy à La Niyogi, Smale, and Weinberger for Subsets of Euclidean Spaces and of Riemannian Manifolds.” 40th International Symposium on Computational Geometry, vol. 293, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 11:1-11:19, doi:10.4230/LIPIcs.SoCG.2024.11.","chicago":"Attali, Dominique, Hana Kourimska, Christopher D Fillmore, Ishika Ghosh, André Lieutier, Elizabeth R Stephenson, and Mathijs Wintraecken. “Tight Bounds for the Learning of Homotopy à La Niyogi, Smale, and Weinberger for Subsets of Euclidean Spaces and of Riemannian Manifolds.” In 40th International Symposium on Computational Geometry, 293:11:1-11:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.SoCG.2024.11.","ieee":"D. Attali et al., “Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of euclidean spaces and of Riemannian manifolds,” in 40th International Symposium on Computational Geometry, Athens, Greece, 2024, vol. 293, p. 11:1-11:19."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":293,"publication":"40th International Symposium on Computational Geometry","department":[{"_id":"GradSch"},{"_id":"HeEd"}],"file":[{"file_name":"LIPIcs.SoCG.2024.11.pdf","access_level":"open_access","date_updated":"2024-06-25T11:47:26Z","relation":"main_file","success":1,"date_created":"2024-06-25T11:47:26Z","file_size":20886142,"content_type":"application/pdf","file_id":"17171","checksum":"6a2ddc8b51aa58f197a8b294750f1f8d","creator":"cfillmor"}],"_id":"17170","intvolume":" 293","abstract":[{"lang":"eng","text":"In this article we extend and strengthen the seminal work by Niyogi, Smale, and Weinberger on the learning of the homotopy type from a sample of an underlying space. In their work, Niyogi, Smale, and Weinberger studied samples of C² manifolds with positive reach embedded in ℝ^d. We extend their results in the following ways: - As the ambient space we consider both ℝ^d and Riemannian manifolds with lower bounded sectional curvature. - In both types of ambient spaces, we study sets of positive reach - a significantly more general setting than C² manifolds - as well as general manifolds of positive reach. - The sample P of a set (or a manifold) 𝒮 of positive reach may be noisy. We work with two one-sided Hausdorff distances - ε and δ - between P and 𝒮. We provide tight bounds in terms of ε and δ, that guarantee that there exists a parameter r such that the union of balls of radius r centred at the sample P deformation-retracts to 𝒮. We exhibit their tightness by an explicit construction. We carefully distinguish the roles of δ and ε. This is not only essential to achieve tight bounds, but also sensible in practical situations, since it allows one to adapt the bound according to sample density and the amount of noise present in the sample separately."}],"month":"06","oa":1,"date_updated":"2025-04-15T07:16:57Z","alternative_title":["LIPIcs"],"external_id":{"arxiv":["2206.10485"]}},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"has_accepted_license":"1","doi":"10.1016/j.artint.2024.104171","publication_identifier":{"issn":["0004-3702"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_number":"104171","citation":{"ista":"Braun P, Hahn N, Hoefer M, Schecker C. 2024. Delegated online search. Artificial Intelligence. 334, 104171.","mla":"Braun, Pirmin, et al. “Delegated Online Search.” Artificial Intelligence, vol. 334, 104171, Elsevier, 2024, doi:10.1016/j.artint.2024.104171.","apa":"Braun, P., Hahn, N., Hoefer, M., & Schecker, C. (2024). Delegated online search. Artificial Intelligence. Elsevier. https://doi.org/10.1016/j.artint.2024.104171","chicago":"Braun, Pirmin, Niklas Hahn, Martin Hoefer, and Conrad Schecker. “Delegated Online Search.” Artificial Intelligence. Elsevier, 2024. https://doi.org/10.1016/j.artint.2024.104171.","ieee":"P. Braun, N. Hahn, M. Hoefer, and C. Schecker, “Delegated online search,” Artificial Intelligence, vol. 334. Elsevier, 2024.","short":"P. Braun, N. Hahn, M. Hoefer, C. Schecker, Artificial Intelligence 334 (2024).","ama":"Braun P, Hahn N, Hoefer M, Schecker C. Delegated online search. Artificial Intelligence. 2024;334. doi:10.1016/j.artint.2024.104171"},"file_date_updated":"2025-01-09T10:45:24Z","quality_controlled":"1","OA_type":"hybrid","article_type":"original","month":"09","file":[{"file_id":"18806","success":1,"date_created":"2025-01-09T10:45:24Z","file_size":772226,"content_type":"application/pdf","creator":"dernst","checksum":"f02a56bc7ea88f41fcc68968e4ceddf3","file_name":"2024_ArtificialIntelligence_Braun.pdf","relation":"main_file","date_updated":"2025-01-09T10:45:24Z","access_level":"open_access"}],"abstract":[{"text":"In a delegation problem, a principal P with commitment power tries to pick one out of 𝑛 options.\r\nEach option is drawn independently from a known distribution. Instead of inspecting the options\r\nherself, P delegates the information acquisition to a rational and self-interested agent A. After\r\ninspection, A proposes one of the options, and P can accept or reject.\r\nDelegation is a classic setting in economic information design with many prominent applications,\r\nbut the computational problems are only poorly understood. In this paper, we study a natural\r\nonline variant of delegation, in which the agent searches through the options in an online fashion.\r\nFor each option, he has to irrevocably decide if he wants to propose the current option or discard\r\nit, before seeing information on the next option(s). How can we design algorithms for P that\r\napproximate the utility of her best option in hindsight?\r\nWe show that in general P can obtain a Θ(1∕𝑛)-approximation and extend this result to ratios\r\nof Θ(𝑘∕𝑛) in case (1) A has a lookahead of 𝑘 rounds, or (2) A can propose up to 𝑘 different\r\noptions. We provide fine-grained bounds independent of 𝑛 based on three parameters. If the ratio\r\nof maximum and minimum utility for A is bounded by a factor 𝛼, we obtain an Ω(loglog 𝛼∕ log 𝛼)-\r\napproximation algorithm, and we show that this is best possible. Additionally, if P cannot\r\ndistinguish options with the same value for herself, we show that ratios polynomial in 1∕𝛼 cannot\r\nbe avoided. If there are at most 𝛽 different utility values for A, we show a Θ(1∕𝛽)-approximation.\r\nIf the utilities of P and A for each option are related by a factor 𝛾, we obtain an Ω(1∕ log 𝛾)-\r\napproximation, where 𝑂(log log 𝛾∕ log 𝛾) is best possible.","lang":"eng"}],"_id":"17188","intvolume":" 334","publication":"Artificial Intelligence","department":[{"_id":"MoHe"}],"volume":334,"date_updated":"2025-09-08T08:00:42Z","external_id":{"arxiv":["2203.01084"],"isi":["001260448100001"]},"corr_author":"1","oa":1,"publisher":"Elsevier","publication_status":"published","acknowledgement":"Hahn gratefully acknowledges the support of GIF grant I-1419-118.4/2017. Hoefer gratefully acknowledges the support of GIF grant I-1419-118.4/2017, DFG Research Unit ADYN (project number 411362735), and DFG grant Ho 3831/9-1 (project number 514505843).","date_created":"2024-06-30T22:01:05Z","status":"public","OA_place":"publisher","author":[{"last_name":"Braun","first_name":"Pirmin","full_name":"Braun, Pirmin"},{"first_name":"Niklas","full_name":"Hahn, Niklas","id":"0a01c7b2-b823-11ed-9928-cc3f874f9ffd","last_name":"Hahn"},{"last_name":"Hoefer","full_name":"Hoefer, Martin","first_name":"Martin"},{"full_name":"Schecker, Conrad","first_name":"Conrad","last_name":"Schecker"}],"year":"2024","article_processing_charge":"Yes (in subscription journal)","title":"Delegated online search","oa_version":"Published Version","arxiv":1,"ddc":["000"],"day":"01","type":"journal_article","scopus_import":"1","isi":1,"language":[{"iso":"eng"}],"date_published":"2024-09-01T00:00:00Z"},{"department":[{"_id":"LiBu"}],"publication":"Nature Astronomy","volume":8,"article_type":"original","month":"09","intvolume":" 8","_id":"17189","abstract":[{"lang":"eng","text":"Supergranules, which are solar flow features with a lateral scale of 30,000–40,000 km and a lifetime of ~24 h, form a prominent component of the Sun’s convective spectrum. However, their internal flows, which can be probed only by helioseismology, are not well understood. We analyse dopplergrams recorded by the Solar Dynamics Observatory satellite to identify and characterize ~23,000 supergranules. We find that the vertical flows peak at a depth of ~10,000 km, and remain invariant over the full range of lateral supergranular scales, contrary to numerical predictions. We also infer that, within the local seismic resolution (≳5,000 km), downflows are ~40% weaker than upflows, indicating an apparent mass-flux imbalance. This may imply that the descending flows also comprise plumes, which maintain the mass balance but are simply too small to be detected by seismic waves. These results challenge the widely used mixing-length description of solar convection."}],"external_id":{"isi":["001254181700001"]},"date_updated":"2025-09-08T08:04:56Z","publication_identifier":{"eissn":["2397-3366"]},"doi":"10.1038/s41550-024-02304-w","quality_controlled":"1","OA_type":"closed access","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"short":"C.S. Hanson, S.B. Das, P. Mani, S. Hanasoge, K.R. Sreenivasan, Nature Astronomy 8 (2024) 1088–1101.","ama":"Hanson CS, Das SB, Mani P, Hanasoge S, Sreenivasan KR. Supergranular-scale solar convection not explained by mixing-length theory. Nature Astronomy. 2024;8:1088-1101. doi:10.1038/s41550-024-02304-w","apa":"Hanson, C. S., Das, S. B., Mani, P., Hanasoge, S., & Sreenivasan, K. R. (2024). Supergranular-scale solar convection not explained by mixing-length theory. Nature Astronomy. Springer Nature. https://doi.org/10.1038/s41550-024-02304-w","mla":"Hanson, Chris S., et al. “Supergranular-Scale Solar Convection Not Explained by Mixing-Length Theory.” Nature Astronomy, vol. 8, Springer Nature, 2024, pp. 1088–101, doi:10.1038/s41550-024-02304-w.","ista":"Hanson CS, Das SB, Mani P, Hanasoge S, Sreenivasan KR. 2024. Supergranular-scale solar convection not explained by mixing-length theory. Nature Astronomy. 8, 1088–1101.","chicago":"Hanson, Chris S., Srijan B Das, Prasad Mani, Shravan Hanasoge, and Katepalli R. Sreenivasan. “Supergranular-Scale Solar Convection Not Explained by Mixing-Length Theory.” Nature Astronomy. Springer Nature, 2024. https://doi.org/10.1038/s41550-024-02304-w.","ieee":"C. S. Hanson, S. B. Das, P. Mani, S. Hanasoge, and K. R. Sreenivasan, “Supergranular-scale solar convection not explained by mixing-length theory,” Nature Astronomy, vol. 8. Springer Nature, pp. 1088–1101, 2024."},"scopus_import":"1","language":[{"iso":"eng"}],"isi":1,"type":"journal_article","day":"01","page":"1088-1101","date_published":"2024-09-01T00:00:00Z","project":[{"call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413"}],"status":"public","date_created":"2024-06-30T22:01:05Z","acknowledgement":"We thank F. J. Simons for the codes for computing Slepian functions,\r\nM. Rempel and R. Cameron for their insights into solar convection, J.\r\nW. Lord for the numerical simulations and J. Naranjo for his help with\r\nthe NYUAD NetDRMS system. This research was carried out with the\r\nHigh Performance Computing resources at NYUAD. The datasets were\r\nprepared in the data centre at the Center for Space Science of NYUAD.\r\nThis research is based upon work supported by Tamkeen under the\r\nNYUAD Research Institute (Grant Nos G1502 and CASS to C.S.H,\r\nS.H. and K.R.S.). S.H. acknowledges funding from the Department\r\nof Atomic Energy, India. K.R.S. and S.H. acknowledge support from\r\nthe Ofice of Sponsored Research of King Abdullah University of\r\nScience and Technology (Award No. OSR-CRG2020-4342). S.B.D.\r\nacknowledges funding from the Elisabeth H. and F. A. Dahlen Award\r\n2022 by the Department of Geosciences, Princeton University. S.B.D.\r\nalso acknowledges funding from the European Union’s Horizon 2020\r\nresearch and innovation programme under a Marie Skłodowska-Curie\r\ngrant (Grant Agreement No. 101034413). Some data products were\r\nprocessed and downloaded from the German Data Center for SDO,\r\nwhich is funded by the German Aerospace Center (DLR Grant No.\r\n500L1701).","publisher":"Springer Nature","publication_status":"published","ec_funded":1,"oa_version":"None","title":"Supergranular-scale solar convection not explained by mixing-length theory","article_processing_charge":"No","year":"2024","author":[{"last_name":"Hanson","full_name":"Hanson, Chris S.","first_name":"Chris S."},{"orcid":"0000-0003-0896-7972","last_name":"Das","id":"9ce7c423-dacf-11ed-8942-e09c6cb27149","full_name":"Das, Srijan B","first_name":"Srijan B"},{"full_name":"Mani, Prasad","first_name":"Prasad","last_name":"Mani"},{"full_name":"Hanasoge, Shravan","first_name":"Shravan","last_name":"Hanasoge"},{"full_name":"Sreenivasan, Katepalli R.","first_name":"Katepalli R.","last_name":"Sreenivasan"}]},{"date_published":"2024-06-07T00:00:00Z","issue":"2","day":"07","page":"1784-1807","type":"journal_article","isi":1,"language":[{"iso":"eng"}],"scopus_import":"1","author":[{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","first_name":"Herbert"},{"last_name":"Garber","full_name":"Garber, Alexey","first_name":"Alexey"},{"last_name":"Ghafaris","full_name":"Ghafaris, Mohadese","first_name":"Mohadese"},{"orcid":"0000-0002-1780-2689","first_name":"Teresa","full_name":"Heiss, Teresa","last_name":"Heiss","id":"4879BB4E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Saghafiant","first_name":"Morteza","full_name":"Saghafiant, Morteza"},{"last_name":"Wintraecken","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","full_name":"Wintraecken, Mathijs","first_name":"Mathijs","orcid":"0000-0002-7472-2220"}],"year":"2024","arxiv":1,"article_processing_charge":"No","title":"Brillouin zones of integer lattices and their perturbations","oa_version":"Preprint","ec_funded":1,"publication_status":"published","publisher":"Society for Industrial and Applied Mathematics","acknowledgement":"The second author is partially supported by the Alexander von Humboldt Foundation. The sixth author is supported by the European Union's Horizon 2020 research and innovation programme under Marie Sklodowska-Curie grant agreement 754411, and by Austrian Science Fund(FWF) grant M-3073. All other authors are supported by European Research Council (ERC) grant 788183, by the Wittgenstein Prize, by Austrian Science Fund (FWF) grant Z 342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF) grant I 02979-N35.","date_created":"2024-06-30T22:01:05Z","status":"public","project":[{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"grant_number":"788183","name":"Alpha Shape Theory Extended","call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"name":"Learning and triangulating manifolds via collapses","grant_number":"M03073","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2"},{"grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"},{"_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z00342","name":"Mathematics, Computer Science"}],"date_updated":"2025-09-08T08:06:04Z","external_id":{"arxiv":["2204.01077"],"isi":["001292728600001"]},"corr_author":"1","oa":1,"intvolume":" 38","_id":"17190","abstract":[{"lang":"eng","text":"For a locally finite set, 𝐴⊆ℝ𝑑\r\n, the 𝑘\r\nth Brillouin zone of 𝑎∈𝐴\r\n is the region of points 𝑥∈ℝ𝑑\r\n for which ‖𝑥−𝑎‖\r\n is the 𝑘\r\nth smallest among the Euclidean distances between 𝑥\r\n and the points in 𝐴\r\n. If 𝐴\r\n is a lattice, the 𝑘\r\nth Brillouin zones of the points in 𝐴\r\n are translates of each other, and together they tile space. Depending on the value of 𝑘\r\n, they express medium- or long-range order in the set. We study fundamental geometric and combinatorial properties of Brillouin zones, focusing on the integer lattice and its perturbations. Our results include the stability of a Brillouin zone under perturbations, a linear upper bound on the number of chambers in a zone for lattices in ℝ2\r\n, and the convergence of the maximum volume of a chamber to zero for the integer lattice."}],"month":"06","article_type":"original","volume":38,"publication":"SIAM Journal on Discrete Mathematics","department":[{"_id":"HeEd"}],"citation":{"apa":"Edelsbrunner, H., Garber, A., Ghafaris, M., Heiss, T., Saghafiant, M., & Wintraecken, M. (2024). Brillouin zones of integer lattices and their perturbations. SIAM Journal on Discrete Mathematics. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/22M1489071","mla":"Edelsbrunner, Herbert, et al. “Brillouin Zones of Integer Lattices and Their Perturbations.” SIAM Journal on Discrete Mathematics, vol. 38, no. 2, Society for Industrial and Applied Mathematics, 2024, pp. 1784–807, doi:10.1137/22M1489071.","ista":"Edelsbrunner H, Garber A, Ghafaris M, Heiss T, Saghafiant M, Wintraecken M. 2024. Brillouin zones of integer lattices and their perturbations. SIAM Journal on Discrete Mathematics. 38(2), 1784–1807.","chicago":"Edelsbrunner, Herbert, Alexey Garber, Mohadese Ghafaris, Teresa Heiss, Morteza Saghafiant, and Mathijs Wintraecken. “Brillouin Zones of Integer Lattices and Their Perturbations.” SIAM Journal on Discrete Mathematics. Society for Industrial and Applied Mathematics, 2024. https://doi.org/10.1137/22M1489071.","ieee":"H. Edelsbrunner, A. Garber, M. Ghafaris, T. Heiss, M. Saghafiant, and M. Wintraecken, “Brillouin zones of integer lattices and their perturbations,” SIAM Journal on Discrete Mathematics, vol. 38, no. 2. Society for Industrial and Applied Mathematics, pp. 1784–1807, 2024.","short":"H. Edelsbrunner, A. Garber, M. Ghafaris, T. Heiss, M. Saghafiant, M. Wintraecken, SIAM Journal on Discrete Mathematics 38 (2024) 1784–1807.","ama":"Edelsbrunner H, Garber A, Ghafaris M, Heiss T, Saghafiant M, Wintraecken M. Brillouin zones of integer lattices and their perturbations. SIAM Journal on Discrete Mathematics. 2024;38(2):1784-1807. doi:10.1137/22M1489071"},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2204.01077","open_access":"1"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","quality_controlled":"1","doi":"10.1137/22M1489071","publication_identifier":{"issn":["0895-4801"]}},{"corr_author":"1","external_id":{"pmid":["38907047"],"isi":["001251509300001"]},"date_updated":"2025-09-08T08:06:56Z","volume":25,"department":[{"_id":"MiSi"}],"publication":"Nature Immunology","_id":"17191","abstract":[{"lang":"eng","text":"Dendritic cells migrate to and from lymph nodes in response to chemokine gradients.Data now show that steady-state migration of these cells can be triggered by a mechanosensitive pathway."}],"intvolume":" 25","article_type":"letter_note","month":"06","quality_controlled":"1","citation":{"ama":"Lembo S, Sixt MK. Nuclear squeezing wakes up dendritic cells. Nature Immunology. 2024;25:1131–1132. doi:10.1038/s41590-024-01881-2","short":"S. Lembo, M.K. Sixt, Nature Immunology 25 (2024) 1131–1132.","ieee":"S. Lembo and M. K. Sixt, “Nuclear squeezing wakes up dendritic cells,” Nature Immunology, vol. 25. Springer Nature, pp. 1131–1132, 2024.","chicago":"Lembo, Sergio, and Michael K Sixt. “Nuclear Squeezing Wakes up Dendritic Cells.” Nature Immunology. Springer Nature, 2024. https://doi.org/10.1038/s41590-024-01881-2.","mla":"Lembo, Sergio, and Michael K. Sixt. “Nuclear Squeezing Wakes up Dendritic Cells.” Nature Immunology, vol. 25, Springer Nature, 2024, pp. 1131–1132, doi:10.1038/s41590-024-01881-2.","ista":"Lembo S, Sixt MK. 2024. Nuclear squeezing wakes up dendritic cells. Nature Immunology. 25, 1131–1132.","apa":"Lembo, S., & Sixt, M. K. (2024). Nuclear squeezing wakes up dendritic cells. Nature Immunology. Springer Nature. https://doi.org/10.1038/s41590-024-01881-2"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_identifier":{"issn":["1529-2908"],"eissn":["1529-2916"]},"doi":"10.1038/s41590-024-01881-2","date_published":"2024-06-21T00:00:00Z","language":[{"iso":"eng"}],"isi":1,"scopus_import":"1","type":"journal_article","day":"21","page":"1131–1132 ","pmid":1,"oa_version":"None","title":"Nuclear squeezing wakes up dendritic cells","article_processing_charge":"No","year":"2024","author":[{"orcid":"0000-0002-2253-8771","full_name":"Lembo, Sergio","first_name":"Sergio","last_name":"Lembo","id":"d993a7b2-292f-11ed-aaac-fb045a912e31"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","full_name":"Sixt, Michael K","first_name":"Michael K","orcid":"0000-0002-6620-9179"}],"status":"public","date_created":"2024-06-30T22:01:05Z","publication_status":"published","publisher":"Springer Nature"},{"article_type":"original","month":"07","file":[{"checksum":"0dc9f5a6422b8a49a79026900f349ee5","creator":"chafner","content_type":"application/pdf","success":1,"date_created":"2024-07-05T12:05:17Z","file_size":7225150,"file_id":"17204","date_updated":"2024-07-05T12:05:17Z","access_level":"open_access","relation":"main_file","file_name":"sif-final.pdf"},{"file_name":"sif-supp-final.pdf","relation":"supplementary_material","access_level":"open_access","date_updated":"2024-07-05T12:06:03Z","file_id":"17205","content_type":"application/pdf","file_size":397262,"date_created":"2024-07-05T12:06:03Z","creator":"chafner","checksum":"cde433c6a40688d5f1187fb5721f6f94"},{"title":"Submission Video","file_name":"sif-video-final.mp4","relation":"supplementary_material","access_level":"open_access","date_updated":"2024-07-17T09:29:13Z","file_id":"17276","content_type":"video/mp4","date_created":"2024-07-17T09:29:13Z","file_size":170001305,"creator":"chafner","checksum":"c0457a09c2ab9a1c2935c995dcc84907"}],"_id":"17203","intvolume":" 43","abstract":[{"text":"The behavior of a rigid body primarily depends on its mass moments, which consist of the mass, center of mass, and moments of inertia. It is possible to manipulate these quantities without altering the geometric appearance of an object by introducing cavities in its interior. Algorithms that find cavities of suitable shapes and sizes have enabled the computational design of spinning tops, yo-yos, wheels, buoys, and statically balanced objects. Previous work is based, for example, on topology optimization on voxel grids, which introduces a large number of optimization variables and box constraints, or offset surface computation, which cannot guarantee that solutions to a feasible problem will always be found.\r\n\r\nIn this work, we provide a mathematical analysis of constrained topology optimization problems that depend only on mass moments. This class of problems covers, among others, all applications mentioned above. Our main result is to show that no matter the outer shape of the rigid body to be optimized or the optimization objective and constraints considered, the optimal solution always features a quadric-shaped interface between material and cavities. This proves that optimal interfaces are always ellipsoids, hyperboloids, paraboloids, or one of a few degenerate cases, such as planes.\r\n\r\nThis insight lets us replace a difficult topology optimization problem with a provably equivalent non-linear equation system in a small number (<10) of variables, which represent the coefficients of the quadric. This system can be solved in a few seconds for most examples, provides insights into the geometric structure of many specific applications, and lets us describe their solution properties. Finally, our method integrates seamlessly into modern fabrication workflows because our solutions are analytical surfaces that are native to the CAD domain.","lang":"eng"}],"publication":"Transactions on Graphics","department":[{"_id":"ChWo"}],"keyword":["Topology Optimization","Mass Moments","Computational Geometry"],"volume":43,"date_updated":"2025-09-08T08:29:09Z","external_id":{"isi":["001289270900045"]},"oa":1,"corr_author":"1","has_accepted_license":"1","doi":"10.1145/3658194","publication_identifier":{"eissn":["1557-7368"],"issn":["0730-0301"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_number":"78","citation":{"ieee":"C. Hafner, M. Ly, and C. Wojtan, “Spin-it faster: Quadrics solve all topology optimization problems that depend only on mass moments,” Transactions on Graphics, vol. 43, no. 4. Association for Computing Machinery, 2024.","ista":"Hafner C, Ly M, Wojtan C. 2024. Spin-it faster: Quadrics solve all topology optimization problems that depend only on mass moments. Transactions on Graphics. 43(4), 78.","mla":"Hafner, Christian, et al. “Spin-It Faster: Quadrics Solve All Topology Optimization Problems That Depend Only on Mass Moments.” Transactions on Graphics, vol. 43, no. 4, 78, Association for Computing Machinery, 2024, doi:10.1145/3658194.","apa":"Hafner, C., Ly, M., & Wojtan, C. (2024). Spin-it faster: Quadrics solve all topology optimization problems that depend only on mass moments. Transactions on Graphics. Denver, Colorado: Association for Computing Machinery. https://doi.org/10.1145/3658194","chicago":"Hafner, Christian, Mickaël Ly, and Chris Wojtan. “Spin-It Faster: Quadrics Solve All Topology Optimization Problems That Depend Only on Mass Moments.” Transactions on Graphics. Association for Computing Machinery, 2024. https://doi.org/10.1145/3658194.","ama":"Hafner C, Ly M, Wojtan C. Spin-it faster: Quadrics solve all topology optimization problems that depend only on mass moments. Transactions on Graphics. 2024;43(4). doi:10.1145/3658194","short":"C. Hafner, M. Ly, C. Wojtan, Transactions on Graphics 43 (2024)."},"file_date_updated":"2024-07-17T09:29:13Z","quality_controlled":"1","conference":{"end_date":"2024-08-01","start_date":"2024-07-28","location":"Denver, Colorado"},"ddc":["516"],"day":"01","type":"journal_article","scopus_import":"1","isi":1,"language":[{"iso":"eng"}],"date_published":"2024-07-01T00:00:00Z","issue":"4","publisher":"Association for Computing Machinery","publication_status":"published","project":[{"grant_number":"101045083","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088"}],"acknowledgement":"We thank Gianmarco Cherchi for his help in tailoring the Mesh Booleans code for this project, Stefan Jeschke for his help with the photographs, Malina Strugaru and Aleksei Kalinov for their help with the samples, and the anonymous reviewers as well as the members of the ISTA Visual Computing Group for their feedback. This project was funded in part by the European Research Council (ERC Consolidator Grant 101045083 CoDiNA).","status":"public","date_created":"2024-07-05T12:08:57Z","author":[{"full_name":"Hafner, Christian","first_name":"Christian","id":"400429CC-F248-11E8-B48F-1D18A9856A87","last_name":"Hafner"},{"first_name":"Mickaël","full_name":"Ly, Mickaël","id":"6340d7f0-b48d-11eb-b10d-b7487e71d9f1","last_name":"Ly"},{"orcid":"0000-0001-6646-5546","first_name":"Christopher J","full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","last_name":"Wojtan"}],"year":"2024","article_processing_charge":"Yes (via OA deal)","title":"Spin-it faster: Quadrics solve all topology optimization problems that depend only on mass moments","oa_version":"Published Version"},{"citation":{"ama":"Fouqueau L, Polechova J. Eco-evolutionary dynamics in changing environments: Integrating theory with data. Journal of evolutionary biology. 2024;37(6):579-587. doi:10.1093/jeb/voae067","short":"L. Fouqueau, J. Polechova, Journal of Evolutionary Biology 37 (2024) 579–587.","ieee":"L. Fouqueau and J. Polechova, “Eco-evolutionary dynamics in changing environments: Integrating theory with data,” Journal of evolutionary biology, vol. 37, no. 6. Oxford University Press, pp. 579–587, 2024.","mla":"Fouqueau, Louise, and Jitka Polechova. “Eco-Evolutionary Dynamics in Changing Environments: Integrating Theory with Data.” Journal of Evolutionary Biology, vol. 37, no. 6, Oxford University Press, 2024, pp. 579–87, doi:10.1093/jeb/voae067.","apa":"Fouqueau, L., & Polechova, J. (2024). Eco-evolutionary dynamics in changing environments: Integrating theory with data. Journal of Evolutionary Biology. Oxford University Press. https://doi.org/10.1093/jeb/voae067","ista":"Fouqueau L, Polechova J. 2024. Eco-evolutionary dynamics in changing environments: Integrating theory with data. Journal of evolutionary biology. 37(6), 579–587.","chicago":"Fouqueau, Louise, and Jitka Polechova. “Eco-Evolutionary Dynamics in Changing Environments: Integrating Theory with Data.” Journal of Evolutionary Biology. Oxford University Press, 2024. https://doi.org/10.1093/jeb/voae067."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1093/jeb/voae067"}],"quality_controlled":"1","doi":"10.1093/jeb/voae067","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_identifier":{"eissn":["1420-9101"]},"external_id":{"isi":["001258359900001"],"pmid":["38941551"]},"date_updated":"2025-09-08T08:08:00Z","oa":1,"intvolume":" 37","_id":"17207","month":"06","article_type":"letter_note","volume":37,"department":[{"_id":"NiBa"}],"publication":"Journal of evolutionary biology","year":"2024","author":[{"orcid":"0000-0003-0371-9339","full_name":"Fouqueau, Louise","first_name":"Louise","id":"1676e173-8143-11ed-8927-fe165216a93f","last_name":"Fouqueau"},{"first_name":"Jitka","full_name":"Polechova, Jitka","id":"3BBFB084-F248-11E8-B48F-1D18A9856A87","last_name":"Polechova","orcid":"0000-0003-0951-3112"}],"pmid":1,"oa_version":"Published Version","title":"Eco-evolutionary dynamics in changing environments: Integrating theory with data","article_processing_charge":"No","publication_status":"published","publisher":"Oxford University Press","date_created":"2024-07-07T22:01:04Z","status":"public","acknowledgement":"This research was funded by the Austrian Science Fund (FWF), project doi: 10.55776/P32896, Institutional Identifier: 501100002428, grant number: P32896 and L.F. acknowledges the support of the NOMIS-ISTA Fellowship Program.\r\nWe would like to thank Nick Barton, Roger Butlin, Stuart Baird, Patrik Nosil, and Jason Sexton for their insightful comments on the earlier drafts, and to John Carchrae for his valuable contribution in refining phrasing and enhancing clarity. For open access purposes, the author has applied a CC BY public copyright license to any author-accepted manuscript version arising from this submission.","project":[{"_id":"c08d3278-5a5b-11eb-8a69-fdb09b55f4b8","grant_number":"P32896","name":"Causes and consequences of population fragmentation"},{"name":"NOMIS Fellowship Program","_id":"9B861AAC-BA93-11EA-9121-9846C619BF3A"}],"date_published":"2024-06-28T00:00:00Z","issue":"6","type":"journal_article","page":"579-587","day":"28","language":[{"iso":"eng"}],"isi":1,"scopus_import":"1"},{"keyword":["physical simulation","frictional contact","rigid body mechanics","non-smooth dynamics"],"department":[{"_id":"GradSch"},{"_id":"ChWo"}],"publication":"Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers '24","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."}],"_id":"17214","file":[{"file_name":"sig24_friction_authors.pdf","date_updated":"2024-07-10T11:03:14Z","access_level":"open_access","relation":"main_file","success":1,"date_created":"2024-07-10T11:03:14Z","file_size":47309472,"content_type":"application/pdf","file_id":"17215","checksum":"b8b203ed09e3995ba0d7e6a76288663a","creator":"yichen"},{"date_updated":"2024-07-10T11:03:12Z","access_level":"open_access","relation":"main_file","file_name":"sig24_friction_supplementary.pdf","checksum":"89d81b397b4b6469d828808a68b70820","creator":"yichen","date_created":"2024-07-10T11:03:12Z","file_size":10518286,"success":1,"content_type":"application/pdf","file_id":"17216"},{"content_type":"video/mp4","date_created":"2024-07-10T11:03:51Z","file_size":71789192,"success":1,"file_id":"17217","checksum":"7123deed34a5456810e7b5336a31c657","creator":"yichen","file_name":"friction_paper_extra_video_finished.mp4","access_level":"open_access","date_updated":"2024-07-10T11:03:51Z","relation":"main_file"},{"creator":"yichen","checksum":"e606fc1ae8f2610ce3b4421566800b45","file_id":"17218","content_type":"video/mp4","date_created":"2024-07-10T11:03:58Z","file_size":280610763,"success":1,"relation":"main_file","date_updated":"2024-07-10T11:03:58Z","access_level":"open_access","file_name":"friction_paper_video_finished.mp4"}],"month":"07","corr_author":"1","oa":1,"external_id":{"isi":["001282218200091"]},"date_updated":"2025-09-08T08:54:38Z","publication_identifier":{"isbn":["9798400705250"]},"doi":"10.1145/3641519.3657485","has_accepted_license":"1","conference":{"end_date":"2024-08-01","name":"SIGGRAPH: Computer Graphics and Interactive Techniques Conference","start_date":"2024-07-28","location":"Denver, United States"},"quality_controlled":"1","file_date_updated":"2024-07-10T11:03:58Z","citation":{"ama":"Chen Y-L, Ly M, Wojtan C. Primal-dual non-smooth friction for rigid body animation. In: Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers ’24. Association for Computing Machinery; 2024. doi:10.1145/3641519.3657485","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.","ieee":"Y.-L. Chen, M. Ly, and C. Wojtan, “Primal-dual non-smooth friction for rigid body animation,” in Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers ’24, Denver, United States, 2024.","chicago":"Chen, Yi-Lu, Mickaël Ly, and Chris Wojtan. “Primal-Dual Non-Smooth Friction for Rigid Body Animation.” In Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers ’24. Association for Computing Machinery, 2024. https://doi.org/10.1145/3641519.3657485.","apa":"Chen, Y.-L., Ly, M., & Wojtan, C. (2024). Primal-dual non-smooth friction for rigid body animation. In Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers ’24. Denver, United States: Association for Computing Machinery. https://doi.org/10.1145/3641519.3657485","mla":"Chen, Yi-Lu, et al. “Primal-Dual Non-Smooth Friction for Rigid Body Animation.” Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers ’24, Association for Computing Machinery, 2024, doi:10.1145/3641519.3657485.","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."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"isi":1,"scopus_import":"1","type":"conference","day":"01","ddc":["621","531","006"],"date_published":"2024-07-01T00:00:00Z","status":"public","date_created":"2024-07-10T11:06:20Z","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).","project":[{"name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","grant_number":"101045083","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088"}],"publication_status":"published","publisher":"Association for Computing Machinery","oa_version":"Published Version","article_processing_charge":"Yes (via OA deal)","title":"Primal-dual non-smooth friction for rigid body animation","year":"2024","author":[{"last_name":"Chen","id":"0b467602-dbcd-11ea-9d1d-ed480aa46b70","first_name":"Yi-Lu","full_name":"Chen, Yi-Lu"},{"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","first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","last_name":"Wojtan"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://doi.org/10.3934/dcds.2024059"}],"citation":{"ama":"Fiorebe C. Examples of projective billiards with open sets of periodic orbits. Discrete and Continuous Dynamical Systems- Series A. 2024;44(11):3287-3301. doi:10.3934/dcds.2024059","short":"C. Fiorebe, Discrete and Continuous Dynamical Systems- Series A 44 (2024) 3287–3301.","ieee":"C. Fiorebe, “Examples of projective billiards with open sets of periodic orbits,” Discrete and Continuous Dynamical Systems- Series A, vol. 44, no. 11. American Institute of Mathematical Sciences, pp. 3287–3301, 2024.","chicago":"Fiorebe, Corentin. “Examples of Projective Billiards with Open Sets of Periodic Orbits.” Discrete and Continuous Dynamical Systems- Series A. American Institute of Mathematical Sciences, 2024. https://doi.org/10.3934/dcds.2024059.","mla":"Fiorebe, Corentin. “Examples of Projective Billiards with Open Sets of Periodic Orbits.” Discrete and Continuous Dynamical Systems- Series A, vol. 44, no. 11, American Institute of Mathematical Sciences, 2024, pp. 3287–301, doi:10.3934/dcds.2024059.","apa":"Fiorebe, C. (2024). Examples of projective billiards with open sets of periodic orbits. Discrete and Continuous Dynamical Systems- Series A. American Institute of Mathematical Sciences. https://doi.org/10.3934/dcds.2024059","ista":"Fiorebe C. 2024. Examples of projective billiards with open sets of periodic orbits. Discrete and Continuous Dynamical Systems- Series A. 44(11), 3287–3301."},"quality_controlled":"1","OA_type":"free access","doi":"10.3934/dcds.2024059","publication_identifier":{"eissn":["1553-5231"],"issn":["1078-0947"]},"external_id":{"isi":["001230091000001"]},"date_updated":"2025-10-16T11:53:22Z","oa":1,"corr_author":"1","article_type":"original","month":"11","abstract":[{"text":"In the class of projective billiards, which contains the usual billiards, we exhibit counter-examples to Ivrii's conjecture, which states that in any planar billiard with smooth boundary the set of periodic orbits has zero measure. The counter-examples are polygons admitting a 2-parameters family of n-periodic orbits, with n being either 3 or any even integer greater than 4.","lang":"eng"}],"_id":"17231","intvolume":" 44","department":[{"_id":"VaKa"}],"publication":"Discrete and Continuous Dynamical Systems- Series A","volume":44,"year":"2024","author":[{"first_name":"Corentin","full_name":"Fiorebe, Corentin","last_name":"Fiorebe","id":"06619f18-9070-11eb-847d-d1ee780bd88b"}],"oa_version":"Published Version","title":"Examples of projective billiards with open sets of periodic orbits","article_processing_charge":"No","publisher":"American Institute of Mathematical Sciences","publication_status":"published","date_created":"2024-07-14T22:01:10Z","status":"public","date_published":"2024-11-01T00:00:00Z","issue":"11","type":"journal_article","day":"01","page":"3287-3301","scopus_import":"1","language":[{"iso":"eng"}],"isi":1},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"doi":"10.21769/BioProtoc.5029","has_accepted_license":"1","publication_identifier":{"eissn":["2331-8325"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2024-07-16T06:16:11Z","citation":{"short":"Z. LI, J. Huard, E.M. Bayer, V. Wattelet-Boyer, Bio-Protocol 14 (2024).","ama":"LI Z, Huard J, Bayer EM, Wattelet-Boyer V. Versatile cloning strategy for efficient multigene editing in Arabidopsis. Bio-protocol. 2024;14(13). doi:10.21769/BioProtoc.5029","mla":"LI, ZIQIANG, et al. “Versatile Cloning Strategy for Efficient Multigene Editing in Arabidopsis.” Bio-Protocol, vol. 14, no. 13, e5029, Bio-Protocol, 2024, doi:10.21769/BioProtoc.5029.","ista":"LI Z, Huard J, Bayer EM, Wattelet-Boyer V. 2024. Versatile cloning strategy for efficient multigene editing in Arabidopsis. Bio-protocol. 14(13), e5029.","apa":"LI, Z., Huard, J., Bayer, E. M., & Wattelet-Boyer, V. (2024). Versatile cloning strategy for efficient multigene editing in Arabidopsis. Bio-Protocol. Bio-Protocol. https://doi.org/10.21769/BioProtoc.5029","chicago":"LI, ZIQIANG, Jennifer Huard, Emmanuelle M. Bayer, and Valérie Wattelet-Boyer. “Versatile Cloning Strategy for Efficient Multigene Editing in Arabidopsis.” Bio-Protocol. Bio-Protocol, 2024. https://doi.org/10.21769/BioProtoc.5029.","ieee":"Z. LI, J. Huard, E. M. Bayer, and V. Wattelet-Boyer, “Versatile cloning strategy for efficient multigene editing in Arabidopsis,” Bio-protocol, vol. 14, no. 13. Bio-Protocol, 2024."},"article_number":"e5029","quality_controlled":"1","article_type":"original","month":"07","intvolume":" 14","_id":"17233","abstract":[{"lang":"eng","text":"CRISPR-Cas9 technology has become an essential tool for plant genome editing. Recent advancements have significantly improved the ability to target multiple genes simultaneously within the same genetic background through various strategies. Additionally, there has been significant progress in developing methods for inducible or tissue-specific editing. These advancements offer numerous possibilities for tailored genome modifications. Building upon existing research, we have developed an optimized and modular strategy allowing the targeting of several genes simultaneously in combination with the synchronized expression of the Cas9 endonuclease in the egg cell. This system allows significant editing efficiency while avoiding mosaicism. In addition, the versatile system we propose allows adaptation to inducible and/or tissue-specific edition according to the promoter chosen to drive the expression of the Cas9 gene. Here, we describe a step-by-step protocol for generating the binary vector necessary for establishing Arabidopsis edited lines using a versatile cloning strategy that combines Gateway® and Golden Gate technologies. We describe a versatile system that allows the cloning of as many guides as needed to target DNA, which can be multiplexed into a polycistronic gene and combined in the same construct with sequences for the expression of the Cas9 endonuclease. The expression of Cas9 is controlled by selecting from among a collection of promoters, including constitutive, inducible, ubiquitous, or tissue-specific promoters. Only one vector containing the polycistronic gene (tRNA-sgRNA) needs to be constructed. For that, sgRNA (composed of protospacers chosen to target the gene of interest and sgRNA scaffold) is cloned in tandem with the pre-tRNA sequence. Then, a single recombination reaction is required to assemble the promoter, the zCas9 coding sequence, and the tRNA-gRNA polycistronic gene. Each element is cloned in an entry vector and finally assembled according to the Multisite Gateway® Technology. Here, we detail the process to express zCas9 under the control of egg cell promoter fused to enhancer sequence (EC1.2en-EC1.1p) and to simultaneously target two multiple C2 domains and transmembrane region protein genes (MCTP3 and MCTP4, respectively at3g57880 and at1g51570), using one or two sgRNA per gene."}],"file":[{"file_name":"2024_BioProtocol_Li.pdf","date_updated":"2024-07-16T06:16:11Z","access_level":"open_access","relation":"main_file","date_created":"2024-07-16T06:16:11Z","file_size":2896048,"success":1,"content_type":"application/pdf","file_id":"17242","checksum":"c8671c0ad483da6407cb16cc3fef1990","creator":"dernst"}],"department":[{"_id":"MiSi"}],"publication":"Bio-protocol","volume":14,"external_id":{"pmid":["39007160"]},"date_updated":"2025-03-06T10:28:18Z","oa":1,"publisher":"Bio-Protocol","publication_status":"published","date_created":"2024-07-14T22:01:11Z","status":"public","acknowledgement":"This work was supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (project 772103-BRIDGING to E.M.B.).","year":"2024","author":[{"first_name":"Ziqiang","full_name":"Li, Ziqiang","id":"922e68bb-1727-11ee-857c-966e8cc1b6c3","last_name":"Li"},{"first_name":"Jennifer","full_name":"Huard, Jennifer","last_name":"Huard"},{"last_name":"Bayer","first_name":"Emmanuelle M.","full_name":"Bayer, Emmanuelle M."},{"full_name":"Wattelet-Boyer, Valérie","first_name":"Valérie","last_name":"Wattelet-Boyer"}],"oa_version":"Published Version","article_processing_charge":"Yes","title":"Versatile cloning strategy for efficient multigene editing in Arabidopsis","pmid":1,"type":"journal_article","ddc":["570"],"day":"05","scopus_import":"1","language":[{"iso":"eng"}],"date_published":"2024-07-05T00:00:00Z","issue":"13"},{"arxiv":1,"oa_version":"Published Version","title":"RUBIES: Evolved stellar populations with extended formation histories at z ∼ 7-8 in candidate massive galaxies identified with JWST/NIRSpec","article_processing_charge":"Yes","year":"2024","author":[{"last_name":"Wang","first_name":"Bingjie","full_name":"Wang, Bingjie"},{"first_name":"Joel","full_name":"Leja, Joel","last_name":"Leja"},{"full_name":"De Graaff, Anna","first_name":"Anna","last_name":"De Graaff"},{"first_name":"Gabriel B.","full_name":"Brammer, Gabriel B.","last_name":"Brammer"},{"full_name":"Weibel, Andrea","first_name":"Andrea","last_name":"Weibel"},{"last_name":"Van Dokkum","full_name":"Van Dokkum, Pieter","first_name":"Pieter"},{"first_name":"Josephine F.W.","full_name":"Baggen, Josephine F.W.","last_name":"Baggen"},{"first_name":"Katherine A.","full_name":"Suess, Katherine A.","last_name":"Suess"},{"last_name":"Greene","first_name":"Jenny E.","full_name":"Greene, Jenny E."},{"full_name":"Bezanson, Rachel","first_name":"Rachel","last_name":"Bezanson"},{"last_name":"Cleri","first_name":"Nikko J.","full_name":"Cleri, Nikko J."},{"full_name":"Hirschmann, Michaela","first_name":"Michaela","last_name":"Hirschmann"},{"full_name":"Labbé, Ivo","first_name":"Ivo","last_name":"Labbé"},{"full_name":"Matthee, Jorryt J","first_name":"Jorryt J","last_name":"Matthee","id":"7439a258-f3c0-11ec-9501-9df22fe06720","orcid":"0000-0003-2871-127X"},{"last_name":"Mcconachie","full_name":"Mcconachie, Ian","first_name":"Ian"},{"last_name":"Naidu","first_name":"Rohan P.","full_name":"Naidu, Rohan P."},{"full_name":"Nelson, Erica","first_name":"Erica","last_name":"Nelson"},{"first_name":"Pascal A.","full_name":"Oesch, Pascal A.","last_name":"Oesch"},{"full_name":"Setton, David J.","first_name":"David J.","last_name":"Setton"},{"last_name":"Williams","full_name":"Williams, Christina C.","first_name":"Christina C."}],"status":"public","date_created":"2024-07-14T22:01:11Z","acknowledgement":"We thank the anonymous referee for the helpful comments. B.W. and J.L. acknowledge support from JWST-GO04233.009-A. The Cosmic Dawn Center is funded by the Danish National Research Foundation (DNRF) under grant No. 140. This research was supported by the International Space Science Institute (ISSI) in Bern, through ISSI International Team project No. 562 (First Light at Cosmic Dawn: Exploiting the James Webb Space Telescope Revolution). This work is based in part on observations made with the NASA/ESA/CSA James Webb Space Telescope. The data were obtained from the Mikulski Archive for Space Telescopes at the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-03127 for JWST. The JWST data presented in this Letter were obtained from the Mikulski Archive for Space Telescopes (MAST) at the Space Telescope Science Institute. The specific observations analyzed can be accessed via doi:10.17909/3a4n-9p88. Computations for this research were performed on the Pennsylvania State University’s Institute for Computational and Data Sciences’ Roar supercomputer. This publication made use of the NASA Astrophysical Data System for bibliographic information. \r\nFacilities: HST (ACS, WFC3), JWST (NIRCam, NIRSpec). Software: Astropy (Astropy Collaboration et al. 2013, 2018, 2022), dynesty (Speagle 2020), EAzY (Brammer et al. 2008),\r\nemcee (Foreman-Mackey et al. 2013), Matplotlib (Hunter 2007), msaexp (Brammer 2023b), msafit (de Graaff et al. 2024a), NumPy (Harris et al. 2020), Prospector (Johnson et al. 2021), Python-FSPS (Johnson et al. 2023).","publication_status":"published","publisher":"IOP Publishing","issue":"1","date_published":"2024-07-01T00:00:00Z","language":[{"iso":"eng"}],"isi":1,"scopus_import":"1","type":"journal_article","day":"01","ddc":["520"],"quality_controlled":"1","citation":{"ama":"Wang B, Leja J, De Graaff A, et al. RUBIES: Evolved stellar populations with extended formation histories at z ∼ 7-8 in candidate massive galaxies identified with JWST/NIRSpec. Astrophysical Journal Letters. 2024;969(1). doi:10.3847/2041-8213/ad55f7","short":"B. Wang, J. Leja, A. De Graaff, G.B. Brammer, A. Weibel, P. Van Dokkum, J.F.W. Baggen, K.A. Suess, J.E. Greene, R. Bezanson, N.J. Cleri, M. Hirschmann, I. Labbé, J.J. Matthee, I. Mcconachie, R.P. Naidu, E. Nelson, P.A. Oesch, D.J. Setton, C.C. Williams, Astrophysical Journal Letters 969 (2024).","ieee":"B. Wang et al., “RUBIES: Evolved stellar populations with extended formation histories at z ∼ 7-8 in candidate massive galaxies identified with JWST/NIRSpec,” Astrophysical Journal Letters, vol. 969, no. 1. IOP Publishing, 2024.","chicago":"Wang, Bingjie, Joel Leja, Anna De Graaff, Gabriel B. Brammer, Andrea Weibel, Pieter Van Dokkum, Josephine F.W. Baggen, et al. “RUBIES: Evolved Stellar Populations with Extended Formation Histories at z ∼ 7-8 in Candidate Massive Galaxies Identified with JWST/NIRSpec.” Astrophysical Journal Letters. IOP Publishing, 2024. https://doi.org/10.3847/2041-8213/ad55f7.","mla":"Wang, Bingjie, et al. “RUBIES: Evolved Stellar Populations with Extended Formation Histories at z ∼ 7-8 in Candidate Massive Galaxies Identified with JWST/NIRSpec.” Astrophysical Journal Letters, vol. 969, no. 1, L13, IOP Publishing, 2024, doi:10.3847/2041-8213/ad55f7.","ista":"Wang B, Leja J, De Graaff A, Brammer GB, Weibel A, Van Dokkum P, Baggen JFW, Suess KA, Greene JE, Bezanson R, Cleri NJ, Hirschmann M, Labbé I, Matthee JJ, Mcconachie I, Naidu RP, Nelson E, Oesch PA, Setton DJ, Williams CC. 2024. RUBIES: Evolved stellar populations with extended formation histories at z ∼ 7-8 in candidate massive galaxies identified with JWST/NIRSpec. Astrophysical Journal Letters. 969(1), L13.","apa":"Wang, B., Leja, J., De Graaff, A., Brammer, G. B., Weibel, A., Van Dokkum, P., … Williams, C. C. (2024). RUBIES: Evolved stellar populations with extended formation histories at z ∼ 7-8 in candidate massive galaxies identified with JWST/NIRSpec. Astrophysical Journal Letters. IOP Publishing. https://doi.org/10.3847/2041-8213/ad55f7"},"file_date_updated":"2024-07-16T06:24:29Z","article_number":"L13","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_identifier":{"eissn":["2041-8213"],"issn":["2041-8205"]},"doi":"10.3847/2041-8213/ad55f7","has_accepted_license":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"oa":1,"external_id":{"isi":["001257903200001"],"arxiv":["2405.01473"]},"date_updated":"2025-09-08T08:10:21Z","volume":969,"DOAJ_listed":"1","department":[{"_id":"JoMa"}],"publication":"Astrophysical Journal Letters","intvolume":" 969","_id":"17234","abstract":[{"lang":"eng","text":"The identification of red, apparently massive galaxies at z > 7 in early James Webb Space Telescope (JWST) photometry suggests a strongly accelerated time line compared to standard models of galaxy growth. A major uncertainty in the interpretation is whether the red colors are caused by evolved stellar populations, dust, or other effects such as emission lines or active galactic nuclei (AGNs). Here we show that three of the massive galaxy candidates at z = 6.7–8.4 have prominent Balmer breaks in JWST/NIRSpec spectroscopy from the RUBIES program. The Balmer breaks demonstrate unambiguously that stellar emission dominates at λrest = 0.4 μm and require formation histories extending hundreds of millions of years into the past in galaxies only 600–800 Myr after the big bang. Two of the three galaxies also show broad Balmer lines, with Hβ FWHM > 2500 km s−1, suggesting that dust-reddened AGNs contribute to, or even dominate, the spectral energy distributions of these galaxies at λrest ≳ 0.6 μm. All three galaxies have relatively narrow [O iii] lines, seemingly ruling out a high-mass interpretation if the lines arise in dynamically relaxed, inclined disks. Yet the inferred masses also remain highly uncertain. We model the high-quality spectra using Prospector to decompose the continuum into stellar and AGN components and explore limiting cases in stellar/AGN contribution. This produces a wide range of possible stellar masses, spanning M⋆ ∼ 109−1011M⊙. Nevertheless, all fits suggest a very early and rapid formation, most of which follow with a truncation in star formation. Potential origins and evolutionary tracks for these objects are discussed, from the cores of massive galaxies to low-mass galaxies with overmassive black holes. Intriguingly, we find all of these explanations to be incomplete; deeper and redder data are needed to understand the physics of these systems."}],"file":[{"file_id":"17243","content_type":"application/pdf","date_created":"2024-07-16T06:24:29Z","success":1,"file_size":3273303,"creator":"dernst","checksum":"bb1a6725586df12e745d091b5778bb2b","file_name":"2024_AstrophysicalJourn_Wang.pdf","relation":"main_file","access_level":"open_access","date_updated":"2024-07-16T06:24:29Z"}],"month":"07","article_type":"original"}]