---
_id: '14993'
abstract:
- lang: eng
  text: "Traditional top-down approaches for global health have historically failed
    to achieve social progress (Hoffman et al., 2015; Hoffman & Røttingen, 2015).
    Recently, however, a more holistic, multi-level approach termed One Health (OH)
    (Osterhaus et al., 2020) is being adopted. Several sets of challenges have been
    identified for the implementation of OH (dos S. Ribeiro et al., 2019), including
    policy and funding, education and training, and multi-actor, multi-domain, and
    multi-level collaborations. These exist despite the increasing accessibility to\r\nknowledge
    and digital collaborative research tools through the internet. To address some
    of these challenges, we propose a general framework for grassroots community-based
    means of participatory research. Additionally, we present a specific roadmap to
    create a Machine Learning for Global Health community in Africa. The proposed
    framework aims to enable any small group of individuals with scarce resources
    to build and sustain an online community within approximately two years. We provide
    a discussion on the potential impact of the proposed framework for global health
    research collaborations."
acknowledgement: "Houcemeddine Turki’s contributions to this final output have been
  funded through the Adapting\r\nWikidata to support clinical practice using Data
  Science, Semantic Web and Machine Learning\r\nproject, which is part of the Wikimedia
  Research Fund maintained by the Wikimedia Foundation in San Francisco, California,
  United States of America."
article_processing_charge: No
author:
- first_name: Christopher
  full_name: Currin, Christopher
  id: e8321fc5-3091-11eb-8a53-83f309a11ac9
  last_name: Currin
  orcid: 0000-0002-4809-5059
- first_name: Mercy Nyamewaa
  full_name: Asiedu , Mercy Nyamewaa
  last_name: 'Asiedu '
- first_name: Chris
  full_name: Fourie, Chris
  last_name: Fourie
- first_name: Benjamin
  full_name: Rosman, Benjamin
  last_name: Rosman
- first_name: Houcemeddine
  full_name: Turki, Houcemeddine
  last_name: Turki
- first_name: Atnafu
  full_name: Lambebo Tonja, Atnafu
  last_name: Lambebo Tonja
- first_name: Jade
  full_name: Abbott, Jade
  last_name: Abbott
- first_name: Marvellous
  full_name: Ajala, Marvellous
  last_name: Ajala
- first_name: Sadiq Adewale
  full_name: Adedayo, Sadiq Adewale
  last_name: Adedayo
- first_name: Chris Chinenye
  full_name: Emezue, Chris Chinenye
  last_name: Emezue
- first_name: Daphne
  full_name: Machangara, Daphne
  last_name: Machangara
citation:
  ama: 'Currin C, Asiedu  MN, Fourie C, et al. A framework for grassroots research
    collaboration in machine learning and global health. In: <i>1st Workshop on Machine
    Learning &#38; Global Health</i>. OpenReview; 2023.'
  apa: 'Currin, C., Asiedu , M. N., Fourie, C., Rosman, B., Turki, H., Lambebo Tonja,
    A., … Machangara, D. (2023). A framework for grassroots research collaboration
    in machine learning and global health. In <i>1st Workshop on Machine Learning
    &#38; Global Health</i>. Kigali, Rwanda: OpenReview.'
  chicago: Currin, Christopher, Mercy Nyamewaa Asiedu , Chris Fourie, Benjamin Rosman,
    Houcemeddine Turki, Atnafu Lambebo Tonja, Jade Abbott, et al. “A Framework for
    Grassroots Research Collaboration in Machine Learning and Global Health.” In <i>1st
    Workshop on Machine Learning &#38; Global Health</i>. OpenReview, 2023.
  ieee: C. Currin <i>et al.</i>, “A framework for grassroots research collaboration
    in machine learning and global health,” in <i>1st Workshop on Machine Learning
    &#38; Global Health</i>, Kigali, Rwanda, 2023.
  ista: 'Currin C, Asiedu  MN, Fourie C, Rosman B, Turki H, Lambebo Tonja A, Abbott
    J, Ajala M, Adedayo SA, Emezue CC, Machangara D. 2023. A framework for grassroots
    research collaboration in machine learning and global health. 1st Workshop on
    Machine Learning &#38; Global Health. ICLR: International Conference on Learning
    Representations.'
  mla: Currin, Christopher, et al. “A Framework for Grassroots Research Collaboration
    in Machine Learning and Global Health.” <i>1st Workshop on Machine Learning &#38;
    Global Health</i>, OpenReview, 2023.
  short: C. Currin, M.N. Asiedu , C. Fourie, B. Rosman, H. Turki, A. Lambebo Tonja,
    J. Abbott, M. Ajala, S.A. Adedayo, C.C. Emezue, D. Machangara, in:, 1st Workshop
    on Machine Learning &#38; Global Health, OpenReview, 2023.
conference:
  end_date: 2023-05-05
  location: Kigali, Rwanda
  name: 'ICLR: International Conference on Learning Representations'
  start_date: 2023-05-05
date_created: 2024-02-14T15:11:48Z
date_published: 2023-03-02T00:00:00Z
date_updated: 2024-02-28T12:12:00Z
day: '02'
department:
- _id: TiVo
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://openreview.net/forum?id=jHY_G91R880
month: '03'
oa: 1
oa_version: Published Version
publication: 1st Workshop on Machine Learning & Global Health
publication_status: published
publisher: OpenReview
quality_controlled: '1'
status: public
title: A framework for grassroots research collaboration in machine learning and global
  health
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14994'
abstract:
- lang: eng
  text: This resource contains the artifacts for reproducing the experimental results
    presented in the paper titled "A Flexible Toolchain for Symbolic Rabin Games under
    Fair and Stochastic Uncertainties" that has been submitted in CAV 2023.
article_processing_charge: No
author:
- 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: Mateusz
  full_name: Rychlicki, Mateusz
  last_name: Rychlicki
- first_name: Anne-Kathrin
  full_name: Schmuck, Anne-Kathrin
  last_name: Schmuck
- first_name: Sadegh
  full_name: Soudjani, Sadegh
  last_name: Soudjani
citation:
  ama: Majumdar R, Mallik K, Rychlicki M, Schmuck A-K, Soudjani S. A flexible toolchain
    for symbolic rabin games under fair and stochastic uncertainties. 2023. doi:<a
    href="https://doi.org/10.5281/ZENODO.7877790">10.5281/ZENODO.7877790</a>
  apa: Majumdar, R., Mallik, K., Rychlicki, M., Schmuck, A.-K., &#38; Soudjani, S.
    (2023). A flexible toolchain for symbolic rabin games under fair and stochastic
    uncertainties. Zenodo. <a href="https://doi.org/10.5281/ZENODO.7877790">https://doi.org/10.5281/ZENODO.7877790</a>
  chicago: Majumdar, Rupak, Kaushik Mallik, Mateusz Rychlicki, Anne-Kathrin Schmuck,
    and Sadegh Soudjani. “A Flexible Toolchain for Symbolic Rabin Games under Fair
    and Stochastic Uncertainties.” Zenodo, 2023. <a href="https://doi.org/10.5281/ZENODO.7877790">https://doi.org/10.5281/ZENODO.7877790</a>.
  ieee: R. Majumdar, K. Mallik, M. Rychlicki, A.-K. Schmuck, and S. Soudjani, “A flexible
    toolchain for symbolic rabin games under fair and stochastic uncertainties.” Zenodo,
    2023.
  ista: Majumdar R, Mallik K, Rychlicki M, Schmuck A-K, Soudjani S. 2023. A flexible
    toolchain for symbolic rabin games under fair and stochastic uncertainties, Zenodo,
    <a href="https://doi.org/10.5281/ZENODO.7877790">10.5281/ZENODO.7877790</a>.
  mla: Majumdar, Rupak, et al. <i>A Flexible Toolchain for Symbolic Rabin Games under
    Fair and Stochastic Uncertainties</i>. Zenodo, 2023, doi:<a href="https://doi.org/10.5281/ZENODO.7877790">10.5281/ZENODO.7877790</a>.
  short: R. Majumdar, K. Mallik, M. Rychlicki, A.-K. Schmuck, S. Soudjani, (2023).
date_created: 2024-02-14T15:13:00Z
date_published: 2023-04-28T00:00:00Z
date_updated: 2024-02-27T07:39:51Z
day: '28'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.5281/ZENODO.7877790
has_accepted_license: '1'
main_file_link:
- open_access: '1'
  url: https://doi.org/10.5281/zenodo.7877790
month: '04'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
  record:
  - id: '14758'
    relation: used_in_publication
    status: public
status: public
title: A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties
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: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14995'
abstract:
- lang: eng
  text: "Lincheck is a new practical and user-friendly framework for testing concurrent
    data structures on the Java Virtual Machine (JVM). It provides a simple and declarative
    way to write concurrent tests. Instead of describing how to perform the test,
    users specify what to test by declaring all the operations to examine; the framework
    automatically handles the rest. As a result, tests written with Lincheck are concise
    and easy to understand. \r\nThe artifact presents a collection of Lincheck tests
    that discover new bugs in popular libraries and implementations from the concurrency
    literature -- they are listed in Table 1, Section 3. To evaluate the performance
    of Lincheck analysis, the collection of tests also includes those which check
    correct data structures and, thus, always succeed. Similarly to Table 2, Section
    3, the experiments demonstrate the reasonable time to perform a test. Finally,
    Lincheck provides user-friendly output with an easy-to-follow trace to reproduce
    a detected error, significantly simplifying further investigation."
article_processing_charge: No
author:
- first_name: Nikita
  full_name: Koval, Nikita
  id: 2F4DB10C-F248-11E8-B48F-1D18A9856A87
  last_name: Koval
- first_name: Alexander
  full_name: Fedorov, Alexander
  id: 2e711909-896a-11ed-bdf8-eb0f5a2984c6
  last_name: Fedorov
- first_name: Maria
  full_name: Sokolova, Maria
  last_name: Sokolova
- first_name: Dmitry
  full_name: Tsitelov, Dmitry
  last_name: Tsitelov
- 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: 'Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. Lincheck: A practical
    framework for testing concurrent data structures on JVM. 2023. doi:<a href="https://doi.org/10.5281/ZENODO.7877757">10.5281/ZENODO.7877757</a>'
  apa: 'Koval, N., Fedorov, A., Sokolova, M., Tsitelov, D., &#38; Alistarh, D.-A.
    (2023). Lincheck: A practical framework for testing concurrent data structures
    on JVM. Zenodo. <a href="https://doi.org/10.5281/ZENODO.7877757">https://doi.org/10.5281/ZENODO.7877757</a>'
  chicago: 'Koval, Nikita, Alexander Fedorov, Maria Sokolova, Dmitry Tsitelov, and
    Dan-Adrian Alistarh. “Lincheck: A Practical Framework for Testing Concurrent Data
    Structures on JVM.” Zenodo, 2023. <a href="https://doi.org/10.5281/ZENODO.7877757">https://doi.org/10.5281/ZENODO.7877757</a>.'
  ieee: 'N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, and D.-A. Alistarh, “Lincheck:
    A practical framework for testing concurrent data structures on JVM.” Zenodo,
    2023.'
  ista: 'Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. 2023. Lincheck:
    A practical framework for testing concurrent data structures on JVM, Zenodo, <a
    href="https://doi.org/10.5281/ZENODO.7877757">10.5281/ZENODO.7877757</a>.'
  mla: 'Koval, Nikita, et al. <i>Lincheck: A Practical Framework for Testing Concurrent
    Data Structures on JVM</i>. Zenodo, 2023, doi:<a href="https://doi.org/10.5281/ZENODO.7877757">10.5281/ZENODO.7877757</a>.'
  short: N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, D.-A. Alistarh, (2023).
date_created: 2024-02-14T15:14:13Z
date_published: 2023-04-28T00:00:00Z
date_updated: 2024-02-27T07:46:52Z
day: '28'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.5281/ZENODO.7877757
main_file_link:
- open_access: '1'
  url: https://doi.org/10.5281/zenodo.7877757
month: '04'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
  record:
  - id: '14260'
    relation: used_in_publication
    status: public
status: public
title: 'Lincheck: A practical framework for testing concurrent data structures on
  JVM'
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '15023'
abstract:
- lang: eng
  text: Reinforcement learning has shown promising results in learning neural network
    policies for complicated control tasks. However, the lack of formal guarantees
    about the behavior of such policies remains an impediment to their deployment.
    We propose a novel method for learning a composition of neural network policies
    in stochastic environments, along with a formal certificate which guarantees that
    a specification over the policy's behavior is satisfied with the desired probability.
    Unlike prior work on verifiable RL, our approach leverages the compositional nature
    of logical specifications provided in SpectRL, to learn over graphs of probabilistic
    reach-avoid specifications. The formal guarantees are provided by learning neural
    network policies together with reach-avoid supermartingales (RASM) for the graph’s
    sub-tasks and then composing them into a global policy. We also derive a tighter
    lower bound compared to previous work on the probability of reach-avoidance implied
    by a RASM, which is required to find a compositional policy with an acceptable
    probabilistic threshold for complex tasks with multiple edge policies. We implement
    a prototype of our approach and evaluate it on a Stochastic Nine Rooms environment.
acknowledgement: "This work was supported in part by the ERC-2020-AdG 101020093 (VAMOS)
  and the ERC-2020-\r\nCoG 863818 (FoRM-SMArt)."
article_processing_charge: No
arxiv: 1
author:
- first_name: Dorde
  full_name: Zikelic, Dorde
  id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
  last_name: Zikelic
  orcid: 0000-0002-4681-1699
- first_name: Mathias
  full_name: Lechner, Mathias
  id: 3DC22916-F248-11E8-B48F-1D18A9856A87
  last_name: Lechner
- first_name: Abhinav
  full_name: Verma, Abhinav
  id: a235593c-d7fa-11eb-a0c5-b22ca3c66ee6
  last_name: Verma
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- 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: 'Zikelic D, Lechner M, Verma A, Chatterjee K, Henzinger TA. Compositional policy
    learning in stochastic control systems with formal guarantees. In: <i>37th Conference
    on Neural Information Processing Systems</i>. ; 2023.'
  apa: Zikelic, D., Lechner, M., Verma, A., Chatterjee, K., &#38; Henzinger, T. A.
    (2023). Compositional policy learning in stochastic control systems with formal
    guarantees. In <i>37th Conference on Neural Information Processing Systems</i>.
    New Orleans, LO, United States.
  chicago: Zikelic, Dorde, Mathias Lechner, Abhinav Verma, Krishnendu Chatterjee,
    and Thomas A Henzinger. “Compositional Policy Learning in Stochastic Control Systems
    with Formal Guarantees.” In <i>37th Conference on Neural Information Processing
    Systems</i>, 2023.
  ieee: D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, and T. A. Henzinger, “Compositional
    policy learning in stochastic control systems with formal guarantees,” in <i>37th
    Conference on Neural Information Processing Systems</i>, New Orleans, LO, United
    States, 2023.
  ista: 'Zikelic D, Lechner M, Verma A, Chatterjee K, Henzinger TA. 2023. Compositional
    policy learning in stochastic control systems with formal guarantees. 37th Conference
    on Neural Information Processing Systems. NeurIPS: Neural Information Processing
    Systems.'
  mla: Zikelic, Dorde, et al. “Compositional Policy Learning in Stochastic Control
    Systems with Formal Guarantees.” <i>37th Conference on Neural Information Processing
    Systems</i>, 2023.
  short: D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, T.A. Henzinger, in:, 37th
    Conference on Neural Information Processing Systems, 2023.
conference:
  end_date: 2023-12-16
  location: New Orleans, LO, United States
  name: 'NeurIPS: Neural Information Processing Systems'
  start_date: 2023-12-10
date_created: 2024-02-25T09:23:24Z
date_published: 2023-12-15T00:00:00Z
date_updated: 2025-07-14T09:10:04Z
day: '15'
department:
- _id: ToHe
- _id: KrCh
ec_funded: 1
external_id:
  arxiv:
  - '2312.01456'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2312.01456
month: '12'
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'
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
  call_identifier: H2020
  grant_number: '101020093'
  name: Vigilant Algorithmic Monitoring of Software
publication: 37th Conference on Neural Information Processing Systems
publication_status: epub_ahead
quality_controlled: '1'
status: public
title: Compositional policy learning in stochastic control systems with formal guarantees
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '15027'
abstract:
- lang: eng
  text: 'This data repository underpins the paper, published in PNAS (doi pending)
    and bioarxiv (doi: https://doi.org/10.1101/2023.07.05.547777).'
article_processing_charge: No
author:
- first_name: Samo
  full_name: Curk, Samo
  id: 031eff0d-d481-11ee-8508-cd12a7a86e5b
  last_name: Curk
  orcid: 0000-0001-6160-9766
citation:
  ama: Curk S. aggregation_data. 2023.
  apa: Curk, S. (2023). aggregation_data. Figshare.
  chicago: Curk, Samo. “Aggregation_data.” Figshare, 2023.
  ieee: S. Curk, “aggregation_data.” Figshare, 2023.
  ista: Curk S. 2023. aggregation_data, Figshare.
  mla: Curk, Samo. <i>Aggregation_data</i>. Figshare, 2023.
  short: S. Curk, (2023).
date_created: 2024-02-26T08:37:57Z
date_published: 2023-12-13T00:00:00Z
date_updated: 2024-02-26T08:45:55Z
day: '13'
ddc:
- '570'
department:
- _id: AnSa
has_accepted_license: '1'
main_file_link:
- open_access: '1'
  url: https://figshare.com/s/85798bba4ebc68d822ed
month: '12'
oa: 1
oa_version: Published Version
publisher: Figshare
related_material:
  record:
  - id: '15001'
    relation: used_in_publication
    status: public
status: public
title: aggregation_data
tmp:
  image: /images/cc_0.png
  legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
  name: Creative Commons Public Domain Dedication (CC0 1.0)
  short: CC0 (1.0)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '15035'
abstract:
- lang: eng
  text: "This artifact aims to reproduce experiments from the paper Monitoring Hyperproperties
    With Prefix Transducers accepted at RV'23, and give further pointers to implementation
    of prefix transducers.\r\nIt has two parts: a pre-compiled docker image and sources
    that one can use to compile (locally or in docker) the software and run the experiments."
article_processing_charge: No
author:
- first_name: Marek
  full_name: Chalupa, Marek
  id: 87e34708-d6c6-11ec-9f5b-9391e7be2463
  last_name: Chalupa
- 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: Chalupa M, Henzinger TA. Monitoring hyperproperties with prefix transducers.
    2023. doi:<a href="https://doi.org/10.5281/ZENODO.8191723">10.5281/ZENODO.8191723</a>
  apa: Chalupa, M., &#38; Henzinger, T. A. (2023). Monitoring hyperproperties with
    prefix transducers. Zenodo. <a href="https://doi.org/10.5281/ZENODO.8191723">https://doi.org/10.5281/ZENODO.8191723</a>
  chicago: Chalupa, Marek, and Thomas A Henzinger. “Monitoring Hyperproperties with
    Prefix Transducers.” Zenodo, 2023. <a href="https://doi.org/10.5281/ZENODO.8191723">https://doi.org/10.5281/ZENODO.8191723</a>.
  ieee: M. Chalupa and T. A. Henzinger, “Monitoring hyperproperties with prefix transducers.”
    Zenodo, 2023.
  ista: Chalupa M, Henzinger TA. 2023. Monitoring hyperproperties with prefix transducers,
    Zenodo, <a href="https://doi.org/10.5281/ZENODO.8191723">10.5281/ZENODO.8191723</a>.
  mla: Chalupa, Marek, and Thomas A. Henzinger. <i>Monitoring Hyperproperties with
    Prefix Transducers</i>. Zenodo, 2023, doi:<a href="https://doi.org/10.5281/ZENODO.8191723">10.5281/ZENODO.8191723</a>.
  short: M. Chalupa, T.A. Henzinger, (2023).
date_created: 2024-02-28T07:34:34Z
date_published: 2023-07-28T00:00:00Z
date_updated: 2024-02-28T12:33:09Z
day: '28'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.5281/ZENODO.8191723
ec_funded: 1
has_accepted_license: '1'
main_file_link:
- open_access: '1'
  url: https://doi.org/10.5281/zenodo.8191722
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
  call_identifier: H2020
  grant_number: '101020093'
  name: Vigilant Algorithmic Monitoring of Software
publisher: Zenodo
related_material:
  record:
  - id: '14076'
    relation: used_in_publication
    status: public
status: public
title: Monitoring hyperproperties with prefix transducers
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: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '15039'
abstract:
- lang: eng
  text: 'A crucial property for achieving secure, trustworthy and interpretable deep
    learning systems is their robustness: small changes to a system''s inputs should
    not result in large changes to its outputs. Mathematically, this means one strives
    for networks with a small Lipschitz constant. Several recent works have focused
    on how to construct such Lipschitz networks, typically by imposing constraints
    on the weight matrices. In this work, we study an orthogonal aspect, namely the
    role of the activation function. We show that commonly used activation functions,
    such as MaxMin, as well as all piece-wise linear ones with two segments unnecessarily
    restrict the class of representable functions, even in the simplest one-dimensional
    setting. We furthermore introduce the new N-activation function that is provably
    more expressive than currently popular activation functions. We provide code at
    this https URL.'
article_number: '2311.06103'
article_processing_charge: No
arxiv: 1
author:
- first_name: Bernd
  full_name: Prach, Bernd
  id: 2D561D42-C427-11E9-89B4-9C1AE6697425
  last_name: Prach
- first_name: Christoph
  full_name: Lampert, Christoph
  id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
  last_name: Lampert
  orcid: 0000-0001-8622-7887
citation:
  ama: Prach B, Lampert C. 1-Lipschitz neural networks are more expressive with N-activations.
    <i>arXiv</i>. doi:<a href="https://doi.org/10.48550/ARXIV.2311.06103">10.48550/ARXIV.2311.06103</a>
  apa: Prach, B., &#38; Lampert, C. (n.d.). 1-Lipschitz neural networks are more expressive
    with N-activations. <i>arXiv</i>. <a href="https://doi.org/10.48550/ARXIV.2311.06103">https://doi.org/10.48550/ARXIV.2311.06103</a>
  chicago: Prach, Bernd, and Christoph Lampert. “1-Lipschitz Neural Networks Are More
    Expressive with N-Activations.” <i>ArXiv</i>, n.d. <a href="https://doi.org/10.48550/ARXIV.2311.06103">https://doi.org/10.48550/ARXIV.2311.06103</a>.
  ieee: B. Prach and C. Lampert, “1-Lipschitz neural networks are more expressive
    with N-activations,” <i>arXiv</i>. .
  ista: Prach B, Lampert C. 1-Lipschitz neural networks are more expressive with N-activations.
    arXiv, 2311.06103.
  mla: Prach, Bernd, and Christoph Lampert. “1-Lipschitz Neural Networks Are More
    Expressive with N-Activations.” <i>ArXiv</i>, 2311.06103, doi:<a href="https://doi.org/10.48550/ARXIV.2311.06103">10.48550/ARXIV.2311.06103</a>.
  short: B. Prach, C. Lampert, ArXiv (n.d.).
date_created: 2024-02-28T17:59:32Z
date_published: 2023-11-10T00:00:00Z
date_updated: 2024-03-04T07:02:39Z
day: '10'
department:
- _id: GradSch
- _id: ChLa
doi: 10.48550/ARXIV.2311.06103
external_id:
  arxiv:
  - '2311.06103'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2311.06103
month: '11'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
status: public
title: 1-Lipschitz neural networks are more expressive with N-activations
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '8682'
abstract:
- lang: eng
  text: It is known that the Brauer--Manin obstruction to the Hasse principle is vacuous
    for smooth Fano hypersurfaces of dimension at least 3 over any number field. Moreover,
    for such varieties it follows from a general conjecture of Colliot-Thélène that
    the Brauer--Manin obstruction to the Hasse principle should be the only one, so
    that the Hasse principle is expected to hold. Working over the field of rational
    numbers and ordering Fano hypersurfaces of fixed degree and dimension by height,
    we prove that almost every such hypersurface satisfies the Hasse principle provided
    that the dimension is at least 3. This proves a conjecture of Poonen and Voloch
    in every case except for cubic surfaces.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Timothy D
  full_name: Browning, Timothy D
  id: 35827D50-F248-11E8-B48F-1D18A9856A87
  last_name: Browning
  orcid: 0000-0002-8314-0177
- first_name: Pierre Le
  full_name: Boudec, Pierre Le
  last_name: Boudec
- first_name: Will
  full_name: Sawin, Will
  last_name: Sawin
citation:
  ama: Browning TD, Boudec PL, Sawin W. The Hasse principle for random Fano hypersurfaces.
    <i>Annals of Mathematics</i>. 2023;197(3):1115-1203. doi:<a href="https://doi.org/10.4007/annals.2023.197.3.3">10.4007/annals.2023.197.3.3</a>
  apa: Browning, T. D., Boudec, P. L., &#38; Sawin, W. (2023). The Hasse principle
    for random Fano hypersurfaces. <i>Annals of Mathematics</i>. Princeton University.
    <a href="https://doi.org/10.4007/annals.2023.197.3.3">https://doi.org/10.4007/annals.2023.197.3.3</a>
  chicago: Browning, Timothy D, Pierre Le Boudec, and Will Sawin. “The Hasse Principle
    for Random Fano Hypersurfaces.” <i>Annals of Mathematics</i>. Princeton University,
    2023. <a href="https://doi.org/10.4007/annals.2023.197.3.3">https://doi.org/10.4007/annals.2023.197.3.3</a>.
  ieee: T. D. Browning, P. L. Boudec, and W. Sawin, “The Hasse principle for random
    Fano hypersurfaces,” <i>Annals of Mathematics</i>, vol. 197, no. 3. Princeton
    University, pp. 1115–1203, 2023.
  ista: Browning TD, Boudec PL, Sawin W. 2023. The Hasse principle for random Fano
    hypersurfaces. Annals of Mathematics. 197(3), 1115–1203.
  mla: Browning, Timothy D., et al. “The Hasse Principle for Random Fano Hypersurfaces.”
    <i>Annals of Mathematics</i>, vol. 197, no. 3, Princeton University, 2023, pp.
    1115–203, doi:<a href="https://doi.org/10.4007/annals.2023.197.3.3">10.4007/annals.2023.197.3.3</a>.
  short: T.D. Browning, P.L. Boudec, W. Sawin, Annals of Mathematics 197 (2023) 1115–1203.
date_created: 2020-10-19T14:28:50Z
date_published: 2023-05-01T00:00:00Z
date_updated: 2025-08-11T11:59:49Z
day: '01'
department:
- _id: TiBr
doi: 10.4007/annals.2023.197.3.3
external_id:
  arxiv:
  - '2006.02356'
  isi:
  - '000966611000003'
  oaworkID:
  - w3033938593
intvolume: '       197'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2006.02356
month: '05'
oa: 1
oa_version: Preprint
page: 1115-1203
publication: Annals of Mathematics
publication_identifier:
  issn:
  - 0003-486X
publication_status: published
publisher: Princeton University
quality_controlled: '1'
related_material:
  link:
  - description: News on IST Homepage
    relation: press_release
    url: https://ist.ac.at/en/news/when-is-necessary-sufficient/
status: public
title: The Hasse principle for random Fano hypersurfaces
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 197
year: '2023'
...
---
_id: '9034'
abstract:
- lang: eng
  text: We determine an asymptotic formula for the number of integral points of bounded
    height on a blow-up of P3 outside certain planes using universal torsors.
acknowledgement: This work was supported by the German Academic Exchange Service.
  Parts of this article were prepared at the Institut de Mathémathiques de Jussieu—Paris
  Rive Gauche. I wish to thank Antoine Chambert-Loir for his remarks and the institute
  for its hospitality, as well as the anonymous referee for several useful remarks
  and suggestions for improvements.
article_processing_charge: No
article_type: original
arxiv: 1
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 log Fano threefold. <i>International
    Mathematics Research Notices</i>. 2023;2023(8):6780-6808. doi:<a href="https://doi.org/10.1093/imrn/rnac048">10.1093/imrn/rnac048</a>
  apa: Wilsch, F. A. (2023). Integral points of bounded height on a log Fano threefold.
    <i>International Mathematics Research Notices</i>. Oxford Academic. <a href="https://doi.org/10.1093/imrn/rnac048">https://doi.org/10.1093/imrn/rnac048</a>
  chicago: Wilsch, Florian Alexander. “Integral Points of Bounded Height on a Log
    Fano Threefold.” <i>International Mathematics Research Notices</i>. Oxford Academic,
    2023. <a href="https://doi.org/10.1093/imrn/rnac048">https://doi.org/10.1093/imrn/rnac048</a>.
  ieee: F. A. Wilsch, “Integral points of bounded height on a log Fano threefold,”
    <i>International Mathematics Research Notices</i>, vol. 2023, no. 8. Oxford Academic,
    pp. 6780–6808, 2023.
  ista: Wilsch FA. 2023. Integral points of bounded height on a log Fano threefold.
    International Mathematics Research Notices. 2023(8), 6780–6808.
  mla: Wilsch, Florian Alexander. “Integral Points of Bounded Height on a Log Fano
    Threefold.” <i>International Mathematics Research Notices</i>, vol. 2023, no.
    8, Oxford Academic, 2023, pp. 6780–808, doi:<a href="https://doi.org/10.1093/imrn/rnac048">10.1093/imrn/rnac048</a>.
  short: F.A. Wilsch, International Mathematics Research Notices 2023 (2023) 6780–6808.
date_created: 2021-01-22T09:31:09Z
date_published: 2023-04-01T00:00:00Z
date_updated: 2023-08-01T12:23:55Z
day: '01'
department:
- _id: TiBr
doi: 10.1093/imrn/rnac048
external_id:
  arxiv:
  - '1901.08503'
  isi:
  - '000773116000001'
intvolume: '      2023'
isi: 1
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1901.08503
month: '04'
oa: 1
oa_version: Preprint
page: 6780-6808
publication: International Mathematics Research Notices
publication_identifier:
  eissn:
  - 1687-0247
  issn:
  - 1073-7928
publication_status: published
publisher: Oxford Academic
quality_controlled: '1'
status: public
title: Integral points of bounded height on a log Fano threefold
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 2023
year: '2023'
...
---
_id: '9651'
abstract:
- lang: eng
  text: We introduce a hierachy of equivalence relations on the set of separated nets
    of a given Euclidean space, indexed by concave increasing functions ϕ:(0,∞)→(0,∞).
    Two separated nets are called ϕ-displacement equivalent if, roughly speaking,
    there is a bijection between them which, for large radii R, displaces points of
    norm at most R by something of order at most ϕ(R). We show that the spectrum of
    ϕ-displacement equivalence spans from the established notion of bounded displacement
    equivalence, which corresponds to bounded ϕ, to the indiscrete equivalence relation,
    coresponding to ϕ(R)∈Ω(R), in which all separated nets are equivalent. In between
    the two ends of this spectrum, the notions of ϕ-displacement equivalence are shown
    to be pairwise distinct with respect to the asymptotic classes of ϕ(R) for R→∞.
    We further undertake a comparison of our notion of ϕ-displacement equivalence
    with previously studied relations on separated nets. Particular attention is given
    to the interaction of the notions of ϕ-displacement equivalence with that of bilipschitz
    equivalence.
acknowledgement: 'Open access funding provided by Institute of Science and Technology
  (IST Austria). This work was started while both authors were employed at the University
  of Innsbruck and enjoyed the full support of Austrian Science Fund (FWF): P 30902-N35.
  It was continued when the first named author was employed at University of Leipzig
  and the second named author was employed at Institute of Science and Technology
  of Austria, where he was supported by an IST Fellowship.'
article_number: '15'
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Michael
  full_name: Dymond, Michael
  last_name: Dymond
- first_name: Vojtech
  full_name: Kaluza, Vojtech
  id: 21AE5134-9EAC-11EA-BEA2-D7BD3DDC885E
  last_name: Kaluza
  orcid: 0000-0002-2512-8698
citation:
  ama: Dymond M, Kaluza V. Divergence of separated nets with respect to displacement
    equivalence. <i>Geometriae Dedicata</i>. 2023. doi:<a href="https://doi.org/10.1007/s10711-023-00862-3">10.1007/s10711-023-00862-3</a>
  apa: Dymond, M., &#38; Kaluza, V. (2023). Divergence of separated nets with respect
    to displacement equivalence. <i>Geometriae Dedicata</i>. Springer Nature. <a href="https://doi.org/10.1007/s10711-023-00862-3">https://doi.org/10.1007/s10711-023-00862-3</a>
  chicago: Dymond, Michael, and Vojtech Kaluza. “Divergence of Separated Nets with
    Respect to Displacement Equivalence.” <i>Geometriae Dedicata</i>. Springer Nature,
    2023. <a href="https://doi.org/10.1007/s10711-023-00862-3">https://doi.org/10.1007/s10711-023-00862-3</a>.
  ieee: M. Dymond and V. Kaluza, “Divergence of separated nets with respect to displacement
    equivalence,” <i>Geometriae Dedicata</i>. Springer Nature, 2023.
  ista: Dymond M, Kaluza V. 2023. Divergence of separated nets with respect to displacement
    equivalence. Geometriae Dedicata., 15.
  mla: Dymond, Michael, and Vojtech Kaluza. “Divergence of Separated Nets with Respect
    to Displacement Equivalence.” <i>Geometriae Dedicata</i>, 15, Springer Nature,
    2023, doi:<a href="https://doi.org/10.1007/s10711-023-00862-3">10.1007/s10711-023-00862-3</a>.
  short: M. Dymond, V. Kaluza, Geometriae Dedicata (2023).
date_created: 2021-07-14T07:01:27Z
date_published: 2023-11-17T00:00:00Z
date_updated: 2024-01-11T13:06:32Z
day: '17'
department:
- _id: UlWa
doi: 10.1007/s10711-023-00862-3
external_id:
  arxiv:
  - '2102.13046'
  isi:
  - '001105681500001'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1007/s10711-023-00862-3
month: '11'
oa: 1
oa_version: Published Version
publication: Geometriae Dedicata
publication_identifier:
  eissn:
  - 1572-9168
  issn:
  - 0046-5755
publication_status: epub_ahead
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Divergence of separated nets with respect to displacement equivalence
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '9652'
abstract:
- lang: eng
  text: In 1998 Burago and Kleiner and (independently) McMullen gave examples of separated
    nets in Euclidean space which are non-bilipschitz equivalent to the integer lattice.
    We study weaker notions of equivalence of separated nets and demonstrate that
    such notions also give rise to distinct equivalence classes. Put differently,
    we find occurrences of particularly strong divergence of separated nets from the
    integer lattice. Our approach generalises that of Burago and Kleiner and McMullen
    which takes place largely in a continuous setting. Existence of irregular separated
    nets is verified via the existence of non-realisable density functions ρ:[0,1]d→(0,∞).
    In the present work we obtain stronger types of non-realisable densities.
acknowledgement: 'This work was done while both authors were employed at the University
  of Innsbruck and enjoyed the full support of Austrian Science Fund (FWF): P 30902-N35.'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Michael
  full_name: Dymond, Michael
  last_name: Dymond
- first_name: Vojtech
  full_name: Kaluza, Vojtech
  id: 21AE5134-9EAC-11EA-BEA2-D7BD3DDC885E
  last_name: Kaluza
  orcid: 0000-0002-2512-8698
citation:
  ama: Dymond M, Kaluza V. Highly irregular separated nets. <i>Israel Journal of Mathematics</i>.
    2023;253:501-554. doi:<a href="https://doi.org/10.1007/s11856-022-2448-6">10.1007/s11856-022-2448-6</a>
  apa: Dymond, M., &#38; Kaluza, V. (2023). Highly irregular separated nets. <i>Israel
    Journal of Mathematics</i>. Springer Nature. <a href="https://doi.org/10.1007/s11856-022-2448-6">https://doi.org/10.1007/s11856-022-2448-6</a>
  chicago: Dymond, Michael, and Vojtech Kaluza. “Highly Irregular Separated Nets.”
    <i>Israel Journal of Mathematics</i>. Springer Nature, 2023. <a href="https://doi.org/10.1007/s11856-022-2448-6">https://doi.org/10.1007/s11856-022-2448-6</a>.
  ieee: M. Dymond and V. Kaluza, “Highly irregular separated nets,” <i>Israel Journal
    of Mathematics</i>, vol. 253. Springer Nature, pp. 501–554, 2023.
  ista: Dymond M, Kaluza V. 2023. Highly irregular separated nets. Israel Journal
    of Mathematics. 253, 501–554.
  mla: Dymond, Michael, and Vojtech Kaluza. “Highly Irregular Separated Nets.” <i>Israel
    Journal of Mathematics</i>, vol. 253, Springer Nature, 2023, pp. 501–54, doi:<a
    href="https://doi.org/10.1007/s11856-022-2448-6">10.1007/s11856-022-2448-6</a>.
  short: M. Dymond, V. Kaluza, Israel Journal of Mathematics 253 (2023) 501–554.
date_created: 2021-07-14T07:01:28Z
date_published: 2023-03-01T00:00:00Z
date_updated: 2023-08-14T11:26:34Z
day: '01'
ddc:
- '515'
- '516'
department:
- _id: UlWa
doi: 10.1007/s11856-022-2448-6
external_id:
  arxiv:
  - '1903.05923'
  isi:
  - '000904950300003'
file:
- access_level: open_access
  checksum: 6fa0a3207dd1d6467c309fd1bcc867d1
  content_type: application/pdf
  creator: vkaluza
  date_created: 2021-07-14T07:41:50Z
  date_updated: 2021-07-14T07:41:50Z
  file_id: '9653'
  file_name: separated_nets.pdf
  file_size: 900422
  relation: main_file
file_date_updated: 2021-07-14T07:41:50Z
has_accepted_license: '1'
intvolume: '       253'
isi: 1
keyword:
- Lipschitz
- bilipschitz
- bounded displacement
- modulus of continuity
- separated net
- non-realisable density
- Burago--Kleiner construction
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
page: 501-554
publication: Israel Journal of Mathematics
publication_identifier:
  eissn:
  - 1565-8511
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Highly irregular separated nets
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 253
year: '2023'
...
---
_id: '10016'
abstract:
- lang: eng
  text: 'Auxin has always been at the forefront of research in plant physiology and
    development. Since the earliest contemplations by Julius von Sachs and Charles
    Darwin, more than a century-long struggle has been waged to understand its function.
    This largely reflects the failures, successes, and inevitable progress in the
    entire field of plant signaling and development. Here I present 14 stations on
    our long and sometimes mystical journey to understand auxin. These highlights
    were selected to give a flavor of the field and to show the scope and limits of
    our current knowledge. A special focus is put on features that make auxin unique
    among phytohormones, such as its dynamic, directional transport network, which
    integrates external and internal signals, including self-organizing feedback.
    Accented are persistent mysteries and controversies. The unexpected discoveries
    related to rapid auxin responses and growth regulation recently disturbed our
    contentment regarding understanding of the auxin signaling mechanism. These new
    revelations, along with advances in technology, usher us into a new, exciting
    era in auxin research. '
acknowledgement: "The author thanks the whole community of researchers consciously
  or unconsciously working on questions related to auxin, whose hard work and enthusiasm
  contributed to development of this exciting story. Particular thanks go to many\r\nbrilliant
  present and past members of the Friml group and our numerous excellent collaborators,
  without whom my own personal journey would not be possible. The way of the cross
  with its 14 stations is a popular devotion among Roman Catholics and inspires them
  to make a spiritual pilgrimage through contemplation of Christ on his last day.
  Its aspects of gradual progress, struggle, passion, and revelation served as an
  inspiration for the formal depiction of our journey to understanding auxin as described
  in this review. It is in no way intended to reflect the personal beliefs of the
  author and readers. I am grateful to Nick Barton, Eva Benková, Lenka Caisová, Matyáš
  Fendrych, Lukáš Fiedler, Monika Frátriková, Jarmila Frimlová, Michelle Gallei, Jakub
  Hajný, Lukas Hoermayer, Alexandra Mally, Ondrˇej Novák, Jan Petrášek, Aleš Pěnčík,
  Steffen Vanneste, Tongda Xu, and Zhenbiao Yang for their valuable comments. Special
  thanks go to Michelle Gallei for her invaluable assistance with the figures."
article_number: a039859
article_processing_charge: No
article_type: review
author:
- first_name: Jiří
  full_name: Friml, Jiří
  id: 4159519E-F248-11E8-B48F-1D18A9856A87
  last_name: Friml
  orcid: 0000-0002-8302-7596
citation:
  ama: Friml J. Fourteen stations of auxin. <i>Cold Spring Harbor Perspectives in
    Biology</i>. 2022;14(5). doi:<a href="https://doi.org/10.1101/cshperspect.a039859
    ">10.1101/cshperspect.a039859 </a>
  apa: Friml, J. (2022). Fourteen stations of auxin. <i>Cold Spring Harbor Perspectives
    in Biology</i>. Cold Spring Harbor Laboratory. <a href="https://doi.org/10.1101/cshperspect.a039859
    ">https://doi.org/10.1101/cshperspect.a039859 </a>
  chicago: Friml, Jiří. “Fourteen Stations of Auxin.” <i>Cold Spring Harbor Perspectives
    in Biology</i>. Cold Spring Harbor Laboratory, 2022. <a href="https://doi.org/10.1101/cshperspect.a039859
    ">https://doi.org/10.1101/cshperspect.a039859 </a>.
  ieee: J. Friml, “Fourteen stations of auxin,” <i>Cold Spring Harbor Perspectives
    in Biology</i>, vol. 14, no. 5. Cold Spring Harbor Laboratory, 2022.
  ista: Friml J. 2022. Fourteen stations of auxin. Cold Spring Harbor Perspectives
    in Biology. 14(5), a039859.
  mla: Friml, Jiří. “Fourteen Stations of Auxin.” <i>Cold Spring Harbor Perspectives
    in Biology</i>, vol. 14, no. 5, a039859, Cold Spring Harbor Laboratory, 2022,
    doi:<a href="https://doi.org/10.1101/cshperspect.a039859 ">10.1101/cshperspect.a039859
    </a>.
  short: J. Friml, Cold Spring Harbor Perspectives in Biology 14 (2022).
date_created: 2021-09-14T11:36:53Z
date_published: 2022-05-27T00:00:00Z
date_updated: 2023-08-02T06:54:42Z
day: '27'
department:
- _id: JiFr
doi: '10.1101/cshperspect.a039859 '
external_id:
  isi:
  - '000806563000003'
  pmid:
  - '34400554'
intvolume: '        14'
isi: 1
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: 'https://doi.org/10.1101/cshperspect.a039859 '
month: '05'
oa: 1
oa_version: Published Version
pmid: 1
publication: Cold Spring Harbor Perspectives in Biology
publication_identifier:
  issn:
  - 1943-0264
publication_status: published
publisher: Cold Spring Harbor Laboratory
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fourteen stations of auxin
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 14
year: '2022'
...
---
_id: '10018'
abstract:
- lang: eng
  text: In order to study integral points of bounded log-anticanonical height on weak
    del Pezzo surfaces, we classify weak del Pezzo pairs. As a representative example,
    we consider a quartic del Pezzo surface of singularity type A1 + A3 and prove
    an analogue of Manin's conjecture for integral points with respect to its singularities
    and its lines.
acknowledgement: The first author was partly supported by grant DE 1646/4-2 of the
  Deutsche Forschungsgemeinschaft. The second author was partly supported by FWF grant
  P 32428-N35 and conducted part of this work as a guest at the Institut de Mathématiques
  de Jussieu–Paris Rive Gauche invited by Antoine Chambert-Loir and funded by DAAD.
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Ulrich
  full_name: Derenthal, Ulrich
  last_name: Derenthal
- first_name: Florian Alexander
  full_name: Wilsch, Florian Alexander
  id: 560601DA-8D36-11E9-A136-7AC1E5697425
  last_name: Wilsch
  orcid: 0000-0001-7302-8256
citation:
  ama: Derenthal U, Wilsch FA. Integral points on singular del Pezzo surfaces. <i>Journal
    of the Institute of Mathematics of Jussieu</i>. 2022. doi:<a href="https://doi.org/10.1017/S1474748022000482">10.1017/S1474748022000482</a>
  apa: Derenthal, U., &#38; Wilsch, F. A. (2022). Integral points on singular del
    Pezzo surfaces. <i>Journal of the Institute of Mathematics of Jussieu</i>. Cambridge
    University Press. <a href="https://doi.org/10.1017/S1474748022000482">https://doi.org/10.1017/S1474748022000482</a>
  chicago: Derenthal, Ulrich, and Florian Alexander Wilsch. “Integral Points on Singular
    Del Pezzo Surfaces.” <i>Journal of the Institute of Mathematics of Jussieu</i>.
    Cambridge University Press, 2022. <a href="https://doi.org/10.1017/S1474748022000482">https://doi.org/10.1017/S1474748022000482</a>.
  ieee: U. Derenthal and F. A. Wilsch, “Integral points on singular del Pezzo surfaces,”
    <i>Journal of the Institute of Mathematics of Jussieu</i>. Cambridge University
    Press, 2022.
  ista: Derenthal U, Wilsch FA. 2022. Integral points on singular del Pezzo surfaces.
    Journal of the Institute of Mathematics of Jussieu.
  mla: Derenthal, Ulrich, and Florian Alexander Wilsch. “Integral Points on Singular
    Del Pezzo Surfaces.” <i>Journal of the Institute of Mathematics of Jussieu</i>,
    Cambridge University Press, 2022, doi:<a href="https://doi.org/10.1017/S1474748022000482">10.1017/S1474748022000482</a>.
  short: U. Derenthal, F.A. Wilsch, Journal of the Institute of Mathematics of Jussieu
    (2022).
date_created: 2021-09-15T10:06:48Z
date_published: 2022-11-10T00:00:00Z
date_updated: 2023-08-02T06:55:10Z
day: '10'
department:
- _id: TiBr
doi: 10.1017/S1474748022000482
external_id:
  arxiv:
  - '2109.06778'
  isi:
  - '000881319200001'
isi: 1
keyword:
- Integral points
- del Pezzo surface
- universal torsor
- Manin’s conjecture
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1017/S1474748022000482
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 26AEDAB2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P32428
  name: New frontiers of the Manin conjecture
publication: Journal of the Institute of Mathematics of Jussieu
publication_identifier:
  eissn:
  - '1475-3030 '
  issn:
  - 1474-7480
publication_status: epub_ahead
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Integral points on singular del Pezzo surfaces
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2022'
...
---
_id: '10042'
abstract:
- lang: eng
  text: SnSe has emerged as one of the most promising materials for thermoelectric
    energy conversion due to its extraordinary performance in its single-crystal form
    and its low-cost constituent elements. However, to achieve an economic impact,
    the polycrystalline counterpart needs to replicate the performance of the single
    crystal. Herein, we optimize the thermoelectric performance of polycrystalline
    SnSe produced by consolidating solution-processed and surface-engineered SnSe
    particles. In particular, the SnSe particles are coated with CdSe molecular complexes
    that crystallize during the sintering process, forming CdSe nanoparticles. The
    presence of CdSe nanoparticles inhibits SnSe grain growth during the consolidation
    step due to Zener pinning, yielding a material with a high density of grain boundaries.
    Moreover, the resulting SnSe–CdSe nanocomposites present a large number of defects
    at different length scales, which significantly reduce the thermal conductivity.
    The produced SnSe–CdSe nanocomposites exhibit thermoelectric figures of merit
    up to 2.2 at 786 K, which is among the highest reported for solution-processed
    SnSe.
acknowledgement: 'This work was financially supported by IST Austria and the Werner
  Siemens Foundation. Y.L. acknowledges funding from the European Union’s Horizon
  2020 research and innovation program under the Marie Sklodowska-Curie grant agreement
  No. 754411. S.L. and M.C. received funding from the European Union’s Horizon 2020
  research and innovation program under the Marie Skłodowska-Curie Grant Agreement
  No. 665385. J.D. acknowledges funding from the European Union’s Horizon 2020 research
  and innovation program under the Marie Sklodowska-Curie grant agreement no. 665919
  (P-SPHERE) cofunded by Severo Ochoa Programme. C.C. acknowledges funding from the
  FWF “Lise Meitner Fellowship” grant agreement M 2889-N. Y.Y. and O.C.-M. acknowledge
  the financial support from DFG within the project SFB 917: Nanoswitches. M.C.S.
  received funding from the European Union’s Horizon 2020 research and innovation
  programme under the Marie Skłodowska-Curie grant agreement No. 754510 (PROBIST)
  and the Severo Ochoa programme. J.D. received funding from the European Union’s
  Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie
  grant agreement No. 665919 (P-SPHERE) cofunded by Severo Ochoa Programme. The ICN2
  is funded by the CERCA Program/Generalitat de Catalunya and by the Severo Ochoa
  program of the Spanish Ministry of Economy, Industry, and Competitiveness (MINECO,
  grant no. SEV-2017-0706). ICN2 acknowledges funding from Generalitat de Catalunya
  2017 SGR 327 and the Spanish MINECO project NANOGEN (PID2020-116093RB-C43). This
  project received funding from the European Union’s Horizon 2020 research and innovation
  program under grant agreement No. 823717-ESTEEM3. The FIB sample preparation was
  conducted in the LMA-INA-Universidad de Zaragoza.'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Yu
  full_name: Liu, Yu
  id: 2A70014E-F248-11E8-B48F-1D18A9856A87
  last_name: Liu
  orcid: 0000-0001-7313-6740
- first_name: Mariano
  full_name: Calcabrini, Mariano
  id: 45D7531A-F248-11E8-B48F-1D18A9856A87
  last_name: Calcabrini
- first_name: Yuan
  full_name: Yu, Yuan
  last_name: Yu
- first_name: Seungho
  full_name: Lee, Seungho
  id: BB243B88-D767-11E9-B658-BC13E6697425
  last_name: Lee
  orcid: 0000-0002-6962-8598
- first_name: Cheng
  full_name: Chang, Cheng
  id: 9E331C2E-9F27-11E9-AE48-5033E6697425
  last_name: Chang
  orcid: 0000-0002-9515-4277
- first_name: Jérémy
  full_name: David, Jérémy
  last_name: David
- first_name: Tanmoy
  full_name: Ghosh, Tanmoy
  id: a5fc9bc3-feff-11ea-93fe-e8015a3c7e9d
  last_name: Ghosh
- first_name: Maria Chiara
  full_name: Spadaro, Maria Chiara
  last_name: Spadaro
- first_name: Chenyang
  full_name: Xie, Chenyang
  last_name: Xie
- first_name: Oana
  full_name: Cojocaru-Mirédin, Oana
  last_name: Cojocaru-Mirédin
- first_name: Jordi
  full_name: Arbiol, Jordi
  last_name: Arbiol
- first_name: Maria
  full_name: Ibáñez, Maria
  id: 43C61214-F248-11E8-B48F-1D18A9856A87
  last_name: Ibáñez
  orcid: 0000-0001-5013-2843
citation:
  ama: Liu Y, Calcabrini M, Yu Y, et al. Defect engineering in solution-processed
    polycrystalline SnSe leads to high thermoelectric performance. <i>ACS Nano</i>.
    2022;16(1):78-88. doi:<a href="https://doi.org/10.1021/acsnano.1c06720">10.1021/acsnano.1c06720</a>
  apa: Liu, Y., Calcabrini, M., Yu, Y., Lee, S., Chang, C., David, J., … Ibáñez, M.
    (2022). Defect engineering in solution-processed polycrystalline SnSe leads to
    high thermoelectric performance. <i>ACS Nano</i>. American Chemical Society .
    <a href="https://doi.org/10.1021/acsnano.1c06720">https://doi.org/10.1021/acsnano.1c06720</a>
  chicago: Liu, Yu, Mariano Calcabrini, Yuan Yu, Seungho Lee, Cheng Chang, Jérémy
    David, Tanmoy Ghosh, et al. “Defect Engineering in Solution-Processed Polycrystalline
    SnSe Leads to High Thermoelectric Performance.” <i>ACS Nano</i>. American Chemical
    Society , 2022. <a href="https://doi.org/10.1021/acsnano.1c06720">https://doi.org/10.1021/acsnano.1c06720</a>.
  ieee: Y. Liu <i>et al.</i>, “Defect engineering in solution-processed polycrystalline
    SnSe leads to high thermoelectric performance,” <i>ACS Nano</i>, vol. 16, no.
    1. American Chemical Society , pp. 78–88, 2022.
  ista: Liu Y, Calcabrini M, Yu Y, Lee S, Chang C, David J, Ghosh T, Spadaro MC, Xie
    C, Cojocaru-Mirédin O, Arbiol J, Ibáñez M. 2022. Defect engineering in solution-processed
    polycrystalline SnSe leads to high thermoelectric performance. ACS Nano. 16(1),
    78–88.
  mla: Liu, Yu, et al. “Defect Engineering in Solution-Processed Polycrystalline SnSe
    Leads to High Thermoelectric Performance.” <i>ACS Nano</i>, vol. 16, no. 1, American
    Chemical Society , 2022, pp. 78–88, doi:<a href="https://doi.org/10.1021/acsnano.1c06720">10.1021/acsnano.1c06720</a>.
  short: Y. Liu, M. Calcabrini, Y. Yu, S. Lee, C. Chang, J. David, T. Ghosh, M.C.
    Spadaro, C. Xie, O. Cojocaru-Mirédin, J. Arbiol, M. Ibáñez, ACS Nano 16 (2022)
    78–88.
date_created: 2021-09-24T07:55:12Z
date_published: 2022-01-25T00:00:00Z
date_updated: 2023-08-02T14:41:05Z
day: '25'
ddc:
- '540'
department:
- _id: MaIb
doi: 10.1021/acsnano.1c06720
ec_funded: 1
external_id:
  isi:
  - '000767223400008'
  pmid:
  - '34549956'
file:
- access_level: open_access
  checksum: 74f9c1aa5f95c0b992a4328e8e0247b4
  content_type: application/pdf
  creator: cchlebak
  date_created: 2022-03-02T16:17:29Z
  date_updated: 2022-03-02T16:17:29Z
  file_id: '10808'
  file_name: 2022_ACSNano_Liu.pdf
  file_size: 9050764
  relation: main_file
  success: 1
file_date_updated: 2022-03-02T16:17:29Z
has_accepted_license: '1'
intvolume: '        16'
isi: 1
issue: '1'
keyword:
- tin selenide
- nanocomposite
- grain growth
- Zener pinning
- thermoelectricity
- annealing
- solution processing
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 78-88
pmid: 1
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '754411'
  name: ISTplus - Postdoctoral Fellowships
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '665385'
  name: International IST Doctoral Program
- _id: 9B8F7476-BA93-11EA-9121-9846C619BF3A
  name: 'HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of
    Semiconductors for Waste Heat Recovery'
- _id: 9B8804FC-BA93-11EA-9121-9846C619BF3A
  grant_number: M02889
  name: Bottom-up Engineering for Thermoelectric Applications
publication: ACS Nano
publication_identifier:
  eissn:
  - 1936-086X
  issn:
  - 1936-0851
publication_status: published
publisher: 'American Chemical Society '
quality_controlled: '1'
related_material:
  record:
  - id: '12885'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Defect engineering in solution-processed polycrystalline SnSe leads to high
  thermoelectric performance
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 16
year: '2022'
...
---
_id: '10182'
abstract:
- lang: eng
  text: The mitochondrial oxidative phosphorylation system is central to cellular
    metabolism. It comprises five enzymatic complexes and two mobile electron carriers
    that work in a mitochondrial respiratory chain. By coupling the oxidation of reducing
    equivalents coming into mitochondria to the generation and subsequent dissipation
    of a proton gradient across the inner mitochondrial membrane, this electron transport
    chain drives the production of ATP, which is then used as a primary energy carrier
    in virtually all cellular processes. Minimal perturbations of the respiratory
    chain activity are linked to diseases; therefore, it is necessary to understand
    how these complexes are assembled and regulated and how they function. In this
    Review, we outline the latest assembly models for each individual complex, and
    we also highlight the recent discoveries indicating that the formation of larger
    assemblies, known as respiratory supercomplexes, originates from the association
    of the intermediates of individual complexes. We then discuss how recent cryo-electron
    microscopy structures have been key to answering open questions on the function
    of the electron transport chain in mitochondrial respiration and how supercomplexes
    and other factors, including metabolites, can regulate the activity of the single
    complexes. When relevant, we discuss how these mechanisms contribute to physiology
    and outline their deregulation in human diseases.
article_processing_charge: No
article_type: original
author:
- first_name: Irene
  full_name: Vercellino, Irene
  id: 3ED6AF16-F248-11E8-B48F-1D18A9856A87
  last_name: Vercellino
  orcid: ' 0000-0001-5618-3449'
- first_name: Leonid A
  full_name: Sazanov, Leonid A
  id: 338D39FE-F248-11E8-B48F-1D18A9856A87
  last_name: Sazanov
  orcid: 0000-0002-0977-7989
citation:
  ama: Vercellino I, Sazanov LA. The assembly, regulation and function of the mitochondrial
    respiratory chain. <i>Nature Reviews Molecular Cell Biology</i>. 2022;23:141–161.
    doi:<a href="https://doi.org/10.1038/s41580-021-00415-0">10.1038/s41580-021-00415-0</a>
  apa: Vercellino, I., &#38; Sazanov, L. A. (2022). The assembly, regulation and function
    of the mitochondrial respiratory chain. <i>Nature Reviews Molecular Cell Biology</i>.
    Springer Nature. <a href="https://doi.org/10.1038/s41580-021-00415-0">https://doi.org/10.1038/s41580-021-00415-0</a>
  chicago: Vercellino, Irene, and Leonid A Sazanov. “The Assembly, Regulation and
    Function of the Mitochondrial Respiratory Chain.” <i>Nature Reviews Molecular
    Cell Biology</i>. Springer Nature, 2022. <a href="https://doi.org/10.1038/s41580-021-00415-0">https://doi.org/10.1038/s41580-021-00415-0</a>.
  ieee: I. Vercellino and L. A. Sazanov, “The assembly, regulation and function of
    the mitochondrial respiratory chain,” <i>Nature Reviews Molecular Cell Biology</i>,
    vol. 23. Springer Nature, pp. 141–161, 2022.
  ista: Vercellino I, Sazanov LA. 2022. The assembly, regulation and function of the
    mitochondrial respiratory chain. Nature Reviews Molecular Cell Biology. 23, 141–161.
  mla: Vercellino, Irene, and Leonid A. Sazanov. “The Assembly, Regulation and Function
    of the Mitochondrial Respiratory Chain.” <i>Nature Reviews Molecular Cell Biology</i>,
    vol. 23, Springer Nature, 2022, pp. 141–161, doi:<a href="https://doi.org/10.1038/s41580-021-00415-0">10.1038/s41580-021-00415-0</a>.
  short: I. Vercellino, L.A. Sazanov, Nature Reviews Molecular Cell Biology 23 (2022)
    141–161.
date_created: 2021-10-24T22:01:35Z
date_published: 2022-02-01T00:00:00Z
date_updated: 2023-08-02T06:55:42Z
day: '01'
department:
- _id: LeSa
doi: 10.1038/s41580-021-00415-0
external_id:
  isi:
  - '000705697100001'
  pmid:
  - '34621061'
intvolume: '        23'
isi: 1
language:
- iso: eng
month: '02'
oa_version: None
page: 141–161
pmid: 1
publication: Nature Reviews Molecular Cell Biology
publication_identifier:
  eissn:
  - 1471-0080
  issn:
  - 1471-0072
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: The assembly, regulation and function of the mitochondrial respiratory chain
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 23
year: '2022'
...
---
_id: '10208'
abstract:
- lang: eng
  text: It is practical to collect a huge amount of movement data and environmental
    context information along with the health signals of individuals because there
    is the emergence of new generations of positioning and tracking technologies and
    rapid advancements of health sensors. The study of the relations between these
    datasets and their sequence similarity analysis is of interest to many applications
    such as health monitoring and recommender systems. However, entering all movement
    parameters and health signals can lead to the complexity of the problem and an
    increase in its computational load. In this situation, dimension reduction techniques
    can be used to avoid consideration of simultaneous dependent parameters in the
    process of similarity measurement of the trajectories. The present study provides
    a framework, named CaDRAW, to use spatial–temporal data and movement parameters
    along with independent context information in the process of measuring the similarity
    of trajectories. In this regard, the omission of dependent movement characteristic
    signals is conducted by using an unsupervised feature selection dimension reduction
    technique. To evaluate the effectiveness of the proposed framework, it was applied
    to a real contextualized movement and related health signal datasets of individuals.
    The results indicated the capability of the proposed framework in measuring the
    similarity and in decreasing the characteristic signals in such a way that the
    similarity results -before and after reduction of dependent characteristic signals-
    have small differences. The mean differences between the obtained results before
    and after reducing the dimension were 0.029 and 0.023 for the round path, respectively.
acknowledgement: The third author acknowledges the funding received from the Wittgenstein
  Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.
article_processing_charge: No
article_type: original
author:
- first_name: Samira
  full_name: Goudarzi, Samira
  last_name: Goudarzi
- first_name: Mohammad
  full_name: Sharif, Mohammad
  last_name: Sharif
- first_name: Farid
  full_name: Karimipour, Farid
  id: 2A2BCDC4-CF62-11E9-BE5E-3B1EE6697425
  last_name: Karimipour
  orcid: 0000-0001-6746-4174
citation:
  ama: Goudarzi S, Sharif M, Karimipour F. A context-aware dimension reduction framework
    for trajectory and health signal analyses. <i>Journal of Ambient Intelligence
    and Humanized Computing</i>. 2022;13:2621–2635. doi:<a href="https://doi.org/10.1007/s12652-021-03569-z">10.1007/s12652-021-03569-z</a>
  apa: Goudarzi, S., Sharif, M., &#38; Karimipour, F. (2022). A context-aware dimension
    reduction framework for trajectory and health signal analyses. <i>Journal of Ambient
    Intelligence and Humanized Computing</i>. Springer Nature. <a href="https://doi.org/10.1007/s12652-021-03569-z">https://doi.org/10.1007/s12652-021-03569-z</a>
  chicago: Goudarzi, Samira, Mohammad Sharif, and Farid Karimipour. “A Context-Aware
    Dimension Reduction Framework for Trajectory and Health Signal Analyses.” <i>Journal
    of Ambient Intelligence and Humanized Computing</i>. Springer Nature, 2022. <a
    href="https://doi.org/10.1007/s12652-021-03569-z">https://doi.org/10.1007/s12652-021-03569-z</a>.
  ieee: S. Goudarzi, M. Sharif, and F. Karimipour, “A context-aware dimension reduction
    framework for trajectory and health signal analyses,” <i>Journal of Ambient Intelligence
    and Humanized Computing</i>, vol. 13. Springer Nature, pp. 2621–2635, 2022.
  ista: Goudarzi S, Sharif M, Karimipour F. 2022. A context-aware dimension reduction
    framework for trajectory and health signal analyses. Journal of Ambient Intelligence
    and Humanized Computing. 13, 2621–2635.
  mla: Goudarzi, Samira, et al. “A Context-Aware Dimension Reduction Framework for
    Trajectory and Health Signal Analyses.” <i>Journal of Ambient Intelligence and
    Humanized Computing</i>, vol. 13, Springer Nature, 2022, pp. 2621–2635, doi:<a
    href="https://doi.org/10.1007/s12652-021-03569-z">10.1007/s12652-021-03569-z</a>.
  short: S. Goudarzi, M. Sharif, F. Karimipour, Journal of Ambient Intelligence and
    Humanized Computing 13 (2022) 2621–2635.
date_created: 2021-11-02T09:28:55Z
date_published: 2022-05-01T00:00:00Z
date_updated: 2023-08-02T13:31:48Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1007/s12652-021-03569-z
external_id:
  isi:
  - '000712198000001'
file:
- access_level: open_access
  checksum: 0a8961416a9bb2be5a1cebda65468bcf
  content_type: application/pdf
  creator: fkarimip
  date_created: 2021-11-12T19:38:05Z
  date_updated: 2022-12-20T23:30:08Z
  embargo: 2022-11-12
  file_id: '10279'
  file_name: A Context‑aware Dimension Reduction Framework - Journal of Ambient Intelligence
    2021 (Preprint version).pdf
  file_size: 1634958
  relation: main_file
file_date_updated: 2022-12-20T23:30:08Z
has_accepted_license: '1'
intvolume: '        13'
isi: 1
keyword:
- general computer science
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 2621–2635
project:
- _id: 268116B8-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z00342
  name: The Wittgenstein Prize
publication: Journal of Ambient Intelligence and Humanized Computing
publication_identifier:
  eissn:
  - 1868-5145
  issn:
  - 1868-5137
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: A context-aware dimension reduction framework for trajectory and health signal
  analyses
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 13
year: '2022'
...
---
_id: '10284'
abstract:
- lang: eng
  text: Infections early in life can have enduring effects on an organism's development
    and immunity. In this study, we show that this equally applies to developing ‘superorganisms’––incipient
    social insect colonies. When we exposed newly mated Lasius niger ant queens to
    a low pathogen dose, their colonies grew more slowly than controls before winter,
    but reached similar sizes afterwards. Independent of exposure, queen hibernation
    survival improved when the ratio of pupae to workers was small. Queens that reared
    fewer pupae before worker emergence exhibited lower pathogen levels, indicating
    that high brood rearing efforts interfere with the ability of the queen's immune
    system to suppress pathogen proliferation. Early-life queen pathogen exposure
    also improved the immunocompetence of her worker offspring, as demonstrated by
    challenging the workers to the same pathogen a year later. Transgenerational transfer
    of the queen's pathogen experience to her workforce can hence durably reduce the
    disease susceptibility of the whole superorganism.
acknowledged_ssus:
- _id: ScienComp
acknowledgement: The authors are grateful to G. Tkačik and V. Mireles for advice on
  data analyses and to A. Schloegl for help using the IST Austria HPC cluster for
  data processing. The authors thank J. Eilenberg for providing the fungal strain
  and A.V. Grasse for support with the molecular analysis. The authors also thank
  the Social Immunity group at IST Austria, in particular B. Milutinović, for discussions
  throughout and comments on the manuscript.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Barbara E
  full_name: Casillas Perez, Barbara E
  id: 351ED2AA-F248-11E8-B48F-1D18A9856A87
  last_name: Casillas Perez
- first_name: Christopher
  full_name: Pull, Christopher
  id: 3C7F4840-F248-11E8-B48F-1D18A9856A87
  last_name: Pull
  orcid: 0000-0003-1122-3982
- first_name: Filip
  full_name: Naiser, Filip
  last_name: Naiser
- first_name: Elisabeth
  full_name: Naderlinger, Elisabeth
  id: 31757262-F248-11E8-B48F-1D18A9856A87
  last_name: Naderlinger
- first_name: Jiri
  full_name: Matas, Jiri
  last_name: Matas
- first_name: Sylvia
  full_name: Cremer, Sylvia
  id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
  last_name: Cremer
  orcid: 0000-0002-2193-3868
citation:
  ama: Casillas Perez BE, Pull C, Naiser F, Naderlinger E, Matas J, Cremer S. Early
    queen infection shapes developmental dynamics and induces long-term disease protection
    in incipient ant colonies. <i>Ecology Letters</i>. 2022;25(1):89-100. doi:<a href="https://doi.org/10.1111/ele.13907">10.1111/ele.13907</a>
  apa: Casillas Perez, B. E., Pull, C., Naiser, F., Naderlinger, E., Matas, J., &#38;
    Cremer, S. (2022). Early queen infection shapes developmental dynamics and induces
    long-term disease protection in incipient ant colonies. <i>Ecology Letters</i>.
    Wiley. <a href="https://doi.org/10.1111/ele.13907">https://doi.org/10.1111/ele.13907</a>
  chicago: Casillas Perez, Barbara E, Christopher Pull, Filip Naiser, Elisabeth Naderlinger,
    Jiri Matas, and Sylvia Cremer. “Early Queen Infection Shapes Developmental Dynamics
    and Induces Long-Term Disease Protection in Incipient Ant Colonies.” <i>Ecology
    Letters</i>. Wiley, 2022. <a href="https://doi.org/10.1111/ele.13907">https://doi.org/10.1111/ele.13907</a>.
  ieee: B. E. Casillas Perez, C. Pull, F. Naiser, E. Naderlinger, J. Matas, and S.
    Cremer, “Early queen infection shapes developmental dynamics and induces long-term
    disease protection in incipient ant colonies,” <i>Ecology Letters</i>, vol. 25,
    no. 1. Wiley, pp. 89–100, 2022.
  ista: Casillas Perez BE, Pull C, Naiser F, Naderlinger E, Matas J, Cremer S. 2022.
    Early queen infection shapes developmental dynamics and induces long-term disease
    protection in incipient ant colonies. Ecology Letters. 25(1), 89–100.
  mla: Casillas Perez, Barbara E., et al. “Early Queen Infection Shapes Developmental
    Dynamics and Induces Long-Term Disease Protection in Incipient Ant Colonies.”
    <i>Ecology Letters</i>, vol. 25, no. 1, Wiley, 2022, pp. 89–100, doi:<a href="https://doi.org/10.1111/ele.13907">10.1111/ele.13907</a>.
  short: B.E. Casillas Perez, C. Pull, F. Naiser, E. Naderlinger, J. Matas, S. Cremer,
    Ecology Letters 25 (2022) 89–100.
date_created: 2021-11-14T23:01:25Z
date_published: 2022-01-01T00:00:00Z
date_updated: 2023-08-14T11:45:29Z
day: '01'
ddc:
- '573'
department:
- _id: SyCr
doi: 10.1111/ele.13907
ec_funded: 1
external_id:
  isi:
  - '000713396100001'
  pmid:
  - '34725912'
file:
- access_level: open_access
  checksum: 0bd4210400e9876609b7c538ab4f9a3c
  content_type: application/pdf
  creator: cchlebak
  date_created: 2022-02-03T13:37:11Z
  date_updated: 2022-02-03T13:37:11Z
  file_id: '10721'
  file_name: 2021_EcologyLetters_CasillasPerez.pdf
  file_size: 700087
  relation: main_file
  success: 1
file_date_updated: 2022-02-03T13:37:11Z
has_accepted_license: '1'
intvolume: '        25'
isi: 1
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 89-100
pmid: 1
project:
- _id: 2649B4DE-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '771402'
  name: Epidemics in ant societies on a chip
publication: Ecology Letters
publication_identifier:
  eissn:
  - 1461-0248
  issn:
  - 1461-023X
publication_status: published
publisher: Wiley
quality_controlled: '1'
related_material:
  record:
  - id: '13061'
    relation: research_data
    status: public
scopus_import: '1'
status: public
title: Early queen infection shapes developmental dynamics and induces long-term disease
  protection in incipient ant colonies
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 25
year: '2022'
...
---
_id: '10335'
abstract:
- lang: eng
  text: "Van der Holst and Pendavingh introduced a graph parameter σ, which coincides
    with the more famous Colin de Verdière graph parameter μ for small values. However,
    the definition of a is much more geometric/topological directly reflecting embeddability
    properties of the graph. They proved μ(G) ≤ σ(G) + 2 and conjectured σ(G) ≤ σ(G)
    for any graph G. We confirm this conjecture. As far as we know, this is the first
    topological upper bound on σ(G) which is, in general, tight.\r\nEquality between
    μ and σ does not hold in general as van der Holst and Pendavingh showed that there
    is a graph G with μ(G) ≤ 18 and σ(G) ≥ 20. We show that the gap appears at much
    smaller values, namely, we exhibit a graph H for which μ(H) ≥ 7 and σ(H) ≥ 8.
    We also prove that, in general, the gap can be large: The incidence graphs Hq
    of finite projective planes of order q satisfy μ(Hq) ∈ O(q3/2) and σ(Hq) ≥ q2."
acknowledgement: 'V. K. gratefully acknowledges the support of Austrian Science Fund
  (FWF): P 30902-N35. This work was done mostly while he was employed at the University
  of Innsbruck. During the early stage of this research, V. K. was partially supported
  by Charles University project GAUK 926416. M. T. is supported by the grant no. 19-04113Y
  of the Czech Science Foundation(GA ˇCR) and partially supported by Charles University
  project UNCE/SCI/004.'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Vojtech
  full_name: Kaluza, Vojtech
  id: 21AE5134-9EAC-11EA-BEA2-D7BD3DDC885E
  last_name: Kaluza
  orcid: 0000-0002-2512-8698
- first_name: Martin
  full_name: Tancer, Martin
  id: 38AC689C-F248-11E8-B48F-1D18A9856A87
  last_name: Tancer
  orcid: 0000-0002-1191-6714
citation:
  ama: Kaluza V, Tancer M. Even maps, the Colin de Verdière number and representations
    of graphs. <i>Combinatorica</i>. 2022;42:1317-1345. doi:<a href="https://doi.org/10.1007/s00493-021-4443-7">10.1007/s00493-021-4443-7</a>
  apa: Kaluza, V., &#38; Tancer, M. (2022). Even maps, the Colin de Verdière number
    and representations of graphs. <i>Combinatorica</i>. Springer Nature. <a href="https://doi.org/10.1007/s00493-021-4443-7">https://doi.org/10.1007/s00493-021-4443-7</a>
  chicago: Kaluza, Vojtech, and Martin Tancer. “Even Maps, the Colin de Verdière Number
    and Representations of Graphs.” <i>Combinatorica</i>. Springer Nature, 2022. <a
    href="https://doi.org/10.1007/s00493-021-4443-7">https://doi.org/10.1007/s00493-021-4443-7</a>.
  ieee: V. Kaluza and M. Tancer, “Even maps, the Colin de Verdière number and representations
    of graphs,” <i>Combinatorica</i>, vol. 42. Springer Nature, pp. 1317–1345, 2022.
  ista: Kaluza V, Tancer M. 2022. Even maps, the Colin de Verdière number and representations
    of graphs. Combinatorica. 42, 1317–1345.
  mla: Kaluza, Vojtech, and Martin Tancer. “Even Maps, the Colin de Verdière Number
    and Representations of Graphs.” <i>Combinatorica</i>, vol. 42, Springer Nature,
    2022, pp. 1317–45, doi:<a href="https://doi.org/10.1007/s00493-021-4443-7">10.1007/s00493-021-4443-7</a>.
  short: V. Kaluza, M. Tancer, Combinatorica 42 (2022) 1317–1345.
date_created: 2021-11-25T13:49:16Z
date_published: 2022-12-01T00:00:00Z
date_updated: 2023-08-02T06:43:27Z
day: '01'
ddc:
- '514'
- '516'
department:
- _id: UlWa
doi: 10.1007/s00493-021-4443-7
external_id:
  arxiv:
  - '1907.05055'
  isi:
  - '000798210100003'
intvolume: '        42'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: ' https://doi.org/10.48550/arXiv.1907.05055'
month: '12'
oa: 1
oa_version: Preprint
page: 1317-1345
publication: Combinatorica
publication_identifier:
  issn:
  - 0209-9683
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Even maps, the Colin de Verdière number and representations of graphs
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 42
year: '2022'
...
---
_id: '10364'
abstract:
- lang: eng
  text: 'This paper characterizes the latency of the simplified successive-cancellation
    (SSC) decoding scheme for polar codes under hardware resource constraints. In
    particular, when the number of processing elements P that can perform SSC decoding
    operations in parallel is limited, as is the case in practice, the latency of
    SSC decoding is O(N1-1/μ + N/P log2 log2 N/P), where N is the block length of
    the code and μ is the scaling exponent of the channel. Three direct consequences
    of this bound are presented. First, in a fully-parallel implementation where P
    = N/2, the latency of SSC decoding is O(N1-1/μ), which is sublinear in the block
    length. This recovers a result from our earlier work. Second, in a fully-serial
    implementation where P = 1, the latency of SSC decoding scales as O(N log2 log2
    N). The multiplicative constant is also calculated: we show that the latency of
    SSC decoding when P = 1 is given by (2 + o(1))N log2 log2 N. Third, in a semi-parallel
    implementation, the smallest P that gives the same latency as that of the fully-parallel
    implementation is P = N1/μ. The tightness of our bound on SSC decoding latency
    and the applicability of the foregoing results is validated through extensive
    simulations.'
acknowledgement: "S. A. Hashemi is supported by a Postdoctoral Fellowship from the
  Natural Sciences and\r\nEngineering Research Council of Canada (NSERC) and by Huawei.
  M. Mondelli is partially\r\nsupported by the 2019 Lopez-Loreta Prize. A. Fazeli
  and A. Vardy were supported in part by\r\nthe National Science Foundation under
  Grant CCF-1764104."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Seyyed Ali
  full_name: Hashemi, Seyyed Ali
  last_name: Hashemi
- first_name: Marco
  full_name: Mondelli, Marco
  id: 27EB676C-8706-11E9-9510-7717E6697425
  last_name: Mondelli
  orcid: 0000-0002-3242-7020
- first_name: Arman
  full_name: Fazeli, Arman
  last_name: Fazeli
- first_name: Alexander
  full_name: Vardy, Alexander
  last_name: Vardy
- first_name: John
  full_name: Cioffi, John
  last_name: Cioffi
- first_name: Andrea
  full_name: Goldsmith, Andrea
  last_name: Goldsmith
citation:
  ama: Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. Parallelism
    versus latency in simplified successive-cancellation decoding of polar codes.
    <i>IEEE Transactions on Wireless Communications</i>. 2022;21(6):3909-3920. doi:<a
    href="https://doi.org/10.1109/TWC.2021.3125626">10.1109/TWC.2021.3125626</a>
  apa: Hashemi, S. A., Mondelli, M., Fazeli, A., Vardy, A., Cioffi, J., &#38; Goldsmith,
    A. (2022). Parallelism versus latency in simplified successive-cancellation decoding
    of polar codes. <i>IEEE Transactions on Wireless Communications</i>. Institute
    of Electrical and Electronics Engineers. <a href="https://doi.org/10.1109/TWC.2021.3125626">https://doi.org/10.1109/TWC.2021.3125626</a>
  chicago: Hashemi, Seyyed Ali, Marco Mondelli, Arman Fazeli, Alexander Vardy, John
    Cioffi, and Andrea Goldsmith. “Parallelism versus Latency in Simplified Successive-Cancellation
    Decoding of Polar Codes.” <i>IEEE Transactions on Wireless Communications</i>.
    Institute of Electrical and Electronics Engineers, 2022. <a href="https://doi.org/10.1109/TWC.2021.3125626">https://doi.org/10.1109/TWC.2021.3125626</a>.
  ieee: S. A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, and A. Goldsmith,
    “Parallelism versus latency in simplified successive-cancellation decoding of
    polar codes,” <i>IEEE Transactions on Wireless Communications</i>, vol. 21, no.
    6. Institute of Electrical and Electronics Engineers, pp. 3909–3920, 2022.
  ista: Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. 2022. Parallelism
    versus latency in simplified successive-cancellation decoding of polar codes.
    IEEE Transactions on Wireless Communications. 21(6), 3909–3920.
  mla: Hashemi, Seyyed Ali, et al. “Parallelism versus Latency in Simplified Successive-Cancellation
    Decoding of Polar Codes.” <i>IEEE Transactions on Wireless Communications</i>,
    vol. 21, no. 6, Institute of Electrical and Electronics Engineers, 2022, pp. 3909–20,
    doi:<a href="https://doi.org/10.1109/TWC.2021.3125626">10.1109/TWC.2021.3125626</a>.
  short: S.A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, A. Goldsmith,
    IEEE Transactions on Wireless Communications 21 (2022) 3909–3920.
date_created: 2021-11-28T23:01:29Z
date_published: 2022-06-01T00:00:00Z
date_updated: 2024-09-10T13:03:18Z
day: '01'
department:
- _id: MaMo
doi: 10.1109/TWC.2021.3125626
external_id:
  arxiv:
  - '2012.13378'
  isi:
  - '000809406400028'
intvolume: '        21'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2012.13378
month: '06'
oa: 1
oa_version: Preprint
page: 3909-3920
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
  name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: IEEE Transactions on Wireless Communications
publication_identifier:
  eissn:
  - 1558-2248
  issn:
  - 1536-1276
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
related_material:
  record:
  - id: '10053'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: Parallelism versus latency in simplified successive-cancellation decoding of
  polar codes
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 21
year: '2022'
...
---
_id: '10411'
abstract:
- lang: eng
  text: The phytohormone auxin is the major growth regulator governing tropic responses
    including gravitropism. Auxin build-up at the lower side of stimulated shoots
    promotes cell expansion, whereas in roots it inhibits growth, leading to upward
    shoot bending and downward root bending, respectively. Yet it remains an enigma
    how the same signal can trigger such opposite cellular responses. In this review,
    we discuss several recent unexpected insights into the mechanisms underlying auxin
    regulation of growth, challenging several existing models. We focus on the divergent
    mechanisms of apoplastic pH regulation in shoots and roots revisiting the classical
    Acid Growth Theory and discuss coordinated involvement of multiple auxin signaling
    pathways. From this emerges a more comprehensive, updated picture how auxin regulates
    growth.
acknowledgement: The authors thank Alexandra Mally for editing the text. This work
  was supported by the Austrian Science Fund (FWF) I 3630-B25 to Jiří Friml and the
  DOC Fellowship of the Austrian Academy of Sciences to Lanxin Li. All figures were
  created with BioRender.com.
article_processing_charge: No
article_type: original
author:
- first_name: Lanxin
  full_name: Li, Lanxin
  id: 367EF8FA-F248-11E8-B48F-1D18A9856A87
  last_name: Li
  orcid: 0000-0002-5607-272X
- first_name: Michelle C
  full_name: Gallei, Michelle C
  id: 35A03822-F248-11E8-B48F-1D18A9856A87
  last_name: Gallei
  orcid: 0000-0003-1286-7368
- first_name: Jiří
  full_name: Friml, Jiří
  id: 4159519E-F248-11E8-B48F-1D18A9856A87
  last_name: Friml
  orcid: 0000-0002-8302-7596
citation:
  ama: 'Li L, Gallei MC, Friml J. Bending to auxin: Fast acid growth for tropisms.
    <i>Trends in Plant Science</i>. 2022;27(5):440-449. doi:<a href="https://doi.org/10.1016/j.tplants.2021.11.006">10.1016/j.tplants.2021.11.006</a>'
  apa: 'Li, L., Gallei, M. C., &#38; Friml, J. (2022). Bending to auxin: Fast acid
    growth for tropisms. <i>Trends in Plant Science</i>. Cell Press. <a href="https://doi.org/10.1016/j.tplants.2021.11.006">https://doi.org/10.1016/j.tplants.2021.11.006</a>'
  chicago: 'Li, Lanxin, Michelle C Gallei, and Jiří Friml. “Bending to Auxin: Fast
    Acid Growth for Tropisms.” <i>Trends in Plant Science</i>. Cell Press, 2022. <a
    href="https://doi.org/10.1016/j.tplants.2021.11.006">https://doi.org/10.1016/j.tplants.2021.11.006</a>.'
  ieee: 'L. Li, M. C. Gallei, and J. Friml, “Bending to auxin: Fast acid growth for
    tropisms,” <i>Trends in Plant Science</i>, vol. 27, no. 5. Cell Press, pp. 440–449,
    2022.'
  ista: 'Li L, Gallei MC, Friml J. 2022. Bending to auxin: Fast acid growth for tropisms.
    Trends in Plant Science. 27(5), 440–449.'
  mla: 'Li, Lanxin, et al. “Bending to Auxin: Fast Acid Growth for Tropisms.” <i>Trends
    in Plant Science</i>, vol. 27, no. 5, Cell Press, 2022, pp. 440–49, doi:<a href="https://doi.org/10.1016/j.tplants.2021.11.006">10.1016/j.tplants.2021.11.006</a>.'
  short: L. Li, M.C. Gallei, J. Friml, Trends in Plant Science 27 (2022) 440–449.
date_created: 2021-12-05T23:01:43Z
date_published: 2022-05-01T00:00:00Z
date_updated: 2024-10-29T10:12:33Z
day: '01'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.1016/j.tplants.2021.11.006
external_id:
  isi:
  - '000793707900005'
  pmid:
  - '34848141'
file:
- access_level: open_access
  checksum: 3d94980ee1ff6bec100dd813f6a921a6
  content_type: application/pdf
  creator: amally
  date_created: 2023-11-02T17:00:03Z
  date_updated: 2023-11-02T17:00:03Z
  file_id: '14480'
  file_name: Li Plants 2021_accepted.pdf
  file_size: 805779
  relation: main_file
  success: 1
file_date_updated: 2023-11-02T17:00:03Z
has_accepted_license: '1'
intvolume: '        27'
isi: 1
issue: '5'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 440-449
pmid: 1
project:
- _id: 26538374-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: I03630
  name: Molecular mechanisms of endocytic cargo recognition in plants
- _id: 26B4D67E-B435-11E9-9278-68D0E5697425
  grant_number: '25351'
  name: 'A Case Study of Plant Growth Regulation: Molecular Mechanism of Auxin-mediated
    Rapid Growth Inhibition in Arabidopsis Root'
publication: Trends in Plant Science
publication_identifier:
  issn:
  - 1360-1385
publication_status: published
publisher: Cell Press
quality_controlled: '1'
related_material:
  record:
  - id: '11626'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: 'Bending to auxin: Fast acid growth for tropisms'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 27
year: '2022'
...
