---
_id: '13049'
abstract:
- lang: eng
text: "We propose a computational design approach for covering a surface with individually
addressable RGB LEDs, effectively forming a low-resolution surface screen. To
achieve a low-cost and scalable approach, we propose creating designs from flat
PCB panels bent in-place along the surface of a 3D printed core. Working with
standard rigid PCBs enables the use of\r\nestablished PCB manufacturing services,
allowing the fabrication of designs with several hundred LEDs. \r\nOur approach
optimizes the PCB geometry for folding, and then jointly optimizes the LED packing,
circuit and routing, solving a challenging layout problem under strict manufacturing
requirements. Unlike paper, PCBs cannot bend beyond a certain point without breaking.
Therefore, we introduce parametric cut patterns acting as hinges, designed to
allow bending while remaining compact. To tackle the joint optimization of placement,
circuit and routing, we propose a specialized algorithm that splits the global
problem into one sub-problem per triangle, which is then individually solved.\r\nOur
technique generates PCB blueprints in a completely automated way. After being
fabricated by a PCB manufacturing service, the boards are bent and glued by the
user onto the 3D printed support. We demonstrate our technique on a range of physical
models and virtual examples, creating intricate surface light patterns from hundreds
of LEDs."
acknowledged_ssus:
- _id: M-Shop
acknowledgement: We thank the reviewers for the valuable feedback. We also thank the
Miba Machine Shop at ISTA, PCBWay, and PragoBoard for helping us with fabrication
and assembly. This project was supported by the European Research Council (ERC)
under the European Union’s Horizon 2020 research and innovation program (Grant Agreement
No. 715767 – MATERIALIZABLE).
article_number: '142'
article_processing_charge: No
article_type: original
author:
- first_name: Marco
full_name: Freire, Marco
last_name: Freire
- first_name: Manas
full_name: Bhargava, Manas
id: FF8FA64C-AA6A-11E9-99AD-50D4E5697425
last_name: Bhargava
orcid: 0009-0007-6138-6890
- first_name: Camille
full_name: Schreck, Camille
id: 2B14B676-F248-11E8-B48F-1D18A9856A87
last_name: Schreck
- first_name: Pierre-Alexandre
full_name: Hugron, Pierre-Alexandre
last_name: Hugron
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Sylvain
full_name: Lefebvre, Sylvain
last_name: Lefebvre
citation:
ama: 'Freire M, Bhargava M, Schreck C, Hugron P-A, Bickel B, Lefebvre S. PCBend:
Light up your 3D shapes with foldable circuit boards. Transactions on Graphics.
2023;42(4). doi:10.1145/3592411'
apa: 'Freire, M., Bhargava, M., Schreck, C., Hugron, P.-A., Bickel, B., & Lefebvre,
S. (2023). PCBend: Light up your 3D shapes with foldable circuit boards. Transactions
on Graphics. Los Angeles, CA, United States: Association for Computing Machinery.
https://doi.org/10.1145/3592411'
chicago: 'Freire, Marco, Manas Bhargava, Camille Schreck, Pierre-Alexandre Hugron,
Bernd Bickel, and Sylvain Lefebvre. “PCBend: Light up Your 3D Shapes with Foldable
Circuit Boards.” Transactions on Graphics. Association for Computing Machinery,
2023. https://doi.org/10.1145/3592411.'
ieee: 'M. Freire, M. Bhargava, C. Schreck, P.-A. Hugron, B. Bickel, and S. Lefebvre,
“PCBend: Light up your 3D shapes with foldable circuit boards,” Transactions
on Graphics, vol. 42, no. 4. Association for Computing Machinery, 2023.'
ista: 'Freire M, Bhargava M, Schreck C, Hugron P-A, Bickel B, Lefebvre S. 2023.
PCBend: Light up your 3D shapes with foldable circuit boards. Transactions on
Graphics. 42(4), 142.'
mla: 'Freire, Marco, et al. “PCBend: Light up Your 3D Shapes with Foldable Circuit
Boards.” Transactions on Graphics, vol. 42, no. 4, 142, Association for
Computing Machinery, 2023, doi:10.1145/3592411.'
short: M. Freire, M. Bhargava, C. Schreck, P.-A. Hugron, B. Bickel, S. Lefebvre,
Transactions on Graphics 42 (2023).
conference:
end_date: 2023-08-10
location: Los Angeles, CA, United States
name: 'SIGGRAPH: Computer Graphics and Interactive Techniques Conference'
start_date: 2023-08-06
date_created: 2023-05-22T08:37:04Z
date_published: 2023-07-26T00:00:00Z
date_updated: 2024-01-29T10:30:49Z
day: '26'
ddc:
- '006'
department:
- _id: GradSch
- _id: BeBi
doi: 10.1145/3592411
ec_funded: 1
external_id:
isi:
- '001044671300108'
file:
- access_level: open_access
checksum: a0b0ba3b36f43a94388e8824613d812a
content_type: application/pdf
creator: dernst
date_created: 2023-06-19T11:02:23Z
date_updated: 2023-06-19T11:02:23Z
file_id: '13156'
file_name: 2023_ACMToG_Freire.pdf
file_size: 78940724
relation: main_file
success: 1
- access_level: open_access
checksum: b9206bbb67af82df49b7e7cdbde3410c
content_type: application/pdf
creator: dernst
date_created: 2023-06-20T12:20:51Z
date_updated: 2023-06-20T12:20:51Z
file_id: '13157'
file_name: 2023_ACMToG_SuppMaterial_Freire.pdf
file_size: 34345905
relation: main_file
success: 1
file_date_updated: 2023-06-20T12:20:51Z
has_accepted_license: '1'
intvolume: ' 42'
isi: 1
issue: '4'
keyword:
- PCB design and layout
- Mesh geometry models
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715767'
name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
Modeling'
publication: Transactions on Graphics
publication_identifier:
eissn:
- 1557-7368
issn:
- 0730-0301
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
status: public
title: 'PCBend: Light up your 3D shapes with foldable circuit boards'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 42
year: '2023'
...
---
_id: '13053'
abstract:
- lang: eng
text: 'Deep neural networks (DNNs) often have to be compressed, via pruning and/or
quantization, before they can be deployed in practical settings. In this work
we propose a new compression-aware minimizer dubbed CrAM that modifies the optimization
step in a principled way, in order to produce models whose local loss behavior
is stable under compression operations such as pruning. Thus, dense models trained
via CrAM should be compressible post-training, in a single step, without significant
accuracy loss. Experimental results on standard benchmarks, such as residual networks
for ImageNet classification and BERT models for language modelling, show that
CrAM produces dense models that can be more accurate than the standard SGD/Adam-based
baselines, but which are stable under weight pruning: specifically, we can prune
models in one-shot to 70-80% sparsity with almost no accuracy loss, and to 90%
with reasonable (∼1%) accuracy loss, which is competitive with gradual compression
methods. Additionally, CrAM can produce sparse models which perform well for transfer
learning, and it also works for semi-structured 2:4 pruning patterns supported
by GPU hardware. The code for reproducing the results is available at this https
URL .'
acknowledged_ssus:
- _id: ScienComp
acknowledgement: "AP, EK, DA received funding from the European Research Council (ERC)
under the European\r\nUnion’s Horizon 2020 research and innovation programme (grant
agreement No 805223 ScaleML). AV acknowledges the support of the French Agence Nationale
de la Recherche (ANR), under grant ANR-21-CE48-0016 (project COMCOPT). We further
acknowledge the support from the Scientific Service Units (SSU) of ISTA through
resources provided by Scientific Computing (SciComp)-"
article_processing_charge: No
arxiv: 1
author:
- first_name: Elena-Alexandra
full_name: Peste, Elena-Alexandra
id: 32D78294-F248-11E8-B48F-1D18A9856A87
last_name: Peste
- first_name: Adrian
full_name: Vladu, Adrian
last_name: Vladu
- first_name: Eldar
full_name: Kurtic, Eldar
id: 47beb3a5-07b5-11eb-9b87-b108ec578218
last_name: Kurtic
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Peste E-A, Vladu A, Kurtic E, Lampert C, Alistarh D-A. CrAM: A Compression-Aware
Minimizer. In: 11th International Conference on Learning Representations .'
apa: 'Peste, E.-A., Vladu, A., Kurtic, E., Lampert, C., & Alistarh, D.-A. (n.d.).
CrAM: A Compression-Aware Minimizer. In 11th International Conference on Learning
Representations . Kigali, Rwanda .'
chicago: 'Peste, Elena-Alexandra, Adrian Vladu, Eldar Kurtic, Christoph Lampert,
and Dan-Adrian Alistarh. “CrAM: A Compression-Aware Minimizer.” In 11th International
Conference on Learning Representations , n.d.'
ieee: 'E.-A. Peste, A. Vladu, E. Kurtic, C. Lampert, and D.-A. Alistarh, “CrAM:
A Compression-Aware Minimizer,” in 11th International Conference on Learning
Representations , Kigali, Rwanda .'
ista: 'Peste E-A, Vladu A, Kurtic E, Lampert C, Alistarh D-A. CrAM: A Compression-Aware
Minimizer. 11th International Conference on Learning Representations . ICLR: International
Conference on Learning Representations.'
mla: 'Peste, Elena-Alexandra, et al. “CrAM: A Compression-Aware Minimizer.” 11th
International Conference on Learning Representations .'
short: E.-A. Peste, A. Vladu, E. Kurtic, C. Lampert, D.-A. Alistarh, in:, 11th International
Conference on Learning Representations , n.d.
conference:
end_date: 2023-05-05
location: 'Kigali, Rwanda '
name: 'ICLR: International Conference on Learning Representations'
start_date: 2023-05-01
date_created: 2023-05-23T11:36:18Z
date_published: 2023-05-01T00:00:00Z
date_updated: 2023-06-01T12:54:45Z
department:
- _id: GradSch
- _id: DaAl
- _id: ChLa
ec_funded: 1
external_id:
arxiv:
- '2207.14200'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://openreview.net/pdf?id=_eTZBs-yedr
month: '05'
oa: 1
oa_version: Preprint
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: '11th International Conference on Learning Representations '
publication_status: accepted
quality_controlled: '1'
related_material:
record:
- id: '13074'
relation: dissertation_contains
status: public
status: public
title: 'CrAM: A Compression-Aware Minimizer'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '13074'
abstract:
- lang: eng
text: "Deep learning has become an integral part of a large number of important
applications, and many of the recent breakthroughs have been enabled by the ability
to train very large models, capable to capture complex patterns and relationships
from the data. At the same time, the massive sizes of modern deep learning models
have made their deployment to smaller devices more challenging; this is particularly
important, as in many applications the users rely on accurate deep learning predictions,
but they only have access to devices with limited memory and compute power. One
solution to this problem is to prune neural networks, by setting as many of their
parameters as possible to zero, to obtain accurate sparse models with lower memory
footprint. Despite the great research progress in obtaining sparse models that
preserve accuracy, while satisfying memory and computational constraints, there
are still many challenges associated with efficiently training sparse models,
as well as understanding their generalization properties.\r\n\r\nThe focus of
this thesis is to investigate how the training process of sparse models can be
made more efficient, and to understand the differences between sparse and dense
models in terms of how well they can generalize to changes in the data distribution.
We first study a method for co-training sparse and dense models, at a lower cost
compared to regular training. With our method we can obtain very accurate sparse
networks, and dense models that can recover the baseline accuracy. Furthermore,
we are able to more easily analyze the differences, at prediction level, between
the sparse-dense model pairs. Next, we investigate the generalization properties
of sparse neural networks in more detail, by studying how well different sparse
models trained on a larger task can adapt to smaller, more specialized tasks,
in a transfer learning scenario. Our analysis across multiple pruning methods
and sparsity levels reveals that sparse models provide features that can transfer
similarly to or better than the dense baseline. However, the choice of the pruning
method plays an important role, and can influence the results when the features
are fixed (linear finetuning), or when they are allowed to adapt to the new task
(full finetuning). Using sparse models with fixed masks for finetuning on new
tasks has an important practical advantage, as it enables training neural networks
on smaller devices. However, one drawback of current pruning methods is that the
entire training cycle has to be repeated to obtain the initial sparse model, for
every sparsity target; in consequence, the entire training process is costly and
also multiple models need to be stored. In the last part of the thesis we propose
a method that can train accurate dense models that are compressible in a single
step, to multiple sparsity levels, without additional finetuning. Our method results
in sparse models that can be competitive with existing pruning methods, and which
can also successfully generalize to new tasks."
acknowledged_ssus:
- _id: ScienComp
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Elena-Alexandra
full_name: Peste, Elena-Alexandra
id: 32D78294-F248-11E8-B48F-1D18A9856A87
last_name: Peste
citation:
ama: Peste E-A. Efficiency and generalization of sparse neural networks. 2023. doi:10.15479/at:ista:13074
apa: Peste, E.-A. (2023). Efficiency and generalization of sparse neural networks.
Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:13074
chicago: Peste, Elena-Alexandra. “Efficiency and Generalization of Sparse Neural
Networks.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:13074.
ieee: E.-A. Peste, “Efficiency and generalization of sparse neural networks,” Institute
of Science and Technology Austria, 2023.
ista: Peste E-A. 2023. Efficiency and generalization of sparse neural networks.
Institute of Science and Technology Austria.
mla: Peste, Elena-Alexandra. Efficiency and Generalization of Sparse Neural Networks.
Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:13074.
short: E.-A. Peste, Efficiency and Generalization of Sparse Neural Networks, Institute
of Science and Technology Austria, 2023.
date_created: 2023-05-23T17:07:53Z
date_published: 2023-05-23T00:00:00Z
date_updated: 2023-08-04T10:33:27Z
day: '23'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: GradSch
- _id: DaAl
- _id: ChLa
doi: 10.15479/at:ista:13074
ec_funded: 1
file:
- access_level: open_access
checksum: 6b3354968403cb9d48cc5a83611fb571
content_type: application/pdf
creator: epeste
date_created: 2023-05-24T16:11:16Z
date_updated: 2023-05-24T16:11:16Z
file_id: '13087'
file_name: PhD_Thesis_Alexandra_Peste_final.pdf
file_size: 2152072
relation: main_file
success: 1
- access_level: closed
checksum: 8d0df94bbcf4db72c991f22503b3fd60
content_type: application/zip
creator: epeste
date_created: 2023-05-24T16:12:59Z
date_updated: 2023-05-24T16:12:59Z
file_id: '13088'
file_name: PhD_Thesis_APeste.zip
file_size: 1658293
relation: source_file
file_date_updated: 2023-05-24T16:12:59Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '147'
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '11458'
relation: part_of_dissertation
status: public
- id: '13053'
relation: part_of_dissertation
status: public
- id: '12299'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
title: Efficiency and generalization of sparse neural networks
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2023'
...
---
_id: '13081'
abstract:
- lang: eng
text: During development, tissues undergo changes in size and shape to form functional
organs. Distinct cellular processes such as cell division and cell rearrangements
underlie tissue morphogenesis. Yet how the distinct processes are controlled and
coordinated, and how they contribute to morphogenesis is poorly understood. In
our study, we addressed these questions using the developing mouse neural tube.
This epithelial organ transforms from a flat epithelial sheet to an epithelial
tube while increasing in size and undergoing morpho-gen-mediated patterning. The
extent and mechanism of neural progenitor rearrangement within the developing
mouse neuroepithelium is unknown. To investigate this, we per-formed high resolution
lineage tracing analysis to quantify the extent of epithelial rear-rangement at
different stages of neural tube development. We quantitatively described the relationship
between apical cell size with cell cycle dependent interkinetic nuclear migra-tions
(IKNM) and performed high cellular resolution live imaging of the neuroepithelium
to study the dynamics of junctional remodeling. Furthermore, developed a vertex
model of the neuroepithelium to investigate the quantitative contribution of cell
proliferation, cell differentiation and mechanical properties to the epithelial
rearrangement dynamics and validated the model predictions through functional
experiments. Our analysis revealed that at early developmental stages, the apical
cell area kinetics driven by IKNM induce high lev-els of cell rearrangements in
a regime of high junctional tension and contractility. After E9.5, there is a
sharp decline in the extent of cell rearrangements, suggesting that the epi-thelium
transitions from a fluid-like to a solid-like state. We found that this transition
is regulated by the growth rate of the tissue, rather than by changes in cell-cell
adhesion and contractile forces. Overall, our study provides a quantitative description
of the relationship between tissue growth, cell cycle dynamics, epithelia rearrangements
and the emergent tissue material properties, and novel insights on how epithelial
cell dynamics influences tissue morphogenesis.
acknowledged_ssus:
- _id: Bio
- _id: LifeSc
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Laura
full_name: Bocanegra, Laura
id: 4896F754-F248-11E8-B48F-1D18A9856A87
last_name: Bocanegra
citation:
ama: Bocanegra L. Epithelial dynamics during mouse neural tube development. 2023.
doi:10.15479/at:ista:13081
apa: Bocanegra, L. (2023). Epithelial dynamics during mouse neural tube development.
Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:13081
chicago: Bocanegra, Laura. “Epithelial Dynamics during Mouse Neural Tube Development.”
Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:13081.
ieee: L. Bocanegra, “Epithelial dynamics during mouse neural tube development,”
Institute of Science and Technology Austria, 2023.
ista: Bocanegra L. 2023. Epithelial dynamics during mouse neural tube development.
Institute of Science and Technology Austria.
mla: Bocanegra, Laura. Epithelial Dynamics during Mouse Neural Tube Development.
Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:13081.
short: L. Bocanegra, Epithelial Dynamics during Mouse Neural Tube Development, Institute
of Science and Technology Austria, 2023.
date_created: 2023-05-23T19:10:42Z
date_published: 2023-05-23T00:00:00Z
date_updated: 2023-10-04T11:14:04Z
day: '23'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: GradSch
- _id: AnKi
doi: 10.15479/at:ista:13081
file:
- access_level: closed
checksum: 74f3f89e59a0189bee53ebfad9c1b9af
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: lbocaneg
date_created: 2023-05-25T06:32:12Z
date_updated: 2023-05-25T06:32:12Z
file_id: '13089'
file_name: Thesis_final_LauraBocanegra.docx
file_size: 25615534
relation: source_file
- access_level: closed
checksum: c6cdef6323eacfb4b7a8af20f32eae97
content_type: application/pdf
creator: lbocaneg
date_created: 2023-05-25T06:32:16Z
date_updated: 2023-05-25T06:32:16Z
embargo: 2024-05-31
embargo_to: open_access
file_id: '13090'
file_name: TotalFinal_Thesis_LauraBocanegraArx.pdf
file_size: 12386046
relation: main_file
file_date_updated: 2023-05-25T06:32:16Z
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '05'
oa_version: Published Version
page: '93'
publication_identifier:
issn:
- 2663 - 337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '9349'
relation: part_of_dissertation
status: public
- id: '12837'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Anna
full_name: Kicheva, Anna
id: 3959A2A0-F248-11E8-B48F-1D18A9856A87
last_name: Kicheva
orcid: 0000-0003-4509-4998
title: Epithelial dynamics during mouse neural tube development
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2023'
...
---
_id: '13107'
abstract:
- lang: eng
text: "Within the human body, the brain exhibits the highest rate of energy consumption
amongst all organs, with the majority of generated ATP being utilized to sustain
neuronal activity. Therefore, the metabolism of the mature cerebral cortex is
geared towards preserving metabolic homeostasis whilst generating significant
amounts of energy. This requires a precise interplay between diverse metabolic
pathways, spanning from a tissue-wide scale to the level of individual neurons.
Disturbances to this delicate metabolic equilibrium, such as those resulting from
maternal malnutrition\r\nor mutations affecting metabolic enzymes, often result
in neuropathological variants of neurodevelopment. For instance, mutations in
SLC7A5, a transporter of metabolically essential large neutral amino acids (LNAAs),
have been associated with autism and microcephaly. However, despite recent progress
in the field, the extent of metabolic restructuring that occurs within the developing
brain and the corresponding alterations in nutrient demands during various critical
periods remain largely unknown. To investigate this, we performed metabolomic
profiling of the murine cerebral cortex to characterize the metabolic state of
the forebrain at different developmental stages. We found that the developing
cortex undergoes substantial metabolic reprogramming, with specific sets of metabolites
displaying stage-specific changes. According to our observations, we determined
a distinct temporal period in postnatal development during which the cortex displays
heightened reliance on LNAAs. Hence, using a conditional knock-out mouse model,
we deleted Slc7a5 in neural cells, allowing us to monitor the impact of a perturbed
neuronal metabolic state across multiple developmental stages of corticogenesis.
We found that manipulating the levels of essential LNAAs in cortical neurons in
vivo affects one particular perinatal developmental period critical for cortical
network refinement. Abnormally low intracellular LNAA levels result in cell-autonomous
alterations in neuronal lipid metabolism, excitability, and survival during this
particular time window. Although most of the effects of Slc7a5 deletion on neuronal
physiology are transient, derailment of these processes during this brief but
crucial window leads to long-term circuit dysfunction in mice. In conclusion,
out data indicate that the cerebral cortex undergoes significant metabolic reorganization
during development. This process involves the intricate integration of multiple
metabolic pathways to ensure optimal neuronal function throughout different developmental
stages. Our findings offer a paradigm for understanding how neurons synchronize
the expression of nutrient-related genes with their activity to allow proper brain
maturation. Further, our results demonstrate that disruptions in these precisely
calibrated metabolic processes during critical periods of brain development may
result in neuropathological outcomes in mice and in humans."
acknowledged_ssus:
- _id: PreCl
- _id: Bio
- _id: EM-Fac
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Lisa
full_name: Knaus, Lisa
id: 3B2ABCF4-F248-11E8-B48F-1D18A9856A87
last_name: Knaus
citation:
ama: 'Knaus L. The metabolism of the developing brain : How large neutral amino
acids modulate perinatal neuronal excitability and survival. 2023. doi:10.15479/at:ista:13107'
apa: 'Knaus, L. (2023). The metabolism of the developing brain : How large neutral
amino acids modulate perinatal neuronal excitability and survival. Institute
of Science and Technology Austria. https://doi.org/10.15479/at:ista:13107'
chicago: 'Knaus, Lisa. “The Metabolism of the Developing Brain : How Large Neutral
Amino Acids Modulate Perinatal Neuronal Excitability and Survival.” Institute
of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:13107.'
ieee: 'L. Knaus, “The metabolism of the developing brain : How large neutral amino
acids modulate perinatal neuronal excitability and survival,” Institute of Science
and Technology Austria, 2023.'
ista: 'Knaus L. 2023. The metabolism of the developing brain : How large neutral
amino acids modulate perinatal neuronal excitability and survival. Institute of
Science and Technology Austria.'
mla: 'Knaus, Lisa. The Metabolism of the Developing Brain : How Large Neutral
Amino Acids Modulate Perinatal Neuronal Excitability and Survival. Institute
of Science and Technology Austria, 2023, doi:10.15479/at:ista:13107.'
short: 'L. Knaus, The Metabolism of the Developing Brain : How Large Neutral Amino
Acids Modulate Perinatal Neuronal Excitability and Survival, Institute of Science
and Technology Austria, 2023.'
date_created: 2023-06-01T09:05:24Z
date_published: 2023-05-31T00:00:00Z
date_updated: 2024-02-07T08:03:33Z
day: '31'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: GradSch
- _id: GaNo
doi: 10.15479/at:ista:13107
ec_funded: 1
file:
- access_level: closed
checksum: 4b69a4ac0bbf4163d59c0b58dcb4f2c3
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: lknaus
date_created: 2023-06-01T13:48:41Z
date_updated: 2023-06-01T13:48:41Z
file_id: '13112'
file_name: Thesis_Lisa Knaus_approved_final.docx
file_size: 12991551
relation: source_file
- access_level: open_access
checksum: 6903d152aa01181d87a696085af31c83
content_type: application/pdf
creator: lknaus
date_created: 2023-06-02T09:47:29Z
date_updated: 2023-06-07T08:41:49Z
file_id: '13114'
file_name: Thesis_Lisa Knaus_approved_final_pdfa2b.pdf
file_size: 9309015
relation: main_file
file_date_updated: 2023-06-07T08:41:49Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '147'
project:
- _id: 25444568-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715508'
name: Probing the Reversibility of Autism Spectrum Disorders by Employing in vivo
and in vitro Models
- _id: 2548AE96-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: W1232-B24
name: Molecular Drug Targets
publication_identifier:
issn:
- 2663 - 337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '12802'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
title: 'The metabolism of the developing brain : How large neutral amino acids modulate
perinatal neuronal excitability and survival'
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2023'
...
---
_id: '13120'
abstract:
- lang: eng
text: 'We formalized general (i.e., type-0) grammars using the Lean 3 proof assistant.
We defined basic notions of rewrite rules and of words derived by a grammar, and
used grammars to show closure of the class of type-0 languages under four operations:
union, reversal, concatenation, and the Kleene star. The literature mostly focuses
on Turing machine arguments, which are possibly more difficult to formalize. For
the Kleene star, we could not follow the literature and came up with our own grammar-based
construction.'
acknowledgement: "Jasmin Blanchette: This research has received funding from the Netherlands
Organization\r\nfor Scientific Research (NWO) under the Vidi program (project No.
016.Vidi.189.037, Lean Forward).\r\n__\r\nWe thank Vladimir Kolmogorov for making
this collaboration possible. We\r\nthank Václav Končický for discussing ideas about
the Kleene star construction. We thank Patrick Johnson, Floris van Doorn, and Damiano
Testa for their small yet very valuable contributions to our code. We thank Eric
Wieser for simplifying one of our proofs. We thank Mark Summerfield for suggesting
textual improvements. We thank the anonymous reviewers for very helpful comments.
Finally, we thank the Lean community for helping us with various technical issues
and answering many questions. "
alternative_title:
- LIPIcs
article_number: '15'
article_processing_charge: No
arxiv: 1
author:
- first_name: Martin
full_name: Dvorak, Martin
id: 40ED02A8-C8B4-11E9-A9C0-453BE6697425
last_name: Dvorak
orcid: 0000-0001-5293-214X
- first_name: Jasmin
full_name: Blanchette, Jasmin
last_name: Blanchette
citation:
ama: 'Dvorak M, Blanchette J. Closure properties of general grammars - formally
verified. In: 14th International Conference on Interactive Theorem Proving.
Vol 268. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.ITP.2023.15'
apa: 'Dvorak, M., & Blanchette, J. (2023). Closure properties of general grammars
- formally verified. In 14th International Conference on Interactive Theorem
Proving (Vol. 268). Bialystok, Poland: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.ITP.2023.15'
chicago: Dvorak, Martin, and Jasmin Blanchette. “Closure Properties of General Grammars
- Formally Verified.” In 14th International Conference on Interactive Theorem
Proving, Vol. 268. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
https://doi.org/10.4230/LIPIcs.ITP.2023.15.
ieee: M. Dvorak and J. Blanchette, “Closure properties of general grammars - formally
verified,” in 14th International Conference on Interactive Theorem Proving,
Bialystok, Poland, 2023, vol. 268.
ista: 'Dvorak M, Blanchette J. 2023. Closure properties of general grammars - formally
verified. 14th International Conference on Interactive Theorem Proving. ITP: International
Conference on Interactive Theorem Proving, LIPIcs, vol. 268, 15.'
mla: Dvorak, Martin, and Jasmin Blanchette. “Closure Properties of General Grammars
- Formally Verified.” 14th International Conference on Interactive Theorem
Proving, vol. 268, 15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2023, doi:10.4230/LIPIcs.ITP.2023.15.
short: M. Dvorak, J. Blanchette, in:, 14th International Conference on Interactive
Theorem Proving, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
conference:
end_date: 2023-08-04
location: Bialystok, Poland
name: 'ITP: International Conference on Interactive Theorem Proving'
start_date: 2023-07-31
date_created: 2023-06-05T07:29:05Z
date_published: 2023-07-27T00:00:00Z
date_updated: 2023-09-25T11:04:29Z
day: '27'
ddc:
- '000'
department:
- _id: GradSch
- _id: VlKo
doi: 10.4230/LIPIcs.ITP.2023.15
external_id:
arxiv:
- '2302.06420'
file:
- access_level: open_access
checksum: 773a0197f05b67feaa6cb1e17ec3642d
content_type: application/pdf
creator: dernst
date_created: 2023-08-07T11:55:43Z
date_updated: 2023-08-07T11:55:43Z
file_id: '13982'
file_name: 2023_LIPIcS_Dvorak.pdf
file_size: 715976
relation: main_file
success: 1
file_date_updated: 2023-08-07T11:55:43Z
has_accepted_license: '1'
intvolume: ' 268'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '07'
oa: 1
oa_version: Published Version
publication: 14th International Conference on Interactive Theorem Proving
publication_identifier:
eissn:
- 1868-8969
isbn:
- '9783959772846'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://github.com/madvorak/grammars/tree/publish
scopus_import: '1'
status: public
title: Closure properties of general grammars - formally verified
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 268
year: '2023'
...
---
_id: '13128'
abstract:
- lang: eng
text: "Given A⊆GL2(Fq), we prove that there exist disjoint subsets B,C⊆A such
that A=B⊔C and their additive and multiplicative energies satisfying max{E+(B),E×(C)}≪|A|3/M(|A|),
where\r\nM(|A|)=min{q4/3/|A|1/3(log|A|)2/3,|A|4/5/q13/5(log|A|)27/10}.\r\n We
also study some related questions on moderate expanders over matrix rings, namely,
for A,B,C⊆GL2(Fq), we have |AB+C|, |(A+B)C|≫q4, whenever |A||B||C|≫q10+1/2.
These improve earlier results due to Karabulut, Koh, Pham, Shen, and Vinh ([2019],
Expanding phenomena over matrix rings, ForumMath., 31, 951–970).\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Ali
full_name: Mohammadi, Ali
last_name: Mohammadi
- first_name: Thang
full_name: Pham, Thang
last_name: Pham
- first_name: Yiting
full_name: Wang, Yiting
id: 1917d194-076e-11ed-97cd-837255f88785
last_name: Wang
orcid: 0000-0002-2856-767X
citation:
ama: Mohammadi A, Pham T, Wang Y. An energy decomposition theorem for matrices and
related questions. Canadian Mathematical Bulletin. 2023;66(4):1280-1295.
doi:10.4153/S000843952300036X
apa: Mohammadi, A., Pham, T., & Wang, Y. (2023). An energy decomposition theorem
for matrices and related questions. Canadian Mathematical Bulletin. Cambridge
University Press. https://doi.org/10.4153/S000843952300036X
chicago: Mohammadi, Ali, Thang Pham, and Yiting Wang. “An Energy Decomposition Theorem
for Matrices and Related Questions.” Canadian Mathematical Bulletin. Cambridge
University Press, 2023. https://doi.org/10.4153/S000843952300036X.
ieee: A. Mohammadi, T. Pham, and Y. Wang, “An energy decomposition theorem for matrices
and related questions,” Canadian Mathematical Bulletin, vol. 66, no. 4.
Cambridge University Press, pp. 1280–1295, 2023.
ista: Mohammadi A, Pham T, Wang Y. 2023. An energy decomposition theorem for matrices
and related questions. Canadian Mathematical Bulletin. 66(4), 1280–1295.
mla: Mohammadi, Ali, et al. “An Energy Decomposition Theorem for Matrices and Related
Questions.” Canadian Mathematical Bulletin, vol. 66, no. 4, Cambridge University
Press, 2023, pp. 1280–95, doi:10.4153/S000843952300036X.
short: A. Mohammadi, T. Pham, Y. Wang, Canadian Mathematical Bulletin 66 (2023)
1280–1295.
date_created: 2023-06-11T22:00:40Z
date_published: 2023-12-01T00:00:00Z
date_updated: 2024-01-29T11:00:46Z
day: '01'
department:
- _id: GradSch
doi: 10.4153/S000843952300036X
external_id:
arxiv:
- '2106.07328'
isi:
- '001011963000001'
intvolume: ' 66'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2106.07328
month: '12'
oa: 1
oa_version: Preprint
page: 1280-1295
publication: Canadian Mathematical Bulletin
publication_identifier:
eissn:
- 1496-4287
issn:
- 0008-4395
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: An energy decomposition theorem for matrices and related questions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 66
year: '2023'
...
---
_id: '13138'
abstract:
- lang: eng
text: "We consider the spin-\r\n1\r\n2\r\n Heisenberg chain (XXX model) weakly perturbed
away from integrability by an isotropic next-to-nearest neighbor exchange interaction.
Recently, it was conjectured that this model possesses an infinite tower of quasiconserved
integrals of motion (charges) [D. Kurlov et al., Phys. Rev. B 105, 104302 (2022)].
In this work we first test this conjecture by investigating how the norm of the
adiabatic gauge potential (AGP) scales with the system size, which is known to
be a remarkably accurate measure of chaos. We find that for the perturbed XXX
chain the behavior of the AGP norm corresponds to neither an integrable nor a
chaotic regime, which supports the conjectured quasi-integrability of the model.
We then prove the conjecture and explicitly construct the infinite set of quasiconserved
charges. Our proof relies on the fact that the XXX chain perturbed by next-to-nearest
exchange interaction can be viewed as a truncation of an integrable long-range
deformation of the Heisenberg spin chain."
acknowledgement: "The numerical computations in this work were performed using QuSpin
[83, 84]. We acknowledge useful discussions with Igor Aleiner, Boris Altshuler,
Jacopo de Nardis, Anatoli Polkovnikov, and Gora Shlyapnikov. We thank Piotr Sierant
and Dario Rosa for drawing our attention to Refs. [31, 42, 46] and Ref. [47], respectively.
We are grateful to an anonymous referee for very useful comments and for drawing
our attention to Refs. [80, 81]. The work of VG is part of the DeltaITP consortium,
a program of the Netherlands Organization for Scientific\r\nResearch (NWO) funded
by the Dutch Ministry of Education, Culture and Science (OCW). VG is also partially
supported by RSF 19-71-10092. The work of AT was supported by the ERC Starting Grant
101042293 (HEPIQ). RS acknowledges support from Slovenian Research Agency (ARRS)
- research programme P1-0402. "
article_number: '184312'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Pavel
full_name: Orlov, Pavel
last_name: Orlov
- first_name: Anastasiia
full_name: Tiutiakina, Anastasiia
last_name: Tiutiakina
- first_name: Rustem
full_name: Sharipov, Rustem
last_name: Sharipov
- first_name: Elena
full_name: Petrova, Elena
id: 0ac84990-897b-11ed-a09c-f5abb56a4ede
last_name: Petrova
- first_name: Vladimir
full_name: Gritsev, Vladimir
last_name: Gritsev
- first_name: Denis V.
full_name: Kurlov, Denis V.
last_name: Kurlov
citation:
ama: Orlov P, Tiutiakina A, Sharipov R, Petrova E, Gritsev V, Kurlov DV. Adiabatic
eigenstate deformations and weak integrability breaking of Heisenberg chain. Physical
Review B. 2023;107(18). doi:10.1103/PhysRevB.107.184312
apa: Orlov, P., Tiutiakina, A., Sharipov, R., Petrova, E., Gritsev, V., & Kurlov,
D. V. (2023). Adiabatic eigenstate deformations and weak integrability breaking
of Heisenberg chain. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.107.184312
chicago: Orlov, Pavel, Anastasiia Tiutiakina, Rustem Sharipov, Elena Petrova, Vladimir
Gritsev, and Denis V. Kurlov. “Adiabatic Eigenstate Deformations and Weak Integrability
Breaking of Heisenberg Chain.” Physical Review B. American Physical Society,
2023. https://doi.org/10.1103/PhysRevB.107.184312.
ieee: P. Orlov, A. Tiutiakina, R. Sharipov, E. Petrova, V. Gritsev, and D. V. Kurlov,
“Adiabatic eigenstate deformations and weak integrability breaking of Heisenberg
chain,” Physical Review B, vol. 107, no. 18. American Physical Society,
2023.
ista: Orlov P, Tiutiakina A, Sharipov R, Petrova E, Gritsev V, Kurlov DV. 2023.
Adiabatic eigenstate deformations and weak integrability breaking of Heisenberg
chain. Physical Review B. 107(18), 184312.
mla: Orlov, Pavel, et al. “Adiabatic Eigenstate Deformations and Weak Integrability
Breaking of Heisenberg Chain.” Physical Review B, vol. 107, no. 18, 184312,
American Physical Society, 2023, doi:10.1103/PhysRevB.107.184312.
short: P. Orlov, A. Tiutiakina, R. Sharipov, E. Petrova, V. Gritsev, D.V. Kurlov,
Physical Review B 107 (2023).
date_created: 2023-06-18T22:00:46Z
date_published: 2023-05-01T00:00:00Z
date_updated: 2023-08-02T06:16:02Z
day: '01'
department:
- _id: GradSch
doi: 10.1103/PhysRevB.107.184312
external_id:
arxiv:
- '2303.00729'
isi:
- '001003686900004'
intvolume: ' 107'
isi: 1
issue: '18'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2303.00729
month: '05'
oa: 1
oa_version: Preprint
publication: Physical Review B
publication_identifier:
eissn:
- 2469-9969
issn:
- 2469-9950
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Adiabatic eigenstate deformations and weak integrability breaking of Heisenberg
chain
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 107
year: '2023'
...
---
_id: '13166'
abstract:
- lang: eng
text: Brachyury, a member of T-box gene family, is widely known for its major role
in mesoderm specification in bilaterians. It is also present in non-bilaterian
metazoans, such as cnidarians, where it acts as a component of an axial patterning
system. In this study, we present a phylogenetic analysis of Brachyury genes within
phylum Cnidaria, investigate differential expression and address a functional
framework of Brachyury paralogs in hydrozoan Dynamena pumila. Our analysis indicates
two duplication events of Brachyury within the cnidarian lineage. The first duplication
likely appeared in the medusozoan ancestor, resulting in two copies in medusozoans,
while the second duplication arose in the hydrozoan ancestor, resulting in three
copies in hydrozoans. Brachyury1 and 2 display a conservative expression pattern
marking the oral pole of the body axis in D. pumila. On the contrary, Brachyury3
expression was detected in scattered presumably nerve cells of the D. pumila larva.
Pharmacological modulations indicated that Brachyury3 is not under regulation
of cWnt signaling in contrast to the other two Brachyury genes. Divergence in
expression patterns and regulation suggest neofunctionalization of Brachyury3
in hydrozoans.
acknowledgement: "We thank N.A. Pertsov White Sea Biological Station of Moscow State
University for the help and support in obtaining samples and providing access to
all required facilities and equipment of the “Center of Microscopy WSBS MSU”. We
are grateful to Dr. Amro Hamdoun for pCS2+8 plasmid (Addgene plasmid # 34931).\r\nWork
in the Walentek lab is supported by the Deutsche Forschungsgemeinschaft (DFG) under
the Emmy Noether Programme (grant WA3365/2-2) and under Germany’s Excellence Strategy
(CIBSS-EXC-2189-Project ID 390939984). SK is supported by the project No. 0088-2021-0009
of the Koltzov Institute of Developmental Biology of the RAS. The study of molecular
patterning of D. pumila colony was funded by RFBR, project number 20-04-00978a (to
S.K.)."
article_number: '9382'
article_processing_charge: No
article_type: original
author:
- first_name: Alexandra A.
full_name: Vetrova, Alexandra A.
last_name: Vetrova
- first_name: Daria M.
full_name: Kupaeva, Daria M.
last_name: Kupaeva
- first_name: Alena
full_name: Kizenko, Alena
id: a521c60b-0815-11ed-9b02-b8bd522477c8
last_name: Kizenko
- first_name: Tatiana S.
full_name: Lebedeva, Tatiana S.
last_name: Lebedeva
- first_name: Peter
full_name: Walentek, Peter
last_name: Walentek
- first_name: Nikoloz
full_name: Tsikolia, Nikoloz
last_name: Tsikolia
- first_name: Stanislav V.
full_name: Kremnyov, Stanislav V.
last_name: Kremnyov
citation:
ama: Vetrova AA, Kupaeva DM, Kizenko A, et al. The evolutionary history of Brachyury
genes in Hydrozoa involves duplications, divergence, and neofunctionalization.
Scientific Reports. 2023;13. doi:10.1038/s41598-023-35979-8
apa: Vetrova, A. A., Kupaeva, D. M., Kizenko, A., Lebedeva, T. S., Walentek, P.,
Tsikolia, N., & Kremnyov, S. V. (2023). The evolutionary history of Brachyury
genes in Hydrozoa involves duplications, divergence, and neofunctionalization.
Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-023-35979-8
chicago: Vetrova, Alexandra A., Daria M. Kupaeva, Alena Kizenko, Tatiana S. Lebedeva,
Peter Walentek, Nikoloz Tsikolia, and Stanislav V. Kremnyov. “The Evolutionary
History of Brachyury Genes in Hydrozoa Involves Duplications, Divergence, and
Neofunctionalization.” Scientific Reports. Springer Nature, 2023. https://doi.org/10.1038/s41598-023-35979-8.
ieee: A. A. Vetrova et al., “The evolutionary history of Brachyury genes
in Hydrozoa involves duplications, divergence, and neofunctionalization,” Scientific
Reports, vol. 13. Springer Nature, 2023.
ista: Vetrova AA, Kupaeva DM, Kizenko A, Lebedeva TS, Walentek P, Tsikolia N, Kremnyov
SV. 2023. The evolutionary history of Brachyury genes in Hydrozoa involves duplications,
divergence, and neofunctionalization. Scientific Reports. 13, 9382.
mla: Vetrova, Alexandra A., et al. “The Evolutionary History of Brachyury Genes
in Hydrozoa Involves Duplications, Divergence, and Neofunctionalization.” Scientific
Reports, vol. 13, 9382, Springer Nature, 2023, doi:10.1038/s41598-023-35979-8.
short: A.A. Vetrova, D.M. Kupaeva, A. Kizenko, T.S. Lebedeva, P. Walentek, N. Tsikolia,
S.V. Kremnyov, Scientific Reports 13 (2023).
date_created: 2023-06-25T22:00:46Z
date_published: 2023-06-09T00:00:00Z
date_updated: 2023-08-02T06:17:18Z
day: '09'
ddc:
- '570'
department:
- _id: GradSch
doi: 10.1038/s41598-023-35979-8
external_id:
isi:
- '001006690200045'
pmid:
- '37296138'
file:
- access_level: open_access
checksum: baddf6b2fa9adf88263d4a3b0998f0f2
content_type: application/pdf
creator: dernst
date_created: 2023-06-26T09:58:53Z
date_updated: 2023-06-26T09:58:53Z
file_id: '13170'
file_name: 2023_ScientificReports_Vetrova.pdf
file_size: 4844149
relation: main_file
success: 1
file_date_updated: 2023-06-26T09:58:53Z
has_accepted_license: '1'
intvolume: ' 13'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
pmid: 1
publication: Scientific Reports
publication_identifier:
eissn:
- 2045-2322
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: The evolutionary history of Brachyury genes in Hydrozoa involves duplications,
divergence, and neofunctionalization
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 13
year: '2023'
...
---
_id: '13175'
abstract:
- lang: eng
text: "About a 100 years ago, we discovered that our universe is inherently noisy,
that is, measuring any physical quantity with a precision beyond a certain point
is not possible because of an omnipresent inherent noise. We call this - the quantum
noise. Certain physical processes allow this quantum noise to get correlated in
conjugate physical variables. These quantum correlations can be used to go beyond
the potential of our inherently noisy universe and obtain a quantum advantage
over the classical applications. \r\n\r\nQuantum noise being inherent also means
that, at the fundamental level, the physical quantities are not well defined and
therefore, objects can stay in multiple states at the same time. For example,
the position of a particle not being well defined means that the particle is in
multiple positions at the same time. About 4 decades ago, we started exploring
the possibility of using objects which can be in multiple states at the same time
to increase the dimensionality in computation. Thus, the field of quantum computing
was born. We discovered that using quantum entanglement, a property closely related
to quantum correlations, can be used to speed up computation of certain problems,
such as factorisation of large numbers, faster than any known classical algorithm.
Thus began the pursuit to make quantum computers a reality. \r\n\r\nTill date,
we have explored quantum control over many physical systems including photons,
spins, atoms, ions and even simple circuits made up of superconducting material.
However, there persists one ubiquitous theme. The more readily a system interacts
with an external field or matter, the more easily we can control it. But this
also means that such a system can easily interact with a noisy environment and
quickly lose its coherence. Consequently, such systems like electron spins need
to be protected from the environment to ensure the longevity of their coherence.
Other systems like nuclear spins are naturally protected as they do not interact
easily with the environment. But, due to the same reason, it is harder to interact
with such systems. \r\n\r\nAfter decades of experimentation with various systems,
we are convinced that no one type of quantum system would be the best for all
the quantum applications. We would need hybrid systems which are all interconnected
- much like the current internet where all sorts of devices can all talk to each
other - but now for quantum devices. A quantum internet. \r\n\r\nOptical photons
are the best contenders to carry information for the quantum internet. They can
carry quantum information cheaply and without much loss - the same reasons which
has made them the backbone of our current internet. Following this direction,
many systems, like trapped ions, have already demonstrated successful quantum
links over a large distances using optical photons. However, some of the most
promising contenders for quantum computing which are based on microwave frequencies
have been left behind. This is because high energy optical photons can adversely
affect fragile low-energy microwave systems. \r\n\r\nIn this thesis, we present
substantial progress on this missing quantum link between microwave and optics
using electrooptical nonlinearities in lithium niobate. The nonlinearities are
enhanced by using resonant cavities for all the involved modes leading to observation
of strong direct coupling between optical and microwave frequencies. With this
strong coupling we are not only able to achieve almost 100\\% internal conversion
efficiency with low added noise, thus presenting a quantum-enabled transducer,
but also we are able to observe novel effects such as cooling of a microwave mode
using optics. The strong coupling regime also leads to direct observation of dynamical
backaction effect between microwave and optical frequencies which are studied
in detail here. Finally, we also report first observation of microwave-optics
entanglement in form of two-mode squeezed vacuum squeezed 0.7dB below vacuum level.
\r\nWith this new bridge between microwave and optics, the microwave-based quantum
technologies can finally be a part of a quantum network which is based on optical
photons - putting us one step closer to a future with quantum internet. "
acknowledged_ssus:
- _id: M-Shop
- _id: SSU
- _id: NanoFab
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Rishabh
full_name: Sahu, Rishabh
id: 47D26E34-F248-11E8-B48F-1D18A9856A87
last_name: Sahu
orcid: 0000-0001-6264-2162
citation:
ama: Sahu R. Cavity quantum electrooptics. 2023. doi:10.15479/at:ista:13175
apa: Sahu, R. (2023). Cavity quantum electrooptics. Institute of Science
and Technology Austria. https://doi.org/10.15479/at:ista:13175
chicago: Sahu, Rishabh. “Cavity Quantum Electrooptics.” Institute of Science and
Technology Austria, 2023. https://doi.org/10.15479/at:ista:13175.
ieee: R. Sahu, “Cavity quantum electrooptics,” Institute of Science and Technology
Austria, 2023.
ista: Sahu R. 2023. Cavity quantum electrooptics. Institute of Science and Technology
Austria.
mla: Sahu, Rishabh. Cavity Quantum Electrooptics. Institute of Science and
Technology Austria, 2023, doi:10.15479/at:ista:13175.
short: R. Sahu, Cavity Quantum Electrooptics, Institute of Science and Technology
Austria, 2023.
date_created: 2023-06-30T08:07:43Z
date_published: 2023-05-05T00:00:00Z
date_updated: 2024-10-29T09:11:06Z
day: '05'
ddc:
- '537'
- '535'
- '539'
degree_awarded: PhD
department:
- _id: GradSch
- _id: JoFi
doi: 10.15479/at:ista:13175
ec_funded: 1
file:
- access_level: open_access
checksum: 7d03f1a5a5258ee43dfc3323dea4e08f
content_type: application/pdf
creator: cchlebak
date_created: 2023-06-30T08:17:25Z
date_updated: 2023-06-30T08:17:25Z
file_id: '13176'
file_name: thesis_pdfa.pdf
file_size: 18688376
relation: main_file
success: 1
- access_level: closed
checksum: c3b45317ae58e0527533f98c202d81b7
content_type: application/x-zip-compressed
creator: cchlebak
date_created: 2023-07-06T11:35:15Z
date_updated: 2023-07-06T11:35:15Z
file_id: '13196'
file_name: thesis.zip
file_size: 37847025
relation: source_file
file_date_updated: 2023-07-06T11:35:15Z
has_accepted_license: '1'
keyword:
- quantum optics
- electrooptics
- quantum networks
- quantum communication
- transduction
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-sa/4.0/
month: '05'
oa: 1
oa_version: Published Version
page: '202'
project:
- _id: 26336814-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '758053'
name: A Fiber Optic Transceiver for Superconducting Qubits
- _id: 9B868D20-BA93-11EA-9121-9846C619BF3A
call_identifier: H2020
grant_number: '899354'
name: Quantum Local Area Networks with Superconducting Qubits
- _id: bdb108fd-d553-11ed-ba76-83dc74a9864f
name: QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration
of Superconducting Quantum Circuits
publication_identifier:
isbn:
- 978-3-99078-030-5
issn:
- 2663 - 337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '12900'
relation: old_edition
status: public
- id: '9114'
relation: part_of_dissertation
status: public
- id: '10924'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
title: Cavity quantum electrooptics
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
BY-NC-SA 4.0)
short: CC BY-NC-SA (4.0)
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2023'
...
---
_id: '13207'
abstract:
- lang: eng
text: We consider the linear BCS equation, determining the BCS critical temperature,
in the presence of a boundary, where Dirichlet boundary conditions are imposed.
In the one-dimensional case with point interactions, we prove that the critical
temperature is strictly larger than the bulk value, at least at weak coupling.
In particular, the Cooper-pair wave function localizes near the boundary, an effect
that cannot be modeled by effective Neumann boundary conditions on the order parameter
as often imposed in Ginzburg–Landau theory. We also show that the relative shift
in critical temperature vanishes if the coupling constant either goes to zero
or to infinity.
acknowledgement: We thank Egor Babaev for encouraging us to study this problem, and
Rupert Frank for many fruitful discussions. scussions. Funding. Funding from the
European Union’s Horizon 2020 research and innovation programme under the ERC grant
agreement No. 694227 (Barbara Roos and Robert Seiringer) is gratefully acknowledged.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Christian
full_name: Hainzl, Christian
last_name: Hainzl
- first_name: Barbara
full_name: Roos, Barbara
id: 5DA90512-D80F-11E9-8994-2E2EE6697425
last_name: Roos
orcid: 0000-0002-9071-5880
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Hainzl C, Roos B, Seiringer R. Boundary superconductivity in the BCS model.
Journal of Spectral Theory. 2023;12(4):1507–1540. doi:10.4171/JST/439
apa: Hainzl, C., Roos, B., & Seiringer, R. (2023). Boundary superconductivity
in the BCS model. Journal of Spectral Theory. EMS Press. https://doi.org/10.4171/JST/439
chicago: Hainzl, Christian, Barbara Roos, and Robert Seiringer. “Boundary Superconductivity
in the BCS Model.” Journal of Spectral Theory. EMS Press, 2023. https://doi.org/10.4171/JST/439.
ieee: C. Hainzl, B. Roos, and R. Seiringer, “Boundary superconductivity in the BCS
model,” Journal of Spectral Theory, vol. 12, no. 4. EMS Press, pp. 1507–1540,
2023.
ista: Hainzl C, Roos B, Seiringer R. 2023. Boundary superconductivity in the BCS
model. Journal of Spectral Theory. 12(4), 1507–1540.
mla: Hainzl, Christian, et al. “Boundary Superconductivity in the BCS Model.” Journal
of Spectral Theory, vol. 12, no. 4, EMS Press, 2023, pp. 1507–1540, doi:10.4171/JST/439.
short: C. Hainzl, B. Roos, R. Seiringer, Journal of Spectral Theory 12 (2023) 1507–1540.
date_created: 2023-07-10T16:35:45Z
date_published: 2023-05-18T00:00:00Z
date_updated: 2023-10-27T10:37:29Z
day: '18'
ddc:
- '530'
department:
- _id: GradSch
- _id: RoSe
doi: 10.4171/JST/439
ec_funded: 1
external_id:
arxiv:
- '2201.08090'
isi:
- '000997933500008'
file:
- access_level: open_access
checksum: 5501da33be010b5c81440438287584d5
content_type: application/pdf
creator: alisjak
date_created: 2023-07-11T08:19:15Z
date_updated: 2023-07-11T08:19:15Z
file_id: '13208'
file_name: 2023_EMS_Hainzl.pdf
file_size: 304619
relation: main_file
success: 1
file_date_updated: 2023-07-11T08:19:15Z
has_accepted_license: '1'
intvolume: ' 12'
isi: 1
issue: '4'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 1507–1540
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: Journal of Spectral Theory
publication_identifier:
eissn:
- 1664-0403
issn:
- 1664-039X
publication_status: published
publisher: EMS Press
quality_controlled: '1'
related_material:
record:
- id: '14374'
relation: dissertation_contains
status: public
status: public
title: Boundary superconductivity in the BCS model
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: '2023'
...
---
_id: '13221'
abstract:
- lang: eng
text: The safety-liveness dichotomy is a fundamental concept in formal languages
which plays a key role in verification. Recently, this dichotomy has been lifted
to quantitative properties, which are arbitrary functions from infinite words
to partially-ordered domains. We look into harnessing the dichotomy for the specific
classes of quantitative properties expressed by quantitative automata. These automata
contain finitely many states and rational-valued transition weights, and their
common value functions Inf, Sup, LimInf, LimSup, LimInfAvg, LimSupAvg, and DSum
map infinite words into the totallyordered domain of real numbers. In this automata-theoretic
setting, we establish a connection between quantitative safety and topological
continuity and provide an alternative characterization of quantitative safety
and liveness in terms of their boolean counterparts. For all common value functions,
we show how the safety closure of a quantitative automaton can be constructed
in PTime, and we provide PSpace-complete checks of whether a given quantitative
automaton is safe or live, with the exception of LimInfAvg and LimSupAvg automata,
for which the safety check is in ExpSpace. Moreover, for deterministic Sup, LimInf,
and LimSup automata, we give PTime decompositions into safe and live automata.
These decompositions enable the separation of techniques for safety and liveness
verification for quantitative specifications.
acknowledgement: We thank Christof Löding for pointing us to some results on PSpace-hardess
of universality problems and the anonymous reviewers for their helpful comments.
This work was supported in part by the ERC-2020-AdG 101020093 and the Israel Science
Foundation grant 2410/22.
alternative_title:
- LIPIcs
article_number: '17'
article_processing_charge: No
arxiv: 1
author:
- first_name: Udi
full_name: Boker, Udi
id: 31E297B6-F248-11E8-B48F-1D18A9856A87
last_name: Boker
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Nicolas Adrien
full_name: Mazzocchi, Nicolas Adrien
id: b26baa86-3308-11ec-87b0-8990f34baa85
last_name: Mazzocchi
- first_name: Naci E
full_name: Sarac, Naci E
id: 8C6B42F8-C8E6-11E9-A03A-F2DCE5697425
last_name: Sarac
citation:
ama: 'Boker U, Henzinger TA, Mazzocchi NA, Sarac NE. Safety and liveness of quantitative
automata. In: 34th International Conference on Concurrency Theory. Vol
279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.CONCUR.2023.17'
apa: 'Boker, U., Henzinger, T. A., Mazzocchi, N. A., & Sarac, N. E. (2023).
Safety and liveness of quantitative automata. In 34th International Conference
on Concurrency Theory (Vol. 279). Antwerp, Belgium: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2023.17'
chicago: Boker, Udi, Thomas A Henzinger, Nicolas Adrien Mazzocchi, and Naci E Sarac.
“Safety and Liveness of Quantitative Automata.” In 34th International Conference
on Concurrency Theory, Vol. 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2023. https://doi.org/10.4230/LIPIcs.CONCUR.2023.17.
ieee: U. Boker, T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Safety and liveness
of quantitative automata,” in 34th International Conference on Concurrency
Theory, Antwerp, Belgium, 2023, vol. 279.
ista: 'Boker U, Henzinger TA, Mazzocchi NA, Sarac NE. 2023. Safety and liveness
of quantitative automata. 34th International Conference on Concurrency Theory.
CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 279, 17.'
mla: Boker, Udi, et al. “Safety and Liveness of Quantitative Automata.” 34th
International Conference on Concurrency Theory, vol. 279, 17, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.CONCUR.2023.17.
short: U. Boker, T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 34th International
Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2023.
conference:
end_date: 2023-09-23
location: Antwerp, Belgium
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2023-09-18
date_created: 2023-07-14T10:00:15Z
date_published: 2023-09-01T00:00:00Z
date_updated: 2023-10-09T07:14:03Z
day: '01'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
doi: 10.4230/LIPIcs.CONCUR.2023.17
ec_funded: 1
external_id:
arxiv:
- '2307.06016'
file:
- access_level: open_access
checksum: d40e57a04448ea5c77d7e1cfb9590a81
content_type: application/pdf
creator: esarac
date_created: 2023-07-14T12:03:48Z
date_updated: 2023-07-14T12:03:48Z
file_id: '13224'
file_name: CONCUR23.pdf
file_size: 755529
relation: main_file
success: 1
file_date_updated: 2023-07-14T12:03:48Z
has_accepted_license: '1'
intvolume: ' 279'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: 34th International Conference on Concurrency Theory
publication_identifier:
eissn:
- 1868-8969
isbn:
- '9783959772990'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
status: public
title: Safety and liveness of quantitative automata
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 279
year: '2023'
...
---
_id: '13262'
abstract:
- lang: eng
text: 'Determining the degree of inherent parallelism in classical sequential algorithms
and leveraging it for fast parallel execution is a key topic in parallel computing,
and detailed analyses are known for a wide range of classical algorithms. In this
paper, we perform the first such analysis for the fundamental Union-Find problem,
in which we are given a graph as a sequence of edges, and must maintain its connectivity
structure under edge additions. We prove that classic sequential algorithms for
this problem are well-parallelizable under reasonable assumptions, addressing
a conjecture by [Blelloch, 2017]. More precisely, we show via a new potential
argument that, under uniform random edge ordering, parallel union-find operations
are unlikely to interfere: T concurrent threads processing the graph in parallel
will encounter memory contention O(T2 · log |V| · log |E|) times in expectation,
where |E| and |V| are the number of edges and nodes in the graph, respectively.
We leverage this result to design a new parallel Union-Find algorithm that is
both internally deterministic, i.e., its results are guaranteed to match those
of a sequential execution, but also work-efficient and scalable, as long as the
number of threads T is O(|E|1 over 3 - ε), for an arbitrarily small constant ε
> 0, which holds for most large real-world graphs. We present lower bounds which
show that our analysis is close to optimal, and experimental results suggesting
that the performance cost of internal determinism is limited.'
article_processing_charge: Yes (in subscription journal)
arxiv: 1
author:
- first_name: Alexander
full_name: Fedorov, Alexander
id: 2e711909-896a-11ed-bdf8-eb0f5a2984c6
last_name: Fedorov
- first_name: Diba
full_name: Hashemi, Diba
id: ed9595ea-2f8f-11ee-ba95-d2b546540783
last_name: Hashemi
- first_name: Giorgi
full_name: Nadiradze, Giorgi
id: 3279A00C-F248-11E8-B48F-1D18A9856A87
last_name: Nadiradze
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Fedorov A, Hashemi D, Nadiradze G, Alistarh D-A. Provably-efficient and internally-deterministic
parallel Union-Find. In: Proceedings of the 35th ACM Symposium on Parallelism
in Algorithms and Architectures. Association for Computing Machinery; 2023:261-271.
doi:10.1145/3558481.3591082'
apa: 'Fedorov, A., Hashemi, D., Nadiradze, G., & Alistarh, D.-A. (2023). Provably-efficient
and internally-deterministic parallel Union-Find. In Proceedings of the 35th
ACM Symposium on Parallelism in Algorithms and Architectures (pp. 261–271).
Orlando, FL, United States: Association for Computing Machinery. https://doi.org/10.1145/3558481.3591082'
chicago: Fedorov, Alexander, Diba Hashemi, Giorgi Nadiradze, and Dan-Adrian Alistarh.
“Provably-Efficient and Internally-Deterministic Parallel Union-Find.” In Proceedings
of the 35th ACM Symposium on Parallelism in Algorithms and Architectures,
261–71. Association for Computing Machinery, 2023. https://doi.org/10.1145/3558481.3591082.
ieee: A. Fedorov, D. Hashemi, G. Nadiradze, and D.-A. Alistarh, “Provably-efficient
and internally-deterministic parallel Union-Find,” in Proceedings of the 35th
ACM Symposium on Parallelism in Algorithms and Architectures, Orlando, FL,
United States, 2023, pp. 261–271.
ista: 'Fedorov A, Hashemi D, Nadiradze G, Alistarh D-A. 2023. Provably-efficient
and internally-deterministic parallel Union-Find. Proceedings of the 35th ACM
Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism
in Algorithms and Architectures, 261–271.'
mla: Fedorov, Alexander, et al. “Provably-Efficient and Internally-Deterministic
Parallel Union-Find.” Proceedings of the 35th ACM Symposium on Parallelism
in Algorithms and Architectures, Association for Computing Machinery, 2023,
pp. 261–71, doi:10.1145/3558481.3591082.
short: A. Fedorov, D. Hashemi, G. Nadiradze, D.-A. Alistarh, in:, Proceedings of
the 35th ACM Symposium on Parallelism in Algorithms and Architectures, Association
for Computing Machinery, 2023, pp. 261–271.
conference:
end_date: 2023-06-19
location: Orlando, FL, United States
name: 'SPAA: Symposium on Parallelism in Algorithms and Architectures'
start_date: 2023-06-17
date_created: 2023-07-23T22:01:12Z
date_published: 2023-06-17T00:00:00Z
date_updated: 2023-07-31T10:54:32Z
day: '17'
ddc:
- '000'
department:
- _id: DaAl
- _id: GradSch
doi: 10.1145/3558481.3591082
external_id:
arxiv:
- '2304.09331'
file:
- access_level: open_access
checksum: 72e312aabf0c5248c99b5cd3a88e4c88
content_type: application/pdf
creator: dernst
date_created: 2023-07-31T10:53:08Z
date_updated: 2023-07-31T10:53:08Z
file_id: '13334'
file_name: 2023_SPAA_Fedorov.pdf
file_size: 2087937
relation: main_file
success: 1
file_date_updated: 2023-07-31T10:53:08Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 261-271
publication: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and
Architectures
publication_identifier:
isbn:
- '9781450395458'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Provably-efficient and internally-deterministic parallel Union-Find
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '13274'
abstract:
- lang: eng
text: Viscous flows through pipes and channels are steady and ordered until, with
increasing velocity, the laminar motion catastrophically breaks down and gives
way to turbulence. How this apparently discontinuous change from low- to high-dimensional
motion can be rationalized within the framework of the Navier-Stokes equations
is not well understood. Exploiting geometrical properties of transitional channel
flow we trace turbulence to far lower Reynolds numbers (Re) than previously possible
and identify the complete path that reversibly links fully turbulent motion to
an invariant solution. This precursor of turbulence destabilizes rapidly with
Re, and the accompanying explosive increase in attractor dimension effectively
marks the transition between deterministic and de facto stochastic dynamics.
acknowledgement: We thank Baofang Song as well as the developers of Channelflow for
sharing their numerical codes, and Mukund Vasudevan and Holger Kantz for fruitful
discussions. This work was supported by a grant from the Simons Foundation (662960,
B. H.).
article_number: '034002'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Chaitanya S
full_name: Paranjape, Chaitanya S
id: 3D85B7C4-F248-11E8-B48F-1D18A9856A87
last_name: Paranjape
- first_name: Gökhan
full_name: Yalniz, Gökhan
id: 66E74FA2-D8BF-11E9-8249-8DE2E5697425
last_name: Yalniz
orcid: 0000-0002-8490-9312
- first_name: Yohann
full_name: Duguet, Yohann
last_name: Duguet
- first_name: Nazmi B
full_name: Budanur, Nazmi B
id: 3EA1010E-F248-11E8-B48F-1D18A9856A87
last_name: Budanur
orcid: 0000-0003-0423-5010
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
citation:
ama: Paranjape CS, Yalniz G, Duguet Y, Budanur NB, Hof B. Direct path from turbulence
to time-periodic solutions. Physical Review Letters. 2023;131(3). doi:10.1103/physrevlett.131.034002
apa: Paranjape, C. S., Yalniz, G., Duguet, Y., Budanur, N. B., & Hof, B. (2023).
Direct path from turbulence to time-periodic solutions. Physical Review Letters.
American Physical Society. https://doi.org/10.1103/physrevlett.131.034002
chicago: Paranjape, Chaitanya S, Gökhan Yalniz, Yohann Duguet, Nazmi B Budanur,
and Björn Hof. “Direct Path from Turbulence to Time-Periodic Solutions.” Physical
Review Letters. American Physical Society, 2023. https://doi.org/10.1103/physrevlett.131.034002.
ieee: C. S. Paranjape, G. Yalniz, Y. Duguet, N. B. Budanur, and B. Hof, “Direct
path from turbulence to time-periodic solutions,” Physical Review Letters,
vol. 131, no. 3. American Physical Society, 2023.
ista: Paranjape CS, Yalniz G, Duguet Y, Budanur NB, Hof B. 2023. Direct path from
turbulence to time-periodic solutions. Physical Review Letters. 131(3), 034002.
mla: Paranjape, Chaitanya S., et al. “Direct Path from Turbulence to Time-Periodic
Solutions.” Physical Review Letters, vol. 131, no. 3, 034002, American
Physical Society, 2023, doi:10.1103/physrevlett.131.034002.
short: C.S. Paranjape, G. Yalniz, Y. Duguet, N.B. Budanur, B. Hof, Physical Review
Letters 131 (2023).
date_created: 2023-07-24T09:43:59Z
date_published: 2023-07-21T00:00:00Z
date_updated: 2023-12-13T11:40:19Z
day: '21'
department:
- _id: GradSch
- _id: BjHo
doi: 10.1103/physrevlett.131.034002
external_id:
arxiv:
- '2306.05098'
isi:
- '001052929900004'
intvolume: ' 131'
isi: 1
issue: '3'
keyword:
- General Physics and Astronomy
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2306.05098
month: '07'
oa: 1
oa_version: Preprint
project:
- _id: 238598C6-32DE-11EA-91FC-C7463DDC885E
grant_number: '662960'
name: 'Revisiting the Turbulence Problem Using Statistical Mechanics: Experimental
Studies on Transitional and Turbulent Flows'
publication: Physical Review Letters
publication_identifier:
eissn:
- 1079-7114
issn:
- 0031-9007
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
status: public
title: Direct path from turbulence to time-periodic solutions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 131
year: '2023'
...
---
_id: '13286'
abstract:
- lang: eng
text: Semiconductor-superconductor hybrid systems are the harbour of many intriguing
mesoscopic phenomena. This material combination leads to spatial variations of
the superconducting properties, which gives rise to Andreev bound states (ABSs).
Some of these states might exhibit remarkable properties that render them highly
desirable for topological quantum computing. The most prominent and hunted of
such states are Majorana zero modes (MZMs), quasiparticles equals to their own
quasiparticles that they follow non-abelian statistics. In this thesis, we first
introduce the general framework of such hybrid systems and, then, we unveil a
series of mesoscopic phenomena that we discovered. Firstly, we show tunneling
spectroscopy experiments on full-shell nanowires (NWs) showing that unwanted quantum-dot
states coupled to superconductors (Yu-Shiba-Rusinov states) can mimic MZMs signatures.
Then, we introduce a novel protocol which allowed the integration of tunneling
spectroscopy with Coulomb spectroscopy within the same device. Employing this
approach on both full-shell NWs and partial-shell NWs, we demonstrated that longitudinally
confined states reveal charge transport phenomenology similar to the one expected
for MZMs. These findings shed light on the intricate interplay between superconductivity
and quantum confinement, which brought us to explore another material platform,
i.e. a two-dimensional Germanium hole gas. After developing a robust way to induce
superconductivity in such system, we showed how to engineer the proximity effect
and we revealed a superconducting hard gap. Finally, we created a superconducting
radio frequency driven ideal diode and a generator of non-sinusoidal current-phase
relations. Our results open the path for the exploration of protected superconducting
qubits and more complex hybrid devices in planar Germanium, like Kitaev chains
and hybrid qubit devices.
acknowledged_ssus:
- _id: NanoFab
- _id: M-Shop
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Marco
full_name: Valentini, Marco
id: C0BB2FAC-D767-11E9-B658-BC13E6697425
last_name: Valentini
citation:
ama: 'Valentini M. Mesoscopic phenomena in hybrid semiconductor-superconductor nanodevices :
From full-shell nanowires to two-dimensional hole gas in germanium. 2023. doi:10.15479/at:ista:13286'
apa: 'Valentini, M. (2023). Mesoscopic phenomena in hybrid semiconductor-superconductor
nanodevices : From full-shell nanowires to two-dimensional hole gas in germanium.
Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:13286'
chicago: 'Valentini, Marco. “Mesoscopic Phenomena in Hybrid Semiconductor-Superconductor
Nanodevices : From Full-Shell Nanowires to Two-Dimensional Hole Gas in Germanium.”
Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:13286.'
ieee: 'M. Valentini, “Mesoscopic phenomena in hybrid semiconductor-superconductor
nanodevices : From full-shell nanowires to two-dimensional hole gas in germanium,”
Institute of Science and Technology Austria, 2023.'
ista: 'Valentini M. 2023. Mesoscopic phenomena in hybrid semiconductor-superconductor
nanodevices : From full-shell nanowires to two-dimensional hole gas in germanium.
Institute of Science and Technology Austria.'
mla: 'Valentini, Marco. Mesoscopic Phenomena in Hybrid Semiconductor-Superconductor
Nanodevices : From Full-Shell Nanowires to Two-Dimensional Hole Gas in Germanium.
Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:13286.'
short: 'M. Valentini, Mesoscopic Phenomena in Hybrid Semiconductor-Superconductor
Nanodevices : From Full-Shell Nanowires to Two-Dimensional Hole Gas in Germanium,
Institute of Science and Technology Austria, 2023.'
date_created: 2023-07-24T14:10:45Z
date_published: 2023-07-21T00:00:00Z
date_updated: 2024-02-21T12:35:34Z
day: '21'
ddc:
- '530'
degree_awarded: PhD
department:
- _id: GradSch
- _id: GeKa
doi: 10.15479/at:ista:13286
ec_funded: 1
file:
- access_level: closed
checksum: 666ee31c7eade89679806287c062fa14
content_type: application/x-zip-compressed
creator: mvalenti
date_created: 2023-08-11T09:27:39Z
date_updated: 2023-08-11T10:01:34Z
file_id: '14033'
file_name: PhD_thesis_Valentini_final.zip
file_size: 56121429
relation: source_file
- access_level: open_access
checksum: 0992f2ebef152dee8e70055350ebbb55
content_type: application/pdf
creator: mvalenti
date_created: 2023-08-11T14:39:17Z
date_updated: 2023-08-11T14:39:17Z
file_id: '14035'
file_name: PhD_thesis_Valentini_final_validated.pdf
file_size: 38199711
relation: main_file
file_date_updated: 2023-08-11T14:39:17Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '184'
project:
- _id: 262116AA-B435-11E9-9278-68D0E5697425
name: Hybrid Semiconductor - Superconductor Quantum Devices
- _id: 237E5020-32DE-11EA-91FC-C7463DDC885E
call_identifier: H2020
grant_number: '862046'
name: TOPOLOGICALLY PROTECTED AND SCALABLE QUANTUM BITS
- _id: 34a66131-11ca-11ed-8bc3-a31681c6b03e
grant_number: F8606
name: Conventional and unconventional topological superconductors
publication_identifier:
issn:
- 2663 - 337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '13312'
relation: part_of_dissertation
status: public
- id: '12118'
relation: part_of_dissertation
status: public
- id: '8910'
relation: part_of_dissertation
status: public
- id: '12522'
relation: research_data
status: public
status: public
supervisor:
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
title: 'Mesoscopic phenomena in hybrid semiconductor-superconductor nanodevices :
From full-shell nanowires to two-dimensional hole gas in germanium'
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
BY-NC-SA 4.0)
short: CC BY-NC-SA (4.0)
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2023'
...
---
_id: '13292'
abstract:
- lang: eng
text: The operator precedence languages (OPLs) represent the largest known subclass
of the context-free languages which enjoys all desirable closure and decidability
properties. This includes the decidability of language inclusion, which is the
ultimate verification problem. Operator precedence grammars, automata, and logics
have been investigated and used, for example, to verify programs with arithmetic
expressions and exceptions (both of which are deterministic pushdown but lie outside
the scope of the visibly pushdown languages). In this paper, we complete the picture
and give, for the first time, an algebraic characterization of the class of OPLs
in the form of a syntactic congruence that has finitely many equivalence classes
exactly for the operator precedence languages. This is a generalization of the
celebrated Myhill-Nerode theorem for the regular languages to OPLs. As one of
the consequences, we show that universality and language inclusion for nondeterministic
operator precedence automata can be solved by an antichain algorithm. Antichain
algorithms avoid determinization and complementation through an explicit subset
construction, by leveraging a quasi-order on words, which allows the pruning of
the search space for counterexample words without sacrificing completeness. Antichain
algorithms can be implemented symbolically, and these implementations are today
the best-performing algorithms in practice for the inclusion of finite automata.
We give a generic construction of the quasi-order needed for antichain algorithms
from a finite syntactic congruence. This yields the first antichain algorithm
for OPLs, an algorithm that solves the ExpTime-hard language inclusion problem
for OPLs in exponential time.
acknowledgement: "This work was supported in part by the ERC-2020-AdG 101020093.\r\nWe
thank Pierre Ganty for early discussions and the anonymous reviewers for their helpful
comments.\r\n"
alternative_title:
- LIPIcs
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Pavol
full_name: Kebis, Pavol
last_name: Kebis
- first_name: Nicolas Adrien
full_name: Mazzocchi, Nicolas Adrien
id: b26baa86-3308-11ec-87b0-8990f34baa85
last_name: Mazzocchi
- first_name: Naci E
full_name: Sarac, Naci E
id: 8C6B42F8-C8E6-11E9-A03A-F2DCE5697425
last_name: Sarac
citation:
ama: 'Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. Regular methods for operator
precedence languages. In: 50th International Colloquium on Automata, Languages,
and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2023:129:1--129:20. doi:10.4230/LIPIcs.ICALP.2023.129'
apa: 'Henzinger, T. A., Kebis, P., Mazzocchi, N. A., & Sarac, N. E. (2023).
Regular methods for operator precedence languages. In 50th International Colloquium
on Automata, Languages, and Programming (Vol. 261, p. 129:1--129:20). Paderborn,
Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.129'
chicago: Henzinger, Thomas A, Pavol Kebis, Nicolas Adrien Mazzocchi, and Naci E
Sarac. “Regular Methods for Operator Precedence Languages.” In 50th International
Colloquium on Automata, Languages, and Programming, 261:129:1--129:20. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ICALP.2023.129.
ieee: T. A. Henzinger, P. Kebis, N. A. Mazzocchi, and N. E. Sarac, “Regular methods
for operator precedence languages,” in 50th International Colloquium on Automata,
Languages, and Programming, Paderborn, Germany, 2023, vol. 261, p. 129:1--129:20.
ista: 'Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. 2023. Regular methods for
operator precedence languages. 50th International Colloquium on Automata, Languages,
and Programming. ICALP: International Colloquium on Automata, Languages, and Programming,
LIPIcs, vol. 261, 129:1--129:20.'
mla: Henzinger, Thomas A., et al. “Regular Methods for Operator Precedence Languages.”
50th International Colloquium on Automata, Languages, and Programming,
vol. 261, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, p. 129:1--129:20,
doi:10.4230/LIPIcs.ICALP.2023.129.
short: T.A. Henzinger, P. Kebis, N.A. Mazzocchi, N.E. Sarac, in:, 50th International
Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2023, p. 129:1--129:20.
conference:
end_date: 2023-07-14
location: Paderborn, Germany
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2023-07-10
date_created: 2023-07-24T15:11:41Z
date_published: 2023-07-05T00:00:00Z
date_updated: 2023-07-31T08:38:38Z
day: '05'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
doi: 10.4230/LIPIcs.ICALP.2023.129
ec_funded: 1
external_id:
arxiv:
- '2305.03447'
file:
- access_level: open_access
checksum: 5d4c8932ef3450615a53b9bb15d92eb2
content_type: application/pdf
creator: esarac
date_created: 2023-07-24T15:11:05Z
date_updated: 2023-07-24T15:11:05Z
file_id: '13293'
file_name: icalp23.pdf
file_size: 859379
relation: main_file
success: 1
file_date_updated: 2023-07-24T15:11:05Z
has_accepted_license: '1'
intvolume: ' 261'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 129:1--129:20
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: 50th International Colloquium on Automata, Languages, and Programming
publication_identifier:
eissn:
- 1868-8969
isbn:
- '9783959772785'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
status: public
title: Regular methods for operator precedence languages
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 261
year: '2023'
...
---
_id: '13310'
abstract:
- lang: eng
text: Machine-learned systems are in widespread use for making decisions about humans,
and it is important that they are fair, i.e., not biased against individuals based
on sensitive attributes. We present runtime verification of algorithmic fairness
for systems whose models are unknown, but are assumed to have a Markov chain structure.
We introduce a specification language that can model many common algorithmic fairness
properties, such as demographic parity, equal opportunity, and social burden.
We build monitors that observe a long sequence of events as generated by a given
system, and output, after each observation, a quantitative estimate of how fair
or biased the system was on that run until that point in time. The estimate is
proven to be correct modulo a variable error bound and a given confidence level,
where the error bound gets tighter as the observed sequence gets longer. Our monitors
are of two types, and use, respectively, frequentist and Bayesian statistical
inference techniques. While the frequentist monitors compute estimates that are
objectively correct with respect to the ground truth, the Bayesian monitors compute
estimates that are correct subject to a given prior belief about the system’s
model. Using a prototype implementation, we show how we can monitor if a bank
is fair in giving loans to applicants from different social backgrounds, and if
a college is fair in admitting students while maintaining a reasonable financial
burden on the society. Although they exhibit different theoretical complexities
in certain cases, in our experiments, both frequentist and Bayesian monitors took
less than a millisecond to update their verdicts after each observation.
acknowledgement: 'This work is supported by the European Research Council under Grant
No.: ERC-2020-AdG101020093.'
alternative_title:
- LNCS
article_processing_charge: Yes (in subscription journal)
arxiv: 1
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Mahyar
full_name: Karimi, Mahyar
id: f1dedef5-2f78-11ee-989a-c4c97bccf506
last_name: Karimi
orcid: 0009-0005-0820-1696
- first_name: Konstantin
full_name: Kueffner, Konstantin
id: 8121a2d0-dc85-11ea-9058-af578f3b4515
last_name: Kueffner
orcid: 0000-0001-8974-2542
- first_name: Kaushik
full_name: Mallik, Kaushik
id: 0834ff3c-6d72-11ec-94e0-b5b0a4fb8598
last_name: Mallik
orcid: 0000-0001-9864-7475
citation:
ama: 'Henzinger TA, Karimi M, Kueffner K, Mallik K. Monitoring algorithmic fairness.
In: Computer Aided Verification. Vol 13965. Springer Nature; 2023:358–382.
doi:10.1007/978-3-031-37703-7_17'
apa: 'Henzinger, T. A., Karimi, M., Kueffner, K., & Mallik, K. (2023). Monitoring
algorithmic fairness. In Computer Aided Verification (Vol. 13965, pp. 358–382).
Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-37703-7_17'
chicago: Henzinger, Thomas A, Mahyar Karimi, Konstantin Kueffner, and Kaushik Mallik.
“Monitoring Algorithmic Fairness.” In Computer Aided Verification, 13965:358–382.
Springer Nature, 2023. https://doi.org/10.1007/978-3-031-37703-7_17.
ieee: T. A. Henzinger, M. Karimi, K. Kueffner, and K. Mallik, “Monitoring algorithmic
fairness,” in Computer Aided Verification, Paris, France, 2023, vol. 13965,
pp. 358–382.
ista: 'Henzinger TA, Karimi M, Kueffner K, Mallik K. 2023. Monitoring algorithmic
fairness. Computer Aided Verification. CAV: Computer Aided Verification, LNCS,
vol. 13965, 358–382.'
mla: Henzinger, Thomas A., et al. “Monitoring Algorithmic Fairness.” Computer
Aided Verification, vol. 13965, Springer Nature, 2023, pp. 358–382, doi:10.1007/978-3-031-37703-7_17.
short: T.A. Henzinger, M. Karimi, K. Kueffner, K. Mallik, in:, Computer Aided Verification,
Springer Nature, 2023, pp. 358–382.
conference:
end_date: 2023-07-22
location: Paris, France
name: 'CAV: Computer Aided Verification'
start_date: 2023-07-17
date_created: 2023-07-25T18:32:40Z
date_published: 2023-07-18T00:00:00Z
date_updated: 2023-09-05T15:14:00Z
day: '18'
ddc:
- '000'
department:
- _id: GradSch
- _id: ToHe
doi: 10.1007/978-3-031-37703-7_17
ec_funded: 1
external_id:
arxiv:
- '2305.15979'
file:
- access_level: open_access
checksum: ccaf94bf7d658ba012c016e11869b54c
content_type: application/pdf
creator: dernst
date_created: 2023-07-31T08:11:20Z
date_updated: 2023-07-31T08:11:20Z
file_id: '13327'
file_name: 2023_LNCS_CAV_HenzingerT.pdf
file_size: 647760
relation: main_file
success: 1
file_date_updated: 2023-07-31T08:11:20Z
has_accepted_license: '1'
intvolume: ' 13965'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 358–382
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: Computer Aided Verification
publication_identifier:
eisbn:
- '9783031377037'
eissn:
- 1611-3349
isbn:
- '9783031377020'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Monitoring algorithmic fairness
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 13965
year: '2023'
...
---
_id: '13314'
abstract:
- lang: eng
text: The emergence of large-scale order in self-organized systems relies on local
interactions between individual components. During bacterial cell division, FtsZ—a
prokaryotic homologue of the eukaryotic protein tubulin—polymerizes into treadmilling
filaments that further organize into a cytoskeletal ring. In vitro, FtsZ filaments
can form dynamic chiral assemblies. However, how the active and passive properties
of individual filaments relate to these large-scale self-organized structures
remains poorly understood. Here we connect single-filament properties with the
mesoscopic scale by combining minimal active matter simulations and biochemical
reconstitution experiments. We show that the density and flexibility of active
chiral filaments define their global order. At intermediate densities, curved,
flexible filaments organize into chiral rings and polar bands. An effectively
nematic organization dominates for high densities and for straight, mutant filaments
with increased rigidity. Our predicted phase diagram quantitatively captures these
features, demonstrating how the flexibility, density and chirality of the active
filaments affect their collective behaviour. Our findings shed light on the fundamental
properties of active chiral matter and explain how treadmilling FtsZ filaments
organize during bacterial cell division.
acknowledged_ssus:
- _id: Bio
- _id: LifeSc
acknowledgement: 'This work was supported by the European Research Council through
grant ERC 2015-StG-679239 and by the Austrian Science Fund (FWF) StandAlone P34607
to M.L., B. P.M. was also supported by the Kanazawa University WPI- NanoLSI Bio-SPM
collaborative research program. Z.D. has received funding from Doctoral Programme
of the Austrian Academy of Sciences (OeAW): Grant agreement 26360. We thank Jan
Brugues (MPI CBG, Dresden, Germany), Andela Saric (ISTA, Klosterneuburg, Austria),
Daniel Pearce (Uni Geneva, Switzerland) for valuable scientific input and comments
on the manuscript. We are also thankful for the support by the Scientific Service
Units (SSU) of IST Austria through resources provided by the Imaging and Optics
Facility (IOF) and the Lab Support Facility (LSF).'
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Zuzana
full_name: Dunajova, Zuzana
id: 4B39F286-F248-11E8-B48F-1D18A9856A87
last_name: Dunajova
- first_name: Batirtze
full_name: Prats Mateu, Batirtze
id: 299FE892-F248-11E8-B48F-1D18A9856A87
last_name: Prats Mateu
- first_name: Philipp
full_name: Radler, Philipp
id: 40136C2A-F248-11E8-B48F-1D18A9856A87
last_name: Radler
orcid: '0000-0001-9198-2182 '
- first_name: Keesiang
full_name: Lim, Keesiang
last_name: Lim
- first_name: Dörte
full_name: Brandis, Dörte
id: 21d64d35-f128-11eb-9611-b8bcca7a12fd
last_name: Brandis
- first_name: Philipp
full_name: Velicky, Philipp
id: 39BDC62C-F248-11E8-B48F-1D18A9856A87
last_name: Velicky
orcid: 0000-0002-2340-7431
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
- first_name: Richard W.
full_name: Wong, Richard W.
last_name: Wong
- first_name: Jens
full_name: Elgeti, Jens
last_name: Elgeti
- first_name: Edouard B
full_name: Hannezo, Edouard B
id: 3A9DB764-F248-11E8-B48F-1D18A9856A87
last_name: Hannezo
orcid: 0000-0001-6005-1561
- first_name: Martin
full_name: Loose, Martin
id: 462D4284-F248-11E8-B48F-1D18A9856A87
last_name: Loose
orcid: 0000-0001-7309-9724
citation:
ama: Dunajova Z, Prats Mateu B, Radler P, et al. Chiral and nematic phases of flexible
active filaments. Nature Physics. 2023;19:1916-1926. doi:10.1038/s41567-023-02218-w
apa: Dunajova, Z., Prats Mateu, B., Radler, P., Lim, K., Brandis, D., Velicky, P.,
… Loose, M. (2023). Chiral and nematic phases of flexible active filaments. Nature
Physics. Springer Nature. https://doi.org/10.1038/s41567-023-02218-w
chicago: Dunajova, Zuzana, Batirtze Prats Mateu, Philipp Radler, Keesiang Lim, Dörte
Brandis, Philipp Velicky, Johann G Danzl, et al. “Chiral and Nematic Phases of
Flexible Active Filaments.” Nature Physics. Springer Nature, 2023. https://doi.org/10.1038/s41567-023-02218-w.
ieee: Z. Dunajova et al., “Chiral and nematic phases of flexible active filaments,”
Nature Physics, vol. 19. Springer Nature, pp. 1916–1926, 2023.
ista: Dunajova Z, Prats Mateu B, Radler P, Lim K, Brandis D, Velicky P, Danzl JG,
Wong RW, Elgeti J, Hannezo EB, Loose M. 2023. Chiral and nematic phases of flexible
active filaments. Nature Physics. 19, 1916–1926.
mla: Dunajova, Zuzana, et al. “Chiral and Nematic Phases of Flexible Active Filaments.”
Nature Physics, vol. 19, Springer Nature, 2023, pp. 1916–26, doi:10.1038/s41567-023-02218-w.
short: Z. Dunajova, B. Prats Mateu, P. Radler, K. Lim, D. Brandis, P. Velicky, J.G.
Danzl, R.W. Wong, J. Elgeti, E.B. Hannezo, M. Loose, Nature Physics 19 (2023)
1916–1926.
date_created: 2023-07-27T14:44:45Z
date_published: 2023-12-01T00:00:00Z
date_updated: 2024-02-21T12:19:08Z
day: '01'
ddc:
- '530'
department:
- _id: JoDa
- _id: EdHa
- _id: MaLo
- _id: GradSch
doi: 10.1038/s41567-023-02218-w
ec_funded: 1
external_id:
pmid:
- '38075437'
file:
- access_level: open_access
checksum: bc7673ca07d37309013a86166577b2f7
content_type: application/pdf
creator: dernst
date_created: 2024-01-30T14:28:30Z
date_updated: 2024-01-30T14:28:30Z
file_id: '14916'
file_name: 2023_NaturePhysics_Dunajova.pdf
file_size: 22471673
relation: main_file
success: 1
file_date_updated: 2024-01-30T14:28:30Z
has_accepted_license: '1'
intvolume: ' 19'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 1916-1926
pmid: 1
project:
- _id: 2595697A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '679239'
name: Self-Organization of the Bacterial Cell
- _id: fc38323b-9c52-11eb-aca3-ff8afb4a011d
grant_number: P34607
name: "Understanding bacterial cell division by in vitro\r\nreconstitution"
- _id: 34d75525-11ca-11ed-8bc3-89b6307fee9d
grant_number: '26360'
name: Motile active matter models of migrating cells and chiral filaments
publication: Nature Physics
publication_identifier:
eissn:
- 1745-2481
issn:
- 1745-2473
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '13116'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Chiral and nematic phases of flexible active filaments
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 19
year: '2023'
...
---
_id: '13331'
abstract:
- lang: eng
text: "The extension of extremal combinatorics to the setting of exterior algebra
is a work\r\nin progress that gained attention recently. In this thesis, we study
the combinatorial structure of exterior algebra by introducing a dictionary that
translates the notions from the set systems into the framework of exterior algebra.
We show both generalizations of celebrated Erdös--Ko--Rado theorem and Hilton--Milner
theorem to the setting of exterior algebra in the simplest non-trivial case of
two-forms.\r\n"
alternative_title:
- ISTA Master's Thesis
article_processing_charge: No
author:
- first_name: Seyda
full_name: Köse, Seyda
id: 8ba3170d-dc85-11ea-9058-c4251c96a6eb
last_name: Köse
citation:
ama: Köse S. Exterior algebra and combinatorics. 2023. doi:10.15479/at:ista:13331
apa: Köse, S. (2023). Exterior algebra and combinatorics. Institute of Science
and Technology Austria. https://doi.org/10.15479/at:ista:13331
chicago: Köse, Seyda. “Exterior Algebra and Combinatorics.” Institute of Science
and Technology Austria, 2023. https://doi.org/10.15479/at:ista:13331.
ieee: S. Köse, “Exterior algebra and combinatorics,” Institute of Science and Technology
Austria, 2023.
ista: Köse S. 2023. Exterior algebra and combinatorics. Institute of Science and
Technology Austria.
mla: Köse, Seyda. Exterior Algebra and Combinatorics. Institute of Science
and Technology Austria, 2023, doi:10.15479/at:ista:13331.
short: S. Köse, Exterior Algebra and Combinatorics, Institute of Science and Technology
Austria, 2023.
date_created: 2023-07-31T10:20:55Z
date_published: 2023-07-31T00:00:00Z
date_updated: 2023-10-04T11:54:56Z
day: '31'
ddc:
- '510'
- '516'
degree_awarded: MS
department:
- _id: GradSch
- _id: UlWa
doi: 10.15479/at:ista:13331
file:
- access_level: closed
checksum: 96ee518d796d02af71395622c45de03c
content_type: application/x-zip-compressed
creator: skoese
date_created: 2023-07-31T10:16:32Z
date_updated: 2023-07-31T10:16:32Z
file_id: '13333'
file_name: Exterior Algebra and Combinatorics.zip
file_size: 28684
relation: source_file
- access_level: open_access
checksum: f610f4713f88bc477de576aaa46b114e
content_type: application/pdf
creator: skoese
date_created: 2023-08-03T15:28:55Z
date_updated: 2023-08-03T15:28:55Z
file_id: '13480'
file_name: thesis-pdfa.pdf
file_size: 4953418
relation: main_file
success: 1
file_date_updated: 2023-08-03T15:28:55Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '26'
publication_identifier:
issn:
- 2791-4585
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '12680'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
title: Exterior algebra and combinatorics
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2023'
...
---
_id: '13984'
abstract:
- lang: eng
text: "Social insects fight disease using their individual immune systems and the
cooperative\r\nsanitary behaviors of colony members. These social defenses are
well explored against\r\nexternally-infecting pathogens, but little is known about
defense strategies against\r\ninternally-infecting pathogens, such as viruses.
Viruses are ubiquitous and in the last decades\r\nit has become evident that also
many ant species harbor viruses. We present one of the first\r\nstudies addressing
transmission dynamics and collective disease defenses against viruses in\r\nants
on a mechanistic level. I successfully established an experimental ant host –
viral\r\npathogen system as a model for the defense strategies used by social
insects against internal\r\npathogen infections, as outlined in the third chapter.
In particular, we studied how garden ants\r\n(Lasius neglectus) defend themselves
and their colonies against the generalist insect virus\r\nCrPV (cricket paralysis
virus). We chose microinjections of virus directly into the ants’\r\nhemolymph
because it allowed us to use a defined exposure dose. Here we show that this is
a\r\ngood model system, as the virus is replicating and thus infecting the host.
The ants mount a\r\nclear individual immune response against the viral infection,
which is characterized by a\r\nspecific siRNA pattern, namely siRNAs mapping against
the viral genome with a peak of 21\r\nand 22 bp long fragments. The onset of this
immune response is consistent with the timeline\r\nof viral replication that starts
already within two days post injection. The disease manifests in\r\ndecreased
survival over a course of two to three weeks.\r\nRegarding group living, we find
that infected ants show a strong individual immune response,\r\nbut that their
course of disease is little affected by nestmate presence, as described in chapter\r\nfour.
Hence, we do not find social immunity in the context of viral infections in ants.\r\nNestmates,
however, can contract the virus. Using Drosophila S2R+ cells in culture, we\r\nshowed
that 94 % of the nestmates contract active virus within four days of social contact
to\r\nan infected individual. Virus is transmitted in low doses, thus not causing
disease\r\ntransmission within the colony. While virus can be transmitted during
short direct contacts,\r\nwe also assume transmission from deceased ants and show
that the nestmates’ immune\r\nsystem gets activated after contracting a low viral
dose. We find considerable potential for\r\nindirect transmission via the nest
space. Virus is shed to the nest, where it stays viable for one\r\nweek and is
also picked up by other ants. Apart from that, we want to underline the potential\r\nof
ant poison as antiviral agent. We determined that ant poison successfully inactivates
CrPV\r\nin vitro. However, we found no evidence for effective poison use to sanitize
the nest space.\r\nOn the other hand, local application of ant poison by oral
poison uptake, which is part of the\r\nants prophylactic behavioral repertoire,
probably contributes to keeping the gut of each\r\nindividual sanitized. We hypothesize
that oral poison uptake might be the reason why we did\r\nnot find viable virus
in the trophallactic fluid.\r\nThe fifth chapter encompasses preliminary data
on potential social immunization. However,\r\nour experiments do not confirm an
actual survival benefit for the nestmates upon pathogen\r\nchallenge under the
given experimental settings. Nevertheless, we do not want to rule out the\r\npossibility
for nestmate immunization, but rather emphasize that considering different\r\nexperimental
timelines and viral doses would provide a multitude of options for follow-up\r\nexperiments.\r\nIn
conclusion, we find that prophylactic individual behaviors, such as oral poison
uptake,\r\nmight play a role in preventing viral disease transmission. Compared
to colony defense\r\nagainst external pathogens, internal pathogen infections
require a stronger component of\r\nindividual physiological immunity than behavioral
social immunity, yet could still lead to\r\ncollective protection."
acknowledged_ssus:
- _id: LifeSc
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Anna
full_name: Franschitz, Anna
id: 480826C8-F248-11E8-B48F-1D18A9856A87
last_name: Franschitz
citation:
ama: Franschitz A. Individual and social immunity against viral infections in ants.
2023. doi:10.15479/at:ista:13984
apa: Franschitz, A. (2023). Individual and social immunity against viral infections
in ants. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:13984
chicago: Franschitz, Anna. “Individual and Social Immunity against Viral Infections
in Ants.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:13984.
ieee: A. Franschitz, “Individual and social immunity against viral infections in
ants,” Institute of Science and Technology Austria, 2023.
ista: Franschitz A. 2023. Individual and social immunity against viral infections
in ants. Institute of Science and Technology Austria.
mla: Franschitz, Anna. Individual and Social Immunity against Viral Infections
in Ants. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:13984.
short: A. Franschitz, Individual and Social Immunity against Viral Infections in
Ants, Institute of Science and Technology Austria, 2023.
date_created: 2023-08-08T15:33:29Z
date_published: 2023-08-08T00:00:00Z
date_updated: 2024-03-01T15:25:17Z
day: '08'
ddc:
- '570'
- '577'
degree_awarded: PhD
department:
- _id: GradSch
- _id: SyCr
doi: 10.15479/at:ista:13984
file:
- access_level: closed
checksum: 27220243d5d51c3b0d7d61c0879d7a0c
content_type: application/pdf
creator: afransch
date_created: 2023-08-08T18:01:28Z
date_updated: 2024-03-01T08:51:42Z
embargo: 2024-08-08
embargo_to: open_access
file_id: '13986'
file_name: Thesis_AnnaFranschitz_202308.pdf
file_size: 10797612
relation: main_file
- access_level: closed
checksum: 40abf7ccca14a3893f72dc7fb88585d6
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: afransch
date_created: 2023-08-08T18:02:25Z
date_updated: 2023-08-09T07:25:27Z
file_id: '13987'
file_name: Thesis_AnnaFranschitz_202308.docx
file_size: 2619085
relation: source_file
- access_level: closed
checksum: 8b991ecc2d59d045cc3cf0d676785ec7
content_type: application/pdf
creator: cchlebak
date_created: 2024-03-01T08:37:15Z
date_updated: 2024-03-01T12:13:29Z
description: Minor modifications and clarifications - Feb 2024
embargo: 2024-08-08
embargo_to: open_access
file_id: '15042'
file_name: Addendum_AnnaFranschitz202402.pdf
file_size: 85956
relation: erratum
title: Addendum
- access_level: closed
checksum: 66745aa01f960f17472c024875c049ed
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: cchlebak
date_created: 2024-03-01T08:39:20Z
date_updated: 2024-03-01T08:51:42Z
file_id: '15043'
file_name: Addendum_AnnaFranschitz202402.docx
file_size: 11818
relation: source_file
title: Addendum - source file
- access_level: closed
checksum: 55c876b73d49db15228a7f571592ec77
content_type: application/pdf
creator: cchlebak
date_created: 2024-03-01T08:56:06Z
date_updated: 2024-03-01T12:58:14Z
description: For printing purposes
file_id: '15044'
file_name: Print_Version_Franschitz_Anna_Thesis.pdf
file_size: 10416761
relation: other
title: Print Version
file_date_updated: 2024-03-01T12:58:14Z
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa_version: Published Version
page: '89'
publication_identifier:
isbn:
- 978-3-99078-034-3
issn:
- 2663 - 337X
publication_status: published
publisher: Institute of Science and Technology Austria
status: public
supervisor:
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
title: Individual and social immunity against viral infections in ants
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2023'
...