---
_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
license: https://creativecommons.org/licenses/by/4.0/
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: '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'
...