---
_id: '14443'
abstract:
- lang: eng
text: "Importance Climate change, pollution, urbanization, socioeconomic inequality,
and psychosocial effects of the COVID-19 pandemic have caused massive changes
in environmental conditions that affect brain health during the life span, both
on a population level as well as on the level of the individual. How these environmental
factors influence the brain, behavior, and mental illness is not well known.\r\nObservations
\ A research strategy enabling population neuroscience to contribute to identify
brain mechanisms underlying environment-related mental illness by leveraging innovative
enrichment tools for data federation, geospatial observation, climate and pollution
measures, digital health, and novel data integration techniques is described.
This strategy can inform innovative treatments that target causal cognitive and
molecular mechanisms of mental illness related to the environment. An example
is presented of the environMENTAL Project that is leveraging federated cohort
data of over 1.5 million European citizens and patients enriched with deep phenotyping
data from large-scale behavioral neuroimaging cohorts to identify brain mechanisms
related to environmental adversity underlying symptoms of depression, anxiety,
stress, and substance misuse.\r\nConclusions and Relevance This research will
lead to the development of objective biomarkers and evidence-based interventions
that will significantly improve outcomes of environment-related mental illness."
article_processing_charge: No
article_type: review
author:
- first_name: Gunter
full_name: Schumann, Gunter
last_name: Schumann
- first_name: Ole A.
full_name: Andreassen, Ole A.
last_name: Andreassen
- first_name: Tobias
full_name: Banaschewski, Tobias
last_name: Banaschewski
- first_name: Vince D.
full_name: Calhoun, Vince D.
last_name: Calhoun
- first_name: Nicholas
full_name: Clinton, Nicholas
last_name: Clinton
- first_name: Sylvane
full_name: Desrivieres, Sylvane
last_name: Desrivieres
- first_name: Ragnhild Eek
full_name: Brandlistuen, Ragnhild Eek
last_name: Brandlistuen
- first_name: Jianfeng
full_name: Feng, Jianfeng
last_name: Feng
- first_name: Soeren
full_name: Hese, Soeren
last_name: Hese
- first_name: Esther
full_name: Hitchen, Esther
last_name: Hitchen
- first_name: Per
full_name: Hoffmann, Per
last_name: Hoffmann
- first_name: Tianye
full_name: Jia, Tianye
last_name: Jia
- first_name: Viktor
full_name: Jirsa, Viktor
last_name: Jirsa
- first_name: Andre F.
full_name: Marquand, Andre F.
last_name: Marquand
- first_name: Frauke
full_name: Nees, Frauke
last_name: Nees
- first_name: Markus M.
full_name: Nöthen, Markus M.
last_name: Nöthen
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
- first_name: Elli
full_name: Polemiti, Elli
last_name: Polemiti
- first_name: Markus
full_name: Ralser, Markus
last_name: Ralser
- first_name: Michael
full_name: Rapp, Michael
last_name: Rapp
- first_name: Kerstin
full_name: Schepanski, Kerstin
last_name: Schepanski
- first_name: Tamara
full_name: Schikowski, Tamara
last_name: Schikowski
- first_name: Mel
full_name: Slater, Mel
last_name: Slater
- first_name: Peter
full_name: Sommer, Peter
last_name: Sommer
- first_name: Bernd Carsten
full_name: Stahl, Bernd Carsten
last_name: Stahl
- first_name: Paul M.
full_name: Thompson, Paul M.
last_name: Thompson
- first_name: Sven
full_name: Twardziok, Sven
last_name: Twardziok
- first_name: Dennis
full_name: Van Der Meer, Dennis
last_name: Van Der Meer
- first_name: Henrik
full_name: Walter, Henrik
last_name: Walter
- first_name: Lars
full_name: Westlye, Lars
last_name: Westlye
citation:
ama: 'Schumann G, Andreassen OA, Banaschewski T, et al. Addressing global environmental
challenges to mental health using population neuroscience: A review. JAMA Psychiatry.
2023;80(10):1066-1074. doi:10.1001/jamapsychiatry.2023.2996'
apa: 'Schumann, G., Andreassen, O. A., Banaschewski, T., Calhoun, V. D., Clinton,
N., Desrivieres, S., … Westlye, L. (2023). Addressing global environmental challenges
to mental health using population neuroscience: A review. JAMA Psychiatry.
American Medical Association. https://doi.org/10.1001/jamapsychiatry.2023.2996'
chicago: 'Schumann, Gunter, Ole A. Andreassen, Tobias Banaschewski, Vince D. Calhoun,
Nicholas Clinton, Sylvane Desrivieres, Ragnhild Eek Brandlistuen, et al. “Addressing
Global Environmental Challenges to Mental Health Using Population Neuroscience:
A Review.” JAMA Psychiatry. American Medical Association, 2023. https://doi.org/10.1001/jamapsychiatry.2023.2996.'
ieee: 'G. Schumann et al., “Addressing global environmental challenges to
mental health using population neuroscience: A review,” JAMA Psychiatry,
vol. 80, no. 10. American Medical Association, pp. 1066–1074, 2023.'
ista: 'Schumann G, Andreassen OA, Banaschewski T, Calhoun VD, Clinton N, Desrivieres
S, Brandlistuen RE, Feng J, Hese S, Hitchen E, Hoffmann P, Jia T, Jirsa V, Marquand
AF, Nees F, Nöthen MM, Novarino G, Polemiti E, Ralser M, Rapp M, Schepanski K,
Schikowski T, Slater M, Sommer P, Stahl BC, Thompson PM, Twardziok S, Van Der
Meer D, Walter H, Westlye L. 2023. Addressing global environmental challenges
to mental health using population neuroscience: A review. JAMA Psychiatry. 80(10),
1066–1074.'
mla: 'Schumann, Gunter, et al. “Addressing Global Environmental Challenges to Mental
Health Using Population Neuroscience: A Review.” JAMA Psychiatry, vol.
80, no. 10, American Medical Association, 2023, pp. 1066–74, doi:10.1001/jamapsychiatry.2023.2996.'
short: G. Schumann, O.A. Andreassen, T. Banaschewski, V.D. Calhoun, N. Clinton,
S. Desrivieres, R.E. Brandlistuen, J. Feng, S. Hese, E. Hitchen, P. Hoffmann,
T. Jia, V. Jirsa, A.F. Marquand, F. Nees, M.M. Nöthen, G. Novarino, E. Polemiti,
M. Ralser, M. Rapp, K. Schepanski, T. Schikowski, M. Slater, P. Sommer, B.C. Stahl,
P.M. Thompson, S. Twardziok, D. Van Der Meer, H. Walter, L. Westlye, JAMA Psychiatry
80 (2023) 1066–1074.
date_created: 2023-10-22T22:01:14Z
date_published: 2023-10-01T00:00:00Z
date_updated: 2025-09-09T13:11:20Z
day: '01'
department:
- _id: GaNo
doi: 10.1001/jamapsychiatry.2023.2996
external_id:
isi:
- '001093447000016'
pmid:
- '37610741'
intvolume: ' 80'
isi: 1
issue: '10'
language:
- iso: eng
month: '10'
oa_version: None
page: 1066-1074
pmid: 1
publication: JAMA Psychiatry
publication_identifier:
eissn:
- 2168-6238
publication_status: published
publisher: American Medical Association
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Addressing global environmental challenges to mental health using population
neuroscience: A review'
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 80
year: '2023'
...
---
_id: '14444'
abstract:
- lang: eng
text: "We prove several results about substructures in Latin squares. First, we
explain how to adapt our recent work on high-girth Steiner triple systems to the
setting of Latin squares, resolving a conjecture of Linial that there exist Latin
squares with arbitrarily high girth. As a consequence, we see that the number
of order- n Latin squares with no intercalate (i.e., no 2×2 Latin subsquare)
is at least (e−9/4n−o(n))n2. Equivalently, P[N=0]≥e−n2/4−o(n2)=e−(1+o(1))EN\r\n
, where N is the number of intercalates in a uniformly random order- n Latin
square. \r\nIn fact, extending recent work of Kwan, Sah, and Sawhney, we resolve
the general large-deviation problem for intercalates in random Latin squares,
up to constant factors in the exponent: for any constant 0<δ≤1 we have P[N≤(1−δ)EN]=exp(−Θ(n2))
and for any constant δ>0 we have P[N≥(1+δ)EN]=exp(−Θ(n4/3logn)). \r\nFinally,
as an application of some new general tools for studying substructures in random
Latin squares, we show that in almost all order- n Latin squares, the number of
cuboctahedra (i.e., the number of pairs of possibly degenerate 2×2 submatrices
with the same arrangement of symbols) is of order n4, which is the minimum possible.
As observed by Gowers and Long, this number can be interpreted as measuring ``how
associative'' the quasigroup associated with the Latin square is."
acknowledgement: Sah and Sawhney were supported by NSF Graduate Research Fellowship
Program DGE-1745302. Sah was supported by the PD Soros Fellowship. Simkin was supported
by the Center of Mathematical Sciences and Applications at Harvard University.
article_processing_charge: Yes (in subscription journal)
article_type: original
arxiv: 1
author:
- first_name: Matthew Alan
full_name: Kwan, Matthew Alan
id: 5fca0887-a1db-11eb-95d1-ca9d5e0453b3
last_name: Kwan
orcid: 0000-0002-4003-7567
- first_name: Ashwin
full_name: Sah, Ashwin
last_name: Sah
- first_name: Mehtaab
full_name: Sawhney, Mehtaab
last_name: Sawhney
- first_name: Michael
full_name: Simkin, Michael
last_name: Simkin
citation:
ama: Kwan MA, Sah A, Sawhney M, Simkin M. Substructures in Latin squares. Israel
Journal of Mathematics. 2023;256(2):363-416. doi:10.1007/s11856-023-2513-9
apa: Kwan, M. A., Sah, A., Sawhney, M., & Simkin, M. (2023). Substructures in
Latin squares. Israel Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s11856-023-2513-9
chicago: Kwan, Matthew Alan, Ashwin Sah, Mehtaab Sawhney, and Michael Simkin. “Substructures
in Latin Squares.” Israel Journal of Mathematics. Springer Nature, 2023.
https://doi.org/10.1007/s11856-023-2513-9.
ieee: M. A. Kwan, A. Sah, M. Sawhney, and M. Simkin, “Substructures in Latin squares,”
Israel Journal of Mathematics, vol. 256, no. 2. Springer Nature, pp. 363–416,
2023.
ista: Kwan MA, Sah A, Sawhney M, Simkin M. 2023. Substructures in Latin squares.
Israel Journal of Mathematics. 256(2), 363–416.
mla: Kwan, Matthew Alan, et al. “Substructures in Latin Squares.” Israel Journal
of Mathematics, vol. 256, no. 2, Springer Nature, 2023, pp. 363–416, doi:10.1007/s11856-023-2513-9.
short: M.A. Kwan, A. Sah, M. Sawhney, M. Simkin, Israel Journal of Mathematics 256
(2023) 363–416.
date_created: 2023-10-22T22:01:14Z
date_published: 2023-09-01T00:00:00Z
date_updated: 2025-09-09T13:08:47Z
day: '01'
department:
- _id: MaKw
doi: 10.1007/s11856-023-2513-9
external_id:
arxiv:
- '2202.05088'
isi:
- '001081646400001'
intvolume: ' 256'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2202.05088
month: '09'
oa: 1
oa_version: Preprint
page: 363-416
publication: Israel Journal of Mathematics
publication_identifier:
eissn:
- 1565-8511
issn:
- 0021-2172
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Substructures in Latin squares
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 256
year: '2023'
...
---
_id: '14445'
abstract:
- lang: eng
text: "We prove the following quantitative Borsuk–Ulam-type result (an equivariant
analogue of Gromov’s Topological Overlap Theorem): Let X be a free ℤ/2-complex
of dimension d with coboundary expansion at least ηk in dimension 0 ≤ k < d. Then
for every equivariant map F: X →ℤ/2 ℝd, the fraction of d-simplices σ of X with
0 ∈ F (σ) is at least 2−d Π d−1k=0ηk.\r\n\r\nAs an application, we show that for
every sufficiently thick d-dimensional spherical building Y and every map f: Y
→ ℝ2d, we have f(σ) ∩ f(τ) ≠ ∅ for a constant fraction μd > 0 of pairs {σ, τ}
of d-simplices of Y. In particular, such complexes are non-embeddable into ℝ2d,
which proves a conjecture of Tancer and Vorwerk for sufficiently thick spherical
buildings.\r\n\r\nWe complement these results by upper bounds on the coboundary
expansion of two families of simplicial complexes; this indicates some limitations
to the bounds one can obtain by straighforward applications of the quantitative
Borsuk–Ulam theorem. Specifically, we prove\r\n\r\n• an upper bound of (d + 1)/2d
on the normalized (d − 1)-th coboundary expansion constant of complete (d + 1)-partite
d-dimensional complexes (under a mild divisibility assumption on the sizes of
the parts); and\r\n\r\n• an upper bound of (d + 1)/2d + ε on the normalized (d
− 1)-th coboundary expansion of the d-dimensional spherical building associated
with GLd+2(Fq) for any ε > 0 and sufficiently large q. This disproves, in a rather
strong sense, a conjecture of Lubotzky, Meshulam and Mozes."
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
- first_name: Pascal
full_name: Wild, Pascal
id: 4C20D868-F248-11E8-B48F-1D18A9856A87
last_name: Wild
citation:
ama: Wagner U, Wild P. Coboundary expansion, equivariant overlap, and crossing numbers
of simplicial complexes. Israel Journal of Mathematics. 2023;256(2):675-717.
doi:10.1007/s11856-023-2521-9
apa: Wagner, U., & Wild, P. (2023). Coboundary expansion, equivariant overlap,
and crossing numbers of simplicial complexes. Israel Journal of Mathematics.
Springer Nature. https://doi.org/10.1007/s11856-023-2521-9
chicago: Wagner, Uli, and Pascal Wild. “Coboundary Expansion, Equivariant Overlap,
and Crossing Numbers of Simplicial Complexes.” Israel Journal of Mathematics.
Springer Nature, 2023. https://doi.org/10.1007/s11856-023-2521-9.
ieee: U. Wagner and P. Wild, “Coboundary expansion, equivariant overlap, and crossing
numbers of simplicial complexes,” Israel Journal of Mathematics, vol. 256,
no. 2. Springer Nature, pp. 675–717, 2023.
ista: Wagner U, Wild P. 2023. Coboundary expansion, equivariant overlap, and crossing
numbers of simplicial complexes. Israel Journal of Mathematics. 256(2), 675–717.
mla: Wagner, Uli, and Pascal Wild. “Coboundary Expansion, Equivariant Overlap, and
Crossing Numbers of Simplicial Complexes.” Israel Journal of Mathematics,
vol. 256, no. 2, Springer Nature, 2023, pp. 675–717, doi:10.1007/s11856-023-2521-9.
short: U. Wagner, P. Wild, Israel Journal of Mathematics 256 (2023) 675–717.
corr_author: '1'
date_created: 2023-10-22T22:01:14Z
date_published: 2023-09-01T00:00:00Z
date_updated: 2024-10-09T21:07:12Z
day: '01'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.1007/s11856-023-2521-9
external_id:
isi:
- '001081646400010'
file:
- access_level: open_access
checksum: fbb05619fe4b650f341cc730425dd9c3
content_type: application/pdf
creator: dernst
date_created: 2023-10-31T11:20:31Z
date_updated: 2023-10-31T11:20:31Z
file_id: '14475'
file_name: 2023_IsraelJourMath_Wagner.pdf
file_size: 623787
relation: main_file
success: 1
file_date_updated: 2023-10-31T11:20:31Z
has_accepted_license: '1'
intvolume: ' 256'
isi: 1
issue: '2'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 675-717
publication: Israel Journal of Mathematics
publication_identifier:
eissn:
- 1565-8511
issn:
- 0021-2172
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Coboundary expansion, equivariant overlap, and crossing numbers of simplicial
complexes
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: 256
year: '2023'
...
---
_id: '14446'
abstract:
- lang: eng
text: Recent work has paid close attention to the first principle of Granger causality,
according to which cause precedes effect. In this context, the question may arise
whether the detected direction of causality also reverses after the time reversal
of unidirectionally coupled data. Recently, it has been shown that for unidirectionally
causally connected autoregressive (AR) processes X → Y, after time reversal of
data, the opposite causal direction Y → X is indeed detected, although typically
as part of the bidirectional X↔ Y link. As we argue here, the answer is different
when the measured data are not from AR processes but from linked deterministic
systems. When the goal is the usual forward data analysis, cross-mapping-like
approaches correctly detect X → Y, while Granger causality-like approaches, which
should not be used for deterministic time series, detect causal independence X
→ Y. The results of backward causal analysis depend on the predictability of the
reversed data. Unlike AR processes, observables from deterministic dynamical systems,
even complex nonlinear ones, can be predicted well forward, while backward predictions
can be difficult (notably when the time reversal of a function leads to one-to-many
relations). To address this problem, we propose an approach based on models that
provide multiple candidate predictions for the target, combined with a loss function
that consideres only the best candidate. The resulting good forward and backward
predictability supports the view that unidirectionally causally linked deterministic
dynamical systems X → Y can be expected to detect the same link both before and
after time reversal.
acknowledgement: The work was supported by the Scientific Grant Agency of the Ministry
of Education of the Slovak Republic and the Slovak Academy of Sciences, projects
APVV-21-0216, VEGA2-0096-21 and VEGA 2-0023-22.
article_processing_charge: Yes
article_type: original
author:
- first_name: Jozef
full_name: Jakubík, Jozef
last_name: Jakubík
- first_name: Phuong
full_name: Bui Thi Mai, Phuong
id: 3EC6EE64-F248-11E8-B48F-1D18A9856A87
last_name: Bui Thi Mai
- first_name: Martina
full_name: Chvosteková, Martina
last_name: Chvosteková
- first_name: Anna
full_name: Krakovská, Anna
last_name: Krakovská
citation:
ama: Jakubík J, Phuong M, Chvosteková M, Krakovská A. Against the flow of time with
multi-output models. Measurement Science Review. 2023;23(4):175-183. doi:10.2478/msr-2023-0023
apa: Jakubík, J., Phuong, M., Chvosteková, M., & Krakovská, A. (2023). Against
the flow of time with multi-output models. Measurement Science Review.
Sciendo. https://doi.org/10.2478/msr-2023-0023
chicago: Jakubík, Jozef, Mary Phuong, Martina Chvosteková, and Anna Krakovská. “Against
the Flow of Time with Multi-Output Models.” Measurement Science Review.
Sciendo, 2023. https://doi.org/10.2478/msr-2023-0023.
ieee: J. Jakubík, M. Phuong, M. Chvosteková, and A. Krakovská, “Against the flow
of time with multi-output models,” Measurement Science Review, vol. 23,
no. 4. Sciendo, pp. 175–183, 2023.
ista: Jakubík J, Phuong M, Chvosteková M, Krakovská A. 2023. Against the flow of
time with multi-output models. Measurement Science Review. 23(4), 175–183.
mla: Jakubík, Jozef, et al. “Against the Flow of Time with Multi-Output Models.”
Measurement Science Review, vol. 23, no. 4, Sciendo, 2023, pp. 175–83,
doi:10.2478/msr-2023-0023.
short: J. Jakubík, M. Phuong, M. Chvosteková, A. Krakovská, Measurement Science
Review 23 (2023) 175–183.
date_created: 2023-10-22T22:01:15Z
date_published: 2023-08-01T00:00:00Z
date_updated: 2025-09-09T13:10:30Z
day: '01'
ddc:
- '510'
department:
- _id: ChLa
doi: 10.2478/msr-2023-0023
external_id:
isi:
- '001070829600005'
file:
- access_level: open_access
checksum: b069cc10fa6a7c96b2bc9f728165f9e6
content_type: application/pdf
creator: dernst
date_created: 2023-10-31T12:07:23Z
date_updated: 2023-10-31T12:07:23Z
file_id: '14476'
file_name: 2023_MeasurementScienceRev_Jakubik.pdf
file_size: 2639783
relation: main_file
success: 1
file_date_updated: 2023-10-31T12:07:23Z
has_accepted_license: '1'
intvolume: ' 23'
isi: 1
issue: '4'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '08'
oa: 1
oa_version: Published Version
page: 175-183
publication: Measurement Science Review
publication_identifier:
eissn:
- 1335-8871
publication_status: published
publisher: Sciendo
quality_controlled: '1'
scopus_import: '1'
status: public
title: Against the flow of time with multi-output models
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 23
year: '2023'
...
---
_id: '14448'
abstract:
- lang: eng
text: We consider the problem of solving LP relaxations of MAP-MRF inference problems,
and in particular the method proposed recently in [16], [35]. As a key computational
subroutine, it uses a variant of the Frank-Wolfe (FW) method to minimize a smooth
convex function over a combinatorial polytope. We propose an efficient implementation
of this subroutine based on in-face Frank-Wolfe directions, introduced in [4]
in a different context. More generally, we define an abstract data structure for
a combinatorial subproblem that enables in-face FW directions, and describe its
specialization for tree-structured MAP-MRF inference subproblems. Experimental
results indicate that the resulting method is the current state-of-art LP solver
for some classes of problems. Our code is available at pub.ist.ac.at/~vnk/papers/IN-FACE-FW.html.
article_processing_charge: No
arxiv: 1
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Kolmogorov V. Solving relaxations of MAP-MRF problems: Combinatorial in-face
Frank-Wolfe directions. In: Proceedings of the IEEE Computer Society Conference
on Computer Vision and Pattern Recognition. Vol 2023. IEEE; 2023:11980-11989.
doi:10.1109/CVPR52729.2023.01153'
apa: 'Kolmogorov, V. (2023). Solving relaxations of MAP-MRF problems: Combinatorial
in-face Frank-Wolfe directions. In Proceedings of the IEEE Computer Society
Conference on Computer Vision and Pattern Recognition (Vol. 2023, pp. 11980–11989).
Vancouver, Canada: IEEE. https://doi.org/10.1109/CVPR52729.2023.01153'
chicago: 'Kolmogorov, Vladimir. “Solving Relaxations of MAP-MRF Problems: Combinatorial
in-Face Frank-Wolfe Directions.” In Proceedings of the IEEE Computer Society
Conference on Computer Vision and Pattern Recognition, 2023:11980–89. IEEE,
2023. https://doi.org/10.1109/CVPR52729.2023.01153.'
ieee: 'V. Kolmogorov, “Solving relaxations of MAP-MRF problems: Combinatorial in-face
Frank-Wolfe directions,” in Proceedings of the IEEE Computer Society Conference
on Computer Vision and Pattern Recognition, Vancouver, Canada, 2023, vol.
2023, pp. 11980–11989.'
ista: 'Kolmogorov V. 2023. Solving relaxations of MAP-MRF problems: Combinatorial
in-face Frank-Wolfe directions. Proceedings of the IEEE Computer Society Conference
on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision
and Pattern Recognition vol. 2023, 11980–11989.'
mla: 'Kolmogorov, Vladimir. “Solving Relaxations of MAP-MRF Problems: Combinatorial
in-Face Frank-Wolfe Directions.” Proceedings of the IEEE Computer Society Conference
on Computer Vision and Pattern Recognition, vol. 2023, IEEE, 2023, pp. 11980–89,
doi:10.1109/CVPR52729.2023.01153.'
short: V. Kolmogorov, in:, Proceedings of the IEEE Computer Society Conference on
Computer Vision and Pattern Recognition, IEEE, 2023, pp. 11980–11989.
conference:
end_date: 2023-06-24
location: Vancouver, Canada
name: 'CVPR: Conference on Computer Vision and Pattern Recognition'
start_date: 2023-06-17
corr_author: '1'
date_created: 2023-10-22T22:01:16Z
date_published: 2023-08-22T00:00:00Z
date_updated: 2025-09-09T13:09:58Z
day: '22'
department:
- _id: VlKo
doi: 10.1109/CVPR52729.2023.01153
external_id:
arxiv:
- '2010.09567'
isi:
- '001062522104029'
intvolume: ' 2023'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.2010.09567'
month: '08'
oa: 1
oa_version: Preprint
page: 11980-11989
publication: Proceedings of the IEEE Computer Society Conference on Computer Vision
and Pattern Recognition
publication_identifier:
isbn:
- '9798350301298'
issn:
- 1063-6919
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Solving relaxations of MAP-MRF problems: Combinatorial in-face Frank-Wolfe
directions'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 2023
year: '2023'
...
---
_id: '14449'
abstract:
- lang: eng
text: The rapid development of machine learning (ML) techniques has opened up the
data-dense field of microbiome research for novel therapeutic, diagnostic, and
prognostic applications targeting a wide range of disorders, which could substantially
improve healthcare practices in the era of precision medicine. However, several
challenges must be addressed to exploit the benefits of ML in this field fully.
In particular, there is a need to establish “gold standard” protocols for conducting
ML analysis experiments and improve interactions between microbiome researchers
and ML experts. The Machine Learning Techniques in Human Microbiome Studies (ML4Microbiome)
COST Action CA18131 is a European network established in 2019 to promote collaboration
between discovery-oriented microbiome researchers and data-driven ML experts to
optimize and standardize ML approaches for microbiome analysis. This perspective
paper presents the key achievements of ML4Microbiome, which include identifying
predictive and discriminatory ‘omics’ features, improving repeatability and comparability,
developing automation procedures, and defining priority areas for the novel development
of ML methods targeting the microbiome. The insights gained from ML4Microbiome
will help to maximize the potential of ML in microbiome research and pave the
way for new and improved healthcare practices.
acknowledgement: "This study is based upon work from COST Action ML4Microbiome “Statistical
and machine learning techniques in human microbiome studies” (CA18131), supported
by COST (European Cooperation in Science and Technology), www.cost.eu. MB acknowledges
support through the Metagenopolis grant ANR-11-DPBS-0001. IM-I acknowledges support
by the “Miguel Servet Type II” program (CPII21/00013) of the ISCIII-Madrid (Spain),
co-financed by the FEDER.\r\nThe authors are grateful to all COST Action CA18131
“Statistical and machine learning techniques in human microbiome studies” members
for their contribution to the COST Action objectives, and to COST (European Cooperation
in Science and Technology) for the economic support, www.cost.eu. WG2 and WG3 thank
Emmanuelle Le Chatelier and Pauline Barbet (Université Paris-Saclay, INRAE, MetaGenoPolis,
78350, Jouy-en-Josas, France) for preparing the shotgun CRC benchmark dataset."
article_number: '1257002'
article_processing_charge: Yes
article_type: original
author:
- first_name: Domenica
full_name: D’Elia, Domenica
last_name: D’Elia
- first_name: Jaak
full_name: Truu, Jaak
last_name: Truu
- first_name: Leo
full_name: Lahti, Leo
last_name: Lahti
- first_name: Magali
full_name: Berland, Magali
last_name: Berland
- first_name: Georgios
full_name: Papoutsoglou, Georgios
last_name: Papoutsoglou
- first_name: Michelangelo
full_name: Ceci, Michelangelo
last_name: Ceci
- first_name: Aldert
full_name: Zomer, Aldert
last_name: Zomer
- first_name: Marta B.
full_name: Lopes, Marta B.
last_name: Lopes
- first_name: Eliana
full_name: Ibrahimi, Eliana
last_name: Ibrahimi
- first_name: Aleksandra
full_name: Gruca, Aleksandra
last_name: Gruca
- first_name: Alina
full_name: Nechyporenko, Alina
last_name: Nechyporenko
- first_name: Marcus
full_name: Frohme, Marcus
last_name: Frohme
- first_name: Thomas
full_name: Klammsteiner, Thomas
last_name: Klammsteiner
- first_name: Enrique Carrillo De Santa
full_name: Pau, Enrique Carrillo De Santa
last_name: Pau
- first_name: Laura Judith
full_name: Marcos-Zambrano, Laura Judith
last_name: Marcos-Zambrano
- first_name: Karel
full_name: Hron, Karel
last_name: Hron
- first_name: Gianvito
full_name: Pio, Gianvito
last_name: Pio
- first_name: Andrea
full_name: Simeon, Andrea
last_name: Simeon
- first_name: Ramona
full_name: Suharoschi, Ramona
last_name: Suharoschi
- first_name: Isabel
full_name: Moreno-Indias, Isabel
last_name: Moreno-Indias
- first_name: Andriy
full_name: Temko, Andriy
last_name: Temko
- first_name: Miroslava
full_name: Nedyalkova, Miroslava
last_name: Nedyalkova
- first_name: Elena Simona
full_name: Apostol, Elena Simona
last_name: Apostol
- first_name: Ciprian Octavian
full_name: Truică, Ciprian Octavian
last_name: Truică
- first_name: Rajesh
full_name: Shigdel, Rajesh
last_name: Shigdel
- first_name: Jasminka Hasić
full_name: Telalović, Jasminka Hasić
last_name: Telalović
- first_name: Erik
full_name: Bongcam-Rudloff, Erik
last_name: Bongcam-Rudloff
- first_name: Piotr
full_name: Przymus, Piotr
last_name: Przymus
- first_name: Naida Babić
full_name: Jordamović, Naida Babić
last_name: Jordamović
- first_name: Laurent
full_name: Falquet, Laurent
last_name: Falquet
- first_name: Sonia
full_name: Tarazona, Sonia
last_name: Tarazona
- first_name: Alexia
full_name: Sampri, Alexia
last_name: Sampri
- first_name: Gaetano
full_name: Isola, Gaetano
last_name: Isola
- first_name: David
full_name: Pérez-Serrano, David
last_name: Pérez-Serrano
- first_name: Vladimir
full_name: Trajkovik, Vladimir
last_name: Trajkovik
- first_name: Lubos
full_name: Klucar, Lubos
last_name: Klucar
- first_name: Tatjana
full_name: Loncar-Turukalo, Tatjana
last_name: Loncar-Turukalo
- first_name: Aki S.
full_name: Havulinna, Aki S.
last_name: Havulinna
- first_name: Christian
full_name: Jansen, Christian
id: 837b2259-bcc9-11ed-a196-ae55927bc6e2
last_name: Jansen
- first_name: Randi J.
full_name: Bertelsen, Randi J.
last_name: Bertelsen
- first_name: Marcus Joakim
full_name: Claesson, Marcus Joakim
last_name: Claesson
citation:
ama: 'D’Elia D, Truu J, Lahti L, et al. Advancing microbiome research with machine
learning: Key findings from the ML4Microbiome COST action. Frontiers in Microbiology.
2023;14. doi:10.3389/fmicb.2023.1257002'
apa: 'D’Elia, D., Truu, J., Lahti, L., Berland, M., Papoutsoglou, G., Ceci, M.,
… Claesson, M. J. (2023). Advancing microbiome research with machine learning:
Key findings from the ML4Microbiome COST action. Frontiers in Microbiology.
Frontiers. https://doi.org/10.3389/fmicb.2023.1257002'
chicago: 'D’Elia, Domenica, Jaak Truu, Leo Lahti, Magali Berland, Georgios Papoutsoglou,
Michelangelo Ceci, Aldert Zomer, et al. “Advancing Microbiome Research with Machine
Learning: Key Findings from the ML4Microbiome COST Action.” Frontiers in Microbiology.
Frontiers, 2023. https://doi.org/10.3389/fmicb.2023.1257002.'
ieee: 'D. D’Elia et al., “Advancing microbiome research with machine learning:
Key findings from the ML4Microbiome COST action,” Frontiers in Microbiology,
vol. 14. Frontiers, 2023.'
ista: 'D’Elia D, Truu J, Lahti L, Berland M, Papoutsoglou G, Ceci M, Zomer A, Lopes
MB, Ibrahimi E, Gruca A, Nechyporenko A, Frohme M, Klammsteiner T, Pau ECDS, Marcos-Zambrano
LJ, Hron K, Pio G, Simeon A, Suharoschi R, Moreno-Indias I, Temko A, Nedyalkova
M, Apostol ES, Truică CO, Shigdel R, Telalović JH, Bongcam-Rudloff E, Przymus
P, Jordamović NB, Falquet L, Tarazona S, Sampri A, Isola G, Pérez-Serrano D, Trajkovik
V, Klucar L, Loncar-Turukalo T, Havulinna AS, Jansen C, Bertelsen RJ, Claesson
MJ. 2023. Advancing microbiome research with machine learning: Key findings from
the ML4Microbiome COST action. Frontiers in Microbiology. 14, 1257002.'
mla: 'D’Elia, Domenica, et al. “Advancing Microbiome Research with Machine Learning:
Key Findings from the ML4Microbiome COST Action.” Frontiers in Microbiology,
vol. 14, 1257002, Frontiers, 2023, doi:10.3389/fmicb.2023.1257002.'
short: D. D’Elia, J. Truu, L. Lahti, M. Berland, G. Papoutsoglou, M. Ceci, A. Zomer,
M.B. Lopes, E. Ibrahimi, A. Gruca, A. Nechyporenko, M. Frohme, T. Klammsteiner,
E.C.D.S. Pau, L.J. Marcos-Zambrano, K. Hron, G. Pio, A. Simeon, R. Suharoschi,
I. Moreno-Indias, A. Temko, M. Nedyalkova, E.S. Apostol, C.O. Truică, R. Shigdel,
J.H. Telalović, E. Bongcam-Rudloff, P. Przymus, N.B. Jordamović, L. Falquet, S.
Tarazona, A. Sampri, G. Isola, D. Pérez-Serrano, V. Trajkovik, L. Klucar, T. Loncar-Turukalo,
A.S. Havulinna, C. Jansen, R.J. Bertelsen, M.J. Claesson, Frontiers in Microbiology
14 (2023).
date_created: 2023-10-22T22:01:16Z
date_published: 2023-09-25T00:00:00Z
date_updated: 2023-12-13T13:07:21Z
day: '25'
ddc:
- '000'
department:
- _id: ScienComp
doi: 10.3389/fmicb.2023.1257002
external_id:
isi:
- '001080536000001'
pmid:
- '37808321'
file:
- access_level: open_access
checksum: 6c0acdd8fa111a699826957b8dff19d5
content_type: application/pdf
creator: dernst
date_created: 2023-10-30T13:38:48Z
date_updated: 2023-10-30T13:38:48Z
file_id: '14471'
file_name: 2023_FrontiersMicrobiology_DElia.pdf
file_size: 505078
relation: main_file
success: 1
file_date_updated: 2023-10-30T13:38:48Z
has_accepted_license: '1'
intvolume: ' 14'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
pmid: 1
publication: Frontiers in Microbiology
publication_identifier:
eissn:
- 1664-302X
publication_status: published
publisher: Frontiers
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Advancing microbiome research with machine learning: Key findings from the
ML4Microbiome COST action'
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: 14
year: '2023'
...
---
_id: '14452'
abstract:
- lang: eng
text: The classical infinitesimal model is a simple and robust model for the inheritance
of quantitative traits. In this model, a quantitative trait is expressed as the
sum of a genetic and an environmental component, and the genetic component of
offspring traits within a family follows a normal distribution around the average
of the parents’ trait values, and has a variance that is independent of the parental
traits. In previous work, we showed that when trait values are determined by the
sum of a large number of additive Mendelian factors, each of small effect, one
can justify the infinitesimal model as a limit of Mendelian inheritance. In this
paper, we show that this result extends to include dominance. We define the model
in terms of classical quantities of quantitative genetics, before justifying it
as a limit of Mendelian inheritance as the number, M, of underlying loci tends
to infinity. As in the additive case, the multivariate normal distribution of
trait values across the pedigree can be expressed in terms of variance components
in an ancestral population and probabilities of identity by descent determined
by the pedigree. Now, with just first-order dominance effects, we require two-,
three-, and four-way identities. We also show that, even if we condition on parental
trait values, the “shared” and “residual” components of trait values within each
family will be asymptotically normally distributed as the number of loci tends
to infinity, with an error of order 1/M−−√. We illustrate our results with some
numerical examples.
acknowledgement: NHB was supported in part by ERC Grants 250152 and 101055327. AV
was partly supported by the chaire Modélisation Mathématique et Biodiversité of
Veolia Environment—Ecole Polytechnique—Museum National d’Histoire Naturelle—Fondation
X.
article_number: iyad133
article_processing_charge: Yes (in subscription journal)
article_type: original
arxiv: 1
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Alison M.
full_name: Etheridge, Alison M.
last_name: Etheridge
- first_name: Amandine
full_name: Véber, Amandine
last_name: Véber
citation:
ama: Barton NH, Etheridge AM, Véber A. The infinitesimal model with dominance. Genetics.
2023;225(2). doi:10.1093/genetics/iyad133
apa: Barton, N. H., Etheridge, A. M., & Véber, A. (2023). The infinitesimal
model with dominance. Genetics. Oxford University Press. https://doi.org/10.1093/genetics/iyad133
chicago: Barton, Nicholas H, Alison M. Etheridge, and Amandine Véber. “The Infinitesimal
Model with Dominance.” Genetics. Oxford University Press, 2023. https://doi.org/10.1093/genetics/iyad133.
ieee: N. H. Barton, A. M. Etheridge, and A. Véber, “The infinitesimal model with
dominance,” Genetics, vol. 225, no. 2. Oxford University Press, 2023.
ista: Barton NH, Etheridge AM, Véber A. 2023. The infinitesimal model with dominance.
Genetics. 225(2), iyad133.
mla: Barton, Nicholas H., et al. “The Infinitesimal Model with Dominance.” Genetics,
vol. 225, no. 2, iyad133, Oxford University Press, 2023, doi:10.1093/genetics/iyad133.
short: N.H. Barton, A.M. Etheridge, A. Véber, Genetics 225 (2023).
date_created: 2023-10-29T23:01:15Z
date_published: 2023-10-01T00:00:00Z
date_updated: 2025-09-09T13:07:07Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1093/genetics/iyad133
ec_funded: 1
external_id:
arxiv:
- '2211.03515'
isi:
- '001148042000008'
file:
- access_level: open_access
checksum: 3f65b1fbe813e2f4dbb5d2b5e891844a
content_type: application/pdf
creator: dernst
date_created: 2023-10-30T12:57:53Z
date_updated: 2023-10-30T12:57:53Z
file_id: '14469'
file_name: 2023_Genetics_Barton.pdf
file_size: 1439032
relation: main_file
success: 1
file_date_updated: 2023-10-30T12:57:53Z
has_accepted_license: '1'
intvolume: ' 225'
isi: 1
issue: '2'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
- _id: bd6958e0-d553-11ed-ba76-86eba6a76c00
grant_number: '101055327'
name: Understanding the evolution of continuous genomes
publication: Genetics
publication_identifier:
eissn:
- 1943-2631
issn:
- 0016-6731
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
related_material:
record:
- id: '12949'
relation: research_data
status: public
scopus_import: '1'
status: public
title: The infinitesimal model with dominance
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 225
year: '2023'
...
---
_id: '14453'
abstract:
- lang: eng
text: Squall lines are substantially influenced by the interaction of low-level
shear with cold pools associated with convective downdrafts. Beyond an optimal
shear amplitude, squall lines tend to orient themselves at an angle with respect
to the low-level shear. While the mechanisms behind squall line orientation seem
to be increasingly well understood, uncertainties remain on the implications of
this orientation. Roca and Fiolleau (2020, https://doi.org/10.1038/s43247-020-00015-4)
show that long lived mesoscale convective systems, including squall lines, are
disproportionately involved in rainfall extremes in the tropics. This article
investigates the influence of the interaction between low-level shear and squall
line outflow on squall line generated precipitation extrema in the tropics. Using
a cloud resolving model, simulated squall lines in radiative convective equilibrium
amid a shear-dominated regime (super optimal), a balanced regime (optimal), and
an outflow dominated regime (suboptimal). Our results show that precipitation
extremes in squall lines are 40% more intense in the case of optimal shear and
remain 30% superior in the superoptimal regime relative to a disorganized case.
With a theoretical scaling of precipitation extremes (C. Muller & Takayabu, 2020,
https://doi.org/10.1088/1748-9326/ab7130), we show that the condensation rates
control the amplification of precipitation extremes in tropical squall lines,
mainly due to its change in vertical mass flux (dynamic component). The reduction
of dilution by entrainment explains half of this change, consistent with Mulholland
et al. (2021, https://doi.org/10.1175/jas-d-20-0299.1). The other half is explained
by increased cloud-base velocity intensity in optimal and superoptimal squall
lines.
acknowledgement: The authors gratefully acknowledge funding from the European Research
Council under the European Union's Horizon 2020 research and innovation program
(Project CLUSTER, Grant Agreement No. 805041). This work is also supported by a
PhD fellowship funded by the Ecole Normale Supérieure de Paris-Saclay. Authors are
also grateful to Benjamin Filider, who was of great help and support in the development
of ideas. Eventually, we would like to thank Martin Singh, John M. Peters and an
anonymous reviewer for their valuable comments and suggestions, which greatly improved
the quality of the manuscript.
article_number: e2022MS003477
article_processing_charge: Yes
article_type: original
author:
- first_name: Sophie
full_name: Abramian, Sophie
last_name: Abramian
- first_name: Caroline J
full_name: Muller, Caroline J
id: f978ccb0-3f7f-11eb-b193-b0e2bd13182b
last_name: Muller
orcid: 0000-0001-5836-5350
- first_name: Camille
full_name: Risi, Camille
last_name: Risi
citation:
ama: Abramian S, Muller CJ, Risi C. Extreme precipitation in tropical squall lines.
Journal of Advances in Modeling Earth Systems. 2023;15(10). doi:10.1029/2022MS003477
apa: Abramian, S., Muller, C. J., & Risi, C. (2023). Extreme precipitation in
tropical squall lines. Journal of Advances in Modeling Earth Systems. Wiley.
https://doi.org/10.1029/2022MS003477
chicago: Abramian, Sophie, Caroline J Muller, and Camille Risi. “Extreme Precipitation
in Tropical Squall Lines.” Journal of Advances in Modeling Earth Systems.
Wiley, 2023. https://doi.org/10.1029/2022MS003477.
ieee: S. Abramian, C. J. Muller, and C. Risi, “Extreme precipitation in tropical
squall lines,” Journal of Advances in Modeling Earth Systems, vol. 15,
no. 10. Wiley, 2023.
ista: Abramian S, Muller CJ, Risi C. 2023. Extreme precipitation in tropical squall
lines. Journal of Advances in Modeling Earth Systems. 15(10), e2022MS003477.
mla: Abramian, Sophie, et al. “Extreme Precipitation in Tropical Squall Lines.”
Journal of Advances in Modeling Earth Systems, vol. 15, no. 10, e2022MS003477,
Wiley, 2023, doi:10.1029/2022MS003477.
short: S. Abramian, C.J. Muller, C. Risi, Journal of Advances in Modeling Earth
Systems 15 (2023).
date_created: 2023-10-29T23:01:15Z
date_published: 2023-10-01T00:00:00Z
date_updated: 2024-11-05T09:00:44Z
day: '01'
ddc:
- '550'
department:
- _id: CaMu
doi: 10.1029/2022MS003477
ec_funded: 1
external_id:
isi:
- '001084933600001'
file:
- access_level: open_access
checksum: 43e6a1a35b663843c7d3f8d0caaca1a5
content_type: application/pdf
creator: dernst
date_created: 2023-10-30T13:31:42Z
date_updated: 2023-10-30T13:31:42Z
file_id: '14470'
file_name: 2023_JAMES_Abramian.pdf
file_size: 1975210
relation: main_file
success: 1
file_date_updated: 2023-10-30T13:31:42Z
has_accepted_license: '1'
intvolume: ' 15'
isi: 1
issue: '10'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 629205d8-2b32-11ec-9570-e1356ff73576
call_identifier: H2020
grant_number: '805041'
name: Organization of CLoUdS, and implications of Tropical cyclones and for the
Energetics of the tropics, in current and waRming climate
publication: Journal of Advances in Modeling Earth Systems
publication_identifier:
eissn:
- 1942-2466
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Extreme precipitation in tropical squall lines
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2023'
...
---
_id: '14454'
abstract:
- lang: eng
text: As AI and machine-learned software are used increasingly for making decisions
that affect humans, it is imperative that they remain fair and unbiased in their
decisions. To complement design-time bias mitigation measures, runtime verification
techniques have been introduced recently to monitor the algorithmic fairness of
deployed systems. Previous monitoring techniques assume full observability of
the states of the (unknown) monitored system. Moreover, they can monitor only
fairness properties that are specified as arithmetic expressions over the probabilities
of different events. In this work, we extend fairness monitoring to systems modeled
as partially observed Markov chains (POMC), and to specifications containing arithmetic
expressions over the expected values of numerical functions on event sequences.
The only assumptions we make are that the underlying POMC is aperiodic and starts
in the stationary distribution, with a bound on its mixing time being known. These
assumptions enable us to estimate a given property for the entire distribution
of possible executions of the monitored POMC, by observing only a single execution.
Our monitors observe a long run of the system and, after each new observation,
output updated PAC-estimates of how fair or biased the system is. The monitors
are computationally lightweight and, using a prototype implementation, we demonstrate
their effectiveness on several real-world examples.
acknowledgement: 'This work is supported by the European Research Council under Grant
No.: ERC-2020-AdG 101020093.'
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Konstantin
full_name: Kueffner, Konstantin
id: 8121a2d0-dc85-11ea-9058-af578f3b4515
last_name: Kueffner
orcid: 0000-0001-8974-2542
- first_name: Kaushik
full_name: Mallik, Kaushik
id: 0834ff3c-6d72-11ec-94e0-b5b0a4fb8598
last_name: Mallik
orcid: 0000-0001-9864-7475
citation:
ama: 'Henzinger TA, Kueffner K, Mallik K. Monitoring algorithmic fairness under
partial observations. In: 23rd International Conference on Runtime Verification.
Vol 14245. Springer Nature; 2023:291-311. doi:10.1007/978-3-031-44267-4_15'
apa: 'Henzinger, T. A., Kueffner, K., & Mallik, K. (2023). Monitoring algorithmic
fairness under partial observations. In 23rd International Conference on Runtime
Verification (Vol. 14245, pp. 291–311). Thessaloniki, Greece: Springer Nature.
https://doi.org/10.1007/978-3-031-44267-4_15'
chicago: Henzinger, Thomas A, Konstantin Kueffner, and Kaushik Mallik. “Monitoring
Algorithmic Fairness under Partial Observations.” In 23rd International Conference
on Runtime Verification, 14245:291–311. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-44267-4_15.
ieee: T. A. Henzinger, K. Kueffner, and K. Mallik, “Monitoring algorithmic fairness
under partial observations,” in 23rd International Conference on Runtime Verification,
Thessaloniki, Greece, 2023, vol. 14245, pp. 291–311.
ista: 'Henzinger TA, Kueffner K, Mallik K. 2023. Monitoring algorithmic fairness
under partial observations. 23rd International Conference on Runtime Verification.
RV: Conference on Runtime Verification, LNCS, vol. 14245, 291–311.'
mla: Henzinger, Thomas A., et al. “Monitoring Algorithmic Fairness under Partial
Observations.” 23rd International Conference on Runtime Verification, vol.
14245, Springer Nature, 2023, pp. 291–311, doi:10.1007/978-3-031-44267-4_15.
short: T.A. Henzinger, K. Kueffner, K. Mallik, in:, 23rd International Conference
on Runtime Verification, Springer Nature, 2023, pp. 291–311.
conference:
end_date: 2023-10-06
location: Thessaloniki, Greece
name: 'RV: Conference on Runtime Verification'
start_date: 2023-10-03
corr_author: '1'
date_created: 2023-10-29T23:01:15Z
date_published: 2023-10-01T00:00:00Z
date_updated: 2025-04-14T07:55:55Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/978-3-031-44267-4_15
ec_funded: 1
external_id:
arxiv:
- '2308.00341'
intvolume: ' 14245'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2308.00341
month: '10'
oa: 1
oa_version: Preprint
page: 291-311
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: 23rd International Conference on Runtime Verification
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031442667'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Monitoring algorithmic fairness under partial observations
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 14245
year: '2023'
...
---
_id: '14455'
acknowledgement: The author(s) declare that financial support was received for the
research, authorship, and/or publication of this article. This work has been partially
supported by Italian Ministry of Health Grant RC2023 (and the 5 × 1,000 voluntary
contributions). The authors thank the children and their families with whom they
work daily.
article_number: '1287879'
article_processing_charge: Yes
article_type: letter_note
author:
- first_name: Antonio
full_name: Narzisi, Antonio
last_name: Narzisi
- first_name: Alycia
full_name: Halladay, Alycia
last_name: Halladay
- first_name: Gabriele
full_name: Masi, Gabriele
last_name: Masi
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
- first_name: Catherine
full_name: Lord, Catherine
last_name: Lord
citation:
ama: 'Narzisi A, Halladay A, Masi G, Novarino G, Lord C. Tempering expectations:
Considerations on the current state of stem cells therapy for autism treatment.
Frontiers in Psychiatry. 2023;14. doi:10.3389/fpsyt.2023.1287879'
apa: 'Narzisi, A., Halladay, A., Masi, G., Novarino, G., & Lord, C. (2023).
Tempering expectations: Considerations on the current state of stem cells therapy
for autism treatment. Frontiers in Psychiatry. Frontiers. https://doi.org/10.3389/fpsyt.2023.1287879'
chicago: 'Narzisi, Antonio, Alycia Halladay, Gabriele Masi, Gaia Novarino, and Catherine
Lord. “Tempering Expectations: Considerations on the Current State of Stem Cells
Therapy for Autism Treatment.” Frontiers in Psychiatry. Frontiers, 2023.
https://doi.org/10.3389/fpsyt.2023.1287879.'
ieee: 'A. Narzisi, A. Halladay, G. Masi, G. Novarino, and C. Lord, “Tempering expectations:
Considerations on the current state of stem cells therapy for autism treatment,”
Frontiers in Psychiatry, vol. 14. Frontiers, 2023.'
ista: 'Narzisi A, Halladay A, Masi G, Novarino G, Lord C. 2023. Tempering expectations:
Considerations on the current state of stem cells therapy for autism treatment.
Frontiers in Psychiatry. 14, 1287879.'
mla: 'Narzisi, Antonio, et al. “Tempering Expectations: Considerations on the Current
State of Stem Cells Therapy for Autism Treatment.” Frontiers in Psychiatry,
vol. 14, 1287879, Frontiers, 2023, doi:10.3389/fpsyt.2023.1287879.'
short: A. Narzisi, A. Halladay, G. Masi, G. Novarino, C. Lord, Frontiers in Psychiatry
14 (2023).
date_created: 2023-10-29T23:01:16Z
date_published: 2023-10-03T00:00:00Z
date_updated: 2023-12-13T13:06:07Z
day: '03'
ddc:
- '570'
department:
- _id: GaNo
doi: 10.3389/fpsyt.2023.1287879
external_id:
isi:
- '001084841700001'
pmid:
- '37854442'
file:
- access_level: open_access
checksum: 0a76373e9a4c0fc199f80380de257e86
content_type: application/pdf
creator: dernst
date_created: 2023-10-30T12:48:40Z
date_updated: 2023-10-30T12:48:40Z
file_id: '14468'
file_name: 2023_FrontiersPsychiatry_Narzisi.pdf
file_size: 147878
relation: main_file
success: 1
file_date_updated: 2023-10-30T12:48:40Z
has_accepted_license: '1'
intvolume: ' 14'
isi: 1
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
pmid: 1
publication: Frontiers in Psychiatry
publication_identifier:
eissn:
- 1664-0640
publication_status: published
publisher: Frontiers
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Tempering expectations: Considerations on the current state of stem cells
therapy for autism treatment'
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: 14
year: '2023'
...
---
_id: '14456'
abstract:
- lang: eng
text: In this paper, we present novel algorithms that efficiently compute a shortest
reconfiguration sequence between two given dominating sets in trees and interval
graphs under the TOKEN SLIDING model. In this problem, a graph is provided along
with its two dominating sets, which can be imagined as tokens placed on vertices.
The objective is to find a shortest sequence of dominating sets that transforms
one set into the other, with each set in the sequence resulting from sliding a
single token in the previous set. While identifying any sequence has been well
studied, our work presents the first polynomial algorithms for this optimization
variant in the context of dominating sets.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Jan Matyáš
full_name: Křišťan, Jan Matyáš
last_name: Křišťan
- first_name: Jakub
full_name: Svoboda, Jakub
id: 130759D2-D7DD-11E9-87D2-DE0DE6697425
last_name: Svoboda
orcid: 0000-0002-1419-3267
citation:
ama: 'Křišťan JM, Svoboda J. Shortest dominating set reconfiguration under token
sliding. In: 24th International Symposium on Fundamentals of Computation Theory.
Vol 14292. Springer Nature; 2023:333-347. doi:10.1007/978-3-031-43587-4_24'
apa: 'Křišťan, J. M., & Svoboda, J. (2023). Shortest dominating set reconfiguration
under token sliding. In 24th International Symposium on Fundamentals of Computation
Theory (Vol. 14292, pp. 333–347). Trier, Germany: Springer Nature. https://doi.org/10.1007/978-3-031-43587-4_24'
chicago: Křišťan, Jan Matyáš, and Jakub Svoboda. “Shortest Dominating Set Reconfiguration
under Token Sliding.” In 24th International Symposium on Fundamentals of Computation
Theory, 14292:333–47. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-43587-4_24.
ieee: J. M. Křišťan and J. Svoboda, “Shortest dominating set reconfiguration under
token sliding,” in 24th International Symposium on Fundamentals of Computation
Theory, Trier, Germany, 2023, vol. 14292, pp. 333–347.
ista: 'Křišťan JM, Svoboda J. 2023. Shortest dominating set reconfiguration under
token sliding. 24th International Symposium on Fundamentals of Computation Theory.
FCT: Fundamentals of Computation Theory, LNCS, vol. 14292, 333–347.'
mla: Křišťan, Jan Matyáš, and Jakub Svoboda. “Shortest Dominating Set Reconfiguration
under Token Sliding.” 24th International Symposium on Fundamentals of Computation
Theory, vol. 14292, Springer Nature, 2023, pp. 333–47, doi:10.1007/978-3-031-43587-4_24.
short: J.M. Křišťan, J. Svoboda, in:, 24th International Symposium on Fundamentals
of Computation Theory, Springer Nature, 2023, pp. 333–347.
conference:
end_date: 2023-09-21
location: Trier, Germany
name: 'FCT: Fundamentals of Computation Theory'
start_date: 2023-09-18
date_created: 2023-10-29T23:01:16Z
date_published: 2023-09-21T00:00:00Z
date_updated: 2025-09-09T13:07:40Z
day: '21'
department:
- _id: KrCh
doi: 10.1007/978-3-031-43587-4_24
external_id:
arxiv:
- '2307.10847'
isi:
- '001162288800024'
intvolume: ' 14292'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2307.10847
month: '09'
oa: 1
oa_version: Preprint
page: 333-347
publication: 24th International Symposium on Fundamentals of Computation Theory
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031435867'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1007/978-3-031-43587-4_31
scopus_import: '1'
status: public
title: Shortest dominating set reconfiguration under token sliding
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 14292
year: '2023'
...
---
_id: '14457'
abstract:
- lang: eng
text: "Threshold secret sharing allows a dealer to split a secret s into n shares,
such that any t shares allow for reconstructing s, but no t-1 shares reveal any
information about s. Leakage-resilient secret sharing requires that the secret
remains hidden, even when an adversary additionally obtains a limited amount of
leakage from every share. Benhamouda et al. (CRYPTO’18) proved that Shamir’s secret
sharing scheme is one bit leakage-resilient for reconstruction threshold t≥0.85n
and conjectured that the same holds for t = c.n for any constant 0≤c≤1. Nielsen
and Simkin (EUROCRYPT’20) showed that this is the best one can hope for by proving
that Shamir’s scheme is not secure against one-bit leakage when t0c.n/log(n).\r\nIn
this work, we strengthen the lower bound of Nielsen and Simkin. We consider noisy
leakage-resilience, where a random subset of leakages is replaced by uniformly
random noise. We prove a lower bound for Shamir’s secret sharing, similar to that
of Nielsen and Simkin, which holds even when a constant fraction of leakages is
replaced by random noise. To this end, we first prove a lower bound on the share
size of any noisy-leakage-resilient sharing scheme. We then use this lower bound
to show that there exist universal constants c1, c2, such that for sufficiently
large n it holds that Shamir’s secret sharing scheme is not noisy-leakage-resilient
for t≤c1.n/log(n), even when a c2 fraction of leakages are replaced by random
noise.\r\n\r\n\r\n\r\n"
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Charlotte
full_name: Hoffmann, Charlotte
id: 0f78d746-dc7d-11ea-9b2f-83f92091afe7
last_name: Hoffmann
orcid: 0000-0003-2027-5549
- first_name: Mark
full_name: Simkin, Mark
last_name: Simkin
citation:
ama: 'Hoffmann C, Simkin M. Stronger lower bounds for leakage-resilient secret sharing.
In: 8th International Conference on Cryptology and Information Security in
Latin America. Vol 14168. Springer Nature; 2023:215-228. doi:10.1007/978-3-031-44469-2_11'
apa: 'Hoffmann, C., & Simkin, M. (2023). Stronger lower bounds for leakage-resilient
secret sharing. In 8th International Conference on Cryptology and Information
Security in Latin America (Vol. 14168, pp. 215–228). Quito, Ecuador: Springer
Nature. https://doi.org/10.1007/978-3-031-44469-2_11'
chicago: Hoffmann, Charlotte, and Mark Simkin. “Stronger Lower Bounds for Leakage-Resilient
Secret Sharing.” In 8th International Conference on Cryptology and Information
Security in Latin America, 14168:215–28. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-44469-2_11.
ieee: C. Hoffmann and M. Simkin, “Stronger lower bounds for leakage-resilient secret
sharing,” in 8th International Conference on Cryptology and Information Security
in Latin America, Quito, Ecuador, 2023, vol. 14168, pp. 215–228.
ista: 'Hoffmann C, Simkin M. 2023. Stronger lower bounds for leakage-resilient secret
sharing. 8th International Conference on Cryptology and Information Security in
Latin America. LATINCRYPT: Cryptology and Information Security in Latin America,
LNCS, vol. 14168, 215–228.'
mla: Hoffmann, Charlotte, and Mark Simkin. “Stronger Lower Bounds for Leakage-Resilient
Secret Sharing.” 8th International Conference on Cryptology and Information
Security in Latin America, vol. 14168, Springer Nature, 2023, pp. 215–28,
doi:10.1007/978-3-031-44469-2_11.
short: C. Hoffmann, M. Simkin, in:, 8th International Conference on Cryptology and
Information Security in Latin America, Springer Nature, 2023, pp. 215–228.
conference:
end_date: 2023-10-06
location: Quito, Ecuador
name: 'LATINCRYPT: Cryptology and Information Security in Latin America'
start_date: 2023-10-03
corr_author: '1'
date_created: 2023-10-29T23:01:16Z
date_published: 2023-10-01T00:00:00Z
date_updated: 2025-09-09T13:09:21Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-031-44469-2_11
external_id:
isi:
- '001157041900011'
intvolume: ' 14168'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2023/1017
month: '10'
oa: 1
oa_version: Preprint
page: 215-228
publication: 8th International Conference on Cryptology and Information Security in
Latin America
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031444685'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Stronger lower bounds for leakage-resilient secret sharing
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 14168
year: '2023'
...
---
_id: '14460'
abstract:
- lang: eng
text: We provide an efficient implementation of the backpropagation algorithm, specialized
to the case where the weights of the neural network being trained are sparse.
Our algorithm is general, as it applies to arbitrary (unstructured) sparsity and
common layer types (e.g., convolutional or linear). We provide a fast vectorized
implementation on commodity CPUs, and show that it can yield speedups in end-to-end
runtime experiments, both in transfer learning using already-sparsified networks,
and in training sparse networks from scratch. Thus, our results provide the first
support for sparse training on commodity hardware.
acknowledgement: 'We would like to thank Elias Frantar for his valuable assistance
and support at the outset of this project, and the anonymous ICML and SNN reviewers
for very constructive feedback. EI was supported in part by the FWF DK VGSCO, grant
agreement number W1260-N35. DA acknowledges generous ERC support, via Starting Grant
805223 ScaleML. '
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Mahdi
full_name: Nikdan, Mahdi
id: 66374281-f394-11eb-9cf6-869147deecc0
last_name: Nikdan
- first_name: Tommaso
full_name: Pegolotti, Tommaso
last_name: Pegolotti
- first_name: Eugenia B
full_name: Iofinova, Eugenia B
id: f9a17499-f6e0-11ea-865d-fdf9a3f77117
last_name: Iofinova
orcid: 0000-0002-7778-3221
- first_name: Eldar
full_name: Kurtic, Eldar
id: 47beb3a5-07b5-11eb-9b87-b108ec578218
last_name: Kurtic
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Nikdan M, Pegolotti T, Iofinova EB, Kurtic E, Alistarh D-A. SparseProp: Efficient
sparse backpropagation for faster training of neural networks at the edge. In:
Proceedings of the 40th International Conference on Machine Learning. Vol
202. ML Research Press; 2023:26215-26227.'
apa: 'Nikdan, M., Pegolotti, T., Iofinova, E. B., Kurtic, E., & Alistarh, D.-A.
(2023). SparseProp: Efficient sparse backpropagation for faster training of neural
networks at the edge. In Proceedings of the 40th International Conference on
Machine Learning (Vol. 202, pp. 26215–26227). Honolulu, Hawaii, HI, United
States: ML Research Press.'
chicago: 'Nikdan, Mahdi, Tommaso Pegolotti, Eugenia B Iofinova, Eldar Kurtic, and
Dan-Adrian Alistarh. “SparseProp: Efficient Sparse Backpropagation for Faster
Training of Neural Networks at the Edge.” In Proceedings of the 40th International
Conference on Machine Learning, 202:26215–27. ML Research Press, 2023.'
ieee: 'M. Nikdan, T. Pegolotti, E. B. Iofinova, E. Kurtic, and D.-A. Alistarh, “SparseProp:
Efficient sparse backpropagation for faster training of neural networks at the
edge,” in Proceedings of the 40th International Conference on Machine Learning,
Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 26215–26227.'
ista: 'Nikdan M, Pegolotti T, Iofinova EB, Kurtic E, Alistarh D-A. 2023. SparseProp:
Efficient sparse backpropagation for faster training of neural networks at the
edge. Proceedings of the 40th International Conference on Machine Learning. ICML:
International Conference on Machine Learning, PMLR, vol. 202, 26215–26227.'
mla: 'Nikdan, Mahdi, et al. “SparseProp: Efficient Sparse Backpropagation for Faster
Training of Neural Networks at the Edge.” Proceedings of the 40th International
Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 26215–27.'
short: M. Nikdan, T. Pegolotti, E.B. Iofinova, E. Kurtic, D.-A. Alistarh, in:, Proceedings
of the 40th International Conference on Machine Learning, ML Research Press, 2023,
pp. 26215–26227.
conference:
end_date: 2023-07-29
location: Honolulu, Hawaii, HI, United States
name: 'ICML: International Conference on Machine Learning'
start_date: 2023-07-23
corr_author: '1'
date_created: 2023-10-29T23:01:17Z
date_published: 2023-07-30T00:00:00Z
date_updated: 2025-04-14T07:49:12Z
day: '30'
department:
- _id: DaAl
ec_funded: 1
external_id:
arxiv:
- '2302.04852'
intvolume: ' 202'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2302.04852
month: '07'
oa: 1
oa_version: Preprint
page: 26215-26227
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: Proceedings of the 40th International Conference on Machine Learning
publication_identifier:
eissn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'SparseProp: Efficient sparse backpropagation for faster training of neural
networks at the edge'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 202
year: '2023'
...
---
_id: '14462'
abstract:
- lang: eng
text: "We study fine-grained error bounds for differentially private algorithms
for counting under continual observation. Our main insight is that the matrix
mechanism when using lower-triangular matrices can be used in the continual observation
model. More specifically, we give an explicit factorization for the counting matrix
Mcount and upper bound the error explicitly. We also give a fine-grained analysis,
specifying the exact constant in the upper bound. Our analysis is based on upper
and lower bounds of the completely bounded norm (cb-norm) of Mcount\r\n. Along
the way, we improve the best-known bound of 28 years by Mathias (SIAM Journal
on Matrix Analysis and Applications, 1993) on the cb-norm of Mcount for a large
range of the dimension of Mcount. Furthermore, we are the first to give concrete
error bounds for various problems under continual observation such as binary counting,
maintaining a histogram, releasing an approximately cut-preserving synthetic graph,
many graph-based statistics, and substring and episode counting. Finally, we note
that our result can be used to get a fine-grained error bound for non-interactive
local learning and the first lower bounds on the additive error for (ϵ,δ)-differentially-private
counting under continual observation. Subsequent to this work, Henzinger et al.
(SODA, 2023) showed that our factorization also achieves fine-grained mean-squared
error."
acknowledgement: "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.\r\n101019564 “The Design of Modern Fully Dynamic Data Structures
(MoDynStruct)” and from the Austrian Science Fund (FWF) project Z 422-N, and project
“Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional
funding from the netidee SCIENCE Stiftung, 2020–2024. 2020–2024. JU’s research was
funded by Decanal Research Grant. A part of this work was done when JU was visiting
Indian Statistical Institute, Delhi. The authors would like to thank Rajat Bhatia,
Aleksandar Nikolov, Shanta Laisharam, Vern Paulsen, Ryan Rogers, Abhradeep Thakurta,
and Sarvagya Upadhyay for useful discussions."
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Hendrik
full_name: Fichtenberger, Hendrik
last_name: Fichtenberger
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Jalaj
full_name: Upadhyay, Jalaj
last_name: Upadhyay
citation:
ama: 'Fichtenberger H, Henzinger M, Upadhyay J. Constant matters: Fine-grained error
bound on differentially private continual observation. In: Proceedings of the
40th International Conference on Machine Learning. Vol 202. ML Research Press;
2023:10072-10092.'
apa: 'Fichtenberger, H., Henzinger, M., & Upadhyay, J. (2023). Constant matters:
Fine-grained error bound on differentially private continual observation. In Proceedings
of the 40th International Conference on Machine Learning (Vol. 202, pp. 10072–10092).
Honolulu, Hawaii, HI, United States: ML Research Press.'
chicago: 'Fichtenberger, Hendrik, Monika Henzinger, and Jalaj Upadhyay. “Constant
Matters: Fine-Grained Error Bound on Differentially Private Continual Observation.”
In Proceedings of the 40th International Conference on Machine Learning,
202:10072–92. ML Research Press, 2023.'
ieee: 'H. Fichtenberger, M. Henzinger, and J. Upadhyay, “Constant matters: Fine-grained
error bound on differentially private continual observation,” in Proceedings
of the 40th International Conference on Machine Learning, Honolulu, Hawaii,
HI, United States, 2023, vol. 202, pp. 10072–10092.'
ista: 'Fichtenberger H, Henzinger M, Upadhyay J. 2023. Constant matters: Fine-grained
error bound on differentially private continual observation. Proceedings of the
40th International Conference on Machine Learning. ICML: International Conference
on Machine Learning, PMLR, vol. 202, 10072–10092.'
mla: 'Fichtenberger, Hendrik, et al. “Constant Matters: Fine-Grained Error Bound
on Differentially Private Continual Observation.” Proceedings of the 40th International
Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 10072–92.'
short: H. Fichtenberger, M. Henzinger, J. Upadhyay, in:, Proceedings of the 40th
International Conference on Machine Learning, ML Research Press, 2023, pp. 10072–10092.
conference:
end_date: 2023-07-29
location: Honolulu, Hawaii, HI, United States
name: 'ICML: International Conference on Machine Learning'
start_date: 2023-07-23
corr_author: '1'
date_created: 2023-10-29T23:01:17Z
date_published: 2023-07-30T00:00:00Z
date_updated: 2025-05-19T10:59:58Z
day: '30'
department:
- _id: MoHe
ec_funded: 1
external_id:
arxiv:
- '2202.11205'
intvolume: ' 202'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://proceedings.mlr.press/v202/fichtenberger23a/fichtenberger23a.pdf
month: '07'
oa: 1
oa_version: Published Version
page: 10072-10092
project:
- _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62
call_identifier: H2020
grant_number: '101019564'
name: The design and evaluation of modern fully dynamic data structures
- _id: 34def286-11ca-11ed-8bc3-da5948e1613c
grant_number: Z00422
name: Efficient algorithms
- _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe
grant_number: P33775
name: Fast Algorithms for a Reactive Network Layer
publication: Proceedings of the 40th International Conference on Machine Learning
publication_identifier:
eissn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Constant matters: Fine-grained error bound on differentially private continual
observation'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 202
year: '2023'
...
---
_id: '14464'
abstract:
- lang: eng
text: 'Given a triangle Δ, we study the problem of determining the smallest enclosing
and largest embedded isosceles triangles of Δ with respect to area and perimeter.
This problem was initially posed by Nandakumar [17, 22] and was first studied
by Kiss, Pach, and Somlai [13], who showed that if Δ′ is the smallest area isosceles
triangle containing Δ, then Δ′ and Δ share a side and an angle. In the present
paper, we prove that for any triangle Δ, every maximum area isosceles triangle
embedded in Δ and every maximum perimeter isosceles triangle embedded in Δ shares
a side and an angle with Δ. Somewhat surprisingly, the case of minimum perimeter
enclosing triangles is different: there are infinite families of triangles Δ whose
minimum perimeter isosceles containers do not share a side and an angle with Δ.'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Áron
full_name: Ambrus, Áron
last_name: Ambrus
- first_name: Mónika
full_name: Csikós, Mónika
last_name: Csikós
- first_name: Gergely
full_name: Kiss, Gergely
last_name: Kiss
- first_name: János
full_name: Pach, János
id: E62E3130-B088-11EA-B919-BF823C25FEA4
last_name: Pach
- first_name: Gábor
full_name: Somlai, Gábor
last_name: Somlai
citation:
ama: Ambrus Á, Csikós M, Kiss G, Pach J, Somlai G. Optimal embedded and enclosing
isosceles triangles. International Journal of Foundations of Computer Science.
2023;34(7):737-760. doi:10.1142/S012905412342008X
apa: Ambrus, Á., Csikós, M., Kiss, G., Pach, J., & Somlai, G. (2023). Optimal
embedded and enclosing isosceles triangles. International Journal of Foundations
of Computer Science. World Scientific Publishing. https://doi.org/10.1142/S012905412342008X
chicago: Ambrus, Áron, Mónika Csikós, Gergely Kiss, János Pach, and Gábor Somlai.
“Optimal Embedded and Enclosing Isosceles Triangles.” International Journal
of Foundations of Computer Science. World Scientific Publishing, 2023. https://doi.org/10.1142/S012905412342008X.
ieee: Á. Ambrus, M. Csikós, G. Kiss, J. Pach, and G. Somlai, “Optimal embedded and
enclosing isosceles triangles,” International Journal of Foundations of Computer
Science, vol. 34, no. 7. World Scientific Publishing, pp. 737–760, 2023.
ista: Ambrus Á, Csikós M, Kiss G, Pach J, Somlai G. 2023. Optimal embedded and enclosing
isosceles triangles. International Journal of Foundations of Computer Science.
34(7), 737–760.
mla: Ambrus, Áron, et al. “Optimal Embedded and Enclosing Isosceles Triangles.”
International Journal of Foundations of Computer Science, vol. 34, no.
7, World Scientific Publishing, 2023, pp. 737–60, doi:10.1142/S012905412342008X.
short: Á. Ambrus, M. Csikós, G. Kiss, J. Pach, G. Somlai, International Journal
of Foundations of Computer Science 34 (2023) 737–760.
date_created: 2023-10-29T23:01:18Z
date_published: 2023-10-05T00:00:00Z
date_updated: 2023-12-13T13:04:55Z
day: '05'
department:
- _id: HeEd
doi: 10.1142/S012905412342008X
external_id:
arxiv:
- '2205.11637'
isi:
- '001080874400001'
intvolume: ' 34'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2205.11637
month: '10'
oa: 1
oa_version: Preprint
page: 737-760
publication: International Journal of Foundations of Computer Science
publication_identifier:
eissn:
- 1793-6373
issn:
- 0129-0541
publication_status: published
publisher: World Scientific Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimal embedded and enclosing isosceles triangles
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2023'
...
---
_id: '14472'
abstract:
- lang: eng
text: "Data related to the following paper:\r\n\"Stress granules plug and stabilize
damaged endolysosomal membranes\" (https://doi.org/10.1038/s41586-023-06726-w)\r\n\r\nAbstract:
\r\nEndomembrane damage represents a form of stress that is detrimental for eukaryotic
cells. To cope with this threat, cells possess mechanisms that repair the damage
and restore cellular homeostasis. Endomembrane damage also results in organelle
instability and the mechanisms by which cells stabilize damaged endomembranes
to enable membrane repair remains unknown. In this work we use a minimal coarse-grained
molecular dynamics system to explore how lipid vesicles undergoing poration in
a protein-rich medium can be plugged and stabilised by condensate formation. The
solution of proteins in and out of the vesicle is described by beads dispersed
in implicit solvent. The membrane is described as a one-bead-thick fluid elastic
layer of mechanical properties that mimic biological membranes. We tune the interactions
between solution beads in the different compartments to capture the differences
between the cytoplasmic and endosomal protein solutions and explore how the system
responds to different degrees of membrane poration. We find that, in the right
interaction regime, condensates form rapidly at the damage site upon solution
mixing and act as a plug that prevents futher mixing and destabilisation of the
vesicle. Further, when the condensate can interact with the membrane (wetting
interactions) we find that it mediates pore sealing and membrane repair. This
research is part of the work published in \"Stress granules plug and stabilize
damaged endolysosomal membranes\", Bussi et al, Nature, 2023 - 10.1038/s41586-023-06726-w."
article_processing_charge: No
author:
- first_name: Christian Eduardo
full_name: Vanhille-Campos, Christian Eduardo
id: 3adeca52-9313-11ed-b1ac-c170b2505714
last_name: Vanhille-Campos
- first_name: Anđela
full_name: Šarić, Anđela
id: bf63d406-f056-11eb-b41d-f263a6566d8b
last_name: Šarić
orcid: 0000-0002-7854-2139
citation:
ama: Vanhille-Campos CE, Šarić A. Stress granules plug and stabilize damaged endolysosomal
membranes. 2023. doi:10.15479/AT:ISTA:14472
apa: Vanhille-Campos, C. E., & Šarić, A. (2023). Stress granules plug and stabilize
damaged endolysosomal membranes. Institute of Science and Technology Austria.
https://doi.org/10.15479/AT:ISTA:14472
chicago: Vanhille-Campos, Christian Eduardo, and Anđela Šarić. “Stress Granules
Plug and Stabilize Damaged Endolysosomal Membranes.” Institute of Science and
Technology Austria, 2023. https://doi.org/10.15479/AT:ISTA:14472.
ieee: C. E. Vanhille-Campos and A. Šarić, “Stress granules plug and stabilize damaged
endolysosomal membranes.” Institute of Science and Technology Austria, 2023.
ista: Vanhille-Campos CE, Šarić A. 2023. Stress granules plug and stabilize damaged
endolysosomal membranes, Institute of Science and Technology Austria, 10.15479/AT:ISTA:14472.
mla: Vanhille-Campos, Christian Eduardo, and Anđela Šarić. Stress Granules Plug
and Stabilize Damaged Endolysosomal Membranes. Institute of Science and Technology
Austria, 2023, doi:10.15479/AT:ISTA:14472.
short: C.E. Vanhille-Campos, A. Šarić, (2023).
corr_author: '1'
date_created: 2023-10-30T16:38:32Z
date_published: 2023-10-31T00:00:00Z
date_updated: 2025-09-09T13:30:33Z
day: '31'
ddc:
- '570'
department:
- _id: AnSa
doi: 10.15479/AT:ISTA:14472
file:
- access_level: open_access
checksum: a18706e952e8660c51ede52a167270b7
content_type: application/zip
creator: ipalaia
date_created: 2023-10-30T16:31:08Z
date_updated: 2023-10-30T16:31:08Z
file_id: '14473'
file_name: SGporecondensation-main.zip
file_size: 62821432
relation: main_file
success: 1
- access_level: open_access
checksum: 389eab31c6509dbc05795017fb618758
content_type: text/plain
creator: dernst
date_created: 2023-10-31T08:57:50Z
date_updated: 2023-10-31T08:57:50Z
file_id: '14474'
file_name: README.txt
file_size: 1697
relation: main_file
success: 1
file_date_updated: 2023-10-31T08:57:50Z
has_accepted_license: '1'
license: https://creativecommons.org/publicdomain/zero/1.0/
month: '10'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '14610'
relation: used_in_publication
status: public
status: public
title: Stress granules plug and stabilize damaged endolysosomal membranes
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14485'
abstract:
- lang: eng
text: "Batching is a technique that stores multiple keys/values in each node of
a data structure. In sequential search data structures, batching reduces latency
by reducing the number of cache misses and shortening the chain of pointers to
dereference. Applying batching to concurrent data structures is challenging, because
it is difficult to maintain the search property and keep contention low in the
presence of batching.\r\nIn this paper, we present a general methodology for leveraging
batching in concurrent search data structures, called BatchBoost. BatchBoost builds
a search data structure from distinct \"data\" and \"index\" layers. The data
layer’s purpose is to store a batch of key/value pairs in each of its nodes. The
index layer uses an unmodified concurrent search data structure to route operations
to a position in the data layer that is \"close\" to where the corresponding key
should exist. The requirements on the index and data layers are low: with minimal
effort, we were able to compose three highly scalable concurrent search data structures
based on three original data structures as the index layers with a batched version
of the Lazy List as the data layer. The resulting BatchBoost data structures provide
significant performance improvements over their original counterparts."
alternative_title:
- LIPIcs
article_number: '35'
article_processing_charge: Yes
author:
- first_name: Vitaly
full_name: Aksenov, Vitaly
last_name: Aksenov
- first_name: Michael
full_name: Anoprenko, Michael
last_name: Anoprenko
- first_name: Alexander
full_name: Fedorov, Alexander
id: 2e711909-896a-11ed-bdf8-eb0f5a2984c6
last_name: Fedorov
- first_name: Michael
full_name: Spear, Michael
last_name: Spear
citation:
ama: 'Aksenov V, Anoprenko M, Fedorov A, Spear M. Brief announcement: BatchBoost:
Universal batching for concurrent data structures. In: 37th International Symposium
on Distributed Computing. Vol 281. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2023. doi:10.4230/LIPIcs.DISC.2023.35'
apa: 'Aksenov, V., Anoprenko, M., Fedorov, A., & Spear, M. (2023). Brief announcement:
BatchBoost: Universal batching for concurrent data structures. In 37th International
Symposium on Distributed Computing (Vol. 281). L’Aquila, Italy: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2023.35'
chicago: 'Aksenov, Vitaly, Michael Anoprenko, Alexander Fedorov, and Michael Spear.
“Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures.”
In 37th International Symposium on Distributed Computing, Vol. 281. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.DISC.2023.35.'
ieee: 'V. Aksenov, M. Anoprenko, A. Fedorov, and M. Spear, “Brief announcement:
BatchBoost: Universal batching for concurrent data structures,” in 37th International
Symposium on Distributed Computing, L’Aquila, Italy, 2023, vol. 281.'
ista: 'Aksenov V, Anoprenko M, Fedorov A, Spear M. 2023. Brief announcement: BatchBoost:
Universal batching for concurrent data structures. 37th International Symposium
on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol.
281, 35.'
mla: 'Aksenov, Vitaly, et al. “Brief Announcement: BatchBoost: Universal Batching
for Concurrent Data Structures.” 37th International Symposium on Distributed
Computing, vol. 281, 35, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2023, doi:10.4230/LIPIcs.DISC.2023.35.'
short: V. Aksenov, M. Anoprenko, A. Fedorov, M. Spear, in:, 37th International Symposium
on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
conference:
end_date: 2023-10-13
location: L'Aquila, Italy
name: 'DISC: Symposium on Distributed Computing'
start_date: 2023-10-09
corr_author: '1'
date_created: 2023-11-05T23:00:53Z
date_published: 2023-10-01T00:00:00Z
date_updated: 2024-10-09T21:07:14Z
day: '01'
ddc:
- '000'
department:
- _id: GradSch
doi: 10.4230/LIPIcs.DISC.2023.35
file:
- access_level: open_access
checksum: d9f8d2915cccdf2df5905b7cd1b4a560
content_type: application/pdf
creator: dernst
date_created: 2023-11-06T11:45:21Z
date_updated: 2023-11-06T11:45:21Z
file_id: '14492'
file_name: 2023_LIPIcs_Aksenov.pdf
file_size: 646665
relation: main_file
success: 1
file_date_updated: 2023-11-06T11:45:21Z
has_accepted_license: '1'
intvolume: ' 281'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
publication: 37th International Symposium on Distributed Computing
publication_identifier:
isbn:
- '9783959773010'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Brief announcement: BatchBoost: Universal batching for concurrent data structures'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 281
year: '2023'
...
---
_id: '14486'
abstract:
- lang: eng
text: We present a minimal model of ferroelectric large polarons, which are suggested
as one of the mechanisms responsible for the unique charge transport properties
of hybrid perovskites. We demonstrate that short-ranged charge–rotor interactions
lead to long-range ferroelectric ordering of rotors, which strongly affects the
carrier mobility. In the nonperturbative regime, where our theory cannot be reduced
to any of the earlier models, we reveal that the polaron is characterized by large
coherence length and a roughly tenfold increase of the effective mass as compared
to the bare mass. These results are in good agreement with other theoretical predictions
for ferroelectric polarons. Our model establishes a general phenomenological framework
for ferroelectric polarons providing the starting point for future studies of
their role in the transport properties of hybrid organic-inorganic perovskites.
acknowledgement: We thank Zh. Alpichshev, A. Volosniev, and A. V. Zampetaki for fruitful
discussions and comments. This project received funding from the European Union’s
Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie
Grant Agreement No. 101034413. M.L. acknowledges support by the European Research
Council (ERC) Starting Grant No. 801770 (ANGULON).
article_number: '043016'
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Georgios
full_name: Koutentakis, Georgios
id: d7b23d3a-9e21-11ec-b482-f76739596b95
last_name: Koutentakis
- first_name: Areg
full_name: Ghazaryan, Areg
id: 4AF46FD6-F248-11E8-B48F-1D18A9856A87
last_name: Ghazaryan
orcid: 0000-0001-9666-3543
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Koutentakis G, Ghazaryan A, Lemeshko M. Rotor lattice model of ferroelectric
large polarons. Physical Review Research. 2023;5(4). doi:10.1103/PhysRevResearch.5.043016
apa: Koutentakis, G., Ghazaryan, A., & Lemeshko, M. (2023). Rotor lattice model
of ferroelectric large polarons. Physical Review Research. American Physical
Society. https://doi.org/10.1103/PhysRevResearch.5.043016
chicago: Koutentakis, Georgios, Areg Ghazaryan, and Mikhail Lemeshko. “Rotor Lattice
Model of Ferroelectric Large Polarons.” Physical Review Research. American
Physical Society, 2023. https://doi.org/10.1103/PhysRevResearch.5.043016.
ieee: G. Koutentakis, A. Ghazaryan, and M. Lemeshko, “Rotor lattice model of ferroelectric
large polarons,” Physical Review Research, vol. 5, no. 4. American Physical
Society, 2023.
ista: Koutentakis G, Ghazaryan A, Lemeshko M. 2023. Rotor lattice model of ferroelectric
large polarons. Physical Review Research. 5(4), 043016.
mla: Koutentakis, Georgios, et al. “Rotor Lattice Model of Ferroelectric Large Polarons.”
Physical Review Research, vol. 5, no. 4, 043016, American Physical Society,
2023, doi:10.1103/PhysRevResearch.5.043016.
short: G. Koutentakis, A. Ghazaryan, M. Lemeshko, Physical Review Research 5 (2023).
corr_author: '1'
date_created: 2023-11-05T23:00:53Z
date_published: 2023-10-05T00:00:00Z
date_updated: 2025-04-14T07:48:54Z
day: '05'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.1103/PhysRevResearch.5.043016
ec_funded: 1
external_id:
arxiv:
- '2301.09875'
file:
- access_level: open_access
checksum: cb8de8fed6e09df1a18bd5a5aec5c55c
content_type: application/pdf
creator: dernst
date_created: 2023-11-07T07:52:46Z
date_updated: 2023-11-07T07:52:46Z
file_id: '14493'
file_name: 2023_PhysReviewResearch_Koutentakis.pdf
file_size: 1127522
relation: main_file
success: 1
file_date_updated: 2023-11-07T07:52:46Z
has_accepted_license: '1'
intvolume: ' 5'
issue: '4'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
- _id: 2688CF98-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '801770'
name: 'Angulon: physics and applications of a new quasiparticle'
publication: Physical Review Research
publication_identifier:
issn:
- 2643-1564
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Rotor lattice model of ferroelectric large polarons
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: 5
year: '2023'
...
---
_id: '14487'
abstract:
- lang: eng
text: High Mountain Asia (HMA) is among the most vulnerable water towers globally
and yet future projections of water availability in and from its high-mountain
catchments remain uncertain, as their hydrologic response to ongoing environmental
changes is complex. Mechanistic modeling approaches incorporating cryospheric,
hydrological, and vegetation processes in high spatial, temporal, and physical
detail have never been applied for high-elevation catchments of HMA. We use a
land surface model at high spatial and temporal resolution (100 m and hourly)
to simulate the coupled dynamics of energy, water, and vegetation for the 350
km2 Langtang catchment (Nepal). We compare our model outputs for one hydrological
year against a large set of observations to gain insight into the partitioning
of the water balance at the subseasonal scale and across elevation bands. During
the simulated hydrological year, we find that evapotranspiration is a key component
of the total water balance, as it causes about the equivalent of 20% of all the
available precipitation or 154% of the water production from glacier melt in the
basin to return directly to the atmosphere. The depletion of the cryospheric water
budget is dominated by snow melt, but at high elevations is primarily dictated
by snow and ice sublimation. Snow sublimation is the dominant vapor flux (49%)
at the catchment scale, accounting for the equivalent of 11% of snowfall, 17%
of snowmelt, and 75% of ice melt, respectively. We conclude that simulations should
consider sublimation and other evaporative fluxes explicitly, as otherwise water
balance estimates can be ill-quantified.
acknowledgement: This project has received funding from the JSPS-SNSF (Japan Society
for the Promotion of Science and Swiss National Science Foundation) Bilateral Programmes
project (HOPE, High-ele-vation precipitation in High Mountain Asia; Grant 183633),
and the European Research Council (ERC) under the European Union's Horizon 2020
research and innovation program (RAVEN, Rapid mass losses of debris-covered glaciers
in High Mountain Asia; Grant 772751). We want to thank in particular T. Gurung,
S. Joshi, J. Shea, W. Immerzeel, and others involved, as well as ICIMOD, for their
efforts over the past years in observing the meteorology of the Langtang catchment,
collecting and organizing the data and making them publicly available. We also thank
the National Geographic Society (Grant NGS-61784R-19) and the Mount Everest Foundation
(reference 19-24) for providing fieldwork funding for C. L. Fyffe. We thank T. Kramer
for help with the WSL Hyperion cluster. We are grate-ful for comments by three anonymous
reviewers and the Associate Editor, who greatly helped to improve the manuscript
further. Open access funding provided by ETH-Bereich Forschungsanstalten.
article_number: e2022WR033841
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Pascal
full_name: Buri, Pascal
last_name: Buri
- first_name: Simone
full_name: Fatichi, Simone
last_name: Fatichi
- first_name: Thomas
full_name: Shaw, Thomas
id: 3caa3f91-1f03-11ee-96ce-e0e553054d6e
last_name: Shaw
orcid: 0000-0001-7640-6152
- first_name: Evan S.
full_name: Miles, Evan S.
last_name: Miles
- first_name: Michael
full_name: Mccarthy, Michael
id: 22a2674a-61ce-11ee-94b5-d18813baf16f
last_name: Mccarthy
- first_name: Catriona Louise
full_name: Fyffe, Catriona Louise
id: 001b0422-8d15-11ed-bc51-cab6c037a228
last_name: Fyffe
- first_name: Stefan
full_name: Fugger, Stefan
last_name: Fugger
- first_name: Shaoting
full_name: Ren, Shaoting
last_name: Ren
- first_name: Marin
full_name: Kneib, Marin
last_name: Kneib
- first_name: Achille
full_name: Jouberton, Achille
last_name: Jouberton
- first_name: Jakob
full_name: Steiner, Jakob
last_name: Steiner
- first_name: Koji
full_name: Fujita, Koji
last_name: Fujita
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
orcid: 0000-0002-5554-8087
citation:
ama: 'Buri P, Fatichi S, Shaw T, et al. Land surface modeling in the Himalayas:
On the importance of evaporative fluxes for the water balance of a high-elevation
catchment. Water Resources Research. 2023;59(10). doi:10.1029/2022WR033841'
apa: 'Buri, P., Fatichi, S., Shaw, T., Miles, E. S., McCarthy, M., Fyffe, C. L.,
… Pellicciotti, F. (2023). Land surface modeling in the Himalayas: On the importance
of evaporative fluxes for the water balance of a high-elevation catchment. Water
Resources Research. Wiley. https://doi.org/10.1029/2022WR033841'
chicago: 'Buri, Pascal, Simone Fatichi, Thomas Shaw, Evan S. Miles, Michael McCarthy,
Catriona Louise Fyffe, Stefan Fugger, et al. “Land Surface Modeling in the Himalayas:
On the Importance of Evaporative Fluxes for the Water Balance of a High-Elevation
Catchment.” Water Resources Research. Wiley, 2023. https://doi.org/10.1029/2022WR033841.'
ieee: 'P. Buri et al., “Land surface modeling in the Himalayas: On the importance
of evaporative fluxes for the water balance of a high-elevation catchment,” Water
Resources Research, vol. 59, no. 10. Wiley, 2023.'
ista: 'Buri P, Fatichi S, Shaw T, Miles ES, McCarthy M, Fyffe CL, Fugger S, Ren
S, Kneib M, Jouberton A, Steiner J, Fujita K, Pellicciotti F. 2023. Land surface
modeling in the Himalayas: On the importance of evaporative fluxes for the water
balance of a high-elevation catchment. Water Resources Research. 59(10), e2022WR033841.'
mla: 'Buri, Pascal, et al. “Land Surface Modeling in the Himalayas: On the Importance
of Evaporative Fluxes for the Water Balance of a High-Elevation Catchment.” Water
Resources Research, vol. 59, no. 10, e2022WR033841, Wiley, 2023, doi:10.1029/2022WR033841.'
short: P. Buri, S. Fatichi, T. Shaw, E.S. Miles, M. McCarthy, C.L. Fyffe, S. Fugger,
S. Ren, M. Kneib, A. Jouberton, J. Steiner, K. Fujita, F. Pellicciotti, Water
Resources Research 59 (2023).
date_created: 2023-11-05T23:00:53Z
date_published: 2023-10-25T00:00:00Z
date_updated: 2025-09-09T13:15:40Z
day: '25'
ddc:
- '550'
department:
- _id: FrPe
doi: 10.1029/2022WR033841
external_id:
isi:
- '001091989600005'
file:
- access_level: open_access
checksum: 7ba9c87228dc09029b16bc800a0ef1a1
content_type: application/pdf
creator: dernst
date_created: 2023-11-07T08:10:44Z
date_updated: 2023-11-07T08:10:44Z
file_id: '14495'
file_name: 2023_WaterResourcesResearch_Buri.pdf
file_size: 5554901
relation: main_file
success: 1
file_date_updated: 2023-11-07T08:10:44Z
has_accepted_license: '1'
intvolume: ' 59'
isi: 1
issue: '10'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
publication: Water Resources Research
publication_identifier:
eissn:
- 1944-7973
issn:
- 0043-1397
publication_status: published
publisher: Wiley
quality_controlled: '1'
related_material:
record:
- id: '14494'
relation: research_data
status: public
scopus_import: '1'
status: public
title: 'Land surface modeling in the Himalayas: On the importance of evaporative fluxes
for the water balance of a high-elevation catchment'
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 59
year: '2023'
...
---
_id: '14489'
abstract:
- lang: eng
text: Microwave-optics entanglement is a vital component for building hybrid quantum
networks. Here, a new mechanism for preparing stationary entanglement between
microwave and optical cavity fields in a cavity optomagnomechanical system is
proposed. It consists of a magnon mode in a ferrimagnetic crystal that couples
directly to a microwave cavity mode via the magnetic dipole interaction and indirectly
to an optical cavity through the deformation displacement of the crystal. The
mechanical displacement is induced by the magnetostrictive force and coupled to
the optical cavity via radiation pressure. Both the opto- and magnomechanical
couplings are dispersive. Magnon–phonon entanglement is created via magnomechanical
parametric down-conversion, which is further distributed to optical and microwave
photons via simultaneous optomechanical beamsplitter interaction and electromagnonic
state-swap interaction, yielding stationary microwave-optics entanglement. The
microwave-optics entanglement is robust against thermal noise, which will find
broad potential applications in quantum networks and quantum information processing
with hybrid quantum systems.
acknowledgement: This work was supported by the National Key Research and Development
Program of China (Grant no. 2022YFA1405200), the National Natural Science Foundation
of China (Nos. 92265202), and the European Research Council (ERC CoG Q-ECHOS, 101001005).
article_number: '2200866'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Zhi Yuan
full_name: Fan, Zhi Yuan
last_name: Fan
- first_name: Liu
full_name: Qiu, Liu
id: 45e99c0d-1eb1-11eb-9b96-ed8ab2983cac
last_name: Qiu
orcid: 0000-0003-4345-4267
- first_name: Simon
full_name: Gröblacher, Simon
last_name: Gröblacher
- first_name: Jie
full_name: Li, Jie
last_name: Li
citation:
ama: Fan ZY, Qiu L, Gröblacher S, Li J. Microwave-optics entanglement via cavity
optomagnomechanics. Laser and Photonics Reviews. 2023;17(12). doi:10.1002/lpor.202200866
apa: Fan, Z. Y., Qiu, L., Gröblacher, S., & Li, J. (2023). Microwave-optics
entanglement via cavity optomagnomechanics. Laser and Photonics Reviews.
Wiley. https://doi.org/10.1002/lpor.202200866
chicago: Fan, Zhi Yuan, Liu Qiu, Simon Gröblacher, and Jie Li. “Microwave-Optics
Entanglement via Cavity Optomagnomechanics.” Laser and Photonics Reviews.
Wiley, 2023. https://doi.org/10.1002/lpor.202200866.
ieee: Z. Y. Fan, L. Qiu, S. Gröblacher, and J. Li, “Microwave-optics entanglement
via cavity optomagnomechanics,” Laser and Photonics Reviews, vol. 17, no.
12. Wiley, 2023.
ista: Fan ZY, Qiu L, Gröblacher S, Li J. 2023. Microwave-optics entanglement via
cavity optomagnomechanics. Laser and Photonics Reviews. 17(12), 2200866.
mla: Fan, Zhi Yuan, et al. “Microwave-Optics Entanglement via Cavity Optomagnomechanics.”
Laser and Photonics Reviews, vol. 17, no. 12, 2200866, Wiley, 2023, doi:10.1002/lpor.202200866.
short: Z.Y. Fan, L. Qiu, S. Gröblacher, J. Li, Laser and Photonics Reviews 17 (2023).
date_created: 2023-11-05T23:00:54Z
date_published: 2023-12-01T00:00:00Z
date_updated: 2025-09-09T13:13:18Z
day: '01'
department:
- _id: JoFi
doi: 10.1002/lpor.202200866
external_id:
arxiv:
- '2208.10703'
isi:
- '001088860000001'
intvolume: ' 17'
isi: 1
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2208.10703
month: '12'
oa: 1
oa_version: Preprint
publication: Laser and Photonics Reviews
publication_identifier:
eissn:
- 1863-8899
issn:
- 1863-8880
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Microwave-optics entanglement via cavity optomagnomechanics
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 17
year: '2023'
...