---
_id: '11842'
abstract:
- lang: eng
  text: We consider the flow of two viscous and incompressible fluids within a bounded
    domain modeled by means of a two-phase Navier–Stokes system. The two fluids are
    assumed to be immiscible, meaning that they are separated by an interface. With
    respect to the motion of the interface, we consider pure transport by the fluid
    flow. Along the boundary of the domain, a complete slip boundary condition for
    the fluid velocities and a constant ninety degree contact angle condition for
    the interface are assumed. In the present work, we devise for the resulting evolution
    problem a suitable weak solution concept based on the framework of varifolds and
    establish as the main result a weak-strong uniqueness principle in 2D. The proof
    is based on a relative entropy argument and requires a non-trivial further development
    of ideas from the recent work of Fischer and the first author (Arch. Ration. Mech.
    Anal. 236, 2020) to incorporate the contact angle condition. To focus on the effects
    of the necessarily singular geometry of the evolving fluid domains, we work for
    simplicity in the regime of same viscosities for the two fluids.
acknowledgement: The authors warmly thank their former resp. current PhD advisor Julian
  Fischer for the suggestion of this problem and for valuable initial discussions
  on the subjects of this paper. This project has received funding from the European
  Research Council (ERC) under the European Union’s Horizon 2020 research and innovation
  programme (grant agreement No 948819) , and from the Deutsche Forschungsgemeinschaft
  (DFG, German Research Foundation) under Germany’s Excellence Strategy – EXC-2047/1
  – 390685813.
article_number: '93'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Sebastian
  full_name: Hensel, Sebastian
  id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87
  last_name: Hensel
  orcid: 0000-0001-7252-8072
- first_name: Alice
  full_name: Marveggio, Alice
  id: 25647992-AA84-11E9-9D75-8427E6697425
  last_name: Marveggio
citation:
  ama: Hensel S, Marveggio A. Weak-strong uniqueness for the Navier–Stokes equation
    for two fluids with ninety degree contact angle and same viscosities. <i>Journal
    of Mathematical Fluid Mechanics</i>. 2022;24(3). doi:<a href="https://doi.org/10.1007/s00021-022-00722-2">10.1007/s00021-022-00722-2</a>
  apa: Hensel, S., &#38; Marveggio, A. (2022). Weak-strong uniqueness for the Navier–Stokes
    equation for two fluids with ninety degree contact angle and same viscosities.
    <i>Journal of Mathematical Fluid Mechanics</i>. Springer Nature. <a href="https://doi.org/10.1007/s00021-022-00722-2">https://doi.org/10.1007/s00021-022-00722-2</a>
  chicago: Hensel, Sebastian, and Alice Marveggio. “Weak-Strong Uniqueness for the
    Navier–Stokes Equation for Two Fluids with Ninety Degree Contact Angle and Same
    Viscosities.” <i>Journal of Mathematical Fluid Mechanics</i>. Springer Nature,
    2022. <a href="https://doi.org/10.1007/s00021-022-00722-2">https://doi.org/10.1007/s00021-022-00722-2</a>.
  ieee: S. Hensel and A. Marveggio, “Weak-strong uniqueness for the Navier–Stokes
    equation for two fluids with ninety degree contact angle and same viscosities,”
    <i>Journal of Mathematical Fluid Mechanics</i>, vol. 24, no. 3. Springer Nature,
    2022.
  ista: Hensel S, Marveggio A. 2022. Weak-strong uniqueness for the Navier–Stokes
    equation for two fluids with ninety degree contact angle and same viscosities.
    Journal of Mathematical Fluid Mechanics. 24(3), 93.
  mla: Hensel, Sebastian, and Alice Marveggio. “Weak-Strong Uniqueness for the Navier–Stokes
    Equation for Two Fluids with Ninety Degree Contact Angle and Same Viscosities.”
    <i>Journal of Mathematical Fluid Mechanics</i>, vol. 24, no. 3, 93, Springer Nature,
    2022, doi:<a href="https://doi.org/10.1007/s00021-022-00722-2">10.1007/s00021-022-00722-2</a>.
  short: S. Hensel, A. Marveggio, Journal of Mathematical Fluid Mechanics 24 (2022).
corr_author: '1'
date_created: 2022-08-14T22:01:45Z
date_published: 2022-08-01T00:00:00Z
date_updated: 2026-04-07T13:28:13Z
day: '01'
ddc:
- '510'
department:
- _id: JuFi
doi: 10.1007/s00021-022-00722-2
ec_funded: 1
external_id:
  arxiv:
  - '2112.11154'
  isi:
  - '000834834300001'
file:
- access_level: open_access
  checksum: 75c5f286300e6f0539cf57b4dba108d5
  content_type: application/pdf
  creator: cchlebak
  date_created: 2022-08-16T06:55:22Z
  date_updated: 2022-08-16T06:55:22Z
  file_id: '11848'
  file_name: 2022_JMathFluidMech_Hensel.pdf
  file_size: 2045570
  relation: main_file
  success: 1
file_date_updated: 2022-08-16T06:55:22Z
fulldoi: https://doi.org/10.1007/s00021-022-00722-2
has_accepted_license: '1'
intvolume: '        24'
isi: 1
issue: '3'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 0aa76401-070f-11eb-9043-b5bb049fa26d
  call_identifier: H2020
  grant_number: '948819'
  name: Bridging Scales in Random Materials
publication: Journal of Mathematical Fluid Mechanics
publication_identifier:
  eissn:
  - 1422-6952
  issn:
  - 1422-6928
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  record:
  - id: '14587'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Weak-strong uniqueness for the Navier–Stokes equation for two fluids with ninety
  degree contact angle and same viscosities
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: 24
year: '2022'
...
---
_id: '11844'
abstract:
- lang: eng
  text: "In the stochastic population protocol model, we are given a connected graph
    with n nodes, and in every time step, a scheduler samples an edge of the graph
    uniformly at random and the nodes connected by this edge interact. A fundamental
    task in this model is stable leader election, in which all nodes start in an identical
    state and the aim is to reach a configuration in which (1) exactly one node is
    elected as leader and (2) this node remains as the unique leader no matter what
    sequence of interactions follows. On cliques, the complexity of this problem has
    recently been settled: time-optimal protocols stabilize in Θ(n log n) expected
    steps using Θ(log log n) states, whereas protocols that use O(1) states require
    Θ(n2) expected steps.\r\n\r\nIn this work, we investigate the complexity of stable
    leader election on general graphs. We provide the first non-trivial time lower
    bounds for leader election on general graphs, showing that, when moving beyond
    cliques, the complexity landscape of leader election becomes very diverse: the
    time required to elect a leader can range from O(1) to Θ(n3) expected steps. On
    the upper bound side, we first observe that there exists a protocol that is time-optimal
    on many graph families, but uses polynomially-many states. In contrast, we give
    a near-time-optimal protocol that uses only O(log2n) states that is at most a
    factor log n slower. Finally, we show that the constant-state protocol of Beauquier
    et al. [OPODIS 2013] is at most a factor n log n slower than the fast polynomial-state
    protocol. Moreover, among constant-state protocols, this protocol has near-optimal
    average case complexity on dense random graphs."
acknowledgement: We thank the anonymous reviewers for their helpful comments. We gratefully
  acknowledge funding from the European Research Council (ERC) under the European
  Union’s Horizon 2020 research and innovation programme (grant agreement No 805223
  ScaleML).
article_processing_charge: Yes (via OA deal)
arxiv: 1
author:
- first_name: Dan-Adrian
  full_name: Alistarh, Dan-Adrian
  id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
  last_name: Alistarh
  orcid: 0000-0003-3650-940X
- first_name: Joel
  full_name: Rybicki, Joel
  id: 334EFD2E-F248-11E8-B48F-1D18A9856A87
  last_name: Rybicki
  orcid: 0000-0002-6432-6646
- first_name: Sasha
  full_name: Voitovych, Sasha
  last_name: Voitovych
citation:
  ama: 'Alistarh D-A, Rybicki J, Voitovych S. Near-optimal leader election in population
    protocols on graphs. In: <i>Proceedings of the Annual ACM Symposium on Principles
    of Distributed Computing</i>. Association for Computing Machinery; 2022:246-256.
    doi:<a href="https://doi.org/10.1145/3519270.3538435">10.1145/3519270.3538435</a>'
  apa: 'Alistarh, D.-A., Rybicki, J., &#38; Voitovych, S. (2022). Near-optimal leader
    election in population protocols on graphs. In <i>Proceedings of the Annual ACM
    Symposium on Principles of Distributed Computing</i> (pp. 246–256). Salerno, Italy:
    Association for Computing Machinery. <a href="https://doi.org/10.1145/3519270.3538435">https://doi.org/10.1145/3519270.3538435</a>'
  chicago: Alistarh, Dan-Adrian, Joel Rybicki, and Sasha Voitovych. “Near-Optimal
    Leader Election in Population Protocols on Graphs.” In <i>Proceedings of the Annual
    ACM Symposium on Principles of Distributed Computing</i>, 246–56. Association
    for Computing Machinery, 2022. <a href="https://doi.org/10.1145/3519270.3538435">https://doi.org/10.1145/3519270.3538435</a>.
  ieee: D.-A. Alistarh, J. Rybicki, and S. Voitovych, “Near-optimal leader election
    in population protocols on graphs,” in <i>Proceedings of the Annual ACM Symposium
    on Principles of Distributed Computing</i>, Salerno, Italy, 2022, pp. 246–256.
  ista: 'Alistarh D-A, Rybicki J, Voitovych S. 2022. Near-optimal leader election
    in population protocols on graphs. Proceedings of the Annual ACM Symposium on
    Principles of Distributed Computing. PODC: Symposium on Principles of Distributed
    Computing, 246–256.'
  mla: Alistarh, Dan-Adrian, et al. “Near-Optimal Leader Election in Population Protocols
    on Graphs.” <i>Proceedings of the Annual ACM Symposium on Principles of Distributed
    Computing</i>, Association for Computing Machinery, 2022, pp. 246–56, doi:<a href="https://doi.org/10.1145/3519270.3538435">10.1145/3519270.3538435</a>.
  short: D.-A. Alistarh, J. Rybicki, S. Voitovych, in:, Proceedings of the Annual
    ACM Symposium on Principles of Distributed Computing, Association for Computing
    Machinery, 2022, pp. 246–256.
conference:
  end_date: 2022-07-29
  location: Salerno, Italy
  name: 'PODC: Symposium on Principles of Distributed Computing'
  start_date: 2022-07-25
corr_author: '1'
date_created: 2022-08-14T22:01:46Z
date_published: 2022-07-21T00:00:00Z
date_updated: 2025-12-30T09:04:17Z
day: '21'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.1145/3519270.3538435
ec_funded: 1
external_id:
  arxiv:
  - '2205.12597'
  isi:
  - '001031439100030'
file:
- access_level: open_access
  checksum: 4c6b29172b8e355b4fbc364a2e0827b2
  content_type: application/pdf
  creator: cchlebak
  date_created: 2022-08-16T08:05:15Z
  date_updated: 2022-08-16T08:05:15Z
  file_id: '11854'
  file_name: 2022_PODC_Alistarh.pdf
  file_size: 1593474
  relation: main_file
  success: 1
file_date_updated: 2022-08-16T08:05:15Z
fulldoi: https://doi.org/10.1145/3519270.3538435
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 246-256
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '805223'
  name: Elastic Coordination for Scalable Machine Learning
publication: Proceedings of the Annual ACM Symposium on Principles of Distributed
  Computing
publication_identifier:
  isbn:
  - '9781450392624'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
  record:
  - id: '19969'
    relation: later_version
    status: public
scopus_import: '1'
status: public
title: Near-optimal leader election in population protocols on graphs
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2022'
...
---
_id: '11858'
abstract:
- lang: eng
  text: "This paper is a continuation of Part I of this project, where we developed
    a new local well-posedness theory for nonlinear stochastic PDEs with Gaussian
    noise. In the current Part II we consider blow-up criteria and regularization
    phenomena. As in Part I we can allow nonlinearities with polynomial growth and
    rough initial values from critical spaces. In the first main result we obtain
    several new blow-up criteria for quasi- and semilinear stochastic evolution equations.
    In particular, for semilinear equations we obtain a Serrin type blow-up criterium,
    which extends a recent result of Prüss–Simonett–Wilke (J Differ Equ 264(3):2028–2074,
    2018) to the stochastic setting. Blow-up criteria can be used to prove global
    well-posedness for SPDEs. As in Part I, maximal regularity techniques and weights
    in time play a central role in the proofs. Our second contribution is a new method
    to bootstrap Sobolev and Hölder regularity in time and space, which does not require
    smoothness of the initial data. The blow-up criteria are at the basis of these
    new methods. Moreover, in applications the bootstrap results can be combined with
    our blow-up criteria, to obtain efficient ways to prove global existence. This
    gives new results even in classical \U0001D43F2-settings, which we illustrate
    for a concrete SPDE. In future works in preparation we apply the results of the
    current paper to obtain global well-posedness results and regularity for several
    concrete SPDEs. These include stochastic Navier–Stokes equations, reaction– diffusion
    equations and the Allen–Cahn equation. Our setting allows to put these SPDEs into
    a more flexible framework, where less restrictions on the nonlinearities are needed,
    and we are able to treat rough initial values from critical spaces. Moreover,
    we will obtain higher-order regularity results."
acknowledgement: "The authors thank Emiel Lorist for helpful comments. The authors
  thank the anonymous referees for their helpful remarks to improve the presentation.\r\nOpen
  access funding provided by Institute of Science and Technology (IST Austria)."
article_number: '56'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Antonio
  full_name: Agresti, Antonio
  id: 673cd0cc-9b9a-11eb-b144-88f30e1fbb72
  last_name: Agresti
  orcid: 0000-0002-9573-2962
- first_name: Mark
  full_name: Veraar, Mark
  last_name: Veraar
citation:
  ama: Agresti A, Veraar M. Nonlinear parabolic stochastic evolution equations in
    critical spaces part II. <i>Journal of Evolution Equations</i>. 2022;22(2). doi:<a
    href="https://doi.org/10.1007/s00028-022-00786-7">10.1007/s00028-022-00786-7</a>
  apa: Agresti, A., &#38; Veraar, M. (2022). Nonlinear parabolic stochastic evolution
    equations in critical spaces part II. <i>Journal of Evolution Equations</i>. Springer
    Nature. <a href="https://doi.org/10.1007/s00028-022-00786-7">https://doi.org/10.1007/s00028-022-00786-7</a>
  chicago: Agresti, Antonio, and Mark Veraar. “Nonlinear Parabolic Stochastic Evolution
    Equations in Critical Spaces Part II.” <i>Journal of Evolution Equations</i>.
    Springer Nature, 2022. <a href="https://doi.org/10.1007/s00028-022-00786-7">https://doi.org/10.1007/s00028-022-00786-7</a>.
  ieee: A. Agresti and M. Veraar, “Nonlinear parabolic stochastic evolution equations
    in critical spaces part II,” <i>Journal of Evolution Equations</i>, vol. 22, no.
    2. Springer Nature, 2022.
  ista: Agresti A, Veraar M. 2022. Nonlinear parabolic stochastic evolution equations
    in critical spaces part II. Journal of Evolution Equations. 22(2), 56.
  mla: Agresti, Antonio, and Mark Veraar. “Nonlinear Parabolic Stochastic Evolution
    Equations in Critical Spaces Part II.” <i>Journal of Evolution Equations</i>,
    vol. 22, no. 2, 56, Springer Nature, 2022, doi:<a href="https://doi.org/10.1007/s00028-022-00786-7">10.1007/s00028-022-00786-7</a>.
  short: A. Agresti, M. Veraar, Journal of Evolution Equations 22 (2022).
corr_author: '1'
date_created: 2022-08-16T08:39:43Z
date_published: 2022-06-01T00:00:00Z
date_updated: 2024-10-09T21:03:06Z
day: '01'
ddc:
- '510'
department:
- _id: JuFi
doi: 10.1007/s00028-022-00786-7
external_id:
  isi:
  - '000809108500001'
file:
- access_level: open_access
  checksum: 59b99d1b48b6bd40983e7ce298524a21
  content_type: application/pdf
  creator: kschuh
  date_created: 2022-08-16T08:52:46Z
  date_updated: 2022-08-16T08:52:46Z
  file_id: '11862'
  file_name: 2022_Journal of Evolution Equations_Agresti.pdf
  file_size: 1758371
  relation: main_file
  success: 1
file_date_updated: 2022-08-16T08:52:46Z
fulldoi: https://doi.org/10.1007/s00028-022-00786-7
has_accepted_license: '1'
intvolume: '        22'
isi: 1
issue: '2'
keyword:
- Mathematics (miscellaneous)
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: Journal of Evolution Equations
publication_identifier:
  eissn:
  - 1424-3202
  issn:
  - 1424-3199
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nonlinear parabolic stochastic evolution equations in critical spaces part
  II
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 22
year: '2022'
...
---
_id: '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. <i>Advances in Operator
    Theory</i>. 2022;7(3). doi:<a href="https://doi.org/10.1007/s43036-022-00199-w">10.1007/s43036-022-00199-w</a>
  apa: Wirth, M. (2022). Kac regularity and domination of quadratic forms. <i>Advances
    in Operator Theory</i>. Springer Nature. <a href="https://doi.org/10.1007/s43036-022-00199-w">https://doi.org/10.1007/s43036-022-00199-w</a>
  chicago: Wirth, Melchior. “Kac Regularity and Domination of Quadratic Forms.” <i>Advances
    in Operator Theory</i>. Springer Nature, 2022. <a href="https://doi.org/10.1007/s43036-022-00199-w">https://doi.org/10.1007/s43036-022-00199-w</a>.
  ieee: M. Wirth, “Kac regularity and domination of quadratic forms,” <i>Advances
    in Operator Theory</i>, 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.” <i>Advances
    in Operator Theory</i>, vol. 7, no. 3, 38, Springer Nature, 2022, doi:<a href="https://doi.org/10.1007/s43036-022-00199-w">10.1007/s43036-022-00199-w</a>.
  short: M. Wirth, Advances in Operator Theory 7 (2022).
corr_author: '1'
date_created: 2022-08-18T07:22:24Z
date_published: 2022-07-01T00:00:00Z
date_updated: 2024-10-09T21:03: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
fulldoi: https://doi.org/10.1007/s43036-022-00199-w
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: '11917'
abstract:
- lang: eng
  text: We study the many-body dynamics of an initially factorized bosonic wave function
    in the mean-field regime. We prove large deviation estimates for the fluctuations
    around the condensate. We derive an upper bound extending a recent result to more
    general interactions. Furthermore, we derive a new lower bound which agrees with
    the upper bound in leading order.
acknowledgement: "The authors thank Gérard Ben Arous for pointing out the question
  of a lower bound. Funding from the European Union’s Horizon 2020 research and innovation
  programme under the ERC Grant Agreement No. 694227 (R.S.) and under the Marie Skłodowska-Curie
  Grant Agreement No. 754411 (S.R.) is gratefully acknowledged.\r\nOpen access funding
  provided by IST Austria."
article_number: '9'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Simone Anna Elvira
  full_name: Rademacher, Simone Anna Elvira
  id: 856966FE-A408-11E9-977E-802DE6697425
  last_name: Rademacher
  orcid: 0000-0001-5059-4466
- first_name: Robert
  full_name: Seiringer, Robert
  id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
  last_name: Seiringer
  orcid: 0000-0002-6781-0521
citation:
  ama: Rademacher SAE, Seiringer R. Large deviation estimates for weakly interacting
    bosons. <i>Journal of Statistical Physics</i>. 2022;188. doi:<a href="https://doi.org/10.1007/s10955-022-02940-4">10.1007/s10955-022-02940-4</a>
  apa: Rademacher, S. A. E., &#38; Seiringer, R. (2022). Large deviation estimates
    for weakly interacting bosons. <i>Journal of Statistical Physics</i>. Springer
    Nature. <a href="https://doi.org/10.1007/s10955-022-02940-4">https://doi.org/10.1007/s10955-022-02940-4</a>
  chicago: Rademacher, Simone Anna Elvira, and Robert Seiringer. “Large Deviation
    Estimates for Weakly Interacting Bosons.” <i>Journal of Statistical Physics</i>.
    Springer Nature, 2022. <a href="https://doi.org/10.1007/s10955-022-02940-4">https://doi.org/10.1007/s10955-022-02940-4</a>.
  ieee: S. A. E. Rademacher and R. Seiringer, “Large deviation estimates for weakly
    interacting bosons,” <i>Journal of Statistical Physics</i>, vol. 188. Springer
    Nature, 2022.
  ista: Rademacher SAE, Seiringer R. 2022. Large deviation estimates for weakly interacting
    bosons. Journal of Statistical Physics. 188, 9.
  mla: Rademacher, Simone Anna Elvira, and Robert Seiringer. “Large Deviation Estimates
    for Weakly Interacting Bosons.” <i>Journal of Statistical Physics</i>, vol. 188,
    9, Springer Nature, 2022, doi:<a href="https://doi.org/10.1007/s10955-022-02940-4">10.1007/s10955-022-02940-4</a>.
  short: S.A.E. Rademacher, R. Seiringer, Journal of Statistical Physics 188 (2022).
corr_author: '1'
date_created: 2022-08-18T07:23:26Z
date_published: 2022-07-01T00:00:00Z
date_updated: 2025-04-14T07:26:59Z
day: '01'
ddc:
- '510'
department:
- _id: RoSe
doi: 10.1007/s10955-022-02940-4
ec_funded: 1
external_id:
  isi:
  - '000805175000001'
file:
- access_level: open_access
  checksum: 44418cb44f07fa21ed3907f85abf7f39
  content_type: application/pdf
  creator: dernst
  date_created: 2022-08-18T08:09:00Z
  date_updated: 2022-08-18T08:09:00Z
  file_id: '11922'
  file_name: 2022_JournalStatisticalPhysics_Rademacher.pdf
  file_size: 483481
  relation: main_file
  success: 1
file_date_updated: 2022-08-18T08:09:00Z
fulldoi: https://doi.org/10.1007/s10955-022-02940-4
has_accepted_license: '1'
intvolume: '       188'
isi: 1
keyword:
- Mathematical Physics
- Statistical and Nonlinear Physics
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '694227'
  name: Analysis of quantum many-body systems
- _id: 260C2330-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '754411'
  name: ISTplus - Postdoctoral Fellowships
publication: Journal of Statistical Physics
publication_identifier:
  eissn:
  - 1572-9613
  issn:
  - 0022-4715
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Large deviation estimates for weakly interacting bosons
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: 188
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
arxiv: 1
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.
    <i>Journal of Graph Algorithms and Applications</i>. 2022;26(2):225-240. doi:<a
    href="https://doi.org/10.7155/jgaa.00591">10.7155/jgaa.00591</a>
  apa: Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D.,
    Pilz, A., … Vogtenhuber, B. (2022). On compatible matchings. <i>Journal of Graph
    Algorithms and Applications</i>. Brown University. <a href="https://doi.org/10.7155/jgaa.00591">https://doi.org/10.7155/jgaa.00591</a>
  chicago: Aichholzer, Oswin, Alan M Arroyo Guevara, Zuzana Masárová, Irene Parada,
    Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. “On Compatible
    Matchings.” <i>Journal of Graph Algorithms and Applications</i>. Brown University,
    2022. <a href="https://doi.org/10.7155/jgaa.00591">https://doi.org/10.7155/jgaa.00591</a>.
  ieee: O. Aichholzer <i>et al.</i>, “On compatible matchings,” <i>Journal of Graph
    Algorithms and Applications</i>, 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.” <i>Journal of Graph Algorithms
    and Applications</i>, vol. 26, no. 2, Brown University, 2022, pp. 225–40, doi:<a
    href="https://doi.org/10.7155/jgaa.00591">10.7155/jgaa.00591</a>.
  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.
corr_author: '1'
date_created: 2022-08-21T22:01:56Z
date_published: 2022-06-01T00:00:00Z
date_updated: 2026-04-16T09:18:20Z
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
fulldoi: https://doi.org/10.7155/jgaa.00591
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: Mathematics, Computer Science
- _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'
...
---
OA_place: publisher
_id: '11945'
abstract:
- lang: eng
  text: "G protein-coupled receptors (GPCRs) respond to specific ligands and regulate
    multiple processes ranging from cell growth and immune responses to neuronal signal
    transmission. However, ligands for many GPCRs remain unknown, suffer from off-target
    effects or have poor bioavailability. Additional challenges exist to dissect cell-type
    specific responses when the same GPCR is expressed on several cell types within
    the body. Here, we overcome these limitations by engineering DREADD-based GPCR
    chimeras that selectively bind their agonist clozapine-N-oxide (CNO) and mimic
    a GPCR-of-interest in a desired cell type.\r\nWe validated our approach with β2-adrenergic
    receptor (β2AR/ADRB2) and show that our chimeric DREADD-β2AR triggers comparable
    responses on second messenger and kinase activity, post-translational modifications,
    and protein-protein interactions. Since β2AR is also enriched in microglia, which
    can drive inflammation in the central nervous system, we expressed chimeric DREADD-β2AR
    in primary microglia and successfully recapitulate β2AR-mediated filopodia formation
    through CNO stimulation. To dissect the role of selected GPCRs during microglial
    inflammation, we additionally generated DREADD-based chimeras for microglia-enriched
    GPR65 and GPR109A/HCAR2. In a microglia cell line, DREADD-β2AR and DREADD-GPR65
    both modulated the inflammatory response with a similar profile as endogenously
    expressed β2AR, while DREADD-GPR109A showed no impact.\r\nOur DREADD-based approach
    provides the means to obtain mechanistic and functional insights into GPCR signaling
    on a cell-type specific level."
acknowledged_ssus:
- _id: Bio
- _id: PreCl
- _id: LifeSc
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Rouven
  full_name: Schulz, Rouven
  id: 4C5E7B96-F248-11E8-B48F-1D18A9856A87
  last_name: Schulz
  orcid: 0000-0001-5297-733X
citation:
  ama: Schulz R. Chimeric G protein-coupled receptors mimic distinct signaling pathways
    and modulate microglia function. 2022. doi:<a href="https://doi.org/10.15479/at:ista:11945">10.15479/at:ista:11945</a>
  apa: Schulz, R. (2022). <i>Chimeric G protein-coupled receptors mimic distinct signaling
    pathways and modulate microglia function</i>. Institute of Science and Technology
    Austria. <a href="https://doi.org/10.15479/at:ista:11945">https://doi.org/10.15479/at:ista:11945</a>
  chicago: Schulz, Rouven. “Chimeric G Protein-Coupled Receptors Mimic Distinct Signaling
    Pathways and Modulate Microglia Function.” Institute of Science and Technology
    Austria, 2022. <a href="https://doi.org/10.15479/at:ista:11945">https://doi.org/10.15479/at:ista:11945</a>.
  ieee: R. Schulz, “Chimeric G protein-coupled receptors mimic distinct signaling
    pathways and modulate microglia function,” Institute of Science and Technology
    Austria, 2022.
  ista: Schulz R. 2022. Chimeric G protein-coupled receptors mimic distinct signaling
    pathways and modulate microglia function. Institute of Science and Technology
    Austria.
  mla: Schulz, Rouven. <i>Chimeric G Protein-Coupled Receptors Mimic Distinct Signaling
    Pathways and Modulate Microglia Function</i>. Institute of Science and Technology
    Austria, 2022, doi:<a href="https://doi.org/10.15479/at:ista:11945">10.15479/at:ista:11945</a>.
  short: R. Schulz, Chimeric G Protein-Coupled Receptors Mimic Distinct Signaling
    Pathways and Modulate Microglia Function, Institute of Science and Technology
    Austria, 2022.
corr_author: '1'
date_created: 2022-08-23T11:33:11Z
date_published: 2022-08-23T00:00:00Z
date_updated: 2026-04-07T14:17:59Z
day: '23'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: GradSch
- _id: SaSi
doi: 10.15479/at:ista:11945
file:
- access_level: open_access
  checksum: 61b1b666a210ff7cdd0e95ea75207a13
  content_type: application/pdf
  creator: rschulz
  date_created: 2022-08-25T08:59:57Z
  date_updated: 2022-08-25T08:59:57Z
  file_id: '11970'
  file_name: Thesis_Rouven_Schulz_2022_final.pdf
  file_size: 28079331
  relation: main_file
  success: 1
- access_level: closed
  checksum: 2b8f95ea1c134dbdb927b41b1dbeeeb5
  content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
  creator: rschulz
  date_created: 2022-08-25T09:00:11Z
  date_updated: 2022-08-25T09:33:31Z
  file_id: '11971'
  file_name: Thesis_Rouven_Schulz_2022_final.docx
  file_size: 27226963
  relation: source_file
file_date_updated: 2022-08-25T09:33:31Z
fulldoi: https://doi.org/10.15479/at:ista:11945
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: '133'
project:
- _id: 267F75D8-B435-11E9-9278-68D0E5697425
  name: Modulating microglia through G protein-coupled receptor (GPCR) signaling
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
  record:
  - id: '11995'
    relation: dissertation_contains
    status: public
status: public
supervisor:
- first_name: Sandra
  full_name: Siegert, Sandra
  id: 36ACD32E-F248-11E8-B48F-1D18A9856A87
  last_name: Siegert
  orcid: 0000-0001-8635-0877
title: Chimeric G protein-coupled receptors mimic distinct signaling pathways and
  modulate microglia function
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2022'
...
---
_id: '11951'
abstract:
- lang: eng
  text: The mammalian hippocampal formation (HF) plays a key role in several higher
    brain functions, such as spatial coding, learning and memory. Its simple circuit
    architecture is often viewed as a trisynaptic loop, processing input originating
    from the superficial layers of the entorhinal cortex (EC) and sending it back
    to its deeper layers. Here, we show that excitatory neurons in layer 6b of the
    mouse EC project to all sub-regions comprising the HF and receive input from the
    CA1, thalamus and claustrum. Furthermore, their output is characterized by unique
    slow-decaying excitatory postsynaptic currents capable of driving plateau-like
    potentials in their postsynaptic targets. Optogenetic inhibition of the EC-6b
    pathway affects spatial coding in CA1 pyramidal neurons, while cell ablation impairs
    not only acquisition of new spatial memories, but also degradation of previously
    acquired ones. Our results provide evidence of a functional role for cortical
    layer 6b neurons in the adult brain.
acknowledged_ssus:
- _id: Bio
- _id: SSU
acknowledgement: We thank F. Marr and A. Schlögl for technical assistance, E. Kralli-Beller
  for manuscript editing, as well as C. Sommer and the Imaging and Optics Facility
  of the Institute of Science and Technology Austria (ISTA) for image analysis scripts
  and microscopy support. We extend our gratitude to J. Wallenschus and D. Rangel
  Guerrero for technical assistance acquiring single-unit data and I. Gridchyn for
  help with single-unit clustering. Finally, we also thank B. Suter for discussions,
  A. Saunders, M. Jösch, and H. Monyer for critically reading earlier versions of
  the manuscript, C. Petersen for sharing clearing protocols, and the Scientific Service
  Units of ISTA for efficient support. This project was funded by the European Research
  Council (ERC) under the European Union’s Horizon 2020 research and innovation programme
  (ERC advanced grant No 692692 to P.J.) and the Fond zur Förderung der Wissenschaftlichen
  Forschung (Z 312-B27, Wittgenstein award for P.J. and I3600-B27 for J.G.D. and P.V.).
article_number: '4826'
article_processing_charge: No
article_type: original
author:
- first_name: Yoav
  full_name: Ben Simon, Yoav
  id: 43DF3136-F248-11E8-B48F-1D18A9856A87
  last_name: Ben Simon
- first_name: Karola
  full_name: Käfer, Karola
  id: 2DAA49AA-F248-11E8-B48F-1D18A9856A87
  last_name: Käfer
- first_name: Philipp
  full_name: Velicky, Philipp
  id: 39BDC62C-F248-11E8-B48F-1D18A9856A87
  last_name: Velicky
  orcid: 0000-0002-2340-7431
- first_name: Jozsef L
  full_name: Csicsvari, Jozsef L
  id: 3FA14672-F248-11E8-B48F-1D18A9856A87
  last_name: Csicsvari
  orcid: 0000-0002-5193-4036
- first_name: Johann G
  full_name: Danzl, Johann G
  id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
  last_name: Danzl
  orcid: 0000-0001-8559-3973
- first_name: Peter M
  full_name: Jonas, Peter M
  id: 353C1B58-F248-11E8-B48F-1D18A9856A87
  last_name: Jonas
  orcid: 0000-0001-5001-4804
citation:
  ama: Ben Simon Y, Käfer K, Velicky P, Csicsvari JL, Danzl JG, Jonas PM. A direct
    excitatory projection from entorhinal layer 6b neurons to the hippocampus contributes
    to spatial coding and memory. <i>Nature Communications</i>. 2022;13. doi:<a href="https://doi.org/10.1038/s41467-022-32559-8">10.1038/s41467-022-32559-8</a>
  apa: Ben Simon, Y., Käfer, K., Velicky, P., Csicsvari, J. L., Danzl, J. G., &#38;
    Jonas, P. M. (2022). A direct excitatory projection from entorhinal layer 6b neurons
    to the hippocampus contributes to spatial coding and memory. <i>Nature Communications</i>.
    Springer Nature. <a href="https://doi.org/10.1038/s41467-022-32559-8">https://doi.org/10.1038/s41467-022-32559-8</a>
  chicago: Ben Simon, Yoav, Karola Käfer, Philipp Velicky, Jozsef L Csicsvari, Johann
    G Danzl, and Peter M Jonas. “A Direct Excitatory Projection from Entorhinal Layer
    6b Neurons to the Hippocampus Contributes to Spatial Coding and Memory.” <i>Nature
    Communications</i>. Springer Nature, 2022. <a href="https://doi.org/10.1038/s41467-022-32559-8">https://doi.org/10.1038/s41467-022-32559-8</a>.
  ieee: Y. Ben Simon, K. Käfer, P. Velicky, J. L. Csicsvari, J. G. Danzl, and P. M.
    Jonas, “A direct excitatory projection from entorhinal layer 6b neurons to the
    hippocampus contributes to spatial coding and memory,” <i>Nature Communications</i>,
    vol. 13. Springer Nature, 2022.
  ista: Ben Simon Y, Käfer K, Velicky P, Csicsvari JL, Danzl JG, Jonas PM. 2022. A
    direct excitatory projection from entorhinal layer 6b neurons to the hippocampus
    contributes to spatial coding and memory. Nature Communications. 13, 4826.
  mla: Ben Simon, Yoav, et al. “A Direct Excitatory Projection from Entorhinal Layer
    6b Neurons to the Hippocampus Contributes to Spatial Coding and Memory.” <i>Nature
    Communications</i>, vol. 13, 4826, Springer Nature, 2022, doi:<a href="https://doi.org/10.1038/s41467-022-32559-8">10.1038/s41467-022-32559-8</a>.
  short: Y. Ben Simon, K. Käfer, P. Velicky, J.L. Csicsvari, J.G. Danzl, P.M. Jonas,
    Nature Communications 13 (2022).
corr_author: '1'
date_created: 2022-08-24T08:25:50Z
date_published: 2022-08-16T00:00:00Z
date_updated: 2025-06-12T06:10:44Z
day: '16'
ddc:
- '570'
department:
- _id: JoCs
- _id: PeJo
- _id: JoDa
doi: 10.1038/s41467-022-32559-8
ec_funded: 1
external_id:
  isi:
  - '000841396400008'
  pmid:
  - '35974109'
file:
- access_level: open_access
  checksum: 405936d9e4d33625d80c093c9713a91f
  content_type: application/pdf
  creator: dernst
  date_created: 2022-08-26T11:51:40Z
  date_updated: 2022-08-26T11:51:40Z
  file_id: '11990'
  file_name: 2022_NatureCommunications_BenSimon.pdf
  file_size: 5910357
  relation: main_file
  success: 1
file_date_updated: 2022-08-26T11:51:40Z
fulldoi: https://doi.org/10.1038/s41467-022-32559-8
has_accepted_license: '1'
intvolume: '        13'
isi: 1
keyword:
- General Physics and Astronomy
- General Biochemistry
- Genetics and Molecular Biology
- General Chemistry
- Multidisciplinary
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 25B7EB9E-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '692692'
  name: Biophysics and circuit function of a giant cortical glutamatergic synapse
- _id: 265CB4D0-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: I03600
  name: Optical control of synaptic function via adhesion molecules
- _id: 25C5A090-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z00312
  name: Synaptic communication in neuronal microcircuits
publication: Nature Communications
publication_identifier:
  issn:
  - 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: A direct excitatory projection from entorhinal layer 6b neurons to the hippocampus
  contributes to spatial coding and memory
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: 13
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
arxiv: 1
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.
    <i>ACM SIGLOG News</i>. 2022;9(3):30-59. doi:<a href="https://doi.org/10.1145/3559736.3559740">10.1145/3559736.3559740</a>
  apa: Krokhin, A., &#38; Opršal, J. (2022). An invitation to the promise constraint
    satisfaction problem. <i>ACM SIGLOG News</i>. Association for Computing Machinery.
    <a href="https://doi.org/10.1145/3559736.3559740">https://doi.org/10.1145/3559736.3559740</a>
  chicago: Krokhin, Andrei, and Jakub Opršal. “An Invitation to the Promise Constraint
    Satisfaction Problem.” <i>ACM SIGLOG News</i>. Association for Computing Machinery,
    2022. <a href="https://doi.org/10.1145/3559736.3559740">https://doi.org/10.1145/3559736.3559740</a>.
  ieee: A. Krokhin and J. Opršal, “An invitation to the promise constraint satisfaction
    problem,” <i>ACM SIGLOG News</i>, 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.” <i>ACM SIGLOG News</i>, vol. 9, no. 3, Association for
    Computing Machinery, 2022, pp. 30–59, doi:<a href="https://doi.org/10.1145/3559736.3559740">10.1145/3559736.3559740</a>.
  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'
fulldoi: https://doi.org/10.1145/3559736.3559740
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: '11993'
abstract:
- lang: eng
  text: Moulding refers to a set of manufacturing techniques in which a mould, usually
    a cavity or a solid frame, is used to shape a liquid or pliable material into
    an object of the desired shape. The popularity of moulding comes from its effectiveness,
    scalability and versatility in terms of employed materials. Its relevance as a
    fabrication process is demonstrated by the extensive literature covering different
    aspects related to mould design, from material flow simulation to the automation
    of mould geometry design. In this state-of-the-art report, we provide an extensive
    review of the automatic methods for the design of moulds, focusing on contributions
    from a geometric perspective. We classify existing mould design methods based
    on their computational approach and the nature of their target moulding process.
    We summarize the relationships between computational approaches and moulding techniques,
    highlighting their strengths and limitations. Finally, we discuss potential future
    research directions.
article_processing_charge: No
article_type: original
author:
- first_name: Thomas
  full_name: Alderighi, Thomas
  last_name: Alderighi
- first_name: Luigi
  full_name: Malomo, Luigi
  last_name: Malomo
- first_name: Thomas
  full_name: Auzinger, Thomas
  id: 4718F954-F248-11E8-B48F-1D18A9856A87
  last_name: Auzinger
  orcid: 0000-0002-1546-3265
- first_name: Bernd
  full_name: Bickel, Bernd
  id: 49876194-F248-11E8-B48F-1D18A9856A87
  last_name: Bickel
  orcid: 0000-0001-6511-9385
- first_name: Paulo
  full_name: Cignoni, Paulo
  last_name: Cignoni
- first_name: Nico
  full_name: Pietroni, Nico
  last_name: Pietroni
citation:
  ama: Alderighi T, Malomo L, Auzinger T, Bickel B, Cignoni P, Pietroni N. State of
    the art in computational mould design. <i>Computer Graphics Forum</i>. 2022;41(6):435-452.
    doi:<a href="https://doi.org/10.1111/cgf.14581">10.1111/cgf.14581</a>
  apa: Alderighi, T., Malomo, L., Auzinger, T., Bickel, B., Cignoni, P., &#38; Pietroni,
    N. (2022). State of the art in computational mould design. <i>Computer Graphics
    Forum</i>. Wiley. <a href="https://doi.org/10.1111/cgf.14581">https://doi.org/10.1111/cgf.14581</a>
  chicago: Alderighi, Thomas, Luigi Malomo, Thomas Auzinger, Bernd Bickel, Paulo Cignoni,
    and Nico Pietroni. “State of the Art in Computational Mould Design.” <i>Computer
    Graphics Forum</i>. Wiley, 2022. <a href="https://doi.org/10.1111/cgf.14581">https://doi.org/10.1111/cgf.14581</a>.
  ieee: T. Alderighi, L. Malomo, T. Auzinger, B. Bickel, P. Cignoni, and N. Pietroni,
    “State of the art in computational mould design,” <i>Computer Graphics Forum</i>,
    vol. 41, no. 6. Wiley, pp. 435–452, 2022.
  ista: Alderighi T, Malomo L, Auzinger T, Bickel B, Cignoni P, Pietroni N. 2022.
    State of the art in computational mould design. Computer Graphics Forum. 41(6),
    435–452.
  mla: Alderighi, Thomas, et al. “State of the Art in Computational Mould Design.”
    <i>Computer Graphics Forum</i>, vol. 41, no. 6, Wiley, 2022, pp. 435–52, doi:<a
    href="https://doi.org/10.1111/cgf.14581">10.1111/cgf.14581</a>.
  short: T. Alderighi, L. Malomo, T. Auzinger, B. Bickel, P. Cignoni, N. Pietroni,
    Computer Graphics Forum 41 (2022) 435–452.
corr_author: '1'
date_created: 2022-08-28T18:17:01Z
date_published: 2022-09-01T00:00:00Z
date_updated: 2024-10-09T21:03:21Z
day: '01'
ddc:
- '000'
department:
- _id: BeBi
doi: 10.1111/cgf.14581
external_id:
  isi:
  - '000842638900001'
file:
- access_level: open_access
  checksum: c40cc8ceb7b7f0512172b883d712198e
  content_type: application/pdf
  creator: bbickel
  date_created: 2022-08-28T18:18:08Z
  date_updated: 2022-08-28T18:18:08Z
  description: 'This is the pre-peer reviewed version of the following article: Alderighi,
    T., Malomo, L., Auzinger, T., Bickel, B., Cignoni, P. and Pietroni, N. (2022),
    State of the Art in Computational Mould Design. Computer Graphics Forum, which
    has been published in final form at https://doi.org/10.1111/cgf.14581. This article
    may be used for non-commercial purposes in accordance with Wiley Terms and Conditions
    for Use of Self-Archived Versions.'
  file_id: '11994'
  file_name: star_molding_preprint.pdf
  file_size: 32480850
  relation: main_file
  title: pre-peer reviewed version
file_date_updated: 2022-08-28T18:18:08Z
fulldoi: https://doi.org/10.1111/cgf.14581
has_accepted_license: '1'
intvolume: '        41'
isi: 1
issue: '6'
keyword:
- Computer Graphics and Computer-Aided Design
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 435-452
publication: Computer Graphics Forum
publication_identifier:
  eissn:
  - 1467-8659
  issn:
  - 0167-7055
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: State of the art in computational mould design
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 41
year: '2022'
...
---
_id: '11995'
abstract:
- lang: eng
  text: G protein-coupled receptors (GPCRs) regulate processes ranging from immune
    responses to neuronal signaling. However, ligands for many GPCRs remain unknown,
    suffer from off-target effects or have poor bioavailability. Additionally, dissecting
    cell type-specific responses is challenging when the same GPCR is expressed on
    different cells within a tissue. Here, we overcome these limitations by engineering
    DREADD-based GPCR chimeras that bind clozapine-N-oxide and mimic a GPCR-of-interest.
    We show that chimeric DREADD-β2AR triggers responses comparable to β2AR on second
    messenger and kinase activity, post-translational modifications, and protein-protein
    interactions. Moreover, we successfully recapitulate β2AR-mediated filopodia formation
    in microglia, an immune cell capable of driving central nervous system inflammation.
    When dissecting microglial inflammation, we included two additional DREADD-based
    chimeras mimicking microglia-enriched GPR65 and GPR109A. DREADD-β2AR and DREADD-GPR65
    modulate the inflammatory response with high similarity to endogenous β2AR, while
    DREADD-GPR109A shows no impact. Our DREADD-based approach allows investigation
    of cell type-dependent pathways without known endogenous ligands.
acknowledged_ssus:
- _id: PreCl
- _id: Bio
- _id: LifeSc
acknowledgement: The authors thank the Scientific Service Units at ISTA, in particular
  the Molecular Biology Service of the Lab Support Facility, Imaging & Optics Facility,
  and the Preclinical Facility, and the Novarino group, Harald Janoviak, and Marco
  Benevento for sharing reagents and expertise. This research was supported by a DOC
  Fellowship (24979) awarded to R.S. by the Austrian Academy of Sciences.
article_number: '4728'
article_processing_charge: No
article_type: original
author:
- first_name: Rouven
  full_name: Schulz, Rouven
  id: 4C5E7B96-F248-11E8-B48F-1D18A9856A87
  last_name: Schulz
  orcid: 0000-0001-5297-733X
- first_name: Medina
  full_name: Korkut, Medina
  id: 4B51CE74-F248-11E8-B48F-1D18A9856A87
  last_name: Korkut
  orcid: 0000-0003-4309-2251
- first_name: Alessandro
  full_name: Venturino, Alessandro
  id: 41CB84B2-F248-11E8-B48F-1D18A9856A87
  last_name: Venturino
  orcid: 0000-0003-2356-9403
- first_name: Gloria
  full_name: Colombo, Gloria
  id: 3483CF6C-F248-11E8-B48F-1D18A9856A87
  last_name: Colombo
  orcid: 0000-0001-9434-8902
- first_name: Sandra
  full_name: Siegert, Sandra
  id: 36ACD32E-F248-11E8-B48F-1D18A9856A87
  last_name: Siegert
  orcid: 0000-0001-8635-0877
citation:
  ama: Schulz R, Korkut M, Venturino A, Colombo G, Siegert S. Chimeric GPCRs mimic
    distinct signaling pathways and modulate microglia responses. <i>Nature Communications</i>.
    2022;13. doi:<a href="https://doi.org/10.1038/s41467-022-32390-1">10.1038/s41467-022-32390-1</a>
  apa: Schulz, R., Korkut, M., Venturino, A., Colombo, G., &#38; Siegert, S. (2022).
    Chimeric GPCRs mimic distinct signaling pathways and modulate microglia responses.
    <i>Nature Communications</i>. Springer Nature. <a href="https://doi.org/10.1038/s41467-022-32390-1">https://doi.org/10.1038/s41467-022-32390-1</a>
  chicago: Schulz, Rouven, Medina Korkut, Alessandro Venturino, Gloria Colombo, and
    Sandra Siegert. “Chimeric GPCRs Mimic Distinct Signaling Pathways and Modulate
    Microglia Responses.” <i>Nature Communications</i>. Springer Nature, 2022. <a
    href="https://doi.org/10.1038/s41467-022-32390-1">https://doi.org/10.1038/s41467-022-32390-1</a>.
  ieee: R. Schulz, M. Korkut, A. Venturino, G. Colombo, and S. Siegert, “Chimeric
    GPCRs mimic distinct signaling pathways and modulate microglia responses,” <i>Nature
    Communications</i>, vol. 13. Springer Nature, 2022.
  ista: Schulz R, Korkut M, Venturino A, Colombo G, Siegert S. 2022. Chimeric GPCRs
    mimic distinct signaling pathways and modulate microglia responses. Nature Communications.
    13, 4728.
  mla: Schulz, Rouven, et al. “Chimeric GPCRs Mimic Distinct Signaling Pathways and
    Modulate Microglia Responses.” <i>Nature Communications</i>, vol. 13, 4728, Springer
    Nature, 2022, doi:<a href="https://doi.org/10.1038/s41467-022-32390-1">10.1038/s41467-022-32390-1</a>.
  short: R. Schulz, M. Korkut, A. Venturino, G. Colombo, S. Siegert, Nature Communications
    13 (2022).
corr_author: '1'
date_created: 2022-08-28T22:01:59Z
date_published: 2022-08-15T00:00:00Z
date_updated: 2026-04-07T14:17:58Z
day: '15'
ddc:
- '570'
department:
- _id: SaSi
doi: 10.1038/s41467-022-32390-1
external_id:
  isi:
  - '000840984400032'
  pmid:
  - '35970889'
file:
- access_level: open_access
  checksum: 191d9db0266e14a28d3a56dc7f65da84
  content_type: application/pdf
  creator: cchlebak
  date_created: 2022-08-29T06:44:30Z
  date_updated: 2022-08-29T06:44:30Z
  file_id: '12002'
  file_name: 2022_NatComm_Schulz.pdf
  file_size: 7317396
  relation: main_file
  success: 1
file_date_updated: 2022-08-29T06:44:30Z
fulldoi: https://doi.org/10.1038/s41467-022-32390-1
has_accepted_license: '1'
intvolume: '        13'
isi: 1
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 267F75D8-B435-11E9-9278-68D0E5697425
  name: Modulating microglia through G protein-coupled receptor (GPCR) signaling
publication: Nature Communications
publication_identifier:
  eissn:
  - 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  link:
  - description: News on ISTA website
    relation: press_release
    url: https://ista.ac.at/en/news/dreaddful-mimicry/
  record:
  - id: '11542'
    relation: research_data
    status: public
  - id: '11945'
    relation: part_of_dissertation
    status: public
scopus_import: '1'
status: public
title: Chimeric GPCRs mimic distinct signaling pathways and modulate microglia responses
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: 13
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. <i>Science</i>. 2022;377(6607):710-711.
    doi:<a href="https://doi.org/10.1126/science.adc9202">10.1126/science.adc9202</a>
  apa: Palacci, J. A. (2022). A soft active matter that can climb walls. <i>Science</i>.
    American Association for the Advancement of Science. <a href="https://doi.org/10.1126/science.adc9202">https://doi.org/10.1126/science.adc9202</a>
  chicago: Palacci, Jérémie A. “A Soft Active Matter That Can Climb Walls.” <i>Science</i>.
    American Association for the Advancement of Science, 2022. <a href="https://doi.org/10.1126/science.adc9202">https://doi.org/10.1126/science.adc9202</a>.
  ieee: J. A. Palacci, “A soft active matter that can climb walls,” <i>Science</i>,
    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.” <i>Science</i>,
    vol. 377, no. 6607, American Association for the Advancement of Science, 2022,
    pp. 710–11, doi:<a href="https://doi.org/10.1126/science.adc9202">10.1126/science.adc9202</a>.
  short: J.A. Palacci, Science 377 (2022) 710–711.
corr_author: '1'
date_created: 2022-08-28T22:02:00Z
date_published: 2022-08-12T00:00:00Z
date_updated: 2024-10-09T21:03:21Z
day: '12'
department:
- _id: JePa
doi: 10.1126/science.adc9202
external_id:
  pmid:
  - '35951689 '
fulldoi: https://doi.org/10.1126/science.adc9202
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: '11997'
abstract:
- lang: eng
  text: "We study the fate of an impurity in an ultracold heteronuclear Bose mixture,
    focusing on the experimentally relevant case of a ⁴¹K - ⁸⁷Rb mixture, with the
    impurity in a ⁴¹K hyperfine state. Our paper provides a comprehensive description
    of an impurity in a BEC mixture with contact interactions across its phase diagram.
    We present results for the miscible and immiscible regimes, as well as for the
    impurity in a self-bound quantum droplet. Here, varying the interactions, we find
    exotic states where the impurity localizes either at the center or\r\nat the surface
    of the droplet. "
acknowledgement: We thank A. Simoni for providing the calculations of the intercomponent
  scattering lengths. We gratefully acknowledge stimulating discussions with L. A.
  Peña Ardila, R. Schmidt, H. Silva, V. Zampronio, and M. Prevedelli for careful reading.
  G.B. acknowledges support from the Austrian Science Fund (FWF) under Project No.
  M2641-N27. T.M. acknowledges CNPq for support through Bolsa de produtividade em
  Pesquisa No. 311079/2015-6. This work is supported by the Deutsche Forschungsgemeinschaft
  (DFG, German Research Foundation) under Germany's Excellence Strategy No. EXC2181/1-390900948
  (the Heidelberg STRUCTURES Excellence Cluster). This work was supported by the Serrapilheira
  Institute (Grant No. Serra-1812-27802). We thank the High-Performance Computing
  Center (NPAD) at UFRN for providing computational resources.
article_number: '023301'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Giacomo
  full_name: Bighin, Giacomo
  id: 4CA96FD4-F248-11E8-B48F-1D18A9856A87
  last_name: Bighin
  orcid: 0000-0001-8823-9777
- first_name: A.
  full_name: Burchianti, A.
  last_name: Burchianti
- first_name: F.
  full_name: Minardi, F.
  last_name: Minardi
- first_name: T.
  full_name: Macrì, T.
  last_name: Macrì
citation:
  ama: Bighin G, Burchianti A, Minardi F, Macrì T. Impurity in a heteronuclear two-component
    Bose mixture. <i>Physical Review A</i>. 2022;106(2). doi:<a href="https://doi.org/10.1103/PhysRevA.106.023301">10.1103/PhysRevA.106.023301</a>
  apa: Bighin, G., Burchianti, A., Minardi, F., &#38; Macrì, T. (2022). Impurity in
    a heteronuclear two-component Bose mixture. <i>Physical Review A</i>. American
    Physical Society. <a href="https://doi.org/10.1103/PhysRevA.106.023301">https://doi.org/10.1103/PhysRevA.106.023301</a>
  chicago: Bighin, Giacomo, A. Burchianti, F. Minardi, and T. Macrì. “Impurity in
    a Heteronuclear Two-Component Bose Mixture.” <i>Physical Review A</i>. American
    Physical Society, 2022. <a href="https://doi.org/10.1103/PhysRevA.106.023301">https://doi.org/10.1103/PhysRevA.106.023301</a>.
  ieee: G. Bighin, A. Burchianti, F. Minardi, and T. Macrì, “Impurity in a heteronuclear
    two-component Bose mixture,” <i>Physical Review A</i>, vol. 106, no. 2. American
    Physical Society, 2022.
  ista: Bighin G, Burchianti A, Minardi F, Macrì T. 2022. Impurity in a heteronuclear
    two-component Bose mixture. Physical Review A. 106(2), 023301.
  mla: Bighin, Giacomo, et al. “Impurity in a Heteronuclear Two-Component Bose Mixture.”
    <i>Physical Review A</i>, vol. 106, no. 2, 023301, American Physical Society,
    2022, doi:<a href="https://doi.org/10.1103/PhysRevA.106.023301">10.1103/PhysRevA.106.023301</a>.
  short: G. Bighin, A. Burchianti, F. Minardi, T. Macrì, Physical Review A 106 (2022).
date_created: 2022-08-28T22:02:00Z
date_published: 2022-08-04T00:00:00Z
date_updated: 2025-04-14T08:57:11Z
day: '04'
department:
- _id: MiLe
doi: 10.1103/PhysRevA.106.023301
external_id:
  arxiv:
  - '2109.07451'
  isi:
  - '000837953600006'
fulldoi: https://doi.org/10.1103/PhysRevA.106.023301
intvolume: '       106'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2109.07451
month: '08'
oa: 1
oa_version: Preprint
project:
- _id: 26986C82-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: M02641
  name: A path-integral approach to composite impurities
publication: Physical Review A
publication_identifier:
  eissn:
  - 2469-9934
  issn:
  - 2469-9926
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Impurity in a heteronuclear two-component Bose mixture
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 106
year: '2022'
...
---
_id: '11998'
abstract:
- lang: eng
  text: Recently it became possible to study highly excited rotational states of molecules
    in superfluid helium through nonadiabatic alignment experiments (Cherepanov et
    al 2021 Phys. Rev. A 104 L061303). This calls for theoretical approaches that
    go beyond explaining renormalized values of molecular spectroscopic constants,
    which suffices when only the lowest few rotational states are involved. As the
    first step in this direction, here we present a basic quantum mechanical model
    describing highly excited rotational states of molecules in superfluid helium
    nanodroplets. We show that a linear molecule immersed in a superfluid can be seen
    as an effective symmetric top, similar to the rotational structure of radicals,
    such as OH or NO, but with the angular momentum of the superfluid playing the
    role of the electronic angular momentum in free molecules. The simple theory sheds
    light onto what happens when the rotational angular momentum of the molecule increases
    beyond the lowest excited states accessible by infrared spectroscopy. In addition,
    the model allows to estimate the effective rotational and centrifugal distortion
    constants for a broad range of species and to explain the crossover between light
    and heavy molecules in superfluid 4He in terms of the many-body wavefunction structure.
    Some of the above mentioned insights can be acquired by analyzing a simple 2 ×
    2 matrix.
acknowledgement: IC acknowledges the support by the European Union's Horizon 2020
  research and innovation programme under the Marie Skłodowska-Curie Grant Agreement
  No. 665385. GB acknowledges support from the Austrian Science Fund (FWF), under
  Project No. M2461-N27 and from the Deutsche Forschungsgemeinschaft (DFG, German
  Research Foundation) under Germany's Excellence Strategy EXC2181/1-390900948 (the
  Heidelberg STRUCTURES Excellence Cluster). ML 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). HS acknowledges support from the Independent
  Research Fund Denmark (Project No. 8021-00232B) and from the Villum Fonden through
  a Villum Investigator Grant No. 25886.
article_number: '075004'
article_processing_charge: Yes
article_type: original
author:
- first_name: Igor
  full_name: Cherepanov, Igor
  id: 339C7E5A-F248-11E8-B48F-1D18A9856A87
  last_name: Cherepanov
- first_name: Giacomo
  full_name: Bighin, Giacomo
  id: 4CA96FD4-F248-11E8-B48F-1D18A9856A87
  last_name: Bighin
  orcid: 0000-0001-8823-9777
- first_name: Constant A.
  full_name: Schouder, Constant A.
  last_name: Schouder
- first_name: Adam S.
  full_name: Chatterley, Adam S.
  last_name: Chatterley
- first_name: Henrik
  full_name: Stapelfeldt, Henrik
  last_name: Stapelfeldt
- first_name: Mikhail
  full_name: Lemeshko, Mikhail
  id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
  last_name: Lemeshko
  orcid: 0000-0002-6990-7802
citation:
  ama: Cherepanov I, Bighin G, Schouder CA, Chatterley AS, Stapelfeldt H, Lemeshko
    M. A simple model for high rotational excitations of molecules in a superfluid.
    <i>New Journal of Physics</i>. 2022;24(7). doi:<a href="https://doi.org/10.1088/1367-2630/ac8113">10.1088/1367-2630/ac8113</a>
  apa: Cherepanov, I., Bighin, G., Schouder, C. A., Chatterley, A. S., Stapelfeldt,
    H., &#38; Lemeshko, M. (2022). A simple model for high rotational excitations
    of molecules in a superfluid. <i>New Journal of Physics</i>. IOP Publishing. <a
    href="https://doi.org/10.1088/1367-2630/ac8113">https://doi.org/10.1088/1367-2630/ac8113</a>
  chicago: Cherepanov, Igor, Giacomo Bighin, Constant A. Schouder, Adam S. Chatterley,
    Henrik Stapelfeldt, and Mikhail Lemeshko. “A Simple Model for High Rotational
    Excitations of Molecules in a Superfluid.” <i>New Journal of Physics</i>. IOP
    Publishing, 2022. <a href="https://doi.org/10.1088/1367-2630/ac8113">https://doi.org/10.1088/1367-2630/ac8113</a>.
  ieee: I. Cherepanov, G. Bighin, C. A. Schouder, A. S. Chatterley, H. Stapelfeldt,
    and M. Lemeshko, “A simple model for high rotational excitations of molecules
    in a superfluid,” <i>New Journal of Physics</i>, vol. 24, no. 7. IOP Publishing,
    2022.
  ista: Cherepanov I, Bighin G, Schouder CA, Chatterley AS, Stapelfeldt H, Lemeshko
    M. 2022. A simple model for high rotational excitations of molecules in a superfluid.
    New Journal of Physics. 24(7), 075004.
  mla: Cherepanov, Igor, et al. “A Simple Model for High Rotational Excitations of
    Molecules in a Superfluid.” <i>New Journal of Physics</i>, vol. 24, no. 7, 075004,
    IOP Publishing, 2022, doi:<a href="https://doi.org/10.1088/1367-2630/ac8113">10.1088/1367-2630/ac8113</a>.
  short: I. Cherepanov, G. Bighin, C.A. Schouder, A.S. Chatterley, H. Stapelfeldt,
    M. Lemeshko, New Journal of Physics 24 (2022).
corr_author: '1'
date_created: 2022-08-28T22:02:01Z
date_published: 2022-08-11T00:00:00Z
date_updated: 2025-05-14T11:20:18Z
day: '11'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.1088/1367-2630/ac8113
ec_funded: 1
external_id:
  isi:
  - '000839216900001'
file:
- access_level: open_access
  checksum: 10116a08d3489befc13dba2cc44490f1
  content_type: application/pdf
  creator: alisjak
  date_created: 2022-08-29T09:57:40Z
  date_updated: 2022-08-29T09:57:40Z
  file_id: '12005'
  file_name: 2022_NewJournalofPhysics_Cherepanov.pdf
  file_size: 1912882
  relation: main_file
  success: 1
file_date_updated: 2022-08-29T09:57:40Z
fulldoi: https://doi.org/10.1088/1367-2630/ac8113
has_accepted_license: '1'
intvolume: '        24'
isi: 1
issue: '7'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '665385'
  name: International IST Doctoral Program
- _id: 2688CF98-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '801770'
  name: 'Angulon: physics and applications of a new quasiparticle'
- _id: 26986C82-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: M02641
  name: A path-integral approach to composite impurities
publication: New Journal of Physics
publication_identifier:
  issn:
  - 1367-2630
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: A simple model for high rotational excitations of molecules in a superfluid
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: 24
year: '2022'
...
---
_id: '12000'
abstract:
- lang: eng
  text: "We consider the quantitative problem of obtaining lower-bounds on the probability
    of termination of a given non-deterministic probabilistic program. Specifically,
    given a non-termination threshold p∈[0,1], we aim for certificates proving that
    the program terminates with probability at least 1−p. The basic idea of our approach
    is to find a terminating stochastic invariant, i.e. a subset SI of program states
    such that (i) the probability of the program ever leaving SI is no more than p,
    and (ii) almost-surely, the program either leaves SI or terminates.\r\n\r\nWhile
    stochastic invariants are already well-known, we provide the first proof that
    the idea above is not only sound, but also complete for quantitative termination
    analysis. We then introduce a novel sound and complete characterization of stochastic
    invariants that enables template-based approaches for easy synthesis of quantitative
    termination certificates, especially in affine or polynomial forms. Finally, by
    combining this idea with the existing martingale-based methods that are relatively
    complete for qualitative termination analysis, we obtain the first automated,
    sound, and relatively complete algorithm for quantitative termination analysis.
    Notably, our completeness guarantees for quantitative termination analysis are
    as strong as the best-known methods for the qualitative variant.\r\n\r\nOur prototype
    implementation demonstrates the effectiveness of our approach on various probabilistic
    programs. We also demonstrate that our algorithm certifies lower bounds on termination
    probability for probabilistic programs that are beyond the reach of previous methods."
acknowledgement: This research was partially supported by the ERC CoG 863818 (ForM-SMArt),
  the HKUST-Kaisa Joint Research Institute Project Grant HKJRI3A-055, the HKUST Startup
  Grant R9272 and the European Union’s Horizon 2020 research and innovation programme
  under the Marie Skłodowska-Curie Grant Agreement No. 665385.
alternative_title:
- LNCS
article_processing_charge: Yes (in subscription journal)
author:
- 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: Dorde
  full_name: Zikelic, Dorde
  id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
  last_name: Zikelic
  orcid: 0000-0002-4681-1699
citation:
  ama: 'Chatterjee K, Goharshady AK, Meggendorfer T, Zikelic D. Sound and complete
    certificates for auantitative termination analysis of probabilistic programs.
    In: <i>Proceedings of the 34th International Conference on Computer Aided Verification</i>.
    Vol 13371. Springer; 2022:55-78. doi:<a href="https://doi.org/10.1007/978-3-031-13185-1_4">10.1007/978-3-031-13185-1_4</a>'
  apa: 'Chatterjee, K., Goharshady, A. K., Meggendorfer, T., &#38; Zikelic, D. (2022).
    Sound and complete certificates for auantitative termination analysis of probabilistic
    programs. In <i>Proceedings of the 34th International Conference on Computer Aided
    Verification</i> (Vol. 13371, pp. 55–78). Haifa, Israel: Springer. <a href="https://doi.org/10.1007/978-3-031-13185-1_4">https://doi.org/10.1007/978-3-031-13185-1_4</a>'
  chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Tobias Meggendorfer,
    and Dorde Zikelic. “Sound and Complete Certificates for Auantitative Termination
    Analysis of Probabilistic Programs.” In <i>Proceedings of the 34th International
    Conference on Computer Aided Verification</i>, 13371:55–78. Springer, 2022. <a
    href="https://doi.org/10.1007/978-3-031-13185-1_4">https://doi.org/10.1007/978-3-031-13185-1_4</a>.
  ieee: K. Chatterjee, A. K. Goharshady, T. Meggendorfer, and D. Zikelic, “Sound and complete
    certificates for auantitative termination analysis of probabilistic programs,”
    in <i>Proceedings of the 34th International Conference on Computer Aided Verification</i>,
    Haifa, Israel, 2022, vol. 13371, pp. 55–78.
  ista: 'Chatterjee K, Goharshady AK, Meggendorfer T, Zikelic D. 2022. Sound and complete
    certificates for auantitative termination analysis of probabilistic programs.
    Proceedings of the 34th International Conference on Computer Aided Verification.
    CAV: Computer Aided Verification, LNCS, vol. 13371, 55–78.'
  mla: Chatterjee, Krishnendu, et al. “Sound and Complete Certificates for Auantitative
    Termination Analysis of Probabilistic Programs.” <i>Proceedings of the 34th International
    Conference on Computer Aided Verification</i>, vol. 13371, Springer, 2022, pp.
    55–78, doi:<a href="https://doi.org/10.1007/978-3-031-13185-1_4">10.1007/978-3-031-13185-1_4</a>.
  short: K. Chatterjee, A.K. Goharshady, T. Meggendorfer, D. Zikelic, in:, Proceedings
    of the 34th International Conference on Computer Aided Verification, Springer,
    2022, pp. 55–78.
conference:
  end_date: 2022-08-10
  location: Haifa, Israel
  name: 'CAV: Computer Aided Verification'
  start_date: 2022-08-07
date_created: 2022-08-28T22:02:02Z
date_published: 2022-08-07T00:00:00Z
date_updated: 2026-04-07T13:27:55Z
day: '07'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-031-13185-1_4
ec_funded: 1
external_id:
  isi:
  - '000870304500004'
file:
- access_level: open_access
  checksum: 24e0f810ec52735a90ade95198bc641d
  content_type: application/pdf
  creator: alisjak
  date_created: 2022-08-29T09:17:01Z
  date_updated: 2022-08-29T09:17:01Z
  file_id: '12003'
  file_name: 2022_LNCS_Chatterjee.pdf
  file_size: 505094
  relation: main_file
  success: 1
file_date_updated: 2022-08-29T09:17:01Z
fulldoi: https://doi.org/10.1007/978-3-031-13185-1_4
has_accepted_license: '1'
intvolume: '     13371'
isi: 1
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 55-78
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: Proceedings of the 34th International Conference on Computer Aided Verification
publication_identifier:
  eissn:
  - 1611-3349
  isbn:
  - '9783031131844'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer
quality_controlled: '1'
related_material:
  record:
  - id: '14539'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Sound and complete certificates for auantitative termination analysis of probabilistic
  programs
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 13371
year: '2022'
...
---
_id: '12001'
abstract:
- lang: eng
  text: 'Sexual antagonism is a common hypothesis for driving the evolution of sex
    chromosomes, whereby recombination suppression is favored between sexually antagonistic
    loci and the sex-determining locus to maintain beneficial combinations of alleles.
    This results in the formation of a sex-determining region. Chromosomal inversions
    may contribute to recombination suppression but their precise role in sex chromosome
    evolution remains unclear. Because local adaptation is frequently facilitated
    through the suppression of recombination between adaptive loci by chromosomal
    inversions, there is potential for inversions that cover sex-determining regions
    to be involved in local adaptation as well, particularly if habitat variation
    creates environment-dependent sexual antagonism. With these processes in mind,
    we investigated sex determination in a well-studied example of local adaptation
    within a species: the intertidal snail, Littorina saxatilis. Using SNP data from
    a Swedish hybrid zone, we find novel evidence for a female-heterogametic sex determination
    system that is restricted to one ecotype. Our results suggest that four putative
    chromosomal inversions, two previously described and two newly discovered, span
    the putative sex chromosome pair. We determine their differing associations with
    sex, which suggest distinct strata of differing ages. The same inversions are
    found in the second ecotype but do not show any sex association. The striking
    disparity in inversion-sex associations between ecotypes that are connected by
    gene flow across a habitat transition that is just a few meters wide indicates
    a difference in selective regime that has produced a distinct barrier to the spread
    of the newly discovered sex-determining region between ecotypes. Such sex chromosome-environment
    interactions have not previously been uncovered in L. saxatilis and are known
    in few other organisms. A combination of both sex-specific selection and divergent
    natural selection is required to explain these highly unusual patterns.'
acknowledgement: We thank A. Wright and four anonymous reviewers for valuable comments
  on an earlier draft of this manuscript and all members of the Littorina group for
  helpful discussions. This work was supported by a European Research Council grant
  to RKB and by a Natural Environment Research Council studentship to KEH through
  the ACCE doctoral training program. KJ acknowledges support from the Swedish Science
  Research Council VR (Vetenskaprådet) (2017-03798). RF was supported by an FCT CEEC
  (Fundação para a Ciênca e a Tecnologia, Concurso Estímulo ao Emprego Científico)
  contract (2020.00275.CEECIND).
article_processing_charge: Yes
article_type: original
author:
- first_name: Katherine E.
  full_name: Hearn, Katherine E.
  last_name: Hearn
- first_name: Eva L.
  full_name: Koch, Eva L.
  last_name: Koch
- first_name: Sean
  full_name: Stankowski, Sean
  id: 43161670-5719-11EA-8025-FABC3DDC885E
  last_name: Stankowski
- first_name: Roger K.
  full_name: Butlin, Roger K.
  last_name: Butlin
- first_name: Rui
  full_name: Faria, Rui
  last_name: Faria
- first_name: Kerstin
  full_name: Johannesson, Kerstin
  last_name: Johannesson
- first_name: Anja M
  full_name: Westram, Anja M
  id: 3C147470-F248-11E8-B48F-1D18A9856A87
  last_name: Westram
  orcid: 0000-0003-1050-4969
citation:
  ama: Hearn KE, Koch EL, Stankowski S, et al. Differing associations between sex
    determination and sex-linked inversions in two ecotypes of Littorina saxatilis.
    <i>Evolution Letters</i>. 2022;6(5):358-374. doi:<a href="https://doi.org/10.1002/evl3.295">10.1002/evl3.295</a>
  apa: Hearn, K. E., Koch, E. L., Stankowski, S., Butlin, R. K., Faria, R., Johannesson,
    K., &#38; Westram, A. M. (2022). Differing associations between sex determination
    and sex-linked inversions in two ecotypes of Littorina saxatilis. <i>Evolution
    Letters</i>. Oxford University Press. <a href="https://doi.org/10.1002/evl3.295">https://doi.org/10.1002/evl3.295</a>
  chicago: Hearn, Katherine E., Eva L. Koch, Sean Stankowski, Roger K. Butlin, Rui
    Faria, Kerstin Johannesson, and Anja M Westram. “Differing Associations between
    Sex Determination and Sex-Linked Inversions in Two Ecotypes of Littorina Saxatilis.”
    <i>Evolution Letters</i>. Oxford University Press, 2022. <a href="https://doi.org/10.1002/evl3.295">https://doi.org/10.1002/evl3.295</a>.
  ieee: K. E. Hearn <i>et al.</i>, “Differing associations between sex determination
    and sex-linked inversions in two ecotypes of Littorina saxatilis,” <i>Evolution
    Letters</i>, vol. 6, no. 5. Oxford University Press, pp. 358–374, 2022.
  ista: Hearn KE, Koch EL, Stankowski S, Butlin RK, Faria R, Johannesson K, Westram
    AM. 2022. Differing associations between sex determination and sex-linked inversions
    in two ecotypes of Littorina saxatilis. Evolution Letters. 6(5), 358–374.
  mla: Hearn, Katherine E., et al. “Differing Associations between Sex Determination
    and Sex-Linked Inversions in Two Ecotypes of Littorina Saxatilis.” <i>Evolution
    Letters</i>, vol. 6, no. 5, Oxford University Press, 2022, pp. 358–74, doi:<a
    href="https://doi.org/10.1002/evl3.295">10.1002/evl3.295</a>.
  short: K.E. Hearn, E.L. Koch, S. Stankowski, R.K. Butlin, R. Faria, K. Johannesson,
    A.M. Westram, Evolution Letters 6 (2022) 358–374.
date_created: 2022-08-28T22:02:02Z
date_published: 2022-10-01T00:00:00Z
date_updated: 2025-06-12T06:22:56Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1002/evl3.295
external_id:
  isi:
  - '000839621100001'
  pmid:
  - '36254259'
file:
- access_level: open_access
  checksum: 2dcd06186a11b7d1be4cddc6b189f8fb
  content_type: application/pdf
  creator: dernst
  date_created: 2023-02-27T07:17:42Z
  date_updated: 2023-02-27T07:17:42Z
  file_id: '12686'
  file_name: 2022_EvolutionLetters_Hearn.pdf
  file_size: 2368965
  relation: main_file
  success: 1
file_date_updated: 2023-02-27T07:17:42Z
fulldoi: https://doi.org/10.1002/evl3.295
has_accepted_license: '1'
intvolume: '         6'
isi: 1
issue: '5'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 358-374
pmid: 1
publication: Evolution Letters
publication_identifier:
  eissn:
  - 2056-3744
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Differing associations between sex determination and sex-linked inversions
  in two ecotypes of Littorina saxatilis
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: 6
year: '2022'
...
---
_id: '12009'
abstract:
- lang: eng
  text: Changes in the short-term dynamics of excitatory synapses over development
    have been observed throughout cortex, but their purpose and consequences remain
    unclear. Here, we propose that developmental changes in synaptic dynamics buffer
    the effect of slow inhibitory long-term plasticity, allowing for continuously
    stable neural activity. Using computational modeling we demonstrate that early
    in development excitatory short-term depression quickly stabilises neural activity,
    even in the face of strong, unbalanced excitation. We introduce a model of the
    commonly observed developmental shift from depression to facilitation and show
    that neural activity remains stable throughout development, while inhibitory synaptic
    plasticity slowly balances excitation, consistent with experimental observations.
    Our model predicts changes in the input responses from phasic to phasic-and-tonic
    and more precise spike timings. We also observe a gradual emergence of short-lasting
    memory traces governed by short-term plasticity development. We conclude that
    the developmental depression-to-facilitation shift may control excitation-inhibition
    balance throughout development with important functional consequences.
acknowledgement: We would like to thank the Vogels Lab for feedback on an earlier
  version of this manuscript. D.W.J. was supported by a Marshall Scholarship and a
  Clarendon Scholarship. R.P.C. and T.P.V. were supported by a Wellcome Trust and
  Royal Society Sir Henry Dale Fellowship (WT 100000), a Wellcome Trust Senior Research
  Fellowship (214316/Z/18/Z), and an ERC Consolidator Grant (SYNAPSEEK).
article_number: '873'
article_processing_charge: No
article_type: original
author:
- first_name: David W.
  full_name: Jia, David W.
  last_name: Jia
- first_name: Tim P
  full_name: Vogels, Tim P
  id: CB6FF8D2-008F-11EA-8E08-2637E6697425
  last_name: Vogels
  orcid: 0000-0003-3295-6181
- first_name: Rui Ponte
  full_name: Costa, Rui Ponte
  last_name: Costa
citation:
  ama: Jia DW, Vogels TP, Costa RP. Developmental depression-to-facilitation shift
    controls excitation-inhibition balance. <i>Communications biology</i>. 2022;5.
    doi:<a href="https://doi.org/10.1038/s42003-022-03801-2">10.1038/s42003-022-03801-2</a>
  apa: Jia, D. W., Vogels, T. P., &#38; Costa, R. P. (2022). Developmental depression-to-facilitation
    shift controls excitation-inhibition balance. <i>Communications Biology</i>. Springer
    Nature. <a href="https://doi.org/10.1038/s42003-022-03801-2">https://doi.org/10.1038/s42003-022-03801-2</a>
  chicago: Jia, David W., Tim P Vogels, and Rui Ponte Costa. “Developmental Depression-to-Facilitation
    Shift Controls Excitation-Inhibition Balance.” <i>Communications Biology</i>.
    Springer Nature, 2022. <a href="https://doi.org/10.1038/s42003-022-03801-2">https://doi.org/10.1038/s42003-022-03801-2</a>.
  ieee: D. W. Jia, T. P. Vogels, and R. P. Costa, “Developmental depression-to-facilitation
    shift controls excitation-inhibition balance,” <i>Communications biology</i>,
    vol. 5. Springer Nature, 2022.
  ista: Jia DW, Vogels TP, Costa RP. 2022. Developmental depression-to-facilitation
    shift controls excitation-inhibition balance. Communications biology. 5, 873.
  mla: Jia, David W., et al. “Developmental Depression-to-Facilitation Shift Controls
    Excitation-Inhibition Balance.” <i>Communications Biology</i>, vol. 5, 873, Springer
    Nature, 2022, doi:<a href="https://doi.org/10.1038/s42003-022-03801-2">10.1038/s42003-022-03801-2</a>.
  short: D.W. Jia, T.P. Vogels, R.P. Costa, Communications Biology 5 (2022).
date_created: 2022-09-04T22:02:02Z
date_published: 2022-08-25T00:00:00Z
date_updated: 2025-04-14T09:44:14Z
day: '25'
ddc:
- '570'
department:
- _id: TiVo
doi: 10.1038/s42003-022-03801-2
ec_funded: 1
external_id:
  isi:
  - '000844814800007'
file:
- access_level: open_access
  checksum: 3ec724c4f6d3440028c217305e32915f
  content_type: application/pdf
  creator: dernst
  date_created: 2022-09-05T08:55:11Z
  date_updated: 2022-09-05T08:55:11Z
  file_id: '12022'
  file_name: 2022_CommBiology_Jia.pdf
  file_size: 2491191
  relation: main_file
  success: 1
file_date_updated: 2022-09-05T08:55:11Z
fulldoi: https://doi.org/10.1038/s42003-022-03801-2
has_accepted_license: '1'
intvolume: '         5'
isi: 1
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: c084a126-5a5b-11eb-8a69-d75314a70a87
  grant_number: 214316/Z/18/Z
  name: "Whatâ\x80\x99s in a memory? Spatiotemporal dynamics in strongly coupled recurrent
    neuronal networks."
- _id: 0aacfa84-070f-11eb-9043-d7eb2c709234
  call_identifier: H2020
  grant_number: '819603'
  name: Learning the shape of synaptic plasticity rules for neuronal architectures
    and function through machine learning.
publication: Communications biology
publication_identifier:
  eissn:
  - 2399-3642
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Developmental depression-to-facilitation shift controls excitation-inhibition
  balance
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: 5
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
arxiv: 1
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: <i>2022 International Conference
    on Robotics and Automation</i>. IEEE; 2022:7513-7520. doi:<a href="https://doi.org/10.1109/ICRA46639.2022.9811650">10.1109/ICRA46639.2022.9811650</a>'
  apa: 'Brunnbauer, A., Berducci, L., Brandstatter, A., Lechner, M., Hasani, R., Rus,
    D., &#38; Grosu, R. (2022). Latent imagination facilitates zero-shot transfer
    in autonomous racing. In <i>2022 International Conference on Robotics and Automation</i>
    (pp. 7513–7520). Philadelphia, PA, United States: IEEE. <a href="https://doi.org/10.1109/ICRA46639.2022.9811650">https://doi.org/10.1109/ICRA46639.2022.9811650</a>'
  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 <i>2022 International Conference on Robotics
    and Automation</i>, 7513–20. IEEE, 2022. <a href="https://doi.org/10.1109/ICRA46639.2022.9811650">https://doi.org/10.1109/ICRA46639.2022.9811650</a>.
  ieee: A. Brunnbauer <i>et al.</i>, “Latent imagination facilitates zero-shot transfer
    in autonomous racing,” in <i>2022 International Conference on Robotics and Automation</i>,
    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.” <i>2022 International Conference on Robotics and Automation</i>,
    IEEE, 2022, pp. 7513–20, doi:<a href="https://doi.org/10.1109/ICRA46639.2022.9811650">10.1109/ICRA46639.2022.9811650</a>.
  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: 2025-09-10T09:39:53Z
day: '12'
department:
- _id: ToHe
doi: 10.1109/ICRA46639.2022.9811650
ec_funded: 1
external_id:
  arxiv:
  - '2103.04909'
  isi:
  - '000941277600124'
fulldoi: https://doi.org/10.1109/ICRA46639.2022.9811650
isi: 1
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: Formal methods for the design and analysis of complex systems
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
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
arxiv: 1
author:
- first_name: Yihan
  full_name: Zhang, Yihan
  id: 2ce5da42-b2ea-11eb-bba5-9f264e9d002c
  last_name: Zhang
  orcid: 0000-0002-6465-6258
- 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: <i>2022 IEEE International Symposium on Information Theory</i>.
    Vol 2022. IEEE; 2022:2523-2528. doi:<a href="https://doi.org/10.1109/ISIT50566.2022.9834709">10.1109/ISIT50566.2022.9834709</a>'
  apa: 'Zhang, Y., Jaggi, S., Langberg, M., &#38; Sarwate, A. D. (2022). The capacity
    of causal adversarial channels. In <i>2022 IEEE International Symposium on Information
    Theory</i> (Vol. 2022, pp. 2523–2528). Espoo, Finland: IEEE. <a href="https://doi.org/10.1109/ISIT50566.2022.9834709">https://doi.org/10.1109/ISIT50566.2022.9834709</a>'
  chicago: Zhang, Yihan, Sidharth Jaggi, Michael Langberg, and Anand D. Sarwate. “The
    Capacity of Causal Adversarial Channels.” In <i>2022 IEEE International Symposium
    on Information Theory</i>, 2022:2523–28. IEEE, 2022. <a href="https://doi.org/10.1109/ISIT50566.2022.9834709">https://doi.org/10.1109/ISIT50566.2022.9834709</a>.
  ieee: Y. Zhang, S. Jaggi, M. Langberg, and A. D. Sarwate, “The capacity of causal
    adversarial channels,” in <i>2022 IEEE International Symposium on Information
    Theory</i>, 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: International
    Symposium on Information Theory vol. 2022, 2523–2528.'
  mla: Zhang, Yihan, et al. “The Capacity of Causal Adversarial Channels.” <i>2022
    IEEE International Symposium on Information Theory</i>, vol. 2022, IEEE, 2022,
    pp. 2523–28, doi:<a href="https://doi.org/10.1109/ISIT50566.2022.9834709">10.1109/ISIT50566.2022.9834709</a>.
  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: International 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: 2025-09-10T09:40:42Z
day: '03'
department:
- _id: MaMo
doi: 10.1109/ISIT50566.2022.9834709
external_id:
  arxiv:
  - '2205.06708'
  isi:
  - '001254261902114'
fulldoi: https://doi.org/10.1109/ISIT50566.2022.9834709
intvolume: '      2022'
isi: 1
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
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
arxiv: 1
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: <i>2022 IEEE International Symposium on Information
    Theory</i>. Vol 2022. IEEE; 2022:1623-1628. doi:<a href="https://doi.org/10.1109/ISIT50566.2022.9834711">10.1109/ISIT50566.2022.9834711</a>'
  apa: 'Torkamani, S., Ebrahimi, J. B., Sadeghi, P., D’Oliveira, R. G. L., &#38; Médard,
    M. (2022). Heterogeneous differential privacy via graphs. In <i>2022 IEEE International
    Symposium on Information Theory</i> (Vol. 2022, pp. 1623–1628). Espoo, Finland:
    IEEE. <a href="https://doi.org/10.1109/ISIT50566.2022.9834711">https://doi.org/10.1109/ISIT50566.2022.9834711</a>'
  chicago: Torkamani, Sahel, Javad B. Ebrahimi, Parastoo Sadeghi, Rafael G.L. D’Oliveira,
    and Muriel Médard. “Heterogeneous Differential Privacy via Graphs.” In <i>2022
    IEEE International Symposium on Information Theory</i>, 2022:1623–28. IEEE, 2022.
    <a href="https://doi.org/10.1109/ISIT50566.2022.9834711">https://doi.org/10.1109/ISIT50566.2022.9834711</a>.
  ieee: S. Torkamani, J. B. Ebrahimi, P. Sadeghi, R. G. L. D’Oliveira, and M. Médard,
    “Heterogeneous differential privacy via graphs,” in <i>2022 IEEE International
    Symposium on Information Theory</i>, 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: International Symposium on Information Theory vol. 2022, 1623–1628.'
  mla: Torkamani, Sahel, et al. “Heterogeneous Differential Privacy via Graphs.” <i>2022
    IEEE International Symposium on Information Theory</i>, vol. 2022, IEEE, 2022,
    pp. 1623–28, doi:<a href="https://doi.org/10.1109/ISIT50566.2022.9834711">10.1109/ISIT50566.2022.9834711</a>.
  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: International 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: 2025-09-10T09:42:41Z
day: '03'
department:
- _id: MaMo
doi: 10.1109/ISIT50566.2022.9834711
external_id:
  arxiv:
  - '2203.15429'
  isi:
  - '001254261901131'
fulldoi: https://doi.org/10.1109/ISIT50566.2022.9834711
intvolume: '      2022'
isi: 1
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 2022
year: '2022'
...
