---
OA_place: publisher
_id: '11362'
abstract:
- lang: eng
text: "Deep learning has enabled breakthroughs in challenging computing problems
and has emerged as the standard problem-solving tool for computer vision and natural
language processing tasks.\r\nOne exception to this trend is safety-critical tasks
where robustness and resilience requirements contradict the black-box nature of
neural networks. \r\nTo deploy deep learning methods for these tasks, it is vital
to provide guarantees on neural network agents' safety and robustness criteria.
\r\nThis can be achieved by developing formal verification methods to verify the
safety and robustness properties of neural networks.\r\n\r\nOur goal is to design,
develop and assess safety verification methods for neural networks to improve
their reliability and trustworthiness in real-world applications.\r\nThis thesis
establishes techniques for the verification of compressed and adversarially trained
models as well as the design of novel neural networks for verifiably safe decision-making.\r\n\r\nFirst,
we establish the problem of verifying quantized neural networks. Quantization
is a technique that trades numerical precision for the computational efficiency
of running a neural network and is widely adopted in industry.\r\nWe show that
neglecting the reduced precision when verifying a neural network can lead to wrong
conclusions about the robustness and safety of the network, highlighting that
novel techniques for quantized network verification are necessary. We introduce
several bit-exact verification methods explicitly designed for quantized neural
networks and experimentally confirm on realistic networks that the network's robustness
and other formal properties are affected by the quantization.\r\n\r\nFurthermore,
we perform a case study providing evidence that adversarial training, a standard
technique for making neural networks more robust, has detrimental effects on the
network's performance. This robustness-accuracy tradeoff has been studied before
regarding the accuracy obtained on classification datasets where each data point
is independent of all other data points. On the other hand, we investigate the
tradeoff empirically in robot learning settings where a both, a high accuracy
and a high robustness, are desirable.\r\nOur results suggest that the negative
side-effects of adversarial training outweigh its robustness benefits in practice.\r\n\r\nFinally,
we consider the problem of verifying safety when running a Bayesian neural network
policy in a feedback loop with systems over the infinite time horizon. Bayesian
neural networks are probabilistic models for learning uncertainties in the data
and are therefore often used on robotic and healthcare applications where data
is inherently stochastic.\r\nWe introduce a method for recalibrating Bayesian
neural networks so that they yield probability distributions over safe decisions
only.\r\nOur method learns a safety certificate that guarantees safety over the
infinite time horizon to determine which decisions are safe in every possible
state of the system.\r\nWe demonstrate the effectiveness of our approach on a
series of reinforcement learning benchmarks."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
citation:
ama: Lechner M. Learning verifiable representations. 2022. doi:10.15479/at:ista:11362
apa: Lechner, M. (2022). Learning verifiable representations. Institute of
Science and Technology Austria. https://doi.org/10.15479/at:ista:11362
chicago: Lechner, Mathias. “Learning Verifiable Representations.” Institute of Science
and Technology Austria, 2022. https://doi.org/10.15479/at:ista:11362.
ieee: M. Lechner, “Learning verifiable representations,” Institute of Science and
Technology Austria, 2022.
ista: Lechner M. 2022. Learning verifiable representations. Institute of Science
and Technology Austria.
mla: Lechner, Mathias. Learning Verifiable Representations. Institute of
Science and Technology Austria, 2022, doi:10.15479/at:ista:11362.
short: M. Lechner, Learning Verifiable Representations, Institute of Science and
Technology Austria, 2022.
corr_author: '1'
date_created: 2022-05-12T07:14:01Z
date_published: 2022-05-12T00:00:00Z
date_updated: 2026-07-07T06:49:10Z
day: '12'
ddc:
- '004'
degree_awarded: PhD
department:
- _id: GradSch
- _id: ToHe
doi: 10.15479/at:ista:11362
ec_funded: 1
file:
- access_level: closed
checksum: 8eefa9c7c10ca7e1a2ccdd731962a645
content_type: application/zip
creator: mlechner
date_created: 2022-05-13T12:33:26Z
date_updated: 2022-05-13T12:49:00Z
file_id: '11378'
file_name: src.zip
file_size: 13210143
relation: source_file
- access_level: open_access
checksum: 1b9e1e5a9a83ed9d89dad2f5133dc026
content_type: application/pdf
creator: mlechner
date_created: 2022-05-16T08:02:28Z
date_updated: 2022-05-17T15:19:39Z
file_id: '11382'
file_name: thesis_main-a2.pdf
file_size: 2732536
relation: main_file
file_date_updated: 2022-05-17T15:19:39Z
has_accepted_license: '1'
keyword:
- neural networks
- verification
- machine learning
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nd/4.0/
month: '05'
oa: 1
oa_version: Published Version
page: '124'
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication_identifier:
isbn:
- 978-3-99078-017-6
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '11366'
relation: part_of_dissertation
status: public
- id: '10665'
relation: part_of_dissertation
status: public
- id: '7808'
relation: part_of_dissertation
status: public
- id: '10666'
relation: part_of_dissertation
status: public
- id: '10667'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
title: Learning verifiable representations
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2022'
...
---
OA_place: repository
OA_type: green
_id: '22196'
abstract:
- lang: eng
text: "We explore two questions about pseudo-polynomials, which\r\nare functions
f : N → Z such that k divides f(n + k) −\r\nf(n) for all n, k. First, for certain
arbitrarily sparse sets R, we\r\nconstruct pseudo-polynomials f with p|f(n) for
some n only if\r\np ∈ R. This implies that not all pseudo-polynomials satisfy
an\r\nassumption of a recent paper of Kowalski and Soundararajan.\r\nWe also consider
α-primary pseudo-polynomials, where the\r\npseudo-polynomial condition is only
required for k lying in\r\na set of primes of density α. We show that if an α-primary\r\npseudo-polynomial
is O(e(β−)n), where β = √7\r\n3 − 1\r\n6 ≈ 0.715,\r\nthen it is a polynomial."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Vivian Zieve
full_name: Kuperberg, Vivian Zieve
id: c3bac823-112d-11f0-a3f5-c264f852e697
last_name: Kuperberg
citation:
ama: Kuperberg VZ. On pseudo-polynomials divisible only by a sparse set of primes
and α-primary pseudo-polynomials. Journal of Number Theory. 2022;241:531-541.
doi:10.1016/j.jnt.2022.04.006
apa: Kuperberg, V. Z. (2022). On pseudo-polynomials divisible only by a sparse set
of primes and α-primary pseudo-polynomials. Journal of Number Theory. Elsevier.
https://doi.org/10.1016/j.jnt.2022.04.006
chicago: Kuperberg, Vivian Zieve. “On Pseudo-Polynomials Divisible Only by a Sparse
Set of Primes and α-Primary Pseudo-Polynomials.” Journal of Number Theory.
Elsevier, 2022. https://doi.org/10.1016/j.jnt.2022.04.006.
ieee: V. Z. Kuperberg, “On pseudo-polynomials divisible only by a sparse set of
primes and α-primary pseudo-polynomials,” Journal of Number Theory, vol.
241. Elsevier, pp. 531–541, 2022.
ista: Kuperberg VZ. 2022. On pseudo-polynomials divisible only by a sparse set of
primes and α-primary pseudo-polynomials. Journal of Number Theory. 241, 531–541.
mla: Kuperberg, Vivian Zieve. “On Pseudo-Polynomials Divisible Only by a Sparse
Set of Primes and α-Primary Pseudo-Polynomials.” Journal of Number Theory,
vol. 241, Elsevier, 2022, pp. 531–41, doi:10.1016/j.jnt.2022.04.006.
short: V.Z. Kuperberg, Journal of Number Theory 241 (2022) 531–541.
date_created: 2026-06-29T12:58:07Z
date_published: 2022-05-18T00:00:00Z
date_updated: 2026-07-14T11:08:14Z
day: '18'
doi: 10.1016/j.jnt.2022.04.006
extern: '1'
external_id:
arxiv:
- '2006.02527'
intvolume: ' 241'
keyword:
- Pseudo-polynomials
- Chinese remainder theorem
- Ruzsa’s conjecture
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2006.02527
month: '05'
oa: 1
oa_version: Preprint
page: 531-541
publication: Journal of Number Theory
publication_identifier:
issn:
- 0022-314X
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: On pseudo-polynomials divisible only by a sparse set of primes and α-primary
pseudo-polynomials
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 241
year: '2022'
...
---
OA_place: repository
_id: '18293'
abstract:
- lang: eng
text: Given a non-singular diagonal cubic hypersurface X⊂Pn−1 over Fq(t) with char(Fq)≠3,
we show that the number of rational points of height at most |P| is O(|P|3+ε)
for n=6 and O(|P|2+ε) for n=4. In fact, if n=4 and char(Fq)>3 we prove that the
number of rational points away from any rational line contained in X is bounded
by O(|P|3/2+ε). From the result in 6 variables we deduce weak approximation for
diagonal cubic hypersurfaces for n≥7 over Fq(t) when char(Fq)>3 and handle Waring's
problem for cubes in 7 variables over Fq(t) when char(Fq)≠3. Our results answer
a question of Davenport regarding the number of solutions of bounded height to
x31+x32+x33=x34+x35+x36 with xi∈Fq[t].
article_number: '2208.05422'
article_processing_charge: No
arxiv: 1
author:
- first_name: Jakob
full_name: Glas, Jakob
id: d6423cba-dc74-11ea-a0a7-ee61689ff5fb
last_name: Glas
- first_name: Leonhard
full_name: Hochfilzer, Leonhard
last_name: Hochfilzer
citation:
ama: Glas J, Hochfilzer L. On a question of Davenport and diagonal cubic forms over
Fq(t). arXiv. doi:10.48550/arXiv.2208.05422
apa: Glas, J., & Hochfilzer, L. (n.d.). On a question of Davenport and diagonal
cubic forms over Fq(t). arXiv. https://doi.org/10.48550/arXiv.2208.05422
chicago: Glas, Jakob, and Leonhard Hochfilzer. “On a Question of Davenport and Diagonal
Cubic Forms over Fq(T).” ArXiv, n.d. https://doi.org/10.48550/arXiv.2208.05422.
ieee: J. Glas and L. Hochfilzer, “On a question of Davenport and diagonal cubic
forms over Fq(t),” arXiv. .
ista: Glas J, Hochfilzer L. On a question of Davenport and diagonal cubic forms
over Fq(t). arXiv, 2208.05422.
mla: Glas, Jakob, and Leonhard Hochfilzer. “On a Question of Davenport and Diagonal
Cubic Forms over Fq(T).” ArXiv, 2208.05422, doi:10.48550/arXiv.2208.05422.
short: J. Glas, L. Hochfilzer, ArXiv (n.d.).
corr_author: '1'
date_created: 2024-10-10T12:46:41Z
date_published: 2022-08-10T00:00:00Z
date_updated: 2026-07-16T09:10:28Z
day: '10'
department:
- _id: TiBr
doi: 10.48550/arXiv.2208.05422
external_id:
arxiv:
- '2208.05422'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2208.05422
month: '08'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: draft
related_material:
record:
- id: '18132'
relation: dissertation_contains
status: public
- id: '18705'
relation: later_version
status: public
status: public
title: On a question of Davenport and diagonal cubic forms over Fq(t)
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '12244'
abstract:
- lang: eng
text: Environmental cues influence the highly dynamic morphology of microglia. Strategies
to characterize these changes usually involve user-selected morphometric features,
which preclude the identification of a spectrum of context-dependent morphological
phenotypes. Here we develop MorphOMICs, a topological data analysis approach,
which enables semiautomatic mapping of microglial morphology into an atlas of
cue-dependent phenotypes and overcomes feature-selection biases and biological
variability. We extract spatially heterogeneous and sexually dimorphic morphological
phenotypes for seven adult mouse brain regions. This sex-specific phenotype declines
with maturation but increases over the disease trajectories in two neurodegeneration
mouse models, with females showing a faster morphological shift in affected brain
regions. Remarkably, microglia morphologies reflect an adaptation upon repeated
exposure to ketamine anesthesia and do not recover to control morphologies. Finally,
we demonstrate that both long primary processes and short terminal processes provide
distinct insights to morphological phenotypes. MorphOMICs opens a new perspective
to characterize microglial morphology.
acknowledged_ssus:
- _id: PreCl
- _id: Bio
- _id: ScienComp
acknowledgement: We thank the scientific service units at ISTA, in particular M. Schunn’s
team at the preclinical facility, and especially our colony manager S. Haslinger,
for excellent support. We are also grateful to the ISTA Imaging & Optics Facility,
and in particular C. Sommer for helping with the data file conversions. We thank
R. Erhart from the ISTA Scientific Computing Unit for improving the script performance.
We thank M. Maes, B. Nagy, S. Oakeley and M. Benevento and all members of the Siegert
group for constant feedback on the project and on the manuscript. This research
was supported by the European Union Horizon 2020 research and innovation program
under the Marie Skłodowska-Curie Actions program (754411 to R.J.A.C.), and by the
European Research Council (grant no. 715571 to S.S.). L.K. was supported by funding
to the Blue Brain Project, a research center of the École polytechnique fédérale
de Lausanne, from the Swiss government’s ETH Board of the Swiss Federal Institutes
of Technology. L.-H.T. was supported by NIH (grant no. R37NS051874) and by the JPB
Foundation. The funders had no role in study design, data collection and analysis,
decision to publish or preparation of the manuscript.
article_processing_charge: No
article_type: original
author:
- first_name: Gloria
full_name: Colombo, Gloria
id: 3483CF6C-F248-11E8-B48F-1D18A9856A87
last_name: Colombo
orcid: 0000-0001-9434-8902
- first_name: Ryan J
full_name: Cubero, Ryan J
id: 850B2E12-9CD4-11E9-837F-E719E6697425
last_name: Cubero
orcid: 0000-0003-0002-1867
- first_name: Lida
full_name: Kanari, Lida
last_name: Kanari
- first_name: Alessandro
full_name: Venturino, Alessandro
id: 41CB84B2-F248-11E8-B48F-1D18A9856A87
last_name: Venturino
orcid: 0000-0003-2356-9403
- first_name: Rouven
full_name: Schulz, Rouven
id: 4C5E7B96-F248-11E8-B48F-1D18A9856A87
last_name: Schulz
orcid: 0000-0001-5297-733X
- first_name: Martina
full_name: Scolamiero, Martina
last_name: Scolamiero
- first_name: Jens
full_name: Agerberg, Jens
last_name: Agerberg
- first_name: Hansruedi
full_name: Mathys, Hansruedi
last_name: Mathys
- first_name: Li-Huei
full_name: Tsai, Li-Huei
last_name: Tsai
- first_name: Wojciech
full_name: Chachólski, Wojciech
last_name: Chachólski
- first_name: Kathryn
full_name: Hess, Kathryn
last_name: Hess
- first_name: Sandra
full_name: Siegert, Sandra
id: 36ACD32E-F248-11E8-B48F-1D18A9856A87
last_name: Siegert
orcid: 0000-0001-8635-0877
citation:
ama: Colombo G, Cubero RJ, Kanari L, et al. A tool for mapping microglial morphology,
morphOMICs, reveals brain-region and sex-dependent phenotypes. Nature Neuroscience.
2022;25(10):1379-1393. doi:10.1038/s41593-022-01167-6
apa: Colombo, G., Cubero, R. J., Kanari, L., Venturino, A., Schulz, R., Scolamiero,
M., … Siegert, S. (2022). A tool for mapping microglial morphology, morphOMICs,
reveals brain-region and sex-dependent phenotypes. Nature Neuroscience.
Springer Nature. https://doi.org/10.1038/s41593-022-01167-6
chicago: Colombo, Gloria, Ryan J Cubero, Lida Kanari, Alessandro Venturino, Rouven
Schulz, Martina Scolamiero, Jens Agerberg, et al. “A Tool for Mapping Microglial
Morphology, MorphOMICs, Reveals Brain-Region and Sex-Dependent Phenotypes.” Nature
Neuroscience. Springer Nature, 2022. https://doi.org/10.1038/s41593-022-01167-6.
ieee: G. Colombo et al., “A tool for mapping microglial morphology, morphOMICs,
reveals brain-region and sex-dependent phenotypes,” Nature Neuroscience,
vol. 25, no. 10. Springer Nature, pp. 1379–1393, 2022.
ista: Colombo G, Cubero RJ, Kanari L, Venturino A, Schulz R, Scolamiero M, Agerberg
J, Mathys H, Tsai L-H, Chachólski W, Hess K, Siegert S. 2022. A tool for mapping
microglial morphology, morphOMICs, reveals brain-region and sex-dependent phenotypes.
Nature Neuroscience. 25(10), 1379–1393.
mla: Colombo, Gloria, et al. “A Tool for Mapping Microglial Morphology, MorphOMICs,
Reveals Brain-Region and Sex-Dependent Phenotypes.” Nature Neuroscience,
vol. 25, no. 10, Springer Nature, 2022, pp. 1379–93, doi:10.1038/s41593-022-01167-6.
short: G. Colombo, R.J. Cubero, L. Kanari, A. Venturino, R. Schulz, M. Scolamiero,
J. Agerberg, H. Mathys, L.-H. Tsai, W. Chachólski, K. Hess, S. Siegert, Nature
Neuroscience 25 (2022) 1379–1393.
corr_author: '1'
date_created: 2023-01-16T09:53:07Z
date_published: 2022-10-01T00:00:00Z
date_updated: 2026-07-21T22:30:09Z
day: '01'
ddc:
- '570'
department:
- _id: SaSi
doi: 10.1038/s41593-022-01167-6
ec_funded: 1
external_id:
isi:
- '000862214700001'
pmid:
- '36180790'
file:
- access_level: open_access
checksum: 28431146873096f52e0107b534f178c9
content_type: application/pdf
creator: dernst
date_created: 2023-01-30T08:06:56Z
date_updated: 2023-01-30T08:06:56Z
file_id: '12437'
file_name: 2022_NatureNeuroscience_Colombo.pdf
file_size: 23789835
relation: main_file
success: 1
file_date_updated: 2023-01-30T08:06:56Z
has_accepted_license: '1'
intvolume: ' 25'
isi: 1
issue: '10'
keyword:
- General Neuroscience
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '10'
oa: 1
oa_version: Published Version
page: 1379-1393
pmid: 1
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 25D4A630-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715571'
name: Microglia action towards neuronal circuit formation and function in health
and disease
publication: Nature Neuroscience
publication_identifier:
eissn:
- 1546-1726
issn:
- 1097-6256
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- description: News on ISTA website
relation: press_release
url: https://ista.ac.at/en/news/morphomics-revealing-the-hidden-meaning-of-microglia-shape/
record:
- id: '12378'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: A tool for mapping microglial morphology, morphOMICs, reveals brain-region
and sex-dependent phenotypes
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: 25
year: '2022'
...
---
OA_place: publisher
_id: '11388'
abstract:
- lang: eng
text: "In evolve and resequence experiments, a population is sequenced, subjected
to selection and\r\nthen sequenced again, so that genetic changes before and after
selection can be observed at\r\nthe genetic level. Here, I use these studies to
better understand the genetic basis of complex\r\ntraits - traits which depend
on more than a few genes.\r\nIn the first chapter, I discuss the first evolve
and resequence experiment, in which a population\r\nof mice, the so-called \"Longshanks\"
mice, were selected for tibia length while their body mass\r\nwas kept constant.
The full pedigree is known. We observed a selection response on all\r\nchromosomes
and used the infinitesimal model with linkage, a model which assumes an infinite\r\nnumber
of genes with infinitesimally small effect sizes, as a null model. Results implied
a very\r\npolygenic basis with a few loci of major effect standing out and changing
in parallel. There\r\nwas large variability between the different chromosomes
in this study, probably due to LD.\r\nIn chapter two, I go on to discuss the impact
of LD, on the variability in an allele-frequency\r\nbased summary statistic, giving
an equation based on the initial allele frequencies, average\r\npairwise LD, and
the first four moments of the haplotype block copy number distribution. I\r\ndescribe
this distribution by referring back to the founder generation. I then demonstrate\r\nhow
to infer selection via a maximum likelihood scheme on the example of a single
locus and\r\ndiscuss how to extend this to more realistic scenarios.\r\nIn chapter
three, I discuss the second evolve and resequence experiment, in which a small\r\npopulation
of Drosophila melanogaster was selected for increased pupal case size over 6\r\ngenerations.
The experiment was highly replicated with 27 lines selected within family and
a\r\nknown pedigree. We observed a phenotypic selection response of over one standard
deviation.\r\nI describe the patterns in allele frequency data, including allele
frequency changes and patterns\r\nof heterozygosity, and give ideas for future
work."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Stefanie
full_name: Belohlavy, Stefanie
id: 43FE426A-F248-11E8-B48F-1D18A9856A87
last_name: Belohlavy
orcid: 0000-0002-9849-498X
citation:
ama: Belohlavy S. The genetic basis of complex traits studied via analysis of evolve
and resequence experiments. 2022. doi:10.15479/at:ista:11388
apa: Belohlavy, S. (2022). The genetic basis of complex traits studied via analysis
of evolve and resequence experiments. Institute of Science and Technology
Austria. https://doi.org/10.15479/at:ista:11388
chicago: Belohlavy, Stefanie. “The Genetic Basis of Complex Traits Studied via Analysis
of Evolve and Resequence Experiments.” Institute of Science and Technology Austria,
2022. https://doi.org/10.15479/at:ista:11388.
ieee: S. Belohlavy, “The genetic basis of complex traits studied via analysis of
evolve and resequence experiments,” Institute of Science and Technology Austria,
2022.
ista: Belohlavy S. 2022. The genetic basis of complex traits studied via analysis
of evolve and resequence experiments. Institute of Science and Technology Austria.
mla: Belohlavy, Stefanie. The Genetic Basis of Complex Traits Studied via Analysis
of Evolve and Resequence Experiments. Institute of Science and Technology
Austria, 2022, doi:10.15479/at:ista:11388.
short: S. Belohlavy, The Genetic Basis of Complex Traits Studied via Analysis of
Evolve and Resequence Experiments, Institute of Science and Technology Austria,
2022.
corr_author: '1'
date_created: 2022-05-16T16:49:18Z
date_published: 2022-05-18T00:00:00Z
date_updated: 2026-04-07T14:29:57Z
day: '18'
ddc:
- '576'
degree_awarded: PhD
department:
- _id: GradSch
- _id: NiBa
doi: 10.15479/at:ista:11388
file:
- access_level: open_access
checksum: 4d75e6a619df7e8a9d6e840aee182380
content_type: application/pdf
creator: sbelohla
date_created: 2022-05-19T13:03:13Z
date_updated: 2023-05-20T22:30:03Z
embargo: 2023-05-19
file_id: '11398'
file_name: thesis_sb_final_pdfa.pdf
file_size: 8247240
relation: main_file
- access_level: closed
checksum: 7a5d8b6dd0ca00784f860075b0a7d8f0
content_type: application/x-zip-compressed
creator: sbelohla
date_created: 2022-05-19T13:07:47Z
date_updated: 2023-05-20T22:30:03Z
embargo_to: open_access
file_id: '11399'
file_name: thesis_sb_final.zip
file_size: 7094
relation: source_file
file_date_updated: 2023-05-20T22:30:03Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '98'
publication_identifier:
isbn:
- 978-3-99078-018-3
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '6713'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
title: The genetic basis of complex traits studied via analysis of evolve and resequence
experiments
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2022'
...
---
OA_place: repository
_id: '11943'
abstract:
- lang: eng
text: Complex wiring between neurons underlies the information-processing network
enabling all brain functions, including cognition and memory. For understanding
how the network is structured, processes information, and changes over time, comprehensive
visualization of the architecture of living brain tissue with its cellular and
molecular components would open up major opportunities. However, electron microscopy
(EM) provides nanometre-scale resolution required for full in-silico
reconstruction1–5, yet is limited to fixed specimens and
static representations. Light microscopy allows live observation, with super-resolution
approaches6–12 facilitating nanoscale visualization, but
comprehensive 3D-reconstruction of living brain tissue has been hindered by tissue
photo-burden, photobleaching, insufficient 3D-resolution, and inadequate signal-to-noise
ratio (SNR). Here we demonstrate saturated reconstruction of living brain tissue.
We developed an integrated imaging and analysis technology, adapting stimulated
emission depletion (STED) microscopy6,13 in extracellularly
labelled tissue14 for high SNR and near-isotropic resolution.
Centrally, a two-stage deep-learning approach leveraged previously obtained information
on sample structure to drastically reduce photo-burden and enable automated volumetric
reconstruction down to single synapse level. Live reconstruction provides unbiased
analysis of tissue architecture across time in relation to functional activity
and targeted activation, and contextual understanding of molecular labelling.
This adoptable technology will facilitate novel insights into the dynamic functional
architecture of living brain tissue.
article_processing_charge: No
author:
- first_name: Philipp
full_name: Velicky, Philipp
id: 39BDC62C-F248-11E8-B48F-1D18A9856A87
last_name: Velicky
orcid: 0000-0002-2340-7431
- first_name: Eder
full_name: Miguel Villalba, Eder
id: 3FB91342-F248-11E8-B48F-1D18A9856A87
last_name: Miguel Villalba
orcid: 0000-0001-5665-0430
- first_name: Julia M
full_name: Michalska, Julia M
id: 443DB6DE-F248-11E8-B48F-1D18A9856A87
last_name: Michalska
orcid: 0000-0003-3862-1235
- first_name: Donglai
full_name: Wei, Donglai
last_name: Wei
- first_name: Zudi
full_name: Lin, Zudi
last_name: Lin
- first_name: Jake
full_name: Watson, Jake
id: 63836096-4690-11EA-BD4E-32803DDC885E
last_name: Watson
orcid: 0000-0002-8698-3823
- first_name: Jakob
full_name: Troidl, Jakob
last_name: Troidl
- first_name: Johanna
full_name: Beyer, Johanna
last_name: Beyer
- first_name: Yoav
full_name: Ben Simon, Yoav
id: 43DF3136-F248-11E8-B48F-1D18A9856A87
last_name: Ben Simon
- first_name: Christoph M
full_name: Sommer, Christoph M
id: 4DF26D8C-F248-11E8-B48F-1D18A9856A87
last_name: Sommer
orcid: 0000-0003-1216-9105
- first_name: Wiebke
full_name: Jahr, Wiebke
id: 425C1CE8-F248-11E8-B48F-1D18A9856A87
last_name: Jahr
orcid: 0000-0003-0201-2315
- first_name: Alban
full_name: Cenameri, Alban
id: 9ac8f577-2357-11eb-997a-e566c5550886
last_name: Cenameri
- first_name: Johannes
full_name: Broichhagen, Johannes
last_name: Broichhagen
- first_name: Seth G. N.
full_name: Grant, Seth G. N.
last_name: Grant
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
- first_name: Hanspeter
full_name: Pfister, Hanspeter
last_name: Pfister
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
citation:
ama: Velicky P, Miguel Villalba E, Michalska JM, et al. Saturated reconstruction
of living brain tissue. bioRxiv. doi:10.1101/2022.03.16.484431
apa: Velicky, P., Miguel Villalba, E., Michalska, J. M., Wei, D., Lin, Z., Watson,
J., … Danzl, J. G. (n.d.). Saturated reconstruction of living brain tissue. bioRxiv.
https://doi.org/10.1101/2022.03.16.484431
chicago: Velicky, Philipp, Eder Miguel Villalba, Julia M Michalska, Donglai Wei,
Zudi Lin, Jake Watson, Jakob Troidl, et al. “Saturated Reconstruction of Living
Brain Tissue.” BioRxiv, n.d. https://doi.org/10.1101/2022.03.16.484431.
ieee: P. Velicky et al., “Saturated reconstruction of living brain tissue,”
bioRxiv. .
ista: Velicky P, Miguel Villalba E, Michalska JM, Wei D, Lin Z, Watson J, Troidl
J, Beyer J, Ben Simon Y, Sommer CM, Jahr W, Cenameri A, Broichhagen J, Grant SGN,
Jonas PM, Novarino G, Pfister H, Bickel B, Danzl JG. Saturated reconstruction
of living brain tissue. bioRxiv, 10.1101/2022.03.16.484431.
mla: Velicky, Philipp, et al. “Saturated Reconstruction of Living Brain Tissue.”
BioRxiv, doi:10.1101/2022.03.16.484431.
short: P. Velicky, E. Miguel Villalba, J.M. Michalska, D. Wei, Z. Lin, J. Watson,
J. Troidl, J. Beyer, Y. Ben Simon, C.M. Sommer, W. Jahr, A. Cenameri, J. Broichhagen,
S.G.N. Grant, P.M. Jonas, G. Novarino, H. Pfister, B. Bickel, J.G. Danzl, BioRxiv
(n.d.).
corr_author: '1'
das_tickbox: '1'
date_created: 2022-08-23T11:07:59Z
date_published: 2022-05-09T00:00:00Z
date_updated: 2026-07-21T22:31:05Z
day: '09'
department:
- _id: PeJo
- _id: GaNo
- _id: BeBi
- _id: JoDa
doi: 10.1101/2022.03.16.484431
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/2022.03.16.484431
month: '05'
oa: 1
oa_version: Preprint
publication: bioRxiv
publication_status: draft
related_material:
record:
- id: '13267'
relation: later_version
status: public
- id: '12470'
relation: dissertation_contains
status: public
status: public
title: Saturated reconstruction of living brain tissue
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2022'
...
---
_id: '11498'
abstract:
- lang: eng
text: Rest-frame ultraviolet (UV) emission lines probe electron densities, gas-phase
abundances, metallicities, and ionization parameters of the emitting star-forming
galaxies and their environments. The strongest main UV emission line, Lyα, has
been instrumental in advancing the general knowledge of galaxy formation in the
early universe. However, observing Lyα emission becomes increasingly challenging
at z ≳ 6 when the neutral hydrogen fraction of the circumgalactic and intergalactic
media increases. Secondary weaker UV emission lines provide important alternative
methods for studying galaxy properties at high redshift. We present a large sample
of rest-frame UV emission line sources at intermediate redshift for calibrating
and exploring the connection between secondary UV lines and the emitting galaxies’
physical properties and their Lyα emission. The sample of 2052 emission line sources
with 1.5 < z < 6.4 was collected from integral field data from the MUSE-Wide and
MUSE-Deep surveys taken as part of Guaranteed Time Observations. The objects were
selected through untargeted source detection (i.e., no preselection of sources
as in dedicated spectroscopic campaigns) in the three-dimensional MUSE data cubes.
We searched optimally extracted one-dimensional spectra of the full sample for
UV emission features via emission line template matching, resulting in a sample
of more than 100 rest-frame UV emission line detections. We show that the detection
efficiency of (non-Lyα) UV emission lines increases with survey depth, and that
the emission line strength of He IIλ1640 Å, [O III] λ1661 + O III] λ1666, and
[Si III] λ1883 + Si III] λ1892 correlate with the strength of [C III] λ1907 +
C III] λ1909. The rest-frame equivalent width (EW0) of [C III] λ1907 + C III]
λ1909 is found to be roughly 0.22 ± 0.18 of EW0(Lyα). We measured the velocity
offsets of resonant emission lines with respect to systemic tracers. For C IVλ1548
+ C IVλ1551 we find that ΔvC IV ≲ 250 km s−1, whereas ΔvLyα falls in the range
of 250−500 km s−1 which is in agreement with previous results from the literature.
The electron density ne measured from [Si III] λ1883 + Si III] λ1892 and [C III]
λ1907 + C III] λ1909 line flux ratios is generally < 105 cm−3 and the gas-phase
abundance is below solar at 12 + log10(O/H)≈8. Lastly, we used “PhotoIonization
Model Probability Density Functions” to infer physical parameters of the full
sample and individual systems based on photoionization model parameter grids and
observational constraints from our UV emission line searches. This reveals that
the UV line emitters generally have ionization parameter log10(U) ≈ −2.5 and metal
mass fractions that scatter around Z ≈ 10−2, that is Z ≈ 0.66 Z⊙. Value-added
catalogs of the full sample of MUSE objects studied in this work and a collection
of UV line emitters from the literature are provided with this paper.
acknowledgement: 'We would like to thank Charlotte Mason for useful discussions and
for providing the data for the curves shown in Fig. 13 and Dawn Erb for providing
the observational data for the comparison sample studied by Steidel et al. (2014),
also shown in Fig. 13. This work has been supported by the BMBF grant 05A14BAC and
we acknowledge support by the Competitive Fund of the Leibniz Association through
grant SAW-2015-AIP-2. AF acknowledges the support from grant PRIN MIUR2017-20173ML3WW_001.
JS acknowledges the support from Vici grant 639.043.409 from the Dutch Research
Council (NWO). GM received funding from the European Union’s Horizon 2020 research
and innovation programme under the Marie Sklodowska-Curie grant agreement No MARACAS
– DLV-896778. This paper is based on observations collected at the European Organisation
for Astronomical Research in the Southern Hemisphere under ESO programmes 094.A-0289(B),
095.A-0010(A), 096.A-0045(A), 096.A-0045(B), 094.A-0205, 095.A-0240, 096.A-0090,
097.A-0160, and 098.A-0017. This paper also makes use of observations made with
the NASA/ESA Hubble Space Telescope obtained at STScI. This research made use of
the following programs and open-source packages for Python and we are thankful to
their developers: DS9 (Joye & Mandel 2003), Astropy (Astropy Collaboration 2013,
2018), APLpy (Robitaille & Bressert 2012), iPython (Pérez & Granger 2007), numpy
(van der Walt et al. 2011), matplotlib (Hunter 2007), and SciPy (Jones et al. 2001).'
article_number: A80
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: K. B.
full_name: Schmidt, K. B.
last_name: Schmidt
- first_name: J.
full_name: Kerutt, J.
last_name: Kerutt
- first_name: L.
full_name: Wisotzki, L.
last_name: Wisotzki
- first_name: T.
full_name: Urrutia, T.
last_name: Urrutia
- first_name: A.
full_name: Feltre, A.
last_name: Feltre
- first_name: M. V.
full_name: Maseda, M. V.
last_name: Maseda
- first_name: T.
full_name: Nanayakkara, T.
last_name: Nanayakkara
- first_name: R.
full_name: Bacon, R.
last_name: Bacon
- first_name: L. A.
full_name: Boogaard, L. A.
last_name: Boogaard
- first_name: S.
full_name: Conseil, S.
last_name: Conseil
- first_name: T.
full_name: Contini, T.
last_name: Contini
- first_name: E. C.
full_name: Herenz, E. C.
last_name: Herenz
- first_name: W.
full_name: Kollatschny, W.
last_name: Kollatschny
- first_name: M.
full_name: Krumpe, M.
last_name: Krumpe
- first_name: F.
full_name: Leclercq, F.
last_name: Leclercq
- first_name: G.
full_name: Mahler, G.
last_name: Mahler
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: V.
full_name: Mauerhofer, V.
last_name: Mauerhofer
- first_name: J.
full_name: Richard, J.
last_name: Richard
- first_name: J.
full_name: Schaye, J.
last_name: Schaye
citation:
ama: Schmidt KB, Kerutt J, Wisotzki L, et al. Recovery and analysis of rest-frame
UV emission lines in 2052 galaxies observed with MUSE at 1.5 < z < 6.4.
Astronomy & Astrophysics. 2021;654. doi:10.1051/0004-6361/202140876
apa: Schmidt, K. B., Kerutt, J., Wisotzki, L., Urrutia, T., Feltre, A., Maseda,
M. V., … Schaye, J. (2021). Recovery and analysis of rest-frame UV emission lines
in 2052 galaxies observed with MUSE at 1.5 < z < 6.4. Astronomy &
Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/202140876
chicago: Schmidt, K. B., J. Kerutt, L. Wisotzki, T. Urrutia, A. Feltre, M. V. Maseda,
T. Nanayakkara, et al. “Recovery and Analysis of Rest-Frame UV Emission Lines
in 2052 Galaxies Observed with MUSE at 1.5 < z < 6.4.” Astronomy &
Astrophysics. EDP Sciences, 2021. https://doi.org/10.1051/0004-6361/202140876.
ieee: K. B. Schmidt et al., “Recovery and analysis of rest-frame UV emission
lines in 2052 galaxies observed with MUSE at 1.5 < z < 6.4,” Astronomy
& Astrophysics, vol. 654. EDP Sciences, 2021.
ista: Schmidt KB, Kerutt J, Wisotzki L, Urrutia T, Feltre A, Maseda MV, Nanayakkara
T, Bacon R, Boogaard LA, Conseil S, Contini T, Herenz EC, Kollatschny W, Krumpe
M, Leclercq F, Mahler G, Matthee JJ, Mauerhofer V, Richard J, Schaye J. 2021.
Recovery and analysis of rest-frame UV emission lines in 2052 galaxies observed
with MUSE at 1.5 < z < 6.4. Astronomy & Astrophysics. 654, A80.
mla: Schmidt, K. B., et al. “Recovery and Analysis of Rest-Frame UV Emission Lines
in 2052 Galaxies Observed with MUSE at 1.5 < z < 6.4.” Astronomy &
Astrophysics, vol. 654, A80, EDP Sciences, 2021, doi:10.1051/0004-6361/202140876.
short: K.B. Schmidt, J. Kerutt, L. Wisotzki, T. Urrutia, A. Feltre, M.V. Maseda,
T. Nanayakkara, R. Bacon, L.A. Boogaard, S. Conseil, T. Contini, E.C. Herenz,
W. Kollatschny, M. Krumpe, F. Leclercq, G. Mahler, J.J. Matthee, V. Mauerhofer,
J. Richard, J. Schaye, Astronomy & Astrophysics 654 (2021).
date_created: 2022-07-06T08:49:03Z
date_published: 2021-10-15T00:00:00Z
date_updated: 2022-07-19T09:34:36Z
day: '15'
doi: 10.1051/0004-6361/202140876
extern: '1'
external_id:
arxiv:
- '2108.01713'
intvolume: ' 654'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'ultraviolet: galaxies / galaxies: high-redshift / galaxies: ISM / ISM: lines and
bands / methods: observational / techniques: imaging spectroscopy'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2108.01713
month: '10'
oa: 1
oa_version: Published Version
publication: Astronomy & Astrophysics
publication_identifier:
eissn:
- 1432-0746
issn:
- 0004-6361
publication_status: published
publisher: EDP Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: Recovery and analysis of rest-frame UV emission lines in 2052 galaxies observed
with MUSE at 1.5 < z < 6.4
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 654
year: '2021'
...
---
_id: '11500'
abstract:
- lang: eng
text: We report the discovery of diffuse extended Lyα emission from redshift 3.1
to 4.5, tracing cosmic web filaments on scales of 2.5−4 cMpc. These structures
have been observed in overdensities of Lyα emitters in the MUSE Extremely Deep
Field, a 140 h deep MUSE observation located in the Hubble Ultra-Deep Field. Among
the 22 overdense regions identified, five are likely to harbor very extended Lyα
emission at high significance with an average surface brightness of 5 × 10−20
erg s−1 cm−2 arcsec−2. Remarkably, 70% of the total Lyα luminosity from these
filaments comes from beyond the circumgalactic medium of any identified Lyα emitter.
Fluorescent Lyα emission powered by the cosmic UV background can only account
for less than 34% of this emission at z ≈ 3 and for not more than 10% at higher
redshift. We find that the bulk of this diffuse emission can be reproduced by
the unresolved Lyα emission of a large population of ultra low-luminosity Lyα
emitters (< 1040 erg s−1), provided that the faint end of the Lyα luminosity function
is steep (α ⪅ −1.8), it extends down to luminosities lower than 1038 − 1037 erg
s−1, and the clustering of these Lyα emitters is significant (filling factor <
1/6). If these Lyα emitters are powered by star formation, then this implies their
luminosity function needs to extend down to star formation rates < 10−4 M⊙ yr−1.
These observations provide the first detection of the cosmic web in Lyα emission
in typical filamentary environments and the first observational clue indicating
the existence of a large population of ultra low-luminosity Lyα emitters at high
redshift.
acknowledgement: 'We warmly thank ESO Paranal staff for their great professional support
during all MXDF GTO observing runs. We thank the anonymous referee for a careful
reading of the manuscript and helpful comments. We also thank Matthew Lehnert for
fruitful discussions. RB, AF, SC acknowledge support from the ERC advanced grant
339659-MUSICOS. JB acknowledges support by Fundação para a Ciência e a Tecnologia
(FCT) through the research grants UID/FIS/04434/2019, UIDB/04434/2020, UIDP/04434/2020
and through the Investigador FCT Contract No. IF/01654/2014/CP1215/CT0003. TG, AV
acknowledges support from the European Research Council under grant agreement ERC-stg-757258
(TRIPLE). DM acknowledges A. Dabbech for useful interactions about IUWT and support
from the GDR ISIS through the Projets exploratoires program (project TASTY). AF
acknowledges the support from grant PRIN MIUR2017-20173ML3WW_001. SLZ acknowledges
support by The Netherlands Organisation for Scientific Research (NWO) through a
TOP Grant Module 1 under project number 614.001.652. This research made use of the
following open-source software and we are thankful to the developers of these: GNU
Octave (Eaton et al. 2018) and its statistics, signal and image packages, the Python
packages Matplotlib (Hunter 2007), Numpy (van der Walt et al. 2010), MPDAF (Piqueras
et al. 2017), Astropy (Astropy Collaboration 2018), PyWavelets (Lee et al. 2019).'
article_number: A107
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: R.
full_name: Bacon, R.
last_name: Bacon
- first_name: D.
full_name: Mary, D.
last_name: Mary
- first_name: T.
full_name: Garel, T.
last_name: Garel
- first_name: J.
full_name: Blaizot, J.
last_name: Blaizot
- first_name: M.
full_name: Maseda, M.
last_name: Maseda
- first_name: J.
full_name: Schaye, J.
last_name: Schaye
- first_name: L.
full_name: Wisotzki, L.
last_name: Wisotzki
- first_name: S.
full_name: Conseil, S.
last_name: Conseil
- first_name: J.
full_name: Brinchmann, J.
last_name: Brinchmann
- first_name: F.
full_name: Leclercq, F.
last_name: Leclercq
- first_name: V.
full_name: Abril-Melgarejo, V.
last_name: Abril-Melgarejo
- first_name: L.
full_name: Boogaard, L.
last_name: Boogaard
- first_name: N. F.
full_name: Bouché, N. F.
last_name: Bouché
- first_name: T.
full_name: Contini, T.
last_name: Contini
- first_name: A.
full_name: Feltre, A.
last_name: Feltre
- first_name: B.
full_name: Guiderdoni, B.
last_name: Guiderdoni
- first_name: C.
full_name: Herenz, C.
last_name: Herenz
- first_name: W.
full_name: Kollatschny, W.
last_name: Kollatschny
- first_name: H.
full_name: Kusakabe, H.
last_name: Kusakabe
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: L.
full_name: Michel-Dansac, L.
last_name: Michel-Dansac
- first_name: T.
full_name: Nanayakkara, T.
last_name: Nanayakkara
- first_name: J.
full_name: Richard, J.
last_name: Richard
- first_name: M.
full_name: Roth, M.
last_name: Roth
- first_name: K. B.
full_name: Schmidt, K. B.
last_name: Schmidt
- first_name: M.
full_name: Steinmetz, M.
last_name: Steinmetz
- first_name: L.
full_name: Tresse, L.
last_name: Tresse
- first_name: T.
full_name: Urrutia, T.
last_name: Urrutia
- first_name: A.
full_name: Verhamme, A.
last_name: Verhamme
- first_name: P. M.
full_name: Weilbacher, P. M.
last_name: Weilbacher
- first_name: J.
full_name: Zabl, J.
last_name: Zabl
- first_name: S. L.
full_name: Zoutendijk, S. L.
last_name: Zoutendijk
citation:
ama: 'Bacon R, Mary D, Garel T, et al. The MUSE Extremely Deep Field: The cosmic
web in emission at high redshift. Astronomy & Astrophysics. 2021;647.
doi:10.1051/0004-6361/202039887'
apa: 'Bacon, R., Mary, D., Garel, T., Blaizot, J., Maseda, M., Schaye, J., … Zoutendijk,
S. L. (2021). The MUSE Extremely Deep Field: The cosmic web in emission at high
redshift. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/202039887'
chicago: 'Bacon, R., D. Mary, T. Garel, J. Blaizot, M. Maseda, J. Schaye, L. Wisotzki,
et al. “The MUSE Extremely Deep Field: The Cosmic Web in Emission at High Redshift.”
Astronomy & Astrophysics. EDP Sciences, 2021. https://doi.org/10.1051/0004-6361/202039887.'
ieee: 'R. Bacon et al., “The MUSE Extremely Deep Field: The cosmic web in
emission at high redshift,” Astronomy & Astrophysics, vol. 647. EDP
Sciences, 2021.'
ista: 'Bacon R, Mary D, Garel T, Blaizot J, Maseda M, Schaye J, Wisotzki L, Conseil
S, Brinchmann J, Leclercq F, Abril-Melgarejo V, Boogaard L, Bouché NF, Contini
T, Feltre A, Guiderdoni B, Herenz C, Kollatschny W, Kusakabe H, Matthee JJ, Michel-Dansac
L, Nanayakkara T, Richard J, Roth M, Schmidt KB, Steinmetz M, Tresse L, Urrutia
T, Verhamme A, Weilbacher PM, Zabl J, Zoutendijk SL. 2021. The MUSE Extremely
Deep Field: The cosmic web in emission at high redshift. Astronomy & Astrophysics.
647, A107.'
mla: 'Bacon, R., et al. “The MUSE Extremely Deep Field: The Cosmic Web in Emission
at High Redshift.” Astronomy & Astrophysics, vol. 647, A107, EDP Sciences,
2021, doi:10.1051/0004-6361/202039887.'
short: R. Bacon, D. Mary, T. Garel, J. Blaizot, M. Maseda, J. Schaye, L. Wisotzki,
S. Conseil, J. Brinchmann, F. Leclercq, V. Abril-Melgarejo, L. Boogaard, N.F.
Bouché, T. Contini, A. Feltre, B. Guiderdoni, C. Herenz, W. Kollatschny, H. Kusakabe,
J.J. Matthee, L. Michel-Dansac, T. Nanayakkara, J. Richard, M. Roth, K.B. Schmidt,
M. Steinmetz, L. Tresse, T. Urrutia, A. Verhamme, P.M. Weilbacher, J. Zabl, S.L.
Zoutendijk, Astronomy & Astrophysics 647 (2021).
date_created: 2022-07-06T09:31:50Z
date_published: 2021-03-18T00:00:00Z
date_updated: 2022-07-19T09:34:57Z
day: '18'
doi: 10.1051/0004-6361/202039887
extern: '1'
external_id:
arxiv:
- '2102.05516'
intvolume: ' 647'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'galaxies: high-redshift / galaxies: groups: general / cosmology: observations'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2102.05516
month: '03'
oa: 1
oa_version: Published Version
publication: Astronomy & Astrophysics
publication_identifier:
eissn:
- 1432-0746
issn:
- 0004-6361
publication_status: published
publisher: EDP Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The MUSE Extremely Deep Field: The cosmic web in emission at high redshift'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 647
year: '2021'
...
---
_id: '11522'
abstract:
- lang: eng
text: The decline in abundance of Lyman-α (Lyα) emitting galaxies at z ≳ 6 is a
powerful and commonly used probe to constrain the progress of cosmic reionization.
We use the CODAII simulation, which is a radiation hydrodynamic simulation featuring
a box of ∼94 comoving Mpc side length, to compute the Lyα transmission properties
of the intergalactic medium (IGM) at z ∼ 5.8 to 7. Our results mainly confirm
previous studies, i.e. we find a declining Lyα transmission with redshift and
a large sightline-to-sightline variation. However, motivated by the recent discovery
of blue Lyα peaks at high redshift, we also analyse the IGM transmission on the
blue side, which shows a rapid decline at z ≳ 6 of the blue transmission. This
low transmission can be attributed not only to the presence of neutral regions
but also to the residual neutral hydrogen within ionized regions, for which a
density even as low as nHI∼10−9cm−3 (sometimes combined with kinematic effects)
leads to a significantly reduced visibility. Still, we find that ∼1 per cent of
sightlines towards M1600AB ∼ −21 galaxies at z ∼ 7 are transparent enough to allow
a transmission of a blue Lyα peak. We discuss our results in the context of the
interpretation of observations.
acknowledgement: The authors thank the referee for constructive feedback that improved
the outcome of this study. We are grateful to Antoinette Songaila Cowie for sharing
the ‘NEPLA4’ spectrum with us. This research has made use of NASA’s Astrophysics
Data System, and many open source projects such as trident (Hummels et al. 2017),
IPython (Pérez & Granger 2007), SciPy (Virtanen et al. 2019), NumPy (Walt et al.
2011), matplotlib (Hunter 2007), pandas (McKinney 2010), and the yt-project (Turk
et al. 2011). MG was supported by NASA through the NASA Hubble Fellowship grant
HST-HF2-51409 awarded by the Space Telescope Science Institute, which is operated
by the Association of Universities for Research in Astronomy, Inc., for NASA, under
contract NAS5-26555. MG acknowledges support from NASA grants HST-GO-15643.017,
and HST-AR15797.001 as well as XSEDE grant TG-AST180036. CAM acknowledges support
by NASA Headquarters through the NASA Hubble Fellowship grant HST-HF2-51413.001-A.
PRS was supported in part by U.S. NSF grant AST-1009799, NASA grant NNX11AE09G,
and supercomputer resources from NSF XSEDE grant TG AST090005 and the Texas Advanced
Computing Center (TACC) at The University of Texas at Austin. JM acknowledges a
Zwicky Prize Fellowship from ETH Zurich. GY acknowledges financial support by MICIU/FEDER
under project grant PGC2018-094975-C21. SEIB acknowledges funding from the European
Research Council (ERC) under the European Union’s Horizon 2020 research and innovation
programme (grant agreement No. 669253). ITI was supported by the Science and Technology
Facilities Council [grants ST/I000976/1, ST/F002858/1, ST/P000525/1, and ST/T000473/1];
and The Southeast Physics Network (SEPNet). KA was supported by NRF2016R1D1A1B04935414
and NRF-2016R1A5A1013277. KA also appreciates APCTP for its hospitality during completion
of this work. PO acknowledges support from the French ANR funded project ORAGE (ANR-14-CE33-0016).
ND and DA acknowledge funding from the French ANR for project ANR-12-JS05- 0001
(EMMA). The CoDa II simulation was performed at Oak Ridge National Laboratory/Oak
Ridge Leadership Computing Facility on the Titan supercomputer (INCITE 2016 award
AST031). Processing was performed on the Eos and Rhea clusters. Resolution study
simulations were performed on Piz Daint at the Swiss National Supercomputing Center
(PRACE Tier 0 award, project id pr37). The authors would like to acknowledge the
High Performance Computing center of the University of Strasbourg for supporting
this work by providing scientific support and access to computing resources. Part
of the computing resources were funded by the Equipex EquipMeso project (Programme
Investissements d’Avenir) and the CPER Alsacalcul/Big Data.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Max
full_name: Gronke, Max
last_name: Gronke
- first_name: Pierre
full_name: Ocvirk, Pierre
last_name: Ocvirk
- first_name: Charlotte
full_name: Mason, Charlotte
last_name: Mason
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: Sarah E I
full_name: Bosman, Sarah E I
last_name: Bosman
- first_name: Jenny G
full_name: Sorce, Jenny G
last_name: Sorce
- first_name: Joseph
full_name: Lewis, Joseph
last_name: Lewis
- first_name: Kyungjin
full_name: Ahn, Kyungjin
last_name: Ahn
- first_name: Dominique
full_name: Aubert, Dominique
last_name: Aubert
- first_name: Taha
full_name: Dawoodbhoy, Taha
last_name: Dawoodbhoy
- first_name: Ilian T
full_name: Iliev, Ilian T
last_name: Iliev
- first_name: Paul R
full_name: Shapiro, Paul R
last_name: Shapiro
- first_name: Gustavo
full_name: Yepes, Gustavo
last_name: Yepes
citation:
ama: Gronke M, Ocvirk P, Mason C, et al. Lyman-α transmission properties of the
intergalactic medium in the CoDaII simulation. Monthly Notices of the Royal
Astronomical Society. 2021;508(3):3697-3709. doi:10.1093/mnras/stab2762
apa: Gronke, M., Ocvirk, P., Mason, C., Matthee, J. J., Bosman, S. E. I., Sorce,
J. G., … Yepes, G. (2021). Lyman-α transmission properties of the intergalactic
medium in the CoDaII simulation. Monthly Notices of the Royal Astronomical
Society. Oxford University Press. https://doi.org/10.1093/mnras/stab2762
chicago: Gronke, Max, Pierre Ocvirk, Charlotte Mason, Jorryt J Matthee, Sarah E
I Bosman, Jenny G Sorce, Joseph Lewis, et al. “Lyman-α Transmission Properties
of the Intergalactic Medium in the CoDaII Simulation.” Monthly Notices of the
Royal Astronomical Society. Oxford University Press, 2021. https://doi.org/10.1093/mnras/stab2762.
ieee: M. Gronke et al., “Lyman-α transmission properties of the intergalactic
medium in the CoDaII simulation,” Monthly Notices of the Royal Astronomical
Society, vol. 508, no. 3. Oxford University Press, pp. 3697–3709, 2021.
ista: Gronke M, Ocvirk P, Mason C, Matthee JJ, Bosman SEI, Sorce JG, Lewis J, Ahn
K, Aubert D, Dawoodbhoy T, Iliev IT, Shapiro PR, Yepes G. 2021. Lyman-α transmission
properties of the intergalactic medium in the CoDaII simulation. Monthly Notices
of the Royal Astronomical Society. 508(3), 3697–3709.
mla: Gronke, Max, et al. “Lyman-α Transmission Properties of the Intergalactic Medium
in the CoDaII Simulation.” Monthly Notices of the Royal Astronomical Society,
vol. 508, no. 3, Oxford University Press, 2021, pp. 3697–709, doi:10.1093/mnras/stab2762.
short: M. Gronke, P. Ocvirk, C. Mason, J.J. Matthee, S.E.I. Bosman, J.G. Sorce,
J. Lewis, K. Ahn, D. Aubert, T. Dawoodbhoy, I.T. Iliev, P.R. Shapiro, G. Yepes,
Monthly Notices of the Royal Astronomical Society 508 (2021) 3697–3709.
date_created: 2022-07-07T09:30:21Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2022-08-18T10:45:56Z
day: '01'
doi: 10.1093/mnras/stab2762
extern: '1'
external_id:
arxiv:
- '2004.14496'
intvolume: ' 508'
issue: '3'
keyword:
- dark ages
- reionization
- first stars
- intergalactic medium
- 'galaxies: formation'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2004.14496
month: '12'
oa: 1
oa_version: Preprint
page: 3697-3709
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
eissn:
- 1365-2966
issn:
- 0035-8711
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Lyman-α transmission properties of the intergalactic medium in the CoDaII simulation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 508
year: '2021'
...
---
_id: '11524'
abstract:
- lang: eng
text: We measure the evolution of the rest-frame UV luminosity function (LF) and
the stellar mass function (SMF) of Lyman-α (Ly α) emitters (LAEs) from z ∼ 2 to
z ∼ 6 by exploring ∼4000 LAEs from the SC4K sample. We find a correlation between
Ly α luminosity (LLy α) and rest-frame UV (MUV), with best fit MUV=−1.6+0.2−0.3log10(LLyα/ergs−1)+47+12−11
and a shallower relation between LLy α and stellar mass (M⋆), with best fit log10(M⋆/M⊙)=0.9+0.1−0.1log10(LLyα/ergs−1)−28+4.0−3.8.
An increasing LLy α cut predominantly lowers the number density of faint MUV and
low M⋆ LAEs. We estimate a proxy for the full UV LFs and SMFs of LAEs with simple
assumptions of the faint end slope. For the UV LF, we find a brightening of the
characteristic UV luminosity (M∗UV) with increasing redshift and a decrease of
the characteristic number density (Φ*). For the SMF, we measure a characteristic
stellar mass (M∗⋆/M⊙) increase with increasing redshift, and a Φ* decline. However,
if we apply a uniform luminosity cut of log10(LLyα/ergs−1)≥43.0, we find much
milder to no evolution in the UV and SMF of LAEs. The UV luminosity density (ρUV)
of the full sample of LAEs shows moderate evolution and the stellar mass density
(ρM) decreases, with both being always lower than the total ρUV and ρM of more
typical galaxies but slowly approaching them with increasing redshift. Overall,
our results indicate that both ρUV and ρM of LAEs slowly approach the measurements
of continuum-selected galaxies at z > 6, which suggests a key role of LAEs in
the epoch of reionization.
acknowledgement: This research made use of Astropy, a community developed core Python
package for Astronomy (Astropy Collaboration et al. 2013). topcat, a graphical tool
for manipulating tabular data, was also utilized in this analysis (Taylor 2005).
SG would like to thank Nastasha Wijers for the discussion on the column density
distribution in EAGLE. SC gratefully acknowledges support from Swiss National Science
Foundation grants PP00P2 163824 and PP00P2 190092, and from the European Research
Council (ERC) under the European Union’s Horizon 2020 research and innovation programme
grant agreement No 864361. GP acknowledges support from the Swiss National Science
Foundation (SNF) and from the Netherlands Research School for Astronomy (NOVA).
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: S
full_name: Santos, S
last_name: Santos
- first_name: D
full_name: Sobral, D
last_name: Sobral
- first_name: J
full_name: Butterworth, J
last_name: Butterworth
- first_name: A
full_name: Paulino-Afonso, A
last_name: Paulino-Afonso
- first_name: B
full_name: Ribeiro, B
last_name: Ribeiro
- first_name: E
full_name: da Cunha, E
last_name: da Cunha
- first_name: J
full_name: Calhau, J
last_name: Calhau
- first_name: A A
full_name: Khostovan, A A
last_name: Khostovan
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: P
full_name: Arrabal Haro, P
last_name: Arrabal Haro
citation:
ama: Santos S, Sobral D, Butterworth J, et al. The evolution of the UV luminosity
and stellar mass functions of Lyman-α emitters from z ∼ 2 to z ∼ 6. Monthly
Notices of the Royal Astronomical Society. 2021;505(1):1117-1134. doi:10.1093/mnras/stab1218
apa: Santos, S., Sobral, D., Butterworth, J., Paulino-Afonso, A., Ribeiro, B., da Cunha,
E., … Arrabal Haro, P. (2021). The evolution of the UV luminosity and stellar
mass functions of Lyman-α emitters from z ∼ 2 to z ∼ 6. Monthly Notices of
the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stab1218
chicago: Santos, S, D Sobral, J Butterworth, A Paulino-Afonso, B Ribeiro, E da Cunha,
J Calhau, A A Khostovan, Jorryt J Matthee, and P Arrabal Haro. “The Evolution
of the UV Luminosity and Stellar Mass Functions of Lyman-α Emitters from z ∼ 2
to z ∼ 6.” Monthly Notices of the Royal Astronomical Society. Oxford University
Press, 2021. https://doi.org/10.1093/mnras/stab1218.
ieee: S. Santos et al., “The evolution of the UV luminosity and stellar mass
functions of Lyman-α emitters from z ∼ 2 to z ∼ 6,” Monthly Notices of the
Royal Astronomical Society, vol. 505, no. 1. Oxford University Press, pp.
1117–1134, 2021.
ista: Santos S, Sobral D, Butterworth J, Paulino-Afonso A, Ribeiro B, da Cunha E,
Calhau J, Khostovan AA, Matthee JJ, Arrabal Haro P. 2021. The evolution of the
UV luminosity and stellar mass functions of Lyman-α emitters from z ∼ 2 to z ∼
6. Monthly Notices of the Royal Astronomical Society. 505(1), 1117–1134.
mla: Santos, S., et al. “The Evolution of the UV Luminosity and Stellar Mass Functions
of Lyman-α Emitters from z ∼ 2 to z ∼ 6.” Monthly Notices of the Royal Astronomical
Society, vol. 505, no. 1, Oxford University Press, 2021, pp. 1117–34, doi:10.1093/mnras/stab1218.
short: S. Santos, D. Sobral, J. Butterworth, A. Paulino-Afonso, B. Ribeiro, E. da Cunha,
J. Calhau, A.A. Khostovan, J.J. Matthee, P. Arrabal Haro, Monthly Notices of the
Royal Astronomical Society 505 (2021) 1117–1134.
date_created: 2022-07-07T10:02:59Z
date_published: 2021-07-01T00:00:00Z
date_updated: 2022-08-18T10:51:47Z
day: '01'
doi: 10.1093/mnras/stab1218
extern: '1'
external_id:
arxiv:
- '2105.00007'
intvolume: ' 505'
issue: '1'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'galaxies: evolution'
- 'galaxies: high-redshift'
- 'galaxies: luminosity function'
- mass function
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2105.00007
month: '07'
oa: 1
oa_version: Preprint
page: 1117-1134
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
eissn:
- 1365-2966
issn:
- 0035-8711
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: The evolution of the UV luminosity and stellar mass functions of Lyman-α emitters
from z ∼ 2 to z ∼ 6
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 505
year: '2021'
...
---
_id: '11756'
abstract:
- lang: eng
text: We give two fully dynamic algorithms that maintain a (1 + ε)-approximation
of the weight M of a minimum spanning forest (MSF) of an n-node graph G with edges
weights in [1, W ], for any ε > 0. (1) Our deterministic algorithm takes O (W
2 log W /ε3) worst-case update time, which is O (1) if both W and ε are constants.
(2) Our randomized (Monte-Carlo style) algorithm works with high probability and
runs in worst-case O (log W /ε4) update time if W = O ((m∗)1/6/log2/3 n), where
m∗ is the minimum number of edges in the graph throughout all the updates. It
works even against an adaptive adversary. We complement our algorithmic results
with two cell-probe lower bounds for dynamically maintaining an approximation
of the weight of an MSF of a graph.
article_number: '104805'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Pan
full_name: Peng, Pan
last_name: Peng
citation:
ama: Henzinger M, Peng P. Constant-time dynamic weight approximation for minimum
spanning forest. Information and Computation. 2021;281(12). doi:10.1016/j.ic.2021.104805
apa: Henzinger, M., & Peng, P. (2021). Constant-time dynamic weight approximation
for minimum spanning forest. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2021.104805
chicago: Henzinger, Monika, and Pan Peng. “Constant-Time Dynamic Weight Approximation
for Minimum Spanning Forest.” Information and Computation. Elsevier, 2021.
https://doi.org/10.1016/j.ic.2021.104805.
ieee: M. Henzinger and P. Peng, “Constant-time dynamic weight approximation for
minimum spanning forest,” Information and Computation, vol. 281, no. 12.
Elsevier, 2021.
ista: Henzinger M, Peng P. 2021. Constant-time dynamic weight approximation for
minimum spanning forest. Information and Computation. 281(12), 104805.
mla: Henzinger, Monika, and Pan Peng. “Constant-Time Dynamic Weight Approximation
for Minimum Spanning Forest.” Information and Computation, vol. 281, no.
12, 104805, Elsevier, 2021, doi:10.1016/j.ic.2021.104805.
short: M. Henzinger, P. Peng, Information and Computation 281 (2021).
date_created: 2022-08-08T10:58:29Z
date_published: 2021-12-01T00:00:00Z
date_updated: 2024-11-06T12:09:22Z
day: '01'
doi: 10.1016/j.ic.2021.104805
extern: '1'
external_id:
arxiv:
- '2011.00977'
intvolume: ' 281'
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2011.00977
month: '12'
oa: 1
oa_version: Preprint
publication: Information and Computation
publication_identifier:
issn:
- 0890-5401
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Constant-time dynamic weight approximation for minimum spanning forest
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 281
year: '2021'
...
---
_id: '11886'
abstract:
- lang: eng
text: "We present a deterministic (1+\U0001D45C(1))-approximation (\U0001D45B1/2+\U0001D45C(1)+\U0001D4371+\U0001D45C(1))-time
algorithm for solving the single-source shortest paths problem on distributed
weighted networks (the \\sf CONGEST model); here \U0001D45B is the number of nodes
in the network, \U0001D437 is its (hop) diameter, and edge weights are positive
integers from 1 to poly(\U0001D45B). This is the first nontrivial deterministic
algorithm for this problem. It also improves (i) the running time of the randomized
(1+\U0001D45C(1))-approximation \U0001D442̃ (\U0001D45B√\U0001D4371/4+\U0001D437)-time
algorithm of Nanongkai [in Proceedings of STOC, 2014, pp. 565--573] by a factor
of as large as \U0001D45B1/8, and (ii) the \U0001D442(\U0001D716−1log\U0001D716−1)-approximation
factor of Lenzen and Patt-Shamir's \U0001D442̃ (\U0001D45B1/2+\U0001D716+\U0001D437)-time
algorithm [in Proceedings of STOC, 2013, pp. 381--390] within the same running
time. (Throughout, we use \U0001D442̃ (⋅) to hide polylogarithmic factors in \U0001D45B.)
Our running time matches the known time lower bound of Ω(\U0001D45B/log\U0001D45B‾‾‾‾‾‾‾√+\U0001D437)
[M. Elkin, SIAM J. Comput., 36 (2006), pp. 433--456], thus essentially settling
the status of this problem which was raised at least a decade ago [M. Elkin, SIGACT
News, 35 (2004), pp. 40--57]. It also implies a (2+\U0001D45C(1))-approximation
(\U0001D45B1/2+\U0001D45C(1)+\U0001D4371+\U0001D45C(1))-time algorithm for approximating
a network's weighted diameter which almost matches the lower bound by Holzer and
Pinsker [in Proceedings of OPODIS, 2015, Schloss Dagstuhl. Leibniz-Zent. Inform.,
Wadern, Germany, 2016, 6]. In achieving this result, we develop two techniques
which might be of independent interest and useful in other settings: (i) a deterministic
process that replaces the “hitting set argument” commonly used for shortest paths
computation in various settings, and (ii) a simple, deterministic construction
of an (\U0001D45B\U0001D45C(1),\U0001D45C(1))-hop set of size \U0001D45B1+\U0001D45C(1).
We combine these techniques with many distributed algorithmic techniques, some
of which are from problems that are not directly related to shortest paths, e.g.,
ruling sets [A. V. Goldberg, S. A. Plotkin, and G. E. Shannon, SIAM J. Discrete
Math., 1 (1988), pp. 434--446], source detection [C. Lenzen and D. Peleg, in Proceedings
of PODC, 2013, pp. 375--382], and partial distance estimation [C. Lenzen and B.
Patt-Shamir, in Proceedings of PODC, 2015, pp. 153--162]. Our hop set construction
also leads to single-source shortest paths algorithms in two other settings: (i)
a (1+\U0001D45C(1))-approximation \U0001D45B\U0001D45C(1)-time algorithm on congested
cliques, and (ii) a (1+\U0001D45C(1))-approximation \U0001D45B\U0001D45C(1)-pass
\U0001D45B1+\U0001D45C(1)-space streaming algorithm. The first result answers
an open problem in [D. Nanongkai, in Proceedings of STOC, 2014, pp. 565--573].
The second result partially answers an open problem raised by McGregor in 2006
[List of Open Problems in Sublinear Algorithms: Problem 14]."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Sebastian
full_name: Krinninger, Sebastian
last_name: Krinninger
- first_name: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
citation:
ama: Henzinger M, Krinninger S, Nanongkai D. A deterministic almost-tight distributed
algorithm for approximating single-source shortest paths. SIAM Journal on Computing.
2021;50(3):STOC16-98-STOC16-137. doi:10.1137/16m1097808
apa: Henzinger, M., Krinninger, S., & Nanongkai, D. (2021). A deterministic
almost-tight distributed algorithm for approximating single-source shortest paths.
SIAM Journal on Computing. Society for Industrial & Applied Mathematics.
https://doi.org/10.1137/16m1097808
chicago: Henzinger, Monika, Sebastian Krinninger, and Danupon Nanongkai. “A Deterministic
Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths.”
SIAM Journal on Computing. Society for Industrial & Applied Mathematics,
2021. https://doi.org/10.1137/16m1097808.
ieee: M. Henzinger, S. Krinninger, and D. Nanongkai, “A deterministic almost-tight
distributed algorithm for approximating single-source shortest paths,” SIAM
Journal on Computing, vol. 50, no. 3. Society for Industrial & Applied
Mathematics, pp. STOC16-98-STOC16-137, 2021.
ista: Henzinger M, Krinninger S, Nanongkai D. 2021. A deterministic almost-tight
distributed algorithm for approximating single-source shortest paths. SIAM Journal
on Computing. 50(3), STOC16-98-STOC16-137.
mla: Henzinger, Monika, et al. “A Deterministic Almost-Tight Distributed Algorithm
for Approximating Single-Source Shortest Paths.” SIAM Journal on Computing,
vol. 50, no. 3, Society for Industrial & Applied Mathematics, 2021, pp. STOC16-98-STOC16-137,
doi:10.1137/16m1097808.
short: M. Henzinger, S. Krinninger, D. Nanongkai, SIAM Journal on Computing 50 (2021)
STOC16-98-STOC16-137.
date_created: 2022-08-17T07:54:45Z
date_published: 2021-05-01T00:00:00Z
date_updated: 2024-11-06T12:22:31Z
day: '01'
doi: 10.1137/16m1097808
extern: '1'
external_id:
arxiv:
- '1504.07056'
intvolume: ' 50'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1504.07056
month: '05'
oa: 1
oa_version: Preprint
page: STOC16-98-STOC16-137
publication: SIAM Journal on Computing
publication_identifier:
eissn:
- 1095-7111
issn:
- 0097-5397
publication_status: published
publisher: Society for Industrial & Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: A deterministic almost-tight distributed algorithm for approximating single-source
shortest paths
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 50
year: '2021'
...
---
_id: '13072'
abstract:
- lang: eng
text: CpGs and corresponding mean weights for DNAm-based prediction of cognitive
abilities (6 traits)
article_processing_charge: No
author:
- first_name: Daniel L
full_name: McCartney, Daniel L
last_name: McCartney
- first_name: Robert F
full_name: Hillary, Robert F
last_name: Hillary
- first_name: Eleanor LS
full_name: Conole, Eleanor LS
last_name: Conole
- first_name: Daniel
full_name: Trejo Banos, Daniel
last_name: Trejo Banos
- first_name: Danni A
full_name: Gadd, Danni A
last_name: Gadd
- first_name: Rosie M
full_name: Walker, Rosie M
last_name: Walker
- first_name: Cliff
full_name: Nangle, Cliff
last_name: Nangle
- first_name: Robin
full_name: Flaig, Robin
last_name: Flaig
- first_name: Archie
full_name: Campbell, Archie
last_name: Campbell
- first_name: Alison D
full_name: Murray, Alison D
last_name: Murray
- first_name: Susana
full_name: Munoz Maniega, Susana
last_name: Munoz Maniega
- first_name: Maria
full_name: del C Valdes-Hernandez, Maria
last_name: del C Valdes-Hernandez
- first_name: Mathew A
full_name: Harris, Mathew A
last_name: Harris
- first_name: Mark E
full_name: Bastin, Mark E
last_name: Bastin
- first_name: Joanna M
full_name: Wardlaw, Joanna M
last_name: Wardlaw
- first_name: Sarah E
full_name: Harris, Sarah E
last_name: Harris
- first_name: David J
full_name: Porteous, David J
last_name: Porteous
- first_name: Elliot M
full_name: Tucker-Drob, Elliot M
last_name: Tucker-Drob
- first_name: Andrew M
full_name: McIntosh, Andrew M
last_name: McIntosh
- first_name: Kathryn L
full_name: Evans, Kathryn L
last_name: Evans
- first_name: Ian J
full_name: Deary, Ian J
last_name: Deary
- first_name: Simon R
full_name: Cox, Simon R
last_name: Cox
- first_name: Matthew Richard
full_name: Robinson, Matthew Richard
id: E5D42276-F5DA-11E9-8E24-6303E6697425
last_name: Robinson
orcid: 0000-0001-8982-8813
- first_name: Riccardo E
full_name: Marioni, Riccardo E
last_name: Marioni
citation:
ama: McCartney DL, Hillary RF, Conole EL, et al. Blood-based epigenome-wide analyses
of cognitive abilities. 2021. doi:10.5281/ZENODO.5794028
apa: McCartney, D. L., Hillary, R. F., Conole, E. L., Trejo Banos, D., Gadd, D.
A., Walker, R. M., … Marioni, R. E. (2021). Blood-based epigenome-wide analyses
of cognitive abilities. Zenodo. https://doi.org/10.5281/ZENODO.5794028
chicago: McCartney, Daniel L, Robert F Hillary, Eleanor LS Conole, Daniel Trejo
Banos, Danni A Gadd, Rosie M Walker, Cliff Nangle, et al. “Blood-Based Epigenome-Wide
Analyses of Cognitive Abilities.” Zenodo, 2021. https://doi.org/10.5281/ZENODO.5794028.
ieee: D. L. McCartney et al., “Blood-based epigenome-wide analyses of cognitive
abilities.” Zenodo, 2021.
ista: McCartney DL, Hillary RF, Conole EL, Trejo Banos D, Gadd DA, Walker RM, Nangle
C, Flaig R, Campbell A, Murray AD, Munoz Maniega S, del C Valdes-Hernandez M,
Harris MA, Bastin ME, Wardlaw JM, Harris SE, Porteous DJ, Tucker-Drob EM, McIntosh
AM, Evans KL, Deary IJ, Cox SR, Robinson MR, Marioni RE. 2021. Blood-based epigenome-wide
analyses of cognitive abilities, Zenodo, 10.5281/ZENODO.5794028.
mla: McCartney, Daniel L., et al. Blood-Based Epigenome-Wide Analyses of Cognitive
Abilities. Zenodo, 2021, doi:10.5281/ZENODO.5794028.
short: D.L. McCartney, R.F. Hillary, E.L. Conole, D. Trejo Banos, D.A. Gadd, R.M.
Walker, C. Nangle, R. Flaig, A. Campbell, A.D. Murray, S. Munoz Maniega, M. del
C Valdes-Hernandez, M.A. Harris, M.E. Bastin, J.M. Wardlaw, S.E. Harris, D.J.
Porteous, E.M. Tucker-Drob, A.M. McIntosh, K.L. Evans, I.J. Deary, S.R. Cox, M.R.
Robinson, R.E. Marioni, (2021).
date_created: 2023-05-23T16:46:20Z
date_published: 2021-12-20T00:00:00Z
date_updated: 2025-06-11T13:54:53Z
day: '20'
ddc:
- '570'
department:
- _id: MaRo
doi: 10.5281/ZENODO.5794028
main_file_link:
- open_access: '1'
url: https://doi.org/10.5281/zenodo.5794029
month: '12'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
record:
- id: '10702'
relation: used_in_publication
status: public
status: public
title: Blood-based epigenome-wide analyses of cognitive abilities
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: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '15219'
abstract:
- lang: eng
text: We have carried out a search for massive white dwarfs (WDs) in the direction
of young open star clusters using the Gaia DR2 database. The aim of this survey
was (1) to provide robust data for new and previously known high-mass WDs regarding
cluster membership, (2) to highlight WDs previously included in the initial final
mass relation (IFMR) that are unlikely members of their respective clusters according
to Gaia astrometry, and (3) to select an unequivocal WD sample that could then
be compared with the host clusters' turnoff masses. All promising WD candidates
in each cluster color–magnitude diagram were followed up with spectroscopy from
Gemini in order to determine whether they were indeed WDs and derive their masses,
temperatures, and ages. In order to be considered cluster members, white dwarfs
were required to (1) have proper motions and parallaxes within 2σ, 3σ, or 4σ of
those of their potential parent cluster based on how contaminated the field was
in their region of the sky, (2) have a cooling age that was less than the cluster
age, and (3) have a mass that was broadly consistent with the IFMR. A number of
WDs included in current versions of the IFMR turned out to be nonmembers, and
a number of apparent members, based on Gaia's astrometric data alone, were rejected,
as their mass and/or cooling times were incompatible with cluster membership.
In this way, we developed a highly selected IFMR sample for high-mass WDs that,
surprisingly, contained no precursor masses significantly in excess of ∼ 6 M⊙.
article_number: '165'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Harvey B.
full_name: Richer, Harvey B.
last_name: Richer
- first_name: Ilaria
full_name: Caiazzo, Ilaria
id: 8ae5b6e7-2a03-11ee-914d-b58ed7a3b47d
last_name: Caiazzo
orcid: 0000-0002-4770-5388
- first_name: Helen
full_name: Du, Helen
last_name: Du
- first_name: Steffani
full_name: Grondin, Steffani
last_name: Grondin
- first_name: James
full_name: Hegarty, James
last_name: Hegarty
- first_name: Jeremy
full_name: Heyl, Jeremy
last_name: Heyl
- first_name: Ronan
full_name: Kerr, Ronan
last_name: Kerr
- first_name: David R.
full_name: Miller, David R.
last_name: Miller
- first_name: Sarah
full_name: Thiele, Sarah
last_name: Thiele
citation:
ama: Richer HB, Caiazzo I, Du H, et al. Massive white dwarfs in young star clusters.
The Astrophysical Journal. 2021;912(2). doi:10.3847/1538-4357/abdeb7
apa: Richer, H. B., Caiazzo, I., Du, H., Grondin, S., Hegarty, J., Heyl, J., … Thiele,
S. (2021). Massive white dwarfs in young star clusters. The Astrophysical Journal.
American Astronomical Society. https://doi.org/10.3847/1538-4357/abdeb7
chicago: Richer, Harvey B., Ilaria Caiazzo, Helen Du, Steffani Grondin, James Hegarty,
Jeremy Heyl, Ronan Kerr, David R. Miller, and Sarah Thiele. “Massive White Dwarfs
in Young Star Clusters.” The Astrophysical Journal. American Astronomical
Society, 2021. https://doi.org/10.3847/1538-4357/abdeb7.
ieee: H. B. Richer et al., “Massive white dwarfs in young star clusters,”
The Astrophysical Journal, vol. 912, no. 2. American Astronomical Society,
2021.
ista: Richer HB, Caiazzo I, Du H, Grondin S, Hegarty J, Heyl J, Kerr R, Miller DR,
Thiele S. 2021. Massive white dwarfs in young star clusters. The Astrophysical
Journal. 912(2), 165.
mla: Richer, Harvey B., et al. “Massive White Dwarfs in Young Star Clusters.” The
Astrophysical Journal, vol. 912, no. 2, 165, American Astronomical Society,
2021, doi:10.3847/1538-4357/abdeb7.
short: H.B. Richer, I. Caiazzo, H. Du, S. Grondin, J. Hegarty, J. Heyl, R. Kerr,
D.R. Miller, S. Thiele, The Astrophysical Journal 912 (2021).
date_created: 2024-03-26T10:33:23Z
date_published: 2021-05-17T00:00:00Z
date_updated: 2024-04-03T14:11:17Z
day: '17'
doi: 10.3847/1538-4357/abdeb7
extern: '1'
external_id:
arxiv:
- '2101.08300'
intvolume: ' 912'
issue: '2'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2101.08300
month: '05'
oa: 1
oa_version: Preprint
publication: The Astrophysical Journal
publication_identifier:
eissn:
- 1538-4357
issn:
- 0004-637X
publication_status: published
publisher: American Astronomical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Massive white dwarfs in young star clusters
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 912
year: '2021'
...
---
OA_place: repository
OA_type: green
_id: '19492'
abstract:
- lang: eng
text: Kuroda’s formula relates the class number of a multiquadratic number field
K to the class numbers of its quadratic subfields ki. A key component in this
formula is the unit group index (math formular). We study how Q(K) behaves on
average in certain natural families of totally real biquadratic fields K parametrized
by prime numbers.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Yik Tung
full_name: Chan, Yik Tung
id: c4c0afc8-9262-11ed-9231-d8b0bc743af1
last_name: Chan
orcid: 0000-0001-8467-4106
- first_name: Djordjo
full_name: Milovic, Djordjo
last_name: Milovic
citation:
ama: Chan S, Milovic D. Kuroda’s formula and arithmetic statistics. Mathematische
Zeitschrift. 2021;300(2):1509-1527. doi:10.1007/s00209-021-02823-6
apa: Chan, S., & Milovic, D. (2021). Kuroda’s formula and arithmetic statistics.
Mathematische Zeitschrift. Springer Nature. https://doi.org/10.1007/s00209-021-02823-6
chicago: Chan, Stephanie, and Djordjo Milovic. “Kuroda’s Formula and Arithmetic
Statistics.” Mathematische Zeitschrift. Springer Nature, 2021. https://doi.org/10.1007/s00209-021-02823-6.
ieee: S. Chan and D. Milovic, “Kuroda’s formula and arithmetic statistics,” Mathematische
Zeitschrift, vol. 300, no. 2. Springer Nature, pp. 1509–1527, 2021.
ista: Chan S, Milovic D. 2021. Kuroda’s formula and arithmetic statistics. Mathematische
Zeitschrift. 300(2), 1509–1527.
mla: Chan, Stephanie, and Djordjo Milovic. “Kuroda’s Formula and Arithmetic Statistics.”
Mathematische Zeitschrift, vol. 300, no. 2, Springer Nature, 2021, pp.
1509–27, doi:10.1007/s00209-021-02823-6.
short: S. Chan, D. Milovic, Mathematische Zeitschrift 300 (2021) 1509–1527.
date_created: 2025-04-05T10:51:04Z
date_published: 2021-08-17T00:00:00Z
date_updated: 2025-07-10T11:51:48Z
day: '17'
doi: 10.1007/s00209-021-02823-6
extern: '1'
external_id:
arxiv:
- '1905.09745'
intvolume: ' 300'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1905.09745
month: '08'
oa: 1
oa_version: Preprint
page: 1509-1527
publication: Mathematische Zeitschrift
publication_identifier:
eissn:
- 1432-1823
issn:
- 0025-5874
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Kuroda’s formula and arithmetic statistics
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 300
year: '2021'
...
---
OA_place: repository
OA_type: green
_id: '20619'
abstract:
- lang: eng
text: The first author’s previous work established Solomon’s WDVV-type relations
for Welschinger’s invariant curve counts in real symplectic fourfolds by lifting
geometric relations over possibly unorientable morphisms. We apply her framework
to obtain WDVV-style relations for the disk invariants of real symplectic sixfolds
with some symmetry, in particular confirming Alcolado’s prediction for P^3 and
extending it to other spaces. These relations reduce the computation of Welschinger’s
invariants of many real symplectic sixfolds to invariants in small degrees and
provide lower bounds for counts of real rational curves with positive-dimensional
insertions in some cases. In the case of P^3, our lower bounds fit perfectly with
Kollár’s vanishing results.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Xujia
full_name: Chen, Xujia
id: 968ad14a-fd86-11ee-a420-ea29715511a3
last_name: Chen
- first_name: Aleksey
full_name: Zinger, Aleksey
last_name: Zinger
citation:
ama: Chen X, Zinger A. WDVV-type relations for disk Gromov–Witten invariants in
dimension 6. Mathematische Annalen. 2021;379(3-4):1231-1313. doi:10.1007/s00208-020-02130-1
apa: Chen, X., & Zinger, A. (2021). WDVV-type relations for disk Gromov–Witten
invariants in dimension 6. Mathematische Annalen. Springer Nature. https://doi.org/10.1007/s00208-020-02130-1
chicago: Chen, Xujia, and Aleksey Zinger. “WDVV-Type Relations for Disk Gromov–Witten
Invariants in Dimension 6.” Mathematische Annalen. Springer Nature, 2021.
https://doi.org/10.1007/s00208-020-02130-1.
ieee: X. Chen and A. Zinger, “WDVV-type relations for disk Gromov–Witten invariants
in dimension 6,” Mathematische Annalen, vol. 379, no. 3–4. Springer Nature,
pp. 1231–1313, 2021.
ista: Chen X, Zinger A. 2021. WDVV-type relations for disk Gromov–Witten invariants
in dimension 6. Mathematische Annalen. 379(3–4), 1231–1313.
mla: Chen, Xujia, and Aleksey Zinger. “WDVV-Type Relations for Disk Gromov–Witten
Invariants in Dimension 6.” Mathematische Annalen, vol. 379, no. 3–4, Springer
Nature, 2021, pp. 1231–313, doi:10.1007/s00208-020-02130-1.
short: X. Chen, A. Zinger, Mathematische Annalen 379 (2021) 1231–1313.
date_created: 2025-11-10T08:41:40Z
date_published: 2021-01-25T00:00:00Z
date_updated: 2025-11-10T15:11:29Z
day: '25'
doi: 10.1007/s00208-020-02130-1
extern: '1'
external_id:
arxiv:
- '1904.04254'
intvolume: ' 379'
issue: 3-4
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1904.04254
month: '01'
oa: 1
oa_version: Preprint
page: 1231-1313
publication: Mathematische Annalen
publication_identifier:
eissn:
- 1432-1807
issn:
- 0025-5831
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: WDVV-type relations for disk Gromov–Witten invariants in dimension 6
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 379
year: '2021'
...
---
_id: '10002'
abstract:
- lang: eng
text: 'We present a faster symbolic algorithm for the following central problem
in probabilistic verification: Compute the maximal end-component (MEC) decomposition
of Markov decision processes (MDPs). This problem generalizes the SCC decomposition
problem of graphs and closed recurrent sets of Markov chains. The model of symbolic
algorithms is widely used in formal verification and model-checking, where access
to the input model is restricted to only symbolic operations (e.g., basic set
operations and computation of one-step neighborhood). For an input MDP with n vertices
and m edges, the classical symbolic algorithm from the 1990s for the MEC decomposition
requires O(n2) symbolic operations and O(1) symbolic space. The only other
symbolic algorithm for the MEC decomposition requires O(nm−−√) symbolic operations
and O(m−−√) symbolic space. A main open question is whether the worst-case O(n2) bound
for symbolic operations can be beaten. We present a symbolic algorithm that requires O˜(n1.5) symbolic
operations and O˜(n−−√) symbolic space. Moreover, the parametrization of our
algorithm provides a trade-off between symbolic operations and symbolic space:
for all 0<ϵ≤1/2 the symbolic algorithm requires O˜(n2−ϵ) symbolic operations
and O˜(nϵ) symbolic space ( O˜ hides poly-logarithmic factors). Using our techniques
we present faster algorithms for computing the almost-sure winning regions of ω
-regular objectives for MDPs. We consider the canonical parity objectives for ω
-regular objectives, and for parity objectives with d -priorities we present
an algorithm that computes the almost-sure winning region with O˜(n2−ϵ) symbolic
operations and O˜(nϵ) symbolic space, for all 0<ϵ≤1/2 .'
acknowledgement: The authors are grateful to the anonymous referees for their valuable
comments. A. S. is fully supported by the Vienna Science and Technology Fund (WWTF)
through project ICT15–003. K. C. is supported by the Austrian Science Fund (FWF)
NFN Grant No S11407-N23 (RiSE/SHiNE) and by the ERC CoG 863818 (ForM-SMArt). For
M. H. the research leading to these results has received funding from the European
Research Council under the European Unions Seventh Framework Programme (FP/2007–2013)
/ ERC Grant Agreement no. 340506.
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Wolfgang
full_name: Dvorak, Wolfgang
last_name: Dvorak
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Alexander
full_name: Svozil, Alexander
last_name: Svozil
citation:
ama: 'Chatterjee K, Dvorak W, Henzinger M, Svozil A. Symbolic time and space tradeoffs
for probabilistic verification. In: Proceedings of the 36th Annual ACM/IEEE
Symposium on Logic in Computer Science. Institute of Electrical and Electronics
Engineers; 2021:1-13. doi:10.1109/LICS52264.2021.9470739'
apa: 'Chatterjee, K., Dvorak, W., Henzinger, M., & Svozil, A. (2021). Symbolic
time and space tradeoffs for probabilistic verification. In Proceedings of
the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13).
Rome, Italy: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/LICS52264.2021.9470739'
chicago: Chatterjee, Krishnendu, Wolfgang Dvorak, Monika Henzinger, and Alexander
Svozil. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” In
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science,
1–13. Institute of Electrical and Electronics Engineers, 2021. https://doi.org/10.1109/LICS52264.2021.9470739.
ieee: K. Chatterjee, W. Dvorak, M. Henzinger, and A. Svozil, “Symbolic time and
space tradeoffs for probabilistic verification,” in Proceedings of the 36th
Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021,
pp. 1–13.
ista: 'Chatterjee K, Dvorak W, Henzinger M, Svozil A. 2021. Symbolic time and space
tradeoffs for probabilistic verification. Proceedings of the 36th Annual ACM/IEEE
Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 1–13.'
mla: Chatterjee, Krishnendu, et al. “Symbolic Time and Space Tradeoffs for Probabilistic
Verification.” Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in
Computer Science, Institute of Electrical and Electronics Engineers, 2021,
pp. 1–13, doi:10.1109/LICS52264.2021.9470739.
short: K. Chatterjee, W. Dvorak, M. Henzinger, A. Svozil, in:, Proceedings of the
36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical
and Electronics Engineers, 2021, pp. 1–13.
conference:
end_date: 2021-07-02
location: Rome, Italy
name: 'LICS: Logic in Computer Science'
start_date: 2021-06-29
date_created: 2021-09-12T22:01:24Z
date_published: 2021-07-07T00:00:00Z
date_updated: 2025-07-10T11:15:45Z
day: '07'
department:
- _id: KrCh
doi: 10.1109/LICS52264.2021.9470739
ec_funded: 1
external_id:
arxiv:
- '2104.07466'
isi:
- '000947350400089'
isi: 1
keyword:
- Computer science
- Computational modeling
- Markov processes
- Probabilistic logic
- Formal verification
- Game Theory
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2104.07466
month: '07'
oa: 1
oa_version: Preprint
page: 1-13
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer
Science
publication_identifier:
eisbn:
- 978-1-6654-4895-6
isbn:
- 978-1-6654-4896-3
issn:
- 1043-6871
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Symbolic time and space tradeoffs for probabilistic verification
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10004'
abstract:
- lang: eng
text: 'Markov chains are the de facto finite-state model for stochastic dynamical
systems, and Markov decision processes (MDPs) extend Markov chains by incorporating
non-deterministic behaviors. Given an MDP and rewards on states, a classical optimization
criterion is the maximal expected total reward where the MDP stops after T steps,
which can be computed by a simple dynamic programming algorithm. We consider a
natural generalization of the problem where the stopping times can be chosen according
to a probability distribution, such that the expected stopping time is T, to optimize
the expected total reward. Quite surprisingly we establish inter-reducibility
of the expected stopping-time problem for Markov chains with the Positivity problem
(which is related to the well-known Skolem problem), for which establishing either
decidability or undecidability would be a major breakthrough. Given the hardness
of the exact problem, we consider the approximate version of the problem: we show
that it can be solved in exponential time for Markov chains and in exponential
space for MDPs.'
acknowledgement: We are grateful to the anonymous reviewers of LICS 2021 and of a
previous version of this paper for insightful comments that helped improving the
presentation. This research was partially supported by the grant ERC CoG 863818
(ForM-SMArt).
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Stochastic processes with expected stopping time. In:
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science.
Institute of Electrical and Electronics Engineers; 2021:1-13. doi:10.1109/LICS52264.2021.9470595'
apa: 'Chatterjee, K., & Doyen, L. (2021). Stochastic processes with expected
stopping time. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic
in Computer Science (pp. 1–13). Rome, Italy: Institute of Electrical and Electronics
Engineers. https://doi.org/10.1109/LICS52264.2021.9470595'
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected
Stopping Time.” In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic
in Computer Science, 1–13. Institute of Electrical and Electronics Engineers,
2021. https://doi.org/10.1109/LICS52264.2021.9470595.
ieee: K. Chatterjee and L. Doyen, “Stochastic processes with expected stopping time,”
in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science,
Rome, Italy, 2021, pp. 1–13.
ista: 'Chatterjee K, Doyen L. 2021. Stochastic processes with expected stopping
time. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science.
LICS: Logic in Computer Science, 1–13.'
mla: Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected
Stopping Time.” Proceedings of the 36th Annual ACM/IEEE Symposium on Logic
in Computer Science, Institute of Electrical and Electronics Engineers, 2021,
pp. 1–13, doi:10.1109/LICS52264.2021.9470595.
short: K. Chatterjee, L. Doyen, in:, Proceedings of the 36th Annual ACM/IEEE Symposium
on Logic in Computer Science, Institute of Electrical and Electronics Engineers,
2021, pp. 1–13.
conference:
end_date: 2021-07-02
location: Rome, Italy
name: 'LICS: Logic in Computer Science'
start_date: 2021-06-29
date_created: 2021-09-12T22:01:25Z
date_published: 2021-07-07T00:00:00Z
date_updated: 2025-09-08T14:54:13Z
day: '07'
department:
- _id: KrCh
doi: 10.1109/LICS52264.2021.9470595
ec_funded: 1
external_id:
arxiv:
- '2104.07278'
isi:
- '000947350400036'
isi: 1
keyword:
- Computer science
- Heuristic algorithms
- Memory management
- Automata
- Markov processes
- Probability distribution
- Complexity theory
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2104.07278
month: '07'
oa: 1
oa_version: Preprint
page: 1-13
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer
Science
publication_identifier:
eisbn:
- 978-1-6654-4895-6
isbn:
- 978-1-6654-4896-3
issn:
- 1043-6871
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
related_material:
record:
- id: '18630'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Stochastic processes with expected stopping time
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10223'
abstract:
- lang: eng
text: Growth regulation tailors development in plants to their environment. A prominent
example of this is the response to gravity, in which shoots bend up and roots
bend down1. This paradox is based on opposite effects of the phytohormone auxin,
which promotes cell expansion in shoots while inhibiting it in roots via a yet
unknown cellular mechanism2. Here, by combining microfluidics, live imaging, genetic
engineering and phosphoproteomics in Arabidopsis thaliana, we advance understanding
of how auxin inhibits root growth. We show that auxin activates two distinct,
antagonistically acting signalling pathways that converge on rapid regulation
of apoplastic pH, a causative determinant of growth. Cell surface-based TRANSMEMBRANE
KINASE1 (TMK1) interacts with and mediates phosphorylation and activation of plasma
membrane H+-ATPases for apoplast acidification, while intracellular canonical
auxin signalling promotes net cellular H+ influx, causing apoplast alkalinization.
Simultaneous activation of these two counteracting mechanisms poises roots for
rapid, fine-tuned growth modulation in navigating complex soil environments.
acknowledged_ssus:
- _id: LifeSc
- _id: M-Shop
- _id: Bio
acknowledgement: We thank N. Gnyliukh and L. Hörmayer for technical assistance and
N. Paris for sharing PM-Cyto seeds. We gratefully acknowledge the Life Science,
Machine Shop and Bioimaging Facilities of IST Austria. This project has received
funding from the European Research Council Advanced Grant (ETAP-742985) and the
Austrian Science Fund (FWF) under I 3630-B25 to J.F., the National Institutes of
Health (GM067203) to W.M.G., the Netherlands Organization for Scientific Research
(NWO; VIDI-864.13.001), Research Foundation-Flanders (FWO; Odysseus II G0D0515N)
and a European Research Council Starting Grant (TORPEDO-714055) to W.S. and B.D.R.,
the VICI grant (865.14.001) from the Netherlands Organization for Scientific Research
to M.R. and D.W., the Australian Research Council and China National Distinguished
Expert Project (WQ20174400441) to S.S., the MEXT/JSPS KAKENHI to K.T. (20K06685)
and T.K. (20H05687 and 20H05910), the European Union’s Horizon 2020 research and
innovation programme under Marie Skłodowska-Curie grant agreement no. 665385 and
the DOC Fellowship of the Austrian Academy of Sciences to L.L., and the China Scholarship
Council to J.C.
article_processing_charge: No
article_type: original
author:
- first_name: Lanxin
full_name: Li, Lanxin
id: 367EF8FA-F248-11E8-B48F-1D18A9856A87
last_name: Li
orcid: 0000-0002-5607-272X
- first_name: Inge
full_name: Verstraeten, Inge
id: 362BF7FE-F248-11E8-B48F-1D18A9856A87
last_name: Verstraeten
orcid: 0000-0001-7241-2328
- first_name: Mark
full_name: Roosjen, Mark
last_name: Roosjen
- first_name: Koji
full_name: Takahashi, Koji
last_name: Takahashi
- first_name: Lesia
full_name: Rodriguez Solovey, Lesia
id: 3922B506-F248-11E8-B48F-1D18A9856A87
last_name: Rodriguez Solovey
orcid: 0000-0002-7244-7237
- first_name: Jack
full_name: Merrin, Jack
id: 4515C308-F248-11E8-B48F-1D18A9856A87
last_name: Merrin
orcid: 0000-0001-5145-4609
- first_name: Jian
full_name: Chen, Jian
last_name: Chen
- first_name: Lana
full_name: Shabala, Lana
last_name: Shabala
- first_name: Wouter
full_name: Smet, Wouter
last_name: Smet
- first_name: Hong
full_name: Ren, Hong
last_name: Ren
- first_name: Steffen
full_name: Vanneste, Steffen
last_name: Vanneste
- first_name: Sergey
full_name: Shabala, Sergey
last_name: Shabala
- first_name: Bert
full_name: De Rybel, Bert
last_name: De Rybel
- first_name: Dolf
full_name: Weijers, Dolf
last_name: Weijers
- first_name: Toshinori
full_name: Kinoshita, Toshinori
last_name: Kinoshita
- first_name: William M.
full_name: Gray, William M.
last_name: Gray
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Li L, Verstraeten I, Roosjen M, et al. Cell surface and intracellular auxin
signalling for H+ fluxes in root growth. Nature. 2021;599(7884):273-277.
doi:10.1038/s41586-021-04037-6
apa: Li, L., Verstraeten, I., Roosjen, M., Takahashi, K., Rodriguez Solovey, L.,
Merrin, J., … Friml, J. (2021). Cell surface and intracellular auxin signalling
for H+ fluxes in root growth. Nature. Springer Nature. https://doi.org/10.1038/s41586-021-04037-6
chicago: Li, Lanxin, Inge Verstraeten, Mark Roosjen, Koji Takahashi, Lesia Rodriguez
Solovey, Jack Merrin, Jian Chen, et al. “Cell Surface and Intracellular Auxin
Signalling for H+ Fluxes in Root Growth.” Nature. Springer Nature,
2021. https://doi.org/10.1038/s41586-021-04037-6.
ieee: L. Li et al., “Cell surface and intracellular auxin signalling for
H+ fluxes in root growth,” Nature, vol. 599, no. 7884. Springer
Nature, pp. 273–277, 2021.
ista: Li L, Verstraeten I, Roosjen M, Takahashi K, Rodriguez Solovey L, Merrin J,
Chen J, Shabala L, Smet W, Ren H, Vanneste S, Shabala S, De Rybel B, Weijers D,
Kinoshita T, Gray WM, Friml J. 2021. Cell surface and intracellular auxin signalling
for H+ fluxes in root growth. Nature. 599(7884), 273–277.
mla: Li, Lanxin, et al. “Cell Surface and Intracellular Auxin Signalling for H+
Fluxes in Root Growth.” Nature, vol. 599, no. 7884, Springer Nature, 2021,
pp. 273–77, doi:10.1038/s41586-021-04037-6.
short: L. Li, I. Verstraeten, M. Roosjen, K. Takahashi, L. Rodriguez Solovey, J.
Merrin, J. Chen, L. Shabala, W. Smet, H. Ren, S. Vanneste, S. Shabala, B. De Rybel,
D. Weijers, T. Kinoshita, W.M. Gray, J. Friml, Nature 599 (2021) 273–277.
corr_author: '1'
date_created: 2021-11-07T23:01:25Z
date_published: 2021-11-11T00:00:00Z
date_updated: 2025-07-10T11:49:46Z
day: '11'
department:
- _id: JiFr
- _id: NanoFab
doi: 10.1038/s41586-021-04037-6
ec_funded: 1
external_id:
isi:
- '000713338100006'
pmid:
- '34707283'
intvolume: ' 599'
isi: 1
issue: '7884'
keyword:
- Multidisciplinary
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.doi.org/10.21203/rs.3.rs-266395/v3
month: '11'
oa: 1
oa_version: Preprint
page: 273-277
pmid: 1
project:
- _id: 261099A6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '742985'
name: Tracing Evolution of Auxin Transport and Polarity in Plants
- _id: 26538374-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I03630
name: Molecular mechanisms of endocytic cargo recognition in plants
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 26B4D67E-B435-11E9-9278-68D0E5697425
grant_number: '25351'
name: 'A Case Study of Plant Growth Regulation: Molecular Mechanism of Auxin-mediated
Rapid Growth Inhibition in Arabidopsis Root'
publication: Nature
publication_identifier:
eissn:
- 1476-4687
issn:
- 0028-0836
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- description: News on IST Webpage
relation: press_release
url: https://ist.ac.at/en/news/stop-and-grow/
record:
- id: '10095'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Cell surface and intracellular auxin signalling for H+ fluxes in
root growth
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 599
year: '2021'
...
---
_id: '10280'
abstract:
- lang: eng
text: 'Machines enabled the Industrial Revolution and are central to modern technological
progress: A machine’s parts transmit forces, motion, and energy to one another
in a predetermined manner. Today’s engineering frontier, building artificial micromachines
that emulate the biological machinery of living organisms, requires faithful assembly
and energy consumption at the microscale. Here, we demonstrate the programmable
assembly of active particles into autonomous metamachines using optical templates.
Metamachines, or machines made of machines, are stable, mobile and autonomous
architectures, whose dynamics stems from the geometry. We use the interplay between
anisotropic force generation of the active colloids with the control of their
orientation by local geometry. This allows autonomous reprogramming of active
particles of the metamachines to achieve multiple functions. It permits the modular
assembly of metamachines by fusion, reconfiguration of metamachines and, we anticipate,
a shift in focus of self-assembly towards active matter and reprogrammable materials.'
acknowledgement: The authors thank R. Jazzar for useful advice regarding the synthesis
of heterodimers. We thank S. Sacanna for critical reading. This material is based
upon work supported by the National Science Foundation under Grant No. DMR-1554724
and Department of Army Research under grant W911NF-20-1-0112.
article_number: '6398'
article_processing_charge: Yes
article_type: original
author:
- first_name: Antoine
full_name: Aubret, Antoine
last_name: Aubret
- first_name: Quentin
full_name: Martinet, Quentin
id: b37485a8-d343-11eb-a0e9-df8c484ef8ab
last_name: Martinet
orcid: 0000-0002-2916-6632
- first_name: Jérémie A
full_name: Palacci, Jérémie A
id: 8fb92548-2b22-11eb-b7c1-a3f0d08d7c7d
last_name: Palacci
orcid: 0000-0002-7253-9465
citation:
ama: Aubret A, Martinet Q, Palacci JA. Metamachines of pluripotent colloids. Nature
Communications. 2021;12(1). doi:10.1038/s41467-021-26699-6
apa: Aubret, A., Martinet, Q., & Palacci, J. A. (2021). Metamachines of pluripotent
colloids. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-021-26699-6
chicago: Aubret, Antoine, Quentin Martinet, and Jérémie A Palacci. “Metamachines
of Pluripotent Colloids.” Nature Communications. Springer Nature, 2021.
https://doi.org/10.1038/s41467-021-26699-6.
ieee: A. Aubret, Q. Martinet, and J. A. Palacci, “Metamachines of pluripotent colloids,”
Nature Communications, vol. 12, no. 1. Springer Nature, 2021.
ista: Aubret A, Martinet Q, Palacci JA. 2021. Metamachines of pluripotent colloids.
Nature Communications. 12(1), 6398.
mla: Aubret, Antoine, et al. “Metamachines of Pluripotent Colloids.” Nature Communications,
vol. 12, no. 1, 6398, Springer Nature, 2021, doi:10.1038/s41467-021-26699-6.
short: A. Aubret, Q. Martinet, J.A. Palacci, Nature Communications 12 (2021).
date_created: 2021-11-14T23:01:23Z
date_published: 2021-11-04T00:00:00Z
date_updated: 2023-08-14T11:48:37Z
day: '04'
ddc:
- '530'
department:
- _id: JePa
doi: 10.1038/s41467-021-26699-6
external_id:
isi:
- '000714754400010'
pmid:
- '34737315'
file:
- access_level: open_access
checksum: 1c392b12b9b7b615d422d9fabe19cdb9
content_type: application/pdf
creator: cchlebak
date_created: 2021-11-15T13:25:52Z
date_updated: 2021-11-15T13:25:52Z
file_id: '10292'
file_name: 2021_NatComm_Aubret.pdf
file_size: 6282703
relation: main_file
success: 1
file_date_updated: 2021-11-15T13:25:52Z
has_accepted_license: '1'
intvolume: ' 12'
isi: 1
issue: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
pmid: 1
publication: Nature Communications
publication_identifier:
eissn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Metamachines of pluripotent colloids
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: 12
year: '2021'
...