---
OA_type: closed access
_id: '17896'
abstract:
- lang: eng
text: Broadband photodetectors that can decipher the wavelength (λ) and intensity
(I) of an unknown incident light are urgently demanded. Photothermoelectric (PTE)
detectors can achieve ultrabroadband photodetection surpassing the bandgap limitation;
however, their practical application is severely hampered by the lack of deciphering
strategy. In this work, we report a variable elimination method to decipher λ
and I of the incident lights based on an integrated Ag2Se film-based PTE detector.
Nanostructured Ag2Se films with controlled thickness are synthesized using an
ion sputtering of Ag and a room-temperature selenization method and then assembled
into a detector. Under identical illumination, Ag2Se films of different thicknesses
produce varying output photothermal voltages, influenced by factors including
λ. By establishing a direct relationship between the photothermal voltage and
the absorption of Ag2Se films of varied thickness, we successfully eliminate variables
independent of λ, thus determining λ. Subsequently, I is determined by the calibrated
responsivity relationship using obtained λ. Our PTE detector achieves a broadband
spectrum from 400 to 950 nm and high accuracy, with deviations as low as ∼2.63
and ∼0.53% for deciphered λ and I, respectively. This method allows for self-powered
broadband decipherable photodetection without a complex device architecture or
computational assistance, which could boost the research enthusiasm and promote
the commercialization of PTE broadband detectors.
acknowledgement: The authors appreciate the Analytical & Testing Center of Sichuan
University and Ceshigo Research Service for their supports on material characterization.
This study is financial supported by the fund of the State Key Laboratory of Solidification
Processing in Northwestern Polytechnical University (NWPU, Grant SKLSP202315), the
State Key Laboratory for Mechanical Behavior of Materials (Grant 20232509), and
the International Scientific and Technological Innovation Cooperation of Sichuan
Province (2024YFHZ0309).
article_processing_charge: No
article_type: original
author:
- first_name: Jiamin
full_name: Zhou, Jiamin
last_name: Zhou
- first_name: Shengduo
full_name: Xu, Shengduo
id: 12ab8624-4c8a-11ec-9e11-e1ac2438f22f
last_name: Xu
- first_name: Yi
full_name: Shuai, Yi
last_name: Shuai
- first_name: Qiang
full_name: Sun, Qiang
last_name: Sun
- first_name: Huangshui
full_name: Ma, Huangshui
last_name: Ma
- first_name: Chao
full_name: Wang, Chao
last_name: Wang
- first_name: Haijuan
full_name: Wu, Haijuan
last_name: Wu
- first_name: Shanshan
full_name: Tan, Shanshan
last_name: Tan
- first_name: Zegao
full_name: Wang, Zegao
last_name: Wang
- first_name: Lei
full_name: Yang, Lei
last_name: Yang
citation:
ama: Zhou J, Xu S, Shuai Y, et al. Decipher the wavelength and intensity using photothermoelectric
detectors. ACS Applied Materials and Interfaces. 2024;16(36):47923-47930.
doi:10.1021/acsami.4c10489
apa: Zhou, J., Xu, S., Shuai, Y., Sun, Q., Ma, H., Wang, C., … Yang, L. (2024).
Decipher the wavelength and intensity using photothermoelectric detectors. ACS
Applied Materials and Interfaces. American Chemical Society. https://doi.org/10.1021/acsami.4c10489
chicago: Zhou, Jiamin, Shengduo Xu, Yi Shuai, Qiang Sun, Huangshui Ma, Chao Wang,
Haijuan Wu, Shanshan Tan, Zegao Wang, and Lei Yang. “Decipher the Wavelength and
Intensity Using Photothermoelectric Detectors.” ACS Applied Materials and Interfaces.
American Chemical Society, 2024. https://doi.org/10.1021/acsami.4c10489.
ieee: J. Zhou et al., “Decipher the wavelength and intensity using photothermoelectric
detectors,” ACS Applied Materials and Interfaces, vol. 16, no. 36. American
Chemical Society, pp. 47923–47930, 2024.
ista: Zhou J, Xu S, Shuai Y, Sun Q, Ma H, Wang C, Wu H, Tan S, Wang Z, Yang L. 2024.
Decipher the wavelength and intensity using photothermoelectric detectors. ACS
Applied Materials and Interfaces. 16(36), 47923–47930.
mla: Zhou, Jiamin, et al. “Decipher the Wavelength and Intensity Using Photothermoelectric
Detectors.” ACS Applied Materials and Interfaces, vol. 16, no. 36, American
Chemical Society, 2024, pp. 47923–30, doi:10.1021/acsami.4c10489.
short: J. Zhou, S. Xu, Y. Shuai, Q. Sun, H. Ma, C. Wang, H. Wu, S. Tan, Z. Wang,
L. Yang, ACS Applied Materials and Interfaces 16 (2024) 47923–47930.
date_created: 2024-09-08T22:01:13Z
date_published: 2024-09-11T00:00:00Z
date_updated: 2025-09-08T09:15:07Z
day: '11'
department:
- _id: MaIb
doi: 10.1021/acsami.4c10489
external_id:
isi:
- '001300770000001'
pmid:
- '39194354'
fulldoi: https://doi.org/10.1021/acsami.4c10489
intvolume: ' 16'
isi: 1
issue: '36'
language:
- iso: eng
month: '09'
oa_version: None
page: 47923-47930
pmid: 1
publication: ACS Applied Materials and Interfaces
publication_identifier:
eissn:
- 1944-8252
issn:
- 1944-8244
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Decipher the wavelength and intensity using photothermoelectric detectors
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 16
year: '2024'
...
---
OA_type: closed access
_id: '17897'
abstract:
- lang: eng
text: High-entropy materials (HEMs) offer a quasi-continuous spectrum of active
sites and have generated great expectations in fields such as electrocatalysis
and energy storage. Despite their potential, the complex composition and associated
surface phenomena of HEMs pose challenges to their rational design and development.
In this context, we have synthesized FeCoNiPdWP high entropy phosphide (HEP) nanoparticles
using a low-temperature colloidal method, and explored their application as bifunctional
electrocatalysts for the oxygen evolution and reduction reactions (OER/ORR). Our
analysis provides a detailed understanding of the individual roles and transformations
of each element during OER/ORR operation. Notably, the HEPs exhibit an exceptionally
low OER overpotential of 227 mV at 10 mA cm−2, attributed to the reconstructed
HEP surface into a FeCoNiPdW high entropy oxyhydroxide with high oxidation states
of Fe, Co, and Ni serving as the active sites. Additionally, Pd and W play crucial
roles in modulating the electronic structure to optimize the adsorption energy
of oxygen intermediates. For the ORR, Pd emerges as the most active component.
In the reconstructed catalyst, the strong d–d orbital coupling of especially Pd,
Co, and W fine-tunes ORR electron transfer pathways, delivering an ORR half-wave
potential of 0.81 V with a pure four-electron reduction mechanism. The practicality
of these HEPs catalysts is showcased through the assembly of aqueous zinc–air
batteries. These batteries demonstrate a superior specific capacity of 886 mA
h gZn−1 and maintain excellent stability over more than 700 hours of continuous
operation. Overall, this study not only elucidates the role of each element in
HEMs but also establishes a foundational framework for the design and development
of next-generation bifunctional oxygen catalysts, broadening the potential applications
of these complex materials in advanced energy systems.
acknowledgement: This work was financially supported by the SyDEC at project from
the Spanish MCIN/AEI/FEDER (PID2022-136883OB-C22) and Generalitat de Catalunya 2021SGR01581.
J. N. H. and P. W. M. acknowledge support from the German Federal Ministry of Education
and Research in the framework of the project “Catlab” (03EW0015A/B). L. Yang thanks
the China Scholarship Council (CSC) for the scholarship support (202008130132).
This work was supported by the European Union Horizon 2020 research and innovation
program (No. 857470) and the European Regional Development Fund via the Foundation
for Polish Science International Research Agenda PLUS program (No. MAB PLUS/2018/8).
The publication was created within the framework of the project of the Minister
of Science and Higher Education, Poland “Support for the activities of Centres of
Excellence established in Poland under Horizon 2020” under contract no. MEiN/2023/DIR/3795.
H. D. and S. M. thank the German Federal Ministry of Education and Research (BMBF)
for supporting the Live-XAS project (05K22KE1) and the Deutsche Forschungsgemeinschaft
(DFG, German Research Foundation) for support under Germany's Excellence Strategy
– EXC 2008/1 – 390540038 – UniSysCat. The authors thank the Helmholtz-Zentrum Berlin
(HZB) for beamtime allocation at the KMC-3 synchrotron beamline of the BESSY synchrotron
in Berlin-Adlershof and Dr Ivo Zizak as well as Dr Michael Haumann for technical
support.
article_processing_charge: No
article_type: original
author:
- first_name: Ren
full_name: He, Ren
last_name: He
- first_name: Shiqi
full_name: Wang, Shiqi
last_name: Wang
- first_name: Linlin
full_name: Yang, Linlin
last_name: Yang
- first_name: Sharona
full_name: Horta, Sharona
id: 03a7e858-01b1-11ec-8b71-99ae6c4a05bc
last_name: Horta
- first_name: Yang
full_name: Ding, Yang
last_name: Ding
- first_name: Chong
full_name: Di, Chong
last_name: Di
- first_name: Xuesong
full_name: Zhang, Xuesong
last_name: Zhang
- first_name: Ying
full_name: Xu, Ying
last_name: Xu
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
- first_name: Yingtang
full_name: Zhou, Yingtang
last_name: Zhou
- first_name: Stefan
full_name: Mebs, Stefan
last_name: Mebs
- first_name: Holger
full_name: Dau, Holger
last_name: Dau
- first_name: Jan Niklas
full_name: Hausmann, Jan Niklas
last_name: Hausmann
- first_name: Wenyi
full_name: Huo, Wenyi
last_name: Huo
- first_name: Prashanth W.
full_name: Menezes, Prashanth W.
last_name: Menezes
- first_name: Andreu
full_name: Cabot, Andreu
last_name: Cabot
citation:
ama: He R, Wang S, Yang L, et al. Active site switching on high entropy phosphides
as bifunctional oxygen electrocatalysts for rechargeable/robust Zn-air battery.
Energy and Environmental Science. 2024;17(19):7193-7208. doi:10.1039/d4ee01912a
apa: He, R., Wang, S., Yang, L., Horta, S., Ding, Y., Di, C., … Cabot, A. (2024).
Active site switching on high entropy phosphides as bifunctional oxygen electrocatalysts
for rechargeable/robust Zn-air battery. Energy and Environmental Science.
Royal Society of Chemistry. https://doi.org/10.1039/d4ee01912a
chicago: He, Ren, Shiqi Wang, Linlin Yang, Sharona Horta, Yang Ding, Chong Di, Xuesong
Zhang, et al. “Active Site Switching on High Entropy Phosphides as Bifunctional
Oxygen Electrocatalysts for Rechargeable/Robust Zn-Air Battery.” Energy and
Environmental Science. Royal Society of Chemistry, 2024. https://doi.org/10.1039/d4ee01912a.
ieee: R. He et al., “Active site switching on high entropy phosphides as
bifunctional oxygen electrocatalysts for rechargeable/robust Zn-air battery,”
Energy and Environmental Science, vol. 17, no. 19. Royal Society of Chemistry,
pp. 7193–7208, 2024.
ista: He R, Wang S, Yang L, Horta S, Ding Y, Di C, Zhang X, Xu Y, Ibáñez M, Zhou
Y, Mebs S, Dau H, Hausmann JN, Huo W, Menezes PW, Cabot A. 2024. Active site switching
on high entropy phosphides as bifunctional oxygen electrocatalysts for rechargeable/robust
Zn-air battery. Energy and Environmental Science. 17(19), 7193–7208.
mla: He, Ren, et al. “Active Site Switching on High Entropy Phosphides as Bifunctional
Oxygen Electrocatalysts for Rechargeable/Robust Zn-Air Battery.” Energy and
Environmental Science, vol. 17, no. 19, Royal Society of Chemistry, 2024,
pp. 7193–208, doi:10.1039/d4ee01912a.
short: R. He, S. Wang, L. Yang, S. Horta, Y. Ding, C. Di, X. Zhang, Y. Xu, M. Ibáñez,
Y. Zhou, S. Mebs, H. Dau, J.N. Hausmann, W. Huo, P.W. Menezes, A. Cabot, Energy
and Environmental Science 17 (2024) 7193–7208.
date_created: 2024-09-08T22:01:13Z
date_published: 2024-08-22T00:00:00Z
date_updated: 2025-09-08T09:15:49Z
day: '22'
department:
- _id: MaIb
doi: 10.1039/d4ee01912a
external_id:
isi:
- '001298924700001'
fulldoi: https://doi.org/10.1039/d4ee01912a
intvolume: ' 17'
isi: 1
issue: '19'
language:
- iso: eng
month: '08'
oa_version: None
page: 7193-7208
publication: Energy and Environmental Science
publication_identifier:
eissn:
- 1754-5706
issn:
- 1754-5692
publication_status: published
publisher: Royal Society of Chemistry
quality_controlled: '1'
scopus_import: '1'
status: public
title: Active site switching on high entropy phosphides as bifunctional oxygen electrocatalysts
for rechargeable/robust Zn-air battery
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 17
year: '2024'
...
---
OA_place: publisher
OA_type: hybrid
_id: '18065'
abstract:
- lang: eng
text: We establish a close connection between acceleration and dynamical degree
for one-frequency quasi-periodic compact cocycles, by showing that two vectors
derived separately from each coincide. Based on this, we provide a dynamical classification
of one-frequency quasi-periodic SO(3, R)-cocycles.
acknowledgement: "X. Hou is partially supported by National Natural Science Foundation
of China (Grant \r\n12071083) and Funds for Distinguished Youths of Hubei Province
of China (\r\n2019CFA680). Y. Pan is supported by ERC Advanced Grant (#885707).
Q. Zhou is partially supported by National Key R&D Program of China (2020YFA0713300),
NSFC grant (\r\n12071232) and Nankai Zhide Foundation."
article_number: '109943'
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Xuanji
full_name: Hou, Xuanji
last_name: Hou
- first_name: Yi
full_name: Pan, Yi
id: 1e21c7f7-9070-11eb-847d-8b04c7169523
last_name: Pan
- first_name: Qi
full_name: Zhou, Qi
last_name: Zhou
citation:
ama: Hou X, Pan Y, Zhou Q. Dynamical classification of analytic one-frequency quasi-periodic
SO(3,R)-cocycles. Advances in Mathematics. 2024;457. doi:10.1016/j.aim.2024.109943
apa: Hou, X., Pan, Y., & Zhou, Q. (2024). Dynamical classification of analytic
one-frequency quasi-periodic SO(3,R)-cocycles. Advances in Mathematics.
Elsevier. https://doi.org/10.1016/j.aim.2024.109943
chicago: Hou, Xuanji, Yi Pan, and Qi Zhou. “Dynamical Classification of Analytic
One-Frequency Quasi-Periodic SO(3,R)-Cocycles.” Advances in Mathematics.
Elsevier, 2024. https://doi.org/10.1016/j.aim.2024.109943.
ieee: X. Hou, Y. Pan, and Q. Zhou, “Dynamical classification of analytic one-frequency
quasi-periodic SO(3,R)-cocycles,” Advances in Mathematics, vol. 457. Elsevier,
2024.
ista: Hou X, Pan Y, Zhou Q. 2024. Dynamical classification of analytic one-frequency
quasi-periodic SO(3,R)-cocycles. Advances in Mathematics. 457, 109943.
mla: Hou, Xuanji, et al. “Dynamical Classification of Analytic One-Frequency Quasi-Periodic
SO(3,R)-Cocycles.” Advances in Mathematics, vol. 457, 109943, Elsevier,
2024, doi:10.1016/j.aim.2024.109943.
short: X. Hou, Y. Pan, Q. Zhou, Advances in Mathematics 457 (2024).
corr_author: '1'
date_created: 2024-09-15T22:01:39Z
date_published: 2024-11-01T00:00:00Z
date_updated: 2025-09-08T09:44:19Z
day: '01'
ddc:
- '510'
department:
- _id: VaKa
doi: 10.1016/j.aim.2024.109943
ec_funded: 1
external_id:
arxiv:
- '2311.17537'
isi:
- '001315306500001'
file:
- access_level: open_access
checksum: 1c80b844a91d93cf4799f4a65873b18d
content_type: application/pdf
creator: dernst
date_created: 2025-01-13T08:29:27Z
date_updated: 2025-01-13T08:29:27Z
file_id: '18826'
file_name: 2024_AdvancesMath_Hou.pdf
file_size: 713659
relation: main_file
success: 1
file_date_updated: 2025-01-13T08:29:27Z
fulldoi: https://doi.org/10.1016/j.aim.2024.109943
has_accepted_license: '1'
intvolume: ' 457'
isi: 1
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 9B8B92DE-BA93-11EA-9121-9846C619BF3A
call_identifier: H2020
grant_number: '885707'
name: Spectral rigidity and integrability for billiards and geodesic flows
publication: Advances in Mathematics
publication_identifier:
eissn:
- 1090-2082
issn:
- 0001-8708
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dynamical classification of analytic one-frequency quasi-periodic SO(3,R)-cocycles
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: 457
year: '2024'
...
---
_id: '18066'
abstract:
- lang: eng
text: 'Graph games lie at the algorithmic core of many automated design problems
in computer science. These are games usually played between two players on a given
graph, where the players keep moving a token along the edges according to pre-determined
rules (turn-based, concurrent, etc.), and the winner is decided based on the infinite
path (aka play) traversed by the token from a given initial position. In bidding
games, the players initially get some monetary budgets which they need to use
to bid for the privilege of moving the token at each step. Each round of bidding
affects the players'' available budgets, which is the only form of update that
the budgets experience. We introduce bidding games with charging where the players
can additionally improve their budgets during the game by collecting vertex-dependent
monetary rewards, aka the "charges." Unlike traditional bidding games (where all
charges are zero), bidding games with charging allow non-trivial recurrent behaviors.
For example, a reachability objective may require multiple detours to vertices
with high charges to earn additional budget. We show that, nonetheless, the central
property of traditional bidding games generalizes to bidding games with charging:
For each vertex there exists a threshold ratio, which is the necessary and sufficient
fraction of the total budget for winning the game from that vertex. While the
thresholds of traditional bidding games correspond to unique fixed points of linear
systems of equations, in games with charging, these fixed points are no longer
unique. This significantly complicates the proof of existence and the algorithmic
computation of thresholds for infinite-duration objectives. We also provide the
lower complexity bounds for computing thresholds for Rabin and Streett objectives,
which are the first known lower bounds in any form of bidding games (with or without
charging), and we solve the following repair problem for safety and reachability
games that have unsatisfiable objectives: Can we distribute a given amount of
charge to the players in a way such that the objective can be satisfied?'
acknowledgement: This work was supported in part by the ERC projects ERC-2020-AdG
101020093 and CoG 863818 (ForM-SMArt) and by ISF grant no. 1679/21.
alternative_title:
- LIPIcs
article_number: '8'
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Ehsan Kafshdar
full_name: Goharshady, Ehsan Kafshdar
last_name: Goharshady
- 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: Kaushik
full_name: Mallik, Kaushik
id: 0834ff3c-6d72-11ec-94e0-b5b0a4fb8598
last_name: Mallik
orcid: 0000-0001-9864-7475
citation:
ama: 'Avni G, Goharshady EK, Henzinger TA, Mallik K. Bidding games with charging.
In: 35th International Conference on Concurrency Theory. Vol 311. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.CONCUR.2024.8'
apa: 'Avni, G., Goharshady, E. K., Henzinger, T. A., & Mallik, K. (2024). Bidding
games with charging. In 35th International Conference on Concurrency Theory
(Vol. 311). Calgary, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.CONCUR.2024.8'
chicago: Avni, Guy, Ehsan Kafshdar Goharshady, Thomas A Henzinger, and Kaushik Mallik.
“Bidding Games with Charging.” In 35th International Conference on Concurrency
Theory, Vol. 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
https://doi.org/10.4230/LIPIcs.CONCUR.2024.8.
ieee: G. Avni, E. K. Goharshady, T. A. Henzinger, and K. Mallik, “Bidding games
with charging,” in 35th International Conference on Concurrency Theory,
Calgary, Canada, 2024, vol. 311.
ista: 'Avni G, Goharshady EK, Henzinger TA, Mallik K. 2024. Bidding games with charging.
35th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency
Theory, LIPIcs, vol. 311, 8.'
mla: Avni, Guy, et al. “Bidding Games with Charging.” 35th International Conference
on Concurrency Theory, vol. 311, 8, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2024, doi:10.4230/LIPIcs.CONCUR.2024.8.
short: G. Avni, E.K. Goharshady, T.A. Henzinger, K. Mallik, in:, 35th International
Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2024.
conference:
end_date: 2024-09-13
location: Calgary, Canada
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2024-09-09
corr_author: '1'
date_created: 2024-09-15T22:01:39Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2025-12-02T13:46:11Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.CONCUR.2024.8
ec_funded: 1
external_id:
arxiv:
- '2407.06288'
isi:
- '001556847400008'
file:
- access_level: open_access
checksum: cb6f2254b84922cd7bf224f550b73f4a
content_type: application/pdf
creator: dernst
date_created: 2024-09-17T09:35:03Z
date_updated: 2024-09-17T09:35:03Z
file_id: '18083'
file_name: 2024_LIPICS_Avni.pdf
file_size: 854430
relation: main_file
success: 1
file_date_updated: 2024-09-17T09:35:03Z
fulldoi: https://doi.org/10.4230/LIPIcs.CONCUR.2024.8
has_accepted_license: '1'
intvolume: ' 311'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: 35th International Conference on Concurrency Theory
publication_identifier:
isbn:
- '9783959773393'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Bidding games with charging
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: 311
year: '2024'
...
---
_id: '18067'
abstract:
- lang: eng
text: "An automaton \U0001D49C is history-deterministic if its nondeterminism can
be resolved on the fly, only using the prefix of the word read so far. This mild
form of nondeterminism has attracted particular attention for its applications
in synthesis problems. An automaton \U0001D49C is guidable with respect to a class
C of automata if it can fairly simulate every automaton in C, whose language is
contained in that of \U0001D49C. In other words, guidable automata are those for
which inclusion and simulation coincide, making them particularly interesting
for model-checking. We study the connection between these two notions, and specifically
the question of when they coincide. For classes of automata on which they do,
deciding guidability, an otherwise challenging decision problem, reduces to deciding
history-determinism, a problem that is starting to be well-understood for many
classes. We provide a selection of sufficient criteria for a class of automata
to guarantee the coincidence of the notions, and use them to show that the notions
coincide for the most common automata classes, among which are ω-regular automata
and many infinite-state automata with safety and reachability acceptance conditions,
including vector addition systems with states, one-counter nets, pushdown-, Parikh-,
and timed-automata. We also demonstrate that history-determinism and guidability
do not always coincide, for example, for the classes of timed automata with a
fixed number of clocks."
acknowledgement: "Udi Boker: Israel Science Foundation grant 2410/22\r\nThomas A.
Henzinger: ERC-2020-AdG 101020093 (VAMOS)\r\nKaroliina Lehtinen: ANR QUASY 23-CE48-0008-01\r\nAditya
Prakash: Chancellors’ International Scholarship from the University of Warwick and
Centre for Discrete Mathematics and Its Applications (DIMAP)"
alternative_title:
- LIPIcs
article_number: '12'
article_processing_charge: No
arxiv: 1
author:
- first_name: Udi
full_name: Boker, Udi
id: 31E297B6-F248-11E8-B48F-1D18A9856A87
last_name: Boker
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Karoliina
full_name: Lehtinen, Karoliina
last_name: Lehtinen
- first_name: Aditya
full_name: Prakash, Aditya
last_name: Prakash
citation:
ama: 'Boker U, Henzinger TA, Lehtinen K, Prakash A. History-determinism vs fair
simulation. In: 35th International Conference on Concurrency Theory. Vol
311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.CONCUR.2024.12'
apa: 'Boker, U., Henzinger, T. A., Lehtinen, K., & Prakash, A. (2024). History-determinism
vs fair simulation. In 35th International Conference on Concurrency Theory
(Vol. 311). Calgary, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.CONCUR.2024.12'
chicago: Boker, Udi, Thomas A Henzinger, Karoliina Lehtinen, and Aditya Prakash.
“History-Determinism vs Fair Simulation.” In 35th International Conference
on Concurrency Theory, Vol. 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2024. https://doi.org/10.4230/LIPIcs.CONCUR.2024.12.
ieee: U. Boker, T. A. Henzinger, K. Lehtinen, and A. Prakash, “History-determinism
vs fair simulation,” in 35th International Conference on Concurrency Theory,
Calgary, Canada, 2024, vol. 311.
ista: 'Boker U, Henzinger TA, Lehtinen K, Prakash A. 2024. History-determinism vs
fair simulation. 35th International Conference on Concurrency Theory. CONCUR:
Conference on Concurrency Theory, LIPIcs, vol. 311, 12.'
mla: Boker, Udi, et al. “History-Determinism vs Fair Simulation.” 35th International
Conference on Concurrency Theory, vol. 311, 12, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2024, doi:10.4230/LIPIcs.CONCUR.2024.12.
short: U. Boker, T.A. Henzinger, K. Lehtinen, A. Prakash, in:, 35th International
Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2024.
conference:
end_date: 2024-09-13
location: Calgary, Canada
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2024-09-09
corr_author: '1'
date_created: 2024-09-15T22:01:40Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2025-12-02T13:44:54Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.CONCUR.2024.12
ec_funded: 1
external_id:
arxiv:
- '2407.08620'
isi:
- '001556847400012'
file:
- access_level: open_access
checksum: 66db11ef8e600a434079c278050c3f09
content_type: application/pdf
creator: dernst
date_created: 2024-09-17T07:31:18Z
date_updated: 2024-09-17T07:31:18Z
file_id: '18080'
file_name: 2024_LIPICS_Boker.pdf
file_size: 766902
relation: main_file
success: 1
file_date_updated: 2024-09-17T07:31:18Z
fulldoi: https://doi.org/10.4230/LIPIcs.CONCUR.2024.12
has_accepted_license: '1'
intvolume: ' 311'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: 35th International Conference on Concurrency Theory
publication_identifier:
isbn:
- '9783959773393'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: History-determinism vs fair simulation
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: 311
year: '2024'
...
---
OA_place: publisher
OA_type: gold
_id: '18068'
abstract:
- lang: eng
text: "We study the following refinement relation between nondeterministic state-transition
models: model ℬ strategically dominates model \U0001D49C iff every deterministic
refinement of \U0001D49C is language contained in some deterministic refinement
of ℬ. While language containment is trace inclusion, and the (fair) simulation
preorder coincides with tree inclusion, strategic dominance falls strictly between
the two and can be characterized as \"strategy inclusion\" between \U0001D49C
and ℬ: every strategy that resolves the nondeterminism of \U0001D49C is dominated
by a strategy that resolves the nondeterminism of ℬ. Strategic dominance can be
checked in 2-ExpTime by a decidable first-order Presburger logic with quantification
over words and strategies, called resolver logic. We give several other applications
of resolver logic, including checking the co-safety, co-liveness, and history-determinism
of boolean and quantitative automata, and checking the inclusion between hyperproperties
that are specified by nondeterministic boolean and quantitative automata."
acknowledgement: This work was supported in part by the ERC-2020-AdG 101020093. N.
Mazzocchi was affiliated with ISTA when this work was submitted for publication.
alternative_title:
- LIPIcs
article_number: '29'
article_processing_charge: Yes
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: Nicolas Adrien
full_name: Mazzocchi, Nicolas Adrien
id: b26baa86-3308-11ec-87b0-8990f34baa85
last_name: Mazzocchi
- first_name: Naci E
full_name: Sarac, Naci E
id: 8C6B42F8-C8E6-11E9-A03A-F2DCE5697425
last_name: Sarac
citation:
ama: 'Henzinger TA, Mazzocchi NA, Sarac NE. Strategic dominance: A new preorder
for nondeterministic processes. In: 35th International Conference on Concurrency
Theory. Vol 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024.
doi:10.4230/LIPIcs.CONCUR.2024.29'
apa: 'Henzinger, T. A., Mazzocchi, N. A., & Sarac, N. E. (2024). Strategic dominance:
A new preorder for nondeterministic processes. In 35th International Conference
on Concurrency Theory (Vol. 311). Calgary, Canada: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2024.29'
chicago: 'Henzinger, Thomas A, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Strategic
Dominance: A New Preorder for Nondeterministic Processes.” In 35th International
Conference on Concurrency Theory, Vol. 311. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2024. https://doi.org/10.4230/LIPIcs.CONCUR.2024.29.'
ieee: 'T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Strategic dominance:
A new preorder for nondeterministic processes,” in 35th International Conference
on Concurrency Theory, Calgary, Canada, 2024, vol. 311.'
ista: 'Henzinger TA, Mazzocchi NA, Sarac NE. 2024. Strategic dominance: A new preorder
for nondeterministic processes. 35th International Conference on Concurrency Theory.
CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 311, 29.'
mla: 'Henzinger, Thomas A., et al. “Strategic Dominance: A New Preorder for Nondeterministic
Processes.” 35th International Conference on Concurrency Theory, vol. 311,
29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.CONCUR.2024.29.'
short: T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 35th International Conference
on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
conference:
end_date: 2024-09-13
location: Calgary, Canada
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2024-09-09
corr_author: '1'
date_created: 2024-09-15T22:01:40Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2025-12-02T13:45:38Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
- _id: GradSch
doi: 10.4230/LIPIcs.CONCUR.2024.29
ec_funded: 1
external_id:
arxiv:
- '2407.10473'
isi:
- '001556847400029'
file:
- access_level: open_access
checksum: 555bd343e1fb38adeab8fc465ff4fad8
content_type: application/pdf
creator: dernst
date_created: 2024-09-17T07:48:56Z
date_updated: 2024-09-17T07:48:56Z
file_id: '18081'
file_name: 2024_LIPICS_Henzinger.pdf
file_size: 964124
relation: main_file
success: 1
file_date_updated: 2024-09-17T07:48:56Z
fulldoi: https://doi.org/10.4230/LIPIcs.CONCUR.2024.29
has_accepted_license: '1'
intvolume: ' 311'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: 35th International Conference on Concurrency Theory
publication_identifier:
isbn:
- '9783959773393'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Strategic dominance: A new preorder for nondeterministic processes'
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: 311
year: '2024'
...
---
DOAJ_listed: '1'
_id: '18069'
abstract:
- lang: eng
text: We present results from the JWST First Reionization Epoch Spectroscopically
Complete Observations survey on the star-forming sequence (SFS) of galaxies at
1.0 < z < 1.7, around the peak of the cosmic star formation history. Star formation
rates (SFRs) are measured from the redshifted, relatively dust-insensitive Paschen-α
emission line, and stellar mass measurements include the F444W (4.4 μm; rest-frame
H) band. We find SFRs of galaxies with log(M*/M⊙) > 9.5 that are lower than found
in many earlier studies by up to 0.6 dex, but in good agreement with recent results
obtained with the Prospector fitting framework. The difference (log(SFR(Paα)-SFR(Prospector))
is −0.09 ± 0.04 dex at 1010−11M⊙. We also measure the empirical relation between
Paschen-α luminosity and rest-frame H-band magnitude and find that the scatter
is only 0.04 dex lower than that of the SFR–M* relation and is much lower than
the systematic differences among relations in the literature due to various methods
of converting observed measurements to physical properties. We additionally identify
examples of sources—that, with standard cutoffs via the UVJ diagram, would be
deemed quiescent—with significant (log(sSFR)> −11 yr−1), typically extended, Paschen-α
emission. Our results may be indicative of the potential unification of methods
used to derive the SFS with careful selection of star-forming galaxies and independent
SFR and stellar mass indicators.
acknowledgement: "The authors thank the anonymous referee whose comments and suggestions
improved the quality of this work.\r\nThis work is based on observations made with
the NASA/ESA/CSA James Webb Space Telescope. The data were obtained from the Mikulski
Archive for Space Telescopes at the Space Telescope Science Institute, which is
operated by the Association of Universities for Research in Astronomy, Inc., under
NASA contract NAS 5-03127 for JWST. These observations are associated with program
No. 1895.\r\nSupport for this work was provided by NASA through grant JWST-GO-01895
awarded by the Space Telescope Science Institute, which is operated by the Association
of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-26555.\r\nThis
work has received funding from the Swiss State Secretariat for Education, Research,
and Innovation (SERI) under contract No. MB22.00072, as well as from the Swiss National
Science Foundation (SNSF) through project grant 200020_207349. The Cosmic Dawn Center
(DAWN) is funded by the Danish National Research Foundation under grant No. 140.\r\nR.P.N.
acknowledges funding from JWST programs GO-1933 and GO-2279. Support for this work
was provided by NASA through the NASA Hubble Fellowship grant HST-HF2-51515.001-A
awarded by the Space Telescope Science Institute, which is operated by the Association
of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-26555\r\nCloud-based
data processing and file storage for this work is provided by the AWS Cloud Credits
for Research program.\r\nThis paper made use of several publicly available software
packages. We thank the respective authors for sharing their work: IPython (Pérez
& Granger 2007), matplotlib (Hunter 2007), seaborn (Waskom et al. 2018), NumPy (Harris
et al. 2020), SciPy (Virtanen et al. 2020), jupyter (Kluyver et al. 2016), Astropy
(Astropy Collaboration et al. 2013, 2018, 2022), grizli (Brammer 2018; Brammer et
al. 2022), Prospector (Leja et al. 2019, 2017; Johnson et al. 2021), FSPS (Conroy
et al. 2009a, 2010; Conroy & Gunn 2010a, 2010b; Foreman-Mackey et al. 2014), dynesty
(Speagle 2020), EAZY (Brammer et al. 2008), Bagpipes (Carnall et al. 2018), and
SExtractor (Bertin & Arnouts 1996)."
article_number: '156'
article_processing_charge: Yes
article_type: original
author:
- first_name: Chloe
full_name: Neufeld, Chloe
last_name: Neufeld
- first_name: Pieter
full_name: Van Dokkum, Pieter
last_name: Van Dokkum
- first_name: Yasmeen
full_name: Asali, Yasmeen
last_name: Asali
- first_name: Alba
full_name: Covelo-Paz, Alba
last_name: Covelo-Paz
- first_name: Joel
full_name: Leja, Joel
last_name: Leja
- first_name: Jamie
full_name: Lin, Jamie
last_name: Lin
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: Pascal A.
full_name: Oesch, Pascal A.
last_name: Oesch
- first_name: Naveen A.
full_name: Reddy, Naveen A.
last_name: Reddy
- first_name: Irene
full_name: Shivaei, Irene
last_name: Shivaei
- first_name: Katherine E.
full_name: Whitaker, Katherine E.
last_name: Whitaker
- first_name: Stijn
full_name: Wuyts, Stijn
last_name: Wuyts
- first_name: Gabriel
full_name: Brammer, Gabriel
last_name: Brammer
- first_name: Danilo
full_name: Marchesini, Danilo
last_name: Marchesini
- first_name: Michael V.
full_name: Maseda, Michael V.
last_name: Maseda
- first_name: Rohan P.
full_name: Naidu, Rohan P.
last_name: Naidu
- first_name: Erica J.
full_name: Nelson, Erica J.
last_name: Nelson
- first_name: Anna
full_name: Velichko, Anna
last_name: Velichko
- first_name: Andrea
full_name: Weibel, Andrea
last_name: Weibel
- first_name: Mengyuan
full_name: Xiao, Mengyuan
last_name: Xiao
citation:
ama: 'Neufeld C, Van Dokkum P, Asali Y, et al. FRESCO: The Paschen-α star-forming
sequence at cosmic noon. Astrophysical Journal. 2024;972(2). doi:10.3847/1538-4357/ad6158'
apa: 'Neufeld, C., Van Dokkum, P., Asali, Y., Covelo-Paz, A., Leja, J., Lin, J.,
… Xiao, M. (2024). FRESCO: The Paschen-α star-forming sequence at cosmic noon.
Astrophysical Journal. IOP Publishing. https://doi.org/10.3847/1538-4357/ad6158'
chicago: 'Neufeld, Chloe, Pieter Van Dokkum, Yasmeen Asali, Alba Covelo-Paz, Joel
Leja, Jamie Lin, Jorryt J Matthee, et al. “FRESCO: The Paschen-α Star-Forming
Sequence at Cosmic Noon.” Astrophysical Journal. IOP Publishing, 2024.
https://doi.org/10.3847/1538-4357/ad6158.'
ieee: 'C. Neufeld et al., “FRESCO: The Paschen-α star-forming sequence at
cosmic noon,” Astrophysical Journal, vol. 972, no. 2. IOP Publishing, 2024.'
ista: 'Neufeld C, Van Dokkum P, Asali Y, Covelo-Paz A, Leja J, Lin J, Matthee JJ,
Oesch PA, Reddy NA, Shivaei I, Whitaker KE, Wuyts S, Brammer G, Marchesini D,
Maseda MV, Naidu RP, Nelson EJ, Velichko A, Weibel A, Xiao M. 2024. FRESCO: The
Paschen-α star-forming sequence at cosmic noon. Astrophysical Journal. 972(2),
156.'
mla: 'Neufeld, Chloe, et al. “FRESCO: The Paschen-α Star-Forming Sequence at Cosmic
Noon.” Astrophysical Journal, vol. 972, no. 2, 156, IOP Publishing, 2024,
doi:10.3847/1538-4357/ad6158.'
short: C. Neufeld, P. Van Dokkum, Y. Asali, A. Covelo-Paz, J. Leja, J. Lin, J.J.
Matthee, P.A. Oesch, N.A. Reddy, I. Shivaei, K.E. Whitaker, S. Wuyts, G. Brammer,
D. Marchesini, M.V. Maseda, R.P. Naidu, E.J. Nelson, A. Velichko, A. Weibel, M.
Xiao, Astrophysical Journal 972 (2024).
date_created: 2024-09-15T22:01:40Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2025-09-08T09:43:41Z
day: '01'
ddc:
- '520'
department:
- _id: JoMa
doi: 10.3847/1538-4357/ad6158
external_id:
isi:
- '001305987600001'
file:
- access_level: open_access
checksum: 754b58c1d79adb9670ca76fa8c20ab16
content_type: application/pdf
creator: dernst
date_created: 2024-09-17T08:23:59Z
date_updated: 2024-09-17T08:23:59Z
file_id: '18082'
file_name: 2024_AstrophysicalJourn_Neufeld.pdf
file_size: 9960685
relation: main_file
success: 1
file_date_updated: 2024-09-17T08:23:59Z
fulldoi: https://doi.org/10.3847/1538-4357/ad6158
has_accepted_license: '1'
intvolume: ' 972'
isi: 1
issue: '2'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
publication: Astrophysical Journal
publication_identifier:
eissn:
- 1538-4357
issn:
- 0004-637X
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'FRESCO: The Paschen-α star-forming sequence at cosmic noon'
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: 972
year: '2024'
...
---
OA_place: publisher
OA_type: gold
_id: '18073'
abstract:
- lang: eng
text: Conserved signaling cascades monitor protein-folding homeostasis to ensure
proper cellular function. One of the evolutionary conserved key players is IRE1,
which maintains endoplasmic reticulum (ER) homeostasis through the unfolded protein
response (UPR). Upon accumulation of misfolded proteins in the ER, IRE1 forms
clusters on the ER membrane to initiate UPR signaling. What regulates IRE1 cluster
formation is not fully understood. Here, we show that the ER lumenal domain (LD)
of human IRE1α forms biomolecular condensates in vitro. IRE1α LD condensates were
stabilized both by binding to unfolded polypeptides as well as by tethering to
model membranes, suggesting their role in assembling IRE1α into signaling-competent
stable clusters. Molecular dynamics simulations indicated that weak multivalent
interactions drive IRE1α LD clustering. Mutagenesis experiments identified disordered
regions in IRE1α LD to control its clustering in vitro and in cells. Importantly,
dysregulated clustering of IRE1α mutants led to defects in IRE1α signaling. Our
results revealed that disordered regions in IRE1α LD control its clustering and
suggest their role as a common strategy in regulating protein assembly on membranes.
acknowledgement: We thank late Thomas Peterbauer at the Max Perutz Labs Biooptics
Light Microscopy Facility for his help and support. We are grateful to Kitti Csalyi
and Thomas Sauer at Max Perutz Labs Biooptics FACS facility for their help. We thank
Grzegorz Scibisz and Sertan Atilla for their support with the expression and purification
of mCherry-IRE1α LD-10His. We are grateful to Aleksandra S Anisimova with her help
in the generation of stable cell lines and the statistical analyses of the data.
We thank Venja Vieweger for her help with the characterization of the WLLI and D123P
IRE1 mutants in cells. We are thankful to Monika Kubickova for the help with the
AUC experiments. We acknowledge CF BIC of CIISB, Instruct-CZ Centre, supported by
MEYS CR (LM2023042)) and European Regional Development Fund-Project, UP CIISB“ (No.
CZ.02.1.01/0.0/0.0/18_046/0015974). We thank the members of the Karagöz lab for
the critical reading and editing of the manuscript. We are thankful to our colleagues
Diego Acosta-Alvear, Vladislav Belyy, Jirka Peschek, Yasin Dagdas, Javier Martinez,
Sascha Martens and Alwin Köhler for their invaluable input on the manuscript. We
are grateful to Life Science Editors, especially Katrina Woolcock for her useful
edits and comments on the manuscript. We acknowledge funding from Austrian Science
Fund (FWF-SFB F79 and FWF-W 1261) to GEK. PK acknowledges the support of the Max
Perutz PhD fellowship. GAV is funded by Stand-Alone grants (P30231-B, P30415-B,
P36572), Special Research Grant (SFB grant F79), and Doctoral School grant (DK grant
W1261) from the Austrian Science Fund (FWF). ES and RC acknowledge support and funding
by the Frankfurt Institute of Advanced Studies, the LOEWE Center for Multiscale
Modelling in Life Sciences of the state of Hesse, the Collaborative Research Center
1507 “Membrane-associated Protein Assemblies, Machineries, and Supercomplexes” (Project
ID 450648163), and the International Max Planck Research School on Cellular Biophysics
(to RC), the Center for Scientific Computing of the Goethe University and the Jülich
Supercomputing Centre for computational resources and support.
article_processing_charge: Yes
article_type: original
author:
- first_name: Paulina
full_name: Kettel, Paulina
last_name: Kettel
- first_name: Laura
full_name: Marosits, Laura
last_name: Marosits
- first_name: Elena
full_name: Spinetti, Elena
last_name: Spinetti
- first_name: Michael
full_name: Rechberger, Michael
last_name: Rechberger
- first_name: Caterina
full_name: Giannini, Caterina
id: e3fdddd5-f6e0-11ea-865d-ca99ee6367f4
last_name: Giannini
- first_name: Philipp
full_name: Radler, Philipp
id: 40136C2A-F248-11E8-B48F-1D18A9856A87
last_name: Radler
orcid: '0000-0001-9198-2182 '
- first_name: Isabell
full_name: Niedermoser, Isabell
last_name: Niedermoser
- first_name: Irmgard
full_name: Fischer, Irmgard
last_name: Fischer
- first_name: Gijs A.
full_name: Versteeg, Gijs A.
last_name: Versteeg
- first_name: Martin
full_name: Loose, Martin
id: 462D4284-F248-11E8-B48F-1D18A9856A87
last_name: Loose
orcid: 0000-0001-7309-9724
- first_name: Roberto
full_name: Covino, Roberto
last_name: Covino
- first_name: G. Elif
full_name: Karagöz, G. Elif
last_name: Karagöz
citation:
ama: Kettel P, Marosits L, Spinetti E, et al. Disordered regions in the IRE1α ER
lumenal domain mediate its stress-induced clustering. EMBO Journal. 2024;43(20):4668-4698.
doi:10.1038/s44318-024-00207-0
apa: Kettel, P., Marosits, L., Spinetti, E., Rechberger, M., Giannini, C., Radler,
P., … Karagöz, G. E. (2024). Disordered regions in the IRE1α ER lumenal domain
mediate its stress-induced clustering. EMBO Journal. Embo Press. https://doi.org/10.1038/s44318-024-00207-0
chicago: Kettel, Paulina, Laura Marosits, Elena Spinetti, Michael Rechberger, Caterina
Giannini, Philipp Radler, Isabell Niedermoser, et al. “Disordered Regions in the
IRE1α ER Lumenal Domain Mediate Its Stress-Induced Clustering.” EMBO Journal.
Embo Press, 2024. https://doi.org/10.1038/s44318-024-00207-0.
ieee: P. Kettel et al., “Disordered regions in the IRE1α ER lumenal domain
mediate its stress-induced clustering,” EMBO Journal, vol. 43, no. 20.
Embo Press, pp. 4668–4698, 2024.
ista: Kettel P, Marosits L, Spinetti E, Rechberger M, Giannini C, Radler P, Niedermoser
I, Fischer I, Versteeg GA, Loose M, Covino R, Karagöz GE. 2024. Disordered regions
in the IRE1α ER lumenal domain mediate its stress-induced clustering. EMBO Journal.
43(20), 4668–4698.
mla: Kettel, Paulina, et al. “Disordered Regions in the IRE1α ER Lumenal Domain
Mediate Its Stress-Induced Clustering.” EMBO Journal, vol. 43, no. 20,
Embo Press, 2024, pp. 4668–98, doi:10.1038/s44318-024-00207-0.
short: P. Kettel, L. Marosits, E. Spinetti, M. Rechberger, C. Giannini, P. Radler,
I. Niedermoser, I. Fischer, G.A. Versteeg, M. Loose, R. Covino, G.E. Karagöz,
EMBO Journal 43 (2024) 4668–4698.
date_created: 2024-09-15T22:01:42Z
date_published: 2024-10-15T00:00:00Z
date_updated: 2025-09-08T09:22:11Z
day: '15'
ddc:
- '570'
department:
- _id: MaLo
- _id: JiFr
doi: 10.1038/s44318-024-00207-0
external_id:
isi:
- '001306286100002'
pmid:
- '39232130'
file:
- access_level: open_access
checksum: 04f4df1a561083f2846676442fc4eb3c
content_type: application/pdf
creator: dernst
date_created: 2025-01-13T08:43:20Z
date_updated: 2025-01-13T08:43:20Z
file_id: '18827'
file_name: 2024_Embo_Kettel.pdf
file_size: 10080854
relation: main_file
success: 1
file_date_updated: 2025-01-13T08:43:20Z
fulldoi: https://doi.org/10.1038/s44318-024-00207-0
has_accepted_license: '1'
intvolume: ' 43'
isi: 1
issue: '20'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 4668-4698
pmid: 1
publication: EMBO Journal
publication_identifier:
eissn:
- 1460-2075
issn:
- 0261-4189
publication_status: published
publisher: Embo Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Disordered regions in the IRE1α ER lumenal domain mediate its stress-induced
clustering
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: 43
year: '2024'
...
---
APC_amount: 2742,92 EUR
OA_place: publisher
OA_type: hybrid
_id: '18108'
abstract:
- lang: eng
text: Here we announce the construction and properties of a big commutative subalgebra
of the Kirillov algebra attached to a finite dimensional irreducible representation
of a complex semisimple Lie group. They are commutative finite flat algebras over
the cohomology of the classifying space of the group. They are isomorphic with
the equivariant intersection cohomology of affine Schubert varieties, endowing
the latter with a new ring structure. Study of the finer aspects of the structure
of the big algebras will also furnish the stalks of the intersection cohomology
with ring structure, thus ringifying Lusztig’s q-weight multiplicity polynomials
i.e., certain affine Kazhdan–Lusztig polynomials.
acknowledgement: "We thank Nigel Hitchin for discussions and the joint projects this
paper has grown out from. We thank Vladyslav Zveryk for collaboration on Theorem
2.3 and on the corresponding Magma code which implements big algebras. We thank
Hiraku Nakajima for discussions and pointing out Theorem 3.1.2, a result generalizing
our original observation in the= = 0 case. Special thanks go to Leonid Rybnikov
for patiently explaining his works, in particular crucial to Theorem 2.1. We thank
Michel Brion, Michael Finkelberg, Oscar García-Prada, Jakub Löwit, Joel Kamnitzer,
Friedrich Knop, Michael McBreen, Anton Mellit, Takuro Mochizuki, Shon Ngô, Kamil
Rychlewicz, Shiyu Shen, Leslie Spencer, Balázs Szendr ˝ oi, András Szenes, and Oksana\r\nYakimova
for comments and discussions. Kamil Rychlewicz and Daniel Bedats helped with the
Mathematica files for the figures, and we used the SM_isospin Tikz package of Izaak
Neutelings for drawing the baryon multiplets. We thank the referees for many useful
comments. We acknowledge funding from FWF grant “Geometry of the tip of the global
nilpotent cone” no. P 35847."
article_number: e2319341121
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Tamás
full_name: Hausel, Tamás
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
orcid: 0000-0002-9582-2634
citation:
ama: Hausel T. Commutative avatars of representations of semisimple Lie groups.
Proceedings of the National Academy of Sciences of the United States of America.
2024;121(38). doi:10.1073/pnas.2319341121
apa: Hausel, T. (2024). Commutative avatars of representations of semisimple Lie
groups. Proceedings of the National Academy of Sciences of the United States
of America. National Academy of Sciences. https://doi.org/10.1073/pnas.2319341121
chicago: Hausel, Tamás. “Commutative Avatars of Representations of Semisimple Lie
Groups.” Proceedings of the National Academy of Sciences of the United States
of America. National Academy of Sciences, 2024. https://doi.org/10.1073/pnas.2319341121.
ieee: T. Hausel, “Commutative avatars of representations of semisimple Lie groups,”
Proceedings of the National Academy of Sciences of the United States of America,
vol. 121, no. 38. National Academy of Sciences, 2024.
ista: Hausel T. 2024. Commutative avatars of representations of semisimple Lie groups.
Proceedings of the National Academy of Sciences of the United States of America.
121(38), e2319341121.
mla: Hausel, Tamás. “Commutative Avatars of Representations of Semisimple Lie Groups.”
Proceedings of the National Academy of Sciences of the United States of America,
vol. 121, no. 38, e2319341121, National Academy of Sciences, 2024, doi:10.1073/pnas.2319341121.
short: T. Hausel, Proceedings of the National Academy of Sciences of the United
States of America 121 (2024).
corr_author: '1'
date_created: 2024-09-22T22:01:41Z
date_published: 2024-09-17T00:00:00Z
date_updated: 2025-05-08T09:57:59Z
day: '17'
ddc:
- '510'
department:
- _id: TaHa
doi: 10.1073/pnas.2319341121
external_id:
pmid:
- '39259592'
file:
- access_level: open_access
checksum: df80c873633c6734d2e324841e69db58
content_type: application/pdf
creator: dernst
date_created: 2024-09-23T11:22:56Z
date_updated: 2024-09-23T11:22:56Z
file_id: '18127'
file_name: 2024_PNAS_Hausel.pdf
file_size: 3764695
relation: main_file
success: 1
file_date_updated: 2024-09-23T11:22:56Z
fulldoi: https://doi.org/10.1073/pnas.2319341121
has_accepted_license: '1'
intvolume: ' 121'
issue: '38'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 34b2c9cb-11ca-11ed-8bc3-a50ba74ca4a3
grant_number: P35847
name: Geometry of the tip of the global nilpotent cone
publication: Proceedings of the National Academy of Sciences of the United States
of America
publication_identifier:
eissn:
- 1091-6490
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
related_material:
link:
- relation: press_release
url: https://ista.ac.at/en/news/big-algebras-a-dictionary-of-abstract-math/
scopus_import: '1'
status: public
title: Commutative avatars of representations of semisimple Lie groups
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: 121
year: '2024'
...
---
_id: '18109'
abstract:
- lang: eng
text: Venous thromboembolism (VTE) is a common, deadly disease with an increasing
incidence despite preventive efforts. Clinical observations have associated elevated
antibody concentrations or antibody-based therapies with thrombotic events. However,
how antibodies contribute to thrombosis is unknown. Here, we show that reduced
blood flow enabled immunoglobulin M (IgM) to bind to FcμR and the polymeric immunoglobulin
receptor (pIgR), initiating endothelial activation and platelet recruitment. Subsequently,
the procoagulant surface of activated platelets accommodated antigen- and FcγR-independent
IgG deposition. This leads to classical complement activation, setting in motion
a prothrombotic vicious circle. Key elements of this mechanism were present in
humans in the setting of venous stasis as well as in the dysregulated immunothrombosis
of COVID-19. This antibody-driven thrombosis can be prevented by pharmacologically
targeting complement. Hence, our results uncover antibodies as previously unrecognized
central regulators of thrombosis. These findings carry relevance for therapeutic
application of antibodies and open innovative avenues to target thrombosis without
compromising hemostasis.
acknowledgement: "We thank Michael Carroll (Harvard Medical School, Boston) for providing
Ighmtm1Che, C4−/−, and C3−/− mice; Mark Suter (University of Zurich, Zurich) for
providing Aicda−/− mice; Marina Botto (Imperial College London, London) for providing
C1q−/− and fB−/− mice; Craig Gerard (Harvard Medical School, Boston) for providing
C3aR−/− mice; Falk Nimmerjahn (University Erlangen-Nuernberg, Erlangen) for providing
Fcgr−/−Fcgr2b−/− mice; Karl Lang (University of Duisburg-Essen, Essen) for providing
Fcmr−/− mice; Hans Hengartner and Rolf Zinkernagel (ETH Zurich, Zurich) for providing
KL25 mice; Mark Zabel (University Hospital of Zurich, Zurich) for providing CR2−/−
mice; Christie Ballantyne (Baylor College of Medicine, Houston) for providing CD11c−/−
mice; and Siamon Gordon (University of Oxford, Oxford) for providing CD11b−/− mice.
A.V. wishes to thank Michael Grünaug and dedicates this work to Annette, Rita, and
Hans.\r\nThis 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\n947611) (K.S.). This study was supported by the Deutsche Forschungsgemeinschaft
through the collaborative research center 914 project B02 (K.S. and S.M.), project
B04 (A.V.), project A01 (M.M.), project B01 (M.S.), the collaborative research center
1123 project B07 (K.S. and S.M.), the collaborative research center 359 (project
A03 [K.S.] and B02 [M.S.]), the international research training group 1911 project
B09 (A.V.), the clinical research unit 303 project 7 (A.V.), cluster of excellence
2167 (A.V.), collaborative research center 1526 project 05 (A.V.), the ANR-DFG project
JAKPOT (K.S.), LMUexcellent (K.S.), and the Deutsche Zentrum für Herz-Kreislauf-Forschung
(PostDoc Grant and partner site project [K.S. and S.M.]). M.I. is supported by the
European Research Council (ERC) Advanced Grant 101141363, ERC Proof of Concept Grant
101138728, Italian Association for Cancer Research (AIRC) Grants 19891 and \r\n22737,
Italian Ministry for University and Research Grants PE00000007 (INF-ACT) and PRIN
\r\n2022FMESXL, Funded Research Agreement from Asher Biotherapeutics, VIR Biotechnology,
and BlueJay Therapeutics. V.F. is supported by the Italian Ministry for University
and Research Grants PE00000007 (INF-ACT) and Fondazione Prossimo Mio."
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Konstantin
full_name: Stark, Konstantin
last_name: Stark
- first_name: Badr
full_name: Kilani, Badr
last_name: Kilani
- first_name: Sven
full_name: Stockhausen, Sven
last_name: Stockhausen
- first_name: Johanna
full_name: Busse, Johanna
last_name: Busse
- first_name: Irene
full_name: Schubert, Irene
last_name: Schubert
- first_name: Thuy Duong
full_name: Tran, Thuy Duong
last_name: Tran
- first_name: Florian R
full_name: Gärtner, Florian R
id: 397A88EE-F248-11E8-B48F-1D18A9856A87
last_name: Gärtner
orcid: 0000-0001-6120-3723
- first_name: Alexander
full_name: Leunig, Alexander
last_name: Leunig
- first_name: Kami
full_name: Pekayvaz, Kami
last_name: Pekayvaz
- first_name: Leo
full_name: Nicolai, Leo
last_name: Nicolai
- first_name: Valeria
full_name: Fumagalli, Valeria
last_name: Fumagalli
- first_name: Julia
full_name: Stermann, Julia
last_name: Stermann
- first_name: Felix
full_name: Stephan, Felix
last_name: Stephan
- first_name: Christian
full_name: David, Christian
last_name: David
- first_name: Martin B.
full_name: Müller, Martin B.
last_name: Müller
- first_name: Birgitta
full_name: Heyman, Birgitta
last_name: Heyman
- first_name: Anja
full_name: Lux, Anja
last_name: Lux
- first_name: Alexandra
full_name: Da Palma Guerreiro, Alexandra
last_name: Da Palma Guerreiro
- first_name: Lukas P.
full_name: Frenzel, Lukas P.
last_name: Frenzel
- first_name: Christoph Q.
full_name: Schmidt, Christoph Q.
last_name: Schmidt
- first_name: Arthur
full_name: Dopler, Arthur
last_name: Dopler
- first_name: Markus
full_name: Moser, Markus
last_name: Moser
- first_name: Sue
full_name: Chandraratne, Sue
last_name: Chandraratne
- first_name: Marie Luise
full_name: Von Brühl, Marie Luise
last_name: Von Brühl
- first_name: Michael
full_name: Lorenz, Michael
last_name: Lorenz
- first_name: Thomas
full_name: Korff, Thomas
last_name: Korff
- first_name: Martina
full_name: Rudelius, Martina
last_name: Rudelius
- first_name: Oliver
full_name: Popp, Oliver
last_name: Popp
- first_name: Marieluise
full_name: Kirchner, Marieluise
last_name: Kirchner
- first_name: Philipp
full_name: Mertins, Philipp
last_name: Mertins
- first_name: Falk
full_name: Nimmerjahn, Falk
last_name: Nimmerjahn
- first_name: Matteo
full_name: Iannacone, Matteo
last_name: Iannacone
- first_name: Markus
full_name: Sperandio, Markus
last_name: Sperandio
- first_name: Bernd
full_name: Engelmann, Bernd
last_name: Engelmann
- first_name: Admar
full_name: Verschoor, Admar
last_name: Verschoor
- first_name: Steffen
full_name: Massberg, Steffen
last_name: Massberg
citation:
ama: Stark K, Kilani B, Stockhausen S, et al. Antibodies and complement are key
drivers of thrombosis. Immunity. 2024;57(9):2140-2156. doi:10.1016/j.immuni.2024.08.007
apa: Stark, K., Kilani, B., Stockhausen, S., Busse, J., Schubert, I., Tran, T. D.,
… Massberg, S. (2024). Antibodies and complement are key drivers of thrombosis.
Immunity. Elsevier. https://doi.org/10.1016/j.immuni.2024.08.007
chicago: Stark, Konstantin, Badr Kilani, Sven Stockhausen, Johanna Busse, Irene
Schubert, Thuy Duong Tran, Florian R Gärtner, et al. “Antibodies and Complement
Are Key Drivers of Thrombosis.” Immunity. Elsevier, 2024. https://doi.org/10.1016/j.immuni.2024.08.007.
ieee: K. Stark et al., “Antibodies and complement are key drivers of thrombosis,”
Immunity, vol. 57, no. 9. Elsevier, pp. 2140–2156, 2024.
ista: Stark K, Kilani B, Stockhausen S, Busse J, Schubert I, Tran TD, Gärtner FR,
Leunig A, Pekayvaz K, Nicolai L, Fumagalli V, Stermann J, Stephan F, David C,
Müller MB, Heyman B, Lux A, Da Palma Guerreiro A, Frenzel LP, Schmidt CQ, Dopler
A, Moser M, Chandraratne S, Von Brühl ML, Lorenz M, Korff T, Rudelius M, Popp
O, Kirchner M, Mertins P, Nimmerjahn F, Iannacone M, Sperandio M, Engelmann B,
Verschoor A, Massberg S. 2024. Antibodies and complement are key drivers of thrombosis.
Immunity. 57(9), 2140–2156.
mla: Stark, Konstantin, et al. “Antibodies and Complement Are Key Drivers of Thrombosis.”
Immunity, vol. 57, no. 9, Elsevier, 2024, pp. 2140–56, doi:10.1016/j.immuni.2024.08.007.
short: K. Stark, B. Kilani, S. Stockhausen, J. Busse, I. Schubert, T.D. Tran, F.R.
Gärtner, A. Leunig, K. Pekayvaz, L. Nicolai, V. Fumagalli, J. Stermann, F. Stephan,
C. David, M.B. Müller, B. Heyman, A. Lux, A. Da Palma Guerreiro, L.P. Frenzel,
C.Q. Schmidt, A. Dopler, M. Moser, S. Chandraratne, M.L. Von Brühl, M. Lorenz,
T. Korff, M. Rudelius, O. Popp, M. Kirchner, P. Mertins, F. Nimmerjahn, M. Iannacone,
M. Sperandio, B. Engelmann, A. Verschoor, S. Massberg, Immunity 57 (2024) 2140–2156.
date_created: 2024-09-22T22:01:42Z
date_published: 2024-09-10T00:00:00Z
date_updated: 2025-09-08T09:50:13Z
day: '10'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.1016/j.immuni.2024.08.007
external_id:
isi:
- '001317438500001'
pmid:
- '39226900'
file:
- access_level: open_access
checksum: 4683de43d06a8fd8e3fc91af4ddc1ba2
content_type: application/pdf
creator: dernst
date_created: 2024-09-30T09:16:03Z
date_updated: 2024-09-30T09:16:03Z
file_id: '18162'
file_name: 2024_Immunity_Stark.pdf
file_size: 6892750
relation: main_file
success: 1
file_date_updated: 2024-09-30T09:16:03Z
fulldoi: https://doi.org/10.1016/j.immuni.2024.08.007
has_accepted_license: '1'
intvolume: ' 57'
isi: 1
issue: '9'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 2140-2156
pmid: 1
publication: Immunity
publication_identifier:
eissn:
- 1097-4180
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Antibodies and complement are key drivers of thrombosis
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: 57
year: '2024'
...
---
_id: '18110'
abstract:
- lang: eng
text: We study a chaotic particle-conserving kinetically constrained model, with
a single parameter which allows us to break reflection symmetry. Through extensive
numerical simulations we find that the domain wall state shows a variety of dynamical
behaviors from localization all the way to ballistic transport, depending on the
value of the reflection breaking parameter. Surprisingly, such anomalous behavior
is not mirrored in infinite-temperature dynamics, which appear to scale diffusively,
in line with expectations for generic interacting models. However, studying the
particle density gradient, we show that the lack of reflection symmetry affects
infinite-temperature dynamics, resulting in an asymmetric dynamical structure
factor. This is in disagreement with normal diffusion and suggests that the model
may also exhibit anomalous dynamics at infinite temperature in the thermodynamic
limit. Finally, we observe low-entangled eigenstates in the spectrum of the model,
a telltale sign of quantum many-body scars.
acknowledgement: "The authors acknowledge useful discussions with M. Serbyn, Z. Papic,
and A. Nunnenkamp. ´\r\nP.B. is supported by the Erwin Schrödinger Center for Quantum
Science & Technology (ESQ) of the Österreichische Akademie der Wissenschaften (ÖAW)
under the Discovery Grant. M.L. acknowledges support from the European Research
Council (ERC) under the European Union’s Horizon 2020 research and innovation programme
(Grant Agreement\r\nNo. 850899). The numerical simulations were performed using
the ITensor library [68] on the Vienna Scientific Cluster (VSC)."
article_number: L100304
article_processing_charge: No
article_type: letter_note
arxiv: 1
author:
- first_name: Pietro
full_name: Brighi, Pietro
id: 4115AF5C-F248-11E8-B48F-1D18A9856A87
last_name: Brighi
orcid: 0000-0002-7969-2729
- first_name: Marko
full_name: Ljubotina, Marko
id: F75EE9BE-5C90-11EA-905D-16643DDC885E
last_name: Ljubotina
orcid: 0000-0003-0038-7068
citation:
ama: Brighi P, Ljubotina M. Anomalous transport in the kinetically constrained quantum
East-West model. Physical Review B. 2024;110(10). doi:10.1103/PhysRevB.110.L100304
apa: Brighi, P., & Ljubotina, M. (2024). Anomalous transport in the kinetically
constrained quantum East-West model. Physical Review B. American Physical
Society. https://doi.org/10.1103/PhysRevB.110.L100304
chicago: Brighi, Pietro, and Marko Ljubotina. “Anomalous Transport in the Kinetically
Constrained Quantum East-West Model.” Physical Review B. American Physical
Society, 2024. https://doi.org/10.1103/PhysRevB.110.L100304.
ieee: P. Brighi and M. Ljubotina, “Anomalous transport in the kinetically constrained
quantum East-West model,” Physical Review B, vol. 110, no. 10. American
Physical Society, 2024.
ista: Brighi P, Ljubotina M. 2024. Anomalous transport in the kinetically constrained
quantum East-West model. Physical Review B. 110(10), L100304.
mla: Brighi, Pietro, and Marko Ljubotina. “Anomalous Transport in the Kinetically
Constrained Quantum East-West Model.” Physical Review B, vol. 110, no.
10, L100304, American Physical Society, 2024, doi:10.1103/PhysRevB.110.L100304.
short: P. Brighi, M. Ljubotina, Physical Review B 110 (2024).
corr_author: '1'
date_created: 2024-09-22T22:01:42Z
date_published: 2024-09-11T00:00:00Z
date_updated: 2025-09-08T09:49:29Z
day: '11'
department:
- _id: MaSe
doi: 10.1103/PhysRevB.110.L100304
ec_funded: 1
external_id:
arxiv:
- '2405.02102'
isi:
- '001361617100003'
fulldoi: https://doi.org/10.1103/PhysRevB.110.L100304
intvolume: ' 110'
isi: 1
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2405.02102
month: '09'
oa: 1
oa_version: Preprint
project:
- _id: 23841C26-32DE-11EA-91FC-C7463DDC885E
call_identifier: H2020
grant_number: '850899'
name: 'Non-Ergodic Quantum Matter: Universality, Dynamics and Control'
publication: Physical Review B
publication_identifier:
eissn:
- 2469-9969
issn:
- 2469-9950
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Anomalous transport in the kinetically constrained quantum East-West model
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 110
year: '2024'
...
---
_id: '18115'
abstract:
- lang: eng
text: "We study the data selection problem, whose aim is to select a small representative
subset of data that can be used to efficiently train a machine learning model.
We present a new data selection approach based on k-means clustering and sensitivity
sampling. Assuming access to an embedding representation of the data with respect
to which the model loss is Holder continuous, our approach provably allows selecting
a set of “typical” k+1/ε2 elements whose average loss corresponds to the average
loss of the whole dataset, up to a multiplicative (1±ε)\r\n factor and an additive
ελΦk, where Φk represents the k-means cost for the input embeddings and λ is the
Holder constant. We furthermore demonstrate the performance and scalability of
our approach on fine-tuning foundation models and show that it outperforms state-of-the-art
methods. We also show how it can be applied on linear regression, leading to a
new sampling strategy that surprisingly matches the performance of leverage score
sampling, while being conceptually simpler and more scalable."
acknowledgement: "Monika Henzinger: This project has received funding from the European
Research Council (ERC) under the European Union’s Horizon 2020 research and innovation
programme (Grant agreement No. 101019564) and the Austrian Science Fund (FWF) grant
DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with
additional funding from the netidee SCIENCE Stiftung, 2020–2024. This work was partially
done while David Saulpic was at the Institute for Science and Technology, Austria
(ISTA). David Sauplic has received funding from the European Union’s Horizon 2020
research and innovation programme under the\r\nMarie Sklodowska-Curie grant agreement
No 101034413. Work was done while David Woodruff was visiting Google Research."
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Kyriakos
full_name: Axiotis, Kyriakos
last_name: Axiotis
- first_name: Vincent
full_name: Cohen-Addad, Vincent
last_name: Cohen-Addad
- 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: Sammy
full_name: Jerome, Sammy
last_name: Jerome
- first_name: Vahab
full_name: Mirrokni, Vahab
last_name: Mirrokni
- first_name: David
full_name: Saulpic, David
id: f8e48cf0-b0ff-11ed-b0e9-b4c35598f964
last_name: Saulpic
- first_name: David P.
full_name: Woodruff, David P.
last_name: Woodruff
- first_name: Michael
full_name: Wunder, Michael
last_name: Wunder
citation:
ama: 'Axiotis K, Cohen-Addad V, Henzinger M, et al. Data-efficient learning via
clustering-based sensitivity sampling: Foundation models and beyond. In: Proceedings
of the 41st International Conference on Machine Learning. Vol 235. ML Research
Press; 2024:2086-2107.'
apa: 'Axiotis, K., Cohen-Addad, V., Henzinger, M., Jerome, S., Mirrokni, V., Saulpic,
D., … Wunder, M. (2024). Data-efficient learning via clustering-based sensitivity
sampling: Foundation models and beyond. In Proceedings of the 41st International
Conference on Machine Learning (Vol. 235, pp. 2086–2107). Vienna, Austria:
ML Research Press.'
chicago: 'Axiotis, Kyriakos, Vincent Cohen-Addad, Monika Henzinger, Sammy Jerome,
Vahab Mirrokni, David Saulpic, David P. Woodruff, and Michael Wunder. “Data-Efficient
Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond.”
In Proceedings of the 41st International Conference on Machine Learning,
235:2086–2107. ML Research Press, 2024.'
ieee: 'K. Axiotis et al., “Data-efficient learning via clustering-based sensitivity
sampling: Foundation models and beyond,” in Proceedings of the 41st International
Conference on Machine Learning, Vienna, Austria, 2024, vol. 235, pp. 2086–2107.'
ista: 'Axiotis K, Cohen-Addad V, Henzinger M, Jerome S, Mirrokni V, Saulpic D, Woodruff
DP, Wunder M. 2024. Data-efficient learning via clustering-based sensitivity sampling:
Foundation models and beyond. Proceedings of the 41st International Conference
on Machine Learning. ICML: International Conference on Machine Learning, PMLR,
vol. 235, 2086–2107.'
mla: 'Axiotis, Kyriakos, et al. “Data-Efficient Learning via Clustering-Based Sensitivity
Sampling: Foundation Models and Beyond.” Proceedings of the 41st International
Conference on Machine Learning, vol. 235, ML Research Press, 2024, pp. 2086–107.'
short: K. Axiotis, V. Cohen-Addad, M. Henzinger, S. Jerome, V. Mirrokni, D. Saulpic,
D.P. Woodruff, M. Wunder, in:, Proceedings of the 41st International Conference
on Machine Learning, ML Research Press, 2024, pp. 2086–2107.
conference:
end_date: 2024-07-27
location: Vienna, Austria
name: 'ICML: International Conference on Machine Learning'
start_date: 2024-07-21
date_created: 2024-09-22T22:01:44Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2026-06-18T18:00:19Z
day: '01'
ddc:
- '000'
department:
- _id: MoHe
ec_funded: 1
external_id:
arxiv:
- '2402.17327'
intvolume: ' 235'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2402.17327
month: '09'
oa: 1
oa_version: Published Version
page: 2086-2107
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: bda196b2-d553-11ed-ba76-8e8ee6c21103
grant_number: I05982
name: Static and Dynamic Hierarchical Graph Decompositions
- _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe
grant_number: P33775
name: Fast Algorithms for a Reactive Network Layer
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: Proceedings of the 41st 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: 'Data-efficient learning via clustering-based sensitivity sampling: Foundation
models and beyond'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 235
year: '2024'
...
---
_id: '18116'
abstract:
- lang: eng
text: 'As a staple of data analysis and unsupervised learning, the problem of private
clustering has been widely studied, under various privacy models. Centralized
differential privacy is the first of them, and the problem has also been studied
for the local and the shuffle variation. In each case, the goal is to design an
algorithm that computes privately a clustering, with the smallest possible error.
The study of each variation gave rise to new algorithm: the landscape of private
clustering algorithm is therefore quite intricate. In this paper, we show that
a 20 year-old algorithm can be slightly modified to work for any of those models.
This provides a unified picture: while matching almost all previously known results,
it allows us to improve some of them, and extend to a new privacy model, the continual
observation setting, where the input is changing over time and the algorithm must
output a new solution at each time step.'
acknowledgement: 'Monika Henzinger: This project has received funding from the European
Research Council (ERC) under the European Union’s Horizon 2020 research and innovation
programme (Grant agreement No. 101019564) and the Austrian Science Fund (FWF) grant
DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with
additional funding from the netidee SCIENCE Stiftung, 2020–2024.This work was partially
done while David Saulpic was at the Institute for Science and Technology, Austria
(ISTA). David Sauplic has received funding from the European Union’s Horizon 2020
research and innovation programme under the Marie Sklodowska-Curie grant agreement
No 101034413.'
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Max Dupré
full_name: La Tour, Max Dupré
last_name: La Tour
- 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: David
full_name: Saulpic, David
id: f8e48cf0-b0ff-11ed-b0e9-b4c35598f964
last_name: Saulpic
citation:
ama: 'La Tour MD, Henzinger M, Saulpic D. Making old things new: A unified algorithm
for differentially private clustering. In: Proceedings of the 41st International
Conference on Machine Learning. Vol 235. ML Research Press; 2024:12046-12086.'
apa: 'La Tour, M. D., Henzinger, M., & Saulpic, D. (2024). Making old things
new: A unified algorithm for differentially private clustering. In Proceedings
of the 41st International Conference on Machine Learning (Vol. 235, pp. 12046–12086).
Vienna, Austria: ML Research Press.'
chicago: 'La Tour, Max Dupré, Monika Henzinger, and David Saulpic. “Making Old Things
New: A Unified Algorithm for Differentially Private Clustering.” In Proceedings
of the 41st International Conference on Machine Learning, 235:12046–86. ML
Research Press, 2024.'
ieee: 'M. D. La Tour, M. Henzinger, and D. Saulpic, “Making old things new: A unified
algorithm for differentially private clustering,” in Proceedings of the 41st
International Conference on Machine Learning, Vienna, Austria, 2024, vol.
235, pp. 12046–12086.'
ista: 'La Tour MD, Henzinger M, Saulpic D. 2024. Making old things new: A unified
algorithm for differentially private clustering. Proceedings of the 41st International
Conference on Machine Learning. ICML: International Conference on Machine Learning,
PMLR, vol. 235, 12046–12086.'
mla: 'La Tour, Max Dupré, et al. “Making Old Things New: A Unified Algorithm for
Differentially Private Clustering.” Proceedings of the 41st International Conference
on Machine Learning, vol. 235, ML Research Press, 2024, pp. 12046–86.'
short: M.D. La Tour, M. Henzinger, D. Saulpic, in:, Proceedings of the 41st International
Conference on Machine Learning, ML Research Press, 2024, pp. 12046–12086.
conference:
end_date: 2024-07-27
location: Vienna, Austria
name: 'ICML: International Conference on Machine Learning'
start_date: 2024-07-21
corr_author: '1'
date_created: 2024-09-22T22:01:44Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2026-06-18T18:01:02Z
day: '01'
ddc:
- '000'
department:
- _id: MoHe
ec_funded: 1
external_id:
arxiv:
- '2406.11649'
intvolume: ' 235'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2406.11649
month: '09'
oa: 1
oa_version: Published Version
page: 12046-12086
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: bda196b2-d553-11ed-ba76-8e8ee6c21103
grant_number: I05982
name: Static and Dynamic Hierarchical Graph Decompositions
- _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe
grant_number: P33775
name: Fast Algorithms for a Reactive Network Layer
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: Proceedings of the 41st 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: 'Making old things new: A unified algorithm for differentially private clustering'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 235
year: '2024'
...
---
_id: '18156'
abstract:
- lang: eng
text: Privately counting distinct elements in a stream is a fundamental data analysis
problem with many applications in machine learning. In the turnstile model, Jain
et al. [NeurIPS2023] initiated the study of this problem parameterized by the
maximum flippancy of any element, i.e., the number of times that the count of
an element changes from 0 to above 0 or vice versa. They give an item-level (ε,δ)-differentially
private algorithm whose additive error is tight with respect to that parameterization.
In this work, we show that a very simple algorithm based on the sparse vector
technique achieves a tight additive error for item-level (ε,δ)-differential privacy
and item-level ε-differential privacy with regards to a different parameterization,
namely the sum of all flippancies. Our second result is a bound which shows that
for a large class of algorithms, including all existing differentially private
algorithms for this problem, the lower bound from item-level differential privacy
extends to event-level differential privacy. This partially answers an open question
by Jain et al. [NeurIPS2023].
acknowledgement: "Monika Henzinger: This project has received funding from the European
Research Council\r\n(ERC) under the European Union’s Horizon 2020 research and innovation
programme (MoDynStruct,No. 101019564) and the Austrian Science Fund (FWF) grant
DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with
additional funding from the netidee SCIENCE Stiftung, 2020–2024.\r\nTeresa Anna
Steiner: Supported by a research grant (VIL51463) from VILLUM FONDEN."
alternative_title:
- LIPIcs
article_number: '40'
article_processing_charge: No
arxiv: 1
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: A. R.
full_name: Sricharan, A. R.
last_name: Sricharan
- first_name: Teresa Anna
full_name: Steiner, Teresa Anna
last_name: Steiner
citation:
ama: 'Henzinger M, Sricharan AR, Steiner TA. Private counting of distinct elements
in the turnstile model and extensions. In: International Conference on Approximation
Algorithms for Combinatorial Optimization Problems . Vol 317. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.APPROX/RANDOM.2024.40'
apa: 'Henzinger, M., Sricharan, A. R., & Steiner, T. A. (2024). Private counting
of distinct elements in the turnstile model and extensions. In International
Conference on Approximation Algorithms for Combinatorial Optimization Problems
(Vol. 317). London, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für
Informatik. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40'
chicago: Henzinger, Monika, A. R. Sricharan, and Teresa Anna Steiner. “Private Counting
of Distinct Elements in the Turnstile Model and Extensions.” In International
Conference on Approximation Algorithms for Combinatorial Optimization Problems
, Vol. 317. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40.
ieee: M. Henzinger, A. R. Sricharan, and T. A. Steiner, “Private counting of distinct
elements in the turnstile model and extensions,” in International Conference
on Approximation Algorithms for Combinatorial Optimization Problems , London,
United Kingdom, 2024, vol. 317.
ista: 'Henzinger M, Sricharan AR, Steiner TA. 2024. Private counting of distinct
elements in the turnstile model and extensions. International Conference on Approximation
Algorithms for Combinatorial Optimization Problems . APPROX: Conference on Approximation
Algorithms for Combinatorial Optimization Problems, LIPIcs, vol. 317, 40.'
mla: Henzinger, Monika, et al. “Private Counting of Distinct Elements in the Turnstile
Model and Extensions.” International Conference on Approximation Algorithms
for Combinatorial Optimization Problems , vol. 317, 40, Schloss Dagstuhl -
Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.APPROX/RANDOM.2024.40.
short: M. Henzinger, A.R. Sricharan, T.A. Steiner, in:, International Conference
on Approximation Algorithms for Combinatorial Optimization Problems , Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
conference:
end_date: 2024-08-30
location: London, United Kingdom
name: 'APPROX: Conference on Approximation Algorithms for Combinatorial Optimization
Problems'
start_date: 2024-08-27
corr_author: '1'
date_created: 2024-09-29T22:01:38Z
date_published: 2024-09-16T00:00:00Z
date_updated: 2025-12-02T13:47:16Z
day: '16'
ddc:
- '000'
department:
- _id: MoHe
doi: 10.4230/LIPIcs.APPROX/RANDOM.2024.40
ec_funded: 1
external_id:
arxiv:
- '2408.11637'
isi:
- '001545634500040'
file:
- access_level: open_access
checksum: c08b41c896e4d8c69570044808b40e0b
content_type: application/pdf
creator: dernst
date_created: 2024-10-01T10:07:14Z
date_updated: 2024-10-01T10:07:14Z
file_id: '18166'
file_name: 2024_LIPICs_HenzingerM.pdf
file_size: 973917
relation: main_file
success: 1
file_date_updated: 2024-10-01T10:07:14Z
fulldoi: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40
has_accepted_license: '1'
intvolume: ' 317'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
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: bda196b2-d553-11ed-ba76-8e8ee6c21103
grant_number: I05982
name: Static and Dynamic Hierarchical Graph Decompositions
- _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe
grant_number: P33775
name: Fast Algorithms for a Reactive Network Layer
publication: 'International Conference on Approximation Algorithms for Combinatorial
Optimization Problems '
publication_identifier:
isbn:
- '9783959773485'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Private counting of distinct elements in the turnstile model and extensions
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: 317
year: '2024'
...
---
_id: '18159'
abstract:
- lang: eng
text: "Markov Decision Processes (MDPs) are a classical model for decision making
in the presence of uncertainty. Often they are viewed as state transformers with
planning objectives defned with respect to paths over MDP states. An increasingly\r\npopular
alternative is to view them as distribution transformers, giving rise to a sequence
of probability distributions over MDP states. For instance, reachability and safety
properties in modeling robot swarms or chemical reaction networks are naturally
defned in terms of probability distributions over states. Verifying such distributional
properties is known to be hard and often beyond the reach of classical state-based
verifcation techniques. In this work, we consider the problems of certifed policy
(i.e. controller) verifcation and synthesis in MDPs under distributional reach-avoidance
specifcations. By certifed we mean that, along with a policy, we also aim to synthesize
a (checkable) certifcate ensuring that the MDP indeed satisfes the property. Thus,
given the target set of distributions and an unsafe set of distributions over
MDP states, our goal is to either synthesize a certifcate for a given policy or
synthesize a policy along with a certifcate, proving that the target distribution
can be reached while avoiding unsafe distributions. To solve this problem, we
introduce the novel notion of distributional reach-avoid certifcates and present
automated procedures for (1) synthesizing a certifcate for a given policy, and
(2) synthesizing a policy together with the certifcate, both providing formal
guarantees on certifcate correctness. Our experimental evaluation demonstrates
the ability of our method to solve several non-trivial examples, including a multi-agent
robot-swarm model, to synthesize certifed policies and to certify existing policies. "
acknowledgement: This work was supported in part by the ERC-2020-CoG 863818 (FoRM-SMArt),
the Singapore Ministry of Education (MOE) Academic Research Fund (AcRF) Tier 1 grant,
Google Research Award 2023 and the SBI Foundation Hub for Data and Analytics.
article_processing_charge: No
arxiv: 1
author:
- first_name: S
full_name: Akshay, S
last_name: Akshay
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Tobias
full_name: Meggendorfer, Tobias
id: b21b0c15-30a2-11eb-80dc-f13ca25802e1
last_name: Meggendorfer
orcid: 0000-0002-1712-2165
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
citation:
ama: 'Akshay S, Chatterjee K, Meggendorfer T, Zikelic D. Certified policy verification
and synthesis for MDPs under distributional reach-avoidance properties. In: Proceedings
of the Thirty-Third International Joint Conference on Artificial Intelligence.
International Joint Conferences on Artificial Intelligence; 2024:3-12. doi:10.24963/ijcai.2024/1'
apa: 'Akshay, S., Chatterjee, K., Meggendorfer, T., & Zikelic, D. (2024). Certified
policy verification and synthesis for MDPs under distributional reach-avoidance
properties. In Proceedings of the Thirty-Third International Joint Conference
on Artificial Intelligence (pp. 3–12). Jeju, Korea: International Joint Conferences
on Artificial Intelligence. https://doi.org/10.24963/ijcai.2024/1'
chicago: Akshay, S, Krishnendu Chatterjee, Tobias Meggendorfer, and Dorde Zikelic.
“Certified Policy Verification and Synthesis for MDPs under Distributional Reach-Avoidance
Properties.” In Proceedings of the Thirty-Third International Joint Conference
on Artificial Intelligence, 3–12. International Joint Conferences on Artificial
Intelligence, 2024. https://doi.org/10.24963/ijcai.2024/1.
ieee: S. Akshay, K. Chatterjee, T. Meggendorfer, and D. Zikelic, “Certified policy
verification and synthesis for MDPs under distributional reach-avoidance properties,”
in Proceedings of the Thirty-Third International Joint Conference on Artificial
Intelligence, Jeju, Korea, 2024, pp. 3–12.
ista: 'Akshay S, Chatterjee K, Meggendorfer T, Zikelic D. 2024. Certified policy
verification and synthesis for MDPs under distributional reach-avoidance properties.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence.
IJCAI: International Joint Conference on Artificial Intelligence, 3–12.'
mla: Akshay, S., et al. “Certified Policy Verification and Synthesis for MDPs under
Distributional Reach-Avoidance Properties.” Proceedings of the Thirty-Third
International Joint Conference on Artificial Intelligence, International Joint
Conferences on Artificial Intelligence, 2024, pp. 3–12, doi:10.24963/ijcai.2024/1.
short: S. Akshay, K. Chatterjee, T. Meggendorfer, D. Zikelic, in:, Proceedings of
the Thirty-Third International Joint Conference on Artificial Intelligence, International
Joint Conferences on Artificial Intelligence, 2024, pp. 3–12.
conference:
end_date: 2024-08-09
location: Jeju, Korea
name: 'IJCAI: International Joint Conference on Artificial Intelligence'
start_date: 2024-08-03
corr_author: '1'
date_created: 2024-09-29T22:01:38Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2025-04-14T07:52:46Z
day: '01'
department:
- _id: KrCh
doi: 10.24963/ijcai.2024/1
ec_funded: 1
external_id:
arxiv:
- '2405.04015'
fulldoi: https://doi.org/10.24963/ijcai.2024/1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2405.04015
month: '09'
oa: 1
oa_version: Preprint
page: 3-12
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: Proceedings of the Thirty-Third International Joint Conference on Artificial
Intelligence
publication_identifier:
isbn:
- '9781956792041'
issn:
- 1045-0823
publication_status: published
publisher: International Joint Conferences on Artificial Intelligence
quality_controlled: '1'
scopus_import: '1'
status: public
title: Certified policy verification and synthesis for MDPs under distributional reach-avoidance
properties
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '18160'
abstract:
- lang: eng
text: 'Markov decision processes (MDPs) provide a standard framework for sequential
decision making under uncertainty. However, MDPs do not take uncertainty in transition
probabilities into account. Robust Markov decision processes (RMDPs) address this
shortcoming of MDPs by assigning to each transition an uncertainty set rather
than a single probability value. In this work, we consider polytopic RMDPs in
which all uncertainty sets are polytopes and study the problem of solving long-run
average reward polytopic RMDPs. We present a novel perspective on this problem
and show that it can be reduced to solving long-run average reward turn-based
stochastic games with finite state and action spaces. This reduction allows us
to derive several important consequences that were hitherto not known to hold
for polytopic RMDPs. First, we derive new computational complexity bounds for
solving long-run average reward polytopic RMDPs, showing for the first time that
the threshold decision problem for them is in NP∩CONP and that they admit a randomized
algorithm with sub-exponential expected runtime. Second, we present Robust Polytopic
Policy Iteration (RPPI), a novel policy iteration algorithm for solving long-run
average reward polytopic RMDPs. Our experimental evaluation shows that RPPI is
much more efficient in solving long-run average reward polytopic RMDPs compared
to state-of-the-art methods based on value iteration. '
acknowledgement: "This work was supported in part by the ERC-2020-CoG 863818 (FoRM-SMArt)
and the Czech Science Foundation\r\ngrant no. GA23-06963S."
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Ehsan
full_name: Kafshdar Goharshadi, Ehsan
id: 103b4fa0-896a-11ed-bdf8-87b697bef40d
last_name: Kafshdar Goharshadi
orcid: 0000-0002-8595-0587
- first_name: Mehrdad
full_name: Karrabi, Mehrdad
id: 67638922-f394-11eb-9cf6-f20423e08757
last_name: Karrabi
- first_name: Petr
full_name: Novotný, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotný
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
citation:
ama: 'Chatterjee K, Goharshady E, Karrabi M, Novotný P, Zikelic D. Solving long-run
average reward robust MDPs via stochastic games. In: 33rd International Joint
Conference on Artificial Intelligence. International Joint Conferences on
Artificial Intelligence; 2024:6707-6715. doi:10.24963/ijcai.2024/741'
apa: 'Chatterjee, K., Goharshady, E., Karrabi, M., Novotný, P., & Zikelic, D.
(2024). Solving long-run average reward robust MDPs via stochastic games. In 33rd
International Joint Conference on Artificial Intelligence (pp. 6707–6715).
Jeju, South Korea: International Joint Conferences on Artificial Intelligence.
https://doi.org/10.24963/ijcai.2024/741'
chicago: Chatterjee, Krishnendu, Ehsan Goharshady, Mehrdad Karrabi, Petr Novotný,
and Dorde Zikelic. “Solving Long-Run Average Reward Robust MDPs via Stochastic
Games.” In 33rd International Joint Conference on Artificial Intelligence,
6707–15. International Joint Conferences on Artificial Intelligence, 2024. https://doi.org/10.24963/ijcai.2024/741.
ieee: K. Chatterjee, E. Goharshady, M. Karrabi, P. Novotný, and D. Zikelic, “Solving
long-run average reward robust MDPs via stochastic games,” in 33rd International
Joint Conference on Artificial Intelligence, Jeju, South Korea, 2024, pp.
6707–6715.
ista: 'Chatterjee K, Goharshady E, Karrabi M, Novotný P, Zikelic D. 2024. Solving
long-run average reward robust MDPs via stochastic games. 33rd International Joint
Conference on Artificial Intelligence. IJCAI: International Joint Conference on
Artificial Intelligence, 6707–6715.'
mla: Chatterjee, Krishnendu, et al. “Solving Long-Run Average Reward Robust MDPs
via Stochastic Games.” 33rd International Joint Conference on Artificial Intelligence,
International Joint Conferences on Artificial Intelligence, 2024, pp. 6707–15,
doi:10.24963/ijcai.2024/741.
short: K. Chatterjee, E. Goharshady, M. Karrabi, P. Novotný, D. Zikelic, in:, 33rd
International Joint Conference on Artificial Intelligence, International Joint
Conferences on Artificial Intelligence, 2024, pp. 6707–6715.
conference:
end_date: 2024-08-09
location: Jeju, South Korea
name: 'IJCAI: International Joint Conference on Artificial Intelligence'
start_date: 2024-08-03
corr_author: '1'
date_created: 2024-09-29T22:01:39Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2025-04-14T07:52:46Z
day: '01'
department:
- _id: KrCh
doi: 10.24963/ijcai.2024/741
ec_funded: 1
external_id:
arxiv:
- '2312.13912'
fulldoi: https://doi.org/10.24963/ijcai.2024/741
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2312.13912
month: '09'
oa: 1
oa_version: Preprint
page: 6707-6715
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: 33rd International Joint Conference on Artificial Intelligence
publication_identifier:
isbn:
- '9781956792041'
issn:
- 1045-0823
publication_status: published
publisher: International Joint Conferences on Artificial Intelligence
quality_controlled: '1'
scopus_import: '1'
status: public
title: Solving long-run average reward robust MDPs via stochastic games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2024'
...
---
OA_type: closed access
_id: '18167'
abstract:
- lang: eng
text: 'Holdase chaperones are essential in the mitochondrial membrane-protein biogenesis
as they stabilize preproteins and keep them in an import-competent state as they
travel through the aqueous cytosol and intermembrane space. The small TIM chaperones
of the mitochondrial intermembrane space function within a fine balance of client
promiscuity and high affinity binding, while being also able to release their
client proteins without significant energy barrier to the downstream insertases/translocases.
The tendency of the preproteins to aggregate and the dynamic nature of the preprotein—chaperone
complexes makes the preparation of these complexes challenging. Here we present
two optimized methods for complex formation of highly hydrophobic precursor proteins
and chaperones: a pull-down approach and an in-vitro translation strategy. In
the former, attaching the client protein to an affinity resin keeps the individual
client protein copies apart from each other and decreases the client self-aggregation
probability, thereby favouring complex formation. In the latter approach, a purified
chaperone, added to the cell-free protein synthesis, captures the nascent precursor
protein. The choice of method will depend on the desired client-chaperone complex
amount, or the need for specific labeling scheme.'
article_processing_charge: No
author:
- first_name: Undina
full_name: Guillerm, Undina
id: bb74f472-ae54-11eb-9835-bc9c22fb1183
last_name: Guillerm
- first_name: Iva
full_name: Sučec, Iva
last_name: Sučec
- first_name: Paul
full_name: Schanda, Paul
id: 7B541462-FAF6-11E9-A490-E8DFE5697425
last_name: Schanda
orcid: 0000-0002-9350-7606
citation:
ama: 'Guillerm U, Sučec I, Schanda P. Generation of TIM chaperone substrate complexes.
In: Methods in Enzymology. Vol 707. Elsevier; 2024:391-422. doi:10.1016/bs.mie.2024.07.051'
apa: Guillerm, U., Sučec, I., & Schanda, P. (2024). Generation of TIM chaperone
substrate complexes. In Methods in Enzymology (Vol. 707, pp. 391–422).
Elsevier. https://doi.org/10.1016/bs.mie.2024.07.051
chicago: Guillerm, Undina, Iva Sučec, and Paul Schanda. “Generation of TIM Chaperone
Substrate Complexes.” In Methods in Enzymology, 707:391–422. Elsevier,
2024. https://doi.org/10.1016/bs.mie.2024.07.051.
ieee: U. Guillerm, I. Sučec, and P. Schanda, “Generation of TIM chaperone substrate
complexes,” in Methods in Enzymology, vol. 707, Elsevier, 2024, pp. 391–422.
ista: 'Guillerm U, Sučec I, Schanda P. 2024.Generation of TIM chaperone substrate
complexes. In: Methods in Enzymology. vol. 707, 391–422.'
mla: Guillerm, Undina, et al. “Generation of TIM Chaperone Substrate Complexes.”
Methods in Enzymology, vol. 707, Elsevier, 2024, pp. 391–422, doi:10.1016/bs.mie.2024.07.051.
short: U. Guillerm, I. Sučec, P. Schanda, in:, Methods in Enzymology, Elsevier,
2024, pp. 391–422.
corr_author: '1'
date_created: 2024-10-01T10:58:27Z
date_published: 2024-09-13T00:00:00Z
date_updated: 2025-10-22T06:40:54Z
day: '13'
department:
- _id: PaSc
doi: 10.1016/bs.mie.2024.07.051
external_id:
pmid:
- '39488384'
fulldoi: https://doi.org/10.1016/bs.mie.2024.07.051
intvolume: ' 707'
language:
- iso: eng
month: '09'
oa_version: None
page: 391-422
pmid: 1
publication: Methods in Enzymology
publication_identifier:
issn:
- 0076-6879
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Generation of TIM chaperone substrate complexes
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 707
year: '2024'
...
---
OA_type: closed access
_id: '18171'
abstract:
- lang: eng
text: Defense against pathogens and parasites requires substantial investment of
energy and resources on part of the host. This makes the host immune function
dependent on availability and accessibility of resources. A resource deprived
host is therefore expected to be more susceptible to infections, although empirical
results do not always align with this prediction. Limiting host access to resources
can additionally impact within-host pathogen numbers, either directly by altering
the amount of resources available to the pathogens for proliferation or indirectly
by altering the efficiency of the host immune system. We tested for the effects
of host starvation (complete deprivation of resources) on susceptibility to bacterial
pathogens, and within-host pathogen proliferation, in Drosophila melanogaster
females. Our results show that starvation increases post-infection mortality of
the host, but in a pathogen-specific manner. This increase in mortality is always
accompanied by increased within-host pathogen proliferation. We therefore propose
that starvation compromises host resistance to bacterial infections in Drosophila
melanogaster females thereby increasing susceptibility to infections.
acknowledgement: "The authors thank Tejashwini Hegde for logistical support during
execution of the experiments reported here. The authors thank Prof. P. Cornelis
(Vrije Universiteit Brussel, Belgium) for providing the Pseudomonas entomophila
isolate, Dr. Elio Sucena and Tania Paulo (Instituto Gulbenkian Ciencia, Portugal)
for providing the Erwinia c. carotovora, and Prof. Brian Lazzaro (Cornell University,
USA) for providing the Enterococcus faecalis and Providencia rettgeri isolates,
and Dr. Karan Singh (IISER Mohali, India) for isolating the Staphylococcus succinus
isolate used in the experiments. The authors also thank Dr. Manas Geeta Arun for
maintenance of the LH fly populations used in this study.\r\nThe study was funded
by intra-mural funding from IISER Mohali, India, to NGP. AB was supported by Senior
Research Fellowship for PhD students from CSIR, Govt. of India. AS was supported
by Senior Research Fellowship for PhD students from UGC, Govt. of India. SS and
TM were supported by KVPY fellowships for undergraduate studies from DST, Govt.
of India."
article_number: '108209'
article_processing_charge: No
article_type: original
author:
- first_name: Aabeer
full_name: Basu, Aabeer
last_name: Basu
- first_name: Aparajita
full_name: Singh, Aparajita
last_name: Singh
- first_name: Suhaas
full_name: Sehgal, Suhaas
last_name: Sehgal
- first_name: Tanvi
full_name: Madaan, Tanvi
id: 419917ac-5355-11ee-ae5a-c952babcaad9
last_name: Madaan
- first_name: Nagaraj Guru
full_name: Prasad, Nagaraj Guru
last_name: Prasad
citation:
ama: Basu A, Singh A, Sehgal S, Madaan T, Prasad NG. Starvation increases susceptibility
to bacterial infection and promotes systemic pathogen proliferation in Drosophila
melanogaster females. Journal of Invertebrate Pathology. 2024;207(11).
doi:10.1016/j.jip.2024.108209
apa: Basu, A., Singh, A., Sehgal, S., Madaan, T., & Prasad, N. G. (2024). Starvation
increases susceptibility to bacterial infection and promotes systemic pathogen
proliferation in Drosophila melanogaster females. Journal of Invertebrate Pathology.
Elsevier. https://doi.org/10.1016/j.jip.2024.108209
chicago: Basu, Aabeer, Aparajita Singh, Suhaas Sehgal, Tanvi Madaan, and Nagaraj
Guru Prasad. “Starvation Increases Susceptibility to Bacterial Infection and Promotes
Systemic Pathogen Proliferation in Drosophila Melanogaster Females.” Journal
of Invertebrate Pathology. Elsevier, 2024. https://doi.org/10.1016/j.jip.2024.108209.
ieee: A. Basu, A. Singh, S. Sehgal, T. Madaan, and N. G. Prasad, “Starvation increases
susceptibility to bacterial infection and promotes systemic pathogen proliferation
in Drosophila melanogaster females,” Journal of Invertebrate Pathology,
vol. 207, no. 11. Elsevier, 2024.
ista: Basu A, Singh A, Sehgal S, Madaan T, Prasad NG. 2024. Starvation increases
susceptibility to bacterial infection and promotes systemic pathogen proliferation
in Drosophila melanogaster females. Journal of Invertebrate Pathology. 207(11),
108209.
mla: Basu, Aabeer, et al. “Starvation Increases Susceptibility to Bacterial Infection
and Promotes Systemic Pathogen Proliferation in Drosophila Melanogaster Females.”
Journal of Invertebrate Pathology, vol. 207, no. 11, 108209, Elsevier,
2024, doi:10.1016/j.jip.2024.108209.
short: A. Basu, A. Singh, S. Sehgal, T. Madaan, N.G. Prasad, Journal of Invertebrate
Pathology 207 (2024).
corr_author: '1'
date_created: 2024-10-06T22:01:11Z
date_published: 2024-11-01T00:00:00Z
date_updated: 2025-09-08T09:53:50Z
day: '01'
department:
- _id: SyCr
doi: 10.1016/j.jip.2024.108209
external_id:
isi:
- '001327816900001'
pmid:
- '39322010'
fulldoi: https://doi.org/10.1016/j.jip.2024.108209
intvolume: ' 207'
isi: 1
issue: '11'
language:
- iso: eng
month: '11'
oa_version: None
pmid: 1
publication: Journal of Invertebrate Pathology
publication_identifier:
eissn:
- 1096-0805
issn:
- 0022-2011
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Starvation increases susceptibility to bacterial infection and promotes systemic
pathogen proliferation in Drosophila melanogaster females
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 207
year: '2024'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '18172'
abstract:
- lang: eng
text: Red Giant stars host solar-like oscillations which have mixed character, being
sensitive to conditions both in the outer convection zone and deep within the
interior. The properties of these modes are sensitive to both core rotation and
magnetic fields. While asteroseismic studies of the former have been done on a
large scale, studies of the latter are currently limited to tens of stars. We
aim to produce the first large catalogue of both magnetic and rotational perturbations.
We jointly constrain these parameters by devising an automated method for fitting
the power spectra directly. We successfully apply the method to 302 low-luminosity
red giants. We find a clear bimodality in core rotation rate. The primary peak
is at δνrot = 0.32 μHz, and the secondary at δνrot = 0.47 μHz. Combining our results
with literature values, we find that the percentage of stars rotating much more
rapidly than the population average increases with evolutionary state. We measure
magnetic splittings of 2σ significance in 23 stars. While the most extreme magnetic
splitting values appear in stars with masses > 1.1M⊙, implying they formerly hosted
a convective core, a small but statistically significant magnetic splitting is
measured at lower masses. Asymmetry between the frequencies of a rotationally
split multiplet has previously been used to diagnose the presence of a magnetic
perturbation. We find that of the stars with a significant detection of magnetic
perturbation, 43\% do not show strong asymmetry. We find no strong evidence of
correlation between the rotation and magnetic parameters.
acknowledgement: EJH, WJC, and GRD acknowledge the support of Science and Technology
Facilities Council. MBN acknowledges support from the UK Space Agency. JMJO acknowledges
support from NASA through the NASA Hubble Fellowship grant HST-HF2-51517.001, awarded
by STScI (Space Telescope Science Institute), which is operated by the Association
of Universities for Research in Astronomy, Incorporated, under NASA contract NAS5-26555.
The authors acknowledge use of the Blue-BEAR HPC service at the University of Birmingham.
This paper includes data collected by the Kepler mission and obtained from the MAST
data archive at the Space Telescope Science Institute (STScI). Funding for the Kepler
mission was provided by the NASA Science Mission Directorate. This work has made
use of data from the European Space Agency (ESA) mission Gaia (https://www.cosmos.esa.int/web/gaia),
processed by the Gaia Data Processing and Analysis Consortium (DPAC, https://www.cosmos.esa.int/web/gaia/dpac/consortium).
Funding for the DPAC was provided by national institutions, in particular the institutions
participating in the Gaia Multilateral Agreement. This paper received funding from
the European Research Council (ERC) under the European Union’s Horizon 2020 research
and innovation programme (CartographY GA. 804752). SD and JB acknowledge support
from the Centre National d’Etudes Spatiales (CNES).
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Emily J.
full_name: Hatt, Emily J.
last_name: Hatt
- first_name: J. M.Joel
full_name: Ong, J. M.Joel
last_name: Ong
- first_name: Martin B.
full_name: Nielsen, Martin B.
last_name: Nielsen
- first_name: William J.
full_name: Chaplin, William J.
last_name: Chaplin
- first_name: Guy R.
full_name: Davies, Guy R.
last_name: Davies
- first_name: Sébastien
full_name: Deheuvels, Sébastien
last_name: Deheuvels
- first_name: Jérôme
full_name: Ballot, Jérôme
last_name: Ballot
- first_name: Gang
full_name: Li, Gang
last_name: Li
- first_name: Lisa Annabelle
full_name: Bugnet, Lisa Annabelle
id: d9edb345-f866-11ec-9b37-d119b5234501
last_name: Bugnet
orcid: 0000-0003-0142-4000
citation:
ama: Hatt EJ, Ong JMJ, Nielsen MB, et al. Asteroseismic signatures of core magnetism
and rotation in hundreds of low-luminosity red giants. Monthly Notices of the
Royal Astronomical Society. 2024;534(2):1060-1076. doi:10.1093/mnras/stae2053
apa: Hatt, E. J., Ong, J. M. J., Nielsen, M. B., Chaplin, W. J., Davies, G. R.,
Deheuvels, S., … Bugnet, L. A. (2024). Asteroseismic signatures of core magnetism
and rotation in hundreds of low-luminosity red giants. Monthly Notices of the
Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stae2053
chicago: Hatt, Emily J., J. M.Joel Ong, Martin B. Nielsen, William J. Chaplin, Guy
R. Davies, Sébastien Deheuvels, Jérôme Ballot, Gang Li, and Lisa Annabelle Bugnet.
“Asteroseismic Signatures of Core Magnetism and Rotation in Hundreds of Low-Luminosity
Red Giants.” Monthly Notices of the Royal Astronomical Society. Oxford
University Press, 2024. https://doi.org/10.1093/mnras/stae2053.
ieee: E. J. Hatt et al., “Asteroseismic signatures of core magnetism and
rotation in hundreds of low-luminosity red giants,” Monthly Notices of the
Royal Astronomical Society, vol. 534, no. 2. Oxford University Press, pp.
1060–1076, 2024.
ista: Hatt EJ, Ong JMJ, Nielsen MB, Chaplin WJ, Davies GR, Deheuvels S, Ballot J,
Li G, Bugnet LA. 2024. Asteroseismic signatures of core magnetism and rotation
in hundreds of low-luminosity red giants. Monthly Notices of the Royal Astronomical
Society. 534(2), 1060–1076.
mla: Hatt, Emily J., et al. “Asteroseismic Signatures of Core Magnetism and Rotation
in Hundreds of Low-Luminosity Red Giants.” Monthly Notices of the Royal Astronomical
Society, vol. 534, no. 2, Oxford University Press, 2024, pp. 1060–76, doi:10.1093/mnras/stae2053.
short: E.J. Hatt, J.M.J. Ong, M.B. Nielsen, W.J. Chaplin, G.R. Davies, S. Deheuvels,
J. Ballot, G. Li, L.A. Bugnet, Monthly Notices of the Royal Astronomical Society
534 (2024) 1060–1076.
date_created: 2024-10-06T22:01:11Z
date_published: 2024-10-01T00:00:00Z
date_updated: 2025-09-08T09:53:01Z
day: '01'
ddc:
- '520'
department:
- _id: LiBu
doi: 10.1093/mnras/stae2053
external_id:
arxiv:
- '2409.01157'
isi:
- '001320536900011'
file:
- access_level: open_access
checksum: b79f3c6a5991516abbcc8d34fa4bfb5f
content_type: application/pdf
creator: dernst
date_created: 2024-10-07T09:14:03Z
date_updated: 2024-10-07T09:14:03Z
file_id: '18182'
file_name: 2024_MonthlyNRoyalAstronSoc_Hatt.pdf
file_size: 2813008
relation: main_file
success: 1
file_date_updated: 2024-10-07T09:14:03Z
fulldoi: https://doi.org/10.1093/mnras/stae2053
has_accepted_license: '1'
intvolume: ' 534'
isi: 1
issue: '2'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 1060-1076
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
eissn:
- 1365-2966
issn:
- 0035-8711
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Asteroseismic signatures of core magnetism and rotation in hundreds of low-luminosity
red giants
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: 534
year: '2024'
...
---
_id: '18175'
abstract:
- lang: eng
text: Large-scale software repositories are a source of insights for software engineering.
They offer an unmatched window into the software development process at scale.
Their sheer number and size holds the promise of broadly applicable results. At
the same time, that very size presents practical challenges for scaling tools
and algorithms to millions of projects. A reasonable approach is to limit studies
to representative samples of the population of interest. Broadly applicable conclusions
can then be obtained by generalizing to the entire population. The contribution
of this paper is a standardized experimental design methodology for choosing the
inputs of studies working with large-scale repositories. We advocate for a methodology
that clearly lays out what the population of interest is, how to sample it, and
that fosters reproducibility. Along the way, we discourage researchers from using
extrinsic attributes of projects such as stars, that measure some unclear notion
of popularity.
acknowledgement: "This work was supported by the Czech Ministry of Education, Youth
and Sports under\r\nprogram ERC-CZ, grant agreement LL2325, BigCode (reg. no. CZ.02.1.01/0.0/0.0/15_003/0000421).
NSF grants CCF-1910850, CNS-1925644, and CCF-2139612, as well as the GACR EXPRO
grant 23-07580X. We would like to thank Digital Ocean for their involuntary contribution
of computational resources during the early data gathering phase of our research.
We acknoweldge the reviewers of ICSE’22, and thank the reviewers of ECOOP’23 for
their encouragments and for sticking around until 2024."
alternative_title:
- LIPIcs
article_number: '27'
article_processing_charge: No
author:
- first_name: Petr
full_name: Maj, Petr
last_name: Maj
- first_name: Stefanie
full_name: Muroya Lei, Stefanie
id: a376de31-8972-11ed-ae7b-d0251c13c8ff
last_name: Muroya Lei
- first_name: Konrad
full_name: Siek, Konrad
last_name: Siek
- first_name: Luca
full_name: Di Grazia, Luca
last_name: Di Grazia
- first_name: Jan
full_name: Vitek, Jan
last_name: Vitek
citation:
ama: 'Maj P, Muroya Lei S, Siek K, Di Grazia L, Vitek J. The fault in our stars:
Designing reproducible large-scale code analysis experiments. In: 38th European
Conference on Object-Oriented Programming. Vol 313. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2024. doi:10.4230/LIPIcs.ECOOP.2024.27'
apa: 'Maj, P., Muroya Lei, S., Siek, K., Di Grazia, L., & Vitek, J. (2024).
The fault in our stars: Designing reproducible large-scale code analysis experiments.
In 38th European Conference on Object-Oriented Programming (Vol. 313).
Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ECOOP.2024.27'
chicago: 'Maj, Petr, Stefanie Muroya Lei, Konrad Siek, Luca Di Grazia, and Jan Vitek.
“The Fault in Our Stars: Designing Reproducible Large-Scale Code Analysis Experiments.”
In 38th European Conference on Object-Oriented Programming, Vol. 313. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.ECOOP.2024.27.'
ieee: 'P. Maj, S. Muroya Lei, K. Siek, L. Di Grazia, and J. Vitek, “The fault in
our stars: Designing reproducible large-scale code analysis experiments,” in 38th
European Conference on Object-Oriented Programming, Vienna, Austria, 2024,
vol. 313.'
ista: 'Maj P, Muroya Lei S, Siek K, Di Grazia L, Vitek J. 2024. The fault in our
stars: Designing reproducible large-scale code analysis experiments. 38th European
Conference on Object-Oriented Programming. ECOOP: European Conference on Object-Oriented
Programming, LIPIcs, vol. 313, 27.'
mla: 'Maj, Petr, et al. “The Fault in Our Stars: Designing Reproducible Large-Scale
Code Analysis Experiments.” 38th European Conference on Object-Oriented Programming,
vol. 313, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.ECOOP.2024.27.'
short: P. Maj, S. Muroya Lei, K. Siek, L. Di Grazia, J. Vitek, in:, 38th European
Conference on Object-Oriented Programming, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2024.
conference:
end_date: 2024-09-20
location: Vienna, Austria
name: 'ECOOP: European Conference on Object-Oriented Programming'
start_date: 2024-09-16
date_created: 2024-10-06T22:01:12Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2025-12-02T13:48:19Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.ECOOP.2024.27
external_id:
isi:
- '001533999700027'
file:
- access_level: open_access
checksum: 2e75d305a8c817d76a0c7f136ce34f86
content_type: application/pdf
creator: dernst
date_created: 2024-10-07T11:10:55Z
date_updated: 2024-10-07T11:10:55Z
file_id: '18184'
file_name: 2024_LIPICs_Maj.pdf
file_size: 1764222
relation: main_file
success: 1
file_date_updated: 2024-10-07T11:10:55Z
fulldoi: https://doi.org/10.4230/LIPIcs.ECOOP.2024.27
has_accepted_license: '1'
intvolume: ' 313'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
publication: 38th European Conference on Object-Oriented Programming
publication_identifier:
isbn:
- '9783959773416'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The fault in our stars: Designing reproducible large-scale code analysis experiments'
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: 313
year: '2024'
...