---
_id: '14402'
abstract:
- lang: eng
text: Alpha oscillations are a distinctive feature of the awake resting state of
the human brain. However, their functional role in resting-state neuronal dynamics
remains poorly understood. Here we show that, during resting wakefulness, alpha
oscillations drive an alternation of attenuation and amplification bouts in neural
activity. Our analysis indicates that inhibition is activated in pulses that last
for a single alpha cycle and gradually suppress neural activity, while excitation
is successively enhanced over a few alpha cycles to amplify neural activity. Furthermore,
we show that long-term alpha amplitude fluctuations—the “waxing and waning” phenomenon—are
an attenuation-amplification mechanism described by a power-law decay of the activity
rate in the “waning” phase. Importantly, we do not observe such dynamics during
non-rapid eye movement (NREM) sleep with marginal alpha oscillations. The results
suggest that alpha oscillations modulate neural activity not only through pulses
of inhibition (pulsed inhibition hypothesis) but also by timely enhancement of
excitation (or disinhibition).
acknowledgement: This research was funded in whole or in part by the Austrian Science
Fund (FWF) (grant PT1013M03318 to F.L.). For the purpose of open access, the author
has applied a CC BY public copyright license to any Author Accepted Manuscript version
arising from this submission. The study was supported by the European Union Horizon
2020 Research and Innovation Program under the Marie Sklodowska-Curie action (grant
agreement 754411 to F.L.) and in part by the NextGenerationEU through the grant
TAlent in ReSearch@University of Padua – STARS@UNIPD (to F.L.) (project BRAINCIP
[brain criticality and information processing]). L.d.A. acknowledges support from
the Italian MIUR project PRIN2017WZFTZP and partial support from NEXTGENERATIONEU
(NGEU) funded by the Ministry of University and Research (MUR), National Recovery
and Resilience Plan (NRRP), and project MNESYS (PE0000006)—a multiscale integrated
approach to the study of the nervous system in health and disease (DN. 1553 11.10.2022).
O.S. acknowledges support from the Israel Science Foundation, grant 504/17. The
work was supported in part by DIRP ZIAMH02797 (to D.P.).
article_number: '113162'
article_processing_charge: Yes
article_type: original
author:
- first_name: Fabrizio
full_name: Lombardi, Fabrizio
id: A057D288-3E88-11E9-986D-0CF4E5697425
last_name: Lombardi
orcid: 0000-0003-2623-5249
- first_name: Hans J.
full_name: Herrmann, Hans J.
last_name: Herrmann
- first_name: Liborio
full_name: Parrino, Liborio
last_name: Parrino
- first_name: Dietmar
full_name: Plenz, Dietmar
last_name: Plenz
- first_name: Silvia
full_name: Scarpetta, Silvia
last_name: Scarpetta
- first_name: Anna Elisabetta
full_name: Vaudano, Anna Elisabetta
last_name: Vaudano
- first_name: Lucilla
full_name: De Arcangelis, Lucilla
last_name: De Arcangelis
- first_name: Oren
full_name: Shriki, Oren
last_name: Shriki
citation:
ama: 'Lombardi F, Herrmann HJ, Parrino L, et al. Beyond pulsed inhibition: Alpha
oscillations modulate attenuation and amplification of neural activity in the
awake resting state. Cell Reports. 2023;42(10). doi:10.1016/j.celrep.2023.113162'
apa: 'Lombardi, F., Herrmann, H. J., Parrino, L., Plenz, D., Scarpetta, S., Vaudano,
A. E., … Shriki, O. (2023). Beyond pulsed inhibition: Alpha oscillations modulate
attenuation and amplification of neural activity in the awake resting state. Cell
Reports. Elsevier. https://doi.org/10.1016/j.celrep.2023.113162'
chicago: 'Lombardi, Fabrizio, Hans J. Herrmann, Liborio Parrino, Dietmar Plenz,
Silvia Scarpetta, Anna Elisabetta Vaudano, Lucilla De Arcangelis, and Oren Shriki.
“Beyond Pulsed Inhibition: Alpha Oscillations Modulate Attenuation and Amplification
of Neural Activity in the Awake Resting State.” Cell Reports. Elsevier,
2023. https://doi.org/10.1016/j.celrep.2023.113162.'
ieee: 'F. Lombardi et al., “Beyond pulsed inhibition: Alpha oscillations
modulate attenuation and amplification of neural activity in the awake resting
state,” Cell Reports, vol. 42, no. 10. Elsevier, 2023.'
ista: 'Lombardi F, Herrmann HJ, Parrino L, Plenz D, Scarpetta S, Vaudano AE, De
Arcangelis L, Shriki O. 2023. Beyond pulsed inhibition: Alpha oscillations modulate
attenuation and amplification of neural activity in the awake resting state. Cell
Reports. 42(10), 113162.'
mla: 'Lombardi, Fabrizio, et al. “Beyond Pulsed Inhibition: Alpha Oscillations Modulate
Attenuation and Amplification of Neural Activity in the Awake Resting State.”
Cell Reports, vol. 42, no. 10, 113162, Elsevier, 2023, doi:10.1016/j.celrep.2023.113162.'
short: F. Lombardi, H.J. Herrmann, L. Parrino, D. Plenz, S. Scarpetta, A.E. Vaudano,
L. De Arcangelis, O. Shriki, Cell Reports 42 (2023).
corr_author: '1'
date_created: 2023-10-08T22:01:15Z
date_published: 2023-10-31T00:00:00Z
date_updated: 2026-07-06T12:48:55Z
day: '31'
ddc:
- '570'
department:
- _id: GaTk
doi: 10.1016/j.celrep.2023.113162
ec_funded: 1
external_id:
isi:
- '001086695500001'
pmid:
- '37777965'
file:
- access_level: open_access
checksum: 9c71eb2a03aa160415f01ad95f49ceb5
content_type: application/pdf
creator: dernst
date_created: 2024-01-30T14:07:08Z
date_updated: 2024-01-30T14:07:08Z
file_id: '14914'
file_name: 2023_CellReports_Lombardi.pdf
file_size: 5599007
relation: main_file
success: 1
file_date_updated: 2024-01-30T14:07:08Z
has_accepted_license: '1'
intvolume: ' 42'
isi: 1
issue: '10'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: eb943429-77a9-11ec-83b8-9f471cdf5c67
grant_number: M03318
name: Functional Advantages of Critical Brain Dynamics
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Cell Reports
publication_identifier:
eissn:
- 2211-1247
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '10821'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: 'Beyond pulsed inhibition: Alpha oscillations modulate attenuation and amplification
of neural activity in the awake resting state'
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: 42
year: '2023'
...
---
OA_place: publisher
OA_type: hybrid
_id: '13267'
abstract:
- lang: eng
text: Three-dimensional (3D) reconstruction of living brain tissue down to an individual
synapse level would create opportunities for decoding the dynamics and structure–function
relationships of the brain’s complex and dense information processing network;
however, this has been hindered by insufficient 3D resolution, inadequate signal-to-noise
ratio and prohibitive light burden in optical imaging, whereas electron microscopy
is inherently static. Here we solved these challenges by developing an integrated
optical/machine-learning technology, LIONESS (live information-optimized nanoscopy
enabling saturated segmentation). This leverages optical modifications to stimulated
emission depletion microscopy in comprehensively, extracellularly labeled tissue
and previous information on sample structure via machine learning to simultaneously
achieve isotropic super-resolution, high signal-to-noise ratio and compatibility
with living tissue. This allows dense deep-learning-based instance segmentation
and 3D reconstruction at a synapse level, incorporating molecular, activity and
morphodynamic information. LIONESS opens up avenues for studying the dynamic functional
(nano-)architecture of living brain tissue.
acknowledged_ssus:
- _id: ScienComp
- _id: Bio
- _id: PreCl
- _id: E-Lib
- _id: LifeSc
- _id: M-Shop
acknowledgement: "We thank J. Vorlaufer, N. Agudelo and A. Wartak for microscope maintenance
and troubleshooting, C. Kreuzinger and A. Freeman for technical assistance, M. Šuplata
for hardware control support and M. Cunha dos Santos for initial exploration of
software. We\r\nthank P. Henderson for advice on deep-learning training and M. Sixt,
S. Boyd and T. Weiss for discussions and critical reading of the manuscript. L.
Lavis (Janelia Research Campus) generously provided the JF585-HaloTag ligand. We
acknowledge expert support by IST\r\nAustria’s scientific computing, imaging and
optics, preclinical, library and laboratory support facilities and by the Miba machine
shop. We gratefully acknowledge funding by the following sources: Austrian Science
Fund (F.W.F.) grant no. I3600-B27 (J.G.D.), grant no. DK W1232\r\n(J.G.D. and J.M.M.)
and grant no. Z 312-B27, Wittgenstein award (P.J.); the Gesellschaft für Forschungsförderung
NÖ grant no. LSC18-022 (J.G.D.); an ISTA Interdisciplinary project grant (J.G.D.
and B.B.); the European Union’s Horizon 2020 research and innovation programme,\r\nMarie-Skłodowska
Curie grant 665385 (J.M.M. and J.L.); the European Union’s Horizon 2020 research
and innovation programme, European Research Council grant no. 715767, MATERIALIZABLE
(B.B.); grant no. 715508, REVERSEAUTISM (G.N.); grant no. 695568, SYNNOVATE (S.G.N.G.);
and grant no. 692692, GIANTSYN (P.J.); the Simons\r\nFoundation Autism Research
Initiative grant no. 529085 (S.G.N.G.); the Wellcome Trust Technology Development
grant no. 202932 (S.G.N.G.); the Marie Skłodowska-Curie Actions Individual Fellowship
no. 101026635 under the EU Horizon 2020 program (J.F.W.);\r\nthe Human Frontier
Science Program postdoctoral fellowship LT000557/2018 (W.J.); and the National Science
Foundation grant no. IIS-1835231 (H.P.) and NCS-FO-2124179 (H.P.)."
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Philipp
full_name: Velicky, Philipp
id: 39BDC62C-F248-11E8-B48F-1D18A9856A87
last_name: Velicky
orcid: 0000-0002-2340-7431
- first_name: Eder
full_name: Miguel Villalba, Eder
id: 3FB91342-F248-11E8-B48F-1D18A9856A87
last_name: Miguel Villalba
orcid: 0000-0001-5665-0430
- first_name: Julia M
full_name: Michalska, Julia M
id: 443DB6DE-F248-11E8-B48F-1D18A9856A87
last_name: Michalska
orcid: 0000-0003-3862-1235
- first_name: Julia
full_name: Lyudchik, Julia
id: 46E28B80-F248-11E8-B48F-1D18A9856A87
last_name: Lyudchik
- first_name: Donglai
full_name: Wei, Donglai
last_name: Wei
- first_name: Zudi
full_name: Lin, Zudi
last_name: Lin
- first_name: Jake
full_name: Watson, Jake
id: 63836096-4690-11EA-BD4E-32803DDC885E
last_name: Watson
orcid: 0000-0002-8698-3823
- first_name: Jakob
full_name: Troidl, Jakob
last_name: Troidl
- first_name: Johanna
full_name: Beyer, Johanna
last_name: Beyer
- first_name: Yoav
full_name: Ben Simon, Yoav
id: 43DF3136-F248-11E8-B48F-1D18A9856A87
last_name: Ben Simon
- first_name: Christoph M
full_name: Sommer, Christoph M
id: 4DF26D8C-F248-11E8-B48F-1D18A9856A87
last_name: Sommer
orcid: 0000-0003-1216-9105
- first_name: Wiebke
full_name: Jahr, Wiebke
id: 425C1CE8-F248-11E8-B48F-1D18A9856A87
last_name: Jahr
orcid: 0000-0003-0201-2315
- first_name: Alban
full_name: Cenameri, Alban
id: 9ac8f577-2357-11eb-997a-e566c5550886
last_name: Cenameri
- first_name: Johannes
full_name: Broichhagen, Johannes
last_name: Broichhagen
- first_name: Seth G.N.
full_name: Grant, Seth G.N.
last_name: Grant
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
- first_name: Hanspeter
full_name: Pfister, Hanspeter
last_name: Pfister
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
citation:
ama: Velicky P, Miguel Villalba E, Michalska JM, et al. Dense 4D nanoscale reconstruction
of living brain tissue. Nature Methods. 2023;20:1256-1265. doi:10.1038/s41592-023-01936-6
apa: Velicky, P., Miguel Villalba, E., Michalska, J. M., Lyudchik, J., Wei, D.,
Lin, Z., … Danzl, J. G. (2023). Dense 4D nanoscale reconstruction of living brain
tissue. Nature Methods. Springer Nature. https://doi.org/10.1038/s41592-023-01936-6
chicago: Velicky, Philipp, Eder Miguel Villalba, Julia M Michalska, Julia Lyudchik,
Donglai Wei, Zudi Lin, Jake Watson, et al. “Dense 4D Nanoscale Reconstruction
of Living Brain Tissue.” Nature Methods. Springer Nature, 2023. https://doi.org/10.1038/s41592-023-01936-6.
ieee: P. Velicky et al., “Dense 4D nanoscale reconstruction of living brain
tissue,” Nature Methods, vol. 20. Springer Nature, pp. 1256–1265, 2023.
ista: Velicky P, Miguel Villalba E, Michalska JM, Lyudchik J, Wei D, Lin Z, Watson
J, Troidl J, Beyer J, Ben Simon Y, Sommer CM, Jahr W, Cenameri A, Broichhagen
J, Grant SGN, Jonas PM, Novarino G, Pfister H, Bickel B, Danzl JG. 2023. Dense
4D nanoscale reconstruction of living brain tissue. Nature Methods. 20, 1256–1265.
mla: Velicky, Philipp, et al. “Dense 4D Nanoscale Reconstruction of Living Brain
Tissue.” Nature Methods, vol. 20, Springer Nature, 2023, pp. 1256–65, doi:10.1038/s41592-023-01936-6.
short: P. Velicky, E. Miguel Villalba, J.M. Michalska, J. Lyudchik, D. Wei, Z. Lin,
J. Watson, J. Troidl, J. Beyer, Y. Ben Simon, C.M. Sommer, W. Jahr, A. Cenameri,
J. Broichhagen, S.G.N. Grant, P.M. Jonas, G. Novarino, H. Pfister, B. Bickel,
J.G. Danzl, Nature Methods 20 (2023) 1256–1265.
corr_author: '1'
date_created: 2023-07-23T22:01:13Z
date_published: 2023-08-01T00:00:00Z
date_updated: 2026-07-06T12:49:46Z
day: '01'
ddc:
- '570'
department:
- _id: PeJo
- _id: GaNo
- _id: BeBi
- _id: JoDa
- _id: Bio
doi: 10.1038/s41592-023-01936-6
ec_funded: 1
external_id:
isi:
- '001025621500001'
pmid:
- '37429995'
file:
- access_level: open_access
checksum: a68e845780a82ea36d0d4d3212a87c10
content_type: application/pdf
creator: dernst
date_created: 2025-02-26T08:01:57Z
date_updated: 2025-02-26T08:01:57Z
file_id: '19088'
file_name: 2023_NatureMethods_Velicky.pdf
file_size: 14103039
relation: main_file
success: 1
file_date_updated: 2025-02-26T08:01:57Z
has_accepted_license: '1'
intvolume: ' 20'
isi: 1
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 1256-1265
pmid: 1
project:
- _id: 265CB4D0-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I03600
name: Optical control of synaptic function via adhesion molecules
- _id: 2548AE96-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: W1232
name: Molecular Drug Targets
- _id: 25C5A090-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00312
name: Synaptic communication in neuronal microcircuits
- _id: 23889792-32DE-11EA-91FC-C7463DDC885E
grant_number: LS18-022
name: High content imaging to decode human immune cell interactions in health and
allergic disease
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715767'
name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
Modeling'
- _id: 25444568-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715508'
name: Probing the Reversibility of Autism Spectrum Disorders by Employing in vivo
and in vitro Models
- _id: 25B7EB9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '692692'
name: Biophysics and circuit function of a giant cortical glutamatergic synapse
- _id: fc2be41b-9c52-11eb-aca3-faa90aa144e9
call_identifier: H2020
grant_number: '101026635'
name: Synaptic computations of the hippocampal CA3 circuitry
- _id: 2668BFA0-B435-11E9-9278-68D0E5697425
grant_number: LT00057
name: High-speed 3D-nanoscopy to study the role of adhesion during 3D cell migration
publication: Nature Methods
publication_identifier:
eissn:
- 1548-7105
issn:
- 1548-7091
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://github.com/danzllab/LIONESS
record:
- id: '12817'
relation: research_data
status: public
- id: '14770'
relation: shorter_version
status: public
- id: '18674'
relation: dissertation_contains
status: public
- id: '11943'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Dense 4D nanoscale reconstruction of living brain tissue
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: 20
year: '2023'
...
---
_id: '14502'
abstract:
- lang: eng
text: A precise quantitative description of the ultrastructural characteristics
underlying biological mechanisms is often key to their understanding. This is
particularly true for dynamic extra- and intracellular filamentous assemblies,
playing a role in cell motility, cell integrity, cytokinesis, tissue formation
and maintenance. For example, genetic manipulation or modulation of actin regulatory
proteins frequently manifests in changes of the morphology, dynamics, and ultrastructural
architecture of actin filament-rich cell peripheral structures, such as lamellipodia
or filopodia. However, the observed ultrastructural effects often remain subtle
and require sufficiently large datasets for appropriate quantitative analysis.
The acquisition of such large datasets has been enabled by recent advances in
high-throughput cryo-electron tomography (cryo-ET) methods. This also necessitates
the development of complementary approaches to maximize the extraction of relevant
biological information. We have developed a computational toolbox for the semi-automatic
quantification of segmented and vectorized fila- mentous networks from pre-processed
cryo-electron tomograms, facilitating the analysis and cross-comparison of multiple
experimental conditions. GUI-based components simplify the processing of data
and allow users to obtain a large number of ultrastructural parameters describing
filamentous assemblies. We demonstrate the feasibility of this workflow by analyzing
cryo-ET data of untreated and chemically perturbed branched actin filament networks
and that of parallel actin filament arrays. In principle, the computational toolbox
presented here is applicable for data analysis comprising any type of filaments
in regular (i.e. parallel) or random arrangement. We show that it can ease the
identification of key differences between experimental groups and facilitate the
in-depth analysis of ultrastructural data in a time-efficient manner.
author:
- first_name: Georgi A
full_name: Dimchev, Georgi A
id: 38C393BE-F248-11E8-B48F-1D18A9856A87
last_name: Dimchev
orcid: 0000-0001-8370-6161
- first_name: Behnam
full_name: Amiri, Behnam
last_name: Amiri
- first_name: Florian
full_name: Fäßler, Florian
id: 404F5528-F248-11E8-B48F-1D18A9856A87
last_name: Fäßler
orcid: 0000-0001-7149-769X
- first_name: Martin
full_name: Falcke, Martin
last_name: Falcke
- first_name: Florian KM
full_name: Schur, Florian KM
id: 48AD8942-F248-11E8-B48F-1D18A9856A87
last_name: Schur
orcid: 0000-0003-4790-8078
citation:
ama: Dimchev GA, Amiri B, Fäßler F, Falcke M, Schur FK. Computational toolbox for
ultrastructural quantitative analysis of filament networks in cryo-ET data. 2023.
doi:10.15479/AT:ISTA:14502
apa: Dimchev, G. A., Amiri, B., Fäßler, F., Falcke, M., & Schur, F. K. (2023).
Computational toolbox for ultrastructural quantitative analysis of filament networks
in cryo-ET data. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:14502
chicago: Dimchev, Georgi A, Behnam Amiri, Florian Fäßler, Martin Falcke, and Florian
KM Schur. “Computational Toolbox for Ultrastructural Quantitative Analysis of
Filament Networks in Cryo-ET Data.” Institute of Science and Technology Austria,
2023. https://doi.org/10.15479/AT:ISTA:14502.
ieee: G. A. Dimchev, B. Amiri, F. Fäßler, M. Falcke, and F. K. Schur, “Computational
toolbox for ultrastructural quantitative analysis of filament networks in cryo-ET
data.” Institute of Science and Technology Austria, 2023.
ista: Dimchev GA, Amiri B, Fäßler F, Falcke M, Schur FK. 2023. Computational toolbox
for ultrastructural quantitative analysis of filament networks in cryo-ET data,
Institute of Science and Technology Austria, 10.15479/AT:ISTA:14502.
mla: Dimchev, Georgi A., et al. Computational Toolbox for Ultrastructural Quantitative
Analysis of Filament Networks in Cryo-ET Data. Institute of Science and Technology
Austria, 2023, doi:10.15479/AT:ISTA:14502.
short: G.A. Dimchev, B. Amiri, F. Fäßler, M. Falcke, F.K. Schur, (2023).
corr_author: '1'
date_created: 2023-11-08T19:40:54Z
date_published: 2023-11-21T00:00:00Z
date_updated: 2026-07-06T12:57:43Z
day: '21'
ddc:
- '570'
department:
- _id: FlSc
doi: 10.15479/AT:ISTA:14502
file:
- access_level: open_access
checksum: a8b9adeb53a4109dea4d5e39fa1acccf
content_type: application/zip
creator: fschur
date_created: 2023-11-08T20:23:07Z
date_updated: 2023-11-08T20:23:07Z
file_id: '14503'
file_name: Computational_Toolbox_v1.2.zip
file_size: 347641117
relation: main_file
success: 1
- access_level: open_access
checksum: 14db2addbfca61a085ba301ed6f2900b
content_type: text/plain
creator: dernst
date_created: 2023-11-21T08:20:23Z
date_updated: 2023-11-21T08:20:23Z
file_id: '14586'
file_name: Readme.txt
file_size: 1522
relation: main_file
success: 1
file_date_updated: 2023-11-21T08:20:23Z
has_accepted_license: '1'
keyword:
- cryo-electron tomography
- actin cytoskeleton
- toolbox
license: https://choosealicense.com/licenses/agpl-3.0/
month: '11'
oa: 1
project:
- _id: 9B954C5C-BA93-11EA-9121-9846C619BF3A
grant_number: P33367
name: Structure and isoform diversity of the Arp2/3 complex
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '10290'
relation: used_for_analysis_in
status: public
status: public
title: Computational toolbox for ultrastructural quantitative analysis of filament
networks in cryo-ET data
tmp:
legal_code_url: https://www.gnu.org/licenses/agpl-3.0.html
name: GNU Affero General Public License v3.0
short: 'GNU AGPLv3 '
type: software
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '13212'
abstract:
- lang: eng
text: Auxin is the major plant hormone regulating growth and development (Friml,
2022). Forward genetic approaches in the model plant Arabidopsis thaliana have
identified major components of auxin signalling and established the canonical
mechanism mediating transcriptional and thus developmental reprogramming. In this
textbook view, TRANSPORT INHIBITOR RESPONSE 1 (TIR1)/AUXIN-SIGNALING F-BOX (AFBs)
are auxin receptors, which act as F-box subunits determining the substrate specificity
of the Skp1-Cullin1-F box protein (SCF) type E3 ubiquitin ligase complex. Auxin
acts as a “molecular glue” increasing the affinity between TIR1/AFBs and the Aux/IAA
repressors. Subsequently, Aux/IAAs are ubiquitinated and degraded, thus releasing
auxin transcription factors from their repression making them free to mediate
transcription of auxin response genes (Yu et al., 2022). Nonetheless, accumulating
evidence suggests existence of rapid, non-transcriptional responses downstream
of TIR1/AFBs such as auxin-induced cytosolic calcium (Ca2+) transients, plasma
membrane depolarization and apoplast alkalinisation, all converging on the process
of root growth inhibition and root gravitropism (Li et al., 2022). Particularly,
these rapid responses are mostly contributed by predominantly cytosolic AFB1,
while the long-term growth responses are mediated by mainly nuclear TIR1 and AFB2-AFB5
(Li et al., 2021; Prigge et al., 2020; Serre et al., 2021). How AFB1 conducts
auxin-triggered rapid responses and how it is different from TIR1 and AFB2-AFB5
remains elusive. Here, we compare the roles of TIR1 and AFB1 in transcriptional
and rapid responses by modulating their subcellular localization in Arabidopsis
and by testing their ability to mediate transcriptional responses when part of
the minimal auxin circuit reconstituted in yeast.
acknowledged_ssus:
- _id: LifeSc
- _id: Bio
acknowledgement: We thank all the authors for sharing the published materials. This
research was supported by the Lab Support Facility and the Imaging and Optics Facility
of ISTA. We thank Lukáš Fiedler (ISTA) for critical reading of the manuscript. This
project was funded by the European Research Council Advanced Grant (ETAP-742985).
article_processing_charge: Yes (via OA deal)
article_type: letter_note
author:
- first_name: Huihuang
full_name: Chen, Huihuang
id: 83c96512-15b2-11ec-abd3-b7eede36184f
last_name: Chen
- first_name: Lanxin
full_name: Li, Lanxin
id: 367EF8FA-F248-11E8-B48F-1D18A9856A87
last_name: Li
orcid: 0000-0002-5607-272X
- first_name: Minxia
full_name: Zou, Minxia
id: 5c243f41-03f3-11ec-841c-96faf48a7ef9
last_name: Zou
- first_name: Linlin
full_name: Qi, Linlin
id: 44B04502-A9ED-11E9-B6FC-583AE6697425
last_name: Qi
orcid: 0000-0001-5187-8401
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Chen H, Li L, Zou M, Qi L, Friml J. Distinct functions of TIR1 and AFB1 receptors
in auxin signalling. Molecular Plant. 2023;16(7):1117-1119. doi:10.1016/j.molp.2023.06.007
apa: Chen, H., Li, L., Zou, M., Qi, L., & Friml, J. (2023). Distinct functions
of TIR1 and AFB1 receptors in auxin signalling. Molecular Plant. Elsevier.
https://doi.org/10.1016/j.molp.2023.06.007
chicago: Chen, Huihuang, Lanxin Li, Minxia Zou, Linlin Qi, and Jiří Friml. “Distinct
Functions of TIR1 and AFB1 Receptors in Auxin Signalling.” Molecular Plant.
Elsevier, 2023. https://doi.org/10.1016/j.molp.2023.06.007.
ieee: H. Chen, L. Li, M. Zou, L. Qi, and J. Friml, “Distinct functions of TIR1 and
AFB1 receptors in auxin signalling.,” Molecular Plant, vol. 16, no. 7.
Elsevier, pp. 1117–1119, 2023.
ista: Chen H, Li L, Zou M, Qi L, Friml J. 2023. Distinct functions of TIR1 and AFB1
receptors in auxin signalling. Molecular Plant. 16(7), 1117–1119.
mla: Chen, Huihuang, et al. “Distinct Functions of TIR1 and AFB1 Receptors in Auxin
Signalling.” Molecular Plant, vol. 16, no. 7, Elsevier, 2023, pp. 1117–19,
doi:10.1016/j.molp.2023.06.007.
short: H. Chen, L. Li, M. Zou, L. Qi, J. Friml, Molecular Plant 16 (2023) 1117–1119.
corr_author: '1'
das_tickbox: '1'
date_created: 2023-07-12T07:32:46Z
date_published: 2023-07-01T00:00:00Z
date_updated: 2026-07-06T12:58:58Z
day: '01'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.1016/j.molp.2023.06.007
ec_funded: 1
external_id:
isi:
- '001044410900001'
pmid:
- '37393433'
file:
- access_level: open_access
checksum: 6012b7e4a2f680ee6c1f84001e2b945f
content_type: application/pdf
creator: dernst
date_created: 2024-01-29T10:37:05Z
date_updated: 2024-01-29T10:37:05Z
file_id: '14894'
file_name: 2023_MolecularPlant_Chen.pdf
file_size: 1000871
relation: main_file
success: 1
file_date_updated: 2024-01-29T10:37:05Z
has_accepted_license: '1'
intvolume: ' 16'
isi: 1
issue: '7'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 1117-1119
pmid: 1
project:
- _id: 261099A6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '742985'
name: Tracing Evolution of Auxin Transport and Polarity in Plants
publication: Molecular Plant
publication_identifier:
eissn:
- 1674-2052
issn:
- 1752-9867
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '19478'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Distinct functions of TIR1 and AFB1 receptors in auxin signalling.
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 16
year: '2023'
...
---
_id: '13209'
abstract:
- lang: eng
text: The phytohormone auxin plays central roles in many growth and developmental
processes in plants. Development of chemical tools targeting the auxin pathway
is useful for both plant biology and agriculture. Here we reveal that naproxen,
a synthetic compound with anti-inflammatory activity in humans, acts as an auxin
transport inhibitor targeting PIN-FORMED (PIN) transporters in plants. Physiological
experiments indicate that exogenous naproxen treatment affects pleiotropic auxin-regulated
developmental processes. Additional cellular and biochemical evidence indicates
that naproxen suppresses auxin transport, specifically PIN-mediated auxin efflux.
Moreover, biochemical and structural analyses confirm that naproxen binds directly
to PIN1 protein via the same binding cavity as the indole-3-acetic acid substrate.
Thus, by combining cellular, biochemical, and structural approaches, this study
clearly establishes that naproxen is a PIN inhibitor and elucidates the underlying
mechanisms. Further use of this compound may advance our understanding of the
molecular mechanisms of PIN-mediated auxin transport and expand our toolkit in
auxin biology and agriculture.
acknowledgement: "This work was supported by the Strategic Priority Research Program
of the Chinese Academy of Sciences (XDB37020103 to Linfeng Sun); research funds
from the Center for Advanced Interdisciplinary Science\r\nand Biomedicine of IHM,
Division of Life Sciences and Medicine, University of Science and Technology of
China (QYPY20220012 to S.T.); start-up funding from the University of Science and
Technology of China and the\r\nChinese Academy of Sciences (GG9100007007, KY9100000026,KY9100000051,
and KJ2070000079 to S.T.); the National Natural Science Foundation of China (31900885
to X.L. and 31870732 to Linfeng Sun); the Natural Science Foundation of Anhui Province
(2008085MC90 to X.L. and 2008085J15 to Linfeng Sun); the Fundamental Research Funds
for the Central Universities (WK9100000021 to S.T. and WK9100000031 to Linfeng Sun);
and the USTC Research Funds of the Double First-Class Initiative (YD9100002016 to
S.T. and YD9100002004 to Linfeng Sun). Linfeng Sun is supported by an Outstanding
Young Scholar Award from the Qiu Shi Science and Technologies Foundation and a Young
Scholar Award from the Cyrus Tang Foundation.We thank Dr. Yang Zhao for sharing
published materials (Center for Excellence in Molecular Plant Sciences, Chinese
Academy of Sciences) and the Cryo-EM Center of the University of Science and Technology
of China for the EM facility support. We are grateful to Y. Gao and all other staff
members for their technical support on cryo-EM data collection. "
article_number: '100632'
article_processing_charge: Yes
article_type: original
author:
- first_name: Jing
full_name: Xia, Jing
last_name: Xia
- first_name: Mengjuan
full_name: Kong, Mengjuan
last_name: Kong
- first_name: Zhisen
full_name: Yang, Zhisen
last_name: Yang
- first_name: Lianghanxiao
full_name: Sun, Lianghanxiao
last_name: Sun
- first_name: Yakun
full_name: Peng, Yakun
last_name: Peng
- first_name: Yanbo
full_name: Mao, Yanbo
last_name: Mao
- first_name: Hong
full_name: Wei, Hong
last_name: Wei
- first_name: Wei
full_name: Ying, Wei
last_name: Ying
- first_name: Yongxiao
full_name: Gao, Yongxiao
last_name: Gao
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Jianping
full_name: Weng, Jianping
last_name: Weng
- first_name: Xin
full_name: Liu, Xin
last_name: Liu
- first_name: Linfeng
full_name: Sun, Linfeng
last_name: Sun
- first_name: Shutang
full_name: Tan, Shutang
last_name: Tan
citation:
ama: Xia J, Kong M, Yang Z, et al. Chemical inhibition of Arabidopsis PIN-FORMED
auxin transporters by the anti-inflammatory drug naproxen. Plant Communications.
2023;4(6). doi:10.1016/j.xplc.2023.100632
apa: Xia, J., Kong, M., Yang, Z., Sun, L., Peng, Y., Mao, Y., … Tan, S. (2023).
Chemical inhibition of Arabidopsis PIN-FORMED auxin transporters by the anti-inflammatory
drug naproxen. Plant Communications. Elsevier. https://doi.org/10.1016/j.xplc.2023.100632
chicago: Xia, Jing, Mengjuan Kong, Zhisen Yang, Lianghanxiao Sun, Yakun Peng, Yanbo
Mao, Hong Wei, et al. “Chemical Inhibition of Arabidopsis PIN-FORMED Auxin Transporters
by the Anti-Inflammatory Drug Naproxen.” Plant Communications. Elsevier,
2023. https://doi.org/10.1016/j.xplc.2023.100632.
ieee: J. Xia et al., “Chemical inhibition of Arabidopsis PIN-FORMED auxin
transporters by the anti-inflammatory drug naproxen,” Plant Communications,
vol. 4, no. 6. Elsevier, 2023.
ista: Xia J, Kong M, Yang Z, Sun L, Peng Y, Mao Y, Wei H, Ying W, Gao Y, Friml J,
Weng J, Liu X, Sun L, Tan S. 2023. Chemical inhibition of Arabidopsis PIN-FORMED
auxin transporters by the anti-inflammatory drug naproxen. Plant Communications.
4(6), 100632.
mla: Xia, Jing, et al. “Chemical Inhibition of Arabidopsis PIN-FORMED Auxin Transporters
by the Anti-Inflammatory Drug Naproxen.” Plant Communications, vol. 4,
no. 6, 100632, Elsevier, 2023, doi:10.1016/j.xplc.2023.100632.
short: J. Xia, M. Kong, Z. Yang, L. Sun, Y. Peng, Y. Mao, H. Wei, W. Ying, Y. Gao,
J. Friml, J. Weng, X. Liu, L. Sun, S. Tan, Plant Communications 4 (2023).
das_tickbox: '1'
date_created: 2023-07-12T07:32:00Z
date_published: 2023-11-13T00:00:00Z
date_updated: 2026-07-06T12:59:25Z
day: '13'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.1016/j.xplc.2023.100632
external_id:
isi:
- '001113003000001'
pmid:
- '37254481'
file:
- access_level: open_access
checksum: f8ef92af6096834f91ce38587fb1db9f
content_type: application/pdf
creator: dernst
date_created: 2024-01-30T10:54:40Z
date_updated: 2024-01-30T10:54:40Z
file_id: '14900'
file_name: 2023_PlantCommunications_Xia.pdf
file_size: 1434862
relation: main_file
success: 1
file_date_updated: 2024-01-30T10:54:40Z
has_accepted_license: '1'
intvolume: ' 4'
isi: 1
issue: '6'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
pmid: 1
publication: Plant Communications
publication_identifier:
eissn:
- 2590-3462
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Chemical inhibition of Arabidopsis PIN-FORMED auxin transporters by the anti-inflammatory
drug naproxen
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2023'
...
---
_id: '13162'
article_processing_charge: No
author:
- first_name: Stefano
full_name: Elefante, Stefano
id: 490F40CE-F248-11E8-B48F-1D18A9856A87
last_name: Elefante
- first_name: Stephan
full_name: Stadlbauer, Stephan
id: 4D0BC184-F248-11E8-B48F-1D18A9856A87
last_name: Stadlbauer
- first_name: Michael F
full_name: Alexander, Michael F
id: 3A02A8FA-F248-11E8-B48F-1D18A9856A87
last_name: Alexander
- first_name: Alois
full_name: Schlögl, Alois
id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
last_name: Schlögl
orcid: 0000-0002-5621-8100
citation:
ama: 'Elefante S, Stadlbauer S, Alexander MF, Schlögl A. Cryo-EM software packages:
A sys-admins point of view. In: ASHPC23 - Austrian-Slovenian HPC Meeting 2023.
EuroCC Austria; 2023:42-42.'
apa: 'Elefante, S., Stadlbauer, S., Alexander, M. F., & Schlögl, A. (2023).
Cryo-EM software packages: A sys-admins point of view. In ASHPC23 - Austrian-Slovenian
HPC Meeting 2023 (pp. 42–42). Maribor, Slovenia: EuroCC Austria.'
chicago: 'Elefante, Stefano, Stephan Stadlbauer, Michael F Alexander, and Alois
Schlögl. “Cryo-EM Software Packages: A Sys-Admins Point of View.” In ASHPC23
- Austrian-Slovenian HPC Meeting 2023, 42–42. EuroCC Austria, 2023.'
ieee: 'S. Elefante, S. Stadlbauer, M. F. Alexander, and A. Schlögl, “Cryo-EM software
packages: A sys-admins point of view,” in ASHPC23 - Austrian-Slovenian HPC
Meeting 2023, Maribor, Slovenia, 2023, pp. 42–42.'
ista: 'Elefante S, Stadlbauer S, Alexander MF, Schlögl A. 2023. Cryo-EM software
packages: A sys-admins point of view. ASHPC23 - Austrian-Slovenian HPC Meeting
2023. ASHPC: Austrian-Slovenian HPC Meeting, 42–42.'
mla: 'Elefante, Stefano, et al. “Cryo-EM Software Packages: A Sys-Admins Point of
View.” ASHPC23 - Austrian-Slovenian HPC Meeting 2023, EuroCC Austria, 2023,
pp. 42–42.'
short: S. Elefante, S. Stadlbauer, M.F. Alexander, A. Schlögl, in:, ASHPC23 - Austrian-Slovenian
HPC Meeting 2023, EuroCC Austria, 2023, pp. 42–42.
conference:
end_date: 2023-06-15
location: Maribor, Slovenia
name: 'ASHPC: Austrian-Slovenian HPC Meeting'
start_date: 2023-06-12
corr_author: '1'
date_created: 2023-06-23T11:03:18Z
date_published: 2023-07-01T00:00:00Z
date_updated: 2026-07-06T13:01:58Z
day: '01'
ddc:
- '000'
department:
- _id: ScienComp
file:
- access_level: open_access
checksum: 0ab6173cd5c5634ed773cd37ff012681
content_type: application/pdf
creator: dernst
date_created: 2023-07-18T09:28:30Z
date_updated: 2023-07-18T09:28:30Z
file_id: '13250'
file_name: 2023_ASHPC_Elefante.pdf
file_size: 380354
relation: main_file
success: 1
file_date_updated: 2023-07-18T09:28:30Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 42-42
publication: ASHPC23 - Austrian-Slovenian HPC Meeting 2023
publication_status: published
publisher: EuroCC Austria
quality_controlled: '1'
status: public
title: 'Cryo-EM software packages: A sys-admins point of view'
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_abstract
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '13161'
acknowledgement: Thanks to Jesse Hansen for his suggestions on improving the abstract.
article_processing_charge: No
author:
- first_name: Alois
full_name: Schlögl, Alois
id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
last_name: Schlögl
orcid: 0000-0002-5621-8100
- first_name: Stefano
full_name: Elefante, Stefano
id: 490F40CE-F248-11E8-B48F-1D18A9856A87
last_name: Elefante
- first_name: Victor-Valentin
full_name: Hodirnau, Victor-Valentin
id: 3661B498-F248-11E8-B48F-1D18A9856A87
last_name: Hodirnau
orcid: 0000-0003-3904-947X
citation:
ama: 'Schlögl A, Elefante S, Hodirnau V-V. Running Windows-applications on a Linux
HPC cluster using WINE. In: ASHPC23 - Austrian-Slovenian HPC Meeting 2023.
EuroCC Austria; 2023:59-59.'
apa: 'Schlögl, A., Elefante, S., & Hodirnau, V.-V. (2023). Running Windows-applications
on a Linux HPC cluster using WINE. In ASHPC23 - Austrian-Slovenian HPC Meeting
2023 (pp. 59–59). Maribor, Slovenia: EuroCC Austria.'
chicago: Schlögl, Alois, Stefano Elefante, and Victor-Valentin Hodirnau. “Running
Windows-Applications on a Linux HPC Cluster Using WINE.” In ASHPC23 - Austrian-Slovenian
HPC Meeting 2023, 59–59. EuroCC Austria, 2023.
ieee: A. Schlögl, S. Elefante, and V.-V. Hodirnau, “Running Windows-applications
on a Linux HPC cluster using WINE,” in ASHPC23 - Austrian-Slovenian HPC Meeting
2023, Maribor, Slovenia, 2023, pp. 59–59.
ista: 'Schlögl A, Elefante S, Hodirnau V-V. 2023. Running Windows-applications on
a Linux HPC cluster using WINE. ASHPC23 - Austrian-Slovenian HPC Meeting 2023.
ASHPC: Austrian-Slovenian HPC Meeting, 59–59.'
mla: Schlögl, Alois, et al. “Running Windows-Applications on a Linux HPC Cluster
Using WINE.” ASHPC23 - Austrian-Slovenian HPC Meeting 2023, EuroCC Austria,
2023, pp. 59–59.
short: A. Schlögl, S. Elefante, V.-V. Hodirnau, in:, ASHPC23 - Austrian-Slovenian
HPC Meeting 2023, EuroCC Austria, 2023, pp. 59–59.
conference:
end_date: 2023-06-15
location: Maribor, Slovenia
name: 'ASHPC: Austrian-Slovenian HPC Meeting'
start_date: 2023-06-13
corr_author: '1'
date_created: 2023-06-23T11:01:23Z
date_published: 2023-07-01T00:00:00Z
date_updated: 2026-07-06T13:01:46Z
day: '01'
ddc:
- '000'
department:
- _id: ScienComp
- _id: EM-Fac
file:
- access_level: open_access
checksum: ec8e4295d54171032cdd1b01423eb4a6
content_type: application/pdf
creator: dernst
date_created: 2023-07-18T09:18:55Z
date_updated: 2023-07-18T09:18:55Z
file_id: '13249'
file_name: 2023_ASHPC_Schloegl.pdf
file_size: 316959
relation: main_file
success: 1
file_date_updated: 2023-07-18T09:18:55Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 59-59
publication: ASHPC23 - Austrian-Slovenian HPC Meeting 2023
publication_status: published
publisher: EuroCC Austria
quality_controlled: '1'
status: public
title: Running Windows-applications on a Linux HPC cluster using WINE
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_abstract
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '13268'
abstract:
- lang: eng
text: We give a simple argument to prove Nagai’s conjecture for type II degenerations
of compact hyperkähler manifolds and cohomology classes of middle degree. Under
an additional assumption, the techniques yield the conjecture in arbitrary degree.
This would complete the proof of Nagai’s conjecture in general, as it was proved
already for type I degenerations by Kollár, Laza, Saccà, and Voisin [10] and independently
by Soldatenkov [18], while it is immediate for type III degenerations. Our arguments
are close in spirit to a recent paper by Harder [8] proving similar results for
the restrictive class of good degenerations.
acknowledgement: The first author is supported by the ERC Synergy Grant HyperK. The
second author is supported by the Max Planck Institute for Mathematics and the Institute
of Science and Technology Austria. This project has received funding from the European
Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie
grant agreement No 101034413.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: D.
full_name: Huybrechts, D.
last_name: Huybrechts
- first_name: Mirko
full_name: Mauri, Mirko
id: 2cf70c34-09c1-11ed-bd8d-c34fac206130
last_name: Mauri
citation:
ama: Huybrechts D, Mauri M. On type II degenerations of hyperkähler manifolds. Mathematical
Research Letters. 2023;30(1):125-141. doi:10.4310/mrl.2023.v30.n1.a6
apa: Huybrechts, D., & Mauri, M. (2023). On type II degenerations of hyperkähler
manifolds. Mathematical Research Letters. International Press of Boston.
https://doi.org/10.4310/mrl.2023.v30.n1.a6
chicago: Huybrechts, D., and Mirko Mauri. “On Type II Degenerations of Hyperkähler
Manifolds.” Mathematical Research Letters. International Press of Boston,
2023. https://doi.org/10.4310/mrl.2023.v30.n1.a6.
ieee: D. Huybrechts and M. Mauri, “On type II degenerations of hyperkähler manifolds,”
Mathematical Research Letters, vol. 30, no. 1. International Press of Boston,
pp. 125–141, 2023.
ista: Huybrechts D, Mauri M. 2023. On type II degenerations of hyperkähler manifolds.
Mathematical Research Letters. 30(1), 125–141.
mla: Huybrechts, D., and Mirko Mauri. “On Type II Degenerations of Hyperkähler Manifolds.”
Mathematical Research Letters, vol. 30, no. 1, International Press of Boston,
2023, pp. 125–41, doi:10.4310/mrl.2023.v30.n1.a6.
short: D. Huybrechts, M. Mauri, Mathematical Research Letters 30 (2023) 125–141.
corr_author: '1'
das_tickbox: '1'
date_created: 2023-07-23T22:01:14Z
date_published: 2023-06-21T00:00:00Z
date_updated: 2026-07-06T13:37:53Z
day: '21'
department:
- _id: TaHa
doi: 10.4310/mrl.2023.v30.n1.a6
ec_funded: 1
external_id:
arxiv:
- '2108.01587'
isi:
- '001027656000006'
intvolume: ' 30'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2108.01587
month: '06'
oa: 1
oa_version: Preprint
page: 125-141
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: Mathematical Research Letters
publication_identifier:
eissn:
- 1945-001X
issn:
- 1073-2780
publication_status: published
publisher: International Press of Boston
quality_controlled: '1'
scopus_import: '1'
status: public
title: On type II degenerations of hyperkähler manifolds
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 30
year: '2023'
...
---
_id: '14609'
abstract:
- lang: eng
text: "Distributed Key Generation (DKG) is a technique to bootstrap threshold cryptosystems
without a trusted party. DKG is an essential building block to many decentralized
protocols such as randomness beacons, threshold signatures, Byzantine consensus,
and multiparty computation. While significant progress has been made recently,
existing asynchronous DKG constructions are inefficient when the reconstruction
threshold is larger than one-third of the total nodes. In this paper, we present
a simple and concretely efficient asynchronous DKG (ADKG) protocol among n = 3t
+ 1 nodes that can tolerate up to t malicious nodes and support any reconstruction
threshold ℓ ≥ t. Our protocol has an expected O(κn3) communication cost, where
κ is the security parameter, and only assumes the hardness of the Discrete Logarithm.
The\r\ncore ingredient of our ADKG protocol is an asynchronous protocol to secret
share a random polynomial of degree ℓ ≥ t, which has other applications, such
as asynchronous proactive secret sharing and asynchronous multiparty computation.
We implement our high-threshold ADKG protocol and evaluate it using a network
of up to 128 geographically distributed nodes. Our evaluation shows that our high-threshold
ADKG protocol reduces the running time by 90% and bandwidth usage by 80% over
the state-of-the-art."
acknowledgement: The authors would like to thank Amit Agarwal, Andrew Miller, and
Tom Yurek for the helpful discussions related to the paper. This work is funded
in part by a VMware early career faculty grant, a Chainlink Labs Ph.D. fellowship,
the National Science Foundation, and the Austrian Science Fund (FWF) F8512-N.
article_processing_charge: No
author:
- first_name: Sourav
full_name: Das, Sourav
last_name: Das
- first_name: Zhuolun
full_name: Xiang, Zhuolun
last_name: Xiang
- first_name: Eleftherios
full_name: Kokoris Kogias, Eleftherios
id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
last_name: Kokoris Kogias
orcid: 0000-0002-8827-3382
- first_name: Ling
full_name: Ren, Ling
last_name: Ren
citation:
ama: 'Das S, Xiang Z, Kokoris Kogias E, Ren L. Practical asynchronous high-threshold
distributed key generation and distributed polynomial sampling. In: 32nd USENIX
Security Symposium. Vol 8. Usenix Association; 2023:5359-5376.'
apa: 'Das, S., Xiang, Z., Kokoris Kogias, E., & Ren, L. (2023). Practical asynchronous
high-threshold distributed key generation and distributed polynomial sampling.
In 32nd USENIX Security Symposium (Vol. 8, pp. 5359–5376). Anaheim, CA,
United States: Usenix Association.'
chicago: Das, Sourav, Zhuolun Xiang, Eleftherios Kokoris Kogias, and Ling Ren. “Practical
Asynchronous High-Threshold Distributed Key Generation and Distributed Polynomial
Sampling.” In 32nd USENIX Security Symposium, 8:5359–76. Usenix Association,
2023.
ieee: S. Das, Z. Xiang, E. Kokoris Kogias, and L. Ren, “Practical asynchronous high-threshold
distributed key generation and distributed polynomial sampling,” in 32nd USENIX
Security Symposium, Anaheim, CA, United States, 2023, vol. 8, pp. 5359–5376.
ista: Das S, Xiang Z, Kokoris Kogias E, Ren L. 2023. Practical asynchronous high-threshold
distributed key generation and distributed polynomial sampling. 32nd USENIX Security
Symposium. USENIX Security Symposium vol. 8, 5359–5376.
mla: Das, Sourav, et al. “Practical Asynchronous High-Threshold Distributed Key
Generation and Distributed Polynomial Sampling.” 32nd USENIX Security Symposium,
vol. 8, Usenix Association, 2023, pp. 5359–76.
short: S. Das, Z. Xiang, E. Kokoris Kogias, L. Ren, in:, 32nd USENIX Security Symposium,
Usenix Association, 2023, pp. 5359–5376.
conference:
end_date: 2023-08-11
location: Anaheim, CA, United States
name: USENIX Security Symposium
start_date: 2023-08-09
corr_author: '1'
cryptoeprintid: 1
das_tickbox: '1'
date_created: 2023-11-26T23:00:55Z
date_published: 2023-08-15T00:00:00Z
date_updated: 2026-07-07T06:02:32Z
day: '15'
ddc:
- '000'
department:
- _id: ElKo
external_id:
cryptoeprintid:
- 2022/1389
file:
- access_level: open_access
checksum: 1a730765930138e23c6efd2575872641
content_type: application/pdf
creator: dernst
date_created: 2023-11-28T09:14:34Z
date_updated: 2023-11-28T09:14:34Z
file_id: '14621'
file_name: 2023_USENIX_Das.pdf
file_size: 704331
relation: main_file
success: 1
file_date_updated: 2023-11-28T09:14:34Z
has_accepted_license: '1'
intvolume: ' 8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2022/1389
month: '08'
oa: 1
oa_version: Published Version
page: 5359-5376
project:
- _id: 34a4ce89-11ca-11ed-8bc3-8cc37fb6e11f
grant_number: F8512
name: Security and Privacy by Design for Complex Systems
publication: 32nd USENIX Security Symposium
publication_identifier:
isbn:
- '9781713879497'
publication_status: published
publisher: Usenix Association
quality_controlled: '1'
scopus_import: '1'
status: public
title: Practical asynchronous high-threshold distributed key generation and distributed
polynomial sampling
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2023'
...
---
_id: '14718'
abstract:
- lang: eng
text: 'Binary decision diagrams (BDDs) are one of the fundamental data structures
in formal methods and computer science in general. However, the performance of
BDD-based algorithms greatly depends on memory latency due to the reliance on
large hash tables and thus, by extension, on the speed of random memory access.
This hinders the full utilisation of resources available on modern CPUs, since
the absolute memory latency has not improved significantly for at least a decade.
In this paper, we explore several implementation techniques that improve the performance
of BDD manipulation either through enhanced memory locality or by partially eliminating
random memory access. On a benchmark suite of 600+ BDDs derived from real-world
applications, we demonstrate runtime that is comparable or better than parallelising
the same operations on eight CPU cores. '
acknowledgement: "This work was supported by the European Union’s Horizon 2020 research
and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413
and the\r\n“VAMOS” grant ERC-2020-AdG 101020093."
article_processing_charge: No
author:
- first_name: Samuel
full_name: Pastva, Samuel
id: 07c5ea74-f61c-11ec-a664-aa7c5d957b2b
last_name: Pastva
orcid: 0000-0003-1993-0331
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
citation:
ama: 'Pastva S, Henzinger TA. Binary decision diagrams on modern hardware. In: Proceedings
of the 23rd Conference on Formal Methods in Computer-Aided Design. TU Wien
Academic Press; 2023:122-131. doi:10.34727/2023/isbn.978-3-85448-060-0_20'
apa: 'Pastva, S., & Henzinger, T. A. (2023). Binary decision diagrams on modern
hardware. In Proceedings of the 23rd Conference on Formal Methods in Computer-Aided
Design (pp. 122–131). Ames, IA, United States: TU Wien Academic Press. https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20'
chicago: Pastva, Samuel, and Thomas A Henzinger. “Binary Decision Diagrams on Modern
Hardware.” In Proceedings of the 23rd Conference on Formal Methods in Computer-Aided
Design, 122–31. TU Wien Academic Press, 2023. https://doi.org/10.34727/2023/isbn.978-3-85448-060-0_20.
ieee: S. Pastva and T. A. Henzinger, “Binary decision diagrams on modern hardware,”
in Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design,
Ames, IA, United States, 2023, pp. 122–131.
ista: 'Pastva S, Henzinger TA. 2023. Binary decision diagrams on modern hardware.
Proceedings of the 23rd Conference on Formal Methods in Computer-Aided Design.
FMCAD: Formal Methods in Computer-Aided Design, 122–131.'
mla: Pastva, Samuel, and Thomas A. Henzinger. “Binary Decision Diagrams on Modern
Hardware.” Proceedings of the 23rd Conference on Formal Methods in Computer-Aided
Design, TU Wien Academic Press, 2023, pp. 122–31, doi:10.34727/2023/isbn.978-3-85448-060-0_20.
short: S. Pastva, T.A. Henzinger, in:, Proceedings of the 23rd Conference on Formal
Methods in Computer-Aided Design, TU Wien Academic Press, 2023, pp. 122–131.
conference:
end_date: 2023-10-27
location: Ames, IA, United States
name: 'FMCAD: Formal Methods in Computer-Aided Design'
start_date: 2023-10-25
corr_author: '1'
das_tickbox: '1'
date_created: 2023-12-31T23:01:03Z
date_published: 2023-10-01T00:00:00Z
date_updated: 2026-07-07T05:58:51Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.34727/2023/isbn.978-3-85448-060-0_20
ec_funded: 1
external_id:
isi:
- '001504402400020'
file:
- access_level: open_access
checksum: 818d6e13dd508f3a04f0941081022e5d
content_type: application/pdf
creator: dernst
date_created: 2024-01-02T08:14:23Z
date_updated: 2024-01-02T08:14:23Z
file_id: '14721'
file_name: 2023_FMCAD_Pastva.pdf
file_size: 524321
relation: main_file
success: 1
file_date_updated: 2024-01-02T08:14:23Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 122-131
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: Proceedings of the 23rd Conference on Formal Methods in Computer-Aided
Design
publication_identifier:
isbn:
- '9783854480600'
publication_status: published
publisher: TU Wien Academic Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Binary decision diagrams on modern hardware
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14799'
abstract:
- lang: eng
text: "A round-robin study has been carried out to estimate the impact of the human
element in small-angle scattering data analysis. Four corrected datasets were
provided to participants ready for analysis. All datasets were measured on samples
containing spherical scatterers, with two datasets in dilute dispersions and two
from powders. Most of the 46 participants correctly identified the number of populations
in the dilute dispersions, with half of the population\r\nmean entries within
1.5% and half of the population width entries within 40%. Due to the added complexity
of the structure factor, far fewer people submitted answers on the powder datasets.
For those that did, half of the entries for the means and widths were within 44
and 86%, respectively. This round-robin experiment highlights several causes for
the discrepancies, for which solutions are proposed."
acknowledgement: "KT acknowledges the NIST–NRC postdoctoral fellowship program for
support. This work was partially funded through the European Metrology Programme
for Innovation and Research (EMPIR) project No. 17NRM04.\r\nCertain commercial equipment,
instruments, materials or software are identified in this article in order to specify
the experimental procedure adequately. Such identification is not intended to imply
recommendation or endorsement by NIST, nor is it intended to imply that the materials
or equipment identified are necessarily the best available for the purpose. Open
access funding enabled and organized by Projekt DEAL."
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Brian R.
full_name: Pauw, Brian R.
last_name: Pauw
- first_name: Glen J.
full_name: Smales, Glen J.
last_name: Smales
- first_name: Andy S.
full_name: Anker, Andy S.
last_name: Anker
- first_name: Venkatasamy
full_name: Annadurai, Venkatasamy
last_name: Annadurai
- first_name: Daniel
full_name: Balazs, Daniel
id: 302BADF6-85FC-11EA-9E3B-B9493DDC885E
last_name: Balazs
orcid: 0000-0001-7597-043X
- first_name: Ralf
full_name: Bienert, Ralf
last_name: Bienert
- first_name: Wim G.
full_name: Bouwman, Wim G.
last_name: Bouwman
- first_name: Ingo
full_name: Breßler, Ingo
last_name: Breßler
- first_name: Joachim
full_name: Breternitz, Joachim
last_name: Breternitz
- first_name: Erik S.
full_name: Brok, Erik S.
last_name: Brok
- first_name: Gary
full_name: Bryant, Gary
last_name: Bryant
- first_name: Andrew J.
full_name: Clulow, Andrew J.
last_name: Clulow
- first_name: Erin R.
full_name: Crater, Erin R.
last_name: Crater
- first_name: Frédéric
full_name: De Geuser, Frédéric
last_name: De Geuser
- first_name: Alessandra Del
full_name: Giudice, Alessandra Del
last_name: Giudice
- first_name: Jérôme
full_name: Deumer, Jérôme
last_name: Deumer
- first_name: Sabrina
full_name: Disch, Sabrina
last_name: Disch
- first_name: Shankar
full_name: Dutt, Shankar
last_name: Dutt
- first_name: Kilian
full_name: Frank, Kilian
last_name: Frank
- first_name: Emiliano
full_name: Fratini, Emiliano
last_name: Fratini
- first_name: Paulo R.A.F.
full_name: Garcia, Paulo R.A.F.
last_name: Garcia
- first_name: Elliot P.
full_name: Gilbert, Elliot P.
last_name: Gilbert
- first_name: Marc B.
full_name: Hahn, Marc B.
last_name: Hahn
- first_name: James
full_name: Hallett, James
last_name: Hallett
- first_name: Max
full_name: Hohenschutz, Max
last_name: Hohenschutz
- first_name: Martin
full_name: Hollamby, Martin
last_name: Hollamby
- first_name: Steven
full_name: Huband, Steven
last_name: Huband
- first_name: Jan
full_name: Ilavsky, Jan
last_name: Ilavsky
- first_name: Johanna K.
full_name: Jochum, Johanna K.
last_name: Jochum
- first_name: Mikkel
full_name: Juelsholt, Mikkel
last_name: Juelsholt
- first_name: Bradley W.
full_name: Mansel, Bradley W.
last_name: Mansel
- first_name: Paavo
full_name: Penttilä, Paavo
last_name: Penttilä
- first_name: Rebecca K.
full_name: Pittkowski, Rebecca K.
last_name: Pittkowski
- first_name: Giuseppe
full_name: Portale, Giuseppe
last_name: Portale
- first_name: Lilo D.
full_name: Pozzo, Lilo D.
last_name: Pozzo
- first_name: Leonhard
full_name: Rochels, Leonhard
last_name: Rochels
- first_name: Julian M.
full_name: Rosalie, Julian M.
last_name: Rosalie
- first_name: Patrick E.J.
full_name: Saloga, Patrick E.J.
last_name: Saloga
- first_name: Susanne
full_name: Seibt, Susanne
last_name: Seibt
- first_name: Andrew J.
full_name: Smith, Andrew J.
last_name: Smith
- first_name: Gregory N.
full_name: Smith, Gregory N.
last_name: Smith
- first_name: Glenn A.
full_name: Spiering, Glenn A.
last_name: Spiering
- first_name: Tomasz M.
full_name: Stawski, Tomasz M.
last_name: Stawski
- first_name: Olivier
full_name: Taché, Olivier
last_name: Taché
- first_name: Andreas F.
full_name: Thünemann, Andreas F.
last_name: Thünemann
- first_name: Kristof
full_name: Toth, Kristof
last_name: Toth
- first_name: Andrew E.
full_name: Whitten, Andrew E.
last_name: Whitten
- first_name: Joachim
full_name: Wuttke, Joachim
last_name: Wuttke
citation:
ama: 'Pauw BR, Smales GJ, Anker AS, et al. The human factor: Results of a small-angle
scattering data analysis round robin. Journal of Applied Crystallography.
2023;56(6):1618-1629. doi:10.1107/S1600576723008324'
apa: 'Pauw, B. R., Smales, G. J., Anker, A. S., Annadurai, V., Balazs, D., Bienert,
R., … Wuttke, J. (2023). The human factor: Results of a small-angle scattering
data analysis round robin. Journal of Applied Crystallography. International
Union of Crystallography. https://doi.org/10.1107/S1600576723008324'
chicago: 'Pauw, Brian R., Glen J. Smales, Andy S. Anker, Venkatasamy Annadurai,
Daniel Balazs, Ralf Bienert, Wim G. Bouwman, et al. “The Human Factor: Results
of a Small-Angle Scattering Data Analysis Round Robin.” Journal of Applied
Crystallography. International Union of Crystallography, 2023. https://doi.org/10.1107/S1600576723008324.'
ieee: 'B. R. Pauw et al., “The human factor: Results of a small-angle scattering
data analysis round robin,” Journal of Applied Crystallography, vol. 56,
no. 6. International Union of Crystallography, pp. 1618–1629, 2023.'
ista: 'Pauw BR, Smales GJ, Anker AS, Annadurai V, Balazs D, Bienert R, Bouwman WG,
Breßler I, Breternitz J, Brok ES, Bryant G, Clulow AJ, Crater ER, De Geuser F,
Giudice AD, Deumer J, Disch S, Dutt S, Frank K, Fratini E, Garcia PRAF, Gilbert
EP, Hahn MB, Hallett J, Hohenschutz M, Hollamby M, Huband S, Ilavsky J, Jochum
JK, Juelsholt M, Mansel BW, Penttilä P, Pittkowski RK, Portale G, Pozzo LD, Rochels
L, Rosalie JM, Saloga PEJ, Seibt S, Smith AJ, Smith GN, Spiering GA, Stawski TM,
Taché O, Thünemann AF, Toth K, Whitten AE, Wuttke J. 2023. The human factor: Results
of a small-angle scattering data analysis round robin. Journal of Applied Crystallography.
56(6), 1618–1629.'
mla: 'Pauw, Brian R., et al. “The Human Factor: Results of a Small-Angle Scattering
Data Analysis Round Robin.” Journal of Applied Crystallography, vol. 56,
no. 6, International Union of Crystallography, 2023, pp. 1618–29, doi:10.1107/S1600576723008324.'
short: B.R. Pauw, G.J. Smales, A.S. Anker, V. Annadurai, D. Balazs, R. Bienert,
W.G. Bouwman, I. Breßler, J. Breternitz, E.S. Brok, G. Bryant, A.J. Clulow, E.R.
Crater, F. De Geuser, A.D. Giudice, J. Deumer, S. Disch, S. Dutt, K. Frank, E.
Fratini, P.R.A.F. Garcia, E.P. Gilbert, M.B. Hahn, J. Hallett, M. Hohenschutz,
M. Hollamby, S. Huband, J. Ilavsky, J.K. Jochum, M. Juelsholt, B.W. Mansel, P.
Penttilä, R.K. Pittkowski, G. Portale, L.D. Pozzo, L. Rochels, J.M. Rosalie, P.E.J.
Saloga, S. Seibt, A.J. Smith, G.N. Smith, G.A. Spiering, T.M. Stawski, O. Taché,
A.F. Thünemann, K. Toth, A.E. Whitten, J. Wuttke, Journal of Applied Crystallography
56 (2023) 1618–1629.
das_tickbox: '1'
date_created: 2024-01-14T23:00:57Z
date_published: 2023-12-01T00:00:00Z
date_updated: 2026-07-07T06:18:55Z
day: '01'
ddc:
- '540'
department:
- _id: LifeSc
doi: 10.1107/S1600576723008324
external_id:
arxiv:
- '2303.03772'
isi:
- '001120776200002'
file:
- access_level: open_access
checksum: dab30d4556360f2cecf99f4b7efb0ee9
content_type: application/pdf
creator: dernst
date_created: 2024-01-17T07:47:35Z
date_updated: 2024-01-17T07:47:35Z
file_id: '14822'
file_name: 2023_JourApplCrystallography_Pauw.pdf
file_size: 2165864
relation: main_file
success: 1
file_date_updated: 2024-01-17T07:47:35Z
has_accepted_license: '1'
intvolume: ' 56'
isi: 1
issue: '6'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 1618-1629
publication: Journal of Applied Crystallography
publication_identifier:
eissn:
- 1600-5767
issn:
- 0021-8898
publication_status: published
publisher: International Union of Crystallography
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The human factor: Results of a small-angle scattering data analysis round
robin'
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: 56
year: '2023'
...
---
_id: '14243'
abstract:
- lang: eng
text: 'Two-player zero-sum "graph games" are central in logic, verification, and
multi-agent systems. The game proceeds by placing a token on a vertex of a graph,
and allowing the players to move it to produce an infinite path, which determines
the winner or payoff of the game. Traditionally, the players alternate turns in
moving the token. In "bidding games", however, the players have budgets and in
each turn, an auction (bidding) determines which player moves the token. So far,
bidding games have only been studied as full-information games. In this work we
initiate the study of partial-information bidding games: we study bidding games
in which a player''s initial budget is drawn from a known probability distribution.
We show that while for some bidding mechanisms and objectives, it is straightforward
to adapt the results from the full-information setting to the partial-information
setting, for others, the analysis is significantly more challenging, requires
new techniques, and gives rise to interesting results. Specifically, we study
games with "mean-payoff" objectives in combination with "poorman" bidding. We
construct optimal strategies for a partially-informed player who plays against
a fully-informed adversary. We show that, somewhat surprisingly, the "value" under
pure strategies does not necessarily exist in such games.'
acknowledgement: This research was supported in part by ISF grant no.1679/21, by the
ERC CoG 863818 (ForM-SMArt), and the European Union’s Horizon 2020 research and
innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.
article_processing_charge: No
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: Ismael R
full_name: Jecker, Ismael R
id: 85D7C63E-7D5D-11E9-9C0F-98C4E5697425
last_name: Jecker
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
citation:
ama: 'Avni G, Jecker IR, Zikelic D. Bidding graph games with partially-observable
budgets. In: Proceedings of the 37th AAAI Conference on Artificial Intelligence.
Vol 37. AAAI Press; 2023:5464-5471. doi:10.1609/aaai.v37i5.25679'
apa: 'Avni, G., Jecker, I. R., & Zikelic, D. (2023). Bidding graph games with
partially-observable budgets. In Proceedings of the 37th AAAI Conference on
Artificial Intelligence (Vol. 37, pp. 5464–5471). Washington, DC, United States:
AAAI Press. https://doi.org/10.1609/aaai.v37i5.25679'
chicago: Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Bidding Graph Games with
Partially-Observable Budgets.” In Proceedings of the 37th AAAI Conference on
Artificial Intelligence, 37:5464–71. AAAI Press, 2023. https://doi.org/10.1609/aaai.v37i5.25679.
ieee: G. Avni, I. R. Jecker, and D. Zikelic, “Bidding graph games with partially-observable
budgets,” in Proceedings of the 37th AAAI Conference on Artificial Intelligence,
Washington, DC, United States, 2023, vol. 37, no. 5, pp. 5464–5471.
ista: 'Avni G, Jecker IR, Zikelic D. 2023. Bidding graph games with partially-observable
budgets. Proceedings of the 37th AAAI Conference on Artificial Intelligence. AAAI:
Conference on Artificial Intelligence vol. 37, 5464–5471.'
mla: Avni, Guy, et al. “Bidding Graph Games with Partially-Observable Budgets.”
Proceedings of the 37th AAAI Conference on Artificial Intelligence, vol.
37, no. 5, AAAI Press, 2023, pp. 5464–71, doi:10.1609/aaai.v37i5.25679.
short: G. Avni, I.R. Jecker, D. Zikelic, in:, Proceedings of the 37th AAAI Conference
on Artificial Intelligence, AAAI Press, 2023, pp. 5464–5471.
conference:
end_date: 2023-02-14
location: Washington, DC, United States
name: 'AAAI: Conference on Artificial Intelligence'
start_date: 2023-02-07
das_tickbox: '1'
date_created: 2023-08-27T22:01:18Z
date_published: 2023-06-27T00:00:00Z
date_updated: 2026-07-07T06:24:15Z
day: '27'
ddc:
- '000'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1609/aaai.v37i5.25679
ec_funded: 1
external_id:
arxiv:
- '2211.13626'
intvolume: ' 37'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1609/aaai.v37i5.25679
month: '06'
oa: 1
oa_version: Published Version
page: 5464-5471
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: Proceedings of the 37th AAAI Conference on Artificial Intelligence
publication_identifier:
isbn:
- '9781577358800'
publication_status: published
publisher: AAAI Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Bidding graph games with partially-observable budgets
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2023'
...
---
_id: '15364'
abstract:
- lang: eng
text: "Clustering is a fundamental problem in unsupervised machine learning with
many applications in data analysis. Popular clustering algorithms such as Lloyd's
algorithm and k-means++ can make Ω(ndk) time when clustering n points in a d-dimensional
space (represented by an n×d matrix X) into k clusters. On massive datasets with
moderate to large k, the multiplicative \r\nk factor can become very expensive.
We introduce a simple randomized clustering algorithm that provably runs in expected
time O(nnz(X)+nlogn) for arbitrary k. Here nnz(X) is the total number of non-zero
entries in the input dataset X, which is upper bounded by nd and can be significantly
smaller for sparse datasets. We prove that our algorithm achieves approximation
ratio ˜O(k4) on any input dataset for the k-means objective, and our experiments
show that the quality of the clusters found by our algorithm is usually much better
than this worst-case bound. We use our algorithm for k-means clustering and for
coreset construction; our experiments show that it gives a new tradeoff between
running time and cluster quality compared to previous state-of-the-art methods
for these tasks. Our theoretical analysis is based on novel results of independent
interest. We show that the approximation ratio achieved after a random one-dimensional
projection can be lifted to the original points and that k-means++ seeding can
be implemented in expected time O(nlogn) in one dimension."
acknowledgement: "Moses Charikar was supported by a Simons Investigator award. Lunjia
Hu was supported by Moses Charikar’s and Omer Reingold’s Simons Investigators awards,
Omer Reingold’s NSF Award IIS-1908774, and the Simons Foundation Collaboration on
the Theory of Algorithmic Fairness. Part of this work was done while Erik Waingarten
was a postdoc at Stanford University, supported by an NSF postdoctoral fellowship
and by Moses Charikar’s Simons\r\nInvestigator Award. This project has received
funding from the European Research Council (ERC) under the European Union’s Horizon
2020 research and innovation programme\r\n(Grant agreement No. 101019564 “The Design
of Modern Fully Dynamic Data\r\nStructures (MoDynStruct)” and the Austrian Science
Fund (FWF) project Z 422-N, project “Static and Dynamic Hierarchical Graph Decompositions”,
I 5982-N, and project “Fast Algorithms for a Reactive Network Layer (ReactNet)”,
P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024."
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Moses
full_name: Charikar, Moses
last_name: Charikar
- first_name: Lunjia
full_name: Hu, Lunjia
last_name: Hu
- 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: Maximilian
full_name: Vötsch, Maximilian
last_name: Vötsch
- first_name: Erik
full_name: Waingarten, Erik
last_name: Waingarten
citation:
ama: 'Charikar M, Hu L, Henzinger M, Vötsch M, Waingarten E. Simple, scalable and
effective clustering via one-dimensional projections. In: 37th Conference on
Neural Information Processing Systems. Vol 36. Neural Information Processing
Systems Foundation; 2023.'
apa: 'Charikar, M., Hu, L., Henzinger, M., Vötsch, M., & Waingarten, E. (2023).
Simple, scalable and effective clustering via one-dimensional projections. In
37th Conference on Neural Information Processing Systems (Vol. 36). New
Orleans, LA, United States: Neural Information Processing Systems Foundation.'
chicago: Charikar, Moses, Lunjia Hu, Monika Henzinger, Maximilian Vötsch, and Erik
Waingarten. “Simple, Scalable and Effective Clustering via One-Dimensional Projections.”
In 37th Conference on Neural Information Processing Systems, Vol. 36. Neural
Information Processing Systems Foundation, 2023.
ieee: M. Charikar, L. Hu, M. Henzinger, M. Vötsch, and E. Waingarten, “Simple, scalable
and effective clustering via one-dimensional projections,” in 37th Conference
on Neural Information Processing Systems, New Orleans, LA, United States,
2023, vol. 36.
ista: 'Charikar M, Hu L, Henzinger M, Vötsch M, Waingarten E. 2023. Simple, scalable
and effective clustering via one-dimensional projections. 37th Conference on Neural
Information Processing Systems. NeurIPS: Neural Information Processing Systems,
Advances in Neural Information Processing Systems, vol. 36.'
mla: Charikar, Moses, et al. “Simple, Scalable and Effective Clustering via One-Dimensional
Projections.” 37th Conference on Neural Information Processing Systems,
vol. 36, Neural Information Processing Systems Foundation, 2023.
short: M. Charikar, L. Hu, M. Henzinger, M. Vötsch, E. Waingarten, in:, 37th Conference
on Neural Information Processing Systems, Neural Information Processing Systems
Foundation, 2023.
conference:
end_date: 2023-12-16
location: New Orleans, LA, United States
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2023-12-10
das_tickbox: '1'
date_created: 2024-05-05T22:01:05Z
date_published: 2023-12-15T00:00:00Z
date_updated: 2026-07-07T06:37:54Z
day: '15'
ddc:
- '000'
department:
- _id: MoHe
ec_funded: 1
external_id:
arxiv:
- '2310.16752'
file:
- access_level: open_access
checksum: d169a147a2adf55878e0a99e36a9d468
content_type: application/pdf
creator: dernst
date_created: 2024-05-22T07:34:00Z
date_updated: 2024-05-22T07:34:00Z
file_id: '15416'
file_name: 2023_Neurips_Charikar.pdf
file_size: 1445159
relation: main_file
success: 1
file_date_updated: 2024-05-22T07:34:00Z
has_accepted_license: '1'
intvolume: ' 36'
language:
- iso: eng
month: '12'
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: 37th Conference on Neural Information Processing Systems
publication_identifier:
issn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: Simple, scalable and effective clustering via one-dimensional projections
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: 36
year: '2023'
...
---
_id: '15363'
abstract:
- lang: eng
text: Knowledge distillation is a popular approach for enhancing the performance
of "student" models, with lower representational capacity, by taking advantage
of more powerful "teacher" models. Despite its apparent simplicity, the underlying
mechanics behind knowledge distillation (KD) are not yet fully understood. In
this work, we shed new light on the inner workings of this method, by examining
it from an optimization perspective. Specifically, we show that, in the context
of linear and deep linear models, KD can be interpreted as a novel type of stochastic
variance reduction mechanism. We provide a detailed convergence analysis of the
resulting dynamics, which hold under standard assumptions for both strongly-convex
and non-convex losses, showing that KD acts as a form of \emph{partial variance
reduction}, which can reduce the stochastic gradient noise, but may not eliminate
it completely, depending on the properties of the teacher'' model. Our analysis
puts further emphasis on the need for careful parametrization of KD, in particular
w.r.t. the weighting of the distillation loss, and is validated empirically on
both linear models and deep neural networks.
acknowledgement: "MS has received funding from the European Union’s Horizon 2020 research
and innovation programme\r\nunder the Marie Skłodowska-Curie grant agreement No
101034413."
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Mher
full_name: Safaryan, Mher
id: dd546b39-0804-11ed-9c55-ef075c39778d
last_name: Safaryan
- first_name: Elena-Alexandra
full_name: Peste, Elena-Alexandra
id: 32D78294-F248-11E8-B48F-1D18A9856A87
last_name: Peste
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Safaryan M, Krumes A, Alistarh D-A. Knowledge distillation performs partial
variance reduction. In: 36th Conference on Neural Information Processing Systems.
Vol 36. Neural Information Processing Systems Foundation; 2023.'
apa: 'Safaryan, M., Krumes, A., & Alistarh, D.-A. (2023). Knowledge distillation
performs partial variance reduction. In 36th Conference on Neural Information
Processing Systems (Vol. 36). New Orleans, LA, United States: Neural Information
Processing Systems Foundation.'
chicago: Safaryan, Mher, Alexandra Krumes, and Dan-Adrian Alistarh. “Knowledge Distillation
Performs Partial Variance Reduction.” In 36th Conference on Neural Information
Processing Systems, Vol. 36. Neural Information Processing Systems Foundation,
2023.
ieee: M. Safaryan, A. Krumes, and D.-A. Alistarh, “Knowledge distillation performs
partial variance reduction,” in 36th Conference on Neural Information Processing
Systems, New Orleans, LA, United States, 2023, vol. 36.
ista: 'Safaryan M, Krumes A, Alistarh D-A. 2023. Knowledge distillation performs
partial variance reduction. 36th Conference on Neural Information Processing Systems.
NeurIPS: Neural Information Processing Systems, Advances in Neural Information
Processing Systems, vol. 36.'
mla: Safaryan, Mher, et al. “Knowledge Distillation Performs Partial Variance Reduction.”
36th Conference on Neural Information Processing Systems, vol. 36, Neural
Information Processing Systems Foundation, 2023.
short: M. Safaryan, A. Krumes, D.-A. Alistarh, in:, 36th Conference on Neural Information
Processing Systems, Neural Information Processing Systems Foundation, 2023.
conference:
end_date: 2023-12-16
location: New Orleans, LA, United States
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2023-12-10
corr_author: '1'
das_tickbox: '1'
date_created: 2024-05-05T22:01:04Z
date_published: 2023-12-15T00:00:00Z
date_updated: 2026-07-07T06:37:28Z
day: '15'
ddc:
- '000'
department:
- _id: DaAl
ec_funded: 1
external_id:
arxiv:
- '2305.17581'
file:
- access_level: open_access
checksum: 288c5148a85abf24ad5e22a6b1183655
content_type: application/pdf
creator: dernst
date_created: 2024-05-22T08:08:08Z
date_updated: 2024-05-22T08:08:08Z
file_id: '15417'
file_name: 2023_Neurips_Safaryan.pdf
file_size: 672571
relation: main_file
success: 1
file_date_updated: 2024-05-22T08:08:08Z
has_accepted_license: '1'
intvolume: ' 36'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: 36th Conference on Neural Information Processing Systems
publication_identifier:
issn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: Knowledge distillation performs partial variance reduction
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: 36
year: '2023'
...
---
_id: '15023'
abstract:
- lang: eng
text: Reinforcement learning has shown promising results in learning neural network
policies for complicated control tasks. However, the lack of formal guarantees
about the behavior of such policies remains an impediment to their deployment.
We propose a novel method for learning a composition of neural network policies
in stochastic environments, along with a formal certificate which guarantees that
a specification over the policy's behavior is satisfied with the desired probability.
Unlike prior work on verifiable RL, our approach leverages the compositional nature
of logical specifications provided in SpectRL, to learn over graphs of probabilistic
reach-avoid specifications. The formal guarantees are provided by learning neural
network policies together with reach-avoid supermartingales (RASM) for the graph’s
sub-tasks and then composing them into a global policy. We also derive a tighter
lower bound compared to previous work on the probability of reach-avoidance implied
by a RASM, which is required to find a compositional policy with an acceptable
probabilistic threshold for complex tasks with multiple edge policies. We implement
a prototype of our approach and evaluate it on a Stochastic Nine Rooms environment.
acknowledgement: "This work was supported in part by the ERC-2020-AdG 101020093 (VAMOS)
and the ERC-2020-\r\nCoG 863818 (FoRM-SMArt)."
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Abhinav
full_name: Verma, Abhinav
id: a235593c-d7fa-11eb-a0c5-b22ca3c66ee6
last_name: Verma
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
citation:
ama: 'Zikelic D, Lechner M, Verma A, Chatterjee K, Henzinger TA. Compositional policy
learning in stochastic control systems with formal guarantees. In: 37th Conference
on Neural Information Processing Systems. Neural Information Processing Systems
Foundation; 2023.'
apa: 'Zikelic, D., Lechner, M., Verma, A., Chatterjee, K., & Henzinger, T. A.
(2023). Compositional policy learning in stochastic control systems with formal
guarantees. In 37th Conference on Neural Information Processing Systems.
New Orleans, LO, United States: Neural Information Processing Systems Foundation.'
chicago: Zikelic, Dorde, Mathias Lechner, Abhinav Verma, Krishnendu Chatterjee,
and Thomas A Henzinger. “Compositional Policy Learning in Stochastic Control Systems
with Formal Guarantees.” In 37th Conference on Neural Information Processing
Systems. Neural Information Processing Systems Foundation, 2023.
ieee: D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, and T. A. Henzinger, “Compositional
policy learning in stochastic control systems with formal guarantees,” in 37th
Conference on Neural Information Processing Systems, New Orleans, LO, United
States, 2023.
ista: 'Zikelic D, Lechner M, Verma A, Chatterjee K, Henzinger TA. 2023. Compositional
policy learning in stochastic control systems with formal guarantees. 37th Conference
on Neural Information Processing Systems. NeurIPS: Neural Information Processing
Systems, Advances in Neural Information Processing Systems, .'
mla: Zikelic, Dorde, et al. “Compositional Policy Learning in Stochastic Control
Systems with Formal Guarantees.” 37th Conference on Neural Information Processing
Systems, Neural Information Processing Systems Foundation, 2023.
short: D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, T.A. Henzinger, in:, 37th
Conference on Neural Information Processing Systems, Neural Information Processing
Systems Foundation, 2023.
conference:
end_date: 2023-12-16
location: New Orleans, LO, United States
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2023-12-10
corr_author: '1'
das_tickbox: '1'
date_created: 2024-02-25T09:23:24Z
date_published: 2023-12-15T00:00:00Z
date_updated: 2026-07-07T06:36:54Z
day: '15'
ddc:
- '000'
department:
- _id: ToHe
- _id: KrCh
ec_funded: 1
external_id:
arxiv:
- '2312.01456'
file:
- access_level: open_access
checksum: 739c6d72506b778302d4e708723bf12c
content_type: application/pdf
creator: dernst
date_created: 2024-07-22T11:45:17Z
date_updated: 2024-07-22T11:45:17Z
file_id: '17309'
file_name: 2023_NeurIPS_Zikelic.pdf
file_size: 562008
relation: main_file
success: 1
file_date_updated: 2024-07-22T11:45:17Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: 37th Conference on Neural Information Processing Systems
publication_identifier:
eissn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
status: public
title: Compositional policy learning in stochastic control systems with formal guarantees
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14921'
abstract:
- lang: eng
text: Neural collapse (NC) refers to the surprising structure of the last layer
of deep neural networks in the terminal phase of gradient descent training. Recently,
an increasing amount of experimental evidence has pointed to the propagation of
NC to earlier layers of neural networks. However, while the NC in the last layer
is well studied theoretically, much less is known about its multi-layered counterpart
- deep neural collapse (DNC). In particular, existing work focuses either on linear
layers or only on the last two layers at the price of an extra assumption. Our
paper fills this gap by generalizing the established analytical framework for
NC - the unconstrained features model - to multiple non-linear layers. Our key
technical contribution is to show that, in a deep unconstrained features model,
the unique global optimum for binary classification exhibits all the properties
typical of DNC. This explains the existing experimental evidence of DNC. We also
empirically show that (i) by optimizing deep unconstrained features models via
gradient descent, the resulting solution agrees well with our theory, and (ii)
trained networks recover the unconstrained features suitable for the occurrence
of DNC, thus supporting the validity of this modeling principle.
acknowledgement: M. M. is partially supported by the 2019 Lopez-Loreta Prize. The
authors would like to thank Eugenia Iofinova, Bernd Prach and Simone Bombari for
valuable feedback on the manuscript.
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Peter
full_name: Súkeník, Peter
id: d64d6a8d-eb8e-11eb-b029-96fd216dec3c
last_name: Súkeník
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Súkeník P, Mondelli M, Lampert C. Deep neural collapse is provably optimal
for the deep unconstrained features model. In: 37th Conference on Neural Information
Processing Systems. Neural Information Processing Systems Foundation; 2023.'
apa: 'Súkeník, P., Mondelli, M., & Lampert, C. (2023). Deep neural collapse
is provably optimal for the deep unconstrained features model. In 37th Conference
on Neural Information Processing Systems. New Orleans, LA, United States:
Neural Information Processing Systems Foundation.'
chicago: Súkeník, Peter, Marco Mondelli, and Christoph Lampert. “Deep Neural Collapse
Is Provably Optimal for the Deep Unconstrained Features Model.” In 37th Conference
on Neural Information Processing Systems. Neural Information Processing Systems
Foundation, 2023.
ieee: P. Súkeník, M. Mondelli, and C. Lampert, “Deep neural collapse is provably
optimal for the deep unconstrained features model,” in 37th Conference on Neural
Information Processing Systems, New Orleans, LA, United States, 2023.
ista: 'Súkeník P, Mondelli M, Lampert C. 2023. Deep neural collapse is provably
optimal for the deep unconstrained features model. 37th Conference on Neural Information
Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in
Neural Information Processing Systems, .'
mla: Súkeník, Peter, et al. “Deep Neural Collapse Is Provably Optimal for the Deep
Unconstrained Features Model.” 37th Conference on Neural Information Processing
Systems, Neural Information Processing Systems Foundation, 2023.
short: P. Súkeník, M. Mondelli, C. Lampert, in:, 37th Conference on Neural Information
Processing Systems, Neural Information Processing Systems Foundation, 2023.
conference:
end_date: 2023-12-16
location: New Orleans, LA, United States
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2023-12-10
corr_author: '1'
das_tickbox: '1'
date_created: 2024-02-02T11:17:41Z
date_published: 2023-12-15T00:00:00Z
date_updated: 2026-07-07T06:35:57Z
day: '15'
department:
- _id: MaMo
- _id: ChLa
external_id:
arxiv:
- '2305.13165'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.2305.13165'
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: 37th Conference on Neural Information Processing Systems
publication_identifier:
eissn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
status: public
title: Deep neural collapse is provably optimal for the deep unconstrained features
model
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14260'
abstract:
- lang: eng
text: "This paper presents Lincheck, a new practical and user-friendly framework
for testing concurrent algorithms on the Java Virtual Machine (JVM). Lincheck
provides a simple and declarative way to write concurrent tests: instead of describing
how to perform the test, users specify what to test by declaring all the operations
to examine; the framework automatically handles the rest. As a result, tests written
with Lincheck are concise and easy to understand. The framework automatically
generates a set of concurrent scenarios, examines them using stress-testing or
bounded model checking, and verifies that the results of each invocation are correct.
Notably, if an error is detected via model checking, Lincheck provides an easy-to-follow
trace to reproduce it, significantly simplifying the bug investigation.\r\n\r\nTo
the best of our knowledge, Lincheck is the first production-ready tool on the
JVM that offers such a simple way of writing concurrent tests, without requiring
special skills or expertise. We successfully integrated Lincheck in the development
process of several large projects, such as Kotlin Coroutines, and identified new
bugs in popular concurrency libraries, such as a race in Java’s standard ConcurrentLinkedDeque
and a liveliness bug in Java’s AbstractQueuedSynchronizer framework, which is
used in most of the synchronization primitives. We believe that Lincheck can significantly
improve the quality and productivity of concurrent algorithms research and development
and become the state-of-the-art tool for checking their correctness."
alternative_title:
- LNCS
article_processing_charge: Yes (in subscription journal)
author:
- first_name: Nikita
full_name: Koval, Nikita
id: 2F4DB10C-F248-11E8-B48F-1D18A9856A87
last_name: Koval
- first_name: Alexander
full_name: Fedorov, Alexander
id: 2e711909-896a-11ed-bdf8-eb0f5a2984c6
last_name: Fedorov
- first_name: Maria
full_name: Sokolova, Maria
last_name: Sokolova
- first_name: Dmitry
full_name: Tsitelov, Dmitry
last_name: Tsitelov
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. Lincheck: A practical
framework for testing concurrent data structures on JVM. In: 35th International
Conference on Computer Aided Verification. Vol 13964. Springer Nature; 2023:156-169.
doi:10.1007/978-3-031-37706-8_8'
apa: 'Koval, N., Fedorov, A., Sokolova, M., Tsitelov, D., & Alistarh, D.-A.
(2023). Lincheck: A practical framework for testing concurrent data structures
on JVM. In 35th International Conference on Computer Aided Verification
(Vol. 13964, pp. 156–169). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-37706-8_8'
chicago: 'Koval, Nikita, Alexander Fedorov, Maria Sokolova, Dmitry Tsitelov, and
Dan-Adrian Alistarh. “Lincheck: A Practical Framework for Testing Concurrent Data
Structures on JVM.” In 35th International Conference on Computer Aided Verification,
13964:156–69. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-37706-8_8.'
ieee: 'N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, and D.-A. Alistarh, “Lincheck:
A practical framework for testing concurrent data structures on JVM,” in 35th
International Conference on Computer Aided Verification, Paris, France, 2023,
vol. 13964, pp. 156–169.'
ista: 'Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. 2023. Lincheck:
A practical framework for testing concurrent data structures on JVM. 35th International
Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS,
vol. 13964, 156–169.'
mla: 'Koval, Nikita, et al. “Lincheck: A Practical Framework for Testing Concurrent
Data Structures on JVM.” 35th International Conference on Computer Aided Verification,
vol. 13964, Springer Nature, 2023, pp. 156–69, doi:10.1007/978-3-031-37706-8_8.'
short: N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, D.-A. Alistarh, in:, 35th
International Conference on Computer Aided Verification, Springer Nature, 2023,
pp. 156–169.
conference:
end_date: 2023-07-22
location: Paris, France
name: 'CAV: Computer Aided Verification'
start_date: 2023-07-17
das_tickbox: '1'
date_created: 2023-09-03T22:01:16Z
date_published: 2023-07-17T00:00:00Z
date_updated: 2026-07-07T13:39:36Z
day: '17'
ddc:
- '000'
department:
- _id: DaAl
- _id: GradSch
doi: 10.1007/978-3-031-37706-8_8
external_id:
isi:
- '001310786500008'
file:
- access_level: open_access
checksum: c346016393123a0a2338ad4d976f61bc
content_type: application/pdf
creator: dernst
date_created: 2023-09-06T08:16:25Z
date_updated: 2023-09-06T08:16:25Z
file_id: '14275'
file_name: 2023_LNCS_Koval.pdf
file_size: 421408
relation: main_file
success: 1
file_date_updated: 2023-09-06T08:16:25Z
has_accepted_license: '1'
intvolume: ' 13964'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 156-169
publication: 35th International Conference on Computer Aided Verification
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031377051'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '14995'
relation: research_data
status: public
scopus_import: '1'
status: public
title: 'Lincheck: A practical framework for testing concurrent data structures on JVM'
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: 13964
year: '2023'
...
---
_id: '14259'
abstract:
- lang: eng
text: "We provide a learning-based technique for guessing a winning strategy in
a parity game originating from an LTL synthesis problem. A cheaply obtained guess
can be useful in several applications. Not only can the guessed strategy be applied
as best-effort in cases where the game’s huge size prohibits rigorous approaches,
but it can also increase the scalability of rigorous LTL synthesis in several
ways. Firstly, checking whether a guessed strategy is winning is easier than constructing
one. Secondly, even if the guess is wrong in some places, it can be fixed by strategy
iteration faster than constructing one from scratch. Thirdly, the guess can be
used in on-the-fly approaches to prioritize exploration in the most fruitful directions.\r\nIn
contrast to previous works, we (i) reflect the highly structured logical information
in game’s states, the so-called semantic labelling, coming from the recent LTL-to-automata
translations, and (ii) learn to reflect it properly by learning from previously
solved games, bringing the solving process closer to human-like reasoning."
acknowledgement: This research was funded in part by the German Research Foundation
(DFG) project 427755713 Group-By Objectives in Probabilistic Verification (GOPro).
alternative_title:
- LNCS
article_processing_charge: Yes (in subscription journal)
author:
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Tobias
full_name: Meggendorfer, Tobias
id: b21b0c15-30a2-11eb-80dc-f13ca25802e1
last_name: Meggendorfer
orcid: 0000-0002-1712-2165
- first_name: Maximilian
full_name: Prokop, Maximilian
last_name: Prokop
- first_name: Sabine
full_name: Rieder, Sabine
last_name: Rieder
citation:
ama: 'Kretinsky J, Meggendorfer T, Prokop M, Rieder S. Guessing winning policies
in LTL synthesis by semantic learning. In: 35th International Conference on
Computer Aided Verification. Vol 13964. Springer Nature; 2023:390-414. doi:10.1007/978-3-031-37706-8_20'
apa: 'Kretinsky, J., Meggendorfer, T., Prokop, M., & Rieder, S. (2023). Guessing
winning policies in LTL synthesis by semantic learning. In 35th International
Conference on Computer Aided Verification (Vol. 13964, pp. 390–414). Paris,
France: Springer Nature. https://doi.org/10.1007/978-3-031-37706-8_20'
chicago: Kretinsky, Jan, Tobias Meggendorfer, Maximilian Prokop, and Sabine Rieder.
“Guessing Winning Policies in LTL Synthesis by Semantic Learning.” In 35th
International Conference on Computer Aided Verification, 13964:390–414. Springer
Nature, 2023. https://doi.org/10.1007/978-3-031-37706-8_20.
ieee: J. Kretinsky, T. Meggendorfer, M. Prokop, and S. Rieder, “Guessing winning
policies in LTL synthesis by semantic learning,” in 35th International Conference
on Computer Aided Verification, Paris, France, 2023, vol. 13964, pp. 390–414.
ista: 'Kretinsky J, Meggendorfer T, Prokop M, Rieder S. 2023. Guessing winning policies
in LTL synthesis by semantic learning. 35th International Conference on Computer
Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 13964, 390–414.'
mla: Kretinsky, Jan, et al. “Guessing Winning Policies in LTL Synthesis by Semantic
Learning.” 35th International Conference on Computer Aided Verification,
vol. 13964, Springer Nature, 2023, pp. 390–414, doi:10.1007/978-3-031-37706-8_20.
short: J. Kretinsky, T. Meggendorfer, M. Prokop, S. Rieder, in:, 35th International
Conference on Computer Aided Verification, Springer Nature, 2023, pp. 390–414.
conference:
end_date: 2023-07-22
location: Paris, France
name: 'CAV: Computer Aided Verification'
start_date: 2023-07-17
das_tickbox: '1'
date_created: 2023-09-03T22:01:16Z
date_published: 2023-07-17T00:00:00Z
date_updated: 2026-07-07T13:39:23Z
day: '17'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-031-37706-8_20
external_id:
isi:
- '001310786500020'
file:
- access_level: open_access
checksum: ed66278b61bb869e1baba3d9b9081271
content_type: application/pdf
creator: dernst
date_created: 2023-09-06T08:25:50Z
date_updated: 2023-09-06T08:25:50Z
file_id: '14276'
file_name: 2023_LNCS_CAV_Kretinsky.pdf
file_size: 428354
relation: main_file
success: 1
file_date_updated: 2023-09-06T08:25:50Z
has_accepted_license: '1'
intvolume: ' 13964'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 390-414
publication: 35th International Conference on Computer Aided Verification
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031377051'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Guessing winning policies in LTL synthesis by semantic learning
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13964
year: '2023'
...
---
_id: '14995'
abstract:
- lang: eng
text: "Lincheck is a new practical and user-friendly framework for testing concurrent
data structures on the Java Virtual Machine (JVM). It provides a simple and declarative
way to write concurrent tests. Instead of describing how to perform the test,
users specify what to test by declaring all the operations to examine; the framework
automatically handles the rest. As a result, tests written with Lincheck are concise
and easy to understand. \r\nThe artifact presents a collection of Lincheck tests
that discover new bugs in popular libraries and implementations from the concurrency
literature -- they are listed in Table 1, Section 3. To evaluate the performance
of Lincheck analysis, the collection of tests also includes those which check
correct data structures and, thus, always succeed. Similarly to Table 2, Section
3, the experiments demonstrate the reasonable time to perform a test. Finally,
Lincheck provides user-friendly output with an easy-to-follow trace to reproduce
a detected error, significantly simplifying further investigation."
article_processing_charge: No
author:
- first_name: Nikita
full_name: Koval, Nikita
id: 2F4DB10C-F248-11E8-B48F-1D18A9856A87
last_name: Koval
- first_name: Alexander
full_name: Fedorov, Alexander
id: 2e711909-896a-11ed-bdf8-eb0f5a2984c6
last_name: Fedorov
- first_name: Maria
full_name: Sokolova, Maria
last_name: Sokolova
- first_name: Dmitry
full_name: Tsitelov, Dmitry
last_name: Tsitelov
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. Lincheck: A practical
framework for testing concurrent data structures on JVM. 2023. doi:10.5281/ZENODO.7877757'
apa: 'Koval, N., Fedorov, A., Sokolova, M., Tsitelov, D., & Alistarh, D.-A.
(2023). Lincheck: A practical framework for testing concurrent data structures
on JVM. Zenodo. https://doi.org/10.5281/ZENODO.7877757'
chicago: 'Koval, Nikita, Alexander Fedorov, Maria Sokolova, Dmitry Tsitelov, and
Dan-Adrian Alistarh. “Lincheck: A Practical Framework for Testing Concurrent Data
Structures on JVM.” Zenodo, 2023. https://doi.org/10.5281/ZENODO.7877757.'
ieee: 'N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, and D.-A. Alistarh, “Lincheck:
A practical framework for testing concurrent data structures on JVM.” Zenodo,
2023.'
ista: 'Koval N, Fedorov A, Sokolova M, Tsitelov D, Alistarh D-A. 2023. Lincheck:
A practical framework for testing concurrent data structures on JVM, Zenodo, 10.5281/ZENODO.7877757.'
mla: 'Koval, Nikita, et al. Lincheck: A Practical Framework for Testing Concurrent
Data Structures on JVM. Zenodo, 2023, doi:10.5281/ZENODO.7877757.'
short: N. Koval, A. Fedorov, M. Sokolova, D. Tsitelov, D.-A. Alistarh, (2023).
date_created: 2024-02-14T15:14:13Z
date_published: 2023-04-28T00:00:00Z
date_updated: 2026-07-07T13:39:35Z
day: '28'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.5281/ZENODO.7877757
main_file_link:
- open_access: '1'
url: https://doi.org/10.5281/zenodo.7877757
month: '04'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
record:
- id: '14260'
relation: used_in_publication
status: public
status: public
title: 'Lincheck: A practical framework for testing concurrent data structures on
JVM'
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '12960'
abstract:
- lang: eng
text: "Isomanifolds are the generalization of isosurfaces to arbitrary dimension
and codimension, i.e., submanifolds of Rd defined as the zero set of some multivariate
multivalued smooth function f:Rd→Rd−n, where n is the intrinsic dimension of the
manifold. A natural way to approximate a smooth isomanifold M=f−1(0) is to consider
its piecewise linear (PL) approximation M^\r\n based on a triangulation T of the
ambient space Rd. In this paper, we describe a simple algorithm to trace isomanifolds
from a given starting point. The algorithm works for arbitrary dimensions n and
d, and any precision D. Our main result is that, when f (or M) has bounded complexity,
the complexity of the algorithm is polynomial in d and δ=1/D (and unavoidably
exponential in n). Since it is known that for δ=Ω(d2.5), M^ is O(D2)-close and
isotopic to M\r\n, our algorithm produces a faithful PL-approximation of isomanifolds
of bounded complexity in time polynomial in d. Combining this algorithm with dimensionality
reduction techniques, the dependency on d in the size of M^ can be completely
removed with high probability. We also show that the algorithm can handle isomanifolds
with boundary and, more generally, isostratifolds. The algorithm for isomanifolds
with boundary has been implemented and experimental results are reported, showing
that it is practical and can handle cases that are far ahead of the state-of-the-art. "
acknowledgement: The authors have received funding from the European Research Council
under the European Union's ERC grant greement 339025 GUDHI (Algorithmic Foundations
of Geometric Un-derstanding in Higher Dimensions). The first author was supported by the French government,through
the 3IA C\^ote d'Azur Investments in the Future project managed by the National
ResearchAgency (ANR) with the reference ANR-19-P3IA-0002. The third author was
supported by the Eu-ropean Union's Horizon 2020 research and innovation programme
under the Marie Sk\lodowska-Curiegrant agreement 754411 and the FWF (Austrian Science
Fund) grant M 3073.
article_processing_charge: No
article_type: original
author:
- first_name: Jean Daniel
full_name: Boissonnat, Jean Daniel
last_name: Boissonnat
- first_name: Siargey
full_name: Kachanovich, Siargey
last_name: Kachanovich
- first_name: Mathijs
full_name: Wintraecken, Mathijs
id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
last_name: Wintraecken
orcid: 0000-0002-7472-2220
citation:
ama: Boissonnat JD, Kachanovich S, Wintraecken M. Tracing isomanifolds in Rd in
time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations. SIAM Journal
on Computing. 2023;52(2):452-486. doi:10.1137/21M1412918
apa: Boissonnat, J. D., Kachanovich, S., & Wintraecken, M. (2023). Tracing isomanifolds
in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations. SIAM
Journal on Computing. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/21M1412918
chicago: Boissonnat, Jean Daniel, Siargey Kachanovich, and Mathijs Wintraecken.
“Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter–Freudenthal–Kuhn
Triangulations.” SIAM Journal on Computing. Society for Industrial and
Applied Mathematics, 2023. https://doi.org/10.1137/21M1412918.
ieee: J. D. Boissonnat, S. Kachanovich, and M. Wintraecken, “Tracing isomanifolds
in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations,”
SIAM Journal on Computing, vol. 52, no. 2. Society for Industrial and Applied
Mathematics, pp. 452–486, 2023.
ista: Boissonnat JD, Kachanovich S, Wintraecken M. 2023. Tracing isomanifolds in
Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations. SIAM
Journal on Computing. 52(2), 452–486.
mla: Boissonnat, Jean Daniel, et al. “Tracing Isomanifolds in Rd in Time Polynomial
in d Using Coxeter–Freudenthal–Kuhn Triangulations.” SIAM Journal on Computing,
vol. 52, no. 2, Society for Industrial and Applied Mathematics, 2023, pp. 452–86,
doi:10.1137/21M1412918.
short: J.D. Boissonnat, S. Kachanovich, M. Wintraecken, SIAM Journal on Computing
52 (2023) 452–486.
corr_author: '1'
date_created: 2023-05-14T22:01:00Z
date_published: 2023-04-30T00:00:00Z
date_updated: 2026-07-07T13:43:40Z
day: '30'
department:
- _id: HeEd
doi: 10.1137/21M1412918
ec_funded: 1
external_id:
isi:
- '001013183000012'
intvolume: ' 52'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal-emse.ccsd.cnrs.fr/3IA-COTEDAZUR/hal-04083489v1
month: '04'
oa: 1
oa_version: Submitted Version
page: 452-486
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: fc390959-9c52-11eb-aca3-afa58bd282b2
grant_number: M03073
name: Learning and triangulating manifolds via collapses
publication: SIAM Journal on Computing
publication_identifier:
eissn:
- 1095-7111
issn:
- 0097-5397
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
related_material:
record:
- id: '9441'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Tracing isomanifolds in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn
triangulations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 52
year: '2023'
...