---
_id: '15169'
abstract:
- lang: eng
text: Interpretation of extracellular recordings can be challenging due to the long
range of electric field. This challenge can be mitigated by estimating the current
source density (CSD). Here we introduce kCSD-python, an open Python package implementing
Kernel Current Source Density (kCSD) method and related tools to facilitate CSD
analysis of experimental data and the interpretation of results. We show how to
counter the limitations imposed by noise and assumptions in the method itself.
kCSD-python allows CSD estimation for an arbitrary distribution of electrodes
in 1D, 2D, and 3D, assuming distributions of sources in tissue, a slice, or in
a single cell, and includes a range of diagnostic aids. We demonstrate its features
in a Jupyter Notebook tutorial which illustrates a typical analytical workflow
and main functionalities useful in validating analysis results.
acknowledgement: 'The Python implementation of kCSD was started by Grzegorz Parka
during Google Summer of Code project through the International Neuroinformatics
Coordinating Facility. Jan Mąka implemented the first Python version of skCSD class.
This work was supported by the Polish National Science Centre (2013/08/W/NZ4/00691
to DKW; 2015/17/B/ST7/04123 to DKW). '
article_number: e1011941
article_processing_charge: Yes
article_type: original
author:
- first_name: Chaitanya
full_name: Chintaluri, Chaitanya
id: E4EDB536-3485-11EA-98D2-20AF3DDC885E
last_name: Chintaluri
- first_name: Marta
full_name: Bejtka, Marta
last_name: Bejtka
- first_name: Wladyslaw
full_name: Sredniawa, Wladyslaw
last_name: Sredniawa
- first_name: Michal
full_name: Czerwinski, Michal
last_name: Czerwinski
- first_name: Jakub M.
full_name: Dzik, Jakub M.
last_name: Dzik
- first_name: Joanna
full_name: Jedrzejewska-Szmek, Joanna
last_name: Jedrzejewska-Szmek
- first_name: Daniel K.
full_name: Wojciki, Daniel K.
last_name: Wojciki
citation:
ama: Chintaluri C, Bejtka M, Sredniawa W, et al. kCSD-python, reliable current source
density estimation with quality control. PLoS Computational Biology. 2024;20(3).
doi:10.1371/journal.pcbi.1011941
apa: Chintaluri, C., Bejtka, M., Sredniawa, W., Czerwinski, M., Dzik, J. M., Jedrzejewska-Szmek,
J., & Wojciki, D. K. (2024). kCSD-python, reliable current source density
estimation with quality control. PLoS Computational Biology. Public Library
of Science. https://doi.org/10.1371/journal.pcbi.1011941
chicago: Chintaluri, Chaitanya, Marta Bejtka, Wladyslaw Sredniawa, Michal Czerwinski,
Jakub M. Dzik, Joanna Jedrzejewska-Szmek, and Daniel K. Wojciki. “KCSD-Python,
Reliable Current Source Density Estimation with Quality Control.” PLoS Computational
Biology. Public Library of Science, 2024. https://doi.org/10.1371/journal.pcbi.1011941.
ieee: C. Chintaluri et al., “kCSD-python, reliable current source density
estimation with quality control,” PLoS Computational Biology, vol. 20,
no. 3. Public Library of Science, 2024.
ista: Chintaluri C, Bejtka M, Sredniawa W, Czerwinski M, Dzik JM, Jedrzejewska-Szmek
J, Wojciki DK. 2024. kCSD-python, reliable current source density estimation with
quality control. PLoS Computational Biology. 20(3), e1011941.
mla: Chintaluri, Chaitanya, et al. “KCSD-Python, Reliable Current Source Density
Estimation with Quality Control.” PLoS Computational Biology, vol. 20,
no. 3, e1011941, Public Library of Science, 2024, doi:10.1371/journal.pcbi.1011941.
short: C. Chintaluri, M. Bejtka, W. Sredniawa, M. Czerwinski, J.M. Dzik, J. Jedrzejewska-Szmek,
D.K. Wojciki, PLoS Computational Biology 20 (2024).
date_created: 2024-03-24T23:00:59Z
date_published: 2024-03-14T00:00:00Z
date_updated: 2024-03-25T07:54:23Z
day: '14'
department:
- _id: TiVo
doi: 10.1371/journal.pcbi.1011941
intvolume: ' 20'
issue: '3'
language:
- iso: eng
month: '03'
oa_version: Published Version
publication: PLoS Computational Biology
publication_identifier:
eissn:
- 1553-7358
issn:
- 1553-734X
publication_status: published
publisher: Public Library of Science
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://github.com/Neuroinflab/kCSD-python
scopus_import: '1'
status: public
title: kCSD-python, reliable current source density estimation with quality control
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 20
year: '2024'
...
---
_id: '15167'
abstract:
- lang: eng
text: We perform a diagrammatic analysis of the energy of a mobile impurity immersed
in a strongly interacting two-component Fermi gas to second order in the impurity-bath
interaction. These corrections demonstrate divergent behavior in the limit of
large impurity momentum. We show the fundamental processes responsible for these
logarithmically divergent terms. We study the problem in the general case without
any assumptions regarding the fermion-fermion interactions in the bath. We show
that the divergent term can be summed up to all orders in the Fermi-Fermi interaction
and that the resulting expression is equivalent to the one obtained in the few-body
calculation. Finally, we provide a perturbative calculation to the second order
in the Fermi-Fermi interaction, and we show the diagrams responsible for these
terms.
acknowledgement: We thank Félix Werner and Kris Van Houcke for interesting discussions.
article_number: '033315'
article_processing_charge: No
article_type: original
author:
- first_name: Ragheed
full_name: Al Hyder, Ragheed
id: d1c405be-ae15-11ed-8510-ccf53278162e
last_name: Al Hyder
- first_name: F.
full_name: Chevy, F.
last_name: Chevy
- first_name: X.
full_name: Leyronas, X.
last_name: Leyronas
citation:
ama: Al Hyder R, Chevy F, Leyronas X. Exploring beyond-mean-field logarithmic divergences
in Fermi-polaron energy. Physical Review A. 2024;109(3). doi:10.1103/PhysRevA.109.033315
apa: Al Hyder, R., Chevy, F., & Leyronas, X. (2024). Exploring beyond-mean-field
logarithmic divergences in Fermi-polaron energy. Physical Review A. American
Physical Society. https://doi.org/10.1103/PhysRevA.109.033315
chicago: Al Hyder, Ragheed, F. Chevy, and X. Leyronas. “Exploring Beyond-Mean-Field
Logarithmic Divergences in Fermi-Polaron Energy.” Physical Review A. American
Physical Society, 2024. https://doi.org/10.1103/PhysRevA.109.033315.
ieee: R. Al Hyder, F. Chevy, and X. Leyronas, “Exploring beyond-mean-field logarithmic
divergences in Fermi-polaron energy,” Physical Review A, vol. 109, no.
3. American Physical Society, 2024.
ista: Al Hyder R, Chevy F, Leyronas X. 2024. Exploring beyond-mean-field logarithmic
divergences in Fermi-polaron energy. Physical Review A. 109(3), 033315.
mla: Al Hyder, Ragheed, et al. “Exploring Beyond-Mean-Field Logarithmic Divergences
in Fermi-Polaron Energy.” Physical Review A, vol. 109, no. 3, 033315, American
Physical Society, 2024, doi:10.1103/PhysRevA.109.033315.
short: R. Al Hyder, F. Chevy, X. Leyronas, Physical Review A 109 (2024).
date_created: 2024-03-24T23:00:59Z
date_published: 2024-03-19T00:00:00Z
date_updated: 2024-03-25T07:36:55Z
day: '19'
department:
- _id: MiLe
doi: 10.1103/PhysRevA.109.033315
external_id:
arxiv:
- '2311.14536'
intvolume: ' 109'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2311.14536
month: '03'
oa: 1
oa_version: Preprint
publication: Physical Review A
publication_identifier:
eissn:
- 2469-9934
issn:
- 2469-9926
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Exploring beyond-mean-field logarithmic divergences in Fermi-polaron energy
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 109
year: '2024'
...
---
_id: '15163'
abstract:
- lang: eng
text: For some k∈Z≥0∪{∞}, we call a linear forest k-bounded if each of its components
has at most k edges. We will say a (k,ℓ)-bounded linear forest decomposition of
a graph G is a partition of E(G) into the edge sets of two linear forests Fk,Fℓ
where Fk is k-bounded and Fℓ is ℓ-bounded. We show that the problem of deciding
whether a given graph has such a decomposition is NP-complete if both k and ℓ
are at least 2, NP-complete if k≥9 and ℓ=1, and is in P for (k,ℓ)=(2,1). Before
this, the only known NP-complete cases were the (2,2) and (3,3) cases. Our hardness
result answers a question of Bermond et al. from 1984. We also show that planar
graphs of girth at least nine decompose into a linear forest and a matching, which
in particular is stronger than 3-edge-colouring such graphs.
acknowledgement: We wish to thank Dániel Marx and András Sebő for making us aware
of the results in [8] and some clarifications on them.
article_number: '113962'
article_processing_charge: No
article_type: original
author:
- first_name: Rutger
full_name: Campbell, Rutger
last_name: Campbell
- first_name: Florian
full_name: Hörsch, Florian
last_name: Hörsch
- first_name: Benjamin
full_name: Moore, Benjamin
id: 6dc1a1be-bf1c-11ed-8d2b-d044840f49d6
last_name: Moore
citation:
ama: Campbell R, Hörsch F, Moore B. Decompositions into two linear forests of bounded
lengths. Discrete Mathematics. 2024;347(6). doi:10.1016/j.disc.2024.113962
apa: Campbell, R., Hörsch, F., & Moore, B. (2024). Decompositions into two linear
forests of bounded lengths. Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.disc.2024.113962
chicago: Campbell, Rutger, Florian Hörsch, and Benjamin Moore. “Decompositions into
Two Linear Forests of Bounded Lengths.” Discrete Mathematics. Elsevier,
2024. https://doi.org/10.1016/j.disc.2024.113962.
ieee: R. Campbell, F. Hörsch, and B. Moore, “Decompositions into two linear forests
of bounded lengths,” Discrete Mathematics, vol. 347, no. 6. Elsevier, 2024.
ista: Campbell R, Hörsch F, Moore B. 2024. Decompositions into two linear forests
of bounded lengths. Discrete Mathematics. 347(6), 113962.
mla: Campbell, Rutger, et al. “Decompositions into Two Linear Forests of Bounded
Lengths.” Discrete Mathematics, vol. 347, no. 6, 113962, Elsevier, 2024,
doi:10.1016/j.disc.2024.113962.
short: R. Campbell, F. Hörsch, B. Moore, Discrete Mathematics 347 (2024).
date_created: 2024-03-24T23:00:58Z
date_published: 2024-03-19T00:00:00Z
date_updated: 2024-03-25T08:09:43Z
day: '19'
department:
- _id: MaKw
doi: 10.1016/j.disc.2024.113962
external_id:
arxiv:
- '2301.11615'
intvolume: ' 347'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2301.11615
month: '03'
oa: 1
oa_version: Preprint
publication: Discrete Mathematics
publication_identifier:
issn:
- 0012-365X
publication_status: epub_ahead
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Decompositions into two linear forests of bounded lengths
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 347
year: '2024'
...
---
_id: '15180'
abstract:
- lang: eng
text: Characterizing the prevalence and properties of faint active galactic nuclei
(AGNs) in the early Universe is key for understanding the formation of supermassive
black holes (SMBHs) and determining their role in cosmic reionization. We perform
a spectroscopic search for broad Hα emitters at z ≈ 4–6 using deep JWST/NIRCam
imaging and wide field slitless spectroscopy from the EIGER and FRESCO surveys.
We identify 20 Hα lines at z = 4.2–5.5 that have broad components with line widths
from ∼1200–3700 km s−1, contributing ∼30%–90% of the total line flux. We interpret
these broad components as being powered by accretion onto SMBHs with implied masses
∼107–8M⊙. In the UV luminosity range MUV,AGN+host = −21 to −18, we measure number
densities of ≈10−5 cMpc−3. This is an order of magnitude higher than expected
from extrapolating quasar UV luminosity functions (LFs). Yet, such AGN are found
in only <1% of star-forming galaxies at z ∼ 5. The number density discrepancy
is much lower when compared to the broad Hα LF. The SMBH mass function agrees
with large cosmological simulations. In two objects, we detect complex Hα profiles
that we tentatively interpret as caused by absorption signatures from dense gas
fueling SMBH growth and outflows. We may be witnessing early AGN feedback that
will clear dust-free pathways through which more massive blue quasars are seen.
We uncover a strong correlation between reddening and the fraction of total galaxy
luminosity arising from faint AGN. This implies that early SMBH growth is highly
obscured and that faint AGN are only minor contributors to cosmic reionization.
acknowledgement: "We thank the anonymous referee for constructive comments that helped
improve the manuscript. This work is based on observations made with the NASA/ESA/CSA
James Webb Space Telescope. The data were obtained from the Mikulski Archive for
Space Telescopes at the Space Telescope Science Institute, which is operated by
the Association of Universities for Research in Astronomy, Inc., under NASA contract
NAS 5-03127 for JWST. These observations are associated with program Nos. 1243 and
1895. The specific observations analyzed can be accessed via doi:10.17909/4xx0-zj76.
Funded by the European Union (ERC, AGENTS, 101076224). Views and opinions expressed
are however those of the author(s) only and do not necessarily reflect those of
the European Union or the European Research Council. Neither the European Union
nor the granting authority can be held responsible for them. R.P.N. acknowledges
funding from JWST programs GO-1933 and GO-2279. Support for this work for R.P.N.
was provided by NASA through the NASA Hubble Fellowship grant HST-HF2-51515.001-A
awarded by the Space Telescope Science Institute, which is operated by the Association
of Universities for Research in Astronomy, Incorporated, under NASA contract NAS5-26555.
Support for this work for G.I. was provided by NASA through grant JWST-GO-01895
awarded by the Space Telescope Science Institute, which is operated by the Association
of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-26555.
This work has received funding from the Swiss State Secretariat for Education, Research
and Innovation (SERI) under contract No. MB22.00072, as well as from the Swiss National
Science Foundation (SNSF) through project grant 200020_207349. The Cosmic Dawn Center
(DAWN) is funded by the Danish National Research Foundation under grant No. 140.\r\nFacility:
JWST - James Webb Space Telescope, HST - Hubble Space Telescope satellite\r\nSoftware:
Python, matplotlib (Hunter 2007), numpy (Harris et al. 2020), scipy (Virtanen et
al. 2020), Astropy (Astropy Collaboration et al. 2013, 2018), Imfit (Erwin 2015)."
article_number: '129'
article_processing_charge: Yes
article_type: original
author:
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: Rohan P.
full_name: Naidu, Rohan P.
last_name: Naidu
- first_name: Gabriel
full_name: Brammer, Gabriel
last_name: Brammer
- first_name: John
full_name: Chisholm, John
last_name: Chisholm
- first_name: Anna-Christina
full_name: Eilers, Anna-Christina
last_name: Eilers
- first_name: Andy
full_name: Goulding, Andy
last_name: Goulding
- first_name: Jenny
full_name: Greene, Jenny
last_name: Greene
- first_name: Daichi
full_name: Kashino, Daichi
last_name: Kashino
- first_name: Ivo
full_name: Labbe, Ivo
last_name: Labbe
- first_name: Simon J.
full_name: Lilly, Simon J.
last_name: Lilly
- first_name: Ruari
full_name: Mackenzie, Ruari
last_name: Mackenzie
- first_name: Pascal A.
full_name: Oesch, Pascal A.
last_name: Oesch
- first_name: Andrea
full_name: Weibel, Andrea
last_name: Weibel
- first_name: Stijn
full_name: Wuyts, Stijn
last_name: Wuyts
- first_name: Mengyuan
full_name: Xiao, Mengyuan
last_name: Xiao
- first_name: Rongmon
full_name: Bordoloi, Rongmon
last_name: Bordoloi
- first_name: Rychard
full_name: Bouwens, Rychard
last_name: Bouwens
- first_name: Pieter
full_name: van Dokkum, Pieter
last_name: van Dokkum
- first_name: Garth
full_name: Illingworth, Garth
last_name: Illingworth
- first_name: Ivan
full_name: Kramarenko, Ivan
last_name: Kramarenko
- first_name: Michael V.
full_name: Maseda, Michael V.
last_name: Maseda
- first_name: Charlotte
full_name: Mason, Charlotte
last_name: Mason
- first_name: Romain A.
full_name: Meyer, Romain A.
last_name: Meyer
- first_name: Erica J.
full_name: Nelson, Erica J.
last_name: Nelson
- first_name: Naveen A.
full_name: Reddy, Naveen A.
last_name: Reddy
- first_name: Irene
full_name: Shivaei, Irene
last_name: Shivaei
- first_name: Robert A.
full_name: Simcoe, Robert A.
last_name: Simcoe
- first_name: Minghao
full_name: Yue, Minghao
last_name: Yue
citation:
ama: 'Matthee JJ, Naidu RP, Brammer G, et al. Little Red Dots: An abundant population
of faint active galactic nuclei at z ∼ 5 revealed by the EIGER and FRESCO JWST
surveys. The Astrophysical Journal. 2024;963(2). doi:10.3847/1538-4357/ad2345'
apa: 'Matthee, J. J., Naidu, R. P., Brammer, G., Chisholm, J., Eilers, A.-C., Goulding,
A., … Yue, M. (2024). Little Red Dots: An abundant population of faint active
galactic nuclei at z ∼ 5 revealed by the EIGER and FRESCO JWST surveys. The
Astrophysical Journal. American Astronomical Society. https://doi.org/10.3847/1538-4357/ad2345'
chicago: 'Matthee, Jorryt J, Rohan P. Naidu, Gabriel Brammer, John Chisholm, Anna-Christina
Eilers, Andy Goulding, Jenny Greene, et al. “Little Red Dots: An Abundant Population
of Faint Active Galactic Nuclei at z ∼ 5 Revealed by the EIGER and FRESCO JWST
Surveys.” The Astrophysical Journal. American Astronomical Society, 2024.
https://doi.org/10.3847/1538-4357/ad2345.'
ieee: 'J. J. Matthee et al., “Little Red Dots: An abundant population of
faint active galactic nuclei at z ∼ 5 revealed by the EIGER and FRESCO JWST surveys,”
The Astrophysical Journal, vol. 963, no. 2. American Astronomical Society,
2024.'
ista: 'Matthee JJ, Naidu RP, Brammer G, Chisholm J, Eilers A-C, Goulding A, Greene
J, Kashino D, Labbe I, Lilly SJ, Mackenzie R, Oesch PA, Weibel A, Wuyts S, Xiao
M, Bordoloi R, Bouwens R, van Dokkum P, Illingworth G, Kramarenko I, Maseda MV,
Mason C, Meyer RA, Nelson EJ, Reddy NA, Shivaei I, Simcoe RA, Yue M. 2024. Little
Red Dots: An abundant population of faint active galactic nuclei at z ∼ 5 revealed
by the EIGER and FRESCO JWST surveys. The Astrophysical Journal. 963(2), 129.'
mla: 'Matthee, Jorryt J., et al. “Little Red Dots: An Abundant Population of Faint
Active Galactic Nuclei at z ∼ 5 Revealed by the EIGER and FRESCO JWST Surveys.”
The Astrophysical Journal, vol. 963, no. 2, 129, American Astronomical
Society, 2024, doi:10.3847/1538-4357/ad2345.'
short: J.J. Matthee, R.P. Naidu, G. Brammer, J. Chisholm, A.-C. Eilers, A. Goulding,
J. Greene, D. Kashino, I. Labbe, S.J. Lilly, R. Mackenzie, P.A. Oesch, A. Weibel,
S. Wuyts, M. Xiao, R. Bordoloi, R. Bouwens, P. van Dokkum, G. Illingworth, I.
Kramarenko, M.V. Maseda, C. Mason, R.A. Meyer, E.J. Nelson, N.A. Reddy, I. Shivaei,
R.A. Simcoe, M. Yue, The Astrophysical Journal 963 (2024).
date_created: 2024-03-25T08:54:47Z
date_published: 2024-03-07T00:00:00Z
date_updated: 2024-03-25T09:37:27Z
day: '07'
ddc:
- '550'
department:
- _id: JoMa
doi: 10.3847/1538-4357/ad2345
file:
- access_level: open_access
checksum: dc7af4694f9f94a551417ab49fa43edf
content_type: application/pdf
creator: dernst
date_created: 2024-03-25T09:31:58Z
date_updated: 2024-03-25T09:31:58Z
file_id: '15184'
file_name: 2024_AstrophysicalJourn_Matthee.pdf
file_size: 6047536
relation: main_file
success: 1
file_date_updated: 2024-03-25T09:31:58Z
has_accepted_license: '1'
intvolume: ' 963'
issue: '2'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '03'
oa: 1
oa_version: Published Version
project:
- _id: bd9b2118-d553-11ed-ba76-db24564edfea
grant_number: '101076224'
name: Young galaxies as tracers and agents of cosmic reionization
publication: The Astrophysical Journal
publication_identifier:
eissn:
- 1538-4357
issn:
- 0004-637X
publication_status: published
publisher: American Astronomical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Little Red Dots: An abundant population of faint active galactic nuclei at
z ∼ 5 revealed by the EIGER and FRESCO JWST surveys'
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: 963
year: '2024'
...
---
_id: '15179'
abstract:
- lang: eng
text: The fungal bioluminescence pathway can be reconstituted in other organisms
allowing luminescence imaging without exogenously supplied substrate. The pathway
starts from hispidin biosynthesis—a step catalyzed by a large fungal polyketide
synthase that requires a posttranslational modification for activity. Here, we
report identification of alternative compact hispidin synthases encoded by a phylogenetically
diverse group of plants. A hybrid bioluminescence pathway that combines plant
and fungal genes is more compact, not dependent on availability of machinery for
posttranslational modifications, and confers autonomous bioluminescence in yeast,
mammalian, and plant hosts. The compact size of plant hispidin synthases enables
additional modes of delivery of autoluminescence, such as delivery with viral
vectors.
acknowledgement: "We thank Milaboratory (milaboratory.com) for the access to computing
and storage infrastructure. We thank J. Petrasek for providing the BY-2 cell culture
line. We thank Konstantin Lukyanov laboratory and Sergey Deyev laboratory for assistance
with experiments.\r\nThis study was partially funded by Light Bio and Planta. The
Synthetic biology Group is funded by the MRC London Institute of Medical Sciences
(UKRI MC-A658-5QEA0). Cloning and luminescent assays performed in BY-2 were partially
supported by RSF, project number 22-14-00400, https://rscf.ru/project/22-14-00400/.
Plant transformations were funded by RFBR and MOST, project number 21-54-52004.
Plant imaging experiments were funded by RSF, project number 22-74-00124, https://rscf.ru/project/22-74-00124/.
Viral delivery experiments were funded by the grant PID2019-108203RB-I00 Plan Nacional
I + D from the Ministerio de Ciencia e Innovación (Spain) through the Agencia Estatal
de Investigación (cofinanced by the European Regional Development Fund)."
article_number: adk1992
article_processing_charge: Yes
article_type: original
author:
- first_name: Kseniia A.
full_name: Palkina, Kseniia A.
last_name: Palkina
- first_name: Tatiana A.
full_name: Karataeva, Tatiana A.
last_name: Karataeva
- first_name: Maxim M.
full_name: Perfilov, Maxim M.
last_name: Perfilov
- first_name: Liliia I.
full_name: Fakhranurova, Liliia I.
last_name: Fakhranurova
- first_name: Nadezhda M.
full_name: Markina, Nadezhda M.
last_name: Markina
- first_name: Louisa
full_name: Gonzalez Somermeyer, Louisa
id: 4720D23C-F248-11E8-B48F-1D18A9856A87
last_name: Gonzalez Somermeyer
orcid: 0000-0001-9139-5383
- first_name: Elena
full_name: Garcia-Perez, Elena
last_name: Garcia-Perez
- first_name: Marta
full_name: Vazquez-Vilar, Marta
last_name: Vazquez-Vilar
- first_name: Marta
full_name: Rodriguez-Rodriguez, Marta
last_name: Rodriguez-Rodriguez
- first_name: Victor
full_name: Vazquez-Vilriales, Victor
last_name: Vazquez-Vilriales
- first_name: Ekaterina S.
full_name: Shakhova, Ekaterina S.
last_name: Shakhova
- first_name: Tatiana
full_name: Mitiouchkina, Tatiana
last_name: Mitiouchkina
- first_name: Olga A.
full_name: Belozerova, Olga A.
last_name: Belozerova
- first_name: Sergey I.
full_name: Kovalchuk, Sergey I.
last_name: Kovalchuk
- first_name: Anna
full_name: Alekberova, Anna
last_name: Alekberova
- first_name: Alena K.
full_name: Malyshevskaia, Alena K.
last_name: Malyshevskaia
- first_name: Evgenia N.
full_name: Bugaeva, Evgenia N.
last_name: Bugaeva
- first_name: Elena B.
full_name: Guglya, Elena B.
last_name: Guglya
- first_name: Anastasia
full_name: Balakireva, Anastasia
last_name: Balakireva
- first_name: Nikita
full_name: Sytov, Nikita
last_name: Sytov
- first_name: Anastasia
full_name: Bezlikhotnova, Anastasia
last_name: Bezlikhotnova
- first_name: Daria I.
full_name: Boldyreva, Daria I.
last_name: Boldyreva
- first_name: Vladislav V.
full_name: Babenko, Vladislav V.
last_name: Babenko
- first_name: Fyodor
full_name: Kondrashov, Fyodor
id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
last_name: Kondrashov
orcid: 0000-0001-8243-4694
- first_name: Vladimir V.
full_name: Choob, Vladimir V.
last_name: Choob
- first_name: Diego
full_name: Orzaez, Diego
last_name: Orzaez
- first_name: Ilia V.
full_name: Yampolsky, Ilia V.
last_name: Yampolsky
- first_name: Alexander S.
full_name: Mishin, Alexander S.
last_name: Mishin
- first_name: Karen S.
full_name: Sarkisyan, Karen S.
last_name: Sarkisyan
citation:
ama: Palkina KA, Karataeva TA, Perfilov MM, et al. A hybrid pathway for self-sustained
luminescence. Science Advances. 2024;10(10). doi:10.1126/sciadv.adk1992
apa: Palkina, K. A., Karataeva, T. A., Perfilov, M. M., Fakhranurova, L. I., Markina,
N. M., Gonzalez Somermeyer, L., … Sarkisyan, K. S. (2024). A hybrid pathway for
self-sustained luminescence. Science Advances. American Association for
the Advancement of Science. https://doi.org/10.1126/sciadv.adk1992
chicago: Palkina, Kseniia A., Tatiana A. Karataeva, Maxim M. Perfilov, Liliia I.
Fakhranurova, Nadezhda M. Markina, Louisa Gonzalez Somermeyer, Elena Garcia-Perez,
et al. “A Hybrid Pathway for Self-Sustained Luminescence.” Science Advances.
American Association for the Advancement of Science, 2024. https://doi.org/10.1126/sciadv.adk1992.
ieee: K. A. Palkina et al., “A hybrid pathway for self-sustained luminescence,”
Science Advances, vol. 10, no. 10. American Association for the Advancement
of Science, 2024.
ista: Palkina KA, Karataeva TA, Perfilov MM, Fakhranurova LI, Markina NM, Gonzalez
Somermeyer L, Garcia-Perez E, Vazquez-Vilar M, Rodriguez-Rodriguez M, Vazquez-Vilriales
V, Shakhova ES, Mitiouchkina T, Belozerova OA, Kovalchuk SI, Alekberova A, Malyshevskaia
AK, Bugaeva EN, Guglya EB, Balakireva A, Sytov N, Bezlikhotnova A, Boldyreva DI,
Babenko VV, Kondrashov F, Choob VV, Orzaez D, Yampolsky IV, Mishin AS, Sarkisyan
KS. 2024. A hybrid pathway for self-sustained luminescence. Science Advances.
10(10), adk1992.
mla: Palkina, Kseniia A., et al. “A Hybrid Pathway for Self-Sustained Luminescence.”
Science Advances, vol. 10, no. 10, adk1992, American Association for the
Advancement of Science, 2024, doi:10.1126/sciadv.adk1992.
short: K.A. Palkina, T.A. Karataeva, M.M. Perfilov, L.I. Fakhranurova, N.M. Markina,
L. Gonzalez Somermeyer, E. Garcia-Perez, M. Vazquez-Vilar, M. Rodriguez-Rodriguez,
V. Vazquez-Vilriales, E.S. Shakhova, T. Mitiouchkina, O.A. Belozerova, S.I. Kovalchuk,
A. Alekberova, A.K. Malyshevskaia, E.N. Bugaeva, E.B. Guglya, A. Balakireva, N.
Sytov, A. Bezlikhotnova, D.I. Boldyreva, V.V. Babenko, F. Kondrashov, V.V. Choob,
D. Orzaez, I.V. Yampolsky, A.S. Mishin, K.S. Sarkisyan, Science Advances 10 (2024).
date_created: 2024-03-25T08:54:33Z
date_published: 2024-03-01T00:00:00Z
date_updated: 2024-03-25T09:44:53Z
day: '01'
ddc:
- '580'
department:
- _id: FyKo
doi: 10.1126/sciadv.adk1992
file:
- access_level: open_access
checksum: a19c43b260ea0bbaf895a29712e3153c
content_type: application/pdf
creator: dernst
date_created: 2024-03-25T09:42:10Z
date_updated: 2024-03-25T09:42:10Z
file_id: '15185'
file_name: 2024_ScienceAdv_Palkina.pdf
file_size: 1499302
relation: main_file
success: 1
file_date_updated: 2024-03-25T09:42:10Z
has_accepted_license: '1'
intvolume: ' 10'
issue: '10'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
publication: Science Advances
publication_identifier:
issn:
- 2375-2548
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: A hybrid pathway for self-sustained luminescence
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: 10
year: '2024'
...
---
_id: '15186'
abstract:
- lang: eng
text: The elimination of rain evaporation in the planetary boundary layer (PBL)
has been found to lead to convective self‐aggregation (CSA) even without radiative
feedback, but the precise mechanisms underlying this phenomenon remain unclear.
We conducted cloud‐resolving simulations with two domain sizes and progressively
reduced rain evaporation in the PBL. Surprisingly, CSA only occurred when rain
evaporation was almost completely removed. The additional convective heating resulting
from the reduction of evaporative cooling in the moist patch was found to be the
trigger, thereafter a dry subsidence intrusion into the PBL in the dry patch takes
over and sets CSA in motion. Temperature and moisture anomalies oppose each other
in their buoyancy effects, hence explaining the need for almost total rain evaporation
removal. We also found radiative cooling and not cold pools to be the leading
cause for the comparative ease of CSA to take place in the larger domain.
acknowledgement: "YLH is supported by funding from the European Union's Horizon 2020
research and innovation programme under the Marie Skłodowska-Curie Grant 101034413.
CM gratefully acknowledges funding from the European Research Council (ERC) under
the European Union's Horizon 2020 research and innovation program (Project CLUSTER,
Grant 805041). The authors warmly thank Steven Sherwood, Jiawei Bao, Bidyut Goswami,
and Martin Janssens for stimulating and helpful discussions. They also thank Christopher
Holloway and an anonymous reviewer for providing helpful feedback that greatly improved
this manuscript.\r\n"
article_number: ' e2023GL106523'
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Yi-Ling
full_name: Hwong, Yi-Ling
id: 1217aa61-4dd1-11ec-9ac3-f2ba3f17ee22
last_name: Hwong
orcid: 0000-0001-9281-3479
- first_name: Caroline J
full_name: Muller, Caroline J
id: f978ccb0-3f7f-11eb-b193-b0e2bd13182b
last_name: Muller
orcid: 0000-0001-5836-5350
citation:
ama: Hwong Y-L, Muller CJ. The unreasonable efficiency of total rain evaporation
removal in triggering convective self‐aggregation. Geophysical Research Letters.
2024;51(6). doi:10.1029/2023gl106523
apa: Hwong, Y.-L., & Muller, C. J. (2024). The unreasonable efficiency of total
rain evaporation removal in triggering convective self‐aggregation. Geophysical
Research Letters. American Geophysical Union. https://doi.org/10.1029/2023gl106523
chicago: Hwong, Yi-Ling, and Caroline J Muller. “The Unreasonable Efficiency of
Total Rain Evaporation Removal in Triggering Convective Self‐aggregation.” Geophysical
Research Letters. American Geophysical Union, 2024. https://doi.org/10.1029/2023gl106523.
ieee: Y.-L. Hwong and C. J. Muller, “The unreasonable efficiency of total rain evaporation
removal in triggering convective self‐aggregation,” Geophysical Research Letters,
vol. 51, no. 6. American Geophysical Union, 2024.
ista: Hwong Y-L, Muller CJ. 2024. The unreasonable efficiency of total rain evaporation
removal in triggering convective self‐aggregation. Geophysical Research Letters.
51(6), e2023GL106523.
mla: Hwong, Yi-Ling, and Caroline J. Muller. “The Unreasonable Efficiency of Total
Rain Evaporation Removal in Triggering Convective Self‐aggregation.” Geophysical
Research Letters, vol. 51, no. 6, e2023GL106523, American Geophysical Union,
2024, doi:10.1029/2023gl106523.
short: Y.-L. Hwong, C.J. Muller, Geophysical Research Letters 51 (2024).
date_created: 2024-03-25T10:27:30Z
date_published: 2024-03-19T00:00:00Z
date_updated: 2024-03-25T11:32:06Z
day: '19'
ddc:
- '550'
department:
- _id: CaMu
doi: 10.1029/2023gl106523
ec_funded: 1
file:
- access_level: open_access
checksum: eacb011091a503b9e7b748fef639ba4c
content_type: application/pdf
creator: dernst
date_created: 2024-03-25T11:28:25Z
date_updated: 2024-03-25T11:28:25Z
file_id: '15187'
file_name: 2024_GeophysResLetters_Hwong.pdf
file_size: 1280108
relation: main_file
success: 1
file_date_updated: 2024-03-25T11:28:25Z
has_accepted_license: '1'
intvolume: ' 51'
issue: '6'
keyword:
- General Earth and Planetary Sciences
- Geophysics
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '03'
oa: 1
oa_version: Published Version
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
- _id: 629205d8-2b32-11ec-9570-e1356ff73576
call_identifier: H2020
grant_number: '805041'
name: organization of CLoUdS, and implications of Tropical cyclones and for the
Energetics of the tropics, in current and waRming climate
publication: Geophysical Research Letters
publication_identifier:
eissn:
- 1944-8007
issn:
- 0094-8276
publication_status: published
publisher: American Geophysical Union
quality_controlled: '1'
status: public
title: The unreasonable efficiency of total rain evaporation removal in triggering
convective self‐aggregation
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: 51
year: '2024'
...
---
_id: '15181'
abstract:
- lang: eng
text: We demonstrate the failure of the adiabatic Born-Oppenheimer approximation
to describe the ground state of a quantum impurity within an ultracold Fermi gas
despite substantial mass differences between the bath and impurity species. Increasing
repulsion leads to the appearance of nonadiabatic couplings between the fast bath
and slow impurity degrees of freedom, which reduce the parity symmetry of the
latter according to the pseudo Jahn-Teller effect. The presence of this mechanism
is associated to a conical intersection involving the impurity position and the
inverse of the interaction strength, which acts as a synthetic dimension. We elucidate
the presence of these effects via a detailed ground-state analysis involving the
comparison of ab initio fully correlated simulations with effective models. Our
study suggests ultracold atomic ensembles as potent emulators of complex molecular
phenomena.
acknowledgement: "This work has been funded by the Cluster of Excellence “Advanced
Imaging of Matter” of the Deutsche Forschungsgemeinschaft (DFG) - EXC 2056 - Project
ID 390715994.\r\nG.M.K. gratefully acknowledges funding from the European Union’s
Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie
Grant Agreement No. 101034413."
article_number: '013257'
article_processing_charge: Yes
article_type: original
author:
- first_name: A.
full_name: Becker, A.
last_name: Becker
- first_name: Georgios
full_name: Koutentakis, Georgios
id: d7b23d3a-9e21-11ec-b482-f76739596b95
last_name: Koutentakis
- first_name: P.
full_name: Schmelcher, P.
last_name: Schmelcher
citation:
ama: Becker A, Koutentakis G, Schmelcher P. Synthetic dimension-induced pseudo Jahn-Teller
effect in one-dimensional confined fermions. Physical Review Research.
2024;6(1). doi:10.1103/physrevresearch.6.013257
apa: Becker, A., Koutentakis, G., & Schmelcher, P. (2024). Synthetic dimension-induced
pseudo Jahn-Teller effect in one-dimensional confined fermions. Physical Review
Research. American Physical Society. https://doi.org/10.1103/physrevresearch.6.013257
chicago: Becker, A., Georgios Koutentakis, and P. Schmelcher. “Synthetic Dimension-Induced
Pseudo Jahn-Teller Effect in One-Dimensional Confined Fermions.” Physical Review
Research. American Physical Society, 2024. https://doi.org/10.1103/physrevresearch.6.013257.
ieee: A. Becker, G. Koutentakis, and P. Schmelcher, “Synthetic dimension-induced
pseudo Jahn-Teller effect in one-dimensional confined fermions,” Physical Review
Research, vol. 6, no. 1. American Physical Society, 2024.
ista: Becker A, Koutentakis G, Schmelcher P. 2024. Synthetic dimension-induced pseudo
Jahn-Teller effect in one-dimensional confined fermions. Physical Review Research.
6(1), 013257.
mla: Becker, A., et al. “Synthetic Dimension-Induced Pseudo Jahn-Teller Effect in
One-Dimensional Confined Fermions.” Physical Review Research, vol. 6, no.
1, 013257, American Physical Society, 2024, doi:10.1103/physrevresearch.6.013257.
short: A. Becker, G. Koutentakis, P. Schmelcher, Physical Review Research 6 (2024).
date_created: 2024-03-25T08:57:07Z
date_published: 2024-03-01T00:00:00Z
date_updated: 2024-03-25T09:27:37Z
day: '01'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.1103/physrevresearch.6.013257
ec_funded: 1
external_id:
arxiv:
- '2310.17995'
file:
- access_level: open_access
checksum: 4e0e58d1f58386fb016284c84db2a300
content_type: application/pdf
creator: dernst
date_created: 2024-03-25T09:24:55Z
date_updated: 2024-03-25T09:24:55Z
file_id: '15183'
file_name: 2024_PhysicalReviewResearch_Becker.pdf
file_size: 2207067
relation: main_file
success: 1
file_date_updated: 2024-03-25T09:24:55Z
has_accepted_license: '1'
intvolume: ' 6'
issue: '1'
language:
- iso: eng
month: '03'
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: Physical Review Research
publication_identifier:
issn:
- 2643-1564
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Synthetic dimension-induced pseudo Jahn-Teller effect in one-dimensional confined
fermions
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2024'
...
---
_id: '15182'
abstract:
- lang: eng
text: Thermoelectric materials convert heat into electricity, with a broad range
of applications near room temperature (RT). However, the library of RT high-performance
materials is limited. Traditional high-temperature synthetic methods constrain
the range of materials achievable, hindering the ability to surpass crystal structure
limitations and engineer defects. Here, a solution-based synthetic approach is
introduced, enabling RT synthesis of powders and exploration of densification
at lower temperatures to influence the material's microstructure. The approach
is exemplified by Ag2Se, an n-type alternative to bismuth telluride. It is demonstrated
that the concentration of Ag interstitials, grain boundaries, and dislocations
are directly correlated to the sintering temperature, and achieve a figure of
merit of 1.1 from RT to 100 °C after optimization. Moreover, insights into and
resolve Ag2Se's challenges are provided, including stoichiometry issues leading
to irreproducible performances. This work highlights the potential of RT solution
synthesis in expanding the repertoire of high-performance thermoelectric materials
for practical applications.
acknowledged_ssus:
- _id: EM-Fac
- _id: LifeSc
- _id: NanoFab
acknowledgement: This work was supported by the Scientific Service Units (SSU) of
ISTA through resources provided by the Electron Microscopy Facility (EMF), the Lab
Support Facility (LSF), and the Nanofabrication Facility (NNF). This work was financially
supported by ISTA and the Werner Siemens Foundation. The USTEM Service Unit of the
Technical University of Vienna is acknowledged for EBSD sample preparation and analysis.
R.L.B. acknowledges the National Science Foundation for funding the mass spectrometry
analysis under award DMR 1904719. J.L. is a Serra Húnter Fellow and is grateful
to the ICREA Academia program and projects MICINN/FEDER PID2021-124572OB-C31 and
GC 2021 SGR 01061.
article_number: '2400408'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Tobias
full_name: Kleinhanns, Tobias
id: 8BD9DE16-AB3C-11E9-9C8C-2A03E6697425
last_name: Kleinhanns
- first_name: Francesco
full_name: Milillo, Francesco
id: 38b830db-ea88-11ee-bf9b-929beaf79054
last_name: Milillo
- first_name: Mariano
full_name: Calcabrini, Mariano
id: 45D7531A-F248-11E8-B48F-1D18A9856A87
last_name: Calcabrini
orcid: 0000-0003-4566-5877
- first_name: Christine
full_name: Fiedler, Christine
id: bd3fceba-dc74-11ea-a0a7-c17f71817366
last_name: Fiedler
- first_name: Sharona
full_name: Horta, Sharona
id: 03a7e858-01b1-11ec-8b71-99ae6c4a05bc
last_name: Horta
- first_name: Daniel
full_name: Balazs, Daniel
id: 302BADF6-85FC-11EA-9E3B-B9493DDC885E
last_name: Balazs
orcid: 0000-0001-7597-043X
- first_name: Marissa J.
full_name: Strumolo, Marissa J.
last_name: Strumolo
- first_name: Roger
full_name: Hasler, Roger
last_name: Hasler
- first_name: Jordi
full_name: Llorca, Jordi
last_name: Llorca
- first_name: Michael
full_name: Tkadletz, Michael
last_name: Tkadletz
- first_name: Richard L.
full_name: Brutchey, Richard L.
last_name: Brutchey
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
citation:
ama: 'Kleinhanns T, Milillo F, Calcabrini M, et al. A route to high thermoelectric
performance: Solution‐based control of microstructure and composition in Ag2Se.
Advanced Energy Materials. 2024. doi:10.1002/aenm.202400408'
apa: 'Kleinhanns, T., Milillo, F., Calcabrini, M., Fiedler, C., Horta, S., Balazs,
D., … Ibáñez, M. (2024). A route to high thermoelectric performance: Solution‐based
control of microstructure and composition in Ag2Se. Advanced Energy Materials.
Wiley. https://doi.org/10.1002/aenm.202400408'
chicago: 'Kleinhanns, Tobias, Francesco Milillo, Mariano Calcabrini, Christine Fiedler,
Sharona Horta, Daniel Balazs, Marissa J. Strumolo, et al. “A Route to High Thermoelectric
Performance: Solution‐based Control of Microstructure and Composition in Ag2Se.”
Advanced Energy Materials. Wiley, 2024. https://doi.org/10.1002/aenm.202400408.'
ieee: 'T. Kleinhanns et al., “A route to high thermoelectric performance:
Solution‐based control of microstructure and composition in Ag2Se,” Advanced
Energy Materials. Wiley, 2024.'
ista: 'Kleinhanns T, Milillo F, Calcabrini M, Fiedler C, Horta S, Balazs D, Strumolo
MJ, Hasler R, Llorca J, Tkadletz M, Brutchey RL, Ibáñez M. 2024. A route to high
thermoelectric performance: Solution‐based control of microstructure and composition
in Ag2Se. Advanced Energy Materials., 2400408.'
mla: 'Kleinhanns, Tobias, et al. “A Route to High Thermoelectric Performance: Solution‐based
Control of Microstructure and Composition in Ag2Se.” Advanced Energy Materials,
2400408, Wiley, 2024, doi:10.1002/aenm.202400408.'
short: T. Kleinhanns, F. Milillo, M. Calcabrini, C. Fiedler, S. Horta, D. Balazs,
M.J. Strumolo, R. Hasler, J. Llorca, M. Tkadletz, R.L. Brutchey, M. Ibáñez, Advanced
Energy Materials (2024).
date_created: 2024-03-25T08:57:40Z
date_published: 2024-03-13T00:00:00Z
date_updated: 2024-03-25T09:21:05Z
day: '13'
department:
- _id: MaIb
- _id: LifeSc
doi: 10.1002/aenm.202400408
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1002/aenm.202400408
month: '03'
oa: 1
oa_version: Published Version
project:
- _id: 9B8F7476-BA93-11EA-9121-9846C619BF3A
name: 'HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of
Semiconductors for Waste Heat Recovery'
publication: Advanced Energy Materials
publication_identifier:
eissn:
- 1614-6840
issn:
- 1614-6832
publication_status: epub_ahead
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'A route to high thermoelectric performance: Solution‐based control of microstructure
and composition in Ag2Se'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2024'
...
---
_id: '15165'
abstract:
- lang: eng
text: Current knowledge suggests a drought Indian monsoon (perhaps a severe one)
when the El Nino Southern Oscillation and Pacific Decadal Oscillation each exhibit
positive phases (a joint positive phase). For the monsoons, which are exceptions
in this regard, we found northeast India often gets excess pre-monsoon rainfall.
Further investigation reveals that this excess pre-monsoon rainfall is produced
by the interaction of the large-scale circulation associated with the joint phase
with the mountains in northeast India. We posit that a warmer troposphere, a consequence
of excess rainfall over northeast India, drives a stronger monsoon circulation
and enhances monsoon rainfall over central India. Hence, we argue that pre-monsoon
rainfall over northeast India can be used for seasonal monsoon rainfall prediction
over central India. Most importantly, its predictive value is at its peak when
the Pacific Ocean exhibits a joint positive phase and the threat of extreme drought
monsoon looms over India.
acknowledgement: The author gratefully acknowledges ISTA for supporting this research
through funding from the European Research Council (ERC) under the European Union’s
Horizon 2020 research and innovation programme (Project CLUSTER, grant agreement
No. 805041).
article_number: e2023GL106569
article_processing_charge: Yes
article_type: original
author:
- first_name: Bidyut B
full_name: Goswami, Bidyut B
id: 3a4ac09c-6d61-11ec-bf66-884cde66b64b
last_name: Goswami
orcid: 0000-0001-8602-3083
citation:
ama: GOSWAMI BB. A pre-monsoon signal of false alarms of Indian monsoon droughts.
Geophysical Research Letters. 2024;51(5). doi:10.1029/2023GL106569
apa: GOSWAMI, B. B. (2024). A pre-monsoon signal of false alarms of Indian monsoon
droughts. Geophysical Research Letters. Wiley. https://doi.org/10.1029/2023GL106569
chicago: GOSWAMI, BIDYUT B. “A Pre-Monsoon Signal of False Alarms of Indian Monsoon
Droughts.” Geophysical Research Letters. Wiley, 2024. https://doi.org/10.1029/2023GL106569.
ieee: B. B. GOSWAMI, “A pre-monsoon signal of false alarms of Indian monsoon droughts,”
Geophysical Research Letters, vol. 51, no. 5. Wiley, 2024.
ista: GOSWAMI BB. 2024. A pre-monsoon signal of false alarms of Indian monsoon droughts.
Geophysical Research Letters. 51(5), e2023GL106569.
mla: GOSWAMI, BIDYUT B. “A Pre-Monsoon Signal of False Alarms of Indian Monsoon
Droughts.” Geophysical Research Letters, vol. 51, no. 5, e2023GL106569,
Wiley, 2024, doi:10.1029/2023GL106569.
short: B.B. GOSWAMI, Geophysical Research Letters 51 (2024).
date_created: 2024-03-24T23:00:58Z
date_published: 2024-03-16T00:00:00Z
date_updated: 2024-03-25T10:00:57Z
day: '16'
ddc:
- '550'
department:
- _id: CaMu
doi: 10.1029/2023GL106569
ec_funded: 1
file:
- access_level: open_access
checksum: 243bd966aca968ec7d9e474af8639f8d
content_type: application/pdf
creator: dernst
date_created: 2024-03-25T08:36:00Z
date_updated: 2024-03-25T08:36:00Z
file_id: '15178'
file_name: 2024_GeophysResLetters_Goswami.pdf
file_size: 2887134
relation: main_file
success: 1
file_date_updated: 2024-03-25T08:36:00Z
has_accepted_license: '1'
intvolume: ' 51'
issue: '5'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
project:
- _id: 629205d8-2b32-11ec-9570-e1356ff73576
call_identifier: H2020
grant_number: '805041'
name: organization of CLoUdS, and implications of Tropical cyclones and for the
Energetics of the tropics, in current and waRming climate
publication: Geophysical Research Letters
publication_identifier:
eissn:
- 1944-8007
issn:
- 0094-8276
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: A pre-monsoon signal of false alarms of Indian monsoon droughts
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: 51
year: '2024'
...
---
_id: '15166'
abstract:
- lang: eng
text: Reducing defects boosts room-temperature performance of a thermoelectric device
acknowledgement: The authors thank the Werner-Siemens-Stiftung and the Institute of
Science and Technology Austria for financial support.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Navita
full_name: Navita, Navita
id: 6ebe278d-ba0b-11ee-8184-f34cdc671de4
last_name: Navita
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
citation:
ama: Jakhar N, Ibáñez M. Electron highways are cooler. Science. 2024;383(6688):1184.
doi:10.1126/science.ado4077
apa: Jakhar, N., & Ibáñez, M. (2024). Electron highways are cooler. Science.
American Association for the Advancement of Science. https://doi.org/10.1126/science.ado4077
chicago: Jakhar, Navita, and Maria Ibáñez. “Electron Highways Are Cooler.” Science.
American Association for the Advancement of Science, 2024. https://doi.org/10.1126/science.ado4077.
ieee: N. Jakhar and M. Ibáñez, “Electron highways are cooler,” Science, vol.
383, no. 6688. American Association for the Advancement of Science, p. 1184, 2024.
ista: Jakhar N, Ibáñez M. 2024. Electron highways are cooler. Science. 383(6688),
1184.
mla: Jakhar, Navita, and Maria Ibáñez. “Electron Highways Are Cooler.” Science,
vol. 383, no. 6688, American Association for the Advancement of Science, 2024,
p. 1184, doi:10.1126/science.ado4077.
short: N. Jakhar, M. Ibáñez, Science 383 (2024) 1184.
date_created: 2024-03-24T23:00:58Z
date_published: 2024-03-14T00:00:00Z
date_updated: 2024-03-25T10:31:20Z
day: '14'
department:
- _id: MaIb
doi: 10.1126/science.ado4077
intvolume: ' 383'
issue: '6688'
language:
- iso: eng
month: '03'
oa_version: None
page: '1184'
project:
- _id: 9B8F7476-BA93-11EA-9121-9846C619BF3A
name: 'HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of
Semiconductors for Waste Heat Recovery'
publication: Science
publication_identifier:
eissn:
- 1095-9203
issn:
- 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: Electron highways are cooler
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 383
year: '2024'
...
---
_id: '15146'
abstract:
- lang: eng
text: The extracellular matrix (ECM) serves as a scaffold for cells and plays an
essential role in regulating numerous cellular processes, including cell migration
and proliferation. Due to limitations in specimen preparation for conventional
room-temperature electron microscopy, we lack structural knowledge on how ECM
components are secreted, remodeled, and interact with surrounding cells. We have
developed a 3D-ECM platform compatible with sample thinning by cryo-focused ion
beam milling, the lift-out extraction procedure, and cryo-electron tomography.
Our workflow implements cell-derived matrices (CDMs) grown on EM grids, resulting
in a versatile tool closely mimicking ECM environments. This allows us to visualize
ECM for the first time in its hydrated, native context. Our data reveal an intricate
network of extracellular fibers, their positioning relative to matrix-secreting
cells, and previously unresolved structural entities. Our workflow and results
add to the structural atlas of the ECM, providing novel insights into its secretion
and assembly.
acknowledged_ssus:
- _id: LifeSc
- _id: ScienComp
- _id: EM-Fac
- _id: M-Shop
acknowledgement: "Open Access funding provided by IST Austria. We thank Armel Nicolas
and his team at the ISTA proteomics facility, Alois Schloegl, Stefano Elefante,
and colleagues at the ISTA Scientific Computing facility, Tommaso Constanzo and
Ludek Lovicar at the Electron Microsocpy Facility (EMF), and Thomas Menner at the
Miba Machine shop for their support. We also thank Wanda Kukulski (University of
Bern) as well as Darío Porley, Andreas Thader, and other members of the Schur group
for helpful discussions. Matt Swulius and Jessica Heebner provided great support
in using Dragonfly. We thank Dorotea Fracciolla (Art & Science) for support in figure
illustration.\r\n\r\nThis research was supported by the Scientific Service Units
of ISTA through resources provided by Scientific Computing, the Lab Support Facility,
and the Electron Microscopy Facility. We acknowledge funding support from the following
sources: Austrian Science Fund (FWF) grant P33367 (to F.K.M. Schur), the Federation
of European Biochemical Societies (to F.K.M. Schur), Niederösterreich (NÖ) Fonds
(to B. Zens), FWF grant E435 (to J.M. Hansen), European Research Council under the
European Union’s Horizon 2020 research (grant agreement No. 724373) (to M. Sixt),
and Jenny and Antti Wihuri Foundation (to J. Alanko). This publication has been
made possible in part by CZI grant DAF2021-234754 and grant DOI https://doi.org/10.37921/812628ebpcwg
from the Chan Zuckerberg Initiative DAF, an advised fund of Silicon Valley Community
Foundation (to F.K.M. Schur)."
article_number: e202309125
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Bettina
full_name: Zens, Bettina
id: 45FD126C-F248-11E8-B48F-1D18A9856A87
last_name: Zens
- 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: Jesse
full_name: Hansen, Jesse
id: 1063c618-6f9b-11ec-9123-f912fccded63
last_name: Hansen
- first_name: Robert
full_name: Hauschild, Robert
id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
last_name: Hauschild
orcid: 0000-0001-9843-3522
- first_name: Julia
full_name: Datler, Julia
id: 3B12E2E6-F248-11E8-B48F-1D18A9856A87
last_name: Datler
orcid: 0000-0002-3616-8580
- first_name: Victor-Valentin
full_name: Hodirnau, Victor-Valentin
id: 3661B498-F248-11E8-B48F-1D18A9856A87
last_name: Hodirnau
- first_name: Vanessa
full_name: Zheden, Vanessa
id: 39C5A68A-F248-11E8-B48F-1D18A9856A87
last_name: Zheden
orcid: 0000-0002-9438-4783
- first_name: Jonna H
full_name: Alanko, Jonna H
id: 2CC12E8C-F248-11E8-B48F-1D18A9856A87
last_name: Alanko
orcid: 0000-0002-7698-3061
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- 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: Zens B, Fäßler F, Hansen J, et al. Lift-out cryo-FIBSEM and cryo-ET reveal
the ultrastructural landscape of extracellular matrix. Journal of Cell Biology.
2024;223(6). doi:10.1083/jcb.202309125
apa: Zens, B., Fäßler, F., Hansen, J., Hauschild, R., Datler, J., Hodirnau, V.-V.,
… Schur, F. K. (2024). Lift-out cryo-FIBSEM and cryo-ET reveal the ultrastructural
landscape of extracellular matrix. Journal of Cell Biology. Rockefeller
University Press. https://doi.org/10.1083/jcb.202309125
chicago: Zens, Bettina, Florian Fäßler, Jesse Hansen, Robert Hauschild, Julia Datler,
Victor-Valentin Hodirnau, Vanessa Zheden, Jonna H Alanko, Michael K Sixt, and
Florian KM Schur. “Lift-out Cryo-FIBSEM and Cryo-ET Reveal the Ultrastructural
Landscape of Extracellular Matrix.” Journal of Cell Biology. Rockefeller
University Press, 2024. https://doi.org/10.1083/jcb.202309125.
ieee: B. Zens et al., “Lift-out cryo-FIBSEM and cryo-ET reveal the ultrastructural
landscape of extracellular matrix,” Journal of Cell Biology, vol. 223,
no. 6. Rockefeller University Press, 2024.
ista: Zens B, Fäßler F, Hansen J, Hauschild R, Datler J, Hodirnau V-V, Zheden V,
Alanko JH, Sixt MK, Schur FK. 2024. Lift-out cryo-FIBSEM and cryo-ET reveal the
ultrastructural landscape of extracellular matrix. Journal of Cell Biology. 223(6),
e202309125.
mla: Zens, Bettina, et al. “Lift-out Cryo-FIBSEM and Cryo-ET Reveal the Ultrastructural
Landscape of Extracellular Matrix.” Journal of Cell Biology, vol. 223,
no. 6, e202309125, Rockefeller University Press, 2024, doi:10.1083/jcb.202309125.
short: B. Zens, F. Fäßler, J. Hansen, R. Hauschild, J. Datler, V.-V. Hodirnau, V.
Zheden, J.H. Alanko, M.K. Sixt, F.K. Schur, Journal of Cell Biology 223 (2024).
date_created: 2024-03-21T06:45:51Z
date_published: 2024-03-20T00:00:00Z
date_updated: 2024-03-25T13:03:57Z
day: '20'
ddc:
- '570'
department:
- _id: FlSc
- _id: MiSi
- _id: Bio
- _id: EM-Fac
doi: 10.1083/jcb.202309125
ec_funded: 1
external_id:
pmid:
- '38506714'
file:
- access_level: open_access
checksum: 90d1984a93660735e506c2a304bc3f73
content_type: application/pdf
creator: dernst
date_created: 2024-03-25T12:52:04Z
date_updated: 2024-03-25T12:52:04Z
file_id: '15188'
file_name: 2024_JCB_Zens.pdf
file_size: 11907016
relation: main_file
success: 1
file_date_updated: 2024-03-25T12:52:04Z
has_accepted_license: '1'
intvolume: ' 223'
issue: '6'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 9B954C5C-BA93-11EA-9121-9846C619BF3A
grant_number: P33367
name: Structure and isoform diversity of the Arp2/3 complex
- _id: 7bd318a1-9f16-11ee-852c-cc9217763180
grant_number: E435
name: In Situ Actin Structures via Hybrid Cryo-electron Microscopy
- _id: 25FE9508-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '724373'
name: Cellular navigation along spatial gradients
- _id: 059B463C-7A3F-11EA-A408-12923DDC885E
name: NÖ-Fonds Preis für die Jungforscherin des Jahres am IST Austria
- _id: 2615199A-B435-11E9-9278-68D0E5697425
grant_number: '21317'
name: Spatiotemporal regulation of chemokine-induced signalling in leukocyte chemotaxis
- _id: 62909c6f-2b32-11ec-9570-e1476aab5308
grant_number: CZI01
name: CryoMinflux-guided in-situ visual proteomics and structure determination
publication: Journal of Cell Biology
publication_identifier:
eissn:
- 1540-8140
issn:
- 0021-9525
publication_status: published
publisher: Rockefeller University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Lift-out cryo-FIBSEM and cryo-ET reveal the ultrastructural landscape of extracellular
matrix
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: 223
year: '2024'
...
---
_id: '12428'
abstract:
- lang: eng
text: The mammary gland consists of a bilayered epithelial structure with an extensively
branched morphology. The majority of this epithelial tree is laid down during
puberty, during which actively proliferating terminal end buds repeatedly elongate
and bifurcate to form the basic structure of the ductal tree. Mammary ducts consist
of a basal and luminal cell layer with a multitude of identified sub-lineages
within both layers. The understanding of how these different cell lineages are
cooperatively driving branching morphogenesis is a problem of crossing multiple
scales, as this requires information on the macroscopic branched structure of
the gland, as well as data on single-cell dynamics driving the morphogenic program.
Here we describe a method to combine genetic lineage tracing with whole-gland
branching analysis. Quantitative data on the global organ structure can be used
to derive a model for mammary gland branching morphogenesis and provide a backbone
on which the dynamics of individual cell lineages can be simulated and compared
to lineage-tracing approaches. Eventually, these quantitative models and experiments
allow to understand the couplings between the macroscopic shape of the mammary
gland and the underlying single-cell dynamics driving branching morphogenesis.
alternative_title:
- Methods in Molecular Biology
article_processing_charge: No
author:
- first_name: Edouard B
full_name: Hannezo, Edouard B
id: 3A9DB764-F248-11E8-B48F-1D18A9856A87
last_name: Hannezo
orcid: 0000-0001-6005-1561
- first_name: Colinda L.G.J.
full_name: Scheele, Colinda L.G.J.
last_name: Scheele
citation:
ama: 'Hannezo EB, Scheele CLGJ. A Guide Toward Multi-scale and Quantitative Branching
Analysis in the Mammary Gland. In: Margadant C, ed. Cell Migration in Three
Dimensions. Vol 2608. MIMB. Springer Nature; 2023:183-205. doi:10.1007/978-1-0716-2887-4_12'
apa: Hannezo, E. B., & Scheele, C. L. G. J. (2023). A Guide Toward Multi-scale
and Quantitative Branching Analysis in the Mammary Gland. In C. Margadant (Ed.),
Cell Migration in Three Dimensions (Vol. 2608, pp. 183–205). Springer Nature.
https://doi.org/10.1007/978-1-0716-2887-4_12
chicago: Hannezo, Edouard B, and Colinda L.G.J. Scheele. “A Guide Toward Multi-Scale
and Quantitative Branching Analysis in the Mammary Gland.” In Cell Migration
in Three Dimensions, edited by Coert Margadant, 2608:183–205. MIMB. Springer
Nature, 2023. https://doi.org/10.1007/978-1-0716-2887-4_12.
ieee: E. B. Hannezo and C. L. G. J. Scheele, “A Guide Toward Multi-scale and Quantitative
Branching Analysis in the Mammary Gland,” in Cell Migration in Three Dimensions,
vol. 2608, C. Margadant, Ed. Springer Nature, 2023, pp. 183–205.
ista: 'Hannezo EB, Scheele CLGJ. 2023.A Guide Toward Multi-scale and Quantitative
Branching Analysis in the Mammary Gland. In: Cell Migration in Three Dimensions.
Methods in Molecular Biology, vol. 2608, 183–205.'
mla: Hannezo, Edouard B., and Colinda L. G. J. Scheele. “A Guide Toward Multi-Scale
and Quantitative Branching Analysis in the Mammary Gland.” Cell Migration in
Three Dimensions, edited by Coert Margadant, vol. 2608, Springer Nature, 2023,
pp. 183–205, doi:10.1007/978-1-0716-2887-4_12.
short: E.B. Hannezo, C.L.G.J. Scheele, in:, C. Margadant (Ed.), Cell Migration in
Three Dimensions, Springer Nature, 2023, pp. 183–205.
date_created: 2023-01-29T23:00:58Z
date_published: 2023-01-19T00:00:00Z
date_updated: 2023-02-03T10:58:56Z
day: '19'
ddc:
- '570'
department:
- _id: EdHa
doi: 10.1007/978-1-0716-2887-4_12
editor:
- first_name: Coert
full_name: Margadant, Coert
last_name: Margadant
external_id:
pmid:
- '36653709'
file:
- access_level: open_access
checksum: aec1b8d3ba938ddf9d8fcb777f3c38ee
content_type: application/pdf
creator: dernst
date_created: 2023-02-03T10:56:39Z
date_updated: 2023-02-03T10:56:39Z
file_id: '12500'
file_name: 2023_MIMB_Hannezo.pdf
file_size: 826598
relation: main_file
success: 1
file_date_updated: 2023-02-03T10:56:39Z
has_accepted_license: '1'
intvolume: ' 2608'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 183-205
pmid: 1
publication: Cell Migration in Three Dimensions
publication_identifier:
eisbn:
- '9781071628874'
eissn:
- 1940-6029
isbn:
- '9781071628867'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: MIMB
status: public
title: A Guide Toward Multi-scale and Quantitative Branching Analysis in the Mammary
Gland
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: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2608
year: '2023'
...
---
_id: '12534'
abstract:
- lang: eng
text: Brownian motion of a mobile impurity in a bath is affected by spin-orbit coupling
(SOC). Here, we discuss a Caldeira-Leggett-type model that can be used to propose
and interpret quantum simulators of this problem in cold Bose gases. First, we
derive a master equation that describes the model and explore it in a one-dimensional
(1D) setting. To validate the standard assumptions needed for our derivation,
we analyze available experimental data without SOC; as a byproduct, this analysis
suggests that the quench dynamics of the impurity is beyond the 1D Bose-polaron
approach at temperatures currently accessible in a cold-atom laboratory—motion
of the impurity is mainly driven by dissipation. For systems with SOC, we demonstrate
that 1D spin-orbit coupling can be gauged out even in the presence of dissipation—the
information about SOC is incorporated in the initial conditions. Observables sensitive
to this information (such as spin densities) can be used to study formation of
steady spin polarization domains during quench dynamics.
acknowledgement: "We thank Rafael Barfknecht for help at the initial stages of this
project; Fabian Brauneis for useful discussions; Miguel A. Garcia-March, Georgios
Koutentakis, and Simeon Mistakidis\r\nfor comments on the paper. M.L. acknowledges
support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON)."
article_number: '013029'
article_processing_charge: No
article_type: original
author:
- first_name: Areg
full_name: Ghazaryan, Areg
id: 4AF46FD6-F248-11E8-B48F-1D18A9856A87
last_name: Ghazaryan
orcid: 0000-0001-9666-3543
- first_name: Alberto
full_name: Cappellaro, Alberto
id: 9d13b3cb-30a2-11eb-80dc-f772505e8660
last_name: Cappellaro
orcid: 0000-0001-6110-2359
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
- first_name: Artem
full_name: Volosniev, Artem
id: 37D278BC-F248-11E8-B48F-1D18A9856A87
last_name: Volosniev
orcid: 0000-0003-0393-5525
citation:
ama: Ghazaryan A, Cappellaro A, Lemeshko M, Volosniev A. Dissipative dynamics of
an impurity with spin-orbit coupling. Physical Review Research. 2023;5(1).
doi:10.1103/physrevresearch.5.013029
apa: Ghazaryan, A., Cappellaro, A., Lemeshko, M., & Volosniev, A. (2023). Dissipative
dynamics of an impurity with spin-orbit coupling. Physical Review Research.
American Physical Society. https://doi.org/10.1103/physrevresearch.5.013029
chicago: Ghazaryan, Areg, Alberto Cappellaro, Mikhail Lemeshko, and Artem Volosniev.
“Dissipative Dynamics of an Impurity with Spin-Orbit Coupling.” Physical Review
Research. American Physical Society, 2023. https://doi.org/10.1103/physrevresearch.5.013029.
ieee: A. Ghazaryan, A. Cappellaro, M. Lemeshko, and A. Volosniev, “Dissipative dynamics
of an impurity with spin-orbit coupling,” Physical Review Research, vol.
5, no. 1. American Physical Society, 2023.
ista: Ghazaryan A, Cappellaro A, Lemeshko M, Volosniev A. 2023. Dissipative dynamics
of an impurity with spin-orbit coupling. Physical Review Research. 5(1), 013029.
mla: Ghazaryan, Areg, et al. “Dissipative Dynamics of an Impurity with Spin-Orbit
Coupling.” Physical Review Research, vol. 5, no. 1, 013029, American Physical
Society, 2023, doi:10.1103/physrevresearch.5.013029.
short: A. Ghazaryan, A. Cappellaro, M. Lemeshko, A. Volosniev, Physical Review Research
5 (2023).
date_created: 2023-02-10T09:02:26Z
date_published: 2023-01-20T00:00:00Z
date_updated: 2023-02-20T07:02:00Z
day: '20'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.1103/physrevresearch.5.013029
ec_funded: 1
file:
- access_level: open_access
checksum: 6068b62874c0099628a108bb9c5c6bd2
content_type: application/pdf
creator: dernst
date_created: 2023-02-13T10:38:10Z
date_updated: 2023-02-13T10:38:10Z
file_id: '12546'
file_name: 2023_PhysicalReviewResearch_Ghazaryan.pdf
file_size: 865150
relation: main_file
success: 1
file_date_updated: 2023-02-13T10:38:10Z
has_accepted_license: '1'
intvolume: ' 5'
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 2688CF98-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '801770'
name: 'Angulon: physics and applications of a new quasiparticle'
publication: Physical Review Research
publication_identifier:
issn:
- 2643-1564
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dissipative dynamics of an impurity with spin-orbit coupling
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2023'
...
---
_id: '12158'
abstract:
- lang: eng
text: 'Post-translational histone modifications modulate chromatin activity to affect
gene expression. How chromatin states underlie lineage choice in single cells
is relatively unexplored. We develop sort-assisted single-cell chromatin immunocleavage
(sortChIC) and map active (H3K4me1 and H3K4me3) and repressive (H3K27me3 and H3K9me3)
histone modifications in the mouse bone marrow. During differentiation, hematopoietic
stem and progenitor cells (HSPCs) acquire active chromatin states mediated by
cell-type-specifying transcription factors, which are unique for each lineage.
By contrast, most alterations in repressive marks during differentiation occur
independent of the final cell type. Chromatin trajectory analysis shows that lineage
choice at the chromatin level occurs at the progenitor stage. Joint profiling
of H3K4me1 and H3K9me3 demonstrates that cell types within the myeloid lineage
have distinct active chromatin but share similar myeloid-specific heterochromatin
states. This implies a hierarchical regulation of chromatin during hematopoiesis:
heterochromatin dynamics distinguish differentiation trajectories and lineages,
while euchromatin dynamics reflect cell types within lineages.'
acknowledgement: We thank A. Giladi for sharing mRNA abundance tables of cell types
together with J. van den Berg for critical reading of the manuscript. We thank M.
Bartosovic for sharing method comparison data. pK19pA-MN was a gift from Ulrich
Laemmli (Addgene plasmid 86973, http://n2t.net/addgene:86973; RRID:Addgene_86973).
Figure 8 is adopted from Hematopoiesis (human) diagram by A. Rad and M. Häggström
under CC-BY-SA 3.0 license. This work was supported by European Research Council
Advanced under grant ERC-AdG 742225-IntScOmics and Nederlandse Organisatie voor
Wetenschappelijk Onderzoek (NWO) TOP award NWO-CW 714.016.001. The SNF (P2BSP3-174991),
HFSP (LT000209/2018-L) and Marie Skłodowska-Curie Actions (798573) supported P.Z.
The SNF (P2ELP3_184488) and HFSP (LT000097/2019-L) supported J.Y. and the EMBO LTF
(ALTF 1197–2019) supported V.B. This work is part of the Oncode Institute, which
is partly financed by the Dutch Cancer Society. The funders had no role in study
design, data collection and analysis, decision to publish or preparation of the
manuscript.
article_processing_charge: No
article_type: review
author:
- first_name: Peter
full_name: Zeller, Peter
last_name: Zeller
- first_name: Jake
full_name: Yeung, Jake
id: 123012b2-db30-11eb-b4d8-a35840c0551b
last_name: Yeung
orcid: 0000-0003-1732-1559
- first_name: Helena
full_name: Viñas Gaza, Helena
last_name: Viñas Gaza
- first_name: Buys Anton
full_name: de Barbanson, Buys Anton
last_name: de Barbanson
- first_name: Vivek
full_name: Bhardwaj, Vivek
last_name: Bhardwaj
- first_name: Maria
full_name: Florescu, Maria
last_name: Florescu
- first_name: Reinier
full_name: van der Linden, Reinier
last_name: van der Linden
- first_name: Alexander
full_name: van Oudenaarden, Alexander
last_name: van Oudenaarden
citation:
ama: Zeller P, Yeung J, Viñas Gaza H, et al. Single-cell sortChIC identifies hierarchical
chromatin dynamics during hematopoiesis. Nature Genetics. 2023;55:333-345.
doi:10.1038/s41588-022-01260-3
apa: Zeller, P., Yeung, J., Viñas Gaza, H., de Barbanson, B. A., Bhardwaj, V., Florescu,
M., … van Oudenaarden, A. (2023). Single-cell sortChIC identifies hierarchical
chromatin dynamics during hematopoiesis. Nature Genetics. Springer Nature.
https://doi.org/10.1038/s41588-022-01260-3
chicago: Zeller, Peter, Jake Yeung, Helena Viñas Gaza, Buys Anton de Barbanson,
Vivek Bhardwaj, Maria Florescu, Reinier van der Linden, and Alexander van Oudenaarden.
“Single-Cell SortChIC Identifies Hierarchical Chromatin Dynamics during Hematopoiesis.”
Nature Genetics. Springer Nature, 2023. https://doi.org/10.1038/s41588-022-01260-3.
ieee: P. Zeller et al., “Single-cell sortChIC identifies hierarchical chromatin
dynamics during hematopoiesis,” Nature Genetics, vol. 55. Springer Nature,
pp. 333–345, 2023.
ista: Zeller P, Yeung J, Viñas Gaza H, de Barbanson BA, Bhardwaj V, Florescu M,
van der Linden R, van Oudenaarden A. 2023. Single-cell sortChIC identifies hierarchical
chromatin dynamics during hematopoiesis. Nature Genetics. 55, 333–345.
mla: Zeller, Peter, et al. “Single-Cell SortChIC Identifies Hierarchical Chromatin
Dynamics during Hematopoiesis.” Nature Genetics, vol. 55, Springer Nature,
2023, pp. 333–45, doi:10.1038/s41588-022-01260-3.
short: P. Zeller, J. Yeung, H. Viñas Gaza, B.A. de Barbanson, V. Bhardwaj, M. Florescu,
R. van der Linden, A. van Oudenaarden, Nature Genetics 55 (2023) 333–345.
date_created: 2023-01-12T12:09:09Z
date_published: 2023-02-01T00:00:00Z
date_updated: 2023-02-27T07:48:24Z
day: '01'
ddc:
- '570'
- '000'
department:
- _id: ScienComp
doi: 10.1038/s41588-022-01260-3
file:
- access_level: open_access
checksum: 6fdb8e34fbeea63edd0f2c6c2cc5823e
content_type: application/pdf
creator: dernst
date_created: 2023-02-27T07:46:45Z
date_updated: 2023-02-27T07:46:45Z
file_id: '12688'
file_name: 2023_NatureGenetics_Zeller.pdf
file_size: 21484855
relation: main_file
success: 1
file_date_updated: 2023-02-27T07:46:45Z
has_accepted_license: '1'
intvolume: ' 55'
keyword:
- Genetics
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 333-345
publication: Nature Genetics
publication_identifier:
eissn:
- 1546-1718
issn:
- 1061-4036
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Single-cell sortChIC identifies hierarchical chromatin dynamics during hematopoiesis
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: 55
year: '2023'
...
---
_id: '12676'
abstract:
- lang: eng
text: Turn-based stochastic games (aka simple stochastic games) are two-player zero-sum
games played on directed graphs with probabilistic transitions. The goal of player-max
is to maximize the probability to reach a target state against the adversarial
player-min. These games lie in NP ∩ coNP and are among the rare combinatorial
problems that belong to this complexity class for which the existence of polynomial-time
algorithm is a major open question. While randomized sub-exponential time algorithm
exists, all known deterministic algorithms require exponential time in the worst-case.
An important open question has been whether faster algorithms can be obtained
parametrized by the treewidth of the game graph. Even deterministic sub-exponential
time algorithm for constant treewidth turn-based stochastic games has remain elusive.
In this work our main result is a deterministic algorithm to solve turn-based
stochastic games that, given a game with n states, treewidth at most t, and the
bit-complexity of the probabilistic transition function log D, has running time
O ((tn2 log D)t log n). In particular, our algorithm is quasi-polynomial time
for games with constant or poly-logarithmic treewidth.
acknowledgement: This research was partially supported by the ERC CoG 863818 (ForM-SMArt)
grant.
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Tobias
full_name: Meggendorfer, Tobias
id: b21b0c15-30a2-11eb-80dc-f13ca25802e1
last_name: Meggendorfer
orcid: 0000-0002-1712-2165
- first_name: Raimundo J
full_name: Saona Urmeneta, Raimundo J
id: BD1DF4C4-D767-11E9-B658-BC13E6697425
last_name: Saona Urmeneta
orcid: 0000-0001-5103-038X
- first_name: Jakub
full_name: Svoboda, Jakub
id: 130759D2-D7DD-11E9-87D2-DE0DE6697425
last_name: Svoboda
citation:
ama: 'Chatterjee K, Meggendorfer T, Saona Urmeneta RJ, Svoboda J. Faster algorithm
for turn-based stochastic games with bounded treewidth. In: Proceedings of
the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial
and Applied Mathematics; 2023:4590-4605. doi:10.1137/1.9781611977554.ch173'
apa: 'Chatterjee, K., Meggendorfer, T., Saona Urmeneta, R. J., & Svoboda, J.
(2023). Faster algorithm for turn-based stochastic games with bounded treewidth.
In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms
(pp. 4590–4605). Florence, Italy: Society for Industrial and Applied Mathematics.
https://doi.org/10.1137/1.9781611977554.ch173'
chicago: Chatterjee, Krishnendu, Tobias Meggendorfer, Raimundo J Saona Urmeneta,
and Jakub Svoboda. “Faster Algorithm for Turn-Based Stochastic Games with Bounded
Treewidth.” In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete
Algorithms, 4590–4605. Society for Industrial and Applied Mathematics, 2023.
https://doi.org/10.1137/1.9781611977554.ch173.
ieee: K. Chatterjee, T. Meggendorfer, R. J. Saona Urmeneta, and J. Svoboda, “Faster
algorithm for turn-based stochastic games with bounded treewidth,” in Proceedings
of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, Florence, Italy,
2023, pp. 4590–4605.
ista: 'Chatterjee K, Meggendorfer T, Saona Urmeneta RJ, Svoboda J. 2023. Faster
algorithm for turn-based stochastic games with bounded treewidth. Proceedings
of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium
on Discrete Algorithms, 4590–4605.'
mla: Chatterjee, Krishnendu, et al. “Faster Algorithm for Turn-Based Stochastic
Games with Bounded Treewidth.” Proceedings of the 2023 Annual ACM-SIAM Symposium
on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2023,
pp. 4590–605, doi:10.1137/1.9781611977554.ch173.
short: K. Chatterjee, T. Meggendorfer, R.J. Saona Urmeneta, J. Svoboda, in:, Proceedings
of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial
and Applied Mathematics, 2023, pp. 4590–4605.
conference:
end_date: 2023-01-25
location: Florence, Italy
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2023-01-22
date_created: 2023-02-24T12:20:47Z
date_published: 2023-02-01T00:00:00Z
date_updated: 2023-02-27T09:01:16Z
day: '01'
department:
- _id: GradSch
- _id: KrCh
doi: 10.1137/1.9781611977554.ch173
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1137/1.9781611977554.ch173
month: '02'
oa: 1
oa_version: Published Version
page: 4590-4605
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
isbn:
- '9781611977554'
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
status: public
title: Faster algorithm for turn-based stochastic games with bounded treewidth
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '12720'
abstract:
- lang: eng
text: Here we describe the in vivo DNA assembly approach, where molecular cloning
procedures are performed using an E. coli recA-independent recombination pathway,
which assembles linear fragments of DNA with short homologous termini. This pathway
is present in all standard laboratory E. coli strains and, by bypassing the need
for in vitro DNA assembly, allows simplified molecular cloning to be performed
without the plasmid instability issues associated with specialized recombination-cloning
bacterial strains. The methodology requires specific primer design and can perform
all standard plasmid modifications (insertions, deletions, mutagenesis, and sub-cloning)
in a rapid, simple, and cost-efficient manner, as it does not require commercial
kits or specialized bacterial strains. Additionally, this approach can be used
to perform complex procedures such as multiple modifications to a plasmid, as
up to 6 linear fragments can be assembled in vivo by this recombination pathway.
Procedures generally require less than 3 h, involving PCR amplification, DpnI
digestion of template DNA, and transformation, upon which circular plasmids are
assembled. In this chapter we describe the requirements, procedure, and potential
pitfalls when using this technique, as well as protocol variations to overcome
the most common issues.
alternative_title:
- Methods in Molecular Biology
article_processing_charge: No
author:
- first_name: Sandra
full_name: Arroyo-Urea, Sandra
last_name: Arroyo-Urea
- first_name: Jake
full_name: Watson, Jake
id: 63836096-4690-11EA-BD4E-32803DDC885E
last_name: Watson
orcid: 0000-0002-8698-3823
- first_name: Javier
full_name: García-Nafría, Javier
last_name: García-Nafría
citation:
ama: 'Arroyo-Urea S, Watson J, García-Nafría J. Molecular Cloning Using In Vivo
DNA Assembly. In: Scarlett G, ed. DNA Manipulation and Analysis. Vol 2633.
MIMB. New York, NY, United States: Springer Nature; 2023:33-44. doi:10.1007/978-1-0716-3004-4_3'
apa: 'Arroyo-Urea, S., Watson, J., & García-Nafría, J. (2023). Molecular Cloning
Using In Vivo DNA Assembly. In G. Scarlett (Ed.), DNA Manipulation and Analysis
(Vol. 2633, pp. 33–44). New York, NY, United States: Springer Nature. https://doi.org/10.1007/978-1-0716-3004-4_3'
chicago: 'Arroyo-Urea, Sandra, Jake Watson, and Javier García-Nafría. “Molecular
Cloning Using In Vivo DNA Assembly.” In DNA Manipulation and Analysis,
edited by Garry Scarlett, 2633:33–44. MIMB. New York, NY, United States: Springer
Nature, 2023. https://doi.org/10.1007/978-1-0716-3004-4_3.'
ieee: 'S. Arroyo-Urea, J. Watson, and J. García-Nafría, “Molecular Cloning Using
In Vivo DNA Assembly,” in DNA Manipulation and Analysis, vol. 2633, G.
Scarlett, Ed. New York, NY, United States: Springer Nature, 2023, pp. 33–44.'
ista: 'Arroyo-Urea S, Watson J, García-Nafría J. 2023.Molecular Cloning Using In
Vivo DNA Assembly. In: DNA Manipulation and Analysis. Methods in Molecular Biology,
vol. 2633, 33–44.'
mla: Arroyo-Urea, Sandra, et al. “Molecular Cloning Using In Vivo DNA Assembly.”
DNA Manipulation and Analysis, edited by Garry Scarlett, vol. 2633, Springer
Nature, 2023, pp. 33–44, doi:10.1007/978-1-0716-3004-4_3.
short: S. Arroyo-Urea, J. Watson, J. García-Nafría, in:, G. Scarlett (Ed.), DNA
Manipulation and Analysis, Springer Nature, New York, NY, United States, 2023,
pp. 33–44.
date_created: 2023-03-12T23:01:02Z
date_published: 2023-03-01T00:00:00Z
date_updated: 2023-03-16T08:34:24Z
day: '01'
department:
- _id: PeJo
doi: 10.1007/978-1-0716-3004-4_3
editor:
- first_name: Garry
full_name: Scarlett, Garry
last_name: Scarlett
external_id:
pmid:
- '36853454'
intvolume: ' 2633'
language:
- iso: eng
month: '03'
oa_version: None
page: 33-44
place: New York, NY, United States
pmid: 1
publication: DNA Manipulation and Analysis
publication_identifier:
eisbn:
- 978-1-0716-3004-4
eissn:
- 1940-6029
isbn:
- 978-1-0716-3003-7
issn:
- 1064-3745
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: MIMB
status: public
title: Molecular Cloning Using In Vivo DNA Assembly
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2633
year: '2023'
...
---
_id: '12735'
abstract:
- lang: eng
text: "Asynchronous programming has gained significant popularity over the last
decade: support for this programming pattern is available in many popular languages
via libraries and native language implementations, typically in the form of coroutines
or the async/await construct. Instead of programming via shared memory, this concept
assumes implicit synchronization through message passing. The key data structure
enabling such communication is the rendezvous channel. Roughly, a rendezvous channel
is a blocking queue of size zero, so both send(e) and receive() operations wait
for each other, performing a rendezvous when they meet. To optimize the message
passing pattern, channels are usually equipped with a fixed-size buffer, so sends
do not suspend and put elements into the buffer until its capacity is exceeded.
This primitive is known as a buffered channel.\r\n\r\nThis paper presents a fast
and scalable algorithm for both rendezvous and buffered channels. Similarly to
modern queues, our solution is based on an infinite array with two positional
counters for send(e) and receive() operations, leveraging the unconditional Fetch-And-Add
instruction to update them. Yet, the algorithm requires non-trivial modifications
of this classic pattern, in order to support the full channel semantics, such
as buffering and cancellation of waiting requests. We compare the performance
of our solution to that of the Kotlin implementation, as well as against other
academic proposals, showing up to 9.8× speedup. To showcase its expressiveness
and performance, we also integrated the proposed algorithm into the standard Kotlin
Coroutines library, replacing the previous channel implementations."
article_processing_charge: No
author:
- first_name: Nikita
full_name: Koval, Nikita
id: 2F4DB10C-F248-11E8-B48F-1D18A9856A87
last_name: Koval
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Roman
full_name: Elizarov, Roman
last_name: Elizarov
citation:
ama: 'Koval N, Alistarh D-A, Elizarov R. Fast and scalable channels in Kotlin Coroutines.
In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming. Association for Computing Machinery; 2023:107-118. doi:10.1145/3572848.3577481'
apa: 'Koval, N., Alistarh, D.-A., & Elizarov, R. (2023). Fast and scalable channels
in Kotlin Coroutines. In Proceedings of the ACM SIGPLAN Symposium on Principles
and Practice of Parallel Programming (pp. 107–118). Montreal, QC, Canada:
Association for Computing Machinery. https://doi.org/10.1145/3572848.3577481'
chicago: Koval, Nikita, Dan-Adrian Alistarh, and Roman Elizarov. “Fast and Scalable
Channels in Kotlin Coroutines.” In Proceedings of the ACM SIGPLAN Symposium
on Principles and Practice of Parallel Programming, 107–18. Association for
Computing Machinery, 2023. https://doi.org/10.1145/3572848.3577481.
ieee: N. Koval, D.-A. Alistarh, and R. Elizarov, “Fast and scalable channels in
Kotlin Coroutines,” in Proceedings of the ACM SIGPLAN Symposium on Principles
and Practice of Parallel Programming, Montreal, QC, Canada, 2023, pp. 107–118.
ista: 'Koval N, Alistarh D-A, Elizarov R. 2023. Fast and scalable channels in Kotlin
Coroutines. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice
of Parallel Programming. PPoPP: Sympopsium on Principles and Practice of Parallel
Programming, 107–118.'
mla: Koval, Nikita, et al. “Fast and Scalable Channels in Kotlin Coroutines.” Proceedings
of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming,
Association for Computing Machinery, 2023, pp. 107–18, doi:10.1145/3572848.3577481.
short: N. Koval, D.-A. Alistarh, R. Elizarov, in:, Proceedings of the ACM SIGPLAN
Symposium on Principles and Practice of Parallel Programming, Association for
Computing Machinery, 2023, pp. 107–118.
conference:
end_date: 2023-03-01
location: Montreal, QC, Canada
name: 'PPoPP: Sympopsium on Principles and Practice of Parallel Programming'
start_date: 2023-02-25
date_created: 2023-03-19T23:00:58Z
date_published: 2023-02-25T00:00:00Z
date_updated: 2023-03-20T07:29:28Z
day: '25'
department:
- _id: DaAl
doi: 10.1145/3572848.3577481
external_id:
arxiv:
- '2211.04986'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2211.04986
month: '02'
oa: 1
oa_version: Preprint
page: 107-118
publication: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming
publication_identifier:
isbn:
- '9798400700156'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fast and scalable channels in Kotlin Coroutines
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '12736'
abstract:
- lang: eng
text: Although a wide variety of handcrafted concurrent data structures have been
proposed, there is considerable interest in universal approaches (Universal Constructions
or UCs) for building concurrent data structures. UCs (semi-)automatically convert
a sequential data structure into a concurrent one. The simplest approach uses
locks [3, 6] that protect a sequential data structure and allow only one process
to access it at a time. However, the resulting data structure is blocking. Most
work on UCs instead focuses on obtaining non-blocking progress guarantees such
as obstruction-freedom, lock-freedom or wait-freedom. Many non-blocking UCs have
appeared. Key examples include the seminal wait-free UC [2] by Herlihy, a NUMA-aware
UC [10] by Yi et al., and an efficient UC for large objects [1] by Fatourou et
al.
acknowledgement: 'This work was supported by: the Natural Sciences and Engineering
Research Council of Canada (NSERC) Discovery Program grant: RGPIN-2019-04227, and
the Canada Foundation for Innovation John R. Evans Leaders Fund (CFI-JELF) with
equal support from the Ontario Research Fund CFI Leaders Opportunity Fund: 38512.'
article_processing_charge: No
author:
- first_name: Vitaly
full_name: Aksenov, Vitaly
last_name: Aksenov
- first_name: Trevor A
full_name: Brown, Trevor A
id: 3569F0A0-F248-11E8-B48F-1D18A9856A87
last_name: Brown
- first_name: Alexander
full_name: Fedorov, Alexander
id: 2e711909-896a-11ed-bdf8-eb0f5a2984c6
last_name: Fedorov
- first_name: Ilya
full_name: Kokorin, Ilya
last_name: Kokorin
citation:
ama: Aksenov V, Brown TA, Fedorov A, Kokorin I. Unexpected Scaling in Path Copying
Trees. Association for Computing Machinery; 2023:438-440. doi:10.1145/3572848.3577512
apa: 'Aksenov, V., Brown, T. A., Fedorov, A., & Kokorin, I. (2023). Unexpected
scaling in path copying trees. Proceedings of the ACM SIGPLAN Symposium
on Principles and Practice of Parallel Programming (pp. 438–440). Montreal,
QB, Canada: Association for Computing Machinery. https://doi.org/10.1145/3572848.3577512'
chicago: Aksenov, Vitaly, Trevor A Brown, Alexander Fedorov, and Ilya Kokorin. Unexpected
Scaling in Path Copying Trees. Proceedings of the ACM SIGPLAN Symposium
on Principles and Practice of Parallel Programming. Association for Computing
Machinery, 2023. https://doi.org/10.1145/3572848.3577512.
ieee: V. Aksenov, T. A. Brown, A. Fedorov, and I. Kokorin, Unexpected scaling
in path copying trees. Association for Computing Machinery, 2023, pp. 438–440.
ista: Aksenov V, Brown TA, Fedorov A, Kokorin I. 2023. Unexpected scaling in path
copying trees, Association for Computing Machinery,p.
mla: Aksenov, Vitaly, et al. “Unexpected Scaling in Path Copying Trees.” Proceedings
of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming,
Association for Computing Machinery, 2023, pp. 438–40, doi:10.1145/3572848.3577512.
short: V. Aksenov, T.A. Brown, A. Fedorov, I. Kokorin, Unexpected Scaling in Path
Copying Trees, Association for Computing Machinery, 2023.
conference:
end_date: 2023-03-01
location: Montreal, QB, Canada
name: 'PPoPP: Sympopsium on Principles and Practice of Parallel Programming'
start_date: 2023-02-25
date_created: 2023-03-19T23:00:58Z
date_published: 2023-02-25T00:00:00Z
date_updated: 2023-03-20T07:57:27Z
day: '25'
department:
- _id: DaAl
- _id: GradSch
doi: 10.1145/3572848.3577512
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1145/3572848.3577512
month: '02'
oa: 1
oa_version: Published Version
page: 438-440
publication: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming
publication_identifier:
isbn:
- '9798400700156'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
status: public
title: Unexpected scaling in path copying trees
type: conference_poster
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '12760'
abstract:
- lang: eng
text: "Dynamic programming (DP) is one of the fundamental paradigms in algorithm
design. However,\r\nmany DP algorithms have to fill in large DP tables, represented
by two-dimensional arrays, which causes at least quadratic running times and space
usages. This has led to the development of improved algorithms for special cases
when the DPs satisfy additional properties like, e.g., the Monge property or total
monotonicity.\r\nIn this paper, we consider a new condition which assumes (among
some other technical assumptions) that the rows of the DP table are monotone.
Under this assumption, we introduce\r\na novel data structure for computing (1
+ ϵ)-approximate DP solutions in near-linear time and\r\nspace in the static setting,
and with polylogarithmic update times when the DP entries change\r\ndynamically.
To the best of our knowledge, our new condition is incomparable to previous conditions
and is the first which allows to derive dynamic algorithms based on existing DPs.
Instead of using two-dimensional arrays to store the DP tables, we store the rows
of the DP tables using monotone piecewise constant functions. This allows us to
store length-n DP table rows with entries in [0, W] using only polylog(n, W) bits,
and to perform operations, such as (min, +)-convolution or rounding, on these
functions in polylogarithmic time.\r\nWe further present several applications
of our data structure. For bicriteria versions of k-balanced graph partitioning
and simultaneous source location, we obtain the first dynamic algorithms with
subpolynomial update times, as well as the first static algorithms using only
near-linear time and space. Additionally, we obtain the currently fastest algorithm
for fully dynamic knapsack."
acknowledgement: "Monika Henzinger: This project has received funding from the European
Research Council\r\n(ERC) under the European Union’s Horizon 2020 research and innovation
programme (Grant\r\nagreement No. 101019564 “The Design of Modern Fully Dynamic
Data Structures (MoDynStruct)” and from the Austrian Science Fund (FWF) project
“Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional
funding from the netidee SCIENCE Stiftung, 2020–2024.\r\nStefan Neumann: This research
is supported by the the ERC Advanced Grant REBOUND (834862) and the EC H2020 RIA
project SoBigData++ (871042).\r\nStefan Schmid: Research supported by Austrian Science
Fund (FWF) project I 5025-N (DELTA), 2020-2024."
alternative_title:
- LIPIcs
article_number: '36'
article_processing_charge: No
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Stefan
full_name: Neumann, Stefan
last_name: Neumann
- first_name: Harald
full_name: Räcke, Harald
last_name: Räcke
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Henzinger MH, Neumann S, Räcke H, Schmid S. Dynamic maintenance of monotone
dynamic programs and applications. In: 40th International Symposium on Theoretical
Aspects of Computer Science. Vol 254. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2023. doi:10.4230/LIPIcs.STACS.2023.36'
apa: 'Henzinger, M. H., Neumann, S., Räcke, H., & Schmid, S. (2023). Dynamic
maintenance of monotone dynamic programs and applications. In 40th International
Symposium on Theoretical Aspects of Computer Science (Vol. 254). Hamburg,
Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2023.36'
chicago: Henzinger, Monika H, Stefan Neumann, Harald Räcke, and Stefan Schmid. “Dynamic
Maintenance of Monotone Dynamic Programs and Applications.” In 40th International
Symposium on Theoretical Aspects of Computer Science, Vol. 254. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.STACS.2023.36.
ieee: M. H. Henzinger, S. Neumann, H. Räcke, and S. Schmid, “Dynamic maintenance
of monotone dynamic programs and applications,” in 40th International Symposium
on Theoretical Aspects of Computer Science, Hamburg, Germany, 2023, vol. 254.
ista: 'Henzinger MH, Neumann S, Räcke H, Schmid S. 2023. Dynamic maintenance of
monotone dynamic programs and applications. 40th International Symposium on Theoretical
Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer
Science, LIPIcs, vol. 254, 36.'
mla: Henzinger, Monika H., et al. “Dynamic Maintenance of Monotone Dynamic Programs
and Applications.” 40th International Symposium on Theoretical Aspects of Computer
Science, vol. 254, 36, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2023, doi:10.4230/LIPIcs.STACS.2023.36.
short: M.H. Henzinger, S. Neumann, H. Räcke, S. Schmid, in:, 40th International
Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2023.
conference:
end_date: 2023-03-09
location: Hamburg, Germany
name: 'STACS: Symposium on Theoretical Aspects of Computer Science'
start_date: 2023-03-07
date_created: 2023-03-26T22:01:07Z
date_published: 2023-03-01T00:00:00Z
date_updated: 2023-03-27T06:46:27Z
day: '01'
ddc:
- '000'
department:
- _id: MoHe
doi: 10.4230/LIPIcs.STACS.2023.36
external_id:
arxiv:
- '2301.01744'
file:
- access_level: open_access
checksum: 22141ab8bc55188e2dfff665e5daecbd
content_type: application/pdf
creator: dernst
date_created: 2023-03-27T06:37:22Z
date_updated: 2023-03-27T06:37:22Z
file_id: '12769'
file_name: 2023_LIPICS_HenzingerM.pdf
file_size: 872706
relation: main_file
success: 1
file_date_updated: 2023-03-27T06:37:22Z
has_accepted_license: '1'
intvolume: ' 254'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
publication: 40th International Symposium on Theoretical Aspects of Computer Science
publication_identifier:
isbn:
- '9783959772662'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dynamic maintenance of monotone dynamic programs and applications
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: 254
year: '2023'
...
---
_id: '12716'
abstract:
- lang: eng
text: "The process of detecting and evaluating sensory information to guide behaviour
is termed perceptual decision-making (PDM), and is critical for the ability of
an organism to interact with its external world. Individuals with autism, a neurodevelopmental
condition primarily characterised by social and communication difficulties, frequently
exhibit altered sensory processing and PDM difficulties are widely reported. Recent
technological advancements have pushed forward our understanding of the genetic
changes accompanying this condition, however our understanding of how these mutations
affect the function of specific neuronal circuits and bring about the corresponding
behavioural changes remains limited. Here, we use an innate PDM task, the looming
avoidance response (LAR) paradigm, to identify a convergent behavioural abnormality
across three molecularly distinct genetic mouse models of autism (Cul3, Setd5
and Ptchd1). Although mutant mice can rapidly detect threatening visual stimuli,
their responses are consistently delayed, requiring longer to initiate an appropriate
response than their wild-type siblings. Mutant animals show abnormal adaptation
in both their stimulus- evoked escape responses and exploratory dynamics following
repeated stimulus presentations. Similarly delayed behavioural responses are observed
in wild-type animals when faced with more ambiguous threats, suggesting the mutant
phenotype could arise from a dysfunction in the flexible control of this PDM process.\r\nOur
knowledge of the core neuronal circuitry mediating the LAR facilitated a detailed
dissection of the neuronal mechanisms underlying the behavioural impairment. In
vivo extracellular recording revealed that visual responses were unaffected within
a key brain region for the rapid processing of visual threats, the superior colliculus
(SC), indicating that the behavioural delay was unlikely to originate from sensory
impairments. Delayed behavioural responses were recapitulated in the Setd5 model
following optogenetic stimulation of the excitatory output neurons of the SC,
which are known to mediate escape initiation through the activation of cells in
the underlying dorsal periaqueductal grey (dPAG). In vitro patch-clamp recordings
of dPAG cells uncovered a stark hypoexcitability phenotype in two out of the three
genetic models investigated (Setd5 and Ptchd1), that in Setd5, is mediated by
the misregulation of voltage-gated potassium channels. Overall, our results show
that the ability to use visual information to drive efficient escape responses
is impaired in three diverse genetic mouse models of autism and that, in one of
the models studied, this behavioural delay likely originates from differences
in the intrinsic excitability of a key subcortical node, the dPAG. Furthermore,
this work showcases the use of an innate behavioural paradigm to mechanistically
dissect PDM processes in autism."
acknowledged_ssus:
- _id: PreCl
- _id: Bio
- _id: LifeSc
- _id: M-Shop
- _id: CampIT
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Laura
full_name: Burnett, Laura
id: 3B717F68-F248-11E8-B48F-1D18A9856A87
last_name: Burnett
orcid: 0000-0002-8937-410X
citation:
ama: Burnett L. To flee, or not to flee? Using innate defensive behaviours to investigate
rapid perceptual decision-making through subcortical circuits in mouse models
of autism. 2023. doi:10.15479/at:ista:12716
apa: Burnett, L. (2023). To flee, or not to flee? Using innate defensive behaviours
to investigate rapid perceptual decision-making through subcortical circuits in
mouse models of autism. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12716
chicago: Burnett, Laura. “To Flee, or Not to Flee? Using Innate Defensive Behaviours
to Investigate Rapid Perceptual Decision-Making through Subcortical Circuits in
Mouse Models of Autism.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:12716.
ieee: L. Burnett, “To flee, or not to flee? Using innate defensive behaviours to
investigate rapid perceptual decision-making through subcortical circuits in mouse
models of autism,” Institute of Science and Technology Austria, 2023.
ista: Burnett L. 2023. To flee, or not to flee? Using innate defensive behaviours
to investigate rapid perceptual decision-making through subcortical circuits in
mouse models of autism. Institute of Science and Technology Austria.
mla: Burnett, Laura. To Flee, or Not to Flee? Using Innate Defensive Behaviours
to Investigate Rapid Perceptual Decision-Making through Subcortical Circuits in
Mouse Models of Autism. Institute of Science and Technology Austria, 2023,
doi:10.15479/at:ista:12716.
short: L. Burnett, To Flee, or Not to Flee? Using Innate Defensive Behaviours to
Investigate Rapid Perceptual Decision-Making through Subcortical Circuits in Mouse
Models of Autism, Institute of Science and Technology Austria, 2023.
date_created: 2023-03-08T15:19:45Z
date_published: 2023-03-10T00:00:00Z
date_updated: 2023-04-05T10:59:04Z
day: '10'
ddc:
- '599'
- '573'
degree_awarded: PhD
department:
- _id: GradSch
- _id: MaJö
doi: 10.15479/at:ista:12716
ec_funded: 1
file:
- access_level: closed
checksum: 6c6d9cc2c4cdacb74e6b1047a34d7332
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: lburnett
date_created: 2023-03-08T15:08:46Z
date_updated: 2023-03-08T15:08:46Z
file_id: '12717'
file_name: Burnett_Thesis_2023.docx
file_size: 23029260
relation: source_file
- access_level: open_access
checksum: cebc77705288bf4382db9b3541483cd0
content_type: application/pdf
creator: lburnett
date_created: 2023-03-08T15:08:46Z
date_updated: 2023-03-08T15:08:46Z
file_id: '12718'
file_name: Burnett_Thesis_2023_pdfA.pdf
file_size: 11959869
relation: main_file
success: 1
file_date_updated: 2023-03-08T15:08:46Z
has_accepted_license: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: '178'
project:
- _id: 2634E9D2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '756502'
name: Circuits of Visual Attention
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
status: public
supervisor:
- first_name: Maximilian A
full_name: Jösch, Maximilian A
id: 2BD278E6-F248-11E8-B48F-1D18A9856A87
last_name: Jösch
orcid: 0000-0002-3937-1330
title: To flee, or not to flee? Using innate defensive behaviours to investigate rapid
perceptual decision-making through subcortical circuits in mouse models of autism
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2023'
...
---
_id: '12854'
abstract:
- lang: eng
text: "The main idea behind BUBAAK is to run multiple program analyses in parallel
and use runtime monitoring and enforcement to observe and control their progress
in real time. The analyses send information about (un)explored states of the program
and discovered invariants to a monitor. The monitor processes the received data
and can force an analysis to stop the search of certain program parts (which have
already been analyzed by other analyses), or to make it utilize a program invariant
found by another analysis.\r\nAt SV-COMP 2023, the implementation of data exchange
between the monitor and the analyses was not yet completed, which is why BUBAAK
only ran several analyses in parallel, without any coordination. Still, BUBAAK
won the meta-category FalsificationOverall and placed very well in several other
(sub)-categories of the competition."
acknowledgement: This work was supported by the ERC-2020-AdG 10102009 grant.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Marek
full_name: Chalupa, Marek
id: 87e34708-d6c6-11ec-9f5b-9391e7be2463
last_name: Chalupa
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
citation:
ama: 'Chalupa M, Henzinger TA. Bubaak: Runtime monitoring of program verifiers.
In: Tools and Algorithms for the Construction and Analysis of Systems.
Vol 13994. Springer Nature; 2023:535-540. doi:10.1007/978-3-031-30820-8_32'
apa: 'Chalupa, M., & Henzinger, T. A. (2023). Bubaak: Runtime monitoring of
program verifiers. In Tools and Algorithms for the Construction and Analysis
of Systems (Vol. 13994, pp. 535–540). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-30820-8_32'
chicago: 'Chalupa, Marek, and Thomas A Henzinger. “Bubaak: Runtime Monitoring of
Program Verifiers.” In Tools and Algorithms for the Construction and Analysis
of Systems, 13994:535–40. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30820-8_32.'
ieee: 'M. Chalupa and T. A. Henzinger, “Bubaak: Runtime monitoring of program verifiers,”
in Tools and Algorithms for the Construction and Analysis of Systems, Paris,
France, 2023, vol. 13994, pp. 535–540.'
ista: 'Chalupa M, Henzinger TA. 2023. Bubaak: Runtime monitoring of program verifiers.
Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools
and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13994,
535–540.'
mla: 'Chalupa, Marek, and Thomas A. Henzinger. “Bubaak: Runtime Monitoring of Program
Verifiers.” Tools and Algorithms for the Construction and Analysis of Systems,
vol. 13994, Springer Nature, 2023, pp. 535–40, doi:10.1007/978-3-031-30820-8_32.'
short: M. Chalupa, T.A. Henzinger, in:, Tools and Algorithms for the Construction
and Analysis of Systems, Springer Nature, 2023, pp. 535–540.
conference:
end_date: 2023-04-27
location: Paris, France
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2023-04-22
date_created: 2023-04-20T08:22:53Z
date_published: 2023-04-20T00:00:00Z
date_updated: 2023-04-25T07:02:43Z
day: '20'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-031-30820-8_32
ec_funded: 1
file:
- access_level: open_access
checksum: 120d2c2a38384058ad0630fdf8288312
content_type: application/pdf
creator: dernst
date_created: 2023-04-25T06:58:36Z
date_updated: 2023-04-25T06:58:36Z
file_id: '12864'
file_name: 2023_LNCS_Chalupa.pdf
file_size: 16096413
relation: main_file
success: 1
file_date_updated: 2023-04-25T06:58:36Z
has_accepted_license: '1'
intvolume: ' 13994'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 535-540
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: Tools and Algorithms for the Construction and Analysis of Systems
publication_identifier:
eisbn:
- '9783031308208'
eissn:
- 1611-3349
isbn:
- '9783031308192'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: 'Bubaak: Runtime monitoring of program verifiers'
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: 13994
year: '2023'
...
---
_id: '12846'
abstract:
- lang: eng
text: We present a formula for the signed area of a spherical polygon via prequantization.
In contrast to the traditional formula based on the Gauss-Bonnet theorem that
requires measuring angles, the new formula mimics Green's theorem and is applicable
to a wider range of degenerate spherical curves and polygons.
acknowledgement: The authors acknowledge Chris Wojtan for his continuous support to
the present work through discussions and advice. The second author thanks Anna Sisak
for a fruitful discussion on prequantum bundles. This project was funded in part
by the European Research Council (ERC Consolidator Grant 101045083 CoDiNA).
article_number: '2303.14555'
article_processing_charge: No
author:
- first_name: Albert
full_name: Chern, Albert
last_name: Chern
- first_name: Sadashige
full_name: Ishida, Sadashige
id: 6F7C4B96-A8E9-11E9-A7CA-09ECE5697425
last_name: Ishida
citation:
ama: Chern A, Ishida S. Area formula for spherical polygons via prequantization.
arXiv. doi:10.48550/arXiv.2303.14555
apa: Chern, A., & Ishida, S. (n.d.). Area formula for spherical polygons via
prequantization. arXiv. https://doi.org/10.48550/arXiv.2303.14555
chicago: Chern, Albert, and Sadashige Ishida. “Area Formula for Spherical Polygons
via Prequantization.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2303.14555.
ieee: A. Chern and S. Ishida, “Area formula for spherical polygons via prequantization,”
arXiv. .
ista: Chern A, Ishida S. Area formula for spherical polygons via prequantization.
arXiv, 2303.14555.
mla: Chern, Albert, and Sadashige Ishida. “Area Formula for Spherical Polygons via
Prequantization.” ArXiv, 2303.14555, doi:10.48550/arXiv.2303.14555.
short: A. Chern, S. Ishida, ArXiv (n.d.).
date_created: 2023-04-18T19:16:06Z
date_published: 2023-03-25T00:00:00Z
date_updated: 2023-04-25T06:51:21Z
day: '25'
department:
- _id: GradSch
- _id: ChWo
doi: 10.48550/arXiv.2303.14555
external_id:
arxiv:
- '2303.14555'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2303.14555
month: '03'
oa: 1
oa_version: Preprint
project:
- _id: 34bc2376-11ca-11ed-8bc3-9a3b3961a088
grant_number: '101045083'
name: Computational Discovery of Numerical Algorithms for Animation and Simulation
of Natural Phenomena
publication: arXiv
publication_status: submitted
status: public
title: Area formula for spherical polygons via prequantization
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '12856'
abstract:
- lang: eng
text: "As the complexity and criticality of software increase every year, so does
the importance of run-time monitoring. Third-party monitoring, with limited knowledge
of the monitored software, and best-effort monitoring, which keeps pace with the
monitored software, are especially valuable, yet underexplored areas of run-time
monitoring. Most existing monitoring frameworks do not support their combination
because they either require access to the monitored code for instrumentation purposes
or the processing of all observed events, or both.\r\n\r\nWe present a middleware
framework, VAMOS, for the run-time monitoring of software which is explicitly
designed to support third-party and best-effort scenarios. The design goals of
VAMOS are (i) efficiency (keeping pace at low overhead), (ii) flexibility (the
ability to monitor black-box code through a variety of different event channels,
and the connectability to monitors written in different specification languages),
and (iii) ease-of-use. To achieve its goals, VAMOS combines aspects of event broker
and event recognition systems with aspects of stream processing systems.\r\nWe
implemented a prototype toolchain for VAMOS and conducted experiments including
a case study of monitoring for data races. The results indicate that VAMOS enables
writing useful yet efficient monitors, is compatible with a variety of event sources
and monitor specifications, and simplifies key aspects of setting up a monitoring
system from scratch."
acknowledgement: This work was supported in part by the ERC-2020-AdG 101020093. The
authors would like to thank the anonymous FASE reviewers for their valuable feedback
and suggestions.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Marek
full_name: Chalupa, Marek
id: 87e34708-d6c6-11ec-9f5b-9391e7be2463
last_name: Chalupa
- first_name: Fabian
full_name: Mühlböck, Fabian
id: 6395C5F6-89DF-11E9-9C97-6BDFE5697425
last_name: Mühlböck
orcid: 0000-0003-1548-0177
- first_name: Stefanie
full_name: Muroya Lei, Stefanie
id: a376de31-8972-11ed-ae7b-d0251c13c8ff
last_name: Muroya Lei
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
citation:
ama: 'Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. Vamos: Middleware for best-effort
third-party monitoring. In: Fundamental Approaches to Software Engineering.
Vol 13991. Springer Nature; 2023:260-281. doi:10.1007/978-3-031-30826-0_15'
apa: 'Chalupa, M., Mühlböck, F., Muroya Lei, S., & Henzinger, T. A. (2023).
Vamos: Middleware for best-effort third-party monitoring. In Fundamental Approaches
to Software Engineering (Vol. 13991, pp. 260–281). Paris, France: Springer
Nature. https://doi.org/10.1007/978-3-031-30826-0_15'
chicago: 'Chalupa, Marek, Fabian Mühlböck, Stefanie Muroya Lei, and Thomas A Henzinger.
“Vamos: Middleware for Best-Effort Third-Party Monitoring.” In Fundamental
Approaches to Software Engineering, 13991:260–81. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30826-0_15.'
ieee: 'M. Chalupa, F. Mühlböck, S. Muroya Lei, and T. A. Henzinger, “Vamos: Middleware
for best-effort third-party monitoring,” in Fundamental Approaches to Software
Engineering, Paris, France, 2023, vol. 13991, pp. 260–281.'
ista: 'Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. 2023. Vamos: Middleware
for best-effort third-party monitoring. Fundamental Approaches to Software Engineering.
FASE: Fundamental Approaches to Software Engineering, LNCS, vol. 13991, 260–281.'
mla: 'Chalupa, Marek, et al. “Vamos: Middleware for Best-Effort Third-Party Monitoring.”
Fundamental Approaches to Software Engineering, vol. 13991, Springer Nature,
2023, pp. 260–81, doi:10.1007/978-3-031-30826-0_15.'
short: M. Chalupa, F. Mühlböck, S. Muroya Lei, T.A. Henzinger, in:, Fundamental
Approaches to Software Engineering, Springer Nature, 2023, pp. 260–281.
conference:
end_date: 2023-04-27
location: Paris, France
name: 'FASE: Fundamental Approaches to Software Engineering'
start_date: 2023-04-22
date_created: 2023-04-20T08:29:42Z
date_published: 2023-04-20T00:00:00Z
date_updated: 2023-04-25T07:19:07Z
day: '20'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-031-30826-0_15
ec_funded: 1
file:
- access_level: open_access
checksum: 17a7c8e08be609cf2408d37ea55e322c
content_type: application/pdf
creator: dernst
date_created: 2023-04-25T07:16:36Z
date_updated: 2023-04-25T07:16:36Z
file_id: '12865'
file_name: 2023_LNCS_ChalupaM.pdf
file_size: 580828
relation: main_file
success: 1
file_date_updated: 2023-04-25T07:16:36Z
has_accepted_license: '1'
intvolume: ' 13991'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 260-281
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: Fundamental Approaches to Software Engineering
publication_identifier:
eisbn:
- '9783031308260'
eissn:
- 1611-3349
isbn:
- '9783031308253'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '12407'
relation: earlier_version
status: public
status: public
title: 'Vamos: Middleware for best-effort third-party monitoring'
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: 13991
year: '2023'
...
---
_id: '12407'
abstract:
- lang: eng
text: "As the complexity and criticality of software increase every year, so does
the importance of run-time monitoring. Third-party monitoring, with limited knowledge
of the monitored software, and best-effort monitoring, which keeps pace with the
monitored software, are especially valuable, yet underexplored areas of run-time
monitoring. Most existing monitoring frameworks do not support their combination
because they either require access to the monitored code for instrumentation purposes
or the processing of all observed events, or both.\r\n\r\nWe present a middleware
framework, VAMOS, for the run-time monitoring of software which is explicitly
designed to support third-party and best-effort scenarios. The design goals of
VAMOS are (i) efficiency (keeping pace at low overhead), (ii) flexibility (the
ability to monitor black-box code through a variety of different event channels,
and the connectability to monitors written in different specification languages),
and (iii) ease-of-use. To achieve its goals, VAMOS combines aspects of event broker
and event recognition systems with aspects of stream processing systems.\r\n\r\nWe
implemented a prototype toolchain for VAMOS and conducted experiments including
a case study of monitoring for data races. The results indicate that VAMOS enables
writing useful yet efficient monitors, is compatible with a variety of event sources
and monitor specifications, and simplifies key aspects of setting up a monitoring
system from scratch."
acknowledgement: "This work was supported in part by the ERC-2020-AdG 101020093. \r\nThe
authors would like to thank the anonymous FASE reviewers for their valuable feedback
and suggestions."
alternative_title:
- IST Austria Technical Report
article_processing_charge: No
author:
- first_name: Marek
full_name: Chalupa, Marek
id: 87e34708-d6c6-11ec-9f5b-9391e7be2463
last_name: Chalupa
- first_name: Fabian
full_name: Mühlböck, Fabian
id: 6395C5F6-89DF-11E9-9C97-6BDFE5697425
last_name: Mühlböck
orcid: 0000-0003-1548-0177
- first_name: Stefanie
full_name: Muroya Lei, Stefanie
id: a376de31-8972-11ed-ae7b-d0251c13c8ff
last_name: Muroya Lei
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
citation:
ama: 'Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. VAMOS: Middleware for
Best-Effort Third-Party Monitoring. Institute of Science and Technology Austria;
2023. doi:10.15479/AT:ISTA:12407'
apa: 'Chalupa, M., Mühlböck, F., Muroya Lei, S., & Henzinger, T. A. (2023).
VAMOS: Middleware for Best-Effort Third-Party Monitoring. Institute of
Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:12407'
chicago: 'Chalupa, Marek, Fabian Mühlböck, Stefanie Muroya Lei, and Thomas A Henzinger.
VAMOS: Middleware for Best-Effort Third-Party Monitoring. Institute of
Science and Technology Austria, 2023. https://doi.org/10.15479/AT:ISTA:12407.'
ieee: 'M. Chalupa, F. Mühlböck, S. Muroya Lei, and T. A. Henzinger, VAMOS: Middleware
for Best-Effort Third-Party Monitoring. Institute of Science and Technology
Austria, 2023.'
ista: 'Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. 2023. VAMOS: Middleware
for Best-Effort Third-Party Monitoring, Institute of Science and Technology Austria,
38p.'
mla: 'Chalupa, Marek, et al. VAMOS: Middleware for Best-Effort Third-Party Monitoring.
Institute of Science and Technology Austria, 2023, doi:10.15479/AT:ISTA:12407.'
short: 'M. Chalupa, F. Mühlböck, S. Muroya Lei, T.A. Henzinger, VAMOS: Middleware
for Best-Effort Third-Party Monitoring, Institute of Science and Technology Austria,
2023.'
date_created: 2023-01-27T03:18:08Z
date_published: 2023-01-27T00:00:00Z
date_updated: 2023-04-25T07:19:06Z
day: '27'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.15479/AT:ISTA:12407
ec_funded: 1
file:
- access_level: open_access
checksum: 55426e463fdeafe9777fc3ff635154c7
content_type: application/pdf
creator: fmuehlbo
date_created: 2023-01-27T03:18:34Z
date_updated: 2023-01-27T03:18:34Z
file_id: '12408'
file_name: main.pdf
file_size: 662409
relation: main_file
success: 1
file_date_updated: 2023-01-27T03:18:34Z
has_accepted_license: '1'
keyword:
- runtime monitoring
- best effort
- third party
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: '38'
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication_identifier:
eissn:
- 2664-1690
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '12856'
relation: later_version
status: public
status: public
title: 'VAMOS: Middleware for Best-Effort Third-Party Monitoring'
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: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '12866'
abstract:
- lang: eng
text: "Autism spectrum disorder (ASD) and epilepsy are frequently comorbid neurodevelopmental
disorders. Extensive research has demonstrated shared pathological pathways, etiologies,
and phenotypes. Many risk factors for these disorders, like genetic mutations
and environmental pressures, are linked to changes in childhood brain development,
which is a critical period for their manifestation.\r\nDecades of research have
yielded many signatures for ASD and epilepsy, some shared and others unique or
opposing. The anatomical, physiological, and behavioral correlates of these disorders
are discussed in this chapter in the context of understanding shared pathological
pathways. We end with important takeaways on the presentation, prevention, intervention,
and policy changes for ASD and epilepsy. This chapter aims to explore the complexity
of these disorders, both in etiology and phenotypes, with the further goal of
appreciating the expanse of unknowns still to explore about the brain."
alternative_title:
- 'Vol. 1: Biological Development and Physical Health'
article_processing_charge: No
author:
- first_name: Christopher
full_name: Currin, Christopher
id: e8321fc5-3091-11eb-8a53-83f309a11ac9
last_name: Currin
orcid: 0000-0002-4809-5059
- first_name: Chad
full_name: Beyer, Chad
last_name: Beyer
citation:
ama: 'Currin C, Beyer C. Altered childhood brain development in autism and epilepsy.
In: Halpern-Felsher B, ed. Encyclopedia of Child and Adolescent Health.
1st ed. Elsevier; 2023:86-98. doi:10.1016/b978-0-12-818872-9.00129-1'
apa: Currin, C., & Beyer, C. (2023). Altered childhood brain development in
autism and epilepsy. In B. Halpern-Felsher (Ed.), Encyclopedia of Child and
Adolescent Health (1st ed., pp. 86–98). Elsevier. https://doi.org/10.1016/b978-0-12-818872-9.00129-1
chicago: Currin, Christopher, and Chad Beyer. “Altered Childhood Brain Development
in Autism and Epilepsy.” In Encyclopedia of Child and Adolescent Health,
edited by Bonnie Halpern-Felsher, 1st ed., 86–98. Elsevier, 2023. https://doi.org/10.1016/b978-0-12-818872-9.00129-1.
ieee: C. Currin and C. Beyer, “Altered childhood brain development in autism and
epilepsy,” in Encyclopedia of Child and Adolescent Health, 1st ed., B.
Halpern-Felsher, Ed. Elsevier, 2023, pp. 86–98.
ista: 'Currin C, Beyer C. 2023.Altered childhood brain development in autism and
epilepsy. In: Encyclopedia of Child and Adolescent Health. Vol. 1: Biological
Development and Physical Health, , 86–98.'
mla: Currin, Christopher, and Chad Beyer. “Altered Childhood Brain Development in
Autism and Epilepsy.” Encyclopedia of Child and Adolescent Health, edited
by Bonnie Halpern-Felsher, 1st ed., Elsevier, 2023, pp. 86–98, doi:10.1016/b978-0-12-818872-9.00129-1.
short: C. Currin, C. Beyer, in:, B. Halpern-Felsher (Ed.), Encyclopedia of Child
and Adolescent Health, 1st ed., Elsevier, 2023, pp. 86–98.
date_created: 2023-04-25T07:52:43Z
date_published: 2023-02-01T00:00:00Z
date_updated: 2023-04-25T09:25:40Z
day: '01'
department:
- _id: TiVo
doi: 10.1016/b978-0-12-818872-9.00129-1
edition: '1'
editor:
- first_name: Bonnie
full_name: Halpern-Felsher, Bonnie
last_name: Halpern-Felsher
language:
- iso: eng
month: '02'
oa_version: None
page: 86-98
publication: Encyclopedia of Child and Adolescent Health
publication_identifier:
isbn:
- '9780128188736'
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: Altered childhood brain development in autism and epilepsy
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '12809'
abstract:
- lang: eng
text: "Understanding the mechanisms of learning and memory formation has always
been one of\r\nthe main goals in neuroscience. Already Pavlov (1927) in his early
days has used his classic\r\nconditioning experiments to study the neural mechanisms
governing behavioral adaptation.\r\nWhat was not known back then was that the
part of the brain that is largely responsible for\r\nthis type of associative
learning is the cerebellum.\r\nSince then, plenty of theories on cerebellar learning
have emerged. Despite their differences,\r\none thing they all have in common
is that learning relies on synaptic and intrinsic plasticity.\r\nThe goal of my
PhD project was to unravel the molecular mechanisms underlying synaptic\r\nplasticity
in two synapses that have been shown to be implicated in motor learning, in an\r\neffort
to understand how learning and memory formation are processed in the cerebellum.\r\nOne
of the earliest and most well-known cerebellar theories postulates that motor
learning\r\nlargely depends on long-term depression at the parallel fiber-Purkinje
cell (PC-PC) synapse.\r\nHowever, the discovery of other types of plasticity in
the cerebellar circuitry, like long-term\r\npotentiation (LTP) at the PC-PC synapse,
potentiation of molecular layer interneurons (MLIs),\r\nand plasticity transfer
from the cortex to the cerebellar/ vestibular nuclei has increased the\r\npopularity
of the idea that multiple sites of plasticity might be involved in learning.\r\nStill
a lot remains unknown about the molecular mechanisms responsible for these types
of\r\nplasticity and whether they occur during physiological learning.\r\nIn the
first part of this thesis we have analyzed the variation and nanodistribution
of voltagegated calcium channels (VGCCs) and α-amino-3-hydroxy-5-methyl-4-isoxazolepropionic
acid\r\ntype glutamate receptors (AMPARs) on the parallel fiber-Purkinje cell
synapse after vestibuloocular reflex phase reversal adaptation, a behavior that
has been suggested to rely on PF-PC\r\nLTP. We have found that on the last day
of adaptation there is no learning trace in form of\r\nVGCCs nor AMPARs variation
at the PF-PC synapse, but instead a decrease in the number of\r\nPF-PC synapses.
These data seem to support the view that learning is only stored in the\r\ncerebellar
cortex in an initial learning phase, being transferred later to the vestibular
nuclei.\r\nNext, we have studied the role of MLIs in motor learning using a relatively
simple and well characterized behavioral paradigm – horizontal optokinetic reflex
(HOKR) adaptation. We\r\nhave found behavior-induced MLI potentiation in form
of release probability increase that\r\ncould be explained by the increase of
VGCCs at the presynaptic side. Our results strengthen\r\nthe idea of distributed
cerebellar plasticity contributing to learning and provide a novel\r\nmechanism
for release probability increase. "
acknowledged_ssus:
- _id: EM-Fac
- _id: Bio
- _id: PreCl
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Catarina
full_name: Alcarva, Catarina
id: 3A96634C-F248-11E8-B48F-1D18A9856A87
last_name: Alcarva
citation:
ama: 'Alcarva C. Plasticity in the cerebellum: What molecular mechanisms are behind
physiological learning. 2023. doi:10.15479/at:ista:12809'
apa: 'Alcarva, C. (2023). Plasticity in the cerebellum: What molecular mechanisms
are behind physiological learning. Institute of Science and Technology Austria.
https://doi.org/10.15479/at:ista:12809'
chicago: 'Alcarva, Catarina. “Plasticity in the Cerebellum: What Molecular Mechanisms
Are behind Physiological Learning.” Institute of Science and Technology Austria,
2023. https://doi.org/10.15479/at:ista:12809.'
ieee: 'C. Alcarva, “Plasticity in the cerebellum: What molecular mechanisms are
behind physiological learning,” Institute of Science and Technology Austria, 2023.'
ista: 'Alcarva C. 2023. Plasticity in the cerebellum: What molecular mechanisms
are behind physiological learning. Institute of Science and Technology Austria.'
mla: 'Alcarva, Catarina. Plasticity in the Cerebellum: What Molecular Mechanisms
Are behind Physiological Learning. Institute of Science and Technology Austria,
2023, doi:10.15479/at:ista:12809.'
short: 'C. Alcarva, Plasticity in the Cerebellum: What Molecular Mechanisms Are
behind Physiological Learning, Institute of Science and Technology Austria, 2023.'
date_created: 2023-04-06T07:54:09Z
date_published: 2023-04-06T00:00:00Z
date_updated: 2023-04-26T12:16:56Z
day: '06'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: GradSch
- _id: RySh
doi: 10.15479/at:ista:12809
file:
- access_level: closed
checksum: 35b5997d2b0acb461f9d33d073da0df5
content_type: application/pdf
creator: cchlebak
date_created: 2023-04-07T06:16:06Z
date_updated: 2023-04-07T06:16:06Z
embargo: 2024-04-07
embargo_to: open_access
file_id: '12814'
file_name: Thesis_CatarinaAlcarva_final pdfA.pdf
file_size: 9881969
relation: main_file
- access_level: closed
checksum: 81198f63c294890f6d58e8b29782efdc
content_type: application/pdf
creator: cchlebak
date_created: 2023-04-07T06:17:11Z
date_updated: 2023-04-07T06:17:11Z
file_id: '12815'
file_name: Thesis_CatarinaAlcarva_final_for printing.pdf
file_size: 44201583
relation: source_file
- access_level: closed
checksum: 0317bf7f457bb585f99d453ffa69eb53
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: cchlebak
date_created: 2023-04-07T06:18:05Z
date_updated: 2023-04-07T06:18:05Z
file_id: '12816'
file_name: Thesis_CatarinaAlcarva_final.docx
file_size: 84731244
relation: source_file
file_date_updated: 2023-04-07T06:18:05Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa_version: Published Version
page: '115'
project:
- _id: 267DFB90-B435-11E9-9278-68D0E5697425
name: 'Plasticity in the cerebellum: Which molecular mechanisms are behind physiological
learning?'
publication_identifier:
issn:
- 2663 - 337X
publication_status: published
publisher: Institute of Science and Technology Austria
status: public
supervisor:
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
title: 'Plasticity in the cerebellum: What molecular mechanisms are behind physiological
learning'
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2023'
...
---
_id: '13048'
abstract:
- lang: eng
text: In this paper we introduce a pruning of the medial axis called the (λ,α)-medial
axis (axλα). We prove that the (λ,α)-medial axis of a set K is stable in a Gromov-Hausdorff
sense under weak assumptions. More formally we prove that if K and K′ are close
in the Hausdorff (dH) sense then the (λ,α)-medial axes of K and K′ are close as
metric spaces, that is the Gromov-Hausdorff distance (dGH) between the two is
1/4-Hölder in the sense that dGH (axλα(K),axλα(K′)) ≲ dH(K,K′)1/4. The Hausdorff
distance between the two medial axes is also bounded, by dH (axλα(K),λα(K′)) ≲
dH(K,K′)1/2. These quantified stability results provide guarantees for practical
computations of medial axes from approximations. Moreover, they provide key ingredients
for studying the computability of the medial axis in the context of computable
analysis.
acknowledgement: "We are greatly indebted to Erin Chambers for posing a number of
questions that eventually led to this paper. We would also like to thank the other
organizers of the workshop on ‘Algorithms\r\nfor the medial axis’. We are also indebted
to Tatiana Ezubova for helping with the search for and translation of Russian literature.
The second author thanks all members of the Edelsbrunner and Datashape groups for
the atmosphere in which the research was conducted.\r\nThe research leading to these
results has received funding from the European Research Council (ERC) under the
European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement
No. 339025 GUDHI (Algorithmic Foundations of Geometry Understanding in Higher Dimensions).
Supported by the European Union’s Horizon 2020 research and innovation programme
under the Marie Skłodowska-Curie grant agreement No. 754411. The Austrian science
fund (FWF) M-3073."
article_processing_charge: No
author:
- first_name: André
full_name: Lieutier, André
last_name: Lieutier
- first_name: Mathijs
full_name: Wintraecken, Mathijs
id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
last_name: Wintraecken
orcid: 0000-0002-7472-2220
citation:
ama: 'Lieutier A, Wintraecken M. Hausdorff and Gromov-Hausdorff stable subsets of
the medial axis. In: Proceedings of the 55th Annual ACM Symposium on Theory
of Computing. Association for Computing Machinery; 2023:1768-1776. doi:10.1145/3564246.3585113'
apa: 'Lieutier, A., & Wintraecken, M. (2023). Hausdorff and Gromov-Hausdorff
stable subsets of the medial axis. In Proceedings of the 55th Annual ACM Symposium
on Theory of Computing (pp. 1768–1776). Orlando, FL, United States: Association
for Computing Machinery. https://doi.org/10.1145/3564246.3585113'
chicago: Lieutier, André, and Mathijs Wintraecken. “Hausdorff and Gromov-Hausdorff
Stable Subsets of the Medial Axis.” In Proceedings of the 55th Annual ACM Symposium
on Theory of Computing, 1768–76. Association for Computing Machinery, 2023.
https://doi.org/10.1145/3564246.3585113.
ieee: A. Lieutier and M. Wintraecken, “Hausdorff and Gromov-Hausdorff stable subsets
of the medial axis,” in Proceedings of the 55th Annual ACM Symposium on Theory
of Computing, Orlando, FL, United States, 2023, pp. 1768–1776.
ista: 'Lieutier A, Wintraecken M. 2023. Hausdorff and Gromov-Hausdorff stable subsets
of the medial axis. Proceedings of the 55th Annual ACM Symposium on Theory of
Computing. STOC: Symposium on Theory of Computing, 1768–1776.'
mla: Lieutier, André, and Mathijs Wintraecken. “Hausdorff and Gromov-Hausdorff Stable
Subsets of the Medial Axis.” Proceedings of the 55th Annual ACM Symposium on
Theory of Computing, Association for Computing Machinery, 2023, pp. 1768–76,
doi:10.1145/3564246.3585113.
short: A. Lieutier, M. Wintraecken, in:, Proceedings of the 55th Annual ACM Symposium
on Theory of Computing, Association for Computing Machinery, 2023, pp. 1768–1776.
conference:
end_date: 2023-06-23
location: Orlando, FL, United States
name: 'STOC: Symposium on Theory of Computing'
start_date: 2023-06-20
date_created: 2023-05-22T08:02:02Z
date_published: 2023-06-02T00:00:00Z
date_updated: 2023-05-22T08:15:19Z
day: '02'
department:
- _id: HeEd
doi: 10.1145/3564246.3585113
ec_funded: 1
external_id:
arxiv:
- '2303.04014'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2303.04014
month: '06'
oa: 1
oa_version: Preprint
page: 1768-1776
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: Proceedings of the 55th Annual ACM Symposium on Theory of Computing
publication_identifier:
isbn:
- '9781450399135'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
status: public
title: Hausdorff and Gromov-Hausdorff stable subsets of the medial axis
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '13053'
abstract:
- lang: eng
text: 'Deep neural networks (DNNs) often have to be compressed, via pruning and/or
quantization, before they can be deployed in practical settings. In this work
we propose a new compression-aware minimizer dubbed CrAM that modifies the optimization
step in a principled way, in order to produce models whose local loss behavior
is stable under compression operations such as pruning. Thus, dense models trained
via CrAM should be compressible post-training, in a single step, without significant
accuracy loss. Experimental results on standard benchmarks, such as residual networks
for ImageNet classification and BERT models for language modelling, show that
CrAM produces dense models that can be more accurate than the standard SGD/Adam-based
baselines, but which are stable under weight pruning: specifically, we can prune
models in one-shot to 70-80% sparsity with almost no accuracy loss, and to 90%
with reasonable (∼1%) accuracy loss, which is competitive with gradual compression
methods. Additionally, CrAM can produce sparse models which perform well for transfer
learning, and it also works for semi-structured 2:4 pruning patterns supported
by GPU hardware. The code for reproducing the results is available at this https
URL .'
acknowledged_ssus:
- _id: ScienComp
acknowledgement: "AP, EK, DA received funding from the European Research Council (ERC)
under the European\r\nUnion’s Horizon 2020 research and innovation programme (grant
agreement No 805223 ScaleML). AV acknowledges the support of the French Agence Nationale
de la Recherche (ANR), under grant ANR-21-CE48-0016 (project COMCOPT). We further
acknowledge the support from the Scientific Service Units (SSU) of ISTA through
resources provided by Scientific Computing (SciComp)-"
article_processing_charge: No
author:
- first_name: Elena-Alexandra
full_name: Peste, Elena-Alexandra
id: 32D78294-F248-11E8-B48F-1D18A9856A87
last_name: Peste
- first_name: Adrian
full_name: Vladu, Adrian
last_name: Vladu
- first_name: Eldar
full_name: Kurtic, Eldar
id: 47beb3a5-07b5-11eb-9b87-b108ec578218
last_name: Kurtic
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
- 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: 'Peste E-A, Vladu A, Kurtic E, Lampert C, Alistarh D-A. CrAM: A Compression-Aware
Minimizer. In: 11th International Conference on Learning Representations .'
apa: 'Peste, E.-A., Vladu, A., Kurtic, E., Lampert, C., & Alistarh, D.-A. (n.d.).
CrAM: A Compression-Aware Minimizer. In 11th International Conference on Learning
Representations . Kigali, Rwanda .'
chicago: 'Peste, Elena-Alexandra, Adrian Vladu, Eldar Kurtic, Christoph Lampert,
and Dan-Adrian Alistarh. “CrAM: A Compression-Aware Minimizer.” In 11th International
Conference on Learning Representations , n.d.'
ieee: 'E.-A. Peste, A. Vladu, E. Kurtic, C. Lampert, and D.-A. Alistarh, “CrAM:
A Compression-Aware Minimizer,” in 11th International Conference on Learning
Representations , Kigali, Rwanda .'
ista: 'Peste E-A, Vladu A, Kurtic E, Lampert C, Alistarh D-A. CrAM: A Compression-Aware
Minimizer. 11th International Conference on Learning Representations . ICLR: International
Conference on Learning Representations.'
mla: 'Peste, Elena-Alexandra, et al. “CrAM: A Compression-Aware Minimizer.” 11th
International Conference on Learning Representations .'
short: E.-A. Peste, A. Vladu, E. Kurtic, C. Lampert, D.-A. Alistarh, in:, 11th International
Conference on Learning Representations , n.d.
conference:
end_date: 2023-05-05
location: 'Kigali, Rwanda '
name: 'ICLR: International Conference on Learning Representations'
start_date: 2023-05-01
date_created: 2023-05-23T11:36:18Z
date_published: 2023-05-01T00:00:00Z
date_updated: 2023-06-01T12:54:45Z
department:
- _id: GradSch
- _id: DaAl
- _id: ChLa
ec_funded: 1
external_id:
arxiv:
- '2207.14200'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://openreview.net/pdf?id=_eTZBs-yedr
month: '05'
oa: 1
oa_version: Preprint
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: '11th International Conference on Learning Representations '
publication_status: accepted
quality_controlled: '1'
related_material:
record:
- id: '13074'
relation: dissertation_contains
status: public
status: public
title: 'CrAM: A Compression-Aware Minimizer'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '13143'
abstract:
- lang: eng
text: "GIMPS and PrimeGrid are large-scale distributed projects dedicated to searching
giant prime numbers, usually of special forms like Mersenne and Proth primes.
The numbers in the current search-space are millions of digits large and the participating
volunteers need to run resource-consuming primality tests. Once a candidate prime
N has been found, the only way for another party to independently verify the primality
of N used to be by repeating the expensive primality test. To avoid the need for
second recomputation of each primality test, these projects have recently adopted
certifying mechanisms that enable efficient verification of performed tests. However,
the mechanisms presently in place only detect benign errors and there is no guarantee
against adversarial behavior: a malicious volunteer can mislead the project to
reject a giant prime as being non-prime.\r\nIn this paper, we propose a practical,
cryptographically-sound mechanism for certifying the non-primality of Proth numbers.
That is, a volunteer can – parallel to running the primality test for N – generate
an efficiently verifiable proof at a little extra cost certifying that N is not
prime. The interactive protocol has statistical soundness and can be made non-interactive
using the Fiat-Shamir heuristic.\r\nOur approach is based on a cryptographic primitive
called Proof of Exponentiation (PoE) which, for a group G, certifies that a tuple
(x,y,T)∈G2×N satisfies x2T=y (Pietrzak, ITCS 2019 and Wesolowski, J. Cryptol.
2020). In particular, we show how to adapt Pietrzak’s PoE at a moderate additional
cost to make it a cryptographically-sound certificate of non-primality."
acknowledgement: 'We are grateful to Pavel Atnashev for clarifying via e-mail several
aspects of the primality tests implementated in the PrimeGrid project. Pavel Hubáček
is supported by the Czech Academy of Sciences (RVO 67985840), the Grant Agency of
the Czech Republic under the grant agreement no. 19-27871X, and by the Charles University
project UNCE/SCI/004. Chethan Kamath is supported by Azrieli International Postdoctoral
Fellowship, ISF grants 484/18 and 1789/19, and ERC StG project SPP: Secrecy Preserving
Proofs.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Charlotte
full_name: Hoffmann, Charlotte
id: 0f78d746-dc7d-11ea-9b2f-83f92091afe7
last_name: Hoffmann
- first_name: Pavel
full_name: Hubáček, Pavel
last_name: Hubáček
- first_name: Chethan
full_name: Kamath, Chethan
last_name: Kamath
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Hoffmann C, Hubáček P, Kamath C, Pietrzak KZ. Certifying giant nonprimes.
In: Public-Key Cryptography - PKC 2023. Vol 13940. Springer Nature; 2023:530-553.
doi:10.1007/978-3-031-31368-4_19'
apa: 'Hoffmann, C., Hubáček, P., Kamath, C., & Pietrzak, K. Z. (2023). Certifying
giant nonprimes. In Public-Key Cryptography - PKC 2023 (Vol. 13940, pp.
530–553). Atlanta, GA, United States: Springer Nature. https://doi.org/10.1007/978-3-031-31368-4_19'
chicago: Hoffmann, Charlotte, Pavel Hubáček, Chethan Kamath, and Krzysztof Z Pietrzak.
“Certifying Giant Nonprimes.” In Public-Key Cryptography - PKC 2023, 13940:530–53.
Springer Nature, 2023. https://doi.org/10.1007/978-3-031-31368-4_19.
ieee: C. Hoffmann, P. Hubáček, C. Kamath, and K. Z. Pietrzak, “Certifying giant
nonprimes,” in Public-Key Cryptography - PKC 2023, Atlanta, GA, United
States, 2023, vol. 13940, pp. 530–553.
ista: 'Hoffmann C, Hubáček P, Kamath C, Pietrzak KZ. 2023. Certifying giant nonprimes.
Public-Key Cryptography - PKC 2023. PKC: Public-Key Cryptography, LNCS, vol. 13940,
530–553.'
mla: Hoffmann, Charlotte, et al. “Certifying Giant Nonprimes.” Public-Key Cryptography
- PKC 2023, vol. 13940, Springer Nature, 2023, pp. 530–53, doi:10.1007/978-3-031-31368-4_19.
short: C. Hoffmann, P. Hubáček, C. Kamath, K.Z. Pietrzak, in:, Public-Key Cryptography
- PKC 2023, Springer Nature, 2023, pp. 530–553.
conference:
end_date: 2023-05-10
location: Atlanta, GA, United States
name: 'PKC: Public-Key Cryptography'
start_date: 2023-05-07
date_created: 2023-06-18T22:00:47Z
date_published: 2023-05-02T00:00:00Z
date_updated: 2023-06-19T08:03:37Z
day: '02'
department:
- _id: KrPi
doi: 10.1007/978-3-031-31368-4_19
intvolume: ' 13940'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2023/238
month: '05'
oa: 1
oa_version: Submitted Version
page: 530-553
publication: Public-Key Cryptography - PKC 2023
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031313677'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Certifying giant nonprimes
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13940
year: '2023'
...
---
_id: '13142'
abstract:
- lang: eng
text: Reinforcement learning has received much attention for learning controllers
of deterministic systems. We consider a learner-verifier framework for stochastic
control systems and survey recent methods that formally guarantee a conjunction
of reachability and safety properties. Given a property and a lower bound on the
probability of the property being satisfied, our framework jointly learns a control
policy and a formal certificate to ensure the satisfaction of the property with
a desired probability threshold. Both the control policy and the formal certificate
are continuous functions from states to reals, which are learned as parameterized
neural networks. While in the deterministic case, the certificates are invariant
and barrier functions for safety, or Lyapunov and ranking functions for liveness,
in the stochastic case the certificates are supermartingales. For certificate
verification, we use interval arithmetic abstract interpretation to bound the
expected values of neural network functions.
acknowledgement: This work was supported in part by the ERC-2020-AdG 101020093, 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.
alternative_title:
- LNCS
article_processing_charge: No
author:
- 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
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
citation:
ama: 'Chatterjee K, Henzinger TA, Lechner M, Zikelic D. A learner-verifier framework
for neural network controllers and certificates of stochastic systems. In: Tools
and Algorithms for the Construction and Analysis of Systems . Vol 13993. Springer
Nature; 2023:3-25. doi:10.1007/978-3-031-30823-9_1'
apa: 'Chatterjee, K., Henzinger, T. A., Lechner, M., & Zikelic, D. (2023). A
learner-verifier framework for neural network controllers and certificates of
stochastic systems. In Tools and Algorithms for the Construction and Analysis
of Systems (Vol. 13993, pp. 3–25). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-30823-9_1'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Mathias Lechner, and Dorde
Zikelic. “A Learner-Verifier Framework for Neural Network Controllers and Certificates
of Stochastic Systems.” In Tools and Algorithms for the Construction and Analysis
of Systems , 13993:3–25. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30823-9_1.
ieee: K. Chatterjee, T. A. Henzinger, M. Lechner, and D. Zikelic, “A learner-verifier
framework for neural network controllers and certificates of stochastic systems,”
in Tools and Algorithms for the Construction and Analysis of Systems ,
Paris, France, 2023, vol. 13993, pp. 3–25.
ista: 'Chatterjee K, Henzinger TA, Lechner M, Zikelic D. 2023. A learner-verifier
framework for neural network controllers and certificates of stochastic systems.
Tools and Algorithms for the Construction and Analysis of Systems . TACAS: Tools
and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13993,
3–25.'
mla: Chatterjee, Krishnendu, et al. “A Learner-Verifier Framework for Neural Network
Controllers and Certificates of Stochastic Systems.” Tools and Algorithms for
the Construction and Analysis of Systems , vol. 13993, Springer Nature, 2023,
pp. 3–25, doi:10.1007/978-3-031-30823-9_1.
short: K. Chatterjee, T.A. Henzinger, M. Lechner, D. Zikelic, in:, Tools and Algorithms
for the Construction and Analysis of Systems , Springer Nature, 2023, pp. 3–25.
conference:
end_date: 2023-04-27
location: Paris, France
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2023-04-22
date_created: 2023-06-18T22:00:47Z
date_published: 2023-04-22T00:00:00Z
date_updated: 2023-06-19T08:30:54Z
day: '22'
ddc:
- '000'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-031-30823-9_1
ec_funded: 1
file:
- access_level: open_access
checksum: 3d8a8bb24d211bc83360dfc2fd744307
content_type: application/pdf
creator: dernst
date_created: 2023-06-19T08:29:30Z
date_updated: 2023-06-19T08:29:30Z
file_id: '13150'
file_name: 2023_LNCS_Chatterjee.pdf
file_size: 528455
relation: main_file
success: 1
file_date_updated: 2023-06-19T08:29:30Z
has_accepted_license: '1'
intvolume: ' 13993'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 3-25
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: 'Tools and Algorithms for the Construction and Analysis of Systems '
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031308222'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: A learner-verifier framework for neural network controllers and certificates
of stochastic systems
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: 13993
year: '2023'
...
---
_id: '13141'
abstract:
- lang: eng
text: "We automatically compute a new class of environment assumptions in two-player
turn-based finite graph games which characterize an “adequate cooperation” needed
from the environment to allow the system player to win. Given an ω-regular winning
condition Φ for the system player, we compute an ω-regular assumption Ψ for the
environment player, such that (i) every environment strategy compliant with Ψ
allows the system to fulfill Φ (sufficiency), (ii) Ψ\r\n can be fulfilled by the
environment for every strategy of the system (implementability), and (iii) Ψ does
not prevent any cooperative strategy choice (permissiveness).\r\nFor parity games,
which are canonical representations of ω-regular games, we present a polynomial-time
algorithm for the symbolic computation of adequately permissive assumptions and
show that our algorithm runs faster and produces better assumptions than existing
approaches—both theoretically and empirically. To the best of our knowledge, for
ω\r\n-regular games, we provide the first algorithm to compute sufficient and
implementable environment assumptions that are also permissive."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Ashwani
full_name: Anand, Ashwani
last_name: Anand
- first_name: Kaushik
full_name: Mallik, Kaushik
id: 0834ff3c-6d72-11ec-94e0-b5b0a4fb8598
last_name: Mallik
orcid: 0000-0001-9864-7475
- first_name: Satya Prakash
full_name: Nayak, Satya Prakash
last_name: Nayak
- first_name: Anne Kathrin
full_name: Schmuck, Anne Kathrin
last_name: Schmuck
citation:
ama: 'Anand A, Mallik K, Nayak SP, Schmuck AK. Computing adequately permissive assumptions
for synthesis. In: TACAS 2023: Tools and Algorithms for the Construction and
Analysis of Systems. Vol 13994. Springer Nature; 2023:211-228. doi:10.1007/978-3-031-30820-8_15'
apa: 'Anand, A., Mallik, K., Nayak, S. P., & Schmuck, A. K. (2023). Computing
adequately permissive assumptions for synthesis. In TACAS 2023: Tools and Algorithms
for the Construction and Analysis of Systems (Vol. 13994, pp. 211–228). Paris,
France: Springer Nature. https://doi.org/10.1007/978-3-031-30820-8_15'
chicago: 'Anand, Ashwani, Kaushik Mallik, Satya Prakash Nayak, and Anne Kathrin
Schmuck. “Computing Adequately Permissive Assumptions for Synthesis.” In TACAS
2023: Tools and Algorithms for the Construction and Analysis of Systems, 13994:211–28.
Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30820-8_15.'
ieee: 'A. Anand, K. Mallik, S. P. Nayak, and A. K. Schmuck, “Computing adequately
permissive assumptions for synthesis,” in TACAS 2023: Tools and Algorithms
for the Construction and Analysis of Systems, Paris, France, 2023, vol. 13994,
pp. 211–228.'
ista: 'Anand A, Mallik K, Nayak SP, Schmuck AK. 2023. Computing adequately permissive
assumptions for synthesis. TACAS 2023: Tools and Algorithms for the Construction
and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and
Analysis of Systems, LNCS, vol. 13994, 211–228.'
mla: 'Anand, Ashwani, et al. “Computing Adequately Permissive Assumptions for Synthesis.”
TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems,
vol. 13994, Springer Nature, 2023, pp. 211–28, doi:10.1007/978-3-031-30820-8_15.'
short: 'A. Anand, K. Mallik, S.P. Nayak, A.K. Schmuck, in:, TACAS 2023: Tools and
Algorithms for the Construction and Analysis of Systems, Springer Nature, 2023,
pp. 211–228.'
conference:
end_date: 2023-04-27
location: Paris, France
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2023-04-22
date_created: 2023-06-18T22:00:47Z
date_published: 2023-04-20T00:00:00Z
date_updated: 2023-06-19T08:49:46Z
day: '20'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-031-30820-8_15
file:
- access_level: open_access
checksum: 60dcafc1b4f6f070be43bad3fe877974
content_type: application/pdf
creator: dernst
date_created: 2023-06-19T08:43:21Z
date_updated: 2023-06-19T08:43:21Z
file_id: '13151'
file_name: 2023_LNCS_Anand.pdf
file_size: 521425
relation: main_file
success: 1
file_date_updated: 2023-06-19T08:43:21Z
has_accepted_license: '1'
intvolume: ' 13994'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 211-228
publication: 'TACAS 2023: Tools and Algorithms for the Construction and Analysis of
Systems'
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031308192'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Computing adequately permissive assumptions for synthesis
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: 13994
year: '2023'
...
---
_id: '12826'
abstract:
- lang: eng
text: "During navigation, animals can infer the structure of the environment by
computing the optic flow cues elicited by their own movements, and subsequently
use this information to instruct proper locomotor actions. These computations
require a panoramic assessment of the visual environment in order to disambiguate
similar sensory experiences that may require distinct behavioral responses. The
estimation of the global motion patterns is therefore essential for successful
navigation. Yet, our understanding of the algorithms and implementations that
enable coherent panoramic visual perception remains scarce. Here I pursue this
problem by dissecting the functional aspects of interneuronal communication in
the lobula plate tangential cell network in Drosophila melanogaster. The results
presented in the thesis demonstrate that the basis for effective interpretation
of the optic flow in this circuit are stereotyped synaptic connections that mediate
the formation of distinct subnetworks, each extracting a particular pattern of
global motion. \r\nFirstly, I show that gap junctions are essential for a correct
interpretation of binocular motion cues by horizontal motion-sensitive cells.
HS cells form electrical synapses with contralateral H2 neurons that are involved
in detecting yaw rotation and translation. I developed an FlpStop-mediated mutant
of a gap junction protein ShakB that disrupts these electrical synapses. While
the loss of electrical synapses does not affect the tuning of the direction selectivity
in HS neurons, it severely alters their sensitivity to horizontal motion in the
contralateral side. These physiological changes result in an inappropriate integration
of binocular motion cues in walking animals. While wild-type flies form a binocular
perception of visual motion by non-linear integration of monocular optic flow
cues, the mutant flies sum the monocular inputs linearly. These results indicate
that rather than averaging signals in neighboring neurons, gap-junctions operate
in conjunction with chemical synapses to mediate complex non-linear optic flow
computations.\r\nSecondly, I show that stochastic manipulation of neuronal activity
in the lobula plate tangential cell network is a powerful approach to study the
neuronal implementation of optic flow-based navigation in flies. Tangential neurons
form multiple subnetworks, each mediating course-stabilizing response to a particular
global pattern of visual motion. Application of genetic mosaic techniques can
provide sparse optogenetic activation of HS cells in numerous combinations. These
distinct combinations of activated neurons drive an array of distinct behavioral
responses, providing important insights into how visuomotor transformation is
performed in the lobula plate tangential cell network. This approach can be complemented
by stochastic silencing of tangential neurons, enabling direct assessment of the
functional role of individual tangential neurons in the processing of specific
visual motion patterns.\r\n\tTaken together, the findings presented in this thesis
suggest that establishing specific activity patterns of tangential cells via stereotyped
synaptic connectivity is a key to efficient optic flow-based navigation in Drosophila
melanogaster."
acknowledged_ssus:
- _id: Bio
- _id: LifeSc
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Victoria
full_name: Pokusaeva, Victoria
id: 3184041C-F248-11E8-B48F-1D18A9856A87
last_name: Pokusaeva
orcid: 0000-0001-7660-444X
citation:
ama: Pokusaeva V. Neural control of optic flow-based navigation in Drosophila melanogaster.
2023. doi:10.15479/at:ista:12826
apa: Pokusaeva, V. (2023). Neural control of optic flow-based navigation in Drosophila
melanogaster. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12826
chicago: Pokusaeva, Victoria. “Neural Control of Optic Flow-Based Navigation in
Drosophila Melanogaster.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:12826.
ieee: V. Pokusaeva, “Neural control of optic flow-based navigation in Drosophila
melanogaster,” Institute of Science and Technology Austria, 2023.
ista: Pokusaeva V. 2023. Neural control of optic flow-based navigation in Drosophila
melanogaster. Institute of Science and Technology Austria.
mla: Pokusaeva, Victoria. Neural Control of Optic Flow-Based Navigation in Drosophila
Melanogaster. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:12826.
short: V. Pokusaeva, Neural Control of Optic Flow-Based Navigation in Drosophila
Melanogaster, Institute of Science and Technology Austria, 2023.
date_created: 2023-04-14T14:56:04Z
date_published: 2023-04-18T00:00:00Z
date_updated: 2023-06-23T09:47:36Z
day: '18'
ddc:
- '570'
- '571'
degree_awarded: PhD
department:
- _id: MaJö
- _id: GradSch
doi: 10.15479/at:ista:12826
ec_funded: 1
file:
- access_level: closed
checksum: 5f589a9af025f7eeebfd0c186209913e
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: vpokusae
date_created: 2023-04-20T09:14:38Z
date_updated: 2023-04-20T09:26:51Z
file_id: '12857'
file_name: Thesis_Pokusaeva.docx
file_size: 14507243
relation: source_file
- access_level: open_access
checksum: bbeed76db45a996b4c91a9abe12ce0ec
content_type: application/pdf
creator: vpokusae
date_created: 2023-04-20T09:14:44Z
date_updated: 2023-04-20T09:14:44Z
file_id: '12858'
file_name: Thesis_Pokusaeva.pdf
file_size: 10090711
relation: main_file
success: 1
file_date_updated: 2023-04-20T09:26:51Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '106'
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication_identifier:
issn:
- 2663 - 337X
publication_status: published
publisher: Institute of Science and Technology Austria
status: public
supervisor:
- first_name: Maximilian A
full_name: Jösch, Maximilian A
id: 2BD278E6-F248-11E8-B48F-1D18A9856A87
last_name: Jösch
orcid: 0000-0002-3937-1330
title: Neural control of optic flow-based navigation in Drosophila melanogaster
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2023'
...
---
_id: '12086'
abstract:
- lang: eng
text: We present a simple algorithm for computing higher-order Delaunay mosaics
that works in Euclidean spaces of any finite dimensions. The algorithm selects
the vertices of the order-k mosaic from incrementally constructed lower-order
mosaics and uses an algorithm for weighted first-order Delaunay mosaics as a black-box
to construct the order-k mosaic from its vertices. Beyond this black-box, the
algorithm uses only combinatorial operations, thus facilitating easy implementation.
We extend this algorithm to compute higher-order α-shapes and provide open-source
implementations. We present experimental results for properties of higher-order
Delaunay mosaics of random point sets.
acknowledgement: Open access funding provided by Austrian Science Fund (FWF). This
project has received funding from the European Research Council (ERC) under the
European Union’s Horizon 2020 research and innovation programme, Grant No. 788183,
from the Wittgenstein Prize, Austrian Science Fund (FWF), Grant No. Z 342-N31, and
from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry
and Dynamics’, Austrian Science Fund (FWF), Grant No. I 02979-N35.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Georg F
full_name: Osang, Georg F
id: 464B40D6-F248-11E8-B48F-1D18A9856A87
last_name: Osang
citation:
ama: Edelsbrunner H, Osang GF. A simple algorithm for higher-order Delaunay mosaics
and alpha shapes. Algorithmica. 2023;85:277-295. doi:10.1007/s00453-022-01027-6
apa: Edelsbrunner, H., & Osang, G. F. (2023). A simple algorithm for higher-order
Delaunay mosaics and alpha shapes. Algorithmica. Springer Nature. https://doi.org/10.1007/s00453-022-01027-6
chicago: Edelsbrunner, Herbert, and Georg F Osang. “A Simple Algorithm for Higher-Order
Delaunay Mosaics and Alpha Shapes.” Algorithmica. Springer Nature, 2023.
https://doi.org/10.1007/s00453-022-01027-6.
ieee: H. Edelsbrunner and G. F. Osang, “A simple algorithm for higher-order Delaunay
mosaics and alpha shapes,” Algorithmica, vol. 85. Springer Nature, pp.
277–295, 2023.
ista: Edelsbrunner H, Osang GF. 2023. A simple algorithm for higher-order Delaunay
mosaics and alpha shapes. Algorithmica. 85, 277–295.
mla: Edelsbrunner, Herbert, and Georg F. Osang. “A Simple Algorithm for Higher-Order
Delaunay Mosaics and Alpha Shapes.” Algorithmica, vol. 85, Springer Nature,
2023, pp. 277–95, doi:10.1007/s00453-022-01027-6.
short: H. Edelsbrunner, G.F. Osang, Algorithmica 85 (2023) 277–295.
date_created: 2022-09-11T22:01:57Z
date_published: 2023-01-01T00:00:00Z
date_updated: 2023-06-27T12:53:43Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s00453-022-01027-6
ec_funded: 1
external_id:
isi:
- '000846967100001'
file:
- access_level: open_access
checksum: 71685ca5121f4c837f40c3f8eb50c915
content_type: application/pdf
creator: dernst
date_created: 2023-01-20T10:02:48Z
date_updated: 2023-01-20T10:02:48Z
file_id: '12322'
file_name: 2023_Algorithmica_Edelsbrunner.pdf
file_size: 911017
relation: main_file
success: 1
file_date_updated: 2023-01-20T10:02:48Z
has_accepted_license: '1'
intvolume: ' 85'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 277-295
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: The Wittgenstein Prize
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
publication: Algorithmica
publication_identifier:
eissn:
- 1432-0541
issn:
- 0178-4617
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: A simple algorithm for higher-order Delaunay mosaics and alpha shapes
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: 2EBD1598-F248-11E8-B48F-1D18A9856A87
volume: 85
year: '2023'
...
---
_id: '12104'
abstract:
- lang: eng
text: We study ergodic decompositions of Dirichlet spaces under intertwining via
unitary order isomorphisms. We show that the ergodic decomposition of a quasi-regular
Dirichlet space is unique up to a unique isomorphism of the indexing space. Furthermore,
every unitary order isomorphism intertwining two quasi-regular Dirichlet spaces
is decomposable over their ergodic decompositions up to conjugation via an isomorphism
of the corresponding indexing spaces.
acknowledgement: Research supported by the Austrian Science Fund (FWF) grant F65 at
the Institute of Science and Technology Austria and by the European Research Council
(ERC) (Grant agreement No. 716117 awarded to Prof. Dr. Jan Maas). L.D.S. gratefully
acknowledges funding of his current position by the Austrian Science Fund (FWF)
through the ESPRIT Programme (Grant No. 208). M.W. gratefully acknowledges funding
of his current position by the Austrian Science Fund (FWF) through the ESPRIT Programme
(Grant No. 156).
article_number: '9'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Lorenzo
full_name: Dello Schiavo, Lorenzo
id: ECEBF480-9E4F-11EA-B557-B0823DDC885E
last_name: Dello Schiavo
orcid: 0000-0002-9881-6870
- first_name: Melchior
full_name: Wirth, Melchior
id: 88644358-0A0E-11EA-8FA5-49A33DDC885E
last_name: Wirth
orcid: 0000-0002-0519-4241
citation:
ama: Dello Schiavo L, Wirth M. Ergodic decompositions of Dirichlet forms under order
isomorphisms. Journal of Evolution Equations. 2023;23(1). doi:10.1007/s00028-022-00859-7
apa: Dello Schiavo, L., & Wirth, M. (2023). Ergodic decompositions of Dirichlet
forms under order isomorphisms. Journal of Evolution Equations. Springer
Nature. https://doi.org/10.1007/s00028-022-00859-7
chicago: Dello Schiavo, Lorenzo, and Melchior Wirth. “Ergodic Decompositions of
Dirichlet Forms under Order Isomorphisms.” Journal of Evolution Equations.
Springer Nature, 2023. https://doi.org/10.1007/s00028-022-00859-7.
ieee: L. Dello Schiavo and M. Wirth, “Ergodic decompositions of Dirichlet forms
under order isomorphisms,” Journal of Evolution Equations, vol. 23, no.
1. Springer Nature, 2023.
ista: Dello Schiavo L, Wirth M. 2023. Ergodic decompositions of Dirichlet forms
under order isomorphisms. Journal of Evolution Equations. 23(1), 9.
mla: Dello Schiavo, Lorenzo, and Melchior Wirth. “Ergodic Decompositions of Dirichlet
Forms under Order Isomorphisms.” Journal of Evolution Equations, vol. 23,
no. 1, 9, Springer Nature, 2023, doi:10.1007/s00028-022-00859-7.
short: L. Dello Schiavo, M. Wirth, Journal of Evolution Equations 23 (2023).
date_created: 2023-01-08T23:00:53Z
date_published: 2023-01-01T00:00:00Z
date_updated: 2023-06-28T11:54:35Z
day: '01'
ddc:
- '510'
department:
- _id: JaMa
doi: 10.1007/s00028-022-00859-7
ec_funded: 1
external_id:
isi:
- '000906214600004'
file:
- access_level: open_access
checksum: 1f34f3e2cb521033de6154f274ea3a4e
content_type: application/pdf
creator: dernst
date_created: 2023-01-20T10:45:06Z
date_updated: 2023-01-20T10:45:06Z
file_id: '12325'
file_name: 2023_JourEvolutionEquations_DelloSchiavo.pdf
file_size: 422612
relation: main_file
success: 1
file_date_updated: 2023-01-20T10:45:06Z
has_accepted_license: '1'
intvolume: ' 23'
isi: 1
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
grant_number: F6504
name: Taming Complexity in Partial Differential Systems
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '716117'
name: Optimal Transport and Stochastic Dynamics
- _id: 34dbf174-11ca-11ed-8bc3-afe9d43d4b9c
grant_number: E208
name: Configuration Spaces over Non-Smooth Spaces
- _id: 34c6ea2d-11ca-11ed-8bc3-c04f3c502833
grant_number: ESP156_N
name: Gradient flow techniques for quantum Markov semigroups
publication: Journal of Evolution Equations
publication_identifier:
eissn:
- 1424-3202
issn:
- 1424-3199
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Ergodic decompositions of Dirichlet forms under order isomorphisms
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: 23
year: '2023'
...
---
_id: '11434'
abstract:
- lang: eng
text: The Indian summer monsoon rainfall (ISMR) has been declining since the 1950s.
However, since 2002 it is reported to have revived. For these observed changes
in the ISMR, several explanations have been reported. Among these explanations,
however, the role of the eastern equatorial Indian Ocean (EEIO) is missing despite
being one of the warmest regions in the Indian Ocean, and monotonously warming.
A recent study reported that EEIO warming impacts the rainfall over northern India.
Here we report that warming in the EEIO weakens the low-level Indian summer monsoon
circulation and reduces ISMR. A warm EEIO drives easterly winds in the Indo–Pacific
sector as a Gill response. The warm EEIO also enhances nocturnal convection offshore
the western coast of Sumatra. The latent heating associated with the increased
convection augments the Gill response and the resultant circulation opposes the
monsoon low-level circulation and weakens the seasonal rainfall.
acknowledgement: This work was supported by the National Research Foundation of Korea
(NRF) grant funded by the Korea government (MSIT) (NRF-2018R1A5A1024958). Model
simulation and data transfer were supported by the National Supercomputing Center
with supercomputing resources including technical support (KSC-2019-CHA-0005), the
National Center for Meteorological Supercomputer of Korea Meteorological Administration,
and by the Korea Research Environment Open NETwork (KREONET), respectively. The
authors declare no conflicts of interest.
article_processing_charge: No
article_type: original
author:
- first_name: Bidyut B
full_name: Goswami, Bidyut B
id: 3a4ac09c-6d61-11ec-bf66-884cde66b64b
last_name: Goswami
citation:
ama: GOSWAMI BB. Role of the eastern equatorial Indian Ocean warming in the Indian
summer monsoon rainfall trend. Climate Dynamics. 2023;60:427-442. doi:10.1007/s00382-022-06337-7
apa: GOSWAMI, B. B. (2023). Role of the eastern equatorial Indian Ocean warming
in the Indian summer monsoon rainfall trend. Climate Dynamics. Springer
Nature. https://doi.org/10.1007/s00382-022-06337-7
chicago: GOSWAMI, BIDYUT B. “Role of the Eastern Equatorial Indian Ocean Warming
in the Indian Summer Monsoon Rainfall Trend.” Climate Dynamics. Springer
Nature, 2023. https://doi.org/10.1007/s00382-022-06337-7.
ieee: B. B. GOSWAMI, “Role of the eastern equatorial Indian Ocean warming in the
Indian summer monsoon rainfall trend,” Climate Dynamics, vol. 60. Springer
Nature, pp. 427–442, 2023.
ista: GOSWAMI BB. 2023. Role of the eastern equatorial Indian Ocean warming in the
Indian summer monsoon rainfall trend. Climate Dynamics. 60, 427–442.
mla: GOSWAMI, BIDYUT B. “Role of the Eastern Equatorial Indian Ocean Warming in
the Indian Summer Monsoon Rainfall Trend.” Climate Dynamics, vol. 60, Springer
Nature, 2023, pp. 427–42, doi:10.1007/s00382-022-06337-7.
short: B.B. GOSWAMI, Climate Dynamics 60 (2023) 427–442.
date_created: 2022-06-05T22:01:50Z
date_published: 2023-01-01T00:00:00Z
date_updated: 2023-06-28T11:49:58Z
day: '01'
department:
- _id: CaMu
doi: 10.1007/s00382-022-06337-7
external_id:
isi:
- '000803119400002'
intvolume: ' 60'
isi: 1
language:
- iso: eng
month: '01'
oa_version: None
page: 427-442
publication: Climate Dynamics
publication_identifier:
eissn:
- 1432-0894
issn:
- 0930-7575
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: ' https://doi.org/10.1007/s00382-022-06401-2'
scopus_import: '1'
status: public
title: Role of the eastern equatorial Indian Ocean warming in the Indian summer monsoon
rainfall trend
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 60
year: '2023'
...
---
_id: '12467'
abstract:
- lang: eng
text: Safety and liveness are elementary concepts of computation, and the foundation
of many verification paradigms. The safety-liveness classification of boolean
properties characterizes whether a given property can be falsified by observing
a finite prefix of an infinite computation trace (always for safety, never for
liveness). In quantitative specification and verification, properties assign not
truth values, but quantitative values to infinite traces (e.g., a cost, or the
distance to a boolean property). We introduce quantitative safety and liveness,
and we prove that our definitions induce conservative quantitative generalizations
of both (1)~the safety-progress hierarchy of boolean properties and (2)~the safety-liveness
decomposition of boolean properties. In particular, we show that every quantitative
property can be written as the pointwise minimum of a quantitative safety property
and a quantitative liveness property. Consequently, like boolean properties, also
quantitative properties can be min-decomposed into safety and liveness parts,
or alternatively, max-decomposed into co-safety and co-liveness parts. Moreover,
quantitative properties can be approximated naturally. We prove that every quantitative
property that has both safe and co-safe approximations can be monitored arbitrarily
precisely by a monitor that uses only a finite number of states.
acknowledgement: We thank the anonymous reviewers for their helpful comments. This
work was supported in part by the ERC-2020-AdG 101020093.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Nicolas Adrien
full_name: Mazzocchi, Nicolas Adrien
id: b26baa86-3308-11ec-87b0-8990f34baa85
last_name: Mazzocchi
- first_name: Naci E
full_name: Sarac, Naci E
id: 8C6B42F8-C8E6-11E9-A03A-F2DCE5697425
last_name: Sarac
citation:
ama: 'Henzinger TA, Mazzocchi NA, Sarac NE. Quantitative safety and liveness. In:
26th International Conference Foundations of Software Science and Computation
Structures. Vol 13992. Springer Nature; 2023:349-370. doi:10.1007/978-3-031-30829-1_17'
apa: 'Henzinger, T. A., Mazzocchi, N. A., & Sarac, N. E. (2023). Quantitative
safety and liveness. In 26th International Conference Foundations of Software
Science and Computation Structures (Vol. 13992, pp. 349–370). Paris, France:
Springer Nature. https://doi.org/10.1007/978-3-031-30829-1_17'
chicago: Henzinger, Thomas A, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Quantitative
Safety and Liveness.” In 26th International Conference Foundations of Software
Science and Computation Structures, 13992:349–70. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30829-1_17.
ieee: T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Quantitative safety and
liveness,” in 26th International Conference Foundations of Software Science
and Computation Structures, Paris, France, 2023, vol. 13992, pp. 349–370.
ista: 'Henzinger TA, Mazzocchi NA, Sarac NE. 2023. Quantitative safety and liveness.
26th International Conference Foundations of Software Science and Computation
Structures. FOSSACS: Foundations of Software Science and Computation Structures,
LNCS, vol. 13992, 349–370.'
mla: Henzinger, Thomas A., et al. “Quantitative Safety and Liveness.” 26th International
Conference Foundations of Software Science and Computation Structures, vol.
13992, Springer Nature, 2023, pp. 349–70, doi:10.1007/978-3-031-30829-1_17.
short: T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 26th International Conference
Foundations of Software Science and Computation Structures, Springer Nature, 2023,
pp. 349–370.
conference:
end_date: 2023-04-27
location: Paris, France
name: 'FOSSACS: Foundations of Software Science and Computation Structures'
start_date: 2023-04-22
date_created: 2023-01-31T07:23:56Z
date_published: 2023-04-21T00:00:00Z
date_updated: 2023-07-14T11:20:27Z
day: '21'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
doi: 10.1007/978-3-031-30829-1_17
ec_funded: 1
external_id:
arxiv:
- '2301.11175'
file:
- access_level: open_access
checksum: 981025aed580b6b27c426cb8856cf63e
content_type: application/pdf
creator: esarac
date_created: 2023-01-31T07:22:21Z
date_updated: 2023-01-31T07:22:21Z
file_id: '12468'
file_name: qsl.pdf
file_size: 449027
relation: main_file
success: 1
- access_level: open_access
checksum: f16e2af1e0eb243158ab0f0fe74e7d5a
content_type: application/pdf
creator: dernst
date_created: 2023-06-19T10:28:09Z
date_updated: 2023-06-19T10:28:09Z
file_id: '13153'
file_name: 2023_LNCS_HenzingerT.pdf
file_size: 1048171
relation: main_file
success: 1
file_date_updated: 2023-06-19T10:28:09Z
has_accepted_license: '1'
intvolume: ' 13992'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 349-370
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: 26th International Conference Foundations of Software Science and Computation
Structures
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031308284'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quantitative safety and liveness
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 13992
year: '2023'
...
---
_id: '13179'
abstract:
- lang: eng
text: "Writing concurrent code that is both correct and efficient is notoriously
difficult. Thus, programmers often prefer to use synchronization abstractions,
which render code simpler and easier to reason about. Despite a wealth of work
on this topic, there is still a gap between the rich semantics provided by synchronization
abstractions in modern programming languages—specifically, fair FIFO ordering
of synchronization requests and support for abortable operations—and frameworks
for implementing it correctly and efficiently. Supporting such semantics is critical
given the rising popularity of constructs for asynchronous programming, such as
coroutines, which abort frequently and are cheaper to suspend and resume compared
to native threads.\r\n\r\nThis paper introduces a new framework called CancellableQueueSynchronizer
(CQS), which enables simple yet efficient implementations of a wide range of fair
and abortable synchronization primitives: mutexes, semaphores, barriers, count-down
latches, and blocking pools. Our main contribution is algorithmic, as implementing
both fairness and abortability efficiently at this level of generality is non-trivial.
Importantly, all our algorithms, including the CQS framework and the primitives
built on top of it, come with formal proofs in the Iris framework for Coq for
many of their properties. These proofs are modular, so it is easy to show correctness
for new primitives implemented on top of CQS. From a practical perspective, implementation
of CQS for native threads on the JVM improves throughput by up to two orders of
magnitude over Java’s AbstractQueuedSynchronizer, the only practical abstraction
offering similar semantics. Further, we successfully integrated CQS as a core
component of the popular Kotlin Coroutines library, validating the framework’s
practical impact and expressiveness in a real-world environment. In sum, CancellableQueueSynchronizer
is the first framework to combine expressiveness with formal guarantees and solid
practical performance. Our approach should be extensible to other languages and
families of synchronization primitives."
article_number: '116'
article_processing_charge: No
article_type: original
author:
- first_name: Nikita
full_name: Koval, Nikita
id: 2F4DB10C-F248-11E8-B48F-1D18A9856A87
last_name: Koval
- first_name: Dmitry
full_name: Khalanskiy, Dmitry
last_name: Khalanskiy
- 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, Khalanskiy D, Alistarh D-A. CQS: A formally-verified framework for
fair and abortable synchronization. Proceedings of the ACM on Programming Languages.
2023;7. doi:10.1145/3591230'
apa: 'Koval, N., Khalanskiy, D., & Alistarh, D.-A. (2023). CQS: A formally-verified
framework for fair and abortable synchronization. Proceedings of the ACM on
Programming Languages. Association for Computing Machinery . https://doi.org/10.1145/3591230'
chicago: 'Koval, Nikita, Dmitry Khalanskiy, and Dan-Adrian Alistarh. “CQS: A Formally-Verified
Framework for Fair and Abortable Synchronization.” Proceedings of the ACM on
Programming Languages. Association for Computing Machinery , 2023. https://doi.org/10.1145/3591230.'
ieee: 'N. Koval, D. Khalanskiy, and D.-A. Alistarh, “CQS: A formally-verified framework
for fair and abortable synchronization,” Proceedings of the ACM on Programming
Languages, vol. 7. Association for Computing Machinery , 2023.'
ista: 'Koval N, Khalanskiy D, Alistarh D-A. 2023. CQS: A formally-verified framework
for fair and abortable synchronization. Proceedings of the ACM on Programming
Languages. 7, 116.'
mla: 'Koval, Nikita, et al. “CQS: A Formally-Verified Framework for Fair and Abortable
Synchronization.” Proceedings of the ACM on Programming Languages, vol.
7, 116, Association for Computing Machinery , 2023, doi:10.1145/3591230.'
short: N. Koval, D. Khalanskiy, D.-A. Alistarh, Proceedings of the ACM on Programming
Languages 7 (2023).
date_created: 2023-07-02T22:00:43Z
date_published: 2023-06-06T00:00:00Z
date_updated: 2023-07-17T08:43:19Z
day: '06'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.1145/3591230
file:
- access_level: open_access
checksum: 5dba6e73f0ed79adbdae14d165bc2f68
content_type: application/pdf
creator: alisjak
date_created: 2023-07-03T13:09:39Z
date_updated: 2023-07-03T13:09:39Z
file_id: '13187'
file_name: 2023_ACMProgram.Lang._Koval.pdf
file_size: 1266773
relation: main_file
success: 1
file_date_updated: 2023-07-03T13:09:39Z
has_accepted_license: '1'
intvolume: ' 7'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: Proceedings of the ACM on Programming Languages
publication_identifier:
eissn:
- 2475-1421
publication_status: published
publisher: 'Association for Computing Machinery '
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'CQS: A formally-verified framework for fair and abortable synchronization'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2023'
...
---
_id: '13180'
abstract:
- lang: eng
text: We study the density of everywhere locally soluble diagonal quadric surfaces,
parameterised by rational points that lie on a split quadric surface
article_processing_charge: No
article_type: original
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Julian
full_name: Lyczak, Julian
id: 3572849A-F248-11E8-B48F-1D18A9856A87
last_name: Lyczak
- first_name: Roman
full_name: Sarapin, Roman
last_name: Sarapin
citation:
ama: Browning TD, Lyczak J, Sarapin R. Local solubility for a family of quadrics
over a split quadric surface. Involve. 2023;16(2):331-342. doi:10.2140/involve.2023.16.331
apa: Browning, T. D., Lyczak, J., & Sarapin, R. (2023). Local solubility for
a family of quadrics over a split quadric surface. Involve. Mathematical
Sciences Publishers. https://doi.org/10.2140/involve.2023.16.331
chicago: Browning, Timothy D, Julian Lyczak, and Roman Sarapin. “Local Solubility
for a Family of Quadrics over a Split Quadric Surface.” Involve. Mathematical
Sciences Publishers, 2023. https://doi.org/10.2140/involve.2023.16.331.
ieee: T. D. Browning, J. Lyczak, and R. Sarapin, “Local solubility for a family
of quadrics over a split quadric surface,” Involve, vol. 16, no. 2. Mathematical
Sciences Publishers, pp. 331–342, 2023.
ista: Browning TD, Lyczak J, Sarapin R. 2023. Local solubility for a family of quadrics
over a split quadric surface. Involve. 16(2), 331–342.
mla: Browning, Timothy D., et al. “Local Solubility for a Family of Quadrics over
a Split Quadric Surface.” Involve, vol. 16, no. 2, Mathematical Sciences
Publishers, 2023, pp. 331–42, doi:10.2140/involve.2023.16.331.
short: T.D. Browning, J. Lyczak, R. Sarapin, Involve 16 (2023) 331–342.
date_created: 2023-07-02T22:00:43Z
date_published: 2023-05-26T00:00:00Z
date_updated: 2023-07-17T08:39:19Z
day: '26'
department:
- _id: TiBr
doi: 10.2140/involve.2023.16.331
external_id:
arxiv:
- '2203.06881'
intvolume: ' 16'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2203.06881
month: '05'
oa: 1
oa_version: Preprint
page: 331-342
publication: Involve
publication_identifier:
eissn:
- 1944-4184
issn:
- 1944-4176
publication_status: published
publisher: Mathematical Sciences Publishers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Local solubility for a family of quadrics over a split quadric surface
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 16
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; :42-42.'
apa: 'Elefante, S., Stadlbauer, S., Alexander, M. F., & Schlögl, A. (n.d.).
Cryo-EM software packages: A sys-admins point of view. In ASHPC23 - Austrian-Slovenian
HPC Meeting 2023 (pp. 42–42). Maribor, Slovenia: EuroCC.'
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, n.d.'
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, pp. 42–42.'
ista: 'Elefante S, Stadlbauer S, Alexander MF, Schlögl A. 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, pp. 42–42.'
short: S. Elefante, S. Stadlbauer, M.F. Alexander, A. Schlögl, in:, ASHPC23 - Austrian-Slovenian
HPC Meeting 2023, EuroCC, n.d., pp. 42–42.
conference:
end_date: 2023-06-15
location: Maribor, Slovenia
name: 'ASHPC: Austrian-Slovenian HPC Meeting'
start_date: 2023-06-12
date_created: 2023-06-23T11:03:18Z
date_published: 2023-07-01T00:00:00Z
date_updated: 2023-07-18T09:32:16Z
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: accepted
publisher: EuroCC
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
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; :59-59.'
apa: 'Schlögl, A., Elefante, S., & Hodirnau, V.-V. (n.d.). Running Windows-applications
on a Linux HPC cluster using WINE. In ASHPC23 - Austrian-Slovenian HPC Meeting
2023 (pp. 59–59). Maribor, Slovenia: EuroCC.'
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, n.d.
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, pp. 59–59.
ista: 'Schlögl A, Elefante S, Hodirnau V-V. 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, pp.
59–59.
short: A. Schlögl, S. Elefante, V.-V. Hodirnau, in:, ASHPC23 - Austrian-Slovenian
HPC Meeting 2023, EuroCC, n.d., pp. 59–59.
conference:
end_date: 2023-06-15
location: Maribor, Slovenia
name: 'ASHPC: Austrian-Slovenian HPC Meeting'
start_date: 2023-06-13
date_created: 2023-06-23T11:01:23Z
date_published: 2023-07-01T00:00:00Z
date_updated: 2023-07-18T09:30:54Z
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: inpress
publisher: EuroCC
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: '13251'
abstract:
- lang: eng
text: A rotating organic cation and a dynamically disordered soft inorganic cage
are the hallmark features of organic-inorganic lead-halide perovskites. Understanding
the interplay between these two subsystems is a challenging problem, but it is
this coupling that is widely conjectured to be responsible for the unique behavior
of photocarriers in these materials. In this work, we use the fact that the polarizability
of the organic cation strongly depends on the ambient electrostatic environment
to put the molecule forward as a sensitive probe of the local crystal fields inside
the lattice cell. We measure the average polarizability of the C/N–H bond stretching
mode by means of infrared spectroscopy, which allows us to deduce the character
of the motion of the cation molecule, find the magnitude of the local crystal
field, and place an estimate on the strength of the hydrogen bond between the
hydrogen and halide atoms. Our results pave the way for understanding electric
fields in lead-halide perovskites using infrared bond spectroscopy.
acknowledgement: "We thank Bingqing Cheng and Hong-Zhou Ye for valuable discussions;
Y.W.’s work at IST Austria was supported through ISTernship summer internship program
funded by OeADGmbH; D.L. and Z.A. acknowledge support by IST Austria (ISTA); M.L.
acknowledges support by the European Research Council (ERC) Starting Grant No. 801770
(ANGULON).\r\nA.A.Z. and O.M.B. acknowledge support by KAUST."
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Yujing
full_name: Wei, Yujing
id: 0c5ff007-2600-11ee-b896-98bd8d663294
last_name: Wei
orcid: 0000-0001-8913-9719
- first_name: Artem
full_name: Volosniev, Artem
id: 37D278BC-F248-11E8-B48F-1D18A9856A87
last_name: Volosniev
orcid: 0000-0003-0393-5525
- first_name: Dusan
full_name: Lorenc, Dusan
id: 40D8A3E6-F248-11E8-B48F-1D18A9856A87
last_name: Lorenc
- first_name: Ayan A.
full_name: Zhumekenov, Ayan A.
last_name: Zhumekenov
- first_name: Osman M.
full_name: Bakr, Osman M.
last_name: Bakr
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
- first_name: Zhanybek
full_name: Alpichshev, Zhanybek
id: 45E67A2A-F248-11E8-B48F-1D18A9856A87
last_name: Alpichshev
orcid: 0000-0002-7183-5203
citation:
ama: Wei Y, Volosniev A, Lorenc D, et al. Bond polarizability as a probe of local
crystal fields in hybrid lead-halide perovskites. The Journal of Physical Chemistry
Letters. 2023;14(27):6309-6314. doi:10.1021/acs.jpclett.3c01158
apa: Wei, Y., Volosniev, A., Lorenc, D., Zhumekenov, A. A., Bakr, O. M., Lemeshko,
M., & Alpichshev, Z. (2023). Bond polarizability as a probe of local crystal
fields in hybrid lead-halide perovskites. The Journal of Physical Chemistry
Letters. American Chemical Society. https://doi.org/10.1021/acs.jpclett.3c01158
chicago: Wei, Yujing, Artem Volosniev, Dusan Lorenc, Ayan A. Zhumekenov, Osman M.
Bakr, Mikhail Lemeshko, and Zhanybek Alpichshev. “Bond Polarizability as a Probe
of Local Crystal Fields in Hybrid Lead-Halide Perovskites.” The Journal of
Physical Chemistry Letters. American Chemical Society, 2023. https://doi.org/10.1021/acs.jpclett.3c01158.
ieee: Y. Wei et al., “Bond polarizability as a probe of local crystal fields
in hybrid lead-halide perovskites,” The Journal of Physical Chemistry Letters,
vol. 14, no. 27. American Chemical Society, pp. 6309–6314, 2023.
ista: Wei Y, Volosniev A, Lorenc D, Zhumekenov AA, Bakr OM, Lemeshko M, Alpichshev
Z. 2023. Bond polarizability as a probe of local crystal fields in hybrid lead-halide
perovskites. The Journal of Physical Chemistry Letters. 14(27), 6309–6314.
mla: Wei, Yujing, et al. “Bond Polarizability as a Probe of Local Crystal Fields
in Hybrid Lead-Halide Perovskites.” The Journal of Physical Chemistry Letters,
vol. 14, no. 27, American Chemical Society, 2023, pp. 6309–14, doi:10.1021/acs.jpclett.3c01158.
short: Y. Wei, A. Volosniev, D. Lorenc, A.A. Zhumekenov, O.M. Bakr, M. Lemeshko,
Z. Alpichshev, The Journal of Physical Chemistry Letters 14 (2023) 6309–6314.
date_created: 2023-07-18T11:13:17Z
date_published: 2023-07-05T00:00:00Z
date_updated: 2023-07-19T06:59:19Z
day: '05'
ddc:
- '530'
department:
- _id: MiLe
- _id: ZhAl
doi: 10.1021/acs.jpclett.3c01158
ec_funded: 1
external_id:
arxiv:
- '2304.14198'
isi:
- '001022811500001'
file:
- access_level: open_access
checksum: c0c040063f06a51b9c463adc504f1a23
content_type: application/pdf
creator: dernst
date_created: 2023-07-19T06:55:39Z
date_updated: 2023-07-19T06:55:39Z
file_id: '13253'
file_name: 2023_JourPhysChemistry_Wei.pdf
file_size: 2121252
relation: main_file
success: 1
file_date_updated: 2023-07-19T06:55:39Z
has_accepted_license: '1'
intvolume: ' 14'
isi: 1
issue: '27'
keyword:
- General Materials Science
- Physical and Theoretical Chemistry
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 6309-6314
project:
- _id: 2688CF98-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '801770'
name: 'Angulon: physics and applications of a new quasiparticle'
publication: The Journal of Physical Chemistry Letters
publication_identifier:
eissn:
- 1948-7185
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
status: public
title: Bond polarizability as a probe of local crystal fields in hybrid lead-halide
perovskites
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 14
year: '2023'
...
---
_id: '13292'
abstract:
- lang: eng
text: The operator precedence languages (OPLs) represent the largest known subclass
of the context-free languages which enjoys all desirable closure and decidability
properties. This includes the decidability of language inclusion, which is the
ultimate verification problem. Operator precedence grammars, automata, and logics
have been investigated and used, for example, to verify programs with arithmetic
expressions and exceptions (both of which are deterministic pushdown but lie outside
the scope of the visibly pushdown languages). In this paper, we complete the picture
and give, for the first time, an algebraic characterization of the class of OPLs
in the form of a syntactic congruence that has finitely many equivalence classes
exactly for the operator precedence languages. This is a generalization of the
celebrated Myhill-Nerode theorem for the regular languages to OPLs. As one of
the consequences, we show that universality and language inclusion for nondeterministic
operator precedence automata can be solved by an antichain algorithm. Antichain
algorithms avoid determinization and complementation through an explicit subset
construction, by leveraging a quasi-order on words, which allows the pruning of
the search space for counterexample words without sacrificing completeness. Antichain
algorithms can be implemented symbolically, and these implementations are today
the best-performing algorithms in practice for the inclusion of finite automata.
We give a generic construction of the quasi-order needed for antichain algorithms
from a finite syntactic congruence. This yields the first antichain algorithm
for OPLs, an algorithm that solves the ExpTime-hard language inclusion problem
for OPLs in exponential time.
acknowledgement: "This work was supported in part by the ERC-2020-AdG 101020093.\r\nWe
thank Pierre Ganty for early discussions and the anonymous reviewers for their helpful
comments.\r\n"
alternative_title:
- LIPIcs
article_processing_charge: Yes
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Pavol
full_name: Kebis, Pavol
last_name: Kebis
- first_name: Nicolas Adrien
full_name: Mazzocchi, Nicolas Adrien
id: b26baa86-3308-11ec-87b0-8990f34baa85
last_name: Mazzocchi
- first_name: Naci E
full_name: Sarac, Naci E
id: 8C6B42F8-C8E6-11E9-A03A-F2DCE5697425
last_name: Sarac
citation:
ama: 'Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. Regular methods for operator
precedence languages. In: 50th International Colloquium on Automata, Languages,
and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2023:129:1--129:20. doi:10.4230/LIPIcs.ICALP.2023.129'
apa: 'Henzinger, T. A., Kebis, P., Mazzocchi, N. A., & Sarac, N. E. (2023).
Regular methods for operator precedence languages. In 50th International Colloquium
on Automata, Languages, and Programming (Vol. 261, p. 129:1--129:20). Paderborn,
Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.129'
chicago: Henzinger, Thomas A, Pavol Kebis, Nicolas Adrien Mazzocchi, and Naci E
Sarac. “Regular Methods for Operator Precedence Languages.” In 50th International
Colloquium on Automata, Languages, and Programming, 261:129:1--129:20. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.129.
ieee: T. A. Henzinger, P. Kebis, N. A. Mazzocchi, and N. E. Sarac, “Regular methods
for operator precedence languages,” in 50th International Colloquium on Automata,
Languages, and Programming, Paderborn, Germany, 2023, vol. 261, p. 129:1--129:20.
ista: 'Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. 2023. Regular methods for
operator precedence languages. 50th International Colloquium on Automata, Languages,
and Programming. ICALP: International Colloquium on Automata, Languages, and Programming,
LIPIcs, vol. 261, 129:1--129:20.'
mla: Henzinger, Thomas A., et al. “Regular Methods for Operator Precedence Languages.”
50th International Colloquium on Automata, Languages, and Programming,
vol. 261, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, p. 129:1--129:20,
doi:10.4230/LIPIcs.ICALP.2023.129.
short: T.A. Henzinger, P. Kebis, N.A. Mazzocchi, N.E. Sarac, in:, 50th International
Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2023, p. 129:1--129:20.
conference:
end_date: 2023-07-14
location: Paderborn, Germany
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2023-07-10
date_created: 2023-07-24T15:11:41Z
date_published: 2023-07-05T00:00:00Z
date_updated: 2023-07-31T08:38:38Z
day: '05'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
doi: 10.4230/LIPIcs.ICALP.2023.129
ec_funded: 1
external_id:
arxiv:
- '2305.03447'
file:
- access_level: open_access
checksum: 5d4c8932ef3450615a53b9bb15d92eb2
content_type: application/pdf
creator: esarac
date_created: 2023-07-24T15:11:05Z
date_updated: 2023-07-24T15:11:05Z
file_id: '13293'
file_name: icalp23.pdf
file_size: 859379
relation: main_file
success: 1
file_date_updated: 2023-07-24T15:11:05Z
has_accepted_license: '1'
intvolume: ' 261'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 129:1--129:20
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: 50th International Colloquium on Automata, Languages, and Programming
publication_identifier:
eissn:
- 1868-8969
isbn:
- '9783959772785'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
status: public
title: Regular methods for operator precedence languages
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: 261
year: '2023'
...
---
_id: '13277'
abstract:
- lang: eng
text: Recent experimental advances have inspired the development of theoretical
tools to describe the non-equilibrium dynamics of quantum systems. Among them
an exact representation of quantum spin systems in terms of classical stochastic
processes has been proposed. Here we provide first steps towards the extension
of this stochastic approach to bosonic systems by considering the one-dimensional
quantum quartic oscillator. We show how to exactly parameterize the time evolution
of this prototypical model via the dynamics of a set of classical variables. We
interpret these variables as stochastic processes, which allows us to propose
a novel way to numerically simulate the time evolution of the system. We benchmark
our findings by considering analytically solvable limits and providing alternative
derivations of known results.
acknowledgement: 'S. De Nicola acknowledges funding from the Institute of Science
and Technology Austria (ISTA), and from the European Union’s Horizon 2020 research
and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 754411.
S. De Nicola also acknowledges funding from the EPSRC Center for Doctoral Training
in Cross-Disciplinary Approaches to NonEquilibrium Systems (CANES) under Grant EP/L015854/1. '
article_number: '029'
article_processing_charge: No
article_type: original
author:
- first_name: Gennaro
full_name: Tucci, Gennaro
last_name: Tucci
- first_name: Stefano
full_name: De Nicola, Stefano
id: 42832B76-F248-11E8-B48F-1D18A9856A87
last_name: De Nicola
orcid: 0000-0002-4842-6671
- first_name: Sascha
full_name: Wald, Sascha
last_name: Wald
- first_name: Andrea
full_name: Gambassi, Andrea
last_name: Gambassi
citation:
ama: Tucci G, De Nicola S, Wald S, Gambassi A. Stochastic representation of the
quantum quartic oscillator. SciPost Physics Core. 2023;6(2). doi:10.21468/scipostphyscore.6.2.029
apa: Tucci, G., De Nicola, S., Wald, S., & Gambassi, A. (2023). Stochastic representation
of the quantum quartic oscillator. SciPost Physics Core. SciPost Foundation.
https://doi.org/10.21468/scipostphyscore.6.2.029
chicago: Tucci, Gennaro, Stefano De Nicola, Sascha Wald, and Andrea Gambassi. “Stochastic
Representation of the Quantum Quartic Oscillator.” SciPost Physics Core.
SciPost Foundation, 2023. https://doi.org/10.21468/scipostphyscore.6.2.029.
ieee: G. Tucci, S. De Nicola, S. Wald, and A. Gambassi, “Stochastic representation
of the quantum quartic oscillator,” SciPost Physics Core, vol. 6, no. 2.
SciPost Foundation, 2023.
ista: Tucci G, De Nicola S, Wald S, Gambassi A. 2023. Stochastic representation
of the quantum quartic oscillator. SciPost Physics Core. 6(2), 029.
mla: Tucci, Gennaro, et al. “Stochastic Representation of the Quantum Quartic Oscillator.”
SciPost Physics Core, vol. 6, no. 2, 029, SciPost Foundation, 2023, doi:10.21468/scipostphyscore.6.2.029.
short: G. Tucci, S. De Nicola, S. Wald, A. Gambassi, SciPost Physics Core 6 (2023).
date_created: 2023-07-24T10:47:46Z
date_published: 2023-04-14T00:00:00Z
date_updated: 2023-07-31T09:03:28Z
day: '14'
ddc:
- '530'
department:
- _id: MaSe
doi: 10.21468/scipostphyscore.6.2.029
ec_funded: 1
external_id:
arxiv:
- '2211.01923'
file:
- access_level: open_access
checksum: b472bc82108747eda5d52adf9e2ac7f3
content_type: application/pdf
creator: dernst
date_created: 2023-07-31T09:02:27Z
date_updated: 2023-07-31T09:02:27Z
file_id: '13329'
file_name: 2023_SciPostPhysCore_Tucci.pdf
file_size: 523236
relation: main_file
success: 1
file_date_updated: 2023-07-31T09:02:27Z
has_accepted_license: '1'
intvolume: ' 6'
issue: '2'
keyword:
- Statistical and Nonlinear Physics
- Atomic and Molecular Physics
- and Optics
- Nuclear and High Energy Physics
- Condensed Matter Physics
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: SciPost Physics Core
publication_identifier:
issn:
- 2666-9366
publication_status: published
publisher: SciPost Foundation
quality_controlled: '1'
status: public
title: Stochastic representation of the quantum quartic oscillator
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2023'
...
---
_id: '13276'
abstract:
- lang: eng
text: We introduce a generic and accessible implementation of an exact diagonalization
method for studying few-fermion models. Our aim is to provide a testbed for the
newcomers to the field as well as a stepping stone for trying out novel optimizations
and approximations. This userguide consists of a description of the algorithm,
and several examples in varying orders of sophistication. In particular, we exemplify
our routine using an effective-interaction approach that fixes the low-energy
physics. We benchmark this approach against the existing data, and show that it
is able to deliver state-of-the-art numerical results at a significantly reduced
computational cost.
acknowledgement: "We acknowledge fruitful discussions with Hans-Werner Hammer and
thank Gerhard Zürn and\r\nPietro Massignan for sending us their data. We thank Fabian
Brauneis for beta-testing the\r\nprovided code-package, and comments on the manuscript.\r\nL.R.
is supported by FP7/ERC Consolidator Grant QSIMCORR, No.\r\n771891, and the Deutsche
Forschungsgemeinschaft (DFG, German Research Foundation) under\r\nGermany’s Excellence
Strategy –EXC–2111–390814868. A.G.V. acknowledges support\r\nby European Union’s
Horizon 2020 research and innovation programme under the Marie\r\nSkłodowska-Curie
Grant Agreement No. 754411."
article_number: '12'
article_processing_charge: No
article_type: original
author:
- first_name: Lukas
full_name: Rammelmüller, Lukas
last_name: Rammelmüller
- first_name: David
full_name: Huber, David
last_name: Huber
- first_name: Artem
full_name: Volosniev, Artem
id: 37D278BC-F248-11E8-B48F-1D18A9856A87
last_name: Volosniev
orcid: 0000-0003-0393-5525
citation:
ama: Rammelmüller L, Huber D, Volosniev A. A modular implementation of an effective
interaction approach for harmonically trapped fermions in 1D. SciPost Physics
Codebases. 2023. doi:10.21468/scipostphyscodeb.12
apa: Rammelmüller, L., Huber, D., & Volosniev, A. (2023). A modular implementation
of an effective interaction approach for harmonically trapped fermions in 1D.
SciPost Physics Codebases. SciPost Foundation. https://doi.org/10.21468/scipostphyscodeb.12
chicago: Rammelmüller, Lukas, David Huber, and Artem Volosniev. “A Modular Implementation
of an Effective Interaction Approach for Harmonically Trapped Fermions in 1D.”
SciPost Physics Codebases. SciPost Foundation, 2023. https://doi.org/10.21468/scipostphyscodeb.12.
ieee: L. Rammelmüller, D. Huber, and A. Volosniev, “A modular implementation of
an effective interaction approach for harmonically trapped fermions in 1D,” SciPost
Physics Codebases. SciPost Foundation, 2023.
ista: Rammelmüller L, Huber D, Volosniev A. 2023. A modular implementation of an
effective interaction approach for harmonically trapped fermions in 1D. SciPost
Physics Codebases., 12.
mla: Rammelmüller, Lukas, et al. “A Modular Implementation of an Effective Interaction
Approach for Harmonically Trapped Fermions in 1D.” SciPost Physics Codebases,
12, SciPost Foundation, 2023, doi:10.21468/scipostphyscodeb.12.
short: L. Rammelmüller, D. Huber, A. Volosniev, SciPost Physics Codebases (2023).
date_created: 2023-07-24T10:47:15Z
date_published: 2023-04-19T00:00:00Z
date_updated: 2023-07-31T09:16:02Z
day: '19'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.21468/scipostphyscodeb.12
ec_funded: 1
external_id:
arxiv:
- '2202.04603'
file:
- access_level: open_access
checksum: f583a70fe915d2208c803f5afb426daa
content_type: application/pdf
creator: dernst
date_created: 2023-07-31T09:09:23Z
date_updated: 2023-07-31T09:09:23Z
file_id: '13330'
file_name: 2023_SciPostPhysCodebase_Rammelmueller.pdf
file_size: 551418
relation: main_file
success: 1
file_date_updated: 2023-07-31T09:09:23Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: SciPost Physics Codebases
publication_identifier:
issn:
- 2949-804X
publication_status: published
publisher: SciPost Foundation
quality_controlled: '1'
related_material:
record:
- id: '13275'
relation: research_data
status: public
status: public
title: A modular implementation of an effective interaction approach for harmonically
trapped fermions in 1D
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
year: '2023'
...
---
_id: '13275'
abstract:
- lang: eng
text: We introduce a generic and accessible implementation of an exact diagonalization
method for studying few-fermion models. Our aim is to provide a testbed for the
newcomers to the field as well as a stepping stone for trying out novel optimizations
and approximations. This userguide consists of a description of the algorithm,
and several examples in varying orders of sophistication. In particular, we exemplify
our routine using an effective-interaction approach that fixes the low-energy
physics. We benchmark this approach against the existing data, and show that it
is able to deliver state-of-the-art numerical results at a significantly reduced
computational cost.
article_processing_charge: No
author:
- first_name: Lukas
full_name: Rammelmüller, Lukas
last_name: Rammelmüller
- first_name: David
full_name: Huber, David
last_name: Huber
- first_name: Artem
full_name: Volosniev, Artem
id: 37D278BC-F248-11E8-B48F-1D18A9856A87
last_name: Volosniev
orcid: 0000-0003-0393-5525
citation:
ama: Rammelmüller L, Huber D, Volosniev A. Codebase release 1.0 for FermiFCI. 2023.
doi:10.21468/scipostphyscodeb.12-r1.0
apa: Rammelmüller, L., Huber, D., & Volosniev, A. (2023). Codebase release 1.0
for FermiFCI. SciPost Foundation. https://doi.org/10.21468/scipostphyscodeb.12-r1.0
chicago: Rammelmüller, Lukas, David Huber, and Artem Volosniev. “Codebase Release
1.0 for FermiFCI.” SciPost Foundation, 2023. https://doi.org/10.21468/scipostphyscodeb.12-r1.0.
ieee: L. Rammelmüller, D. Huber, and A. Volosniev, “Codebase release 1.0 for FermiFCI.”
SciPost Foundation, 2023.
ista: Rammelmüller L, Huber D, Volosniev A. 2023. Codebase release 1.0 for FermiFCI,
SciPost Foundation, 10.21468/scipostphyscodeb.12-r1.0.
mla: Rammelmüller, Lukas, et al. Codebase Release 1.0 for FermiFCI. SciPost
Foundation, 2023, doi:10.21468/scipostphyscodeb.12-r1.0.
short: L. Rammelmüller, D. Huber, A. Volosniev, (2023).
date_created: 2023-07-24T10:46:23Z
date_published: 2023-04-19T00:00:00Z
date_updated: 2023-07-31T09:16:02Z
day: '19'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.21468/scipostphyscodeb.12-r1.0
ec_funded: 1
main_file_link:
- open_access: '1'
url: https://doi.org/10.21468/SciPostPhysCodeb.12-r1.0
month: '04'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publisher: SciPost Foundation
related_material:
record:
- id: '13276'
relation: used_in_publication
status: public
status: public
title: Codebase release 1.0 for FermiFCI
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '13262'
abstract:
- lang: eng
text: 'Determining the degree of inherent parallelism in classical sequential algorithms
and leveraging it for fast parallel execution is a key topic in parallel computing,
and detailed analyses are known for a wide range of classical algorithms. In this
paper, we perform the first such analysis for the fundamental Union-Find problem,
in which we are given a graph as a sequence of edges, and must maintain its connectivity
structure under edge additions. We prove that classic sequential algorithms for
this problem are well-parallelizable under reasonable assumptions, addressing
a conjecture by [Blelloch, 2017]. More precisely, we show via a new potential
argument that, under uniform random edge ordering, parallel union-find operations
are unlikely to interfere: T concurrent threads processing the graph in parallel
will encounter memory contention O(T2 · log |V| · log |E|) times in expectation,
where |E| and |V| are the number of edges and nodes in the graph, respectively.
We leverage this result to design a new parallel Union-Find algorithm that is
both internally deterministic, i.e., its results are guaranteed to match those
of a sequential execution, but also work-efficient and scalable, as long as the
number of threads T is O(|E|1 over 3 - ε), for an arbitrarily small constant ε
> 0, which holds for most large real-world graphs. We present lower bounds which
show that our analysis is close to optimal, and experimental results suggesting
that the performance cost of internal determinism is limited.'
article_processing_charge: Yes (in subscription journal)
author:
- first_name: Alexander
full_name: Fedorov, Alexander
id: 2e711909-896a-11ed-bdf8-eb0f5a2984c6
last_name: Fedorov
- first_name: Diba
full_name: Hashemi, Diba
id: ed9595ea-2f8f-11ee-ba95-d2b546540783
last_name: Hashemi
- first_name: Giorgi
full_name: Nadiradze, Giorgi
id: 3279A00C-F248-11E8-B48F-1D18A9856A87
last_name: Nadiradze
- 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: 'Fedorov A, Hashemi D, Nadiradze G, Alistarh D-A. Provably-efficient and internally-deterministic
parallel Union-Find. In: Proceedings of the 35th ACM Symposium on Parallelism
in Algorithms and Architectures. Association for Computing Machinery; 2023:261-271.
doi:10.1145/3558481.3591082'
apa: 'Fedorov, A., Hashemi, D., Nadiradze, G., & Alistarh, D.-A. (2023). Provably-efficient
and internally-deterministic parallel Union-Find. In Proceedings of the 35th
ACM Symposium on Parallelism in Algorithms and Architectures (pp. 261–271).
Orlando, FL, United States: Association for Computing Machinery. https://doi.org/10.1145/3558481.3591082'
chicago: Fedorov, Alexander, Diba Hashemi, Giorgi Nadiradze, and Dan-Adrian Alistarh.
“Provably-Efficient and Internally-Deterministic Parallel Union-Find.” In Proceedings
of the 35th ACM Symposium on Parallelism in Algorithms and Architectures,
261–71. Association for Computing Machinery, 2023. https://doi.org/10.1145/3558481.3591082.
ieee: A. Fedorov, D. Hashemi, G. Nadiradze, and D.-A. Alistarh, “Provably-efficient
and internally-deterministic parallel Union-Find,” in Proceedings of the 35th
ACM Symposium on Parallelism in Algorithms and Architectures, Orlando, FL,
United States, 2023, pp. 261–271.
ista: 'Fedorov A, Hashemi D, Nadiradze G, Alistarh D-A. 2023. Provably-efficient
and internally-deterministic parallel Union-Find. Proceedings of the 35th ACM
Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism
in Algorithms and Architectures, 261–271.'
mla: Fedorov, Alexander, et al. “Provably-Efficient and Internally-Deterministic
Parallel Union-Find.” Proceedings of the 35th ACM Symposium on Parallelism
in Algorithms and Architectures, Association for Computing Machinery, 2023,
pp. 261–71, doi:10.1145/3558481.3591082.
short: A. Fedorov, D. Hashemi, G. Nadiradze, D.-A. Alistarh, in:, Proceedings of
the 35th ACM Symposium on Parallelism in Algorithms and Architectures, Association
for Computing Machinery, 2023, pp. 261–271.
conference:
end_date: 2023-06-19
location: Orlando, FL, United States
name: 'SPAA: Symposium on Parallelism in Algorithms and Architectures'
start_date: 2023-06-17
date_created: 2023-07-23T22:01:12Z
date_published: 2023-06-17T00:00:00Z
date_updated: 2023-07-31T10:54:32Z
day: '17'
ddc:
- '000'
department:
- _id: DaAl
- _id: GradSch
doi: 10.1145/3558481.3591082
external_id:
arxiv:
- '2304.09331'
file:
- access_level: open_access
checksum: 72e312aabf0c5248c99b5cd3a88e4c88
content_type: application/pdf
creator: dernst
date_created: 2023-07-31T10:53:08Z
date_updated: 2023-07-31T10:53:08Z
file_id: '13334'
file_name: 2023_SPAA_Fedorov.pdf
file_size: 2087937
relation: main_file
success: 1
file_date_updated: 2023-07-31T10:53:08Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 261-271
publication: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and
Architectures
publication_identifier:
isbn:
- '9781450395458'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Provably-efficient and internally-deterministic parallel Union-Find
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: '11479'
abstract:
- lang: eng
text: Understanding population divergence that eventually leads to speciation is
essential for evolutionary biology. High species diversity in the sea was regarded
as a paradox when strict allopatry was considered necessary for most speciation
events because geographical barriers seemed largely absent in the sea, and many
marine species have high dispersal capacities. Combining genome-wide data with
demographic modelling to infer the demographic history of divergence has introduced
new ways to address this classical issue. These models assume an ancestral population
that splits into two subpopulations diverging according to different scenarios
that allow tests for periods of gene flow. Models can also test for heterogeneities
in population sizes and migration rates along the genome to account, respectively,
for background selection and selection against introgressed ancestry. To investigate
how barriers to gene flow arise in the sea, we compiled studies modelling the
demographic history of divergence in marine organisms and extracted preferred
demographic scenarios together with estimates of demographic parameters. These
studies show that geographical barriers to gene flow do exist in the sea but that
divergence can also occur without strict isolation. Heterogeneity of gene flow
was detected in most population pairs suggesting the predominance of semipermeable
barriers during divergence. We found a weak positive relationship between the
fraction of the genome experiencing reduced gene flow and levels of genome-wide
differentiation. Furthermore, we found that the upper bound of the ‘grey zone
of speciation’ for our dataset extended beyond that found before, implying that
gene flow between diverging taxa is possible at higher levels of divergence than
previously thought. Finally, we list recommendations for further strengthening
the use of demographic modelling in speciation research. These include a more
balanced representation of taxa, more consistent and comprehensive modelling,
clear reporting of results and simulation studies to rule out nonbiological explanations
for general results.
acknowledgement: 'We greatly thank all the corresponding authors of the studies that
were included in our synthesis for the sharing of additional data: Thomas Broquet,
Dmitry Filatov, Quentin Rougemont, Paolo Momigliano, Pierre-Alexandre Gagnaire,
Carlos Prada, Ahmed Souissi, Michael Møller Hansen, Sylvie Lapègue, Joseph Di Battista,
Michael Hellberg and Carlos Prada. RKB and ADJ were supported by the European Research
Council. MR was supported by the Swedish Research Council Vetenskapsrådet (grant
number 2021-05243; to MR) and Formas (grant number 2019-00882; to KJ and MR), and
by additional grants from the European Research Council (to RKB) and Vetenskapsrådet
(to KJ) through the Centre for Marine Evolutionary Biology (https://www.gu.se/en/cemeb-marine-evolutionary-biology).'
article_processing_charge: No
article_type: original
author:
- first_name: Aurélien
full_name: De Jode, Aurélien
last_name: De Jode
- first_name: Alan
full_name: Le Moan, Alan
last_name: Le Moan
- first_name: Kerstin
full_name: Johannesson, Kerstin
last_name: Johannesson
- first_name: Rui
full_name: Faria, Rui
last_name: Faria
- first_name: Sean
full_name: Stankowski, Sean
id: 43161670-5719-11EA-8025-FABC3DDC885E
last_name: Stankowski
- first_name: Anja M
full_name: Westram, Anja M
id: 3C147470-F248-11E8-B48F-1D18A9856A87
last_name: Westram
orcid: 0000-0003-1050-4969
- first_name: Roger K.
full_name: Butlin, Roger K.
last_name: Butlin
- first_name: Marina
full_name: Rafajlović, Marina
last_name: Rafajlović
- first_name: Christelle
full_name: Fraisse, Christelle
id: 32DF5794-F248-11E8-B48F-1D18A9856A87
last_name: Fraisse
orcid: 0000-0001-8441-5075
citation:
ama: De Jode A, Le Moan A, Johannesson K, et al. Ten years of demographic modelling
of divergence and speciation in the sea. Evolutionary Applications. 2023;16(2):542-559.
doi:10.1111/eva.13428
apa: De Jode, A., Le Moan, A., Johannesson, K., Faria, R., Stankowski, S., Westram,
A. M., … Fraisse, C. (2023). Ten years of demographic modelling of divergence
and speciation in the sea. Evolutionary Applications. Wiley. https://doi.org/10.1111/eva.13428
chicago: De Jode, Aurélien, Alan Le Moan, Kerstin Johannesson, Rui Faria, Sean Stankowski,
Anja M Westram, Roger K. Butlin, Marina Rafajlović, and Christelle Fraisse. “Ten
Years of Demographic Modelling of Divergence and Speciation in the Sea.” Evolutionary
Applications. Wiley, 2023. https://doi.org/10.1111/eva.13428.
ieee: A. De Jode et al., “Ten years of demographic modelling of divergence
and speciation in the sea,” Evolutionary Applications, vol. 16, no. 2.
Wiley, pp. 542–559, 2023.
ista: De Jode A, Le Moan A, Johannesson K, Faria R, Stankowski S, Westram AM, Butlin
RK, Rafajlović M, Fraisse C. 2023. Ten years of demographic modelling of divergence
and speciation in the sea. Evolutionary Applications. 16(2), 542–559.
mla: De Jode, Aurélien, et al. “Ten Years of Demographic Modelling of Divergence
and Speciation in the Sea.” Evolutionary Applications, vol. 16, no. 2,
Wiley, 2023, pp. 542–59, doi:10.1111/eva.13428.
short: A. De Jode, A. Le Moan, K. Johannesson, R. Faria, S. Stankowski, A.M. Westram,
R.K. Butlin, M. Rafajlović, C. Fraisse, Evolutionary Applications 16 (2023) 542–559.
date_created: 2022-07-03T22:01:33Z
date_published: 2023-02-01T00:00:00Z
date_updated: 2023-08-01T12:25:44Z
day: '01'
ddc:
- '576'
department:
- _id: NiBa
- _id: BeVi
doi: 10.1111/eva.13428
external_id:
isi:
- '000815663700001'
file:
- access_level: open_access
checksum: d4d6fa9ddf36643af994a6a757919afb
content_type: application/pdf
creator: dernst
date_created: 2023-02-27T07:10:17Z
date_updated: 2023-02-27T07:10:17Z
file_id: '12685'
file_name: 2023_EvolutionaryApplications_DeJode.pdf
file_size: 2269822
relation: main_file
success: 1
file_date_updated: 2023-02-27T07:10:17Z
has_accepted_license: '1'
intvolume: ' 16'
isi: 1
issue: '2'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 542-559
publication: Evolutionary Applications
publication_identifier:
eissn:
- 1752-4571
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Ten years of demographic modelling of divergence and speciation in the sea
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 16
year: '2023'
...
---
_id: '12329'
abstract:
- lang: eng
text: In this article, we develop two independent and new approaches to model epidemic
spread in a network. Contrary to the most studied models, those developed here
allow for contacts with different probabilities of transmitting the disease (transmissibilities).
We then examine each of these models using some mean field type approximations.
The first model looks at the late-stage effects of an epidemic outbreak and allows
for the computation of the probability that a given vertex was infected. This
computation is based on a mean field approximation and only depends on the number
of contacts and their transmissibilities. This approach shares many similarities
with percolation models in networks. The second model we develop is a dynamic
model which we analyze using a mean field approximation which highly reduces the
dimensionality of the system. In particular, the original system which individually
analyses each vertex of the network is reduced to one with as many equations as
different transmissibilities. Perhaps the greatest contribution of this article
is the observation that, in both these models, the existence and size of an epidemic
outbreak are linked to the properties of a matrix which we call the R-matrix.
This is a generalization of the basic reproduction number which more precisely
characterizes the main routes of infection.
acknowledgement: Gonçalo Oliveira is supported by the NOMIS Foundation, Fundação Serrapilheira
1812-27395, by CNPq grants 428959/2018-0 and 307475/2018-2, and by FAPERJ through
the grant Jovem Cientista do Nosso Estado E-26/202.793/2019.
article_number: '468'
article_processing_charge: No
article_type: original
author:
- first_name: Arturo
full_name: Gómez, Arturo
last_name: Gómez
- first_name: Goncalo
full_name: Oliveira, Goncalo
id: 58abbde8-f455-11eb-a497-98c8fd71b905
last_name: Oliveira
citation:
ama: Gómez A, Oliveira G. New approaches to epidemic modeling on networks. Scientific
Reports. 2023;13. doi:10.1038/s41598-022-19827-9
apa: Gómez, A., & Oliveira, G. (2023). New approaches to epidemic modeling on
networks. Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-022-19827-9
chicago: Gómez, Arturo, and Goncalo Oliveira. “New Approaches to Epidemic Modeling
on Networks.” Scientific Reports. Springer Nature, 2023. https://doi.org/10.1038/s41598-022-19827-9.
ieee: A. Gómez and G. Oliveira, “New approaches to epidemic modeling on networks,”
Scientific Reports, vol. 13. Springer Nature, 2023.
ista: Gómez A, Oliveira G. 2023. New approaches to epidemic modeling on networks.
Scientific Reports. 13, 468.
mla: Gómez, Arturo, and Goncalo Oliveira. “New Approaches to Epidemic Modeling on
Networks.” Scientific Reports, vol. 13, 468, Springer Nature, 2023, doi:10.1038/s41598-022-19827-9.
short: A. Gómez, G. Oliveira, Scientific Reports 13 (2023).
date_created: 2023-01-22T23:00:55Z
date_published: 2023-01-10T00:00:00Z
date_updated: 2023-08-01T12:31:40Z
day: '10'
ddc:
- '510'
department:
- _id: TaHa
doi: 10.1038/s41598-022-19827-9
external_id:
isi:
- '001003345000051'
file:
- access_level: open_access
checksum: a8b83739f4a951e83e0b2a778f03b327
content_type: application/pdf
creator: dernst
date_created: 2023-01-23T07:53:23Z
date_updated: 2023-01-23T07:53:23Z
file_id: '12336'
file_name: 2023_ScientificReports_Gomez.pdf
file_size: 2167792
relation: main_file
success: 1
file_date_updated: 2023-01-23T07:53:23Z
has_accepted_license: '1'
intvolume: ' 13'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
publication: Scientific Reports
publication_identifier:
eissn:
- 2045-2322
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: New approaches to epidemic modeling on networks
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 13
year: '2023'
...
---
_id: '9034'
abstract:
- lang: eng
text: We determine an asymptotic formula for the number of integral points of bounded
height on a blow-up of P3 outside certain planes using universal torsors.
acknowledgement: This work was supported by the German Academic Exchange Service.
Parts of this article were prepared at the Institut de Mathémathiques de Jussieu—Paris
Rive Gauche. I wish to thank Antoine Chambert-Loir for his remarks and the institute
for its hospitality, as well as the anonymous referee for several useful remarks
and suggestions for improvements.
article_processing_charge: No
article_type: original
author:
- first_name: Florian Alexander
full_name: Wilsch, Florian Alexander
id: 560601DA-8D36-11E9-A136-7AC1E5697425
last_name: Wilsch
orcid: 0000-0001-7302-8256
citation:
ama: Wilsch FA. Integral points of bounded height on a log Fano threefold. International
Mathematics Research Notices. 2023;2023(8):6780-6808. doi:10.1093/imrn/rnac048
apa: Wilsch, F. A. (2023). Integral points of bounded height on a log Fano threefold.
International Mathematics Research Notices. Oxford Academic. https://doi.org/10.1093/imrn/rnac048
chicago: Wilsch, Florian Alexander. “Integral Points of Bounded Height on a Log
Fano Threefold.” International Mathematics Research Notices. Oxford Academic,
2023. https://doi.org/10.1093/imrn/rnac048.
ieee: F. A. Wilsch, “Integral points of bounded height on a log Fano threefold,”
International Mathematics Research Notices, vol. 2023, no. 8. Oxford Academic,
pp. 6780–6808, 2023.
ista: Wilsch FA. 2023. Integral points of bounded height on a log Fano threefold.
International Mathematics Research Notices. 2023(8), 6780–6808.
mla: Wilsch, Florian Alexander. “Integral Points of Bounded Height on a Log Fano
Threefold.” International Mathematics Research Notices, vol. 2023, no.
8, Oxford Academic, 2023, pp. 6780–808, doi:10.1093/imrn/rnac048.
short: F.A. Wilsch, International Mathematics Research Notices 2023 (2023) 6780–6808.
date_created: 2021-01-22T09:31:09Z
date_published: 2023-04-01T00:00:00Z
date_updated: 2023-08-01T12:23:55Z
day: '01'
department:
- _id: TiBr
doi: 10.1093/imrn/rnac048
external_id:
arxiv:
- '1901.08503'
isi:
- '000773116000001'
intvolume: ' 2023'
isi: 1
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1901.08503
month: '04'
oa: 1
oa_version: Preprint
page: 6780-6808
publication: International Mathematics Research Notices
publication_identifier:
eissn:
- 1687-0247
issn:
- 1073-7928
publication_status: published
publisher: Oxford Academic
quality_controlled: '1'
status: public
title: Integral points of bounded height on a log Fano threefold
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 2023
year: '2023'
...
---
_id: '12469'
abstract:
- lang: eng
text: 'Hosts can carry many viruses in their bodies, but not all of them cause disease.
We studied ants as a social host to determine both their overall viral repertoire
and the subset of actively infecting viruses across natural populations of three
subfamilies: the Argentine ant (Linepithema humile, Dolichoderinae), the invasive
garden ant (Lasius neglectus, Formicinae) and the red ant (Myrmica rubra, Myrmicinae).
We used a dual sequencing strategy to reconstruct complete virus genomes by RNA-seq
and to simultaneously determine the small interfering RNAs (siRNAs) by small RNA
sequencing (sRNA-seq), which constitute the host antiviral RNAi immune response.
This approach led to the discovery of 41 novel viruses in ants and revealed a
host ant-specific RNAi response (21 vs. 22 nt siRNAs) in the different ant species.
The efficiency of the RNAi response (sRNA/RNA read count ratio) depended on the
virus and the respective ant species, but not its population. Overall, we found
the highest virus abundance and diversity per population in Li. humile, followed
by La. neglectus and M. rubra. Argentine ants also shared a high proportion of
viruses between populations, whilst overlap was nearly absent in M. rubra. Only
one of the 59 viruses was found to infect two of the ant species as hosts, revealing
high host-specificity in active infections. In contrast, six viruses actively
infected one ant species, but were found as contaminants only in the others. Disentangling
spillover of disease-causing infection from non-infecting contamination across
species is providing relevant information for disease ecology and ecosystem management.'
acknowledgement: "We thank D.J. Obbard for sharing the details of the dual RNA-seq/sRNA-seq
approach, S.\r\nMetzler and R. Ferrigato for the photographs (Figure 1), M. Konrad,
B. Casillas-Perez, C.D.\r\nPull and X. Espadaler for help with ant collection, and
the Social Immunity Team at IST\r\nAustria, in particular J. Robb, A. Franschitz,
E. Naderlinger, E. Dawson and B. Casillas-Perez\r\nfor support and comments on the
manuscript. The study was funded by the Austrian Science\r\nFund (FWF; M02076-B25
to MAF) and the Academy of Finland (343022 to LV). "
article_number: '1119002'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Lumi
full_name: Viljakainen, Lumi
last_name: Viljakainen
- first_name: Matthias
full_name: Fürst, Matthias
id: 393B1196-F248-11E8-B48F-1D18A9856A87
last_name: Fürst
orcid: 0000-0002-3712-925X
- first_name: Anna V
full_name: Grasse, Anna V
id: 406F989C-F248-11E8-B48F-1D18A9856A87
last_name: Grasse
- first_name: Jaana
full_name: Jurvansuu, Jaana
last_name: Jurvansuu
- first_name: Jinook
full_name: Oh, Jinook
id: 403169A4-080F-11EA-9993-BF3F3DDC885E
last_name: Oh
orcid: 0000-0001-7425-2372
- first_name: Lassi
full_name: Tolonen, Lassi
last_name: Tolonen
- first_name: Thomas
full_name: Eder, Thomas
last_name: Eder
- first_name: Thomas
full_name: Rattei, Thomas
last_name: Rattei
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: Viljakainen L, Fürst M, Grasse AV, et al. Antiviral immune response reveals
host-specific virus infections in natural ant populations. Frontiers in Microbiology.
2023;14. doi:10.3389/fmicb.2023.1119002
apa: Viljakainen, L., Fürst, M., Grasse, A. V., Jurvansuu, J., Oh, J., Tolonen,
L., … Cremer, S. (2023). Antiviral immune response reveals host-specific virus
infections in natural ant populations. Frontiers in Microbiology. Frontiers.
https://doi.org/10.3389/fmicb.2023.1119002
chicago: Viljakainen, Lumi, Matthias Fürst, Anna V Grasse, Jaana Jurvansuu, Jinook
Oh, Lassi Tolonen, Thomas Eder, Thomas Rattei, and Sylvia Cremer. “Antiviral Immune
Response Reveals Host-Specific Virus Infections in Natural Ant Populations.” Frontiers
in Microbiology. Frontiers, 2023. https://doi.org/10.3389/fmicb.2023.1119002.
ieee: L. Viljakainen et al., “Antiviral immune response reveals host-specific
virus infections in natural ant populations,” Frontiers in Microbiology,
vol. 14. Frontiers, 2023.
ista: Viljakainen L, Fürst M, Grasse AV, Jurvansuu J, Oh J, Tolonen L, Eder T, Rattei
T, Cremer S. 2023. Antiviral immune response reveals host-specific virus infections
in natural ant populations. Frontiers in Microbiology. 14, 1119002.
mla: Viljakainen, Lumi, et al. “Antiviral Immune Response Reveals Host-Specific
Virus Infections in Natural Ant Populations.” Frontiers in Microbiology,
vol. 14, 1119002, Frontiers, 2023, doi:10.3389/fmicb.2023.1119002.
short: L. Viljakainen, M. Fürst, A.V. Grasse, J. Jurvansuu, J. Oh, L. Tolonen, T.
Eder, T. Rattei, S. Cremer, Frontiers in Microbiology 14 (2023).
date_created: 2023-01-31T08:13:40Z
date_published: 2023-03-16T00:00:00Z
date_updated: 2023-08-01T12:39:58Z
day: '16'
ddc:
- '570'
department:
- _id: SyCr
doi: 10.3389/fmicb.2023.1119002
external_id:
isi:
- '000961542100001'
pmid:
- 'PPR559293 '
file:
- access_level: open_access
checksum: cd52292963acce1111634d9fac08c699
content_type: application/pdf
creator: dernst
date_created: 2023-04-17T07:49:09Z
date_updated: 2023-04-17T07:49:09Z
file_id: '12843'
file_name: 2023_FrontMicrobiology_Viljakainen.pdf
file_size: 4866332
relation: main_file
success: 1
file_date_updated: 2023-04-17T07:49:09Z
has_accepted_license: '1'
intvolume: ' 14'
isi: 1
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 25DF61D8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02076
name: Viral pathogens and social immunity in ants
publication: Frontiers in Microbiology
publication_identifier:
eissn:
- 1664-302X
publication_status: published
publisher: Frontiers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Antiviral immune response reveals host-specific virus infections in natural
ant populations
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 14
year: '2023'
...