--- DOAJ_listed: '1' OA_place: publisher OA_type: gold _id: '18856' abstract: - lang: eng text: This research is aimed to solve the tweet/user geolocation prediction task and provide a flexible methodology for the geo-tagging of textual big data. The suggested approach implements neural networks for natural language processing (NLP) to estimate the location as coordinate pairs (longitude, latitude) and two-dimensional Gaussian Mixture Models (GMMs). The scope of proposed models has been finetuned on a Twitter dataset using pretrained Bidirectional Encoder Representations from Transformers (BERT) as base models. Performance metrics show a median error of fewer than 30 km on a worldwide-level, and fewer than 15 km on the US-level datasets for the models trained and evaluated on text features of tweets' content and metadata context. Our source code and data are available at https://github.com/K4TEL/geo-twitter.git. acknowledgement: The authors acknowledge the Institute of Science and Technology (ISTA) for their material support and for granting access to the Twitter database archive, which was essential for the research. article_processing_charge: Yes article_type: original author: - first_name: Kateryna full_name: Lutsai, Kateryna last_name: Lutsai - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: Lutsai K, Lampert C. Predicting the geolocation of tweets using transformer models on customized data. Journal of Spatial Information Science. 2024;(29):69-99. doi:10.5311/JOSIS.2024.29.295 apa: Lutsai, K., & Lampert, C. (2024). Predicting the geolocation of tweets using transformer models on customized data. Journal of Spatial Information Science. University of Maine. https://doi.org/10.5311/JOSIS.2024.29.295 chicago: Lutsai, Kateryna, and Christoph Lampert. “Predicting the Geolocation of Tweets Using Transformer Models on Customized Data.” Journal of Spatial Information Science. University of Maine, 2024. https://doi.org/10.5311/JOSIS.2024.29.295. ieee: K. Lutsai and C. Lampert, “Predicting the geolocation of tweets using transformer models on customized data,” Journal of Spatial Information Science, no. 29. University of Maine, pp. 69–99, 2024. ista: Lutsai K, Lampert C. 2024. Predicting the geolocation of tweets using transformer models on customized data. Journal of Spatial Information Science. (29), 69–99. mla: Lutsai, Kateryna, and Christoph Lampert. “Predicting the Geolocation of Tweets Using Transformer Models on Customized Data.” Journal of Spatial Information Science, no. 29, University of Maine, 2024, pp. 69–99, doi:10.5311/JOSIS.2024.29.295. short: K. Lutsai, C. Lampert, Journal of Spatial Information Science (2024) 69–99. corr_author: '1' date_created: 2025-01-19T23:01:53Z date_published: 2024-12-26T00:00:00Z date_updated: 2025-06-05T13:47:12Z day: '26' ddc: - '500' department: - _id: ChLa doi: 10.5311/JOSIS.2024.29.295 file: - access_level: open_access checksum: b82413f00398ffb5168e8e747571a98d content_type: application/pdf creator: dernst date_created: 2025-01-20T08:41:10Z date_updated: 2025-01-20T08:41:10Z file_id: '18857' file_name: 2024_JourSpatialInfoScience_Lutsai.pdf file_size: 7250655 relation: main_file success: 1 file_date_updated: 2025-01-20T08:41:10Z has_accepted_license: '1' issue: '29' language: - iso: eng license: https://creativecommons.org/licenses/by/3.0/ month: '12' oa: 1 oa_version: Published Version page: 69-99 publication: Journal of Spatial Information Science publication_identifier: eissn: - 1948-660X publication_status: published publisher: University of Maine quality_controlled: '1' related_material: link: - relation: software url: https://github.com/K4TEL/geo-twitter.git scopus_import: '1' status: public title: Predicting the geolocation of tweets using transformer models on customized data tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode name: Creative Commons Attribution 3.0 Unported (CC BY 3.0) short: CC BY (3.0) type: journal_article user_id: 68b8ca59-c5b3-11ee-8790-cd641c68093d year: '2024' ... --- OA_type: closed access _id: '18867' abstract: - lang: eng text: 'In an accreting X-ray pulsar, a neutron star accretes matter from a companion star through an accretion disk. The magnetic field of the rotating neutron star disrupts the inner edge of the disk, funnelling the gas to flow onto the poles on its surface. Hercules X-1 is a prototypical persistent X-ray pulsar about 7 kpc from Earth. Its emission varies on three distinct timescales: the neutron star rotates every 1.2 s, it is eclipsed by its companion each 1.7 d, and the system exhibits a superorbital period of 35 d, which has remained stable since its discovery. Several lines of evidence point to the source of this variation as the precession of the accretion disk or that of the neutron star. Despite the many hints over the past 50 yr, the precession of the neutron star itself has yet not been confirmed or refuted. X-ray polarization measurements (probing the spin geometry of Her X-1) with the Imaging X-ray Polarimetry Explorer suggest that free precession of the neutron star crust sets the 35 d period; this has the important implication that its crust is somewhat asymmetric by a few parts per ten million.' article_processing_charge: No article_type: original author: - first_name: Jeremy full_name: Heyl, Jeremy last_name: Heyl - first_name: Victor full_name: Doroshenko, Victor last_name: Doroshenko - first_name: Denis full_name: González-Caniulef, Denis last_name: González-Caniulef - first_name: Ilaria full_name: Caiazzo, Ilaria id: 8ae5b6e7-2a03-11ee-914d-b58ed7a3b47d last_name: Caiazzo orcid: 0000-0002-4770-5388 - first_name: Juri full_name: Poutanen, Juri last_name: Poutanen - first_name: Alexander full_name: Mushtukov, Alexander last_name: Mushtukov - first_name: Sergey S. full_name: Tsygankov, Sergey S. last_name: Tsygankov - first_name: Demet full_name: Kirmizibayrak, Demet last_name: Kirmizibayrak - first_name: Matteo full_name: Bachetti, Matteo last_name: Bachetti - first_name: George G. full_name: Pavlov, George G. last_name: Pavlov - first_name: Sofia V. full_name: Forsblom, Sofia V. last_name: Forsblom - first_name: Christian full_name: Malacaria, Christian last_name: Malacaria - first_name: Valery F. full_name: Suleimanov, Valery F. last_name: Suleimanov - first_name: Iván full_name: Agudo, Iván last_name: Agudo - first_name: Lucio Angelo full_name: Antonelli, Lucio Angelo last_name: Antonelli - first_name: Luca full_name: Baldini, Luca last_name: Baldini - first_name: Wayne H. full_name: Baumgartner, Wayne H. last_name: Baumgartner - first_name: Ronaldo full_name: Bellazzini, Ronaldo last_name: Bellazzini - first_name: Stefano full_name: Bianchi, Stefano last_name: Bianchi - first_name: Stephen D. full_name: Bongiorno, Stephen D. last_name: Bongiorno - first_name: Raffaella full_name: Bonino, Raffaella last_name: Bonino - first_name: Alessandro full_name: Brez, Alessandro last_name: Brez - first_name: Niccolò full_name: Bucciantini, Niccolò last_name: Bucciantini - first_name: Fiamma full_name: Capitanio, Fiamma last_name: Capitanio - first_name: Simone full_name: Castellano, Simone last_name: Castellano - first_name: Elisabetta full_name: Cavazzuti, Elisabetta last_name: Cavazzuti - first_name: Chien-Ting full_name: Chen, Chien-Ting last_name: Chen - first_name: Stefano full_name: Ciprini, Stefano last_name: Ciprini - first_name: Enrico full_name: Costa, Enrico last_name: Costa - first_name: Alessandra full_name: De Rosa, Alessandra last_name: De Rosa - first_name: Ettore full_name: Del Monte, Ettore last_name: Del Monte - first_name: Laura full_name: Di Gesu, Laura last_name: Di Gesu - first_name: Niccolò full_name: Di Lalla, Niccolò last_name: Di Lalla - first_name: Alessandro full_name: Di Marco, Alessandro last_name: Di Marco - first_name: Immacolata full_name: Donnarumma, Immacolata last_name: Donnarumma - first_name: Michal full_name: Dovčiak, Michal last_name: Dovčiak - first_name: Steven R. full_name: Ehlert, Steven R. last_name: Ehlert - first_name: Teruaki full_name: Enoto, Teruaki last_name: Enoto - first_name: Yuri full_name: Evangelista, Yuri last_name: Evangelista - first_name: Sergio full_name: Fabiani, Sergio last_name: Fabiani - first_name: Riccardo full_name: Ferrazzoli, Riccardo last_name: Ferrazzoli - first_name: Javier A. full_name: Garcia, Javier A. last_name: Garcia - first_name: Shuichi full_name: Gunji, Shuichi last_name: Gunji - first_name: Kiyoshi full_name: Hayashida, Kiyoshi last_name: Hayashida - first_name: Wataru full_name: Iwakiri, Wataru last_name: Iwakiri - first_name: Svetlana G. full_name: Jorstad, Svetlana G. last_name: Jorstad - first_name: Philip full_name: Kaaret, Philip last_name: Kaaret - first_name: Vladimir full_name: Karas, Vladimir last_name: Karas - first_name: Fabian full_name: Kislat, Fabian last_name: Kislat - first_name: Takao full_name: Kitaguchi, Takao last_name: Kitaguchi - first_name: Jeffery J. full_name: Kolodziejczak, Jeffery J. last_name: Kolodziejczak - first_name: Henric full_name: Krawczynski, Henric last_name: Krawczynski - first_name: Fabio full_name: La Monaca, Fabio last_name: La Monaca - first_name: Luca full_name: Latronico, Luca last_name: Latronico - first_name: Ioannis full_name: Liodakis, Ioannis last_name: Liodakis - first_name: Simone full_name: Maldera, Simone last_name: Maldera - first_name: Alberto full_name: Manfreda, Alberto last_name: Manfreda - first_name: Frédéric full_name: Marin, Frédéric last_name: Marin - first_name: Andrea full_name: Marinucci, Andrea last_name: Marinucci - first_name: Alan P. full_name: Marscher, Alan P. last_name: Marscher - first_name: Herman L. full_name: Marshall, Herman L. last_name: Marshall - first_name: Francesco full_name: Massaro, Francesco last_name: Massaro - first_name: Giorgio full_name: Matt, Giorgio last_name: Matt - first_name: Ikuyuki full_name: Mitsuishi, Ikuyuki last_name: Mitsuishi - first_name: Tsunefumi full_name: Mizuno, Tsunefumi last_name: Mizuno - first_name: Fabio full_name: Muleri, Fabio last_name: Muleri - first_name: Michela full_name: Negro, Michela last_name: Negro - first_name: C.-Y. full_name: Ng, C.-Y. last_name: Ng - first_name: Stephen L. full_name: O’Dell, Stephen L. last_name: O’Dell - first_name: Nicola full_name: Omodei, Nicola last_name: Omodei - first_name: Chiara full_name: Oppedisano, Chiara last_name: Oppedisano - first_name: Alessandro full_name: Papitto, Alessandro last_name: Papitto - first_name: Abel Lawrence full_name: Peirson, Abel Lawrence last_name: Peirson - first_name: Matteo full_name: Perri, Matteo last_name: Perri - first_name: Melissa full_name: Pesce-Rollins, Melissa last_name: Pesce-Rollins - first_name: Pierre-Olivier full_name: Petrucci, Pierre-Olivier last_name: Petrucci - first_name: Maura full_name: Pilia, Maura last_name: Pilia - first_name: Andrea full_name: Possenti, Andrea last_name: Possenti - first_name: Simonetta full_name: Puccetti, Simonetta last_name: Puccetti - first_name: Brian D. full_name: Ramsey, Brian D. last_name: Ramsey - first_name: John full_name: Rankin, John last_name: Rankin - first_name: Ajay full_name: Ratheesh, Ajay last_name: Ratheesh - first_name: Oliver J. full_name: Roberts, Oliver J. last_name: Roberts - first_name: Roger W. full_name: Romani, Roger W. last_name: Romani - first_name: Carmelo full_name: Sgrò, Carmelo last_name: Sgrò - first_name: Patrick full_name: Slane, Patrick last_name: Slane - first_name: Paolo full_name: Soffitta, Paolo last_name: Soffitta - first_name: Gloria full_name: Spandre, Gloria last_name: Spandre - first_name: Douglas A. full_name: Swartz, Douglas A. last_name: Swartz - first_name: Toru full_name: Tamagawa, Toru last_name: Tamagawa - first_name: Fabrizio full_name: Tavecchio, Fabrizio last_name: Tavecchio - first_name: Roberto full_name: Taverna, Roberto last_name: Taverna - first_name: Yuzuru full_name: Tawara, Yuzuru last_name: Tawara - first_name: Allyn F. full_name: Tennant, Allyn F. last_name: Tennant - first_name: Nicholas E. full_name: Thomas, Nicholas E. last_name: Thomas - first_name: Francesco full_name: Tombesi, Francesco last_name: Tombesi - first_name: Alessio full_name: Trois, Alessio last_name: Trois - first_name: Roberto full_name: Turolla, Roberto last_name: Turolla - first_name: Jacco full_name: Vink, Jacco last_name: Vink - first_name: Martin C. full_name: Weisskopf, Martin C. last_name: Weisskopf - first_name: Kinwah full_name: Wu, Kinwah last_name: Wu - first_name: Fei full_name: Xie, Fei last_name: Xie - first_name: Silvia full_name: Zane, Silvia last_name: Zane citation: ama: Heyl J, Doroshenko V, González-Caniulef D, et al. Complex rotational dynamics of the neutron star in Hercules X-1 revealed by X-ray polarization. Nature Astronomy. 2024;8:1047-1053. doi:10.1038/s41550-024-02295-8 apa: Heyl, J., Doroshenko, V., González-Caniulef, D., Caiazzo, I., Poutanen, J., Mushtukov, A., … Zane, S. (2024). Complex rotational dynamics of the neutron star in Hercules X-1 revealed by X-ray polarization. Nature Astronomy. Springer Nature. https://doi.org/10.1038/s41550-024-02295-8 chicago: Heyl, Jeremy, Victor Doroshenko, Denis González-Caniulef, Ilaria Caiazzo, Juri Poutanen, Alexander Mushtukov, Sergey S. Tsygankov, et al. “Complex Rotational Dynamics of the Neutron Star in Hercules X-1 Revealed by X-Ray Polarization.” Nature Astronomy. Springer Nature, 2024. https://doi.org/10.1038/s41550-024-02295-8. ieee: J. Heyl et al., “Complex rotational dynamics of the neutron star in Hercules X-1 revealed by X-ray polarization,” Nature Astronomy, vol. 8. Springer Nature, pp. 1047–1053, 2024. ista: Heyl J et al. 2024. Complex rotational dynamics of the neutron star in Hercules X-1 revealed by X-ray polarization. Nature Astronomy. 8, 1047–1053. mla: Heyl, Jeremy, et al. “Complex Rotational Dynamics of the Neutron Star in Hercules X-1 Revealed by X-Ray Polarization.” Nature Astronomy, vol. 8, Springer Nature, 2024, pp. 1047–53, doi:10.1038/s41550-024-02295-8. short: J. Heyl, V. Doroshenko, D. González-Caniulef, I. Caiazzo, J. Poutanen, A. Mushtukov, S.S. Tsygankov, D. Kirmizibayrak, M. Bachetti, G.G. Pavlov, S.V. Forsblom, C. Malacaria, V.F. Suleimanov, I. Agudo, L.A. Antonelli, L. Baldini, W.H. Baumgartner, R. Bellazzini, S. Bianchi, S.D. Bongiorno, R. Bonino, A. Brez, N. Bucciantini, F. Capitanio, S. Castellano, E. Cavazzuti, C.-T. Chen, S. Ciprini, E. Costa, A. De Rosa, E. Del Monte, L. Di Gesu, N. Di Lalla, A. Di Marco, I. Donnarumma, M. Dovčiak, S.R. Ehlert, T. Enoto, Y. Evangelista, S. Fabiani, R. Ferrazzoli, J.A. Garcia, S. Gunji, K. Hayashida, W. Iwakiri, S.G. Jorstad, P. Kaaret, V. Karas, F. Kislat, T. Kitaguchi, J.J. Kolodziejczak, H. Krawczynski, F. La Monaca, L. Latronico, I. Liodakis, S. Maldera, A. Manfreda, F. Marin, A. Marinucci, A.P. Marscher, H.L. Marshall, F. Massaro, G. Matt, I. Mitsuishi, T. Mizuno, F. Muleri, M. Negro, C.-Y. Ng, S.L. O’Dell, N. Omodei, C. Oppedisano, A. Papitto, A.L. Peirson, M. Perri, M. Pesce-Rollins, P.-O. Petrucci, M. Pilia, A. Possenti, S. Puccetti, B.D. Ramsey, J. Rankin, A. Ratheesh, O.J. Roberts, R.W. Romani, C. Sgrò, P. Slane, P. Soffitta, G. Spandre, D.A. Swartz, T. Tamagawa, F. Tavecchio, R. Taverna, Y. Tawara, A.F. Tennant, N.E. Thomas, F. Tombesi, A. Trois, R. Turolla, J. Vink, M.C. Weisskopf, K. Wu, F. Xie, S. Zane, Nature Astronomy 8 (2024) 1047–1053. date_created: 2025-01-21T15:35:17Z date_published: 2024-08-01T00:00:00Z date_updated: 2025-01-27T10:52:16Z day: '01' doi: 10.1038/s41550-024-02295-8 extern: '1' intvolume: ' 8' language: - iso: eng month: '08' oa_version: None page: 1047-1053 publication: Nature Astronomy publication_identifier: issn: - 2397-3366 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Complex rotational dynamics of the neutron star in Hercules X-1 revealed by X-ray polarization type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8 year: '2024' ... --- DOAJ_listed: '1' OA_place: publisher OA_type: gold _id: '18868' abstract: - lang: eng text: We develop two new highly efficient estimators to measure the polarization (Stokes parameters) in experiments that constrain the position angle of individual photons such as scattering and gas-pixel-detector polarimeters, and analyse in detail a previously proposed estimator. All three of these estimators are at least fifty percent more efficient on typical datasets than the standard estimator used in the field. We present analytic estimates of the variance of these estimators and numerical experiments to verify these estimates. Two of the three estimators can be calculated quickly and directly through summations over the measurements of individual photons. article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Jeremy full_name: Heyl, Jeremy last_name: Heyl - first_name: Denis full_name: González-Caniulef, Denis last_name: González-Caniulef - first_name: Ilaria full_name: Caiazzo, Ilaria id: 8ae5b6e7-2a03-11ee-914d-b58ed7a3b47d last_name: Caiazzo orcid: 0000-0002-4770-5388 citation: ama: Heyl J, González-Caniulef D, Caiazzo I. Optimal summary statistics for X-ray polarization. The Open Journal of Astrophysics. 2024;7. doi:10.33232/001c.117476 apa: Heyl, J., González-Caniulef, D., & Caiazzo, I. (2024). Optimal summary statistics for X-ray polarization. The Open Journal of Astrophysics. Maynooth Academic Publishing. https://doi.org/10.33232/001c.117476 chicago: Heyl, Jeremy, Denis González-Caniulef, and Ilaria Caiazzo. “Optimal Summary Statistics for X-Ray Polarization.” The Open Journal of Astrophysics. Maynooth Academic Publishing, 2024. https://doi.org/10.33232/001c.117476. ieee: J. Heyl, D. González-Caniulef, and I. Caiazzo, “Optimal summary statistics for X-ray polarization,” The Open Journal of Astrophysics, vol. 7. Maynooth Academic Publishing, 2024. ista: Heyl J, González-Caniulef D, Caiazzo I. 2024. Optimal summary statistics for X-ray polarization. The Open Journal of Astrophysics. 7. mla: Heyl, Jeremy, et al. “Optimal Summary Statistics for X-Ray Polarization.” The Open Journal of Astrophysics, vol. 7, Maynooth Academic Publishing, 2024, doi:10.33232/001c.117476. short: J. Heyl, D. González-Caniulef, I. Caiazzo, The Open Journal of Astrophysics 7 (2024). date_created: 2025-01-21T15:54:16Z date_published: 2024-05-01T00:00:00Z date_updated: 2025-01-27T10:48:19Z day: '01' doi: 10.33232/001c.117476 extern: '1' external_id: arxiv: - '2311.07805' intvolume: ' 7' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.33232/001c.117476 month: '05' oa: 1 oa_version: Published Version publication: The Open Journal of Astrophysics publication_identifier: issn: - 2565-6120 publication_status: published publisher: Maynooth Academic Publishing quality_controlled: '1' scopus_import: '1' status: public title: Optimal summary statistics for X-ray polarization type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7 year: '2024' ... --- OA_place: repository _id: '18874' abstract: - lang: eng text: "Despite extensive research since the community learned about adversarial\r\nexamples 10 years ago, we still do not know how to train high-accuracy\r\nclassifiers that are guaranteed to be robust to small perturbations of their\r\ninputs. Previous works often argued that this might be because no classifier\r\nexists that is robust and accurate at the same time. However, in computer\r\nvision this assumption does not match reality where humans are usually accurate\r\nand robust on most tasks of interest. We offer an alternative explanation and\r\nshow that in certain settings robust generalization is only possible with\r\nunrealistically large amounts of data. More precisely we find a setting where a\r\nrobust classifier exists, it is easy to learn an accurate classifier, yet it\r\nrequires an exponential amount of data to learn a robust classifier. Based on\r\nthis theoretical result, we explore how well robust classifiers generalize on\r\ndatasets such as CIFAR-10. We come to the conclusion that on this datasets, the\r\nlimitation of current robust models also lies in the generalization, and that\r\nthey require a lot of data to do well on the test set. We also show that the\r\nproblem is not in the expressiveness or generalization capabilities of current\r\narchitectures, and that there are low magnitude features in the data which are\r\nuseful for non-robust generalization but are not available for robust\r\nclassifiers." article_number: '2412.04245' article_processing_charge: No arxiv: 1 author: - first_name: Bernd full_name: Prach, Bernd id: 2D561D42-C427-11E9-89B4-9C1AE6697425 last_name: Prach - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: Prach B, Lampert C. Intriguing properties of robust classification. arXiv. doi:10.48550/arXiv.2412.04245 apa: Prach, B., & Lampert, C. (n.d.). Intriguing properties of robust classification. arXiv. https://doi.org/10.48550/arXiv.2412.04245 chicago: Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2412.04245. ieee: B. Prach and C. Lampert, “Intriguing properties of robust classification,” arXiv. . ista: Prach B, Lampert C. Intriguing properties of robust classification. arXiv, 2412.04245. mla: Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.” ArXiv, 2412.04245, doi:10.48550/arXiv.2412.04245. short: B. Prach, C. Lampert, ArXiv (n.d.). corr_author: '1' date_created: 2025-01-24T16:57:29Z date_published: 2024-12-05T00:00:00Z date_updated: 2026-04-07T11:49:51Z day: '05' department: - _id: GradSch - _id: ChLa doi: 10.48550/arXiv.2412.04245 external_id: arxiv: - '2412.04245' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2412.04245 month: '12' oa: 1 oa_version: Preprint publication: arXiv publication_status: draft related_material: record: - id: '20455' relation: later_version status: public - id: '19759' relation: dissertation_contains status: public status: public title: Intriguing properties of robust classification type: preprint user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2024' ... --- OA_place: publisher OA_type: gold _id: '18875' abstract: - lang: eng text: Current state-of-the-art methods for differentially private model training are based on matrix factorization techniques. However, these methods suffer from high computational overhead because they require numerically solving a demanding optimization problem to determine an approximately optimal factorization prior to the actual model training. In this work, we present a new matrix factorization approach, BSR, which overcomes this computational bottleneck. By exploiting properties of the standard matrix square root, BSR allows to efficiently handle also large-scale problems. For the key scenario of stochastic gradient descent with momentum and weight decay, we even derive analytical expressions for BSR that render the computational overhead negligible. We prove bounds on the approximation quality that hold both in the centralized and in the federated learning setting. Our numerical experiments demonstrate that models trained using BSR perform on par with the best existing methods, while completely avoiding their computational overhead. alternative_title: - Advances in Neural Information Processing Systems article_processing_charge: No arxiv: 1 author: - first_name: Nikita full_name: Kalinin, Nikita id: 4b14526e-14d2-11ed-ba64-c14c9553d137 last_name: Kalinin - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: 'Kalinin N, Lampert C. Banded square root matrix factorization for differentially private model training. In: 38th Annual Conference on Neural Information Processing Systems. Vol 37. Neural Information Processing Systems Foundation; 2024.' apa: 'Kalinin, N., & Lampert, C. (2024). Banded square root matrix factorization for differentially private model training. In 38th Annual Conference on Neural Information Processing Systems (Vol. 37). Vancouver, Canada: Neural Information Processing Systems Foundation.' chicago: Kalinin, Nikita, and Christoph Lampert. “Banded Square Root Matrix Factorization for Differentially Private Model Training.” In 38th Annual Conference on Neural Information Processing Systems, Vol. 37. Neural Information Processing Systems Foundation, 2024. ieee: N. Kalinin and C. Lampert, “Banded square root matrix factorization for differentially private model training,” in 38th Annual Conference on Neural Information Processing Systems, Vancouver, Canada, 2024, vol. 37. ista: 'Kalinin N, Lampert C. 2024. Banded square root matrix factorization for differentially private model training. 38th Annual Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 37.' mla: Kalinin, Nikita, and Christoph Lampert. “Banded Square Root Matrix Factorization for Differentially Private Model Training.” 38th Annual Conference on Neural Information Processing Systems, vol. 37, Neural Information Processing Systems Foundation, 2024. short: N. Kalinin, C. Lampert, in:, 38th Annual Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024. conference: end_date: 2024-12-16 location: Vancouver, Canada name: 'NeurIPS: Neural Information Processing Systems' start_date: 2024-12-16 corr_author: '1' date_created: 2025-01-24T17:58:16Z date_published: 2024-12-01T00:00:00Z date_updated: 2025-05-14T11:34:20Z day: '01' ddc: - '000' department: - _id: GradSch - _id: ChLa external_id: arxiv: - '2405.13763' file: - access_level: open_access checksum: a216cab8eddc1fe7840aede0e2c0d41e content_type: application/pdf creator: dernst date_created: 2025-01-27T09:52:15Z date_updated: 2025-01-27T09:52:15Z file_id: '18888' file_name: 2024_NeurIPS_Nikita.pdf file_size: 1144656 relation: main_file success: 1 file_date_updated: 2025-01-27T09:52:15Z has_accepted_license: '1' intvolume: ' 37' language: - iso: eng month: '12' oa: 1 oa_version: Published Version publication: 38th Annual Conference on Neural Information Processing Systems publication_identifier: eissn: - 1049-5258 publication_status: published publisher: Neural Information Processing Systems Foundation quality_controlled: '1' scopus_import: '1' status: public title: Banded square root matrix factorization for differentially private model training tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 37 year: '2024' ... --- OA_place: repository OA_type: green _id: '18890' abstract: - lang: eng text: Deep Neural Collapse (DNC) refers to the surprisingly rigid structure of the data representations in the final layers of Deep Neural Networks (DNNs). Though the phenomenon has been measured in a variety of settings, its emergence is typically explained via data-agnostic approaches, such as the unconstrained features model. In this work, we introduce a data-dependent setting where DNC forms due to feature learning through the average gradient outer product (AGOP). The AGOP is defined with respect to a learned predictor and is equal to the uncentered covariance matrix of its input-output gradients averaged over the training dataset. The Deep Recursive Feature Machine (Deep RFM) is a method that constructs a neural network by iteratively mapping the data with the AGOP and applying an untrained random feature map. We demonstrate empirically that DNC occurs in Deep RFM across standard settings as a consequence of the projection with the AGOP matrix computed at each layer. Further, we theoretically explain DNC in Deep RFM in an asymptotic setting and as a result of kernel learning. We then provide evidence that this mechanism holds for neural networks more generally. In particular, we show that the right singular vectors and values of the weights can be responsible for the majority of within-class variability collapse for DNNs trained in the feature learning regime. As observed in recent work, this singular structure is highly correlated with that of the AGOP. acknowledgement: 'We acknowledge support from the National Science Foundation (NSF) and the Simons Foundation for the Collaboration on the Theoretical Foundations of Deep Learning through awards DMS-2031883 and #814639 as well as the TILOS institute (NSF CCF-2112665). This work used the programs (1) XSEDE (Extreme science and engineering discovery environment) which is supported by NSF grant numbers ACI-1548562, and (2) ACCESS (Advanced cyberinfrastructure coordination ecosystem: services & support) which is supported by NSF grants numbers #2138259, #2138286, #2138307, #2137603, and #2138296. Specifically, we used the resources from SDSC Expanse GPU compute nodes, and NCSA Delta system, via allocations TG-CIS220009. Marco Mondelli is supported by the 2019 Lopez-Loreta prize. We also acknowledge useful feedback from anonymous reviewers. ' alternative_title: - Advances in Neural Information Processing Systems article_processing_charge: No arxiv: 1 author: - first_name: Daniel full_name: Beaglehole, Daniel last_name: Beaglehole - first_name: Peter full_name: Súkeník, Peter id: d64d6a8d-eb8e-11eb-b029-96fd216dec3c last_name: Súkeník - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 - first_name: Mikhail full_name: Belkin, Mikhail last_name: Belkin citation: ama: 'Beaglehole D, Súkeník P, Mondelli M, Belkin M. Average gradient outer product as a mechanism for deep neural collapse. In: 38th Annual Conference on Neural Information Processing Systems. Vol 37. Neural Information Processing Systems Foundation; 2024.' apa: 'Beaglehole, D., Súkeník, P., Mondelli, M., & Belkin, M. (2024). Average gradient outer product as a mechanism for deep neural collapse. In 38th Annual Conference on Neural Information Processing Systems (Vol. 37). Vancouver, Canada: Neural Information Processing Systems Foundation.' chicago: Beaglehole, Daniel, Peter Súkeník, Marco Mondelli, and Mikhail Belkin. “Average Gradient Outer Product as a Mechanism for Deep Neural Collapse.” In 38th Annual Conference on Neural Information Processing Systems, Vol. 37. Neural Information Processing Systems Foundation, 2024. ieee: D. Beaglehole, P. Súkeník, M. Mondelli, and M. Belkin, “Average gradient outer product as a mechanism for deep neural collapse,” in 38th Annual Conference on Neural Information Processing Systems, Vancouver, Canada, 2024, vol. 37. ista: 'Beaglehole D, Súkeník P, Mondelli M, Belkin M. 2024. Average gradient outer product as a mechanism for deep neural collapse. 38th Annual Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 37.' mla: Beaglehole, Daniel, et al. “Average Gradient Outer Product as a Mechanism for Deep Neural Collapse.” 38th Annual Conference on Neural Information Processing Systems, vol. 37, Neural Information Processing Systems Foundation, 2024. short: D. Beaglehole, P. Súkeník, M. Mondelli, M. Belkin, in:, 38th Annual Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024. conference: end_date: 2024-12-16 location: Vancouver, Canada name: 'NeurIPS: Neural Information Processing Systems' start_date: 2024-12-16 corr_author: '1' date_created: 2025-01-27T11:11:40Z date_published: 2024-12-01T00:00:00Z date_updated: 2025-05-14T11:29:45Z day: '01' department: - _id: GradSch - _id: MaMo external_id: arxiv: - '2402.13728' intvolume: ' 37' language: - iso: eng main_file_link: - open_access: '1' url: https://openreview.net/forum?id=lJ1jdl2K9k month: '12' oa: 1 oa_version: Preprint project: - _id: 059876FA-7A3F-11EA-A408-12923DDC885E name: Prix Lopez-Loretta 2019 - Marco Mondelli publication: 38th Annual Conference on Neural Information Processing Systems publication_identifier: eissn: - 1049-5258 publication_status: published publisher: Neural Information Processing Systems Foundation quality_controlled: '1' scopus_import: '1' status: public title: Average gradient outer product as a mechanism for deep neural collapse type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 37 year: '2024' ... --- OA_place: publisher OA_type: gold _id: '18891' abstract: - lang: eng text: "Deep neural networks (DNNs) exhibit a surprising structure in their final layer\r\nknown as neural collapse (NC), and a growing body of works has currently investigated the propagation of neural collapse to earlier layers of DNNs – a phenomenon\r\ncalled deep neural collapse (DNC). However, existing theoretical results are restricted to special cases: linear models, only two layers or binary classification.\r\nIn contrast, we focus on non-linear models of arbitrary depth in multi-class classification and reveal a surprising qualitative shift. As soon as we go beyond two\r\nlayers or two classes, DNC stops being optimal for the deep unconstrained features\r\nmodel (DUFM) – the standard theoretical framework for the analysis of collapse.\r\nThe main culprit is a low-rank bias of multi-layer regularization schemes: this bias\r\nleads to optimal solutions of even lower rank than the neural collapse. We support\r\nour theoretical findings with experiments on both DUFM and real data, which show\r\nthe emergence of the low-rank structure in the solution found by gradient descent." acknowledged_ssus: - _id: ScienComp acknowledgement: Marco Mondelli is partially supported by the 2019 Lopez-Loreta prize. This research was supported by the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp). alternative_title: - Advances in Neural Information Processing Systems article_processing_charge: No arxiv: 1 author: - first_name: Peter full_name: Súkeník, Peter id: d64d6a8d-eb8e-11eb-b029-96fd216dec3c last_name: Súkeník - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 citation: ama: 'Súkeník P, Lampert C, Mondelli M. Neural collapse versus low-rank bias: Is deep neural collapse really optimal? In: 38th Annual Conference on Neural Information Processing Systems. Vol 37. Neural Information Processing Systems Foundation; 2024.' apa: 'Súkeník, P., Lampert, C., & Mondelli, M. (2024). Neural collapse versus low-rank bias: Is deep neural collapse really optimal? In 38th Annual Conference on Neural Information Processing Systems (Vol. 37). Vancouver, Canada: Neural Information Processing Systems Foundation.' chicago: 'Súkeník, Peter, Christoph Lampert, and Marco Mondelli. “Neural Collapse versus Low-Rank Bias: Is Deep Neural Collapse Really Optimal?” In 38th Annual Conference on Neural Information Processing Systems, Vol. 37. Neural Information Processing Systems Foundation, 2024.' ieee: 'P. Súkeník, C. Lampert, and M. Mondelli, “Neural collapse versus low-rank bias: Is deep neural collapse really optimal?,” in 38th Annual Conference on Neural Information Processing Systems, Vancouver, Canada, 2024, vol. 37.' ista: 'Súkeník P, Lampert C, Mondelli M. 2024. Neural collapse versus low-rank bias: Is deep neural collapse really optimal? 38th Annual Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 37.' mla: 'Súkeník, Peter, et al. “Neural Collapse versus Low-Rank Bias: Is Deep Neural Collapse Really Optimal?” 38th Annual Conference on Neural Information Processing Systems, vol. 37, Neural Information Processing Systems Foundation, 2024.' short: P. Súkeník, C. Lampert, M. Mondelli, in:, 38th Annual Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024. conference: end_date: 2024-12-16 location: Vancouver, Canada name: 'NeurIPS: Neural Information Processing Systems' start_date: 2024-12-16 corr_author: '1' date_created: 2025-01-27T11:15:18Z date_published: 2024-12-01T00:00:00Z date_updated: 2025-06-04T07:19:21Z day: '01' ddc: - '000' department: - _id: GradSch - _id: MaMo - _id: ChLa external_id: arxiv: - '2405.14468' file: - access_level: open_access checksum: b7b79f1ea3ac1e9e11b3d91faaeb0780 content_type: application/pdf creator: dernst date_created: 2025-02-04T08:11:25Z date_updated: 2025-02-04T08:11:25Z file_id: '18989' file_name: 2024_NeurIPS_Sukenik.pdf file_size: 1784118 relation: main_file success: 1 file_date_updated: 2025-02-04T08:11:25Z has_accepted_license: '1' intvolume: ' 37' language: - iso: eng month: '12' oa: 1 oa_version: Published Version project: - _id: 059876FA-7A3F-11EA-A408-12923DDC885E name: Prix Lopez-Loretta 2019 - Marco Mondelli publication: 38th Annual Conference on Neural Information Processing Systems publication_status: published publisher: Neural Information Processing Systems Foundation quality_controlled: '1' status: public title: 'Neural collapse versus low-rank bias: Is deep neural collapse really optimal?' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 37 year: '2024' ... --- OA_place: repository OA_type: gold _id: '18895' abstract: - lang: eng text: 'ISTAnt is a new ecological dataset for social immunity and represents the first real-world benchmark for causal inference downstream tasks on high-dimensional observations. It analyzes grooming behavior in the ant Lasius neglectus in groups of three worker ants. The workers for the experiment were obtained from their laboratory stock colony, which had been collected from the field in 2022 in the Botanical Garden Jena, Germany. Ant collection and all experimental work were performed in compliance with international, national and institutional regulations and ethical guidelines. For the experiment, the body surface of one of the three ants was treated with a suspension of either of two microparticle types (diameter ~5 µm) to induce grooming by the two nestmates, which were individually color-coded by application of a dot of blue or orange paint, respectively. The three ants were housed in small plastic containers (diameter 28mm, height 30mm) with moistened, plastered ground and the interior walls covered with PTFE (polytetrafluoroethane) to hamper climbing by the ants. Filming occurred in a temperature- and humidity-controlled room at 23°C within a custom-made filming box with controlled lighting and ventilation conditions. We set up nine ant groups at a time (always containing both treatments) and placed them randomly on positions 1-9 marked on the floor in a 3x3 grid, about 3mm from each other. The experiment was performed on two consecutive days. Videos were acquired using a USB camera (FLIR blackfly S BFS-U3-120S4C, Teledyne FLIR) with a high-performance lens (HP Series 25mm Focal Length, Edmund optics 86-572) in OBS studio 29.0.0 \citep{bailey2017obs} at a framerate of 30 FPS and a resolution of 2500x2500 pixels. From each original video (105x105 mm), we generated nine individual videos .mkv (each ~32x32 mm, 770x770 pixels) by determining exact coordinates per container from one frame in GIMP 2.10.36 and cropping of the videos with FFmpeg 6.1.1. Annotation was performed over two consecutive days by three observers who had not been involved in the experimental setup or recording and were unaware of the treatment assignments to ensure bias-free behavioral annotation. They annotated the behavior of the ants during video observations, using custom-made software that saves the start and end frames of behaviors marked in a .csv file (see ''annotations'' folder). In one of the videos, one of the nestmates'' legs got inadvertently stuck to its body surface during the color-coding, interfering with its behavior, so the video was discarded. This left 44 videos from 5 independent setups (n=24 of treatment 1 and n=20 of treatment 2) of 10 minutes each for a total of 792 000 annotated frames (see ''video'' folder). For each video, we provide the following information: the number of the set to which it belongs (1-5); the number of the position within the set reflecting the position of the ant group under the camera (1-9), for which we also provide ‘coordinates’ in the 3x3 grid (taking values -1/0/1 for both X and Y axis); treatment (1 or 2); the hour of the day when the recording was started (in 24h CEST); experimental day (A or B); the top left coordinate of the cropping square from the original video (CropX/CropY); the person annotating the video (given as A, B, C); the date of annotation (1: first day, 2: second day) and in which order the videos were annotated by each person, both reflecting a possible training effect of the person (see ''experiments_settings.csv'' file).' article_processing_charge: No author: - first_name: Riccardo full_name: Cadei, Riccardo id: 0fa8b76f-72f0-11ef-b75a-a5da96e5ad6b last_name: Cadei - first_name: Francesco full_name: Locatello, Francesco id: 26cfd52f-2483-11ee-8040-88983bcc06d4 last_name: Locatello orcid: 0000-0002-4850-0683 - first_name: Sylvia M full_name: Cremer, Sylvia M id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87 last_name: Cremer orcid: 0000-0002-2193-3868 - first_name: Lukas full_name: Lindorfer, Lukas id: 85f0e6d3-06b3-11ec-8982-8c5049fa4455 last_name: Lindorfer - first_name: Cordelia full_name: Schmid, Cordelia last_name: Schmid citation: ama: Cadei R, Locatello F, Cremer S, Lindorfer L, Schmid C. ISTAnt. 2024. doi:10.6084/M9.FIGSHARE.26484934.V2 apa: Cadei, R., Locatello, F., Cremer, S., Lindorfer, L., & Schmid, C. (2024). ISTAnt. Institute of Science and Technology Austria. https://doi.org/10.6084/M9.FIGSHARE.26484934.V2 chicago: Cadei, Riccardo, Francesco Locatello, Sylvia Cremer, Lukas Lindorfer, and Cordelia Schmid. “ISTAnt.” Institute of Science and Technology Austria, 2024. https://doi.org/10.6084/M9.FIGSHARE.26484934.V2. ieee: R. Cadei, F. Locatello, S. Cremer, L. Lindorfer, and C. Schmid, “ISTAnt.” Institute of Science and Technology Austria, 2024. ista: Cadei R, Locatello F, Cremer S, Lindorfer L, Schmid C. 2024. ISTAnt, Institute of Science and Technology Austria, 10.6084/M9.FIGSHARE.26484934.V2. mla: Cadei, Riccardo, et al. ISTAnt. Institute of Science and Technology Austria, 2024, doi:10.6084/M9.FIGSHARE.26484934.V2. short: R. Cadei, F. Locatello, S. Cremer, L. Lindorfer, C. Schmid, (2024). corr_author: '1' date_created: 2025-01-27T11:45:43Z date_published: 2024-10-23T00:00:00Z date_updated: 2025-01-27T11:58:38Z day: '23' ddc: - '570' department: - _id: SyCr - _id: FrLo - _id: GradSch doi: 10.6084/M9.FIGSHARE.26484934.V2 main_file_link: - open_access: '1' url: https://10.6084/M9.FIGSHARE.26484934.V2 month: '10' oa: 1 oa_version: Published Version publisher: Institute of Science and Technology Austria related_material: record: - id: '18847' relation: used_in_publication status: public status: public title: ISTAnt type: research_data_reference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2024' ... --- OA_place: publisher OA_type: gold _id: '18897' abstract: - lang: eng text: 'Score-based generative models (SGMs) are powerful tools to sample from complex data distributions. Their underlying idea is to (i) run a forward process for time T1 by adding noise to the data, (ii) estimate its score function, and (iii) use such estimate to run a reverse process. As the reverse process is initialized with the stationary distribution of the forward one, the existing analysis paradigm requires T1→∞. This is however problematic: from a theoretical viewpoint, for a given precision of the score approximation, the convergence guarantee fails as T1 diverges; from a practical viewpoint, a large T1 increases computational costs and leads to error propagation. This paper addresses the issue by considering a version of the popular predictor-corrector scheme: after running the forward process, we first estimate the final distribution via an inexact Langevin dynamics and then revert the process. Our key technical contribution is to provide convergence guarantees which require to run the forward process only for a fixed finite time T1. Our bounds exhibit a mild logarithmic dependence on the input dimension and the subgaussian norm of the target distribution, have minimal assumptions on the data, and require only to control the L2 loss on the score approximation, which is the quantity minimized in practice.' acknowledgement: "Francesco Pedrotti and Jan Maas acknowledge support by the Austrian Science Fund (FWF) project 10.55776/F65. Marco Mondelli acknowledges support by the 2019 Lopez-Loreta prize.\r\n" alternative_title: - TMLR article_processing_charge: No arxiv: 1 author: - first_name: Francesco full_name: Pedrotti, Francesco id: d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c last_name: Pedrotti - first_name: Jan full_name: Maas, Jan id: 4C5696CE-F248-11E8-B48F-1D18A9856A87 last_name: Maas orcid: 0000-0002-0845-1338 - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 citation: ama: 'Pedrotti F, Maas J, Mondelli M. Improved convergence of score-based diffusion models via prediction-correction. In: Transactions on Machine Learning Research. ; 2024.' apa: Pedrotti, F., Maas, J., & Mondelli, M. (2024). Improved convergence of score-based diffusion models via prediction-correction. In Transactions on Machine Learning Research. chicago: Pedrotti, Francesco, Jan Maas, and Marco Mondelli. “Improved Convergence of Score-Based Diffusion Models via Prediction-Correction.” In Transactions on Machine Learning Research, 2024. ieee: F. Pedrotti, J. Maas, and M. Mondelli, “Improved convergence of score-based diffusion models via prediction-correction,” in Transactions on Machine Learning Research, 2024. ista: Pedrotti F, Maas J, Mondelli M. 2024. Improved convergence of score-based diffusion models via prediction-correction. Transactions on Machine Learning Research. , TMLR, . mla: Pedrotti, Francesco, et al. “Improved Convergence of Score-Based Diffusion Models via Prediction-Correction.” Transactions on Machine Learning Research, 2024. short: F. Pedrotti, J. Maas, M. Mondelli, in:, Transactions on Machine Learning Research, 2024. corr_author: '1' date_created: 2025-01-27T12:18:05Z date_published: 2024-06-01T00:00:00Z date_updated: 2025-04-15T08:31:35Z day: '01' ddc: - '000' department: - _id: JaMa - _id: MaMo external_id: arxiv: - '2305.14164' file: - access_level: open_access checksum: 76a1fd5afd8ee6f7ae0e5912d7dbf6b4 content_type: application/pdf creator: dernst date_created: 2025-01-27T12:19:44Z date_updated: 2025-01-27T12:19:44Z file_id: '18898' file_name: 2024_TMLR_Pedrotti.pdf file_size: 780315 relation: main_file success: 1 file_date_updated: 2025-01-27T12:19:44Z has_accepted_license: '1' language: - iso: eng month: '06' oa: 1 oa_version: Published Version project: - _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2 grant_number: F6504 name: Taming Complexity in Partial Differential Systems - _id: 059876FA-7A3F-11EA-A408-12923DDC885E name: Prix Lopez-Loretta 2019 - Marco Mondelli publication: Transactions on Machine Learning Research publication_identifier: issn: - 2835-8856 publication_status: published quality_controlled: '1' related_material: record: - id: '17350' relation: earlier_version status: public scopus_import: '1' status: public title: Improved convergence of score-based diffusion models via prediction-correction tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2024' ... --- _id: '18899' abstract: - lang: eng text: "The flourishing theory of classical optimal transport concerns mass transportation at minimal cost. This book introduces the reader to optimal transport on quantum structures, i.e., optimal transportation between quantum states and related non-commutative concepts of mass transportation. It contains lecture notes on\r\n\r\nclassical optimal transport and Wasserstein gradient flows\r\ndynamics and quantum optimal transport\r\nquantum couplings and many-body problems\r\nquantum channels and qubits\r\n\r\nThese notes are based on lectures given by the authors at the \"Optimal Transport on Quantum Structures\" School held at the Erdös Center in Budapest in the fall of 2022. The lecture notes are complemented by two survey chapters presenting the state of the art in different research areas of non-commutative optimal transport." alternative_title: - Bolyai Society Mathematical Studies article_processing_charge: No citation: ama: 'Maas J, Rademacher SAE, Titkos T, Virosztek D, eds. Optimal Transport on Quantum Structures. Vol 29. Cham: Springer Nature; 2024. doi:10.1007/978-3-031-50466-2' apa: 'Maas, J., Rademacher, S. A. E., Titkos, T., & Virosztek, D. (Eds.). (2024). Optimal Transport on Quantum Structures (Vol. 29). Cham: Springer Nature. https://doi.org/10.1007/978-3-031-50466-2' chicago: 'Maas, Jan, Simone Anna Elvira Rademacher, Tamás Titkos, and Daniel Virosztek, eds. Optimal Transport on Quantum Structures. Vol. 29. BSMS. Cham: Springer Nature, 2024. https://doi.org/10.1007/978-3-031-50466-2.' ieee: 'J. Maas, S. A. E. Rademacher, T. Titkos, and D. Virosztek, Eds., Optimal Transport on Quantum Structures, vol. 29. Cham: Springer Nature, 2024.' ista: 'Maas J, Rademacher SAE, Titkos T, Virosztek D eds. 2024. Optimal Transport on Quantum Structures, Cham: Springer Nature,p.' mla: Maas, Jan, et al., editors. Optimal Transport on Quantum Structures. Vol. 29, Springer Nature, 2024, doi:10.1007/978-3-031-50466-2. short: J. Maas, S.A.E. Rademacher, T. Titkos, D. Virosztek, eds., Optimal Transport on Quantum Structures, Springer Nature, Cham, 2024. date_created: 2025-01-27T12:26:03Z date_published: 2024-09-19T00:00:00Z date_updated: 2025-02-17T12:22:18Z day: '19' department: - _id: JaMa doi: 10.1007/978-3-031-50466-2 editor: - first_name: Jan full_name: Maas, Jan id: 4C5696CE-F248-11E8-B48F-1D18A9856A87 last_name: Maas orcid: 0000-0002-0845-1338 - first_name: Simone Anna Elvira full_name: Rademacher, Simone Anna Elvira id: 856966FE-A408-11E9-977E-802DE6697425 last_name: Rademacher orcid: 0000-0001-5059-4466 - first_name: Tamás full_name: Titkos, Tamás last_name: Titkos - first_name: Daniel full_name: Virosztek, Daniel id: 48DB45DA-F248-11E8-B48F-1D18A9856A87 last_name: Virosztek orcid: 0000-0003-1109-5511 intvolume: ' 29' language: - iso: eng month: '09' oa_version: None place: Cham publication_identifier: eisbn: - '9783031504662' eissn: - 2947-9460 isbn: - '9783031504655' issn: - 1217-4696 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' series_title: BSMS status: public title: Optimal Transport on Quantum Structures type: book_editor user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 29 year: '2024' ... --- OA_place: publisher OA_type: hybrid _id: '18900' abstract: - lang: eng text: We prove that certain closable derivations on the GNS Hilbert space associated with a non-tracial weight on a von Neumann algebra give rise to GNS-symmetric semigroups of contractive completely positive maps on the von Neumann algebra. acknowledgement: 'The author was funded by the Austrian Science Fund under the Esprit Programme [ESP 156]. For the purpose of Open Access, the authors have applied a CC BY public copyright licence to any Author Accepted Manuscript version arising from this submission. ' article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Melchior full_name: Wirth, Melchior id: 88644358-0A0E-11EA-8FA5-49A33DDC885E last_name: Wirth orcid: 0000-0002-0519-4241 citation: ama: Wirth M. Modular completely Dirichlet forms as squares of derivations. International Mathematics Research Notices. 2024;2024(14):10597-10614. doi:10.1093/imrn/rnae092 apa: Wirth, M. (2024). Modular completely Dirichlet forms as squares of derivations. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnae092 chicago: Wirth, Melchior. “Modular Completely Dirichlet Forms as Squares of Derivations.” International Mathematics Research Notices. Oxford University Press, 2024. https://doi.org/10.1093/imrn/rnae092. ieee: M. Wirth, “Modular completely Dirichlet forms as squares of derivations,” International Mathematics Research Notices, vol. 2024, no. 14. Oxford University Press, pp. 10597–10614, 2024. ista: Wirth M. 2024. Modular completely Dirichlet forms as squares of derivations. International Mathematics Research Notices. 2024(14), 10597–10614. mla: Wirth, Melchior. “Modular Completely Dirichlet Forms as Squares of Derivations.” International Mathematics Research Notices, vol. 2024, no. 14, Oxford University Press, 2024, pp. 10597–614, doi:10.1093/imrn/rnae092. short: M. Wirth, International Mathematics Research Notices 2024 (2024) 10597–10614. corr_author: '1' date_created: 2025-01-27T12:36:10Z date_published: 2024-07-01T00:00:00Z date_updated: 2025-09-09T12:02:46Z day: '01' ddc: - '510' department: - _id: JaMa doi: 10.1093/imrn/rnae092 external_id: isi: - '001222279400001' file: - access_level: open_access checksum: 3e1f80d58ada0c60a58f35df8080967e content_type: application/pdf creator: dernst date_created: 2025-01-27T12:38:10Z date_updated: 2025-01-27T12:38:10Z file_id: '18901' file_name: 2024_IMRN_Wirth.pdf file_size: 689984 relation: main_file success: 1 file_date_updated: 2025-01-27T12:38:10Z has_accepted_license: '1' intvolume: ' 2024' isi: 1 issue: '14' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 10597-10614 project: - _id: 34c6ea2d-11ca-11ed-8bc3-c04f3c502833 grant_number: ESP156_N name: Gradient flow techniques for quantum Markov semigroups publication: International Mathematics Research Notices publication_identifier: eissn: - 1687-0247 issn: - 1073-7928 publication_status: published publisher: Oxford University Press quality_controlled: '1' scopus_import: '1' status: public title: Modular completely Dirichlet forms as squares of derivations tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 2024 year: '2024' ... --- DOAJ_listed: '1' OA_place: publisher OA_type: gold _id: '18902' acknowledgement: 'MZ is supported by National Science Center, Poland, 2021/42/E/NZ2/00188, the Polish National Agency for Academic Exchange, and by a grant from the Priority Research Area DigiWorld under the Strategic Programme Excellence Initiative at Jagiellonian University. Work in JB’s lab is supported by the Francis Crick Institute, which receives its core funding from Cancer Research UK, the UK Medical Research Council and Wellcome Trust (all under CC001051). Work in the AK lab is supported by ISTA, the European Research Council under Horizon Europe: grant 101044579, and Austrian Science Fund (FWF): F78 (Neural Stem Cell Modulation).' article_number: '929' article_processing_charge: Yes article_type: letter_note author: - first_name: Marcin full_name: Zagorski, Marcin last_name: Zagorski - first_name: Nathalie full_name: Brandenberg, Nathalie last_name: Brandenberg - first_name: Matthias full_name: Lutolf, Matthias last_name: Lutolf - first_name: Gašper full_name: Tkačik, Gašper id: 3D494DCA-F248-11E8-B48F-1D18A9856A87 last_name: Tkačik orcid: 0000-0002-6699-1455 - first_name: Mark Tobias full_name: Bollenbach, Mark Tobias id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87 last_name: Bollenbach orcid: 0000-0003-4398-476X - first_name: James full_name: Briscoe, James last_name: Briscoe - first_name: Anna full_name: Kicheva, Anna id: 3959A2A0-F248-11E8-B48F-1D18A9856A87 last_name: Kicheva orcid: 0000-0003-4509-4998 citation: ama: Zagorski M, Brandenberg N, Lutolf M, et al. Assessing the precision of morphogen gradients in neural tube development. Nature Communications. 2024;15. doi:10.1038/s41467-024-45148-8 apa: Zagorski, M., Brandenberg, N., Lutolf, M., Tkačik, G., Bollenbach, M. T., Briscoe, J., & Kicheva, A. (2024). Assessing the precision of morphogen gradients in neural tube development. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-024-45148-8 chicago: Zagorski, Marcin, Nathalie Brandenberg, Matthias Lutolf, Gašper Tkačik, Mark Tobias Bollenbach, James Briscoe, and Anna Kicheva. “Assessing the Precision of Morphogen Gradients in Neural Tube Development.” Nature Communications. Springer Nature, 2024. https://doi.org/10.1038/s41467-024-45148-8. ieee: M. Zagorski et al., “Assessing the precision of morphogen gradients in neural tube development,” Nature Communications, vol. 15. Springer Nature, 2024. ista: Zagorski M, Brandenberg N, Lutolf M, Tkačik G, Bollenbach MT, Briscoe J, Kicheva A. 2024. Assessing the precision of morphogen gradients in neural tube development. Nature Communications. 15, 929. mla: Zagorski, Marcin, et al. “Assessing the Precision of Morphogen Gradients in Neural Tube Development.” Nature Communications, vol. 15, 929, Springer Nature, 2024, doi:10.1038/s41467-024-45148-8. short: M. Zagorski, N. Brandenberg, M. Lutolf, G. Tkačik, M.T. Bollenbach, J. Briscoe, A. Kicheva, Nature Communications 15 (2024). corr_author: '1' date_created: 2025-01-27T13:01:01Z date_published: 2024-02-01T00:00:00Z date_updated: 2025-12-30T10:57:08Z day: '01' ddc: - '570' department: - _id: GaTk - _id: AnKi doi: 10.1038/s41467-024-45148-8 external_id: isi: - '001156218500022' pmid: - '38302459' file: - access_level: open_access checksum: acf75f2b6fa84a64d1f590dd4a53cbf7 content_type: application/pdf creator: dernst date_created: 2025-01-27T13:04:03Z date_updated: 2025-01-27T13:04:03Z file_id: '18903' file_name: 2024_NatureComm_Zagorski.pdf file_size: 4723831 relation: main_file success: 1 file_date_updated: 2025-01-27T13:04:03Z has_accepted_license: '1' intvolume: ' 15' isi: 1 language: - iso: eng month: '02' oa: 1 oa_version: Published Version pmid: 1 project: - _id: bd7e737f-d553-11ed-ba76-d69ffb5ee3aa grant_number: '101044579' name: Mechanisms of tissue size regulation in spinal cord development - _id: 059DF620-7A3F-11EA-A408-12923DDC885E grant_number: F7802 name: Stem Cell Modulation in Neural Development and Regeneration/ P02-Morphogen control of growth and pattern in the spinal cord publication: Nature Communications publication_identifier: eissn: - 2041-1723 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Assessing the precision of morphogen gradients in neural tube development tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 15 year: '2024' ... --- OA_place: publisher OA_type: hybrid _id: '18904' abstract: - lang: eng text: The Planetary Transits and Oscillations of stars mission (PLATO) will allow us to measure surface rotation and monitor photometric activity of tens of thousands of main sequence solar-type and subgiant stars. This paper is the first of a series dedicated to the preparation of the analysis of stellar surface rotation and photospheric activity with the near-future PLATO data. We describe in this work the strategy that will be implemented in the PLATO pipeline to measure stellar surface rotation, photometric activity, and long-term modulations. The algorithms are applied on both noise-free and noisy simulations of solar-type stars, which include activity cycles, latitudinal differential rotation, and spot evolution. PLATO simulated systematics are included in the noisy light curves. We show that surface rotation periods can be recovered with confidence for most of the stars with only six months of observations and that the recovery rate of the analysis significantly improves as additional observations are collected. This means that the first PLATO data release will already provide a substantial set of measurements for this quantity, with a significant refinement on their quality as the instrument obtains longer light curves. Measuring the Schwabe-like magnetic activity cycle during the mission will require that the same field be observed over a significant timescale (more than four years). Nevertheless, PLATO will provide a vast and robust sample of solar-type stars with constraints on the activity-cycle length. Such a sample is lacking from previous missions dedicated to space photometry. acknowledgement: 'This work presents results from the European Space Agency (ESA) space mission PLATO. The PLATO payload, the PLATO Ground Segment and PLATO data processing are joint developments of ESA and the PLATO Mission Consortium (PMC). Funding for the PMC is provided at national levels, in particular by countries participating in the PLATO Multilateral Agreement (Austria, Belgium, Czech Republic, Denmark, France, Germany, Italy, Netherlands, Portugal, Spain, Sweden, Switzerland, Norway, and United Kingdom) and institutions from Brazil. Members of the PLATO Consortium can be found at https://platomission.com. The ESA PLATO mission website is https://www.cosmos.esa.int/plato. The authors thank the teams working for PLATO for all their work. They acknowledge the critical reading and the constructive comments from the anonymous referee that significantly allowed improving the original version of this paper. They finally thank R. Samadi for helpful advice and suggestions concerning the PSLS abilities. S.N.B, A.F.L, S.Me, I.P and E.C acknowledge support from PLATO ASI-INAF agreement no. 2022-28-HH.0 “PLATO Fase D”. S.N.B, L.A, A.S.B, Q.N, and A.S acknowledge financial support by ERC Whole Sun Synergy grant #810218. S.N.B, R.A.G, L.A, A.S.B, Q.N., D.B.P, E.P, and A.S acknowledge the support from PLATO CNES grant. R.A.G, D.B.P, and E.P acknowledge the support from SoHO/GOLF CNES grant. A.S.B, Q.N, and A.S acknowledge the support from INSU/PNST grant and Solar Orbiter CNES grant. A.S acknowledges funding from from the European Union’s Horizon-2020 research and innovation program (grant agreement no. 776403 ExoplANETS-A) and the Programme National de Planétologie (PNP). A.R.G.S acknowledges the support from the FCT through national funds and FEDER through COMPETE2020 (UIDB/04434/2020, UIDP/04434/2020, 2022.03993.PTDC) and the support from the FCT through the work contract No. 2020.02480.CEECIND/CP1631/CT0001. S.Ma acknowledges support from the Spanish Ministry of Science and Innovation (MICINN) with the Ramón y Cajal fellowship no. RYC-2015-17697 and through AEI under the Severo Ochoa Centres of Excellence Programme 2020–2023 (CEX2019-000920-S). S.Ma acknowledges support from the Spanish Ministry of Science and Innovation (MICINN) with the grant no. PID2019-107187GB-I00. M.J.G., K.B., R.M.O, J.P, O.R., C.R. acknowledge support from CNES. The computations were performed with the IRFU/CEA Saclay server facilities, funded by ERC Synergy grant WholeSun No.810218, the P2IO Labex emergence project FlarePredict, and CNES PLATO funds. Software:star-privateer (this work), pyspot (Aigrain et al. 2015), PSLS (Samadi et al. 2019), numpy (Harris et al. 2020), matplotlib (Hunter 2007), scipy (Virtanen et al. 2020), astropy (Astropy Collaboration 2022), pandas (Wes McKinney 2010; The pandas development team 2020), scikit-learn (Pedregosa et al. 2011).' article_number: A229 article_processing_charge: No article_type: original arxiv: 1 author: - first_name: S. N. full_name: Breton, S. N. last_name: Breton - first_name: A. F. full_name: Lanza, A. F. last_name: Lanza - first_name: S. full_name: Messina, S. last_name: Messina - first_name: I. full_name: Pagano, I. last_name: Pagano - first_name: Lisa Annabelle full_name: Bugnet, Lisa Annabelle id: d9edb345-f866-11ec-9b37-d119b5234501 last_name: Bugnet orcid: 0000-0003-0142-4000 - first_name: E. full_name: Corsaro, E. last_name: Corsaro - first_name: R. A. full_name: García, R. A. last_name: García - first_name: S. full_name: Mathur, S. last_name: Mathur - first_name: A. R. G. full_name: Santos, A. R. G. last_name: Santos - first_name: S. full_name: Aigrain, S. last_name: Aigrain - first_name: L. full_name: Amard, L. last_name: Amard - first_name: A. S. full_name: Brun, A. S. last_name: Brun - first_name: L. full_name: Degott, L. last_name: Degott - first_name: Q. full_name: Noraz, Q. last_name: Noraz - first_name: D. B. full_name: Palakkatharappil, D. B. last_name: Palakkatharappil - first_name: E. full_name: Panetier, E. last_name: Panetier - first_name: A. full_name: Strugarek, A. last_name: Strugarek - first_name: K. full_name: Belkacem, K. last_name: Belkacem - first_name: M.-J full_name: Goupil, M.-J last_name: Goupil - first_name: R. M. full_name: Ouazzani, R. M. last_name: Ouazzani - first_name: J. full_name: Philidet, J. last_name: Philidet - first_name: C. full_name: Renié, C. last_name: Renié - first_name: O. full_name: Roth, O. last_name: Roth citation: ama: Breton SN, Lanza AF, Messina S, et al. Measuring stellar surface rotation and activity with the PLATO mission. I. Strategy and application to simulated light curves. Astronomy and Astrophysics. 2024;689. doi:10.1051/0004-6361/202449893 apa: Breton, S. N., Lanza, A. F., Messina, S., Pagano, I., Bugnet, L. A., Corsaro, E., … Roth, O. (2024). Measuring stellar surface rotation and activity with the PLATO mission. I. Strategy and application to simulated light curves. Astronomy and Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/202449893 chicago: Breton, S. N., A. F. Lanza, S. Messina, I. Pagano, Lisa Annabelle Bugnet, E. Corsaro, R. A. García, et al. “Measuring Stellar Surface Rotation and Activity with the PLATO Mission. I. Strategy and Application to Simulated Light Curves.” Astronomy and Astrophysics. EDP Sciences, 2024. https://doi.org/10.1051/0004-6361/202449893. ieee: S. N. Breton et al., “Measuring stellar surface rotation and activity with the PLATO mission. I. Strategy and application to simulated light curves,” Astronomy and Astrophysics, vol. 689. EDP Sciences, 2024. ista: Breton SN, Lanza AF, Messina S, Pagano I, Bugnet LA, Corsaro E, García RA, Mathur S, Santos ARG, Aigrain S, Amard L, Brun AS, Degott L, Noraz Q, Palakkatharappil DB, Panetier E, Strugarek A, Belkacem K, Goupil M-J, Ouazzani RM, Philidet J, Renié C, Roth O. 2024. Measuring stellar surface rotation and activity with the PLATO mission. I. Strategy and application to simulated light curves. Astronomy and Astrophysics. 689, A229. mla: Breton, S. N., et al. “Measuring Stellar Surface Rotation and Activity with the PLATO Mission. I. Strategy and Application to Simulated Light Curves.” Astronomy and Astrophysics, vol. 689, A229, EDP Sciences, 2024, doi:10.1051/0004-6361/202449893. short: S.N. Breton, A.F. Lanza, S. Messina, I. Pagano, L.A. Bugnet, E. Corsaro, R.A. García, S. Mathur, A.R.G. Santos, S. Aigrain, L. Amard, A.S. Brun, L. Degott, Q. Noraz, D.B. Palakkatharappil, E. Panetier, A. Strugarek, K. Belkacem, M.-J. Goupil, R.M. Ouazzani, J. Philidet, C. Renié, O. Roth, Astronomy and Astrophysics 689 (2024). date_created: 2025-01-27T13:12:44Z date_published: 2024-09-01T00:00:00Z date_updated: 2025-09-09T12:04:24Z day: '01' ddc: - '520' department: - _id: LiBu doi: 10.1051/0004-6361/202449893 external_id: arxiv: - '2407.03709' isi: - '001366206400007' file: - access_level: open_access checksum: 5c871ba7370a507ed6ea9fb2304d8263 content_type: application/pdf creator: dernst date_created: 2025-01-27T13:18:41Z date_updated: 2025-01-27T13:18:41Z file_id: '18905' file_name: 2024_AstronomyAstrophysics_Breton.pdf file_size: 6212007 relation: main_file success: 1 file_date_updated: 2025-01-27T13:18:41Z has_accepted_license: '1' intvolume: ' 689' isi: 1 language: - iso: eng month: '09' oa: 1 oa_version: Published Version publication: Astronomy and Astrophysics publication_identifier: eissn: - 1432-0746 issn: - 0004-6361 publication_status: published publisher: EDP Sciences quality_controlled: '1' scopus_import: '1' status: public title: Measuring stellar surface rotation and activity with the PLATO mission. I. Strategy and application to simulated light curves tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 689 year: '2024' ... --- OA_place: publisher OA_type: hybrid _id: '18906' abstract: - lang: eng text: "Expander decompositions of graphs have significantly advanced the understanding of many classical graph problems and led to numerous fundamental theoretical results. However, their adoption in practice has been hindered due to their inherent intricacies and large hidden factors in their asymptotic running times. Here, we introduce the first practically efficient algorithm for computing expander decompositions and their hierarchies and demonstrate its effectiveness and utility by incorporating it as the core component in a novel solver for the normalized cut graph clustering objective.\r\nOur extensive experiments on a variety of large graphs show that our expander-based algorithm outperforms state-of-the-art solvers for normalized cut with respect to solution quality by a large margin on a variety of graph classes such as citation, e-mail, and social networks or web graphs while remaining competitive in running time." acknowledgement: "Monika Henzinger: This project has received funding from the European Research\r\nCouncil (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024.\r\nHarald Räcke, Robin Münk: This project has received funding from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – 498605858 and 470029389." article_processing_charge: Yes (in subscription journal) author: - first_name: Kathrin full_name: Hanauer, Kathrin last_name: Hanauer - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Robin full_name: Münk, Robin last_name: Münk - first_name: Harald full_name: Räcke, Harald last_name: Räcke - first_name: Maximilian full_name: Vötsch, Maximilian last_name: Vötsch citation: ama: 'Hanauer K, Henzinger M, Münk R, Räcke H, Vötsch M. Expander hierarchies for normalized cuts on graphs. In: Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. ACM; 2024:1016-1027. doi:10.1145/3637528.3671978' apa: 'Hanauer, K., Henzinger, M., Münk, R., Räcke, H., & Vötsch, M. (2024). Expander hierarchies for normalized cuts on graphs. In Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (pp. 1016–1027). Barcelona, Spain: ACM. https://doi.org/10.1145/3637528.3671978' chicago: Hanauer, Kathrin, Monika Henzinger, Robin Münk, Harald Räcke, and Maximilian Vötsch. “Expander Hierarchies for Normalized Cuts on Graphs.” In Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 1016–27. ACM, 2024. https://doi.org/10.1145/3637528.3671978. ieee: K. Hanauer, M. Henzinger, R. Münk, H. Räcke, and M. Vötsch, “Expander hierarchies for normalized cuts on graphs,” in Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Barcelona, Spain, 2024, pp. 1016–1027. ista: 'Hanauer K, Henzinger M, Münk R, Räcke H, Vötsch M. 2024. Expander hierarchies for normalized cuts on graphs. Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. KDD: Knowledge Discovery and Data Mining, 1016–1027.' mla: Hanauer, Kathrin, et al. “Expander Hierarchies for Normalized Cuts on Graphs.” Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, ACM, 2024, pp. 1016–27, doi:10.1145/3637528.3671978. short: K. Hanauer, M. Henzinger, R. Münk, H. Räcke, M. Vötsch, in:, Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, ACM, 2024, pp. 1016–1027. conference: end_date: 2024-08-29 location: Barcelona, Spain name: 'KDD: Knowledge Discovery and Data Mining' start_date: 2024-08-05 date_created: 2025-01-27T13:20:26Z date_published: 2024-09-01T00:00:00Z date_updated: 2025-09-09T12:04:56Z day: '01' ddc: - '000' department: - _id: MoHe doi: 10.1145/3637528.3671978 ec_funded: 1 external_id: isi: - '001324524201013' file: - access_level: open_access checksum: 1265d5cf6aa5f94157631651723c4a2b content_type: application/pdf creator: dernst date_created: 2025-01-27T13:25:23Z date_updated: 2025-01-27T13:25:23Z file_id: '18907' file_name: 2024_ACMKDD_Hanauer.pdf file_size: 1450331 relation: main_file success: 1 file_date_updated: 2025-01-27T13:25:23Z has_accepted_license: '1' isi: 1 language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: 1016-1027 project: - _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62 call_identifier: H2020 grant_number: '101019564' name: The design and evaluation of modern fully dynamic data structures - _id: 34def286-11ca-11ed-8bc3-da5948e1613c grant_number: Z00422 name: Efficient algorithms - _id: bda196b2-d553-11ed-ba76-8e8ee6c21103 grant_number: I05982 name: Static and Dynamic Hierarchical Graph Decompositions publication: Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining publication_identifier: isbn: - '9798400704901' publication_status: published publisher: ACM quality_controlled: '1' scopus_import: '1' status: public title: Expander hierarchies for normalized cuts on graphs tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 year: '2024' ... --- OA_place: publisher OA_type: gold _id: '18908' abstract: - lang: eng text: Chromosomal rearrangements can lead to the coupling of reproductive barriers, but whether and how they contribute to the completion of speciation remains unclear. Marine snails of the genus Littorina repeatedly form hybrid zones between populations segregating for multiple inversion arrangements, providing opportunities to study their barrier effects. Here, we analyzed 2 adjacent transects across hybrid zones between 2 ecotypes of Littorina fabalis (“large” and “dwarf”) adapted to different wave exposure conditions on a Swedish island. Applying whole-genome sequencing, we found 12 putative inversions on 9 of 17 chromosomes. Nine of the putative inversions reached near differential fixation between the 2 ecotypes, and all were in strong linkage disequilibrium. These inversions cover 20% of the genome and carry 93% of divergent single nucleotide polymorphisms (SNPs). Bimodal hybrid zones in both transects indicated that the 2 ecotypes of Littorina fabalis maintain their genetic and phenotypic integrity following contact. The bimodality reflects the strong coupling between inversion clines and the extension of the barrier effect across the whole genome. Demographic inference suggests that coupling arose during a period of allopatry and has been maintained for > 1,000 generations after secondary contact. Overall, this study shows that the coupling of multiple chromosomal inversions contributes to strong reproductive isolation. Notably, 2 of the putative inversions overlap with inverted genomic regions associated with ecotype differences in a closely related species (Littorina saxatilis), suggesting the same regions, with similar structural variants, repeatedly contribute to ecotype evolution in distinct species. acknowledgement: The computations and data handling were enabled by resources provided by the Swedish National Infrastructure for Computing at UPPMAX partially funded by the Swedish Research Council through grant agreement no. 2018-05973. We thank all the member of the Littorina team for the stimulating discussions about the manuscripts, James Reeves for his help the implementation of Hsplit, and Thomas Broquet for his useful comments in the latter stage of manuscript revisions. article_processing_charge: Yes article_type: letter_note author: - first_name: Alan full_name: Le Moan, Alan last_name: Le Moan - first_name: Sean full_name: Stankowski, Sean id: 43161670-5719-11EA-8025-FABC3DDC885E last_name: Stankowski - first_name: Marina full_name: Rafajlović, Marina last_name: Rafajlović - first_name: Olga full_name: Ortega-Martinez, Olga last_name: Ortega-Martinez - first_name: Rui full_name: Faria, Rui last_name: Faria - first_name: Roger K full_name: Butlin, Roger K last_name: Butlin - first_name: Kerstin full_name: Johannesson, Kerstin last_name: Johannesson citation: ama: Le Moan A, Stankowski S, Rafajlović M, et al. Coupling of twelve putative chromosomal inversions maintains a strong barrier to gene flow between snail ecotypes. Evolution Letters. 2024;8(4):575-586. doi:10.1093/evlett/qrae014 apa: Le Moan, A., Stankowski, S., Rafajlović, M., Ortega-Martinez, O., Faria, R., Butlin, R. K., & Johannesson, K. (2024). Coupling of twelve putative chromosomal inversions maintains a strong barrier to gene flow between snail ecotypes. Evolution Letters. Oxford University Press. https://doi.org/10.1093/evlett/qrae014 chicago: Le Moan, Alan, Sean Stankowski, Marina Rafajlović, Olga Ortega-Martinez, Rui Faria, Roger K Butlin, and Kerstin Johannesson. “Coupling of Twelve Putative Chromosomal Inversions Maintains a Strong Barrier to Gene Flow between Snail Ecotypes.” Evolution Letters. Oxford University Press, 2024. https://doi.org/10.1093/evlett/qrae014. ieee: A. Le Moan et al., “Coupling of twelve putative chromosomal inversions maintains a strong barrier to gene flow between snail ecotypes,” Evolution Letters, vol. 8, no. 4. Oxford University Press, pp. 575–586, 2024. ista: Le Moan A, Stankowski S, Rafajlović M, Ortega-Martinez O, Faria R, Butlin RK, Johannesson K. 2024. Coupling of twelve putative chromosomal inversions maintains a strong barrier to gene flow between snail ecotypes. Evolution Letters. 8(4), 575–586. mla: Le Moan, Alan, et al. “Coupling of Twelve Putative Chromosomal Inversions Maintains a Strong Barrier to Gene Flow between Snail Ecotypes.” Evolution Letters, vol. 8, no. 4, Oxford University Press, 2024, pp. 575–86, doi:10.1093/evlett/qrae014. short: A. Le Moan, S. Stankowski, M. Rafajlović, O. Ortega-Martinez, R. Faria, R.K. Butlin, K. Johannesson, Evolution Letters 8 (2024) 575–586. date_created: 2025-01-27T13:30:27Z date_published: 2024-04-23T00:00:00Z date_updated: 2025-09-09T12:05:51Z day: '23' ddc: - '570' department: - _id: NiBa doi: 10.1093/evlett/qrae014 external_id: isi: - '001206532900001' pmid: - '39479507' file: - access_level: open_access checksum: 2f7780b7b6b3489755f1815f476639c6 content_type: application/pdf creator: dernst date_created: 2025-01-27T13:33:14Z date_updated: 2025-01-27T13:33:14Z file_id: '18909' file_name: 2024_EvolutionLetter_Moan.pdf file_size: 24356661 relation: main_file success: 1 file_date_updated: 2025-01-27T13:33:14Z has_accepted_license: '1' intvolume: ' 8' isi: 1 issue: '4' language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 575-586 pmid: 1 publication: Evolution Letters publication_identifier: issn: - 2056-3744 publication_status: published publisher: Oxford University Press quality_controlled: '1' scopus_import: '1' status: public title: Coupling of twelve putative chromosomal inversions maintains a strong barrier to gene flow between snail ecotypes tmp: image: /images/cc_by_nc.png legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) short: CC BY-NC (4.0) type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 8 year: '2024' ... --- OA_place: publisher OA_type: hybrid _id: '18910' abstract: - lang: eng text: Proteins often undergo large-scale conformational transitions, in which secondary and tertiary structure elements (loops, helices, and domains) change their structures or their positions with respect to each other. Simple considerations suggest that such dynamics should be relatively fast, but the functional cycles of many proteins are often relatively slow. Sophisticated experimental methods are starting to tackle this dichotomy and shed light on the contribution of large-scale conformational dynamics to protein function. In this review, we focus on the contribution of single-molecule Förster resonance energy transfer and nuclear magnetic resonance (NMR) spectroscopies to the study of conformational dynamics. We briefly describe the state of the art in each of these techniques and then point out their similarities and differences, as well as the relative strengths and weaknesses of each. Several case studies, in which the connection between fast conformational dynamics and slower function has been demonstrated, are then introduced and discussed. These examples include both enzymes and large protein machines, some of which have been studied by both NMR and fluorescence spectroscopies. acknowledgement: G.H. is the incumbent of the Hilda Pomeraniec Memorial Professorial Chair. He has been partially funded by the European Research Council under the European Union's Horizon 2020 research and innovation program (grant 742637, SMALLOSTERY), by National Science Foundation–US-Israel Binational Science Foundation grant 2021700, and by an Israel Science Foundation Breakthrough grant (1924/22). P.S. acknowledges funding from the Austrian Science Fund (project “AlloSpace,” I05812) and intramural funding from the Institute of Science and Technology Austria. article_processing_charge: No article_type: original author: - first_name: Paul full_name: Schanda, Paul id: 7B541462-FAF6-11E9-A490-E8DFE5697425 last_name: Schanda orcid: 0000-0002-9350-7606 - first_name: Gilad full_name: Haran, Gilad last_name: Haran citation: ama: Schanda P, Haran G. NMR and single-molecule FRET insights into fast protein motions and their relation to function. Annual Review of Biophysics. 2024;53:247-273. doi:10.1146/annurev-biophys-070323-022428 apa: Schanda, P., & Haran, G. (2024). NMR and single-molecule FRET insights into fast protein motions and their relation to function. Annual Review of Biophysics. Annual Reviews. https://doi.org/10.1146/annurev-biophys-070323-022428 chicago: Schanda, Paul, and Gilad Haran. “NMR and Single-Molecule FRET Insights into Fast Protein Motions and Their Relation to Function.” Annual Review of Biophysics. Annual Reviews, 2024. https://doi.org/10.1146/annurev-biophys-070323-022428. ieee: P. Schanda and G. Haran, “NMR and single-molecule FRET insights into fast protein motions and their relation to function,” Annual Review of Biophysics, vol. 53. Annual Reviews, pp. 247–273, 2024. ista: Schanda P, Haran G. 2024. NMR and single-molecule FRET insights into fast protein motions and their relation to function. Annual Review of Biophysics. 53, 247–273. mla: Schanda, Paul, and Gilad Haran. “NMR and Single-Molecule FRET Insights into Fast Protein Motions and Their Relation to Function.” Annual Review of Biophysics, vol. 53, Annual Reviews, 2024, pp. 247–73, doi:10.1146/annurev-biophys-070323-022428. short: P. Schanda, G. Haran, Annual Review of Biophysics 53 (2024) 247–273. corr_author: '1' date_created: 2025-01-27T13:40:34Z date_published: 2024-07-01T00:00:00Z date_updated: 2025-09-09T12:06:24Z day: '01' ddc: - '570' department: - _id: PaSc doi: 10.1146/annurev-biophys-070323-022428 external_id: isi: - '001278237500012' pmid: - '38346243' file: - access_level: open_access checksum: c90861542ae3f9147939030d5bafed3c content_type: application/pdf creator: dernst date_created: 2025-01-27T13:44:59Z date_updated: 2025-01-27T13:44:59Z file_id: '18911' file_name: 2024_AnnualReviews_Schanda.pdf file_size: 3025589 relation: main_file success: 1 file_date_updated: 2025-01-27T13:44:59Z has_accepted_license: '1' intvolume: ' 53' isi: 1 language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 247-273 pmid: 1 project: - _id: eb9c82eb-77a9-11ec-83b8-aadd536561cf grant_number: I05812 name: AlloSpace. The emergence and mechanisms of allostery publication: Annual Review of Biophysics publication_identifier: eissn: - 1936-1238 issn: - 1936-122X publication_status: published publisher: Annual Reviews quality_controlled: '1' scopus_import: '1' status: public title: NMR and single-molecule FRET insights into fast protein motions and their relation to function tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 53 year: '2024' ... --- OA_type: closed access _id: '18912' abstract: - lang: eng text: This paper presents a computational method for automatically creating fabricable 3D wire sculptures from various input modalities, including 3D models, images, and even text. There are several challenges to wire art creation. For example, artists must express the desired visual as a sparse wire representation. It is also difficult to manually bend wires in the air without guidance to fabricate the designed 3D curves. Our workflow solves these challenges by using two core techniques. First, we present an algorithm that automatically generates a fabricable 3D curve representation of the target based on a loss function that measures the semantic distance between the rendered curve and the target. The loss function can be defined using different pre-trained vision-language neural networks to generate wire art from different input types. The loss function is then optimized using differentiable rendering specifically targeting 3D parametric curves. Our method can incorporate various fabrication constraints on the wire as additional regularization terms in the optimization process. Second, we present an algorithm to generate a 3D printable jig structure that can be used to fabricate the generated wire path. The major challenge in the jig generation stems from the design of an intersection-free surface mesh for 3D printing, which we address with our inflation algorithm. The experimental results indicate that our method can handle a wider range of input types and can produce physically fabricable wire shapes compared to previous wire generation methods. Various wire arts have been fabricated using our 3D-printed jig to demonstrate its effectiveness in 3D wire bending. acknowledgement: The authors thank the anonymous reviewers for their valuable comments and suggestions for improving the paper. This work was supported by JSPS KAKENHI Grant Numbers JP21K11910, 23KJ0699 and JST AdCORP, Grant Number JPMJKB2302, Japan. This work was partially supported by Israel Science Foundation Grant number 1390/19 and Joint NSFC-ISF Research Grant no. 3077/23. We thank Riku Toyota for his useful advice on wire selection and Takeo Igarashi for his assistance in arranging the collaboration of the authors. article_number: '134' article_processing_charge: No author: - first_name: Kenji full_name: Tojo, Kenji last_name: Tojo - first_name: Ariel full_name: Shamir, Ariel last_name: Shamir - first_name: Bernd full_name: Bickel, Bernd id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 - first_name: Nobuyuki full_name: Umetani, Nobuyuki last_name: Umetani citation: ama: 'Tojo K, Shamir A, Bickel B, Umetani N. Fabricable 3D wire art. In: SIGGRAPH ’24: ACM SIGGRAPH 2024 Conference Papers. ACM; 2024. doi:10.1145/3641519.3657453' apa: 'Tojo, K., Shamir, A., Bickel, B., & Umetani, N. (2024). Fabricable 3D wire art. In SIGGRAPH ’24: ACM SIGGRAPH 2024 Conference Papers. Denver, CO, United States: ACM. https://doi.org/10.1145/3641519.3657453' chicago: 'Tojo, Kenji, Ariel Shamir, Bernd Bickel, and Nobuyuki Umetani. “Fabricable 3D Wire Art.” In SIGGRAPH ’24: ACM SIGGRAPH 2024 Conference Papers. ACM, 2024. https://doi.org/10.1145/3641519.3657453.' ieee: 'K. Tojo, A. Shamir, B. Bickel, and N. Umetani, “Fabricable 3D wire art,” in SIGGRAPH ’24: ACM SIGGRAPH 2024 Conference Papers, Denver, CO, United States, 2024.' ista: 'Tojo K, Shamir A, Bickel B, Umetani N. 2024. Fabricable 3D wire art. SIGGRAPH ’24: ACM SIGGRAPH 2024 Conference Papers. SIGGRAPH: Computer Graphics and Interactive Techniques Conference, 134.' mla: 'Tojo, Kenji, et al. “Fabricable 3D Wire Art.” SIGGRAPH ’24: ACM SIGGRAPH 2024 Conference Papers, 134, ACM, 2024, doi:10.1145/3641519.3657453.' short: 'K. Tojo, A. Shamir, B. Bickel, N. Umetani, in:, SIGGRAPH ’24: ACM SIGGRAPH 2024 Conference Papers, ACM, 2024.' conference: end_date: 2024-08-01 location: Denver, CO, United States name: 'SIGGRAPH: Computer Graphics and Interactive Techniques Conference' start_date: 2024-07-28 corr_author: '1' date_created: 2025-01-27T13:47:35Z date_published: 2024-07-01T00:00:00Z date_updated: 2025-09-09T12:06:57Z day: '01' department: - _id: BeBi doi: 10.1145/3641519.3657453 external_id: isi: - '001282218200059' isi: 1 language: - iso: eng month: '07' oa_version: None publication: 'SIGGRAPH ''24: ACM SIGGRAPH 2024 Conference Papers' publication_identifier: isbn: - '9798400705250' publication_status: published publisher: ACM quality_controlled: '1' scopus_import: '1' status: public title: Fabricable 3D wire art type: conference user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 year: '2024' ... --- OA_place: publisher OA_type: hybrid _id: '18913' abstract: - lang: eng text: "With the proliferation of blockchain technology in high-value sectors, consensus protocols are becoming critical infrastructures. The rapid innovation cycle in Byzantine fault tolerant (BFT) consensus protocols has culminated in HotStuff, which provides linear message complexity in the partially synchronous setting. To achieve this, HotStuff leverages a leader that collects, aggregates, and broadcasts the messages of other validators. This paper analyzes the security implications of such approaches in practice, from the perspective of liveness and availability.\r\nBy implementing attacks in a globally-distributed testbed, we show that state-of-the-art leader-based protocols are vulnerable to denial-of-service (DoS) attacks on the leader. Our attacks, demonstrated on committees of up to 64 validators, manage to disrupt liveness within seconds, using only a few tens of Mbps of attack bandwidth per validator. Crucially, the cost and effectiveness of the attacks are independent of the committee size. Based on the outcome of these experiments, we then propose and test effective mitigations. Our findings show that advancements in both protocol design and network-layer defenses can greatly improve the practical resilience of BFT consensus protocols." acknowledgement: This work was mostly realized while Alberto Sonnino and Lefteris Kokoris-Kogias were employed at Meta. We gratefully acknowledge support for this project from ETH Zurich and Mysten Labs. article_processing_charge: Yes (in subscription journal) author: - first_name: Giacomo full_name: Giuliari, Giacomo last_name: Giuliari - first_name: Alberto full_name: Sonnino, Alberto last_name: Sonnino - first_name: Marc full_name: Frei, Marc last_name: Frei - first_name: Fabio full_name: Streun, Fabio last_name: Streun - first_name: Eleftherios full_name: Kokoris Kogias, Eleftherios id: f5983044-d7ef-11ea-ac6d-fd1430a26d30 last_name: Kokoris Kogias - first_name: Adrian full_name: Perrig, Adrian last_name: Perrig citation: ama: 'Giuliari G, Sonnino A, Frei M, Streun F, Kokoris Kogias E, Perrig A. An empirical study of consensus protocols’ DoS resilience. In: Proceedings of the 19th ACM Asia Conference on Computer and Communications Security. ACM; 2024:1345-1360. doi:10.1145/3634737.3656997' apa: 'Giuliari, G., Sonnino, A., Frei, M., Streun, F., Kokoris Kogias, E., & Perrig, A. (2024). An empirical study of consensus protocols’ DoS resilience. In Proceedings of the 19th ACM Asia Conference on Computer and Communications Security (pp. 1345–1360). Singapore, Singapore: ACM. https://doi.org/10.1145/3634737.3656997' chicago: Giuliari, Giacomo, Alberto Sonnino, Marc Frei, Fabio Streun, Eleftherios Kokoris Kogias, and Adrian Perrig. “An Empirical Study of Consensus Protocols’ DoS Resilience.” In Proceedings of the 19th ACM Asia Conference on Computer and Communications Security, 1345–60. ACM, 2024. https://doi.org/10.1145/3634737.3656997. ieee: G. Giuliari, A. Sonnino, M. Frei, F. Streun, E. Kokoris Kogias, and A. Perrig, “An empirical study of consensus protocols’ DoS resilience,” in Proceedings of the 19th ACM Asia Conference on Computer and Communications Security, Singapore, Singapore, 2024, pp. 1345–1360. ista: 'Giuliari G, Sonnino A, Frei M, Streun F, Kokoris Kogias E, Perrig A. 2024. An empirical study of consensus protocols’ DoS resilience. Proceedings of the 19th ACM Asia Conference on Computer and Communications Security. ASIACCS: Asia Conference on Computer and Communications Security, 1345–1360.' mla: Giuliari, Giacomo, et al. “An Empirical Study of Consensus Protocols’ DoS Resilience.” Proceedings of the 19th ACM Asia Conference on Computer and Communications Security, ACM, 2024, pp. 1345–60, doi:10.1145/3634737.3656997. short: G. Giuliari, A. Sonnino, M. Frei, F. Streun, E. Kokoris Kogias, A. Perrig, in:, Proceedings of the 19th ACM Asia Conference on Computer and Communications Security, ACM, 2024, pp. 1345–1360. conference: end_date: 2024-07-05 location: Singapore, Singapore name: 'ASIACCS: Asia Conference on Computer and Communications Security' start_date: 2024-07-01 date_created: 2025-01-27T13:57:00Z date_published: 2024-07-01T00:00:00Z date_updated: 2025-09-09T12:07:28Z day: '01' ddc: - '000' department: - _id: ElKo doi: 10.1145/3634737.3656997 external_id: isi: - '001283918100095' file: - access_level: open_access checksum: 1e743ddf49d35390eb56e11eb0759150 content_type: application/pdf creator: dernst date_created: 2025-01-27T14:04:12Z date_updated: 2025-01-27T14:04:12Z file_id: '18914' file_name: 2024_ACMAsiaCCS_Giuliari.pdf file_size: 951940 relation: main_file success: 1 file_date_updated: 2025-01-27T14:04:12Z has_accepted_license: '1' isi: 1 language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 1345-1360 publication: Proceedings of the 19th ACM Asia Conference on Computer and Communications Security publication_identifier: isbn: - '9798400704826' publication_status: published publisher: ACM quality_controlled: '1' scopus_import: '1' status: public title: An empirical study of consensus protocols’ DoS resilience tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 year: '2024' ... --- OA_place: publisher OA_type: gold _id: '18917' abstract: - lang: eng text: "An eight-partition of a finite set of points (respectively, of a continuous mass distribution) in ℝ³ consists of three planes that divide the space into 8 octants, such that each open octant contains at most 1/8 of the points (respectively, of the mass). In 1966, Hadwiger showed that any mass distribution in ℝ³ admits an eight-partition; moreover, one can prescribe the normal direction of one of the three planes. The analogous result for finite point sets follows by a standard limit argument.\r\nWe prove the following variant of this result: Any mass distribution (or point set) in ℝ³ admits an eight-partition for which the intersection of two of the planes is a line with a prescribed direction.\r\nMoreover, we present an efficient algorithm for calculating an eight-partition of a set of n points in ℝ³ (with prescribed normal direction of one of the planes) in time O^*(n^{5/2})." acknowledgement: "Aronov, Boris: Work has been supported by NSF grants CCF 15-40656 and CCF 20-08551, and by grant 2014/170 from the US-Israel Binational Science Foundation. Part of this research was conducted while BA was visiting ISTA in the summers of 2022 and 2023. The visit of BA to ISTA in the summer of 2022 was supported by an ISTA Visiting Professorship.\r\nBasit, Abdul: Work has been supported by Australian Research Council grant DP220102212.\r\nRamesh, Indu: Work supported by a Tandon School of Engineering Fellowship and by NSF Grant CCF-20-08551.\r\nBA and AB would like to thank William Steiger for insightful initial discussions of the problems addressed in this work." article_processing_charge: Yes arxiv: 1 author: - first_name: Boris full_name: Aronov, Boris last_name: Aronov - first_name: Abdul full_name: Basit, Abdul last_name: Basit - first_name: Indu full_name: Ramesh, Indu last_name: Ramesh - first_name: Gianluca full_name: Tasinato, Gianluca id: 0433290C-AF8F-11E9-A4C7-F729E6697425 last_name: Tasinato - first_name: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 citation: ama: 'Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. Eight-partitioning points in 3D, and efficiently too. In: 40th International Symposium on Computational Geometry. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024:8:1-8:15. doi:10.4230/LIPIcs.SoCG.2024.8' apa: 'Aronov, B., Basit, A., Ramesh, I., Tasinato, G., & Wagner, U. (2024). Eight-partitioning points in 3D, and efficiently too. In 40th International Symposium on Computational Geometry (Vol. 293, p. 8:1-8:15). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2024.8' chicago: Aronov, Boris, Abdul Basit, Indu Ramesh, Gianluca Tasinato, and Uli Wagner. “Eight-Partitioning Points in 3D, and Efficiently Too.” In 40th International Symposium on Computational Geometry, 293:8:1-8:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.SoCG.2024.8. ieee: B. Aronov, A. Basit, I. Ramesh, G. Tasinato, and U. Wagner, “Eight-partitioning points in 3D, and efficiently too,” in 40th International Symposium on Computational Geometry, Athens, Greece, 2024, vol. 293, p. 8:1-8:15. ista: 'Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. 2024. Eight-partitioning points in 3D, and efficiently too. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry vol. 293, 8:1-8:15.' mla: Aronov, Boris, et al. “Eight-Partitioning Points in 3D, and Efficiently Too.” 40th International Symposium on Computational Geometry, vol. 293, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 8:1-8:15, doi:10.4230/LIPIcs.SoCG.2024.8. short: B. Aronov, A. Basit, I. Ramesh, G. Tasinato, U. Wagner, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 8:1-8:15. conference: end_date: 2024-06-14 location: Athens, Greece name: 'SoCG: Symposium on Computational Geometry' start_date: 2024-06-11 corr_author: '1' date_created: 2025-01-27T14:19:17Z date_published: 2024-06-06T00:00:00Z date_updated: 2026-06-18T18:18:27Z day: '06' ddc: - '510' department: - _id: UlWa - _id: GradSch doi: 10.4230/LIPIcs.SoCG.2024.8 external_id: arxiv: - '2403.02627' file: - access_level: open_access checksum: 443aa29ea5d948e917cfccd681dcf176 content_type: application/pdf creator: dernst date_created: 2025-01-27T14:17:37Z date_updated: 2025-01-27T14:17:37Z file_id: '18918' file_name: 2024_LIPICs_Aronov.pdf file_size: 880725 relation: main_file success: 1 file_date_updated: 2025-01-27T14:17:37Z has_accepted_license: '1' intvolume: ' 293' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 8:1-8:15 publication: 40th International Symposium on Computational Geometry publication_identifier: isbn: - '9783959773164' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' related_material: record: - id: '19860' relation: later_version status: public scopus_import: '1' status: public title: Eight-partitioning points in 3D, and efficiently too tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 293 year: '2024' ... --- OA_type: closed access _id: '18919' abstract: - lang: eng text: The integration of theory and experiment makes possible tracking the slow evolution of a photodoped Mott insulator to a distinct non-equilibrium metallic phase under the influence of electron-lattice coupling. article_processing_charge: No article_type: letter_note author: - first_name: Denitsa Rangelova full_name: Baykusheva, Denitsa Rangelova id: 71b4d059-2a03-11ee-914d-dfa3beed6530 last_name: Baykusheva citation: ama: Baykusheva DR. Through the slopes of a light-induced phase transition. Nature Physics. 2024;20(5):684-685. doi:10.1038/s41567-024-02401-7 apa: Baykusheva, D. R. (2024). Through the slopes of a light-induced phase transition. Nature Physics. Springer Nature. https://doi.org/10.1038/s41567-024-02401-7 chicago: Baykusheva, Denitsa Rangelova. “Through the Slopes of a Light-Induced Phase Transition.” Nature Physics. Springer Nature, 2024. https://doi.org/10.1038/s41567-024-02401-7. ieee: D. R. Baykusheva, “Through the slopes of a light-induced phase transition,” Nature Physics, vol. 20, no. 5. Springer Nature, pp. 684–685, 2024. ista: Baykusheva DR. 2024. Through the slopes of a light-induced phase transition. Nature Physics. 20(5), 684–685. mla: Baykusheva, Denitsa Rangelova. “Through the Slopes of a Light-Induced Phase Transition.” Nature Physics, vol. 20, no. 5, Springer Nature, 2024, pp. 684–85, doi:10.1038/s41567-024-02401-7. short: D.R. Baykusheva, Nature Physics 20 (2024) 684–685. corr_author: '1' date_created: 2025-01-27T14:29:20Z date_published: 2024-05-01T00:00:00Z date_updated: 2025-09-09T12:08:10Z day: '01' department: - _id: DeBa doi: 10.1038/s41567-024-02401-7 external_id: isi: - '001162208200002' intvolume: ' 20' isi: 1 issue: '5' language: - iso: eng month: '05' oa_version: None page: 684-685 publication: Nature Physics publication_identifier: eissn: - 1745-2481 issn: - 1745-2473 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Through the slopes of a light-induced phase transition type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 20 year: '2024' ...