--- _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 license: https://creativecommons.org/licenses/by/4.0/ 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: '11051' abstract: - lang: eng text: Nuclear pore complexes (NPCs) bridge the nucleus and the cytoplasm and are indispensable for crucial cellular activities, such as bidirectional molecular trafficking and gene transcription regulation. The discovery of long-lived proteins (LLPs) in NPCs from postmitotic cells raises the exciting possibility that the maintenance of NPC integrity might play an inherent role in lifelong cell function. Age-dependent deterioration of NPCs and loss of nuclear integrity have been linked to age-related decline in postmitotic cell function and degenerative diseases. In this review, we discuss our current understanding of NPC maintenance in proliferating and postmitotic cells, and how malfunction of nucleoporins (Nups) might contribute to the pathogenesis of various neurodegenerative and cardiovascular diseases. article_processing_charge: No article_type: review author: - first_name: Jinqiang full_name: Liu, Jinqiang last_name: Liu - first_name: Martin W full_name: HETZER, Martin W id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed last_name: HETZER orcid: 0000-0002-2111-992X citation: ama: Liu J, Hetzer M. Nuclear pore complex maintenance and implications for age-related diseases. Trends in Cell Biology. 2022;32(3):P216-227. doi:10.1016/j.tcb.2021.10.001 apa: Liu, J., & Hetzer, M. (2022). Nuclear pore complex maintenance and implications for age-related diseases. Trends in Cell Biology. Elsevier. https://doi.org/10.1016/j.tcb.2021.10.001 chicago: Liu, Jinqiang, and Martin Hetzer. “Nuclear Pore Complex Maintenance and Implications for Age-Related Diseases.” Trends in Cell Biology. Elsevier, 2022. https://doi.org/10.1016/j.tcb.2021.10.001. ieee: J. Liu and M. Hetzer, “Nuclear pore complex maintenance and implications for age-related diseases,” Trends in Cell Biology, vol. 32, no. 3. Elsevier, pp. P216-227, 2022. ista: Liu J, Hetzer M. 2022. Nuclear pore complex maintenance and implications for age-related diseases. Trends in Cell Biology. 32(3), P216-227. mla: Liu, Jinqiang, and Martin Hetzer. “Nuclear Pore Complex Maintenance and Implications for Age-Related Diseases.” Trends in Cell Biology, vol. 32, no. 3, Elsevier, 2022, pp. P216-227, doi:10.1016/j.tcb.2021.10.001. short: J. Liu, M. Hetzer, Trends in Cell Biology 32 (2022) P216-227. date_created: 2022-04-07T07:43:01Z date_published: 2022-03-01T00:00:00Z date_updated: 2022-07-18T08:58:33Z day: '01' doi: 10.1016/j.tcb.2021.10.001 extern: '1' external_id: pmid: - '34782239' intvolume: ' 32' issue: '3' keyword: - Cell Biology language: - iso: eng month: '03' oa_version: None page: P216-227 pmid: 1 publication: Trends in Cell Biology publication_identifier: issn: - 0962-8924 publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: Nuclear pore complex maintenance and implications for age-related diseases type: journal_article user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd volume: 32 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: '11429' abstract: - lang: eng text: "This book constitutes the refereed proceedings of the 18th International Symposium on Web and Wireless Geographical Information Systems, W2GIS 2022, held in Konstanz, Germany, in April 2022.\r\nThe 7 full papers presented together with 6 short papers in the volume were carefully reviewed and selected from 16 submissions. \ The papers cover topics that range from mobile GIS and Location-Based Services to Spatial Information Retrieval and Wireless Sensor Networks." alternative_title: - LNCS article_processing_charge: No citation: ama: 'Karimipour F, Storandt S, eds. Web and Wireless Geographical Information Systems. Vol 13238. 1st ed. Cham: Springer Nature; 2022. doi:10.1007/978-3-031-06245-2' apa: 'Karimipour, F., & Storandt, S. (Eds.). (2022). Web and Wireless Geographical Information Systems (1st ed., Vol. 13238). Cham: Springer Nature. https://doi.org/10.1007/978-3-031-06245-2' chicago: 'Karimipour, Farid, and Sabine Storandt, eds. Web and Wireless Geographical Information Systems. 1st ed. Vol. 13238. Cham: Springer Nature, 2022. https://doi.org/10.1007/978-3-031-06245-2.' ieee: 'F. Karimipour and S. Storandt, Eds., Web and Wireless Geographical Information Systems, 1st ed., vol. 13238. Cham: Springer Nature, 2022.' ista: 'Karimipour F, Storandt S eds. 2022. Web and Wireless Geographical Information Systems 1st ed., Cham: Springer Nature, 153p.' mla: Karimipour, Farid, and Sabine Storandt, editors. Web and Wireless Geographical Information Systems. 1st ed., vol. 13238, Springer Nature, 2022, doi:10.1007/978-3-031-06245-2. short: F. Karimipour, S. Storandt, eds., Web and Wireless Geographical Information Systems, 1st ed., Springer Nature, Cham, 2022. date_created: 2022-06-02T05:40:53Z date_published: 2022-05-01T00:00:00Z date_updated: 2022-06-02T05:56:22Z day: '01' department: - _id: HeEd doi: 10.1007/978-3-031-06245-2 edition: '1' editor: - first_name: Farid full_name: Karimipour, Farid id: 2A2BCDC4-CF62-11E9-BE5E-3B1EE6697425 last_name: Karimipour orcid: 0000-0001-6746-4174 - first_name: Sabine full_name: Storandt, Sabine last_name: Storandt intvolume: ' 13238' language: - iso: eng month: '05' oa_version: None page: '153' place: Cham publication_identifier: eisbn: - '9783031062452' eissn: - 1611-3349 isbn: - '9783031062445' issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Web and Wireless Geographical Information Systems type: book_editor user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 13238 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: '11456' abstract: - lang: eng text: The proteomes of specialized structures, and the interactomes of proteins of interest, provide entry points to elucidate the functions of molecular machines. Here, we review a proximity-labeling strategy that uses the improved E. coli biotin ligase TurboID to characterize C. elegans protein complexes. Although the focus is on C. elegans neurons, the method is applicable regardless of cell type. We describe detailed extraction procedures that solubilize the bulk of C. elegans proteins and highlight the importance of tagging endogenous genes, to ensure physiological expression levels. We review issues associated with non-specific background noise and the importance of appropriate controls. As proof of principle, we review our analysis of the interactome of a presynaptic active zone protein, ELKS-1. Our aim is to provide a detailed protocol for TurboID-based proximity labeling in C. elegans and to highlight its potential and its limitations to characterize protein complexes and subcellular compartments in this animal. acknowledgement: We thank de Bono lab members for the helpful comments on the manuscript. The biotin-auxotrophic E. coli strain MG1655bioB:kan was a generous gift from J. Cronan (University of Illinois) and was kindly sent to us by Jessica Feldman and Ariana Sanchez (Stanford University). dg398 pEntryslot2_mNeongreen::3XFLAG::stop and dg397 pEntryslot3_mNeongreen::3XFLAG::stop::unc-54 3’UTR entry vector were kindly sent by Dr. Dominique Glauser (University of Fribourg). This work was supported by an Advanced ERC Grant (269058 ACMO) and a Wellcome Investigator Award (209504/Z/17/Z) to MdB and an ISTplus Fellowship to MA (Marie Sklodowska-Curie agreement No 754411). alternative_title: - Neuromethods article_processing_charge: No author: - first_name: Murat full_name: Artan, Murat id: C407B586-6052-11E9-B3AE-7006E6697425 last_name: Artan - first_name: Mario full_name: de Bono, Mario id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87 last_name: de Bono orcid: 0000-0001-8347-0443 citation: ama: 'Artan M, de Bono M. Proteomic Analysis of C. Elegans Neurons Using TurboID-Based Proximity Labeling. In: Yamamoto D, ed. Behavioral Neurogenetics. Vol 181. NM. New York: Springer Nature; 2022:277-294. doi:10.1007/978-1-0716-2321-3_15' apa: 'Artan, M., & de Bono, M. (2022). Proteomic Analysis of C. Elegans Neurons Using TurboID-Based Proximity Labeling. In D. Yamamoto (Ed.), Behavioral Neurogenetics (Vol. 181, pp. 277–294). New York: Springer Nature. https://doi.org/10.1007/978-1-0716-2321-3_15' chicago: 'Artan, Murat, and Mario de Bono. “Proteomic Analysis of C. Elegans Neurons Using TurboID-Based Proximity Labeling.” In Behavioral Neurogenetics, edited by Daisuke Yamamoto, 181:277–94. NM. New York: Springer Nature, 2022. https://doi.org/10.1007/978-1-0716-2321-3_15.' ieee: 'M. Artan and M. de Bono, “Proteomic Analysis of C. Elegans Neurons Using TurboID-Based Proximity Labeling,” in Behavioral Neurogenetics, vol. 181, D. Yamamoto, Ed. New York: Springer Nature, 2022, pp. 277–294.' ista: 'Artan M, de Bono M. 2022.Proteomic Analysis of C. Elegans Neurons Using TurboID-Based Proximity Labeling. In: Behavioral Neurogenetics. Neuromethods, vol. 181, 277–294.' mla: Artan, Murat, and Mario de Bono. “Proteomic Analysis of C. Elegans Neurons Using TurboID-Based Proximity Labeling.” Behavioral Neurogenetics, edited by Daisuke Yamamoto, vol. 181, Springer Nature, 2022, pp. 277–94, doi:10.1007/978-1-0716-2321-3_15. short: M. Artan, M. de Bono, in:, D. Yamamoto (Ed.), Behavioral Neurogenetics, Springer Nature, New York, 2022, pp. 277–294. date_created: 2022-06-20T08:10:34Z date_published: 2022-06-04T00:00:00Z date_updated: 2023-02-21T09:51:55Z day: '04' department: - _id: MaDe doi: 10.1007/978-1-0716-2321-3_15 ec_funded: 1 editor: - first_name: Daisuke full_name: Yamamoto, Daisuke last_name: Yamamoto intvolume: ' 181' language: - iso: eng month: '06' oa_version: None page: 277-294 place: New York project: - _id: 23870BE8-32DE-11EA-91FC-C7463DDC885E grant_number: 209504/A/17/Z name: Molecular mechanisms of neural circuit function - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: Behavioral Neurogenetics publication_identifier: eisbn: - '9781071623213' eissn: - 1940-6045 isbn: - '9781071623206' issn: - 0893-2336 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' series_title: NM status: public title: Proteomic Analysis of C. Elegans Neurons Using TurboID-Based Proximity Labeling type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 181 year: '2022' ... --- _id: '11488' abstract: - lang: eng text: Hydrogen Lyα haloes (LAHs) are commonly used as a tracer of the circumgalactic medium (CGM) at high redshifts. In this work, we aim to explore the existence of Lyα haloes around individual UV-selected galaxies, rather than around Lyα emitters (LAEs), at high redshifts. Our sample was continuum-selected with F775W ≤ 27.5, and spectroscopic redshifts were assigned or constrained for all the sources thanks to the deepest (100- to 140-h) existing Very Large Telescope (VLT)/Multi-Unit Spectroscopic Explorer (MUSE) data with adaptive optics. The final sample includes 21 galaxies that are purely F775W-magnitude selected within the redshift range z ≈ 2.9 − 4.4 and within a UV magnitude range −20 ≤ M1500 ≤ −18, thus avoiding any bias toward LAEs. We tested whether galaxy’s Lyα emission is significantly more extended than the MUSE PSF-convolved continuum component. We find 17 LAHs and four non-LAHs. We report the first individual detections of extended Lyα emission around non-LAEs. The Lyα halo fraction is thus as high as 81.0−11.2+10.3%, which is close to that for LAEs at z = 3 − 6 in the literature. This implies that UV-selected galaxies generally have a large amount of hydrogen in their CGM. We derived the mean surface brightness (SB) profile for our LAHs with cosmic dimming corrections and find that Lyα emission extends to 5.4 arcsec (≃40 physical kpc at the midpoint redshift z = 3.6) above the typical 1σ SB limit. The incidence rate of surrounding gas detected in Lyα per one-dimensional line of sight per unit redshift, dn/dz, is estimated to be 0.76−0.09+0.09 for galaxies with M1500 ≤ −18 mag at z ≃ 3.7. Assuming that Lyα emission and absorption arise in the same gas, this suggests, based on abundance matching, that LAHs trace the same gas as damped Lyα systems (DLAs) and sub-DLAs. acknowledgement: 'We thank the anonymous referee for constructive comments and suggestions. We would like to express our gratitude to Edmund Christian Herenz, Leindert Boogard, Miroslava Dessauges, Moupiya Maji, Valentin Mauerhofer, Charlotte Paola Simmonds Wagemann, Masami Ouchi, Kazuhiro Shimasaku, Akio Inoue, and Rieko Momose for giving insightful comments and suggestions. H.K. is grateful to Liam McCarney for useful suggestions on English writing through the UniGE’s Tandems linguistiques. H.K. acknowledges support from Swiss Government Excellence Scholarships and Japan Society for the Promotion of Science (JSPS) Overseas Research Fellowship. H.K., F.L., and A.V. are supported by the SNF grant PP00P2 176808. A.V. and T.G. are supported by the ERC Starting Grant 757258“TRIPLE”. This work was supported by the Programme National Cosmology et Galaxies (PNCG) of CNRS/INSU with INP and IN2P3, co-funded by CEA and CNES. This work is based on observations taken by VLT, which is operated by European Southern Observatory. This research made use of Astropy, which is a community-developed core Python package for Astronomy (Astropy Collaboration 2013, 2018), and other software and packages: MARZ, MPDAF (Piqueras et al. 2019), PHOTUTILS, Numpy (Harris et al. 2020), Scipy (Virtanen et al. 2020), and matplotlib (Hunter 2007).' article_number: A44 article_processing_charge: No article_type: original author: - first_name: Haruka full_name: Kusakabe, Haruka last_name: Kusakabe - first_name: Anne full_name: Verhamme, Anne last_name: Verhamme - first_name: Jérémy full_name: Blaizot, Jérémy last_name: Blaizot - first_name: Thibault full_name: Garel, Thibault last_name: Garel - first_name: Lutz full_name: Wisotzki, Lutz last_name: Wisotzki - first_name: Floriane full_name: Leclercq, Floriane last_name: Leclercq - first_name: Roland full_name: Bacon, Roland last_name: Bacon - first_name: Joop full_name: Schaye, Joop last_name: Schaye - first_name: Sofia G. full_name: Gallego, Sofia G. last_name: Gallego - first_name: Josephine full_name: Kerutt, Josephine last_name: Kerutt - first_name: Jorryt J full_name: Matthee, Jorryt J id: 7439a258-f3c0-11ec-9501-9df22fe06720 last_name: Matthee orcid: 0000-0003-2871-127X - first_name: Michael full_name: Maseda, Michael last_name: Maseda - first_name: Themiya full_name: Nanayakkara, Themiya last_name: Nanayakkara - first_name: Roser full_name: Pelló, Roser last_name: Pelló - first_name: Johan full_name: Richard, Johan last_name: Richard - first_name: Laurence full_name: Tresse, Laurence last_name: Tresse - first_name: Tanya full_name: Urrutia, Tanya last_name: Urrutia - first_name: Eloïse full_name: Vitte, Eloïse last_name: Vitte citation: ama: 'Kusakabe H, Verhamme A, Blaizot J, et al. The MUSE eXtremely Deep Field: Individual detections of Lyα haloes around rest-frame UV-selected galaxies at z ≃ 2.9–4.4. Astronomy & Astrophysics. 2022;660. doi:10.1051/0004-6361/202142302' apa: 'Kusakabe, H., Verhamme, A., Blaizot, J., Garel, T., Wisotzki, L., Leclercq, F., … Vitte, E. (2022). The MUSE eXtremely Deep Field: Individual detections of Lyα haloes around rest-frame UV-selected galaxies at z ≃ 2.9–4.4. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/202142302' chicago: 'Kusakabe, Haruka, Anne Verhamme, Jérémy Blaizot, Thibault Garel, Lutz Wisotzki, Floriane Leclercq, Roland Bacon, et al. “The MUSE EXtremely Deep Field: Individual Detections of Lyα Haloes around Rest-Frame UV-Selected Galaxies at z ≃ 2.9–4.4.” Astronomy & Astrophysics. EDP Sciences, 2022. https://doi.org/10.1051/0004-6361/202142302.' ieee: 'H. Kusakabe et al., “The MUSE eXtremely Deep Field: Individual detections of Lyα haloes around rest-frame UV-selected galaxies at z ≃ 2.9–4.4,” Astronomy & Astrophysics, vol. 660. EDP Sciences, 2022.' ista: 'Kusakabe H, Verhamme A, Blaizot J, Garel T, Wisotzki L, Leclercq F, Bacon R, Schaye J, Gallego SG, Kerutt J, Matthee JJ, Maseda M, Nanayakkara T, Pelló R, Richard J, Tresse L, Urrutia T, Vitte E. 2022. The MUSE eXtremely Deep Field: Individual detections of Lyα haloes around rest-frame UV-selected galaxies at z ≃ 2.9–4.4. Astronomy & Astrophysics. 660, A44.' mla: 'Kusakabe, Haruka, et al. “The MUSE EXtremely Deep Field: Individual Detections of Lyα Haloes around Rest-Frame UV-Selected Galaxies at z ≃ 2.9–4.4.” Astronomy & Astrophysics, vol. 660, A44, EDP Sciences, 2022, doi:10.1051/0004-6361/202142302.' short: H. Kusakabe, A. Verhamme, J. Blaizot, T. Garel, L. Wisotzki, F. Leclercq, R. Bacon, J. Schaye, S.G. Gallego, J. Kerutt, J.J. Matthee, M. Maseda, T. Nanayakkara, R. Pelló, J. Richard, L. Tresse, T. Urrutia, E. Vitte, Astronomy & Astrophysics 660 (2022). date_created: 2022-07-05T14:27:26Z date_published: 2022-04-07T00:00:00Z date_updated: 2022-07-19T09:33:24Z day: '07' doi: 10.1051/0004-6361/202142302 extern: '1' external_id: arxiv: - '2201.07257' intvolume: ' 660' keyword: - Space and Planetary Science - Astronomy and Astrophysics - 'galaxies: high-redshift / galaxies: formation / galaxies: evolution / cosmology: observations' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2201.07257 month: '04' oa: 1 oa_version: Published Version publication: Astronomy & Astrophysics publication_identifier: eissn: - 1432-0746 issn: - 0004-6361 publication_status: published publisher: EDP Sciences quality_controlled: '1' scopus_import: '1' status: public title: 'The MUSE eXtremely Deep Field: Individual detections of Lyα haloes around rest-frame UV-selected galaxies at z ≃ 2.9–4.4' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 660 year: '2022' ... --- _id: '11497' abstract: - lang: eng text: "Context. The hydrogen Lyman α line is often the only measurable feature in optical spectra of high-redshift galaxies. Its shape and strength are influenced by radiative transfer processes and the properties of the underlying stellar population. High equivalent widths of several hundred Å are especially hard to explain by models and could point towards unusual stellar populations, for example with low metallicities, young stellar ages, and a top-heavy initial mass function. Other aspects influencing equivalent widths are the morphology of the galaxy and its gas properties.\r\nAims. The aim of this study is to better understand the connection between the Lyman α rest-frame equivalent width (EW0) and spectral properties as well as ultraviolet (UV) continuum morphology by obtaining reliable EW0 histograms for a statistical sample of galaxies and by assessing the fraction of objects with large equivalent widths.\r\nMethods. We used integral field spectroscopy from the Multi Unit Spectroscopic Explorer (MUSE) combined with broad-band data from the Hubble Space Telescope (HST) to measure EW0. We analysed the emission lines of 1920 Lyman α emitters (LAEs) detected in the full MUSE-Wide (one hour exposure time) and MUSE-Deep (ten hour exposure time) surveys and found UV continuum counterparts in archival HST data. We fitted the UV continuum photometric images using the Galfit software to gain morphological information on the rest-UV emission and fitted the spectra obtained from MUSE to determine the double peak fraction, asymmetry, full-width at half maximum, and flux of the Lyman α line.\r\nResults. The two surveys show different histograms of Lyman α EW0. In MUSE-Wide, 20% of objects have EW0 > 240 Å, while this fraction is only 11% in MUSE-Deep and ≈16% for the full sample. This includes objects without HST continuum counterparts (one-third of our sample), for which we give lower limits for EW0. The object with the highest securely measured EW0 has EW0 = 589 ± 193 Å (the highest lower limit being EW0 = 4464 Å). We investigate the connection between EW0 and Lyman α spectral or UV continuum morphological properties.\r\nConclusions. The survey depth has to be taken into account when studying EW0 distributions. We find that in general, high EW0 objects can have a wide range of spectral and UV morphological properties, which might reflect that the underlying causes for high EW0 values are equally varied." acknowledgement: We thank the referee for thoughtful and constructive comments that have improved the quality of this manuscript. Based on observations collected at the European Southern Observatory under ESO programme 1101.A-0127. This work made use of v2.2.1 of the Binary Population and Spectral Synthesis (BPASS) models as described in Eldridge et al. (2017) and Stanway & Eldridge (2018). A.F. acknowledges the support from grant PRIN MIUR2017-20173ML3WW_001. T.N. acknowledges support from Australian Research Council Laureate Fellowship FL180100060. article_number: '183' article_processing_charge: No article_type: original author: - first_name: J. full_name: Kerutt, J. last_name: Kerutt - first_name: L. full_name: Wisotzki, L. last_name: Wisotzki - first_name: A. full_name: Verhamme, A. last_name: Verhamme - first_name: K. B. full_name: Schmidt, K. B. last_name: Schmidt - first_name: F. full_name: Leclercq, F. last_name: Leclercq - first_name: E. C. full_name: Herenz, E. C. last_name: Herenz - first_name: T. full_name: Urrutia, T. last_name: Urrutia - first_name: T. full_name: Garel, T. last_name: Garel - first_name: T. full_name: Hashimoto, T. last_name: Hashimoto - first_name: M. full_name: Maseda, M. last_name: Maseda - first_name: Jorryt J full_name: Matthee, Jorryt J id: 7439a258-f3c0-11ec-9501-9df22fe06720 last_name: Matthee orcid: 0000-0003-2871-127X - first_name: H. full_name: Kusakabe, H. last_name: Kusakabe - first_name: J. full_name: Schaye, J. last_name: Schaye - first_name: J. full_name: Richard, J. last_name: Richard - first_name: B. full_name: Guiderdoni, B. last_name: Guiderdoni - first_name: V. full_name: Mauerhofer, V. last_name: Mauerhofer - first_name: T. full_name: Nanayakkara, T. last_name: Nanayakkara - first_name: E. full_name: Vitte, E. last_name: Vitte citation: ama: Kerutt J, Wisotzki L, Verhamme A, et al. Equivalent widths of Lyman α emitters in MUSE-Wide and MUSE-Deep. Astronomy & Astrophysics. 2022;659. doi:10.1051/0004-6361/202141900 apa: Kerutt, J., Wisotzki, L., Verhamme, A., Schmidt, K. B., Leclercq, F., Herenz, E. C., … Vitte, E. (2022). Equivalent widths of Lyman α emitters in MUSE-Wide and MUSE-Deep. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/202141900 chicago: Kerutt, J., L. Wisotzki, A. Verhamme, K. B. Schmidt, F. Leclercq, E. C. Herenz, T. Urrutia, et al. “Equivalent Widths of Lyman α Emitters in MUSE-Wide and MUSE-Deep.” Astronomy & Astrophysics. EDP Sciences, 2022. https://doi.org/10.1051/0004-6361/202141900. ieee: J. Kerutt et al., “Equivalent widths of Lyman α emitters in MUSE-Wide and MUSE-Deep,” Astronomy & Astrophysics, vol. 659. EDP Sciences, 2022. ista: Kerutt J, Wisotzki L, Verhamme A, Schmidt KB, Leclercq F, Herenz EC, Urrutia T, Garel T, Hashimoto T, Maseda M, Matthee JJ, Kusakabe H, Schaye J, Richard J, Guiderdoni B, Mauerhofer V, Nanayakkara T, Vitte E. 2022. Equivalent widths of Lyman α emitters in MUSE-Wide and MUSE-Deep. Astronomy & Astrophysics. 659, 183. mla: Kerutt, J., et al. “Equivalent Widths of Lyman α Emitters in MUSE-Wide and MUSE-Deep.” Astronomy & Astrophysics, vol. 659, 183, EDP Sciences, 2022, doi:10.1051/0004-6361/202141900. short: J. Kerutt, L. Wisotzki, A. Verhamme, K.B. Schmidt, F. Leclercq, E.C. Herenz, T. Urrutia, T. Garel, T. Hashimoto, M. Maseda, J.J. Matthee, H. Kusakabe, J. Schaye, J. Richard, B. Guiderdoni, V. Mauerhofer, T. Nanayakkara, E. Vitte, Astronomy & Astrophysics 659 (2022). date_created: 2022-07-06T08:17:27Z date_published: 2022-03-25T00:00:00Z date_updated: 2022-07-19T09:47:16Z day: '25' doi: 10.1051/0004-6361/202141900 extern: '1' external_id: arxiv: - '2202.06642' intvolume: ' 659' keyword: - Space and Planetary Science - Astronomy and Astrophysics - 'galaxies: high-redshift / galaxies: formation / galaxies: evolution / cosmology: observations' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2202.06642 month: '03' oa: 1 oa_version: Published Version publication: Astronomy & Astrophysics publication_identifier: eissn: - 1432-0746 issn: - 0004-6361 publication_status: published publisher: EDP Sciences quality_controlled: '1' scopus_import: '1' status: public title: Equivalent widths of Lyman α emitters in MUSE-Wide and MUSE-Deep type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 659 year: '2022' ... --- _id: '11490' abstract: - lang: eng text: Directly characterising the first generations of stars in distant galaxies is a key quest of observational cosmology. We present a case study of ID53 at z = 4.77, the UV-brightest (but L⋆) star-forming galaxy at z > 3 in the MUSE eXtremely Deep Field with a mass of ≈109 M⊙. In addition to very strong Lyman-α (Lyα) emission, we clearly detect the (stellar) continuum and an N V P Cygni feature, interstellar absorption, fine-structure emission and nebular C IV emission lines in the 140 h spectrum. Continuum emission from two spatially resolved components in Hubble Space Telescope data are blended in the MUSE data, but we show that the nebular C IV emission originates from a subcomponent of the galaxy. The UV spectrum can be fit with recent BPASS stellar population models combined with single-burst or continuous star formation histories (SFHs), a standard initial mass function, and an attenuation law. Models with a young age and low metallicity (log10(age/yr) = 6.5–7.6 and [Z/H] = −2.15 to −1.15) are preferred, but the details depend on the assumed SFH. The intrinsic Hα luminosity of the best-fit models is an order of magnitude higher than the Hα luminosity inferred from Spitzer/IRAC data, which either suggests a high escape fraction of ionising photons, a high relative attenuation of nebular to stellar dust, or a complex SFH. The metallicity appears lower than the metallicity in more massive galaxies at z = 3 − 5, consistent with the scenario according to which younger galaxies have lower metallicities. This chemical immaturity likely facilitates Lyα escape, explaining why the Lyα equivalent width is anti-correlated with stellar metallicity. Finally, we stress that uncertainties in SFHs impose a challenge for future inferences of the stellar metallicity of young galaxies. This highlights the need for joint (spatially resolved) analyses of stellar spectra and photo-ionisation models. acknowledgement: We thank the referee for thoughtful and constructive comments that have improved the quality of this manuscript. Based on observations collected at the European Southern Observatory under ESO programme 1101.A-0127. This work made use of v2.2.1 of the Binary Population and Spectral Synthesis (BPASS) models as described in Eldridge et al. (2017) and Stanway & Eldridge (2018). A.F. acknowledges the support from grant PRIN MIUR2017-20173ML3WW_001. T.N. acknowledges support from Australian Research Council Laureate Fellowship FL180100060. article_number: A10 article_processing_charge: No article_type: original author: - first_name: Jorryt J full_name: Matthee, Jorryt J id: 7439a258-f3c0-11ec-9501-9df22fe06720 last_name: Matthee orcid: 0000-0003-2871-127X - first_name: Anna full_name: Feltre, Anna last_name: Feltre - first_name: Michael full_name: Maseda, Michael last_name: Maseda - first_name: Themiya full_name: Nanayakkara, Themiya last_name: Nanayakkara - first_name: Leindert full_name: Boogaard, Leindert last_name: Boogaard - first_name: Roland full_name: Bacon, Roland last_name: Bacon - first_name: Anne full_name: Verhamme, Anne last_name: Verhamme - first_name: Floriane full_name: Leclercq, Floriane last_name: Leclercq - first_name: Haruka full_name: Kusakabe, Haruka last_name: Kusakabe - first_name: Tanya full_name: Urrutia, Tanya last_name: Urrutia - first_name: Lutz full_name: Wisotzki, Lutz last_name: Wisotzki citation: ama: 'Matthee JJ, Feltre A, Maseda M, et al. Deciphering stellar metallicities in the early universe: Case study of a young galaxy at z = 4.77 in the MUSE eXtremely Deep Field. Astronomy & Astrophysics. 2022;660. doi:10.1051/0004-6361/202142187' apa: 'Matthee, J. J., Feltre, A., Maseda, M., Nanayakkara, T., Boogaard, L., Bacon, R., … Wisotzki, L. (2022). Deciphering stellar metallicities in the early universe: Case study of a young galaxy at z = 4.77 in the MUSE eXtremely Deep Field. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/202142187' chicago: 'Matthee, Jorryt J, Anna Feltre, Michael Maseda, Themiya Nanayakkara, Leindert Boogaard, Roland Bacon, Anne Verhamme, et al. “Deciphering Stellar Metallicities in the Early Universe: Case Study of a Young Galaxy at z = 4.77 in the MUSE EXtremely Deep Field.” Astronomy & Astrophysics. EDP Sciences, 2022. https://doi.org/10.1051/0004-6361/202142187.' ieee: 'J. J. Matthee et al., “Deciphering stellar metallicities in the early universe: Case study of a young galaxy at z = 4.77 in the MUSE eXtremely Deep Field,” Astronomy & Astrophysics, vol. 660. EDP Sciences, 2022.' ista: 'Matthee JJ, Feltre A, Maseda M, Nanayakkara T, Boogaard L, Bacon R, Verhamme A, Leclercq F, Kusakabe H, Urrutia T, Wisotzki L. 2022. Deciphering stellar metallicities in the early universe: Case study of a young galaxy at z = 4.77 in the MUSE eXtremely Deep Field. Astronomy & Astrophysics. 660, A10.' mla: 'Matthee, Jorryt J., et al. “Deciphering Stellar Metallicities in the Early Universe: Case Study of a Young Galaxy at z = 4.77 in the MUSE EXtremely Deep Field.” Astronomy & Astrophysics, vol. 660, A10, EDP Sciences, 2022, doi:10.1051/0004-6361/202142187.' short: J.J. Matthee, A. Feltre, M. Maseda, T. Nanayakkara, L. Boogaard, R. Bacon, A. Verhamme, F. Leclercq, H. Kusakabe, T. Urrutia, L. Wisotzki, Astronomy & Astrophysics 660 (2022). date_created: 2022-07-05T15:25:35Z date_published: 2022-03-30T00:00:00Z date_updated: 2022-07-19T09:33:46Z day: '30' doi: 10.1051/0004-6361/202142187 extern: '1' external_id: arxiv: - '2111.14855' intvolume: ' 660' keyword: - Space and Planetary Science - Astronomy and Astrophysics - 'galaxies: high-redshift / techniques: spectroscopic / galaxies: stellar content / galaxies: formation' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2111.14855 month: '03' oa: 1 oa_version: Published Version publication: Astronomy & Astrophysics publication_identifier: eissn: - 1432-0746 issn: - 0004-6361 publication_status: published publisher: EDP Sciences quality_controlled: '1' scopus_import: '1' status: public title: 'Deciphering stellar metallicities in the early universe: Case study of a young galaxy at z = 4.77 in the MUSE eXtremely Deep Field' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 660 year: '2022' ... --- _id: '11509' abstract: - lang: eng text: We present Keck/LRIS follow-up spectroscopy for 13 photometric candidates of extremely metal-poor galaxies (EMPGs) selected by a machine-learning technique applied to the deep (∼26 AB mag) optical and wide-area (∼500 deg2) Subaru imaging data in the EMPRESS survey. Nine out of the 13 candidates are EMPGs with an oxygen abundance (O/H) less than ∼10% solar value (O/H)⊙, and four sources are contaminants of moderately metal-rich galaxies or no emission-line objects. Notably, two out of the nine EMPGs have extremely low stellar masses and oxygen abundances of 5 × 10⁴x–7 × -10⁵ M⊙ and 2%–3% (O/H)⊙, respectively. With a sample of five EMPGs with (Fe/O) measurements, two (three) of which are taken from this study (the literature), we confirm that two EMPGs with the lowest (O/H) ratios of ∼2% (O/H)⊙ show high (Fe/O) ratios of ∼0.1, close to the solar abundance ratio. Comparing galaxy chemical enrichment models, we find that the two EMPGs cannot be explained by a scenario of metal-poor gas accretion/episodic star formation history due to their low (N/O) ratios. We conclude that the two EMPGs can be reproduced by the inclusion of bright hypernovae and/or hypothetical pair-instability supernovae (SNe) preferentially produced in a metal-poor environment. This conclusion implies that primordial galaxies at z ∼ 10 could have a high abundance of Fe that did not originate from Type Ia SNe with delays and that Fe may not serve as a cosmic clock for primordial galaxies. acknowledgement: We thank the referee for the valuable comments. We are also grateful to Koh Takahashi, Nozomu Tominaga, Chiaki Kobayashi, Yutaka Hirai, and Daichi Kashino for having useful discussions. This paper includes data gathered with the 10 m Keck Telescope located at W. M. Keck Observatory, Hawaii. We thank the staff of Keck Observatory for their help with the observations. The Hyper Suprime-Cam (HSC) collaboration includes the astronomical communities of Japan and Taiwan, and Princeton University. The HSC instrumentation and software were developed by the National Astronomical Observatory of Japan (NAOJ), the Kavli Institute for the Physics and Mathematics of the Universe (Kavli IPMU), the University of Tokyo, the High Energy Accelerator Research Organization (KEK), the Academia Sinica Institute for Astronomy and Astrophysics in Taiwan (ASIAA), and Princeton University. Based on data collected at the Subaru Telescope and retrieved from the HSC data archive system, which is operated by the Subaru Telescope and Astronomy Data Center at NAOJ. This work was supported by the joint research program of the Institute for Cosmic Ray Research (ICRR), University of Tokyo. The Cosmic Dawn Center is funded by the Danish National Research Foundation under grant No. 140. S.F. acknowledges support from the European Research Council (ERC) Consolidator Grant funding scheme (project ConTExt, grant No. 648179). This project has received funding from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement No. 847523 “INTERACTIONS.” This work is supported by World Premier International Research Center Initiative (WPI Initiative), MEXT, Japan, as well as the KAKENHI Grant-in-Aid for Scientific Research (A; 15H02064, 17H01110, 17H01114, 20H00180, and 21H04467) through the Japan Society for the Promotion of Science (JSPS). This work has been supported in part by JSPS KAKENHI grant Nos. JP17K05382, JP20K04024, and JP21H04499 (K.N.). Yuki Isobe, Kimihiko Nakajima, Yuichi Harikane, Takashi Kojima, and Masato Onodera are supported by JSPS KAKENHI grant Nos. 21J20785, 20K22373,19J01222, 18J12840, and 17K14257, respectively. article_number: '111' article_processing_charge: No article_type: original author: - first_name: Yuki full_name: Isobe, Yuki last_name: Isobe - first_name: Masami full_name: Ouchi, Masami last_name: Ouchi - first_name: Akihiro full_name: Suzuki, Akihiro last_name: Suzuki - first_name: Takashi J. full_name: Moriya, Takashi J. last_name: Moriya - first_name: Kimihiko full_name: Nakajima, Kimihiko last_name: Nakajima - first_name: Ken’ichi full_name: Nomoto, Ken’ichi last_name: Nomoto - first_name: Michael full_name: Rauch, Michael last_name: Rauch - first_name: Yuichi full_name: Harikane, Yuichi last_name: Harikane - first_name: Takashi full_name: Kojima, Takashi last_name: Kojima - first_name: Yoshiaki full_name: Ono, Yoshiaki last_name: Ono - first_name: Seiji full_name: Fujimoto, Seiji last_name: Fujimoto - first_name: Akio K. full_name: Inoue, Akio K. last_name: Inoue - first_name: Ji Hoon full_name: Kim, Ji Hoon last_name: Kim - first_name: Yutaka full_name: Komiyama, Yutaka last_name: Komiyama - first_name: Haruka full_name: Kusakabe, Haruka last_name: Kusakabe - first_name: Chien-Hsiu full_name: Lee, Chien-Hsiu last_name: Lee - first_name: Michael full_name: Maseda, Michael last_name: Maseda - first_name: Jorryt J full_name: Matthee, Jorryt J id: 7439a258-f3c0-11ec-9501-9df22fe06720 last_name: Matthee orcid: 0000-0003-2871-127X - first_name: Leo full_name: Michel-Dansac, Leo last_name: Michel-Dansac - first_name: Tohru full_name: Nagao, Tohru last_name: Nagao - first_name: Themiya full_name: Nanayakkara, Themiya last_name: Nanayakkara - first_name: Moka full_name: Nishigaki, Moka last_name: Nishigaki - first_name: Masato full_name: Onodera, Masato last_name: Onodera - first_name: Yuma full_name: Sugahara, Yuma last_name: Sugahara - first_name: Yi full_name: Xu, Yi last_name: Xu citation: ama: 'Isobe Y, Ouchi M, Suzuki A, et al. EMPRESS. IV. Extremely metal-poor galaxies including very low-mass primordial systems with M∗= 104-105⊙ and 2%–3% (O/H): High (Fe/O) suggestive of metal enrichment by hypernovae/pair-instability supernovae. The Astrophysical Journal. 2022;925(2). doi:10.3847/1538-4357/ac3509' apa: 'Isobe, Y., Ouchi, M., Suzuki, A., Moriya, T. J., Nakajima, K., Nomoto, K., … Xu, Y. (2022). EMPRESS. IV. Extremely metal-poor galaxies including very low-mass primordial systems with M∗= 104-105⊙ and 2%–3% (O/H): High (Fe/O) suggestive of metal enrichment by hypernovae/pair-instability supernovae. The Astrophysical Journal. IOP Publishing. https://doi.org/10.3847/1538-4357/ac3509' chicago: 'Isobe, Yuki, Masami Ouchi, Akihiro Suzuki, Takashi J. Moriya, Kimihiko Nakajima, Ken’ichi Nomoto, Michael Rauch, et al. “EMPRESS. IV. Extremely Metal-Poor Galaxies Including Very Low-Mass Primordial Systems with M∗= 104-105⊙ and 2%–3% (O/H): High (Fe/O) Suggestive of Metal Enrichment by Hypernovae/Pair-Instability Supernovae.” The Astrophysical Journal. IOP Publishing, 2022. https://doi.org/10.3847/1538-4357/ac3509.' ieee: 'Y. Isobe et al., “EMPRESS. IV. Extremely metal-poor galaxies including very low-mass primordial systems with M∗= 104-105⊙ and 2%–3% (O/H): High (Fe/O) suggestive of metal enrichment by hypernovae/pair-instability supernovae,” The Astrophysical Journal, vol. 925, no. 2. IOP Publishing, 2022.' ista: 'Isobe Y, Ouchi M, Suzuki A, Moriya TJ, Nakajima K, Nomoto K, Rauch M, Harikane Y, Kojima T, Ono Y, Fujimoto S, Inoue AK, Kim JH, Komiyama Y, Kusakabe H, Lee C-H, Maseda M, Matthee JJ, Michel-Dansac L, Nagao T, Nanayakkara T, Nishigaki M, Onodera M, Sugahara Y, Xu Y. 2022. EMPRESS. IV. Extremely metal-poor galaxies including very low-mass primordial systems with M∗= 104-105⊙ and 2%–3% (O/H): High (Fe/O) suggestive of metal enrichment by hypernovae/pair-instability supernovae. The Astrophysical Journal. 925(2), 111.' mla: 'Isobe, Yuki, et al. “EMPRESS. IV. Extremely Metal-Poor Galaxies Including Very Low-Mass Primordial Systems with M∗= 104-105⊙ and 2%–3% (O/H): High (Fe/O) Suggestive of Metal Enrichment by Hypernovae/Pair-Instability Supernovae.” The Astrophysical Journal, vol. 925, no. 2, 111, IOP Publishing, 2022, doi:10.3847/1538-4357/ac3509.' short: Y. Isobe, M. Ouchi, A. Suzuki, T.J. Moriya, K. Nakajima, K. Nomoto, M. Rauch, Y. Harikane, T. Kojima, Y. Ono, S. Fujimoto, A.K. Inoue, J.H. Kim, Y. Komiyama, H. Kusakabe, C.-H. Lee, M. Maseda, J.J. Matthee, L. Michel-Dansac, T. Nagao, T. Nanayakkara, M. Nishigaki, M. Onodera, Y. Sugahara, Y. Xu, The Astrophysical Journal 925 (2022). date_created: 2022-07-06T12:01:48Z date_published: 2022-01-31T00:00:00Z date_updated: 2022-07-21T05:51:25Z day: '31' doi: 10.3847/1538-4357/ac3509 extern: '1' external_id: arxiv: - '2108.03850' intvolume: ' 925' issue: '2' keyword: - Space and Planetary Science - Astronomy and Astrophysics language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2108.03850 month: '01' oa: 1 oa_version: Published Version publication: The Astrophysical Journal publication_identifier: eissn: - 1538-4357 issn: - 0004-637X publication_status: published publisher: IOP Publishing quality_controlled: '1' scopus_import: '1' status: public title: 'EMPRESS. IV. Extremely metal-poor galaxies including very low-mass primordial systems with M∗= 10⁴-10⁵⊙ and 2%–3% (O/H): High (Fe/O) suggestive of metal enrichment by hypernovae/pair-instability supernovae' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 925 year: '2022' ... --- _id: '11510' abstract: - lang: eng text: Galaxy evolution is driven by a variety of physical processes that are predicted to proceed at different rates for different dark matter haloes and environments across cosmic times. A record of this evolution is preserved in galaxy stellar populations, which we can access using absorption-line spectroscopy. Here we explore the large LEGA-C survey (DR3) to investigate the role of the environment and stellar mass on stellar populations at z ∼ 0.6–1 in the COSMOS field. Leveraging the statistical power and depth of LEGA-C, we reveal significant gradients in Dn4000 and Hδ equivalent widths (EWs) distributions over the stellar mass versus environment 2D spaces for the massive galaxy population (M > 1010 M⊙) at z ∼ 0.6–1.0. Dn4000 and Hδ EWs primarily depend on stellar mass, but they also depend on environment at fixed stellar mass. By splitting the sample into centrals and satellites, and in terms of star-forming galaxies and quiescent galaxies, we reveal that the significant environmental trends of Dn4000 and Hδ EW, when controlling for stellar mass, are driven by quiescent galaxies. Regardless of being centrals or satellites, star-forming galaxies reveal Dn4000 and Hδ EWs, which depend strongly on their stellar mass and are completely independent of the environment at 0.6 < z < 1.0. The environmental trends seen for satellite galaxies are fully driven by the trends that hold only for quiescent galaxies, combined with the strong environmental dependency of the quiescent fraction at fixed stellar mass. Our results are consistent with recent predictions from simulations that point toward massive galaxies forming first in overdensities or the most compact dark matter haloes. acknowledgement: We thank the reviewer for several valuable comments that improved the clarity of the manuscript. P.F.W. acknowledges the support of the fellowship by the East Asian Core Observatories Association. This work is based on observations made with ESO VLT Telescopes at the La Silla Paranal Observatory under programmes ID 194-A.2005 and 1100.A-0949 (The LEGA-C Public Spectroscopy Survey). This project has received funding from the European Research Council (ERC) under the European Union—Horizon 2020 research and innovation program (grant agreement No. 683184). article_number: '117' article_processing_charge: No article_type: original author: - first_name: David full_name: Sobral, David last_name: Sobral - first_name: Arjen full_name: van der Wel, Arjen last_name: van der Wel - first_name: Rachel full_name: Bezanson, Rachel last_name: Bezanson - first_name: Eric full_name: Bell, Eric last_name: Bell - first_name: Adam full_name: Muzzin, Adam last_name: Muzzin - first_name: Francesco full_name: D’Eugenio, Francesco last_name: D’Eugenio - first_name: Behnam full_name: Darvish, Behnam last_name: Darvish - first_name: Anna full_name: Gallazzi, Anna last_name: Gallazzi - first_name: Po-Feng full_name: Wu, Po-Feng last_name: Wu - first_name: Michael full_name: Maseda, Michael last_name: Maseda - first_name: Jorryt J full_name: Matthee, Jorryt J id: 7439a258-f3c0-11ec-9501-9df22fe06720 last_name: Matthee orcid: 0000-0003-2871-127X - first_name: Ana full_name: Paulino-Afonso, Ana last_name: Paulino-Afonso - first_name: Caroline full_name: Straatman, Caroline last_name: Straatman - first_name: Pieter G. full_name: van Dokkum, Pieter G. last_name: van Dokkum citation: ama: 'Sobral D, van der Wel A, Bezanson R, et al. The LEGA-C of nature and nurture in stellar populations at z ∼ 0.6–1.0: Dn4000 and Hδ reveal different assembly histories for quiescent galaxies in different environments. The Astrophysical Journal. 2022;926(2). doi:10.3847/1538-4357/ac4419' apa: 'Sobral, D., van der Wel, A., Bezanson, R., Bell, E., Muzzin, A., D’Eugenio, F., … van Dokkum, P. G. (2022). The LEGA-C of nature and nurture in stellar populations at z ∼ 0.6–1.0: Dn4000 and Hδ reveal different assembly histories for quiescent galaxies in different environments. The Astrophysical Journal. IOP Publishing. https://doi.org/10.3847/1538-4357/ac4419' chicago: 'Sobral, David, Arjen van der Wel, Rachel Bezanson, Eric Bell, Adam Muzzin, Francesco D’Eugenio, Behnam Darvish, et al. “The LEGA-C of Nature and Nurture in Stellar Populations at z ∼ 0.6–1.0: Dn4000 and Hδ Reveal Different Assembly Histories for Quiescent Galaxies in Different Environments.” The Astrophysical Journal. IOP Publishing, 2022. https://doi.org/10.3847/1538-4357/ac4419.' ieee: 'D. Sobral et al., “The LEGA-C of nature and nurture in stellar populations at z ∼ 0.6–1.0: Dn4000 and Hδ reveal different assembly histories for quiescent galaxies in different environments,” The Astrophysical Journal, vol. 926, no. 2. IOP Publishing, 2022.' ista: 'Sobral D, van der Wel A, Bezanson R, Bell E, Muzzin A, D’Eugenio F, Darvish B, Gallazzi A, Wu P-F, Maseda M, Matthee JJ, Paulino-Afonso A, Straatman C, van Dokkum PG. 2022. The LEGA-C of nature and nurture in stellar populations at z ∼ 0.6–1.0: Dn4000 and Hδ reveal different assembly histories for quiescent galaxies in different environments. The Astrophysical Journal. 926(2), 117.' mla: 'Sobral, David, et al. “The LEGA-C of Nature and Nurture in Stellar Populations at z ∼ 0.6–1.0: Dn4000 and Hδ Reveal Different Assembly Histories for Quiescent Galaxies in Different Environments.” The Astrophysical Journal, vol. 926, no. 2, 117, IOP Publishing, 2022, doi:10.3847/1538-4357/ac4419.' short: D. Sobral, A. van der Wel, R. Bezanson, E. Bell, A. Muzzin, F. D’Eugenio, B. Darvish, A. Gallazzi, P.-F. Wu, M. Maseda, J.J. Matthee, A. Paulino-Afonso, C. Straatman, P.G. van Dokkum, The Astrophysical Journal 926 (2022). date_created: 2022-07-06T12:38:42Z date_published: 2022-02-17T00:00:00Z date_updated: 2022-07-19T09:37:42Z day: '17' doi: 10.3847/1538-4357/ac4419 extern: '1' external_id: arxiv: - '2112.08372' intvolume: ' 926' issue: '2' keyword: - Space and Planetary Science - Astronomy and Astrophysics language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2112.08372 month: '02' oa: 1 oa_version: Published Version publication: The Astrophysical Journal publication_identifier: eissn: - 1538-4357 issn: - 0004-637X publication_status: published publisher: IOP Publishing quality_controlled: '1' scopus_import: '1' status: public title: 'The LEGA-C of nature and nurture in stellar populations at z ∼ 0.6–1.0: Dn4000 and Hδ reveal different assembly histories for quiescent galaxies in different environments' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 926 year: '2022' ... --- _id: '11511' abstract: - lang: eng text: The ratio of α-elements to iron in galaxies holds valuable information about the star formation history (SFH) since their enrichment occurs on different timescales. The fossil record of stars in galaxies has mostly been excavated for passive galaxies, since the light of star-forming galaxies is dominated by young stars, which have much weaker atmospheric absorption features. Here we use the largest reference cosmological simulation of the EAGLE project to investigate the origin of variations in stellar α-enhancement among star-forming galaxies at z = 0, and their impact on integrated spectra. The definition of α-enhancement in a composite stellar population is ambiguous. We elucidate two definitions—termed “mean” and “galactic” α-enhancement—in more detail. While a star-forming galaxy has a high “mean” α-enhancement when its stars formed rapidly, a galaxy with a large “galactic” α-enhancement generally had a delayed SFH. We find that absorption-line strengths of Mg and Fe correlate with variations in α-enhancement. These correlations are strongest for the “galactic” α-enhancement. However, we show that these are mostly caused by other effects that are cross-correlated with α-enhancement, such as variations in the light-weighted age. This severely complicates the retrieval of α-enhancements in star-forming galaxies. The ambiguity is not severe for passive galaxies, and we confirm that spectral variations in these galaxies are caused by measurable variations in α-enhancements. We suggest that this more complex coupling between α-enhancement and SFHs can guide the interpretation of new observations of star-forming galaxies. acknowledgement: "We thank our anonymous referee for the constructive feedback. We extend our gratitude to Maarten Baes, Simon Lilly, Rafael Ottersberg, Gabriele Pezzulli, Alvio Renzini, and Andrea Weibel for insightful discussions. A.G. gratefully acknowledges financial support from the Fund for Scientific Research Flanders (FWO-Vlaanderen, project G.0G04.16N). This work used the DiRAC Data Centric system at Durham University, operated by the ICC on behalf of the STFC DiRAC HPC Facility (www.dirac.ac.uk). This equipment was funded by BIS National E-infrastructure capital grant ST/K00042X/1, STFC capital grant ST/H008519/1, and STFC DiRAC Operations grant ST/K003267/1 and Durham University. DiRAC is part of the National E-Infrastructure.\r\n\r\nWe have benefited from the data analysis tool Topcat (Taylor 2013) and the programming language Python, including the numpy (van der Walt et al. 2011), matplotlib (Hunter 2007), and scipy (Virtanen et al. 2020) packages." article_number: '73' article_processing_charge: No article_type: original author: - first_name: Andrea full_name: Gebek, Andrea last_name: Gebek - first_name: Jorryt J full_name: Matthee, Jorryt J id: 7439a258-f3c0-11ec-9501-9df22fe06720 last_name: Matthee orcid: 0000-0003-2871-127X citation: ama: Gebek A, Matthee JJ. On the variation in stellar α-enhancements of star-forming galaxies in the EAGLE simulation. The Astrophysical Journal. 2022;924(2). doi:10.3847/1538-4357/ac350b apa: Gebek, A., & Matthee, J. J. (2022). On the variation in stellar α-enhancements of star-forming galaxies in the EAGLE simulation. The Astrophysical Journal. IOP Publishing. https://doi.org/10.3847/1538-4357/ac350b chicago: Gebek, Andrea, and Jorryt J Matthee. “On the Variation in Stellar α-Enhancements of Star-Forming Galaxies in the EAGLE Simulation.” The Astrophysical Journal. IOP Publishing, 2022. https://doi.org/10.3847/1538-4357/ac350b. ieee: A. Gebek and J. J. Matthee, “On the variation in stellar α-enhancements of star-forming galaxies in the EAGLE simulation,” The Astrophysical Journal, vol. 924, no. 2. IOP Publishing, 2022. ista: Gebek A, Matthee JJ. 2022. On the variation in stellar α-enhancements of star-forming galaxies in the EAGLE simulation. The Astrophysical Journal. 924(2), 73. mla: Gebek, Andrea, and Jorryt J. Matthee. “On the Variation in Stellar α-Enhancements of Star-Forming Galaxies in the EAGLE Simulation.” The Astrophysical Journal, vol. 924, no. 2, 73, IOP Publishing, 2022, doi:10.3847/1538-4357/ac350b. short: A. Gebek, J.J. Matthee, The Astrophysical Journal 924 (2022). date_created: 2022-07-06T12:48:32Z date_published: 2022-01-13T00:00:00Z date_updated: 2022-07-19T09:38:03Z day: '13' doi: 10.3847/1538-4357/ac350b extern: '1' external_id: arxiv: - '2102.04561' intvolume: ' 924' issue: '2' keyword: - Space and Planetary Science - Astronomy and Astrophysics language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2102.04561 month: '01' oa: 1 oa_version: Published Version publication: The Astrophysical Journal publication_identifier: eissn: - 1538-4357 issn: - 0004-637X publication_status: published publisher: IOP Publishing quality_controlled: '1' scopus_import: '1' status: public title: On the variation in stellar α-enhancements of star-forming galaxies in the EAGLE simulation type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 924 year: '2022' ... --- _id: '11521' abstract: - lang: eng text: 'The cosmic ionizing emissivity from star-forming galaxies has long been anchored to UV luminosity functions. Here, we introduce an emissivity framework based on Lyα emitters (LAEs), which naturally hones in on the subset of galaxies responsible for the ionizing background due to the intimate connection between production and escape of Lyα and LyC photons. Using constraints on the escape fractions of bright LAEs (LLyα > 0.2L*) at z ≈ 2 obtained from resolved Lyα profiles, and arguing for their redshift-invariance, we show that: (i) quasars and LAEs together reproduce the relatively flat emissivity at z ≈ 2–6, which is non-trivial given the strong evolution in both the star formation density and quasar number density at these epochs and (ii) LAEs produce late and rapid reionization between z ≈ 6−9 under plausible assumptions. Within this framework, the >10 × rise in the UV population-averaged fesc between z ≈ 3–7 naturally arises due to the same phenomena that drive the growing LAE fraction with redshift. Generally, a LAE dominated emissivity yields a peak in the distribution of the ionizing budget with UV luminosity as reported in latest simulations. Using our adopted parameters (⁠fesc=50 per cent⁠, ξion = 1025.9 Hz erg−1 for half the bright LAEs), a highly ionizing minority of galaxies with MUV < −17 accounts for the entire ionizing budget from star-forming galaxies. Rapid flashes of LyC from such rare galaxies produce a ‘disco’ ionizing background. We conclude proposing tests to further develop our suggested Lyα-anchored formalism.' acknowledgement: We thank an anonymous referee for an encouraging and constructive report that helped improving the quality of this work. We acknowledge illuminating conversations with Xiaohan Wu, Chris Cain, Anna-Christina Eilers, Simon Lilly and Ruari Mackenzie. RPN gratefully acknowledges an Ashford Fellowship granted by Harvard University. MG was supported by NASA through the NASA Hubble Fellowship grant HST-HF2-51409. PO acknowledges support from the Swiss National Science Foundation through the SNSF Professorship grant 190079. GP acknowledges support from the Netherlands Research School for Astronomy (NOVA). MH is fellow of the Knut and Alice Wallenberg Foundation. DE is supported by the US National Science Foundation (NSF) through Astronomy & Astrophysics grant AST-1909198. The Cosmic Dawn Center (DAWN) is funded by the Danish National Research Foundation under grant No. 140. RA acknowledges support from Fondecyt Regular Grant 1202007. ST is supported by the 2021 Research Fund 1.210134.01 of UNIST (Ulsan National Institute of Science & Technology). MLl acknowledges support from the ANID/Scholarship Program/Doctorado Nacional/2019-21191036. JC acknowledges support from the Spanish Ministry of Science and Innovation, project PID2019-107408GB-C43 (ESTALLIDOS) and from Gobierno de Canarias through EU FEDER funding, project PID2020010050. article_processing_charge: No article_type: original author: - first_name: Jorryt J full_name: Matthee, Jorryt J id: 7439a258-f3c0-11ec-9501-9df22fe06720 last_name: Matthee orcid: 0000-0003-2871-127X - first_name: Rohan P. full_name: Naidu, Rohan P. last_name: Naidu - first_name: Gabriele full_name: Pezzulli, Gabriele last_name: Pezzulli - first_name: Max full_name: Gronke, Max last_name: Gronke - first_name: David full_name: Sobral, David last_name: Sobral - first_name: Pascal A. full_name: Oesch, Pascal A. last_name: Oesch - first_name: Matthew full_name: Hayes, Matthew last_name: Hayes - first_name: Dawn full_name: Erb, Dawn last_name: Erb - first_name: Daniel full_name: Schaerer, Daniel last_name: Schaerer - first_name: Ricardo full_name: Amorín, Ricardo last_name: Amorín - first_name: Sandro full_name: Tacchella, Sandro last_name: Tacchella - first_name: Ana Paulino-Afonso full_name: Ana Paulino-Afonso, Ana Paulino-Afonso last_name: Ana Paulino-Afonso - first_name: Mario full_name: Llerena, Mario last_name: Llerena - first_name: João full_name: Calhau, João last_name: Calhau - first_name: Huub full_name: Röttgering, Huub last_name: Röttgering citation: ama: 'Matthee JJ, Naidu RP, Pezzulli G, et al. (Re)Solving reionization with Lyα: How bright Lyα emitters account for the z ≈ 2 − 8 cosmic ionizing background. Monthly Notices of the Royal Astronomical Society. 2022;512(4):5960-5977. doi:10.1093/mnras/stac801' apa: 'Matthee, J. J., Naidu, R. P., Pezzulli, G., Gronke, M., Sobral, D., Oesch, P. A., … Röttgering, H. (2022). (Re)Solving reionization with Lyα: How bright Lyα emitters account for the z ≈ 2 − 8 cosmic ionizing background. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stac801' chicago: 'Matthee, Jorryt J, Rohan P. Naidu, Gabriele Pezzulli, Max Gronke, David Sobral, Pascal A. Oesch, Matthew Hayes, et al. “(Re)Solving Reionization with Lyα: How Bright Lyα Emitters Account for the z ≈ 2 − 8 Cosmic Ionizing Background.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2022. https://doi.org/10.1093/mnras/stac801.' ieee: 'J. J. Matthee et al., “(Re)Solving reionization with Lyα: How bright Lyα emitters account for the z ≈ 2 − 8 cosmic ionizing background,” Monthly Notices of the Royal Astronomical Society, vol. 512, no. 4. Oxford University Press, pp. 5960–5977, 2022.' ista: 'Matthee JJ, Naidu RP, Pezzulli G, Gronke M, Sobral D, Oesch PA, Hayes M, Erb D, Schaerer D, Amorín R, Tacchella S, Ana Paulino-Afonso AP-A, Llerena M, Calhau J, Röttgering H. 2022. (Re)Solving reionization with Lyα: How bright Lyα emitters account for the z ≈ 2 − 8 cosmic ionizing background. Monthly Notices of the Royal Astronomical Society. 512(4), 5960–5977.' mla: 'Matthee, Jorryt J., et al. “(Re)Solving Reionization with Lyα: How Bright Lyα Emitters Account for the z ≈ 2 − 8 Cosmic Ionizing Background.” Monthly Notices of the Royal Astronomical Society, vol. 512, no. 4, Oxford University Press, 2022, pp. 5960–77, doi:10.1093/mnras/stac801.' short: J.J. Matthee, R.P. Naidu, G. Pezzulli, M. Gronke, D. Sobral, P.A. Oesch, M. Hayes, D. Erb, D. Schaerer, R. Amorín, S. Tacchella, A.P.-A. Ana Paulino-Afonso, M. Llerena, J. Calhau, H. Röttgering, Monthly Notices of the Royal Astronomical Society 512 (2022) 5960–5977. date_created: 2022-07-07T09:21:30Z date_published: 2022-06-01T00:00:00Z date_updated: 2022-08-18T10:42:47Z day: '01' doi: 10.1093/mnras/stac801 extern: '1' external_id: arxiv: - '2110.11967' intvolume: ' 512' issue: '4' keyword: - 'galaxies: high-redshift' - intergalactic medium - 'cosmology: observations' - dark ages - reionization - first stars - 'ultraviolet: galaxies' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2110.11967 month: '06' oa: 1 oa_version: Preprint page: 5960-5977 publication: Monthly Notices of the Royal Astronomical Society publication_identifier: eissn: - 1365-2966 issn: - 0035-8711 publication_status: published publisher: Oxford University Press quality_controlled: '1' scopus_import: '1' status: public title: '(Re)Solving reionization with Lyα: How bright Lyα emitters account for the z ≈ 2 − 8 cosmic ionizing background' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 512 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: '11601' abstract: - lang: eng text: We present the third and final data release of the K2 Galactic Archaeology Program (K2 GAP) for Campaigns C1–C8 and C10–C18. We provide asteroseismic radius and mass coefficients, κR and κM, for ∼19,000 red giant stars, which translate directly to radius and mass given a temperature. As such, K2 GAP DR3 represents the largest asteroseismic sample in the literature to date. K2 GAP DR3 stellar parameters are calibrated to be on an absolute parallactic scale based on Gaia DR2, with red giant branch and red clump evolutionary state classifications provided via a machine-learning approach. Combining these stellar parameters with GALAH DR3 spectroscopy, we determine asteroseismic ages with precisions of ∼20%–30% and compare age-abundance relations to Galactic chemical evolution models among both low- and high-α populations for α, light, iron-peak, and neutron-capture elements. We confirm recent indications in the literature of both increased Ba production at late Galactic times as well as significant contributions to r-process enrichment from prompt sources associated with, e.g., core-collapse supernovae. With an eye toward other Galactic archeology applications, we characterize K2 GAP DR3 uncertainties and completeness using injection tests, suggesting that K2 GAP DR3 is largely unbiased in mass/age, with uncertainties of 2.9% (stat.) ± 0.1% (syst.) and 6.7% (stat.) ± 0.3% (syst.) in κR and κM for red giant branch stars and 4.7% (stat.) ± 0.3% (syst.) and 11% (stat.) ± 0.9% (syst.) for red clump stars. We also identify percent-level asteroseismic systematics, which are likely related to the time baseline of the underlying data, and which therefore should be considered in TESS asteroseismic analysis. acknowledgement: "We would like to thank the anonymous referee whose comments significantly improved the manuscript. J.C.Z. is supported by an NSF Astronomy and Astrophysics Postdoctoral Fellowship under award AST-2001869. J.C.Z. and M.H.P. acknowledge support from NASA grants 80NSSC18K0391 and NNX17AJ40G. Y.E. and C.J. acknowledge the support of the UK Science and Technology Facilities Council (STFC). S.M. acknowledges support from the Spanish Ministry of Science and Innovation with the Ramon y Cajal fellowship number RYC-2015-17697 and the grant number PID2019-107187GB-I00. R.A.G. acknowledges funding received from the PLATO CNES grant. C.K. acknowledges funding from the UK Science and Technology Facilities Council (STFC) through grants ST/M000958/1, ST/R000905/1, and ST/V000632/1.\r\n\r\nFunding for the Stellar Astrophysics Centre (SAC) is provided by the Danish National Research Foundation (grant agreement No. DNRF106).\r\n\r\nThe K2 Galactic Archaeology Program is supported by the National Aeronautics and Space Administration under grant NNX16AJ17G issued through the K2 Guest Observer Program. This publication makes use of data products from the Two Micron All Sky Survey, which is a joint project of the University of Massachusetts and the Infrared Processing and Analysis Center/California Institute of Technology, funded by the National Aeronautics and Space Administration and the National Science Foundation.\r\n\r\nThis paper includes data collected by the Kepler mission. Funding for the Kepler mission is provided by the NASA Science Mission directorate.\r\n\r\nParts of this research were supported by the Australian Research Council Centre of Excellence for All Sky Astrophysics in 3 Dimensions (ASTRO 3D), through project number CE170100013.\r\n\r\nThis research was partially conducted during the Exostar19 program at the Kavli Institute for Theoretical Physics at UC Santa Barbara, which was supported in part by the National Science Foundation under grant No. NSF PHY-1748958.\r\n\r\nBased in part on data obtained at Siding Spring Observatory via GALAH. We acknowledge the traditional owners of the land on which the AAT stands, the Gamilaraay people, and pay our respects to elders past and present.\r\n\r\nThis work has made use of data from the European Space Agency (ESA) mission Gaia (https://www.cosmos.esa.int/gaia), processed by the Gaia Data Processing and Analysis Consortium (DPAC, https://www.cosmos.esa.int/web/gaia/dpac/consortium). Funding for DPAC has been provided by national institutions, in particular the institutions participating in the Gaia Multilateral Agreement.\r\n\r\nFunding for the Sloan Digital Sky Survey IV has been provided by the Alfred P. Sloan Foundation, the U.S. Department of Energy Office of Science, and the Participating Institutions. SDSS-IV acknowledges support and resources from the Center for High-Performance Computing at the University of Utah (www.sdss.org).\r\n\r\nSoftware: asfgrid (Sharma & Stello 2016), corner (Foreman-Mackey 2016), emcee (Foreman-Mackey et al. 2013), NumPy (Walt 2011), pandas (McKinney 2010), Matplotlib (Hunter 2007), IPython (Pérez & Granger 2007), SciPy (Virtanen et al.2020)." article_number: '191' article_processing_charge: No article_type: original author: - first_name: Joel C. full_name: Zinn, Joel C. last_name: Zinn - first_name: Dennis full_name: Stello, Dennis last_name: Stello - first_name: Yvonne full_name: Elsworth, Yvonne last_name: Elsworth - first_name: Rafael A. full_name: García, Rafael A. last_name: García - first_name: Thomas full_name: Kallinger, Thomas last_name: Kallinger - first_name: Savita full_name: Mathur, Savita last_name: Mathur - first_name: Benoît full_name: Mosser, Benoît last_name: Mosser - first_name: Marc full_name: Hon, Marc last_name: Hon - first_name: Lisa Annabelle full_name: Bugnet, Lisa Annabelle id: d9edb345-f866-11ec-9b37-d119b5234501 last_name: Bugnet orcid: 0000-0003-0142-4000 - first_name: Caitlin full_name: Jones, Caitlin last_name: Jones - first_name: Claudia full_name: Reyes, Claudia last_name: Reyes - first_name: Sanjib full_name: Sharma, Sanjib last_name: Sharma - first_name: Ralph full_name: Schönrich, Ralph last_name: Schönrich - first_name: Jack T. full_name: Warfield, Jack T. last_name: Warfield - first_name: Rodrigo full_name: Luger, Rodrigo last_name: Luger - first_name: Andrew full_name: Vanderburg, Andrew last_name: Vanderburg - first_name: Chiaki full_name: Kobayashi, Chiaki last_name: Kobayashi - first_name: Marc H. full_name: Pinsonneault, Marc H. last_name: Pinsonneault - first_name: Jennifer A. full_name: Johnson, Jennifer A. last_name: Johnson - first_name: Daniel full_name: Huber, Daniel last_name: Huber - first_name: Sven full_name: Buder, Sven last_name: Buder - first_name: Meridith full_name: Joyce, Meridith last_name: Joyce - first_name: Joss full_name: Bland-Hawthorn, Joss last_name: Bland-Hawthorn - first_name: Luca full_name: Casagrande, Luca last_name: Casagrande - first_name: Geraint F. full_name: Lewis, Geraint F. last_name: Lewis - first_name: Andrea full_name: Miglio, Andrea last_name: Miglio - first_name: Thomas full_name: Nordlander, Thomas last_name: Nordlander - first_name: Guy R. full_name: Davies, Guy R. last_name: Davies - first_name: Gayandhi De full_name: Silva, Gayandhi De last_name: Silva - first_name: William J. full_name: Chaplin, William J. last_name: Chaplin - first_name: Victor full_name: Silva Aguirre, Victor last_name: Silva Aguirre citation: ama: 'Zinn JC, Stello D, Elsworth Y, et al. The K2 Galactic Archaeology Program data release 3: Age-abundance patterns in C1–C8 and C10–C18. The Astrophysical Journal. 2022;926(2). doi:10.3847/1538-4357/ac2c83' apa: 'Zinn, J. C., Stello, D., Elsworth, Y., García, R. A., Kallinger, T., Mathur, S., … Silva Aguirre, V. (2022). The K2 Galactic Archaeology Program data release 3: Age-abundance patterns in C1–C8 and C10–C18. The Astrophysical Journal. IOP Publishing. https://doi.org/10.3847/1538-4357/ac2c83' chicago: 'Zinn, Joel C., Dennis Stello, Yvonne Elsworth, Rafael A. García, Thomas Kallinger, Savita Mathur, Benoît Mosser, et al. “The K2 Galactic Archaeology Program Data Release 3: Age-Abundance Patterns in C1–C8 and C10–C18.” The Astrophysical Journal. IOP Publishing, 2022. https://doi.org/10.3847/1538-4357/ac2c83.' ieee: 'J. C. Zinn et al., “The K2 Galactic Archaeology Program data release 3: Age-abundance patterns in C1–C8 and C10–C18,” The Astrophysical Journal, vol. 926, no. 2. IOP Publishing, 2022.' ista: 'Zinn JC, Stello D, Elsworth Y, García RA, Kallinger T, Mathur S, Mosser B, Hon M, Bugnet LA, Jones C, Reyes C, Sharma S, Schönrich R, Warfield JT, Luger R, Vanderburg A, Kobayashi C, Pinsonneault MH, Johnson JA, Huber D, Buder S, Joyce M, Bland-Hawthorn J, Casagrande L, Lewis GF, Miglio A, Nordlander T, Davies GR, Silva GD, Chaplin WJ, Silva Aguirre V. 2022. The K2 Galactic Archaeology Program data release 3: Age-abundance patterns in C1–C8 and C10–C18. The Astrophysical Journal. 926(2), 191.' mla: 'Zinn, Joel C., et al. “The K2 Galactic Archaeology Program Data Release 3: Age-Abundance Patterns in C1–C8 and C10–C18.” The Astrophysical Journal, vol. 926, no. 2, 191, IOP Publishing, 2022, doi:10.3847/1538-4357/ac2c83.' short: J.C. Zinn, D. Stello, Y. Elsworth, R.A. García, T. Kallinger, S. Mathur, B. Mosser, M. Hon, L.A. Bugnet, C. Jones, C. Reyes, S. Sharma, R. Schönrich, J.T. Warfield, R. Luger, A. Vanderburg, C. Kobayashi, M.H. Pinsonneault, J.A. Johnson, D. Huber, S. Buder, M. Joyce, J. Bland-Hawthorn, L. Casagrande, G.F. Lewis, A. Miglio, T. Nordlander, G.R. Davies, G.D. Silva, W.J. Chaplin, V. Silva Aguirre, The Astrophysical Journal 926 (2022). date_created: 2022-07-18T10:57:30Z date_published: 2022-02-24T00:00:00Z date_updated: 2022-08-19T09:52:08Z day: '24' doi: 10.3847/1538-4357/ac2c83 extern: '1' external_id: arxiv: - '2108.05455' intvolume: ' 926' issue: '2' keyword: - Space and Planetary Science - Astronomy and Astrophysics language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2108.05455 month: '02' oa: 1 oa_version: Preprint publication: The Astrophysical Journal publication_identifier: eissn: - 1538-4357 issn: - 0004-637X publication_status: published publisher: IOP Publishing quality_controlled: '1' scopus_import: '1' status: public title: 'The K2 Galactic Archaeology Program data release 3: Age-abundance patterns in C1–C8 and C10–C18' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 926 year: '2022' ... --- _id: '11602' abstract: - lang: eng text: During the survey phase of the Kepler mission, several thousand stars were observed in short cadence, allowing for the detection of solar-like oscillations in more than 500 main-sequence and subgiant stars. These detections showed the power of asteroseismology in determining fundamental stellar parameters. However, the Kepler Science Office discovered an issue in the calibration that affected half of the store of short-cadence data, leading to a new data release (DR25) with corrections on the light curves. In this work, we re-analyzed the one-month time series of the Kepler survey phase to search for solar-like oscillations that might have been missed when using the previous data release. We studied the seismic parameters of 99 stars, among which there are 46 targets with new reported solar-like oscillations, increasing, by around 8%, the known sample of solar-like stars with an asteroseismic analysis of the short-cadence data from this mission. The majority of these stars have mid- to high-resolution spectroscopy publicly available with the LAMOST and APOGEE surveys, respectively, as well as precise Gaia parallaxes. We computed the masses and radii using seismic scaling relations and we find that this new sample features massive stars (above 1.2 M⊙ and up to 2 M⊙) and subgiants. We determined the granulation parameters and amplitude of the modes, which agree with the scaling relations derived for dwarfs and subgiants. The stars studied here are slightly fainter than the previously known sample of main-sequence and subgiants with asteroseismic detections. We also studied the surface rotation and magnetic activity levels of those stars. Our sample of 99 stars has similar levels of activity compared to the previously known sample and is in the same range as the Sun between the minimum and maximum of its activity cycle. We find that for seven stars, a possible blend could be the reason for the non-detection with the early data release. Finally, we compared the radii obtained from the scaling relations with the Gaia ones and we find that the Gaia radii are overestimated by 4.4%, on average, compared to the seismic radii, with a scatter of 12.3% and a decreasing trend according to the evolutionary stage. In addition, for homogeneity purposes, we re-analyzed the DR25 of the main-sequence and subgiant stars with solar-like oscillations that were previously detected and, as a result, we provide the global seismic parameters for a total of 525 stars. acknowledgement: 'This paper includes data collected by the Kepler mission. Funding for the Kepler mission is provided by the NASA Science Mission directorate. Some of the data presented in this paper were obtained from the Mikulski Archive for Space Telescopes (MAST). STScI is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS5-26555. S. M. acknowledges support by the Spanish Ministry of Science and Innovation with the Ramon y Cajal fellowship number RYC-2015-17697 and the grant number PID2019-107187GB-I00. R. A. G. and S. N. B acknowledge the support from PLATO and GOLF CNES grants. A. R. G. S. acknowledges the support from National Aeronautics and Space Administration under Grant NNX17AF27G and STFC consolidated grant ST/T000252/1. D.H. acknowledges support from the Alfred P. Sloan Foundation, the National Aeronautics and Space Administration (80NSSC19K0597), and the National Science Foundation (AST-1717000). M.S. is supported by the Research Corporation for Science Advancement through Scialog award #26080. Guoshoujing Telescope (the Large Sky Area Multi-Object Fiber Spectroscopic Telescope LAMOST) is a National Major Scientific Project built by the Chinese Academy of Sciences. Funding for the project has been provided by the National Development and Reform Commission. LAMOST is operated and managed by the National Astronomical Observatories, Chinese Academy of Sciences.' article_number: A31 article_processing_charge: No article_type: original author: - first_name: S. full_name: Mathur, S. last_name: Mathur - first_name: R. A. full_name: García, R. A. last_name: García - first_name: S. full_name: Breton, S. last_name: Breton - first_name: A. R. G. full_name: Santos, A. R. G. last_name: Santos - first_name: B. full_name: Mosser, B. last_name: Mosser - first_name: D. full_name: Huber, D. last_name: Huber - first_name: M. full_name: Sayeed, M. last_name: Sayeed - first_name: Lisa Annabelle full_name: Bugnet, Lisa Annabelle id: d9edb345-f866-11ec-9b37-d119b5234501 last_name: Bugnet orcid: 0000-0003-0142-4000 - first_name: A. full_name: Chontos, A. last_name: Chontos citation: ama: Mathur S, García RA, Breton S, et al. Detections of solar-like oscillations in dwarfs and subgiants with Kepler DR25 short-cadence data. Astronomy & Astrophysics. 2022;657. doi:10.1051/0004-6361/202141168 apa: Mathur, S., García, R. A., Breton, S., Santos, A. R. G., Mosser, B., Huber, D., … Chontos, A. (2022). Detections of solar-like oscillations in dwarfs and subgiants with Kepler DR25 short-cadence data. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/202141168 chicago: Mathur, S., R. A. García, S. Breton, A. R. G. Santos, B. Mosser, D. Huber, M. Sayeed, Lisa Annabelle Bugnet, and A. Chontos. “Detections of Solar-like Oscillations in Dwarfs and Subgiants with Kepler DR25 Short-Cadence Data.” Astronomy & Astrophysics. EDP Sciences, 2022. https://doi.org/10.1051/0004-6361/202141168. ieee: S. Mathur et al., “Detections of solar-like oscillations in dwarfs and subgiants with Kepler DR25 short-cadence data,” Astronomy & Astrophysics, vol. 657. EDP Sciences, 2022. ista: Mathur S, García RA, Breton S, Santos ARG, Mosser B, Huber D, Sayeed M, Bugnet LA, Chontos A. 2022. Detections of solar-like oscillations in dwarfs and subgiants with Kepler DR25 short-cadence data. Astronomy & Astrophysics. 657, A31. mla: Mathur, S., et al. “Detections of Solar-like Oscillations in Dwarfs and Subgiants with Kepler DR25 Short-Cadence Data.” Astronomy & Astrophysics, vol. 657, A31, EDP Sciences, 2022, doi:10.1051/0004-6361/202141168. short: S. Mathur, R.A. García, S. Breton, A.R.G. Santos, B. Mosser, D. Huber, M. Sayeed, L.A. Bugnet, A. Chontos, Astronomy & Astrophysics 657 (2022). date_created: 2022-07-18T11:41:59Z date_published: 2022-01-01T00:00:00Z date_updated: 2022-08-19T09:56:58Z day: '01' doi: 10.1051/0004-6361/202141168 extern: '1' external_id: arxiv: - '2109.14058' intvolume: ' 657' keyword: - Space and Planetary Science - Astronomy and Astrophysics language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2109.14058 month: '01' oa: 1 oa_version: Preprint publication: Astronomy & Astrophysics publication_identifier: eissn: - 1432-0746 issn: - 0004-6361 publication_status: published publisher: EDP Sciences quality_controlled: '1' scopus_import: '1' status: public title: Detections of solar-like oscillations in dwarfs and subgiants with Kepler DR25 short-cadence data type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 657 year: '2022' ... --- _id: '11600' abstract: - lang: eng text: The Sun’s surface hosts varying magnetic activities and rotation rates (from equator to pole), and unique solar weather. Now, a combination of ground and space observations has unveiled a previously undetected magnetized plasma current. article_processing_charge: No article_type: letter_note author: - first_name: Lisa Annabelle full_name: Bugnet, Lisa Annabelle id: d9edb345-f866-11ec-9b37-d119b5234501 last_name: Bugnet orcid: 0000-0003-0142-4000 citation: ama: Bugnet LA. Hidden currents at the Sun’s surface. Nature Astronomy. 2022;6:631-632. doi:10.1038/s41550-022-01683-2 apa: Bugnet, L. A. (2022). Hidden currents at the Sun’s surface. Nature Astronomy. Springer Nature. https://doi.org/10.1038/s41550-022-01683-2 chicago: Bugnet, Lisa Annabelle. “Hidden Currents at the Sun’s Surface.” Nature Astronomy. Springer Nature, 2022. https://doi.org/10.1038/s41550-022-01683-2. ieee: L. A. Bugnet, “Hidden currents at the Sun’s surface,” Nature Astronomy, vol. 6. Springer Nature, pp. 631–632, 2022. ista: Bugnet LA. 2022. Hidden currents at the Sun’s surface. Nature Astronomy. 6, 631–632. mla: Bugnet, Lisa Annabelle. “Hidden Currents at the Sun’s Surface.” Nature Astronomy, vol. 6, Springer Nature, 2022, pp. 631–32, doi:10.1038/s41550-022-01683-2. short: L.A. Bugnet, Nature Astronomy 6 (2022) 631–632. date_created: 2022-07-18T09:34:37Z date_published: 2022-05-18T00:00:00Z date_updated: 2022-08-19T09:52:21Z day: '18' doi: 10.1038/s41550-022-01683-2 extern: '1' intvolume: ' 6' keyword: - Astronomy and Astrophysics language: - iso: eng month: '05' oa_version: None page: 631-632 publication: Nature Astronomy publication_identifier: eissn: - 2397-3366 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Hidden currents at the Sun’s surface type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 6 year: '2022' ... --- _id: '11621' abstract: - lang: eng text: "Context. Asteroseismology has revealed small core-to-surface rotation contrasts in stars in the whole Hertzsprung–Russell diagram. This is the signature of strong transport of angular momentum (AM) in stellar interiors. One of the plausible candidates to efficiently carry AM is magnetic fields with various topologies that could be present in stellar radiative zones. Among them, strong axisymmetric azimuthal (toroidal) magnetic fields have received a lot of interest. Indeed, if they are subject to the so-called Tayler instability, the accompanying triggered Maxwell stresses can transport AM efficiently. In addition, the electromotive force induced by the fluctuations of magnetic and velocity fields could potentially sustain a dynamo action that leads to the regeneration of the initial strong axisymmetric azimuthal magnetic field.\r\n\r\nAims. The key question we aim to answer is whether we can detect signatures of these deep strong azimuthal magnetic fields. The only way to answer this question is asteroseismology, and the best laboratories of study are intermediate-mass and massive stars with external radiative envelopes. Most of these are rapid rotators during their main sequence. Therefore, we have to study stellar pulsations propagating in stably stratified, rotating, and potentially strongly magnetised radiative zones, namely magneto-gravito-inertial (MGI) waves.\r\n\r\nMethods. We generalise the traditional approximation of rotation (TAR) by simultaneously taking general axisymmetric differential rotation and azimuthal magnetic fields into account. Both the Coriolis acceleration and the Lorentz force are therefore treated in a non-perturbative way. Using this new formalism, we derive the asymptotic properties of MGI waves and their period spacings.\r\n\r\nResults. We find that toroidal magnetic fields induce a shift in the period spacings of gravity (g) and Rossby (r) modes. An equatorial azimuthal magnetic field with an amplitude of the order of 105 G leads to signatures that are detectable in period spacings for high-radial-order g and r modes in γ Doradus (γ Dor) and slowly pulsating B (SPB) stars. More complex hemispheric configurations are more difficult to observe, particularly when they are localised out of the propagation region of MGI modes, which can be localised in an equatorial belt.\r\n\r\nConclusions. The magnetic TAR, which takes into account toroidal magnetic fields in a non-perturbative way, is derived. This new formalism allows us to assess the effects of the magnetic field in γ Dor and SPB stars on g and r modes. We find that these effects should be detectable for equatorial fields thanks to modern space photometry using observations from Kepler, TESS CVZ, and PLATO." acknowledgement: 'We thank the referee for her/his positive and constructive report, which has allowed us to improve the quality of our article. H.D. and S.M. acknowledge support from the CNES PLATO grant at CEA/DAp. T.V.R. gratefully acknowledges support from the Research Foundation Flanders (FWO) under grant agreement No. 12ZB620N and V414021N. This research was supported in part by the National Science Foundation under Grant No. NSF PHY-1748958. C.A. is supported by the KU Leuven Research Council (grant C16/18/005: PARADISE) as well as from the BELgian federal Science Policy Office (BELSPO) through a PLATO PRODEX grant.' article_number: A133 article_processing_charge: No article_type: original author: - first_name: H. full_name: Dhouib, H. last_name: Dhouib - first_name: S. full_name: Mathis, S. last_name: Mathis - first_name: Lisa Annabelle full_name: Bugnet, Lisa Annabelle id: d9edb345-f866-11ec-9b37-d119b5234501 last_name: Bugnet orcid: 0000-0003-0142-4000 - first_name: T. full_name: Van Reeth, T. last_name: Van Reeth - first_name: C. full_name: Aerts, C. last_name: Aerts citation: ama: 'Dhouib H, Mathis S, Bugnet LA, Van Reeth T, Aerts C. Detecting deep axisymmetric toroidal magnetic fields in stars: The traditional approximation of rotation for differentially rotating deep spherical shells with a general azimuthal magnetic field. Astronomy & Astrophysics. 2022;661. doi:10.1051/0004-6361/202142956' apa: 'Dhouib, H., Mathis, S., Bugnet, L. A., Van Reeth, T., & Aerts, C. (2022). Detecting deep axisymmetric toroidal magnetic fields in stars: The traditional approximation of rotation for differentially rotating deep spherical shells with a general azimuthal magnetic field. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/202142956' chicago: 'Dhouib, H., S. Mathis, Lisa Annabelle Bugnet, T. Van Reeth, and C. Aerts. “Detecting Deep Axisymmetric Toroidal Magnetic Fields in Stars: The Traditional Approximation of Rotation for Differentially Rotating Deep Spherical Shells with a General Azimuthal Magnetic Field.” Astronomy & Astrophysics. EDP Sciences, 2022. https://doi.org/10.1051/0004-6361/202142956.' ieee: 'H. Dhouib, S. Mathis, L. A. Bugnet, T. Van Reeth, and C. Aerts, “Detecting deep axisymmetric toroidal magnetic fields in stars: The traditional approximation of rotation for differentially rotating deep spherical shells with a general azimuthal magnetic field,” Astronomy & Astrophysics, vol. 661. EDP Sciences, 2022.' ista: 'Dhouib H, Mathis S, Bugnet LA, Van Reeth T, Aerts C. 2022. Detecting deep axisymmetric toroidal magnetic fields in stars: The traditional approximation of rotation for differentially rotating deep spherical shells with a general azimuthal magnetic field. Astronomy & Astrophysics. 661, A133.' mla: 'Dhouib, H., et al. “Detecting Deep Axisymmetric Toroidal Magnetic Fields in Stars: The Traditional Approximation of Rotation for Differentially Rotating Deep Spherical Shells with a General Azimuthal Magnetic Field.” Astronomy & Astrophysics, vol. 661, A133, EDP Sciences, 2022, doi:10.1051/0004-6361/202142956.' short: H. Dhouib, S. Mathis, L.A. Bugnet, T. Van Reeth, C. Aerts, Astronomy & Astrophysics 661 (2022). date_created: 2022-07-19T08:04:15Z date_published: 2022-05-19T00:00:00Z date_updated: 2022-08-22T07:58:54Z day: '19' doi: 10.1051/0004-6361/202142956 extern: '1' external_id: arxiv: - '2202.10026' intvolume: ' 661' keyword: - Space and Planetary Science - Astronomy and Astrophysics - magnetohydrodynamics (MHD) / waves / stars - 'rotation / stars: magnetic field / stars' - oscillations / methods language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2202.10026 month: '05' oa: 1 oa_version: Preprint publication: Astronomy & Astrophysics publication_identifier: eissn: - 1432-0746 issn: - 0004-6361 publication_status: published publisher: EDP Sciences quality_controlled: '1' scopus_import: '1' status: public title: 'Detecting deep axisymmetric toroidal magnetic fields in stars: The traditional approximation of rotation for differentially rotating deep spherical shells with a general azimuthal magnetic field' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 661 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: '11662' abstract: - lang: eng text: We give a fully dynamic (Las-Vegas style) algorithm with constant expected amortized time per update that maintains a proper (Δ +1)-vertex coloring of a graph with maximum degree at most Δ. This improves upon the previous O(log Δ)-time algorithm by Bhattacharya et al. (SODA 2018). Our algorithm uses an approach based on assigning random ranks to vertices and does not need to maintain a hierarchical graph decomposition. We show that our result does not only have optimal running time but is also optimal in the sense that already deciding whether a Δ-coloring exists in a dynamically changing graph with maximum degree at most Δ takes Ω (log n) time per operation. acknowledgement: We want to thank an anonymous referee who pointed out a mistake in our conference paper as well as suggesting a fix using an approach in References. article_number: '16' article_processing_charge: No article_type: original author: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Pan full_name: Peng, Pan last_name: Peng citation: ama: Henzinger MH, Peng P. Constant-time Dynamic (Δ +1)-Coloring. ACM Transactions on Algorithms. 2022;18(2). doi:10.1145/3501403 apa: Henzinger, M. H., & Peng, P. (2022). Constant-time Dynamic (Δ +1)-Coloring. ACM Transactions on Algorithms. Association for Computing Machinery (ACM). https://doi.org/10.1145/3501403 chicago: Henzinger, Monika H, and Pan Peng. “Constant-Time Dynamic (Δ +1)-Coloring.” ACM Transactions on Algorithms. Association for Computing Machinery (ACM), 2022. https://doi.org/10.1145/3501403. ieee: M. H. Henzinger and P. Peng, “Constant-time Dynamic (Δ +1)-Coloring,” ACM Transactions on Algorithms, vol. 18, no. 2. Association for Computing Machinery (ACM), 2022. ista: Henzinger MH, Peng P. 2022. Constant-time Dynamic (Δ +1)-Coloring. ACM Transactions on Algorithms. 18(2), 16. mla: Henzinger, Monika H., and Pan Peng. “Constant-Time Dynamic (Δ +1)-Coloring.” ACM Transactions on Algorithms, vol. 18, no. 2, 16, Association for Computing Machinery (ACM), 2022, doi:10.1145/3501403. short: M.H. Henzinger, P. Peng, ACM Transactions on Algorithms 18 (2022). date_created: 2022-07-27T10:58:53Z date_published: 2022-03-04T00:00:00Z date_updated: 2022-07-27T11:08:13Z day: '04' doi: 10.1145/3501403 extern: '1' intvolume: ' 18' issue: '2' language: - iso: eng month: '03' oa_version: None publication: ACM Transactions on Algorithms publication_identifier: eissn: - 1549-6333 issn: - 1549-6325 publication_status: published publisher: Association for Computing Machinery (ACM) quality_controlled: '1' scopus_import: '1' status: public title: Constant-time Dynamic (Δ +1)-Coloring type: journal_article user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd volume: 18 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: '11812' abstract: - lang: eng text: "This paper presents a comprehensive study of algorithms for maintaining the number of all connected four-vertex subgraphs in a dynamic graph. Specifically, our algorithms maintain the number of paths of length three in deterministic amortized O(m^{1/2}) update time, and any other connected four-vertex subgraph which is not a clique in deterministic amortized update time O(m^{2/3}). Queries can be answered in constant time. We also study the query times for subgraphs containing an arbitrary edge that is supplied only with the query as well as the case where only subgraphs containing a vertex s that is fixed beforehand are considered. For length-3 paths, paws, 4-cycles, and diamonds our bounds match or are not far from (conditional) lower bounds: Based on the OMv conjecture we show that any dynamic algorithm that detects the existence of paws, diamonds, or 4-cycles or that counts length-3 paths takes update time Ω(m^{1/2-δ}).\r\nAdditionally, for 4-cliques and all connected induced subgraphs, we show a lower bound of Ω(m^{1-δ}) for any small constant δ > 0 for the amortized update time, assuming the static combinatorial 4-clique conjecture holds. This shows that the O(m) algorithm by Eppstein et al. [David Eppstein et al., 2012] for these subgraphs cannot be improved by a polynomial factor." alternative_title: - LIPIcs article_number: '18' article_processing_charge: No author: - first_name: Kathrin full_name: Hanauer, Kathrin last_name: Hanauer - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Qi Cheng full_name: Hua, Qi Cheng last_name: Hua citation: ama: 'Hanauer K, Henzinger MH, Hua QC. Fully dynamic four-vertex subgraph counting. In: 1st Symposium on Algorithmic Foundations of Dynamic Networks. Vol 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.SAND.2022.18' apa: 'Hanauer, K., Henzinger, M. H., & Hua, Q. C. (2022). Fully dynamic four-vertex subgraph counting. In 1st Symposium on Algorithmic Foundations of Dynamic Networks (Vol. 221). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAND.2022.18' chicago: Hanauer, Kathrin, Monika H Henzinger, and Qi Cheng Hua. “Fully Dynamic Four-Vertex Subgraph Counting.” In 1st Symposium on Algorithmic Foundations of Dynamic Networks, Vol. 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.SAND.2022.18. ieee: K. Hanauer, M. H. Henzinger, and Q. C. Hua, “Fully dynamic four-vertex subgraph counting,” in 1st Symposium on Algorithmic Foundations of Dynamic Networks, Virtual, 2022, vol. 221. ista: 'Hanauer K, Henzinger MH, Hua QC. 2022. Fully dynamic four-vertex subgraph counting. 1st Symposium on Algorithmic Foundations of Dynamic Networks. SAND: Symposium on Algorithmic Foundations of Dynamic Networks, LIPIcs, vol. 221, 18.' mla: Hanauer, Kathrin, et al. “Fully Dynamic Four-Vertex Subgraph Counting.” 1st Symposium on Algorithmic Foundations of Dynamic Networks, vol. 221, 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.SAND.2022.18. short: K. Hanauer, M.H. Henzinger, Q.C. Hua, in:, 1st Symposium on Algorithmic Foundations of Dynamic Networks, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. conference: end_date: 2022-04-30 location: Virtual name: 'SAND: Symposium on Algorithmic Foundations of Dynamic Networks' start_date: 2022-04-28 date_created: 2022-08-12T06:57:55Z date_published: 2022-04-29T00:00:00Z date_updated: 2023-02-14T08:25:42Z day: '29' doi: 10.4230/LIPIcs.SAND.2022.18 extern: '1' external_id: arxiv: - '2106.15524' intvolume: ' 221' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.4230/LIPIcs.SAND.2022.18 month: '04' oa: 1 oa_version: Published Version publication: 1st Symposium on Algorithmic Foundations of Dynamic Networks publication_identifier: isbn: - '9783959772242' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Fully dynamic four-vertex subgraph counting type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 221 year: '2022' ... --- _id: '11808' abstract: - lang: eng text: In recent years, significant advances have been made in the design and analysis of fully dynamic algorithms. However, these theoretical results have received very little attention from the practical perspective. Few of the algorithms are implemented and tested on real datasets, and their practical potential is far from understood. Here, we present a quick reference guide to recent engineering and theory results in the area of fully dynamic graph algorithms. alternative_title: - LIPIcs article_number: '1' article_processing_charge: No author: - first_name: Kathrin full_name: Hanauer, Kathrin last_name: Hanauer - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Christian full_name: Schulz, Christian last_name: Schulz citation: ama: 'Hanauer K, Henzinger MH, Schulz C. Recent advances in fully dynamic graph algorithms. In: 1st Symposium on Algorithmic Foundations of Dynamic Networks. Vol 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.SAND.2022.1' apa: 'Hanauer, K., Henzinger, M. H., & Schulz, C. (2022). Recent advances in fully dynamic graph algorithms. In 1st Symposium on Algorithmic Foundations of Dynamic Networks (Vol. 221). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAND.2022.1' chicago: Hanauer, Kathrin, Monika H Henzinger, and Christian Schulz. “Recent Advances in Fully Dynamic Graph Algorithms.” In 1st Symposium on Algorithmic Foundations of Dynamic Networks, Vol. 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.SAND.2022.1. ieee: K. Hanauer, M. H. Henzinger, and C. Schulz, “Recent advances in fully dynamic graph algorithms,” in 1st Symposium on Algorithmic Foundations of Dynamic Networks, Virtual, 2022, vol. 221. ista: 'Hanauer K, Henzinger MH, Schulz C. 2022. Recent advances in fully dynamic graph algorithms. 1st Symposium on Algorithmic Foundations of Dynamic Networks. SAND: Symposium on Algorithmic Foundations of Dynamic Networks, LIPIcs, vol. 221, 1.' mla: Hanauer, Kathrin, et al. “Recent Advances in Fully Dynamic Graph Algorithms.” 1st Symposium on Algorithmic Foundations of Dynamic Networks, vol. 221, 1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.SAND.2022.1. short: K. Hanauer, M.H. Henzinger, C. Schulz, in:, 1st Symposium on Algorithmic Foundations of Dynamic Networks, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. conference: end_date: 2022-03-30 location: Virtual name: 'SAND: Symposium on Algorithmic Foundations of Dynamic Networks' start_date: 2022-03-28 date_created: 2022-08-11T14:35:52Z date_published: 2022-04-29T00:00:00Z date_updated: 2023-02-14T08:14:41Z day: '29' doi: 10.4230/LIPIcs.SAND.2022.1 extern: '1' external_id: arxiv: - '2102.11169' intvolume: ' 221' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.4230/LIPIcs.SAND.2022.1 month: '04' oa: 1 oa_version: Published Version publication: 1st Symposium on Algorithmic Foundations of Dynamic Networks publication_identifier: eissn: - 1868-8969 isbn: - '9783959772242' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Recent advances in fully dynamic graph algorithms type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 221 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: '11918' abstract: - lang: eng text: "Statistics of small subgraph counts such as triangles, four-cycles, and s-t paths of short lengths reveal important structural properties of the underlying graph. These problems have been widely studied in social network analysis. In most relevant applications, the graphs are not only massive but also change dynamically over time. Most of these problems become hard in the dynamic setting when considering the worst case. In this paper, we ask whether the question of small subgraph counting over dynamic graphs is hard also in the average case.\r\n\r\nWe consider the simplest possible average case model where the updates follow an Erdős-Rényi graph: each update selects a pair of vertices (u, v) uniformly at random and flips the existence of the edge (u, v). We develop new lower bounds and matching algorithms in this model for counting four-cycles, counting triangles through a specified point s, or a random queried point, and st paths of length 3, 4 and 5. Our results indicate while computing st paths of length 3, and 4 are easy in the average case with O(1) update time (note that they are hard in the worst case), it becomes hard when considering st paths of length 5.\r\n\r\nWe introduce new techniques which allow us to get average-case hardness for these graph problems from the worst-case hardness of the Online Matrix vector problem (OMv). Our techniques rely on recent advances in fine-grained average-case complexity. Our techniques advance this literature, giving the ability to prove new lower bounds on average-case dynamic algorithms." article_processing_charge: No author: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Andrea full_name: Lincoln, Andrea last_name: Lincoln - first_name: Barna full_name: Saha, Barna last_name: Saha citation: ama: 'Henzinger MH, Lincoln A, Saha B. The complexity of average-case dynamic subgraph counting. In: 33rd Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2022:459-498. doi:10.1137/1.9781611977073.23' apa: 'Henzinger, M. H., Lincoln, A., & Saha, B. (2022). The complexity of average-case dynamic subgraph counting. In 33rd Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 459–498). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977073.23' chicago: Henzinger, Monika H, Andrea Lincoln, and Barna Saha. “The Complexity of Average-Case Dynamic Subgraph Counting.” In 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, 459–98. Society for Industrial and Applied Mathematics, 2022. https://doi.org/10.1137/1.9781611977073.23. ieee: M. H. Henzinger, A. Lincoln, and B. Saha, “The complexity of average-case dynamic subgraph counting,” in 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria, VA, United States, 2022, pp. 459–498. ista: 'Henzinger MH, Lincoln A, Saha B. 2022. The complexity of average-case dynamic subgraph counting. 33rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 459–498.' mla: Henzinger, Monika H., et al. “The Complexity of Average-Case Dynamic Subgraph Counting.” 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2022, pp. 459–98, doi:10.1137/1.9781611977073.23. short: M.H. Henzinger, A. Lincoln, B. Saha, in:, 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2022, pp. 459–498. conference: end_date: 2022-01-12 location: Alexandria, VA, United States name: 'SODA: Symposium on Discrete Algorithms' start_date: 2022-01-09 date_created: 2022-08-18T07:26:19Z date_published: 2022-01-01T00:00:00Z date_updated: 2023-02-17T11:23:02Z day: '01' doi: 10.1137/1.9781611977073.23 extern: '1' language: - iso: eng month: '01' oa_version: None page: 459-498 publication: 33rd Annual ACM-SIAM Symposium on Discrete Algorithms publication_identifier: eisbn: - 978-1-61197-707-3 publication_status: published publisher: Society for Industrial and Applied Mathematics quality_controlled: '1' scopus_import: '1' status: public title: The complexity of average-case dynamic subgraph counting type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '11930' abstract: - lang: eng text: We present a practically efficient algorithm for maintaining a global minimum cut in large dynamic graphs under both edge insertions and deletions. While there has been theoretical work on this problem, our algorithm is the first implementation of a fully-dynamic algorithm. The algorithm uses the theoretical foundation and combines it with efficient and finely-tuned implementations to give an algorithm that can maintain the global minimum cut of a graph with rapid update times. We show that our algorithm gives up to multiple orders of magnitude speedup compared to static approaches both on edge insertions and deletions. article_processing_charge: No author: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Alexander full_name: Noe, Alexander last_name: Noe - first_name: Christian full_name: Schulz, Christian last_name: Schulz citation: ama: 'Henzinger MH, Noe A, Schulz C. Practical fully dynamic minimum cut algorithms. In: 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments. Society for Industrial and Applied Mathematics; 2022:13-26. doi:10.1137/1.9781611977042.2' apa: 'Henzinger, M. H., Noe, A., & Schulz, C. (2022). Practical fully dynamic minimum cut algorithms. In 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments (pp. 13–26). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977042.2' chicago: Henzinger, Monika H, Alexander Noe, and Christian Schulz. “Practical Fully Dynamic Minimum Cut Algorithms.” In 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments, 13–26. Society for Industrial and Applied Mathematics, 2022. https://doi.org/10.1137/1.9781611977042.2. ieee: M. H. Henzinger, A. Noe, and C. Schulz, “Practical fully dynamic minimum cut algorithms,” in 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments, Alexandria, VA, United States, 2022, pp. 13–26. ista: 'Henzinger MH, Noe A, Schulz C. 2022. Practical fully dynamic minimum cut algorithms. 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments. ALENEX: Symposium on Algorithm Engineering and Experiments, 13–26.' mla: Henzinger, Monika H., et al. “Practical Fully Dynamic Minimum Cut Algorithms.” 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2022, pp. 13–26, doi:10.1137/1.9781611977042.2. short: M.H. Henzinger, A. Noe, C. Schulz, in:, 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2022, pp. 13–26. conference: end_date: 2022-01-10 location: Alexandria, VA, United States name: 'ALENEX: Symposium on Algorithm Engineering and Experiments' start_date: 2022-01-09 date_created: 2022-08-19T07:27:51Z date_published: 2022-01-01T00:00:00Z date_updated: 2023-02-17T13:57:17Z day: '01' doi: 10.1137/1.9781611977042.2 extern: '1' external_id: arxiv: - '2101.05033' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2101.05033 month: '01' oa: 1 oa_version: Preprint page: 13-26 publication: 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments publication_identifier: eisbn: - 978-1-61197-704-2 publication_status: published publisher: Society for Industrial and Applied Mathematics quality_controlled: '1' scopus_import: '1' status: public title: Practical fully dynamic minimum cut algorithms type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2022' ... --- _id: '11955' abstract: - lang: eng text: Covalent organic frameworks (COFs) are structurally tuneable, porous and crystalline polymers constructed through the covalent attachment of small organic building blocks as elementary units. Using the myriad of such building blocks, a broad spectrum of functionalities has been applied for COF syntheses for broad applications, including heterogeneous catalysis. Herein, we report the synthesis of a new family of porous and crystalline COFs using a novel acridine linker and benzene-1,3,5-tricarbaldehyde derivatives bearing a variable number of hydroxy groups. With the broad absorption in the visible light region, the COFs were applied as photocatalysts in metallaphotocatalytic C−N cross-coupling. The fully β-ketoenamine linked COF showed the highest activity, due to the increased charge separation upon irradiation. The COF showed good to excellent yields for several aryl bromides, good recyclability and even catalyzed the organic transformation in presence of green light as energy source. article_number: e202117738 article_processing_charge: No article_type: original author: - first_name: Michael full_name: Traxler, Michael last_name: Traxler - first_name: Sebastian full_name: Gisbertz, Sebastian last_name: Gisbertz - first_name: Pradip full_name: Pachfule, Pradip last_name: Pachfule - first_name: Johannes full_name: Schmidt, Johannes last_name: Schmidt - first_name: Jérôme full_name: Roeser, Jérôme last_name: Roeser - first_name: Susanne full_name: Reischauer, Susanne last_name: Reischauer - first_name: Jabor full_name: Rabeah, Jabor last_name: Rabeah - first_name: Bartholomäus full_name: Pieber, Bartholomäus id: 93e5e5b2-0da6-11ed-8a41-af589a024726 last_name: Pieber orcid: 0000-0001-8689-388X - first_name: Arne full_name: Thomas, Arne last_name: Thomas citation: ama: Traxler M, Gisbertz S, Pachfule P, et al. Acridine‐functionalized covalent organic frameworks (COFs) as photocatalysts for metallaphotocatalytic C−N cross‐coupling. Angewandte Chemie International Edition. 2022;61(21). doi:10.1002/anie.202117738 apa: Traxler, M., Gisbertz, S., Pachfule, P., Schmidt, J., Roeser, J., Reischauer, S., … Thomas, A. (2022). Acridine‐functionalized covalent organic frameworks (COFs) as photocatalysts for metallaphotocatalytic C−N cross‐coupling. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.202117738 chicago: Traxler, Michael, Sebastian Gisbertz, Pradip Pachfule, Johannes Schmidt, Jérôme Roeser, Susanne Reischauer, Jabor Rabeah, Bartholomäus Pieber, and Arne Thomas. “Acridine‐functionalized Covalent Organic Frameworks (COFs) as Photocatalysts for Metallaphotocatalytic C−N Cross‐coupling.” Angewandte Chemie International Edition. Wiley, 2022. https://doi.org/10.1002/anie.202117738. ieee: M. Traxler et al., “Acridine‐functionalized covalent organic frameworks (COFs) as photocatalysts for metallaphotocatalytic C−N cross‐coupling,” Angewandte Chemie International Edition, vol. 61, no. 21. Wiley, 2022. ista: Traxler M, Gisbertz S, Pachfule P, Schmidt J, Roeser J, Reischauer S, Rabeah J, Pieber B, Thomas A. 2022. Acridine‐functionalized covalent organic frameworks (COFs) as photocatalysts for metallaphotocatalytic C−N cross‐coupling. Angewandte Chemie International Edition. 61(21), e202117738. mla: Traxler, Michael, et al. “Acridine‐functionalized Covalent Organic Frameworks (COFs) as Photocatalysts for Metallaphotocatalytic C−N Cross‐coupling.” Angewandte Chemie International Edition, vol. 61, no. 21, e202117738, Wiley, 2022, doi:10.1002/anie.202117738. short: M. Traxler, S. Gisbertz, P. Pachfule, J. Schmidt, J. Roeser, S. Reischauer, J. Rabeah, B. Pieber, A. Thomas, Angewandte Chemie International Edition 61 (2022). date_created: 2022-08-24T10:41:25Z date_published: 2022-05-16T00:00:00Z date_updated: 2023-02-21T10:09:11Z day: '16' doi: 10.1002/anie.202117738 extern: '1' external_id: pmid: - '35188714' intvolume: ' 61' issue: '21' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1002/anie.202117738 month: '05' oa: 1 oa_version: Published Version pmid: 1 publication: Angewandte Chemie International Edition publication_identifier: eissn: - 1521-3773 issn: - 1433-7851 publication_status: published publisher: Wiley quality_controlled: '1' scopus_import: '1' status: public title: Acridine‐functionalized covalent organic frameworks (COFs) as photocatalysts for metallaphotocatalytic C−N cross‐coupling type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 61 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: '11996' abstract: - lang: eng text: If you mix fruit syrups with alcohol to make a schnapps, the two liquids will remain perfectly blended forever. But if you mix oil with vinegar to make a vinaigrette, the oil and vinegar will soon separate back into their previous selves. Such liquid-liquid phase separation is a thermodynamically driven phenomenon and plays an important role in many biological processes (1). Although energy injection at the macroscale can reverse the phase separation—a strong shake is the normal response to a separated vinaigrette—little is known about the effect of energy added at the microscopic level on phase separation. This fundamental question has deep ramifications, notably in biology, because active processes also make the interior of a living cell different from a dead one. On page 768 of this issue, Adkins et al. (2) examine how mechanical activity at the microscopic scale affects liquid-liquid phase separation and allows liquids to climb surfaces. article_processing_charge: No article_type: letter_note author: - first_name: Jérémie A full_name: Palacci, Jérémie A id: 8fb92548-2b22-11eb-b7c1-a3f0d08d7c7d last_name: Palacci orcid: 0000-0002-7253-9465 citation: ama: Palacci JA. A soft active matter that can climb walls. Science. 2022;377(6607):710-711. doi:10.1126/science.adc9202 apa: Palacci, J. A. (2022). A soft active matter that can climb walls. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.adc9202 chicago: Palacci, Jérémie A. “A Soft Active Matter That Can Climb Walls.” Science. American Association for the Advancement of Science, 2022. https://doi.org/10.1126/science.adc9202. ieee: J. A. Palacci, “A soft active matter that can climb walls,” Science, vol. 377, no. 6607. American Association for the Advancement of Science, pp. 710–711, 2022. ista: Palacci JA. 2022. A soft active matter that can climb walls. Science. 377(6607), 710–711. mla: Palacci, Jérémie A. “A Soft Active Matter That Can Climb Walls.” Science, vol. 377, no. 6607, American Association for the Advancement of Science, 2022, pp. 710–11, doi:10.1126/science.adc9202. short: J.A. Palacci, Science 377 (2022) 710–711. date_created: 2022-08-28T22:02:00Z date_published: 2022-08-12T00:00:00Z date_updated: 2022-09-05T07:37:37Z day: '12' department: - _id: JePa doi: 10.1126/science.adc9202 external_id: pmid: - '35951689 ' intvolume: ' 377' issue: '6607' language: - iso: eng month: '08' oa_version: None page: 710-711 pmid: 1 publication: Science publication_identifier: eissn: - 1095-9203 issn: - 0036-8075 publication_status: published publisher: American Association for the Advancement of Science quality_controlled: '1' scopus_import: '1' status: public title: A soft active matter that can climb walls type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 377 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: '12007' abstract: - lang: eng text: The Tibetan plateau (TP) plays an important role in the Asian summer monsoon (ASM) dynamics as a heat source during the pre-monsoon and monsoon seasons. A significant contribution to the pre-monsoon TP heating comes from the sensible heat flux (SHF), which depend on the surface properties. A glaciated surface would have a different SHF compared to a non-glaciated surface. Therefore, the TP glaciers potentially can also impact the hydrological cycle in the Asian continent by impacting the ASM rainfall via its contribution to the total plateau heating. However, there is no assessment of this putative link available. Here, we attempt to qualitatively study the role of TP glaciers on ASM by analyzing the sensitivity of an atmospheric model to the absence of TP glaciers. We find that the absence of the glaciers is most felt in climatologically less snowy regions (which are mostly located at the south-central boundary of the TP during the pre-monsoon season), which leads to positive SHF anomalies. The resulting positive diabatic heating leads to rising air in the eastern TP and sinking air in the western TP. This altered circulation in turn leads to a positive SHF memory in the western TP, which persists until the end of the monsoon season. The impact of SHF anomalies on diabatic heating results in a large-scale subsidence over the ASM domain. The net result is a reduced seasonal ASM rainfall. Given the relentless warming and the vulnerability of glaciers to warming, this is another flag in the ASM variability and change that needs further attention. acknowledgement: This research is funded by the IRCC research funding. article_number: '29' article_processing_charge: No article_type: original author: - first_name: BIDYUT B full_name: GOSWAMI, BIDYUT B id: 3a4ac09c-6d61-11ec-bf66-884cde66b64b last_name: GOSWAMI - first_name: Soon-Il full_name: An, Soon-Il last_name: An - first_name: Raghu full_name: Murtugudde, Raghu last_name: Murtugudde citation: ama: GOSWAMI BB, An S-I, Murtugudde R. Role of the Tibetan plateau glaciers in the Asian summer monsoon. Climatic Change. 2022;173(3-4). doi:10.1007/s10584-022-03426-8 apa: GOSWAMI, B. B., An, S.-I., & Murtugudde, R. (2022). Role of the Tibetan plateau glaciers in the Asian summer monsoon. Climatic Change. Springer Nature. https://doi.org/10.1007/s10584-022-03426-8 chicago: GOSWAMI, BIDYUT B, Soon-Il An, and Raghu Murtugudde. “Role of the Tibetan Plateau Glaciers in the Asian Summer Monsoon.” Climatic Change. Springer Nature, 2022. https://doi.org/10.1007/s10584-022-03426-8. ieee: B. B. GOSWAMI, S.-I. An, and R. Murtugudde, “Role of the Tibetan plateau glaciers in the Asian summer monsoon,” Climatic Change, vol. 173, no. 3–4. Springer Nature, 2022. ista: GOSWAMI BB, An S-I, Murtugudde R. 2022. Role of the Tibetan plateau glaciers in the Asian summer monsoon. Climatic Change. 173(3–4), 29. mla: GOSWAMI, BIDYUT B., et al. “Role of the Tibetan Plateau Glaciers in the Asian Summer Monsoon.” Climatic Change, vol. 173, no. 3–4, 29, Springer Nature, 2022, doi:10.1007/s10584-022-03426-8. short: B.B. GOSWAMI, S.-I. An, R. Murtugudde, Climatic Change 173 (2022). date_created: 2022-09-03T07:24:13Z date_published: 2022-08-30T00:00:00Z date_updated: 2022-09-05T08:33:33Z day: '30' ddc: - '550' doi: 10.1007/s10584-022-03426-8 extern: '1' file: - access_level: open_access checksum: 38071d5c142bb76f8c8665dc374838a8 content_type: application/pdf creator: dernst date_created: 2022-09-05T08:29:27Z date_updated: 2022-09-05T08:29:27Z file_id: '12021' file_name: 2022_ClimateChange_Goswami.pdf file_size: 1350575 relation: main_file success: 1 file_date_updated: 2022-09-05T08:29:27Z has_accepted_license: '1' intvolume: ' 173' issue: 3-4 keyword: - Atmospheric Science - Global and Planetary Change language: - iso: eng month: '08' oa: 1 oa_version: Published Version publication: Climatic Change publication_identifier: issn: - 0165-0009 - 1573-1480 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Role of the Tibetan plateau glaciers in the Asian summer monsoon 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: 173 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: '12017' abstract: - lang: eng text: 'In the classic adversarial communication problem, two parties communicate over a noisy channel in the presence of a malicious jamming adversary. The arbitrarily varying channels (AVCs) offer an elegant framework to study a wide range of interesting adversary models. The optimal throughput or capacity over such AVCs is intimately tied to the underlying adversary model; in some cases, capacity is unknown and the problem is known to be notoriously hard. The omniscient adversary, one which knows the sender’s entire channel transmission a priori, is one of such classic models of interest; the capacity under such an adversary remains an exciting open problem. The myopic adversary is a generalization of that model where the adversary’s observation may be corrupted over a noisy discrete memoryless channel. Through the adversary’s myopicity, one can unify the slew of different adversary models, ranging from the omniscient adversary to one that is completely blind to the transmission (the latter is the well known oblivious model where the capacity is fully characterized).In this work, we present new results on the capacity under both the omniscient and myopic adversary models. We completely characterize the positive capacity threshold over general AVCs with omniscient adversaries. The characterization is in terms of two key combinatorial objects: the set of completely positive distributions and the CP-confusability set. For omniscient AVCs with positive capacity, we present non-trivial lower and upper bounds on the capacity; unlike some of the previous bounds, our bounds hold under fairly general input and jamming constraints. Our lower bound improves upon the generalized Gilbert-Varshamov bound for general AVCs while the upper bound generalizes the well known Elias-Bassalygo bound (known for binary and q-ary alphabets). For the myopic AVCs, we build on prior results known for the so-called sufficiently myopic model, and present new results on the positive rate communication threshold over the so-called insufficiently myopic regime (a completely insufficient myopic adversary specializes to an omniscient adversary). We present interesting examples for the widely studied models of adversarial bit-flip and bit-erasure channels. In fact, for the bit-flip AVC with additive adversarial noise as well as random noise, we completely characterize the omniscient model capacity when the random noise is sufficiently large vis-a-vis the adversary’s budget.' article_processing_charge: No author: - first_name: Anuj Kumar full_name: Yadav, Anuj Kumar last_name: Yadav - first_name: Mohammadreza full_name: Alimohammadi, Mohammadreza last_name: Alimohammadi - first_name: Yihan full_name: Zhang, Yihan id: 2ce5da42-b2ea-11eb-bba5-9f264e9d002c last_name: Zhang - first_name: Amitalok J. full_name: Budkuley, Amitalok J. last_name: Budkuley - first_name: Sidharth full_name: Jaggi, Sidharth last_name: Jaggi citation: ama: 'Yadav AK, Alimohammadi M, Zhang Y, Budkuley AJ, Jaggi S. New results on AVCs with omniscient and myopic adversaries. In: 2022 IEEE International Symposium on Information Theory. Vol 2022. Institute of Electrical and Electronics Engineers; 2022:2535-2540. doi:10.1109/ISIT50566.2022.9834632' apa: 'Yadav, A. K., Alimohammadi, M., Zhang, Y., Budkuley, A. J., & Jaggi, S. (2022). New results on AVCs with omniscient and myopic adversaries. In 2022 IEEE International Symposium on Information Theory (Vol. 2022, pp. 2535–2540). Espoo, Finland: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ISIT50566.2022.9834632' chicago: Yadav, Anuj Kumar, Mohammadreza Alimohammadi, Yihan Zhang, Amitalok J. Budkuley, and Sidharth Jaggi. “New Results on AVCs with Omniscient and Myopic Adversaries.” In 2022 IEEE International Symposium on Information Theory, 2022:2535–40. Institute of Electrical and Electronics Engineers, 2022. https://doi.org/10.1109/ISIT50566.2022.9834632. ieee: A. K. Yadav, M. Alimohammadi, Y. Zhang, A. J. Budkuley, and S. Jaggi, “New results on AVCs with omniscient and myopic adversaries,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 2535–2540. ista: 'Yadav AK, Alimohammadi M, Zhang Y, Budkuley AJ, Jaggi S. 2022. New results on AVCs with omniscient and myopic adversaries. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 2535–2540.' mla: Yadav, Anuj Kumar, et al. “New Results on AVCs with Omniscient and Myopic Adversaries.” 2022 IEEE International Symposium on Information Theory, vol. 2022, Institute of Electrical and Electronics Engineers, 2022, pp. 2535–40, doi:10.1109/ISIT50566.2022.9834632. short: A.K. Yadav, M. Alimohammadi, Y. Zhang, A.J. Budkuley, S. Jaggi, in:, 2022 IEEE International Symposium on Information Theory, Institute of Electrical and Electronics Engineers, 2022, pp. 2535–2540. 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:06Z date_published: 2022-08-03T00:00:00Z date_updated: 2023-02-13T09:00:14Z day: '03' department: - _id: MaMo doi: 10.1109/ISIT50566.2022.9834632 intvolume: ' 2022' language: - iso: eng month: '08' oa_version: None page: 2535-2540 publication: 2022 IEEE International Symposium on Information Theory publication_identifier: isbn: - '9781665421591' issn: - 2157-8095 publication_status: published publisher: Institute of Electrical and Electronics Engineers quality_controlled: '1' scopus_import: '1' status: public title: New results on AVCs with omniscient and myopic adversaries type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2022 year: '2022' ... --- _id: '12013' abstract: - lang: eng text: We consider the problem of communication over adversarial channels with feedback. Two parties comprising sender Alice and receiver Bob seek to communicate reliably. An adversary James observes Alice's channel transmission entirely and chooses, maliciously, its additive channel input or jamming state thereby corrupting Bob's observation. Bob can communicate over a one-way reverse link with Alice; we assume that transmissions over this feedback link cannot be corrupted by James. Our goal in this work is to study the optimum throughput or capacity over such channels with feedback. We first present results for the quadratically-constrained additive channel where communication is known to be impossible when the noise-to-signal (power) ratio (NSR) is at least 1. We present a novel achievability scheme to establish that positive rate communication is possible even when the NSR is as high as 8/9. We also present new converse upper bounds on the capacity of this channel under potentially stochastic encoders and decoders. We also study feedback communication over the more widely studied q-ary alphabet channel under additive noise. For the q -ary channel, where q > 2, it is well known that capacity is positive under full feedback if and only if the adversary can corrupt strictly less than half the transmitted symbols. We generalize this result and show that the same threshold holds for positive rate communication when the noiseless feedback may only be partial; our scheme employs a stochastic decoder. We extend this characterization, albeit partially, to fully deterministic schemes under partial noiseless feedback. We also present new converse upper bounds for q-ary channels under full feedback, where the encoder and/or decoder may privately randomize. Our converse results bring to the fore an interesting alternate expression for the well known converse bound for the q—ary channel under full feedback which, when specialized to the binary channel, also equals its known capacity. article_processing_charge: No author: - first_name: Pranav full_name: Joshi, Pranav last_name: Joshi - first_name: Amritakshya full_name: Purkayastha, Amritakshya last_name: Purkayastha - first_name: Yihan full_name: Zhang, Yihan id: 2ce5da42-b2ea-11eb-bba5-9f264e9d002c last_name: Zhang - first_name: Amitalok J. full_name: Budkuley, Amitalok J. last_name: Budkuley - first_name: Sidharth full_name: Jaggi, Sidharth last_name: Jaggi citation: ama: 'Joshi P, Purkayastha A, Zhang Y, Budkuley AJ, Jaggi S. On the capacity of additive AVCs with feedback. In: 2022 IEEE International Symposium on Information Theory. Vol 2022. IEEE; 2022:504-509. doi:10.1109/ISIT50566.2022.9834850' apa: 'Joshi, P., Purkayastha, A., Zhang, Y., Budkuley, A. J., & Jaggi, S. (2022). On the capacity of additive AVCs with feedback. In 2022 IEEE International Symposium on Information Theory (Vol. 2022, pp. 504–509). Espoo, Finland: IEEE. https://doi.org/10.1109/ISIT50566.2022.9834850' chicago: Joshi, Pranav, Amritakshya Purkayastha, Yihan Zhang, Amitalok J. Budkuley, and Sidharth Jaggi. “On the Capacity of Additive AVCs with Feedback.” In 2022 IEEE International Symposium on Information Theory, 2022:504–9. IEEE, 2022. https://doi.org/10.1109/ISIT50566.2022.9834850. ieee: P. Joshi, A. Purkayastha, Y. Zhang, A. J. Budkuley, and S. Jaggi, “On the capacity of additive AVCs with feedback,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 504–509. ista: 'Joshi P, Purkayastha A, Zhang Y, Budkuley AJ, Jaggi S. 2022. On the capacity of additive AVCs with feedback. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 504–509.' mla: Joshi, Pranav, et al. “On the Capacity of Additive AVCs with Feedback.” 2022 IEEE International Symposium on Information Theory, vol. 2022, IEEE, 2022, pp. 504–09, doi:10.1109/ISIT50566.2022.9834850. short: P. Joshi, A. Purkayastha, Y. Zhang, A.J. Budkuley, S. Jaggi, in:, 2022 IEEE International Symposium on Information Theory, IEEE, 2022, pp. 504–509. 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:23:35Z day: '03' department: - _id: MaMo doi: 10.1109/ISIT50566.2022.9834850 intvolume: ' 2022' language: - iso: eng month: '08' oa_version: None page: 504-509 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: On the capacity of additive AVCs with feedback 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: '12018' abstract: - lang: eng text: We study the problem of characterizing the maximal rates of list decoding in Euclidean spaces for finite list sizes. For any positive integer L ≥ 2 and real N > 0, we say that a subset C⊂Rn is an (N,L – 1)-multiple packing or an (N,L– 1)-list decodable code if every Euclidean ball of radius nN−−−√ in ℝ n contains no more than L − 1 points of C. We study this problem with and without ℓ 2 norm constraints on C, and derive the best-known lower bounds on the maximal rate for (N,L−1) multiple packing. Our bounds are obtained via error exponents for list decoding over Additive White Gaussian Noise (AWGN) channels. We establish a curious inequality which relates the error exponent, a quantity of average-case nature, to the list-decoding radius, a quantity of worst-case nature. We derive various bounds on the error exponent for list decoding in both bounded and unbounded settings which could be of independent interest beyond multiple packing. article_processing_charge: No author: - first_name: Yihan full_name: Zhang, Yihan id: 2ce5da42-b2ea-11eb-bba5-9f264e9d002c last_name: Zhang - first_name: Shashank full_name: Vatedka, Shashank last_name: Vatedka citation: ama: 'Zhang Y, Vatedka S. Lower bounds on list decoding capacity using error exponents. In: 2022 IEEE International Symposium on Information Theory. Vol 2022. Institute of Electrical and Electronics Engineers; 2022:1324-1329. doi:10.1109/ISIT50566.2022.9834815' apa: 'Zhang, Y., & Vatedka, S. (2022). Lower bounds on list decoding capacity using error exponents. In 2022 IEEE International Symposium on Information Theory (Vol. 2022, pp. 1324–1329). Espoo, Finland: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ISIT50566.2022.9834815' chicago: Zhang, Yihan, and Shashank Vatedka. “Lower Bounds on List Decoding Capacity Using Error Exponents.” In 2022 IEEE International Symposium on Information Theory, 2022:1324–29. Institute of Electrical and Electronics Engineers, 2022. https://doi.org/10.1109/ISIT50566.2022.9834815. ieee: Y. Zhang and S. Vatedka, “Lower bounds on list decoding capacity using error exponents,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 1324–1329. ista: 'Zhang Y, Vatedka S. 2022. Lower bounds on list decoding capacity using error exponents. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 1324–1329.' mla: Zhang, Yihan, and Shashank Vatedka. “Lower Bounds on List Decoding Capacity Using Error Exponents.” 2022 IEEE International Symposium on Information Theory, vol. 2022, Institute of Electrical and Electronics Engineers, 2022, pp. 1324–29, doi:10.1109/ISIT50566.2022.9834815. short: Y. Zhang, S. Vatedka, in:, 2022 IEEE International Symposium on Information Theory, Institute of Electrical and Electronics Engineers, 2022, pp. 1324–1329. 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:06Z date_published: 2022-08-03T00:00:00Z date_updated: 2023-02-13T09:02:06Z day: '03' department: - _id: MaMo doi: 10.1109/ISIT50566.2022.9834815 intvolume: ' 2022' language: - iso: eng month: '08' oa_version: None page: 1324-1329 publication: 2022 IEEE International Symposium on Information Theory publication_identifier: isbn: - '9781665421591' issn: - 2157-8095 publication_status: published publisher: Institute of Electrical and Electronics Engineers quality_controlled: '1' scopus_import: '1' status: public title: Lower bounds on list decoding capacity using error exponents type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2022 year: '2022' ... --- _id: '12015' abstract: - lang: eng text: We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let P, N > 0 and L∈Z≥2. A multiple packing is a set C of points in Bn(0–,nP−−−√) such that any point in ℝ n lies in the intersection of at most L – 1 balls of radius nN−−−√ around points in C. 1 In this paper, we derive two lower bounds on the largest possible density of a multiple packing. These bounds are obtained through a stronger notion called average-radius multiple packing. Specifically, we exactly pin down the asymptotics of (expurgated) Gaussian codes and (expurgated) spherical codes under average-radius multiple packing. To this end, we apply tools from high-dimensional geometry and large deviation theory. The bound for spherical codes matches the previous best known bound which was obtained for the standard (weaker) notion of multiple packing through a curious connection with error exponents [Bli99], [ZV21]. The bound for Gaussian codes suggests that they are strictly inferior to spherical codes. article_processing_charge: No author: - first_name: Yihan full_name: Zhang, Yihan id: 2ce5da42-b2ea-11eb-bba5-9f264e9d002c last_name: Zhang - first_name: Shashank full_name: Vatedka, Shashank last_name: Vatedka citation: ama: 'Zhang Y, Vatedka S. Lower bounds for multiple packing. In: 2022 IEEE International Symposium on Information Theory. Vol 2022. IEEE; 2022:3085-3090. doi:10.1109/ISIT50566.2022.9834443' apa: 'Zhang, Y., & Vatedka, S. (2022). Lower bounds for multiple packing. In 2022 IEEE International Symposium on Information Theory (Vol. 2022, pp. 3085–3090). Espoo, Finland: IEEE. https://doi.org/10.1109/ISIT50566.2022.9834443' chicago: Zhang, Yihan, and Shashank Vatedka. “Lower Bounds for Multiple Packing.” In 2022 IEEE International Symposium on Information Theory, 2022:3085–90. IEEE, 2022. https://doi.org/10.1109/ISIT50566.2022.9834443. ieee: Y. Zhang and S. Vatedka, “Lower bounds for multiple packing,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 3085–3090. ista: 'Zhang Y, Vatedka S. 2022. Lower bounds for multiple packing. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 3085–3090.' mla: Zhang, Yihan, and Shashank Vatedka. “Lower Bounds for Multiple Packing.” 2022 IEEE International Symposium on Information Theory, vol. 2022, IEEE, 2022, pp. 3085–90, doi:10.1109/ISIT50566.2022.9834443. short: Y. Zhang, S. Vatedka, in:, 2022 IEEE International Symposium on Information Theory, IEEE, 2022, pp. 3085–3090. 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:39:04Z day: '03' department: - _id: MaMo doi: 10.1109/ISIT50566.2022.9834443 intvolume: ' 2022' language: - iso: eng month: '08' oa_version: None page: 3085-3090 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: Lower bounds for multiple packing type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2022 year: '2022' ... --- _id: '12014' abstract: - lang: eng text: We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let N > 0 and L∈Z≥2. A multiple packing is a set C of points in Rn such that any point in Rn lies in the intersection of at most L – 1 balls of radius nN−−−√ around points in C. Given a well-known connection with coding theory, multiple packings can be viewed as the Euclidean analog of list-decodable codes, which are well-studied for finite fields. In this paper, we exactly pin down the asymptotic density of (expurgated) Poisson Point Processes under a stronger notion called average-radius multiple packing. To this end, we apply tools from high-dimensional geometry and large deviation theory. This gives rise to the best known lower bound on the largest multiple packing density. Our result corrects a mistake in a previous paper by Blinovsky [Bli05]. article_processing_charge: No author: - first_name: Yihan full_name: Zhang, Yihan id: 2ce5da42-b2ea-11eb-bba5-9f264e9d002c last_name: Zhang - first_name: Shashank full_name: Vatedka, Shashank last_name: Vatedka citation: ama: 'Zhang Y, Vatedka S. List-decodability of Poisson Point Processes. In: 2022 IEEE International Symposium on Information Theory. Vol 2022. IEEE; 2022:2559-2564. doi:10.1109/ISIT50566.2022.9834512' apa: 'Zhang, Y., & Vatedka, S. (2022). List-decodability of Poisson Point Processes. In 2022 IEEE International Symposium on Information Theory (Vol. 2022, pp. 2559–2564). Espoo, Finland: IEEE. https://doi.org/10.1109/ISIT50566.2022.9834512' chicago: Zhang, Yihan, and Shashank Vatedka. “List-Decodability of Poisson Point Processes.” In 2022 IEEE International Symposium on Information Theory, 2022:2559–64. IEEE, 2022. https://doi.org/10.1109/ISIT50566.2022.9834512. ieee: Y. Zhang and S. Vatedka, “List-decodability of Poisson Point Processes,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 2559–2564. ista: 'Zhang Y, Vatedka S. 2022. List-decodability of Poisson Point Processes. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 2559–2564.' mla: Zhang, Yihan, and Shashank Vatedka. “List-Decodability of Poisson Point Processes.” 2022 IEEE International Symposium on Information Theory, vol. 2022, IEEE, 2022, pp. 2559–64, doi:10.1109/ISIT50566.2022.9834512. short: Y. Zhang, S. Vatedka, in:, 2022 IEEE International Symposium on Information Theory, IEEE, 2022, pp. 2559–2564. 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-05T09:23:04Z day: '03' department: - _id: MaMo doi: 10.1109/ISIT50566.2022.9834512 intvolume: ' 2022' language: - iso: eng month: '08' oa_version: None page: 2559-2564 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: List-decodability of Poisson Point Processes type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2022 year: '2022' ... --- _id: '12019' abstract: - lang: eng text: This paper studies combinatorial properties of codes for the Z-channel. A Z-channel with error fraction τ takes as input a length-n binary codeword and injects in an adversarial manner up to nτ asymmetric errors, i.e., errors that only zero out bits but do not flip 0’s to 1’s. It is known that the largest (L − 1)-list-decodable code for the Z-channel with error fraction τ has exponential (in n) size if τ is less than a critical value that we call the Plotkin point and has constant size if τ is larger than the threshold. The (L−1)-list-decoding Plotkin point is known to be L−1L−1−L−LL−1. In this paper, we show that the largest (L−1)-list-decodable code ε-above the Plotkin point has size Θ L (ε −3/2 ) for any L − 1 ≥ 1. article_processing_charge: No author: - first_name: Nikita full_name: Polyanskii, Nikita last_name: Polyanskii - first_name: Yihan full_name: Zhang, Yihan id: 2ce5da42-b2ea-11eb-bba5-9f264e9d002c last_name: Zhang citation: ama: 'Polyanskii N, Zhang Y. List-decodable zero-rate codes for the Z-channel. In: 2022 IEEE International Symposium on Information Theory. Vol 2022. Institute of Electrical and Electronics Engineers; 2022:2553-2558. doi:10.1109/ISIT50566.2022.9834829' apa: 'Polyanskii, N., & Zhang, Y. (2022). List-decodable zero-rate codes for the Z-channel. In 2022 IEEE International Symposium on Information Theory (Vol. 2022, pp. 2553–2558). Espoo, Finland: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ISIT50566.2022.9834829' chicago: Polyanskii, Nikita, and Yihan Zhang. “List-Decodable Zero-Rate Codes for the Z-Channel.” In 2022 IEEE International Symposium on Information Theory, 2022:2553–58. Institute of Electrical and Electronics Engineers, 2022. https://doi.org/10.1109/ISIT50566.2022.9834829. ieee: N. Polyanskii and Y. Zhang, “List-decodable zero-rate codes for the Z-channel,” in 2022 IEEE International Symposium on Information Theory, Espoo, Finland, 2022, vol. 2022, pp. 2553–2558. ista: 'Polyanskii N, Zhang Y. 2022. List-decodable zero-rate codes for the Z-channel. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 2553–2558.' mla: Polyanskii, Nikita, and Yihan Zhang. “List-Decodable Zero-Rate Codes for the Z-Channel.” 2022 IEEE International Symposium on Information Theory, vol. 2022, Institute of Electrical and Electronics Engineers, 2022, pp. 2553–58, doi:10.1109/ISIT50566.2022.9834829. short: N. Polyanskii, Y. Zhang, in:, 2022 IEEE International Symposium on Information Theory, Institute of Electrical and Electronics Engineers, 2022, pp. 2553–2558. 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:07Z date_published: 2022-08-03T00:00:00Z date_updated: 2023-02-13T09:02:18Z day: '03' department: - _id: MaMo doi: 10.1109/ISIT50566.2022.9834829 intvolume: ' 2022' language: - iso: eng month: '08' oa_version: None page: 2553-2558 publication: 2022 IEEE International Symposium on Information Theory publication_identifier: isbn: - '9781665421591' issn: - 2157-8095 publication_status: published publisher: Institute of Electrical and Electronics Engineers quality_controlled: '1' scopus_import: '1' status: public title: List-decodable zero-rate codes for the Z-channel 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 license: https://creativecommons.org/licenses/by-nc-sa/4.0/ 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: '12088' abstract: - lang: eng text: We present a quantum-enabled microwave-telecom interface with bidirectional conversion efficiencies up to 15% and added input noise quanta as low as 0.16. Moreover, we observe evidence for electro-optic laser cooling and vacuum amplification. article_number: FW4D.4 article_processing_charge: No author: - first_name: Rishabh full_name: Sahu, Rishabh id: 47D26E34-F248-11E8-B48F-1D18A9856A87 last_name: Sahu orcid: 0000-0001-6264-2162 - first_name: William J full_name: Hease, William J id: 29705398-F248-11E8-B48F-1D18A9856A87 last_name: Hease - first_name: Alfredo R full_name: Rueda Sanchez, Alfredo R id: 3B82B0F8-F248-11E8-B48F-1D18A9856A87 last_name: Rueda Sanchez orcid: 0000-0001-6249-5860 - first_name: Georg M full_name: Arnold, Georg M id: 3770C838-F248-11E8-B48F-1D18A9856A87 last_name: Arnold - first_name: Liu full_name: Qiu, Liu id: 45e99c0d-1eb1-11eb-9b96-ed8ab2983cac last_name: Qiu orcid: 0000-0003-4345-4267 - first_name: Johannes M full_name: Fink, Johannes M id: 4B591CBA-F248-11E8-B48F-1D18A9856A87 last_name: Fink orcid: 0000-0001-8112-028X citation: ama: 'Sahu R, Hease WJ, Rueda Sanchez AR, Arnold GM, Qiu L, Fink JM. Realizing a quantum-enabled interconnect between microwave and telecom light. In: Conference on Lasers and Electro-Optics. Optica Publishing Group; 2022. doi:10.1364/CLEO_QELS.2022.FW4D.4' apa: 'Sahu, R., Hease, W. J., Rueda Sanchez, A. R., Arnold, G. M., Qiu, L., & Fink, J. M. (2022). Realizing a quantum-enabled interconnect between microwave and telecom light. In Conference on Lasers and Electro-Optics. San Jose, CA, United States: Optica Publishing Group. https://doi.org/10.1364/CLEO_QELS.2022.FW4D.4' chicago: Sahu, Rishabh, William J Hease, Alfredo R Rueda Sanchez, Georg M Arnold, Liu Qiu, and Johannes M Fink. “Realizing a Quantum-Enabled Interconnect between Microwave and Telecom Light.” In Conference on Lasers and Electro-Optics. Optica Publishing Group, 2022. https://doi.org/10.1364/CLEO_QELS.2022.FW4D.4. ieee: R. Sahu, W. J. Hease, A. R. Rueda Sanchez, G. M. Arnold, L. Qiu, and J. M. Fink, “Realizing a quantum-enabled interconnect between microwave and telecom light,” in Conference on Lasers and Electro-Optics, San Jose, CA, United States, 2022. ista: 'Sahu R, Hease WJ, Rueda Sanchez AR, Arnold GM, Qiu L, Fink JM. 2022. Realizing a quantum-enabled interconnect between microwave and telecom light. Conference on Lasers and Electro-Optics. CLEO: QELS Fundamental Science, FW4D.4.' mla: Sahu, Rishabh, et al. “Realizing a Quantum-Enabled Interconnect between Microwave and Telecom Light.” Conference on Lasers and Electro-Optics, FW4D.4, Optica Publishing Group, 2022, doi:10.1364/CLEO_QELS.2022.FW4D.4. short: R. Sahu, W.J. Hease, A.R. Rueda Sanchez, G.M. Arnold, L. Qiu, J.M. Fink, in:, Conference on Lasers and Electro-Optics, Optica Publishing Group, 2022. conference: end_date: 2022-05-20 location: San Jose, CA, United States name: 'CLEO: QELS Fundamental Science' start_date: 2022-05-15 date_created: 2022-09-11T22:01:58Z date_published: 2022-05-01T00:00:00Z date_updated: 2023-02-13T09:06:10Z day: '01' department: - _id: JoFi doi: 10.1364/CLEO_QELS.2022.FW4D.4 language: - iso: eng month: '05' oa_version: None publication: Conference on Lasers and Electro-Optics publication_identifier: isbn: - '9781557528209' publication_status: published publisher: Optica Publishing Group quality_controlled: '1' scopus_import: '1' status: public title: Realizing a quantum-enabled interconnect between microwave and telecom light type: conference 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 license: https://creativecommons.org/licenses/by-nc-nd/4.0/ 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: '12307' abstract: - lang: eng text: Point-set topology is among the most abstract branches of mathematics in that it lacks tangible notions of distance, length, magnitude, order, and size. There is no shape, no geometry, no algebra, and no direction. Everything we are used to visualizing is gone. In the teaching and learning of mathematics, this can present a conundrum. Yet, this very property makes point set topology perfect for teaching and learning abstract mathematical concepts. It clears our minds of preconceived intuitions and expectations and forces us to think in new and creative ways. In this paper, we present guided investigations into topology through questions and thinking strategies that open up fascinating problems. They are intended for faculty who already teach or are thinking about teaching a class in topology or abstract mathematical reasoning for undergraduates. They can be used to build simple to challenging projects in topology, proofs, honors programs, and research experiences. article_processing_charge: No article_type: original author: - first_name: Barbara A. full_name: Shipman, Barbara A. last_name: Shipman - 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: Shipman BA, Stephenson ER. Tangible topology through the lens of limits. PRIMUS. 2022;32(5):593-609. doi:10.1080/10511970.2021.1872750 apa: Shipman, B. A., & Stephenson, E. R. (2022). Tangible topology through the lens of limits. PRIMUS. Taylor & Francis. https://doi.org/10.1080/10511970.2021.1872750 chicago: Shipman, Barbara A., and Elizabeth R Stephenson. “Tangible Topology through the Lens of Limits.” PRIMUS. Taylor & Francis, 2022. https://doi.org/10.1080/10511970.2021.1872750. ieee: B. A. Shipman and E. R. Stephenson, “Tangible topology through the lens of limits,” PRIMUS, vol. 32, no. 5. Taylor & Francis, pp. 593–609, 2022. ista: Shipman BA, Stephenson ER. 2022. Tangible topology through the lens of limits. PRIMUS. 32(5), 593–609. mla: Shipman, Barbara A., and Elizabeth R. Stephenson. “Tangible Topology through the Lens of Limits.” PRIMUS, vol. 32, no. 5, Taylor & Francis, 2022, pp. 593–609, doi:10.1080/10511970.2021.1872750. short: B.A. Shipman, E.R. Stephenson, PRIMUS 32 (2022) 593–609. date_created: 2023-01-16T10:07:21Z date_published: 2022-05-28T00:00:00Z date_updated: 2023-01-30T13:02:30Z day: '28' department: - _id: HeEd - _id: GradSch doi: 10.1080/10511970.2021.1872750 intvolume: ' 32' issue: '5' keyword: - Education - General Mathematics language: - iso: eng month: '05' oa_version: None page: 593-609 publication: PRIMUS publication_identifier: eissn: - 1935-4053 issn: - 1051-1970 publication_status: published publisher: Taylor & Francis quality_controlled: '1' scopus_import: '1' status: public title: Tangible topology through the lens of limits type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 32 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: '12529' abstract: - lang: eng text: "We consider turn-based stochastic 2-player games on graphs with ω-regular winning conditions. We provide a direct symbolic algorithm for solving such games when the winning condition is formulated as a Rabin condition. For a stochastic Rabin game with k pairs over a game graph with n vertices, our algorithm runs in O(nk+2k!) symbolic steps, which improves the state of the art.\r\nWe have implemented our symbolic algorithm, along with performance optimizations including parallellization and acceleration, in a BDD-based synthesis tool called Fairsyn. We demonstrate the superiority of Fairsyn compared to the state of the art on a set of synthetic benchmarks derived from the VLTS benchmark suite and on a control system benchmark from the literature. In our experiments, Fairsyn performed significantly faster with up to two orders of magnitude improvement in computation time." alternative_title: - LNCS article_processing_charge: No author: - first_name: Tamajit full_name: Banerjee, Tamajit last_name: Banerjee - first_name: Rupak full_name: Majumdar, Rupak last_name: Majumdar - first_name: Kaushik full_name: Mallik, Kaushik id: 0834ff3c-6d72-11ec-94e0-b5b0a4fb8598 last_name: Mallik orcid: 0000-0001-9864-7475 - first_name: Anne-Kathrin full_name: Schmuck, Anne-Kathrin last_name: Schmuck - first_name: Sadegh full_name: Soudjani, Sadegh last_name: Soudjani citation: ama: 'Banerjee T, Majumdar R, Mallik K, Schmuck A-K, Soudjani S. A direct symbolic algorithm for solving stochastic rabin games. In: 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Vol 13244. Springer Nature; 2022:81-98. doi:10.1007/978-3-030-99527-0_5' apa: 'Banerjee, T., Majumdar, R., Mallik, K., Schmuck, A.-K., & Soudjani, S. (2022). A direct symbolic algorithm for solving stochastic rabin games. In 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13244, pp. 81–98). Munich, Germany: Springer Nature. https://doi.org/10.1007/978-3-030-99527-0_5' chicago: Banerjee, Tamajit, Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck, and Sadegh Soudjani. “A Direct Symbolic Algorithm for Solving Stochastic Rabin Games.” In 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 13244:81–98. Springer Nature, 2022. https://doi.org/10.1007/978-3-030-99527-0_5. ieee: T. Banerjee, R. Majumdar, K. Mallik, A.-K. Schmuck, and S. Soudjani, “A direct symbolic algorithm for solving stochastic rabin games,” in 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Munich, Germany, 2022, vol. 13244, pp. 81–98. ista: 'Banerjee T, Majumdar R, Mallik K, Schmuck A-K, Soudjani S. 2022. A direct symbolic algorithm for solving stochastic rabin games. 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13244, 81–98.' mla: Banerjee, Tamajit, et al. “A Direct Symbolic Algorithm for Solving Stochastic Rabin Games.” 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 13244, Springer Nature, 2022, pp. 81–98, doi:10.1007/978-3-030-99527-0_5. short: T. Banerjee, R. Majumdar, K. Mallik, A.-K. Schmuck, S. Soudjani, in:, 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2022, pp. 81–98. conference: end_date: 2022-04-07 location: Munich, Germany name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems' start_date: 2022-04-02 date_created: 2023-02-08T11:43:34Z date_published: 2022-03-29T00:00:00Z date_updated: 2023-02-09T08:58:48Z day: '29' doi: 10.1007/978-3-030-99527-0_5 extern: '1' intvolume: ' 13244' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1007/978-3-030-99527-0_5 month: '03' oa: 1 oa_version: Published Version page: 81-98 publication: 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems publication_identifier: eisbn: - '9783030995270' publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: A direct symbolic algorithm for solving stochastic rabin games type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 13244 year: '2022' ... --- _id: '12530' abstract: - lang: eng text: We present BOCoSy, a tool for Bounded symbolic Output-feedback Controller Synthesis. Given a specification, BOCoSy synthesizes symbolic output-feedback controllers which interact with a given plant via a pre-defined finite symbolic interface. BOCoSy solves this problem by a new lazy abstraction-refinement technique which starts with a very coarse abstraction of the external trace semantics of the given plant and iteratively removes non-admissible behavior from this abstract model until a controller is found. BOCoSy steers the search for controllers towards small and concise state space representations by utilizing ideas from bounded synthesis. As a result, BOCoSy returns small and explainable controllers that are still powerful enough to solve the given synthesis problem. We show that BOCoSy is able to synthesize small, human readable symbolic controllers quickly on a set of benchmarks. article_processing_charge: No author: - first_name: Bernd full_name: Finkbeiner, Bernd last_name: Finkbeiner - first_name: Kaushik full_name: Mallik, Kaushik id: 0834ff3c-6d72-11ec-94e0-b5b0a4fb8598 last_name: Mallik orcid: 0000-0001-9864-7475 - first_name: Noemi full_name: Passing, Noemi last_name: Passing - first_name: Malte full_name: Schledjewski, Malte last_name: Schledjewski - first_name: Anne-Kathrin full_name: Schmuck, Anne-Kathrin last_name: Schmuck citation: ama: 'Finkbeiner B, Mallik K, Passing N, Schledjewski M, Schmuck A-K. BOCoSy: Small but powerful symbolic output-feedback control. In: 25th ACM International Conference on Hybrid Systems: Computation and Control. ACM; 2022:24:1-24:11. doi:10.1145/3501710.3519535' apa: 'Finkbeiner, B., Mallik, K., Passing, N., Schledjewski, M., & Schmuck, A.-K. (2022). BOCoSy: Small but powerful symbolic output-feedback control. In 25th ACM International Conference on Hybrid Systems: Computation and Control (p. 24:1-24:11). Milan, Italy: ACM. https://doi.org/10.1145/3501710.3519535' chicago: 'Finkbeiner, Bernd, Kaushik Mallik, Noemi Passing, Malte Schledjewski, and Anne-Kathrin Schmuck. “BOCoSy: Small but Powerful Symbolic Output-Feedback Control.” In 25th ACM International Conference on Hybrid Systems: Computation and Control, 24:1-24:11. ACM, 2022. https://doi.org/10.1145/3501710.3519535.' ieee: 'B. Finkbeiner, K. Mallik, N. Passing, M. Schledjewski, and A.-K. Schmuck, “BOCoSy: Small but powerful symbolic output-feedback control,” in 25th ACM International Conference on Hybrid Systems: Computation and Control, Milan, Italy, 2022, p. 24:1-24:11.' ista: 'Finkbeiner B, Mallik K, Passing N, Schledjewski M, Schmuck A-K. 2022. BOCoSy: Small but powerful symbolic output-feedback control. 25th ACM International Conference on Hybrid Systems: Computation and Control. HSCC: International Conference on Hybrid Systems Computation and Control, 24:1-24:11.' mla: 'Finkbeiner, Bernd, et al. “BOCoSy: Small but Powerful Symbolic Output-Feedback Control.” 25th ACM International Conference on Hybrid Systems: Computation and Control, ACM, 2022, p. 24:1-24:11, doi:10.1145/3501710.3519535.' short: 'B. Finkbeiner, K. Mallik, N. Passing, M. Schledjewski, A.-K. Schmuck, in:, 25th ACM International Conference on Hybrid Systems: Computation and Control, ACM, 2022, p. 24:1-24:11.' conference: end_date: 2022-05-06 location: Milan, Italy name: 'HSCC: International Conference on Hybrid Systems Computation and Control' start_date: 2022-05-04 date_created: 2023-02-08T11:43:50Z date_published: 2022-05-01T00:00:00Z date_updated: 2023-02-09T08:53:13Z day: '01' doi: 10.1145/3501710.3519535 extern: '1' language: - iso: eng month: '05' oa_version: None page: 24:1-24:11 publication: '25th ACM International Conference on Hybrid Systems: Computation and Control' publication_identifier: isbn: - '9781450391962' publication_status: published publisher: ACM quality_controlled: '1' scopus_import: '1' status: public title: 'BOCoSy: Small but powerful symbolic output-feedback control' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 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: '12580' abstract: - lang: eng text: River systems originating from the Upper Indus Basin (UIB) are dominated by runoff from snow and glacier melt and summer monsoonal rainfall. These water resources are highly stressed as huge populations of people living in this region depend on them, including for agriculture, domestic use, and energy production. Projections suggest that the UIB region will be affected by considerable (yet poorly quantified) changes to the seasonality and composition of runoff in the future, which are likely to have considerable impacts on these supplies. Given how directly and indirectly communities and ecosystems are dependent on these resources and the growing pressure on them due to ever-increasing demands, the impacts of climate change pose considerable adaptation challenges. The strong linkages between hydroclimate, cryosphere, water resources, and human activities within the UIB suggest that a multi- and inter-disciplinary research approach integrating the social and natural/environmental sciences is critical for successful adaptation to ongoing and future hydrological and climate change. Here we use a horizon scanning technique to identify the Top 100 questions related to the most pressing knowledge gaps and research priorities in social and natural sciences on climate change and water in the UIB. These questions are on the margins of current thinking and investigation and are clustered into 14 themes, covering three overarching topics of “governance, policy, and sustainable solutions”, “socioeconomic processes and livelihoods”, and “integrated Earth System processes”. Raising awareness of these cutting-edge knowledge gaps and opportunities will hopefully encourage researchers, funding bodies, practitioners, and policy makers to address them. article_number: e2021EF002619 article_processing_charge: No article_type: original author: - first_name: Andrew full_name: Orr, Andrew last_name: Orr - first_name: Bashir full_name: Ahmad, Bashir last_name: Ahmad - first_name: Undala full_name: Alam, Undala last_name: Alam - first_name: ArivudaiNambi full_name: Appadurai, ArivudaiNambi last_name: Appadurai - first_name: Zareen P. full_name: Bharucha, Zareen P. last_name: Bharucha - first_name: Hester full_name: Biemans, Hester last_name: Biemans - first_name: Tobias full_name: Bolch, Tobias last_name: Bolch - first_name: Narayan P. full_name: Chaulagain, Narayan P. last_name: Chaulagain - first_name: Sanita full_name: Dhaubanjar, Sanita last_name: Dhaubanjar - first_name: A. P. full_name: Dimri, A. P. last_name: Dimri - first_name: Harry full_name: Dixon, Harry last_name: Dixon - first_name: Hayley J. full_name: Fowler, Hayley J. last_name: Fowler - first_name: Giovanna full_name: Gioli, Giovanna last_name: Gioli - first_name: Sarah J. full_name: Halvorson, Sarah J. last_name: Halvorson - first_name: Abid full_name: Hussain, Abid last_name: Hussain - first_name: Ghulam full_name: Jeelani, Ghulam last_name: Jeelani - first_name: Simi full_name: Kamal, Simi last_name: Kamal - first_name: Imran S. full_name: Khalid, Imran S. last_name: Khalid - first_name: Shiyin full_name: Liu, Shiyin last_name: Liu - first_name: Arthur full_name: Lutz, Arthur last_name: Lutz - first_name: Meeta K. full_name: Mehra, Meeta K. last_name: Mehra - first_name: Evan full_name: Miles, Evan last_name: Miles - first_name: Andrea full_name: Momblanch, Andrea last_name: Momblanch - first_name: Veruska full_name: Muccione, Veruska last_name: Muccione - first_name: Aditi full_name: Mukherji, Aditi last_name: Mukherji - first_name: Daanish full_name: Mustafa, Daanish last_name: Mustafa - first_name: Omaid full_name: Najmuddin, Omaid last_name: Najmuddin - first_name: Mohammad N. full_name: Nasimi, Mohammad N. last_name: Nasimi - first_name: Marcus full_name: Nüsser, Marcus last_name: Nüsser - first_name: Vishnu P. full_name: Pandey, Vishnu P. last_name: Pandey - first_name: Sitara full_name: Parveen, Sitara last_name: Parveen - first_name: Francesca full_name: Pellicciotti, Francesca id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70 last_name: Pellicciotti - first_name: Carmel full_name: Pollino, Carmel last_name: Pollino - first_name: Emily full_name: Potter, Emily last_name: Potter - first_name: Mohammad R. full_name: Qazizada, Mohammad R. last_name: Qazizada - first_name: Saon full_name: Ray, Saon last_name: Ray - first_name: Shakil full_name: Romshoo, Shakil last_name: Romshoo - first_name: Syamal K. full_name: Sarkar, Syamal K. last_name: Sarkar - first_name: Amiera full_name: Sawas, Amiera last_name: Sawas - first_name: Sumit full_name: Sen, Sumit last_name: Sen - first_name: Attaullah full_name: Shah, Attaullah last_name: Shah - first_name: M. Azeem Ali full_name: Shah, M. Azeem Ali last_name: Shah - first_name: Joseph M. full_name: Shea, Joseph M. last_name: Shea - first_name: Ali T. full_name: Sheikh, Ali T. last_name: Sheikh - first_name: Arun B. full_name: Shrestha, Arun B. last_name: Shrestha - first_name: Shresth full_name: Tayal, Shresth last_name: Tayal - first_name: Snehlata full_name: Tigala, Snehlata last_name: Tigala - first_name: Zeeshan T. full_name: Virk, Zeeshan T. last_name: Virk - first_name: Philippus full_name: Wester, Philippus last_name: Wester - first_name: James L. full_name: Wescoat, James L. last_name: Wescoat citation: ama: 'Orr A, Ahmad B, Alam U, et al. Knowledge priorities on climate change and water in the Upper Indus Basin: A horizon scanning exercise to identify the Top 100 research questions in social and natural sciences. Earth’s Future. 2022;10(4). doi:10.1029/2021ef002619' apa: 'Orr, A., Ahmad, B., Alam, U., Appadurai, A., Bharucha, Z. P., Biemans, H., … Wescoat, J. L. (2022). Knowledge priorities on climate change and water in the Upper Indus Basin: A horizon scanning exercise to identify the Top 100 research questions in social and natural sciences. Earth’s Future. American Geophysical Union. https://doi.org/10.1029/2021ef002619' chicago: 'Orr, Andrew, Bashir Ahmad, Undala Alam, ArivudaiNambi Appadurai, Zareen P. Bharucha, Hester Biemans, Tobias Bolch, et al. “Knowledge Priorities on Climate Change and Water in the Upper Indus Basin: A Horizon Scanning Exercise to Identify the Top 100 Research Questions in Social and Natural Sciences.” Earth’s Future. American Geophysical Union, 2022. https://doi.org/10.1029/2021ef002619.' ieee: 'A. Orr et al., “Knowledge priorities on climate change and water in the Upper Indus Basin: A horizon scanning exercise to identify the Top 100 research questions in social and natural sciences,” Earth’s Future, vol. 10, no. 4. American Geophysical Union, 2022.' ista: 'Orr A, Ahmad B, Alam U, Appadurai A, Bharucha ZP, Biemans H, Bolch T, Chaulagain NP, Dhaubanjar S, Dimri AP, Dixon H, Fowler HJ, Gioli G, Halvorson SJ, Hussain A, Jeelani G, Kamal S, Khalid IS, Liu S, Lutz A, Mehra MK, Miles E, Momblanch A, Muccione V, Mukherji A, Mustafa D, Najmuddin O, Nasimi MN, Nüsser M, Pandey VP, Parveen S, Pellicciotti F, Pollino C, Potter E, Qazizada MR, Ray S, Romshoo S, Sarkar SK, Sawas A, Sen S, Shah A, Shah MAA, Shea JM, Sheikh AT, Shrestha AB, Tayal S, Tigala S, Virk ZT, Wester P, Wescoat JL. 2022. Knowledge priorities on climate change and water in the Upper Indus Basin: A horizon scanning exercise to identify the Top 100 research questions in social and natural sciences. Earth’s Future. 10(4), e2021EF002619.' mla: 'Orr, Andrew, et al. “Knowledge Priorities on Climate Change and Water in the Upper Indus Basin: A Horizon Scanning Exercise to Identify the Top 100 Research Questions in Social and Natural Sciences.” Earth’s Future, vol. 10, no. 4, e2021EF002619, American Geophysical Union, 2022, doi:10.1029/2021ef002619.' short: A. Orr, B. Ahmad, U. Alam, A. Appadurai, Z.P. Bharucha, H. Biemans, T. Bolch, N.P. Chaulagain, S. Dhaubanjar, A.P. Dimri, H. Dixon, H.J. Fowler, G. Gioli, S.J. Halvorson, A. Hussain, G. Jeelani, S. Kamal, I.S. Khalid, S. Liu, A. Lutz, M.K. Mehra, E. Miles, A. Momblanch, V. Muccione, A. Mukherji, D. Mustafa, O. Najmuddin, M.N. Nasimi, M. Nüsser, V.P. Pandey, S. Parveen, F. Pellicciotti, C. Pollino, E. Potter, M.R. Qazizada, S. Ray, S. Romshoo, S.K. Sarkar, A. Sawas, S. Sen, A. Shah, M.A.A. Shah, J.M. Shea, A.T. Sheikh, A.B. Shrestha, S. Tayal, S. Tigala, Z.T. Virk, P. Wester, J.L. Wescoat, Earth’s Future 10 (2022). date_created: 2023-02-20T08:10:23Z date_published: 2022-04-01T00:00:00Z date_updated: 2023-02-28T13:41:50Z day: '01' doi: 10.1029/2021ef002619 extern: '1' intvolume: ' 10' issue: '4' keyword: - Earth and Planetary Sciences (miscellaneous) - General Environmental Science language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1029/2021EF002619 month: '04' oa: 1 oa_version: Published Version publication: Earth's Future publication_identifier: issn: - 2328-4277 publication_status: published publisher: American Geophysical Union quality_controlled: '1' scopus_import: '1' status: public title: 'Knowledge priorities on climate change and water in the Upper Indus Basin: A horizon scanning exercise to identify the Top 100 research questions in social and natural sciences' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 10 year: '2022' ... --- _id: '12581' abstract: - lang: eng text: Topographic development via paraglacial slope failure (PSF) represents a complex interplay between geological structure, climate, and glacial denudation. Southeastern Tibet has experienced amongst the highest rates of ice mass loss in High Mountain Asia in recent decades, but few studies have focused on the implications of this mass loss on the stability of paraglacial slopes. We used repeat satellite- and unpiloted aerial vehicle (UAV)-derived imagery between 1990 and 2020 as the basis for mapping PSFs from slopes adjacent to Hailuogou Glacier (HLG), a 5 km long monsoon temperate valley glacier in the Mt. Gongga region. We observed recent lowering of the glacier tongue surface at rates of up to 0.88 m a−1 in the period 2000 to 2016, whilst overall paraglacial bare ground area (PBGA) on glacier-adjacent slopes increased from 0.31 ± 0.27 km2 in 1990 to 1.38 ± 0.06 km2 in 2020. Decadal PBGA expansion rates were ∼ 0.01 km2 a−1, 0.02 km2 a−1, and 0.08 km2 in the periods 1990–2000, 2000–2011, and 2011–2020 respectively, indicating an increasing rate of expansion of PBGA. Three types of PSFs, including rockfalls, sediment-mantled slope slides, and headward gully erosion, were mapped, with a total area of 0.75 ± 0.03 km2 in 2020. South-facing valley slopes (true left of the glacier) exhibited more destabilization (56 % of the total PSF area) than north-facing (true right) valley slopes (44 % of the total PSF area). Deformation of sediment-mantled moraine slopes (mean 1.65–2.63 ± 0.04 cm d−1) and an increase in erosion activity in ice-marginal tributary valleys caused by a drop in local base level (gully headward erosion rates are 0.76–3.39 cm d−1) have occurred in tandem with recent glacier downwasting. We also observe deformation of glacier ice, possibly driven by destabilization of lateral moraine, as has been reported in other deglaciating mountain glacier catchments. The formation, evolution, and future trajectory of PSFs at HLG (as well as other monsoon-dominated deglaciating mountain areas) are related to glacial history, including recent rapid downwasting leading to the exposure of steep, unstable bedrock and moraine slopes, and climatic conditions that promote slope instability, such as very high seasonal precipitation and seasonal temperature fluctuations that are conducive to freeze–thaw and ice segregation processes. article_processing_charge: No article_type: original author: - first_name: Yan full_name: Zhong, Yan last_name: Zhong - first_name: Qiao full_name: Liu, Qiao last_name: Liu - first_name: Matthew full_name: Westoby, Matthew last_name: Westoby - first_name: Yong full_name: Nie, Yong last_name: Nie - first_name: Francesca full_name: Pellicciotti, Francesca id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70 last_name: Pellicciotti - first_name: Bo full_name: Zhang, Bo last_name: Zhang - first_name: Jialun full_name: Cai, Jialun last_name: Cai - first_name: Guoxiang full_name: Liu, Guoxiang last_name: Liu - first_name: Haijun full_name: Liao, Haijun last_name: Liao - first_name: Xuyang full_name: Lu, Xuyang last_name: Lu citation: ama: Zhong Y, Liu Q, Westoby M, et al. Intensified paraglacial slope failures due to accelerating downwasting of a temperate glacier in Mt. Gongga, southeastern Tibetan Plateau. Earth Surface Dynamics. 2022;10(1):23-42. doi:10.5194/esurf-10-23-2022 apa: Zhong, Y., Liu, Q., Westoby, M., Nie, Y., Pellicciotti, F., Zhang, B., … Lu, X. (2022). Intensified paraglacial slope failures due to accelerating downwasting of a temperate glacier in Mt. Gongga, southeastern Tibetan Plateau. Earth Surface Dynamics. Copernicus Publications. https://doi.org/10.5194/esurf-10-23-2022 chicago: Zhong, Yan, Qiao Liu, Matthew Westoby, Yong Nie, Francesca Pellicciotti, Bo Zhang, Jialun Cai, Guoxiang Liu, Haijun Liao, and Xuyang Lu. “Intensified Paraglacial Slope Failures Due to Accelerating Downwasting of a Temperate Glacier in Mt. Gongga, Southeastern Tibetan Plateau.” Earth Surface Dynamics. Copernicus Publications, 2022. https://doi.org/10.5194/esurf-10-23-2022. ieee: Y. Zhong et al., “Intensified paraglacial slope failures due to accelerating downwasting of a temperate glacier in Mt. Gongga, southeastern Tibetan Plateau,” Earth Surface Dynamics, vol. 10, no. 1. Copernicus Publications, pp. 23–42, 2022. ista: Zhong Y, Liu Q, Westoby M, Nie Y, Pellicciotti F, Zhang B, Cai J, Liu G, Liao H, Lu X. 2022. Intensified paraglacial slope failures due to accelerating downwasting of a temperate glacier in Mt. Gongga, southeastern Tibetan Plateau. Earth Surface Dynamics. 10(1), 23–42. mla: Zhong, Yan, et al. “Intensified Paraglacial Slope Failures Due to Accelerating Downwasting of a Temperate Glacier in Mt. Gongga, Southeastern Tibetan Plateau.” Earth Surface Dynamics, vol. 10, no. 1, Copernicus Publications, 2022, pp. 23–42, doi:10.5194/esurf-10-23-2022. short: Y. Zhong, Q. Liu, M. Westoby, Y. Nie, F. Pellicciotti, B. Zhang, J. Cai, G. Liu, H. Liao, X. Lu, Earth Surface Dynamics 10 (2022) 23–42. date_created: 2023-02-20T08:10:30Z date_published: 2022-01-11T00:00:00Z date_updated: 2023-02-28T13:38:27Z day: '11' doi: 10.5194/esurf-10-23-2022 extern: '1' intvolume: ' 10' issue: '1' keyword: - Earth-Surface Processes - Geophysics language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.5194/esurf-10-23-2022 month: '01' oa: 1 oa_version: Published Version page: 23-42 publication: Earth Surface Dynamics publication_identifier: issn: - 2196-632X publication_status: published publisher: Copernicus Publications quality_controlled: '1' scopus_import: '1' status: public title: Intensified paraglacial slope failures due to accelerating downwasting of a temperate glacier in Mt. Gongga, southeastern Tibetan Plateau type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 10 year: '2022' ... --- _id: '12576' abstract: - lang: eng text: Glacier health across High Mountain Asia (HMA) is highly heterogeneous and strongly governed by regional climate, which is variably influenced by monsoon dynamics and the westerlies. We explore four decades of glacier energy and mass balance at three climatically distinct sites across HMA by utilising a detailed land surface model driven by bias-corrected Weather Research and Forecasting meteorological forcing. All three glaciers have experienced long-term mass losses (ranging from −0.04 ± 0.09 to −0.59 ± 0.20 m w.e. a−1) consistent with widespread warming across the region. However, complex and contrasting responses of glacier energy and mass balance to the patterns of the Indian Summer Monsoon were evident, largely driven by the role snowfall timing, amount and phase. A later monsoon onset generates less total snowfall to the glacier in the southeastern Tibetan Plateau during May–June, augmenting net shortwave radiation and affecting annual mass balance (−0.5 m w.e. on average compared to early onset years). Conversely, timing of the monsoon’s arrival has limited impact for the Nepalese Himalaya which is more strongly governed by the temperature and snowfall amount during the core monsoon season. In the arid central Tibetan Plateau, a later monsoon arrival results in a 40 mm (58%) increase of May–June snowfall on average compared to early onset years, likely driven by the greater interaction of westerly storm events. Meanwhile, a late monsoon cessation at this site sees an average 200 mm (192%) increase in late summer precipitation due to monsoonal storms. A trend towards weaker intensity monsoon conditions in recent decades, combined with long-term warming patterns, has produced predominantly negative glacier mass balances for all sites (up to 1 m w.e. more mass loss in the Nepalese Himalaya compared to strong monsoon intensity years) but sub-regional variability in monsoon timing can additionally complicate this response. article_number: '104001' article_processing_charge: No article_type: letter_note author: - first_name: T E full_name: Shaw, T E last_name: Shaw - first_name: E S full_name: Miles, E S last_name: Miles - first_name: D full_name: Chen, D last_name: Chen - first_name: A full_name: Jouberton, A last_name: Jouberton - first_name: M full_name: Kneib, M last_name: Kneib - first_name: S full_name: Fugger, S last_name: Fugger - first_name: T full_name: Ou, T last_name: Ou - first_name: H-W full_name: Lai, H-W last_name: Lai - first_name: K full_name: Fujita, K last_name: Fujita - first_name: W full_name: Yang, W last_name: Yang - first_name: S full_name: Fatichi, S last_name: Fatichi - first_name: Francesca full_name: Pellicciotti, Francesca id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70 last_name: Pellicciotti citation: ama: Shaw TE, Miles ES, Chen D, et al. Multi-decadal monsoon characteristics and glacier response in High Mountain Asia. Environmental Research Letters. 2022;17(10). doi:10.1088/1748-9326/ac9008 apa: Shaw, T. E., Miles, E. S., Chen, D., Jouberton, A., Kneib, M., Fugger, S., … Pellicciotti, F. (2022). Multi-decadal monsoon characteristics and glacier response in High Mountain Asia. Environmental Research Letters. IOP Publishing. https://doi.org/10.1088/1748-9326/ac9008 chicago: Shaw, T E, E S Miles, D Chen, A Jouberton, M Kneib, S Fugger, T Ou, et al. “Multi-Decadal Monsoon Characteristics and Glacier Response in High Mountain Asia.” Environmental Research Letters. IOP Publishing, 2022. https://doi.org/10.1088/1748-9326/ac9008. ieee: T. E. Shaw et al., “Multi-decadal monsoon characteristics and glacier response in High Mountain Asia,” Environmental Research Letters, vol. 17, no. 10. IOP Publishing, 2022. ista: Shaw TE, Miles ES, Chen D, Jouberton A, Kneib M, Fugger S, Ou T, Lai H-W, Fujita K, Yang W, Fatichi S, Pellicciotti F. 2022. Multi-decadal monsoon characteristics and glacier response in High Mountain Asia. Environmental Research Letters. 17(10), 104001. mla: Shaw, T. E., et al. “Multi-Decadal Monsoon Characteristics and Glacier Response in High Mountain Asia.” Environmental Research Letters, vol. 17, no. 10, 104001, IOP Publishing, 2022, doi:10.1088/1748-9326/ac9008. short: T.E. Shaw, E.S. Miles, D. Chen, A. Jouberton, M. Kneib, S. Fugger, T. Ou, H.-W. Lai, K. Fujita, W. Yang, S. Fatichi, F. Pellicciotti, Environmental Research Letters 17 (2022). date_created: 2023-02-20T08:09:56Z date_published: 2022-09-16T00:00:00Z date_updated: 2023-02-28T13:53:16Z day: '16' doi: 10.1088/1748-9326/ac9008 extern: '1' intvolume: ' 17' issue: '10' keyword: - Public Health - Environmental and Occupational Health - General Environmental Science - Renewable Energy - Sustainability and the Environment language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1088/1748-9326/ac9008 month: '09' oa: 1 oa_version: Published Version publication: Environmental Research Letters publication_identifier: issn: - 1748-9326 publication_status: published publisher: IOP Publishing quality_controlled: '1' scopus_import: '1' status: public title: Multi-decadal monsoon characteristics and glacier response in High Mountain Asia type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 17 year: '2022' ... --- _id: '12578' abstract: - lang: eng text: "Currently, about 12 %–13 % of High Mountain Asia’s glacier area is debris-covered, which alters its surface mass balance. However, in regional-scale modelling approaches, debris-covered glaciers are typically treated as clean-ice glaciers, leading to a bias when modelling their future evolution. Here, we present a new approach for modelling debris area and thickness evolution, applicable from single glaciers to the global scale. We derive a parameterization and implement it as a module into the Global Glacier Evolution Model (GloGEMflow), a combined mass-balance ice-flow model. The module is initialized with both glacier-specific observations of the debris' spatial distribution and estimates of debris thickness. These data sets account for the fact that debris can either enhance or reduce surface melt depending on thickness. Our model approach also enables representing the spatiotemporal evolution of debris extent and thickness. We calibrate and evaluate the module on a selected subset of glaciers and apply GloGEMflow using different climate scenarios to project the future evolution of all glaciers in High Mountain Asia until 2100. Explicitly accounting for debris cover has only a minor effect on the projected mass loss, which is in line with previous projections. Despite this small effect, we argue that the improved process representation is of added value when aiming at capturing intra-glacier scales, i.e. spatial mass-balance distribution.\r\nDepending on the climate scenario, the mean debris-cover fraction is expected to increase, while mean debris thickness is projected to show only minor changes, although large local thickening is expected. To isolate the influence of explicitly accounting for supraglacial debris cover, we re-compute glacier evolution without the debris-cover module. We show that glacier geometry, area, volume, and flow velocity evolve differently, especially at the level of individual glaciers. This highlights the importance of accounting for debris cover and its spatiotemporal evolution when projecting future glacier changes." article_processing_charge: No article_type: original author: - first_name: Loris full_name: Compagno, Loris last_name: Compagno - first_name: Matthias full_name: Huss, Matthias last_name: Huss - first_name: Evan Stewart full_name: Miles, Evan Stewart last_name: Miles - first_name: Michael James full_name: McCarthy, Michael James last_name: McCarthy - first_name: Harry full_name: Zekollari, Harry last_name: Zekollari - first_name: Amaury full_name: Dehecq, Amaury last_name: Dehecq - first_name: Francesca full_name: Pellicciotti, Francesca id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70 last_name: Pellicciotti - first_name: Daniel full_name: Farinotti, Daniel last_name: Farinotti citation: ama: 'Compagno L, Huss M, Miles ES, et al. Modelling supraglacial debris-cover evolution from the single-glacier to the regional scale: An application to High Mountain Asia. The Cryosphere. 2022;16(5):1697-1718. doi:10.5194/tc-16-1697-2022' apa: 'Compagno, L., Huss, M., Miles, E. S., McCarthy, M. J., Zekollari, H., Dehecq, A., … Farinotti, D. (2022). Modelling supraglacial debris-cover evolution from the single-glacier to the regional scale: An application to High Mountain Asia. The Cryosphere. Copernicus Publications. https://doi.org/10.5194/tc-16-1697-2022' chicago: 'Compagno, Loris, Matthias Huss, Evan Stewart Miles, Michael James McCarthy, Harry Zekollari, Amaury Dehecq, Francesca Pellicciotti, and Daniel Farinotti. “Modelling Supraglacial Debris-Cover Evolution from the Single-Glacier to the Regional Scale: An Application to High Mountain Asia.” The Cryosphere. Copernicus Publications, 2022. https://doi.org/10.5194/tc-16-1697-2022.' ieee: 'L. Compagno et al., “Modelling supraglacial debris-cover evolution from the single-glacier to the regional scale: An application to High Mountain Asia,” The Cryosphere, vol. 16, no. 5. Copernicus Publications, pp. 1697–1718, 2022.' ista: 'Compagno L, Huss M, Miles ES, McCarthy MJ, Zekollari H, Dehecq A, Pellicciotti F, Farinotti D. 2022. Modelling supraglacial debris-cover evolution from the single-glacier to the regional scale: An application to High Mountain Asia. The Cryosphere. 16(5), 1697–1718.' mla: 'Compagno, Loris, et al. “Modelling Supraglacial Debris-Cover Evolution from the Single-Glacier to the Regional Scale: An Application to High Mountain Asia.” The Cryosphere, vol. 16, no. 5, Copernicus Publications, 2022, pp. 1697–718, doi:10.5194/tc-16-1697-2022.' short: L. Compagno, M. Huss, E.S. Miles, M.J. McCarthy, H. Zekollari, A. Dehecq, F. Pellicciotti, D. Farinotti, The Cryosphere 16 (2022) 1697–1718. date_created: 2023-02-20T08:10:09Z date_published: 2022-05-05T00:00:00Z date_updated: 2023-02-28T13:47:17Z day: '05' doi: 10.5194/tc-16-1697-2022 extern: '1' intvolume: ' 16' issue: '5' keyword: - Earth-Surface Processes - Water Science and Technology language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.5194/tc-16-1697-2022 month: '05' oa: 1 oa_version: Published Version page: 1697-1718 publication: The Cryosphere publication_identifier: issn: - 1994-0424 publication_status: published publisher: Copernicus Publications quality_controlled: '1' scopus_import: '1' status: public title: 'Modelling supraglacial debris-cover evolution from the single-glacier to the regional scale: An application to High Mountain Asia' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 16 year: '2022' ... --- _id: '12579' abstract: - lang: eng text: "The Indian and East Asian summer monsoons shape the melt and accumulation patterns of glaciers in High Mountain Asia in complex ways due to the interaction of persistent cloud cover, large temperature ranges, high atmospheric water content and high precipitation rates. Glacier energy- and mass-balance modelling using in situ measurements offers insights into the ways in which surface processes are shaped by climatic regimes. In this study, we use a full energy- and mass-balance model and seven on-glacier automatic weather station datasets from different parts of the Central and Eastern Himalaya to investigate how monsoon conditions influence the glacier surface energy and mass balance. In particular, we look at how debris-covered and debris-free glaciers respond differently to monsoonal conditions.\r\nThe radiation budget primarily controls the melt of clean-ice glaciers, but turbulent fluxes play an important role in modulating the melt energy on debris-covered glaciers. The sensible heat flux decreases during core monsoon, but the latent heat flux cools the surface due to evaporation of liquid water. This interplay of radiative and turbulent fluxes causes debris-covered glacier melt rates to stay almost constant through the different phases of the monsoon. Ice melt under thin debris, on the other hand, is amplified by both the dark surface and the turbulent fluxes, which intensify melt during monsoon through surface heating and condensation.\r\nPre-monsoon snow cover can considerably delay melt onset and have a strong impact on the seasonal mass balance. Intermittent monsoon snow cover lowers the melt rates at high elevation. This work is fundamental to the understanding of the present and future Himalayan cryosphere and water budget, while informing and motivating further glacier- and catchment-scale research using process-based models." article_processing_charge: No article_type: original author: - first_name: Stefan full_name: Fugger, Stefan last_name: Fugger - first_name: Catriona L. full_name: Fyffe, Catriona L. last_name: Fyffe - first_name: Simone full_name: Fatichi, Simone last_name: Fatichi - first_name: Evan full_name: Miles, Evan last_name: Miles - first_name: Michael full_name: McCarthy, Michael last_name: McCarthy - first_name: Thomas E. full_name: Shaw, Thomas E. last_name: Shaw - first_name: Baohong full_name: Ding, Baohong last_name: Ding - first_name: Wei full_name: Yang, Wei last_name: Yang - first_name: Patrick full_name: Wagnon, Patrick last_name: Wagnon - first_name: Walter full_name: Immerzeel, Walter last_name: Immerzeel - first_name: Qiao full_name: Liu, Qiao last_name: Liu - first_name: Francesca full_name: Pellicciotti, Francesca id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70 last_name: Pellicciotti citation: ama: Fugger S, Fyffe CL, Fatichi S, et al. Understanding monsoon controls on the energy and mass balance of glaciers in the Central and Eastern Himalaya. The Cryosphere. 2022;16(5):1631-1652. doi:10.5194/tc-16-1631-2022 apa: Fugger, S., Fyffe, C. L., Fatichi, S., Miles, E., McCarthy, M., Shaw, T. E., … Pellicciotti, F. (2022). Understanding monsoon controls on the energy and mass balance of glaciers in the Central and Eastern Himalaya. The Cryosphere. Copernicus Publications. https://doi.org/10.5194/tc-16-1631-2022 chicago: Fugger, Stefan, Catriona L. Fyffe, Simone Fatichi, Evan Miles, Michael McCarthy, Thomas E. Shaw, Baohong Ding, et al. “Understanding Monsoon Controls on the Energy and Mass Balance of Glaciers in the Central and Eastern Himalaya.” The Cryosphere. Copernicus Publications, 2022. https://doi.org/10.5194/tc-16-1631-2022. ieee: S. Fugger et al., “Understanding monsoon controls on the energy and mass balance of glaciers in the Central and Eastern Himalaya,” The Cryosphere, vol. 16, no. 5. Copernicus Publications, pp. 1631–1652, 2022. ista: Fugger S, Fyffe CL, Fatichi S, Miles E, McCarthy M, Shaw TE, Ding B, Yang W, Wagnon P, Immerzeel W, Liu Q, Pellicciotti F. 2022. Understanding monsoon controls on the energy and mass balance of glaciers in the Central and Eastern Himalaya. The Cryosphere. 16(5), 1631–1652. mla: Fugger, Stefan, et al. “Understanding Monsoon Controls on the Energy and Mass Balance of Glaciers in the Central and Eastern Himalaya.” The Cryosphere, vol. 16, no. 5, Copernicus Publications, 2022, pp. 1631–52, doi:10.5194/tc-16-1631-2022. short: S. Fugger, C.L. Fyffe, S. Fatichi, E. Miles, M. McCarthy, T.E. Shaw, B. Ding, W. Yang, P. Wagnon, W. Immerzeel, Q. Liu, F. Pellicciotti, The Cryosphere 16 (2022) 1631–1652. date_created: 2023-02-20T08:10:16Z date_published: 2022-05-05T00:00:00Z date_updated: 2023-02-28T13:45:01Z day: '05' doi: 10.5194/tc-16-1631-2022 extern: '1' intvolume: ' 16' issue: '5' keyword: - Earth-Surface Processes - Water Science and Technology language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.5194/tc-16-1631-2022 month: '05' oa: 1 oa_version: Published Version page: 1631-1652 publication: The Cryosphere publication_identifier: issn: - 1994-0424 publication_status: published publisher: Copernicus Publications quality_controlled: '1' scopus_import: '1' status: public title: Understanding monsoon controls on the energy and mass balance of glaciers in the Central and Eastern Himalaya type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 16 year: '2022' ... --- _id: '12582' abstract: - lang: eng text: Supraglacial debris covers 7% of mountain glacier area globally and generally reduces glacier surface melt. Enhanced energy absorption at ice cliffs and supraglacial ponds scattered across the debris surface leads these features to contribute disproportionately to glacier-wide ablation. However, the degree to which cliffs and ponds actually increase melt rates remains unclear, as these features have only been studied in a detailed manner for selected locations, almost exclusively in High Mountain Asia. In this study we model the surface energy balance for debris-covered ice, ice cliffs, and supraglacial ponds with a set of automatic weather station records representing the global prevalence of debris-covered glacier ice. We generate 5000 random sets of values for physical parameters using probability distributions derived from literature, which we use to investigate relative melt rates and to isolate the melt responses of debris, cliffs and ponds to the site-specific meteorological forcing. Modelled sub-debris melt rates are primarily controlled by debris thickness and thermal conductivity. At a reference thickness of 0.1 m, sub-debris melt rates vary considerably, differing by up to a factor of four between sites, mainly attributable to air temperature differences. We find that melt rates for ice cliffs are consistently 2–3× the melt rate for clean glacier ice, but this melt enhancement decays with increasing clean ice melt rates. Energy absorption at supraglacial ponds is dominated by latent heat exchange and is therefore highly sensitive to wind speed and relative humidity, but is generally less than for clean ice. Our results provide reference melt enhancement factors for melt modelling of debris-covered glacier sites, globally, while highlighting the need for direct measurement of debris-covered glacier surface characteristics, physical parameters, and local meteorological conditions at a variety of sites around the world. article_number: '064004' article_processing_charge: No article_type: letter_note author: - first_name: E S full_name: Miles, E S last_name: Miles - first_name: J F full_name: Steiner, J F last_name: Steiner - first_name: P full_name: Buri, P last_name: Buri - first_name: W W full_name: Immerzeel, W W last_name: Immerzeel - first_name: Francesca full_name: Pellicciotti, Francesca id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70 last_name: Pellicciotti citation: ama: Miles ES, Steiner JF, Buri P, Immerzeel WW, Pellicciotti F. Controls on the relative melt rates of debris-covered glacier surfaces. Environmental Research Letters. 2022;17(6). doi:10.1088/1748-9326/ac6966 apa: Miles, E. S., Steiner, J. F., Buri, P., Immerzeel, W. W., & Pellicciotti, F. (2022). Controls on the relative melt rates of debris-covered glacier surfaces. Environmental Research Letters. IOP Publishing. https://doi.org/10.1088/1748-9326/ac6966 chicago: Miles, E S, J F Steiner, P Buri, W W Immerzeel, and Francesca Pellicciotti. “Controls on the Relative Melt Rates of Debris-Covered Glacier Surfaces.” Environmental Research Letters. IOP Publishing, 2022. https://doi.org/10.1088/1748-9326/ac6966. ieee: E. S. Miles, J. F. Steiner, P. Buri, W. W. Immerzeel, and F. Pellicciotti, “Controls on the relative melt rates of debris-covered glacier surfaces,” Environmental Research Letters, vol. 17, no. 6. IOP Publishing, 2022. ista: Miles ES, Steiner JF, Buri P, Immerzeel WW, Pellicciotti F. 2022. Controls on the relative melt rates of debris-covered glacier surfaces. Environmental Research Letters. 17(6), 064004. mla: Miles, E. S., et al. “Controls on the Relative Melt Rates of Debris-Covered Glacier Surfaces.” Environmental Research Letters, vol. 17, no. 6, 064004, IOP Publishing, 2022, doi:10.1088/1748-9326/ac6966. short: E.S. Miles, J.F. Steiner, P. Buri, W.W. Immerzeel, F. Pellicciotti, Environmental Research Letters 17 (2022). date_created: 2023-02-20T08:10:37Z date_published: 2022-06-01T00:00:00Z date_updated: 2023-02-28T13:34:25Z day: '01' doi: 10.1088/1748-9326/ac6966 extern: '1' intvolume: ' 17' issue: '6' keyword: - Public Health - Environmental and Occupational Health - General Environmental Science - Renewable Energy - Sustainability and the Environment language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1088/1748-9326/ac6966 month: '06' oa: 1 oa_version: Published Version publication: Environmental Research Letters publication_identifier: issn: - 1748-9326 publication_status: published publisher: IOP Publishing quality_controlled: '1' scopus_import: '1' status: public title: Controls on the relative melt rates of debris-covered glacier surfaces type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 17 year: '2022' ... --- _id: '12577' abstract: - lang: eng text: Glaciers are key components of the mountain water towers of Asia and are vital for downstream domestic, agricultural, and industrial uses. The glacier mass loss rate over the southeastern Tibetan Plateau is among the highest in Asia and has accelerated in recent decades. This acceleration has been attributed to increased warming, but the mechanisms behind these glaciers’ high sensitivity to warming remain unclear, while the influence of changes in precipitation over the past decades is poorly quantified. Here, we reconstruct glacier mass changes and catchment runoff since 1975 at a benchmark glacier, Parlung No. 4, to shed light on the drivers of recent mass losses for the monsoonal, spring-accumulation glaciers of the Tibetan Plateau. Our modeling demonstrates how a temperature increase (mean of 0.39C ⋅dec−1since 1990) has accelerated mass loss rates by altering both the ablation and accumulation regimes in a complex manner. The majority of the post-2000 mass loss occurred during the monsoon months, caused by simultaneous decreases in the solid precipitation ratio (from 0.70 to 0.56) and precipitation amount (–10%), leading to reduced monsoon accumulation (–26%). Higher solid precipitation in spring (+18%) during the last two decades was increasingly important in mitigating glacier mass loss by providing mass to the glacier and protecting it from melting in the early monsoon. With bare ice exposed to warmer temperatures for longer periods, icemelt and catchment discharge have unsustainably intensified since the start of the 21st century, raising concerns for long-term water supply and hazard occurrence in the region. article_number: e2109796119 article_processing_charge: No article_type: original author: - first_name: Achille full_name: Jouberton, Achille last_name: Jouberton - first_name: Thomas E. full_name: Shaw, Thomas E. last_name: Shaw - first_name: Evan full_name: Miles, Evan last_name: Miles - first_name: Michael full_name: McCarthy, Michael last_name: McCarthy - first_name: Stefan full_name: Fugger, Stefan last_name: Fugger - first_name: Shaoting full_name: Ren, Shaoting last_name: Ren - first_name: Amaury full_name: Dehecq, Amaury last_name: Dehecq - first_name: Wei full_name: Yang, Wei last_name: Yang - first_name: Francesca full_name: Pellicciotti, Francesca id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70 last_name: Pellicciotti citation: ama: Jouberton A, Shaw TE, Miles E, et al. Warming-induced monsoon precipitation phase change intensifies glacier mass loss in the southeastern Tibetan Plateau. PNAS. 2022;119(37). doi:10.1073/pnas.2109796119 apa: Jouberton, A., Shaw, T. E., Miles, E., McCarthy, M., Fugger, S., Ren, S., … Pellicciotti, F. (2022). Warming-induced monsoon precipitation phase change intensifies glacier mass loss in the southeastern Tibetan Plateau. PNAS. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.2109796119 chicago: Jouberton, Achille, Thomas E. Shaw, Evan Miles, Michael McCarthy, Stefan Fugger, Shaoting Ren, Amaury Dehecq, Wei Yang, and Francesca Pellicciotti. “Warming-Induced Monsoon Precipitation Phase Change Intensifies Glacier Mass Loss in the Southeastern Tibetan Plateau.” PNAS. Proceedings of the National Academy of Sciences, 2022. https://doi.org/10.1073/pnas.2109796119. ieee: A. Jouberton et al., “Warming-induced monsoon precipitation phase change intensifies glacier mass loss in the southeastern Tibetan Plateau,” PNAS, vol. 119, no. 37. Proceedings of the National Academy of Sciences, 2022. ista: Jouberton A, Shaw TE, Miles E, McCarthy M, Fugger S, Ren S, Dehecq A, Yang W, Pellicciotti F. 2022. Warming-induced monsoon precipitation phase change intensifies glacier mass loss in the southeastern Tibetan Plateau. PNAS. 119(37), e2109796119. mla: Jouberton, Achille, et al. “Warming-Induced Monsoon Precipitation Phase Change Intensifies Glacier Mass Loss in the Southeastern Tibetan Plateau.” PNAS, vol. 119, no. 37, e2109796119, Proceedings of the National Academy of Sciences, 2022, doi:10.1073/pnas.2109796119. short: A. Jouberton, T.E. Shaw, E. Miles, M. McCarthy, S. Fugger, S. Ren, A. Dehecq, W. Yang, F. Pellicciotti, PNAS 119 (2022). date_created: 2023-02-20T08:10:02Z date_published: 2022-09-06T00:00:00Z date_updated: 2023-02-28T13:50:37Z day: '06' doi: 10.1073/pnas.2109796119 extern: '1' intvolume: ' 119' issue: '37' keyword: - Multidisciplinary language: - iso: eng month: '09' oa_version: None publication: PNAS 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: Warming-induced monsoon precipitation phase change intensifies glacier mass loss in the southeastern Tibetan Plateau type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 119 year: '2022' ... --- _id: '12575' abstract: - lang: eng text: The current Chilean megadrought has led to acute water shortages in central Chile since 2010. Glaciers have provided vital fresh water to the region's rivers, but the quantity, timing and sustainability of that provision remain unclear. Here we combine in-situ, remote sensing and climate reanalysis data to show that from 2010 to 2018 during the megadrought, unsustainable imbalance ablation of glaciers (ablation not balanced by new snowfall) strongly buffered the late-summer discharge of the Maipo River, a primary source of water to Santiago. If there had been no glaciers, water availability would have been reduced from December through May, with a 31 ± 19% decrease during March. Our results indicate that while the annual contributions of imbalance ablation to river discharge during the megadrought have been small compared to those from precipitation and sustainable balance ablation, they have nevertheless been a substantial input to a hydrological system that was already experiencing high water stress. The water-equivalent volume of imbalance ablation generated in the Maipo Basin between 2010 and 2018 was 740 × 106 m3 (19 ± 12 mm yr−1), approximately 3.4 times the capacity of the basin's El Yeso Reservoir. This is equivalent to 14% of Santiago's potable water use in that time, while total glacier ablation was equivalent to 59%. We show that glacier retreat will exacerbate river discharge deficits and further jeopardize water availability in central Chile if precipitation deficits endure, and conjecture that these effects will be amplified by climatic warming. article_number: e2022EF002852 article_processing_charge: No article_type: original author: - first_name: Michael full_name: McCarthy, Michael last_name: McCarthy - first_name: Fabienne full_name: Meier, Fabienne last_name: Meier - first_name: Simone full_name: Fatichi, Simone last_name: Fatichi - first_name: Benjamin D. full_name: Stocker, Benjamin D. last_name: Stocker - first_name: Thomas E. full_name: Shaw, Thomas E. last_name: Shaw - first_name: Evan full_name: Miles, Evan last_name: Miles - first_name: Inés full_name: Dussaillant, Inés last_name: Dussaillant - first_name: Francesca full_name: Pellicciotti, Francesca id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70 last_name: Pellicciotti citation: ama: McCarthy M, Meier F, Fatichi S, et al. Glacier contributions to river discharge during the current Chilean megadrought. Earth’s Future. 2022;10(10). doi:10.1029/2022ef002852 apa: McCarthy, M., Meier, F., Fatichi, S., Stocker, B. D., Shaw, T. E., Miles, E., … Pellicciotti, F. (2022). Glacier contributions to river discharge during the current Chilean megadrought. Earth’s Future. American Geophysical Union. https://doi.org/10.1029/2022ef002852 chicago: McCarthy, Michael, Fabienne Meier, Simone Fatichi, Benjamin D. Stocker, Thomas E. Shaw, Evan Miles, Inés Dussaillant, and Francesca Pellicciotti. “Glacier Contributions to River Discharge during the Current Chilean Megadrought.” Earth’s Future. American Geophysical Union, 2022. https://doi.org/10.1029/2022ef002852. ieee: M. McCarthy et al., “Glacier contributions to river discharge during the current Chilean megadrought,” Earth’s Future, vol. 10, no. 10. American Geophysical Union, 2022. ista: McCarthy M, Meier F, Fatichi S, Stocker BD, Shaw TE, Miles E, Dussaillant I, Pellicciotti F. 2022. Glacier contributions to river discharge during the current Chilean megadrought. Earth’s Future. 10(10), e2022EF002852. mla: McCarthy, Michael, et al. “Glacier Contributions to River Discharge during the Current Chilean Megadrought.” Earth’s Future, vol. 10, no. 10, e2022EF002852, American Geophysical Union, 2022, doi:10.1029/2022ef002852. short: M. McCarthy, F. Meier, S. Fatichi, B.D. Stocker, T.E. Shaw, E. Miles, I. Dussaillant, F. Pellicciotti, Earth’s Future 10 (2022). date_created: 2023-02-20T08:09:49Z date_published: 2022-10-01T00:00:00Z date_updated: 2023-02-28T13:55:32Z day: '01' doi: 10.1029/2022ef002852 extern: '1' intvolume: ' 10' issue: '10' keyword: - Earth and Planetary Sciences (miscellaneous) - General Environmental Science language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1029/2022EF002852 month: '10' oa: 1 oa_version: Published Version publication: Earth's Future publication_identifier: issn: - 2328-4277 publication_status: published publisher: American Geophysical Union quality_controlled: '1' scopus_import: '1' status: public title: Glacier contributions to river discharge during the current Chilean megadrought type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 10 year: '2022' ... --- _id: '12574' abstract: - lang: eng text: Melt from supraglacial ice cliffs is an important contributor to the mass loss of debris-covered glaciers. However, ice cliff contribution is difficult to quantify as they are highly dynamic features, and the paucity of observations of melt rates and their variability leads to large modelling uncertainties. We quantify monsoon season melt and 3D evolution of four ice cliffs over two debris-covered glaciers in High Mountain Asia (Langtang Glacier, Nepal, and 24K Glacier, China) at very high resolution using terrestrial photogrammetry applied to imagery captured from time-lapse cameras installed on lateral moraines. We derive weekly flow-corrected digital elevation models (DEMs) of the glacier surface with a maximum vertical bias of ±0.2 m for Langtang Glacier and ±0.05 m for 24K Glacier and use change detection to determine distributed melt rates at the surfaces of the ice cliffs throughout the study period. We compare the measured melt patterns with those derived from a 3D energy balance model to derive the contribution of the main energy fluxes. We find that ice cliff melt varies considerably throughout the melt season, with maximum melt rates of 5 to 8 cm d−1, and their average melt rates are 11–14 (Langtang) and 4.5 (24K) times higher than the surrounding debris-covered ice. Our results highlight the influence of redistributed supraglacial debris on cliff melt. At both sites, ice cliff albedo is influenced by the presence of thin debris at the ice cliff surface, which is largely controlled on 24K Glacier by liquid precipitation events that wash away this debris. Slightly thicker or patchy debris reduces melt by 1–3 cm d−1 at all sites. Ultimately, our observations show a strong spatio-temporal variability in cliff area at each site, which is controlled by supraglacial streams and ponds and englacial cavities that promote debris slope destabilisation and the lateral expansion of the cliffs. These findings highlight the need to better represent processes of debris redistribution in ice cliff models, to in turn improve estimates of ice cliff contribution to glacier melt and the long-term geomorphological evolution of debris-covered glacier surfaces. article_processing_charge: No article_type: original author: - first_name: Marin full_name: Kneib, Marin last_name: Kneib - first_name: Evan S. full_name: Miles, Evan S. last_name: Miles - first_name: Pascal full_name: Buri, Pascal last_name: Buri - first_name: Stefan full_name: Fugger, Stefan last_name: Fugger - first_name: Michael full_name: McCarthy, Michael last_name: McCarthy - first_name: Thomas E. full_name: Shaw, Thomas E. last_name: Shaw - first_name: Zhao full_name: Chuanxi, Zhao last_name: Chuanxi - first_name: Martin full_name: Truffer, Martin last_name: Truffer - first_name: Matthew J. full_name: Westoby, Matthew J. last_name: Westoby - first_name: Wei full_name: Yang, Wei last_name: Yang - first_name: Francesca full_name: Pellicciotti, Francesca id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70 last_name: Pellicciotti citation: ama: Kneib M, Miles ES, Buri P, et al. Sub-seasonal variability of supraglacial ice cliff melt rates and associated processes from time-lapse photogrammetry. The Cryosphere. 2022;16(11):4701-4725. doi:10.5194/tc-16-4701-2022 apa: Kneib, M., Miles, E. S., Buri, P., Fugger, S., McCarthy, M., Shaw, T. E., … Pellicciotti, F. (2022). Sub-seasonal variability of supraglacial ice cliff melt rates and associated processes from time-lapse photogrammetry. The Cryosphere. Copernicus Publications. https://doi.org/10.5194/tc-16-4701-2022 chicago: Kneib, Marin, Evan S. Miles, Pascal Buri, Stefan Fugger, Michael McCarthy, Thomas E. Shaw, Zhao Chuanxi, et al. “Sub-Seasonal Variability of Supraglacial Ice Cliff Melt Rates and Associated Processes from Time-Lapse Photogrammetry.” The Cryosphere. Copernicus Publications, 2022. https://doi.org/10.5194/tc-16-4701-2022. ieee: M. Kneib et al., “Sub-seasonal variability of supraglacial ice cliff melt rates and associated processes from time-lapse photogrammetry,” The Cryosphere, vol. 16, no. 11. Copernicus Publications, pp. 4701–4725, 2022. ista: Kneib M, Miles ES, Buri P, Fugger S, McCarthy M, Shaw TE, Chuanxi Z, Truffer M, Westoby MJ, Yang W, Pellicciotti F. 2022. Sub-seasonal variability of supraglacial ice cliff melt rates and associated processes from time-lapse photogrammetry. The Cryosphere. 16(11), 4701–4725. mla: Kneib, Marin, et al. “Sub-Seasonal Variability of Supraglacial Ice Cliff Melt Rates and Associated Processes from Time-Lapse Photogrammetry.” The Cryosphere, vol. 16, no. 11, Copernicus Publications, 2022, pp. 4701–25, doi:10.5194/tc-16-4701-2022. short: M. Kneib, E.S. Miles, P. Buri, S. Fugger, M. McCarthy, T.E. Shaw, Z. Chuanxi, M. Truffer, M.J. Westoby, W. Yang, F. Pellicciotti, The Cryosphere 16 (2022) 4701–4725. date_created: 2023-02-20T08:09:42Z date_published: 2022-11-11T00:00:00Z date_updated: 2023-02-28T13:59:22Z day: '11' doi: 10.5194/tc-16-4701-2022 extern: '1' intvolume: ' 16' issue: '11' keyword: - Earth-Surface Processes - Water Science and Technology language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.5194/tc-16-4701-2022 month: '11' oa: 1 oa_version: Published Version page: 4701-4725 publication: The Cryosphere publication_identifier: issn: - 1994-0424 publication_status: published publisher: Copernicus Publications quality_controlled: '1' scopus_import: '1' status: public title: Sub-seasonal variability of supraglacial ice cliff melt rates and associated processes from time-lapse photogrammetry type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 16 year: '2022' ... --- _id: '12573' abstract: - lang: eng text: Supraglacial debris strongly modulates glacier melt rates and can be decisive for ice dynamics and mountain hydrology. It is ubiquitous in High-Mountain Asia, yet because its thickness and supply rate from local topography are poorly known, our ability to forecast regional glacier change and streamflow is limited. Here we combined remote sensing and numerical modelling to resolve supraglacial debris thickness by altitude for 4689 glaciers in High-Mountain Asia, and debris-supply rate to 4141 of those glaciers. Our results reveal extensively thin supraglacial debris and high spatial variability in both debris thickness and supply rate. Debris-supply rate increases with the temperature and slope of debris-supply slopes regionally, and debris thickness increases as ice flow decreases locally. Our centennial-scale estimates of debris-supply rate are typically an order of magnitude or more lower than millennial-scale estimates of headwall-erosion rate from Beryllium-10 cosmogenic nuclides, potentially reflecting episodic debris supply to the region’s glaciers. article_number: '269' article_processing_charge: No article_type: original author: - first_name: Michael full_name: McCarthy, Michael last_name: McCarthy - first_name: Evan full_name: Miles, Evan last_name: Miles - first_name: Marin full_name: Kneib, Marin last_name: Kneib - first_name: Pascal full_name: Buri, Pascal last_name: Buri - first_name: Stefan full_name: Fugger, Stefan last_name: Fugger - first_name: Francesca full_name: Pellicciotti, Francesca id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70 last_name: Pellicciotti citation: ama: McCarthy M, Miles E, Kneib M, Buri P, Fugger S, Pellicciotti F. Supraglacial debris thickness and supply rate in High-Mountain Asia. Communications Earth & Environment. 2022;3. doi:10.1038/s43247-022-00588-2 apa: McCarthy, M., Miles, E., Kneib, M., Buri, P., Fugger, S., & Pellicciotti, F. (2022). Supraglacial debris thickness and supply rate in High-Mountain Asia. Communications Earth & Environment. Springer Nature. https://doi.org/10.1038/s43247-022-00588-2 chicago: McCarthy, Michael, Evan Miles, Marin Kneib, Pascal Buri, Stefan Fugger, and Francesca Pellicciotti. “Supraglacial Debris Thickness and Supply Rate in High-Mountain Asia.” Communications Earth & Environment. Springer Nature, 2022. https://doi.org/10.1038/s43247-022-00588-2. ieee: M. McCarthy, E. Miles, M. Kneib, P. Buri, S. Fugger, and F. Pellicciotti, “Supraglacial debris thickness and supply rate in High-Mountain Asia,” Communications Earth & Environment, vol. 3. Springer Nature, 2022. ista: McCarthy M, Miles E, Kneib M, Buri P, Fugger S, Pellicciotti F. 2022. Supraglacial debris thickness and supply rate in High-Mountain Asia. Communications Earth & Environment. 3, 269. mla: McCarthy, Michael, et al. “Supraglacial Debris Thickness and Supply Rate in High-Mountain Asia.” Communications Earth & Environment, vol. 3, 269, Springer Nature, 2022, doi:10.1038/s43247-022-00588-2. short: M. McCarthy, E. Miles, M. Kneib, P. Buri, S. Fugger, F. Pellicciotti, Communications Earth & Environment 3 (2022). date_created: 2023-02-20T08:09:27Z date_published: 2022-11-05T00:00:00Z date_updated: 2023-02-28T14:02:22Z day: '05' doi: 10.1038/s43247-022-00588-2 extern: '1' intvolume: ' 3' keyword: - General Earth and Planetary Sciences - General Environmental Science language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1038/s43247-022-00588-2 month: '11' oa: 1 oa_version: Published Version publication: Communications Earth & Environment publication_identifier: issn: - 2662-4435 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Supraglacial debris thickness and supply rate in High-Mountain Asia type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 3 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: '12067' abstract: - lang: eng text: We present a divergent strategy for the fluorination of phenylacetic acid derivatives that is induced by a charge-transfer complex between Selectfluor and 4-(dimethylamino)pyridine. A comprehensive investigation of the conditions revealed a critical role of the solvent on the reaction outcome. In the presence of water, decarboxylative fluorination through a single-electron oxidation is dominant. Non-aqueous conditions result in the clean formation of α-fluoro-α-arylcarboxylic acids. article_processing_charge: No article_type: original author: - first_name: Amiera full_name: Madani, Amiera last_name: Madani - first_name: Lucia full_name: Anghileri, Lucia last_name: Anghileri - first_name: Matthias full_name: Heydenreich, Matthias last_name: Heydenreich - first_name: Heiko M. full_name: Möller, Heiko M. last_name: Möller - first_name: Bartholomäus full_name: Pieber, Bartholomäus id: 93e5e5b2-0da6-11ed-8a41-af589a024726 last_name: Pieber orcid: 0000-0001-8689-388X citation: ama: Madani A, Anghileri L, Heydenreich M, Möller HM, Pieber B. Benzylic fluorination induced by a charge-transfer complex with a solvent-dependent selectivity switch. Organic Letters. 2022;24(29):5376–5380. doi:10.1021/acs.orglett.2c02050 apa: Madani, A., Anghileri, L., Heydenreich, M., Möller, H. M., & Pieber, B. (2022). Benzylic fluorination induced by a charge-transfer complex with a solvent-dependent selectivity switch. Organic Letters. American Chemical Society. https://doi.org/10.1021/acs.orglett.2c02050 chicago: Madani, Amiera, Lucia Anghileri, Matthias Heydenreich, Heiko M. Möller, and Bartholomäus Pieber. “Benzylic Fluorination Induced by a Charge-Transfer Complex with a Solvent-Dependent Selectivity Switch.” Organic Letters. American Chemical Society, 2022. https://doi.org/10.1021/acs.orglett.2c02050. ieee: A. Madani, L. Anghileri, M. Heydenreich, H. M. Möller, and B. Pieber, “Benzylic fluorination induced by a charge-transfer complex with a solvent-dependent selectivity switch,” Organic Letters, vol. 24, no. 29. American Chemical Society, pp. 5376–5380, 2022. ista: Madani A, Anghileri L, Heydenreich M, Möller HM, Pieber B. 2022. Benzylic fluorination induced by a charge-transfer complex with a solvent-dependent selectivity switch. Organic Letters. 24(29), 5376–5380. mla: Madani, Amiera, et al. “Benzylic Fluorination Induced by a Charge-Transfer Complex with a Solvent-Dependent Selectivity Switch.” Organic Letters, vol. 24, no. 29, American Chemical Society, 2022, pp. 5376–5380, doi:10.1021/acs.orglett.2c02050. short: A. Madani, L. Anghileri, M. Heydenreich, H.M. Möller, B. Pieber, Organic Letters 24 (2022) 5376–5380. date_created: 2022-09-08T11:34:30Z date_published: 2022-07-17T00:00:00Z date_updated: 2023-05-08T08:39:34Z day: '17' doi: 10.1021/acs.orglett.2c02050 extern: '1' intvolume: ' 24' issue: '29' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.26434/chemrxiv-2022-mstv5 month: '07' oa: 1 oa_version: Published Version page: 5376–5380 publication: Organic Letters publication_identifier: eissn: - 1523-7052 issn: - 1523-7060 publication_status: published publisher: American Chemical Society quality_controlled: '1' scopus_import: '1' status: public title: Benzylic fluorination induced by a charge-transfer complex with a solvent-dependent selectivity switch type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 24 year: '2022' ... --- _id: '12671' abstract: - lang: eng text: Sperm chromatin is typically transformed by protamines into a compact and transcriptionally inactive state1,2. Sperm cells of flowering plants lack protamines, yet they have small, transcriptionally active nuclei with chromatin condensed through an unknown mechanism3,4. Here we show that a histone variant, H2B.8, mediates sperm chromatin and nuclear condensation in Arabidopsis thaliana. Loss of H2B.8 causes enlarged sperm nuclei with dispersed chromatin, whereas ectopic expression in somatic cells produces smaller nuclei with aggregated chromatin. This result demonstrates that H2B.8 is sufficient for chromatin condensation. H2B.8 aggregates transcriptionally inactive AT-rich chromatin into phase-separated condensates, which facilitates nuclear compaction without reducing transcription. Reciprocal crosses show that mutation of h2b.8 reduces male transmission, which suggests that H2B.8-mediated sperm compaction is important for fertility. Altogether, our results reveal a new mechanism of nuclear compaction through global aggregation of unexpressed chromatin. We propose that H2B.8 is an evolutionary innovation of flowering plants that achieves nuclear condensation compatible with active transcription. article_processing_charge: No article_type: original author: - first_name: Toby full_name: Buttress, Toby last_name: Buttress - first_name: Shengbo full_name: He, Shengbo last_name: He - first_name: Liang full_name: Wang, Liang last_name: Wang - first_name: Shaoli full_name: Zhou, Shaoli last_name: Zhou - first_name: Gerhard full_name: Saalbach, Gerhard last_name: Saalbach - first_name: Martin full_name: Vickers, Martin last_name: Vickers - first_name: Guohong full_name: Li, Guohong last_name: Li - first_name: Pilong full_name: Li, Pilong last_name: Li - first_name: Xiaoqi full_name: Feng, Xiaoqi id: e0164712-22ee-11ed-b12a-d80fcdf35958 last_name: Feng orcid: 0000-0002-4008-1234 citation: ama: Buttress T, He S, Wang L, et al. Histone H2B.8 compacts flowering plant sperm through chromatin phase separation. Nature. 2022;611(7936):614-622. doi:10.1038/s41586-022-05386-6 apa: Buttress, T., He, S., Wang, L., Zhou, S., Saalbach, G., Vickers, M., … Feng, X. (2022). Histone H2B.8 compacts flowering plant sperm through chromatin phase separation. Nature. Springer Nature. https://doi.org/10.1038/s41586-022-05386-6 chicago: Buttress, Toby, Shengbo He, Liang Wang, Shaoli Zhou, Gerhard Saalbach, Martin Vickers, Guohong Li, Pilong Li, and Xiaoqi Feng. “Histone H2B.8 Compacts Flowering Plant Sperm through Chromatin Phase Separation.” Nature. Springer Nature, 2022. https://doi.org/10.1038/s41586-022-05386-6. ieee: T. Buttress et al., “Histone H2B.8 compacts flowering plant sperm through chromatin phase separation,” Nature, vol. 611, no. 7936. Springer Nature, pp. 614–622, 2022. ista: Buttress T, He S, Wang L, Zhou S, Saalbach G, Vickers M, Li G, Li P, Feng X. 2022. Histone H2B.8 compacts flowering plant sperm through chromatin phase separation. Nature. 611(7936), 614–622. mla: Buttress, Toby, et al. “Histone H2B.8 Compacts Flowering Plant Sperm through Chromatin Phase Separation.” Nature, vol. 611, no. 7936, Springer Nature, 2022, pp. 614–22, doi:10.1038/s41586-022-05386-6. short: T. Buttress, S. He, L. Wang, S. Zhou, G. Saalbach, M. Vickers, G. Li, P. Li, X. Feng, Nature 611 (2022) 614–622. date_created: 2023-02-23T09:17:05Z date_published: 2022-11-17T00:00:00Z date_updated: 2023-05-08T10:59:22Z day: '17' department: - _id: XiFe doi: 10.1038/s41586-022-05386-6 extern: '1' external_id: pmid: - '36323776' intvolume: ' 611' issue: '7936' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1038/s41586-022-05386-6 month: '11' oa: 1 oa_version: Published Version page: 614-622 pmid: 1 publication: Nature publication_identifier: eissn: - 1476-4687 issn: - 0028-0836 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Histone H2B.8 compacts flowering plant sperm through chromatin phase separation type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 611 year: '2022' ... --- _id: '12670' abstract: - lang: eng text: DNA methylation plays essential homeostatic functions in eukaryotic genomes. In animals, DNA methylation is also developmentally regulated and, in turn, regulates development. In the past two decades, huge research effort has endorsed the understanding that DNA methylation plays a similar role in plant development, especially during sexual reproduction. The power of whole-genome sequencing and cell isolation techniques, as well as bioinformatics tools, have enabled recent studies to reveal dynamic changes in DNA methylation during germline development. Furthermore, the combination of these technological advances with genetics, developmental biology and cell biology tools has revealed functional methylation reprogramming events that control gene and transposon activities in flowering plant germlines. In this review, we discuss the major advances in our knowledge of DNA methylation dynamics during male and female germline development in flowering plants. article_processing_charge: No article_type: review author: - first_name: Shengbo full_name: He, Shengbo last_name: He - first_name: Xiaoqi full_name: Feng, Xiaoqi id: e0164712-22ee-11ed-b12a-d80fcdf35958 last_name: Feng orcid: 0000-0002-4008-1234 citation: ama: He S, Feng X. DNA methylation dynamics during germline development. Journal of Integrative Plant Biology. 2022;64(12):2240-2251. doi:10.1111/jipb.13422 apa: He, S., & Feng, X. (2022). DNA methylation dynamics during germline development. Journal of Integrative Plant Biology. Wiley. https://doi.org/10.1111/jipb.13422 chicago: He, Shengbo, and Xiaoqi Feng. “DNA Methylation Dynamics during Germline Development.” Journal of Integrative Plant Biology. Wiley, 2022. https://doi.org/10.1111/jipb.13422. ieee: S. He and X. Feng, “DNA methylation dynamics during germline development,” Journal of Integrative Plant Biology, vol. 64, no. 12. Wiley, pp. 2240–2251, 2022. ista: He S, Feng X. 2022. DNA methylation dynamics during germline development. Journal of Integrative Plant Biology. 64(12), 2240–2251. mla: He, Shengbo, and Xiaoqi Feng. “DNA Methylation Dynamics during Germline Development.” Journal of Integrative Plant Biology, vol. 64, no. 12, Wiley, 2022, pp. 2240–51, doi:10.1111/jipb.13422. short: S. He, X. Feng, Journal of Integrative Plant Biology 64 (2022) 2240–2251. date_created: 2023-02-23T09:15:57Z date_published: 2022-12-07T00:00:00Z date_updated: 2023-05-08T10:59:00Z day: '07' department: - _id: XiFe doi: 10.1111/jipb.13422 extern: '1' external_id: pmid: - '36478632' intvolume: ' 64' issue: '12' keyword: - Plant Science - General Biochemistry - Genetics and Molecular Biology - Biochemistry language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1111/jipb.13422 month: '12' oa: 1 oa_version: Published Version page: 2240-2251 pmid: 1 publication: Journal of Integrative Plant Biology publication_identifier: eissn: - 1744-7909 issn: - 1672-9072 publication_status: published publisher: Wiley quality_controlled: '1' scopus_import: '1' status: public title: DNA methylation dynamics during germline development type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 64 year: '2022' ...