--- _id: '13173' abstract: - lang: eng text: GABAB receptor (GBR) activation inhibits neurotransmitter release in axon terminals in the brain, except in medial habenula (MHb) terminals, which show robust potentiation. However, mechanisms underlying this enigmatic potentiation remain elusive. Here, we report that GBR activation on MHb terminals induces an activity-dependent transition from a facilitating, tonic to a depressing, phasic neurotransmitter release mode. This transition is accompanied by a 4.1-fold increase in readily releasable vesicle pool (RRP) size and a 3.5-fold increase of docked synaptic vesicles at the presynaptic active zone (AZ). Strikingly, tonic and phasic release exhibit distinct coupling distances and are selectively affected by deletion of synaptoporin (SPO) and Ca2+-dependent activator protein for secretion 2 (CAPS2), respectively. SPO modulates augmentation, the short-term plasticity associated with tonic release, and CAPS2 retains the increased RRP for initial responses in phasic response trains. Double pre-embedding immunolabeling confirmed the co-localization of CAPS2 and SPO inside the same terminal. The cytosolic protein CAPS2 showed a synaptic vesicle (SV)-associated distribution similar to the vesicular transmembrane protein SPO. A newly developed “Flash and Freeze-fracture” method revealed the release of SPO-associated vesicles in both tonic and phasic modes and activity-dependent recruitment of CAPS2 to the AZ during phasic release, which lasted several minutes. Overall, these results indicate that GBR activation translocates CAPS2 to the AZ along with the fusion of CAPS2-associated SVs, contributing to a persistent RRP increase. Thus, we discovered structural and molecular mechanisms underlying tonic and phasic neurotransmitter release and their transition by GBR activation in MHb terminals. article_processing_charge: No author: - first_name: Ryuichi full_name: Shigemoto, Ryuichi id: 499F3ABC-F248-11E8-B48F-1D18A9856A87 last_name: Shigemoto orcid: 0000-0001-8761-9444 citation: ama: Shigemoto R. Transition from tonic to phasic neurotransmitter release by presynaptic GABAB receptor activation in medial habenula terminals. 2023. doi:10.15479/AT:ISTA:13173 apa: Shigemoto, R. (2023). Transition from tonic to phasic neurotransmitter release by presynaptic GABAB receptor activation in medial habenula terminals. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:13173 chicago: Shigemoto, Ryuichi. “Transition from Tonic to Phasic Neurotransmitter Release by Presynaptic GABAB Receptor Activation in Medial Habenula Terminals.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/AT:ISTA:13173. ieee: R. Shigemoto, “Transition from tonic to phasic neurotransmitter release by presynaptic GABAB receptor activation in medial habenula terminals.” Institute of Science and Technology Austria, 2023. ista: Shigemoto R. 2023. Transition from tonic to phasic neurotransmitter release by presynaptic GABAB receptor activation in medial habenula terminals, Institute of Science and Technology Austria, 10.15479/AT:ISTA:13173. mla: Shigemoto, Ryuichi. Transition from Tonic to Phasic Neurotransmitter Release by Presynaptic GABAB Receptor Activation in Medial Habenula Terminals. Institute of Science and Technology Austria, 2023, doi:10.15479/AT:ISTA:13173. short: R. Shigemoto, (2023). date_created: 2023-06-29T13:16:42Z date_published: 2023-07-29T00:00:00Z date_updated: 2024-03-12T13:44:18Z day: '29' ddc: - '571' department: - _id: RySh doi: 10.15479/AT:ISTA:13173 file: - access_level: closed checksum: ed59170869ba621f89f7c1894092192f content_type: application/x-zip-compressed creator: shigemot date_created: 2023-06-29T13:11:22Z date_updated: 2023-11-17T14:30:44Z description: After review an updated version of the data is provided file_id: '13174' file_name: Raw data for Koppensteiner et al.zip file_size: 542873672 relation: main_file title: Outdated Version - access_level: open_access checksum: c07860eb82b4d367245f1b589fe5c250 content_type: application/vnd.openxmlformats-officedocument.spreadsheetml.sheet creator: patrickd date_created: 2023-11-17T14:13:02Z date_updated: 2023-11-17T14:13:02Z file_id: '14550' file_name: 11-17-23 Updated Koppensteiner et al. raw data.xlsx file_size: 915079 relation: main_file success: 1 - access_level: open_access checksum: abf84b1699edac4349dc3a92d466fb7b content_type: application/x-zip-compressed creator: dernst date_created: 2024-02-06T07:21:43Z date_updated: 2024-02-06T07:21:43Z file_id: '14942' file_name: EM_Images.zip file_size: 544868924 relation: main_file success: 1 file_date_updated: 2024-02-06T07:21:43Z has_accepted_license: '1' keyword: - medial habenula - GABAB receptor - vesicle release - Flash and Freeze - Flash and Freeze-fracture month: '07' oa: 1 oa_version: Published Version publisher: Institute of Science and Technology Austria related_material: record: - id: '15084' relation: used_in_publication status: public status: public title: Transition from tonic to phasic neurotransmitter release by presynaptic GABAB receptor activation in medial habenula terminals 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: research_data user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2023' ... --- _id: '13236' abstract: - lang: eng text: We present an auction algorithm using multiplicative instead of constant weight updates to compute a (1−ε)-approximate maximum weight matching (MWM) in a bipartite graph with n vertices and m edges in time O(mε−1log(ε−1)), matching the running time of the linear-time approximation algorithm of Duan and Pettie [JACM ’14]. Our algorithm is very simple and it can be extended to give a dynamic data structure that maintains a (1−ε)-approximate maximum weight matching under (1) one-sided vertex deletions (with incident edges) and (2) one-sided vertex insertions (with incident edges sorted by weight) to the other side. The total time time used is O(mε−1log(ε−1)), where m is the sum of the number of initially existing and inserted edges. acknowledgement: The first author thanks to Chandra Chekuri for useful discussions about this paper. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 101019564 “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)” and from the Austrian Science Fund (FWF) project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024. alternative_title: - LNCS article_processing_charge: No author: - first_name: Da Wei full_name: Zheng, Da Wei last_name: Zheng - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 citation: ama: 'Zheng DW, Henzinger MH. Multiplicative auction algorithm for approximate maximum weight bipartite matching. In: International Conference on Integer Programming and Combinatorial Optimization. Vol 13904. Springer Nature; 2023:453-465. doi:10.1007/978-3-031-32726-1_32' apa: 'Zheng, D. W., & Henzinger, M. H. (2023). Multiplicative auction algorithm for approximate maximum weight bipartite matching. In International Conference on Integer Programming and Combinatorial Optimization (Vol. 13904, pp. 453–465). Madison, WI, United States: Springer Nature. https://doi.org/10.1007/978-3-031-32726-1_32' chicago: Zheng, Da Wei, and Monika H Henzinger. “Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching.” In International Conference on Integer Programming and Combinatorial Optimization, 13904:453–65. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-32726-1_32. ieee: D. W. Zheng and M. H. Henzinger, “Multiplicative auction algorithm for approximate maximum weight bipartite matching,” in International Conference on Integer Programming and Combinatorial Optimization, Madison, WI, United States, 2023, vol. 13904, pp. 453–465. ista: 'Zheng DW, Henzinger MH. 2023. Multiplicative auction algorithm for approximate maximum weight bipartite matching. International Conference on Integer Programming and Combinatorial Optimization. IPCO: Integer Programming and Combinatorial Optimization, LNCS, vol. 13904, 453–465.' mla: Zheng, Da Wei, and Monika H. Henzinger. “Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching.” International Conference on Integer Programming and Combinatorial Optimization, vol. 13904, Springer Nature, 2023, pp. 453–65, doi:10.1007/978-3-031-32726-1_32. short: D.W. Zheng, M.H. Henzinger, in:, International Conference on Integer Programming and Combinatorial Optimization, Springer Nature, 2023, pp. 453–465. conference: end_date: 2023-06-23 location: Madison, WI, United States name: 'IPCO: Integer Programming and Combinatorial Optimization' start_date: 2023-06-21 date_created: 2023-07-16T22:01:11Z date_published: 2023-05-22T00:00:00Z date_updated: 2024-03-19T08:32:32Z day: '22' department: - _id: MoHe doi: 10.1007/978-3-031-32726-1_32 ec_funded: 1 external_id: arxiv: - '2301.09217' intvolume: ' 13904' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2301.09217 month: '05' oa: 1 oa_version: Preprint page: 453-465 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: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe grant_number: 'P33775 ' name: Fast Algorithms for a Reactive Network Layer publication: International Conference on Integer Programming and Combinatorial Optimization publication_identifier: eissn: - 1611-3349 isbn: - '9783031327254' issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '15121' relation: later_version status: public scopus_import: '1' status: public title: Multiplicative auction algorithm for approximate maximum weight bipartite matching type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 13904 year: '2023' ... --- _id: '13182' abstract: - lang: eng text: "We characterize critical points of 1-dimensional maps paired in persistent homology\r\ngeometrically and this way get elementary proofs of theorems about the symmetry\r\nof persistence diagrams and the variation of such maps. In particular, we identify\r\nbranching points and endpoints of networks as the sole source of asymmetry and\r\nrelate the cycle basis in persistent homology with a version of the stable marriage\r\nproblem. Our analysis provides the foundations of fast algorithms for maintaining a\r\ncollection of sorted lists together with its persistence diagram." acknowledgement: Open access funding provided by Austrian Science Fund (FWF). This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, grant no. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), Grant No. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), Grant No. I 02979-N35. The authors of this paper thank anonymous reviewers for their constructive criticism and Monika Henzinger for detailed comments on an earlier version of this paper. article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Ranita full_name: Biswas, Ranita id: 3C2B033E-F248-11E8-B48F-1D18A9856A87 last_name: Biswas orcid: 0000-0002-5372-7890 - first_name: Sebastiano full_name: Cultrera Di Montesano, Sebastiano id: 34D2A09C-F248-11E8-B48F-1D18A9856A87 last_name: Cultrera Di Montesano orcid: 0000-0001-6249-0832 - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Morteza full_name: Saghafian, Morteza id: f86f7148-b140-11ec-9577-95435b8df824 last_name: Saghafian citation: ama: Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. Geometric characterization of the persistence of 1D maps. Journal of Applied and Computational Topology. 2023. doi:10.1007/s41468-023-00126-9 apa: Biswas, R., Cultrera di Montesano, S., Edelsbrunner, H., & Saghafian, M. (2023). Geometric characterization of the persistence of 1D maps. Journal of Applied and Computational Topology. Springer Nature. https://doi.org/10.1007/s41468-023-00126-9 chicago: Biswas, Ranita, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, and Morteza Saghafian. “Geometric Characterization of the Persistence of 1D Maps.” Journal of Applied and Computational Topology. Springer Nature, 2023. https://doi.org/10.1007/s41468-023-00126-9. ieee: R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, and M. Saghafian, “Geometric characterization of the persistence of 1D maps,” Journal of Applied and Computational Topology. Springer Nature, 2023. ista: Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. 2023. Geometric characterization of the persistence of 1D maps. Journal of Applied and Computational Topology. mla: Biswas, Ranita, et al. “Geometric Characterization of the Persistence of 1D Maps.” Journal of Applied and Computational Topology, Springer Nature, 2023, doi:10.1007/s41468-023-00126-9. short: R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, M. Saghafian, Journal of Applied and Computational Topology (2023). date_created: 2023-07-02T22:00:44Z date_published: 2023-06-17T00:00:00Z date_updated: 2024-03-20T09:36:56Z day: '17' ddc: - '000' department: - _id: HeEd doi: 10.1007/s41468-023-00126-9 ec_funded: 1 file: - access_level: open_access checksum: 697249d5d1c61dea4410b9f021b70fce content_type: application/pdf creator: alisjak date_created: 2023-07-03T09:41:05Z date_updated: 2023-07-03T09:41:05Z file_id: '13185' file_name: 2023_Journal of Applied and Computational Topology_Biswas.pdf file_size: 487355 relation: main_file success: 1 file_date_updated: 2023-07-03T09:41:05Z has_accepted_license: '1' language: - iso: eng month: '06' oa: 1 oa_version: Published Version project: - _id: 266A2E9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '788183' name: Alpha Shape Theory Extended - _id: 0aa4bc98-070f-11eb-9043-e6fff9c6a316 grant_number: I4887 name: Discretization in Geometry and Dynamics - _id: 268116B8-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z00342 name: The Wittgenstein Prize publication: Journal of Applied and Computational Topology publication_identifier: eissn: - 2367-1734 issn: - 2367-1726 publication_status: epub_ahead publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '15094' relation: dissertation_contains status: public scopus_import: '1' status: public title: Geometric characterization of the persistence of 1D maps 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2023' ... --- _id: '13044' abstract: - lang: eng text: Singlet oxygen (1O2) formation is now recognised as a key aspect of non-aqueous oxygen redox chemistry. For identifying 1O2, chemical trapping via 9,10-dimethylanthracene (DMA) to form the endoperoxide (DMA-O2) has become the mainstay method due to its sensitivity, selectivity, and ease of use. While DMA has been shown to be selective for 1O2, rather than forming DMA-O2 with a wide variety of potentially reactive O-containing species, false positives might hypothetically be obtained in the presence of previously overlooked species. Here, we first give unequivocal direct spectroscopic proof by the 1O2-specific near infrared (NIR) emission at 1270 nm for the previously proposed 1O2 formation pathways, which centre around superoxide disproportionation. We then show that peroxocarbonates, common intermediates in metal-O2 and metal carbonate electrochemistry, do not produce false-positive DMA-O2. Moreover, we identify a previously unreported 1O2-forming pathway through the reaction of CO2 with superoxide. Overall, we give unequivocal proof for 1O2 formation in non-aqueous oxygen redox and show that chemical trapping with DMA is a reliable method to assess 1O2 formation. article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Soumyadip full_name: Mondal, Soumyadip id: d25d21ef-dc8d-11ea-abe3-ec4576307f48 last_name: Mondal - first_name: Rajesh B full_name: Jethwa, Rajesh B id: 4cc538d5-803f-11ed-ab7e-8139573aad8f last_name: Jethwa orcid: 0000-0002-0404-4356 - first_name: Bhargavi full_name: Pant, Bhargavi id: 50c64d4d-eb97-11eb-a6c2-d33e5e14f112 last_name: Pant - first_name: Robert full_name: Hauschild, Robert id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87 last_name: Hauschild orcid: 0000-0001-9843-3522 - first_name: Stefan Alexander full_name: Freunberger, Stefan Alexander id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425 last_name: Freunberger orcid: 0000-0003-2902-5319 citation: ama: 'Mondal S, Jethwa RB, Pant B, Hauschild R, Freunberger SA. Singlet oxygen in non-aqueous oxygen redox: Direct spectroscopic evidence for formation pathways and reliability of chemical probes. Faraday Discussions. 2023. doi:10.1039/d3fd00088e' apa: 'Mondal, S., Jethwa, R. B., Pant, B., Hauschild, R., & Freunberger, S. A. (2023). Singlet oxygen in non-aqueous oxygen redox: Direct spectroscopic evidence for formation pathways and reliability of chemical probes. Faraday Discussions. Royal Society of Chemistry. https://doi.org/10.1039/d3fd00088e' chicago: 'Mondal, Soumyadip, Rajesh B Jethwa, Bhargavi Pant, Robert Hauschild, and Stefan Alexander Freunberger. “Singlet Oxygen in Non-Aqueous Oxygen Redox: Direct Spectroscopic Evidence for Formation Pathways and Reliability of Chemical Probes.” Faraday Discussions. Royal Society of Chemistry, 2023. https://doi.org/10.1039/d3fd00088e.' ieee: 'S. Mondal, R. B. Jethwa, B. Pant, R. Hauschild, and S. A. Freunberger, “Singlet oxygen in non-aqueous oxygen redox: Direct spectroscopic evidence for formation pathways and reliability of chemical probes,” Faraday Discussions. Royal Society of Chemistry, 2023.' ista: 'Mondal S, Jethwa RB, Pant B, Hauschild R, Freunberger SA. 2023. Singlet oxygen in non-aqueous oxygen redox: Direct spectroscopic evidence for formation pathways and reliability of chemical probes. Faraday Discussions.' mla: 'Mondal, Soumyadip, et al. “Singlet Oxygen in Non-Aqueous Oxygen Redox: Direct Spectroscopic Evidence for Formation Pathways and Reliability of Chemical Probes.” Faraday Discussions, Royal Society of Chemistry, 2023, doi:10.1039/d3fd00088e.' short: S. Mondal, R.B. Jethwa, B. Pant, R. Hauschild, S.A. Freunberger, Faraday Discussions (2023). date_created: 2023-05-22T06:53:34Z date_published: 2023-05-17T00:00:00Z date_updated: 2024-03-20T13:10:00Z day: '17' department: - _id: StFr - _id: Bio doi: 10.1039/d3fd00088e external_id: isi: - '001070423500001' isi: 1 keyword: - Physical and Theoretical Chemistry language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1039/d3fd00088e month: '05' oa: 1 oa_version: Published Version publication: Faraday Discussions publication_identifier: eissn: - 1364-5498 issn: - 1359-6640 publication_status: epub_ahead publisher: Royal Society of Chemistry quality_controlled: '1' status: public title: 'Singlet oxygen in non-aqueous oxygen redox: Direct spectroscopic evidence for formation pathways and reliability of chemical probes' 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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2023' ... --- _id: '14587' abstract: - lang: eng text: "This thesis concerns the application of variational methods to the study of evolution problems arising in fluid mechanics and in material sciences. The main focus is on weak-strong stability properties of some curvature driven interface evolution problems, such as the two-phase Navier–Stokes flow with surface tension and multiphase mean curvature flow, and on the phase-field approximation of the latter. Furthermore, we discuss a variational approach to the study of a class of doubly nonlinear wave equations.\r\nFirst, we consider the two-phase Navier–Stokes flow with surface tension within a bounded domain. The two fluids are immiscible and separated by a sharp interface, which intersects the boundary of the domain at a constant contact angle of ninety degree. We devise a suitable concept of varifolds solutions for the associated interface evolution problem and we establish a weak-strong uniqueness principle in case of a two dimensional ambient space. In order to focus on the boundary effects and on the singular geometry of the evolving domains, we work for simplicity in the regime of same viscosities for the two fluids.\r\nThe core of the thesis consists in the rigorous proof of the convergence of the vectorial Allen-Cahn equation towards multiphase mean curvature flow for a suitable class of multi- well potentials and for well-prepared initial data. We even establish a rate of convergence. Our relative energy approach relies on the concept of gradient-flow calibration for branching singularities in multiphase mean curvature flow and thus enables us to overcome the limitations of other approaches. To the best of the author’s knowledge, our result is the first quantitative and unconditional one available in the literature for the vectorial/multiphase setting.\r\nThis thesis also contains a first study of weak-strong stability for planar multiphase mean curvature flow beyond the singularity resulting from a topology change. Previous weak-strong results are indeed limited to time horizons before the first topology change of the strong solution. We consider circular topology changes and we prove weak-strong stability for BV solutions to planar multiphase mean curvature flow beyond the associated singular times by dynamically adapting the strong solutions to the weak one by means of a space-time shift.\r\nIn the context of interface evolution problems, our proofs for the main results of this thesis are based on the relative energy technique, relying on novel suitable notions of relative energy functionals, which in particular measure the interface error. Our statements follow from the resulting stability estimates for the relative energy associated to the problem.\r\nAt last, we introduce a variational approach to the study of nonlinear evolution problems. This approach hinges on the minimization of a parameter dependent family of convex functionals over entire trajectories, known as Weighted Inertia-Dissipation-Energy (WIDE) functionals. We consider a class of doubly nonlinear wave equations and establish the convergence, up to subsequences, of the associated WIDE minimizers to a solution of the target problem as the parameter goes to zero." acknowledgement: The research projects contained in this thesis have received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 948819). alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Alice full_name: Marveggio, Alice id: 25647992-AA84-11E9-9D75-8427E6697425 last_name: Marveggio citation: ama: Marveggio A. Weak-strong stability and phase-field approximation of interface evolution problems in fluid mechanics and in material sciences. 2023. doi:10.15479/at:ista:14587 apa: Marveggio, A. (2023). Weak-strong stability and phase-field approximation of interface evolution problems in fluid mechanics and in material sciences. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:14587 chicago: Marveggio, Alice. “Weak-Strong Stability and Phase-Field Approximation of Interface Evolution Problems in Fluid Mechanics and in Material Sciences.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:14587. ieee: A. Marveggio, “Weak-strong stability and phase-field approximation of interface evolution problems in fluid mechanics and in material sciences,” Institute of Science and Technology Austria, 2023. ista: Marveggio A. 2023. Weak-strong stability and phase-field approximation of interface evolution problems in fluid mechanics and in material sciences. Institute of Science and Technology Austria. mla: Marveggio, Alice. Weak-Strong Stability and Phase-Field Approximation of Interface Evolution Problems in Fluid Mechanics and in Material Sciences. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:14587. short: A. Marveggio, Weak-Strong Stability and Phase-Field Approximation of Interface Evolution Problems in Fluid Mechanics and in Material Sciences, Institute of Science and Technology Austria, 2023. date_created: 2023-11-21T11:41:05Z date_published: 2023-11-21T00:00:00Z date_updated: 2024-03-22T13:21:28Z day: '21' ddc: - '515' degree_awarded: PhD department: - _id: GradSch - _id: JuFi doi: 10.15479/at:ista:14587 ec_funded: 1 file: - access_level: open_access checksum: 6c7db4cc86da6cdc79f7f358dc7755d4 content_type: application/pdf creator: amarvegg date_created: 2023-11-29T09:09:31Z date_updated: 2023-11-29T09:09:31Z file_id: '14626' file_name: thesis_Marveggio.pdf file_size: 2881100 relation: main_file success: 1 - access_level: closed checksum: 52f28bdf95ec82cff39f3685f9c48e7d content_type: application/zip creator: amarvegg date_created: 2023-11-29T09:10:19Z date_updated: 2024-03-20T12:28:32Z file_id: '14627' file_name: Thesis_Marveggio.zip file_size: 10189696 relation: source_file file_date_updated: 2024-03-20T12:28:32Z has_accepted_license: '1' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-sa/4.0/ month: '11' oa: 1 oa_version: Published Version page: '228' project: - _id: 0aa76401-070f-11eb-9043-b5bb049fa26d call_identifier: H2020 grant_number: '948819' name: Bridging Scales in Random Materials publication_identifier: issn: - 2663 - 337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '11842' relation: part_of_dissertation status: public - id: '14597' relation: part_of_dissertation status: public status: public supervisor: - first_name: Julian L full_name: Fischer, Julian L id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87 last_name: Fischer orcid: 0000-0002-0479-558X title: Weak-strong stability and phase-field approximation of interface evolution problems in fluid mechanics and in material sciences tmp: image: /images/cc_by_nc_sa.png legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) short: CC BY-NC-SA (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2023' ... --- _id: '14922' abstract: - lang: eng text: 'We propose a novel approach to concentration for non-independent random variables. The main idea is to ``pretend'''' that the random variables are independent and pay a multiplicative price measuring how far they are from actually being independent. This price is encapsulated in the Hellinger integral between the joint and the product of the marginals, which is then upper bounded leveraging tensorisation properties. Our bounds represent a natural generalisation of concentration inequalities in the presence of dependence: we recover exactly the classical bounds (McDiarmid''s inequality) when the random variables are independent. Furthermore, in a ``large deviations'''' regime, we obtain the same decay in the probability as for the independent case, even when the random variables display non-trivial dependencies. To show this, we consider a number of applications of interest. First, we provide a bound for Markov chains with finite state space. Then, we consider the Simple Symmetric Random Walk, which is a non-contracting Markov chain, and a non-Markovian setting in which the stochastic process depends on its entire past. To conclude, we propose an application to Markov Chain Monte Carlo methods, where our approach leads to an improved lower bound on the minimum burn-in period required to reach a certain accuracy. In all of these settings, we provide a regime of parameters in which our bound fares better than what the state of the art can provide.' acknowledgement: The authors are partially supported by the 2019 Lopez-Loreta Prize. They would also like to thank Professor Jan Maas for providing valuable suggestions and comments on an early version of the work. article_processing_charge: No author: - first_name: Amedeo Roberto full_name: Esposito, Amedeo Roberto id: 9583e921-e1ad-11ec-9862-cef099626dc9 last_name: Esposito - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 citation: ama: 'Esposito AR, Mondelli M. Concentration without independence via information measures. In: Proceedings of 2023 IEEE International Symposium on Information Theory. IEEE; 2023:400-405. doi:10.1109/isit54713.2023.10206899' apa: 'Esposito, A. R., & Mondelli, M. (2023). Concentration without independence via information measures. In Proceedings of 2023 IEEE International Symposium on Information Theory (pp. 400–405). Taipei, Taiwan: IEEE. https://doi.org/10.1109/isit54713.2023.10206899' chicago: Esposito, Amedeo Roberto, and Marco Mondelli. “Concentration without Independence via Information Measures.” In Proceedings of 2023 IEEE International Symposium on Information Theory, 400–405. IEEE, 2023. https://doi.org/10.1109/isit54713.2023.10206899. ieee: A. R. Esposito and M. Mondelli, “Concentration without independence via information measures,” in Proceedings of 2023 IEEE International Symposium on Information Theory, Taipei, Taiwan, 2023, pp. 400–405. ista: 'Esposito AR, Mondelli M. 2023. Concentration without independence via information measures. Proceedings of 2023 IEEE International Symposium on Information Theory. ISIT: IEEE International Symposium on Information Theory, 400–405.' mla: Esposito, Amedeo Roberto, and Marco Mondelli. “Concentration without Independence via Information Measures.” Proceedings of 2023 IEEE International Symposium on Information Theory, IEEE, 2023, pp. 400–05, doi:10.1109/isit54713.2023.10206899. short: A.R. Esposito, M. Mondelli, in:, Proceedings of 2023 IEEE International Symposium on Information Theory, IEEE, 2023, pp. 400–405. conference: end_date: 2023-06-30 location: Taipei, Taiwan name: 'ISIT: IEEE International Symposium on Information Theory' start_date: 2023-06-25 date_created: 2024-02-02T11:18:40Z date_published: 2023-06-30T00:00:00Z date_updated: 2024-03-25T07:15:51Z day: '30' department: - _id: MaMo doi: 10.1109/isit54713.2023.10206899 external_id: arxiv: - '2303.07245' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2303.07245 month: '06' oa: 1 oa_version: Preprint page: 400-405 project: - _id: 059876FA-7A3F-11EA-A408-12923DDC885E name: Prix Lopez-Loretta 2019 - Marco Mondelli publication: Proceedings of 2023 IEEE International Symposium on Information Theory publication_identifier: eisbn: - '9781665475549' eissn: - 2157-8117 publication_status: published publisher: IEEE quality_controlled: '1' related_material: record: - id: '15172' relation: later_version status: public status: public title: Concentration without independence via information measures type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2023' ... --- _id: '15173' abstract: - lang: eng text: 'We show that the number of linear spaces on a set of n points and the number of rank-3 matroids on a ground set of size n are both of the form (cn+o(n))n2/6, where c=e3√/2−3(1+3–√)/2. This is the final piece of the puzzle for enumerating fixed-rank matroids at this level of accuracy: the numbers of rank-1 and rank-2 matroids on a ground set of size n have exact representations in terms of well-known combinatorial functions, and it was recently proved by van der Hofstad, Pendavingh, and van der Pol that for constant r≥4 there are (e1−rn+o(n))nr−1/r! rank-r matroids on a ground set of size n. In our proof, we introduce a new approach for bounding the number of clique decompositions of a complete graph, using quasirandomness instead of the so-called entropy method that is common in this area.' acknowledgement: "Sah and Sawhney were supported by NSF Graduate Research Fellowship Program DGE-1745302. Sah was supported by the PD Soros Fellowship.\r\nWe thank Michael Simkin for helpful comments on the manuscript. We thank Zach Hunter for\r\nseveral corrections." article_processing_charge: Yes article_type: original author: - first_name: Matthew Alan full_name: Kwan, Matthew Alan id: 5fca0887-a1db-11eb-95d1-ca9d5e0453b3 last_name: Kwan orcid: 0000-0002-4003-7567 - first_name: Ashwin full_name: Sah, Ashwin last_name: Sah - first_name: Mehtaab full_name: Sawhney, Mehtaab last_name: Sawhney citation: ama: Kwan MA, Sah A, Sawhney M. Enumerating matroids and linear spaces. Comptes Rendus Mathematique. 2023;361(G2):565-575. doi:10.5802/crmath.423 apa: Kwan, M. A., Sah, A., & Sawhney, M. (2023). Enumerating matroids and linear spaces. Comptes Rendus Mathematique. Academie des Sciences. https://doi.org/10.5802/crmath.423 chicago: Kwan, Matthew Alan, Ashwin Sah, and Mehtaab Sawhney. “Enumerating Matroids and Linear Spaces.” Comptes Rendus Mathematique. Academie des Sciences, 2023. https://doi.org/10.5802/crmath.423. ieee: M. A. Kwan, A. Sah, and M. Sawhney, “Enumerating matroids and linear spaces,” Comptes Rendus Mathematique, vol. 361, no. G2. Academie des Sciences, pp. 565–575, 2023. ista: Kwan MA, Sah A, Sawhney M. 2023. Enumerating matroids and linear spaces. Comptes Rendus Mathematique. 361(G2), 565–575. mla: Kwan, Matthew Alan, et al. “Enumerating Matroids and Linear Spaces.” Comptes Rendus Mathematique, vol. 361, no. G2, Academie des Sciences, 2023, pp. 565–75, doi:10.5802/crmath.423. short: M.A. Kwan, A. Sah, M. Sawhney, Comptes Rendus Mathematique 361 (2023) 565–575. date_created: 2024-03-24T23:01:00Z date_published: 2023-02-01T00:00:00Z date_updated: 2024-03-25T07:23:15Z day: '01' ddc: - '510' department: - _id: MaKw doi: 10.5802/crmath.423 external_id: arxiv: - '2112.03788' file: - access_level: open_access checksum: d1d0e0a854a79ae95fb66d75d9117a68 content_type: application/pdf creator: dernst date_created: 2024-03-25T07:21:52Z date_updated: 2024-03-25T07:21:52Z file_id: '15174' file_name: 2023_ComptesRendusMath_Kwan.pdf file_size: 598097 relation: main_file success: 1 file_date_updated: 2024-03-25T07:21:52Z has_accepted_license: '1' intvolume: ' 361' issue: G2 language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: 565-575 publication: Comptes Rendus Mathematique publication_identifier: eissn: - 1778-3569 issn: - 1631-073X publication_status: published publisher: Academie des Sciences quality_controlled: '1' scopus_import: '1' status: public title: Enumerating matroids and linear spaces 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 361 year: '2023' ... --- _id: '14772' abstract: - lang: eng text: "Many coupled evolution equations can be described via 2×2-block operator matrices of the form A=[ \r\nA\tB\r\nC\tD\r\n ] in a product space X=X1×X2 with possibly unbounded entries. Here, the case of diagonally dominant block operator matrices is considered, that is, the case where the full operator A can be seen as a relatively bounded perturbation of its diagonal part with D(A)=D(A)×D(D) though with possibly large relative bound. For such operators the properties of sectoriality, R-sectoriality and the boundedness of the H∞-calculus are studied, and for these properties perturbation results for possibly large but structured perturbations are derived. Thereby, the time dependent parabolic problem associated with A can be analyzed in maximal Lpt\r\n-regularity spaces, and this is applied to a wide range of problems such as different theories for liquid crystals, an artificial Stokes system, strongly damped wave and plate equations, and a Keller-Segel model." acknowledgement: "We would like to thank Tim Binz, Emiel Lorist and Mark Veraar for valuable discussions. We also thank the anonymous referees for their helpful comments and suggestions, and for the very accurate reading of the manuscript.\r\nThe first author has been supported partially by the Nachwuchsring – Network for the promotion of young scientists – at TU Kaiserslautern. Both authors have been supported by MathApp – Mathematics Applied to Real-World Problems - part of the Research Initiative of the Federal State of Rhineland-Palatinate, Germany." article_number: '110146' article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Antonio full_name: Agresti, Antonio id: 673cd0cc-9b9a-11eb-b144-88f30e1fbb72 last_name: Agresti orcid: 0000-0002-9573-2962 - first_name: Amru full_name: Hussein, Amru last_name: Hussein citation: ama: Agresti A, Hussein A. Maximal Lp-regularity and H∞-calculus for block operator matrices and applications. Journal of Functional Analysis. 2023;285(11). doi:10.1016/j.jfa.2023.110146 apa: Agresti, A., & Hussein, A. (2023). Maximal Lp-regularity and H∞-calculus for block operator matrices and applications. Journal of Functional Analysis. Elsevier. https://doi.org/10.1016/j.jfa.2023.110146 chicago: Agresti, Antonio, and Amru Hussein. “Maximal Lp-Regularity and H∞-Calculus for Block Operator Matrices and Applications.” Journal of Functional Analysis. Elsevier, 2023. https://doi.org/10.1016/j.jfa.2023.110146. ieee: A. Agresti and A. Hussein, “Maximal Lp-regularity and H∞-calculus for block operator matrices and applications,” Journal of Functional Analysis, vol. 285, no. 11. Elsevier, 2023. ista: Agresti A, Hussein A. 2023. Maximal Lp-regularity and H∞-calculus for block operator matrices and applications. Journal of Functional Analysis. 285(11), 110146. mla: Agresti, Antonio, and Amru Hussein. “Maximal Lp-Regularity and H∞-Calculus for Block Operator Matrices and Applications.” Journal of Functional Analysis, vol. 285, no. 11, 110146, Elsevier, 2023, doi:10.1016/j.jfa.2023.110146. short: A. Agresti, A. Hussein, Journal of Functional Analysis 285 (2023). date_created: 2024-01-10T09:15:18Z date_published: 2023-12-01T00:00:00Z date_updated: 2024-03-25T11:37:14Z day: '01' ddc: - '510' department: - _id: JuFi doi: 10.1016/j.jfa.2023.110146 external_id: arxiv: - '2108.01962' isi: - '001081809000001' file: - access_level: open_access checksum: eda98ca2aa73da91bd074baed34c2b3c content_type: application/pdf creator: dernst date_created: 2024-01-10T11:23:57Z date_updated: 2024-01-10T11:23:57Z file_id: '14789' file_name: 2023_JourFunctionalAnalysis_Agresti.pdf file_size: 1120592 relation: main_file success: 1 file_date_updated: 2024-01-10T11:23:57Z has_accepted_license: '1' intvolume: ' 285' isi: 1 issue: '11' keyword: - Analysis language: - iso: eng month: '12' oa: 1 oa_version: Published Version publication: Journal of Functional Analysis publication_identifier: issn: - 0022-1236 publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: Maximal Lp-regularity and H∞-calculus for block operator matrices and applications 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 285 year: '2023' ... --- _id: '15128' abstract: - lang: eng text: "We prove a universal mesoscopic central limit theorem for linear eigenvalue statistics of a Wigner-type matrix inside the bulk of the spectrum with compactly supported twice continuously differentiable test functions. The main novel ingredient is an optimal local law for the two-point function $T(z,\\zeta)$ and a general class of related quantities involving two resolvents\r\nat nearby spectral parameters. " acknowledgement: Supported by the ERC Advanced Grant ”RMTBeyond” No. 101020331 article_number: '2301.01712' article_processing_charge: No author: - first_name: Volodymyr full_name: Riabov, Volodymyr id: 1949f904-edfb-11eb-afb5-e2dfddabb93b last_name: Riabov citation: ama: Riabov V. Mesoscopic eigenvalue statistics for Wigner-type matrices. arXiv. doi:10.48550/arXiv.2301.01712 apa: Riabov, V. (n.d.). Mesoscopic eigenvalue statistics for Wigner-type matrices. arXiv. https://doi.org/10.48550/arXiv.2301.01712 chicago: Riabov, Volodymyr. “Mesoscopic Eigenvalue Statistics for Wigner-Type Matrices.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2301.01712. ieee: V. Riabov, “Mesoscopic eigenvalue statistics for Wigner-type matrices,” arXiv. . ista: Riabov V. Mesoscopic eigenvalue statistics for Wigner-type matrices. arXiv, 2301.01712. mla: Riabov, Volodymyr. “Mesoscopic Eigenvalue Statistics for Wigner-Type Matrices.” ArXiv, 2301.01712, doi:10.48550/arXiv.2301.01712. short: V. Riabov, ArXiv (n.d.). date_created: 2024-03-20T09:41:04Z date_published: 2023-01-04T00:00:00Z date_updated: 2024-03-25T12:48:20Z day: '04' department: - _id: GradSch - _id: LaEr doi: 10.48550/arXiv.2301.01712 ec_funded: 1 external_id: arxiv: - '2301.01712' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2301.01712 month: '01' oa: 1 oa_version: Preprint project: - _id: 62796744-2b32-11ec-9570-940b20777f1d call_identifier: H2020 grant_number: '101020331' name: Random matrices beyond Wigner-Dyson-Mehta publication: arXiv publication_status: submitted status: public title: Mesoscopic eigenvalue statistics for Wigner-type matrices type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2023' ... --- _id: '12491' abstract: - lang: eng text: "The extracellular matrix (ECM) is a hydrated and complex three-dimensional network consisting of proteins, polysaccharides, and water. It provides structural scaffolding for the cells embedded within it and is essential in regulating numerous physiological processes, including cell migration and proliferation, wound healing, and stem cell fate. \r\nDespite extensive study, detailed structural knowledge of ECM components in physiologically relevant conditions is still rudimentary. This is due to methodological limitations in specimen preparation protocols which are incompatible with keeping large samples, such as the ECM, in their native state for subsequent imaging. Conventional electron microscopy (EM) techniques rely on fixation, dehydration, contrasting, and sectioning. This results in the alteration of a highly hydrated environment and the potential introduction of artifacts. Other structural biology techniques, such as nuclear magnetic resonance (NMR) spectroscopy and X-ray crystallography, allow high-resolution analysis of protein structures but only work on homogenous and purified samples, hence lacking contextual information. Currently, no approach exists for the ultrastructural and structural study of extracellular components under native conditions in a physiological, 3D environment. \r\nIn this thesis, I have developed a workflow that allows for the ultrastructural analysis of the ECM in near-native conditions at molecular resolution. The developments I introduced include implementing a novel specimen preparation workflow for cell-derived matrices (CDMs) to render them compatible with ion-beam milling and subsequent high-resolution cryo-electron tomography (ET). \r\nTo this end, I have established protocols to generate CDMs grown over several weeks on EM grids that are compatible with downstream cryo-EM sample preparation and imaging techniques. Characterization of these ECMs confirmed that they contain essential ECM components such as collagen I, collagen VI, and fibronectin I in high abundance and hence represent a bona fide biologically-relevant sample. I successfully optimized vitrification of these specimens by testing various vitrification techniques and cryoprotectants. \r\nIn order to obtain high-resolution molecular insights into the ultrastructure and organization of CDMs, I established cryo-focused ion beam scanning electron microscopy (FIBSEM) on these challenging and complex specimens. I explored different approaches for the creation of thin cryo-lamellae by FIB milling and succeeded in optimizing the cryo-lift-out technique, resulting in high-quality lamellae of approximately 200 nm thickness. \r\nHigh-resolution Cryo-ET of these lamellae revealed for the first time the architecture of native CDM in the context of matrix-secreting cells. This allowed for the in situ visualization of fibrillar matrix proteins such as collagen, laying the foundation for future structural and ultrastructural characterization of these proteins in their near-native environment. \r\nIn summary, in this thesis, I present a novel workflow that combines state-of-the-art cryo-EM specimen preparation and imaging technologies to permit characterization of the ECM, an important tissue component in higher organisms. This innovative and highly versatile workflow will enable addressing far-reaching questions on ECM architecture, composition, and reciprocal ECM-cell interactions." acknowledged_ssus: - _id: EM-Fac - _id: LifeSc - _id: Bio alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Bettina full_name: Zens, Bettina id: 45FD126C-F248-11E8-B48F-1D18A9856A87 last_name: Zens orcid: 0000-0002-9561-1239 citation: ama: Zens B. Ultrastructural characterization of natively preserved extracellular matrix by cryo-electron tomography. 2023. doi:10.15479/at:ista:12491 apa: Zens, B. (2023). Ultrastructural characterization of natively preserved extracellular matrix by cryo-electron tomography. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12491 chicago: Zens, Bettina. “Ultrastructural Characterization of Natively Preserved Extracellular Matrix by Cryo-Electron Tomography.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:12491. ieee: B. Zens, “Ultrastructural characterization of natively preserved extracellular matrix by cryo-electron tomography,” Institute of Science and Technology Austria, 2023. ista: Zens B. 2023. Ultrastructural characterization of natively preserved extracellular matrix by cryo-electron tomography. Institute of Science and Technology Austria. mla: Zens, Bettina. Ultrastructural Characterization of Natively Preserved Extracellular Matrix by Cryo-Electron Tomography. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:12491. short: B. Zens, Ultrastructural Characterization of Natively Preserved Extracellular Matrix by Cryo-Electron Tomography, Institute of Science and Technology Austria, 2023. date_created: 2023-02-02T14:50:20Z date_published: 2023-02-02T00:00:00Z date_updated: 2024-03-25T23:30:05Z day: '02' ddc: - '570' degree_awarded: PhD department: - _id: GradSch - _id: FlSc doi: 10.15479/at:ista:12491 file: - access_level: open_access checksum: 069d87f025e0799bf9e3c375664264f2 content_type: application/pdf creator: bzens date_created: 2023-02-07T13:07:38Z date_updated: 2024-02-08T23:30:04Z embargo: 2024-02-07 file_id: '12527' file_name: PhDThesis_BettinaZens_2023_final.pdf file_size: 23082464 relation: main_file - access_level: closed checksum: 8c66ed203495d6e078ed1002a866520c content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: bzens date_created: 2023-02-07T13:09:05Z date_updated: 2024-02-08T23:30:04Z embargo_to: open_access file_id: '12528' file_name: PhDThesis_BettinaZens_2023_final.docx file_size: 106169509 relation: source_file file_date_updated: 2024-02-08T23:30:04Z has_accepted_license: '1' keyword: - cryo-EM - cryo-ET - FIB milling - method development - FIBSEM - extracellular matrix - ECM - cell-derived matrices - CDMs - cell culture - high pressure freezing - HPF - structural biology - tomography - collagen language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: '187' project: - _id: eba3b5f6-77a9-11ec-83b8-cf0905748aa3 name: Integrated visual proteomics of reciprocal cell-extracellular matrix interactions - _id: 059B463C-7A3F-11EA-A408-12923DDC885E name: NÖ-Fonds Preis für die Jungforscherin des Jahres am IST Austria publication_identifier: isbn: - 978-3-99078-027-5 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '8586' relation: part_of_dissertation status: public status: public supervisor: - first_name: Florian KM full_name: Schur, Florian KM id: 48AD8942-F248-11E8-B48F-1D18A9856A87 last_name: Schur orcid: 0000-0003-4790-8078 title: Ultrastructural characterization of natively preserved extracellular matrix by cryo-electron tomography type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2023' ... --- _id: '13201' abstract: - lang: eng text: As a crucial nitrogen source, nitrate (NO3−) is a key nutrient for plants. Accordingly, root systems adapt to maximize NO3− availability, a developmental regulation also involving the phytohormone auxin. Nonetheless, the molecular mechanisms underlying this regulation remain poorly understood. Here, we identify low-nitrate-resistant mutant (lonr) in Arabidopsis (Arabidopsis thaliana), whose root growth fails to adapt to low-NO3− conditions. lonr2 is defective in the high-affinity NO3− transporter NRT2.1. lonr2 (nrt2.1) mutants exhibit defects in polar auxin transport, and their low-NO3−-induced root phenotype depends on the PIN7 auxin exporter activity. NRT2.1 directly associates with PIN7 and antagonizes PIN7-mediated auxin efflux depending on NO3− levels. These results reveal a mechanism by which NRT2.1 in response to NO3− limitation directly regulates auxin transport activity and, thus, root growth. This adaptive mechanism contributes to the root developmental plasticity to help plants cope with changes in NO3− availability. acknowledgement: We are grateful to Caifu Jiang for providing ethyl metha-nesulfonate- mutagenized population, Yi Wang for providing Xenopus oocytes, Jun Fan and Zhaosheng Kong for providing tobacco BY- 2 cells, and Claus Schwechheimer, Alain Gojon, and Shutang Tan for helpful discussions. This work was supported by the National Key Research and Development Program of China (2021YFF1000500), the National Natural Science Foundation of China (32170265 and 32022007), Hainan Provincial Natural Science Foundation of China (323CXTD379), Chinese Universities Scientific Fund (2023TC019), Beijing Municipal Natural Science Foundation (5192011), Beijing Outstanding University Discipline Program, and China Postdoctoral Science Foundation (BH2020259460). article_number: e2221313120 article_processing_charge: No article_type: original author: - first_name: Yalu full_name: Wang, Yalu last_name: Wang - first_name: Zhi full_name: Yuan, Zhi last_name: Yuan - first_name: Jinyi full_name: Wang, Jinyi last_name: Wang - first_name: Huixin full_name: Xiao, Huixin last_name: Xiao - first_name: Lu full_name: Wan, Lu last_name: Wan - first_name: Lanxin full_name: Li, Lanxin id: 367EF8FA-F248-11E8-B48F-1D18A9856A87 last_name: Li orcid: 0000-0002-5607-272X - first_name: Yan full_name: Guo, Yan last_name: Guo - first_name: Zhizhong full_name: Gong, Zhizhong last_name: Gong - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 - first_name: Jing full_name: Zhang, Jing last_name: Zhang citation: ama: Wang Y, Yuan Z, Wang J, et al. The nitrate transporter NRT2.1 directly antagonizes PIN7-mediated auxin transport for root growth adaptation. Proceedings of the National Academy of Sciences of the United States of America. 2023;120(25). doi:10.1073/pnas.2221313120 apa: Wang, Y., Yuan, Z., Wang, J., Xiao, H., Wan, L., Li, L., … Zhang, J. (2023). The nitrate transporter NRT2.1 directly antagonizes PIN7-mediated auxin transport for root growth adaptation. Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences. https://doi.org/10.1073/pnas.2221313120 chicago: Wang, Yalu, Zhi Yuan, Jinyi Wang, Huixin Xiao, Lu Wan, Lanxin Li, Yan Guo, Zhizhong Gong, Jiří Friml, and Jing Zhang. “The Nitrate Transporter NRT2.1 Directly Antagonizes PIN7-Mediated Auxin Transport for Root Growth Adaptation.” Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences, 2023. https://doi.org/10.1073/pnas.2221313120. ieee: Y. Wang et al., “The nitrate transporter NRT2.1 directly antagonizes PIN7-mediated auxin transport for root growth adaptation,” Proceedings of the National Academy of Sciences of the United States of America, vol. 120, no. 25. National Academy of Sciences, 2023. ista: Wang Y, Yuan Z, Wang J, Xiao H, Wan L, Li L, Guo Y, Gong Z, Friml J, Zhang J. 2023. The nitrate transporter NRT2.1 directly antagonizes PIN7-mediated auxin transport for root growth adaptation. Proceedings of the National Academy of Sciences of the United States of America. 120(25), e2221313120. mla: Wang, Yalu, et al. “The Nitrate Transporter NRT2.1 Directly Antagonizes PIN7-Mediated Auxin Transport for Root Growth Adaptation.” Proceedings of the National Academy of Sciences of the United States of America, vol. 120, no. 25, e2221313120, National Academy of Sciences, 2023, doi:10.1073/pnas.2221313120. short: Y. Wang, Z. Yuan, J. Wang, H. Xiao, L. Wan, L. Li, Y. Guo, Z. Gong, J. Friml, J. Zhang, Proceedings of the National Academy of Sciences of the United States of America 120 (2023). date_created: 2023-07-09T22:01:12Z date_published: 2023-06-12T00:00:00Z date_updated: 2023-12-13T23:30:04Z day: '12' ddc: - '570' department: - _id: JiFr doi: 10.1073/pnas.2221313120 external_id: isi: - '001030689600003' pmid: - '37307446' file: - access_level: open_access checksum: d800e06252eaefba28531fa9440f23f0 content_type: application/pdf creator: alisjak date_created: 2023-07-10T08:48:40Z date_updated: 2023-12-13T23:30:03Z embargo: 2023-12-12 file_id: '13204' file_name: 2023_PNAS_Wang.pdf file_size: 5244581 relation: main_file file_date_updated: 2023-12-13T23:30:03Z has_accepted_license: '1' intvolume: ' 120' isi: 1 issue: '25' language: - iso: eng month: '06' oa: 1 oa_version: Published Version pmid: 1 publication: Proceedings of the National Academy of Sciences of the United States of America publication_identifier: eissn: - 1091-6490 issn: - 0027-8424 publication_status: published publisher: National Academy of Sciences quality_controlled: '1' scopus_import: '1' status: public title: The nitrate transporter NRT2.1 directly antagonizes PIN7-mediated auxin transport for root growth adaptation tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 120 year: '2023' ... --- _id: '14226' abstract: - lang: eng text: "We introduce the notion of a Faustian interchange in a 1-parameter family of smooth\r\nfunctions to generalize the medial axis to critical points of index larger than 0.\r\nWe construct and implement a general purpose algorithm for approximating such\r\ngeneralized medial axes." alternative_title: - ISTA Master's Thesis article_processing_charge: No author: - first_name: Elizabeth R full_name: Stephenson, Elizabeth R id: 2D04F932-F248-11E8-B48F-1D18A9856A87 last_name: Stephenson orcid: 0000-0002-6862-208X citation: ama: Stephenson ER. Generalizing medial axes with homology switches. 2023. doi:10.15479/at:ista:14226 apa: Stephenson, E. R. (2023). Generalizing medial axes with homology switches. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:14226 chicago: Stephenson, Elizabeth R. “Generalizing Medial Axes with Homology Switches.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:14226. ieee: E. R. Stephenson, “Generalizing medial axes with homology switches,” Institute of Science and Technology Austria, 2023. ista: Stephenson ER. 2023. Generalizing medial axes with homology switches. Institute of Science and Technology Austria. mla: Stephenson, Elizabeth R. Generalizing Medial Axes with Homology Switches. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:14226. short: E.R. Stephenson, Generalizing Medial Axes with Homology Switches, Institute of Science and Technology Austria, 2023. date_created: 2023-08-24T13:01:18Z date_published: 2023-08-24T00:00:00Z date_updated: 2024-02-26T23:30:04Z day: '24' ddc: - '500' degree_awarded: MS department: - _id: GradSch - _id: HeEd doi: 10.15479/at:ista:14226 file: - access_level: closed checksum: 453caf851d75c3478c10ed09bd242a91 content_type: application/x-zip-compressed creator: cchlebak date_created: 2023-08-24T13:02:49Z date_updated: 2024-02-26T23:30:03Z embargo_to: open_access file_id: '14227' file_name: documents-export-2023-08-24.zip file_size: 15501411 relation: source_file - access_level: open_access checksum: 7349d29963d6695e555e171748648d9a content_type: application/pdf creator: cchlebak date_created: 2023-08-24T13:03:42Z date_updated: 2024-02-26T23:30:03Z embargo: 2024-02-25 file_id: '14228' file_name: thesis_pdf_a.pdf file_size: 6854783 relation: main_file file_date_updated: 2024-02-26T23:30:03Z has_accepted_license: '1' language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: '43' publication_identifier: issn: - 2791-4585 publication_status: published publisher: Institute of Science and Technology Austria status: public supervisor: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 title: Generalizing medial axes with homology switches type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2023' ... --- _id: '12470' abstract: - lang: eng text: "The brain is an exceptionally sophisticated organ consisting of billions of cells and trillions of \r\nconnections that orchestrate our cognition and behavior. To decode its complex connectivity, it is \r\npivotal to disentangle its intricate architecture spanning from cm-sized circuits down to tens of \r\nnm-small synapses.\r\nTo achieve this goal, I developed CATS – Comprehensive Analysis of nervous Tissue across \r\nScales, a versatile toolbox for obtaining a holistic view of nervous tissue context with (super\x02resolution) fluorescence microscopy. CATS combines comprehensive labeling of the extracellular\r\nspace, that is compatible with chemical fixation, with information on molecular markers, super\x02resolved data acquisition and machine-learning based data analysis for segmentation and synapse \r\nidentification.\r\nI used CATS to analyze key features of nervous tissue connectivity, ranging from whole tissue \r\narchitecture, neuronal in- and output-fields, down to synapse morphology.\r\nFocusing on the hippocampal circuitry, I quantified synaptic transmission properties of mossy \r\nfiber boutons and analyzed the connectivity pattern of dentate gyrus granule cells with CA3 \r\npyramidal neurons. This shows that CATS is a viable tool to study hallmarks of neuronal \r\nconnectivity with light microscopy." acknowledged_ssus: - _id: Bio - _id: LifeSc - _id: PreCl - _id: EM-Fac - _id: M-Shop - _id: ScienComp alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Julia M full_name: Michalska, Julia M id: 443DB6DE-F248-11E8-B48F-1D18A9856A87 last_name: Michalska orcid: 0000-0003-3862-1235 citation: ama: Michalska JM. A versatile toolbox for the comprehensive analysis of nervous tissue organization with light microscopy. 2023. doi:10.15479/at:ista:12470 apa: Michalska, J. M. (2023). A versatile toolbox for the comprehensive analysis of nervous tissue organization with light microscopy. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12470 chicago: Michalska, Julia M. “A Versatile Toolbox for the Comprehensive Analysis of Nervous Tissue Organization with Light Microscopy.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:12470. ieee: J. M. Michalska, “A versatile toolbox for the comprehensive analysis of nervous tissue organization with light microscopy,” Institute of Science and Technology Austria, 2023. ista: Michalska JM. 2023. A versatile toolbox for the comprehensive analysis of nervous tissue organization with light microscopy. Institute of Science and Technology Austria. mla: Michalska, Julia M. A Versatile Toolbox for the Comprehensive Analysis of Nervous Tissue Organization with Light Microscopy. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:12470. short: J.M. Michalska, A Versatile Toolbox for the Comprehensive Analysis of Nervous Tissue Organization with Light Microscopy, Institute of Science and Technology Austria, 2023. date_created: 2023-01-31T15:10:53Z date_published: 2023-01-09T00:00:00Z date_updated: 2023-08-31T12:26:58Z day: '09' ddc: - '610' degree_awarded: PhD department: - _id: GradSch - _id: JoDa doi: 10.15479/at:ista:12470 ec_funded: 1 file: - access_level: open_access checksum: 1a2306e5f59f52df598e7ecfadf921ac content_type: application/pdf creator: cchlebak date_created: 2023-01-31T15:11:42Z date_updated: 2023-07-27T22:30:54Z embargo: 2023-07-09 file_id: '12471' file_name: 20230109_PhD_thesis_JM_final.pdf file_size: 41771714 relation: main_file - access_level: closed checksum: 0bebbdee0773443959e1f6ab8caf281f content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: cchlebak date_created: 2023-01-31T15:11:51Z date_updated: 2023-07-10T22:30:04Z embargo_to: open_access file_id: '12472' file_name: 20230109_PhD_thesis_JM_final.docx file_size: 66983464 relation: source_file file_date_updated: 2023-07-27T22:30:54Z has_accepted_license: '1' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: '201' project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program - _id: 26AA4EF2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: W1232-B24 name: Molecular Drug Targets publication_identifier: isbn: - ' 978-3-99078-026-8' issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '11943' relation: part_of_dissertation status: public - id: '11950' relation: part_of_dissertation status: public status: public supervisor: - first_name: Johann G full_name: Danzl, Johann G id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87 last_name: Danzl orcid: 0000-0001-8559-3973 title: A versatile toolbox for the comprehensive analysis of nervous tissue organization with light microscopy 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: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2023' ... --- _id: '12531' abstract: - lang: eng text: "All visual experiences of the vertebrates begin with light being converted into electrical signals\r\nby the eye retina. Retinal ganglion cells (RGCs) are the neurons of the innermost layer of the\r\nmammal retina, and they transmit visual information to the rest of the brain.\r\nIt has been shown that RGCs vary in their morphology and genetic profiles, moreover they can\r\nbe unambiguously grouped into subtypes that share the same morphological and/or molecular\r\nproperties. However, in terms of RGCs function, it remains unclear how many distinct types\r\nthere are and what response properties their typology relies on. Even given the recent studies\r\nthat successfully classified RGCs in a patch of the retina [1] and in scotopic conditions [2], the\r\nquestion remains whether the found subtypes persist across the entire retina.\r\nIn this work, using a novel imaging method, we show that, when sampled from a large portion\r\nof the retina, RGCs can not be clearly divided into functional subtypes. We found that in\r\nphotopic conditions, which implies more prominent natural scene statistic differences across\r\nthe visual field, response properties can be exhibited by cells differently depending on their\r\nlocation in the retina, which leads to formation of a gradient of features rather than distinct\r\nclasses.\r\nThis finding suggests that RGCs follow a global organization across the visual field of the\r\nanimal, adapting each RGC subtype to the requirements imposed by the natural scene statistics." alternative_title: - ISTA Master's Thesis article_processing_charge: No author: - first_name: Kseniia full_name: Kirillova, Kseniia id: 8e3f931e-dc85-11ea-9058-e7b957bf23f0 last_name: Kirillova citation: ama: Kirillova K. Panoramic functional gradients across the mouse retina. 2023. doi:10.15479/at:ista:12531 apa: Kirillova, K. (2023). Panoramic functional gradients across the mouse retina. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12531 chicago: Kirillova, Kseniia. “Panoramic Functional Gradients across the Mouse Retina.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:12531. ieee: K. Kirillova, “Panoramic functional gradients across the mouse retina,” Institute of Science and Technology Austria, 2023. ista: Kirillova K. 2023. Panoramic functional gradients across the mouse retina. Institute of Science and Technology Austria. mla: Kirillova, Kseniia. Panoramic Functional Gradients across the Mouse Retina. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:12531. short: K. Kirillova, Panoramic Functional Gradients across the Mouse Retina, Institute of Science and Technology Austria, 2023. date_created: 2023-02-09T07:45:05Z date_published: 2023-02-08T00:00:00Z date_updated: 2024-02-09T23:30:04Z day: '08' ddc: - '570' degree_awarded: MS department: - _id: GradSch - _id: MaJö doi: 10.15479/at:ista:12531 file: - access_level: open_access checksum: 57d8da3a6c749eb1556b7435fe266a5f content_type: application/pdf creator: cchlebak date_created: 2023-02-09T08:03:32Z date_updated: 2024-02-09T23:30:03Z embargo: 2024-02-08 file_id: '12532' file_name: Thesis_Kseniia___ISTA__istaustriathesis_PDF-A.pdf file_size: 8369317 relation: main_file - access_level: closed checksum: 87fb44318e4f9eb9da2ad9ad6ca8e76f content_type: application/x-zip-compressed creator: cchlebak date_created: 2023-02-10T09:32:06Z date_updated: 2024-02-09T23:30:03Z embargo_to: open_access file_id: '12535' file_name: Thesis Kseniia - ISTA [istaustriathesis]-FINAL.zip file_size: 11204408 relation: source_file file_date_updated: 2024-02-09T23:30:03Z has_accepted_license: '1' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: '46' publication_identifier: issn: - 2791-4585 publication_status: published publisher: Institute of Science and Technology Austria status: public supervisor: - first_name: Maximilian A full_name: Jösch, Maximilian A id: 2BD278E6-F248-11E8-B48F-1D18A9856A87 last_name: Jösch orcid: 0000-0002-3937-1330 title: Panoramic functional gradients across the mouse retina tmp: image: /images/cc_by_nc_sa.png legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) short: CC BY-NC-SA (4.0) type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2023' ... --- _id: '12800' abstract: - lang: eng text: 'The evolutionary processes that brought about today’s plethora of living species and the many billions more ancient ones all underlie biology. Evolutionary pathways are neither directed nor deterministic, but rather an interplay between selection, migration, mutation, genetic drift and other environmental factors. Hybrid zones, as natural crossing experiments, offer a great opportunity to use cline analysis to deduce different evolutionary processes - for example, selection strength. Theoretical cline models, largely assuming uniform distribution of individuals, often lack the capability of incorporating population structure. Since in reality organisms mostly live in patchy distributions and their dispersal is hardly ever Gaussian, it is necessary to unravel the effect of these different elements of population structure on cline parameters and shape. In this thesis, I develop a simulation inspired by the A. majus hybrid zone of a single selected locus under frequency dependent selection. This simulation enables us to untangle the effects of different elements of population structure as for example a low-density center and long-range dispersal. This thesis is therefore a first step towards theoretically untangling the effects of different elements of population structure on cline parameters and shape. ' alternative_title: - ISTA Master's Thesis article_processing_charge: No author: - first_name: Mara full_name: Julseth, Mara id: 1cf464b2-dc7d-11ea-9b2f-f9b1aa9417d1 last_name: Julseth citation: ama: Julseth M. The effect of local population structure on genetic variation at selected loci in the A. majus hybrid zone. 2023. doi:10.15479/at:ista:12800 apa: Julseth, M. (2023). The effect of local population structure on genetic variation at selected loci in the A. majus hybrid zone. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12800 chicago: Julseth, Mara. “The Effect of Local Population Structure on Genetic Variation at Selected Loci in the A. Majus Hybrid Zone.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:12800. ieee: M. Julseth, “The effect of local population structure on genetic variation at selected loci in the A. majus hybrid zone,” Institute of Science and Technology Austria, 2023. ista: Julseth M. 2023. The effect of local population structure on genetic variation at selected loci in the A. majus hybrid zone. Institute of Science and Technology Austria. mla: Julseth, Mara. The Effect of Local Population Structure on Genetic Variation at Selected Loci in the A. Majus Hybrid Zone. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:12800. short: M. Julseth, The Effect of Local Population Structure on Genetic Variation at Selected Loci in the A. Majus Hybrid Zone, Institute of Science and Technology Austria, 2023. date_created: 2023-04-04T18:57:11Z date_published: 2023-04-05T00:00:00Z date_updated: 2023-06-02T22:30:05Z day: '05' ddc: - '576' degree_awarded: MS department: - _id: GradSch - _id: NiBa doi: 10.15479/at:ista:12800 file: - access_level: closed checksum: b76cf6d69f2093d8248f6a3f9d4654a4 content_type: application/vnd.openxmlformats-officedocument.spreadsheetml.sheet creator: mjulseth date_created: 2023-04-06T06:09:40Z date_updated: 2023-06-02T22:30:04Z embargo_to: open_access file_id: '12805' file_name: Dispersaldata.xlsx file_size: 52795 relation: supplementary_material - access_level: open_access checksum: 5a13b6d204371572e249f03795bc0d04 content_type: application/vnd.wolfram.nb creator: mjulseth date_created: 2023-04-06T06:11:27Z date_updated: 2023-06-02T22:30:04Z embargo: 2023-06-01 file_id: '12806' file_name: 2023_MSc_ThesisMaraJulseth_Notebook.nb file_size: 787239 relation: supplementary_material - access_level: closed checksum: c3ec842839ed1e66bf2618ae33047df8 content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: mjulseth date_created: 2023-04-06T08:26:12Z date_updated: 2023-06-02T22:30:04Z embargo_to: open_access file_id: '12812' file_name: ThesisMaraJulseth_04_23.docx file_size: 1061763 relation: source_file - access_level: open_access checksum: 3132cc998fbe3ae2a3a83c2a69367f37 content_type: application/pdf creator: mjulseth date_created: 2023-04-06T08:26:37Z date_updated: 2023-06-02T22:30:04Z embargo: 2023-06-01 file_id: '12813' file_name: ThesisMaraJulseth_04_23.pdf file_size: 1741364 relation: main_file file_date_updated: 2023-06-02T22:30:04Z has_accepted_license: '1' language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: '21' publication_identifier: issn: - 2791-4585 publication_status: published publisher: Institute of Science and Technology Austria status: public supervisor: - first_name: Nicholas H full_name: Barton, Nicholas H id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 title: The effect of local population structure on genetic variation at selected loci in the A. majus hybrid zone type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2023' ... --- _id: '12897' abstract: - lang: eng text: "Inverse design problems in fabrication-aware shape optimization are typically solved on discrete representations such as polygonal meshes. This thesis argues that there are benefits to treating these problems in the same domain as human designers, namely, the parametric one. One reason is that discretizing a parametric model usually removes the capability of making further manual changes to the design, because the human intent is captured by the shape parameters. Beyond this, knowledge about a design problem can sometimes reveal a structure that is present in a smooth representation, but is fundamentally altered by discretizing. In this case, working in the parametric domain may even simplify the optimization task. We present two lines of research that explore both of these aspects of fabrication-aware shape optimization on parametric representations.\r\n\r\nThe first project studies the design of plane elastic curves and Kirchhoff rods, which are common mathematical models for describing the deformation of thin elastic rods such as beams, ribbons, cables, and hair. Our main contribution is a characterization of all curved shapes that can be attained by bending and twisting elastic rods having a stiffness that is allowed to vary across the length. Elements like these can be manufactured using digital fabrication devices such as 3d printers and digital cutters, and have applications in free-form architecture and soft robotics.\r\n\r\nWe show that the family of curved shapes that can be produced this way admits geometric description that is concise and computationally convenient. In the case of plane curves, the geometric description is intuitive enough to allow a designer to determine whether a curved shape is physically achievable by visual inspection alone. We also present shape optimization algorithms that convert a user-defined curve in the plane or in three dimensions into the geometry of an elastic rod that will naturally deform to follow this curve when its endpoints are attached to a support structure. Implemented in an interactive software design tool, the rod geometry is generated in real time as the user edits a curve and enables fast prototyping. \r\n\r\nThe second project tackles the problem of general-purpose shape optimization on CAD models using a novel variant of the extended finite element method (XFEM). Our goal is the decoupling between the simulation mesh and the CAD model, so no geometry-dependent meshing or remeshing needs to be performed when the CAD parameters change during optimization. This is achieved by discretizing the embedding space of the CAD model, and using a new high-accuracy numerical integration method to enable XFEM on free-form elements bounded by the parametric surface patches of the model. Our simulation is differentiable from the CAD parameters to the simulation output, which enables us to use off-the-shelf gradient-based optimization procedures. The result is a method that fits seamlessly into the CAD workflow because it works on the same representation as the designer, enabling the alternation of manual editing and fabrication-aware optimization at will." acknowledged_ssus: - _id: M-Shop alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Christian full_name: Hafner, Christian id: 400429CC-F248-11E8-B48F-1D18A9856A87 last_name: Hafner citation: ama: 'Hafner C. Inverse shape design with parametric representations: Kirchhoff Rods and parametric surface models. 2023. doi:10.15479/at:ista:12897' apa: 'Hafner, C. (2023). Inverse shape design with parametric representations: Kirchhoff Rods and parametric surface models. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12897' chicago: 'Hafner, Christian. “Inverse Shape Design with Parametric Representations: Kirchhoff Rods and Parametric Surface Models.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:12897.' ieee: 'C. Hafner, “Inverse shape design with parametric representations: Kirchhoff Rods and parametric surface models,” Institute of Science and Technology Austria, 2023.' ista: 'Hafner C. 2023. Inverse shape design with parametric representations: Kirchhoff Rods and parametric surface models. Institute of Science and Technology Austria.' mla: 'Hafner, Christian. Inverse Shape Design with Parametric Representations: Kirchhoff Rods and Parametric Surface Models. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:12897.' short: 'C. Hafner, Inverse Shape Design with Parametric Representations: Kirchhoff Rods and Parametric Surface Models, Institute of Science and Technology Austria, 2023.' date_created: 2023-05-05T10:40:14Z date_published: 2023-05-05T00:00:00Z date_updated: 2024-01-29T10:47:51Z day: '05' ddc: - '516' - '004' - '518' - '531' degree_awarded: PhD department: - _id: GradSch - _id: BeBi doi: 10.15479/at:ista:12897 ec_funded: 1 file: - access_level: open_access checksum: cc2094e92fa27000b70eb4bfb76d6b5a content_type: application/pdf creator: chafner date_created: 2023-05-11T10:43:20Z date_updated: 2023-12-08T23:30:04Z embargo: 2023-12-07 file_id: '12942' file_name: thesis-hafner-2023may11-a2b.pdf file_size: 50714445 relation: main_file - access_level: closed checksum: a6b51334be2b81672357b1549afab40c content_type: application/pdf creator: chafner date_created: 2023-05-11T10:43:44Z date_updated: 2023-12-08T23:30:04Z embargo_to: open_access file_id: '12943' file_name: thesis-release-form.pdf file_size: 265319 relation: source_file file_date_updated: 2023-12-08T23:30:04Z has_accepted_license: '1' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: '180' project: - _id: 24F9549A-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '715767' name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling' publication_identifier: isbn: - 978-3-99078-031-2 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '9817' relation: part_of_dissertation status: public - id: '7117' relation: part_of_dissertation status: public - id: '13188' relation: dissertation_contains status: public status: public supervisor: - first_name: Bernd full_name: Bickel, Bernd id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 title: 'Inverse shape design with parametric representations: Kirchhoff Rods and parametric surface models' type: dissertation user_id: 400429CC-F248-11E8-B48F-1D18A9856A87 year: '2023' ... --- _id: '13188' abstract: - lang: eng text: "The Kirchhoff rod model describes the bending and twisting of slender elastic rods in three dimensions, and has been widely studied to enable the prediction of how a rod will deform, given its geometry and boundary conditions. In this work, we study a number of inverse problems with the goal of computing the geometry of a straight rod that will automatically deform to match a curved target shape after attaching its endpoints to a support structure. Our solution lets us finely control the static equilibrium state of a rod by varying the cross-sectional profiles along its length.\r\nWe also show that the set of physically realizable equilibrium states admits a concise geometric description in terms of linear line complexes, which leads to very efficient computational design algorithms. Implemented in an interactive software tool, they allow us to convert three-dimensional hand-drawn spline curves to elastic rods, and give feedback about the feasibility and practicality of a design in real time. We demonstrate the efficacy of our method by designing and manufacturing several physical prototypes with applications to interior design and soft robotics." acknowledged_ssus: - _id: M-Shop acknowledgement: We thank the anonymous reviewers for their generous feedback, and Julian Fischer for his help in proving Proposition 1. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 715767). article_number: '171' article_processing_charge: No article_type: original author: - first_name: Christian full_name: Hafner, Christian id: 400429CC-F248-11E8-B48F-1D18A9856A87 last_name: Hafner - first_name: Bernd full_name: Bickel, Bernd id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 citation: ama: Hafner C, Bickel B. The design space of Kirchhoff rods. ACM Transactions on Graphics. 2023;42(5). doi:10.1145/3606033 apa: Hafner, C., & Bickel, B. (2023). The design space of Kirchhoff rods. ACM Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/3606033 chicago: Hafner, Christian, and Bernd Bickel. “The Design Space of Kirchhoff Rods.” ACM Transactions on Graphics. Association for Computing Machinery, 2023. https://doi.org/10.1145/3606033. ieee: C. Hafner and B. Bickel, “The design space of Kirchhoff rods,” ACM Transactions on Graphics, vol. 42, no. 5. Association for Computing Machinery, 2023. ista: Hafner C, Bickel B. 2023. The design space of Kirchhoff rods. ACM Transactions on Graphics. 42(5), 171. mla: Hafner, Christian, and Bernd Bickel. “The Design Space of Kirchhoff Rods.” ACM Transactions on Graphics, vol. 42, no. 5, 171, Association for Computing Machinery, 2023, doi:10.1145/3606033. short: C. Hafner, B. Bickel, ACM Transactions on Graphics 42 (2023). date_created: 2023-07-04T07:41:30Z date_published: 2023-09-20T00:00:00Z date_updated: 2024-03-27T23:30:46Z day: '20' ddc: - '516' department: - _id: BeBi doi: 10.1145/3606033 ec_funded: 1 external_id: isi: - '001086833300010' file: - access_level: open_access checksum: 4954c1cfa487725bc156dcfec872478a content_type: application/pdf creator: chafner date_created: 2023-07-04T08:11:28Z date_updated: 2023-07-04T08:11:28Z file_id: '13194' file_name: kirchhoff-rods.pdf file_size: 19635168 relation: main_file success: 1 - access_level: open_access checksum: 79c9975fbc82ff71f1767331d2204cca content_type: application/pdf creator: chafner date_created: 2023-07-04T07:46:28Z date_updated: 2023-07-04T07:46:28Z file_id: '13190' file_name: supp-main.pdf file_size: 420909 relation: supplementary_material title: Supplemental Material with Proofs - access_level: open_access checksum: 4ab647e4f03c711e1e6a5fc1eb8684db content_type: application/pdf creator: chafner date_created: 2023-07-04T07:46:30Z date_updated: 2023-07-04T07:46:30Z file_id: '13191' file_name: supp-cheat.pdf file_size: 430086 relation: supplementary_material title: Cheat Sheet for Notation - access_level: open_access checksum: c0fd9a57d012046de90c185ffa904b76 content_type: video/mp4 creator: chafner date_created: 2023-07-04T07:46:39Z date_updated: 2023-07-04T07:46:39Z file_id: '13192' file_name: kirchhoff-video-final.mp4 file_size: 268088064 relation: supplementary_material title: Supplemental Video - access_level: open_access checksum: 71b00712b489ada2cd9815910ee180a9 content_type: application/x-zip-compressed creator: chafner date_created: 2023-07-04T07:47:10Z date_updated: 2023-07-04T07:47:10Z file_id: '13193' file_name: matlab-submission.zip file_size: 25790 relation: supplementary_material title: Matlab Source Code with Example file_date_updated: 2023-07-04T08:11:28Z has_accepted_license: '1' intvolume: ' 42' isi: 1 issue: '5' keyword: - Computer Graphics - Computational Design - Computational Geometry - Shape Modeling language: - iso: eng month: '09' oa: 1 oa_version: Submitted Version project: - _id: 24F9549A-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '715767' name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling' publication: ACM Transactions on Graphics publication_identifier: eissn: - 1557-7368 issn: - 0730-0301 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' related_material: record: - id: '12897' relation: part_of_dissertation status: public status: public title: The design space of Kirchhoff rods type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 42 year: '2023' ... --- _id: '10652' abstract: - lang: eng text: Finding a feasible scheme for testing the quantum mechanical nature of the gravitational interaction has been attracting an increasing level of attention. Gravity mediated entanglement generation so far appears to be the key ingredient for a potential experiment. In a recent proposal [D. Carney et al., PRX Quantum 2, 030330 (2021)] combining an atom interferometer with a low-frequency mechanical oscillator, a coherence revival test is proposed for verifying this entanglement generation. With measurements performed only on the atoms, this protocol bypasses the need for correlation measurements. Here, we explore formulations of such a protocol, and specifically find that in the envisioned regime of operation with high thermal excitation, semiclassical models, where there is no concept of entanglement, also give the same experimental signatures. We elucidate in a fully quantum mechanical calculation that entanglement is not the source of the revivals in the relevant parameter regime. We argue that, in its current form, the suggested test is only relevant if the oscillator is nearly in a pure quantum state, and in this regime the effects are too small to be measurable. We further discuss potential open ends. The results highlight the importance and subtleties of explicitly considering how the quantum case differs from the classical expectations when testing for the quantum mechanical nature of a physical system. acknowledgement: O.H. is supported by Institute of Science and Technology Austria. The author thanks Jess Riedel for discussions. article_number: '013023' article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Onur full_name: Hosten, Onur id: 4C02D85E-F248-11E8-B48F-1D18A9856A87 last_name: Hosten orcid: 0000-0002-2031-204X citation: ama: Hosten O. Constraints on probing quantum coherence to infer gravitational entanglement. Physical Review Research. 2022;4(1). doi:10.1103/PhysRevResearch.4.013023 apa: Hosten, O. (2022). Constraints on probing quantum coherence to infer gravitational entanglement. Physical Review Research. American Physical Society. https://doi.org/10.1103/PhysRevResearch.4.013023 chicago: Hosten, Onur. “Constraints on Probing Quantum Coherence to Infer Gravitational Entanglement.” Physical Review Research. American Physical Society, 2022. https://doi.org/10.1103/PhysRevResearch.4.013023. ieee: O. Hosten, “Constraints on probing quantum coherence to infer gravitational entanglement,” Physical Review Research, vol. 4, no. 1. American Physical Society, 2022. ista: Hosten O. 2022. Constraints on probing quantum coherence to infer gravitational entanglement. Physical Review Research. 4(1), 013023. mla: Hosten, Onur. “Constraints on Probing Quantum Coherence to Infer Gravitational Entanglement.” Physical Review Research, vol. 4, no. 1, 013023, American Physical Society, 2022, doi:10.1103/PhysRevResearch.4.013023. short: O. Hosten, Physical Review Research 4 (2022). date_created: 2022-01-23T23:01:27Z date_published: 2022-01-10T00:00:00Z date_updated: 2022-05-16T11:21:38Z day: '10' ddc: - '530' department: - _id: OnHo doi: 10.1103/PhysRevResearch.4.013023 file: - access_level: open_access checksum: 7254d267a0633ca5d63131d345e58686 content_type: application/pdf creator: cchlebak date_created: 2022-01-24T11:12:44Z date_updated: 2022-01-24T11:12:44Z file_id: '10660' file_name: 2022_PhysRevResearch_Hosten.pdf file_size: 236329 relation: main_file success: 1 file_date_updated: 2022-01-24T11:12:44Z has_accepted_license: '1' intvolume: ' 4' issue: '1' language: - iso: eng month: '01' oa: 1 oa_version: Published Version publication: Physical Review Research publication_identifier: issn: - 2643-1564 publication_status: published publisher: American Physical Society quality_controlled: '1' scopus_import: '1' status: public title: Constraints on probing quantum coherence to infer gravitational entanglement 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 4 year: '2022' ... --- _id: '10758' abstract: - lang: eng text: 5-Carboxycytosine (5caC) is a rare epigenetic modification found in nucleic acids of all domains of life. Despite its sparse genomic abundance, 5caC is presumed to play essential regulatory roles in transcription, maintenance and base-excision processes in DNA. In this work, we utilize nuclear magnetic resonance (NMR) spectroscopy to address the effects of 5caC incorporation into canonical DNA strands at multiple pH and temperature conditions. Our results demonstrate that 5caC has a pH-dependent global destabilizing and a base-pair mobility enhancing local impact on dsDNA, albeit without any detectable influence on the ground-state B-DNA structure. Measurement of hybridization thermodynamics and kinetics of 5caC-bearing DNA duplexes highlighted how acidic environment (pH 5.8 and 4.7) destabilizes the double-stranded structure by ∼10–20 kJ mol–1 at 37 °C when compared to the same sample at neutral pH. Protonation of 5caC results in a lower activation energy for the dissociation process and a higher barrier for annealing. Studies on conformational exchange on the microsecond time scale regime revealed a sharply localized base-pair motion involving exclusively the modified site and its immediate surroundings. By direct comparison with canonical and 5-formylcytosine (5fC)-edited strands, we were able to address the impact of the two most oxidized naturally occurring cytosine derivatives in the genome. These insights on 5caC’s subtle sensitivity to acidic pH contribute to the long-standing questions of its capacity as a substrate in base excision repair processes and its purpose as an independent, stable epigenetic mark. acknowledgement: "We thank Markus Müller for valued discussions and Felix Xu for assistance in the measurement of UV/vis melting profiles. This work was supported in part by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – SFB 1309-325871075, EU-ITN LightDyNAmics (ID: 765266), the ERC-AG EpiR (ID: 741912), the Center for NanoScience, the Excellence Clusters CIPSM, and the Fonds der Chemischen Industrie. Open access funding provided by Institute of Science and Technology Austria (ISTA).\r\n\r\n" article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Romeo C. A. full_name: Dubini, Romeo C. A. last_name: Dubini - first_name: Eva full_name: Korytiaková, Eva last_name: Korytiaková - first_name: Thea full_name: Schinkel, Thea last_name: Schinkel - first_name: Pia full_name: Heinrichs, Pia last_name: Heinrichs - first_name: Thomas full_name: Carell, Thomas last_name: Carell - first_name: Petra full_name: Rovo, Petra id: c316e53f-b965-11eb-b128-bb26acc59c00 last_name: Rovo orcid: 0000-0001-8729-7326 citation: ama: Dubini RCA, Korytiaková E, Schinkel T, Heinrichs P, Carell T, Rovo P. 1H NMR chemical exchange techniques reveal local and global effects of oxidized cytosine derivatives. ACS Physical Chemistry Au. 2022;2(3):237-246. doi:10.1021/acsphyschemau.1c00050 apa: Dubini, R. C. A., Korytiaková, E., Schinkel, T., Heinrichs, P., Carell, T., & Rovo, P. (2022). 1H NMR chemical exchange techniques reveal local and global effects of oxidized cytosine derivatives. ACS Physical Chemistry Au. American Chemical Society. https://doi.org/10.1021/acsphyschemau.1c00050 chicago: Dubini, Romeo C. A., Eva Korytiaková, Thea Schinkel, Pia Heinrichs, Thomas Carell, and Petra Rovo. “1H NMR Chemical Exchange Techniques Reveal Local and Global Effects of Oxidized Cytosine Derivatives.” ACS Physical Chemistry Au. American Chemical Society, 2022. https://doi.org/10.1021/acsphyschemau.1c00050. ieee: R. C. A. Dubini, E. Korytiaková, T. Schinkel, P. Heinrichs, T. Carell, and P. Rovo, “1H NMR chemical exchange techniques reveal local and global effects of oxidized cytosine derivatives,” ACS Physical Chemistry Au, vol. 2, no. 3. American Chemical Society, pp. 237–246, 2022. ista: Dubini RCA, Korytiaková E, Schinkel T, Heinrichs P, Carell T, Rovo P. 2022. 1H NMR chemical exchange techniques reveal local and global effects of oxidized cytosine derivatives. ACS Physical Chemistry Au. 2(3), 237–246. mla: Dubini, Romeo C. A., et al. “1H NMR Chemical Exchange Techniques Reveal Local and Global Effects of Oxidized Cytosine Derivatives.” ACS Physical Chemistry Au, vol. 2, no. 3, American Chemical Society, 2022, pp. 237–46, doi:10.1021/acsphyschemau.1c00050. short: R.C.A. Dubini, E. Korytiaková, T. Schinkel, P. Heinrichs, T. Carell, P. Rovo, ACS Physical Chemistry Au 2 (2022) 237–246. date_created: 2022-02-16T11:18:21Z date_published: 2022-02-11T00:00:00Z date_updated: 2023-01-31T07:33:07Z day: '11' ddc: - '540' department: - _id: NMR doi: 10.1021/acsphyschemau.1c00050 external_id: pmid: - '35637781' file: - access_level: open_access checksum: 5ce3f907848f5c7caf77f1adfe5826c6 content_type: application/pdf creator: dernst date_created: 2022-07-29T07:53:20Z date_updated: 2022-07-29T07:53:20Z file_id: '11692' file_name: 2022_ACSPhysChemAU_Dubini.pdf file_size: 2351220 relation: main_file success: 1 file_date_updated: 2022-07-29T07:53:20Z has_accepted_license: '1' intvolume: ' 2' issue: '3' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: 237-246 pmid: 1 project: - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund publication: ACS Physical Chemistry Au publication_identifier: eissn: - 2694-2445 publication_status: published publisher: American Chemical Society quality_controlled: '1' related_material: link: - relation: earlier_version url: https://www.biorxiv.org/content/10.1101/2021.12.14.472563 scopus_import: '1' status: public title: 1H NMR chemical exchange techniques reveal local and global effects of oxidized cytosine derivatives 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2 year: '2022' ... --- _id: '10774' abstract: - lang: eng text: We study the problem of specifying sequential information-flow properties of systems. Information-flow properties are hyperproperties, as they compare different traces of a system. Sequential information-flow properties can express changes, over time, in the information-flow constraints. For example, information-flow constraints during an initialization phase of a system may be different from information-flow constraints that are required during the operation phase. We formalize several variants of interpreting sequential information-flow constraints, which arise from different assumptions about what can be observed of the system. For this purpose, we introduce a first-order logic, called Hypertrace Logic, with both trace and time quantifiers for specifying linear-time hyperproperties. We prove that HyperLTL, which corresponds to a fragment of Hypertrace Logic with restricted quantifier prefixes, cannot specify the majority of the studied variants of sequential information flow, including all variants in which the transition between sequential phases (such as initialization and operation) happens asynchronously. Our results rely on new equivalences between sets of traces that cannot be distinguished by certain classes of formulas from Hypertrace Logic. This presents a new approach to proving inexpressiveness results for HyperLTL. acknowledgement: This work was funded in part by the Wittgenstein Award Z211-N23 of the Austrian Science Fund (FWF) and by the FWF project W1255-N23. alternative_title: - LNCS article_processing_charge: No author: - first_name: Ezio full_name: Bartocci, Ezio last_name: Bartocci - first_name: Thomas full_name: Ferrere, Thomas id: 40960E6E-F248-11E8-B48F-1D18A9856A87 last_name: Ferrere orcid: 0000-0001-5199-3143 - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000-0002-2985-7724 - first_name: Dejan full_name: Nickovic, Dejan id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87 last_name: Nickovic - first_name: Ana Oliveira full_name: Da Costa, Ana Oliveira last_name: Da Costa citation: ama: 'Bartocci E, Ferrere T, Henzinger TA, Nickovic D, Da Costa AO. Flavors of sequential information flow. In: Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 13182. Springer Nature; 2022:1-19. doi:10.1007/978-3-030-94583-1_1' apa: 'Bartocci, E., Ferrere, T., Henzinger, T. A., Nickovic, D., & Da Costa, A. O. (2022). Flavors of sequential information flow. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 13182, pp. 1–19). Philadelphia, PA, United States: Springer Nature. https://doi.org/10.1007/978-3-030-94583-1_1' chicago: Bartocci, Ezio, Thomas Ferrere, Thomas A Henzinger, Dejan Nickovic, and Ana Oliveira Da Costa. “Flavors of Sequential Information Flow.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 13182:1–19. Springer Nature, 2022. https://doi.org/10.1007/978-3-030-94583-1_1. ieee: E. Bartocci, T. Ferrere, T. A. Henzinger, D. Nickovic, and A. O. Da Costa, “Flavors of sequential information flow,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Philadelphia, PA, United States, 2022, vol. 13182, pp. 1–19. ista: 'Bartocci E, Ferrere T, Henzinger TA, Nickovic D, Da Costa AO. 2022. Flavors of sequential information flow. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 13182, 1–19.' mla: Bartocci, Ezio, et al. “Flavors of Sequential Information Flow.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13182, Springer Nature, 2022, pp. 1–19, doi:10.1007/978-3-030-94583-1_1. short: E. Bartocci, T. Ferrere, T.A. Henzinger, D. Nickovic, A.O. Da Costa, in:, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Nature, 2022, pp. 1–19. conference: end_date: 2022-01-18 location: Philadelphia, PA, United States name: 'VMCAI: Verifcation, Model Checking, and Abstract Interpretation' start_date: 2022-01-16 date_created: 2022-02-20T23:01:34Z date_published: 2022-01-14T00:00:00Z date_updated: 2022-08-05T09:02:56Z day: '14' department: - _id: ToHe doi: 10.1007/978-3-030-94583-1_1 external_id: arxiv: - '2105.02013' intvolume: ' 13182' language: - iso: eng main_file_link: - open_access: '1' url: ' https://doi.org/10.48550/arXiv.2105.02013' month: '01' oa: 1 oa_version: Preprint page: 1-19 project: - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) publication_identifier: eissn: - '16113349' isbn: - '9783030945824' issn: - '03029743' publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Flavors of sequential information flow type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 13182 year: '2022' ... --- _id: '10769' abstract: - lang: eng text: studiamos aspectos de Teoría Cuántica de Campos a densidad finita usando técnicas y conceptos de información cuántica. Nos enfocamos en fermiones de Dirac masivos con potencial químico en 1+1 dimensiones espacio-temporales. Usando la entropía de entrelazamiento en un intervalo, construimos la función c entrópica que es finita. Esta función c no es monótona, e incorpora el entrelazamiento de largo alcance proveniente de la superficie de Fermi. Motivados por trabajos previos de modelos en la red, calculamos numéricamente las entropías de Renyi y encontramos oscilaciones de Friedel. Seguidamente, analizamos la información mutua como una medida de correlación entre diferentes regiones. Usando una expansión de distancia grande desarrollada por Cardy, argumentamos que la información mutua detecta las correlaciones inducidas por la superficie de Fermi todavía al orden dominante en la expansión. Finalmente, analizamos la entropía relativa y sus generalizaciones de Renyi para distinguir estados con diferente carga. Encontramos que estados en diferentes sectores de superselección dan origen a un comportamiento super-extensivo en la entropía relativa. acknowledgement: "Se agradece a Horacio Casini por distintas discusiones y comentarios a lo largo del trabajo. LD cuenta con el apoyo de CNEA y UNCuyo, Inst. GT cuenta con el apoyo de CONICET,\r\nANPCyT, CNEA, y UNCuyo, Inst. Balseiro. RM cuenta con el apoyo de IST Austria. MS cuenta con el apoyode CONICET y UNCuyo, Inst. Balseiro. También se agradece a la Asociación Argentina de Física por la posibilidad de presentar este artículo en el marco de una Mención Especial por el Premio Luis Másperi 2020." article_processing_charge: No article_type: original author: - first_name: L. full_name: Daguerre, L. last_name: Daguerre - first_name: G. full_name: Torroba, G. last_name: Torroba - first_name: Raimel A full_name: Medina Ramos, Raimel A id: CE680B90-D85A-11E9-B684-C920E6697425 last_name: Medina Ramos - first_name: M. full_name: Solís, M. last_name: Solís citation: ama: 'Daguerre L, Torroba G, Medina Ramos RA, Solís M. Non relativistic quantum field theory: Dynamics and irreversibility. Anales de la Asociacion Fisica Argentina. 2022;32(4):93-98. doi:10.31527/analesafa.2021.32.4.93' apa: 'Daguerre, L., Torroba, G., Medina Ramos, R. A., & Solís, M. (2022). Non relativistic quantum field theory: Dynamics and irreversibility. Anales de la Asociacion Fisica Argentina. Asociación Física Argentina. https://doi.org/10.31527/analesafa.2021.32.4.93' chicago: 'Daguerre, L., G. Torroba, Raimel A Medina Ramos, and M. Solís. “Non relativistic quantum field theory: Dynamics and irreversibility.” Anales de la Asociacion Fisica Argentina. Asociación Física Argentina, 2022. https://doi.org/10.31527/analesafa.2021.32.4.93.' ieee: 'L. Daguerre, G. Torroba, R. A. Medina Ramos, and M. Solís, “Non relativistic quantum field theory: Dynamics and irreversibility,” Anales de la Asociacion Fisica Argentina, vol. 32, no. 4. Asociación Física Argentina, pp. 93–98, 2022.' ista: 'Daguerre L, Torroba G, Medina Ramos RA, Solís M. 2022. Non relativistic quantum field theory: Dynamics and irreversibility. Anales de la Asociacion Fisica Argentina. 32(4), 93–98.' mla: 'Daguerre, L., et al. “Non relativistic quantum field theory: Dynamics and irreversibility.” Anales de la Asociacion Fisica Argentina, vol. 32, no. 4, Asociación Física Argentina, 2022, pp. 93–98, doi:10.31527/analesafa.2021.32.4.93.' short: L. Daguerre, G. Torroba, R.A. Medina Ramos, M. Solís, Anales de la Asociacion Fisica Argentina 32 (2022) 93–98. date_created: 2022-02-20T23:01:32Z date_published: 2022-01-13T00:00:00Z date_updated: 2022-02-21T09:36:01Z day: '13' ddc: - '530' department: - _id: MaSe doi: 10.31527/analesafa.2021.32.4.93 file: - access_level: open_access checksum: ca66a3017205677c5b4d22b3bb74fb0b content_type: application/pdf creator: dernst date_created: 2022-02-21T09:32:44Z date_updated: 2022-02-21T09:32:44Z file_id: '10782' file_name: 2022_AnalesAFA_Daguerre.pdf file_size: 4505751 relation: main_file success: 1 file_date_updated: 2022-02-21T09:32:44Z has_accepted_license: '1' intvolume: ' 32' issue: '4' language: - iso: spa month: '01' oa: 1 oa_version: Published Version page: 93-98 publication: Anales de la Asociacion Fisica Argentina publication_identifier: eissn: - '18501168' publication_status: published publisher: Asociación Física Argentina quality_controlled: '1' scopus_import: '1' status: public title: 'Non relativistic quantum field theory: Dynamics and irreversibility' 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 32 year: '2022' ... --- _id: '10821' abstract: - lang: eng text: 'Rhythmical cortical activity has long been recognized as a pillar in the architecture of brain functions. Yet, the dynamic organization of its underlying neuronal population activity remains elusive. Here we uncover a unique organizational principle regulating collective neural dynamics associated with the alpha rhythm in the awake resting-state. We demonstrate that cascades of neural activity obey attenuation-amplification dynamics (AAD), with a transition from the attenuation regime—within alpha cycles—to the amplification regime—across a few alpha cycles—that correlates with the characteristic frequency of the alpha rhythm. We find that this short-term AAD is part of a large-scale, size-dependent temporal structure of neural cascades that obeys the Omori law: Following large cascades, smaller cascades occur at a rate that decays as a power-law of the time elapsed from such events—a long-term AAD regulating brain activity over the timescale of seconds. We show that such an organization corresponds to the "waxing and waning" of the alpha rhythm. Importantly, we observe that short- and long-term AAD are unique to the awake resting-state, being absent during NREM sleep. These results provide a quantitative, dynamical description of the so-far-qualitative notion of the "waxing and waning" phenomenon, and suggest the AAD as a key principle governing resting-state dynamics across timescales.' acknowledgement: FL acknowledges support from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement No. 754411. LdA acknowledges the Italian MIUR project PRIN2017WZFTZP for financial support and the project E-PASSION of the program VALERE 2019 funded by the University of Campania, Italy “L. Vanvitelli”. OS acknowledges support from the Israel Science Foundation, Grant No. 504/17. Supported in part by DIRP ZIAMH02797 to DP. article_processing_charge: No author: - first_name: Fabrizio full_name: Lombardi, Fabrizio id: A057D288-3E88-11E9-986D-0CF4E5697425 last_name: Lombardi orcid: 0000-0003-2623-5249 - first_name: Hans J. full_name: Herrmann, Hans J. last_name: Herrmann - first_name: Liborio full_name: Parrino, Liborio last_name: Parrino - first_name: Dietmar full_name: Plenz, Dietmar last_name: Plenz - first_name: Silvia full_name: Scarpetta, Silvia last_name: Scarpetta - first_name: Anna Elisabetta full_name: Vaudano, Anna Elisabetta last_name: Vaudano - first_name: Lucilla full_name: de Arcangelis, Lucilla last_name: de Arcangelis - first_name: Oren full_name: Shriki, Oren last_name: Shriki citation: ama: Lombardi F, Herrmann HJ, Parrino L, et al. Alpha rhythm induces attenuation-amplification dynamics in neural activity cascades. bioRxiv. 2022. doi:10.1101/2022.03.03.482657 apa: Lombardi, F., Herrmann, H. J., Parrino, L., Plenz, D., Scarpetta, S., Vaudano, A. E., … Shriki, O. (2022). Alpha rhythm induces attenuation-amplification dynamics in neural activity cascades. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/2022.03.03.482657 chicago: Lombardi, Fabrizio, Hans J. Herrmann, Liborio Parrino, Dietmar Plenz, Silvia Scarpetta, Anna Elisabetta Vaudano, Lucilla de Arcangelis, and Oren Shriki. “Alpha Rhythm Induces Attenuation-Amplification Dynamics in Neural Activity Cascades.” BioRxiv. Cold Spring Harbor Laboratory, 2022. https://doi.org/10.1101/2022.03.03.482657. ieee: F. Lombardi et al., “Alpha rhythm induces attenuation-amplification dynamics in neural activity cascades,” bioRxiv. Cold Spring Harbor Laboratory, 2022. ista: Lombardi F, Herrmann HJ, Parrino L, Plenz D, Scarpetta S, Vaudano AE, de Arcangelis L, Shriki O. 2022. Alpha rhythm induces attenuation-amplification dynamics in neural activity cascades. bioRxiv, 10.1101/2022.03.03.482657. mla: Lombardi, Fabrizio, et al. “Alpha Rhythm Induces Attenuation-Amplification Dynamics in Neural Activity Cascades.” BioRxiv, Cold Spring Harbor Laboratory, 2022, doi:10.1101/2022.03.03.482657. short: F. Lombardi, H.J. Herrmann, L. Parrino, D. Plenz, S. Scarpetta, A.E. Vaudano, L. de Arcangelis, O. Shriki, BioRxiv (2022). date_created: 2022-03-04T22:20:59Z date_published: 2022-03-04T00:00:00Z date_updated: 2022-03-07T07:28:34Z day: '04' department: - _id: GaTk doi: 10.1101/2022.03.03.482657 ec_funded: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1101/2022.03.03.482657 month: '03' oa: 1 oa_version: Preprint page: '25' project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: bioRxiv publication_status: published publisher: Cold Spring Harbor Laboratory status: public title: Alpha rhythm induces attenuation-amplification dynamics in neural activity cascades type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '10845' abstract: - lang: eng text: We study an impurity with a resonance level whose position coincides with the Fermi energy of the surrounding Fermi gas. An impurity causes a rapid variation of the scattering phase shift for fermions at the Fermi surface, introducing a new characteristic length scale into the problem. We investigate manifestations of this length scale in the self-energy of the impurity and in the density of the bath. Our calculations reveal a model-independent deformation of the density of the Fermi gas, which is determined by the width of the resonance. To provide a broader picture, we investigate time evolution of the density in quench dynamics, and study the behavior of the system at finite temperatures. Finally, we briefly discuss implications of our findings for the Fermi-polaron problem. acknowledgement: M.L. acknowledges support by the Austrian Science Fund (FWF), under Project No. P29902-N27, and by the European Research Council (ERC) starting Grant No. 801770 (ANGULON). A.G.V. acknowledges support by European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411. article_number: '013160' article_processing_charge: No article_type: original author: - first_name: Mikhail full_name: Maslov, Mikhail id: 2E65BB0E-F248-11E8-B48F-1D18A9856A87 last_name: Maslov orcid: 0000-0003-4074-2570 - first_name: Mikhail full_name: Lemeshko, Mikhail id: 37CB05FA-F248-11E8-B48F-1D18A9856A87 last_name: Lemeshko orcid: 0000-0002-6990-7802 - first_name: Artem full_name: Volosniev, Artem id: 37D278BC-F248-11E8-B48F-1D18A9856A87 last_name: Volosniev orcid: 0000-0003-0393-5525 citation: ama: Maslov M, Lemeshko M, Volosniev A. Impurity with a resonance in the vicinity of the Fermi energy. Physical Review Research. 2022;4. doi:10.1103/PhysRevResearch.4.013160 apa: Maslov, M., Lemeshko, M., & Volosniev, A. (2022). Impurity with a resonance in the vicinity of the Fermi energy. Physical Review Research. American Physical Society. https://doi.org/10.1103/PhysRevResearch.4.013160 chicago: Maslov, Mikhail, Mikhail Lemeshko, and Artem Volosniev. “Impurity with a Resonance in the Vicinity of the Fermi Energy.” Physical Review Research. American Physical Society, 2022. https://doi.org/10.1103/PhysRevResearch.4.013160. ieee: M. Maslov, M. Lemeshko, and A. Volosniev, “Impurity with a resonance in the vicinity of the Fermi energy,” Physical Review Research, vol. 4. American Physical Society, 2022. ista: Maslov M, Lemeshko M, Volosniev A. 2022. Impurity with a resonance in the vicinity of the Fermi energy. Physical Review Research. 4, 013160. mla: Maslov, Mikhail, et al. “Impurity with a Resonance in the Vicinity of the Fermi Energy.” Physical Review Research, vol. 4, 013160, American Physical Society, 2022, doi:10.1103/PhysRevResearch.4.013160. short: M. Maslov, M. Lemeshko, A. Volosniev, Physical Review Research 4 (2022). date_created: 2022-03-13T23:01:46Z date_published: 2022-03-01T00:00:00Z date_updated: 2022-03-14T08:42:24Z day: '01' ddc: - '530' department: - _id: MiLe doi: 10.1103/PhysRevResearch.4.013160 ec_funded: 1 external_id: arxiv: - '2111.13570' file: - access_level: open_access checksum: 62f64b3421a969656ebf52467fa7b6e8 content_type: application/pdf creator: dernst date_created: 2022-03-14T08:38:49Z date_updated: 2022-03-14T08:38:49Z file_id: '10848' file_name: 2022_PhysicalReviewResearch_Maslov.pdf file_size: 1258324 relation: main_file success: 1 file_date_updated: 2022-03-14T08:38:49Z has_accepted_license: '1' intvolume: ' 4' language: - iso: eng month: '03' oa: 1 oa_version: Published Version project: - _id: 26031614-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P29902 name: Quantum rotations in the presence of a many-body environment - _id: 2688CF98-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '801770' name: 'Angulon: physics and applications of a new quasiparticle' - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: Physical Review Research publication_identifier: issn: - 2643-1564 publication_status: published publisher: American Physical Society quality_controlled: '1' scopus_import: '1' status: public title: Impurity with a resonance in the vicinity of the Fermi energy 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 4 year: '2022' ... --- _id: '10939' abstract: - lang: eng text: Understanding and characterising biochemical processes inside single cells requires experimental platforms that allow one to perturb and observe the dynamics of such processes as well as computational methods to build and parameterise models from the collected data. Recent progress with experimental platforms and optogenetics has made it possible to expose each cell in an experiment to an individualised input and automatically record cellular responses over days with fine time resolution. However, methods to infer parameters of stochastic kinetic models from single-cell longitudinal data have generally been developed under the assumption that experimental data is sparse and that responses of cells to at most a few different input perturbations can be observed. Here, we investigate and compare different approaches for calculating parameter likelihoods of single-cell longitudinal data based on approximations of the chemical master equation (CME) with a particular focus on coupling the linear noise approximation (LNA) or moment closure methods to a Kalman filter. We show that, as long as cells are measured sufficiently frequently, coupling the LNA to a Kalman filter allows one to accurately approximate likelihoods and to infer model parameters from data even in cases where the LNA provides poor approximations of the CME. Furthermore, the computational cost of filtering-based iterative likelihood evaluation scales advantageously in the number of measurement times and different input perturbations and is thus ideally suited for data obtained from modern experimental platforms. To demonstrate the practical usefulness of these results, we perform an experiment in which single cells, equipped with an optogenetic gene expression system, are exposed to various different light-input sequences and measured at several hundred time points and use parameter inference based on iterative likelihood evaluation to parameterise a stochastic model of the system. acknowledgement: We thank Virgile Andreani for useful discussions about the model and parameter inference. We thank Johan Paulsson and Jeffrey J Tabor for kind gifts of plasmids. R was supported by the ANR grant CyberCircuits (ANR-18-CE91-0002). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript. article_number: e1009950 article_processing_charge: No article_type: original author: - first_name: Anđela full_name: Davidović, Anđela last_name: Davidović - first_name: Remy P full_name: Chait, Remy P id: 3464AE84-F248-11E8-B48F-1D18A9856A87 last_name: Chait orcid: 0000-0003-0876-3187 - first_name: Gregory full_name: Batt, Gregory last_name: Batt - first_name: Jakob full_name: Ruess, Jakob id: 4A245D00-F248-11E8-B48F-1D18A9856A87 last_name: Ruess orcid: 0000-0003-1615-3282 citation: ama: Davidović A, Chait RP, Batt G, Ruess J. Parameter inference for stochastic biochemical models from perturbation experiments parallelised at the single cell level. PLoS Computational Biology. 2022;18(3). doi:10.1371/journal.pcbi.1009950 apa: Davidović, A., Chait, R. P., Batt, G., & Ruess, J. (2022). Parameter inference for stochastic biochemical models from perturbation experiments parallelised at the single cell level. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1009950 chicago: Davidović, Anđela, Remy P Chait, Gregory Batt, and Jakob Ruess. “Parameter Inference for Stochastic Biochemical Models from Perturbation Experiments Parallelised at the Single Cell Level.” PLoS Computational Biology. Public Library of Science, 2022. https://doi.org/10.1371/journal.pcbi.1009950. ieee: A. Davidović, R. P. Chait, G. Batt, and J. Ruess, “Parameter inference for stochastic biochemical models from perturbation experiments parallelised at the single cell level,” PLoS Computational Biology, vol. 18, no. 3. Public Library of Science, 2022. ista: Davidović A, Chait RP, Batt G, Ruess J. 2022. Parameter inference for stochastic biochemical models from perturbation experiments parallelised at the single cell level. PLoS Computational Biology. 18(3), e1009950. mla: Davidović, Anđela, et al. “Parameter Inference for Stochastic Biochemical Models from Perturbation Experiments Parallelised at the Single Cell Level.” PLoS Computational Biology, vol. 18, no. 3, e1009950, Public Library of Science, 2022, doi:10.1371/journal.pcbi.1009950. short: A. Davidović, R.P. Chait, G. Batt, J. Ruess, PLoS Computational Biology 18 (2022). date_created: 2022-04-03T22:01:42Z date_published: 2022-03-18T00:00:00Z date_updated: 2022-04-04T10:21:53Z day: '18' ddc: - '570' - '000' department: - _id: CaGu doi: 10.1371/journal.pcbi.1009950 file: - access_level: open_access checksum: 458ef542761fb714ced214f240daf6b2 content_type: application/pdf creator: dernst date_created: 2022-04-04T10:14:39Z date_updated: 2022-04-04T10:14:39Z file_id: '10947' file_name: 2022_PLoSCompBio_Davidovic.pdf file_size: 2958642 relation: main_file success: 1 file_date_updated: 2022-04-04T10:14:39Z has_accepted_license: '1' intvolume: ' 18' issue: '3' language: - iso: eng month: '03' oa: 1 oa_version: Published Version publication: PLoS Computational Biology publication_identifier: eissn: - 1553-7358 issn: - 1553-734X publication_status: published publisher: Public Library of Science quality_controlled: '1' related_material: link: - relation: software url: https://gitlab.pasteur.fr/adavidov/inferencelnakf scopus_import: '1' status: public title: Parameter inference for stochastic biochemical models from perturbation experiments parallelised at the single cell level 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 18 year: '2022' ... --- _id: '11184' abstract: - lang: eng text: "Let G be a graph on n nodes. In the stochastic population protocol model, a collection of n indistinguishable, resource-limited nodes collectively solve tasks via pairwise interactions. In each interaction, two randomly chosen neighbors first read each other’s states, and then update their local states. A rich line of research has established tight upper and lower bounds on the complexity of fundamental tasks, such as majority and leader election, in this model, when G is a clique. Specifically, in the clique, these tasks can be solved fast, i.e., in n polylog n pairwise interactions, with high probability, using at most polylog n states per node.\r\nIn this work, we consider the more general setting where G is an arbitrary regular graph, and present a technique for simulating protocols designed for fully-connected networks in any connected regular graph. Our main result is a simulation that is efficient on many interesting graph families: roughly, the simulation overhead is polylogarithmic in the number of nodes, and quadratic in the conductance of the graph. As a sample application, we show that, in any regular graph with conductance φ, both leader election and exact majority can be solved in φ^{-2} ⋅ n polylog n pairwise interactions, with high probability, using at most φ^{-2} ⋅ polylog n states per node. This shows that there are fast and space-efficient population protocols for leader election and exact majority on graphs with good expansion properties. We believe our results will prove generally useful, as they allow efficient technology transfer between the well-mixed (clique) case, and the under-explored spatial setting." acknowledgement: "Dan Alistarh: This project has received funding from the European Research Council (ERC)\r\nunder the European Union’s Horizon 2020 research and innovation programme (grant agreement No.805223 ScaleML).\r\nJoel Rybicki: This project has received from the European Union’s Horizon 2020 research and\r\ninnovation programme under the Marie Skłodowska-Curie grant agreement No. 840605.\r\nAcknowledgements We grateful to Giorgi Nadiradze for pointing out a generalisation of the phase clock construction to non-regular graphs. We also thank anonymous reviewers for their useful comments on earlier versions of this manuscript." alternative_title: - LIPIcs article_number: '14' article_processing_charge: No author: - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X - first_name: Rati full_name: Gelashvili, Rati last_name: Gelashvili - first_name: Joel full_name: Rybicki, Joel id: 334EFD2E-F248-11E8-B48F-1D18A9856A87 last_name: Rybicki orcid: 0000-0002-6432-6646 citation: ama: 'Alistarh D-A, Gelashvili R, Rybicki J. Fast graphical population protocols. In: Bramas Q, Gramoli V, Milani A, eds. 25th International Conference on Principles of Distributed Systems. Vol 217. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.OPODIS.2021.14' apa: 'Alistarh, D.-A., Gelashvili, R., & Rybicki, J. (2022). Fast graphical population protocols. In Q. Bramas, V. Gramoli, & A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems (Vol. 217). Strasbourg, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2021.14' chicago: Alistarh, Dan-Adrian, Rati Gelashvili, and Joel Rybicki. “Fast Graphical Population Protocols.” In 25th International Conference on Principles of Distributed Systems, edited by Quentin Bramas, Vincent Gramoli, and Alessia Milani, Vol. 217. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.OPODIS.2021.14. ieee: D.-A. Alistarh, R. Gelashvili, and J. Rybicki, “Fast graphical population protocols,” in 25th International Conference on Principles of Distributed Systems, Strasbourg, France, 2022, vol. 217. ista: Alistarh D-A, Gelashvili R, Rybicki J. 2022. Fast graphical population protocols. 25th International Conference on Principles of Distributed Systems. OPODIS, LIPIcs, vol. 217, 14. mla: Alistarh, Dan-Adrian, et al. “Fast Graphical Population Protocols.” 25th International Conference on Principles of Distributed Systems, edited by Quentin Bramas et al., vol. 217, 14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.OPODIS.2021.14. short: D.-A. Alistarh, R. Gelashvili, J. Rybicki, in:, Q. Bramas, V. Gramoli, A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. conference: end_date: 2021-12-15 location: Strasbourg, France name: OPODIS start_date: 2021-12-13 date_created: 2022-04-17T22:01:47Z date_published: 2022-02-01T00:00:00Z date_updated: 2022-05-02T08:09:39Z day: '01' ddc: - '510' department: - _id: DaAl doi: 10.4230/LIPIcs.OPODIS.2021.14 ec_funded: 1 editor: - first_name: Quentin full_name: Bramas, Quentin last_name: Bramas - first_name: Vincent full_name: Gramoli, Vincent last_name: Gramoli - first_name: Alessia full_name: Milani, Alessia last_name: Milani external_id: arxiv: - '2102.08808' file: - access_level: open_access checksum: 2c7c982174c6f98c4ca6e92539d15086 content_type: application/pdf creator: dernst date_created: 2022-05-02T08:06:33Z date_updated: 2022-05-02T08:06:33Z file_id: '11346' file_name: 2022_LIPICs_Alistarh.pdf file_size: 959406 relation: main_file success: 1 file_date_updated: 2022-05-02T08:06:33Z has_accepted_license: '1' intvolume: ' 217' language: - iso: eng month: '02' oa: 1 oa_version: Published Version project: - _id: 268A44D6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '805223' name: Elastic Coordination for Scalable Machine Learning - _id: 26A5D39A-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '840605' name: Coordination in constrained and natural distributed systems publication: 25th International Conference on Principles of Distributed Systems publication_identifier: isbn: - '9783959772198' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Fast graphical population protocols 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: 217 year: '2022' ... --- _id: '11183' abstract: - lang: eng text: "Subgraph detection has recently been one of the most studied problems in the CONGEST model of distributed computing. In this work, we study the distributed complexity of problems closely related to subgraph detection, mainly focusing on induced subgraph detection. The main line of this work presents lower bounds and parameterized algorithms w.r.t structural parameters of the input graph:\r\n- On general graphs, we give unconditional lower bounds for induced detection of cycles and patterns of treewidth 2 in CONGEST. Moreover, by adapting reductions from centralized parameterized complexity, we prove lower bounds in CONGEST for detecting patterns with a 4-clique, and for induced path detection conditional on the hardness of triangle detection in the congested clique.\r\n- On graphs of bounded degeneracy, we show that induced paths can be detected fast in CONGEST using techniques from parameterized algorithms, while detecting cycles and patterns of treewidth 2 is hard.\r\n- On graphs of bounded vertex cover number, we show that induced subgraph detection is easy in CONGEST for any pattern graph. More specifically, we adapt a centralized parameterized algorithm for a more general maximum common induced subgraph detection problem to the distributed setting. In addition to these induced subgraph detection results, we study various related problems in the CONGEST and congested clique models, including for multicolored versions of subgraph-detection-like problems." acknowledgement: "Amir Nikabadi: Supported by the LABEX MILYON (ANR-10-LABX-0070) of Université de Lyon, within the program “Investissements d’Avenir” (ANR-11-IDEX-0007) operated by the French National Research Agency (ANR). Janne H. Korhonen: Supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML).\r\nWe thank François Le Gall and Masayuki Miyamoto for sharing their work on lower bounds for induced subgraph detection [36]." alternative_title: - LIPIcs article_number: '15' article_processing_charge: No author: - first_name: Amir full_name: Nikabadi, Amir last_name: Nikabadi - first_name: Janne full_name: Korhonen, Janne id: C5402D42-15BC-11E9-A202-CA2BE6697425 last_name: Korhonen citation: ama: 'Nikabadi A, Korhonen J. Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters. In: Bramas Q, Gramoli V, Milani A, eds. 25th International Conference on Principles of Distributed Systems. Vol 217. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.OPODIS.2021.15' apa: 'Nikabadi, A., & Korhonen, J. (2022). Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters. In Q. Bramas, V. Gramoli, & A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems (Vol. 217). Strasbourg, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2021.15' chicago: 'Nikabadi, Amir, and Janne Korhonen. “Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters.” In 25th International Conference on Principles of Distributed Systems, edited by Quentin Bramas, Vincent Gramoli, and Alessia Milani, Vol. 217. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.OPODIS.2021.15.' ieee: 'A. Nikabadi and J. Korhonen, “Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters,” in 25th International Conference on Principles of Distributed Systems, Strasbourg, France, 2022, vol. 217.' ista: 'Nikabadi A, Korhonen J. 2022. Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters. 25th International Conference on Principles of Distributed Systems. OPODIS, LIPIcs, vol. 217, 15.' mla: 'Nikabadi, Amir, and Janne Korhonen. “Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters.” 25th International Conference on Principles of Distributed Systems, edited by Quentin Bramas et al., vol. 217, 15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.OPODIS.2021.15.' short: A. Nikabadi, J. Korhonen, in:, Q. Bramas, V. Gramoli, A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. conference: end_date: 2021-12-15 location: Strasbourg, France name: OPODIS start_date: 2021-12-13 date_created: 2022-04-17T22:01:47Z date_published: 2022-02-01T00:00:00Z date_updated: 2022-05-02T07:56:35Z day: '01' ddc: - '510' department: - _id: DaAl doi: 10.4230/LIPIcs.OPODIS.2021.15 ec_funded: 1 editor: - first_name: Quentin full_name: Bramas, Quentin last_name: Bramas - first_name: Vincent full_name: Gramoli, Vincent last_name: Gramoli - first_name: Alessia full_name: Milani, Alessia last_name: Milani file: - access_level: open_access checksum: 626551c14de5d4091573200ed0535752 content_type: application/pdf creator: dernst date_created: 2022-05-02T07:53:00Z date_updated: 2022-05-02T07:53:00Z file_id: '11345' file_name: 2022_LIPICs_Nikabadi.pdf file_size: 790396 relation: main_file success: 1 file_date_updated: 2022-05-02T07:53:00Z has_accepted_license: '1' intvolume: ' 217' language: - iso: eng month: '02' oa: 1 oa_version: Published Version project: - _id: 268A44D6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '805223' name: Elastic Coordination for Scalable Machine Learning publication: 25th International Conference on Principles of Distributed Systems publication_identifier: isbn: - '9783959772198' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: 'Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters' 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: 217 year: '2022' ... --- _id: '11182' abstract: - lang: eng text: Immune cells are constantly on the move through multicellular organisms to explore and respond to pathogens and other harmful insults. While moving, immune cells efficiently traverse microenvironments composed of tissue cells and extracellular fibers, which together form complex environments of various porosity, stiffness, topography, and chemical composition. In this protocol we describe experimental procedures to investigate immune cell migration through microenvironments of heterogeneous porosity. In particular, we describe micro-channels, micro-pillars, and collagen networks as cell migration paths with alternative pore size choices. Employing micro-channels or micro-pillars that divide at junctions into alternative paths with initially differentially sized pores allows us to precisely (1) measure the cellular translocation time through these porous path junctions, (2) quantify the cellular preference for individual pore sizes, and (3) image cellular components like the nucleus and the cytoskeleton. This reductionistic experimental setup thus can elucidate how immune cells perform decisions in complex microenvironments of various porosity like the interstitium. The setup further allows investigation of the underlying forces of cellular squeezing and the consequences of cellular deformation on the integrity of the cell and its organelles. As a complementary approach that does not require any micro-engineering expertise, we describe the usage of three-dimensional collagen networks with different pore sizes. Whereas we here focus on dendritic cells as a model for motile immune cells, the described protocols are versatile as they are also applicable for other immune cell types like neutrophils and non-immune cell types such as mesenchymal and cancer cells. In summary, we here describe protocols to identify the mechanisms and principles of cellular probing, decision making, and squeezing during cellular movement through microenvironments of heterogeneous porosity. acknowledgement: "We thank Kasia Stefanowski for excellent technical assistance, and the Core Facility Bioimaging of the Biomedical Center (BMC) of the Ludwig-Maximilian University for excellent support. We gratefully acknowledge financial support from the Peter Hans Hofschneider Professorship of the Stiftung Experimentelle Biomedizin (to J.R), from the DFG (Collaborative Research Center SFB914, project A12; and Priority Programme SPP2332, project 492014049; both to J.R) and from the LMU Institutional Strategy LMU-Excellent within the framework of the German Excellence Initiative (to J.R).\r\nOpen access funding enabled and organized by Projekt DEAL." article_number: e407 article_processing_charge: No article_type: original author: - first_name: Janina full_name: Kroll, Janina last_name: Kroll - first_name: Mauricio J.A. full_name: Ruiz-Fernandez, Mauricio J.A. last_name: Ruiz-Fernandez - first_name: Malte B. full_name: Braun, Malte B. last_name: Braun - first_name: Jack full_name: Merrin, Jack id: 4515C308-F248-11E8-B48F-1D18A9856A87 last_name: Merrin orcid: 0000-0001-5145-4609 - first_name: Jörg full_name: Renkawitz, Jörg id: 3F0587C8-F248-11E8-B48F-1D18A9856A87 last_name: Renkawitz orcid: 0000-0003-2856-3369 citation: ama: Kroll J, Ruiz-Fernandez MJA, Braun MB, Merrin J, Renkawitz J. Quantifying the probing and selection of microenvironmental pores by motile immune cells. Current Protocols. 2022;2(4). doi:10.1002/cpz1.407 apa: Kroll, J., Ruiz-Fernandez, M. J. A., Braun, M. B., Merrin, J., & Renkawitz, J. (2022). Quantifying the probing and selection of microenvironmental pores by motile immune cells. Current Protocols. Wiley. https://doi.org/10.1002/cpz1.407 chicago: Kroll, Janina, Mauricio J.A. Ruiz-Fernandez, Malte B. Braun, Jack Merrin, and Jörg Renkawitz. “Quantifying the Probing and Selection of Microenvironmental Pores by Motile Immune Cells.” Current Protocols. Wiley, 2022. https://doi.org/10.1002/cpz1.407. ieee: J. Kroll, M. J. A. Ruiz-Fernandez, M. B. Braun, J. Merrin, and J. Renkawitz, “Quantifying the probing and selection of microenvironmental pores by motile immune cells,” Current Protocols, vol. 2, no. 4. Wiley, 2022. ista: Kroll J, Ruiz-Fernandez MJA, Braun MB, Merrin J, Renkawitz J. 2022. Quantifying the probing and selection of microenvironmental pores by motile immune cells. Current Protocols. 2(4), e407. mla: Kroll, Janina, et al. “Quantifying the Probing and Selection of Microenvironmental Pores by Motile Immune Cells.” Current Protocols, vol. 2, no. 4, e407, Wiley, 2022, doi:10.1002/cpz1.407. short: J. Kroll, M.J.A. Ruiz-Fernandez, M.B. Braun, J. Merrin, J. Renkawitz, Current Protocols 2 (2022). date_created: 2022-04-17T22:01:46Z date_published: 2022-04-05T00:00:00Z date_updated: 2022-05-02T08:18:00Z day: '05' ddc: - '570' department: - _id: NanoFab doi: 10.1002/cpz1.407 external_id: pmid: - '35384410' file: - access_level: open_access checksum: 72152d005c367777f6cf2f6a477f0d52 content_type: application/pdf creator: dernst date_created: 2022-05-02T08:16:10Z date_updated: 2022-05-02T08:16:10Z file_id: '11347' file_name: 2022_CurrentProtocols_Kroll.pdf file_size: 2142703 relation: main_file success: 1 file_date_updated: 2022-05-02T08:16:10Z has_accepted_license: '1' intvolume: ' 2' issue: '4' language: - iso: eng month: '04' oa: 1 oa_version: Published Version pmid: 1 publication: Current Protocols publication_identifier: eissn: - 2691-1299 publication_status: published publisher: Wiley quality_controlled: '1' scopus_import: '1' status: public title: Quantifying the probing and selection of microenvironmental pores by motile immune cells 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2 year: '2022' ... --- _id: '11428' abstract: - lang: eng text: The medial axis of a set consists of the points in the ambient space without a unique closest point on the original set. Since its introduction, the medial axis has been used extensively in many applications as a method of computing a topologically equivalent skeleton. Unfortunately, one limiting factor in the use of the medial axis of a smooth manifold is that it is not necessarily topologically stable under small perturbations of the manifold. To counter these instabilities various prunings of the medial axis have been proposed. Here, we examine one type of pruning, called burning. Because of the good experimental results, it was hoped that the burning method of simplifying the medial axis would be stable. In this work we show a simple example that dashes such hopes based on Bing’s house with two rooms, demonstrating an isotopy of a shape where the medial axis goes from collapsible to non-collapsible. acknowledgement: 'Partially supported by the DFG Collaborative Research Center TRR 109, “Discretization in Geometry and Dynamics” and the European Research Council (ERC), grant no. 788183, “Alpha Shape Theory Extended”. Erin Chambers: Supported in part by the National Science Foundation through grants DBI-1759807, CCF-1907612, and CCF-2106672. Mathijs Wintraecken: Supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411. The Austrian science fund (FWF) M-3073 Acknowledgements We thank André Lieutier, David Letscher, Ellen Gasparovic, Kathryn Leonard, and Tao Ju for early discussions on this work. We also thank Lu Liu, Yajie Yan and Tao Ju for sharing code to generate the examples.' article_processing_charge: No author: - first_name: Erin full_name: Chambers, Erin last_name: Chambers - first_name: Christopher D full_name: Fillmore, Christopher D id: 35638A5C-AAC7-11E9-B0BF-5503E6697425 last_name: Fillmore - first_name: Elizabeth R full_name: Stephenson, Elizabeth R id: 2D04F932-F248-11E8-B48F-1D18A9856A87 last_name: Stephenson orcid: 0000-0002-6862-208X - first_name: Mathijs full_name: Wintraecken, Mathijs id: 307CFBC8-F248-11E8-B48F-1D18A9856A87 last_name: Wintraecken orcid: 0000-0002-7472-2220 citation: ama: 'Chambers E, Fillmore CD, Stephenson ER, Wintraecken M. A cautionary tale: Burning the medial axis is unstable. In: Goaoc X, Kerber M, eds. 38th International Symposium on Computational Geometry. Vol 224. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:66:1-66:9. doi:10.4230/LIPIcs.SoCG.2022.66' apa: 'Chambers, E., Fillmore, C. D., Stephenson, E. R., & Wintraecken, M. (2022). A cautionary tale: Burning the medial axis is unstable. In X. Goaoc & M. Kerber (Eds.), 38th International Symposium on Computational Geometry (Vol. 224, p. 66:1-66:9). Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2022.66' chicago: 'Chambers, Erin, Christopher D Fillmore, Elizabeth R Stephenson, and Mathijs Wintraecken. “A Cautionary Tale: Burning the Medial Axis Is Unstable.” In 38th International Symposium on Computational Geometry, edited by Xavier Goaoc and Michael Kerber, 224:66:1-66:9. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.SoCG.2022.66.' ieee: 'E. Chambers, C. D. Fillmore, E. R. Stephenson, and M. Wintraecken, “A cautionary tale: Burning the medial axis is unstable,” in 38th International Symposium on Computational Geometry, Berlin, Germany, 2022, vol. 224, p. 66:1-66:9.' ista: 'Chambers E, Fillmore CD, Stephenson ER, Wintraecken M. 2022. A cautionary tale: Burning the medial axis is unstable. 38th International Symposium on Computational Geometry. SoCG: Symposium on Computational GeometryLIPIcs vol. 224, 66:1-66:9.' mla: 'Chambers, Erin, et al. “A Cautionary Tale: Burning the Medial Axis Is Unstable.” 38th International Symposium on Computational Geometry, edited by Xavier Goaoc and Michael Kerber, vol. 224, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 66:1-66:9, doi:10.4230/LIPIcs.SoCG.2022.66.' short: E. Chambers, C.D. Fillmore, E.R. Stephenson, M. Wintraecken, in:, X. Goaoc, M. Kerber (Eds.), 38th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 66:1-66:9. conference: end_date: 2022-06-10 location: Berlin, Germany name: 'SoCG: Symposium on Computational Geometry' start_date: 2022-06-07 date_created: 2022-06-01T14:18:04Z date_published: 2022-06-01T00:00:00Z date_updated: 2023-02-21T09:50:52Z day: '01' ddc: - '510' department: - _id: HeEd doi: 10.4230/LIPIcs.SoCG.2022.66 ec_funded: 1 editor: - first_name: Xavier full_name: Goaoc, Xavier last_name: Goaoc - first_name: Michael full_name: Kerber, Michael last_name: Kerber file: - access_level: open_access checksum: b25ce40fade4ebc0bcaae176db4f5f1f content_type: application/pdf creator: dernst date_created: 2022-06-07T07:58:30Z date_updated: 2022-06-07T07:58:30Z file_id: '11437' file_name: 2022_LIPICs_Chambers.pdf file_size: 17580705 relation: main_file success: 1 file_date_updated: 2022-06-07T07:58:30Z has_accepted_license: '1' intvolume: ' 224' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 66:1-66:9 project: - _id: fc390959-9c52-11eb-aca3-afa58bd282b2 grant_number: M03073 name: Learning and triangulating manifolds via collapses - _id: 266A2E9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '788183' name: Alpha Shape Theory Extended - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: 38th International Symposium on Computational Geometry publication_identifier: isbn: - 978-3-95977-227-3 issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' series_title: LIPIcs status: public title: 'A cautionary tale: Burning the medial axis is unstable' 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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 224 year: '2022' ... --- _id: '11420' abstract: - lang: eng text: 'Understanding the properties of neural networks trained via stochastic gradient descent (SGD) is at the heart of the theory of deep learning. In this work, we take a mean-field view, and consider a two-layer ReLU network trained via noisy-SGD for a univariate regularized regression problem. Our main result is that SGD with vanishingly small noise injected in the gradients is biased towards a simple solution: at convergence, the ReLU network implements a piecewise linear map of the inputs, and the number of “knot” points -- i.e., points where the tangent of the ReLU network estimator changes -- between two consecutive training inputs is at most three. In particular, as the number of neurons of the network grows, the SGD dynamics is captured by the solution of a gradient flow and, at convergence, the distribution of the weights approaches the unique minimizer of a related free energy, which has a Gibbs form. Our key technical contribution consists in the analysis of the estimator resulting from this minimizer: we show that its second derivative vanishes everywhere, except at some specific locations which represent the “knot” points. We also provide empirical evidence that knots at locations distinct from the data points might occur, as predicted by our theory.' acknowledgement: "We would like to thank Mert Pilanci for several exploratory discussions in the early stage\r\nof the project, Jan Maas for clarifications about Jordan et al. (1998), and Max Zimmer for\r\nsuggestive numerical experiments. A. Shevchenko and M. Mondelli are partially supported\r\nby the 2019 Lopez-Loreta Prize. V. Kungurtsev acknowledges support to the OP VVV\r\nproject CZ.02.1.01/0.0/0.0/16 019/0000765 Research Center for Informatics.\r\n" article_processing_charge: No article_type: original author: - first_name: Aleksandr full_name: Shevchenko, Aleksandr id: F2B06EC2-C99E-11E9-89F0-752EE6697425 last_name: Shevchenko - first_name: Vyacheslav full_name: Kungurtsev, Vyacheslav last_name: Kungurtsev - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 citation: ama: Shevchenko A, Kungurtsev V, Mondelli M. Mean-field analysis of piecewise linear solutions for wide ReLU networks. Journal of Machine Learning Research. 2022;23(130):1-55. apa: Shevchenko, A., Kungurtsev, V., & Mondelli, M. (2022). Mean-field analysis of piecewise linear solutions for wide ReLU networks. Journal of Machine Learning Research. Journal of Machine Learning Research. chicago: Shevchenko, Aleksandr, Vyacheslav Kungurtsev, and Marco Mondelli. “Mean-Field Analysis of Piecewise Linear Solutions for Wide ReLU Networks.” Journal of Machine Learning Research. Journal of Machine Learning Research, 2022. ieee: A. Shevchenko, V. Kungurtsev, and M. Mondelli, “Mean-field analysis of piecewise linear solutions for wide ReLU networks,” Journal of Machine Learning Research, vol. 23, no. 130. Journal of Machine Learning Research, pp. 1–55, 2022. ista: Shevchenko A, Kungurtsev V, Mondelli M. 2022. Mean-field analysis of piecewise linear solutions for wide ReLU networks. Journal of Machine Learning Research. 23(130), 1–55. mla: Shevchenko, Aleksandr, et al. “Mean-Field Analysis of Piecewise Linear Solutions for Wide ReLU Networks.” Journal of Machine Learning Research, vol. 23, no. 130, Journal of Machine Learning Research, 2022, pp. 1–55. short: A. Shevchenko, V. Kungurtsev, M. Mondelli, Journal of Machine Learning Research 23 (2022) 1–55. date_created: 2022-05-29T22:01:54Z date_published: 2022-04-01T00:00:00Z date_updated: 2022-05-30T08:34:14Z day: '01' ddc: - '000' department: - _id: MaMo - _id: DaAl external_id: arxiv: - '2111.02278' file: - access_level: open_access checksum: d4ff5d1affb34848b5c5e4002483fc62 content_type: application/pdf creator: cchlebak date_created: 2022-05-30T08:22:55Z date_updated: 2022-05-30T08:22:55Z file_id: '11422' file_name: 21-1365.pdf file_size: 1521701 relation: main_file success: 1 file_date_updated: 2022-05-30T08:22:55Z has_accepted_license: '1' intvolume: ' 23' issue: '130' language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 1-55 project: - _id: 059876FA-7A3F-11EA-A408-12923DDC885E name: Prix Lopez-Loretta 2019 - Marco Mondelli publication: Journal of Machine Learning Research publication_identifier: eissn: - 1533-7928 issn: - 1532-4435 publication_status: published publisher: Journal of Machine Learning Research quality_controlled: '1' related_material: link: - relation: other url: https://www.jmlr.org/papers/v23/21-1365.html scopus_import: '1' status: public title: Mean-field analysis of piecewise linear solutions for wide ReLU networks 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: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 23 year: '2022' ... --- _id: '11440' abstract: - lang: eng text: To compute the persistent homology of a grayscale digital image one needs to build a simplicial or cubical complex from it. For cubical complexes, the two commonly used constructions (corresponding to direct and indirect digital adjacencies) can give different results for the same image. The two constructions are almost dual to each other, and we use this relationship to extend and modify the cubical complexes to become dual filtered cell complexes. We derive a general relationship between the persistent homology of two dual filtered cell complexes, and also establish how various modifications to a filtered complex change the persistence diagram. Applying these results to images, we derive a method to transform the persistence diagram computed using one type of cubical complex into a persistence diagram for the other construction. This means software for computing persistent homology from images can now be easily adapted to produce results for either of the two cubical complex constructions without additional low-level code implementation. acknowledgement: This project started during the Women in Computational Topology workshop held in Canberra in July of 2019. All authors are very grateful for its organisation and the financial support for the workshop from the Mathematical Sciences Institute at ANU, the US National Science Foundation through the award CCF-1841455, the Australian Mathematical Sciences Institute and the Association for Women in Mathematics. AG is supported by the Swiss National Science Foundation grant CRSII5_177237. TH is supported by the European Research Council (ERC) Horizon 2020 project “Alpha Shape Theory Extended” No. 788183. KM is supported by the ERC Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 859860. VR was supported by Australian Research Council Future Fellowship FT140100604 during the early stages of this project. alternative_title: - Association for Women in Mathematics Series article_processing_charge: No author: - first_name: Bea full_name: Bleile, Bea last_name: Bleile - first_name: Adélie full_name: Garin, Adélie last_name: Garin - first_name: Teresa full_name: Heiss, Teresa id: 4879BB4E-F248-11E8-B48F-1D18A9856A87 last_name: Heiss orcid: 0000-0002-1780-2689 - first_name: Kelly full_name: Maggs, Kelly last_name: Maggs - first_name: Vanessa full_name: Robins, Vanessa last_name: Robins citation: ama: 'Bleile B, Garin A, Heiss T, Maggs K, Robins V. The persistent homology of dual digital image constructions. In: Gasparovic E, Robins V, Turner K, eds. Research in Computational Topology 2. Vol 30. 1st ed. AWMS. Cham: Springer Nature; 2022:1-26. doi:10.1007/978-3-030-95519-9_1' apa: 'Bleile, B., Garin, A., Heiss, T., Maggs, K., & Robins, V. (2022). The persistent homology of dual digital image constructions. In E. Gasparovic, V. Robins, & K. Turner (Eds.), Research in Computational Topology 2 (1st ed., Vol. 30, pp. 1–26). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-95519-9_1' chicago: 'Bleile, Bea, Adélie Garin, Teresa Heiss, Kelly Maggs, and Vanessa Robins. “The Persistent Homology of Dual Digital Image Constructions.” In Research in Computational Topology 2, edited by Ellen Gasparovic, Vanessa Robins, and Katharine Turner, 1st ed., 30:1–26. AWMS. Cham: Springer Nature, 2022. https://doi.org/10.1007/978-3-030-95519-9_1.' ieee: 'B. Bleile, A. Garin, T. Heiss, K. Maggs, and V. Robins, “The persistent homology of dual digital image constructions,” in Research in Computational Topology 2, 1st ed., vol. 30, E. Gasparovic, V. Robins, and K. Turner, Eds. Cham: Springer Nature, 2022, pp. 1–26.' ista: 'Bleile B, Garin A, Heiss T, Maggs K, Robins V. 2022.The persistent homology of dual digital image constructions. In: Research in Computational Topology 2. Association for Women in Mathematics Series, vol. 30, 1–26.' mla: Bleile, Bea, et al. “The Persistent Homology of Dual Digital Image Constructions.” Research in Computational Topology 2, edited by Ellen Gasparovic et al., 1st ed., vol. 30, Springer Nature, 2022, pp. 1–26, doi:10.1007/978-3-030-95519-9_1. short: B. Bleile, A. Garin, T. Heiss, K. Maggs, V. Robins, in:, E. Gasparovic, V. Robins, K. Turner (Eds.), Research in Computational Topology 2, 1st ed., Springer Nature, Cham, 2022, pp. 1–26. date_created: 2022-06-07T08:21:11Z date_published: 2022-01-27T00:00:00Z date_updated: 2022-06-07T08:32:42Z day: '27' department: - _id: HeEd doi: 10.1007/978-3-030-95519-9_1 ec_funded: 1 edition: '1' editor: - first_name: Ellen full_name: Gasparovic, Ellen last_name: Gasparovic - first_name: Vanessa full_name: Robins, Vanessa last_name: Robins - first_name: Katharine full_name: Turner, Katharine last_name: Turner external_id: arxiv: - '2102.11397' intvolume: ' 30' language: - iso: eng main_file_link: - open_access: '1' url: ' https://doi.org/10.48550/arXiv.2102.11397' month: '01' oa: 1 oa_version: Preprint page: 1-26 place: Cham project: - _id: 266A2E9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '788183' name: Alpha Shape Theory Extended publication: Research in Computational Topology 2 publication_identifier: eisbn: - '9783030955199' isbn: - '9783030955182' publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' series_title: AWMS status: public title: The persistent homology of dual digital image constructions type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 30 year: '2022' ... --- _id: '11444' abstract: - lang: eng text: "This article investigates library-related documents written by Gerard van Swieten (1700–72) during his tenure as Library Prefect in the Imperial Library of Vienna (1745–72). Van Swieten’s time as Library Prefect is considered through a textual analysis. Handwritten letters were deconstructed in terms of their appearance, layout, and tone in order to mine them for meaning. Furthermore, the contents were examined for library matters such as censorship, catalogues, and collection development. The Imperial Court Library held a prominent role as a repository for rare and valuable works, later becoming the National Library of Austria.\r\nGerard van Swieten’s work as a librarian tends to be overlooked, perhaps because he is better known as the private physician of Maria Theresia, as well as a medical reformer. Nevertheless, he was a hard-working chief librarian deeply involved in all aspects of librarianship. Van Swieten endorsed modern scientific works, which were otherwise banned officially by the censorship commission, for the use of scholars in the library, expanded the collection by acquiring books through his network of scholars and publishers, and reissued library catalogues. He also provided for the comfort of users in the library reading room, at a time when such considerations were unusual. In conclusion, a proposal is made that van Swieten viewed his role as librarian with some importance and pride." article_processing_charge: No article_type: original author: - first_name: Clara A full_name: Chlebak, Clara A id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 last_name: Chlebak orcid: 0000-0002-3385-3865 - first_name: Peter H. full_name: Reid, Peter H. last_name: Reid citation: ama: 'Chlebak CA, Reid PH. From the prefect’s desk: Gerard van Swieten’s library correspondence. Library and Information History. 2022;38(1):23-41. doi:10.3366/lih.2022.0097' apa: 'Chlebak, C. A., & Reid, P. H. (2022). From the prefect’s desk: Gerard van Swieten’s library correspondence. Library and Information History. Edinburgh University Press. https://doi.org/10.3366/lih.2022.0097' chicago: 'Chlebak, Clara A, and Peter H. Reid. “From the Prefect’s Desk: Gerard van Swieten’s Library Correspondence.” Library and Information History. Edinburgh University Press, 2022. https://doi.org/10.3366/lih.2022.0097.' ieee: 'C. A. Chlebak and P. H. Reid, “From the prefect’s desk: Gerard van Swieten’s library correspondence,” Library and Information History, vol. 38, no. 1. Edinburgh University Press, pp. 23–41, 2022.' ista: 'Chlebak CA, Reid PH. 2022. From the prefect’s desk: Gerard van Swieten’s library correspondence. Library and Information History. 38(1), 23–41.' mla: 'Chlebak, Clara A., and Peter H. Reid. “From the Prefect’s Desk: Gerard van Swieten’s Library Correspondence.” Library and Information History, vol. 38, no. 1, Edinburgh University Press, 2022, pp. 23–41, doi:10.3366/lih.2022.0097.' short: C.A. Chlebak, P.H. Reid, Library and Information History 38 (2022) 23–41. date_created: 2022-06-12T22:01:45Z date_published: 2022-04-01T00:00:00Z date_updated: 2023-02-21T09:51:29Z day: '01' department: - _id: E-Lib doi: 10.3366/lih.2022.0097 intvolume: ' 38' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://rgu-repository.worktribe.com/output/1635939 month: '04' oa: 1 oa_version: Submitted Version page: 23-41 publication: Library and Information History publication_identifier: eissn: - 1758-3497 issn: - 1758-3489 publication_status: published publisher: Edinburgh University Press quality_controlled: '1' scopus_import: '1' status: public title: 'From the prefect’s desk: Gerard van Swieten’s library correspondence' type: journal_article user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 38 year: '2022' ... --- _id: '11553' abstract: - lang: eng text: "In holomorphic dynamics, complex box mappings arise as first return maps to wellchosen domains. They are a generalization of polynomial-like mapping, where the domain of the return map can have infinitely many components. They turned out to be extremely useful in tackling diverse problems. The purpose of this paper is:\r\n• To illustrate some pathologies that can occur when a complex box mapping is not induced by a globally defined map and when its domain has infinitely many components, and to give conditions to avoid these issues.\r\n• To show that once one has a box mapping for a rational map, these conditions can be assumed to hold in a very natural setting. Thus, we call such complex box mappings dynamically natural. Having such box mappings is the first step in tackling many problems in one-dimensional dynamics.\r\n• Many results in holomorphic dynamics rely on an interplay between combinatorial and analytic techniques. In this setting, some of these tools are:\r\n • the Enhanced Nest (a nest of puzzle pieces around critical points) from Kozlovski, Shen, van Strien (AnnMath 165:749–841, 2007), referred to below as KSS;\r\n • the Covering Lemma (which controls the moduli of pullbacks of annuli) from Kahn and Lyubich (Ann Math 169(2):561–593, 2009);\r\n • the QC-Criterion and the Spreading Principle from KSS.\r\nThe purpose of this paper is to make these tools more accessible so that they can be used as a ‘black box’, so one does not have to redo the proofs in new settings.\r\n• To give an intuitive, but also rather detailed, outline of the proof from KSS and Kozlovski and van Strien (Proc Lond Math Soc (3) 99:275–296, 2009) of the following results for non-renormalizable dynamically natural complex box mappings:\r\n • puzzle pieces shrink to points,\r\n • (under some assumptions) topologically conjugate non-renormalizable polynomials and box mappings are quasiconformally conjugate.\r\n• We prove the fundamental ergodic properties for dynamically natural box mappings. This leads to some necessary conditions for when such a box mapping supports a measurable invariant line field on its filled Julia set. These mappings\r\nare the analogues of Lattès maps in this setting.\r\n• We prove a version of Mañé’s Theorem for complex box mappings concerning expansion along orbits of points that avoid a neighborhood of the set of critical points." acknowledgement: We would also like to thank Dzmitry Dudko and Dierk Schleicher for many stimulating discussions and encouragement during our work on this project, and Weixiao Shen, Mikhail Hlushchanka and the referee for helpful comments. We are grateful to Leon Staresinic who carefully read the revised version of the manuscript and provided many helpful suggestions. article_processing_charge: No article_type: original author: - first_name: Trevor full_name: Clark, Trevor last_name: Clark - first_name: Kostiantyn full_name: Drach, Kostiantyn id: fe8209e2-906f-11eb-847d-950f8fc09115 last_name: Drach orcid: 0000-0002-9156-8616 - first_name: Oleg full_name: Kozlovski, Oleg last_name: Kozlovski - first_name: Sebastian Van full_name: Strien, Sebastian Van last_name: Strien citation: ama: Clark T, Drach K, Kozlovski O, Strien SV. The dynamics of complex box mappings. Arnold Mathematical Journal. 2022;8(2):319-410. doi:10.1007/s40598-022-00200-7 apa: Clark, T., Drach, K., Kozlovski, O., & Strien, S. V. (2022). The dynamics of complex box mappings. Arnold Mathematical Journal. Springer Nature. https://doi.org/10.1007/s40598-022-00200-7 chicago: Clark, Trevor, Kostiantyn Drach, Oleg Kozlovski, and Sebastian Van Strien. “The Dynamics of Complex Box Mappings.” Arnold Mathematical Journal. Springer Nature, 2022. https://doi.org/10.1007/s40598-022-00200-7. ieee: T. Clark, K. Drach, O. Kozlovski, and S. V. Strien, “The dynamics of complex box mappings,” Arnold Mathematical Journal, vol. 8, no. 2. Springer Nature, pp. 319–410, 2022. ista: Clark T, Drach K, Kozlovski O, Strien SV. 2022. The dynamics of complex box mappings. Arnold Mathematical Journal. 8(2), 319–410. mla: Clark, Trevor, et al. “The Dynamics of Complex Box Mappings.” Arnold Mathematical Journal, vol. 8, no. 2, Springer Nature, 2022, pp. 319–410, doi:10.1007/s40598-022-00200-7. short: T. Clark, K. Drach, O. Kozlovski, S.V. Strien, Arnold Mathematical Journal 8 (2022) 319–410. date_created: 2022-07-10T22:01:53Z date_published: 2022-06-01T00:00:00Z date_updated: 2023-02-16T10:02:12Z day: '01' ddc: - '500' department: - _id: VaKa doi: 10.1007/s40598-022-00200-7 ec_funded: 1 file: - access_level: open_access checksum: 16e7c659dee9073c6c8aeb87316ef201 content_type: application/pdf creator: kschuh date_created: 2022-07-12T10:04:55Z date_updated: 2022-07-12T10:04:55Z file_id: '11559' file_name: 2022_ArnoldMathematicalJournal_Clark.pdf file_size: 2509915 relation: main_file success: 1 file_date_updated: 2022-07-12T10:04:55Z has_accepted_license: '1' intvolume: ' 8' issue: '2' language: - iso: eng month: '06' oa: 1 oa_version: None page: 319-410 project: - _id: 9B8B92DE-BA93-11EA-9121-9846C619BF3A call_identifier: H2020 grant_number: '885707' name: Spectral rigidity and integrability for billiards and geodesic flows publication: Arnold Mathematical Journal publication_identifier: eissn: - 2199-6806 issn: - 2199-6792 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: link: - relation: erratum url: https://doi.org/10.1007/s40598-022-00209-y - relation: erratum url: https://doi.org/10.1007/s40598-022-00218-x scopus_import: '1' status: public title: The dynamics of complex box mappings 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8 year: '2022' ... --- _id: '11638' abstract: - lang: eng text: 'Statistical inference is central to many scientific endeavors, yet how it works remains unresolved. Answering this requires a quantitative understanding of the intrinsic interplay between statistical models, inference methods, and the structure in the data. To this end, we characterize the efficacy of direct coupling analysis (DCA)—a highly successful method for analyzing amino acid sequence data—in inferring pairwise interactions from samples of ferromagnetic Ising models on random graphs. Our approach allows for physically motivated exploration of qualitatively distinct data regimes separated by phase transitions. We show that inference quality depends strongly on the nature of data-generating distributions: optimal accuracy occurs at an intermediate temperature where the detrimental effects from macroscopic order and thermal noise are minimal. Importantly our results indicate that DCA does not always outperform its local-statistics-based predecessors; while DCA excels at low temperatures, it becomes inferior to simple correlation thresholding at virtually all temperatures when data are limited. Our findings offer insights into the regime in which DCA operates so successfully, and more broadly, how inference interacts with the structure in the data.' acknowledgement: This work was supported in part by the Alfred P. Sloan Foundation, the Simons Foundation, the National Institutes of Health under Award No. R01EB026943, and the National Science Foundation, through the Center for the Physics of Biological Function (PHY-1734030). article_number: '023240' article_processing_charge: No article_type: original author: - first_name: Vudtiwat full_name: Ngampruetikorn, Vudtiwat last_name: Ngampruetikorn - first_name: Vedant full_name: Sachdeva, Vedant last_name: Sachdeva - first_name: Johanna full_name: Torrence, Johanna last_name: Torrence - first_name: Jan full_name: Humplik, Jan id: 2E9627A8-F248-11E8-B48F-1D18A9856A87 last_name: Humplik - first_name: David J. full_name: Schwab, David J. last_name: Schwab - first_name: Stephanie E. full_name: Palmer, Stephanie E. last_name: Palmer citation: ama: Ngampruetikorn V, Sachdeva V, Torrence J, Humplik J, Schwab DJ, Palmer SE. Inferring couplings in networks across order-disorder phase transitions. Physical Review Research. 2022;4(2). doi:10.1103/PhysRevResearch.4.023240 apa: Ngampruetikorn, V., Sachdeva, V., Torrence, J., Humplik, J., Schwab, D. J., & Palmer, S. E. (2022). Inferring couplings in networks across order-disorder phase transitions. Physical Review Research. American Physical Society. https://doi.org/10.1103/PhysRevResearch.4.023240 chicago: Ngampruetikorn, Vudtiwat, Vedant Sachdeva, Johanna Torrence, Jan Humplik, David J. Schwab, and Stephanie E. Palmer. “Inferring Couplings in Networks across Order-Disorder Phase Transitions.” Physical Review Research. American Physical Society, 2022. https://doi.org/10.1103/PhysRevResearch.4.023240. ieee: V. Ngampruetikorn, V. Sachdeva, J. Torrence, J. Humplik, D. J. Schwab, and S. E. Palmer, “Inferring couplings in networks across order-disorder phase transitions,” Physical Review Research, vol. 4, no. 2. American Physical Society, 2022. ista: Ngampruetikorn V, Sachdeva V, Torrence J, Humplik J, Schwab DJ, Palmer SE. 2022. Inferring couplings in networks across order-disorder phase transitions. Physical Review Research. 4(2), 023240. mla: Ngampruetikorn, Vudtiwat, et al. “Inferring Couplings in Networks across Order-Disorder Phase Transitions.” Physical Review Research, vol. 4, no. 2, 023240, American Physical Society, 2022, doi:10.1103/PhysRevResearch.4.023240. short: V. Ngampruetikorn, V. Sachdeva, J. Torrence, J. Humplik, D.J. Schwab, S.E. Palmer, Physical Review Research 4 (2022). date_created: 2022-07-24T22:01:42Z date_published: 2022-06-24T00:00:00Z date_updated: 2022-07-25T07:52:35Z day: '24' ddc: - '530' department: - _id: GaTk doi: 10.1103/PhysRevResearch.4.023240 external_id: arxiv: - '2106.02349' file: - access_level: open_access checksum: ed6fdc2a3a096df785fa5f7b17b716c6 content_type: application/pdf creator: dernst date_created: 2022-07-25T07:47:23Z date_updated: 2022-07-25T07:47:23Z file_id: '11644' file_name: 2022_PhysicalReviewResearch_Ngampruetikorn.pdf file_size: 1379683 relation: main_file success: 1 file_date_updated: 2022-07-25T07:47:23Z funded_apc: '1' has_accepted_license: '1' intvolume: ' 4' issue: '2' language: - iso: eng month: '06' oa: 1 oa_version: Published Version publication: Physical Review Research publication_identifier: issn: - 2643-1564 publication_status: published publisher: American Physical Society quality_controlled: '1' scopus_import: '1' status: public title: Inferring couplings in networks across order-disorder phase transitions 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 4 year: '2022' ... --- _id: '11702' abstract: - lang: eng text: When Mendel’s work was rediscovered in 1900, and extended to establish classical genetics, it was initially seen in opposition to Darwin’s theory of evolution by natural selection on continuous variation, as represented by the biometric research program that was the foundation of quantitative genetics. As Fisher, Haldane, and Wright established a century ago, Mendelian inheritance is exactly what is needed for natural selection to work efficiently. Yet, the synthesis remains unfinished. We do not understand why sexual reproduction and a fair meiosis predominate in eukaryotes, or how far these are responsible for their diversity and complexity. Moreover, although quantitative geneticists have long known that adaptive variation is highly polygenic, and that this is essential for efficient selection, this is only now becoming appreciated by molecular biologists—and we still do not have a good framework for understanding polygenic variation or diffuse function. acknowledgement: I thank Laura Hayward, Jitka Polechova, and Anja Westram for discussions and comments. article_number: e2122147119 article_processing_charge: No article_type: original author: - first_name: Nicholas H full_name: Barton, Nicholas H id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 citation: ama: Barton NH. The “New Synthesis.” Proceedings of the National Academy of Sciences of the United States of America. 2022;119(30). doi:10.1073/pnas.2122147119 apa: Barton, N. H. (2022). The “New Synthesis.” Proceedings of the National Academy of Sciences of the United States of America. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.2122147119 chicago: Barton, Nicholas H. “The ‘New Synthesis.’” Proceedings of the National Academy of Sciences of the United States of America. Proceedings of the National Academy of Sciences, 2022. https://doi.org/10.1073/pnas.2122147119. ieee: N. H. Barton, “The ‘New Synthesis,’” Proceedings of the National Academy of Sciences of the United States of America, vol. 119, no. 30. Proceedings of the National Academy of Sciences, 2022. ista: Barton NH. 2022. The ‘New Synthesis’. Proceedings of the National Academy of Sciences of the United States of America. 119(30), e2122147119. mla: Barton, Nicholas H. “The ‘New Synthesis.’” Proceedings of the National Academy of Sciences of the United States of America, vol. 119, no. 30, e2122147119, Proceedings of the National Academy of Sciences, 2022, doi:10.1073/pnas.2122147119. short: N.H. Barton, Proceedings of the National Academy of Sciences of the United States of America 119 (2022). date_created: 2022-07-31T22:01:47Z date_published: 2022-07-18T00:00:00Z date_updated: 2022-08-01T11:00:25Z day: '18' ddc: - '570' department: - _id: NiBa doi: 10.1073/pnas.2122147119 external_id: pmid: - '35858408' file: - access_level: open_access checksum: 06c866196a8957f0c37b8a121771c885 content_type: application/pdf creator: dernst date_created: 2022-08-01T10:58:28Z date_updated: 2022-08-01T10:58:28Z file_id: '11716' file_name: 2022_PNAS_Barton.pdf file_size: 848511 relation: main_file success: 1 file_date_updated: 2022-08-01T10:58:28Z has_accepted_license: '1' intvolume: ' 119' issue: '30' language: - iso: eng month: '07' oa: 1 oa_version: Published Version pmid: 1 publication: Proceedings of the National Academy of Sciences of the United States of America publication_identifier: eissn: - 1091-6490 issn: - 0027-8424 publication_status: published publisher: Proceedings of the National Academy of Sciences quality_controlled: '1' scopus_import: '1' status: public title: The "New Synthesis" 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 119 year: '2022' ... --- _id: '11713' abstract: - lang: eng text: "Objective: MazF is a sequence-specific endoribonuclease-toxin of the MazEF toxin–antitoxin system. MazF cleaves single-stranded ribonucleic acid (RNA) regions at adenine–cytosine–adenine (ACA) sequences in the bacterium Escherichia coli. The MazEF system has been used in various biotechnology and synthetic biology applications. In this study, we infer how ectopic mazF overexpression affects production of heterologous proteins. To this end, we quantified the levels of fluorescent proteins expressed in E. coli from reporters translated from the ACA-containing or ACA-less messenger RNAs (mRNAs). Additionally, we addressed the impact of the 5′-untranslated region of these reporter mRNAs under the same conditions by comparing expression from mRNAs that comprise (canonical mRNA) or lack this region (leaderless mRNA).\r\nResults: Flow cytometry analysis indicates that during mazF overexpression, fluorescent proteins are translated from the canonical as well as leaderless mRNAs. Our analysis further indicates that longer mazF overexpression generally increases the concentration of fluorescent proteins translated from ACA-less mRNAs, however it also substantially increases bacterial population heterogeneity. Finally, our results suggest that the strength and duration of mazF overexpression should be optimized for each experimental setup, to maximize the heterologous protein production and minimize the amount of phenotypic heterogeneity in bacterial populations, which is unfavorable in biotechnological processes." acknowledgement: "We acknowledge the Max Perutz Labs FACS Facility together with Thomas Sauer. NN is grateful to Călin C. Guet for his support.\r\nThis work was funded by the Elise Richter grant V738 of the Austrian Science Fund (FWF), and the FWF Lise Meitner grant M1697, to NN; and by the FWF grant P22249, FWF Special Research Program RNA-REG F43 (subproject F4316), and FWF doctoral program RNA Biology (W1207), to IM. Open access funding provided by the Austrian Science Fund." article_number: '173' article_processing_charge: No article_type: letter_note author: - first_name: Nela full_name: Nikolic, Nela id: 42D9CABC-F248-11E8-B48F-1D18A9856A87 last_name: Nikolic orcid: 0000-0001-9068-6090 - first_name: Martina full_name: Sauert, Martina last_name: Sauert - first_name: Tanino G. full_name: Albanese, Tanino G. last_name: Albanese - first_name: Isabella full_name: Moll, Isabella last_name: Moll citation: ama: Nikolic N, Sauert M, Albanese TG, Moll I. Quantifying heterologous gene expression during ectopic MazF production in Escherichia coli. BMC Research Notes. 2022;15. doi:10.1186/s13104-022-06061-9 apa: Nikolic, N., Sauert, M., Albanese, T. G., & Moll, I. (2022). Quantifying heterologous gene expression during ectopic MazF production in Escherichia coli. BMC Research Notes. Springer Nature. https://doi.org/10.1186/s13104-022-06061-9 chicago: Nikolic, Nela, Martina Sauert, Tanino G. Albanese, and Isabella Moll. “Quantifying Heterologous Gene Expression during Ectopic MazF Production in Escherichia Coli.” BMC Research Notes. Springer Nature, 2022. https://doi.org/10.1186/s13104-022-06061-9. ieee: N. Nikolic, M. Sauert, T. G. Albanese, and I. Moll, “Quantifying heterologous gene expression during ectopic MazF production in Escherichia coli,” BMC Research Notes, vol. 15. Springer Nature, 2022. ista: Nikolic N, Sauert M, Albanese TG, Moll I. 2022. Quantifying heterologous gene expression during ectopic MazF production in Escherichia coli. BMC Research Notes. 15, 173. mla: Nikolic, Nela, et al. “Quantifying Heterologous Gene Expression during Ectopic MazF Production in Escherichia Coli.” BMC Research Notes, vol. 15, 173, Springer Nature, 2022, doi:10.1186/s13104-022-06061-9. short: N. Nikolic, M. Sauert, T.G. Albanese, I. Moll, BMC Research Notes 15 (2022). date_created: 2022-08-01T09:04:27Z date_published: 2022-05-13T00:00:00Z date_updated: 2022-08-01T09:27:40Z day: '13' ddc: - '570' department: - _id: CaGu doi: 10.1186/s13104-022-06061-9 external_id: pmid: - '35562780' file: - access_level: open_access checksum: 008156e5340e9789f0f6d82bde4d347a content_type: application/pdf creator: dernst date_created: 2022-08-01T09:24:42Z date_updated: 2022-08-01T09:24:42Z file_id: '11714' file_name: 2022_BMCResearchNotes_Nikolic.pdf file_size: 1545310 relation: main_file success: 1 file_date_updated: 2022-08-01T09:24:42Z has_accepted_license: '1' intvolume: ' 15' keyword: - General Biochemistry - Genetics and Molecular Biology - General Medicine language: - iso: eng month: '05' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 26956E74-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: V00738 name: Bacterial toxin-antitoxin systems as antiphage defense mechanisms publication: BMC Research Notes publication_identifier: issn: - 1756-0500 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: link: - relation: erratum url: https://doi.org/10.1186/s13104-022-06152-7 scopus_import: '1' status: public title: Quantifying heterologous gene expression during ectopic MazF production in Escherichia coli 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 15 year: '2022' ... --- _id: '11916' abstract: - lang: eng text: A domain is called Kac regular for a quadratic form on L2 if every functions vanishing almost everywhere outside the domain can be approximated in form norm by functions with compact support in the domain. It is shown that this notion is stable under domination of quadratic forms. As applications measure perturbations of quasi-regular Dirichlet forms, Cheeger energies on metric measure spaces and Schrödinger operators on manifolds are studied. Along the way a characterization of the Sobolev space with Dirichlet boundary conditions on domains in infinitesimally Riemannian metric measure spaces is obtained. acknowledgement: "The author was supported by the German Academic Scholarship Foundation (Studienstiftung des deutschen Volkes) and by the German Research Foundation (DFG) via RTG 1523/2. The author would like to thank Daniel Lenz for his support and encouragement during the author’s ongoing graduate studies and him as well as Marcel Schmidt for fruitful discussions on domination of quadratic forms. He wants to thank Batu Güneysu and Peter Stollmann for valuable comments on a preliminary version of this article. He would also like to thank the organizers of the conference Analysis and Geometry on Graphs and Manifolds in Potsdam, where the initial motivation of this article was conceived, and the organizers of the intense activity period Metric Measure Spaces and Ricci Curvature at MPIM in Bonn, where this work was finished.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria)." article_number: '38' 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. Kac regularity and domination of quadratic forms. Advances in Operator Theory. 2022;7(3). doi:10.1007/s43036-022-00199-w apa: Wirth, M. (2022). Kac regularity and domination of quadratic forms. Advances in Operator Theory. Springer Nature. https://doi.org/10.1007/s43036-022-00199-w chicago: Wirth, Melchior. “Kac Regularity and Domination of Quadratic Forms.” Advances in Operator Theory. Springer Nature, 2022. https://doi.org/10.1007/s43036-022-00199-w. ieee: M. Wirth, “Kac regularity and domination of quadratic forms,” Advances in Operator Theory, vol. 7, no. 3. Springer Nature, 2022. ista: Wirth M. 2022. Kac regularity and domination of quadratic forms. Advances in Operator Theory. 7(3), 38. mla: Wirth, Melchior. “Kac Regularity and Domination of Quadratic Forms.” Advances in Operator Theory, vol. 7, no. 3, 38, Springer Nature, 2022, doi:10.1007/s43036-022-00199-w. short: M. Wirth, Advances in Operator Theory 7 (2022). date_created: 2022-08-18T07:22:24Z date_published: 2022-07-01T00:00:00Z date_updated: 2023-02-21T10:08:07Z day: '01' ddc: - '510' department: - _id: JaMa doi: 10.1007/s43036-022-00199-w file: - access_level: open_access checksum: 913474844a1b38264fb710746d5e2e98 content_type: application/pdf creator: dernst date_created: 2022-08-18T08:02:34Z date_updated: 2022-08-18T08:02:34Z file_id: '11921' file_name: 2022_AdvancesOperatorTheory_Wirth.pdf file_size: 389060 relation: main_file success: 1 file_date_updated: 2022-08-18T08:02:34Z has_accepted_license: '1' intvolume: ' 7' issue: '3' keyword: - Algebra and Number Theory - Analysis language: - iso: eng month: '07' oa: 1 oa_version: Published Version publication: Advances in Operator Theory publication_identifier: eissn: - 2538-225X publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Kac regularity and domination of quadratic forms 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7 year: '2022' ... --- _id: '11991' abstract: - lang: eng text: The study of the complexity of the constraint satisfaction problem (CSP), centred around the Feder-Vardi Dichotomy Conjecture, has been very prominent in the last two decades. After a long concerted effort and many partial results, the Dichotomy Conjecture has been proved in 2017 independently by Bulatov and Zhuk. At about the same time, a vast generalisation of CSP, called promise CSP, has started to gain prominence. In this survey, we explain the importance of promise CSP and highlight many new very interesting features that the study of promise CSP has brought to light. The complexity classification quest for the promise CSP is wide open, and we argue that, despite the promise CSP being more general, this quest is rather more accessible to a wide range of researchers than the dichotomy-led study of the CSP has been. article_processing_charge: No article_type: original author: - first_name: Andrei full_name: Krokhin, Andrei last_name: Krokhin - first_name: Jakub full_name: Opršal, Jakub id: ec596741-c539-11ec-b829-c79322a91242 last_name: Opršal orcid: 0000-0003-1245-3456 citation: ama: Krokhin A, Opršal J. An invitation to the promise constraint satisfaction problem. ACM SIGLOG News. 2022;9(3):30-59. doi:10.1145/3559736.3559740 apa: Krokhin, A., & Opršal, J. (2022). An invitation to the promise constraint satisfaction problem. ACM SIGLOG News. Association for Computing Machinery. https://doi.org/10.1145/3559736.3559740 chicago: Krokhin, Andrei, and Jakub Opršal. “An Invitation to the Promise Constraint Satisfaction Problem.” ACM SIGLOG News. Association for Computing Machinery, 2022. https://doi.org/10.1145/3559736.3559740. ieee: A. Krokhin and J. Opršal, “An invitation to the promise constraint satisfaction problem,” ACM SIGLOG News, vol. 9, no. 3. Association for Computing Machinery, pp. 30–59, 2022. ista: Krokhin A, Opršal J. 2022. An invitation to the promise constraint satisfaction problem. ACM SIGLOG News. 9(3), 30–59. mla: Krokhin, Andrei, and Jakub Opršal. “An Invitation to the Promise Constraint Satisfaction Problem.” ACM SIGLOG News, vol. 9, no. 3, Association for Computing Machinery, 2022, pp. 30–59, doi:10.1145/3559736.3559740. short: A. Krokhin, J. Opršal, ACM SIGLOG News 9 (2022) 30–59. date_created: 2022-08-27T11:23:37Z date_published: 2022-07-01T00:00:00Z date_updated: 2022-09-05T08:19:38Z day: '01' department: - _id: UlWa doi: 10.1145/3559736.3559740 external_id: arxiv: - '2208.13538' intvolume: ' 9' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/2208.13538 month: '07' oa: 1 oa_version: Preprint page: 30-59 publication: ACM SIGLOG News publication_identifier: issn: - 2372-3491 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' status: public title: An invitation to the promise constraint satisfaction problem type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 9 year: '2022' ... --- _id: '12010' abstract: - lang: eng text: World models learn behaviors in a latent imagination space to enhance the sample-efficiency of deep reinforcement learning (RL) algorithms. While learning world models for high-dimensional observations (e.g., pixel inputs) has become practicable on standard RL benchmarks and some games, their effectiveness in real-world robotics applications has not been explored. In this paper, we investigate how such agents generalize to real-world autonomous vehicle control tasks, where advanced model-free deep RL algorithms fail. In particular, we set up a series of time-lap tasks for an F1TENTH racing robot, equipped with a high-dimensional LiDAR sensor, on a set of test tracks with a gradual increase in their complexity. In this continuous-control setting, we show that model-based agents capable of learning in imagination substantially outperform model-free agents with respect to performance, sample efficiency, successful task completion, and generalization. Moreover, we show that the generalization ability of model-based agents strongly depends on the choice of their observation model. We provide extensive empirical evidence for the effectiveness of world models provided with long enough memory horizons in sim2real tasks. acknowledgement: L.B. was supported by the Doctoral College Resilient Embedded Systems. M.L. was supported in part by the ERC2020-AdG 101020093 and the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). R.H. and D.R. were supported by The Boeing Company and the Office of Naval Research (ONR) Grant N00014-18-1-2830. R.G. was partially supported by the Horizon-2020 ECSEL Project grant No. 783163 (iDev40) and A.B. by FFG Project ADEX. article_processing_charge: No author: - first_name: Axel full_name: Brunnbauer, Axel last_name: Brunnbauer - first_name: Luigi full_name: Berducci, Luigi last_name: Berducci - first_name: Andreas full_name: Brandstatter, Andreas last_name: Brandstatter - first_name: Mathias full_name: Lechner, Mathias id: 3DC22916-F248-11E8-B48F-1D18A9856A87 last_name: Lechner - first_name: Ramin full_name: Hasani, Ramin last_name: Hasani - first_name: Daniela full_name: Rus, Daniela last_name: Rus - first_name: Radu full_name: Grosu, Radu last_name: Grosu citation: ama: 'Brunnbauer A, Berducci L, Brandstatter A, et al. Latent imagination facilitates zero-shot transfer in autonomous racing. In: 2022 International Conference on Robotics and Automation. IEEE; 2022:7513-7520. doi:10.1109/ICRA46639.2022.9811650' apa: 'Brunnbauer, A., Berducci, L., Brandstatter, A., Lechner, M., Hasani, R., Rus, D., & Grosu, R. (2022). Latent imagination facilitates zero-shot transfer in autonomous racing. In 2022 International Conference on Robotics and Automation (pp. 7513–7520). Philadelphia, PA, United States: IEEE. https://doi.org/10.1109/ICRA46639.2022.9811650' chicago: Brunnbauer, Axel, Luigi Berducci, Andreas Brandstatter, Mathias Lechner, Ramin Hasani, Daniela Rus, and Radu Grosu. “Latent Imagination Facilitates Zero-Shot Transfer in Autonomous Racing.” In 2022 International Conference on Robotics and Automation, 7513–20. IEEE, 2022. https://doi.org/10.1109/ICRA46639.2022.9811650. ieee: A. Brunnbauer et al., “Latent imagination facilitates zero-shot transfer in autonomous racing,” in 2022 International Conference on Robotics and Automation, Philadelphia, PA, United States, 2022, pp. 7513–7520. ista: 'Brunnbauer A, Berducci L, Brandstatter A, Lechner M, Hasani R, Rus D, Grosu R. 2022. Latent imagination facilitates zero-shot transfer in autonomous racing. 2022 International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, 7513–7520.' mla: Brunnbauer, Axel, et al. “Latent Imagination Facilitates Zero-Shot Transfer in Autonomous Racing.” 2022 International Conference on Robotics and Automation, IEEE, 2022, pp. 7513–20, doi:10.1109/ICRA46639.2022.9811650. short: A. Brunnbauer, L. Berducci, A. Brandstatter, M. Lechner, R. Hasani, D. Rus, R. Grosu, in:, 2022 International Conference on Robotics and Automation, IEEE, 2022, pp. 7513–7520. conference: end_date: 2022-05-27 location: Philadelphia, PA, United States name: 'ICRA: International Conference on Robotics and Automation' start_date: 2022-05-23 date_created: 2022-09-04T22:02:02Z date_published: 2022-07-12T00:00:00Z date_updated: 2022-09-05T08:46:12Z day: '12' department: - _id: ToHe doi: 10.1109/ICRA46639.2022.9811650 ec_funded: 1 external_id: arxiv: - '2103.04909' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2103.04909 month: '07' oa: 1 oa_version: Preprint page: 7513-7520 project: - _id: 62781420-2b32-11ec-9570-8d9b63373d4d call_identifier: H2020 grant_number: '101020093' name: Vigilant Algorithmic Monitoring of Software - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication: 2022 International Conference on Robotics and Automation publication_identifier: isbn: - '9781728196817' issn: - 1050-4729 publication_status: published publisher: IEEE quality_controlled: '1' scopus_import: '1' status: public title: Latent imagination facilitates zero-shot transfer in autonomous racing type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '12011' abstract: - lang: eng text: We characterize the capacity for the discrete-time arbitrarily varying channel with discrete inputs, outputs, and states when (a) the encoder and decoder do not share common randomness, (b) the input and state are subject to cost constraints, (c) the transition matrix of the channel is deterministic given the state, and (d) at each time step the adversary can only observe the current and past channel inputs when choosing the state at that time. The achievable strategy involves stochastic encoding together with list decoding and a disambiguation step. The converse uses a two-phase "babble-and-push" strategy where the adversary chooses the state randomly in the first phase, list decodes the output, and then chooses state inputs to symmetrize the channel in the second phase. These results generalize prior work on specific channels models (additive, erasure) to general discrete alphabets and models. acknowledgement: The work of ADS and ML was supported in part by the US National Science Foundation under awards CCF-1909468 and CCF-1909451. article_processing_charge: No author: - first_name: Yihan full_name: Zhang, Yihan id: 2ce5da42-b2ea-11eb-bba5-9f264e9d002c last_name: Zhang - first_name: Sidharth full_name: Jaggi, Sidharth last_name: Jaggi - first_name: Michael full_name: Langberg, Michael last_name: Langberg - first_name: Anand D. full_name: Sarwate, Anand D. last_name: Sarwate citation: ama: 'Zhang Y, Jaggi S, Langberg M, Sarwate AD. The capacity of causal adversarial channels. In: 2022 IEEE International Symposium on Information Theory. Vol 2022. IEEE; 2022:2523-2528. doi:10.1109/ISIT50566.2022.9834709' apa: 'Zhang, Y., Jaggi, S., Langberg, M., & Sarwate, A. D. (2022). The capacity of causal adversarial channels. In 2022 IEEE International Symposium on Information Theory (Vol. 2022, pp. 2523–2528). Espoo, Finland: IEEE. https://doi.org/10.1109/ISIT50566.2022.9834709' chicago: Zhang, Yihan, Sidharth Jaggi, Michael Langberg, and Anand D. Sarwate. “The Capacity of Causal Adversarial Channels.” In 2022 IEEE International Symposium on Information Theory, 2022:2523–28. IEEE, 2022. https://doi.org/10.1109/ISIT50566.2022.9834709. ieee: Y. Zhang, S. Jaggi, M. Langberg, and A. D. Sarwate, “The capacity of causal adversarial channels,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 2523–2528. ista: 'Zhang Y, Jaggi S, Langberg M, Sarwate AD. 2022. The capacity of causal adversarial channels. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 2523–2528.' mla: Zhang, Yihan, et al. “The Capacity of Causal Adversarial Channels.” 2022 IEEE International Symposium on Information Theory, vol. 2022, IEEE, 2022, pp. 2523–28, doi:10.1109/ISIT50566.2022.9834709. short: Y. Zhang, S. Jaggi, M. Langberg, A.D. Sarwate, in:, 2022 IEEE International Symposium on Information Theory, IEEE, 2022, pp. 2523–2528. conference: end_date: 2022-07-01 location: Espoo, Finland name: 'ISIT: Internation Symposium on Information Theory' start_date: 2022-06-26 date_created: 2022-09-04T22:02:03Z date_published: 2022-08-03T00:00:00Z date_updated: 2022-09-05T09:09:15Z day: '03' department: - _id: MaMo doi: 10.1109/ISIT50566.2022.9834709 external_id: arxiv: - '2205.06708' intvolume: ' 2022' language: - iso: eng main_file_link: - open_access: '1' url: ' https://doi.org/10.48550/arXiv.2205.06708' month: '08' oa: 1 oa_version: Preprint page: 2523-2528 publication: 2022 IEEE International Symposium on Information Theory publication_identifier: isbn: - '9781665421591' issn: - 2157-8095 publication_status: published publisher: IEEE quality_controlled: '1' scopus_import: '1' status: public title: The capacity of causal adversarial channels type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2022 year: '2022' ... --- _id: '12016' abstract: - lang: eng text: We consider the problem of coded distributed computing using polar codes. The average execution time of a coded computing system is related to the error probability for transmission over the binary erasure channel in recent work by Soleymani, Jamali and Mahdavifar, where the performance of binary linear codes is investigated. In this paper, we focus on polar codes and unveil a connection between the average execution time and the scaling exponent μ of the family of codes. In the finite-length characterization of polar codes, the scaling exponent is a key object capturing the speed of convergence to capacity. In particular, we show that (i) the gap between the normalized average execution time of polar codes and that of optimal MDS codes is O(n –1/μ ), and (ii) this upper bound can be improved to roughly O(n –1/2 ) by considering polar codes with large kernels. We conjecture that these bounds could be improved to O(n –2/μ ) and O(n –1 ), respectively, and provide a heuristic argument as well as numerical evidence supporting this view. acknowledgement: D. Fathollahi and M. Mondelli were partially supported by the 2019 Lopez-Loreta Prize. The authors thank Hamed Hassani and Hessam Mahdavifar for helpful discussions. article_processing_charge: No author: - first_name: Dorsa full_name: Fathollahi, Dorsa last_name: Fathollahi - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 citation: ama: 'Fathollahi D, Mondelli M. Polar coded computing: The role of the scaling exponent. In: 2022 IEEE International Symposium on Information Theory. Vol 2022. IEEE; 2022:2154-2159. doi:10.1109/ISIT50566.2022.9834712' apa: 'Fathollahi, D., & Mondelli, M. (2022). Polar coded computing: The role of the scaling exponent. In 2022 IEEE International Symposium on Information Theory (Vol. 2022, pp. 2154–2159). Espoo, Finland: IEEE. https://doi.org/10.1109/ISIT50566.2022.9834712' chicago: 'Fathollahi, Dorsa, and Marco Mondelli. “Polar Coded Computing: The Role of the Scaling Exponent.” In 2022 IEEE International Symposium on Information Theory, 2022:2154–59. IEEE, 2022. https://doi.org/10.1109/ISIT50566.2022.9834712.' ieee: 'D. Fathollahi and M. Mondelli, “Polar coded computing: The role of the scaling exponent,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 2154–2159.' ista: 'Fathollahi D, Mondelli M. 2022. Polar coded computing: The role of the scaling exponent. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 2154–2159.' mla: 'Fathollahi, Dorsa, and Marco Mondelli. “Polar Coded Computing: The Role of the Scaling Exponent.” 2022 IEEE International Symposium on Information Theory, vol. 2022, IEEE, 2022, pp. 2154–59, doi:10.1109/ISIT50566.2022.9834712.' short: D. Fathollahi, M. Mondelli, in:, 2022 IEEE International Symposium on Information Theory, IEEE, 2022, pp. 2154–2159. conference: end_date: 2022-07-01 location: Espoo, Finland name: 'ISIT: Internation Symposium on Information Theory' start_date: 2022-06-26 date_created: 2022-09-04T22:02:05Z date_published: 2022-08-03T00:00:00Z date_updated: 2022-09-05T10:35:40Z day: '03' department: - _id: MaMo doi: 10.1109/ISIT50566.2022.9834712 external_id: arxiv: - '2201.10082' intvolume: ' 2022' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2201.10082 month: '08' oa: 1 oa_version: Preprint page: 2154-2159 project: - _id: 059876FA-7A3F-11EA-A408-12923DDC885E name: Prix Lopez-Loretta 2019 - Marco Mondelli publication: 2022 IEEE International Symposium on Information Theory publication_identifier: isbn: - '9781665421591' issn: - 2157-8095 publication_status: published publisher: IEEE quality_controlled: '1' scopus_import: '1' status: public title: 'Polar coded computing: The role of the scaling exponent' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2022 year: '2022' ... --- _id: '12012' abstract: - lang: eng text: This paper is eligible for the Jack Keil Wolf ISIT Student Paper Award. We generalize a previous framework for designing utility-optimal differentially private (DP) mechanisms via graphs, where datasets are vertices in the graph and edges represent dataset neighborhood. The boundary set contains datasets where an individual’s response changes the binary-valued query compared to its neighbors. Previous work was limited to the homogeneous case where the privacy parameter ε across all datasets was the same and the mechanism at boundary datasets was identical. In our work, the mechanism can take different distributions at the boundary and the privacy parameter ε is a function of neighboring datasets, which recovers an earlier definition of personalized DP as special case. The problem is how to extend the mechanism, which is only defined at the boundary set, to other datasets in the graph in a computationally efficient and utility optimal manner. Using the concept of strongest induced DP condition we solve this problem efficiently in polynomial time (in the size of the graph). article_processing_charge: No author: - first_name: Sahel full_name: Torkamani, Sahel id: 0503e7f8-2d05-11ed-aa17-db0640c720fc last_name: Torkamani - first_name: Javad B. full_name: Ebrahimi, Javad B. last_name: Ebrahimi - first_name: Parastoo full_name: Sadeghi, Parastoo last_name: Sadeghi - first_name: Rafael G.L. full_name: D'Oliveira, Rafael G.L. last_name: D'Oliveira - first_name: Muriel full_name: Médard, Muriel last_name: Médard citation: ama: 'Torkamani S, Ebrahimi JB, Sadeghi P, D’Oliveira RGL, Médard M. Heterogeneous differential privacy via graphs. In: 2022 IEEE International Symposium on Information Theory. Vol 2022. IEEE; 2022:1623-1628. doi:10.1109/ISIT50566.2022.9834711' apa: 'Torkamani, S., Ebrahimi, J. B., Sadeghi, P., D’Oliveira, R. G. L., & Médard, M. (2022). Heterogeneous differential privacy via graphs. In 2022 IEEE International Symposium on Information Theory (Vol. 2022, pp. 1623–1628). Espoo, Finland: IEEE. https://doi.org/10.1109/ISIT50566.2022.9834711' chicago: Torkamani, Sahel, Javad B. Ebrahimi, Parastoo Sadeghi, Rafael G.L. D’Oliveira, and Muriel Médard. “Heterogeneous Differential Privacy via Graphs.” In 2022 IEEE International Symposium on Information Theory, 2022:1623–28. IEEE, 2022. https://doi.org/10.1109/ISIT50566.2022.9834711. ieee: S. Torkamani, J. B. Ebrahimi, P. Sadeghi, R. G. L. D’Oliveira, and M. Médard, “Heterogeneous differential privacy via graphs,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 1623–1628. ista: 'Torkamani S, Ebrahimi JB, Sadeghi P, D’Oliveira RGL, Médard M. 2022. Heterogeneous differential privacy via graphs. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 1623–1628.' mla: Torkamani, Sahel, et al. “Heterogeneous Differential Privacy via Graphs.” 2022 IEEE International Symposium on Information Theory, vol. 2022, IEEE, 2022, pp. 1623–28, doi:10.1109/ISIT50566.2022.9834711. short: S. Torkamani, J.B. Ebrahimi, P. Sadeghi, R.G.L. D’Oliveira, M. Médard, in:, 2022 IEEE International Symposium on Information Theory, IEEE, 2022, pp. 1623–1628. conference: end_date: 2022-07-01 location: Espoo, Finland name: 'ISIT: Internation Symposium on Information Theory' start_date: 2022-06-26 date_created: 2022-09-04T22:02:04Z date_published: 2022-08-03T00:00:00Z date_updated: 2022-09-05T10:28:35Z day: '03' department: - _id: MaMo doi: 10.1109/ISIT50566.2022.9834711 external_id: arxiv: - '2203.15429' intvolume: ' 2022' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2203.15429 month: '08' oa: 1 oa_version: Preprint page: 1623-1628 publication: 2022 IEEE International Symposium on Information Theory publication_identifier: isbn: - '9781665421591' issn: - 2157-8095 publication_status: published publisher: IEEE quality_controlled: '1' scopus_import: '1' status: public title: Heterogeneous differential privacy via graphs type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2022 year: '2022' ... --- _id: '12072' abstract: - lang: eng text: "In this thesis, we study two of the most important questions in Arithmetic geometry: that of the existence and density of solutions to Diophantine equations. In order for a Diophantine equation to have any solutions over the rational numbers, it must have solutions everywhere locally, i.e., over R and over Qp for every prime p. The converse, called the Hasse principle, is known to fail in general. However, it is still a central question in Arithmetic geometry to determine for which varieties the Hasse principle does hold. In this work, we establish the Hasse principle for a wide new family of varieties of the form f(t) = NK/Q(x) ̸= 0, where f is a polynomial with integer coefficients and NK/Q denotes the norm\r\nform associated to a number field K. Our results cover products of arbitrarily many linear, quadratic or cubic factors, and generalise an argument of Irving [69], which makes use of the beta sieve of Rosser and Iwaniec. We also demonstrate how our main sieve results can be applied to treat new cases of a conjecture of Harpaz and Wittenberg on locally split values of polynomials over number fields, and discuss consequences for rational points in fibrations.\r\nIn the second question, about the density of solutions, one defines a height function and seeks to estimate asymptotically the number of points of height bounded by B as B → ∞. Traditionally, one either counts rational points, or\r\nintegral points with respect to a suitable model. However, in this thesis, we study an emerging area of interest in Arithmetic geometry known as Campana points, which in some sense interpolate between rational and integral points.\r\nMore precisely, we count the number of nonzero integers z1, z2, z3 such that gcd(z1, z2, z3) = 1, and z1, z2, z3, z1 + z2 + z3 are all squareful and bounded by B. Using the circle method, we obtain an asymptotic formula which agrees in\r\nthe power of B and log B with a bold new generalisation of Manin’s conjecture to the setting of Campana points, recently formulated by Pieropan, Smeets, Tanimoto and Várilly-Alvarado [96]. However, in this thesis we also provide the first known counterexamples to leading constant predicted by their conjecture. " acknowledgement: I acknowledge the received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska Curie Grant Agreement No. 665385. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Alec L full_name: Shute, Alec L id: 440EB050-F248-11E8-B48F-1D18A9856A87 last_name: Shute orcid: 0000-0002-1812-2810 citation: ama: 'Shute AL. Existence and density problems in Diophantine geometry: From norm forms to Campana points. 2022. doi:10.15479/at:ista:12072' apa: 'Shute, A. L. (2022). Existence and density problems in Diophantine geometry: From norm forms to Campana points. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12072' chicago: 'Shute, Alec L. “Existence and Density Problems in Diophantine Geometry: From Norm Forms to Campana Points.” Institute of Science and Technology Austria, 2022. https://doi.org/10.15479/at:ista:12072.' ieee: 'A. L. Shute, “Existence and density problems in Diophantine geometry: From norm forms to Campana points,” Institute of Science and Technology Austria, 2022.' ista: 'Shute AL. 2022. Existence and density problems in Diophantine geometry: From norm forms to Campana points. Institute of Science and Technology Austria.' mla: 'Shute, Alec L. Existence and Density Problems in Diophantine Geometry: From Norm Forms to Campana Points. Institute of Science and Technology Austria, 2022, doi:10.15479/at:ista:12072.' short: 'A.L. Shute, Existence and Density Problems in Diophantine Geometry: From Norm Forms to Campana Points, Institute of Science and Technology Austria, 2022.' date_created: 2022-09-08T21:53:03Z date_published: 2022-09-08T00:00:00Z date_updated: 2023-02-21T16:37:35Z day: '08' ddc: - '512' degree_awarded: PhD department: - _id: GradSch - _id: TiBr doi: 10.15479/at:ista:12072 ec_funded: 1 file: - access_level: open_access checksum: bf073344320e05d92c224786cec2e92d content_type: application/pdf creator: ashute date_created: 2022-09-08T21:50:34Z date_updated: 2022-09-08T21:50:34Z file_id: '12073' file_name: Thesis_final_draft.pdf file_size: 1907386 relation: main_file success: 1 - access_level: closed checksum: b054ac6baa09f70e8235403a4abbed80 content_type: application/octet-stream creator: ashute date_created: 2022-09-08T21:50:42Z date_updated: 2022-09-12T11:24:21Z file_id: '12074' file_name: athesis.tex file_size: 495393 relation: source_file - access_level: closed checksum: 0a31e905f1cff5eb8110978cc90e1e79 content_type: application/x-zip-compressed creator: ashute date_created: 2022-09-09T12:05:00Z date_updated: 2022-09-12T11:24:21Z file_id: '12078' file_name: qfcjsfmtvtbfrjjvhdzrnqxfvgjvxtbf.zip file_size: 944534 relation: source_file file_date_updated: 2022-09-12T11:24:21Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '208' project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication_identifier: isbn: - 978-3-99078-023-7 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '12076' relation: part_of_dissertation status: public - id: '12077' relation: part_of_dissertation status: public status: public supervisor: - first_name: Timothy D full_name: Browning, Timothy D id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 title: 'Existence and density problems in Diophantine geometry: From norm forms to Campana points' tmp: image: /images/cc_by_nc_sa.png legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) short: CC BY-NC-SA (4.0) type: dissertation user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '12102' abstract: - lang: eng text: 'Given a Markov chain M = (V, v_0, δ), with state space V and a starting state v_0, and a probability threshold ε, an ε-core is a subset C of states that is left with probability at most ε. More formally, C ⊆ V is an ε-core, iff ℙ[reach (V\C)] ≤ ε. Cores have been applied in a wide variety of verification problems over Markov chains, Markov decision processes, and probabilistic programs, as a means of discarding uninteresting and low-probability parts of a probabilistic system and instead being able to focus on the states that are likely to be encountered in a real-world run. In this work, we focus on the problem of computing a minimal ε-core in a Markov chain. Our contributions include both negative and positive results: (i) We show that the decision problem on the existence of an ε-core of a given size is NP-complete. This solves an open problem posed in [Jan Kretínský and Tobias Meggendorfer, 2020]. We additionally show that the problem remains NP-complete even when limited to acyclic Markov chains with bounded maximal vertex degree; (ii) We provide a polynomial time algorithm for computing a minimal ε-core on Markov chains over control-flow graphs of structured programs. A straightforward combination of our algorithm with standard branch prediction techniques allows one to apply the idea of cores to find a subset of program lines that are left with low probability and then focus any desired static analysis on this core subset.' acknowledgement: "The research was partially supported by the Hong Kong Research Grants Council ECS\r\nProject No. 26208122, ERC CoG 863818 (FoRM-SMArt), the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385, HKUST– Kaisa Joint Research Institute Project Grant HKJRI3A-055 and HKUST Startup Grant R9272. Ali Ahmadi and Roodabeh Safavi were interns at HKUST." article_number: '29' article_processing_charge: No author: - first_name: Ali full_name: Ahmadi, Ali last_name: Ahmadi - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Amir Kafshdar full_name: Goharshady, Amir Kafshdar id: 391365CE-F248-11E8-B48F-1D18A9856A87 last_name: Goharshady orcid: 0000-0003-1702-6584 - first_name: Tobias full_name: Meggendorfer, Tobias id: b21b0c15-30a2-11eb-80dc-f13ca25802e1 last_name: Meggendorfer orcid: 0000-0002-1712-2165 - first_name: Roodabeh full_name: Safavi Hemami, Roodabeh id: 72ed2640-8972-11ed-ae7b-f9c81ec75154 last_name: Safavi Hemami - first_name: Dorde full_name: Zikelic, Dorde id: 294AA7A6-F248-11E8-B48F-1D18A9856A87 last_name: Zikelic citation: ama: 'Ahmadi A, Chatterjee K, Goharshady AK, Meggendorfer T, Safavi Hemami R, Zikelic D. Algorithms and hardness results for computing cores of Markov chains. In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.FSTTCS.2022.29' apa: 'Ahmadi, A., Chatterjee, K., Goharshady, A. K., Meggendorfer, T., Safavi Hemami, R., & Zikelic, D. (2022). Algorithms and hardness results for computing cores of Markov chains. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29' chicago: Ahmadi, Ali, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Roodabeh Safavi Hemami, and Dorde Zikelic. “Algorithms and Hardness Results for Computing Cores of Markov Chains.” In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29. ieee: A. Ahmadi, K. Chatterjee, A. K. Goharshady, T. Meggendorfer, R. Safavi Hemami, and D. Zikelic, “Algorithms and hardness results for computing cores of Markov chains,” in 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Madras, India, 2022, vol. 250. ista: 'Ahmadi A, Chatterjee K, Goharshady AK, Meggendorfer T, Safavi Hemami R, Zikelic D. 2022. Algorithms and hardness results for computing cores of Markov chains. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTC: Foundations of Software Technology and Theoretical Computer Science vol. 250, 29.' mla: Ahmadi, Ali, et al. “Algorithms and Hardness Results for Computing Cores of Markov Chains.” 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 250, 29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.FSTTCS.2022.29. short: A. Ahmadi, K. Chatterjee, A.K. Goharshady, T. Meggendorfer, R. Safavi Hemami, D. Zikelic, in:, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. conference: end_date: 2022-12-20 location: Madras, India name: 'FSTTC: Foundations of Software Technology and Theoretical Computer Science' start_date: 2022-12-18 date_created: 2023-01-01T23:00:50Z date_published: 2022-12-14T00:00:00Z date_updated: 2023-02-07T09:19:43Z day: '14' ddc: - '000' department: - _id: KrCh - _id: GradSch doi: 10.4230/LIPIcs.FSTTCS.2022.29 ec_funded: 1 file: - access_level: open_access checksum: 6660c802489013f034c9e8bd57f4d46e content_type: application/pdf creator: dernst date_created: 2023-01-20T10:39:44Z date_updated: 2023-01-20T10:39:44Z file_id: '12324' file_name: 2022_LIPICs_Ahmadi.pdf file_size: 872534 relation: main_file success: 1 file_date_updated: 2023-01-20T10:39:44Z has_accepted_license: '1' intvolume: ' 250' language: - iso: eng month: '12' oa: 1 oa_version: Published Version project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science publication_identifier: isbn: - '9783959772617' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Algorithms and hardness results for computing cores of Markov chains 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: 250 year: '2022' ... --- _id: '12101' abstract: - lang: eng text: 'Spatial games form a widely-studied class of games from biology and physics modeling the evolution of social behavior. Formally, such a game is defined by a square (d by d) payoff matrix M and an undirected graph G. Each vertex of G represents an individual, that initially follows some strategy i ∈ {1,2,…,d}. In each round of the game, every individual plays the matrix game with each of its neighbors: An individual following strategy i meeting a neighbor following strategy j receives a payoff equal to the entry (i,j) of M. Then, each individual updates its strategy to its neighbors'' strategy with the highest sum of payoffs, and the next round starts. The basic computational problems consist of reachability between configurations and the average frequency of a strategy. For general spatial games and graphs, these problems are in PSPACE. In this paper, we examine restricted setting: the game is a prisoner’s dilemma; and G is a subgraph of grid. We prove that basic computational problems for spatial games with prisoner’s dilemma on a subgraph of a grid are PSPACE-hard.' acknowledgement: "Krishnendu Chatterjee: The research was partially supported by the ERC CoG 863818\r\n(ForM-SMArt).\r\nIsmaël Jecker: The research was partially supported by the ERC grant 950398 (INFSYS).\r\nJakub Svoboda: The research was partially supported by the ERC CoG 863818 (ForM-SMArt)" article_number: 11:1-11:14 article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Rasmus full_name: Ibsen-Jensen, Rasmus id: 3B699956-F248-11E8-B48F-1D18A9856A87 last_name: Ibsen-Jensen orcid: 0000-0003-4783-0389 - first_name: Ismael R full_name: Jecker, Ismael R id: 85D7C63E-7D5D-11E9-9C0F-98C4E5697425 last_name: Jecker - first_name: Jakub full_name: Svoboda, Jakub id: 130759D2-D7DD-11E9-87D2-DE0DE6697425 last_name: Svoboda citation: ama: 'Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. Complexity of spatial games. In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.FSTTCS.2022.11' apa: 'Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., & Svoboda, J. (2022). Complexity of spatial games. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11' chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub Svoboda. “Complexity of Spatial Games.” In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11. ieee: K. Chatterjee, R. Ibsen-Jensen, I. R. Jecker, and J. Svoboda, “Complexity of spatial games,” in 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Madras, India, 2022, vol. 250. ista: 'Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. 2022. Complexity of spatial games. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTC: Foundations of Software Technology and Theoretical Computer Science vol. 250, 11:1-11:14.' mla: Chatterjee, Krishnendu, et al. “Complexity of Spatial Games.” 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 250, 11:1-11:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.FSTTCS.2022.11. short: K. Chatterjee, R. Ibsen-Jensen, I.R. Jecker, J. Svoboda, in:, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. conference: end_date: 2022-12-20 location: Madras, India name: 'FSTTC: Foundations of Software Technology and Theoretical Computer Science' start_date: 2022-12-18 date_created: 2023-01-01T23:00:50Z date_published: 2022-12-14T00:00:00Z date_updated: 2023-02-13T09:06:43Z day: '14' ddc: - '000' department: - _id: KrCh doi: 10.4230/LIPIcs.FSTTCS.2022.11 ec_funded: 1 file: - access_level: open_access checksum: a21e3ba2421e2c4a06aa2cb6d530ede1 content_type: application/pdf creator: dernst date_created: 2023-01-20T10:19:19Z date_updated: 2023-01-20T10:19:19Z file_id: '12323' file_name: 2022_LIPICs_Chatterjee.pdf file_size: 657396 relation: main_file success: 1 file_date_updated: 2023-01-20T10:19:19Z has_accepted_license: '1' intvolume: ' 250' language: - iso: eng month: '12' oa: 1 oa_version: Published Version project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' publication: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science publication_identifier: isbn: - '9783959772617' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Complexity of spatial games 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: 250 year: '2022' ... --- _id: '12111' abstract: - lang: eng text: Quantum impurities exhibit fascinating many-body phenomena when the small interacting impurity changes the physics of a large noninteracting environment. The characterisation of such strongly correlated nonperturbative effects is particularly challenging due to the infinite size of the environment, and the inability of local correlators to capture the buildup of long-ranged entanglement in the system. Here, we harness an entanglement-based observable—the purity of the impurity—as a witness for the formation of strong correlations. We showcase the utility of our scheme by exactly solving the open Kondo box model in the small box limit, and thus describe all-electronic dot-cavity devices. Specifically, we conclusively characterize the metal-to-insulator phase transition in the system and identify how the (conducting) dot-lead Kondo singlet is quenched by an (insulating) intraimpurity singlet formation. Furthermore, we propose an experimentally feasible tomography protocol for the measurement of the purity, which motivates the observation of impurity physics through their entanglement build up. acknowledgement: We thank G. Blatter, T. Ihn, K. Ensslin, M. Goldstein, C. Carisch, and J. del Pino for illuminating discussions and acknowledge financial support from the Swiss National Science Foundation (SNSF) through Project No. 190078, and from the Deutsche Forschungsgemeinschaft (DFG) - Project No. 449653034. Our numerical implementations are based on the ITensors JULIA library [64]. article_number: '043177' article_processing_charge: No article_type: original author: - first_name: Lidia full_name: Stocker, Lidia last_name: Stocker - first_name: Stefan full_name: Sack, Stefan id: dd622248-f6e0-11ea-865d-ce382a1c81a5 last_name: Sack - first_name: Michael S. full_name: Ferguson, Michael S. last_name: Ferguson - first_name: Oded full_name: Zilberberg, Oded last_name: Zilberberg citation: ama: Stocker L, Sack S, Ferguson MS, Zilberberg O. Entanglement-based observables for quantum impurities. Physical Review Research. 2022;4(4). doi:10.1103/PhysRevResearch.4.043177 apa: Stocker, L., Sack, S., Ferguson, M. S., & Zilberberg, O. (2022). Entanglement-based observables for quantum impurities. Physical Review Research. American Physical Society. https://doi.org/10.1103/PhysRevResearch.4.043177 chicago: Stocker, Lidia, Stefan Sack, Michael S. Ferguson, and Oded Zilberberg. “Entanglement-Based Observables for Quantum Impurities.” Physical Review Research. American Physical Society, 2022. https://doi.org/10.1103/PhysRevResearch.4.043177. ieee: L. Stocker, S. Sack, M. S. Ferguson, and O. Zilberberg, “Entanglement-based observables for quantum impurities,” Physical Review Research, vol. 4, no. 4. American Physical Society, 2022. ista: Stocker L, Sack S, Ferguson MS, Zilberberg O. 2022. Entanglement-based observables for quantum impurities. Physical Review Research. 4(4), 043177. mla: Stocker, Lidia, et al. “Entanglement-Based Observables for Quantum Impurities.” Physical Review Research, vol. 4, no. 4, 043177, American Physical Society, 2022, doi:10.1103/PhysRevResearch.4.043177. short: L. Stocker, S. Sack, M.S. Ferguson, O. Zilberberg, Physical Review Research 4 (2022). date_created: 2023-01-08T23:00:53Z date_published: 2022-12-01T00:00:00Z date_updated: 2023-02-13T09:08:28Z day: '01' ddc: - '530' department: - _id: MaSe doi: 10.1103/PhysRevResearch.4.043177 file: - access_level: open_access checksum: 556820cf6e4af77c8476e5b8f4114d1a content_type: application/pdf creator: dernst date_created: 2023-01-20T12:03:31Z date_updated: 2023-01-20T12:03:31Z file_id: '12328' file_name: 2022_PhysicalReviewResearch_Stocker.pdf file_size: 2941167 relation: main_file success: 1 file_date_updated: 2023-01-20T12:03:31Z has_accepted_license: '1' intvolume: ' 4' issue: '4' language: - iso: eng month: '12' oa: 1 oa_version: Published Version publication: Physical Review Research publication_identifier: issn: - 2643-1564 publication_status: published publisher: American Physical Society quality_controlled: '1' scopus_import: '1' status: public title: Entanglement-based observables for quantum impurities 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 4 year: '2022' ... --- _id: '12135' abstract: - lang: eng text: A good match of material appearance between real-world objects and their digital on-screen representations is critical for many applications such as fabrication, design, and e-commerce. However, faithful appearance reproduction is challenging, especially for complex phenomena, such as gloss. In most cases, the view-dependent nature of gloss and the range of luminance values required for reproducing glossy materials exceeds the current capabilities of display devices. As a result, appearance reproduction poses significant problems even with accurately rendered images. This paper studies the gap between the gloss perceived from real-world objects and their digital counterparts. Based on our psychophysical experiments on a wide range of 3D printed samples and their corresponding photographs, we derive insights on the influence of geometry, illumination, and the display’s brightness and measure the change in gloss appearance due to the display limitations. Our evaluation experiments demonstrate that using the prediction to correct material parameters in a rendering system improves the match of gloss appearance between real objects and their visualization on a display device. acknowledgement: This work is supported by FWF Lise Meitner (Grant M 3319), European Research Council (project CHAMELEON, Grant no. 682080), Swiss National Science Foundation (Grant no. 200502), and academic gifts from Meta. article_number: '35' article_processing_charge: No author: - first_name: Bin full_name: Chen, Bin last_name: Chen - first_name: Michael full_name: Piovarci, Michael id: 62E473F4-5C99-11EA-A40E-AF823DDC885E last_name: Piovarci - first_name: Chao full_name: Wang, Chao last_name: Wang - first_name: Hans-Peter full_name: Seidel, Hans-Peter last_name: Seidel - first_name: Piotr full_name: Didyk, Piotr last_name: Didyk - first_name: Karol full_name: Myszkowski, Karol last_name: Myszkowski - first_name: Ana full_name: Serrano, Ana last_name: Serrano citation: ama: 'Chen B, Piovarci M, Wang C, et al. Gloss management for consistent reproduction of real and virtual objects. In: SIGGRAPH Asia 2022 Conference Papers. Vol 2022. Association for Computing Machinery; 2022. doi:10.1145/3550469.3555406' apa: 'Chen, B., Piovarci, M., Wang, C., Seidel, H.-P., Didyk, P., Myszkowski, K., & Serrano, A. (2022). Gloss management for consistent reproduction of real and virtual objects. In SIGGRAPH Asia 2022 Conference Papers (Vol. 2022). Daegu, South Korea: Association for Computing Machinery. https://doi.org/10.1145/3550469.3555406' chicago: Chen, Bin, Michael Piovarci, Chao Wang, Hans-Peter Seidel, Piotr Didyk, Karol Myszkowski, and Ana Serrano. “Gloss Management for Consistent Reproduction of Real and Virtual Objects.” In SIGGRAPH Asia 2022 Conference Papers, Vol. 2022. Association for Computing Machinery, 2022. https://doi.org/10.1145/3550469.3555406. ieee: B. Chen et al., “Gloss management for consistent reproduction of real and virtual objects,” in SIGGRAPH Asia 2022 Conference Papers, Daegu, South Korea, 2022, vol. 2022. ista: 'Chen B, Piovarci M, Wang C, Seidel H-P, Didyk P, Myszkowski K, Serrano A. 2022. Gloss management for consistent reproduction of real and virtual objects. SIGGRAPH Asia 2022 Conference Papers. SIGGRAPH: Computer Graphics and Interactive Techniques Conference vol. 2022, 35.' mla: Chen, Bin, et al. “Gloss Management for Consistent Reproduction of Real and Virtual Objects.” SIGGRAPH Asia 2022 Conference Papers, vol. 2022, 35, Association for Computing Machinery, 2022, doi:10.1145/3550469.3555406. short: B. Chen, M. Piovarci, C. Wang, H.-P. Seidel, P. Didyk, K. Myszkowski, A. Serrano, in:, SIGGRAPH Asia 2022 Conference Papers, Association for Computing Machinery, 2022. conference: end_date: 2022-12-09 location: Daegu, South Korea name: 'SIGGRAPH: Computer Graphics and Interactive Techniques Conference' start_date: 2022-12-06 date_created: 2023-01-12T12:03:56Z date_published: 2022-11-01T00:00:00Z date_updated: 2023-02-13T09:15:25Z day: '01' ddc: - '000' department: - _id: BeBi doi: 10.1145/3550469.3555406 file: - access_level: open_access checksum: f47f3215ab8bb919e3546b3438c34c21 content_type: application/pdf creator: dernst date_created: 2023-01-24T07:35:21Z date_updated: 2023-01-24T07:35:21Z file_id: '12351' file_name: 2022_ACM_SIGGRAPH_Chen.pdf file_size: 28826826 relation: main_file success: 1 file_date_updated: 2023-01-24T07:35:21Z has_accepted_license: '1' intvolume: ' 2022' language: - iso: eng month: '11' oa: 1 oa_version: Published Version project: - _id: eb901961-77a9-11ec-83b8-f5c883a62027 grant_number: M03319 name: Perception-Aware Appearance Fabrication publication: SIGGRAPH Asia 2022 Conference Papers publication_identifier: isbn: - '9781450394703' publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: Gloss management for consistent reproduction of real and virtual objects 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: 2022 year: '2022' ... --- _id: '12134' abstract: - lang: eng text: Standard epidemic models exhibit one continuous, second order phase transition to macroscopic outbreaks. However, interventions to control outbreaks may fundamentally alter epidemic dynamics. Here we reveal how such interventions modify the type of phase transition. In particular, we uncover three distinct types of explosive phase transitions for epidemic dynamics with capacity-limited interventions. Depending on the capacity limit, interventions may (i) leave the standard second order phase transition unchanged but exponentially suppress the probability of large outbreaks, (ii) induce a first-order discontinuous transition to macroscopic outbreaks, or (iii) cause a secondary explosive yet continuous third-order transition. These insights highlight inherent limitations in predicting and containing epidemic outbreaks. More generally our study offers a cornerstone example of a third-order explosive phase transition in complex systems. acknowledgement: We acknowledge support from the Volkswagen Foundation under Grant No. 99720 and the German Federal Ministry for Education and Research (BMBF) under Grant No. 16ICR01. This research was supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy—EXC-2068—390729961—Cluster of Excellence Physics of Life of TU Dresden. article_number: 04LT02 article_processing_charge: No article_type: original author: - first_name: Georg full_name: Börner, Georg last_name: Börner - first_name: Malte full_name: Schröder, Malte last_name: Schröder - first_name: Davide full_name: Scarselli, Davide id: 40315C30-F248-11E8-B48F-1D18A9856A87 last_name: Scarselli orcid: 0000-0001-5227-4271 - first_name: Nazmi B full_name: Budanur, Nazmi B id: 3EA1010E-F248-11E8-B48F-1D18A9856A87 last_name: Budanur orcid: 0000-0003-0423-5010 - first_name: Björn full_name: Hof, Björn id: 3A374330-F248-11E8-B48F-1D18A9856A87 last_name: Hof orcid: 0000-0003-2057-2754 - first_name: Marc full_name: Timme, Marc last_name: Timme citation: ama: 'Börner G, Schröder M, Scarselli D, Budanur NB, Hof B, Timme M. Explosive transitions in epidemic dynamics. Journal of Physics: Complexity. 2022;3(4). doi:10.1088/2632-072x/ac99cd' apa: 'Börner, G., Schröder, M., Scarselli, D., Budanur, N. B., Hof, B., & Timme, M. (2022). Explosive transitions in epidemic dynamics. Journal of Physics: Complexity. IOP Publishing. https://doi.org/10.1088/2632-072x/ac99cd' chicago: 'Börner, Georg, Malte Schröder, Davide Scarselli, Nazmi B Budanur, Björn Hof, and Marc Timme. “Explosive Transitions in Epidemic Dynamics.” Journal of Physics: Complexity. IOP Publishing, 2022. https://doi.org/10.1088/2632-072x/ac99cd.' ieee: 'G. Börner, M. Schröder, D. Scarselli, N. B. Budanur, B. Hof, and M. Timme, “Explosive transitions in epidemic dynamics,” Journal of Physics: Complexity, vol. 3, no. 4. IOP Publishing, 2022.' ista: 'Börner G, Schröder M, Scarselli D, Budanur NB, Hof B, Timme M. 2022. Explosive transitions in epidemic dynamics. Journal of Physics: Complexity. 3(4), 04LT02.' mla: 'Börner, Georg, et al. “Explosive Transitions in Epidemic Dynamics.” Journal of Physics: Complexity, vol. 3, no. 4, 04LT02, IOP Publishing, 2022, doi:10.1088/2632-072x/ac99cd.' short: 'G. Börner, M. Schröder, D. Scarselli, N.B. Budanur, B. Hof, M. Timme, Journal of Physics: Complexity 3 (2022).' date_created: 2023-01-12T12:03:43Z date_published: 2022-10-25T00:00:00Z date_updated: 2023-02-13T09:15:13Z day: '25' ddc: - '530' department: - _id: BjHo doi: 10.1088/2632-072x/ac99cd file: - access_level: open_access checksum: 35c5c5cb0eb17ea1b5184755daab9fc9 content_type: application/pdf creator: dernst date_created: 2023-01-24T07:24:37Z date_updated: 2023-01-24T07:24:37Z file_id: '12350' file_name: 2022_JourPhysics_Boerner.pdf file_size: 1006106 relation: main_file success: 1 file_date_updated: 2023-01-24T07:24:37Z has_accepted_license: '1' intvolume: ' 3' issue: '4' keyword: - Artificial Intelligence - Computer Networks and Communications - Computer Science Applications - Information Systems language: - iso: eng month: '10' oa: 1 oa_version: Published Version publication: 'Journal of Physics: Complexity' publication_identifier: issn: - 2632-072X publication_status: published publisher: IOP Publishing quality_controlled: '1' scopus_import: '1' status: public title: Explosive transitions in epidemic dynamics 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 3 year: '2022' ... --- _id: '12156' abstract: - lang: eng text: Models of transcriptional regulation that assume equilibrium binding of transcription factors have been less successful at predicting gene expression from sequence in eukaryotes than in bacteria. This could be due to the non-equilibrium nature of eukaryotic regulation. Unfortunately, the space of possible non-equilibrium mechanisms is vast and predominantly uninteresting. The key question is therefore how this space can be navigated efficiently, to focus on mechanisms and models that are biologically relevant. In this review, we advocate for the normative role of theory—theory that prescribes rather than just describes—in providing such a focus. Theory should expand its remit beyond inferring mechanistic models from data, towards identifying non-equilibrium gene regulatory schemes that may have been evolutionarily selected, despite their energy consumption, because they are precise, reliable, fast, or otherwise outperform regulation at equilibrium. We illustrate our reasoning by toy examples for which we provide simulation code. acknowledgement: 'This work was supported through the Center for the Physics of Biological Function (PHYe1734030) and by National Institutes of Health Grants R01GM097275 and U01DK127429 (TG). GT acknowledges the support of the Austrian Science Fund grant FWF P28844 and the Human Frontiers Science Program. ' article_number: '100435' article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Benjamin full_name: Zoller, Benjamin last_name: Zoller - first_name: Thomas full_name: Gregor, Thomas last_name: Gregor - first_name: Gašper full_name: Tkačik, Gašper id: 3D494DCA-F248-11E8-B48F-1D18A9856A87 last_name: Tkačik orcid: '1' citation: ama: Zoller B, Gregor T, Tkačik G. Eukaryotic gene regulation at equilibrium, or non? Current Opinion in Systems Biology. 2022;31(9). doi:10.1016/j.coisb.2022.100435 apa: Zoller, B., Gregor, T., & Tkačik, G. (2022). Eukaryotic gene regulation at equilibrium, or non? Current Opinion in Systems Biology. Elsevier. https://doi.org/10.1016/j.coisb.2022.100435 chicago: Zoller, Benjamin, Thomas Gregor, and Gašper Tkačik. “Eukaryotic Gene Regulation at Equilibrium, or Non?” Current Opinion in Systems Biology. Elsevier, 2022. https://doi.org/10.1016/j.coisb.2022.100435. ieee: B. Zoller, T. Gregor, and G. Tkačik, “Eukaryotic gene regulation at equilibrium, or non?,” Current Opinion in Systems Biology, vol. 31, no. 9. Elsevier, 2022. ista: Zoller B, Gregor T, Tkačik G. 2022. Eukaryotic gene regulation at equilibrium, or non? Current Opinion in Systems Biology. 31(9), 100435. mla: Zoller, Benjamin, et al. “Eukaryotic Gene Regulation at Equilibrium, or Non?” Current Opinion in Systems Biology, vol. 31, no. 9, 100435, Elsevier, 2022, doi:10.1016/j.coisb.2022.100435. short: B. Zoller, T. Gregor, G. Tkačik, Current Opinion in Systems Biology 31 (2022). date_created: 2023-01-12T12:08:51Z date_published: 2022-09-01T00:00:00Z date_updated: 2023-02-13T09:20:34Z day: '01' ddc: - '570' department: - _id: GaTk doi: 10.1016/j.coisb.2022.100435 file: - access_level: open_access checksum: 97ef01e0cc60cdc84f45640a0f248fb0 content_type: application/pdf creator: dernst date_created: 2023-01-24T12:14:10Z date_updated: 2023-01-24T12:14:10Z file_id: '12362' file_name: 2022_CurrentBiology_Zoller.pdf file_size: 2214944 relation: main_file success: 1 file_date_updated: 2023-01-24T12:14:10Z has_accepted_license: '1' intvolume: ' 31' issue: '9' keyword: - Applied Mathematics - Computer Science Applications - Drug Discovery - General Biochemistry - Genetics and Molecular Biology - Modeling and Simulation language: - iso: eng month: '09' oa: 1 oa_version: Published Version project: - _id: 254E9036-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P28844-B27 name: Biophysics of information processing in gene regulation publication: Current Opinion in Systems Biology publication_identifier: issn: - 2452-3100 publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: Eukaryotic gene regulation at equilibrium, or non? 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 31 year: '2022' ... --- _id: '12171' abstract: - lang: eng text: 'We propose an algorithmic approach for synthesizing linear hybrid automata from time-series data. Unlike existing approaches, our approach provides a whole family of models with the same discrete structure but different dynamics. Each model in the family is guaranteed to capture the input data up to a precision error ε, in the following sense: For each time series, the model contains an execution that is ε-close to the data points. Our construction allows to effectively choose a model from this family with minimal precision error ε. We demonstrate the algorithm’s efficiency and its ability to find precise models in two case studies.' acknowledgement: This work was supported in part by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement no. 847635, by the ERC-2020-AdG 101020093, by DIREC - Digital Research Centre Denmark, and by the Villum Investigator Grant S4OS. alternative_title: - LNCS article_processing_charge: No author: - first_name: Miriam full_name: Garcia Soto, Miriam id: 4B3207F6-F248-11E8-B48F-1D18A9856A87 last_name: Garcia Soto orcid: 0000-0003-2936-5719 - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000-0002-2985-7724 - first_name: Christian full_name: Schilling, Christian id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87 last_name: Schilling orcid: 0000-0003-3658-1065 citation: ama: 'Garcia Soto M, Henzinger TA, Schilling C. Synthesis of parametric hybrid automata from time series. In: 20th International Symposium on Automated Technology for Verification and Analysis. Vol 13505. Springer Nature; 2022:337-353. doi:10.1007/978-3-031-19992-9_22' apa: 'Garcia Soto, M., Henzinger, T. A., & Schilling, C. (2022). Synthesis of parametric hybrid automata from time series. In 20th International Symposium on Automated Technology for Verification and Analysis (Vol. 13505, pp. 337–353). Virtual: Springer Nature. https://doi.org/10.1007/978-3-031-19992-9_22' chicago: Garcia Soto, Miriam, Thomas A Henzinger, and Christian Schilling. “Synthesis of Parametric Hybrid Automata from Time Series.” In 20th International Symposium on Automated Technology for Verification and Analysis, 13505:337–53. Springer Nature, 2022. https://doi.org/10.1007/978-3-031-19992-9_22. ieee: M. Garcia Soto, T. A. Henzinger, and C. Schilling, “Synthesis of parametric hybrid automata from time series,” in 20th International Symposium on Automated Technology for Verification and Analysis, Virtual, 2022, vol. 13505, pp. 337–353. ista: 'Garcia Soto M, Henzinger TA, Schilling C. 2022. Synthesis of parametric hybrid automata from time series. 20th International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 13505, 337–353.' mla: Garcia Soto, Miriam, et al. “Synthesis of Parametric Hybrid Automata from Time Series.” 20th International Symposium on Automated Technology for Verification and Analysis, vol. 13505, Springer Nature, 2022, pp. 337–53, doi:10.1007/978-3-031-19992-9_22. short: M. Garcia Soto, T.A. Henzinger, C. Schilling, in:, 20th International Symposium on Automated Technology for Verification and Analysis, Springer Nature, 2022, pp. 337–353. conference: end_date: 2022-10-28 location: Virtual name: 'ATVA: Automated Technology for Verification and Analysis' start_date: 2022-10-25 date_created: 2023-01-12T12:11:16Z date_published: 2022-10-21T00:00:00Z date_updated: 2023-02-13T09:27:55Z day: '21' department: - _id: ToHe doi: 10.1007/978-3-031-19992-9_22 ec_funded: 1 external_id: arxiv: - '2208.06383' intvolume: ' 13505' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2208.06383 month: '10' oa: 1 oa_version: Preprint page: 337-353 project: - _id: 62781420-2b32-11ec-9570-8d9b63373d4d call_identifier: H2020 grant_number: '101020093' name: Vigilant Algorithmic Monitoring of Software publication: 20th International Symposium on Automated Technology for Verification and Analysis publication_identifier: eisbn: - '9783031199929' eissn: - 1611-3349 isbn: - '9783031199912' issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Synthesis of parametric hybrid automata from time series type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 13505 year: '2022' ... --- _id: '12182' abstract: - lang: eng text: 'Online algorithms make decisions based on past inputs, with the goal of being competitive against an algorithm that sees also future inputs. In this work, we introduce time-local online algorithms; these are online algorithms in which the output at any given time is a function of only T latest inputs. Our main observation is that time-local online algorithms are closely connected to local distributed graph algorithms: distributed algorithms make decisions based on the local information in the spatial dimension, while time-local online algorithms make decisions based on the local information in the temporal dimension. We formalize this connection, and show how we can directly use the tools developed to study distributed approximability of graph optimization problems to prove upper and lower bounds on the competitive ratio achieved with time-local online algorithms. Moreover, we show how to use computational techniques to synthesize optimal time-local algorithms.' acknowledgement: "This research has received funding from the German Research Foundation (DFG), grant\r\n470029389 (FlexNets), 2021-2024, and the Marie Skłodowska-Curie grant agreement No. 840605." article_number: '52' article_processing_charge: No author: - first_name: Maciej full_name: Pacut, Maciej last_name: Pacut - first_name: Mahmoud full_name: Parham, Mahmoud last_name: Parham - first_name: Joel full_name: Rybicki, Joel id: 334EFD2E-F248-11E8-B48F-1D18A9856A87 last_name: Rybicki orcid: 0000-0002-6432-6646 - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid - first_name: Jukka full_name: Suomela, Jukka last_name: Suomela - first_name: Aleksandr full_name: Tereshchenko, Aleksandr last_name: Tereshchenko citation: ama: 'Pacut M, Parham M, Rybicki J, Schmid S, Suomela J, Tereshchenko A. Brief announcement: Temporal locality in online algorithms. In: 36th International Symposium on Distributed Computing. Vol 246. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.DISC.2022.52' apa: 'Pacut, M., Parham, M., Rybicki, J., Schmid, S., Suomela, J., & Tereshchenko, A. (2022). Brief announcement: Temporal locality in online algorithms. In 36th International Symposium on Distributed Computing (Vol. 246). Augusta, GA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2022.52' chicago: 'Pacut, Maciej, Mahmoud Parham, Joel Rybicki, Stefan Schmid, Jukka Suomela, and Aleksandr Tereshchenko. “Brief Announcement: Temporal Locality in Online Algorithms.” In 36th International Symposium on Distributed Computing, Vol. 246. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.DISC.2022.52.' ieee: 'M. Pacut, M. Parham, J. Rybicki, S. Schmid, J. Suomela, and A. Tereshchenko, “Brief announcement: Temporal locality in online algorithms,” in 36th International Symposium on Distributed Computing, Augusta, GA, United States, 2022, vol. 246.' ista: 'Pacut M, Parham M, Rybicki J, Schmid S, Suomela J, Tereshchenko A. 2022. Brief announcement: Temporal locality in online algorithms. 36th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing vol. 246, 52.' mla: 'Pacut, Maciej, et al. “Brief Announcement: Temporal Locality in Online Algorithms.” 36th International Symposium on Distributed Computing, vol. 246, 52, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.DISC.2022.52.' short: M. Pacut, M. Parham, J. Rybicki, S. Schmid, J. Suomela, A. Tereshchenko, in:, 36th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. conference: end_date: 2022-10-27 location: Augusta, GA, United States name: 'DISC: Symposium on Distributed Computing' start_date: 2022-10-25 date_created: 2023-01-13T11:06:28Z date_published: 2022-10-17T00:00:00Z date_updated: 2023-01-27T06:59:29Z day: '17' ddc: - '000' department: - _id: DaAl doi: 10.4230/LIPIcs.DISC.2022.52 ec_funded: 1 file: - access_level: open_access checksum: 11bbb56f68a00f2cf6bcce6cc7f5c5f9 content_type: application/pdf creator: dernst date_created: 2023-01-27T06:58:02Z date_updated: 2023-01-27T06:58:02Z file_id: '12409' file_name: 2022_LIPICs_Pacut.pdf file_size: 524804 relation: main_file success: 1 file_date_updated: 2023-01-27T06:58:02Z has_accepted_license: '1' intvolume: ' 246' language: - iso: eng month: '10' oa: 1 oa_version: Published Version project: - _id: 26A5D39A-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '840605' name: Coordination in constrained and natural distributed systems publication: 36th International Symposium on Distributed Computing publication_identifier: eisbn: - '9783959772556' eissn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: 'Brief announcement: Temporal locality in online algorithms' 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: 246 year: '2022' ... --- _id: '12177' abstract: - lang: eng text: Using elementary hyperbolic geometry, we give an explicit formula for the contraction constant of the skinning map over moduli spaces of relatively acylindrical hyperbolic manifolds. acknowledgement: "The first author was partially supported by the National Science Foundation under Grant\r\nNo. DMS-1928930 while participating in a program hosted by the Mathematical Sciences Research Institute in Berkeley, California, during the Fall 2020 semester. The second author gratefully acknowledges funding by the Austrian Science Fund (FWF) through grants F65 and ESPRIT 208, by the European Research Council (ERC, grant No. 716117, awarded to Prof. Dr. Jan Maas), and by the Deutsche Forschungsgemeinschaft through the SPP 2265." article_processing_charge: No article_type: original author: - first_name: Tommaso full_name: Cremaschi, Tommaso last_name: Cremaschi - first_name: Lorenzo full_name: Dello Schiavo, Lorenzo id: ECEBF480-9E4F-11EA-B557-B0823DDC885E last_name: Dello Schiavo orcid: 0000-0002-9881-6870 citation: ama: Cremaschi T, Dello Schiavo L. Effective contraction of Skinning maps. Proceedings of the American Mathematical Society, Series B. 2022;9(43):445-459. doi:10.1090/bproc/134 apa: Cremaschi, T., & Dello Schiavo, L. (2022). Effective contraction of Skinning maps. Proceedings of the American Mathematical Society, Series B. American Mathematical Society. https://doi.org/10.1090/bproc/134 chicago: Cremaschi, Tommaso, and Lorenzo Dello Schiavo. “Effective Contraction of Skinning Maps.” Proceedings of the American Mathematical Society, Series B. American Mathematical Society, 2022. https://doi.org/10.1090/bproc/134. ieee: T. Cremaschi and L. Dello Schiavo, “Effective contraction of Skinning maps,” Proceedings of the American Mathematical Society, Series B, vol. 9, no. 43. American Mathematical Society, pp. 445–459, 2022. ista: Cremaschi T, Dello Schiavo L. 2022. Effective contraction of Skinning maps. Proceedings of the American Mathematical Society, Series B. 9(43), 445–459. mla: Cremaschi, Tommaso, and Lorenzo Dello Schiavo. “Effective Contraction of Skinning Maps.” Proceedings of the American Mathematical Society, Series B, vol. 9, no. 43, American Mathematical Society, 2022, pp. 445–59, doi:10.1090/bproc/134. short: T. Cremaschi, L. Dello Schiavo, Proceedings of the American Mathematical Society, Series B 9 (2022) 445–459. date_created: 2023-01-12T12:12:17Z date_published: 2022-11-02T00:00:00Z date_updated: 2023-01-26T13:04:13Z day: '02' ddc: - '510' department: - _id: JaMa doi: 10.1090/bproc/134 ec_funded: 1 file: - access_level: open_access checksum: cb4a79937c1f60d4c329a10ee797f0d2 content_type: application/pdf creator: dernst date_created: 2023-01-26T13:02:07Z date_updated: 2023-01-26T13:02:07Z file_id: '12404' file_name: 2022_ProceedingsAMS_Cremaschi.pdf file_size: 326471 relation: main_file success: 1 file_date_updated: 2023-01-26T13:02:07Z has_accepted_license: '1' intvolume: ' 9' issue: '43' language: - iso: eng month: '11' oa: 1 oa_version: Published Version page: 445-459 project: - _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2 grant_number: F6504 name: Taming Complexity in Partial Differential Systems - _id: 256E75B8-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '716117' name: Optimal Transport and Stochastic Dynamics publication: Proceedings of the American Mathematical Society, Series B publication_identifier: issn: - 2330-1511 publication_status: published publisher: American Mathematical Society quality_controlled: '1' scopus_import: '1' status: public title: Effective contraction of Skinning maps tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 9 year: '2022' ... --- _id: '12179' abstract: - lang: eng text: We derive an accurate lower tail estimate on the lowest singular value σ1(X−z) of a real Gaussian (Ginibre) random matrix X shifted by a complex parameter z. Such shift effectively changes the upper tail behavior of the condition number κ(X−z) from the slower (κ(X−z)≥t)≲1/t decay typical for real Ginibre matrices to the faster 1/t2 decay seen for complex Ginibre matrices as long as z is away from the real axis. This sharpens and resolves a recent conjecture in [J. Banks et al., https://arxiv.org/abs/2005.08930, 2020] on the regularizing effect of the real Ginibre ensemble with a genuinely complex shift. As a consequence we obtain an improved upper bound on the eigenvalue condition numbers (known also as the eigenvector overlaps) for real Ginibre matrices. The main technical tool is a rigorous supersymmetric analysis from our earlier work [Probab. Math. Phys., 1 (2020), pp. 101--146]. article_processing_charge: No article_type: original author: - first_name: Giorgio full_name: Cipolloni, Giorgio id: 42198EFA-F248-11E8-B48F-1D18A9856A87 last_name: Cipolloni orcid: 0000-0002-4901-7992 - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 - first_name: Dominik J full_name: Schröder, Dominik J id: 408ED176-F248-11E8-B48F-1D18A9856A87 last_name: Schröder orcid: 0000-0002-2904-1856 citation: ama: Cipolloni G, Erdös L, Schröder DJ. On the condition number of the shifted real Ginibre ensemble. SIAM Journal on Matrix Analysis and Applications. 2022;43(3):1469-1487. doi:10.1137/21m1424408 apa: Cipolloni, G., Erdös, L., & Schröder, D. J. (2022). On the condition number of the shifted real Ginibre ensemble. SIAM Journal on Matrix Analysis and Applications. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/21m1424408 chicago: Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “On the Condition Number of the Shifted Real Ginibre Ensemble.” SIAM Journal on Matrix Analysis and Applications. Society for Industrial and Applied Mathematics, 2022. https://doi.org/10.1137/21m1424408. ieee: G. Cipolloni, L. Erdös, and D. J. Schröder, “On the condition number of the shifted real Ginibre ensemble,” SIAM Journal on Matrix Analysis and Applications, vol. 43, no. 3. Society for Industrial and Applied Mathematics, pp. 1469–1487, 2022. ista: Cipolloni G, Erdös L, Schröder DJ. 2022. On the condition number of the shifted real Ginibre ensemble. SIAM Journal on Matrix Analysis and Applications. 43(3), 1469–1487. mla: Cipolloni, Giorgio, et al. “On the Condition Number of the Shifted Real Ginibre Ensemble.” SIAM Journal on Matrix Analysis and Applications, vol. 43, no. 3, Society for Industrial and Applied Mathematics, 2022, pp. 1469–87, doi:10.1137/21m1424408. short: G. Cipolloni, L. Erdös, D.J. Schröder, SIAM Journal on Matrix Analysis and Applications 43 (2022) 1469–1487. date_created: 2023-01-12T12:12:38Z date_published: 2022-07-01T00:00:00Z date_updated: 2023-01-27T06:56:06Z day: '01' department: - _id: LaEr doi: 10.1137/21m1424408 external_id: arxiv: - '2105.13719' intvolume: ' 43' issue: '3' keyword: - Analysis language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2105.13719 month: '07' oa: 1 oa_version: Preprint page: 1469-1487 publication: SIAM Journal on Matrix Analysis and Applications publication_identifier: eissn: - 1095-7162 issn: - 0895-4798 publication_status: published publisher: Society for Industrial and Applied Mathematics quality_controlled: '1' scopus_import: '1' status: public title: On the condition number of the shifted real Ginibre ensemble type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 43 year: '2022' ... --- _id: '12229' abstract: - lang: eng text: "We present Bullshark, the first directed acyclic graph (DAG) based asynchronous Byzantine Atomic Broadcast protocol that is optimized for the common synchronous case. Like previous DAG-based BFT protocols [19, 25], Bullshark requires no extra communication to achieve consensus on top of building the DAG. That is, parties can totally order the vertices of the DAG by interpreting their local view of the DAG edges. Unlike other asynchronous DAG-based protocols, Bullshark provides a practical low latency fast-path that exploits synchronous periods and deprecates the need for notoriously complex view-change and view-synchronization mechanisms. Bullshark achieves this while maintaining all the desired properties of its predecessor DAG-Rider [25]. Namely, it has optimal amortized communication complexity, it provides fairness and asynchronous liveness, and safety is guaranteed even under a quantum adversary.\r\n\r\nIn order to show the practicality and simplicity of our approach, we also introduce a standalone partially synchronous version of Bullshark, which we evaluate against the state of the art. The implemented protocol is embarrassingly simple (200 LOC on top of an existing DAG-based mempool implementation). It is highly efficient, achieving for example, 125,000 transactions per second with a 2 seconds latency for a deployment of 50 parties. In the same setting, the state of the art pays a steep 50% latency increase as it optimizes for asynchrony." article_processing_charge: No author: - first_name: Alexander full_name: Spiegelman, Alexander last_name: Spiegelman - first_name: Neil full_name: Giridharan, Neil last_name: Giridharan - first_name: Alberto full_name: Sonnino, Alberto last_name: Sonnino - first_name: Eleftherios full_name: Kokoris Kogias, Eleftherios id: f5983044-d7ef-11ea-ac6d-fd1430a26d30 last_name: Kokoris Kogias citation: ama: 'Spiegelman A, Giridharan N, Sonnino A, Kokoris Kogias E. Bullshark: DAG BFT protocols made practical. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. Association for Computing Machinery; 2022:2705–2718. doi:10.1145/3548606.3559361' apa: 'Spiegelman, A., Giridharan, N., Sonnino, A., & Kokoris Kogias, E. (2022). Bullshark: DAG BFT protocols made practical. In Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security (pp. 2705–2718). Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3548606.3559361' chicago: 'Spiegelman, Alexander, Neil Giridharan, Alberto Sonnino, and Eleftherios Kokoris Kogias. “Bullshark: DAG BFT Protocols Made Practical.” In Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2705–2718. Association for Computing Machinery, 2022. https://doi.org/10.1145/3548606.3559361.' ieee: 'A. Spiegelman, N. Giridharan, A. Sonnino, and E. Kokoris Kogias, “Bullshark: DAG BFT protocols made practical,” in Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, Los Angeles, CA, United States, 2022, pp. 2705–2718.' ista: 'Spiegelman A, Giridharan N, Sonnino A, Kokoris Kogias E. 2022. Bullshark: DAG BFT protocols made practical. Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. CCS: CConference on Computer and Communications Security, 2705–2718.' mla: 'Spiegelman, Alexander, et al. “Bullshark: DAG BFT Protocols Made Practical.” Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, Association for Computing Machinery, 2022, pp. 2705–2718, doi:10.1145/3548606.3559361.' short: A. Spiegelman, N. Giridharan, A. Sonnino, E. Kokoris Kogias, in:, Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, Association for Computing Machinery, 2022, pp. 2705–2718. conference: end_date: 2022-11-11 location: Los Angeles, CA, United States name: 'CCS: CConference on Computer and Communications Security' start_date: 2022-11-07 date_created: 2023-01-16T09:49:48Z date_published: 2022-11-01T00:00:00Z date_updated: 2023-01-27T10:33:17Z day: '01' department: - _id: ElKo doi: 10.1145/3548606.3559361 external_id: arxiv: - '2201.05677' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2201.05677 month: '11' oa: 1 oa_version: Preprint page: 2705–2718 publication: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security publication_identifier: isbn: - '9781450394505' publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: 'Bullshark: DAG BFT protocols made practical' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '12276' abstract: - lang: eng text: Ongoing development of quantum simulators allows for a progressively finer degree of control of quantum many-body systems. This motivates the development of efficient approaches to facilitate the control of such systems and enable the preparation of nontrivial quantum states. Here we formulate an approach to control quantum systems based on matrix product states (MPSs). We compare counterdiabatic and leakage minimization approaches to the so-called local steering problem that consists in finding the best value of the control parameters for generating a unitary evolution of the specific MPS in a given direction. In order to benchmark the different approaches, we apply them to the generalization of the PXP model known to exhibit coherent quantum dynamics due to quantum many-body scars. We find that the leakage-based approach generally outperforms the counterdiabatic framework and use it to construct a Floquet model with quantum scars. We perform the first steps towards global trajectory optimization and demonstrate entanglement steering capabilities in the generalized PXP model. Finally, we apply our leakage minimization approach to construct quantum scars in the periodically driven nonintegrable Ising model. acknowledgement: We thank A. A. Michailidis for insightful discussions. M.L. and M.S. acknowledge support from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement No. 850899). D.A. is supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement No. 864597) and by the Swiss National Science Foundation. The infinite TEBD simulations were performed using the ITensor library [67]. article_number: '030343' article_processing_charge: No article_type: original author: - first_name: Marko full_name: Ljubotina, Marko id: F75EE9BE-5C90-11EA-905D-16643DDC885E last_name: Ljubotina - first_name: Barbara full_name: Roos, Barbara id: 5DA90512-D80F-11E9-8994-2E2EE6697425 last_name: Roos orcid: 0000-0002-9071-5880 - first_name: Dmitry A. full_name: Abanin, Dmitry A. last_name: Abanin - first_name: Maksym full_name: Serbyn, Maksym id: 47809E7E-F248-11E8-B48F-1D18A9856A87 last_name: Serbyn orcid: 0000-0002-2399-5827 citation: ama: Ljubotina M, Roos B, Abanin DA, Serbyn M. Optimal steering of matrix product states and quantum many-body scars. PRX Quantum. 2022;3(3). doi:10.1103/prxquantum.3.030343 apa: Ljubotina, M., Roos, B., Abanin, D. A., & Serbyn, M. (2022). Optimal steering of matrix product states and quantum many-body scars. PRX Quantum. American Physical Society. https://doi.org/10.1103/prxquantum.3.030343 chicago: Ljubotina, Marko, Barbara Roos, Dmitry A. Abanin, and Maksym Serbyn. “Optimal Steering of Matrix Product States and Quantum Many-Body Scars.” PRX Quantum. American Physical Society, 2022. https://doi.org/10.1103/prxquantum.3.030343. ieee: M. Ljubotina, B. Roos, D. A. Abanin, and M. Serbyn, “Optimal steering of matrix product states and quantum many-body scars,” PRX Quantum, vol. 3, no. 3. American Physical Society, 2022. ista: Ljubotina M, Roos B, Abanin DA, Serbyn M. 2022. Optimal steering of matrix product states and quantum many-body scars. PRX Quantum. 3(3), 030343. mla: Ljubotina, Marko, et al. “Optimal Steering of Matrix Product States and Quantum Many-Body Scars.” PRX Quantum, vol. 3, no. 3, 030343, American Physical Society, 2022, doi:10.1103/prxquantum.3.030343. short: M. Ljubotina, B. Roos, D.A. Abanin, M. Serbyn, PRX Quantum 3 (2022). date_created: 2023-01-16T10:01:56Z date_published: 2022-09-23T00:00:00Z date_updated: 2023-01-30T11:05:23Z day: '23' ddc: - '530' department: - _id: MaSe - _id: RoSe doi: 10.1103/prxquantum.3.030343 ec_funded: 1 external_id: arxiv: - '2204.02899' file: - access_level: open_access checksum: ef8f0a1b5a019b3958009162de0fa4c3 content_type: application/pdf creator: dernst date_created: 2023-01-30T11:02:50Z date_updated: 2023-01-30T11:02:50Z file_id: '12457' file_name: 2022_PRXQuantum_Ljubotina.pdf file_size: 7661905 relation: main_file success: 1 file_date_updated: 2023-01-30T11:02:50Z has_accepted_license: '1' intvolume: ' 3' issue: '3' keyword: - General Medicine language: - iso: eng month: '09' oa: 1 oa_version: Published Version project: - _id: 23841C26-32DE-11EA-91FC-C7463DDC885E call_identifier: H2020 grant_number: '850899' name: 'Non-Ergodic Quantum Matter: Universality, Dynamics and Control' publication: PRX Quantum publication_identifier: eissn: - 2691-3399 publication_status: published publisher: American Physical Society quality_controlled: '1' scopus_import: '1' status: public title: Optimal steering of matrix product states and quantum many-body scars 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 3 year: '2022' ... --- _id: '12300' abstract: - lang: eng text: Distributed Key Generation (DKG) is a technique to bootstrap threshold cryptosystems without a trusted third party and is a building block to decentralized protocols such as randomness beacons, threshold signatures, and general multiparty computation. Until recently, DKG protocols have assumed the synchronous model and thus are vulnerable when their underlying network assumptions do not hold. The recent advancements in asynchronous DKG protocols are insufficient as they either have poor efficiency or limited functionality, resulting in a lack of concrete implementations. In this paper, we present a simple and concretely efficient asynchronous DKG (ADKG) protocol. In a network of n nodes, our ADKG protocol can tolerate up to t2022 IEEE Symposium on Security and Privacy. Institute of Electrical and Electronics Engineers; 2022:2518-2534. doi:10.1109/sp46214.2022.9833584' apa: 'Das, S., Yurek, T., Xiang, Z., Miller, A., Kokoris Kogias, E., & Ren, L. (2022). Practical asynchronous distributed key generation. In 2022 IEEE Symposium on Security and Privacy (pp. 2518–2534). San Francisco, CA, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/sp46214.2022.9833584' chicago: Das, Sourav, Thomas Yurek, Zhuolun Xiang, Andrew Miller, Eleftherios Kokoris Kogias, and Ling Ren. “Practical Asynchronous Distributed Key Generation.” In 2022 IEEE Symposium on Security and Privacy, 2518–34. Institute of Electrical and Electronics Engineers, 2022. https://doi.org/10.1109/sp46214.2022.9833584. ieee: S. Das, T. Yurek, Z. Xiang, A. Miller, E. Kokoris Kogias, and L. Ren, “Practical asynchronous distributed key generation,” in 2022 IEEE Symposium on Security and Privacy, San Francisco, CA, United States, 2022, pp. 2518–2534. ista: 'Das S, Yurek T, Xiang Z, Miller A, Kokoris Kogias E, Ren L. 2022. Practical asynchronous distributed key generation. 2022 IEEE Symposium on Security and Privacy. SP: Symposium on Security and Privacy, 2518–2534.' mla: Das, Sourav, et al. “Practical Asynchronous Distributed Key Generation.” 2022 IEEE Symposium on Security and Privacy, Institute of Electrical and Electronics Engineers, 2022, pp. 2518–34, doi:10.1109/sp46214.2022.9833584. short: S. Das, T. Yurek, Z. Xiang, A. Miller, E. Kokoris Kogias, L. Ren, in:, 2022 IEEE Symposium on Security and Privacy, Institute of Electrical and Electronics Engineers, 2022, pp. 2518–2534. conference: end_date: 2022-05-26 location: San Francisco, CA, United States name: 'SP: Symposium on Security and Privacy' start_date: 2022-05-23 date_created: 2023-01-16T10:06:11Z date_published: 2022-07-27T00:00:00Z date_updated: 2023-02-16T07:43:53Z day: '27' department: - _id: ElKo doi: 10.1109/sp46214.2022.9833584 language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2021/1591 month: '07' oa: 1 oa_version: Preprint page: 2518-2534 publication: 2022 IEEE Symposium on Security and Privacy publication_identifier: eisbn: - '9781665413169' eissn: - 2375-1207 publication_status: published publisher: Institute of Electrical and Electronics Engineers quality_controlled: '1' scopus_import: '1' status: public title: Practical asynchronous distributed key generation type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '12303' abstract: - lang: eng text: We construct for each choice of a quiver Q, a cohomology theory A, and a poset P a “loop Grassmannian” GP(Q,A). This generalizes loop Grassmannians of semisimple groups and the loop Grassmannians of based quadratic forms. The addition of a “dilation” torus D⊆G2m gives a quantization GPD(Q,A). This construction is motivated by the program of introducing an inner cohomology theory in algebraic geometry adequate for the Geometric Langlands program (Mirković, Some extensions of the notion of loop Grassmannians. Rad Hrvat. Akad. Znan. Umjet. Mat. Znan., the Mardešić issue. No. 532, 53–74, 2017) and on the construction of affine quantum groups from generalized cohomology theories (Yang and Zhao, Quiver varieties and elliptic quantum groups, preprint. arxiv1708.01418). acknowledgement: I.M. thanks Zhijie Dong for long-term discussions on the material that entered this work. We thank Misha Finkelberg for pointing out errors in earlier versions. His advice and his insistence have led to a much better paper. A part of the writing was done at the conference at IST (Vienna) attended by all coauthors. We therefore thank the organizers of the conference and the support of ERC Advanced Grant Arithmetic and Physics of Higgs moduli spaces No. 320593. The work of I.M. was partially supported by NSF grants. The work of Y.Y. was partially supported by the Australian Research Council (ARC) via the award DE190101231. The work of G.Z. was partially supported by ARC via the award DE190101222. alternative_title: - Trends in Mathematics article_processing_charge: No author: - first_name: Ivan full_name: Mirković, Ivan last_name: Mirković - first_name: Yaping full_name: Yang, Yaping last_name: Yang - first_name: Gufang full_name: Zhao, Gufang id: 2BC2AC5E-F248-11E8-B48F-1D18A9856A87 last_name: Zhao citation: ama: 'Mirković I, Yang Y, Zhao G. Loop Grassmannians of Quivers and Affine Quantum Groups. In: Baranovskky V, Guay N, Schedler T, eds. Representation Theory and Algebraic Geometry. 1st ed. TM. Cham: Springer Nature; Birkhäuser; 2022:347-392. doi:10.1007/978-3-030-82007-7_8' apa: 'Mirković, I., Yang, Y., & Zhao, G. (2022). Loop Grassmannians of Quivers and Affine Quantum Groups. In V. Baranovskky, N. Guay, & T. Schedler (Eds.), Representation Theory and Algebraic Geometry (1st ed., pp. 347–392). Cham: Springer Nature; Birkhäuser. https://doi.org/10.1007/978-3-030-82007-7_8' chicago: 'Mirković, Ivan, Yaping Yang, and Gufang Zhao. “Loop Grassmannians of Quivers and Affine Quantum Groups.” In Representation Theory and Algebraic Geometry, edited by Vladimir Baranovskky, Nicolas Guay, and Travis Schedler, 1st ed., 347–92. TM. Cham: Springer Nature; Birkhäuser, 2022. https://doi.org/10.1007/978-3-030-82007-7_8.' ieee: 'I. Mirković, Y. Yang, and G. Zhao, “Loop Grassmannians of Quivers and Affine Quantum Groups,” in Representation Theory and Algebraic Geometry, 1st ed., V. Baranovskky, N. Guay, and T. Schedler, Eds. Cham: Springer Nature; Birkhäuser, 2022, pp. 347–392.' ista: 'Mirković I, Yang Y, Zhao G. 2022.Loop Grassmannians of Quivers and Affine Quantum Groups. In: Representation Theory and Algebraic Geometry. Trends in Mathematics, , 347–392.' mla: Mirković, Ivan, et al. “Loop Grassmannians of Quivers and Affine Quantum Groups.” Representation Theory and Algebraic Geometry, edited by Vladimir Baranovskky et al., 1st ed., Springer Nature; Birkhäuser, 2022, pp. 347–92, doi:10.1007/978-3-030-82007-7_8. short: I. Mirković, Y. Yang, G. Zhao, in:, V. Baranovskky, N. Guay, T. Schedler (Eds.), Representation Theory and Algebraic Geometry, 1st ed., Springer Nature; Birkhäuser, Cham, 2022, pp. 347–392. date_created: 2023-01-16T10:06:41Z date_published: 2022-06-16T00:00:00Z date_updated: 2023-01-27T07:07:31Z day: '16' department: - _id: TaHa doi: 10.1007/978-3-030-82007-7_8 ec_funded: 1 edition: '1' editor: - first_name: Vladimir full_name: Baranovskky, Vladimir last_name: Baranovskky - first_name: Nicolas full_name: Guay, Nicolas last_name: Guay - first_name: Travis full_name: Schedler, Travis last_name: Schedler external_id: arxiv: - '1810.10095' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.1810.10095 month: '06' oa: 1 oa_version: Preprint page: 347-392 place: Cham project: - _id: 25E549F4-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '320593' name: Arithmetic and physics of Higgs moduli spaces publication: Representation Theory and Algebraic Geometry publication_identifier: eisbn: - '9783030820077' eissn: - 2297-024X isbn: - '9783030820060' issn: - 2297-0215 publication_status: published publisher: Springer Nature; Birkhäuser quality_controlled: '1' scopus_import: '1' series_title: TM status: public title: Loop Grassmannians of Quivers and Affine Quantum Groups type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '12508' abstract: - lang: eng text: "We explore the notion of history-determinism in the context of timed automata (TA). History-deterministic automata are those in which nondeterminism can be resolved on the fly, based on the run constructed thus far. History-determinism is a robust property that admits different game-based characterisations, and history-deterministic specifications allow for game-based verification without an expensive determinization step.\r\nWe show yet another characterisation of history-determinism in terms of fair simulation, at the general level of labelled transition systems: a system is history-deterministic precisely if and only if it fairly simulates all language smaller systems.\r\nFor timed automata over infinite timed words it is known that universality is undecidable for Büchi TA. We show that for history-deterministic TA with arbitrary parity acceptance, timed universality, inclusion, and synthesis all remain decidable and are ExpTime-complete.\r\nFor the subclass of TA with safety or reachability acceptance, we show that checking whether such an automaton is history-deterministic is decidable (in ExpTime), and history-deterministic TA with safety acceptance are effectively determinizable without introducing new automata states." acknowledgement: "Thomas A. Henzinger: This work was supported in part by the ERC-2020-AdG 101020093.\r\nPatrick Totzke: acknowledges support from the EPSRC, project no. EP/V025848/1.\r\n" alternative_title: - LIPIcs article_processing_charge: No author: - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000-0002-2985-7724 - first_name: Karoliina full_name: Lehtinen, Karoliina last_name: Lehtinen - first_name: Patrick full_name: Totzke, Patrick last_name: Totzke citation: ama: 'Henzinger TA, Lehtinen K, Totzke P. History-deterministic timed automata. In: 33rd International Conference on Concurrency Theory. Vol 243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:14:1-14:21. doi:10.4230/LIPIcs.CONCUR.2022.14' apa: 'Henzinger, T. A., Lehtinen, K., & Totzke, P. (2022). History-deterministic timed automata. In 33rd International Conference on Concurrency Theory (Vol. 243, p. 14:1-14:21). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2022.14' chicago: Henzinger, Thomas A, Karoliina Lehtinen, and Patrick Totzke. “History-Deterministic Timed Automata.” In 33rd International Conference on Concurrency Theory, 243:14:1-14:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.CONCUR.2022.14. ieee: T. A. Henzinger, K. Lehtinen, and P. Totzke, “History-deterministic timed automata,” in 33rd International Conference on Concurrency Theory, Warsaw, Poland, 2022, vol. 243, p. 14:1-14:21. ista: 'Henzinger TA, Lehtinen K, Totzke P. 2022. History-deterministic timed automata. 33rd International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 243, 14:1-14:21.' mla: Henzinger, Thomas A., et al. “History-Deterministic Timed Automata.” 33rd International Conference on Concurrency Theory, vol. 243, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 14:1-14:21, doi:10.4230/LIPIcs.CONCUR.2022.14. short: T.A. Henzinger, K. Lehtinen, P. Totzke, in:, 33rd International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 14:1-14:21. conference: end_date: 2022-09-16 location: Warsaw, Poland name: 'CONCUR: Conference on Concurrency Theory' start_date: 2022-09-13 date_created: 2023-02-05T17:24:23Z date_published: 2022-09-06T00:00:00Z date_updated: 2023-02-06T09:23:31Z day: '06' ddc: - '000' department: - _id: ToHe doi: 10.4230/LIPIcs.CONCUR.2022.14 ec_funded: 1 file: - access_level: open_access checksum: 9e97e15628f66b2ad77f535bb0327dee content_type: application/pdf creator: dernst date_created: 2023-02-06T09:21:09Z date_updated: 2023-02-06T09:21:09Z file_id: '12520' file_name: 2022_LIPICs_Henzinger2.pdf file_size: 717940 relation: main_file success: 1 file_date_updated: 2023-02-06T09:21:09Z has_accepted_license: '1' intvolume: ' 243' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: 14:1-14:21 project: - _id: 62781420-2b32-11ec-9570-8d9b63373d4d call_identifier: H2020 grant_number: '101020093' name: Vigilant Algorithmic Monitoring of Software publication: 33rd International Conference on Concurrency Theory publication_identifier: isbn: - '9783959772464' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: History-deterministic timed automata 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: 243 year: '2022' ... --- _id: '12509' abstract: - lang: eng text: A graph game is a two-player zero-sum game in which the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. In bidding games, both players have budgets, and in each turn, we hold an "auction" (bidding) to determine which player moves the token. In this survey, we consider several bidding mechanisms and their effect on the properties of the game. Specifically, bidding games, and in particular bidding games of infinite duration, have an intriguing equivalence with random-turn games in which in each turn, the player who moves is chosen randomly. We summarize how minor changes in the bidding mechanism lead to unexpected differences in the equivalence with random-turn games. acknowledgement: "Guy Avni: Work partially supported by the Israel Science Foundation, ISF grant agreement\r\nno 1679/21.\r\nThomas A. Henzinger: This work was supported in part by the ERC-2020-AdG 101020093.\r\nWe would like to thank all our collaborators Milad Aghajohari, Ventsislav Chonev, Rasmus Ibsen-Jensen, Ismäel Jecker, Petr Novotný, Josef Tkadlec, and Ðorđe Žikelić; we hope the collaboration was as fun and meaningful for you as it was for us." article_processing_charge: No author: - first_name: Guy full_name: Avni, Guy id: 463C8BC2-F248-11E8-B48F-1D18A9856A87 last_name: Avni orcid: 0000-0001-5588-8287 - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000-0002-2985-7724 citation: ama: 'Avni G, Henzinger TA. An updated survey of bidding games on graphs. In: 47th International Symposium on Mathematical Foundations of Computer Science. Vol 241. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:3:1-3:6. doi:10.4230/LIPIcs.MFCS.2022.3' apa: 'Avni, G., & Henzinger, T. A. (2022). An updated survey of bidding games on graphs. In 47th International Symposium on Mathematical Foundations of Computer Science (Vol. 241, p. 3:1-3:6). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2022.3' chicago: 'Avni, Guy, and Thomas A Henzinger. “An Updated Survey of Bidding Games on Graphs.” In 47th International Symposium on Mathematical Foundations of Computer Science, 241:3:1-3:6. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.MFCS.2022.3.' ieee: G. Avni and T. A. Henzinger, “An updated survey of bidding games on graphs,” in 47th International Symposium on Mathematical Foundations of Computer Science, Vienna, Austria, 2022, vol. 241, p. 3:1-3:6. ista: 'Avni G, Henzinger TA. 2022. An updated survey of bidding games on graphs. 47th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer ScienceLeibniz International Proceedings in Informatics (LIPIcs) vol. 241, 3:1-3:6.' mla: Avni, Guy, and Thomas A. Henzinger. “An Updated Survey of Bidding Games on Graphs.” 47th International Symposium on Mathematical Foundations of Computer Science, vol. 241, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 3:1-3:6, doi:10.4230/LIPIcs.MFCS.2022.3. short: G. Avni, T.A. Henzinger, in:, 47th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 3:1-3:6. conference: end_date: 2022-08-26 location: Vienna, Austria name: 'MFCS: Symposium on Mathematical Foundations of Computer Science' start_date: 2022-08-22 date_created: 2023-02-05T17:26:01Z date_published: 2022-08-22T00:00:00Z date_updated: 2023-02-06T09:16:54Z day: '22' ddc: - '000' department: - _id: ToHe doi: 10.4230/LIPIcs.MFCS.2022.3 ec_funded: 1 file: - access_level: open_access checksum: 1888ec9421622f9526fbec2de035f132 content_type: application/pdf creator: dernst date_created: 2023-02-06T09:13:04Z date_updated: 2023-02-06T09:13:04Z file_id: '12519' file_name: 2022_LIPICs_Avni.pdf file_size: 624586 relation: main_file success: 1 file_date_updated: 2023-02-06T09:13:04Z has_accepted_license: '1' intvolume: ' 241' language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: 3:1-3:6 place: Dagstuhl, Germany project: - _id: 62781420-2b32-11ec-9570-8d9b63373d4d call_identifier: H2020 grant_number: '101020093' name: Vigilant Algorithmic Monitoring of Software publication: 47th International Symposium on Mathematical Foundations of Computer Science publication_identifier: isbn: - '9783959772563' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' series_title: Leibniz International Proceedings in Informatics (LIPIcs) status: public title: An updated survey of bidding games 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 241 year: '2022' ... --- _id: '12540' abstract: - lang: eng text: We consider the problem of signal estimation in generalized linear models defined via rotationally invariant design matrices. Since these matrices can have an arbitrary spectral distribution, this model is well suited for capturing complex correlation structures which often arise in applications. We propose a novel family of approximate message passing (AMP) algorithms for signal estimation, and rigorously characterize their performance in the high-dimensional limit via a state evolution recursion. Our rotationally invariant AMP has complexity of the same order as the existing AMP derived under the restrictive assumption of a Gaussian design; our algorithm also recovers this existing AMP as a special case. Numerical results showcase a performance close to Vector AMP (which is conjectured to be Bayes-optimal in some settings), but obtained with a much lower complexity, as the proposed algorithm does not require a computationally expensive singular value decomposition. acknowledgement: The authors would like to thank the anonymous reviewers for their helpful comments. KK and MM were partially supported by the 2019 Lopez-Loreta Prize. article_number: '22' article_processing_charge: No author: - first_name: Ramji full_name: Venkataramanan, Ramji last_name: Venkataramanan - first_name: Kevin full_name: Kögler, Kevin id: 94ec913c-dc85-11ea-9058-e5051ab2428b last_name: Kögler - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 citation: ama: 'Venkataramanan R, Kögler K, Mondelli M. Estimation in rotationally invariant generalized linear models via approximate message passing. In: Proceedings of the 39th International Conference on Machine Learning. Vol 162. ML Research Press; 2022.' apa: 'Venkataramanan, R., Kögler, K., & Mondelli, M. (2022). Estimation in rotationally invariant generalized linear models via approximate message passing. In Proceedings of the 39th International Conference on Machine Learning (Vol. 162). Baltimore, MD, United States: ML Research Press.' chicago: Venkataramanan, Ramji, Kevin Kögler, and Marco Mondelli. “Estimation in Rotationally Invariant Generalized Linear Models via Approximate Message Passing.” In Proceedings of the 39th International Conference on Machine Learning, Vol. 162. ML Research Press, 2022. ieee: R. Venkataramanan, K. Kögler, and M. Mondelli, “Estimation in rotationally invariant generalized linear models via approximate message passing,” in Proceedings of the 39th International Conference on Machine Learning, Baltimore, MD, United States, 2022, vol. 162. ista: 'Venkataramanan R, Kögler K, Mondelli M. 2022. Estimation in rotationally invariant generalized linear models via approximate message passing. Proceedings of the 39th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 162, 22.' mla: Venkataramanan, Ramji, et al. “Estimation in Rotationally Invariant Generalized Linear Models via Approximate Message Passing.” Proceedings of the 39th International Conference on Machine Learning, vol. 162, 22, ML Research Press, 2022. short: R. Venkataramanan, K. Kögler, M. Mondelli, in:, Proceedings of the 39th International Conference on Machine Learning, ML Research Press, 2022. conference: end_date: 2022-07-23 location: Baltimore, MD, United States name: 'ICML: International Conference on Machine Learning' start_date: 2022-07-17 date_created: 2023-02-10T13:49:04Z date_published: 2022-01-01T00:00:00Z date_updated: 2023-02-13T10:54:58Z ddc: - '000' department: - _id: MaMo file: - access_level: open_access checksum: 67436eb0a660789514cdf9db79e84683 content_type: application/pdf creator: dernst date_created: 2023-02-13T10:53:11Z date_updated: 2023-02-13T10:53:11Z file_id: '12547' file_name: 2022_PMLR_Venkataramanan.pdf file_size: 2341343 relation: main_file success: 1 file_date_updated: 2023-02-13T10:53:11Z has_accepted_license: '1' intvolume: ' 162' language: - iso: eng oa: 1 oa_version: Published Version project: - _id: 059876FA-7A3F-11EA-A408-12923DDC885E name: Prix Lopez-Loretta 2019 - Marco Mondelli publication: Proceedings of the 39th International Conference on Machine Learning publication_status: published publisher: ML Research Press quality_controlled: '1' status: public title: Estimation in rotationally invariant generalized linear models via approximate message passing type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 162 year: '2022' ... --- _id: '12536' abstract: - lang: eng text: 'We consider the problem of estimating a rank-1 signal corrupted by structured rotationally invariant noise, and address the following question: how well do inference algorithms perform when the noise statistics is unknown and hence Gaussian noise is assumed? While the matched Bayes-optimal setting with unstructured noise is well understood, the analysis of this mismatched problem is only at its premises. In this paper, we make a step towards understanding the effect of the strong source of mismatch which is the noise statistics. Our main technical contribution is the rigorous analysis of a Bayes estimator and of an approximate message passing (AMP) algorithm, both of which incorrectly assume a Gaussian setup. The first result exploits the theory of spherical integrals and of low-rank matrix perturbations; the idea behind the second one is to design and analyze an artificial AMP which, by taking advantage of the flexibility in the denoisers, is able to "correct" the mismatch. Armed with these sharp asymptotic characterizations, we unveil a rich and often unexpected phenomenology. For example, despite AMP is in principle designed to efficiently compute the Bayes estimator, the former is outperformed by the latter in terms of mean-square error. We show that this performance gap is due to an incorrect estimation of the signal norm. In fact, when the SNR is large enough, the overlaps of the AMP and the Bayes estimator coincide, and they even match those of optimal estimators taking into account the structure of the noise.' article_number: '2205.10009' article_processing_charge: No author: - first_name: Jean full_name: Barbier, Jean last_name: Barbier - first_name: TianQi full_name: Hou, TianQi last_name: Hou - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 - first_name: Manuel full_name: Saenz, Manuel last_name: Saenz citation: ama: 'Barbier J, Hou T, Mondelli M, Saenz M. The price of ignorance: How much does it cost to forget noise structure in low-rank matrix estimation? arXiv. doi:10.48550/arXiv.2205.10009' apa: 'Barbier, J., Hou, T., Mondelli, M., & Saenz, M. (n.d.). The price of ignorance: How much does it cost to forget noise structure in low-rank matrix estimation? arXiv. https://doi.org/10.48550/arXiv.2205.10009' chicago: 'Barbier, Jean, TianQi Hou, Marco Mondelli, and Manuel Saenz. “The Price of Ignorance: How Much Does It Cost to Forget Noise Structure in Low-Rank Matrix Estimation?” ArXiv, n.d. https://doi.org/10.48550/arXiv.2205.10009.' ieee: 'J. Barbier, T. Hou, M. Mondelli, and M. Saenz, “The price of ignorance: How much does it cost to forget noise structure in low-rank matrix estimation?,” arXiv. .' ista: 'Barbier J, Hou T, Mondelli M, Saenz M. The price of ignorance: How much does it cost to forget noise structure in low-rank matrix estimation? arXiv, 2205.10009.' mla: 'Barbier, Jean, et al. “The Price of Ignorance: How Much Does It Cost to Forget Noise Structure in Low-Rank Matrix Estimation?” ArXiv, 2205.10009, doi:10.48550/arXiv.2205.10009.' short: J. Barbier, T. Hou, M. Mondelli, M. Saenz, ArXiv (n.d.). date_created: 2023-02-10T13:45:41Z date_published: 2022-05-20T00:00:00Z date_updated: 2023-02-16T09:41:25Z day: '20' department: - _id: MaMo doi: 10.48550/arXiv.2205.10009 external_id: arxiv: - '2205.10009' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2205.10009 month: '05' oa: 1 oa_version: Preprint publication: arXiv publication_status: accepted status: public title: 'The price of ignorance: How much does it cost to forget noise structure in low-rank matrix estimation?' type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '12568' abstract: - lang: eng text: We treat the problem of risk-aware control for stochastic shortest path (SSP) on Markov decision processes (MDP). Typically, expectation is considered for SSP, which however is oblivious to the incurred risk. We present an alternative view, instead optimizing conditional value-at-risk (CVaR), an established risk measure. We treat both Markov chains as well as MDP and introduce, through novel insights, two algorithms, based on linear programming and value iteration, respectively. Both algorithms offer precise and provably correct solutions. Evaluation of our prototype implementation shows that risk-aware control is feasible on several moderately sized models. article_processing_charge: No author: - first_name: Tobias full_name: Meggendorfer, Tobias id: b21b0c15-30a2-11eb-80dc-f13ca25802e1 last_name: Meggendorfer orcid: 0000-0002-1712-2165 citation: ama: 'Meggendorfer T. Risk-aware stochastic shortest path. In: Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022. Vol 36. Association for the Advancement of Artificial Intelligence; 2022:9858-9867. doi:10.1609/aaai.v36i9.21222' apa: 'Meggendorfer, T. (2022). Risk-aware stochastic shortest path. In Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022 (Vol. 36, pp. 9858–9867). Virtual: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v36i9.21222' chicago: Meggendorfer, Tobias. “Risk-Aware Stochastic Shortest Path.” In Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, 36:9858–67. Association for the Advancement of Artificial Intelligence, 2022. https://doi.org/10.1609/aaai.v36i9.21222. ieee: T. Meggendorfer, “Risk-aware stochastic shortest path,” in Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, Virtual, 2022, vol. 36, no. 9, pp. 9858–9867. ista: Meggendorfer T. 2022. Risk-aware stochastic shortest path. Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022. Conference on Artificial Intelligence vol. 36, 9858–9867. mla: Meggendorfer, Tobias. “Risk-Aware Stochastic Shortest Path.” Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, vol. 36, no. 9, Association for the Advancement of Artificial Intelligence, 2022, pp. 9858–67, doi:10.1609/aaai.v36i9.21222. short: T. Meggendorfer, in:, Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, Association for the Advancement of Artificial Intelligence, 2022, pp. 9858–9867. conference: end_date: 2022-03-01 location: Virtual name: Conference on Artificial Intelligence start_date: 2022-02-22 date_created: 2023-02-19T23:00:56Z date_published: 2022-06-28T00:00:00Z date_updated: 2023-02-20T07:19:12Z day: '28' department: - _id: KrCh doi: 10.1609/aaai.v36i9.21222 external_id: arxiv: - '2203.01640' intvolume: ' 36' issue: '9' language: - iso: eng main_file_link: - open_access: '1' url: ' https://doi.org/10.48550/arXiv.2203.01640' month: '06' oa: 1 oa_version: Preprint page: 9858-9867 publication: Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022 publication_identifier: eissn: - 2374-3468 isbn: - '1577358767' publication_status: published publisher: Association for the Advancement of Artificial Intelligence quality_controlled: '1' scopus_import: '1' status: public title: Risk-aware stochastic shortest path type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 36 year: '2022' ... --- _id: '12660' abstract: - lang: eng text: 'We present Cross-Client Label Propagation(XCLP), a new method for transductive federated learning. XCLP estimates a data graph jointly from the data of multiple clients and computes labels for the unlabeled data by propagating label information across the graph. To avoid clients having to share their data with anyone, XCLP employs two cryptographically secure protocols: secure Hamming distance computation and secure summation. We demonstrate two distinct applications of XCLP within federated learning. In the first, we use it in a one-shot way to predict labels for unseen test points. In the second, we use it to repeatedly pseudo-label unlabeled training data in a federated semi-supervised setting. Experiments on both real federated and standard benchmark datasets show that in both applications XCLP achieves higher classification accuracy than alternative approaches.' article_number: '2210.06434' article_processing_charge: No author: - first_name: Jonathan A full_name: Scott, Jonathan A id: e499926b-f6e0-11ea-865d-9c63db0031e8 last_name: Scott - first_name: Michelle X full_name: Yeo, Michelle X id: 2D82B818-F248-11E8-B48F-1D18A9856A87 last_name: Yeo - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: Scott JA, Yeo MX, Lampert C. Cross-client Label Propagation for transductive federated learning. arXiv. doi:10.48550/arXiv.2210.06434 apa: Scott, J. A., Yeo, M. X., & Lampert, C. (n.d.). Cross-client Label Propagation for transductive federated learning. arXiv. https://doi.org/10.48550/arXiv.2210.06434 chicago: Scott, Jonathan A, Michelle X Yeo, and Christoph Lampert. “Cross-Client Label Propagation for Transductive Federated Learning.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2210.06434. ieee: J. A. Scott, M. X. Yeo, and C. Lampert, “Cross-client Label Propagation for transductive federated learning,” arXiv. . ista: Scott JA, Yeo MX, Lampert C. Cross-client Label Propagation for transductive federated learning. arXiv, 2210.06434. mla: Scott, Jonathan A., et al. “Cross-Client Label Propagation for Transductive Federated Learning.” ArXiv, 2210.06434, doi:10.48550/arXiv.2210.06434. short: J.A. Scott, M.X. Yeo, C. Lampert, ArXiv (n.d.). date_created: 2023-02-20T08:21:50Z date_published: 2022-10-12T00:00:00Z date_updated: 2023-02-21T08:20:18Z day: '12' ddc: - '004' department: - _id: ChLa doi: 10.48550/arXiv.2210.06434 external_id: arxiv: - '2210.06434' file: - access_level: open_access checksum: 7ab20543fd4393f14fb857ce2e4f03c6 content_type: application/pdf creator: chl date_created: 2023-02-20T08:21:35Z date_updated: 2023-02-20T08:21:35Z file_id: '12661' file_name: 2210.06434.pdf file_size: 291893 relation: main_file success: 1 file_date_updated: 2023-02-20T08:21:35Z has_accepted_license: '1' language: - iso: eng month: '10' oa: 1 oa_version: Preprint publication: arXiv publication_status: submitted status: public title: Cross-client Label Propagation for transductive federated learning 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: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '12662' abstract: - lang: eng text: 'Modern machine learning tasks often require considering not just one but multiple objectives. For example, besides the prediction quality, this could be the efficiency, robustness or fairness of the learned models, or any of their combinations. Multi-objective learning offers a natural framework for handling such problems without having to commit to early trade-offs. Surprisingly, statistical learning theory so far offers almost no insight into the generalization properties of multi-objective learning. In this work, we make first steps to fill this gap: we establish foundational generalization bounds for the multi-objective setting as well as generalization and excess bounds for learning with scalarizations. We also provide the first theoretical analysis of the relation between the Pareto-optimal sets of the true objectives and the Pareto-optimal sets of their empirical approximations from training data. In particular, we show a surprising asymmetry: all Pareto-optimal solutions can be approximated by empirically Pareto-optimal ones, but not vice versa.' article_number: '2208.13499' article_processing_charge: No 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 citation: ama: Súkeník P, Lampert C. Generalization in Multi-objective machine learning. arXiv. doi:10.48550/arXiv.2208.13499 apa: Súkeník, P., & Lampert, C. (n.d.). Generalization in Multi-objective machine learning. arXiv. https://doi.org/10.48550/arXiv.2208.13499 chicago: Súkeník, Peter, and Christoph Lampert. “Generalization in Multi-Objective Machine Learning.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2208.13499. ieee: P. Súkeník and C. Lampert, “Generalization in Multi-objective machine learning,” arXiv. . ista: Súkeník P, Lampert C. Generalization in Multi-objective machine learning. arXiv, 2208.13499. mla: Súkeník, Peter, and Christoph Lampert. “Generalization in Multi-Objective Machine Learning.” ArXiv, 2208.13499, doi:10.48550/arXiv.2208.13499. short: P. Súkeník, C. Lampert, ArXiv (n.d.). date_created: 2023-02-20T08:23:06Z date_published: 2022-08-29T00:00:00Z date_updated: 2023-02-21T08:24:55Z day: '29' ddc: - '004' department: - _id: ChLa doi: 10.48550/arXiv.2208.13499 external_id: arxiv: - '2208.13499' has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: ' https://doi.org/10.48550/arXiv.2208.13499' month: '08' oa: 1 oa_version: Preprint publication: arXiv publication_status: submitted status: public title: Generalization in Multi-objective machine learning type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '12664' abstract: - lang: eng text: Randomized smoothing is currently considered the state-of-the-art method to obtain certifiably robust classifiers. Despite its remarkable performance, the method is associated with various serious problems such as “certified accuracy waterfalls”, certification vs. accuracy trade-off, or even fairness issues. Input-dependent smoothing approaches have been proposed with intention of overcoming these flaws. However, we demonstrate that these methods lack formal guarantees and so the resulting certificates are not justified. We show that in general, the input-dependent smoothing suffers from the curse of dimensionality, forcing the variance function to have low semi-elasticity. On the other hand, we provide a theoretical and practical framework that enables the usage of input-dependent smoothing even in the presence of the curse of dimensionality, under strict restrictions. We present one concrete design of the smoothing variance function and test it on CIFAR10 and MNIST. Our design mitigates some of the problems of classical smoothing and is formally underlined, yet further improvement of the design is still necessary. article_processing_charge: No author: - first_name: Peter full_name: Súkeník, Peter id: d64d6a8d-eb8e-11eb-b029-96fd216dec3c last_name: Súkeník - first_name: Aleksei full_name: Kuvshinov, Aleksei last_name: Kuvshinov - first_name: Stephan full_name: Günnemann, Stephan last_name: Günnemann citation: ama: 'Súkeník P, Kuvshinov A, Günnemann S. Intriguing properties of input-dependent randomized smoothing. In: Proceedings of the 39th International Conference on Machine Learning. Vol 162. ML Research Press; 2022:20697-20743.' apa: 'Súkeník, P., Kuvshinov, A., & Günnemann, S. (2022). Intriguing properties of input-dependent randomized smoothing. In Proceedings of the 39th International Conference on Machine Learning (Vol. 162, pp. 20697–20743). Baltimore, MD, United States: ML Research Press.' chicago: Súkeník, Peter, Aleksei Kuvshinov, and Stephan Günnemann. “Intriguing Properties of Input-Dependent Randomized Smoothing.” In Proceedings of the 39th International Conference on Machine Learning, 162:20697–743. ML Research Press, 2022. ieee: P. Súkeník, A. Kuvshinov, and S. Günnemann, “Intriguing properties of input-dependent randomized smoothing,” in Proceedings of the 39th International Conference on Machine Learning, Baltimore, MD, United States, 2022, vol. 162, pp. 20697–20743. ista: Súkeník P, Kuvshinov A, Günnemann S. 2022. Intriguing properties of input-dependent randomized smoothing. Proceedings of the 39th International Conference on Machine Learning. International Conference on Machine Learning vol. 162, 20697–20743. mla: Súkeník, Peter, et al. “Intriguing Properties of Input-Dependent Randomized Smoothing.” Proceedings of the 39th International Conference on Machine Learning, vol. 162, ML Research Press, 2022, pp. 20697–743. short: P. Súkeník, A. Kuvshinov, S. Günnemann, in:, Proceedings of the 39th International Conference on Machine Learning, ML Research Press, 2022, pp. 20697–20743. conference: end_date: 2022-07-23 location: Baltimore, MD, United States name: International Conference on Machine Learning start_date: 2022-07-17 date_created: 2023-02-20T08:30:21Z date_published: 2022-07-19T00:00:00Z date_updated: 2023-02-23T10:03:47Z day: '19' ddc: - '004' external_id: arxiv: - '2110.05365' file: - access_level: open_access checksum: ab8695b1e24fb4fef4f1f9cd63ca8238 content_type: application/pdf creator: chl date_created: 2023-02-20T08:30:10Z date_updated: 2023-02-20T08:30:10Z file_id: '12665' file_name: sukeni-k22a.pdf file_size: 8470811 relation: main_file success: 1 file_date_updated: 2023-02-20T08:30:10Z has_accepted_license: '1' intvolume: ' 162' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 20697-20743 publication: Proceedings of the 39th International Conference on Machine Learning publication_status: published publisher: ML Research Press quality_controlled: '1' scopus_import: '1' status: public title: Intriguing properties of input-dependent randomized smoothing type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 162 year: '2022' ... --- _id: '12495' abstract: - lang: eng text: "Fairness-aware learning aims at constructing classifiers that not only make accurate predictions, but also do not discriminate against specific groups. It is a fast-growing area of\r\nmachine learning with far-reaching societal impact. However, existing fair learning methods\r\nare vulnerable to accidental or malicious artifacts in the training data, which can cause\r\nthem to unknowingly produce unfair classifiers. In this work we address the problem of\r\nfair learning from unreliable training data in the robust multisource setting, where the\r\navailable training data comes from multiple sources, a fraction of which might not be representative of the true data distribution. We introduce FLEA, a filtering-based algorithm\r\nthat identifies and suppresses those data sources that would have a negative impact on\r\nfairness or accuracy if they were used for training. As such, FLEA is not a replacement of\r\nprior fairness-aware learning methods but rather an augmentation that makes any of them\r\nrobust against unreliable training data. We show the effectiveness of our approach by a\r\ndiverse range of experiments on multiple datasets. Additionally, we prove formally that\r\n–given enough data– FLEA protects the learner against corruptions as long as the fraction of\r\naffected data sources is less than half. Our source code and documentation are available at\r\nhttps://github.com/ISTAustria-CVML/FLEA." acknowledged_ssus: - _id: ScienComp acknowledgement: 'The authors would like to thank Bernd Prach, Elias Frantar, Alexandra Peste, Mahdi Nikdan, and Peter Súkeník for their helpful feedback. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp). This publication was made possible by an ETH AI Center postdoctoral fellowship granted to Nikola Konstantinov. Eugenia Iofinova was supported in part by the FWF DK VGSCO, grant agreement number W1260-N35. ' article_processing_charge: No article_type: original author: - first_name: Eugenia B full_name: Iofinova, Eugenia B id: f9a17499-f6e0-11ea-865d-fdf9a3f77117 last_name: Iofinova orcid: 0000-0002-7778-3221 - first_name: Nikola H full_name: Konstantinov, Nikola H id: 4B9D76E4-F248-11E8-B48F-1D18A9856A87 last_name: Konstantinov - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: 'Iofinova EB, Konstantinov NH, Lampert C. FLEA: Provably robust fair multisource learning from unreliable training data. Transactions on Machine Learning Research. 2022.' apa: 'Iofinova, E. B., Konstantinov, N. H., & Lampert, C. (2022). FLEA: Provably robust fair multisource learning from unreliable training data. Transactions on Machine Learning Research. ML Research Press.' chicago: 'Iofinova, Eugenia B, Nikola H Konstantinov, and Christoph Lampert. “FLEA: Provably Robust Fair Multisource Learning from Unreliable Training Data.” Transactions on Machine Learning Research. ML Research Press, 2022.' ieee: 'E. B. Iofinova, N. H. Konstantinov, and C. Lampert, “FLEA: Provably robust fair multisource learning from unreliable training data,” Transactions on Machine Learning Research. ML Research Press, 2022.' ista: 'Iofinova EB, Konstantinov NH, Lampert C. 2022. FLEA: Provably robust fair multisource learning from unreliable training data. Transactions on Machine Learning Research.' mla: 'Iofinova, Eugenia B., et al. “FLEA: Provably Robust Fair Multisource Learning from Unreliable Training Data.” Transactions on Machine Learning Research, ML Research Press, 2022.' short: E.B. Iofinova, N.H. Konstantinov, C. Lampert, Transactions on Machine Learning Research (2022). date_created: 2023-02-02T20:29:57Z date_published: 2022-12-22T00:00:00Z date_updated: 2023-02-23T10:30:54Z day: '22' ddc: - '000' department: - _id: ChLa external_id: arxiv: - '2106.11732' file: - access_level: open_access checksum: 97c8a8470759cab597abb973ca137a3b content_type: application/pdf creator: dernst date_created: 2023-02-23T10:30:04Z date_updated: 2023-02-23T10:30:04Z file_id: '12673' file_name: 2022_TMLR_Iofinova.pdf file_size: 1948063 relation: main_file success: 1 file_date_updated: 2023-02-23T10:30:04Z has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://openreview.net/forum?id=XsPopigZXV month: '12' oa: 1 oa_version: Published Version project: - _id: 9B9290DE-BA93-11EA-9121-9846C619BF3A grant_number: ' W1260-N35' name: Vienna Graduate School on Computational Optimization publication: Transactions on Machine Learning Research publication_identifier: issn: - 2835-8856 publication_status: published publisher: ML Research Press quality_controlled: '1' related_material: link: - description: source code relation: software url: https://github.com/ISTAustria-CVML/FLEA status: public title: 'FLEA: Provably robust fair multisource learning from unreliable training data' 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '11938' abstract: - lang: eng text: A matching is compatible to two or more labeled point sets of size n with labels {1, . . . , n} if its straight-line drawing on each of these point sets is crossing-free. We study the maximum number of edges in a matching compatible to two or more labeled point sets in general position in the plane. We show that for any two labeled sets of n points in convex position there exists a compatible matching with ⌊√2n + 1 − 1⌋ edges. More generally, for any ℓ labeled point sets we construct compatible matchings of size Ω(n1/ℓ). As a corresponding upper bound, we use probabilistic arguments to show that for any ℓ given sets of n points there exists a labeling of each set such that the largest compatible matching has O(n2/(ℓ+1)) edges. Finally, we show that Θ(log n) copies of any set of n points are necessary and sufficient for the existence of labelings of these point sets such that any compatible matching consists only of a single edge. acknowledgement: 'A.A. funded by the Marie Sklodowska-Curie grant agreement No 754411. Z.M. partially funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31. I.P., D.P., and B.V. partially supported by FWF within the collaborative DACH project Arrangements and Drawings as FWF project I 3340-N35. A.P. supported by a Schrödinger fellowship of the FWF: J-3847-N35. J.T. partially supported by ERC Start grant no. (279307: Graph Games), FWF grant no. P23499-N23 and S11407-N23 (RiSE).' article_processing_charge: No article_type: original author: - first_name: Oswin full_name: Aichholzer, Oswin last_name: Aichholzer - first_name: Alan M full_name: Arroyo Guevara, Alan M id: 3207FDC6-F248-11E8-B48F-1D18A9856A87 last_name: Arroyo Guevara orcid: 0000-0003-2401-8670 - first_name: Zuzana full_name: Masárová, Zuzana id: 45CFE238-F248-11E8-B48F-1D18A9856A87 last_name: Masárová orcid: 0000-0002-6660-1322 - first_name: Irene full_name: Parada, Irene last_name: Parada - first_name: Daniel full_name: Perz, Daniel last_name: Perz - first_name: Alexander full_name: Pilz, Alexander last_name: Pilz - first_name: Josef full_name: Tkadlec, Josef id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87 last_name: Tkadlec orcid: 0000-0002-1097-9684 - first_name: Birgit full_name: Vogtenhuber, Birgit last_name: Vogtenhuber citation: ama: Aichholzer O, Arroyo Guevara AM, Masárová Z, et al. On compatible matchings. Journal of Graph Algorithms and Applications. 2022;26(2):225-240. doi:10.7155/jgaa.00591 apa: Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A., … Vogtenhuber, B. (2022). On compatible matchings. Journal of Graph Algorithms and Applications. Brown University. https://doi.org/10.7155/jgaa.00591 chicago: Aichholzer, Oswin, Alan M Arroyo Guevara, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. “On Compatible Matchings.” Journal of Graph Algorithms and Applications. Brown University, 2022. https://doi.org/10.7155/jgaa.00591. ieee: O. Aichholzer et al., “On compatible matchings,” Journal of Graph Algorithms and Applications, vol. 26, no. 2. Brown University, pp. 225–240, 2022. ista: Aichholzer O, Arroyo Guevara AM, Masárová Z, Parada I, Perz D, Pilz A, Tkadlec J, Vogtenhuber B. 2022. On compatible matchings. Journal of Graph Algorithms and Applications. 26(2), 225–240. mla: Aichholzer, Oswin, et al. “On Compatible Matchings.” Journal of Graph Algorithms and Applications, vol. 26, no. 2, Brown University, 2022, pp. 225–40, doi:10.7155/jgaa.00591. short: O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, Journal of Graph Algorithms and Applications 26 (2022) 225–240. date_created: 2022-08-21T22:01:56Z date_published: 2022-06-01T00:00:00Z date_updated: 2023-02-23T13:54:21Z day: '01' ddc: - '000' department: - _id: UlWa - _id: HeEd - _id: KrCh doi: 10.7155/jgaa.00591 ec_funded: 1 external_id: arxiv: - '2101.03928' file: - access_level: open_access checksum: dc6e255e3558faff924fd9e370886c11 content_type: application/pdf creator: dernst date_created: 2022-08-22T06:42:42Z date_updated: 2022-08-22T06:42:42Z file_id: '11940' file_name: 2022_JourGraphAlgorithmsApplic_Aichholzer.pdf file_size: 694538 relation: main_file success: 1 file_date_updated: 2022-08-22T06:42:42Z has_accepted_license: '1' intvolume: ' 26' issue: '2' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 225-240 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships - _id: 268116B8-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z00342 name: The Wittgenstein Prize - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory publication: Journal of Graph Algorithms and Applications publication_identifier: issn: - 1526-1719 publication_status: published publisher: Brown University quality_controlled: '1' related_material: record: - id: '9296' relation: earlier_version status: public scopus_import: '1' status: public title: On compatible matchings 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 26 year: '2022' ... --- _id: '10706' abstract: - lang: eng text: This is a collection of problems composed by some participants of the workshop “Differential Geometry, Billiards, and Geometric Optics” that took place at CIRM on October 4–8, 2021. article_processing_charge: No article_type: original author: - first_name: Misha full_name: Bialy, Misha last_name: Bialy - first_name: Corentin full_name: Fiorebe, Corentin id: 06619f18-9070-11eb-847d-d1ee780bd88b last_name: Fiorebe - first_name: Alexey full_name: Glutsyuk, Alexey last_name: Glutsyuk - first_name: Mark full_name: Levi, Mark last_name: Levi - first_name: Alexander full_name: Plakhov, Alexander last_name: Plakhov - first_name: Serge full_name: Tabachnikov, Serge last_name: Tabachnikov citation: ama: Bialy M, Fiorebe C, Glutsyuk A, Levi M, Plakhov A, Tabachnikov S. Open problems on billiards and geometric optics. Arnold Mathematical Journal. 2022;8:411-422. doi:10.1007/s40598-022-00198-y apa: 'Bialy, M., Fiorebe, C., Glutsyuk, A., Levi, M., Plakhov, A., & Tabachnikov, S. (2022). Open problems on billiards and geometric optics. Arnold Mathematical Journal. Hybrid: Springer Nature. https://doi.org/10.1007/s40598-022-00198-y' chicago: Bialy, Misha, Corentin Fiorebe, Alexey Glutsyuk, Mark Levi, Alexander Plakhov, and Serge Tabachnikov. “Open Problems on Billiards and Geometric Optics.” Arnold Mathematical Journal. Springer Nature, 2022. https://doi.org/10.1007/s40598-022-00198-y. ieee: M. Bialy, C. Fiorebe, A. Glutsyuk, M. Levi, A. Plakhov, and S. Tabachnikov, “Open problems on billiards and geometric optics,” Arnold Mathematical Journal, vol. 8. Springer Nature, pp. 411–422, 2022. ista: Bialy M, Fiorebe C, Glutsyuk A, Levi M, Plakhov A, Tabachnikov S. 2022. Open problems on billiards and geometric optics. Arnold Mathematical Journal. 8, 411–422. mla: Bialy, Misha, et al. “Open Problems on Billiards and Geometric Optics.” Arnold Mathematical Journal, vol. 8, Springer Nature, 2022, pp. 411–22, doi:10.1007/s40598-022-00198-y. short: M. Bialy, C. Fiorebe, A. Glutsyuk, M. Levi, A. Plakhov, S. Tabachnikov, Arnold Mathematical Journal 8 (2022) 411–422. conference: end_date: 2021-10-08 location: Hybrid name: 'CIRM: Centre International de Rencontres Mathématiques' start_date: 2021-10-04 date_created: 2022-01-30T23:01:34Z date_published: 2022-10-01T00:00:00Z date_updated: 2023-02-27T07:34:08Z day: '01' department: - _id: VaKa doi: 10.1007/s40598-022-00198-y external_id: arxiv: - '2110.10750' intvolume: ' 8' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2110.10750 month: '10' oa: 1 oa_version: Preprint page: 411-422 publication: Arnold Mathematical Journal publication_identifier: eissn: - 2199-6806 issn: - 2199-6792 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: link: - relation: earlier_version url: https://conferences.cirm-math.fr/2383.html scopus_import: '1' status: public title: Open problems on billiards and geometric optics type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8 year: '2022' ... --- _id: '12677' abstract: - lang: eng text: "In modern sample-driven Prophet Inequality, an adversary chooses a sequence of n items with values v1,v2,…,vn to be presented to a decision maker (DM). The process follows in two phases. In the first phase (sampling phase), some items, possibly selected at random, are revealed to the DM, but she can never accept them. In the second phase, the DM is presented with the other items in a random order and online fashion. For each item, she must make an irrevocable decision to either accept the item and stop the process or reject the item forever and proceed to the next item. The goal of the DM is to maximize the expected value as compared to a Prophet (or offline algorithm) that has access to all information. In this setting, the sampling phase has no cost and is not part of the optimization process. However, in many scenarios, the samples are obtained as part of the decision-making process.\r\nWe model this aspect as a two-phase Prophet Inequality where an adversary chooses a sequence of 2n items with values v1,v2,…,v2n and the items are randomly ordered. Finally, there are two phases of the Prophet Inequality problem with the first n-items and the rest of the items, respectively. We show that some basic algorithms achieve a ratio of at most 0.450. We present an algorithm that achieves a ratio of at least 0.495. Finally, we show that for every algorithm the ratio it can achieve is at most 0.502. Hence our algorithm is near-optimal." acknowledgement: This research was partially supported by the ERC CoG 863818 (ForM-SMArt) grant. article_number: '2209.14368' article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Mona full_name: Mohammadi, Mona id: 4363614d-b686-11ed-a7d5-ac9e4a24bc2e last_name: Mohammadi - first_name: Raimundo J full_name: Saona Urmeneta, Raimundo J id: BD1DF4C4-D767-11E9-B658-BC13E6697425 last_name: Saona Urmeneta orcid: 0000-0001-5103-038X citation: ama: Chatterjee K, Mohammadi M, Saona Urmeneta RJ. Repeated prophet inequality with near-optimal bounds. arXiv. doi:10.48550/ARXIV.2209.14368 apa: Chatterjee, K., Mohammadi, M., & Saona Urmeneta, R. J. (n.d.). Repeated prophet inequality with near-optimal bounds. arXiv. https://doi.org/10.48550/ARXIV.2209.14368 chicago: Chatterjee, Krishnendu, Mona Mohammadi, and Raimundo J Saona Urmeneta. “Repeated Prophet Inequality with Near-Optimal Bounds.” ArXiv, n.d. https://doi.org/10.48550/ARXIV.2209.14368. ieee: K. Chatterjee, M. Mohammadi, and R. J. Saona Urmeneta, “Repeated prophet inequality with near-optimal bounds,” arXiv. . ista: Chatterjee K, Mohammadi M, Saona Urmeneta RJ. Repeated prophet inequality with near-optimal bounds. arXiv, 2209.14368. mla: Chatterjee, Krishnendu, et al. “Repeated Prophet Inequality with Near-Optimal Bounds.” ArXiv, 2209.14368, doi:10.48550/ARXIV.2209.14368. short: K. Chatterjee, M. Mohammadi, R.J. Saona Urmeneta, ArXiv (n.d.). date_created: 2023-02-24T12:21:40Z date_published: 2022-09-28T00:00:00Z date_updated: 2023-02-27T10:07:40Z day: '28' department: - _id: GradSch - _id: KrCh doi: 10.48550/ARXIV.2209.14368 ec_funded: 1 external_id: arxiv: - '2209.14368' language: - iso: eng main_file_link: - open_access: '1' url: ' https://doi.org/10.48550/arXiv.2209.14368' month: '09' oa: 1 oa_version: Preprint project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' publication: arXiv publication_status: submitted status: public title: Repeated prophet inequality with near-optimal bounds type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '12780' abstract: - lang: eng text: "The ability to scale out training workloads has been one of the key performance enablers of deep learning. The main scaling approach is data-parallel GPU-based training, which has been boosted by hardware and software support for highly efficient point-to-point communication, and in particular via hardware bandwidth over-provisioning. Overprovisioning comes at a cost: there is an order of magnitude price difference between \"cloud-grade\" servers with such support, relative to their popular \"consumer-grade\" counterparts, although single server-grade and consumer-grade GPUs can have similar computational envelopes.\r\n\r\nIn this paper, we show that the costly hardware overprovisioning approach can be supplanted via algorithmic and system design, and propose a framework called CGX, which provides efficient software support for compressed communication in ML applications, for both multi-GPU single-node training, as well as larger-scale multi-node training. CGX is based on two technical advances: At the system level, it relies on a re-developed communication stack for ML frameworks, which provides flexible, highly-efficient support for compressed communication. At the application level, it provides seamless, parameter-free integration with popular frameworks, so that end-users do not have to modify training recipes, nor significant training code. This is complemented by a layer-wise adaptive compression technique which dynamically balances compression gains with accuracy preservation. CGX integrates with popular ML frameworks, providing up to 3X speedups for multi-GPU nodes based on commodity hardware, and order-of-magnitude improvements in the multi-node setting, with negligible impact on accuracy." acknowledgement: The authors sincerely thank Nikoli Dryden, Tal Ben-Nun, Torsten Hoefler and Bapi Chatterjee for useful discussions throughout the development of this project. article_processing_charge: Yes (via OA deal) author: - first_name: Ilia full_name: Markov, Ilia id: D0CF4148-C985-11E9-8066-0BDEE5697425 last_name: Markov - first_name: Hamidreza full_name: Ramezanikebrya, Hamidreza last_name: Ramezanikebrya - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X citation: ama: 'Markov I, Ramezanikebrya H, Alistarh D-A. CGX: Adaptive system support for communication-efficient deep learning. In: Proceedings of the 23rd ACM/IFIP International Middleware Conference. Association for Computing Machinery; 2022:241-254. doi:10.1145/3528535.3565248' apa: 'Markov, I., Ramezanikebrya, H., & Alistarh, D.-A. (2022). CGX: Adaptive system support for communication-efficient deep learning. In Proceedings of the 23rd ACM/IFIP International Middleware Conference (pp. 241–254). Quebec, QC, Canada: Association for Computing Machinery. https://doi.org/10.1145/3528535.3565248' chicago: 'Markov, Ilia, Hamidreza Ramezanikebrya, and Dan-Adrian Alistarh. “CGX: Adaptive System Support for Communication-Efficient Deep Learning.” In Proceedings of the 23rd ACM/IFIP International Middleware Conference, 241–54. Association for Computing Machinery, 2022. https://doi.org/10.1145/3528535.3565248.' ieee: 'I. Markov, H. Ramezanikebrya, and D.-A. Alistarh, “CGX: Adaptive system support for communication-efficient deep learning,” in Proceedings of the 23rd ACM/IFIP International Middleware Conference, Quebec, QC, Canada, 2022, pp. 241–254.' ista: 'Markov I, Ramezanikebrya H, Alistarh D-A. 2022. CGX: Adaptive system support for communication-efficient deep learning. Proceedings of the 23rd ACM/IFIP International Middleware Conference. Middleware: International Middleware Conference, 241–254.' mla: 'Markov, Ilia, et al. “CGX: Adaptive System Support for Communication-Efficient Deep Learning.” Proceedings of the 23rd ACM/IFIP International Middleware Conference, Association for Computing Machinery, 2022, pp. 241–54, doi:10.1145/3528535.3565248.' short: I. Markov, H. Ramezanikebrya, D.-A. Alistarh, in:, Proceedings of the 23rd ACM/IFIP International Middleware Conference, Association for Computing Machinery, 2022, pp. 241–254. conference: end_date: 2022-11-11 location: Quebec, QC, Canada name: 'Middleware: International Middleware Conference' start_date: 2022-11-07 date_created: 2023-03-31T06:17:00Z date_published: 2022-11-01T00:00:00Z date_updated: 2023-04-03T06:21:04Z day: '01' ddc: - '000' department: - _id: DaAl doi: 10.1145/3528535.3565248 external_id: arxiv: - '2111.08617' file: - access_level: open_access checksum: 1a397746235f245da5468819247ff663 content_type: application/pdf creator: dernst date_created: 2023-04-03T06:17:58Z date_updated: 2023-04-03T06:17:58Z file_id: '12795' file_name: 2022_ACMMiddleware_Markov.pdf file_size: 1514169 relation: main_file success: 1 file_date_updated: 2023-04-03T06:17:58Z has_accepted_license: '1' language: - iso: eng month: '11' oa: 1 oa_version: Published Version page: 241-254 publication: Proceedings of the 23rd ACM/IFIP International Middleware Conference publication_identifier: isbn: - '9781450393409' publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' status: public title: 'CGX: Adaptive system support for communication-efficient deep learning' 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: '2022' ... --- _id: '12860' abstract: - lang: eng text: 'Memorization of the relation between entities in a dataset can lead to privacy issues when using a trained model for question answering. We introduce Relational Memorization (RM) to understand, quantify and control this phenomenon. While bounding general memorization can have detrimental effects on the performance of a trained model, bounding RM does not prevent effective learning. The difference is most pronounced when the data distribution is long-tailed, with many queries having only few training examples: Impeding general memorization prevents effective learning, while impeding only relational memorization still allows learning general properties of the underlying concepts. We formalize the notion of Relational Privacy (RP) and, inspired by Differential Privacy (DP), we provide a possible definition of Differential Relational Privacy (DrP). These notions can be used to describe and compute bounds on the amount of RM in a trained model. We illustrate Relational Privacy concepts in experiments with large-scale models for Question Answering.' article_number: '2203.16701' article_processing_charge: No author: - first_name: Simone full_name: Bombari, Simone id: ca726dda-de17-11ea-bc14-f9da834f63aa last_name: Bombari - first_name: Alessandro full_name: Achille, Alessandro last_name: Achille - first_name: Zijian full_name: Wang, Zijian last_name: Wang - first_name: Yu-Xiang full_name: Wang, Yu-Xiang last_name: Wang - first_name: Yusheng full_name: Xie, Yusheng last_name: Xie - first_name: Kunwar Yashraj full_name: Singh, Kunwar Yashraj last_name: Singh - first_name: Srikar full_name: Appalaraju, Srikar last_name: Appalaraju - first_name: Vijay full_name: Mahadevan, Vijay last_name: Mahadevan - first_name: Stefano full_name: Soatto, Stefano last_name: Soatto citation: ama: Bombari S, Achille A, Wang Z, et al. Towards differential relational privacy and its use in question answering. arXiv. doi:10.48550/arXiv.2203.16701 apa: Bombari, S., Achille, A., Wang, Z., Wang, Y.-X., Xie, Y., Singh, K. Y., … Soatto, S. (n.d.). Towards differential relational privacy and its use in question answering. arXiv. https://doi.org/10.48550/arXiv.2203.16701 chicago: Bombari, Simone, Alessandro Achille, Zijian Wang, Yu-Xiang Wang, Yusheng Xie, Kunwar Yashraj Singh, Srikar Appalaraju, Vijay Mahadevan, and Stefano Soatto. “Towards Differential Relational Privacy and Its Use in Question Answering.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2203.16701. ieee: S. Bombari et al., “Towards differential relational privacy and its use in question answering,” arXiv. . ista: Bombari S, Achille A, Wang Z, Wang Y-X, Xie Y, Singh KY, Appalaraju S, Mahadevan V, Soatto S. Towards differential relational privacy and its use in question answering. arXiv, 2203.16701. mla: Bombari, Simone, et al. “Towards Differential Relational Privacy and Its Use in Question Answering.” ArXiv, 2203.16701, doi:10.48550/arXiv.2203.16701. short: S. Bombari, A. Achille, Z. Wang, Y.-X. Wang, Y. Xie, K.Y. Singh, S. Appalaraju, V. Mahadevan, S. Soatto, ArXiv (n.d.). date_created: 2023-04-23T16:11:48Z date_published: 2022-03-30T00:00:00Z date_updated: 2023-04-25T07:34:49Z day: '30' department: - _id: GradSch - _id: MaMo doi: 10.48550/arXiv.2203.16701 external_id: arxiv: - '2203.16701' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2203.16701 month: '03' oa: 1 oa_version: Preprint publication: arXiv publication_status: submitted status: public title: Towards differential relational privacy and its use in question answering type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '10788' abstract: - lang: eng text: "We determine an asymptotic formula for the number of integral points of\r\nbounded height on a certain toric variety, which is incompatible with part of a\r\npreprint by Chambert-Loir and Tschinkel. We provide an alternative\r\ninterpretation of the asymptotic formula we get. To do so, we construct an\r\nanalogue of Peyre's constant $\\alpha$ and describe its relation to a new\r\nobstruction to the Zariski density of integral points in certain regions of\r\nvarieties." acknowledgement: "Part of this work was conducted as a guest at the Institut de Mathématiques de Jussieu–Paris Rive Gauche invited by Antoine Chambert-Loir and funded by DAAD.\r\nDuring this time, I had interesting and fruitful discussions on the interpretation of the result for\r\nthe toric variety discussed in Section 3 with Antoine Chambert-Loir. I wish to thank him for these\r\nopportunities and for his useful remarks on earlier versions of this article. This work was partly\r\nfunded by FWF grant P 32428-N35." article_number: '2202.10909' article_processing_charge: No author: - first_name: Florian Alexander full_name: Wilsch, Florian Alexander id: 560601DA-8D36-11E9-A136-7AC1E5697425 last_name: Wilsch orcid: 0000-0001-7302-8256 citation: ama: Wilsch FA. Integral points of bounded height on a certain toric variety. arXiv. doi:10.48550/arXiv.2202.10909 apa: Wilsch, F. A. (n.d.). Integral points of bounded height on a certain toric variety. arXiv. https://doi.org/10.48550/arXiv.2202.10909 chicago: Wilsch, Florian Alexander. “Integral Points of Bounded Height on a Certain Toric Variety.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2202.10909. ieee: F. A. Wilsch, “Integral points of bounded height on a certain toric variety,” arXiv. . ista: Wilsch FA. Integral points of bounded height on a certain toric variety. arXiv, 2202.10909. mla: Wilsch, Florian Alexander. “Integral Points of Bounded Height on a Certain Toric Variety.” ArXiv, 2202.10909, doi:10.48550/arXiv.2202.10909. short: F.A. Wilsch, ArXiv (n.d.). date_created: 2022-02-23T09:04:43Z date_published: 2022-02-22T00:00:00Z date_updated: 2023-05-03T07:46:35Z day: '22' department: - _id: TiBr doi: 10.48550/arXiv.2202.10909 external_id: arxiv: - '2202.10909' keyword: - Integral point - toric variety - Manin's conjecture language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2202.10909 month: '02' oa: 1 oa_version: Preprint project: - _id: 26AEDAB2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P32428 name: New frontiers of the Manin conjecture publication: arXiv publication_status: submitted status: public title: Integral points of bounded height on a certain toric variety type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '11839' abstract: - lang: eng text: "It is a highly desirable property for deep networks to be robust against\r\nsmall input changes. One popular way to achieve this property is by designing\r\nnetworks with a small Lipschitz constant. In this work, we propose a new\r\ntechnique for constructing such Lipschitz networks that has a number of\r\ndesirable properties: it can be applied to any linear network layer\r\n(fully-connected or convolutional), it provides formal guarantees on the\r\nLipschitz constant, it is easy to implement and efficient to run, and it can be\r\ncombined with any training objective and optimization method. In fact, our\r\ntechnique is the first one in the literature that achieves all of these\r\nproperties simultaneously. Our main contribution is a rescaling-based weight\r\nmatrix parametrization that guarantees each network layer to have a Lipschitz\r\nconstant of at most 1 and results in the learned weight matrices to be close to\r\northogonal. Hence we call such layers almost-orthogonal Lipschitz (AOL).\r\nExperiments and ablation studies in the context of image classification with\r\ncertified robust accuracy confirm that AOL layers achieve results that are on\r\npar with most existing methods. Yet, they are simpler to implement and more\r\nbroadly applicable, because they do not require computationally expensive\r\nmatrix orthogonalization or inversion steps as part of the network\r\narchitecture. We provide code at https://github.com/berndprach/AOL." alternative_title: - LNCS article_processing_charge: No 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. Almost-orthogonal layers for efficient general-purpose Lipschitz networks. In: Computer Vision – ECCV 2022. Vol 13681. Springer Nature; 2022:350-365. doi:10.1007/978-3-031-19803-8_21' apa: 'Prach, B., & Lampert, C. (2022). Almost-orthogonal layers for efficient general-purpose Lipschitz networks. In Computer Vision – ECCV 2022 (Vol. 13681, pp. 350–365). Tel Aviv, Israel: Springer Nature. https://doi.org/10.1007/978-3-031-19803-8_21' chicago: Prach, Bernd, and Christoph Lampert. “Almost-Orthogonal Layers for Efficient General-Purpose Lipschitz Networks.” In Computer Vision – ECCV 2022, 13681:350–65. Springer Nature, 2022. https://doi.org/10.1007/978-3-031-19803-8_21. ieee: B. Prach and C. Lampert, “Almost-orthogonal layers for efficient general-purpose Lipschitz networks,” in Computer Vision – ECCV 2022, Tel Aviv, Israel, 2022, vol. 13681, pp. 350–365. ista: 'Prach B, Lampert C. 2022. Almost-orthogonal layers for efficient general-purpose Lipschitz networks. Computer Vision – ECCV 2022. ECCV: European Conference on Computer Vision, LNCS, vol. 13681, 350–365.' mla: Prach, Bernd, and Christoph Lampert. “Almost-Orthogonal Layers for Efficient General-Purpose Lipschitz Networks.” Computer Vision – ECCV 2022, vol. 13681, Springer Nature, 2022, pp. 350–65, doi:10.1007/978-3-031-19803-8_21. short: B. Prach, C. Lampert, in:, Computer Vision – ECCV 2022, Springer Nature, 2022, pp. 350–365. conference: end_date: 2022-10-27 location: Tel Aviv, Israel name: 'ECCV: European Conference on Computer Vision' start_date: 2022-10-23 date_created: 2022-08-12T15:09:47Z date_published: 2022-10-23T00:00:00Z date_updated: 2023-05-03T08:00:46Z day: '23' department: - _id: GradSch - _id: ChLa doi: 10.1007/978-3-031-19803-8_21 external_id: arxiv: - '2208.03160' intvolume: ' 13681' language: - iso: eng main_file_link: - open_access: '1' url: ' https://doi.org/10.48550/arXiv.2208.03160' month: '10' oa: 1 oa_version: Preprint page: 350-365 publication: Computer Vision – ECCV 2022 publication_identifier: eisbn: - '9783031198038' isbn: - '9783031198021' publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Almost-orthogonal layers for efficient general-purpose Lipschitz networks type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 13681 year: '2022' ... --- _id: '12894' acknowledgement: "The abstracts in this booklet are licenced under a CC BY 4.0 licence (https://creativecommons.org/licenses/by/4.0/legalcode), except Markus Wallerberger’s contribution at page 21, licenced under a CC BY-SA 4.0 licence (https://creativecommons.org/licenses/by-sa/4.0/legalcode).\r\n" article_processing_charge: No author: - first_name: Alois full_name: Schlögl, Alois id: 45BF87EE-F248-11E8-B48F-1D18A9856A87 last_name: Schlögl orcid: 0000-0002-5621-8100 - first_name: Andrei full_name: Hornoiu, Andrei id: 77129392-B450-11EA-8745-D4653DDC885E last_name: Hornoiu - first_name: Stefano full_name: Elefante, Stefano id: 490F40CE-F248-11E8-B48F-1D18A9856A87 last_name: Elefante - first_name: Stephan full_name: Stadlbauer, Stephan id: 4D0BC184-F248-11E8-B48F-1D18A9856A87 last_name: Stadlbauer citation: ama: 'Schlögl A, Hornoiu A, Elefante S, Stadlbauer S. Where is the sweet spot? A procurement story of general purpose compute nodes. In: ASHPC22 - Austrian-Slovenian HPC Meeting 2022. EuroCC Austria c/o Universität Wien; 2022:7. doi:10.25365/phaidra.337' apa: 'Schlögl, A., Hornoiu, A., Elefante, S., & Stadlbauer, S. (2022). Where is the sweet spot? A procurement story of general purpose compute nodes. In ASHPC22 - Austrian-Slovenian HPC Meeting 2022 (p. 7). Grundlsee, Austria: EuroCC Austria c/o Universität Wien. https://doi.org/10.25365/phaidra.337' chicago: Schlögl, Alois, Andrei Hornoiu, Stefano Elefante, and Stephan Stadlbauer. “Where Is the Sweet Spot? A Procurement Story of General Purpose Compute Nodes.” In ASHPC22 - Austrian-Slovenian HPC Meeting 2022, 7. EuroCC Austria c/o Universität Wien, 2022. https://doi.org/10.25365/phaidra.337. ieee: A. Schlögl, A. Hornoiu, S. Elefante, and S. Stadlbauer, “Where is the sweet spot? A procurement story of general purpose compute nodes,” in ASHPC22 - Austrian-Slovenian HPC Meeting 2022, Grundlsee, Austria, 2022, p. 7. ista: 'Schlögl A, Hornoiu A, Elefante S, Stadlbauer S. 2022. Where is the sweet spot? A procurement story of general purpose compute nodes. ASHPC22 - Austrian-Slovenian HPC Meeting 2022. ASHPC: Austrian-Slovenian HPC Meeting, 7.' mla: Schlögl, Alois, et al. “Where Is the Sweet Spot? A Procurement Story of General Purpose Compute Nodes.” ASHPC22 - Austrian-Slovenian HPC Meeting 2022, EuroCC Austria c/o Universität Wien, 2022, p. 7, doi:10.25365/phaidra.337. short: A. Schlögl, A. Hornoiu, S. Elefante, S. Stadlbauer, in:, ASHPC22 - Austrian-Slovenian HPC Meeting 2022, EuroCC Austria c/o Universität Wien, 2022, p. 7. conference: end_date: 2022-06-02 location: Grundlsee, Austria name: 'ASHPC: Austrian-Slovenian HPC Meeting' start_date: 2022-05-31 date_created: 2023-05-05T09:13:42Z date_published: 2022-06-02T00:00:00Z date_updated: 2023-05-16T07:42:56Z day: '02' ddc: - '000' department: - _id: ScienComp doi: 10.25365/phaidra.337 file: - access_level: open_access checksum: e3f8c240b85422ce2190e7b203cc2563 content_type: application/pdf creator: schloegl date_created: 2023-05-05T09:06:00Z date_updated: 2023-05-05T09:06:00Z file_id: '12895' file_name: BOOKLET_ASHPC22.pdf file_size: 7180531 relation: main_file success: 1 file_date_updated: 2023-05-05T09:06:00Z has_accepted_license: '1' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: '7' publication: ASHPC22 - Austrian-Slovenian HPC Meeting 2022 publication_identifier: isbn: - 978-3-200-08499-5 publication_status: published publisher: EuroCC Austria c/o Universität Wien status: public title: Where is the sweet spot? A procurement story of general purpose compute nodes 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_abstract user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '11336' abstract: - lang: eng text: The generation of a correctly-sized cerebral cortex with all-embracing neuronal and glial cell-type diversity critically depends on faithful radial glial progenitor (RGP) cell proliferation/differentiation programs. Temporal RGP lineage progression is regulated by Polycomb Repressive Complex 2 (PRC2) and loss of PRC2 activity results in severe neurogenesis defects and microcephaly. How PRC2-dependent gene expression instructs RGP lineage progression is unknown. Here we utilize Mosaic Analysis with Double Markers (MADM)-based single cell technology and demonstrate that PRC2 is not cell-autonomously required in neurogenic RGPs but rather acts at the global tissue-wide level. Conversely, cortical astrocyte production and maturation is cell-autonomously controlled by PRC2-dependent transcriptional regulation. We thus reveal highly distinct and sequential PRC2 functions in RGP lineage progression that are dependent on complex interplays between intrinsic and tissue-wide properties. In a broader context our results imply a critical role for the genetic and cellular niche environment in neural stem cell behavior. acknowledged_ssus: - _id: PreCl - _id: Bio - _id: LifeSc acknowledgement: We thank A. Heger (IST Austria Preclinical Facility), A. Sommer and C. Czepe (VBCF GmbH, NGS Unit) and S. Gharagozlou for technical support. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by the Imaging & Optics Facility (IOF), Lab Support Facility (LSF), and Preclinical Facility (PCF). N.A. received funding from the FWF Firnberg-Programm (T 1031). The work was supported by IST institutional funds and by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement 725780 LinPro) to S.H. article_number: abq1263 article_processing_charge: No article_type: original author: - first_name: Nicole full_name: Amberg, Nicole id: 4CD6AAC6-F248-11E8-B48F-1D18A9856A87 last_name: Amberg orcid: 0000-0002-3183-8207 - first_name: Florian full_name: Pauler, Florian id: 48EA0138-F248-11E8-B48F-1D18A9856A87 last_name: Pauler - first_name: Carmen full_name: Streicher, Carmen id: 36BCB99C-F248-11E8-B48F-1D18A9856A87 last_name: Streicher - first_name: Simon full_name: Hippenmeyer, Simon id: 37B36620-F248-11E8-B48F-1D18A9856A87 last_name: Hippenmeyer orcid: 0000-0003-2279-1061 citation: ama: Amberg N, Pauler F, Streicher C, Hippenmeyer S. Tissue-wide genetic and cellular landscape shapes the execution of sequential PRC2 functions in neural stem cell lineage progression. Science Advances. 2022;8(44). doi:10.1126/sciadv.abq1263 apa: Amberg, N., Pauler, F., Streicher, C., & Hippenmeyer, S. (2022). Tissue-wide genetic and cellular landscape shapes the execution of sequential PRC2 functions in neural stem cell lineage progression. Science Advances. American Association for the Advancement of Science. https://doi.org/10.1126/sciadv.abq1263 chicago: Amberg, Nicole, Florian Pauler, Carmen Streicher, and Simon Hippenmeyer. “Tissue-Wide Genetic and Cellular Landscape Shapes the Execution of Sequential PRC2 Functions in Neural Stem Cell Lineage Progression.” Science Advances. American Association for the Advancement of Science, 2022. https://doi.org/10.1126/sciadv.abq1263. ieee: N. Amberg, F. Pauler, C. Streicher, and S. Hippenmeyer, “Tissue-wide genetic and cellular landscape shapes the execution of sequential PRC2 functions in neural stem cell lineage progression,” Science Advances, vol. 8, no. 44. American Association for the Advancement of Science, 2022. ista: Amberg N, Pauler F, Streicher C, Hippenmeyer S. 2022. Tissue-wide genetic and cellular landscape shapes the execution of sequential PRC2 functions in neural stem cell lineage progression. Science Advances. 8(44), abq1263. mla: Amberg, Nicole, et al. “Tissue-Wide Genetic and Cellular Landscape Shapes the Execution of Sequential PRC2 Functions in Neural Stem Cell Lineage Progression.” Science Advances, vol. 8, no. 44, abq1263, American Association for the Advancement of Science, 2022, doi:10.1126/sciadv.abq1263. short: N. Amberg, F. Pauler, C. Streicher, S. Hippenmeyer, Science Advances 8 (2022). date_created: 2022-04-26T15:04:50Z date_published: 2022-11-01T00:00:00Z date_updated: 2023-05-31T12:24:10Z day: '01' ddc: - '570' department: - _id: SiHi doi: 10.1126/sciadv.abq1263 ec_funded: 1 file: - access_level: open_access checksum: 0117023e188542082ca6693cf39e7f03 content_type: application/pdf creator: patrickd date_created: 2023-03-21T14:18:10Z date_updated: 2023-03-21T14:18:10Z file_id: '12742' file_name: sciadv.abq1263.pdf file_size: 2973998 relation: main_file success: 1 file_date_updated: 2023-03-21T14:18:10Z has_accepted_license: '1' intvolume: ' 8' issue: '44' language: - iso: eng month: '11' oa: 1 oa_version: Published Version project: - _id: 260018B0-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '725780' name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development - _id: 268F8446-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: T0101031 name: Role of Eed in neural stem cell lineage progression publication: Science Advances publication_identifier: issn: - 2375-2548 publication_status: published publisher: American Association for the Advancement of Science quality_controlled: '1' related_material: link: - description: News on ISTA website relation: press_release url: https://ista.ac.at/en/news/whole-tissue-shapes-brain-development/ scopus_import: '1' status: public title: Tissue-wide genetic and cellular landscape shapes the execution of sequential PRC2 functions in neural stem cell lineage progression 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8 year: '2022' ... --- _id: '11442' abstract: - lang: eng text: "Enabling additive manufacturing to employ a wide range of novel, functional materials can be a major boost to this technology. However, making such materials printable requires painstaking trial-and-error by an expert operator,\r\nas they typically tend to exhibit peculiar rheological or hysteresis properties. Even in the case of successfully finding the process parameters, there is no guarantee of print-to-print consistency due to material differences between batches. These challenges make closed-loop feedback an attractive option where the process parameters are adjusted on-the-fly. There are several challenges for designing an efficient controller: the deposition parameters are complex and highly coupled, artifacts occur after long time horizons, simulating the deposition is computationally costly, and learning on hardware is intractable. In this work, we demonstrate the feasibility of learning a closed-loop control policy for additive manufacturing using reinforcement learning. We show that approximate, but efficient, numerical simulation is\r\nsufficient as long as it allows learning the behavioral patterns of deposition that translate to real-world experiences. In combination with reinforcement learning, our model can be used to discover control policies that outperform\r\nbaseline controllers. Furthermore, the recovered policies have a minimal sim-to-real gap. We showcase this by applying our control policy in-vivo on a single-layer, direct ink writing printer. " acknowledgement: "This work is graciously supported by the following grant agencies: FWF Lise Meitner (Grant M 3319), SNSF (Grant 200502), ERC Starting Grant (MATERIALIZABLE-715767), NSF (Grant IIS-181507).\r\n" article_number: '112' article_processing_charge: No article_type: original author: - first_name: Michael full_name: Piovarci, Michael id: 62E473F4-5C99-11EA-A40E-AF823DDC885E last_name: Piovarci - first_name: Michael full_name: Foshey, Michael last_name: Foshey - first_name: Jie full_name: Xu, Jie last_name: Xu - first_name: Timothy full_name: Erps, Timothy last_name: Erps - first_name: Vahid full_name: Babaei, Vahid last_name: Babaei - first_name: Piotr full_name: Didyk, Piotr last_name: Didyk - first_name: Szymon full_name: Rusinkiewicz, Szymon last_name: Rusinkiewicz - first_name: Wojciech full_name: Matusik, Wojciech last_name: Matusik - first_name: Bernd full_name: Bickel, Bernd id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 citation: ama: Piovarci M, Foshey M, Xu J, et al. Closed-loop control of direct ink writing via reinforcement learning. ACM Transactions on Graphics. 2022;41(4). doi:10.1145/3528223.3530144 apa: Piovarci, M., Foshey, M., Xu, J., Erps, T., Babaei, V., Didyk, P., … Bickel, B. (2022). Closed-loop control of direct ink writing via reinforcement learning. ACM Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/3528223.3530144 chicago: Piovarci, Michael, Michael Foshey, Jie Xu, Timothy Erps, Vahid Babaei, Piotr Didyk, Szymon Rusinkiewicz, Wojciech Matusik, and Bernd Bickel. “Closed-Loop Control of Direct Ink Writing via Reinforcement Learning.” ACM Transactions on Graphics. Association for Computing Machinery, 2022. https://doi.org/10.1145/3528223.3530144. ieee: M. Piovarci et al., “Closed-loop control of direct ink writing via reinforcement learning,” ACM Transactions on Graphics, vol. 41, no. 4. Association for Computing Machinery, 2022. ista: Piovarci M, Foshey M, Xu J, Erps T, Babaei V, Didyk P, Rusinkiewicz S, Matusik W, Bickel B. 2022. Closed-loop control of direct ink writing via reinforcement learning. ACM Transactions on Graphics. 41(4), 112. mla: Piovarci, Michael, et al. “Closed-Loop Control of Direct Ink Writing via Reinforcement Learning.” ACM Transactions on Graphics, vol. 41, no. 4, 112, Association for Computing Machinery, 2022, doi:10.1145/3528223.3530144. short: M. Piovarci, M. Foshey, J. Xu, T. Erps, V. Babaei, P. Didyk, S. Rusinkiewicz, W. Matusik, B. Bickel, ACM Transactions on Graphics 41 (2022). date_created: 2022-06-10T06:41:47Z date_published: 2022-06-01T00:00:00Z date_updated: 2023-05-31T12:38:21Z day: '01' ddc: - '000' department: - _id: BeBi doi: 10.1145/3528223.3530144 ec_funded: 1 external_id: arxiv: - '2201.11819' file: - access_level: open_access checksum: 27f6fe41c6ff84d50445cc9b0176d45b content_type: application/pdf creator: dernst date_created: 2022-06-28T08:32:58Z date_updated: 2022-06-28T08:32:58Z file_id: '11467' file_name: 2022_ACM_acceptedversion_Piovarci.pdf file_size: 33994829 relation: main_file success: 1 file_date_updated: 2022-06-28T08:32:58Z has_accepted_license: '1' intvolume: ' 41' issue: '4' language: - iso: eng month: '06' oa: 1 oa_version: Submitted Version project: - _id: eb901961-77a9-11ec-83b8-f5c883a62027 grant_number: M03319 name: Perception-Aware Appearance Fabrication - _id: 24F9549A-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '715767' name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling' publication: ACM Transactions on Graphics publication_identifier: eissn: - 1557-7368 issn: - 0730-0301 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' related_material: link: - description: News on ISTA website relation: press_release url: https://ista.ac.at/en/news/machine-learning-3d-printing-fluids/ status: public title: Closed-loop control of direct ink writing via reinforcement learning 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 41 year: '2022' ... --- _id: '11844' abstract: - lang: eng text: "In the stochastic population protocol model, we are given a connected graph with n nodes, and in every time step, a scheduler samples an edge of the graph uniformly at random and the nodes connected by this edge interact. A fundamental task in this model is stable leader election, in which all nodes start in an identical state and the aim is to reach a configuration in which (1) exactly one node is elected as leader and (2) this node remains as the unique leader no matter what sequence of interactions follows. On cliques, the complexity of this problem has recently been settled: time-optimal protocols stabilize in Θ(n log n) expected steps using Θ(log log n) states, whereas protocols that use O(1) states require Θ(n2) expected steps.\r\n\r\nIn this work, we investigate the complexity of stable leader election on general graphs. We provide the first non-trivial time lower bounds for leader election on general graphs, showing that, when moving beyond cliques, the complexity landscape of leader election becomes very diverse: the time required to elect a leader can range from O(1) to Θ(n3) expected steps. On the upper bound side, we first observe that there exists a protocol that is time-optimal on many graph families, but uses polynomially-many states. In contrast, we give a near-time-optimal protocol that uses only O(log2n) states that is at most a factor log n slower. Finally, we show that the constant-state protocol of Beauquier et al. [OPODIS 2013] is at most a factor n log n slower than the fast polynomial-state protocol. Moreover, among constant-state protocols, this protocol has near-optimal average case complexity on dense random graphs." acknowledgement: We thank the anonymous reviewers for their helpful comments. We gratefully acknowledge funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). article_processing_charge: Yes (via OA deal) author: - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X - first_name: Joel full_name: Rybicki, Joel id: 334EFD2E-F248-11E8-B48F-1D18A9856A87 last_name: Rybicki orcid: 0000-0002-6432-6646 - first_name: Sasha full_name: Voitovych, Sasha last_name: Voitovych citation: ama: 'Alistarh D-A, Rybicki J, Voitovych S. Near-optimal leader election in population protocols on graphs. In: Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2022:246-256. doi:10.1145/3519270.3538435' apa: 'Alistarh, D.-A., Rybicki, J., & Voitovych, S. (2022). Near-optimal leader election in population protocols on graphs. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (pp. 246–256). Salerno, Italy: Association for Computing Machinery. https://doi.org/10.1145/3519270.3538435' chicago: Alistarh, Dan-Adrian, Joel Rybicki, and Sasha Voitovych. “Near-Optimal Leader Election in Population Protocols on Graphs.” In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, 246–56. Association for Computing Machinery, 2022. https://doi.org/10.1145/3519270.3538435. ieee: D.-A. Alistarh, J. Rybicki, and S. Voitovych, “Near-optimal leader election in population protocols on graphs,” in Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Salerno, Italy, 2022, pp. 246–256. ista: 'Alistarh D-A, Rybicki J, Voitovych S. 2022. Near-optimal leader election in population protocols on graphs. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 246–256.' mla: Alistarh, Dan-Adrian, et al. “Near-Optimal Leader Election in Population Protocols on Graphs.” Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2022, pp. 246–56, doi:10.1145/3519270.3538435. short: D.-A. Alistarh, J. Rybicki, S. Voitovych, in:, Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2022, pp. 246–256. conference: end_date: 2022-07-29 location: Salerno, Italy name: 'PODC: Symposium on Principles of Distributed Computing' start_date: 2022-07-25 date_created: 2022-08-14T22:01:46Z date_published: 2022-07-21T00:00:00Z date_updated: 2023-06-14T12:06:01Z day: '21' ddc: - '000' department: - _id: DaAl doi: 10.1145/3519270.3538435 ec_funded: 1 external_id: arxiv: - '2205.12597' file: - access_level: open_access checksum: 4c6b29172b8e355b4fbc364a2e0827b2 content_type: application/pdf creator: cchlebak date_created: 2022-08-16T08:05:15Z date_updated: 2022-08-16T08:05:15Z file_id: '11854' file_name: 2022_PODC_Alistarh.pdf file_size: 1593474 relation: main_file success: 1 file_date_updated: 2022-08-16T08:05:15Z has_accepted_license: '1' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 246-256 project: - _id: 268A44D6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '805223' name: Elastic Coordination for Scalable Machine Learning publication: Proceedings of the Annual ACM Symposium on Principles of Distributed Computing publication_identifier: isbn: - '9781450392624' publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: Near-optimal leader election in population protocols 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '11777' abstract: - lang: eng text: "In this dissertation we study coboundary expansion of simplicial complex with a view of giving geometric applications.\r\nOur main novel tool is an equivariant version of Gromov's celebrated Topological Overlap Theorem. The equivariant topological overlap theorem leads to various geometric applications including a quantitative non-embeddability result for sufficiently thick buildings (which partially resolves a conjecture of Tancer and Vorwerk) and an improved lower bound on the pair-crossing number of (bounded degree) expander graphs. Additionally, we will give new proofs for several known lower bounds for geometric problems such as the number of Tverberg partitions or the crossing number of complete bipartite graphs.\r\nFor the aforementioned applications one is naturally lead to study expansion properties of joins of simplicial complexes. In the presence of a special certificate for expansion (as it is the case, e.g., for spherical buildings), the join of two expanders is an expander. On the flip-side, we report quite some evidence that coboundary expansion exhibits very non-product-like behaviour under taking joins. For instance, we exhibit infinite families of graphs $(G_n)_{n\\in \\mathbb{N}}$ and $(H_n)_{n\\in\\mathbb{N}}$ whose join $G_n*H_n$ has expansion of lower order than the product of the expansion constant of the graphs. Moreover, we show an upper bound of $(d+1)/2^d$ on the normalized coboundary expansion constants for the complete multipartite complex $[n]^{*(d+1)}$ (under a mild divisibility condition on $n$).\r\nVia the probabilistic method the latter result extends to an upper bound of $(d+1)/2^d+\\varepsilon$ on the coboundary expansion constant of the spherical building associated with $\\mathrm{PGL}_{d+2}(\\mathbb{F}_q)$ for any $\\varepsilon>0$ and sufficiently large $q=q(\\varepsilon)$. This disproves a conjecture of Lubotzky, Meshulam and Mozes -- in a rather strong sense.\r\nBy improving on existing lower bounds we make further progress towards closing the gap between the known lower and upper bounds on the coboundary expansion constants of $[n]^{*(d+1)}$. The best improvements we achieve using computer-aided proofs and flag algebras. The exact value even for the complete $3$-partite $2$-dimensional complex $[n]^{*3}$ remains unknown but we are happy to conjecture a precise value for every $n$. %Moreover, we show that a previously shown lower bound on the expansion constant of the spherical building associated with $\\mathrm{PGL}_{2}(\\mathbb{F}_q)$ is not tight.\r\nIn a loosely structured, last chapter of this thesis we collect further smaller observations related to expansion. We point out a link between discrete Morse theory and a technique for showing coboundary expansion, elaborate a bit on the hardness of computing coboundary expansion constants, propose a new criterion for coboundary expansion (in a very dense setting) and give one way of making the folklore result that expansion of links is a necessary condition for a simplicial complex to be an expander precise." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Pascal full_name: Wild, Pascal id: 4C20D868-F248-11E8-B48F-1D18A9856A87 last_name: Wild citation: ama: Wild P. High-dimensional expansion and crossing numbers of simplicial complexes. 2022. doi:10.15479/at:ista:11777 apa: Wild, P. (2022). High-dimensional expansion and crossing numbers of simplicial complexes. Institute of Science and Technology. https://doi.org/10.15479/at:ista:11777 chicago: Wild, Pascal. “High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes.” Institute of Science and Technology, 2022. https://doi.org/10.15479/at:ista:11777. ieee: P. Wild, “High-dimensional expansion and crossing numbers of simplicial complexes,” Institute of Science and Technology, 2022. ista: Wild P. 2022. High-dimensional expansion and crossing numbers of simplicial complexes. Institute of Science and Technology. mla: Wild, Pascal. High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes. Institute of Science and Technology, 2022, doi:10.15479/at:ista:11777. short: P. Wild, High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes, Institute of Science and Technology, 2022. date_created: 2022-08-10T15:51:19Z date_published: 2022-08-11T00:00:00Z date_updated: 2023-06-22T09:56:36Z day: '11' ddc: - '500' - '516' - '514' degree_awarded: PhD department: - _id: GradSch - _id: UlWa doi: 10.15479/at:ista:11777 ec_funded: 1 file: - access_level: open_access checksum: f5f3af1fb7c8a24b71ddc88ad7f7c5b4 content_type: text/x-python creator: pwild date_created: 2022-08-10T15:34:04Z date_updated: 2022-08-10T15:34:04Z description: Code for computer-assisted proofs in Section 8.4.7 in Thesis file_id: '11780' file_name: flags.py file_size: 16828 relation: supplementary_material - access_level: open_access checksum: 1f7c12dfe3bdaa9b147e4fbc3d34e3d5 content_type: text/x-c++src creator: pwild date_created: 2022-08-10T15:34:10Z date_updated: 2022-08-10T15:34:10Z description: Code for proof of Lemma 8.20 in Thesis file_id: '11781' file_name: lowerbound.cpp file_size: 12226 relation: supplementary_material - access_level: open_access checksum: 4cf81455c49e5dec3b9b2e3980137eeb content_type: text/x-python creator: pwild date_created: 2022-08-10T15:34:17Z date_updated: 2022-08-10T15:34:17Z description: Code for proof of Proposition 7.9 in Thesis file_id: '11782' file_name: upperbound.py file_size: 3240 relation: supplementary_material - access_level: open_access checksum: 4e96575b10cbe4e0d0db2045b2847774 content_type: application/pdf creator: pwild date_created: 2022-08-11T16:08:33Z date_updated: 2022-08-11T16:08:33Z file_id: '11809' file_name: finalthesisPascalWildPDFA.pdf file_size: 5086282 relation: main_file title: High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes - access_level: closed checksum: 92d94842a1fb6dca5808448137573b2e content_type: application/zip creator: pwild date_created: 2022-08-11T16:09:19Z date_updated: 2022-08-11T16:09:19Z file_id: '11810' file_name: ThesisSubmission.zip file_size: 18150068 relation: source_file file_date_updated: 2022-08-11T16:09:19Z has_accepted_license: '1' language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: '170' project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication_identifier: isbn: - 978-3-99078-021-3 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology status: public supervisor: - first_name: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 title: High-dimensional expansion and crossing numbers of simplicial complexes type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2022' ... --- _id: '11128' abstract: - lang: eng text: "Although we often see studies focusing on simple or even discrete traits in studies of colouration,\r\nthe variation of “appearance” phenotypes found in nature is often more complex, continuous\r\nand high-dimensional. Therefore, we developed automated methods suitable for large datasets\r\nof genomes and images, striving to account for their complex nature, while minimising human\r\nbias. We used these methods on a dataset of more than 20, 000 plant SNP genomes and\r\ncorresponding fower images from a hybrid zone of two subspecies of Antirrhinum majus with\r\ndistinctly coloured fowers to improve our understanding of the genetic nature of the fower\r\ncolour in our study system.\r\nFirstly, we use the advantage of large numbers of genotyped plants to estimate the haplotypes in\r\nthe main fower colour regulating region. We study colour- and geography-related characteristics\r\nof the estimated haplotypes and how they connect to their relatedness. We show discrepancies\r\nfrom the expected fower colour distributions given the genotype and identify particular\r\nhaplotypes leading to unexpected phenotypes. We also confrm a signifcant defcit of the\r\ndouble recessive recombinant and quite surprisingly, we show that haplotypes of the most\r\nfrequent parental type are much less variable than others.\r\nSecondly, we introduce our pipeline capable of processing tens of thousands of full fower\r\nimages without human interaction and summarising each image into a set of informative scores.\r\nWe show the compatibility of these machine-measured fower colour scores with the previously\r\nused manual scores and study impact of external efect on the resulting scores. Finally, we use\r\nthe machine-measured fower colour scores to ft and examine a phenotype cline across the\r\nhybrid zone in Planoles using full fower images as opposed to discrete, manual scores and\r\ncompare it with the genotypic cline." acknowledged_ssus: - _id: ScienComp - _id: Bio alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Lenka full_name: Matejovicova, Lenka id: 2DFDEC72-F248-11E8-B48F-1D18A9856A87 last_name: Matejovicova citation: ama: Matejovicova L. Genetic basis of flower colour as a model for adaptive evolution. 2022. doi:10.15479/at:ista:11128 apa: Matejovicova, L. (2022). Genetic basis of flower colour as a model for adaptive evolution. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:11128 chicago: Matejovicova, Lenka. “Genetic Basis of Flower Colour as a Model for Adaptive Evolution.” Institute of Science and Technology Austria, 2022. https://doi.org/10.15479/at:ista:11128. ieee: L. Matejovicova, “Genetic basis of flower colour as a model for adaptive evolution,” Institute of Science and Technology Austria, 2022. ista: Matejovicova L. 2022. Genetic basis of flower colour as a model for adaptive evolution. Institute of Science and Technology Austria. mla: Matejovicova, Lenka. Genetic Basis of Flower Colour as a Model for Adaptive Evolution. Institute of Science and Technology Austria, 2022, doi:10.15479/at:ista:11128. short: L. Matejovicova, Genetic Basis of Flower Colour as a Model for Adaptive Evolution, Institute of Science and Technology Austria, 2022. date_created: 2022-04-07T08:19:54Z date_published: 2022-04-06T00:00:00Z date_updated: 2023-06-23T06:26:41Z day: '06' ddc: - '576' - '582' degree_awarded: PhD department: - _id: GradSch - _id: NiBa doi: 10.15479/at:ista:11128 file: - access_level: open_access checksum: e9609bc4e8f8e20146fc1125fd4f1bf7 content_type: application/pdf creator: cchlebak date_created: 2022-04-07T08:11:34Z date_updated: 2022-04-07T08:11:34Z file_id: '11129' file_name: LenkaPhD_Official_PDFA.pdf file_size: 11906472 relation: main_file - access_level: closed checksum: 99d67040432fd07a225643a212ee8588 content_type: application/x-zip-compressed creator: cchlebak date_created: 2022-04-07T08:11:51Z date_updated: 2022-04-07T08:11:51Z file_id: '11130' file_name: LenkaPhD Official_source.zip file_size: 23036766 relation: source_file file_date_updated: 2022-04-07T08:11:51Z has_accepted_license: '1' language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: '112' publication_identifier: isbn: - 978-3-99078-016-9 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria status: public supervisor: - first_name: Nicholas H full_name: Barton, Nicholas H id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 title: Genetic basis of flower colour as a model for adaptive evolution 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: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2022' ... --- _id: '13239' abstract: - lang: eng text: Brains are thought to engage in predictive learning - learning to predict upcoming stimuli - to construct an internal model of their environment. This is especially notable for spatial navigation, as first described by Tolman’s latent learning tasks. However, predictive learning has also been observed in sensory cortex, in settings unrelated to spatial navigation. Apart from normative frameworks such as active inference or efficient coding, what could be the utility of learning to predict the patterns of occurrence of correlated stimuli? Here we show that prediction, and thereby the construction of an internal model of sequential stimuli, can bootstrap the learning process of a working memory task in a recurrent neural network. We implemented predictive learning alongside working memory match-tasks, and networks emerged to solve the prediction task first by encoding information across time to predict upcoming stimuli, and then eavesdropped on this solution to solve the matching task. Eavesdropping was most beneficial when neural resources were limited. Hence, predictive learning acts as a general neural mechanism to learn to store sensory information that can later be essential for working memory tasks. acknowledgement: "The authors would like to thank members of the Vogels lab and Manohar lab, as well as Adam Packer, Andrew Saxe, Stefano Sarao Mannelli and Jacob Bakermans for fruitful discussions and comments on earlier versions of the manuscript.\r\nTLvdP was supported by funding from the Biotechnology and Biological Sciences Research Council (BBSRC) [grant number BB/M011224/1]. TPV was supported by an ERC Consolidator Grant (SYNAPSEEK). SGM was funded by a MRC Clinician Scientist Fellowship MR/P00878X and Leverhulme Grant RPG-2018-310." article_processing_charge: No author: - first_name: Thijs L. full_name: Van Der Plas, Thijs L. last_name: Van Der Plas - first_name: Tim P full_name: Vogels, Tim P id: CB6FF8D2-008F-11EA-8E08-2637E6697425 last_name: Vogels orcid: 0000-0003-3295-6181 - first_name: Sanjay G. full_name: Manohar, Sanjay G. last_name: Manohar citation: ama: 'Van Der Plas TL, Vogels TP, Manohar SG. Predictive learning enables neural networks to learn complex working memory tasks. In: Proceedings of Machine Learning Research. Vol 199. ML Research Press; 2022:518-531.' apa: Van Der Plas, T. L., Vogels, T. P., & Manohar, S. G. (2022). Predictive learning enables neural networks to learn complex working memory tasks. In Proceedings of Machine Learning Research (Vol. 199, pp. 518–531). ML Research Press. chicago: Van Der Plas, Thijs L., Tim P Vogels, and Sanjay G. Manohar. “Predictive Learning Enables Neural Networks to Learn Complex Working Memory Tasks.” In Proceedings of Machine Learning Research, 199:518–31. ML Research Press, 2022. ieee: T. L. Van Der Plas, T. P. Vogels, and S. G. Manohar, “Predictive learning enables neural networks to learn complex working memory tasks,” in Proceedings of Machine Learning Research, 2022, vol. 199, pp. 518–531. ista: Van Der Plas TL, Vogels TP, Manohar SG. 2022. Predictive learning enables neural networks to learn complex working memory tasks. Proceedings of Machine Learning Research. vol. 199, 518–531. mla: Van Der Plas, Thijs L., et al. “Predictive Learning Enables Neural Networks to Learn Complex Working Memory Tasks.” Proceedings of Machine Learning Research, vol. 199, ML Research Press, 2022, pp. 518–31. short: T.L. Van Der Plas, T.P. Vogels, S.G. Manohar, in:, Proceedings of Machine Learning Research, ML Research Press, 2022, pp. 518–531. date_created: 2023-07-16T22:01:12Z date_published: 2022-12-01T00:00:00Z date_updated: 2023-07-18T06:36:28Z day: '01' ddc: - '000' department: - _id: TiVo ec_funded: 1 file: - access_level: open_access checksum: 7530a93ef42e10b4db1e5e4b69796e93 content_type: application/pdf creator: dernst date_created: 2023-07-18T06:32:38Z date_updated: 2023-07-18T06:32:38Z file_id: '13243' file_name: 2022_PMLR_vanderPlas.pdf file_size: 585135 relation: main_file success: 1 file_date_updated: 2023-07-18T06:32:38Z has_accepted_license: '1' intvolume: ' 199' language: - iso: eng month: '12' oa: 1 oa_version: Published Version page: 518-531 project: - _id: 0aacfa84-070f-11eb-9043-d7eb2c709234 call_identifier: H2020 grant_number: '819603' name: Learning the shape of synaptic plasticity rules for neuronal architectures and function through machine learning. publication: Proceedings of Machine Learning Research publication_identifier: eissn: - 2640-3498 publication_status: published publisher: ML Research Press quality_controlled: '1' scopus_import: '1' status: public title: Predictive learning enables neural networks to learn complex working memory tasks type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 199 year: '2022' ... --- _id: '11366' abstract: - lang: eng text: "Adversarial training (i.e., training on adversarially perturbed input data) is a well-studied method for making neural networks robust to potential adversarial attacks during inference. However, the improved robustness does not\r\ncome for free but rather is accompanied by a decrease in overall model accuracy and performance. Recent work has shown that, in practical robot learning applications, the effects of adversarial training do not pose a fair trade-off\r\nbut inflict a net loss when measured in holistic robot performance. This work revisits the robustness-accuracy trade-off in robot learning by systematically analyzing if recent advances in robust training methods and theory in\r\nconjunction with adversarial robot learning can make adversarial training suitable for real-world robot applications. We evaluate a wide variety of robot learning tasks ranging from autonomous driving in a high-fidelity environment\r\namenable to sim-to-real deployment, to mobile robot gesture recognition. Our results demonstrate that, while these techniques make incremental improvements on the trade-off on a relative scale, the negative side-effects caused by\r\nadversarial training still outweigh the improvements by an order of magnitude. We conclude that more substantial advances in robust learning methods are necessary before they can benefit robot learning tasks in practice." acknowledgement: "This work was supported in parts by the ERC-2020-AdG 101020093, National Science Foundation (NSF), and JP\r\nMorgan Graduate Fellowships. We thank Christoph Lampert for inspiring this work.\r\n" article_number: '2204.07373' article_processing_charge: No author: - first_name: Mathias full_name: Lechner, Mathias id: 3DC22916-F248-11E8-B48F-1D18A9856A87 last_name: Lechner - first_name: Alexander full_name: Amini, Alexander last_name: Amini - first_name: Daniela full_name: Rus, Daniela last_name: Rus - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000-0002-2985-7724 citation: ama: Lechner M, Amini A, Rus D, Henzinger TA. Revisiting the adversarial robustness-accuracy tradeoff in robot learning. arXiv. doi:10.48550/arXiv.2204.07373 apa: Lechner, M., Amini, A., Rus, D., & Henzinger, T. A. (n.d.). Revisiting the adversarial robustness-accuracy tradeoff in robot learning. arXiv. https://doi.org/10.48550/arXiv.2204.07373 chicago: Lechner, Mathias, Alexander Amini, Daniela Rus, and Thomas A Henzinger. “Revisiting the Adversarial Robustness-Accuracy Tradeoff in Robot Learning.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2204.07373. ieee: M. Lechner, A. Amini, D. Rus, and T. A. Henzinger, “Revisiting the adversarial robustness-accuracy tradeoff in robot learning,” arXiv. . ista: Lechner M, Amini A, Rus D, Henzinger TA. Revisiting the adversarial robustness-accuracy tradeoff in robot learning. arXiv, 2204.07373. mla: Lechner, Mathias, et al. “Revisiting the Adversarial Robustness-Accuracy Tradeoff in Robot Learning.” ArXiv, 2204.07373, doi:10.48550/arXiv.2204.07373. short: M. Lechner, A. Amini, D. Rus, T.A. Henzinger, ArXiv (n.d.). date_created: 2022-05-12T13:20:17Z date_published: 2022-04-15T00:00:00Z date_updated: 2023-08-01T13:36:50Z day: '15' department: - _id: ToHe doi: 10.48550/arXiv.2204.07373 ec_funded: 1 external_id: arxiv: - '2204.07373' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2204.07373 month: '04' oa: 1 oa_version: Preprint project: - _id: 62781420-2b32-11ec-9570-8d9b63373d4d call_identifier: H2020 grant_number: '101020093' name: Vigilant Algorithmic Monitoring of Software publication: arXiv publication_status: submitted related_material: record: - id: '11362' relation: dissertation_contains status: public - id: '12704' relation: later_version status: public status: public title: Revisiting the adversarial robustness-accuracy tradeoff in robot learning type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '11432' abstract: - lang: eng text: "This paper proposes a method for simulating liquids in large bodies of water by coupling together a water surface wave simulator with a 3D Navier-Stokes simulator. The surface wave simulation uses the equivalent sources method (ESM) to efficiently animate large bodies of water with precisely controllable wave propagation behavior. The 3D liquid simulator animates complex non-linear fluid behaviors like splashes and breaking waves using off-the-shelf simulators using FLIP or the level set method with semi-Lagrangian advection.\r\nWe combine the two approaches by using the 3D solver to animate localized non-linear behaviors, and the 2D wave solver to animate larger regions with linear surface physics. We use the surface motion from the 3D solver as boundary conditions for 2D surface wave simulator, and we use the velocity and surface heights from the 2D surface wave simulator as boundary conditions for the 3D fluid simulation. We also introduce a novel technique for removing visual artifacts caused by numerical errors in 3D fluid solvers: we use experimental data to estimate the artificial dispersion caused by the 3D solver and we then carefully tune the wave speeds of the 2D solver to match it, effectively eliminating any differences in wave behavior across the boundary. To the best of our knowledge, this is the first time such a empirically driven error compensation approach has been used to remove coupling errors from a physics simulator.\r\nOur coupled simulation approach leverages the strengths of each simulation technique, animating large environments with seamless transitions between 2D and 3D physics." acknowledged_ssus: - _id: ScienComp acknowledgement: We wish to thank the anonymous reviewers and the members of the Visual Computing Group at IST Austria and MFX Team at INRIA for their valuable feedback. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No. 638176. article_processing_charge: No article_type: original author: - first_name: Camille full_name: Schreck, Camille id: 2B14B676-F248-11E8-B48F-1D18A9856A87 last_name: Schreck - first_name: Christopher J full_name: Wojtan, Christopher J id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87 last_name: Wojtan orcid: 0000-0001-6646-5546 citation: ama: Schreck C, Wojtan C. Coupling 3D liquid simulation with 2D wave propagation for large scale water surface animation using the equivalent sources method. Computer Graphics Forum. 2022;41(2):343-353. doi:10.1111/cgf.14478 apa: Schreck, C., & Wojtan, C. (2022). Coupling 3D liquid simulation with 2D wave propagation for large scale water surface animation using the equivalent sources method. Computer Graphics Forum. Wiley. https://doi.org/10.1111/cgf.14478 chicago: Schreck, Camille, and Chris Wojtan. “Coupling 3D Liquid Simulation with 2D Wave Propagation for Large Scale Water Surface Animation Using the Equivalent Sources Method.” Computer Graphics Forum. Wiley, 2022. https://doi.org/10.1111/cgf.14478. ieee: C. Schreck and C. Wojtan, “Coupling 3D liquid simulation with 2D wave propagation for large scale water surface animation using the equivalent sources method,” Computer Graphics Forum, vol. 41, no. 2. Wiley, pp. 343–353, 2022. ista: Schreck C, Wojtan C. 2022. Coupling 3D liquid simulation with 2D wave propagation for large scale water surface animation using the equivalent sources method. Computer Graphics Forum. 41(2), 343–353. mla: Schreck, Camille, and Chris Wojtan. “Coupling 3D Liquid Simulation with 2D Wave Propagation for Large Scale Water Surface Animation Using the Equivalent Sources Method.” Computer Graphics Forum, vol. 41, no. 2, Wiley, 2022, pp. 343–53, doi:10.1111/cgf.14478. short: C. Schreck, C. Wojtan, Computer Graphics Forum 41 (2022) 343–353. date_created: 2022-06-05T22:01:49Z date_published: 2022-05-01T00:00:00Z date_updated: 2023-08-02T06:44:05Z day: '01' department: - _id: ChWo doi: 10.1111/cgf.14478 ec_funded: 1 external_id: isi: - '000802723900027' intvolume: ' 41' isi: 1 issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: https://hal.archives-ouvertes.fr/hal-03641349/ month: '05' oa: 1 oa_version: Submitted Version page: 343-353 project: - _id: 2533E772-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '638176' name: Efficient Simulation of Natural Phenomena at Extremely Large Scales publication: Computer Graphics Forum publication_identifier: eissn: - 1467-8659 issn: - 0167-7055 publication_status: published publisher: Wiley quality_controlled: '1' scopus_import: '1' status: public title: Coupling 3D liquid simulation with 2D wave propagation for large scale water surface animation using the equivalent sources method type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 41 year: '2022' ... --- _id: '10335' abstract: - lang: eng text: "Van der Holst and Pendavingh introduced a graph parameter σ, which coincides with the more famous Colin de Verdière graph parameter μ for small values. However, the definition of a is much more geometric/topological directly reflecting embeddability properties of the graph. They proved μ(G) ≤ σ(G) + 2 and conjectured σ(G) ≤ σ(G) for any graph G. We confirm this conjecture. As far as we know, this is the first topological upper bound on σ(G) which is, in general, tight.\r\nEquality between μ and σ does not hold in general as van der Holst and Pendavingh showed that there is a graph G with μ(G) ≤ 18 and σ(G) ≥ 20. We show that the gap appears at much smaller values, namely, we exhibit a graph H for which μ(H) ≥ 7 and σ(H) ≥ 8. We also prove that, in general, the gap can be large: The incidence graphs Hq of finite projective planes of order q satisfy μ(Hq) ∈ O(q3/2) and σ(Hq) ≥ q2." acknowledgement: 'V. K. gratefully acknowledges the support of Austrian Science Fund (FWF): P 30902-N35. This work was done mostly while he was employed at the University of Innsbruck. During the early stage of this research, V. K. was partially supported by Charles University project GAUK 926416. M. T. is supported by the grant no. 19-04113Y of the Czech Science Foundation(GA ˇCR) and partially supported by Charles University project UNCE/SCI/004.' article_processing_charge: No article_type: original author: - first_name: Vojtech full_name: Kaluza, Vojtech id: 21AE5134-9EAC-11EA-BEA2-D7BD3DDC885E last_name: Kaluza orcid: 0000-0002-2512-8698 - first_name: Martin full_name: Tancer, Martin id: 38AC689C-F248-11E8-B48F-1D18A9856A87 last_name: Tancer orcid: 0000-0002-1191-6714 citation: ama: Kaluza V, Tancer M. Even maps, the Colin de Verdière number and representations of graphs. Combinatorica. 2022;42:1317-1345. doi:10.1007/s00493-021-4443-7 apa: Kaluza, V., & Tancer, M. (2022). Even maps, the Colin de Verdière number and representations of graphs. Combinatorica. Springer Nature. https://doi.org/10.1007/s00493-021-4443-7 chicago: Kaluza, Vojtech, and Martin Tancer. “Even Maps, the Colin de Verdière Number and Representations of Graphs.” Combinatorica. Springer Nature, 2022. https://doi.org/10.1007/s00493-021-4443-7. ieee: V. Kaluza and M. Tancer, “Even maps, the Colin de Verdière number and representations of graphs,” Combinatorica, vol. 42. Springer Nature, pp. 1317–1345, 2022. ista: Kaluza V, Tancer M. 2022. Even maps, the Colin de Verdière number and representations of graphs. Combinatorica. 42, 1317–1345. mla: Kaluza, Vojtech, and Martin Tancer. “Even Maps, the Colin de Verdière Number and Representations of Graphs.” Combinatorica, vol. 42, Springer Nature, 2022, pp. 1317–45, doi:10.1007/s00493-021-4443-7. short: V. Kaluza, M. Tancer, Combinatorica 42 (2022) 1317–1345. date_created: 2021-11-25T13:49:16Z date_published: 2022-12-01T00:00:00Z date_updated: 2023-08-02T06:43:27Z day: '01' ddc: - '514' - '516' department: - _id: UlWa doi: 10.1007/s00493-021-4443-7 external_id: arxiv: - '1907.05055' isi: - '000798210100003' intvolume: ' 42' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: ' https://doi.org/10.48550/arXiv.1907.05055' month: '12' oa: 1 oa_version: Preprint page: 1317-1345 publication: Combinatorica publication_identifier: issn: - 0209-9683 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Even maps, the Colin de Verdière number and representations of graphs type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 42 year: '2022' ... --- _id: '9199' abstract: - lang: eng text: "We associate a certain tensor product lattice to any primitive integer lattice and ask about its typical shape. These lattices are related to the tangent bundle of Grassmannians and their study is motivated by Peyre's programme on \"freeness\" for rational points of bounded height on Fano\r\nvarieties." acknowledgement: The authors are very grateful to Will Sawin for useful remarks about this topic. While working on this paper the first two authors were supported by EPSRC grant EP/P026710/1, and the first and last authors by FWF grant P 32428-N35. article_processing_charge: No article_type: original author: - first_name: Timothy D full_name: Browning, Timothy D id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 - first_name: Tal full_name: Horesh, Tal id: C8B7BF48-8D81-11E9-BCA9-F536E6697425 last_name: Horesh - first_name: Florian Alexander full_name: Wilsch, Florian Alexander id: 560601DA-8D36-11E9-A136-7AC1E5697425 last_name: Wilsch orcid: 0000-0001-7302-8256 citation: ama: Browning TD, Horesh T, Wilsch FA. Equidistribution and freeness on Grassmannians. Algebra & Number Theory. 2022;16(10):2385-2407. doi:10.2140/ant.2022.16.2385 apa: Browning, T. D., Horesh, T., & Wilsch, F. A. (2022). Equidistribution and freeness on Grassmannians. Algebra & Number Theory. Mathematical Sciences Publishers. https://doi.org/10.2140/ant.2022.16.2385 chicago: Browning, Timothy D, Tal Horesh, and Florian Alexander Wilsch. “Equidistribution and Freeness on Grassmannians.” Algebra & Number Theory. Mathematical Sciences Publishers, 2022. https://doi.org/10.2140/ant.2022.16.2385. ieee: T. D. Browning, T. Horesh, and F. A. Wilsch, “Equidistribution and freeness on Grassmannians,” Algebra & Number Theory, vol. 16, no. 10. Mathematical Sciences Publishers, pp. 2385–2407, 2022. ista: Browning TD, Horesh T, Wilsch FA. 2022. Equidistribution and freeness on Grassmannians. Algebra & Number Theory. 16(10), 2385–2407. mla: Browning, Timothy D., et al. “Equidistribution and Freeness on Grassmannians.” Algebra & Number Theory, vol. 16, no. 10, Mathematical Sciences Publishers, 2022, pp. 2385–407, doi:10.2140/ant.2022.16.2385. short: T.D. Browning, T. Horesh, F.A. Wilsch, Algebra & Number Theory 16 (2022) 2385–2407. date_created: 2021-02-25T09:56:57Z date_published: 2022-12-01T00:00:00Z date_updated: 2023-08-02T06:46:38Z day: '01' department: - _id: TiBr doi: 10.2140/ant.2022.16.2385 external_id: arxiv: - '2102.11552' isi: - '000961514100004' intvolume: ' 16' isi: 1 issue: '10' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2102.11552 month: '12' oa: 1 oa_version: Preprint page: 2385-2407 project: - _id: 26A8D266-B435-11E9-9278-68D0E5697425 grant_number: EP-P026710-2 name: Between rational and integral points - _id: 26AEDAB2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P32428 name: New frontiers of the Manin conjecture publication: Algebra & Number Theory publication_identifier: eissn: - 1944-7833 issn: - 1937-0652 publication_status: published publisher: Mathematical Sciences Publishers quality_controlled: '1' scopus_import: '1' status: public title: Equidistribution and freeness on Grassmannians type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 16 year: '2022' ... --- _id: '9794' abstract: - lang: eng text: 'Lymph nodes (LNs) comprise two main structural elements: fibroblastic reticular cells that form dedicated niches for immune cell interaction and capsular fibroblasts that build a shell around the organ. Immunological challenge causes LNs to increase more than tenfold in size within a few days. Here, we characterized the biomechanics of LN swelling on the cellular and organ scale. We identified lymphocyte trapping by influx and proliferation as drivers of an outward pressure force, causing fibroblastic reticular cells of the T-zone (TRCs) and their associated conduits to stretch. After an initial phase of relaxation, TRCs sensed the resulting strain through cell matrix adhesions, which coordinated local growth and remodeling of the stromal network. While the expanded TRC network readopted its typical configuration, a massive fibrotic reaction of the organ capsule set in and countered further organ expansion. Thus, different fibroblast populations mechanically control LN swelling in a multitier fashion.' acknowledged_ssus: - _id: Bio - _id: EM-Fac - _id: PreCl - _id: LifeSc acknowledgement: This research was supported by the Scientific Service Units of IST Austria through resources provided by the Imaging and Optics, Electron Microscopy, Preclinical and Life Science Facilities. We thank C. Moussion for providing anti-PNAd antibody and D. Critchley for Talin1-floxed mice, and E. Papusheva for providing a custom 3D channel alignment script. This work was supported by a European Research Council grant ERC-CoG-72437 to M.S. M.H. was supported by Czech Sciencundation GACR 20-24603Y and Charles University PRIMUS/20/MED/013. article_processing_charge: No article_type: original author: - first_name: Frank P full_name: Assen, Frank P id: 3A8E7F24-F248-11E8-B48F-1D18A9856A87 last_name: Assen orcid: 0000-0003-3470-6119 - first_name: Jun full_name: Abe, Jun last_name: Abe - first_name: Miroslav full_name: Hons, Miroslav id: 4167FE56-F248-11E8-B48F-1D18A9856A87 last_name: Hons orcid: 0000-0002-6625-3348 - first_name: Robert full_name: Hauschild, Robert id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87 last_name: Hauschild orcid: 0000-0001-9843-3522 - first_name: Shayan full_name: Shamipour, Shayan id: 40B34FE2-F248-11E8-B48F-1D18A9856A87 last_name: Shamipour - first_name: Walter full_name: Kaufmann, Walter id: 3F99E422-F248-11E8-B48F-1D18A9856A87 last_name: Kaufmann orcid: 0000-0001-9735-5315 - first_name: Tommaso full_name: Costanzo, Tommaso id: D93824F4-D9BA-11E9-BB12-F207E6697425 last_name: Costanzo orcid: 0000-0001-9732-3815 - first_name: Gabriel full_name: Krens, Gabriel id: 2B819732-F248-11E8-B48F-1D18A9856A87 last_name: Krens orcid: 0000-0003-4761-5996 - first_name: Markus full_name: Brown, Markus id: 3DAB9AFC-F248-11E8-B48F-1D18A9856A87 last_name: Brown - first_name: Burkhard full_name: Ludewig, Burkhard last_name: Ludewig - first_name: Simon full_name: Hippenmeyer, Simon id: 37B36620-F248-11E8-B48F-1D18A9856A87 last_name: Hippenmeyer orcid: 0000-0003-2279-1061 - first_name: Carl-Philipp J full_name: Heisenberg, Carl-Philipp J id: 39427864-F248-11E8-B48F-1D18A9856A87 last_name: Heisenberg orcid: 0000-0002-0912-4566 - first_name: Wolfgang full_name: Weninger, Wolfgang last_name: Weninger - first_name: Edouard B full_name: Hannezo, Edouard B id: 3A9DB764-F248-11E8-B48F-1D18A9856A87 last_name: Hannezo orcid: 0000-0001-6005-1561 - first_name: Sanjiv A. full_name: Luther, Sanjiv A. last_name: Luther - first_name: Jens V. full_name: Stein, Jens V. last_name: Stein - first_name: Michael K full_name: Sixt, Michael K id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87 last_name: Sixt orcid: 0000-0002-4561-241X citation: ama: Assen FP, Abe J, Hons M, et al. Multitier mechanics control stromal adaptations in swelling lymph nodes. Nature Immunology. 2022;23:1246-1255. doi:10.1038/s41590-022-01257-4 apa: Assen, F. P., Abe, J., Hons, M., Hauschild, R., Shamipour, S., Kaufmann, W., … Sixt, M. K. (2022). Multitier mechanics control stromal adaptations in swelling lymph nodes. Nature Immunology. Springer Nature. https://doi.org/10.1038/s41590-022-01257-4 chicago: Assen, Frank P, Jun Abe, Miroslav Hons, Robert Hauschild, Shayan Shamipour, Walter Kaufmann, Tommaso Costanzo, et al. “Multitier Mechanics Control Stromal Adaptations in Swelling Lymph Nodes.” Nature Immunology. Springer Nature, 2022. https://doi.org/10.1038/s41590-022-01257-4. ieee: F. P. Assen et al., “Multitier mechanics control stromal adaptations in swelling lymph nodes,” Nature Immunology, vol. 23. Springer Nature, pp. 1246–1255, 2022. ista: Assen FP, Abe J, Hons M, Hauschild R, Shamipour S, Kaufmann W, Costanzo T, Krens G, Brown M, Ludewig B, Hippenmeyer S, Heisenberg C-PJ, Weninger W, Hannezo EB, Luther SA, Stein JV, Sixt MK. 2022. Multitier mechanics control stromal adaptations in swelling lymph nodes. Nature Immunology. 23, 1246–1255. mla: Assen, Frank P., et al. “Multitier Mechanics Control Stromal Adaptations in Swelling Lymph Nodes.” Nature Immunology, vol. 23, Springer Nature, 2022, pp. 1246–55, doi:10.1038/s41590-022-01257-4. short: F.P. Assen, J. Abe, M. Hons, R. Hauschild, S. Shamipour, W. Kaufmann, T. Costanzo, G. Krens, M. Brown, B. Ludewig, S. Hippenmeyer, C.-P.J. Heisenberg, W. Weninger, E.B. Hannezo, S.A. Luther, J.V. Stein, M.K. Sixt, Nature Immunology 23 (2022) 1246–1255. date_created: 2021-08-06T09:09:11Z date_published: 2022-07-11T00:00:00Z date_updated: 2023-08-02T06:53:07Z day: '11' ddc: - '570' department: - _id: SiHi - _id: CaHe - _id: EdHa - _id: EM-Fac - _id: Bio - _id: MiSi doi: 10.1038/s41590-022-01257-4 ec_funded: 1 external_id: isi: - '000822975900002' file: - access_level: open_access checksum: 628e7b49809f22c75b428842efe70c68 content_type: application/pdf creator: dernst date_created: 2022-07-25T07:11:32Z date_updated: 2022-07-25T07:11:32Z file_id: '11642' file_name: 2022_NatureImmunology_Assen.pdf file_size: 11475325 relation: main_file success: 1 file_date_updated: 2022-07-25T07:11:32Z has_accepted_license: '1' intvolume: ' 23' isi: 1 language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 1246-1255 project: - _id: 25FE9508-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '724373' name: Cellular navigation along spatial gradients publication: Nature Immunology publication_identifier: eissn: - 1529-2916 issn: - 1529-2908 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Multitier mechanics control stromal adaptations in swelling lymph nodes 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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 23 year: '2022' ... --- _id: '9649' abstract: - lang: eng text: "Isomanifolds are the generalization of isosurfaces to arbitrary dimension and codimension, i.e. manifolds defined as the zero set of some multivariate vector-valued smooth function f : Rd → Rd−n. A natural (and efficient) way to approximate an isomanifold is to consider its Piecewise-Linear (PL) approximation based on a triangulation T of the ambient space Rd. In this paper, we give conditions under which the PL-approximation of an isomanifold is topologically equivalent to the isomanifold. The conditions are easy to satisfy in the sense that they can always be met by taking a sufficiently\r\nfine triangulation T . This contrasts with previous results on the triangulation of manifolds where, in arbitrary dimensions, delicate perturbations are needed to guarantee topological correctness, which leads to strong limitations in practice. We further give a bound on the Fréchet distance between the original isomanifold and its PL-approximation. Finally we show analogous results for the PL-approximation of an isomanifold with boundary." acknowledgement: "First and foremost, we acknowledge Siargey Kachanovich for discussions. We thank Herbert Edelsbrunner and all members of his group, all former and current members of the Datashape team (formerly known as Geometrica), and André Lieutier for encouragement. We further thank the reviewers of Foundations of Computational Mathematics and the reviewers and program committee of the Symposium on Computational Geometry for their feedback, which improved the exposition.\r\nThis work was funded by the European Research Council under the European Union’s ERC Grant Agreement number 339025 GUDHI (Algorithmic Foundations of Geometric Understanding in Higher Dimensions). This work was also supported by the French government, through the 3IA Côte d’Azur Investments in the Future project managed by the National Research Agency (ANR) with the reference number ANR-19-P3IA-0002. Mathijs Wintraecken also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement no. 754411." article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Jean-Daniel full_name: Boissonnat, Jean-Daniel last_name: Boissonnat - first_name: Mathijs full_name: Wintraecken, Mathijs id: 307CFBC8-F248-11E8-B48F-1D18A9856A87 last_name: Wintraecken orcid: 0000-0002-7472-2220 citation: ama: Boissonnat J-D, Wintraecken M. The topological correctness of PL approximations of isomanifolds. Foundations of Computational Mathematics . 2022;22:967-1012. doi:10.1007/s10208-021-09520-0 apa: Boissonnat, J.-D., & Wintraecken, M. (2022). The topological correctness of PL approximations of isomanifolds. Foundations of Computational Mathematics . Springer Nature. https://doi.org/10.1007/s10208-021-09520-0 chicago: Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness of PL Approximations of Isomanifolds.” Foundations of Computational Mathematics . Springer Nature, 2022. https://doi.org/10.1007/s10208-021-09520-0. ieee: J.-D. Boissonnat and M. Wintraecken, “The topological correctness of PL approximations of isomanifolds,” Foundations of Computational Mathematics , vol. 22. Springer Nature, pp. 967–1012, 2022. ista: Boissonnat J-D, Wintraecken M. 2022. The topological correctness of PL approximations of isomanifolds. Foundations of Computational Mathematics . 22, 967–1012. mla: Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness of PL Approximations of Isomanifolds.” Foundations of Computational Mathematics , vol. 22, Springer Nature, 2022, pp. 967–1012, doi:10.1007/s10208-021-09520-0. short: J.-D. Boissonnat, M. Wintraecken, Foundations of Computational Mathematics 22 (2022) 967–1012. date_created: 2021-07-14T06:44:53Z date_published: 2022-01-01T00:00:00Z date_updated: 2023-08-02T06:49:17Z day: '01' ddc: - '516' department: - _id: HeEd doi: 10.1007/s10208-021-09520-0 ec_funded: 1 external_id: isi: - '000673039600001' file: - access_level: open_access checksum: f1d372ec3c08ec22e84f8e93e1126b8c content_type: application/pdf creator: mwintrae date_created: 2021-07-14T06:44:36Z date_updated: 2021-07-14T06:44:36Z file_id: '9650' file_name: Boissonnat-Wintraecken2021_Article_TheTopologicalCorrectnessOfPLA.pdf file_size: 1455699 relation: main_file file_date_updated: 2021-07-14T06:44:36Z has_accepted_license: '1' intvolume: ' 22' isi: 1 language: - iso: eng month: '0' oa: 1 oa_version: Published Version page: 967-1012 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: 'Foundations of Computational Mathematics ' publication_identifier: eissn: - 1615-3383 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '7952' relation: earlier_version status: public scopus_import: '1' status: public title: The topological correctness of PL approximations of isomanifolds 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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 22 year: '2022' ... --- _id: '9364' abstract: - lang: eng text: 'Let t : Fp → C be a complex valued function on Fp. A classical problem in analytic number theory is bounding the maximum M(t) := max 0≤H

0 there exists a large subset of a ∈ F×p such that for kl a,1,p : x → e((ax+x) / p) we have M(kla,1,p) ≥ (1−ε/√2π + o(1)) log log p, as p→∞. Finally, we prove a result on the growth of the moments of {M (kla,1,p)}a∈F×p. 2020 Mathematics Subject Classification: 11L03, 11T23 (Primary); 14F20, 60F10 (Secondary).' acknowledgement: I am most thankful to my advisor, Emmanuel Kowalski, for suggesting this problem and for his guidance during these years. I also would like to thank Youness Lamzouri for informing me about his work on sum of incomplete Birch sums and Tal Horesh for her suggestions on a previous version of the paper. Finally, I am very grateful to the anonymous referee for their careful reading of the manuscript and their valuable comments. article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Dante full_name: Bonolis, Dante id: 6A459894-5FDD-11E9-AF35-BB24E6697425 last_name: Bonolis citation: ama: Bonolis D. On the size of the maximum of incomplete Kloosterman sums. Mathematical Proceedings of the Cambridge Philosophical Society. 2022;172(3):563-590. doi:10.1017/S030500412100030X apa: Bonolis, D. (2022). On the size of the maximum of incomplete Kloosterman sums. Mathematical Proceedings of the Cambridge Philosophical Society. Cambridge University Press. https://doi.org/10.1017/S030500412100030X chicago: Bonolis, Dante. “On the Size of the Maximum of Incomplete Kloosterman Sums.” Mathematical Proceedings of the Cambridge Philosophical Society. Cambridge University Press, 2022. https://doi.org/10.1017/S030500412100030X. ieee: D. Bonolis, “On the size of the maximum of incomplete Kloosterman sums,” Mathematical Proceedings of the Cambridge Philosophical Society, vol. 172, no. 3. Cambridge University Press, pp. 563–590, 2022. ista: Bonolis D. 2022. On the size of the maximum of incomplete Kloosterman sums. Mathematical Proceedings of the Cambridge Philosophical Society. 172(3), 563–590. mla: Bonolis, Dante. “On the Size of the Maximum of Incomplete Kloosterman Sums.” Mathematical Proceedings of the Cambridge Philosophical Society, vol. 172, no. 3, Cambridge University Press, 2022, pp. 563–90, doi:10.1017/S030500412100030X. short: D. Bonolis, Mathematical Proceedings of the Cambridge Philosophical Society 172 (2022) 563–590. date_created: 2021-05-02T22:01:29Z date_published: 2022-05-01T00:00:00Z date_updated: 2023-08-02T06:47:48Z day: '01' ddc: - '510' department: - _id: TiBr doi: 10.1017/S030500412100030X external_id: arxiv: - '1811.10563' isi: - '000784421500001' file: - access_level: open_access checksum: 614d2e9b83a78100408e4ee7752a80a8 content_type: application/pdf creator: cchlebak date_created: 2021-12-01T14:01:54Z date_updated: 2021-12-01T14:01:54Z file_id: '10395' file_name: 2021_MathProcCamPhilSoc_Bonolis.pdf file_size: 334064 relation: main_file success: 1 file_date_updated: 2021-12-01T14:01:54Z has_accepted_license: '1' intvolume: ' 172' isi: 1 issue: '3' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: 563 - 590 publication: Mathematical Proceedings of the Cambridge Philosophical Society publication_identifier: eissn: - 1469-8064 issn: - 0305-0041 publication_status: published publisher: Cambridge University Press quality_controlled: '1' scopus_import: '1' status: public title: On the size of the maximum of incomplete Kloosterman sums 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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 172 year: '2022' ... --- _id: '9977' abstract: - lang: eng text: "For a Seifert fibered homology sphere X we show that the q-series invariant Zˆ0(X; q) introduced by Gukov-Pei-Putrov-Vafa, is a resummation of the Ohtsuki series Z0(X). We show that for every even k ∈ N there exists a full asymptotic expansion of Zˆ0(X; q) for q tending to e 2πi/k, and in particular that the limit Zˆ0(X; e 2πi/k) exists and is equal to the\r\nWRT quantum invariant τk(X). We show that the poles of the Borel transform of Z0(X) coincide with the classical complex Chern-Simons values, which we further show classifies the corresponding components of the moduli space of flat SL(2, C)-connections." acknowledgement: "We warmly thank S. Gukov for valuable discussions on the GPPV invariant ̂Z\U0001D44E(\U0001D4403; \U0001D45E). The first\r\nauthor was supported in part by the center of excellence grant ‘Center for Quantum Geometry\r\nof Moduli Spaces’ from the Danish National Research Foundation (DNRF95) and by the ERCSynergy\r\ngrant ‘ReNewQuantum’. The second author received funding from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie grant agreement no. 754411." article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: William full_name: Mistegaard, William id: 41B03CD0-62AE-11E9-84EF-0718E6697425 last_name: Mistegaard - first_name: Jørgen Ellegaard full_name: Andersen, Jørgen Ellegaard last_name: Andersen citation: ama: Mistegaard W, Andersen JE. Resurgence analysis of quantum invariants of Seifert fibered homology spheres. Journal of the London Mathematical Society. 2022;105(2):709-764. doi:10.1112/jlms.12506 apa: Mistegaard, W., & Andersen, J. E. (2022). Resurgence analysis of quantum invariants of Seifert fibered homology spheres. Journal of the London Mathematical Society. Wiley. https://doi.org/10.1112/jlms.12506 chicago: Mistegaard, William, and Jørgen Ellegaard Andersen. “Resurgence Analysis of Quantum Invariants of Seifert Fibered Homology Spheres.” Journal of the London Mathematical Society. Wiley, 2022. https://doi.org/10.1112/jlms.12506. ieee: W. Mistegaard and J. E. Andersen, “Resurgence analysis of quantum invariants of Seifert fibered homology spheres,” Journal of the London Mathematical Society, vol. 105, no. 2. Wiley, pp. 709–764, 2022. ista: Mistegaard W, Andersen JE. 2022. Resurgence analysis of quantum invariants of Seifert fibered homology spheres. Journal of the London Mathematical Society. 105(2), 709–764. mla: Mistegaard, William, and Jørgen Ellegaard Andersen. “Resurgence Analysis of Quantum Invariants of Seifert Fibered Homology Spheres.” Journal of the London Mathematical Society, vol. 105, no. 2, Wiley, 2022, pp. 709–64, doi:10.1112/jlms.12506. short: W. Mistegaard, J.E. Andersen, Journal of the London Mathematical Society 105 (2022) 709–764. date_created: 2021-08-31T12:51:40Z date_published: 2022-03-01T00:00:00Z date_updated: 2023-08-02T06:53:51Z day: '01' ddc: - '510' department: - _id: TaHa doi: 10.1112/jlms.12506 ec_funded: 1 external_id: arxiv: - '1811.05376' isi: - '000755205700001' file: - access_level: open_access checksum: 9c72327d39f34f1a6eaa98fa4b8493f2 content_type: application/pdf creator: dernst date_created: 2022-03-24T11:42:25Z date_updated: 2022-03-24T11:42:25Z file_id: '10917' file_name: 2022_JourLondonMathSoc_Andersen.pdf file_size: 649130 relation: main_file success: 1 file_date_updated: 2022-03-24T11:42:25Z has_accepted_license: '1' intvolume: ' 105' isi: 1 issue: '2' language: - iso: eng month: '03' oa: 1 oa_version: Published Version page: 709-764 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: Journal of the London Mathematical Society publication_identifier: eissn: - 1469-7750 publication_status: published publisher: Wiley quality_controlled: '1' scopus_import: '1' status: public title: Resurgence analysis of quantum invariants of Seifert fibered homology spheres 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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 105 year: '2022' ... --- _id: '10016' abstract: - lang: eng text: 'Auxin has always been at the forefront of research in plant physiology and development. Since the earliest contemplations by Julius von Sachs and Charles Darwin, more than a century-long struggle has been waged to understand its function. This largely reflects the failures, successes, and inevitable progress in the entire field of plant signaling and development. Here I present 14 stations on our long and sometimes mystical journey to understand auxin. These highlights were selected to give a flavor of the field and to show the scope and limits of our current knowledge. A special focus is put on features that make auxin unique among phytohormones, such as its dynamic, directional transport network, which integrates external and internal signals, including self-organizing feedback. Accented are persistent mysteries and controversies. The unexpected discoveries related to rapid auxin responses and growth regulation recently disturbed our contentment regarding understanding of the auxin signaling mechanism. These new revelations, along with advances in technology, usher us into a new, exciting era in auxin research. ' acknowledgement: "The author thanks the whole community of researchers consciously or unconsciously working on questions related to auxin, whose hard work and enthusiasm contributed to development of this exciting story. Particular thanks go to many\r\nbrilliant present and past members of the Friml group and our numerous excellent collaborators, without whom my own personal journey would not be possible. The way of the cross with its 14 stations is a popular devotion among Roman Catholics and inspires them to make a spiritual pilgrimage through contemplation of Christ on his last day. Its aspects of gradual progress, struggle, passion, and revelation served as an inspiration for the formal depiction of our journey to understanding auxin as described in this review. It is in no way intended to reflect the personal beliefs of the author and readers. I am grateful to Nick Barton, Eva Benková, Lenka Caisová, Matyáš Fendrych, Lukáš Fiedler, Monika Frátriková, Jarmila Frimlová, Michelle Gallei, Jakub Hajný, Lukas Hoermayer, Alexandra Mally, Ondrˇej Novák, Jan Petrášek, Aleš Pěnčík, Steffen Vanneste, Tongda Xu, and Zhenbiao Yang for their valuable comments. Special thanks go to Michelle Gallei for her invaluable assistance with the figures." article_number: a039859 article_processing_charge: No article_type: review author: - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: ama: Friml J. Fourteen stations of auxin. Cold Spring Harbor Perspectives in Biology. 2022;14(5). doi:10.1101/cshperspect.a039859 apa: Friml, J. (2022). Fourteen stations of auxin. Cold Spring Harbor Perspectives in Biology. Cold Spring Harbor Laboratory. https://doi.org/10.1101/cshperspect.a039859 chicago: Friml, Jiří. “Fourteen Stations of Auxin.” Cold Spring Harbor Perspectives in Biology. Cold Spring Harbor Laboratory, 2022. https://doi.org/10.1101/cshperspect.a039859 . ieee: J. Friml, “Fourteen stations of auxin,” Cold Spring Harbor Perspectives in Biology, vol. 14, no. 5. Cold Spring Harbor Laboratory, 2022. ista: Friml J. 2022. Fourteen stations of auxin. Cold Spring Harbor Perspectives in Biology. 14(5), a039859. mla: Friml, Jiří. “Fourteen Stations of Auxin.” Cold Spring Harbor Perspectives in Biology, vol. 14, no. 5, a039859, Cold Spring Harbor Laboratory, 2022, doi:10.1101/cshperspect.a039859 . short: J. Friml, Cold Spring Harbor Perspectives in Biology 14 (2022). date_created: 2021-09-14T11:36:53Z date_published: 2022-05-27T00:00:00Z date_updated: 2023-08-02T06:54:42Z day: '27' department: - _id: JiFr doi: '10.1101/cshperspect.a039859 ' external_id: isi: - '000806563000003' pmid: - '34400554' intvolume: ' 14' isi: 1 issue: '5' language: - iso: eng main_file_link: - open_access: '1' url: 'https://doi.org/10.1101/cshperspect.a039859 ' month: '05' oa: 1 oa_version: Published Version pmid: 1 publication: Cold Spring Harbor Perspectives in Biology publication_identifier: issn: - 1943-0264 publication_status: published publisher: Cold Spring Harbor Laboratory quality_controlled: '1' scopus_import: '1' status: public title: Fourteen stations of auxin type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 14 year: '2022' ... --- _id: '10018' abstract: - lang: eng text: In order to study integral points of bounded log-anticanonical height on weak del Pezzo surfaces, we classify weak del Pezzo pairs. As a representative example, we consider a quartic del Pezzo surface of singularity type A1 + A3 and prove an analogue of Manin's conjecture for integral points with respect to its singularities and its lines. acknowledgement: The first author was partly supported by grant DE 1646/4-2 of the Deutsche Forschungsgemeinschaft. The second author was partly supported by FWF grant P 32428-N35 and conducted part of this work as a guest at the Institut de Mathématiques de Jussieu–Paris Rive Gauche invited by Antoine Chambert-Loir and funded by DAAD. article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Ulrich full_name: Derenthal, Ulrich last_name: Derenthal - first_name: Florian Alexander full_name: Wilsch, Florian Alexander id: 560601DA-8D36-11E9-A136-7AC1E5697425 last_name: Wilsch orcid: 0000-0001-7302-8256 citation: ama: Derenthal U, Wilsch FA. Integral points on singular del Pezzo surfaces. Journal of the Institute of Mathematics of Jussieu. 2022. doi:10.1017/S1474748022000482 apa: Derenthal, U., & Wilsch, F. A. (2022). Integral points on singular del Pezzo surfaces. Journal of the Institute of Mathematics of Jussieu. Cambridge University Press. https://doi.org/10.1017/S1474748022000482 chicago: Derenthal, Ulrich, and Florian Alexander Wilsch. “Integral Points on Singular Del Pezzo Surfaces.” Journal of the Institute of Mathematics of Jussieu. Cambridge University Press, 2022. https://doi.org/10.1017/S1474748022000482. ieee: U. Derenthal and F. A. Wilsch, “Integral points on singular del Pezzo surfaces,” Journal of the Institute of Mathematics of Jussieu. Cambridge University Press, 2022. ista: Derenthal U, Wilsch FA. 2022. Integral points on singular del Pezzo surfaces. Journal of the Institute of Mathematics of Jussieu. mla: Derenthal, Ulrich, and Florian Alexander Wilsch. “Integral Points on Singular Del Pezzo Surfaces.” Journal of the Institute of Mathematics of Jussieu, Cambridge University Press, 2022, doi:10.1017/S1474748022000482. short: U. Derenthal, F.A. Wilsch, Journal of the Institute of Mathematics of Jussieu (2022). date_created: 2021-09-15T10:06:48Z date_published: 2022-11-10T00:00:00Z date_updated: 2023-08-02T06:55:10Z day: '10' department: - _id: TiBr doi: 10.1017/S1474748022000482 external_id: arxiv: - '2109.06778' isi: - '000881319200001' isi: 1 keyword: - Integral points - del Pezzo surface - universal torsor - Manin’s conjecture language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1017/S1474748022000482 month: '11' oa: 1 oa_version: Published Version project: - _id: 26AEDAB2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P32428 name: New frontiers of the Manin conjecture publication: Journal of the Institute of Mathematics of Jussieu publication_identifier: eissn: - '1475-3030 ' issn: - 1474-7480 publication_status: epub_ahead publisher: Cambridge University Press quality_controlled: '1' scopus_import: '1' status: public title: Integral points on singular del Pezzo surfaces type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 year: '2022' ... --- _id: '10530' abstract: - lang: eng text: "Cell dispersion from a confined area is fundamental in a number of biological processes,\r\nincluding cancer metastasis. To date, a quantitative understanding of the interplay of single\r\ncell motility, cell proliferation, and intercellular contacts remains elusive. In particular, the role\r\nof E- and N-Cadherin junctions, central components of intercellular contacts, is still\r\ncontroversial. Combining theoretical modeling with in vitro observations, we investigate the\r\ncollective spreading behavior of colonies of human cancer cells (T24). The spreading of these\r\ncolonies is driven by stochastic single-cell migration with frequent transient cell-cell contacts.\r\nWe find that inhibition of E- and N-Cadherin junctions decreases colony spreading and average\r\nspreading velocities, without affecting the strength of correlations in spreading velocities of\r\nneighboring cells. Based on a biophysical simulation model for cell migration, we show that the\r\nbehavioral changes upon disruption of these junctions can be explained by reduced repulsive\r\nexcluded volume interactions between cells. This suggests that in cancer cell migration,\r\ncadherin-based intercellular contacts sharpen cell boundaries leading to repulsive rather than\r\ncohesive interactions between cells, thereby promoting efficient cell spreading during collective\r\nmigration.\r\n" acknowledgement: Funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) - Project-ID 201269156 - SFB 1032 (Projects B8 and B12). D.B.B. is supported in part by a DFG fellowship within the Graduate School of Quantitative Biosciences Munich (QBM) and by the Joachim Herz Stiftung. article_processing_charge: No article_type: original author: - first_name: Themistoklis full_name: Zisis, Themistoklis last_name: Zisis - first_name: David full_name: Brückner, David id: e1e86031-6537-11eb-953a-f7ab92be508d last_name: Brückner orcid: 0000-0001-7205-2975 - first_name: Tom full_name: Brandstätter, Tom last_name: Brandstätter - first_name: Wei Xiong full_name: Siow, Wei Xiong last_name: Siow - first_name: Joseph full_name: d’Alessandro, Joseph last_name: d’Alessandro - first_name: Angelika M. full_name: Vollmar, Angelika M. last_name: Vollmar - first_name: Chase P. full_name: Broedersz, Chase P. last_name: Broedersz - first_name: Stefan full_name: Zahler, Stefan last_name: Zahler citation: ama: Zisis T, Brückner D, Brandstätter T, et al. Disentangling cadherin-mediated cell-cell interactions in collective cancer cell migration. Biophysical Journal. 2022;121(1):P44-60. doi:10.1016/j.bpj.2021.12.006 apa: Zisis, T., Brückner, D., Brandstätter, T., Siow, W. X., d’Alessandro, J., Vollmar, A. M., … Zahler, S. (2022). Disentangling cadherin-mediated cell-cell interactions in collective cancer cell migration. Biophysical Journal. Elsevier. https://doi.org/10.1016/j.bpj.2021.12.006 chicago: Zisis, Themistoklis, David Brückner, Tom Brandstätter, Wei Xiong Siow, Joseph d’Alessandro, Angelika M. Vollmar, Chase P. Broedersz, and Stefan Zahler. “Disentangling Cadherin-Mediated Cell-Cell Interactions in Collective Cancer Cell Migration.” Biophysical Journal. Elsevier, 2022. https://doi.org/10.1016/j.bpj.2021.12.006. ieee: T. Zisis et al., “Disentangling cadherin-mediated cell-cell interactions in collective cancer cell migration,” Biophysical Journal, vol. 121, no. 1. Elsevier, pp. P44-60, 2022. ista: Zisis T, Brückner D, Brandstätter T, Siow WX, d’Alessandro J, Vollmar AM, Broedersz CP, Zahler S. 2022. Disentangling cadherin-mediated cell-cell interactions in collective cancer cell migration. Biophysical Journal. 121(1), P44-60. mla: Zisis, Themistoklis, et al. “Disentangling Cadherin-Mediated Cell-Cell Interactions in Collective Cancer Cell Migration.” Biophysical Journal, vol. 121, no. 1, Elsevier, 2022, pp. P44-60, doi:10.1016/j.bpj.2021.12.006. short: T. Zisis, D. Brückner, T. Brandstätter, W.X. Siow, J. d’Alessandro, A.M. Vollmar, C.P. Broedersz, S. Zahler, Biophysical Journal 121 (2022) P44-60. date_created: 2021-12-10T09:48:19Z date_published: 2022-01-04T00:00:00Z date_updated: 2023-08-02T13:34:25Z day: '04' ddc: - '570' department: - _id: EdHa - _id: GaTk doi: 10.1016/j.bpj.2021.12.006 external_id: isi: - '000740815400007' file: - access_level: open_access checksum: 1aa7c3478e0c8256b973b632efd1f6b4 content_type: application/pdf creator: dernst date_created: 2022-07-29T10:17:10Z date_updated: 2022-07-29T10:17:10Z file_id: '11697' file_name: 2022_BiophysicalJour_Zisis.pdf file_size: 4475504 relation: main_file success: 1 file_date_updated: 2022-07-29T10:17:10Z has_accepted_license: '1' intvolume: ' 121' isi: 1 issue: '1' keyword: - Biophysics language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: P44-60 project: - _id: 9B861AAC-BA93-11EA-9121-9846C619BF3A name: NOMIS Fellowship Program publication: Biophysical Journal publication_identifier: issn: - 0006-3495 publication_status: published publisher: Elsevier quality_controlled: '1' status: public title: Disentangling cadherin-mediated cell-cell interactions in collective cancer cell migration tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 121 year: '2022' ... --- _id: '10548' abstract: - lang: eng text: "Consider a linear elliptic partial differential equation in divergence form with a random coefficient field. The solution operator displays fluctuations around its expectation. The recently developed pathwise theory of fluctuations in stochastic homogenization reduces the characterization of these fluctuations to those of the so-called standard homogenization commutator. In this contribution, we investigate the scaling limit of this key quantity: starting\r\nfrom a Gaussian-like coefficient field with possibly strong correlations, we establish the convergence of the rescaled commutator to a fractional Gaussian field, depending on the decay of correlations of the coefficient field, and we\r\ninvestigate the (non)degeneracy of the limit. This extends to general dimension $d\\ge1$ previous results so far limited to dimension $d=1$, and to the continuum setting with strong correlations recent results in the discrete iid case." acknowledgement: The authors thank Ivan Nourdin and Felix Otto for inspiring discussions. The work of MD is financially supported by the CNRS-Momentum program. Financial support of AG is acknowledged from the European Research Council under the European Community’s Seventh Framework Programme (FP7/2014-2019 Grant Agreement QUANTHOM 335410). article_processing_charge: No article_type: original author: - first_name: Mitia full_name: Duerinckx, Mitia last_name: Duerinckx - first_name: Julian L full_name: Fischer, Julian L id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87 last_name: Fischer orcid: 0000-0002-0479-558X - first_name: Antoine full_name: Gloria, Antoine last_name: Gloria citation: ama: Duerinckx M, Fischer JL, Gloria A. Scaling limit of the homogenization commutator for Gaussian coefficient  fields. Annals of applied probability. 2022;32(2):1179-1209. doi:10.1214/21-AAP1705 apa: Duerinckx, M., Fischer, J. L., & Gloria, A. (2022). Scaling limit of the homogenization commutator for Gaussian coefficient  fields. Annals of Applied Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/21-AAP1705 chicago: Duerinckx, Mitia, Julian L Fischer, and Antoine Gloria. “Scaling Limit of the Homogenization Commutator for Gaussian Coefficient  Fields.” Annals of Applied Probability. Institute of Mathematical Statistics, 2022. https://doi.org/10.1214/21-AAP1705. ieee: M. Duerinckx, J. L. Fischer, and A. Gloria, “Scaling limit of the homogenization commutator for Gaussian coefficient  fields,” Annals of applied probability, vol. 32, no. 2. Institute of Mathematical Statistics, pp. 1179–1209, 2022. ista: Duerinckx M, Fischer JL, Gloria A. 2022. Scaling limit of the homogenization commutator for Gaussian coefficient  fields. Annals of applied probability. 32(2), 1179–1209. mla: Duerinckx, Mitia, et al. “Scaling Limit of the Homogenization Commutator for Gaussian Coefficient  Fields.” Annals of Applied Probability, vol. 32, no. 2, Institute of Mathematical Statistics, 2022, pp. 1179–209, doi:10.1214/21-AAP1705. short: M. Duerinckx, J.L. Fischer, A. Gloria, Annals of Applied Probability 32 (2022) 1179–1209. date_created: 2021-12-16T12:10:16Z date_published: 2022-04-28T00:00:00Z date_updated: 2023-08-02T13:35:06Z day: '28' department: - _id: JuFi doi: 10.1214/21-AAP1705 external_id: arxiv: - '1910.04088' isi: - '000791003700011' intvolume: ' 32' isi: 1 issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1910.04088 month: '04' oa: 1 oa_version: Preprint page: 1179-1209 publication: Annals of applied probability publication_identifier: issn: - 1050-5164 publication_status: published publisher: Institute of Mathematical Statistics quality_controlled: '1' scopus_import: '1' status: public title: Scaling limit of the homogenization commutator for Gaussian coefficient fields type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 32 year: '2022' ... --- _id: '10583' abstract: - lang: eng text: The synthetic strigolactone (SL) analog, rac-GR24, has been instrumental in studying the role of SLs as well as karrikins because it activates the receptors DWARF14 (D14) and KARRIKIN INSENSITIVE 2 (KAI2) of their signaling pathways, respectively. Treatment with rac-GR24 modifies the root architecture at different levels, such as decreasing the lateral root density (LRD), while promoting root hair elongation or flavonol accumulation. Previously, we have shown that the flavonol biosynthesis is transcriptionally activated in the root by rac-GR24 treatment, but, thus far, the molecular players involved in that response have remained unknown. To get an in-depth insight into the changes that occur after the compound is perceived by the roots, we compared the root transcriptomes of the wild type and the more axillary growth2 (max2) mutant, affected in both SL and karrikin signaling pathways, with and without rac-GR24 treatment. Quantitative reverse transcription (qRT)-PCR, reporter line analysis and mutant phenotyping indicated that the flavonol response and the root hair elongation are controlled by the ELONGATED HYPOCOTYL 5 (HY5) and MYB12 transcription factors, but HY5, in contrast to MYB12, affects the LRD as well. Furthermore, we identified the transcription factors TARGET OF MONOPTEROS 5 (TMO5) and TMO5 LIKE1 as negative and the Mediator complex as positive regulators of the rac-GR24 effect on LRD. Altogether, hereby, we get closer toward understanding the molecular mechanisms that underlay the rac-GR24 responses in the root. acknowledgement: The authors thank Ralf Stracke (Bielefeld University, Bielefeld, Germany) for providing the myb mutants and their colleagues Bert De Rybel for the tmo5t;mo5l1 double mutant, Boris Parizot for tips on the RNA-seq analysis, Veronique Storme for statistical help on both the RNA-seq and lateral root density, and Martine De Cock for help in preparing the manuscript. article_processing_charge: No article_type: original author: - first_name: Sylwia full_name: Struk, Sylwia last_name: Struk - first_name: Lukas full_name: Braem, Lukas last_name: Braem - first_name: Cedrick full_name: Matthys, Cedrick last_name: Matthys - first_name: Alan full_name: Walton, Alan last_name: Walton - first_name: Nick full_name: Vangheluwe, Nick last_name: Vangheluwe - first_name: Stan full_name: Van Praet, Stan last_name: Van Praet - first_name: Lingxiang full_name: Jiang, Lingxiang last_name: Jiang - first_name: Pawel full_name: Baster, Pawel id: 3028BD74-F248-11E8-B48F-1D18A9856A87 last_name: Baster - first_name: Carolien full_name: De Cuyper, Carolien last_name: De Cuyper - first_name: Francois-Didier full_name: Boyer, Francois-Didier last_name: Boyer - first_name: Elisabeth full_name: Stes, Elisabeth last_name: Stes - first_name: Tom full_name: Beeckman, Tom last_name: Beeckman - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 - first_name: Kris full_name: Gevaert, Kris last_name: Gevaert - first_name: Sofie full_name: Goormachtig, Sofie last_name: Goormachtig citation: ama: Struk S, Braem L, Matthys C, et al. Transcriptional analysis in the Arabidopsis roots reveals new regulators that link rac-GR24 treatment with changes in flavonol accumulation, root hair elongation and lateral root density. Plant & Cell Physiology. 2022;63(1):104-119. doi:10.1093/pcp/pcab149 apa: Struk, S., Braem, L., Matthys, C., Walton, A., Vangheluwe, N., Van Praet, S., … Goormachtig, S. (2022). Transcriptional analysis in the Arabidopsis roots reveals new regulators that link rac-GR24 treatment with changes in flavonol accumulation, root hair elongation and lateral root density. Plant & Cell Physiology. Oxford University Press. https://doi.org/10.1093/pcp/pcab149 chicago: Struk, Sylwia, Lukas Braem, Cedrick Matthys, Alan Walton, Nick Vangheluwe, Stan Van Praet, Lingxiang Jiang, et al. “Transcriptional Analysis in the Arabidopsis Roots Reveals New Regulators That Link Rac-GR24 Treatment with Changes in Flavonol Accumulation, Root Hair Elongation and Lateral Root Density.” Plant & Cell Physiology. Oxford University Press, 2022. https://doi.org/10.1093/pcp/pcab149. ieee: S. Struk et al., “Transcriptional analysis in the Arabidopsis roots reveals new regulators that link rac-GR24 treatment with changes in flavonol accumulation, root hair elongation and lateral root density,” Plant & Cell Physiology, vol. 63, no. 1. Oxford University Press, pp. 104–119, 2022. ista: Struk S, Braem L, Matthys C, Walton A, Vangheluwe N, Van Praet S, Jiang L, Baster P, De Cuyper C, Boyer F-D, Stes E, Beeckman T, Friml J, Gevaert K, Goormachtig S. 2022. Transcriptional analysis in the Arabidopsis roots reveals new regulators that link rac-GR24 treatment with changes in flavonol accumulation, root hair elongation and lateral root density. Plant & Cell Physiology. 63(1), 104–119. mla: Struk, Sylwia, et al. “Transcriptional Analysis in the Arabidopsis Roots Reveals New Regulators That Link Rac-GR24 Treatment with Changes in Flavonol Accumulation, Root Hair Elongation and Lateral Root Density.” Plant & Cell Physiology, vol. 63, no. 1, Oxford University Press, 2022, pp. 104–19, doi:10.1093/pcp/pcab149. short: S. Struk, L. Braem, C. Matthys, A. Walton, N. Vangheluwe, S. Van Praet, L. Jiang, P. Baster, C. De Cuyper, F.-D. Boyer, E. Stes, T. Beeckman, J. Friml, K. Gevaert, S. Goormachtig, Plant & Cell Physiology 63 (2022) 104–119. date_created: 2021-12-28T11:44:18Z date_published: 2022-01-21T00:00:00Z date_updated: 2023-08-02T13:40:43Z day: '21' department: - _id: JiFr doi: 10.1093/pcp/pcab149 external_id: isi: - '000877899400009' pmid: - '34791413' intvolume: ' 63' isi: 1 issue: '1' keyword: - flavonols - MAX2 - rac-Gr24 - RNA-seq - root development - transcriptional regulation language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1093/pcp/pcab149 month: '01' oa: 1 oa_version: Published Version page: 104-119 pmid: 1 publication: Plant & Cell Physiology publication_identifier: eissn: - 1471-9053 issn: - 0032-0781 publication_status: published publisher: Oxford University Press quality_controlled: '1' scopus_import: '1' status: public title: Transcriptional analysis in the Arabidopsis roots reveals new regulators that link rac-GR24 treatment with changes in flavonol accumulation, root hair elongation and lateral root density type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 63 year: '2022' ... --- _id: '10588' abstract: - lang: eng text: We prove the Sobolev-to-Lipschitz property for metric measure spaces satisfying the quasi curvature-dimension condition recently introduced in Milman (Commun Pure Appl Math, to appear). We provide several applications to properties of the corresponding heat semigroup. In particular, under the additional assumption of infinitesimal Hilbertianity, we show the Varadhan short-time asymptotics for the heat semigroup with respect to the distance, and prove the irreducibility of the heat semigroup. These results apply in particular to large classes of (ideal) sub-Riemannian manifolds. acknowledgement: "The authors are grateful to Dr. Bang-Xian Han for helpful discussions on the Sobolev-to-Lipschitz property on metric measure spaces, and to Professor Kazuhiro Kuwae, Professor Emanuel Milman, Dr. Giorgio Stefani, and Dr. Gioacchino Antonelli for reading a preliminary version of this work and for their valuable comments and suggestions. Finally, they wish to express their gratitude to two anonymous Reviewers whose suggestions improved the presentation of this work.\r\n\r\nL.D.S. gratefully acknowledges funding of his position by the Austrian Science Fund (FWF) grant F65, and by the European Research Council (ERC, grant No. 716117, awarded to Prof. Dr. Jan Maas).\r\n\r\nK.S. gratefully acknowledges funding by: the JSPS Overseas Research Fellowships, Grant Nr. 290142; World Premier International Research Center Initiative (WPI), MEXT, Japan; JSPS Grant-in-Aid for Scientific Research on Innovative Areas “Discrete Geometric Analysis for Materials Design”, Grant Number 17H06465; and the Alexander von Humboldt Stiftung, Humboldt-Forschungsstipendium." article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Lorenzo full_name: Dello Schiavo, Lorenzo id: ECEBF480-9E4F-11EA-B557-B0823DDC885E last_name: Dello Schiavo orcid: 0000-0002-9881-6870 - first_name: Kohei full_name: Suzuki, Kohei last_name: Suzuki citation: ama: Dello Schiavo L, Suzuki K. Sobolev-to-Lipschitz property on QCD- spaces and applications. Mathematische Annalen. 2022;384:1815-1832. doi:10.1007/s00208-021-02331-2 apa: Dello Schiavo, L., & Suzuki, K. (2022). Sobolev-to-Lipschitz property on QCD- spaces and applications. Mathematische Annalen. Springer Nature. https://doi.org/10.1007/s00208-021-02331-2 chicago: Dello Schiavo, Lorenzo, and Kohei Suzuki. “Sobolev-to-Lipschitz Property on QCD- Spaces and Applications.” Mathematische Annalen. Springer Nature, 2022. https://doi.org/10.1007/s00208-021-02331-2. ieee: L. Dello Schiavo and K. Suzuki, “Sobolev-to-Lipschitz property on QCD- spaces and applications,” Mathematische Annalen, vol. 384. Springer Nature, pp. 1815–1832, 2022. ista: Dello Schiavo L, Suzuki K. 2022. Sobolev-to-Lipschitz property on QCD- spaces and applications. Mathematische Annalen. 384, 1815–1832. mla: Dello Schiavo, Lorenzo, and Kohei Suzuki. “Sobolev-to-Lipschitz Property on QCD- Spaces and Applications.” Mathematische Annalen, vol. 384, Springer Nature, 2022, pp. 1815–32, doi:10.1007/s00208-021-02331-2. short: L. Dello Schiavo, K. Suzuki, Mathematische Annalen 384 (2022) 1815–1832. date_created: 2022-01-02T23:01:35Z date_published: 2022-12-01T00:00:00Z date_updated: 2023-08-02T13:39:05Z day: '01' ddc: - '510' department: - _id: JaMa doi: 10.1007/s00208-021-02331-2 ec_funded: 1 external_id: arxiv: - '2110.05137' isi: - '000734150200001' file: - access_level: open_access checksum: 2593abbf195e38efa93b6006b1e90eb1 content_type: application/pdf creator: alisjak date_created: 2022-01-03T11:08:31Z date_updated: 2022-01-03T11:08:31Z file_id: '10596' file_name: 2021_MathAnn_DelloSchiavo.pdf file_size: 410090 relation: main_file success: 1 file_date_updated: 2022-01-03T11:08:31Z has_accepted_license: '1' intvolume: ' 384' isi: 1 keyword: - quasi curvature-dimension condition - sub-riemannian geometry - Sobolev-to-Lipschitz property - Varadhan short-time asymptotics language: - iso: eng month: '12' oa: 1 oa_version: Published Version page: 1815-1832 project: - _id: 256E75B8-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '716117' name: Optimal Transport and Stochastic Dynamics - _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2 grant_number: F6504 name: Taming Complexity in Partial Differential Systems - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund publication: Mathematische Annalen publication_identifier: eissn: - 1432-1807 issn: - 0025-5831 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Sobolev-to-Lipschitz property on QCD- spaces and applications 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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 384 year: '2022' ... --- _id: '10602' abstract: - lang: eng text: Transforming ω-automata into parity automata is traditionally done using appearance records. We present an efficient variant of this idea, tailored to Rabin automata, and several optimizations applicable to all appearance records. We compare the methods experimentally and show that our method produces significantly smaller automata than previous approaches. acknowledgement: This work is partially funded by the German Research Foundation (DFG) projects Verified Model Checkers (No. 317422601) and Statistical Unbounded Verification (No. 383882557), and the Alexander von Humboldt Foundation with funds from the German Federal Ministry of Education and Research. It is an extended version of [21], including all proofs together with further explanations and examples. Moreover, we provide a new, more efficient construction based on (total) preorders, unifying previous optimizations. Experiments are performed with a new, performant implementation, comparing our approach to the current state of the art. article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Jan full_name: Kretinsky, Jan id: 44CEF464-F248-11E8-B48F-1D18A9856A87 last_name: Kretinsky orcid: 0000-0002-8122-2881 - first_name: Tobias full_name: Meggendorfer, Tobias id: b21b0c15-30a2-11eb-80dc-f13ca25802e1 last_name: Meggendorfer orcid: 0000-0002-1712-2165 - first_name: Clara full_name: Waldmann, Clara last_name: Waldmann - first_name: Maximilian full_name: Weininger, Maximilian last_name: Weininger citation: ama: Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. Index appearance record with preorders. Acta Informatica. 2022;59:585-618. doi:10.1007/s00236-021-00412-y apa: Kretinsky, J., Meggendorfer, T., Waldmann, C., & Weininger, M. (2022). Index appearance record with preorders. Acta Informatica. Springer Nature. https://doi.org/10.1007/s00236-021-00412-y chicago: Kretinsky, Jan, Tobias Meggendorfer, Clara Waldmann, and Maximilian Weininger. “Index Appearance Record with Preorders.” Acta Informatica. Springer Nature, 2022. https://doi.org/10.1007/s00236-021-00412-y. ieee: J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance record with preorders,” Acta Informatica, vol. 59. Springer Nature, pp. 585–618, 2022. ista: Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. 2022. Index appearance record with preorders. Acta Informatica. 59, 585–618. mla: Kretinsky, Jan, et al. “Index Appearance Record with Preorders.” Acta Informatica, vol. 59, Springer Nature, 2022, pp. 585–618, doi:10.1007/s00236-021-00412-y. short: J. Kretinsky, T. Meggendorfer, C. Waldmann, M. Weininger, Acta Informatica 59 (2022) 585–618. date_created: 2022-01-06T12:37:27Z date_published: 2022-10-01T00:00:00Z date_updated: 2023-08-02T13:49:28Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.1007/s00236-021-00412-y external_id: isi: - '000735765500001' file: - access_level: open_access checksum: bf1c195b6aaf59e8530cf9e3a9d731f7 content_type: application/pdf creator: cchlebak date_created: 2022-01-07T07:50:31Z date_updated: 2022-01-07T07:50:31Z file_id: '10603' file_name: 2021_ActaInfor_Křetínský.pdf file_size: 1066082 relation: main_file success: 1 file_date_updated: 2022-01-07T07:50:31Z has_accepted_license: '1' intvolume: ' 59' isi: 1 keyword: - computer networks and communications - information systems - software language: - iso: eng month: '10' oa: 1 oa_version: Published Version page: 585-618 project: - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund publication: Acta Informatica publication_identifier: eissn: - 1432-0525 issn: - 0001-5903 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Index appearance record with preorders 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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 59 year: '2022' ... --- _id: '10600' abstract: - lang: eng text: We show that recent results on adiabatic theory for interacting gapped many-body systems on finite lattices remain valid in the thermodynamic limit. More precisely, we prove a generalized super-adiabatic theorem for the automorphism group describing the infinite volume dynamics on the quasi-local algebra of observables. The key assumption is the existence of a sequence of gapped finite volume Hamiltonians, which generates the same infinite volume dynamics in the thermodynamic limit. Our adiabatic theorem also holds for certain perturbations of gapped ground states that close the spectral gap (so it is also an adiabatic theorem for resonances and, in this sense, “generalized”), and it provides an adiabatic approximation to all orders in the adiabatic parameter (a property often called “super-adiabatic”). In addition to the existing results for finite lattices, we also perform a resummation of the adiabatic expansion and allow for observables that are not strictly local. Finally, as an application, we prove the validity of linear and higher order response theory for our class of perturbations for infinite systems. While we consider the result and its proof as new and interesting in itself, we also lay the foundation for the proof of an adiabatic theorem for systems with a gap only in the bulk, which will be presented in a follow-up article. acknowledgement: J.H. acknowledges partial financial support from ERC Advanced Grant “RMTBeyond” No. 101020331. article_number: '011901' article_processing_charge: No article_type: original author: - first_name: Sven Joscha full_name: Henheik, Sven Joscha id: 31d731d7-d235-11ea-ad11-b50331c8d7fb last_name: Henheik orcid: 0000-0003-1106-327X - first_name: Stefan full_name: Teufel, Stefan last_name: Teufel citation: ama: 'Henheik SJ, Teufel S. Adiabatic theorem in the thermodynamic limit: Systems with a uniform gap. Journal of Mathematical Physics. 2022;63(1). doi:10.1063/5.0051632' apa: 'Henheik, S. J., & Teufel, S. (2022). Adiabatic theorem in the thermodynamic limit: Systems with a uniform gap. Journal of Mathematical Physics. AIP Publishing. https://doi.org/10.1063/5.0051632' chicago: 'Henheik, Sven Joscha, and Stefan Teufel. “Adiabatic Theorem in the Thermodynamic Limit: Systems with a Uniform Gap.” Journal of Mathematical Physics. AIP Publishing, 2022. https://doi.org/10.1063/5.0051632.' ieee: 'S. J. Henheik and S. Teufel, “Adiabatic theorem in the thermodynamic limit: Systems with a uniform gap,” Journal of Mathematical Physics, vol. 63, no. 1. AIP Publishing, 2022.' ista: 'Henheik SJ, Teufel S. 2022. Adiabatic theorem in the thermodynamic limit: Systems with a uniform gap. Journal of Mathematical Physics. 63(1), 011901.' mla: 'Henheik, Sven Joscha, and Stefan Teufel. “Adiabatic Theorem in the Thermodynamic Limit: Systems with a Uniform Gap.” Journal of Mathematical Physics, vol. 63, no. 1, 011901, AIP Publishing, 2022, doi:10.1063/5.0051632.' short: S.J. Henheik, S. Teufel, Journal of Mathematical Physics 63 (2022). date_created: 2022-01-03T12:19:48Z date_published: 2022-01-03T00:00:00Z date_updated: 2023-08-02T13:44:32Z day: '03' department: - _id: GradSch - _id: LaEr doi: 10.1063/5.0051632 ec_funded: 1 external_id: arxiv: - '2012.15238' isi: - '000739446000009' intvolume: ' 63' isi: 1 issue: '1' keyword: - mathematical physics - statistical and nonlinear physics language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2012.15238 month: '01' oa: 1 oa_version: Preprint project: - _id: 62796744-2b32-11ec-9570-940b20777f1d call_identifier: H2020 grant_number: '101020331' name: Random matrices beyond Wigner-Dyson-Mehta publication: Journal of Mathematical Physics publication_identifier: eissn: - 1089-7658 issn: - 0022-2488 publication_status: published publisher: AIP Publishing quality_controlled: '1' status: public title: 'Adiabatic theorem in the thermodynamic limit: Systems with a uniform gap' type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 63 year: '2022' ... --- _id: '10587' abstract: - lang: eng text: Access to a blossoming library of colloidal nanomaterials provides building blocks for complex assembled materials. The journey to bring these prospects to fruition stands to benefit from the application of advanced processing methods. Epitaxially connected nanocrystal (or quantum dot) superlattices present a captivating model system for mesocrystals with intriguing emergent properties. The conventional processing approach to creating these materials involves assembling and attaching the constituent nanocrystals at the interface between two immiscible fluids. Processing small liquid volumes of the colloidal nanocrystal solution involves several complexities arising from the concurrent spreading, evaporation, assembly, and attachment. The ability of inkjet printers to deliver small (typically picoliter) liquid volumes with precise positioning is attractive to advance fundamental insights into the processing science, and thereby potentially enable new routes to incorporate the epitaxially connected superlattices into technology platforms. In this study, we identified the processing window of opportunity, including nanocrystal ink formulation and printing approach to enable delivery of colloidal nanocrystals from an inkjet nozzle onto the surface of a sessile droplet of the immiscible subphase. We demonstrate how inkjet printing can be scaled-down to enable the fabrication of epitaxially connected superlattices on patterned sub-millimeter droplets. We anticipate that insights from this work will spur on future advances to enable more mechanistic insights into the assembly processes and new avenues to create high-fidelity superlattices. acknowledgement: This project was supported by the US Department of Energy through award (No. DE-SC0018026). The work was performed in part at the Cornell NanoScale Facility, a member of the National Nanotechnology Coordinated Infrastructure (NNCI), which is supported by the National Science Foundation (No. NNCI-1542081) and in part at the Cornell Center for Materials Research with funding from the NSF MRSEC program (No. DMR-1719875). The authors thank Beth Rhodes for the technical assistance with inkjet printing, and E. Peretz and Q. Wen for the early exploratory experiments. article_processing_charge: No article_type: original author: - first_name: Daniel full_name: Balazs, Daniel id: 302BADF6-85FC-11EA-9E3B-B9493DDC885E last_name: Balazs orcid: 0000-0001-7597-043X - first_name: N. Deniz full_name: Erkan, N. Deniz last_name: Erkan - first_name: Michelle full_name: Quien, Michelle last_name: Quien - first_name: Tobias full_name: Hanrath, Tobias last_name: Hanrath citation: ama: Balazs D, Erkan ND, Quien M, Hanrath T. Inkjet printing of epitaxially connected nanocrystal superlattices. Nano Research. 2022;15(5):4536–4543. doi:10.1007/s12274-021-4022-7 apa: Balazs, D., Erkan, N. D., Quien, M., & Hanrath, T. (2022). Inkjet printing of epitaxially connected nanocrystal superlattices. Nano Research. Springer Nature. https://doi.org/10.1007/s12274-021-4022-7 chicago: Balazs, Daniel, N. Deniz Erkan, Michelle Quien, and Tobias Hanrath. “Inkjet Printing of Epitaxially Connected Nanocrystal Superlattices.” Nano Research. Springer Nature, 2022. https://doi.org/10.1007/s12274-021-4022-7. ieee: D. Balazs, N. D. Erkan, M. Quien, and T. Hanrath, “Inkjet printing of epitaxially connected nanocrystal superlattices,” Nano Research, vol. 15, no. 5. Springer Nature, pp. 4536–4543, 2022. ista: Balazs D, Erkan ND, Quien M, Hanrath T. 2022. Inkjet printing of epitaxially connected nanocrystal superlattices. Nano Research. 15(5), 4536–4543. mla: Balazs, Daniel, et al. “Inkjet Printing of Epitaxially Connected Nanocrystal Superlattices.” Nano Research, vol. 15, no. 5, Springer Nature, 2022, pp. 4536–4543, doi:10.1007/s12274-021-4022-7. short: D. Balazs, N.D. Erkan, M. Quien, T. Hanrath, Nano Research 15 (2022) 4536–4543. date_created: 2022-01-02T23:01:34Z date_published: 2022-05-01T00:00:00Z date_updated: 2023-08-02T13:47:21Z day: '01' department: - _id: MaIb doi: 10.1007/s12274-021-4022-7 external_id: isi: - '000735340300001' intvolume: ' 15' isi: 1 issue: '5' keyword: - interfacial assembly - colloidal nanocrystal - superlattice - inkjet printing language: - iso: eng main_file_link: - open_access: '1' url: https://www.osti.gov/biblio/1837946 month: '05' oa: 1 oa_version: Submitted Version page: 4536–4543 publication: Nano Research publication_identifier: eissn: - 1998-0000 issn: - 1998-0124 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Inkjet printing of epitaxially connected nanocrystal superlattices type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 15 year: '2022' ... --- _id: '10547' abstract: - lang: eng text: "We establish global-in-time existence results for thermodynamically consistent reaction-(cross-)diffusion systems coupled to an equation describing heat transfer. Our main interest is to model species-dependent diffusivities,\r\nwhile at the same time ensuring thermodynamic consistency. A key difficulty of the non-isothermal case lies in the intrinsic presence of cross-diffusion type phenomena like the Soret and the Dufour effect: due to the temperature/energy dependence of the thermodynamic equilibria, a nonvanishing temperature gradient may drive a concentration flux even in a situation with constant concentrations; likewise, a nonvanishing concentration gradient may drive a heat flux even in a case of spatially constant temperature. We use time discretisation and regularisation techniques and derive a priori estimates based on a suitable entropy and the associated entropy production. Renormalised solutions are used in cases where non-integrable diffusion fluxes or reaction terms appear." acknowledgement: M.K. gratefully acknowledges the hospitality of WIAS Berlin, where a major part of the project was carried out. The research stay of M.K. at WIAS Berlin was funded by the Austrian Federal Ministry of Education, Science and Research through a research fellowship for graduates of a promotio sub auspiciis. The research of A.M. has been partially supported by Deutsche Forschungsgemeinschaft (DFG) through the Collaborative Research Center SFB 1114 “Scaling Cascades in Complex Systems” (Project no. 235221301), Subproject C05 “Effective models for materials and interfaces with multiple scales”. J.F. and A.M. are grateful for the hospitality of the Erwin Schrödinger Institute in Vienna, where some ideas for this work have been developed. The authors are grateful to two anonymous referees for several helpful comments, in particular for the short proof of estimate (2.7). article_processing_charge: No article_type: original author: - first_name: Julian L full_name: Fischer, Julian L id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87 last_name: Fischer orcid: 0000-0002-0479-558X - first_name: Katharina full_name: Hopf, Katharina last_name: Hopf - first_name: Michael full_name: Kniely, Michael id: 2CA2C08C-F248-11E8-B48F-1D18A9856A87 last_name: Kniely orcid: 0000-0001-5645-4333 - first_name: Alexander full_name: Mielke, Alexander last_name: Mielke citation: ama: Fischer JL, Hopf K, Kniely M, Mielke A. Global existence analysis of energy-reaction-diffusion systems. SIAM Journal on Mathematical Analysis. 2022;54(1):220-267. doi:10.1137/20M1387237 apa: Fischer, J. L., Hopf, K., Kniely, M., & Mielke, A. (2022). Global existence analysis of energy-reaction-diffusion systems. SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/20M1387237 chicago: Fischer, Julian L, Katharina Hopf, Michael Kniely, and Alexander Mielke. “Global Existence Analysis of Energy-Reaction-Diffusion Systems.” SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics, 2022. https://doi.org/10.1137/20M1387237. ieee: J. L. Fischer, K. Hopf, M. Kniely, and A. Mielke, “Global existence analysis of energy-reaction-diffusion systems,” SIAM Journal on Mathematical Analysis, vol. 54, no. 1. Society for Industrial and Applied Mathematics, pp. 220–267, 2022. ista: Fischer JL, Hopf K, Kniely M, Mielke A. 2022. Global existence analysis of energy-reaction-diffusion systems. SIAM Journal on Mathematical Analysis. 54(1), 220–267. mla: Fischer, Julian L., et al. “Global Existence Analysis of Energy-Reaction-Diffusion Systems.” SIAM Journal on Mathematical Analysis, vol. 54, no. 1, Society for Industrial and Applied Mathematics, 2022, pp. 220–67, doi:10.1137/20M1387237. short: J.L. Fischer, K. Hopf, M. Kniely, A. Mielke, SIAM Journal on Mathematical Analysis 54 (2022) 220–267. date_created: 2021-12-16T12:08:56Z date_published: 2022-01-04T00:00:00Z date_updated: 2023-08-02T13:37:03Z day: '04' department: - _id: JuFi doi: 10.1137/20M1387237 external_id: arxiv: - '2012.03792 ' isi: - '000762768000006' intvolume: ' 54' isi: 1 issue: '1' keyword: - Energy-Reaction-Diffusion Systems - Cross Diffusion - Global-In-Time Existence of Weak/Renormalised Solutions - Entropy Method - Onsager System - Soret/Dufour Effect language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2012.03792 month: '01' oa: 1 oa_version: Preprint page: 220-267 publication: SIAM Journal on Mathematical Analysis publication_identifier: issn: - 0036-1410 publication_status: published publisher: Society for Industrial and Applied Mathematics quality_controlled: '1' scopus_import: '1' status: public title: Global existence analysis of energy-reaction-diffusion systems type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 54 year: '2022' ... --- _id: '10604' abstract: - lang: eng text: Maternally inherited Wolbachia transinfections are being introduced into natural mosquito populations to reduce the transmission of dengue, Zika, and other arboviruses. Wolbachia-induced cytoplasmic incompatibility provides a frequency-dependent reproductive advantage to infected females that can spread transinfections within and among populations. However, because transinfections generally reduce host fitness, they tend to spread within populations only after their frequency exceeds a critical threshold. This produces bistability with stable equilibrium frequencies at both 0 and 1, analogous to the bistability produced by underdominance between alleles or karyotypes and by population dynamics under Allee effects. Here, we analyze how stochastic frequency variation produced by finite population size can facilitate the local spread of variants with bistable dynamics into areas where invasion is unexpected from deterministic models. Our exemplar is the establishment of wMel Wolbachia in the Aedes aegypti population of Pyramid Estates (PE), a small community in far north Queensland, Australia. In 2011, wMel was stably introduced into Gordonvale, separated from PE by barriers to A. aegypti dispersal. After nearly 6 years during which wMel was observed only at low frequencies in PE, corresponding to an apparent equilibrium between immigration and selection, wMel rose to fixation by 2018. Using analytic approximations and statistical analyses, we demonstrate that the observed fixation of wMel at PE is consistent with both stochastic transition past an unstable threshold frequency and deterministic transformation produced by steady immigration at a rate just above the threshold required for deterministic invasion. The indeterminacy results from a delicate balance of parameters needed to produce the delayed transition observed. Our analyses suggest that once Wolbachia transinfections are established locally through systematic introductions, stochastic “threshold crossing” is likely to only minimally enhance spatial spread, providing a local ratchet that slightly—but systematically—aids area-wide transformation of disease-vector populations in heterogeneous landscapes. acknowledgement: We thank S. O'Neill, C. Simmons, and the World Mosquito Project for providing access to unpublished data. S. Ritchie provided valuable insights into Aedes aegypti biology and the literature describing A. aegypti populations near Cairns. We thank B. Cooper for help with the figures and D. Shropshire, S. O'Neill, S. Ritchie, A. Hoffmann, B. Cooper, and members of the Cooper lab for comments on an earlier draft. Comments from three reviewers greatly improved our presentation. article_processing_charge: No article_type: original author: - first_name: Michael full_name: Turelli, Michael last_name: Turelli - first_name: Nicholas H full_name: Barton, Nicholas H id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 citation: ama: Turelli M, Barton NH. Why did the Wolbachia transinfection cross the road? Drift, deterministic dynamics, and disease control. Evolution Letters. 2022;6(1):92-105. doi:10.1002/evl3.270 apa: Turelli, M., & Barton, N. H. (2022). Why did the Wolbachia transinfection cross the road? Drift, deterministic dynamics, and disease control. Evolution Letters. Wiley. https://doi.org/10.1002/evl3.270 chicago: Turelli, Michael, and Nicholas H Barton. “Why Did the Wolbachia Transinfection Cross the Road? Drift, Deterministic Dynamics, and Disease Control.” Evolution Letters. Wiley, 2022. https://doi.org/10.1002/evl3.270. ieee: M. Turelli and N. H. Barton, “Why did the Wolbachia transinfection cross the road? Drift, deterministic dynamics, and disease control,” Evolution Letters, vol. 6, no. 1. Wiley, pp. 92–105, 2022. ista: Turelli M, Barton NH. 2022. Why did the Wolbachia transinfection cross the road? Drift, deterministic dynamics, and disease control. Evolution Letters. 6(1), 92–105. mla: Turelli, Michael, and Nicholas H. Barton. “Why Did the Wolbachia Transinfection Cross the Road? Drift, Deterministic Dynamics, and Disease Control.” Evolution Letters, vol. 6, no. 1, Wiley, 2022, pp. 92–105, doi:10.1002/evl3.270. short: M. Turelli, N.H. Barton, Evolution Letters 6 (2022) 92–105. date_created: 2022-01-09T09:45:17Z date_published: 2022-02-01T00:00:00Z date_updated: 2023-08-02T13:50:09Z day: '01' ddc: - '570' department: - _id: NiBa doi: 10.1002/evl3.270 external_id: isi: - '000754412600008' file: - access_level: open_access checksum: 7e9a37e3b65b480cd7014a6a4a7e460a content_type: application/pdf creator: dernst date_created: 2022-07-29T06:59:10Z date_updated: 2022-07-29T06:59:10Z file_id: '11689' file_name: 2022_EvolutionLetters_Turelli.pdf file_size: 2435185 relation: main_file success: 1 file_date_updated: 2022-07-29T06:59:10Z has_accepted_license: '1' intvolume: ' 6' isi: 1 issue: '1' keyword: - genetics - ecology - evolution - behavior and systematics language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: 92-105 publication: Evolution Letters publication_identifier: eissn: - 2056-3744 publication_status: published publisher: Wiley quality_controlled: '1' related_material: record: - id: '11686' relation: research_data status: public status: public title: Why did the Wolbachia transinfection cross the road? Drift, deterministic dynamics, and disease control type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 6 year: '2022' ... --- _id: '10639' abstract: - lang: eng text: With more than 80 members worldwide, the Orthobunyavirus genus in the Peribunyaviridae family is a large genus of enveloped RNA viruses, many of which are emerging pathogens in humans and livestock. How orthobunyaviruses (OBVs) penetrate and infect mammalian host cells remains poorly characterized. Here, we investigated the entry mechanisms of the OBV Germiston (GERV). Viral particles were visualized by cryo-electron microscopy and appeared roughly spherical with an average diameter of 98 nm. Labeling of the virus with fluorescent dyes did not adversely affect its infectivity and allowed the monitoring of single particles in fixed and live cells. Using this approach, we found that endocytic internalization of bound viruses was asynchronous and occurred within 30-40 min. The virus entered Rab5a+ early endosomes and, subsequently, late endosomal vacuoles containing Rab7a but not LAMP-1. Infectious entry did not require proteolytic cleavage, and endosomal acidification was sufficient and necessary for viral fusion. Acid-activated penetration began 15-25 min after initiation of virus internalization and relied on maturation of early endosomes to late endosomes. The optimal pH for viral membrane fusion was slightly below 6.0, and penetration was hampered when the potassium influx was abolished. Overall, our study provides real-time visualization of GERV entry into host cells and demonstrates the importance of late endosomal maturation in facilitating OBV penetration. acknowledged_ssus: - _id: EM-Fac acknowledgement: This work was supported by INRAE starter funds, Project IDEXLYON (University of Lyon) within the Programme Investissements d’Avenir (ANR-16-IDEX-0005), and FINOVIAO14 (Fondation pour l’Université de Lyon), all to P.Y.L. This work was also supported by CellNetworks Research Group funds and Deutsche Forschungsgemeinschaft (DFG) funding (grant numbers LO-2338/1-1 and LO-2338/3-1) awarded to P.Y.L., Austrian Science Fund (FWF) grant P31445 to F.K.M.S., a Chinese Scholarship Council (CSC;no. 201904910701) fellowship to Q.X., and a ministére de l’enseignement supérieur, de la recherche et de l’innovation (MESRI) doctoral thesis grant to M.D. article_number: e02146-21 article_processing_charge: No article_type: original author: - first_name: Stefan full_name: Windhaber, Stefan last_name: Windhaber - first_name: Qilin full_name: Xin, Qilin last_name: Xin - first_name: Zina M. full_name: Uckeley, Zina M. last_name: Uckeley - first_name: Jana full_name: Koch, Jana last_name: Koch - first_name: Martin full_name: Obr, Martin id: 4741CA5A-F248-11E8-B48F-1D18A9856A87 last_name: Obr - first_name: Céline full_name: Garnier, Céline last_name: Garnier - first_name: Catherine full_name: Luengo-Guyonnot, Catherine last_name: Luengo-Guyonnot - first_name: Maëva full_name: Duboeuf, Maëva last_name: Duboeuf - first_name: Florian KM full_name: Schur, Florian KM id: 48AD8942-F248-11E8-B48F-1D18A9856A87 last_name: Schur orcid: 0000-0003-4790-8078 - first_name: Pierre-Yves full_name: Lozach, Pierre-Yves last_name: Lozach citation: ama: Windhaber S, Xin Q, Uckeley ZM, et al. The Orthobunyavirus Germiston enters host cells from late endosomes. Journal of Virology. 2022;96(5). doi:10.1128/jvi.02146-21 apa: Windhaber, S., Xin, Q., Uckeley, Z. M., Koch, J., Obr, M., Garnier, C., … Lozach, P.-Y. (2022). The Orthobunyavirus Germiston enters host cells from late endosomes. Journal of Virology. American Society for Microbiology. https://doi.org/10.1128/jvi.02146-21 chicago: Windhaber, Stefan, Qilin Xin, Zina M. Uckeley, Jana Koch, Martin Obr, Céline Garnier, Catherine Luengo-Guyonnot, Maëva Duboeuf, Florian KM Schur, and Pierre-Yves Lozach. “The Orthobunyavirus Germiston Enters Host Cells from Late Endosomes.” Journal of Virology. American Society for Microbiology, 2022. https://doi.org/10.1128/jvi.02146-21. ieee: S. Windhaber et al., “The Orthobunyavirus Germiston enters host cells from late endosomes,” Journal of Virology, vol. 96, no. 5. American Society for Microbiology, 2022. ista: Windhaber S, Xin Q, Uckeley ZM, Koch J, Obr M, Garnier C, Luengo-Guyonnot C, Duboeuf M, Schur FK, Lozach P-Y. 2022. The Orthobunyavirus Germiston enters host cells from late endosomes. Journal of Virology. 96(5), e02146-21. mla: Windhaber, Stefan, et al. “The Orthobunyavirus Germiston Enters Host Cells from Late Endosomes.” Journal of Virology, vol. 96, no. 5, e02146-21, American Society for Microbiology, 2022, doi:10.1128/jvi.02146-21. short: S. Windhaber, Q. Xin, Z.M. Uckeley, J. Koch, M. Obr, C. Garnier, C. Luengo-Guyonnot, M. Duboeuf, F.K. Schur, P.-Y. Lozach, Journal of Virology 96 (2022). date_created: 2022-01-18T10:04:18Z date_published: 2022-03-01T00:00:00Z date_updated: 2023-08-02T13:52:33Z day: '01' department: - _id: FlSc doi: 10.1128/jvi.02146-21 external_id: isi: - '000779305000033' pmid: - '35019710' intvolume: ' 96' isi: 1 issue: '5' keyword: - virology - insect science - immunology - microbiology language: - iso: eng main_file_link: - open_access: '1' url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8906410 month: '03' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 26736D6A-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P31445 name: Structural conservation and diversity in retroviral capsid publication: Journal of Virology publication_identifier: eissn: - 1098-5514 issn: - 0022-538X publication_status: published publisher: American Society for Microbiology quality_controlled: '1' scopus_import: '1' status: public title: The Orthobunyavirus Germiston enters host cells from late endosomes type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 96 year: '2022' ... --- _id: '10642' abstract: - lang: eng text: Based on a result by Yarotsky (J Stat Phys 118, 2005), we prove that localized but otherwise arbitrary perturbations of weakly interacting quantum spin systems with uniformly gapped on-site terms change the ground state of such a system only locally, even if they close the spectral gap. We call this a strong version of the local perturbations perturb locally (LPPL) principle which is known to hold for much more general gapped systems, but only for perturbations that do not close the spectral gap of the Hamiltonian. We also extend this strong LPPL-principle to Hamiltonians that have the appropriate structure of gapped on-site terms and weak interactions only locally in some region of space. While our results are technically corollaries to a theorem of Yarotsky, we expect that the paradigm of systems with a locally gapped ground state that is completely insensitive to the form of the Hamiltonian elsewhere extends to other situations and has important physical consequences. acknowledgement: J. H. acknowledges partial financial support by the ERC Advanced Grant “RMTBeyond” No. 101020331. S. T. thanks Marius Lemm and Simone Warzel for very helpful comments and discussions and Jürg Fröhlich for references to the literature. Open Access funding enabled and organized by Projekt DEAL. article_number: '9' article_processing_charge: No article_type: original author: - first_name: Sven Joscha full_name: Henheik, Sven Joscha id: 31d731d7-d235-11ea-ad11-b50331c8d7fb last_name: Henheik orcid: 0000-0003-1106-327X - first_name: Stefan full_name: Teufel, Stefan last_name: Teufel - first_name: Tom full_name: Wessel, Tom last_name: Wessel citation: ama: Henheik SJ, Teufel S, Wessel T. Local stability of ground states in locally gapped and weakly interacting quantum spin systems. Letters in Mathematical Physics. 2022;112(1). doi:10.1007/s11005-021-01494-y apa: Henheik, S. J., Teufel, S., & Wessel, T. (2022). Local stability of ground states in locally gapped and weakly interacting quantum spin systems. Letters in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s11005-021-01494-y chicago: Henheik, Sven Joscha, Stefan Teufel, and Tom Wessel. “Local Stability of Ground States in Locally Gapped and Weakly Interacting Quantum Spin Systems.” Letters in Mathematical Physics. Springer Nature, 2022. https://doi.org/10.1007/s11005-021-01494-y. ieee: S. J. Henheik, S. Teufel, and T. Wessel, “Local stability of ground states in locally gapped and weakly interacting quantum spin systems,” Letters in Mathematical Physics, vol. 112, no. 1. Springer Nature, 2022. ista: Henheik SJ, Teufel S, Wessel T. 2022. Local stability of ground states in locally gapped and weakly interacting quantum spin systems. Letters in Mathematical Physics. 112(1), 9. mla: Henheik, Sven Joscha, et al. “Local Stability of Ground States in Locally Gapped and Weakly Interacting Quantum Spin Systems.” Letters in Mathematical Physics, vol. 112, no. 1, 9, Springer Nature, 2022, doi:10.1007/s11005-021-01494-y. short: S.J. Henheik, S. Teufel, T. Wessel, Letters in Mathematical Physics 112 (2022). date_created: 2022-01-18T16:18:25Z date_published: 2022-01-18T00:00:00Z date_updated: 2023-08-02T13:57:02Z day: '18' ddc: - '530' department: - _id: GradSch - _id: LaEr doi: 10.1007/s11005-021-01494-y ec_funded: 1 external_id: arxiv: - '2106.13780' isi: - '000744930400001' file: - access_level: open_access checksum: 7e8e69b76e892c305071a4736131fe18 content_type: application/pdf creator: cchlebak date_created: 2022-01-19T09:41:14Z date_updated: 2022-01-19T09:41:14Z file_id: '10647' file_name: 2022_LettersMathPhys_Henheik.pdf file_size: 357547 relation: main_file success: 1 file_date_updated: 2022-01-19T09:41:14Z has_accepted_license: '1' intvolume: ' 112' isi: 1 issue: '1' keyword: - mathematical physics - statistical and nonlinear physics language: - iso: eng month: '01' oa: 1 oa_version: Published Version project: - _id: 62796744-2b32-11ec-9570-940b20777f1d call_identifier: H2020 grant_number: '101020331' name: Random matrices beyond Wigner-Dyson-Mehta publication: Letters in Mathematical Physics publication_identifier: eissn: - 1573-0530 issn: - 0377-9017 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Local stability of ground states in locally gapped and weakly interacting quantum spin systems 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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 112 year: '2022' ...