---
_id: '7396'
abstract:
- lang: eng
text: The angular momentum of molecules, or, equivalently, their rotation in three-dimensional
space, is ideally suited for quantum control. Molecular angular momentum is naturally
quantized, time evolution is governed by a well-known Hamiltonian with only a
few accurately known parameters, and transitions between rotational levels can
be driven by external fields from various parts of the electromagnetic spectrum.
Control over the rotational motion can be exerted in one-, two-, and many-body
scenarios, thereby allowing one to probe Anderson localization, target stereoselectivity
of bimolecular reactions, or encode quantum information to name just a few examples.
The corresponding approaches to quantum control are pursued within separate, and
typically disjoint, subfields of physics, including ultrafast science, cold collisions,
ultracold gases, quantum information science, and condensed-matter physics. It
is the purpose of this review to present the various control phenomena, which
all rely on the same underlying physics, within a unified framework. To this end,
recall the Hamiltonian for free rotations, assuming the rigid rotor approximation
to be valid, and summarize the different ways for a rotor to interact with external
electromagnetic fields. These interactions can be exploited for control—from achieving
alignment, orientation, or laser cooling in a one-body framework, steering bimolecular
collisions, or realizing a quantum computer or quantum simulator in the many-body
setting.
article_number: '035005 '
article_processing_charge: No
article_type: original
author:
- first_name: Christiane P.
full_name: Koch, Christiane P.
last_name: Koch
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
- first_name: Dominique
full_name: Sugny, Dominique
last_name: Sugny
citation:
ama: Koch CP, Lemeshko M, Sugny D. Quantum control of molecular rotation. Reviews
of Modern Physics. 2019;91(3). doi:10.1103/revmodphys.91.035005
apa: Koch, C. P., Lemeshko, M., & Sugny, D. (2019). Quantum control of molecular
rotation. Reviews of Modern Physics. American Physical Society. https://doi.org/10.1103/revmodphys.91.035005
chicago: Koch, Christiane P., Mikhail Lemeshko, and Dominique Sugny. “Quantum Control
of Molecular Rotation.” Reviews of Modern Physics. American Physical Society,
2019. https://doi.org/10.1103/revmodphys.91.035005.
ieee: C. P. Koch, M. Lemeshko, and D. Sugny, “Quantum control of molecular rotation,”
Reviews of Modern Physics, vol. 91, no. 3. American Physical Society, 2019.
ista: Koch CP, Lemeshko M, Sugny D. 2019. Quantum control of molecular rotation.
Reviews of Modern Physics. 91(3), 035005.
mla: Koch, Christiane P., et al. “Quantum Control of Molecular Rotation.” Reviews
of Modern Physics, vol. 91, no. 3, 035005, American Physical Society, 2019,
doi:10.1103/revmodphys.91.035005.
short: C.P. Koch, M. Lemeshko, D. Sugny, Reviews of Modern Physics 91 (2019).
date_created: 2020-01-29T16:04:19Z
date_published: 2019-09-18T00:00:00Z
date_updated: 2024-02-28T13:15:33Z
day: '18'
department:
- _id: MiLe
doi: 10.1103/revmodphys.91.035005
external_id:
arxiv:
- '1810.11338'
isi:
- '000486661700001'
intvolume: ' 91'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1810.11338
month: '09'
oa: 1
oa_version: Preprint
project:
- _id: 26031614-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P29902
name: Quantum rotations in the presence of a many-body environment
publication: Reviews of Modern Physics
publication_identifier:
eissn:
- 1539-0756
issn:
- 0034-6861
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quantum control of molecular rotation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 91
year: '2019'
...
---
_id: '7606'
abstract:
- lang: eng
text: We derive a tight lower bound on equivocation (conditional entropy), or equivalently
a tight upper bound on mutual information between a signal variable and channel
outputs. The bound is in terms of the joint distribution of the signals and maximum
a posteriori decodes (most probable signals given channel output). As part of
our derivation, we describe the key properties of the distribution of signals,
channel outputs and decodes, that minimizes equivocation and maximizes mutual
information. This work addresses a problem in data analysis, where mutual information
between signals and decodes is sometimes used to lower bound the mutual information
between signals and channel outputs. Our result provides a corresponding upper
bound.
article_number: '8989292'
article_processing_charge: No
author:
- first_name: Michal
full_name: Hledik, Michal
id: 4171253A-F248-11E8-B48F-1D18A9856A87
last_name: Hledik
- first_name: Thomas R
full_name: Sokolowski, Thomas R
id: 3E999752-F248-11E8-B48F-1D18A9856A87
last_name: Sokolowski
orcid: 0000-0002-1287-3779
- first_name: Gašper
full_name: Tkačik, Gašper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkačik
orcid: 0000-0002-6699-1455
citation:
ama: 'Hledik M, Sokolowski TR, Tkačik G. A tight upper bound on mutual information.
In: IEEE Information Theory Workshop, ITW 2019. IEEE; 2019. doi:10.1109/ITW44776.2019.8989292'
apa: 'Hledik, M., Sokolowski, T. R., & Tkačik, G. (2019). A tight upper bound
on mutual information. In IEEE Information Theory Workshop, ITW 2019. Visby,
Sweden: IEEE. https://doi.org/10.1109/ITW44776.2019.8989292'
chicago: Hledik, Michal, Thomas R Sokolowski, and Gašper Tkačik. “A Tight Upper
Bound on Mutual Information.” In IEEE Information Theory Workshop, ITW 2019.
IEEE, 2019. https://doi.org/10.1109/ITW44776.2019.8989292.
ieee: M. Hledik, T. R. Sokolowski, and G. Tkačik, “A tight upper bound on mutual
information,” in IEEE Information Theory Workshop, ITW 2019, Visby, Sweden,
2019.
ista: Hledik M, Sokolowski TR, Tkačik G. 2019. A tight upper bound on mutual information.
IEEE Information Theory Workshop, ITW 2019. Information Theory Workshop, 8989292.
mla: Hledik, Michal, et al. “A Tight Upper Bound on Mutual Information.” IEEE
Information Theory Workshop, ITW 2019, 8989292, IEEE, 2019, doi:10.1109/ITW44776.2019.8989292.
short: M. Hledik, T.R. Sokolowski, G. Tkačik, in:, IEEE Information Theory Workshop,
ITW 2019, IEEE, 2019.
conference:
end_date: 2019-08-28
location: Visby, Sweden
name: Information Theory Workshop
start_date: 2019-08-25
date_created: 2020-03-22T23:00:47Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2024-03-06T14:22:51Z
day: '01'
department:
- _id: GaTk
doi: 10.1109/ITW44776.2019.8989292
ec_funded: 1
external_id:
arxiv:
- '1812.01475'
isi:
- '000540384500015'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1812.01475
month: '08'
oa: 1
oa_version: Preprint
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: IEEE Information Theory Workshop, ITW 2019
publication_identifier:
isbn:
- '9781538669006'
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '15020'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: A tight upper bound on mutual information
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '6933'
abstract:
- lang: eng
text: "We design fast deterministic algorithms for distance computation in the CONGESTED
CLIQUE model. Our key contributions include:\r\n\r\n - A (2+ε)-approximation for
all-pairs shortest paths problem in O(log²n / ε) rounds on unweighted undirected
graphs. With a small additional additive factor, this also applies for weighted
graphs. This is the first sub-polynomial constant-factor approximation for APSP
in this model.\r\n - A (1+ε)-approximation for multi-source shortest paths problem
from O(√n) sources in O(log² n / ε) rounds on weighted undirected graphs. This
is the first sub-polynomial algorithm obtaining this approximation for a set of
sources of polynomial size.\r\n\r\nOur main techniques are new distance tools
that are obtained via improved algorithms for sparse matrix multiplication, which
we leverage to construct efficient hopsets and shortest paths. Furthermore, our
techniques extend to additional distance problems for which we improve upon the
state-of-the-art, including diameter approximation, and an exact single-source
shortest paths algorithm for weighted undirected graphs in Õ(n^{1/6}) rounds."
article_processing_charge: No
author:
- first_name: Keren
full_name: Censor-Hillel, Keren
last_name: Censor-Hillel
- first_name: Michal
full_name: Dory, Michal
last_name: Dory
- first_name: Janne
full_name: Korhonen, Janne
id: C5402D42-15BC-11E9-A202-CA2BE6697425
last_name: Korhonen
- first_name: Dean
full_name: Leitersdorf, Dean
last_name: Leitersdorf
citation:
ama: 'Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. Fast approximate shortest
paths in the congested clique. In: Proceedings of the 2019 ACM Symposium on
Principles of Distributed Computin. ACM; 2019:74-83. doi:10.1145/3293611.3331633'
apa: 'Censor-Hillel, K., Dory, M., Korhonen, J., & Leitersdorf, D. (2019). Fast
approximate shortest paths in the congested clique. In Proceedings of the 2019
ACM Symposium on Principles of Distributed Computin (pp. 74–83). Toronto,
ON, Canada: ACM. https://doi.org/10.1145/3293611.3331633'
chicago: Censor-Hillel, Keren, Michal Dory, Janne Korhonen, and Dean Leitersdorf.
“Fast Approximate Shortest Paths in the Congested Clique.” In Proceedings of
the 2019 ACM Symposium on Principles of Distributed Computin, 74–83. ACM,
2019. https://doi.org/10.1145/3293611.3331633.
ieee: K. Censor-Hillel, M. Dory, J. Korhonen, and D. Leitersdorf, “Fast approximate
shortest paths in the congested clique,” in Proceedings of the 2019 ACM Symposium
on Principles of Distributed Computin, Toronto, ON, Canada, 2019, pp. 74–83.
ista: 'Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. 2019. Fast approximate
shortest paths in the congested clique. Proceedings of the 2019 ACM Symposium
on Principles of Distributed Computin. PODC: Symposium on Principles of Distributed
Computing, 74–83.'
mla: Censor-Hillel, Keren, et al. “Fast Approximate Shortest Paths in the Congested
Clique.” Proceedings of the 2019 ACM Symposium on Principles of Distributed
Computin, ACM, 2019, pp. 74–83, doi:10.1145/3293611.3331633.
short: K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, in:, Proceedings
of the 2019 ACM Symposium on Principles of Distributed Computin, ACM, 2019, pp.
74–83.
conference:
end_date: 2019-08-02
location: Toronto, ON, Canada
name: 'PODC: Symposium on Principles of Distributed Computing'
start_date: 2019-07-29
date_created: 2019-10-08T12:48:42Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2024-03-07T14:43:38Z
day: '01'
department:
- _id: DaAl
doi: 10.1145/3293611.3331633
external_id:
arxiv:
- '1903.05956'
isi:
- '000570442000011'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1903.05956
month: '08'
oa: 1
oa_version: Preprint
page: 74-83
publication: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin
publication_identifier:
isbn:
- '9781450362177'
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
record:
- id: '7939'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Fast approximate shortest paths in the congested clique
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2019'
...
---
_id: '6392'
abstract:
- lang: eng
text: "The regulation of gene expression is one of the most fundamental processes
in living systems. In recent years, thanks to advances in sequencing technology
and automation, it has become possible to study gene expression quantitatively,
genome-wide and in high-throughput. This leads to the possibility of exploring
changes in gene expression in the context of many external perturbations and their
combinations, and thus of characterising the basic principles governing gene regulation.
In this thesis, I present quantitative experimental approaches to studying transcriptional
and protein level changes in response to combinatorial drug treatment, as well
as a theoretical data-driven approach to analysing thermodynamic principles guiding
transcription of protein coding genes. \r\nIn the first part of this work, I
present a novel methodological framework for quantifying gene expression changes
in drug combinations, termed isogrowth profiling. External perturbations through
small molecule drugs influence the growth rate of the cell, leading to wide-ranging
changes in cellular physiology and gene expression. This confounds the gene expression
changes specifically elicited by the particular drug. Combinatorial perturbations,
owing to the increased stress they exert, influence the growth rate even more
strongly and hence suffer the convolution problem to a greater extent when measuring
gene expression changes. Isogrowth profiling is a way to experimentally abstract
non-specific, growth rate related changes, by performing the measurement using
varying ratios of two drugs at such concentrations that the overall inhibition
rate is constant. Using a robotic setup for automated high-throughput re-dilution
culture of Saccharomyces cerevisiae, the budding yeast, I investigate all pairwise
interactions of four small molecule drugs through sequencing RNA along a growth
isobole. Through principal component analysis, I demonstrate here that isogrowth
profiling can uncover drug-specific as well as drug-interaction-specific gene
expression changes. I show that drug-interaction-specific gene expression changes
can be used for prediction of higher-order drug interactions. I propose a simplified
generalised framework of isogrowth profiling, with few measurements needed for
each drug pair, enabling the broad application of isogrowth profiling to high-throughput
screening of inhibitors of cellular growth and beyond. Such high-throughput screenings
of gene expression changes specific to pairwise drug interactions will be instrumental
for predicting the higher-order interactions of the drugs.\r\n\r\nIn the second
part of this work, I extend isogrowth profiling to single-cell measurements of
gene expression, characterising population heterogeneity in the budding yeast
in response to combinatorial drug perturbation while controlling for non-specific
growth rate effects. Through flow cytometry of strains with protein products fused
to green fluorescent protein, I discover multiple proteins with bi-modally distributed
expression levels in the population in response to drug treatment. I characterize
more closely the effect of an ionic stressor, lithium chloride, and find that
it inhibits the splicing of mRNA, most strongly affecting ribosomal protein transcripts
and leading to a bi-stable behaviour of a small ribosomal subunit protein Rps22B.
Time-lapse microscopy of a microfluidic culture system revealed that the induced
Rps22B heterogeneity leads to preferential survival of Rps22B-low cells after
long starvation, but to preferential proliferation of Rps22B-high cells after
short starvation. Overall, this suggests that yeast cells might use splicing of
ribosomal genes for bet-hedging in fluctuating environments. I give specific examples
of how further exploration of cellular heterogeneity in yeast in response to external
perturbation has the potential to reveal yet-undiscovered gene regulation circuitry.\r\n\r\nIn
the last part of this thesis, a re-analysis of a published sequencing dataset
of nascent elongating transcripts is used to characterise the thermodynamic constraints
for RNA polymerase II (RNAP) elongation. Population-level data on RNAP position
throughout the transcribed genome with single nucleotide resolution are used to
infer the sequence specific thermodynamic determinants of RNAP pausing and backtracking.
This analysis reveals that the basepairing strength of the eight nucleotide-long
RNA:DNA duplex relative to the basepairing strength of the same sequence when
in DNA:DNA duplex, and the change in this quantity during RNA polymerase movement,
is the key determinant of RNAP pausing. This is true for RNAP pausing while elongating,
but also of RNAP pausing while backtracking and of the backtracking length. The
quantitative dependence of RNAP pausing on basepairing energetics is used to infer
the increase in pausing due to transcriptional mismatches, leading to a hypothesis
that pervasive RNA polymerase II pausing is due to basepairing energetics, as
an evolutionary cost for increased RNA polymerase II fidelity.\r\n\r\nThis work
advances our understanding of the general principles governing gene expression,
with the goal of making computational predictions of single-cell gene expression
responses to combinatorial perturbations based on the individual perturbations
possible. This ability would substantially facilitate the design of drug combination
treatments and, in the long term, lead to our increased ability to more generally
design targeted manipulations to any biological system. "
acknowledged_ssus:
- _id: LifeSc
- _id: M-Shop
- _id: Bio
alternative_title:
- IST Austria Thesis
author:
- first_name: Martin
full_name: Lukacisin, Martin
id: 298FFE8C-F248-11E8-B48F-1D18A9856A87
last_name: Lukacisin
orcid: 0000-0001-6549-4177
citation:
ama: Lukacisin M. Quantitative investigation of gene expression principles through
combinatorial drug perturbation and theory. 2019. doi:10.15479/AT:ISTA:6392
apa: Lukacisin, M. (2019). Quantitative investigation of gene expression principles
through combinatorial drug perturbation and theory. IST Austria. https://doi.org/10.15479/AT:ISTA:6392
chicago: Lukacisin, Martin. “Quantitative Investigation of Gene Expression Principles
through Combinatorial Drug Perturbation and Theory.” IST Austria, 2019. https://doi.org/10.15479/AT:ISTA:6392.
ieee: M. Lukacisin, “Quantitative investigation of gene expression principles through
combinatorial drug perturbation and theory,” IST Austria, 2019.
ista: Lukacisin M. 2019. Quantitative investigation of gene expression principles
through combinatorial drug perturbation and theory. IST Austria.
mla: Lukacisin, Martin. Quantitative Investigation of Gene Expression Principles
through Combinatorial Drug Perturbation and Theory. IST Austria, 2019, doi:10.15479/AT:ISTA:6392.
short: M. Lukacisin, Quantitative Investigation of Gene Expression Principles through
Combinatorial Drug Perturbation and Theory, IST Austria, 2019.
date_created: 2019-05-09T19:53:00Z
date_published: 2019-05-09T00:00:00Z
date_updated: 2023-09-22T09:19:41Z
day: '09'
ddc:
- '570'
department:
- _id: ToBo
doi: 10.15479/AT:ISTA:6392
extern: '1'
file:
- access_level: closed
checksum: 829bda074444857c7935171237bb7c0c
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: mlukacisin
date_created: 2019-05-10T13:51:49Z
date_updated: 2020-07-14T12:47:29Z
embargo_to: open_access
file_id: '6409'
file_name: Thesis_Draft_v3.4Final.docx
file_size: 43740796
relation: hidden
- access_level: open_access
checksum: 56cb5e97f5f8fc41692401b53832d8e0
content_type: application/pdf
creator: mlukacisin
date_created: 2019-05-10T14:13:42Z
date_updated: 2021-02-11T11:17:16Z
embargo: 2020-04-17
file_id: '6410'
file_name: Thesis_Draft_v3.4FinalA.pdf
file_size: 35228388
relation: main_file
file_date_updated: 2021-02-11T11:17:16Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '103'
publication_identifier:
isbn:
- 978-3-99078-001-5
issn:
- 2663-337X
publication_status: published
publisher: IST Austria
related_material:
record:
- id: '1029'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Mark Tobias
full_name: Bollenbach, Mark Tobias
id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
last_name: Bollenbach
orcid: 0000-0003-4398-476X
title: Quantitative investigation of gene expression principles through combinatorial
drug perturbation and theory
type: dissertation
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '6435'
abstract:
- lang: eng
text: "Social insect colonies tend to have numerous members which function together
like a single organism in such harmony that the term ``super-organism'' is often
used. In this analogy the reproductive caste is analogous to the primordial germ\r\ncells
of a metazoan, while the sterile worker caste corresponds to somatic cells. The
worker castes, like tissues, are\r\nin charge of all functions of a living being,
besides reproduction. The establishment of new super-organismal units\r\n(i.e.
new colonies) is accomplished by the co-dependent castes. The term oftentimes
goes beyond a metaphor. We invoke it when we speak about the metabolic rate, thermoregulation,
nutrient regulation and gas exchange of a social insect colony. Furthermore, we
assert that the super-organism has an immune system, and benefits from ``social
immunity''.\r\n\r\nSocial immunity was first summoned by evolutionary biologists
to resolve the apparent discrepancy between the expected high frequency of disease
outbreak amongst numerous, closely related tightly-interacting hosts, living in
stable and microbially-rich environments, against the exceptionally scarce epidemic
accounts in natural populations. Social\r\nimmunity comprises a multi-layer assembly
of behaviours which have evolved to effectively keep the pathogenic enemies of
a colony at bay. The field of social immunity has drawn interest, as it becomes
increasingly urgent to stop\r\nthe collapse of pollinator species and curb the
growth of invasive pests. In the past decade, several mechanisms of\r\nsocial
immune responses have been dissected, but many more questions remain open.\r\n\r\nI
present my work in two experimental chapters. In the first, I use invasive garden
ants (*Lasius neglectus*) to study how pathogen load and its distribution among
nestmates affect the grooming response of the group. Any given group of ants will
carry out the same total grooming work, but will direct their grooming effort
towards individuals\r\ncarrying a relatively higher spore load. Contrary to expectation,
the highest risk of transmission does not stem from grooming highly contaminated
ants, but instead, we suggest that the grooming response likely minimizes spore
loss to the environment, reducing contamination from inadvertent pickup from the
substrate.\r\n\r\nThe second is a comparative developmental approach. I follow
black garden ant queens (*Lasius niger*) and their colonies from mating flight,
through hibernation for a year. Colonies which grow fast from the start, have
a lower chance of survival through hibernation, and those which survive grow at
a lower pace later. This is true for colonies of naive\r\nand challenged queens.
Early pathogen exposure of the queens changes colony dynamics in an unexpected
way: colonies from exposed queens are more likely to grow slowly and recover in
numbers only after they survive hibernation.\r\n\r\nIn addition to the two experimental
chapters, this thesis includes a co-authored published review on organisational\r\nimmunity,
where we enlist the experimental evidence and theoretical framework on which this
hypothesis is built,\r\nidentify the caveats and underline how the field is ripe
to overcome them. In a final chapter, I describe my part in\r\ntwo collaborative
efforts, one to develop an image-based tracker, and the second to develop a classifier
for ant\r\nbehaviour."
acknowledged_ssus:
- _id: Bio
- _id: ScienComp
- _id: M-Shop
- _id: LifeSc
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Barbara E
full_name: Casillas Perez, Barbara E
id: 351ED2AA-F248-11E8-B48F-1D18A9856A87
last_name: Casillas Perez
citation:
ama: Casillas Perez BE. Collective defenses of garden ants against a fungal pathogen.
2019. doi:10.15479/AT:ISTA:6435
apa: Casillas Perez, B. E. (2019). Collective defenses of garden ants against
a fungal pathogen. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6435
chicago: Casillas Perez, Barbara E. “Collective Defenses of Garden Ants against
a Fungal Pathogen.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6435.
ieee: B. E. Casillas Perez, “Collective defenses of garden ants against a fungal
pathogen,” Institute of Science and Technology Austria, 2019.
ista: Casillas Perez BE. 2019. Collective defenses of garden ants against a fungal
pathogen. Institute of Science and Technology Austria.
mla: Casillas Perez, Barbara E. Collective Defenses of Garden Ants against a
Fungal Pathogen. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6435.
short: B.E. Casillas Perez, Collective Defenses of Garden Ants against a Fungal
Pathogen, Institute of Science and Technology Austria, 2019.
date_created: 2019-05-13T08:58:35Z
date_published: 2019-05-07T00:00:00Z
date_updated: 2023-09-07T12:57:04Z
day: '07'
ddc:
- '570'
- '006'
- '578'
- '592'
degree_awarded: PhD
department:
- _id: SyCr
doi: 10.15479/AT:ISTA:6435
ec_funded: 1
file:
- access_level: open_access
checksum: 6daf2d2086111aa8fd3fbc919a3e2833
content_type: application/pdf
creator: casillas
date_created: 2019-05-13T09:16:20Z
date_updated: 2021-02-11T11:17:15Z
embargo: 2020-05-08
file_id: '6438'
file_name: tesisDoctoradoBC.pdf
file_size: 3895187
relation: main_file
- access_level: closed
checksum: 3d221aaff7559a7060230a1ff610594f
content_type: application/zip
creator: casillas
date_created: 2019-05-13T09:16:20Z
date_updated: 2020-07-14T12:47:30Z
embargo_to: open_access
file_id: '6439'
file_name: tesisDoctoradoBC.zip
file_size: 7365118
relation: source_file
file_date_updated: 2021-02-11T11:17:15Z
has_accepted_license: '1'
keyword:
- Social Immunity
- Sanitary care
- Social Insects
- Organisational Immunity
- Colony development
- Multi-target tracking
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '183'
project:
- _id: 2649B4DE-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '771402'
name: Epidemics in ant societies on a chip
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '1999'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Sylvia M
full_name: Cremer, Sylvia M
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
title: Collective defenses of garden ants against a fungal pathogen
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '6269'
abstract:
- lang: eng
text: 'Clathrin-Mediated Endocytosis (CME) is an aspect of cellular trafficking
that is constantly regulated for mediating developmental and physiological responses.
The main aim of my thesis is to decipher the basic mechanisms of CME and post-endocytic
trafficking in the whole multicellular organ systems of Arabidopsis. The first
chapter of my thesis describes the search for new components involved in CME.
Tandem affinity purification was conducted using CLC and its interacting partners
were identified. Amongst the identified proteins were the Auxilin-likes1 and 2
(Axl1/2), putative uncoating factors, for which we made a full functional analysis.
Over-expression of Axl1/2 causes extreme modifications in the dynamics of the
machinery proteins and inhibition of endocytosis altogether. However the loss
of function of the axl1/2 did not present any cellular or physiological phenotype,
meaning Auxilin-likes do not form the major uncoating machinery. The second chapter
of my thesis describes the establishment/utilisation of techniques to capture
the dynamicity and the complexity of CME and post-endocytic trafficking. We have
studied the development of endocytic pits at the PM – specifically, the mode of
membrane remodeling during pit development and the role of actin in it, given
plant cells possess high turgor pressure. Utilizing the improved z-resolution
of TIRF and VAEM techniques, we captured the time-lapse of the endocytic events
at the plasma membrane; and using particle detection software, we quantitatively
analysed all the endocytic trajectories in an unbiased way to obtain the endocytic
rate of the system. This together with the direct analysis of cargo internalisation
from the PM provided an estimate on the endocytic potential of the cell. We also
developed a methodology for ultrastructural analysis of different populations
of Clathrin-Coated Structures (CCSs) in both PM and endomembranes in unroofed
protoplasts. Structural analysis, together with the intensity profile of CCSs
at the PM show that the mode of CCP development at the PM follows ‘Constant curvature
model’; meaning that clathrin polymerisation energy is a major contributing factor
of membrane remodeling. In addition, other analyses clearly show that actin is
not required for membrane remodeling during invagination or any other step of
CCP development, despite the prevalent high turgor pressure. However, actin is
essential in orchestrating the post-endocytic trafficking of CCVs facilitating
the EE formation. We also observed that the uncoating process post-endocytosis
is not immediate; an alternative mechanism of uncoating – Sequential multi-step
process – functions in the cell. Finally we also looked at one of the important
physiological stimuli modulating the process – hormone, auxin. auxin has been
known to influence CME before. We have made a detailed study on the concentration-time
based effect of auxin on the machinery proteins, CCP development, and the specificity
of cargoes endocytosed. To this end, we saw no general effect of auxin on CME
at earlier time points. However, very low concentration of IAA, such as 50nM,
accelerates endocytosis of specifically PIN2 through CME. Such a tight regulatory
control with high specificity to PIN2 could be essential in modulating its polarity. '
acknowledged_ssus:
- _id: Bio
- _id: EM-Fac
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Madhumitha
full_name: Narasimhan, Madhumitha
id: 44BF24D0-F248-11E8-B48F-1D18A9856A87
last_name: Narasimhan
orcid: 0000-0002-8600-0671
citation:
ama: Narasimhan M. Clathrin-Mediated endocytosis, post-endocytic trafficking and
their regulatory controls in plants . 2019. doi:10.15479/at:ista:th1075
apa: Narasimhan, M. (2019). Clathrin-Mediated endocytosis, post-endocytic trafficking
and their regulatory controls in plants . Institute of Science and Technology
Austria. https://doi.org/10.15479/at:ista:th1075
chicago: Narasimhan, Madhumitha. “Clathrin-Mediated Endocytosis, Post-Endocytic
Trafficking and Their Regulatory Controls in Plants .” Institute of Science and
Technology Austria, 2019. https://doi.org/10.15479/at:ista:th1075.
ieee: M. Narasimhan, “Clathrin-Mediated endocytosis, post-endocytic trafficking
and their regulatory controls in plants ,” Institute of Science and Technology
Austria, 2019.
ista: Narasimhan M. 2019. Clathrin-Mediated endocytosis, post-endocytic trafficking
and their regulatory controls in plants . Institute of Science and Technology
Austria.
mla: Narasimhan, Madhumitha. Clathrin-Mediated Endocytosis, Post-Endocytic Trafficking
and Their Regulatory Controls in Plants . Institute of Science and Technology
Austria, 2019, doi:10.15479/at:ista:th1075.
short: M. Narasimhan, Clathrin-Mediated Endocytosis, Post-Endocytic Trafficking
and Their Regulatory Controls in Plants , Institute of Science and Technology
Austria, 2019.
date_created: 2019-04-09T14:37:06Z
date_published: 2019-02-04T00:00:00Z
date_updated: 2023-09-08T11:43:03Z
day: '04'
ddc:
- '575'
degree_awarded: PhD
department:
- _id: JiFr
doi: 10.15479/at:ista:th1075
file:
- access_level: open_access
checksum: c958f27dd752712886e7e2638b847a3c
content_type: video/x-msvideo
creator: dernst
date_created: 2019-04-09T14:35:18Z
date_updated: 2021-02-11T23:30:15Z
embargo: 2020-02-11
file_id: '6270'
file_name: Supplementary_movie_1.avi
file_size: 5402078
relation: main_file
- access_level: open_access
checksum: 8786fdc29c62987c0aad3c866a4d3691
content_type: video/x-msvideo
creator: dernst
date_created: 2019-04-09T14:35:18Z
date_updated: 2021-02-11T23:30:15Z
embargo: 2020-02-11
file_id: '6271'
file_name: 3.7_supplementary_movie_10.avi
file_size: 5927736
relation: main_file
- access_level: open_access
checksum: 25f784c5159d6f4d966b2f9b371ebaf6
content_type: video/x-msvideo
creator: dernst
date_created: 2019-04-09T14:35:18Z
date_updated: 2021-02-11T23:30:15Z
embargo: 2020-02-11
file_id: '6272'
file_name: 3.7_supplementary_movie_9.avi
file_size: 9570210
relation: main_file
- access_level: open_access
checksum: 917069272a7a08d1f38224d5e12765d6
content_type: video/x-msvideo
creator: dernst
date_created: 2019-04-09T14:35:18Z
date_updated: 2021-02-11T23:30:15Z
embargo: 2020-02-11
file_id: '6273'
file_name: 3.7_supplementary_movie_8.avi
file_size: 2827360
relation: main_file
- access_level: open_access
checksum: 81e74f5ca0ad70050504f18192236dc0
content_type: video/x-msvideo
creator: dernst
date_created: 2019-04-09T14:35:18Z
date_updated: 2021-02-11T23:30:15Z
embargo: 2020-02-11
file_id: '6274'
file_name: 3.7_supplementary_movie_7.avi
file_size: 5771410
relation: main_file
- access_level: open_access
checksum: 47eb37b27a2930252713924307ea8c6f
content_type: video/x-msvideo
creator: dernst
date_created: 2019-04-09T14:35:18Z
date_updated: 2021-02-11T23:30:15Z
embargo: 2020-02-11
file_id: '6275'
file_name: 3.7_supplementary_movie_6.avi
file_size: 1113486
relation: main_file
- access_level: open_access
checksum: f68f66721041ce84e331959c9a5779c3
content_type: video/x-msvideo
creator: dernst
date_created: 2019-04-09T14:35:18Z
date_updated: 2021-02-11T23:30:15Z
embargo: 2020-02-11
file_id: '6276'
file_name: 3.7_supplementary_movie_5.avi
file_size: 1057232
relation: main_file
- access_level: open_access
checksum: 67c01cefab51b363c5e214fe4cd671f3
content_type: video/x-msvideo
creator: dernst
date_created: 2019-04-09T14:35:23Z
date_updated: 2021-02-11T23:30:15Z
embargo: 2020-02-11
file_id: '6277'
file_name: 3.7_supplementary_movie_3.avi
file_size: 127472916
relation: main_file
- access_level: open_access
checksum: e5a397edbee05b8821e2b19b3c1a9260
content_type: video/x-msvideo
creator: dernst
date_created: 2019-04-09T14:35:19Z
date_updated: 2021-02-11T23:30:15Z
embargo: 2020-02-11
file_id: '6278'
file_name: 3.7_supplementary_movie_4.avi
file_size: 3181238
relation: main_file
- access_level: open_access
checksum: 32d92b2a9277f956fdb0b42351d07c0b
content_type: video/x-msvideo
creator: dernst
date_created: 2019-04-09T14:35:19Z
date_updated: 2021-02-11T23:30:15Z
embargo: 2020-02-11
file_id: '6279'
file_name: 3.7_supplementary_movie_2.avi
file_size: 5970952
relation: main_file
- access_level: open_access
checksum: efe7001f5d9a8c61e631e12d5f324ade
content_type: video/x-msvideo
creator: dernst
date_created: 2019-04-09T14:35:21Z
date_updated: 2021-02-11T23:30:15Z
embargo: 2020-02-11
file_id: '6280'
file_name: 3.7_Supplementary_movie_1.avi
file_size: 39835236
relation: main_file
- access_level: open_access
checksum: eeb0a5603c6449c5f34eacd5ff0b3a16
content_type: video/x-msvideo
creator: dernst
date_created: 2019-04-09T14:35:21Z
date_updated: 2021-02-11T23:30:15Z
embargo: 2020-02-11
file_id: '6281'
file_name: 2.5_Suppl_Movie_4_AP2A1_TagRFP.avi
file_size: 3696740
relation: main_file
- access_level: open_access
checksum: 8e7c00ef6223bf0e177deb168338af13
content_type: video/x-msvideo
creator: dernst
date_created: 2019-04-09T14:35:21Z
date_updated: 2021-02-11T23:30:15Z
embargo: 2020-02-11
file_id: '6282'
file_name: 2.5_Suppl_Movie_3_TPLATE_GFP.avi
file_size: 6741232
relation: main_file
- access_level: open_access
checksum: 3636006a7cb709a7543d6581e359b28d
content_type: video/x-msvideo
creator: dernst
date_created: 2019-04-09T14:35:22Z
date_updated: 2021-02-11T23:30:15Z
embargo: 2020-02-11
file_id: '6283'
file_name: 2.5_Suppl_Movie_2_CLC_GFP.avi
file_size: 2445946
relation: main_file
- access_level: open_access
checksum: 39ca5519a6e9a38356e7b3704004fea7
content_type: video/x-msvideo
creator: dernst
date_created: 2019-04-09T14:35:22Z
date_updated: 2021-02-11T23:30:15Z
embargo: 2020-02-11
file_id: '6284'
file_name: 2.5_Suppl_Movie_1_CLC_GFPxAxl1_mcherry.avi
file_size: 58594
relation: main_file
- access_level: open_access
checksum: 4fcdaa3a6c645514a3b3205f0f69dc76
content_type: application/pdf
creator: dernst
date_created: 2019-04-09T14:35:33Z
date_updated: 2021-02-11T11:17:15Z
embargo: 2020-02-11
file_id: '6285'
file_name: 2019_Thesis_Narasimhan.pdf
file_size: 10553937
relation: main_file
- access_level: closed
checksum: 268f0b6bad21d5f0d671e5d4b88104a7
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: dernst
date_created: 2019-04-09T14:35:36Z
date_updated: 2020-07-14T12:47:26Z
embargo_to: open_access
file_id: '6286'
file_name: 2019_Thesis_Narasimhan_source.docx
file_size: 135291990
relation: source_file
file_date_updated: 2021-02-11T23:30:15Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '138'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '412'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
title: 'Clathrin-Mediated endocytosis, post-endocytic trafficking and their regulatory
controls in plants '
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '11222'
acknowledgement: This work was supported by the ERC and EU Horizon 2020 (ERC 692692;
MSC-IF 708497) and FWF Z 312-B27 Wittgenstein award; W 1205-B09).
article_number: A3.27
article_processing_charge: No
author:
- first_name: Olena
full_name: Kim, Olena
id: 3F8ABDDA-F248-11E8-B48F-1D18A9856A87
last_name: Kim
- first_name: Carolina
full_name: Borges Merjane, Carolina
id: 4305C450-F248-11E8-B48F-1D18A9856A87
last_name: Borges Merjane
orcid: 0000-0003-0005-401X
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: 'Kim O, Borges Merjane C, Jonas PM. Functional analysis of the docked vesicle
pool in hippocampal mossy fiber terminals by electron microscopy. In: Intrinsic
Activity. Vol 7. Austrian Pharmacological Society; 2019. doi:10.25006/ia.7.s1-a3.27'
apa: 'Kim, O., Borges Merjane, C., & Jonas, P. M. (2019). Functional analysis
of the docked vesicle pool in hippocampal mossy fiber terminals by electron microscopy.
In Intrinsic Activity (Vol. 7). Innsbruck, Austria: Austrian Pharmacological
Society. https://doi.org/10.25006/ia.7.s1-a3.27'
chicago: Kim, Olena, Carolina Borges Merjane, and Peter M Jonas. “Functional Analysis
of the Docked Vesicle Pool in Hippocampal Mossy Fiber Terminals by Electron Microscopy.”
In Intrinsic Activity, Vol. 7. Austrian Pharmacological Society, 2019.
https://doi.org/10.25006/ia.7.s1-a3.27.
ieee: O. Kim, C. Borges Merjane, and P. M. Jonas, “Functional analysis of the docked
vesicle pool in hippocampal mossy fiber terminals by electron microscopy,” in
Intrinsic Activity, Innsbruck, Austria, 2019, vol. 7, no. Suppl. 1.
ista: 'Kim O, Borges Merjane C, Jonas PM. 2019. Functional analysis of the docked
vesicle pool in hippocampal mossy fiber terminals by electron microscopy. Intrinsic
Activity. ANA: Austrian Neuroscience Association ; APHAR: Austrian Pharmacological
Society vol. 7, A3.27.'
mla: Kim, Olena, et al. “Functional Analysis of the Docked Vesicle Pool in Hippocampal
Mossy Fiber Terminals by Electron Microscopy.” Intrinsic Activity, vol.
7, no. Suppl. 1, A3.27, Austrian Pharmacological Society, 2019, doi:10.25006/ia.7.s1-a3.27.
short: O. Kim, C. Borges Merjane, P.M. Jonas, in:, Intrinsic Activity, Austrian
Pharmacological Society, 2019.
conference:
end_date: 2019-09-27
location: Innsbruck, Austria
name: 'ANA: Austrian Neuroscience Association ; APHAR: Austrian Pharmacological
Society'
start_date: 2019-09-25
date_created: 2022-04-20T15:06:05Z
date_published: 2019-09-11T00:00:00Z
date_updated: 2024-03-28T23:30:07Z
day: '11'
department:
- _id: PeJo
doi: 10.25006/ia.7.s1-a3.27
ec_funded: 1
intvolume: ' 7'
issue: Suppl. 1
keyword:
- hippocampus
- mossy fibers
- readily releasable pool
- electron microscopy
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.intrinsicactivity.org/2019/7/S1/A3.27/
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 25B7EB9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '692692'
name: Biophysics and circuit function of a giant cortical glumatergic synapse
- _id: 25BAF7B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '708497'
name: Presynaptic calcium channels distribution and impact on coupling at the hippocampal
mossy fiber synapse
- _id: 25C3DBB6-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: W01205
name: Zellkommunikation in Gesundheit und Krankheit
- _id: 25C5A090-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00312
name: The Wittgenstein Prize
publication: Intrinsic Activity
publication_identifier:
issn:
- 2309-8503
publication_status: published
publisher: Austrian Pharmacological Society
quality_controlled: '1'
related_material:
record:
- id: '11196'
relation: dissertation_contains
status: public
status: public
title: Functional analysis of the docked vesicle pool in hippocampal mossy fiber terminals
by electron microscopy
type: conference_abstract
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 7
year: '2019'
...
---
_id: '6947'
abstract:
- lang: eng
text: Lymph nodes are es s ential organs of the immune s ys tem where adaptive
immune responses originate, and consist of various leukocyte populations and a
stromal backbone. Fibroblastic reticular cells (FRCs) are the main stromal cells
and form a sponge-like extracellular matrix network, called conduits , which they thems
elves enwrap and contract. Lymph, containing s oluble antigens , arrive
in lymph nodes via afferent lymphatic vessels that connect to the s ubcaps
ular s inus and conduit network. According to the current paradigm, the conduit network dis
tributes afferent lymph through lymph nodes and thus provides acces
s for immune cells to lymph-borne antigens. An elas tic caps ule s urrounds the organ and confines the
immune cells and FRC network. Lymph nodes are completely packed with lymphocytes and lymphocyte numbers directly dictates the
size of the organ. Although lymphocytes cons tantly enter and leave the lymph node, its s
ize remains remarkedly s table under homeostatic conditions. It is only
partly known how the cellularity and s ize of the lymph node is regulated and how the lymph node is
able to swell in inflammation. The role of the FRC network in lymph node s
welling and trans fer of fluids are inves tigated in this thes is. Furthermore, we s
tudied what trafficking routes are us ed by cancer cells in lymph nodes to form distal
metastases.We examined the role of a mechanical feedback in regulation of lymph node
swelling. Using parallel plate compression and UV-las er cutting experiments we dis
s ected the mechanical force dynamics of the whole lymph node, and individually
for FRCs and the caps ule. Physical forces generated by packed lymphocytes directly affect the tens
ion on the FRC network and capsule, which increases its resistance to swelling. This implies a feedback mechanism between tis
s ue pres s ure and ability of lymphocytes to enter the organ. Following inflammation, the lymph node swells
∼10 fold in two weeks . Yet, what is the role for tens ion on the FRC network and caps
ule, and how are lymphocytes able to enter in conditions that resist
swelling remain open ques tions . We s how that tens ion on the FRC network is important
to limit the swelling rate of the organ so that the FRC network can grow in a coordinated fashion.
This is illustrated by interfering with FRC contractility, which leads to faster
swelling rates and a dis organized FRC network in the inflamed lymph node.
Growth of the FRC network in turn is expected to releas e tens ion on thes
e s tructures and lowers the res is tance to swelling, thereby allowing
more lymphocytes to enter the organ and drive more swelling. Halt of swelling
coincides with a thickening of the caps ule, which forms a thick res
is tant band around the organ and lowers tens ion on the FRC network to form
a new force equilibrium.The FRC and conduit network are further believed to be a privileged s
ite of s oluble information within the lymph node, although many details remain uns
olved. We s how by 3D ultra-recons truction that FRCs and antigen pres
enting cells cover the s urface of conduit s ys tem for more than 99%
and we dis cus s the implications for s oluble information exchangeat the conduit
level.Finally, there is an ongoing debate in the cancer field whether and how
cancer cells in lymph nodes s eed dis tal metas tas es . We s how that cancer cells infus
ed into the lymph node can utilize trafficking routes of immune cells and rapidly migrate to blood vessels.
Once in the blood circulation, these cells are able to form metastases in
distal tissues.
acknowledged_ssus:
- _id: Bio
- _id: PreCl
- _id: EM-Fac
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Frank P
full_name: Assen, Frank P
id: 3A8E7F24-F248-11E8-B48F-1D18A9856A87
last_name: Assen
orcid: 0000-0003-3470-6119
citation:
ama: 'Assen FP. Lymph node mechanics: Deciphering the interplay between stroma contractility,
morphology and lymphocyte trafficking. 2019. doi:10.15479/AT:ISTA:6947'
apa: 'Assen, F. P. (2019). Lymph node mechanics: Deciphering the interplay between
stroma contractility, morphology and lymphocyte trafficking. Institute of
Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6947'
chicago: 'Assen, Frank P. “Lymph Node Mechanics: Deciphering the Interplay between
Stroma Contractility, Morphology and Lymphocyte Trafficking.” Institute of Science
and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6947.'
ieee: 'F. P. Assen, “Lymph node mechanics: Deciphering the interplay between stroma
contractility, morphology and lymphocyte trafficking,” Institute of Science and
Technology Austria, 2019.'
ista: 'Assen FP. 2019. Lymph node mechanics: Deciphering the interplay between stroma
contractility, morphology and lymphocyte trafficking. Institute of Science and
Technology Austria.'
mla: 'Assen, Frank P. Lymph Node Mechanics: Deciphering the Interplay between
Stroma Contractility, Morphology and Lymphocyte Trafficking. Institute of
Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6947.'
short: 'F.P. Assen, Lymph Node Mechanics: Deciphering the Interplay between Stroma
Contractility, Morphology and Lymphocyte Trafficking, Institute of Science and
Technology Austria, 2019.'
date_created: 2019-10-14T16:54:52Z
date_published: 2019-10-09T00:00:00Z
date_updated: 2023-09-13T08:50:57Z
day: '9'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: MiSi
doi: 10.15479/AT:ISTA:6947
file:
- access_level: closed
checksum: 53a739752a500f84d0f8ec953cbbd0b6
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: fassen
date_created: 2019-11-06T12:30:02Z
date_updated: 2020-11-07T23:30:03Z
embargo_to: open_access
file_id: '6990'
file_name: PhDthesis_FrankAssen_revised2.docx
file_size: 214172667
relation: source_file
- access_level: open_access
checksum: 8c156b65d9347bb599623a4b09f15d15
content_type: application/pdf
creator: fassen
date_created: 2019-11-06T12:30:57Z
date_updated: 2020-11-07T23:30:03Z
embargo: 2020-11-06
file_id: '6991'
file_name: PhDthesis_FrankAssen_revised2.pdf
file_size: 83637532
relation: main_file
file_date_updated: 2020-11-07T23:30:03Z
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '142'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '664'
relation: part_of_dissertation
status: public
- id: '402'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
title: 'Lymph node mechanics: Deciphering the interplay between stroma contractility,
morphology and lymphocyte trafficking'
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '6849'
abstract:
- lang: eng
text: 'Brain function is mediated by complex dynamical interactions between excitatory
and inhibitory cell types. The Cholecystokinin-expressing inhibitory cells (CCK-interneurons)
are one of the least studied types, despite being suspected to play important
roles in cognitive processes. We studied the network effects of optogenetic silencing
of CCK-interneurons in the CA1 hippocampal area during exploration and sleep states.
The cell firing pattern in response to light pulses allowed us to classify the
recorded neurons in 5 classes, including disinhibited and non-responsive pyramidal
cell and interneurons, and the inhibited interneurons corresponding to the CCK
group. The light application, which inhibited the activity of CCK interneurons
triggered wider changes in the firing dynamics of cells. We observed rate changes
(i.e. remapping) of pyramidal cells during the exploration session in which the
light was applied relative to the previous control session that was not restricted
neither in time nor space to the light delivery. Also, the disinhibited pyramidal
cells had higher increase in bursting than in single spike firing rate as a result
of CCK silencing. In addition, the firing activity patterns during exploratory
periods were more weakly reactivated in sleep for those periods in which CCK-interneuron
were silenced than in the unaffected periods. Furthermore, light pulses during
sleep disrupted the reactivation of recent waking patterns. Hence, silencing CCK
neurons during exploration suppressed the reactivation of waking firing patterns
in sleep and CCK interneuron activity was also required during sleep for the normal
reactivation of waking patterns. These findings demonstrate the involvement of
CCK cells in reactivation-related memory consolidation. An important part of our
analysis was to test the relationship of the identified CCKinterneurons to brain
oscillations. Our findings showed that these cells exhibited different oscillatory
behaviour during anaesthesia and natural waking and sleep conditions. We showed
that: 1) Contrary to the past studies performed under anaesthesia, the identified
CCKinterneurons fired on the descending portion of the theta phase in waking exploration.
2) CCKinterneuron preferred phases around the trough of gamma oscillations. 3)
Contrary to anaesthesia conditions, the average firing rate of the CCK-interneurons
increased around the peak activity of the sharp-wave ripple (SWR) events in natural
sleep, which is congruent with new reports about their functional connectivity.
We also found that light driven CCK-interneuron silencing altered the dynamics
on the CA1 network oscillatory activity: 1) Pyramidal cells negatively shifted
their preferred theta phases when the light was applied, while interneurons responses
were less consistent. 2) As a population, pyramidal cells negatively shifted their
preferred activity during gamma oscillations, albeit we did not find gamma modulation
differences related to the light application when pyramidal cells were subdivided
into the disinhibited and unaffected groups. 3) During the peak of SWR events,
all but the CCK-interneurons had a reduction in their relative firing rate change
during the light application as compared to the change observed at SWR initiation.
Finally, regarding to the place field activity of the recorded pyramidal neurons,
we showed that the disinhibited pyramidal cells had reduced place field similarity,
coherence and spatial information, but only during the light application. The
mechanisms behind such observed behaviours might involve eCB signalling and plastic
changes in CCK-interneuron synapses. In conclusion, the observed changes related
to the light-mediated silencing of CCKinterneurons have unravelled characteristics
of this interneuron subpopulation that might change the understanding not only
of their particular network interactions, but also of the current theories about
the emergence of certain cognitive processes such as place coding needed for navigation
or hippocampus-dependent memory consolidation. '
acknowledged_ssus:
- _id: Bio
- _id: PreCl
- _id: M-Shop
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Dámaris K
full_name: Rangel Guerrero, Dámaris K
id: 4871BCE6-F248-11E8-B48F-1D18A9856A87
last_name: Rangel Guerrero
orcid: 0000-0002-8602-4374
citation:
ama: Rangel Guerrero DK. The role of CCK-interneurons in regulating hippocampal
network dynamics. 2019. doi:10.15479/AT:ISTA:6849
apa: Rangel Guerrero, D. K. (2019). The role of CCK-interneurons in regulating
hippocampal network dynamics. Institute of Science and Technology Austria.
https://doi.org/10.15479/AT:ISTA:6849
chicago: Rangel Guerrero, Dámaris K. “The Role of CCK-Interneurons in Regulating
Hippocampal Network Dynamics.” Institute of Science and Technology Austria, 2019.
https://doi.org/10.15479/AT:ISTA:6849.
ieee: D. K. Rangel Guerrero, “The role of CCK-interneurons in regulating hippocampal
network dynamics,” Institute of Science and Technology Austria, 2019.
ista: Rangel Guerrero DK. 2019. The role of CCK-interneurons in regulating hippocampal
network dynamics. Institute of Science and Technology Austria.
mla: Rangel Guerrero, Dámaris K. The Role of CCK-Interneurons in Regulating Hippocampal
Network Dynamics. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6849.
short: D.K. Rangel Guerrero, The Role of CCK-Interneurons in Regulating Hippocampal
Network Dynamics, Institute of Science and Technology Austria, 2019.
date_created: 2019-09-06T06:54:16Z
date_published: 2019-09-09T00:00:00Z
date_updated: 2023-09-19T10:01:12Z
day: '09'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: JoCs
doi: 10.15479/AT:ISTA:6849
file:
- access_level: closed
checksum: 244dc4f74dbfc94f414156092298831f
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: drangel
date_created: 2019-09-09T13:09:45Z
date_updated: 2021-02-10T23:30:09Z
embargo_to: open_access
file_id: '6865'
file_name: Thesis_Damaris_Rangel_source.docx
file_size: 18253100
relation: source_file
- access_level: open_access
checksum: 59c73be40eeaa1c4db24067270151555
content_type: application/pdf
creator: drangel
date_created: 2019-09-09T13:09:52Z
date_updated: 2020-09-11T22:30:04Z
embargo: 2020-09-10
file_id: '6866'
file_name: Thesis_Damaris_Rangel_pdfa.pdf
file_size: 2160109
relation: main_file
request_a_copy: 0
file_date_updated: 2021-02-10T23:30:09Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '97'
publication_identifier:
isbn:
- '9783990780039'
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '5914'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
title: The role of CCK-interneurons in regulating hippocampal network dynamics
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '6351'
abstract:
- lang: eng
text: "A process of restorative patterning in plant roots correctly replaces eliminated
cells to heal local injuries despite the absence of cell migration, which underpins
wound healing in animals. \r\n\r\nPatterning in plants relies on oriented cell
divisions and acquisition of specific cell identities. Plants regularly endure
wounds caused by abiotic or biotic environmental stimuli and have developed extraordinary
abilities to restore their tissues after injuries. Here, we provide insight into
a mechanism of restorative patterning that repairs tissues after wounding. Laser-assisted
elimination of different cells in Arabidopsis root combined with live-imaging
tracking during vertical growth allowed analysis of the regeneration processes
in vivo. Specifically, the cells adjacent to the inner side of the injury re-activated
their stem cell transcriptional programs. They accelerated their progression through
cell cycle, coordinately changed the cell division orientation, and ultimately
acquired de novo the correct cell fates to replace missing cells. These observations
highlight existence of unknown intercellular positional signaling and demonstrate
the capability of specified cells to re-acquire stem cell programs as a crucial
part of the plant-specific mechanism of wound healing."
acknowledged_ssus:
- _id: Bio
article_processing_charge: No
author:
- first_name: Petra
full_name: Marhavá, Petra
id: 44E59624-F248-11E8-B48F-1D18A9856A87
last_name: Marhavá
- first_name: Lukas
full_name: Hörmayer, Lukas
id: 2EEE7A2A-F248-11E8-B48F-1D18A9856A87
last_name: Hörmayer
orcid: 0000-0001-8295-2926
- first_name: Saiko
full_name: Yoshida, Saiko
id: 2E46069C-F248-11E8-B48F-1D18A9856A87
last_name: Yoshida
- first_name: Peter
full_name: Marhavy, Peter
id: 3F45B078-F248-11E8-B48F-1D18A9856A87
last_name: Marhavy
orcid: 0000-0001-5227-5741
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Marhavá P, Hörmayer L, Yoshida S, Marhavý P, Benková E, Friml J. Re-activation
of stem cell pathways for pattern restoration in plant wound healing. Cell.
2019;177(4):957-969.e13. doi:10.1016/j.cell.2019.04.015
apa: Marhavá, P., Hörmayer, L., Yoshida, S., Marhavý, P., Benková, E., & Friml,
J. (2019). Re-activation of stem cell pathways for pattern restoration in plant
wound healing. Cell. Elsevier. https://doi.org/10.1016/j.cell.2019.04.015
chicago: Marhavá, Petra, Lukas Hörmayer, Saiko Yoshida, Peter Marhavý, Eva Benková,
and Jiří Friml. “Re-Activation of Stem Cell Pathways for Pattern Restoration in
Plant Wound Healing.” Cell. Elsevier, 2019. https://doi.org/10.1016/j.cell.2019.04.015.
ieee: P. Marhavá, L. Hörmayer, S. Yoshida, P. Marhavý, E. Benková, and J. Friml,
“Re-activation of stem cell pathways for pattern restoration in plant wound healing,”
Cell, vol. 177, no. 4. Elsevier, p. 957–969.e13, 2019.
ista: Marhavá P, Hörmayer L, Yoshida S, Marhavý P, Benková E, Friml J. 2019. Re-activation
of stem cell pathways for pattern restoration in plant wound healing. Cell. 177(4),
957–969.e13.
mla: Marhavá, Petra, et al. “Re-Activation of Stem Cell Pathways for Pattern Restoration
in Plant Wound Healing.” Cell, vol. 177, no. 4, Elsevier, 2019, p. 957–969.e13,
doi:10.1016/j.cell.2019.04.015.
short: P. Marhavá, L. Hörmayer, S. Yoshida, P. Marhavý, E. Benková, J. Friml, Cell
177 (2019) 957–969.e13.
date_created: 2019-04-28T21:59:14Z
date_published: 2019-05-02T00:00:00Z
date_updated: 2024-03-28T23:30:10Z
day: '02'
ddc:
- '570'
department:
- _id: JiFr
- _id: EvBe
doi: 10.1016/j.cell.2019.04.015
ec_funded: 1
external_id:
isi:
- '000466843000015'
pmid:
- '31051107'
file:
- access_level: open_access
checksum: 4ceba04a96a74f5092ec3ce2c579a0c7
content_type: application/pdf
creator: dernst
date_created: 2019-05-13T06:12:45Z
date_updated: 2020-07-14T12:47:28Z
file_id: '6411'
file_name: 2019_Cell_Marhava.pdf
file_size: 10272032
relation: main_file
file_date_updated: 2020-07-14T12:47:28Z
has_accepted_license: '1'
intvolume: ' 177'
isi: 1
issue: '4'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 957-969.e13
pmid: 1
project:
- _id: 261099A6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '742985'
name: Tracing Evolution of Auxin Transport and Polarity in Plants
publication: Cell
publication_identifier:
eissn:
- '10974172'
issn:
- '00928674'
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/specialized-plant-cells-regain-stem-cell-features-to-heal-wounds/
record:
- id: '9992'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Re-activation of stem cell pathways for pattern restoration in plant wound
healing
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: 177
year: '2019'
...
---
_id: '6943'
abstract:
- lang: eng
text: Plants as sessile organisms are constantly under attack by herbivores, rough
environmental situations, or mechanical pressure. These challenges often lead
to the induction of wounds or destruction of already specified and developed tissues.
Additionally, wounding makes plants vulnerable to invasion by pathogens, which
is why wound signalling often triggers specific defence responses. To stay competitive
or, eventually, survive under these circumstances, plants need to regenerate efficiently,
which in rigid, tissue migration-incompatible plant tissues requires post-embryonic
patterning and organogenesis. Now, several studies used laser-assisted single
cell ablation in the Arabidopsis root tip as a minimal wounding proxy. Here, we
discuss their findings and put them into context of a broader spectrum of wound
signalling, pathogen responses and tissue as well as organ regeneration.
article_processing_charge: No
article_type: original
author:
- first_name: Lukas
full_name: Hörmayer, Lukas
id: 2EEE7A2A-F248-11E8-B48F-1D18A9856A87
last_name: Hörmayer
orcid: 0000-0001-8295-2926
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Hörmayer L, Friml J. Targeted cell ablation-based insights into wound healing
and restorative patterning. Current Opinion in Plant Biology. 2019;52:124-130.
doi:10.1016/j.pbi.2019.08.006
apa: Hörmayer, L., & Friml, J. (2019). Targeted cell ablation-based insights
into wound healing and restorative patterning. Current Opinion in Plant Biology.
Elsevier. https://doi.org/10.1016/j.pbi.2019.08.006
chicago: Hörmayer, Lukas, and Jiří Friml. “Targeted Cell Ablation-Based Insights
into Wound Healing and Restorative Patterning.” Current Opinion in Plant Biology.
Elsevier, 2019. https://doi.org/10.1016/j.pbi.2019.08.006.
ieee: L. Hörmayer and J. Friml, “Targeted cell ablation-based insights into wound
healing and restorative patterning,” Current Opinion in Plant Biology,
vol. 52. Elsevier, pp. 124–130, 2019.
ista: Hörmayer L, Friml J. 2019. Targeted cell ablation-based insights into wound
healing and restorative patterning. Current Opinion in Plant Biology. 52, 124–130.
mla: Hörmayer, Lukas, and Jiří Friml. “Targeted Cell Ablation-Based Insights into
Wound Healing and Restorative Patterning.” Current Opinion in Plant Biology,
vol. 52, Elsevier, 2019, pp. 124–30, doi:10.1016/j.pbi.2019.08.006.
short: L. Hörmayer, J. Friml, Current Opinion in Plant Biology 52 (2019) 124–130.
date_created: 2019-10-14T07:00:24Z
date_published: 2019-12-01T00:00:00Z
date_updated: 2024-03-28T23:30:10Z
day: '01'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.1016/j.pbi.2019.08.006
ec_funded: 1
external_id:
isi:
- '000502890600017'
pmid:
- '31585333'
file:
- access_level: open_access
checksum: d6fd68a6e965f1efe3f0bf2d2070a616
content_type: application/pdf
creator: dernst
date_created: 2019-10-14T14:48:21Z
date_updated: 2020-07-14T12:47:45Z
file_id: '6946'
file_name: 2019_CurrentOpinionPlant_Hoermayer.pdf
file_size: 1659288
relation: main_file
file_date_updated: 2020-07-14T12:47:45Z
has_accepted_license: '1'
intvolume: ' 52'
isi: 1
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 124-130
pmid: 1
project:
- _id: 261099A6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '742985'
name: Tracing Evolution of Auxin Transport and Polarity in Plants
publication: Current Opinion in Plant Biology
publication_identifier:
issn:
- 1369-5266
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '9992'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Targeted cell ablation-based insights into wound healing and restorative patterning
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: 52
year: '2019'
...
---
_id: '7391'
abstract:
- lang: eng
text: Electron microscopy (EM) is a technology that enables visualization of single
proteins at a nanometer resolution. However, current protein analysis by EM mainly
relies on immunolabeling with gold-particle-conjugated antibodies, which is compromised
by large size of antibody, precluding precise detection of protein location in
biological samples. Here, we develop a specific chemical labeling method for EM
detection of proteins at single-molecular level. Rational design of α-helical
peptide tag and probe structure provided a complementary reaction pair that enabled
specific cysteine conjugation of the tag. The developed chemical labeling with
gold-nanoparticle-conjugated probe showed significantly higher labeling efficiency
and detectability of high-density clusters of tag-fused G protein-coupled receptors
in freeze-fracture replicas compared with immunogold labeling. Furthermore, in
ultrathin sections, the spatial resolution of the chemical labeling was significantly
higher than that of antibody-mediated labeling. These results demonstrate substantial
advantages of the chemical labeling approach for single protein visualization
by EM.
article_processing_charge: No
article_type: original
author:
- first_name: Shigekazu
full_name: Tabata, Shigekazu
id: 4427179E-F248-11E8-B48F-1D18A9856A87
last_name: Tabata
- first_name: Marijo
full_name: Jevtic, Marijo
id: 4BE3BC94-F248-11E8-B48F-1D18A9856A87
last_name: Jevtic
- first_name: Nobutaka
full_name: Kurashige, Nobutaka
last_name: Kurashige
- first_name: Hirokazu
full_name: Fuchida, Hirokazu
last_name: Fuchida
- first_name: Munetsugu
full_name: Kido, Munetsugu
last_name: Kido
- first_name: Kazushi
full_name: Tani, Kazushi
last_name: Tani
- first_name: Naoki
full_name: Zenmyo, Naoki
last_name: Zenmyo
- first_name: Shohei
full_name: Uchinomiya, Shohei
last_name: Uchinomiya
- first_name: Harumi
full_name: Harada, Harumi
id: 2E55CDF2-F248-11E8-B48F-1D18A9856A87
last_name: Harada
orcid: 0000-0001-7429-7896
- first_name: Makoto
full_name: Itakura, Makoto
last_name: Itakura
- first_name: Itaru
full_name: Hamachi, Itaru
last_name: Hamachi
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Akio
full_name: Ojida, Akio
last_name: Ojida
citation:
ama: Tabata S, Jevtic M, Kurashige N, et al. Electron microscopic detection of single
membrane proteins by a specific chemical labeling. iScience. 2019;22(12):256-268.
doi:10.1016/j.isci.2019.11.025
apa: Tabata, S., Jevtic, M., Kurashige, N., Fuchida, H., Kido, M., Tani, K., … Ojida,
A. (2019). Electron microscopic detection of single membrane proteins by a specific
chemical labeling. IScience. Elsevier. https://doi.org/10.1016/j.isci.2019.11.025
chicago: Tabata, Shigekazu, Marijo Jevtic, Nobutaka Kurashige, Hirokazu Fuchida,
Munetsugu Kido, Kazushi Tani, Naoki Zenmyo, et al. “Electron Microscopic Detection
of Single Membrane Proteins by a Specific Chemical Labeling.” IScience.
Elsevier, 2019. https://doi.org/10.1016/j.isci.2019.11.025.
ieee: S. Tabata et al., “Electron microscopic detection of single membrane
proteins by a specific chemical labeling,” iScience, vol. 22, no. 12. Elsevier,
pp. 256–268, 2019.
ista: Tabata S, Jevtic M, Kurashige N, Fuchida H, Kido M, Tani K, Zenmyo N, Uchinomiya
S, Harada H, Itakura M, Hamachi I, Shigemoto R, Ojida A. 2019. Electron microscopic
detection of single membrane proteins by a specific chemical labeling. iScience.
22(12), 256–268.
mla: Tabata, Shigekazu, et al. “Electron Microscopic Detection of Single Membrane
Proteins by a Specific Chemical Labeling.” IScience, vol. 22, no. 12, Elsevier,
2019, pp. 256–68, doi:10.1016/j.isci.2019.11.025.
short: S. Tabata, M. Jevtic, N. Kurashige, H. Fuchida, M. Kido, K. Tani, N. Zenmyo,
S. Uchinomiya, H. Harada, M. Itakura, I. Hamachi, R. Shigemoto, A. Ojida, IScience
22 (2019) 256–268.
date_created: 2020-01-29T15:56:56Z
date_published: 2019-12-20T00:00:00Z
date_updated: 2024-03-28T23:30:12Z
day: '20'
ddc:
- '570'
department:
- _id: RySh
doi: 10.1016/j.isci.2019.11.025
ec_funded: 1
external_id:
isi:
- :000504652000020
pmid:
- '31786521'
file:
- access_level: open_access
checksum: f3e90056a49f09b205b1c4f8c739ffd1
content_type: application/pdf
creator: dernst
date_created: 2020-02-04T10:48:36Z
date_updated: 2020-07-14T12:47:57Z
file_id: '7448'
file_name: 2019_iScience_Tabata.pdf
file_size: 7197776
relation: main_file
file_date_updated: 2020-07-14T12:47:57Z
has_accepted_license: '1'
intvolume: ' 22'
issue: '12'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 256-268
pmid: 1
project:
- _id: 25CA28EA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694539'
name: 'In situ analysis of single channel subunit composition in neurons: physiological
implication in synaptic plasticity and behaviour'
- _id: 25CBA828-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '720270'
name: Human Brain Project Specific Grant Agreement 1 (HBP SGA 1)
publication: iScience
publication_identifier:
issn:
- 2589-0042
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '11393'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Electron microscopic detection of single membrane proteins by a specific chemical
labeling
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 22
year: '2019'
...
---
_id: '6848'
abstract:
- lang: eng
text: Proton-translocating transhydrogenase (also known as nicotinamide nucleotide
transhydrogenase (NNT)) is found in the plasma membranes of bacteria and the inner
mitochondrial membranes of eukaryotes. NNT catalyses the transfer of a hydride
between NADH and NADP+, coupled to the translocation of one proton across the
membrane. Its main physiological function is the generation of NADPH, which is
a substrate in anabolic reactions and a regulator of oxidative status; however,
NNT may also fine-tune the Krebs cycle1,2. NNT deficiency causes familial glucocorticoid
deficiency in humans and metabolic abnormalities in mice, similar to those observed
in type II diabetes3,4. The catalytic mechanism of NNT has been proposed to involve
a rotation of around 180° of the entire NADP(H)-binding domain that alternately
participates in hydride transfer and proton-channel gating. However, owing to
the lack of high-resolution structures of intact NNT, the details of this process
remain unclear5,6. Here we present the cryo-electron microscopy structure of intact
mammalian NNT in different conformational states. We show how the NADP(H)-binding
domain opens the proton channel to the opposite sides of the membrane, and we
provide structures of these two states. We also describe the catalytically important
interfaces and linkers between the membrane and the soluble domains and their
roles in nucleotide exchange. These structures enable us to propose a revised
mechanism for a coupling process in NNT that is consistent with a large body of
previous biochemical work. Our results are relevant to the development of currently
unavailable NNT inhibitors, which may have therapeutic potential in ischaemia
reperfusion injury, metabolic syndrome and some cancers7,8,9.
acknowledged_ssus:
- _id: ScienComp
acknowledgement: " We thank R. Thompson, G. Effantin and V.-V. Hodirnau for their
assistance with collecting NADP+, NADPH and apo datasets, respectively. Data processing
was performed at the IST high-performance computing cluster.\r\nThis project has
received funding from the European Union’s Horizon 2020 research and innovation
programme under the Marie Skłodowska-Curie Grant Agreement no. 665385."
article_processing_charge: No
article_type: letter_note
author:
- first_name: Domen
full_name: Kampjut, Domen
id: 37233050-F248-11E8-B48F-1D18A9856A87
last_name: Kampjut
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
citation:
ama: Kampjut D, Sazanov LA. Structure and mechanism of mitochondrial proton-translocating
transhydrogenase. Nature. 2019;573(7773):291–295. doi:10.1038/s41586-019-1519-2
apa: Kampjut, D., & Sazanov, L. A. (2019). Structure and mechanism of mitochondrial
proton-translocating transhydrogenase. Nature. Springer Nature. https://doi.org/10.1038/s41586-019-1519-2
chicago: Kampjut, Domen, and Leonid A Sazanov. “Structure and Mechanism of Mitochondrial
Proton-Translocating Transhydrogenase.” Nature. Springer Nature, 2019.
https://doi.org/10.1038/s41586-019-1519-2.
ieee: D. Kampjut and L. A. Sazanov, “Structure and mechanism of mitochondrial proton-translocating
transhydrogenase,” Nature, vol. 573, no. 7773. Springer Nature, pp. 291–295,
2019.
ista: Kampjut D, Sazanov LA. 2019. Structure and mechanism of mitochondrial proton-translocating
transhydrogenase. Nature. 573(7773), 291–295.
mla: Kampjut, Domen, and Leonid A. Sazanov. “Structure and Mechanism of Mitochondrial
Proton-Translocating Transhydrogenase.” Nature, vol. 573, no. 7773, Springer
Nature, 2019, pp. 291–295, doi:10.1038/s41586-019-1519-2.
short: D. Kampjut, L.A. Sazanov, Nature 573 (2019) 291–295.
date_created: 2019-09-04T06:21:41Z
date_published: 2019-09-12T00:00:00Z
date_updated: 2024-03-28T23:30:15Z
day: '12'
ddc:
- '572'
department:
- _id: LeSa
doi: 10.1038/s41586-019-1519-2
ec_funded: 1
external_id:
isi:
- '000485415400061'
pmid:
- '31462775'
file:
- access_level: open_access
checksum: 52728cda5210a3e9b74cc204e8aed3d5
content_type: application/pdf
creator: lsazanov
date_created: 2020-11-26T16:33:44Z
date_updated: 2020-11-26T16:33:44Z
file_id: '8821'
file_name: Manuscript_final_acc_withFigs_SI_opt_red.pdf
file_size: 3066206
relation: main_file
success: 1
file_date_updated: 2020-11-26T16:33:44Z
has_accepted_license: '1'
intvolume: ' 573'
isi: 1
issue: '7773'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 291–295
pmid: 1
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: Nature
publication_identifier:
eissn:
- 1476-4687
issn:
- 0028-0836
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- description: News on IST Website
relation: press_release
url: https://ist.ac.at/en/news/high-end-microscopy-reveals-structure-and-function-of-crucial-metabolic-enzyme/
record:
- id: '8340'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Structure and mechanism of mitochondrial proton-translocating transhydrogenase
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 573
year: '2019'
...
---
_id: '6194'
abstract:
- lang: eng
text: Grid cells with their rigid hexagonal firing fields are thought to provide
an invariant metric to the hippocampal cognitive map, yet environmental geometrical
features have recently been shown to distort the grid structure. Given that the
hippocampal role goes beyond space, we tested the influence of nonspatial information
on the grid organization. We trained rats to daily learn three new reward locations
on a cheeseboard maze while recording from the medial entorhinal cortex and the
hippocampal CA1 region. Many grid fields moved toward goal location, leading to
long-lasting deformations of the entorhinal map. Therefore, distortions in the
grid structure contribute to goal representation during both learning and recall,
which demonstrates that grid cells participate in mnemonic coding and do not merely
provide a simple metric of space.
article_processing_charge: No
article_type: original
author:
- first_name: Charlotte N.
full_name: Boccara, Charlotte N.
id: 3FC06552-F248-11E8-B48F-1D18A9856A87
last_name: Boccara
orcid: 0000-0001-7237-5109
- first_name: Michele
full_name: Nardin, Michele
id: 30BD0376-F248-11E8-B48F-1D18A9856A87
last_name: Nardin
orcid: 0000-0001-8849-6570
- first_name: Federico
full_name: Stella, Federico
id: 39AF1E74-F248-11E8-B48F-1D18A9856A87
last_name: Stella
orcid: 0000-0001-9439-3148
- first_name: Joseph
full_name: O'Neill, Joseph
id: 426376DC-F248-11E8-B48F-1D18A9856A87
last_name: O'Neill
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
citation:
ama: Boccara CN, Nardin M, Stella F, O’Neill J, Csicsvari JL. The entorhinal cognitive
map is attracted to goals. Science. 2019;363(6434):1443-1447. doi:10.1126/science.aav4837
apa: Boccara, C. N., Nardin, M., Stella, F., O’Neill, J., & Csicsvari, J. L.
(2019). The entorhinal cognitive map is attracted to goals. Science. American
Association for the Advancement of Science. https://doi.org/10.1126/science.aav4837
chicago: Boccara, Charlotte N., Michele Nardin, Federico Stella, Joseph O’Neill,
and Jozsef L Csicsvari. “The Entorhinal Cognitive Map Is Attracted to Goals.”
Science. American Association for the Advancement of Science, 2019. https://doi.org/10.1126/science.aav4837.
ieee: C. N. Boccara, M. Nardin, F. Stella, J. O’Neill, and J. L. Csicsvari, “The
entorhinal cognitive map is attracted to goals,” Science, vol. 363, no.
6434. American Association for the Advancement of Science, pp. 1443–1447, 2019.
ista: Boccara CN, Nardin M, Stella F, O’Neill J, Csicsvari JL. 2019. The entorhinal
cognitive map is attracted to goals. Science. 363(6434), 1443–1447.
mla: Boccara, Charlotte N., et al. “The Entorhinal Cognitive Map Is Attracted to
Goals.” Science, vol. 363, no. 6434, American Association for the Advancement
of Science, 2019, pp. 1443–47, doi:10.1126/science.aav4837.
short: C.N. Boccara, M. Nardin, F. Stella, J. O’Neill, J.L. Csicsvari, Science 363
(2019) 1443–1447.
date_created: 2019-04-04T08:39:30Z
date_published: 2019-03-29T00:00:00Z
date_updated: 2024-03-28T23:30:16Z
day: '29'
ddc:
- '570'
department:
- _id: JoCs
doi: 10.1126/science.aav4837
ec_funded: 1
external_id:
isi:
- '000462738000034'
file:
- access_level: open_access
checksum: 5e6b16742cde10a560cfaf2130764da1
content_type: application/pdf
creator: dernst
date_created: 2020-05-14T09:11:10Z
date_updated: 2020-07-14T12:47:23Z
file_id: '7826'
file_name: 2019_Science_Boccara.pdf
file_size: 9045923
relation: main_file
file_date_updated: 2020-07-14T12:47:23Z
has_accepted_license: '1'
intvolume: ' 363'
isi: 1
issue: '6434'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
page: 1443-1447
project:
- _id: 257A4776-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '281511'
name: Memory-related information processing in neuronal circuits of the hippocampus
and entorhinal cortex
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: Science
publication_identifier:
eissn:
- 1095-9203
issn:
- 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/grid-cells-create-treasure-map-in-rat-brain/
record:
- id: '6062'
relation: popular_science
status: public
- id: '11932'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: The entorhinal cognitive map is attracted to goals
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 363
year: '2019'
...
---
_id: '7132'
abstract:
- lang: eng
text: "A major challenge in neuroscience research is to dissect the circuits that
orchestrate behavior in health and disease. Proteins from a wide range of non-mammalian
species, such as microbial opsins, have been successfully transplanted to specific
neuronal targets to override their natural communication patterns. The goal of
our work is to manipulate synaptic communication in a manner that closely incorporates
the functional intricacies of synapses by preserving temporal encoding (i.e. the
firing pattern of the presynaptic neuron) and connectivity (i.e. target specific
synapses rather than specific neurons). Our strategy to achieve this goal builds
on the use of non-mammalian transplants to create a synthetic synapse. The mode
of modulation comes from pre-synaptic uptake of a synthetic neurotransmitter (SN)
into synaptic vesicles by means of a genetically targeted transporter selective
for the SN. Upon natural vesicular release, exposure of the SN to the synaptic
cleft will modify the post-synaptic potential through an orthogonal ligand gated
ion channel. To achieve this goal we have functionally characterized a mixed cationic
methionine-gated ion channel from Arabidopsis thaliana, designed a method to functionally
characterize a synthetic transporter in isolated synaptic vesicles without the
need for transgenic animals, identified and extracted multiple prokaryotic uptake
systems that are substrate specific for methionine (Met), and established a primary/cell
line co-culture system that would allow future combinatorial testing of this orthogonal
transmitter-transporter-channel trifecta.\r\nSynthetic synapses will provide a
unique opportunity to manipulate synaptic communication while maintaining the
electrophysiological integrity of the pre-synaptic cell. In this way, information
may be preserved that was generated in upstream circuits and that could be essential
for concerted function and information processing."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Catherine
full_name: Mckenzie, Catherine
id: 3EEDE19A-F248-11E8-B48F-1D18A9856A87
last_name: Mckenzie
citation:
ama: Mckenzie C. Design and characterization of methods and biological components
to realize synthetic neurotransmission. 2019. doi:10.15479/at:ista:7132
apa: Mckenzie, C. (2019). Design and characterization of methods and biological
components to realize synthetic neurotransmission. Institute of Science and
Technology Austria. https://doi.org/10.15479/at:ista:7132
chicago: Mckenzie, Catherine. “Design and Characterization of Methods and Biological
Components to Realize Synthetic Neurotransmission.” Institute of Science and Technology
Austria, 2019. https://doi.org/10.15479/at:ista:7132.
ieee: C. Mckenzie, “Design and characterization of methods and biological components
to realize synthetic neurotransmission,” Institute of Science and Technology Austria,
2019.
ista: Mckenzie C. 2019. Design and characterization of methods and biological components
to realize synthetic neurotransmission. Institute of Science and Technology Austria.
mla: Mckenzie, Catherine. Design and Characterization of Methods and Biological
Components to Realize Synthetic Neurotransmission. Institute of Science and
Technology Austria, 2019, doi:10.15479/at:ista:7132.
short: C. Mckenzie, Design and Characterization of Methods and Biological Components
to Realize Synthetic Neurotransmission, Institute of Science and Technology Austria,
2019.
date_created: 2019-11-27T09:07:14Z
date_published: 2019-06-27T00:00:00Z
date_updated: 2024-03-28T23:30:21Z
day: '27'
ddc:
- '571'
- '573'
degree_awarded: PhD
department:
- _id: HaJa
doi: 10.15479/at:ista:7132
file:
- access_level: closed
checksum: 34d0fe0f6e0af97b5937205a3e350423
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: dernst
date_created: 2019-11-27T09:06:10Z
date_updated: 2020-07-14T12:47:50Z
file_id: '7133'
file_name: McKenzie PhD Thesis August 2018 - Corrected Final.docx
file_size: 5054633
relation: source_file
- access_level: open_access
checksum: 140dfb5e3df7edca34f4b6fcc55d876f
content_type: application/pdf
creator: dernst
date_created: 2019-11-27T09:06:10Z
date_updated: 2020-07-14T12:47:50Z
file_id: '7134'
file_name: McKenzie PhD Thesis August 2018 - Corrected Final.pdf
file_size: 3231837
relation: main_file
file_date_updated: 2020-07-14T12:47:50Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '95'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '6266'
relation: old_edition
status: public
status: public
supervisor:
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
title: Design and characterization of methods and biological components to realize
synthetic neurotransmission
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '5949'
abstract:
- lang: eng
text: Aberrant proteostasis of protein aggregation may lead to behavior disorders
including chronic mental illnesses (CMI). Furthermore, the neuronal activity alterations
that underlie CMI are not well understood. We recorded the local field potential
and single-unit activity of the hippocampal CA1 region in vivo in rats transgenically
overexpressing the Disrupted-in-Schizophrenia 1 (DISC1) gene (tgDISC1), modeling
sporadic CMI. These tgDISC1 rats have previously been shown to exhibit DISC1 protein
aggregation, disturbances in the dopaminergic system and attention-related deficits.
Recordings were performed during exploration of familiar and novel open field
environments and during sleep, allowing investigation of neuronal abnormalities
in unconstrained behavior. Compared to controls, tgDISC1 place cells exhibited
smaller place fields and decreased speed-modulation of their firing rates, demonstrating
altered spatial coding and deficits in encoding location-independent sensory inputs.
Oscillation analyses showed that tgDISC1 pyramidal neurons had higher theta phase
locking strength during novelty, limiting their phase coding ability. However,
their mean theta phases were more variable at the population level, reducing oscillatory
network synchronization. Finally, tgDISC1 pyramidal neurons showed a lack of novelty-induced
shift in their preferred theta and gamma firing phases, indicating deficits in
coding of novel environments with oscillatory firing. By combining single cell
and neuronal population analyses, we link DISC1 protein pathology with abnormal
hippocampal neural coding and network synchrony, and thereby gain a more comprehensive
understanding of CMI mechanisms.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Karola
full_name: Käfer, Karola
id: 2DAA49AA-F248-11E8-B48F-1D18A9856A87
last_name: Käfer
- first_name: Hugo
full_name: Malagon-Vina, Hugo
last_name: Malagon-Vina
- first_name: Desiree
full_name: Dickerson, Desiree
id: 444EB89E-F248-11E8-B48F-1D18A9856A87
last_name: Dickerson
- first_name: Joseph
full_name: O'Neill, Joseph
last_name: O'Neill
- first_name: Svenja V.
full_name: Trossbach, Svenja V.
last_name: Trossbach
- first_name: Carsten
full_name: Korth, Carsten
last_name: Korth
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
citation:
ama: Käfer K, Malagon-Vina H, Dickerson D, et al. Disrupted-in-schizophrenia 1 overexpression
disrupts hippocampal coding and oscillatory synchronization. Hippocampus.
2019;29(9):802-816. doi:10.1002/hipo.23076
apa: Käfer, K., Malagon-Vina, H., Dickerson, D., O’Neill, J., Trossbach, S. V.,
Korth, C., & Csicsvari, J. L. (2019). Disrupted-in-schizophrenia 1 overexpression
disrupts hippocampal coding and oscillatory synchronization. Hippocampus.
Wiley. https://doi.org/10.1002/hipo.23076
chicago: Käfer, Karola, Hugo Malagon-Vina, Desiree Dickerson, Joseph O’Neill, Svenja
V. Trossbach, Carsten Korth, and Jozsef L Csicsvari. “Disrupted-in-Schizophrenia
1 Overexpression Disrupts Hippocampal Coding and Oscillatory Synchronization.”
Hippocampus. Wiley, 2019. https://doi.org/10.1002/hipo.23076.
ieee: K. Käfer et al., “Disrupted-in-schizophrenia 1 overexpression disrupts
hippocampal coding and oscillatory synchronization,” Hippocampus, vol.
29, no. 9. Wiley, pp. 802–816, 2019.
ista: Käfer K, Malagon-Vina H, Dickerson D, O’Neill J, Trossbach SV, Korth C, Csicsvari
JL. 2019. Disrupted-in-schizophrenia 1 overexpression disrupts hippocampal coding
and oscillatory synchronization. Hippocampus. 29(9), 802–816.
mla: Käfer, Karola, et al. “Disrupted-in-Schizophrenia 1 Overexpression Disrupts
Hippocampal Coding and Oscillatory Synchronization.” Hippocampus, vol.
29, no. 9, Wiley, 2019, pp. 802–16, doi:10.1002/hipo.23076.
short: K. Käfer, H. Malagon-Vina, D. Dickerson, J. O’Neill, S.V. Trossbach, C. Korth,
J.L. Csicsvari, Hippocampus 29 (2019) 802–816.
date_created: 2019-02-10T22:59:18Z
date_published: 2019-09-01T00:00:00Z
date_updated: 2024-03-28T23:30:22Z
day: '01'
ddc:
- '570'
department:
- _id: JoCs
doi: 10.1002/hipo.23076
ec_funded: 1
external_id:
isi:
- '000480635400003'
file:
- access_level: open_access
checksum: 5e8de271ca04aef92a5de42d6aac4404
content_type: application/pdf
creator: dernst
date_created: 2019-02-11T10:42:51Z
date_updated: 2020-07-14T12:47:13Z
file_id: '5950'
file_name: 2019_Hippocampus_Kaefer.pdf
file_size: 2132893
relation: main_file
file_date_updated: 2020-07-14T12:47:13Z
has_accepted_license: '1'
intvolume: ' 29'
isi: 1
issue: '9'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 802-816
project:
- _id: 257BBB4C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '607616'
name: Inter-and intracellular signalling in schizophrenia
publication: Hippocampus
publication_status: published
publisher: Wiley
quality_controlled: '1'
related_material:
record:
- id: '6825'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Disrupted-in-schizophrenia 1 overexpression disrupts hippocampal coding and
oscillatory synchronization
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 29
year: '2019'
...
---
_id: '6825'
abstract:
- lang: eng
text: "The solving of complex tasks requires the functions of more than one brain
area and their interaction. Whilst spatial navigation and memory is dependent
on the hippocampus, flexible behavior relies on the medial prefrontal cortex (mPFC).
To further examine the roles of the hippocampus and mPFC, we recorded their neural
activity during a task that depends on both of these brain regions.\r\nWith tetrodes,
we recorded the extracellular activity of dorsal hippocampal CA1 (HPC) and mPFC
neurons in Long-Evans rats performing a rule-switching task on the plus-maze.
The plus-maze task had a spatial component since it required navigation along
one of the two start arms and at the maze center a choice between one of the two
goal arms. Which goal contained a reward depended on the rule currently in place.
After an uncued rule change the animal had to abandon the old strategy and switch
to the new rule, testing cognitive flexibility. Investigating the coordination
of activity between the HPC and mPFC allows determination during which task stages
their interaction is required. Additionally, comparing neural activity patterns
in these two brain regions allows delineation of the specialized functions of
the HPC and mPFC in this task. We analyzed neural activity in the HPC and mPFC
in terms of oscillatory interactions, rule coding and replay.\r\nWe found that
theta coherence between the HPC and mPFC is increased at the center and goals
of the maze, both when the rule was stable or has changed. Similar results were
found for locking of HPC and mPFC neurons to HPC theta oscillations. However,
no differences in HPC-mPFC theta coordination were observed between the spatially-
and cue-guided rule. Phase locking of HPC and mPFC neurons to HPC gamma oscillations
was not modulated by\r\nmaze position or rule type. We found that the HPC coded
for the two different rules with cofiring relationships between\r\ncell pairs.
However, we could not find conclusive evidence for rule coding in the mPFC. Spatially-selective
firing in the mPFC generalized between the two start and two goal arms. With Bayesian
positional decoding, we found that the mPFC reactivated non-local positions during
awake immobility periods. Replay of these non-local positions could represent
entire behavioral trajectories resembling trajectory replay of the HPC. Furthermore,
mPFC\r\ntrajectory-replay at the goal positively correlated with rule-switching
performance. \r\nFinally, HPC and mPFC trajectory replay occurred independently
of each other. These results show that the mPFC can replay ordered patterns of
activity during awake immobility, possibly underlying its role in flexible behavior. "
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Karola
full_name: Käfer, Karola
id: 2DAA49AA-F248-11E8-B48F-1D18A9856A87
last_name: Käfer
citation:
ama: Käfer K. The hippocampus and medial prefrontal cortex during flexible behavior.
2019. doi:10.15479/AT:ISTA:6825
apa: Käfer, K. (2019). The hippocampus and medial prefrontal cortex during flexible
behavior. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6825
chicago: Käfer, Karola. “The Hippocampus and Medial Prefrontal Cortex during Flexible
Behavior.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6825.
ieee: K. Käfer, “The hippocampus and medial prefrontal cortex during flexible behavior,”
Institute of Science and Technology Austria, 2019.
ista: Käfer K. 2019. The hippocampus and medial prefrontal cortex during flexible
behavior. Institute of Science and Technology Austria.
mla: Käfer, Karola. The Hippocampus and Medial Prefrontal Cortex during Flexible
Behavior. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6825.
short: K. Käfer, The Hippocampus and Medial Prefrontal Cortex during Flexible Behavior,
Institute of Science and Technology Austria, 2019.
date_created: 2019-08-21T15:00:57Z
date_published: 2019-08-24T00:00:00Z
date_updated: 2023-09-07T13:01:42Z
day: '24'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: JoCs
doi: 10.15479/AT:ISTA:6825
file:
- access_level: open_access
checksum: 2664420e332a33338568f4f3bfc59287
content_type: application/pdf
creator: kkaefer
date_created: 2019-09-03T08:07:13Z
date_updated: 2020-09-06T22:30:03Z
embargo: 2020-09-05
file_id: '6846'
file_name: Thesis_Kaefer_PDFA.pdf
file_size: 3205202
relation: main_file
request_a_copy: 0
- access_level: closed
checksum: 9a154eab6f07aa590a3d2651dc0d926a
content_type: application/zip
creator: kkaefer
date_created: 2019-09-03T08:07:17Z
date_updated: 2020-09-15T22:30:05Z
embargo_to: open_access
file_id: '6847'
file_name: Thesis_Kaefer.zip
file_size: 2506835
relation: main_file
file_date_updated: 2020-09-15T22:30:05Z
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: '89'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '5949'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
title: The hippocampus and medial prefrontal cortex during flexible behavior
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '6713'
abstract:
- lang: eng
text: Evolutionary studies are often limited by missing data that are critical to
understanding the history of selection. Selection experiments, which reproduce
rapid evolution under controlled conditions, are excellent tools to study how
genomes evolve under selection. Here we present a genomic dissection of the Longshanks
selection experiment, in which mice were selectively bred over 20 generations
for longer tibiae relative to body mass, resulting in 13% longer tibiae in two
replicates. We synthesized evolutionary theory, genome sequences and molecular
genetics to understand the selection response and found that it involved both
polygenic adaptation and discrete loci of major effect, with the strongest loci
tending to be selected in parallel between replicates. We show that selection
may favor de-repression of bone growth through inactivating two limb enhancers
of an inhibitor, Nkx3-2. Our integrative genomic analyses thus show that it is
possible to connect individual base-pair changes to the overall selection response.
article_number: e42014
article_processing_charge: No
author:
- first_name: João Pl
full_name: Castro, João Pl
last_name: Castro
- first_name: Michelle N.
full_name: Yancoskie, Michelle N.
last_name: Yancoskie
- first_name: Marta
full_name: Marchini, Marta
last_name: Marchini
- first_name: Stefanie
full_name: Belohlavy, Stefanie
id: 43FE426A-F248-11E8-B48F-1D18A9856A87
last_name: Belohlavy
orcid: 0000-0002-9849-498X
- first_name: Layla
full_name: Hiramatsu, Layla
last_name: Hiramatsu
- first_name: Marek
full_name: Kučka, Marek
last_name: Kučka
- first_name: William H.
full_name: Beluch, William H.
last_name: Beluch
- first_name: Ronald
full_name: Naumann, Ronald
last_name: Naumann
- first_name: Isabella
full_name: Skuplik, Isabella
last_name: Skuplik
- first_name: John
full_name: Cobb, John
last_name: Cobb
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Campbell
full_name: Rolian, Campbell
last_name: Rolian
- first_name: Yingguang Frank
full_name: Chan, Yingguang Frank
last_name: Chan
citation:
ama: Castro JP, Yancoskie MN, Marchini M, et al. An integrative genomic analysis
of the Longshanks selection experiment for longer limbs in mice. eLife.
2019;8. doi:10.7554/eLife.42014
apa: Castro, J. P., Yancoskie, M. N., Marchini, M., Belohlavy, S., Hiramatsu, L.,
Kučka, M., … Chan, Y. F. (2019). An integrative genomic analysis of the Longshanks
selection experiment for longer limbs in mice. ELife. eLife Sciences Publications.
https://doi.org/10.7554/eLife.42014
chicago: Castro, João Pl, Michelle N. Yancoskie, Marta Marchini, Stefanie Belohlavy,
Layla Hiramatsu, Marek Kučka, William H. Beluch, et al. “An Integrative Genomic
Analysis of the Longshanks Selection Experiment for Longer Limbs in Mice.” ELife.
eLife Sciences Publications, 2019. https://doi.org/10.7554/eLife.42014.
ieee: J. P. Castro et al., “An integrative genomic analysis of the Longshanks
selection experiment for longer limbs in mice,” eLife, vol. 8. eLife Sciences
Publications, 2019.
ista: Castro JP, Yancoskie MN, Marchini M, Belohlavy S, Hiramatsu L, Kučka M, Beluch
WH, Naumann R, Skuplik I, Cobb J, Barton NH, Rolian C, Chan YF. 2019. An integrative
genomic analysis of the Longshanks selection experiment for longer limbs in mice.
eLife. 8, e42014.
mla: Castro, João Pl, et al. “An Integrative Genomic Analysis of the Longshanks
Selection Experiment for Longer Limbs in Mice.” ELife, vol. 8, e42014,
eLife Sciences Publications, 2019, doi:10.7554/eLife.42014.
short: J.P. Castro, M.N. Yancoskie, M. Marchini, S. Belohlavy, L. Hiramatsu, M.
Kučka, W.H. Beluch, R. Naumann, I. Skuplik, J. Cobb, N.H. Barton, C. Rolian, Y.F.
Chan, ELife 8 (2019).
date_created: 2019-07-28T21:59:17Z
date_published: 2019-06-06T00:00:00Z
date_updated: 2024-03-28T23:30:23Z
day: '06'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.7554/eLife.42014
external_id:
isi:
- '000473588700001'
pmid:
- '31169497'
file:
- access_level: open_access
checksum: fa0936fe58f0d9e3f8e75038570e5a17
content_type: application/pdf
creator: apreinsp
date_created: 2019-07-29T07:41:18Z
date_updated: 2020-07-14T12:47:38Z
file_id: '6721'
file_name: 2019_eLife_Castro.pdf
file_size: 6748249
relation: main_file
file_date_updated: 2020-07-14T12:47:38Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
pmid: 1
publication: eLife
publication_status: published
publisher: eLife Sciences Publications
quality_controlled: '1'
related_material:
record:
- id: '9804'
relation: research_data
status: public
- id: '11388'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: An integrative genomic analysis of the Longshanks selection experiment for
longer limbs in mice
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: 8
year: '2019'
...
---
_id: '10065'
abstract:
- lang: eng
text: We study double quantum dots in a Ge/SiGe heterostructure and test their maturity
towards singlet-triplet ($S-T_0$) qubits. We demonstrate a large range of tunability,
from two single quantum dots to a double quantum dot. We measure Pauli spin blockade
and study the anisotropy of the $g$-factor. We use an adjacent quantum dot for
sensing charge transitions in the double quantum dot at interest. In conclusion,
Ge/SiGe possesses all ingredients necessary for building a singlet-triplet qubit.
acknowledged_ssus:
- _id: M-Shop
- _id: NanoFab
acknowledgement: "We thank Matthias Brauns for helpful discussions and careful proofreading
of the manuscript. This project has received funding from the European Union’s Horizon
2020 research and innovation program under the Marie Sklodowska-Curie grant agreement
No 844511 and from the FWF project P30207. The research was supported by the Scientific
Service Units of IST Austria through resources provided by the MIBA machine shop
and the nanofabrication\r\nfacility."
article_number: '1910.05841'
article_processing_charge: No
author:
- first_name: Andrea C
full_name: Hofmann, Andrea C
id: 340F461A-F248-11E8-B48F-1D18A9856A87
last_name: Hofmann
- first_name: Daniel
full_name: Jirovec, Daniel
id: 4C473F58-F248-11E8-B48F-1D18A9856A87
last_name: Jirovec
orcid: 0000-0002-7197-4801
- first_name: Maxim
full_name: Borovkov, Maxim
last_name: Borovkov
- first_name: Ivan
full_name: Prieto Gonzalez, Ivan
id: 2A307FE2-F248-11E8-B48F-1D18A9856A87
last_name: Prieto Gonzalez
orcid: 0000-0002-7370-5357
- first_name: Andrea
full_name: Ballabio, Andrea
last_name: Ballabio
- first_name: Jacopo
full_name: Frigerio, Jacopo
last_name: Frigerio
- first_name: Daniel
full_name: Chrastina, Daniel
last_name: Chrastina
- first_name: Giovanni
full_name: Isella, Giovanni
last_name: Isella
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
citation:
ama: Hofmann AC, Jirovec D, Borovkov M, et al. Assessing the potential of Ge/SiGe
quantum dots as hosts for singlet-triplet qubits. arXiv. doi:10.48550/arXiv.1910.05841
apa: Hofmann, A. C., Jirovec, D., Borovkov, M., Prieto Gonzalez, I., Ballabio, A.,
Frigerio, J., … Katsaros, G. (n.d.). Assessing the potential of Ge/SiGe quantum
dots as hosts for singlet-triplet qubits. arXiv. https://doi.org/10.48550/arXiv.1910.05841
chicago: Hofmann, Andrea C, Daniel Jirovec, Maxim Borovkov, Ivan Prieto Gonzalez,
Andrea Ballabio, Jacopo Frigerio, Daniel Chrastina, Giovanni Isella, and Georgios
Katsaros. “Assessing the Potential of Ge/SiGe Quantum Dots as Hosts for Singlet-Triplet
Qubits.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1910.05841.
ieee: A. C. Hofmann et al., “Assessing the potential of Ge/SiGe quantum dots
as hosts for singlet-triplet qubits,” arXiv. .
ista: Hofmann AC, Jirovec D, Borovkov M, Prieto Gonzalez I, Ballabio A, Frigerio
J, Chrastina D, Isella G, Katsaros G. Assessing the potential of Ge/SiGe quantum
dots as hosts for singlet-triplet qubits. arXiv, 1910.05841.
mla: Hofmann, Andrea C., et al. “Assessing the Potential of Ge/SiGe Quantum Dots
as Hosts for Singlet-Triplet Qubits.” ArXiv, 1910.05841, doi:10.48550/arXiv.1910.05841.
short: A.C. Hofmann, D. Jirovec, M. Borovkov, I. Prieto Gonzalez, A. Ballabio, J.
Frigerio, D. Chrastina, G. Isella, G. Katsaros, ArXiv (n.d.).
date_created: 2021-10-01T12:14:51Z
date_published: 2019-10-13T00:00:00Z
date_updated: 2024-03-28T23:30:27Z
day: '13'
department:
- _id: GeKa
doi: 10.48550/arXiv.1910.05841
ec_funded: 1
external_id:
arxiv:
- '1910.05841'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1910.05841
month: '10'
oa: 1
oa_version: Preprint
project:
- _id: 26A151DA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '844511'
name: Majorana bound states in Ge/SiGe heterostructures
- _id: 2641CE5E-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P30207
name: Hole spin orbit qubits in Ge quantum wells
publication: arXiv
publication_status: submitted
related_material:
record:
- id: '10058'
relation: dissertation_contains
status: public
status: public
title: Assessing the potential of Ge/SiGe quantum dots as hosts for singlet-triplet
qubits
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '6187'
abstract:
- lang: eng
text: Aberrant display of the truncated core1 O-glycan T-antigen is a common feature
of human cancer cells that correlates with metastasis. Here we show that T-antigen
in Drosophila melanogaster macrophages is involved in their developmentally programmed
tissue invasion. Higher macrophage T-antigen levels require an atypical major
facilitator superfamily (MFS) member that we named Minerva which enables macrophage
dissemination and invasion. We characterize for the first time the T and Tn glycoform
O-glycoproteome of the Drosophila melanogaster embryo, and determine that Minerva
increases the presence of T-antigen on proteins in pathways previously linked
to cancer, most strongly on the sulfhydryl oxidase Qsox1 which we show is required
for macrophage tissue entry. Minerva’s vertebrate ortholog, MFSD1, rescues the
minerva mutant’s migration and T-antigen glycosylation defects. We thus identify
a key conserved regulator that orchestrates O-glycosylation on a protein subset
to activate a program governing migration steps important for both development
and cancer metastasis.
acknowledged_ssus:
- _id: LifeSc
article_number: e41801
article_processing_charge: No
author:
- first_name: Katarina
full_name: Valosková, Katarina
id: 46F146FC-F248-11E8-B48F-1D18A9856A87
last_name: Valosková
- first_name: Julia
full_name: Biebl, Julia
id: 3CCBB46E-F248-11E8-B48F-1D18A9856A87
last_name: Biebl
- first_name: Marko
full_name: Roblek, Marko
id: 3047D808-F248-11E8-B48F-1D18A9856A87
last_name: Roblek
orcid: 0000-0001-9588-1389
- first_name: Shamsi
full_name: Emtenani, Shamsi
id: 49D32318-F248-11E8-B48F-1D18A9856A87
last_name: Emtenani
orcid: 0000-0001-6981-6938
- first_name: Attila
full_name: György, Attila
id: 3BCEDBE0-F248-11E8-B48F-1D18A9856A87
last_name: György
orcid: 0000-0002-1819-198X
- first_name: Michaela
full_name: Misova, Michaela
id: 495A3C32-F248-11E8-B48F-1D18A9856A87
last_name: Misova
orcid: 0000-0003-2427-6856
- first_name: Aparna
full_name: Ratheesh, Aparna
id: 2F064CFE-F248-11E8-B48F-1D18A9856A87
last_name: Ratheesh
orcid: 0000-0001-7190-0776
- first_name: Patricia
full_name: Rodrigues, Patricia
id: 2CE4065A-F248-11E8-B48F-1D18A9856A87
last_name: Rodrigues
- first_name: Katerina
full_name: Shkarina, Katerina
last_name: Shkarina
- first_name: Ida Signe Bohse
full_name: Larsen, Ida Signe Bohse
last_name: Larsen
- first_name: Sergey Y
full_name: Vakhrushev, Sergey Y
last_name: Vakhrushev
- first_name: Henrik
full_name: Clausen, Henrik
last_name: Clausen
- first_name: Daria E
full_name: Siekhaus, Daria E
id: 3D224B9E-F248-11E8-B48F-1D18A9856A87
last_name: Siekhaus
orcid: 0000-0001-8323-8353
citation:
ama: Valosková K, Bicher J, Roblek M, et al. A conserved major facilitator superfamily
member orchestrates a subset of O-glycosylation to aid macrophage tissue invasion.
eLife. 2019;8. doi:10.7554/elife.41801
apa: Valosková, K., Bicher, J., Roblek, M., Emtenani, S., György, A., Misova, M.,
… Siekhaus, D. E. (2019). A conserved major facilitator superfamily member orchestrates
a subset of O-glycosylation to aid macrophage tissue invasion. ELife. eLife
Sciences Publications. https://doi.org/10.7554/elife.41801
chicago: Valosková, Katarina, Julia Bicher, Marko Roblek, Shamsi Emtenani, Attila
György, Michaela Misova, Aparna Ratheesh, et al. “A Conserved Major Facilitator
Superfamily Member Orchestrates a Subset of O-Glycosylation to Aid Macrophage
Tissue Invasion.” ELife. eLife Sciences Publications, 2019. https://doi.org/10.7554/elife.41801.
ieee: K. Valosková et al., “A conserved major facilitator superfamily member
orchestrates a subset of O-glycosylation to aid macrophage tissue invasion,” eLife,
vol. 8. eLife Sciences Publications, 2019.
ista: Valosková K, Bicher J, Roblek M, Emtenani S, György A, Misova M, Ratheesh
A, Rodrigues P, Shkarina K, Larsen ISB, Vakhrushev SY, Clausen H, Siekhaus DE.
2019. A conserved major facilitator superfamily member orchestrates a subset of
O-glycosylation to aid macrophage tissue invasion. eLife. 8, e41801.
mla: Valosková, Katarina, et al. “A Conserved Major Facilitator Superfamily Member
Orchestrates a Subset of O-Glycosylation to Aid Macrophage Tissue Invasion.” ELife,
vol. 8, e41801, eLife Sciences Publications, 2019, doi:10.7554/elife.41801.
short: K. Valosková, J. Bicher, M. Roblek, S. Emtenani, A. György, M. Misova, A.
Ratheesh, P. Rodrigues, K. Shkarina, I.S.B. Larsen, S.Y. Vakhrushev, H. Clausen,
D.E. Siekhaus, ELife 8 (2019).
date_created: 2019-03-28T13:37:45Z
date_published: 2019-03-26T00:00:00Z
date_updated: 2024-03-28T23:30:30Z
day: '26'
ddc:
- '570'
department:
- _id: DaSi
doi: 10.7554/elife.41801
ec_funded: 1
external_id:
isi:
- '000462530200001'
file:
- access_level: open_access
checksum: cc0d1a512559d52e7e7cb0e9b9854b40
content_type: application/pdf
creator: dernst
date_created: 2019-03-28T14:00:41Z
date_updated: 2020-07-14T12:47:23Z
file_id: '6188'
file_name: 2019_eLife_Valoskova.pdf
file_size: 4496017
relation: main_file
file_date_updated: 2020-07-14T12:47:23Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
project:
- _id: 253CDE40-B435-11E9-9278-68D0E5697425
grant_number: '24283'
name: Examination of the role of a MFS transporter in the migration of Drosophila
immune cells
- _id: 253B6E48-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P29638
name: The role of Drosophila TNF alpha in immune cell invasion
- _id: 2536F660-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '334077'
name: Investigating the role of transporters in invasive migration through junctions
- _id: 25388084-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '329540'
name: 'Breaking barriers: Investigating the junctional and mechanobiological changes
underlying the ability of Drosophila immune cells to invade an epithelium'
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: eLife
publication_identifier:
issn:
- 2050-084X
publication_status: published
publisher: eLife Sciences Publications
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/new-gene-potentially-involved-in-metastasis-identified/
record:
- id: '6530'
relation: dissertation_contains
- id: '8983'
relation: dissertation_contains
status: public
- id: '6546'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: A conserved major facilitator superfamily member orchestrates a subset of O-glycosylation
to aid macrophage tissue invasion
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: 8
year: '2019'
...
---
_id: '6546'
abstract:
- lang: eng
text: "Invasive migration plays a crucial role not only during development and homeostasis
but also in pathological states, such as tumor metastasis. Drosophila macrophage
migration into the extended germband is an interesting system to study invasive
migration. It carries similarities to immune cell transmigration and cancer cell
invasion, therefore studying this process could also bring new understanding of
invasion in higher organisms. In our work, we uncover a highly conserved member
of the major facilitator family that plays a role in tissue invasion through regulation
of glycosylation on a subgroup of proteins and/or by aiding the precise timing
of DN-Cadherin downregulation. \r\n\r\nAberrant display of the truncated core1
O-glycan T-antigen is a common feature of human cancer cells that correlates with
metastasis. Here we show that T-antigen in Drosophila melanogaster macrophages
is involved in their developmentally programmed tissue invasion. Higher macrophage
T-antigen levels require an atypical major facilitator superfamily (MFS) member
that we named Minerva which enables macrophage dissemination and invasion. We
characterize for the first time the T and Tn glycoform O-glycoproteome of the
Drosophila melanogaster embryo, and determine that Minerva increases the presence
of T-antigen on proteins in pathways previously linked to cancer, most strongly
on the sulfhydryl oxidase Qsox1 which we show is required for macrophage tissue
entry. Minerva’s vertebrate ortholog, MFSD1, rescues the minerva mutant’s migration
and T-antigen glycosylation defects. We thus identify \r\na key conserved regulator
that orchestrates O-glycosylation on a protein subset to activate \r\na program
governing migration steps important for both development and cancer metastasis.
\r\n"
acknowledged_ssus:
- _id: Bio
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Katarina
full_name: Valosková, Katarina
id: 46F146FC-F248-11E8-B48F-1D18A9856A87
last_name: Valosková
citation:
ama: Valosková K. The role of a highly conserved major facilitator superfamily member
in Drosophila embryonic macrophage migration. 2019. doi:10.15479/AT:ISTA:6546
apa: Valosková, K. (2019). The role of a highly conserved major facilitator superfamily
member in Drosophila embryonic macrophage migration. Institute of Science
and Technology Austria. https://doi.org/10.15479/AT:ISTA:6546
chicago: Valosková, Katarina. “The Role of a Highly Conserved Major Facilitator
Superfamily Member in Drosophila Embryonic Macrophage Migration.” Institute of
Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6546.
ieee: K. Valosková, “The role of a highly conserved major facilitator superfamily
member in Drosophila embryonic macrophage migration,” Institute of Science and
Technology Austria, 2019.
ista: Valosková K. 2019. The role of a highly conserved major facilitator superfamily
member in Drosophila embryonic macrophage migration. Institute of Science and
Technology Austria.
mla: Valosková, Katarina. The Role of a Highly Conserved Major Facilitator Superfamily
Member in Drosophila Embryonic Macrophage Migration. Institute of Science
and Technology Austria, 2019, doi:10.15479/AT:ISTA:6546.
short: K. Valosková, The Role of a Highly Conserved Major Facilitator Superfamily
Member in Drosophila Embryonic Macrophage Migration, Institute of Science and
Technology Austria, 2019.
date_created: 2019-06-07T12:49:19Z
date_published: 2019-06-07T00:00:00Z
date_updated: 2023-09-19T10:15:54Z
day: '07'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: DaSi
doi: 10.15479/AT:ISTA:6546
file:
- access_level: closed
checksum: 68949c2d96210b45b981a23e9c9cd93c
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: khribikova
date_created: 2019-06-07T13:00:04Z
date_updated: 2020-07-14T12:47:33Z
embargo_to: open_access
file_id: '6549'
file_name: Katarina Valoskova_PhD thesis_final version.docx
file_size: 14110626
relation: source_file
- access_level: open_access
checksum: 555329cd76e196c96f5278c480ee2e6e
content_type: application/pdf
creator: khribikova
date_created: 2019-06-07T13:00:08Z
date_updated: 2021-02-11T11:17:14Z
embargo: 2020-06-07
file_id: '6550'
file_name: Katarina Valoskova_PhD thesis_final version.pdf
file_size: 10054156
relation: main_file
file_date_updated: 2021-02-11T11:17:14Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '141'
project:
- _id: 253CDE40-B435-11E9-9278-68D0E5697425
grant_number: '24283'
name: Examination of the role of a MFS transporter in the migration of Drosophila
immune cells
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '6187'
relation: part_of_dissertation
status: public
- id: '544'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Daria E
full_name: Siekhaus, Daria E
id: 3D224B9E-F248-11E8-B48F-1D18A9856A87
last_name: Siekhaus
orcid: 0000-0001-8323-8353
title: The role of a highly conserved major facilitator superfamily member in Drosophila
embryonic macrophage migration
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '6363'
abstract:
- lang: eng
text: "Distinguishing between similar experiences is achieved by the brain
\ in a process called pattern separation. In the hippocampus, pattern
\ separation reduces the interference of memories and increases the storage
capacity by decorrelating similar inputs patterns of neuronal activity into
\ non-overlapping output firing patterns. Winners-take-all (WTA) mechanism
\ is a theoretical model for pattern separation in which a \"winner\"
\ cell suppresses the activity of the neighboring neurons through feedback
inhibition. However, if the network properties of the dentate gyrus support WTA
as a biologically conceivable model remains unknown. Here, we showed that the
connectivity rules of PV+interneurons and their synaptic properties are optimizedfor
efficient pattern separation. We found using multiple whole-cell in vitrorecordings
that PV+interneurons mainly connect to granule cells (GC) through lateral inhibition,
a form of feedback inhibition in which a GC inhibits other GCs but not
\ itself through the activation of PV+interneurons. Thus, lateral inhibition
between GC–PV+interneurons was ~10 times more abundant than recurrent connections.
Furthermore, the GC–PV+interneuron connectivity was more spatially confined
\ but less abundant than PV+interneurons–GC connectivity, leading to an
\ asymmetrical distribution of excitatory and inhibitory connectivity. Our
network model of the dentate gyrus with incorporated real connectivity rules efficiently
decorrelates neuronal activity patterns using WTA as the primary mechanism.
\ This process relied on lateral inhibition, fast-signaling properties of
\ PV+interneurons and the asymmetrical distribution of excitatory and inhibitory
connectivity. Finally, we found that silencing the activity of PV+interneurons
in vivoleads to acute deficits in discrimination between similar environments,
suggesting that PV+interneuron networks are necessary for behavioral relevant
computations. Our results demonstrate that PV+interneurons possess unique
connectivity and fast signaling properties that confer to the dentate
\ gyrus network properties that allow the emergence of pattern separation. Thus,
our results contribute to the knowledge of how specific forms of network organization
underlie sophisticated types of information processing. \r\n"
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: 'Claudia '
full_name: 'Espinoza Martinez, Claudia '
id: 31FFEE2E-F248-11E8-B48F-1D18A9856A87
last_name: Espinoza Martinez
orcid: 0000-0003-4710-2082
citation:
ama: Espinoza Martinez C. Parvalbumin+ interneurons enable efficient pattern separation
in hippocampal microcircuits. 2019. doi:10.15479/AT:ISTA:6363
apa: Espinoza Martinez, C. (2019). Parvalbumin+ interneurons enable efficient
pattern separation in hippocampal microcircuits. Institute of Science and
Technology Austria. https://doi.org/10.15479/AT:ISTA:6363
chicago: Espinoza Martinez, Claudia . “Parvalbumin+ Interneurons Enable Efficient
Pattern Separation in Hippocampal Microcircuits.” Institute of Science and Technology
Austria, 2019. https://doi.org/10.15479/AT:ISTA:6363.
ieee: C. Espinoza Martinez, “Parvalbumin+ interneurons enable efficient pattern
separation in hippocampal microcircuits,” Institute of Science and Technology
Austria, 2019.
ista: Espinoza Martinez C. 2019. Parvalbumin+ interneurons enable efficient pattern
separation in hippocampal microcircuits. Institute of Science and Technology Austria.
mla: Espinoza Martinez, Claudia. Parvalbumin+ Interneurons Enable Efficient Pattern
Separation in Hippocampal Microcircuits. Institute of Science and Technology
Austria, 2019, doi:10.15479/AT:ISTA:6363.
short: C. Espinoza Martinez, Parvalbumin+ Interneurons Enable Efficient Pattern
Separation in Hippocampal Microcircuits, Institute of Science and Technology Austria,
2019.
date_created: 2019-04-30T11:56:10Z
date_published: 2019-04-30T00:00:00Z
date_updated: 2023-09-15T12:03:48Z
day: '30'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: PeJo
doi: 10.15479/AT:ISTA:6363
file:
- access_level: open_access
checksum: 77c6c05cfe8b58c8abcf1b854375d084
content_type: application/pdf
creator: cespinoza
date_created: 2019-05-07T16:00:39Z
date_updated: 2021-02-11T11:17:15Z
embargo: 2020-05-09
file_id: '6389'
file_name: Espinozathesis_all2.pdf
file_size: 13966891
relation: main_file
- access_level: closed
checksum: f6aa819f127691a2b0fc21c76eb09746
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: cespinoza
date_created: 2019-05-07T16:00:48Z
date_updated: 2020-07-14T12:47:28Z
embargo_to: open_access
file_id: '6390'
file_name: Espinoza_Thesis.docx
file_size: 11159900
relation: source_file
file_date_updated: 2021-02-11T11:17:15Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '140'
publication_identifier:
isbn:
- 978-3-99078-000-8
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '21'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
title: Parvalbumin+ interneurons enable efficient pattern separation in hippocampal
microcircuits
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '6780'
abstract:
- lang: eng
text: "In this work, we consider the almost-sure termination problem for probabilistic
programs that asks whether a\r\ngiven probabilistic program terminates with probability
1. Scalable approaches for program analysis often\r\nrely on modularity as their
theoretical basis. In non-probabilistic programs, the classical variant rule (V-rule)\r\nof
Floyd-Hoare logic provides the foundation for modular analysis. Extension of this
rule to almost-sure\r\ntermination of probabilistic programs is quite tricky,
and a probabilistic variant was proposed in [16]. While the\r\nproposed probabilistic
variant cautiously addresses the key issue of integrability, we show that the
proposed\r\nmodular rule is still not sound for almost-sure termination of probabilistic
programs.\r\nBesides establishing unsoundness of the previous rule, our contributions
are as follows: First, we present a\r\nsound modular rule for almost-sure termination
of probabilistic programs. Our approach is based on a novel\r\nnotion of descent
supermartingales. Second, for algorithmic approaches, we consider descent supermartingales\r\nthat
are linear and show that they can be synthesized in polynomial time. Finally,
we present experimental\r\nresults on a variety of benchmarks and several natural
examples that model various types of nested while\r\nloops in probabilistic programs
and demonstrate that our approach is able to efficiently prove their almost-sure\r\ntermination
property"
article_number: '129'
article_processing_charge: No
author:
- first_name: Mingzhang
full_name: Huang, Mingzhang
last_name: Huang
- first_name: Hongfei
full_name: Fu, Hongfei
last_name: Fu
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
citation:
ama: 'Huang M, Fu H, Chatterjee K, Goharshady AK. Modular verification for almost-sure
termination of probabilistic programs. In: Proceedings of the 34th ACM International
Conference on Object-Oriented Programming, Systems, Languages, and Applications
. Vol 3. ACM; 2019. doi:10.1145/3360555'
apa: 'Huang, M., Fu, H., Chatterjee, K., & Goharshady, A. K. (2019). Modular
verification for almost-sure termination of probabilistic programs. In Proceedings
of the 34th ACM International Conference on Object-Oriented Programming, Systems,
Languages, and Applications (Vol. 3). Athens, Greece: ACM. https://doi.org/10.1145/3360555'
chicago: Huang, Mingzhang, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar
Goharshady. “Modular Verification for Almost-Sure Termination of Probabilistic
Programs.” In Proceedings of the 34th ACM International Conference on Object-Oriented
Programming, Systems, Languages, and Applications , Vol. 3. ACM, 2019. https://doi.org/10.1145/3360555.
ieee: M. Huang, H. Fu, K. Chatterjee, and A. K. Goharshady, “Modular verification
for almost-sure termination of probabilistic programs,” in Proceedings of the
34th ACM International Conference on Object-Oriented Programming, Systems, Languages,
and Applications , Athens, Greece, 2019, vol. 3.
ista: 'Huang M, Fu H, Chatterjee K, Goharshady AK. 2019. Modular verification for
almost-sure termination of probabilistic programs. Proceedings of the 34th ACM
International Conference on Object-Oriented Programming, Systems, Languages, and
Applications . OOPSLA: Object-oriented Programming, Systems, Languages and Applications
vol. 3, 129.'
mla: Huang, Mingzhang, et al. “Modular Verification for Almost-Sure Termination
of Probabilistic Programs.” Proceedings of the 34th ACM International Conference
on Object-Oriented Programming, Systems, Languages, and Applications , vol.
3, 129, ACM, 2019, doi:10.1145/3360555.
short: M. Huang, H. Fu, K. Chatterjee, A.K. Goharshady, in:, Proceedings of the
34th ACM International Conference on Object-Oriented Programming, Systems, Languages,
and Applications , ACM, 2019.
conference:
end_date: 2019-10-25
location: Athens, Greece
name: 'OOPSLA: Object-oriented Programming, Systems, Languages and Applications'
start_date: 2019-10-23
date_created: 2019-08-09T09:54:20Z
date_published: 2019-10-01T00:00:00Z
date_updated: 2024-03-28T23:30:34Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1145/3360555
ec_funded: 1
external_id:
arxiv:
- '1901.06087'
file:
- access_level: open_access
checksum: 3482d8ace6fb4991eb7810e3b70f1b9f
content_type: application/pdf
creator: akafshda
date_created: 2019-08-12T15:40:57Z
date_updated: 2020-07-14T12:47:40Z
file_id: '6807'
file_name: oopsla-2019.pdf
file_size: 1024643
relation: main_file
- access_level: open_access
checksum: 4e5a6fb2b59a75222a4e8335a5a60eac
content_type: application/pdf
creator: dernst
date_created: 2020-05-12T15:15:14Z
date_updated: 2020-07-14T12:47:40Z
file_id: '7821'
file_name: 2019_ACM_Huang.pdf
file_size: 538579
relation: main_file
file_date_updated: 2020-07-14T12:47:40Z
has_accepted_license: '1'
intvolume: ' 3'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 267066CE-B435-11E9-9278-68D0E5697425
name: Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies
- _id: 266EEEC0-B435-11E9-9278-68D0E5697425
name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart
Contracts
publication: 'Proceedings of the 34th ACM International Conference on Object-Oriented
Programming, Systems, Languages, and Applications '
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
status: public
title: Modular verification for almost-sure termination of probabilistic programs
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 3
year: '2019'
...
---
_id: '6380'
abstract:
- lang: eng
text: 'There is a huge gap between the speeds of modern caches and main memories,
and therefore cache misses account for a considerable loss of efficiency in programs.
The predominant technique to address this issue has been Data Packing: data elements
that are frequently accessed within time proximity are packed into the same cache
block, thereby minimizing accesses to the main memory. We consider the algorithmic
problem of Data Packing on a two-level memory system. Given a reference sequence
R of accesses to data elements, the task is to partition the elements into cache
blocks such that the number of cache misses on R is minimized. The problem is
notoriously difficult: it is NP-hard even when the cache has size 1, and is hard
to approximate for any cache size larger than 4. Therefore, all existing techniques
for Data Packing are based on heuristics and lack theoretical guarantees. In this
work, we present the first positive theoretical results for Data Packing, along
with new and stronger negative results. We consider the problem under the lens
of the underlying access hypergraphs, which are hypergraphs of affinities between
the data elements, where the order of an access hypergraph corresponds to the
size of the affinity group. We study the problem parameterized by the treewidth
of access hypergraphs, which is a standard notion in graph theory to measure the
closeness of a graph to a tree. Our main results are as follows: We show there
is a number q* depending on the cache parameters such that (a) if the access hypergraph
of order q* has constant treewidth, then there is a linear-time algorithm for
Data Packing; (b)the Data Packing problem remains NP-hard even if the access hypergraph
of order q*-1 has constant treewidth. Thus, we establish a fine-grained dichotomy
depending on a single parameter, namely, the highest order among access hypegraphs
that have constant treewidth; and establish the optimal value q* of this parameter.
Finally, we present an experimental evaluation of a prototype implementation of
our algorithm. Our results demonstrate that, in practice, access hypergraphs of
many commonly-used algorithms have small treewidth. We compare our approach with
several state-of-the-art heuristic-based algorithms and show that our algorithm
leads to significantly fewer cache-misses. '
article_number: '53'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Nastaran
full_name: Okati, Nastaran
last_name: Okati
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: Chatterjee K, Goharshady AK, Okati N, Pavlogiannis A. Efficient parameterized
algorithms for data packing. Proceedings of the ACM on Programming Languages.
2019;3(POPL). doi:10.1145/3290366
apa: Chatterjee, K., Goharshady, A. K., Okati, N., & Pavlogiannis, A. (2019).
Efficient parameterized algorithms for data packing. Proceedings of the ACM
on Programming Languages. ACM. https://doi.org/10.1145/3290366
chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Nastaran Okati, and Andreas
Pavlogiannis. “Efficient Parameterized Algorithms for Data Packing.” Proceedings
of the ACM on Programming Languages. ACM, 2019. https://doi.org/10.1145/3290366.
ieee: K. Chatterjee, A. K. Goharshady, N. Okati, and A. Pavlogiannis, “Efficient
parameterized algorithms for data packing,” Proceedings of the ACM on Programming
Languages, vol. 3, no. POPL. ACM, 2019.
ista: Chatterjee K, Goharshady AK, Okati N, Pavlogiannis A. 2019. Efficient parameterized
algorithms for data packing. Proceedings of the ACM on Programming Languages.
3(POPL), 53.
mla: Chatterjee, Krishnendu, et al. “Efficient Parameterized Algorithms for Data
Packing.” Proceedings of the ACM on Programming Languages, vol. 3, no.
POPL, 53, ACM, 2019, doi:10.1145/3290366.
short: K. Chatterjee, A.K. Goharshady, N. Okati, A. Pavlogiannis, Proceedings of
the ACM on Programming Languages 3 (2019).
date_created: 2019-05-06T12:18:17Z
date_published: 2019-01-01T00:00:00Z
date_updated: 2024-03-28T23:30:33Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.1145/3290366
ec_funded: 1
file:
- access_level: open_access
checksum: c157752f96877b36685ad7063ada4524
content_type: application/pdf
creator: dernst
date_created: 2019-05-06T12:23:11Z
date_updated: 2020-07-14T12:47:29Z
file_id: '6381'
file_name: 2019_ACM_POPL_Chatterjee.pdf
file_size: 1294962
relation: main_file
file_date_updated: 2020-07-14T12:47:29Z
has_accepted_license: '1'
intvolume: ' 3'
issue: POPL
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: Proceedings of the ACM on Programming Languages
publication_identifier:
issn:
- 2475-1421
publication_status: published
publisher: ACM
pubrep_id: '1056'
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
status: public
title: Efficient parameterized algorithms for data packing
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: 3
year: '2019'
...
---
_id: '6056'
abstract:
- lang: eng
text: In today's programmable blockchains, smart contracts are limited to being
deterministic and non-probabilistic. This lack of randomness is a consequential
limitation, given that a wide variety of real-world financial contracts, such
as casino games and lotteries, depend entirely on randomness. As a result, several
ad-hoc random number generation approaches have been developed to be used in smart
contracts. These include ideas such as using an oracle or relying on the block
hash. However, these approaches are manipulatable, i.e. their output can be tampered
with by parties who might not be neutral, such as the owner of the oracle or the
miners.We propose a novel game-theoretic approach for generating provably unmanipulatable
pseudorandom numbers on the blockchain. Our approach allows smart contracts to
access a trustworthy source of randomness that does not rely on potentially compromised
miners or oracles, hence enabling the creation of a new generation of smart contracts
that are not limited to being non-probabilistic and can be drawn from the much
more general class of probabilistic programs.
article_number: '8751326'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Arash
full_name: Pourdamghani, Arash
last_name: Pourdamghani
citation:
ama: 'Chatterjee K, Goharshady AK, Pourdamghani A. Probabilistic smart contracts:
Secure randomness on the blockchain. In: IEEE International Conference on Blockchain
and Cryptocurrency. IEEE; 2019. doi:10.1109/BLOC.2019.8751326'
apa: 'Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Probabilistic
smart contracts: Secure randomness on the blockchain. In IEEE International
Conference on Blockchain and Cryptocurrency. Seoul, Korea: IEEE. https://doi.org/10.1109/BLOC.2019.8751326'
chicago: 'Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani.
“Probabilistic Smart Contracts: Secure Randomness on the Blockchain.” In IEEE
International Conference on Blockchain and Cryptocurrency. IEEE, 2019. https://doi.org/10.1109/BLOC.2019.8751326.'
ieee: 'K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Probabilistic smart
contracts: Secure randomness on the blockchain,” in IEEE International Conference
on Blockchain and Cryptocurrency, Seoul, Korea, 2019.'
ista: 'Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Probabilistic smart contracts:
Secure randomness on the blockchain. IEEE International Conference on Blockchain
and Cryptocurrency. IEEE International Conference on Blockchain and Cryptocurrency,
8751326.'
mla: 'Chatterjee, Krishnendu, et al. “Probabilistic Smart Contracts: Secure Randomness
on the Blockchain.” IEEE International Conference on Blockchain and Cryptocurrency,
8751326, IEEE, 2019, doi:10.1109/BLOC.2019.8751326.'
short: K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, IEEE International
Conference on Blockchain and Cryptocurrency, IEEE, 2019.
conference:
end_date: 2019-05-17
location: Seoul, Korea
name: IEEE International Conference on Blockchain and Cryptocurrency
start_date: 2019-05-14
date_created: 2019-02-26T09:03:15Z
date_published: 2019-05-01T00:00:00Z
date_updated: 2024-03-28T23:30:33Z
day: '01'
department:
- _id: KrCh
doi: 10.1109/BLOC.2019.8751326
ec_funded: 1
external_id:
arxiv:
- '1902.07986'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1902.07986
month: '05'
oa: 1
oa_version: Preprint
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 266EEEC0-B435-11E9-9278-68D0E5697425
name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart
Contracts
- _id: 267066CE-B435-11E9-9278-68D0E5697425
name: Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies
publication: IEEE International Conference on Blockchain and Cryptocurrency
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: 'Probabilistic smart contracts: Secure randomness on the blockchain'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '6378'
abstract:
- lang: eng
text: 'In today''s cryptocurrencies, Hashcash proof of work is the most commonly-adopted
approach to mining. In Hashcash, when a miner decides to add a block to the chain,
she has to solve the difficult computational puzzle of inverting a hash function.
While Hashcash has been successfully adopted in both Bitcoin and Ethereum, it
has attracted significant and harsh criticism due to its massive waste of electricity,
its carbon footprint and environmental effects, and the inherent lack of usefulness
in inverting a hash function. Various other mining protocols have been suggested,
including proof of stake, in which a miner''s chance of adding the next block
is proportional to her current balance. However, such protocols lead to a higher
entry cost for new miners who might not still have any stake in the cryptocurrency,
and can in the worst case lead to an oligopoly, where the rich have complete control
over mining. In this paper, we propose Hybrid Mining: a new mining protocol that
combines solving real-world useful problems with Hashcash. Our protocol allows
new miners to join the network by taking part in Hashcash mining without having
to own an initial stake. It also allows nodes of the network to submit hard computational
problems whose solutions are of interest in the real world, e.g.~protein folding
problems. Then, miners can choose to compete in solving these problems, in lieu
of Hashcash, for adding a new block. Hence, Hybrid Mining incentivizes miners
to solve useful problems, such as hard computational problems arising in biology,
in a distributed manner. It also gives researchers in other areas an easy-to-use
tool to outsource their hard computations to the blockchain network, which has
enormous computational power, by paying a reward to the miner who solves the problem
for them. Moreover, our protocol provides strong security guarantees and is at
least as resilient to double spending as Bitcoin.'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Arash
full_name: Pourdamghani, Arash
last_name: Pourdamghani
citation:
ama: 'Chatterjee K, Goharshady AK, Pourdamghani A. Hybrid Mining: Exploiting blockchain’s
computational power for distributed problem solving. In: Proceedings of the
34th ACM Symposium on Applied Computing. Vol Part F147772. ACM; 2019:374-381.
doi:10.1145/3297280.3297319'
apa: 'Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Hybrid Mining:
Exploiting blockchain’s computational power for distributed problem solving. In
Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772,
pp. 374–381). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297319'
chicago: 'Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani.
“Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem
Solving.” In Proceedings of the 34th ACM Symposium on Applied Computing,
Part F147772:374–81. ACM, 2019. https://doi.org/10.1145/3297280.3297319.'
ieee: 'K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Hybrid Mining: Exploiting
blockchain’s computational power for distributed problem solving,” in Proceedings
of the 34th ACM Symposium on Applied Computing, Limassol, Cyprus, 2019, vol.
Part F147772, pp. 374–381.'
ista: 'Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Hybrid Mining: Exploiting
blockchain’s computational power for distributed problem solving. Proceedings
of the 34th ACM Symposium on Applied Computing. ACM Symposium on Applied Computing
vol. Part F147772, 374–381.'
mla: 'Chatterjee, Krishnendu, et al. “Hybrid Mining: Exploiting Blockchain’s Computational
Power for Distributed Problem Solving.” Proceedings of the 34th ACM Symposium
on Applied Computing, vol. Part F147772, ACM, 2019, pp. 374–81, doi:10.1145/3297280.3297319.'
short: K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, Proceedings of the
34th ACM Symposium on Applied Computing, ACM, 2019, pp. 374–381.
conference:
end_date: 2019-04-12
location: Limassol, Cyprus
name: ACM Symposium on Applied Computing
start_date: 2019-04-08
date_created: 2019-05-06T12:11:36Z
date_published: 2019-04-01T00:00:00Z
date_updated: 2024-03-28T23:30:34Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.1145/3297280.3297319
ec_funded: 1
external_id:
isi:
- '000474685800049'
file:
- access_level: open_access
checksum: fbfbcd5a0c7a743862bfc3045539a614
content_type: application/pdf
creator: dernst
date_created: 2019-05-06T12:09:27Z
date_updated: 2020-07-14T12:47:29Z
file_id: '6379'
file_name: 2019_ACM_Chatterjee.pdf
file_size: 1023934
relation: main_file
file_date_updated: 2020-07-14T12:47:29Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Submitted Version
page: 374-381
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Proceedings of the 34th ACM Symposium on Applied Computing
publication_identifier:
isbn:
- '9781450359337'
publication_status: published
publisher: ACM
pubrep_id: '1069'
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Hybrid Mining: Exploiting blockchain’s computational power for distributed
problem solving'
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: Part F147772
year: '2019'
...
---
_id: '6175'
abstract:
- lang: eng
text: "We consider the problem of expected cost analysis over nondeterministic probabilistic
programs,\r\nwhich aims at automated methods for analyzing the resource-usage
of such programs.\r\nPrevious approaches for this problem could only handle nonnegative
bounded costs.\r\nHowever, in many scenarios, such as queuing networks or analysis
of cryptocurrency protocols,\r\nboth positive and negative costs are necessary
and the costs are unbounded as well.\r\n\r\nIn this work, we present a sound and
efficient approach to obtain polynomial bounds on the\r\nexpected accumulated
cost of nondeterministic probabilistic programs.\r\nOur approach can handle (a)
general positive and negative costs with bounded updates in\r\nvariables; and
(b) nonnegative costs with general updates to variables.\r\nWe show that several
natural examples which could not be\r\nhandled by previous approaches are captured
in our framework.\r\n\r\nMoreover, our approach leads to an efficient polynomial-time
algorithm, while no\r\nprevious approach for cost analysis of probabilistic programs
could guarantee polynomial runtime.\r\nFinally, we show the effectiveness of our
approach using experimental results on a variety of programs for which we efficiently
synthesize tight resource-usage bounds."
article_processing_charge: No
author:
- first_name: Peixin
full_name: Wang, Peixin
last_name: Wang
- first_name: Hongfei
full_name: Fu, Hongfei
id: 3AAD03D6-F248-11E8-B48F-1D18A9856A87
last_name: Fu
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Xudong
full_name: Qin, Xudong
last_name: Qin
- first_name: Wenjun
full_name: Shi, Wenjun
last_name: Shi
citation:
ama: 'Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. Cost analysis of
nondeterministic probabilistic programs. In: PLDI 2019: Proceedings of the
40th ACM SIGPLAN Conference on Programming Language Design and Implementation.
Association for Computing Machinery; 2019:204-220. doi:10.1145/3314221.3314581'
apa: 'Wang, P., Fu, H., Goharshady, A. K., Chatterjee, K., Qin, X., & Shi, W.
(2019). Cost analysis of nondeterministic probabilistic programs. In PLDI 2019:
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design
and Implementation (pp. 204–220). Phoenix, AZ, United States: Association
for Computing Machinery. https://doi.org/10.1145/3314221.3314581'
chicago: 'Wang, Peixin, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee,
Xudong Qin, and Wenjun Shi. “Cost Analysis of Nondeterministic Probabilistic Programs.”
In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming
Language Design and Implementation, 204–20. Association for Computing Machinery,
2019. https://doi.org/10.1145/3314221.3314581.'
ieee: 'P. Wang, H. Fu, A. K. Goharshady, K. Chatterjee, X. Qin, and W. Shi, “Cost
analysis of nondeterministic probabilistic programs,” in PLDI 2019: Proceedings
of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation,
Phoenix, AZ, United States, 2019, pp. 204–220.'
ista: 'Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. 2019. Cost analysis
of nondeterministic probabilistic programs. PLDI 2019: Proceedings of the 40th
ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI:
Conference on Programming Language Design and Implementation, 204–220.'
mla: 'Wang, Peixin, et al. “Cost Analysis of Nondeterministic Probabilistic Programs.”
PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language
Design and Implementation, Association for Computing Machinery, 2019, pp.
204–20, doi:10.1145/3314221.3314581.'
short: 'P. Wang, H. Fu, A.K. Goharshady, K. Chatterjee, X. Qin, W. Shi, in:, PLDI
2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design
and Implementation, Association for Computing Machinery, 2019, pp. 204–220.'
conference:
end_date: 2019-06-26
location: Phoenix, AZ, United States
name: 'PLDI: Conference on Programming Language Design and Implementation'
start_date: 2019-06-22
date_created: 2019-03-25T10:13:25Z
date_published: 2019-06-08T00:00:00Z
date_updated: 2024-03-28T23:30:34Z
day: '08'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1145/3314221.3314581
ec_funded: 1
external_id:
arxiv:
- '1902.04659'
isi:
- '000523190300014'
file:
- access_level: open_access
checksum: 703a5e9b8c8587f2a44085ffd9a4db64
content_type: application/pdf
creator: akafshda
date_created: 2019-03-25T10:11:22Z
date_updated: 2020-07-14T12:47:20Z
file_id: '6176'
file_name: paper.pdf
file_size: 4051066
relation: main_file
file_date_updated: 2020-07-14T12:47:20Z
has_accepted_license: '1'
isi: 1
keyword:
- Program Cost Analysis
- Program Termination
- Probabilistic Programs
- Martingales
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 204-220
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 266EEEC0-B435-11E9-9278-68D0E5697425
name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart
Contracts
publication: 'PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming
Language Design and Implementation'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '5457'
relation: earlier_version
status: public
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Cost analysis of nondeterministic probabilistic programs
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2019'
...
---
_id: '6490'
abstract:
- lang: eng
text: "Smart contracts are programs that are stored and executed on the Blockchain
and can receive, manage and transfer money (cryptocurrency units). Two important
problems regarding smart contracts are formal analysis and compiler optimization.
Formal analysis is extremely important, because smart contracts hold funds worth
billions of dollars and their code is immutable after deployment. Hence, an undetected
bug can cause significant financial losses. Compiler optimization is also crucial,
because every action of a smart contract has to be executed by every node in the
Blockchain network. Therefore, optimizations in compiling smart contracts can
lead to significant savings in computation, time and energy.\r\n\r\nTwo classical
approaches in program analysis and compiler optimization are intraprocedural and
interprocedural analysis. In intraprocedural analysis, each function is analyzed
separately, while interprocedural analysis considers the entire program. In both
cases, the analyses are usually reduced to graph problems over the control flow
graph (CFG) of the program. These graph problems are often computationally expensive.
Hence, there has been ample research on exploiting structural properties of CFGs
for efficient algorithms. One such well-studied property is the treewidth, which
is a measure of tree-likeness of graphs. It is known that intraprocedural CFGs
of structured programs have treewidth at most 6, whereas the interprocedural treewidth
cannot be bounded. This result has been used as a basis for many efficient intraprocedural
analyses.\r\n\r\nIn this paper, we explore the idea of exploiting the treewidth
of smart contracts for formal analysis and compiler optimization. First, similar
to classical programs, we show that the intraprocedural treewidth of structured
Solidity and Vyper smart contracts is at most 9. Second, for global analysis,
we prove that the interprocedural treewidth of structured smart contracts is bounded
by 10 and, in sharp contrast with classical programs, treewidth-based algorithms
can be easily applied for interprocedural analysis. Finally, we supplement our
theoretical results with experiments using a tool we implemented for computing
treewidth of smart contracts and show that the treewidth is much lower in practice.
We use 36,764 real-world Ethereum smart contracts as benchmarks and find that
they have an average treewidth of at most 3.35 for the intraprocedural case and
3.65 for the interprocedural case.\r\n"
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Ehsan Kafshdar
full_name: Goharshady, Ehsan Kafshdar
last_name: Goharshady
citation:
ama: 'Chatterjee K, Goharshady AK, Goharshady EK. The treewidth of smart contracts.
In: Proceedings of the 34th ACM Symposium on Applied Computing. Vol Part
F147772. ACM; :400-408. doi:10.1145/3297280.3297322'
apa: 'Chatterjee, K., Goharshady, A. K., & Goharshady, E. K. (n.d.). The treewidth
of smart contracts. In Proceedings of the 34th ACM Symposium on Applied Computing
(Vol. Part F147772, pp. 400–408). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297322'
chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Ehsan Kafshdar Goharshady.
“The Treewidth of Smart Contracts.” In Proceedings of the 34th ACM Symposium
on Applied Computing, Part F147772:400–408. ACM, n.d. https://doi.org/10.1145/3297280.3297322.
ieee: K. Chatterjee, A. K. Goharshady, and E. K. Goharshady, “The treewidth of smart
contracts,” in Proceedings of the 34th ACM Symposium on Applied Computing,
Limassol, Cyprus, vol. Part F147772, pp. 400–408.
ista: 'Chatterjee K, Goharshady AK, Goharshady EK. The treewidth of smart contracts.
Proceedings of the 34th ACM Symposium on Applied Computing. SAC: Symposium on
Applied Computing vol. Part F147772, 400–408.'
mla: Chatterjee, Krishnendu, et al. “The Treewidth of Smart Contracts.” Proceedings
of the 34th ACM Symposium on Applied Computing, vol. Part F147772, ACM, pp.
400–08, doi:10.1145/3297280.3297322.
short: K. Chatterjee, A.K. Goharshady, E.K. Goharshady, in:, Proceedings of the
34th ACM Symposium on Applied Computing, ACM, n.d., pp. 400–408.
conference:
end_date: 2019-04-12
location: Limassol, Cyprus
name: 'SAC: Symposium on Applied Computing'
start_date: 2019-04-08
date_created: 2019-05-26T21:59:15Z
date_published: 2019-04-01T00:00:00Z
date_updated: 2024-03-28T23:30:34Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1145/3297280.3297322
external_id:
isi:
- '000474685800052'
file:
- access_level: open_access
checksum: dddc20f6d9881f23b8755eb720ec9d6f
content_type: application/pdf
creator: dernst
date_created: 2020-05-14T09:50:11Z
date_updated: 2020-07-14T12:47:32Z
file_id: '7827'
file_name: 2019_ACM_Chatterjee.pdf
file_size: 6937138
relation: main_file
file_date_updated: 2020-07-14T12:47:32Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Submitted Version
page: 400-408
publication: Proceedings of the 34th ACM Symposium on Applied Computing
publication_identifier:
isbn:
- '9781450359337'
publication_status: submitted
publisher: ACM
pubrep_id: '1070'
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: The treewidth of smart contracts
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: Part F147772
year: '2019'
...
---
_id: '7158'
abstract:
- lang: eng
text: "Interprocedural analysis is at the heart of numerous applications in programming
languages, such as alias analysis, constant propagation, and so on. Recursive
state machines (RSMs) are standard models for interprocedural analysis. We consider
a general framework with RSMs where the transitions are labeled from a semiring
and path properties are algebraic with semiring operations. RSMs with algebraic
path properties can model interprocedural dataflow analysis problems, the shortest
path problem, the most probable path problem, and so on. The traditional algorithms
for interprocedural analysis focus on path properties where the starting point
is fixed as the entry point of a specific method. In this work, we consider possible
multiple queries as required in many applications such as in alias analysis. The
study of multiple queries allows us to bring in an important algorithmic distinction
between the resource usage of the one-time preprocessing vs for each individual
query. The second aspect we consider is that the control flow graphs for most
programs have constant treewidth.\r\n\r\nOur main contributions are simple and
implementable algorithms that support multiple queries for algebraic path properties
for RSMs that have constant treewidth. Our theoretical results show that our algorithms
have small additional one-time preprocessing but can answer subsequent queries
significantly faster as compared to the current algorithmic solutions for interprocedural
dataflow analysis. We have also implemented our algorithms and evaluated their
performance for performing on-demand interprocedural dataflow analysis on various
domains, such as for live variable analysis and reaching definitions, on a standard
benchmark set. Our experimental results align with our theoretical statements
and show that after a lightweight preprocessing, on-demand queries are answered
much faster than the standard existing algorithmic approaches.\r\n"
article_number: '23'
article_processing_charge: No
article_type: original
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Prateesh
full_name: Goyal, Prateesh
last_name: Goyal
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. Faster
algorithms for dynamic algebraic queries in basic RSMs with constant treewidth.
ACM Transactions on Programming Languages and Systems. 2019;41(4). doi:10.1145/3363525
apa: Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R., & Pavlogiannis,
A. (2019). Faster algorithms for dynamic algebraic queries in basic RSMs with
constant treewidth. ACM Transactions on Programming Languages and Systems.
ACM. https://doi.org/10.1145/3363525
chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus
Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Dynamic Algebraic
Queries in Basic RSMs with Constant Treewidth.” ACM Transactions on Programming
Languages and Systems. ACM, 2019. https://doi.org/10.1145/3363525.
ieee: K. Chatterjee, A. K. Goharshady, P. Goyal, R. Ibsen-Jensen, and A. Pavlogiannis,
“Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth,”
ACM Transactions on Programming Languages and Systems, vol. 41, no. 4.
ACM, 2019.
ista: Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. 2019.
Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth.
ACM Transactions on Programming Languages and Systems. 41(4), 23.
mla: Chatterjee, Krishnendu, et al. “Faster Algorithms for Dynamic Algebraic Queries
in Basic RSMs with Constant Treewidth.” ACM Transactions on Programming Languages
and Systems, vol. 41, no. 4, 23, ACM, 2019, doi:10.1145/3363525.
short: K. Chatterjee, A.K. Goharshady, P. Goyal, R. Ibsen-Jensen, A. Pavlogiannis,
ACM Transactions on Programming Languages and Systems 41 (2019).
date_created: 2019-12-09T08:33:33Z
date_published: 2019-11-01T00:00:00Z
date_updated: 2024-03-28T23:30:34Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1145/3363525
ec_funded: 1
external_id:
isi:
- '000564108400004'
file:
- access_level: open_access
checksum: 291cc86a07bd010d4815e177dac57b70
content_type: application/pdf
creator: dernst
date_created: 2020-10-08T12:58:10Z
date_updated: 2020-10-08T12:58:10Z
file_id: '8632'
file_name: 2019_ACMTransactions_Chatterjee.pdf
file_size: 667357
relation: main_file
success: 1
file_date_updated: 2020-10-08T12:58:10Z
has_accepted_license: '1'
intvolume: ' 41'
isi: 1
issue: '4'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: ACM Transactions on Programming Languages and Systems
publication_identifier:
issn:
- 0164-0925
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Faster algorithms for dynamic algebraic queries in basic RSMs with constant
treewidth
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 41
year: '2019'
...
---
_id: '7014'
abstract:
- lang: eng
text: "We study the problem of developing efficient approaches for proving\r\nworst-case
bounds of non-deterministic recursive programs. Ranking functions\r\nare sound
and complete for proving termination and worst-case bounds of\r\nnonrecursive
programs. First, we apply ranking functions to recursion,\r\nresulting in measure
functions. We show that measure functions provide a sound\r\nand complete approach
to prove worst-case bounds of non-deterministic recursive\r\nprograms. Our second
contribution is the synthesis of measure functions in\r\nnonpolynomial forms.
We show that non-polynomial measure functions with\r\nlogarithm and exponentiation
can be synthesized through abstraction of\r\nlogarithmic or exponentiation terms,
Farkas' Lemma, and Handelman's Theorem\r\nusing linear programming. While previous
methods obtain worst-case polynomial\r\nbounds, our approach can synthesize bounds
of the form $\\mathcal{O}(n\\log n)$\r\nas well as $\\mathcal{O}(n^r)$ where $r$
is not an integer. We present\r\nexperimental results to demonstrate that our
approach can obtain efficiently\r\nworst-case bounds of classical recursive algorithms
such as (i) Merge-Sort, the\r\ndivide-and-conquer algorithm for the Closest-Pair
problem, where we obtain\r\n$\\mathcal{O}(n \\log n)$ worst-case bound, and (ii)
Karatsuba's algorithm for\r\npolynomial multiplication and Strassen's algorithm
for matrix multiplication,\r\nwhere we obtain $\\mathcal{O}(n^r)$ bound such that
$r$ is not an integer and\r\nclose to the best-known bounds for the respective
algorithms."
article_number: '20'
article_processing_charge: No
article_type: original
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Hongfei
full_name: Fu, Hongfei
last_name: Fu
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
citation:
ama: Chatterjee K, Fu H, Goharshady AK. Non-polynomial worst-case analysis of recursive
programs. ACM Transactions on Programming Languages and Systems. 2019;41(4).
doi:10.1145/3339984
apa: Chatterjee, K., Fu, H., & Goharshady, A. K. (2019). Non-polynomial worst-case
analysis of recursive programs. ACM Transactions on Programming Languages and
Systems. ACM. https://doi.org/10.1145/3339984
chicago: Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial
Worst-Case Analysis of Recursive Programs.” ACM Transactions on Programming
Languages and Systems. ACM, 2019. https://doi.org/10.1145/3339984.
ieee: K. Chatterjee, H. Fu, and A. K. Goharshady, “Non-polynomial worst-case analysis
of recursive programs,” ACM Transactions on Programming Languages and Systems,
vol. 41, no. 4. ACM, 2019.
ista: Chatterjee K, Fu H, Goharshady AK. 2019. Non-polynomial worst-case analysis
of recursive programs. ACM Transactions on Programming Languages and Systems.
41(4), 20.
mla: Chatterjee, Krishnendu, et al. “Non-Polynomial Worst-Case Analysis of Recursive
Programs.” ACM Transactions on Programming Languages and Systems, vol.
41, no. 4, 20, ACM, 2019, doi:10.1145/3339984.
short: K. Chatterjee, H. Fu, A.K. Goharshady, ACM Transactions on Programming Languages
and Systems 41 (2019).
date_created: 2019-11-13T08:33:43Z
date_published: 2019-10-01T00:00:00Z
date_updated: 2024-03-28T23:30:34Z
day: '01'
department:
- _id: KrCh
doi: 10.1145/3339984
ec_funded: 1
external_id:
arxiv:
- '1705.00317'
isi:
- '000564108400001'
intvolume: ' 41'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1705.00317
month: '10'
oa: 1
oa_version: Preprint
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 267066CE-B435-11E9-9278-68D0E5697425
name: Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies
- _id: 266EEEC0-B435-11E9-9278-68D0E5697425
name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart
Contracts
publication: ACM Transactions on Programming Languages and Systems
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
record:
- id: '639'
relation: earlier_version
status: public
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Non-polynomial worst-case analysis of recursive programs
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 41
year: '2019'
...
---
_id: '6486'
abstract:
- lang: eng
text: Based on a novel control scheme, where a steady modification of the streamwise
velocity profile leads to complete relaminarization of initially fully turbulent
pipe flow, we investigate the applicability and usefulness of custom-shaped honeycombs
for such control. The custom-shaped honeycombs are used as stationary flow management
devices which generate specific modifications of the streamwise velocity profile.
Stereoscopic particle image velocimetry and pressure drop measurements are used
to investigate and capture the development of the relaminarizing flow downstream
these devices. We compare the performance of straight (constant length across
the radius of the pipe) honeycombs with custom-shaped ones (variable length across
the radius) and try to determine the optimal shape for maximal relaminarization
at minimal pressure loss. The optimally modified streamwise velocity profile is
found to be M-shaped, and the maximum attainable Reynolds number for total relaminarization
is found to be of the order of 10,000. Consequently, the respective reduction
in skin friction downstream of the device is almost by a factor of 5. The break-even
point, where the additional pressure drop caused by the device is balanced by
the savings due to relaminarization and a net gain is obtained, corresponds to
a downstream stretch of distances as low as approximately 100 pipe diameters of
laminar flow.
acknowledged_ssus:
- _id: M-Shop
article_number: '111105'
article_processing_charge: No
article_type: original
author:
- first_name: Jakob
full_name: Kühnen, Jakob
id: 3A47AE32-F248-11E8-B48F-1D18A9856A87
last_name: Kühnen
orcid: 0000-0003-4312-0179
- first_name: Davide
full_name: Scarselli, Davide
id: 40315C30-F248-11E8-B48F-1D18A9856A87
last_name: Scarselli
orcid: 0000-0001-5227-4271
- 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: Kühnen J, Scarselli D, Hof B. Relaminarization of pipe flow by means of 3D-printed
shaped honeycombs. Journal of Fluids Engineering. 2019;141(11). doi:10.1115/1.4043494
apa: Kühnen, J., Scarselli, D., & Hof, B. (2019). Relaminarization of pipe flow
by means of 3D-printed shaped honeycombs. Journal of Fluids Engineering.
ASME. https://doi.org/10.1115/1.4043494
chicago: Kühnen, Jakob, Davide Scarselli, and Björn Hof. “Relaminarization of Pipe
Flow by Means of 3D-Printed Shaped Honeycombs.” Journal of Fluids Engineering.
ASME, 2019. https://doi.org/10.1115/1.4043494.
ieee: J. Kühnen, D. Scarselli, and B. Hof, “Relaminarization of pipe flow by means
of 3D-printed shaped honeycombs,” Journal of Fluids Engineering, vol. 141,
no. 11. ASME, 2019.
ista: Kühnen J, Scarselli D, Hof B. 2019. Relaminarization of pipe flow by means
of 3D-printed shaped honeycombs. Journal of Fluids Engineering. 141(11), 111105.
mla: Kühnen, Jakob, et al. “Relaminarization of Pipe Flow by Means of 3D-Printed
Shaped Honeycombs.” Journal of Fluids Engineering, vol. 141, no. 11, 111105,
ASME, 2019, doi:10.1115/1.4043494.
short: J. Kühnen, D. Scarselli, B. Hof, Journal of Fluids Engineering 141 (2019).
date_created: 2019-05-26T21:59:13Z
date_published: 2019-11-01T00:00:00Z
date_updated: 2024-03-28T23:30:36Z
day: '01'
department:
- _id: BjHo
doi: 10.1115/1.4043494
ec_funded: 1
external_id:
arxiv:
- '1809.07625'
isi:
- '000487748600005'
intvolume: ' 141'
isi: 1
issue: '11'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1809.07625
month: '11'
oa: 1
oa_version: Preprint
project:
- _id: 25152F3A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '306589'
name: Decoding the complexity of turbulence at its origin
publication: Journal of Fluids Engineering
publication_identifier:
eissn:
- 1528901X
issn:
- '00982202'
publication_status: published
publisher: ASME
quality_controlled: '1'
related_material:
record:
- id: '7258'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Relaminarization of pipe flow by means of 3D-printed shaped honeycombs
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 141
year: '2019'
...
---
_id: '6228'
abstract:
- lang: eng
text: Following the recent observation that turbulent pipe flow can be relaminarised bya relatively simple modification of the mean velocity profile, we here carry out aquantitative experimental investigation of this phenomenon. Our study confirms thata flat velocity profile leads to a collapse of turbulence and in order to achieve theblunted profile shape, we employ a moving pipe segment that is briefly and rapidlyshifted in the streamwise direction. The relaminarisation threshold and the minimumshift length and speeds are determined as a function of Reynolds number. Althoughturbulence is still active after the acceleration phase, the modulated profile possessesa severely decreased lift-up potential as measured by transient growth. As shown,this results in an exponential decay of fluctuations and the flow relaminarises. Whilethis method can be easily applied at low to moderate flow speeds, the minimumstreamwise length over which the acceleration needs to act increases linearly with theReynolds number.
article_processing_charge: No
author:
- first_name: Davide
full_name: Scarselli, Davide
id: 40315C30-F248-11E8-B48F-1D18A9856A87
last_name: Scarselli
orcid: 0000-0001-5227-4271
- first_name: Jakob
full_name: Kühnen, Jakob
id: 3A47AE32-F248-11E8-B48F-1D18A9856A87
last_name: Kühnen
orcid: 0000-0003-4312-0179
- 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: Scarselli D, Kühnen J, Hof B. Relaminarising pipe flow by wall movement. Journal
of Fluid Mechanics. 2019;867:934-948. doi:10.1017/jfm.2019.191
apa: Scarselli, D., Kühnen, J., & Hof, B. (2019). Relaminarising pipe flow by
wall movement. Journal of Fluid Mechanics. Cambridge University Press.
https://doi.org/10.1017/jfm.2019.191
chicago: Scarselli, Davide, Jakob Kühnen, and Björn Hof. “Relaminarising Pipe Flow
by Wall Movement.” Journal of Fluid Mechanics. Cambridge University Press,
2019. https://doi.org/10.1017/jfm.2019.191.
ieee: D. Scarselli, J. Kühnen, and B. Hof, “Relaminarising pipe flow by wall movement,”
Journal of Fluid Mechanics, vol. 867. Cambridge University Press, pp. 934–948,
2019.
ista: Scarselli D, Kühnen J, Hof B. 2019. Relaminarising pipe flow by wall movement.
Journal of Fluid Mechanics. 867, 934–948.
mla: Scarselli, Davide, et al. “Relaminarising Pipe Flow by Wall Movement.” Journal
of Fluid Mechanics, vol. 867, Cambridge University Press, 2019, pp. 934–48,
doi:10.1017/jfm.2019.191.
short: D. Scarselli, J. Kühnen, B. Hof, Journal of Fluid Mechanics 867 (2019) 934–948.
date_created: 2019-04-07T21:59:14Z
date_published: 2019-05-25T00:00:00Z
date_updated: 2024-03-28T23:30:36Z
day: '25'
department:
- _id: BjHo
doi: 10.1017/jfm.2019.191
ec_funded: 1
external_id:
arxiv:
- '1807.05357'
isi:
- '000462606100001'
intvolume: ' 867'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1807.05357
month: '05'
oa: 1
oa_version: Preprint
page: 934-948
project:
- _id: 25152F3A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '306589'
name: Decoding the complexity of turbulence at its origin
- _id: 25104D44-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '737549'
name: Eliminating turbulence in oil pipelines
publication: Journal of Fluid Mechanics
publication_identifier:
eissn:
- '14697645'
issn:
- '00221120'
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
related_material:
link:
- relation: supplementary_material
url: https://doi.org/10.1017/jfm.2019.191
record:
- id: '7258'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Relaminarising pipe flow by wall movement
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 867
year: '2019'
...
---
_id: '6260'
abstract:
- lang: eng
text: Polar auxin transport plays a pivotal role in plant growth and development.
PIN auxin efflux carriers regulate directional auxin movement by establishing
local auxin maxima, minima, and gradients that drive multiple developmental processes
and responses to environmental signals. Auxin has been proposed to modulate its
own transport by regulating subcellular PIN trafficking via processes such as
clathrin-mediated PIN endocytosis and constitutive recycling. Here, we further
investigated the mechanisms by which auxin affects PIN trafficking by screening
auxin analogs and identified pinstatic acid (PISA) as a positive modulator of
polar auxin transport in Arabidopsis thaliana. PISA had an auxin-like effect on
hypocotyl elongation and adventitious root formation via positive regulation of
auxin transport. PISA did not activate SCFTIR1/AFB signaling and yet induced PIN
accumulation at the cell surface by inhibiting PIN internalization from the plasma
membrane. This work demonstrates PISA to be a promising chemical tool to dissect
the regulatory mechanisms behind subcellular PIN trafficking and auxin transport.
acknowledgement: "We thank Dr. H. Fukaki (University of Kobe), Dr. R. Offringa (Leiden
University), Dr. Jianwei Pan (Zhejiang Normal University), and Dr. M. Estelle (University
of California at San Diego) for providing mutants and transgenic line seeds.\r\nThis
work was supported by the Ministry of Education, Culture, Sports, Science, and Technology
(Grant-in-Aid for Scientific Research no. JP25114518 to K.H.), the Biotechnology
and Biological Sciences Research Council (award no. BB/L009366/1 to R.N. and S.K.),
and the European Union’s Horizon2020 program (European Research Council grant agreement
no. 742985 to J.F.)."
article_processing_charge: No
article_type: original
author:
- first_name: A
full_name: Oochi, A
last_name: Oochi
- first_name: Jakub
full_name: Hajny, Jakub
id: 4800CC20-F248-11E8-B48F-1D18A9856A87
last_name: Hajny
orcid: 0000-0003-2140-7195
- first_name: K
full_name: Fukui, K
last_name: Fukui
- first_name: Y
full_name: Nakao, Y
last_name: Nakao
- first_name: Michelle C
full_name: Gallei, Michelle C
id: 35A03822-F248-11E8-B48F-1D18A9856A87
last_name: Gallei
orcid: 0000-0003-1286-7368
- first_name: M
full_name: Quareshy, M
last_name: Quareshy
- first_name: K
full_name: Takahashi, K
last_name: Takahashi
- first_name: T
full_name: Kinoshita, T
last_name: Kinoshita
- first_name: SR
full_name: Harborough, SR
last_name: Harborough
- first_name: S
full_name: Kepinski, S
last_name: Kepinski
- first_name: H
full_name: Kasahara, H
last_name: Kasahara
- first_name: RM
full_name: Napier, RM
last_name: Napier
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: KI
full_name: Hayashi, KI
last_name: Hayashi
citation:
ama: Oochi A, Hajny J, Fukui K, et al. Pinstatic acid promotes auxin transport by
inhibiting PIN internalization. Plant Physiology. 2019;180(2):1152-1165.
doi:10.1104/pp.19.00201
apa: Oochi, A., Hajny, J., Fukui, K., Nakao, Y., Gallei, M. C., Quareshy, M., …
Hayashi, K. (2019). Pinstatic acid promotes auxin transport by inhibiting PIN
internalization. Plant Physiology. ASPB. https://doi.org/10.1104/pp.19.00201
chicago: Oochi, A, Jakub Hajny, K Fukui, Y Nakao, Michelle C Gallei, M Quareshy,
K Takahashi, et al. “Pinstatic Acid Promotes Auxin Transport by Inhibiting PIN
Internalization.” Plant Physiology. ASPB, 2019. https://doi.org/10.1104/pp.19.00201.
ieee: A. Oochi et al., “Pinstatic acid promotes auxin transport by inhibiting
PIN internalization,” Plant Physiology, vol. 180, no. 2. ASPB, pp. 1152–1165,
2019.
ista: Oochi A, Hajny J, Fukui K, Nakao Y, Gallei MC, Quareshy M, Takahashi K, Kinoshita
T, Harborough S, Kepinski S, Kasahara H, Napier R, Friml J, Hayashi K. 2019. Pinstatic
acid promotes auxin transport by inhibiting PIN internalization. Plant Physiology.
180(2), 1152–1165.
mla: Oochi, A., et al. “Pinstatic Acid Promotes Auxin Transport by Inhibiting PIN
Internalization.” Plant Physiology, vol. 180, no. 2, ASPB, 2019, pp. 1152–65,
doi:10.1104/pp.19.00201.
short: A. Oochi, J. Hajny, K. Fukui, Y. Nakao, M.C. Gallei, M. Quareshy, K. Takahashi,
T. Kinoshita, S. Harborough, S. Kepinski, H. Kasahara, R. Napier, J. Friml, K.
Hayashi, Plant Physiology 180 (2019) 1152–1165.
date_created: 2019-04-09T08:38:20Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2024-03-28T23:30:38Z
day: '01'
department:
- _id: JiFr
doi: 10.1104/pp.19.00201
ec_funded: 1
external_id:
isi:
- '000470086100045'
pmid:
- '30936248'
intvolume: ' 180'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1104/pp.19.00201
month: '06'
oa: 1
oa_version: Published Version
page: 1152-1165
pmid: 1
project:
- _id: 261099A6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '742985'
name: Tracing Evolution of Auxin Transport and Polarity in Plants
publication: Plant Physiology
publication_identifier:
eissn:
- 1532-2548
issn:
- 0032-0889
publication_status: published
publisher: ASPB
quality_controlled: '1'
related_material:
record:
- id: '11626'
relation: dissertation_contains
status: public
- id: '8822'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Pinstatic acid promotes auxin transport by inhibiting PIN internalization
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 180
year: '2019'
...
---
_id: '6508'
abstract:
- lang: eng
text: Segregation of maternal determinants within the oocyte constitutes the first
step in embryo patterning. In zebrafish oocytes, extensive ooplasmic streaming
leads to the segregation of ooplasm from yolk granules along the animal-vegetal
axis of the oocyte. Here, we show that this process does not rely on cortical
actin reorganization, as previously thought, but instead on a cell-cycle-dependent
bulk actin polymerization wave traveling from the animal to the vegetal pole of
the oocyte. This wave functions in segregation by both pulling ooplasm animally
and pushing yolk granules vegetally. Using biophysical experimentation and theory,
we show that ooplasm pulling is mediated by bulk actin network flows exerting
friction forces on the ooplasm, while yolk granule pushing is achieved by a mechanism
closely resembling actin comet formation on yolk granules. Our study defines a
novel role of cell-cycle-controlled bulk actin polymerization waves in oocyte
polarization via ooplasmic segregation.
acknowledged_ssus:
- _id: Bio
- _id: PreCl
acknowledgement: We would like to thank Pierre Recho, Guillaume Salbreux, and Silvia
Grigolon for advice on the theory, Lila Solnica-Krezel for kindly providing us with
zebrafish dachsous mutants, members of the Heisenberg and Hannezo groups for fruitful
discussions, and the Bioimaging and zebrafish facilities at IST Austria for their
continuous support. This project has received funding from the European Union (European
Research Council Advanced Grant 742573 to C.P.H.) and from the Austrian Science
Fund (FWF) (P 31639 to E.H.).
article_processing_charge: No
article_type: original
author:
- first_name: Shayan
full_name: Shamipour, Shayan
id: 40B34FE2-F248-11E8-B48F-1D18A9856A87
last_name: Shamipour
- first_name: Roland
full_name: Kardos, Roland
id: 4039350E-F248-11E8-B48F-1D18A9856A87
last_name: Kardos
- first_name: Shi-lei
full_name: Xue, Shi-lei
id: 31D2C804-F248-11E8-B48F-1D18A9856A87
last_name: Xue
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
- 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: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
citation:
ama: Shamipour S, Kardos R, Xue S, Hof B, Hannezo EB, Heisenberg C-PJ. Bulk actin
dynamics drive phase segregation in zebrafish oocytes. Cell. 2019;177(6):1463-1479.e18.
doi:10.1016/j.cell.2019.04.030
apa: Shamipour, S., Kardos, R., Xue, S., Hof, B., Hannezo, E. B., & Heisenberg,
C.-P. J. (2019). Bulk actin dynamics drive phase segregation in zebrafish oocytes.
Cell. Elsevier. https://doi.org/10.1016/j.cell.2019.04.030
chicago: Shamipour, Shayan, Roland Kardos, Shi-lei Xue, Björn Hof, Edouard B Hannezo,
and Carl-Philipp J Heisenberg. “Bulk Actin Dynamics Drive Phase Segregation in
Zebrafish Oocytes.” Cell. Elsevier, 2019. https://doi.org/10.1016/j.cell.2019.04.030.
ieee: S. Shamipour, R. Kardos, S. Xue, B. Hof, E. B. Hannezo, and C.-P. J. Heisenberg,
“Bulk actin dynamics drive phase segregation in zebrafish oocytes,” Cell,
vol. 177, no. 6. Elsevier, p. 1463–1479.e18, 2019.
ista: Shamipour S, Kardos R, Xue S, Hof B, Hannezo EB, Heisenberg C-PJ. 2019. Bulk
actin dynamics drive phase segregation in zebrafish oocytes. Cell. 177(6), 1463–1479.e18.
mla: Shamipour, Shayan, et al. “Bulk Actin Dynamics Drive Phase Segregation in Zebrafish
Oocytes.” Cell, vol. 177, no. 6, Elsevier, 2019, p. 1463–1479.e18, doi:10.1016/j.cell.2019.04.030.
short: S. Shamipour, R. Kardos, S. Xue, B. Hof, E.B. Hannezo, C.-P.J. Heisenberg,
Cell 177 (2019) 1463–1479.e18.
date_created: 2019-06-02T21:59:12Z
date_published: 2019-05-30T00:00:00Z
date_updated: 2024-03-28T23:30:39Z
day: '30'
ddc:
- '570'
department:
- _id: CaHe
- _id: EdHa
- _id: BjHo
doi: 10.1016/j.cell.2019.04.030
ec_funded: 1
external_id:
isi:
- '000469415100013'
pmid:
- '31080065'
file:
- access_level: open_access
checksum: aea43726d80e35ce3885073a5f05c3e3
content_type: application/pdf
creator: dernst
date_created: 2020-10-21T07:22:34Z
date_updated: 2020-10-21T07:22:34Z
file_id: '8686'
file_name: 2019_Cell_Shamipour_accepted.pdf
file_size: 3356292
relation: main_file
success: 1
file_date_updated: 2020-10-21T07:22:34Z
has_accepted_license: '1'
intvolume: ' 177'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.cell.2019.04.030
month: '05'
oa: 1
oa_version: Published Version
page: 1463-1479.e18
pmid: 1
project:
- _id: 260F1432-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '742573'
name: Interaction and feedback between cell mechanics and fate specification in
vertebrate gastrulation
- _id: 268294B6-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P31639
name: Active mechano-chemical description of the cell cytoskeleton
publication: Cell
publication_identifier:
eissn:
- '10974172'
issn:
- '00928674'
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/how-the-cytoplasm-separates-from-the-yolk/
record:
- id: '8350'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Bulk actin dynamics drive phase segregation in zebrafish oocytes
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 177
year: '2019'
...
---
_id: '7001'
acknowledged_ssus:
- _id: PreCl
- _id: Bio
article_processing_charge: No
article_type: original
author:
- first_name: Cornelia
full_name: Schwayer, Cornelia
id: 3436488C-F248-11E8-B48F-1D18A9856A87
last_name: Schwayer
orcid: 0000-0001-5130-2226
- first_name: Shayan
full_name: Shamipour, Shayan
id: 40B34FE2-F248-11E8-B48F-1D18A9856A87
last_name: Shamipour
- first_name: Kornelija
full_name: Pranjic-Ferscha, Kornelija
id: 4362B3C2-F248-11E8-B48F-1D18A9856A87
last_name: Pranjic-Ferscha
- first_name: Alexandra
full_name: Schauer, Alexandra
id: 30A536BA-F248-11E8-B48F-1D18A9856A87
last_name: Schauer
orcid: 0000-0001-7659-9142
- first_name: M
full_name: Balda, M
last_name: Balda
- first_name: M
full_name: Tada, M
last_name: Tada
- first_name: K
full_name: Matter, K
last_name: Matter
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
citation:
ama: Schwayer C, Shamipour S, Pranjic-Ferscha K, et al. Mechanosensation of tight
junctions depends on ZO-1 phase separation and flow. Cell. 2019;179(4):937-952.e18.
doi:10.1016/j.cell.2019.10.006
apa: Schwayer, C., Shamipour, S., Pranjic-Ferscha, K., Schauer, A., Balda, M., Tada,
M., … Heisenberg, C.-P. J. (2019). Mechanosensation of tight junctions depends
on ZO-1 phase separation and flow. Cell. Cell Press. https://doi.org/10.1016/j.cell.2019.10.006
chicago: Schwayer, Cornelia, Shayan Shamipour, Kornelija Pranjic-Ferscha, Alexandra
Schauer, M Balda, M Tada, K Matter, and Carl-Philipp J Heisenberg. “Mechanosensation
of Tight Junctions Depends on ZO-1 Phase Separation and Flow.” Cell. Cell
Press, 2019. https://doi.org/10.1016/j.cell.2019.10.006.
ieee: C. Schwayer et al., “Mechanosensation of tight junctions depends on
ZO-1 phase separation and flow,” Cell, vol. 179, no. 4. Cell Press, p.
937–952.e18, 2019.
ista: Schwayer C, Shamipour S, Pranjic-Ferscha K, Schauer A, Balda M, Tada M, Matter
K, Heisenberg C-PJ. 2019. Mechanosensation of tight junctions depends on ZO-1
phase separation and flow. Cell. 179(4), 937–952.e18.
mla: Schwayer, Cornelia, et al. “Mechanosensation of Tight Junctions Depends on
ZO-1 Phase Separation and Flow.” Cell, vol. 179, no. 4, Cell Press, 2019,
p. 937–952.e18, doi:10.1016/j.cell.2019.10.006.
short: C. Schwayer, S. Shamipour, K. Pranjic-Ferscha, A. Schauer, M. Balda, M. Tada,
K. Matter, C.-P.J. Heisenberg, Cell 179 (2019) 937–952.e18.
date_created: 2019-11-12T12:51:06Z
date_published: 2019-10-31T00:00:00Z
date_updated: 2024-03-28T23:30:39Z
day: '31'
ddc:
- '570'
department:
- _id: CaHe
- _id: BjHo
doi: 10.1016/j.cell.2019.10.006
ec_funded: 1
external_id:
isi:
- '000493898000012'
pmid:
- '31675500'
file:
- access_level: open_access
checksum: 33dac4bb77ee630e2666e936b4d57980
content_type: application/pdf
creator: dernst
date_created: 2020-10-21T07:09:45Z
date_updated: 2020-10-21T07:09:45Z
file_id: '8684'
file_name: 2019_Cell_Schwayer_accepted.pdf
file_size: 8805878
relation: main_file
success: 1
file_date_updated: 2020-10-21T07:09:45Z
has_accepted_license: '1'
intvolume: ' 179'
isi: 1
issue: '4'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 937-952.e18
pmid: 1
project:
- _id: 260F1432-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '742573'
name: Interaction and feedback between cell mechanics and fate specification in
vertebrate gastrulation
publication: Cell
publication_identifier:
eissn:
- 1097-4172
issn:
- 0092-8674
publication_status: published
publisher: Cell Press
quality_controlled: '1'
related_material:
link:
- description: News auf IST Website
relation: press_release
url: https://ist.ac.at/en/news/biochemistry-meets-mechanics-the-sensitive-nature-of-cell-cell-contact-formation-in-embryo-development/
record:
- id: '7186'
relation: dissertation_contains
status: public
- id: '8350'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Mechanosensation of tight junctions depends on ZO-1 phase separation and flow
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 179
year: '2019'
...
---
_id: '6891'
abstract:
- lang: eng
text: "While cells of mesenchymal or epithelial origin perform their effector functions
in a purely anchorage dependent manner, cells derived from the hematopoietic lineage
are not committed to operate only within a specific niche. Instead, these cells
are able to function autonomously of the molecular composition in a broad range
of tissue compartments. By this means, cells of the hematopoietic lineage retain
the capacity to disseminate into connective tissue and recirculate between organs,
building the foundation for essential processes such as tissue regeneration or
immune surveillance. \r\nCells of the immune system, specifically leukocytes,
are extraordinarily good at performing this task. These cells are able to flexibly
shift their mode of migration between an adhesion-mediated and an adhesion-independent
manner, instantaneously accommodating for any changes in molecular composition
of the external scaffold. The key component driving directed leukocyte migration
is the chemokine receptor 7, which guides the cell along gradients of chemokine
ligand. Therefore, the physical destination of migrating leukocytes is purely
deterministic, i.e. given by global directional cues such as chemokine gradients.
\r\nNevertheless, these cells typically reside in three-dimensional scaffolds
of inhomogeneous complexity, raising the question whether cells are able to locally
discriminate between multiple optional migration routes. Current literature provides
evidence that leukocytes, specifically dendritic cells, do indeed probe their
surrounding by virtue of multiple explorative protrusions. However, it remains
enigmatic how these cells decide which one is the more favorable route to follow
and what are the key players involved in performing this task. Due to the heterogeneous
environment of most tissues, and the vast adaptability of migrating leukocytes,
at this time it is not clear to what extent leukocytes are able to optimize their
migratory strategy by adapting their level of adhesiveness. And, given the fact
that leukocyte migration is characterized by branched cell shapes in combination
with high migration velocities, it is reasonable to assume that these cells require
fine tuned shape maintenance mechanisms that tightly coordinate protrusion and
adhesion dynamics in a spatiotemporal manner. \r\nTherefore, this study aimed
to elucidate how rapidly migrating leukocytes opt for an ideal migratory path
while maintaining a continuous cell shape and balancing adhesive forces to efficiently
navigate through complex microenvironments. \r\nThe results of this study unraveled
a role for the microtubule cytoskeleton in promoting the decision making process
during path finding and for the first time point towards a microtubule-mediated
function in cell shape maintenance of highly ramified cells such as dendritic
cells. Furthermore, we found that migrating low-adhesive leukocytes are able to
instantaneously adapt to increased tensile load by engaging adhesion receptors.
This response was only occurring tangential to the substrate while adhesive properties
in the vertical direction were not increased. As leukocytes are primed for rapid
migration velocities, these results demonstrate that leukocyte integrins are able
to confer a high level of traction forces parallel to the cell membrane along
the direction of migration without wasting energy in gluing the cell to the substrate.
\r\nThus, the data in the here presented thesis provide new insights into the
pivotal role of cytoskeletal dynamics and the mechanisms of force transduction
during leukocyte migration. \r\nThereby the here presented results help to further
define fundamental principles underlying leukocyte migration and open up potential
therapeutic avenues of clinical relevance.\r\n"
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Aglaja
full_name: Kopf, Aglaja
id: 31DAC7B6-F248-11E8-B48F-1D18A9856A87
last_name: Kopf
orcid: 0000-0002-2187-6656
citation:
ama: Kopf A. The implication of cytoskeletal dynamics on leukocyte migration. 2019.
doi:10.15479/AT:ISTA:6891
apa: Kopf, A. (2019). The implication of cytoskeletal dynamics on leukocyte migration.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6891
chicago: Kopf, Aglaja. “The Implication of Cytoskeletal Dynamics on Leukocyte Migration.”
Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6891.
ieee: A. Kopf, “The implication of cytoskeletal dynamics on leukocyte migration,”
Institute of Science and Technology Austria, 2019.
ista: Kopf A. 2019. The implication of cytoskeletal dynamics on leukocyte migration.
Institute of Science and Technology Austria.
mla: Kopf, Aglaja. The Implication of Cytoskeletal Dynamics on Leukocyte Migration.
Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6891.
short: A. Kopf, The Implication of Cytoskeletal Dynamics on Leukocyte Migration,
Institute of Science and Technology Austria, 2019.
date_created: 2019-09-19T08:19:44Z
date_published: 2019-07-24T00:00:00Z
date_updated: 2023-10-18T08:49:17Z
day: '24'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: MiSi
doi: 10.15479/AT:ISTA:6891
file:
- access_level: closed
checksum: 00d100d6468e31e583051e0a006b640c
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: akopf
date_created: 2019-10-15T05:28:42Z
date_updated: 2020-10-17T22:30:03Z
embargo_to: open_access
file_id: '6950'
file_name: Kopf_PhD_Thesis.docx
file_size: 74735267
relation: source_file
- access_level: open_access
checksum: 5d1baa899993ae6ca81aebebe1797000
content_type: application/pdf
creator: akopf
date_created: 2019-10-15T05:28:47Z
date_updated: 2020-10-17T22:30:03Z
embargo: 2020-10-16
file_id: '6951'
file_name: Kopf_PhD_Thesis1.pdf
file_size: 52787224
relation: main_file
file_date_updated: 2020-10-17T22:30:03Z
has_accepted_license: '1'
keyword:
- cell biology
- immunology
- leukocyte
- migration
- microfluidics
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '171'
project:
- _id: 265E2996-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: W01250-B20
name: Nano-Analytics of Cellular Systems
publication_identifier:
eissn:
- 2663-337X
isbn:
- 978-3-99078-002-2
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
link:
- relation: press_release
url: https://ist.ac.at/en/news/feeling-like-a-cell/
record:
- id: '6328'
relation: part_of_dissertation
status: public
- id: '15'
relation: part_of_dissertation
status: public
- id: '6877'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
title: The implication of cytoskeletal dynamics on leukocyte migration
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '6328'
abstract:
- lang: eng
text: During metazoan development, immune surveillance and cancer dissemination,
cells migrate in complex three-dimensional microenvironments1,2,3. These spaces
are crowded by cells and extracellular matrix, generating mazes with differently
sized gaps that are typically smaller than the diameter of the migrating cell4,5.
Most mesenchymal and epithelial cells and some—but not all—cancer cells actively
generate their migratory path using pericellular tissue proteolysis6. By contrast,
amoeboid cells such as leukocytes use non-destructive strategies of locomotion7,
raising the question how these extremely fast cells navigate through dense tissues.
Here we reveal that leukocytes sample their immediate vicinity for large pore
sizes, and are thereby able to choose the path of least resistance. This allows
them to circumnavigate local obstacles while effectively following global directional
cues such as chemotactic gradients. Pore-size discrimination is facilitated by
frontward positioning of the nucleus, which enables the cells to use their bulkiest
compartment as a mechanical gauge. Once the nucleus and the closely associated
microtubule organizing centre pass the largest pore, cytoplasmic protrusions still
lingering in smaller pores are retracted. These retractions are coordinated by
dynamic microtubules; when microtubules are disrupted, migrating cells lose coherence
and frequently fragment into migratory cytoplasmic pieces. As nuclear positioning
in front of the microtubule organizing centre is a typical feature of amoeboid
migration, our findings link the fundamental organization of cellular polarity
to the strategy of locomotion.
acknowledged_ssus:
- _id: SSU
article_processing_charge: No
article_type: letter_note
author:
- first_name: Jörg
full_name: Renkawitz, Jörg
id: 3F0587C8-F248-11E8-B48F-1D18A9856A87
last_name: Renkawitz
orcid: 0000-0003-2856-3369
- first_name: Aglaja
full_name: Kopf, Aglaja
id: 31DAC7B6-F248-11E8-B48F-1D18A9856A87
last_name: Kopf
orcid: 0000-0002-2187-6656
- first_name: Julian A
full_name: Stopp, Julian A
id: 489E3F00-F248-11E8-B48F-1D18A9856A87
last_name: Stopp
- first_name: Ingrid
full_name: de Vries, Ingrid
id: 4C7D837E-F248-11E8-B48F-1D18A9856A87
last_name: de Vries
- first_name: Meghan K.
full_name: Driscoll, Meghan K.
last_name: Driscoll
- first_name: Jack
full_name: Merrin, Jack
id: 4515C308-F248-11E8-B48F-1D18A9856A87
last_name: Merrin
orcid: 0000-0001-5145-4609
- first_name: Robert
full_name: Hauschild, Robert
id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
last_name: Hauschild
orcid: 0000-0001-9843-3522
- first_name: Erik S.
full_name: Welf, Erik S.
last_name: Welf
- first_name: Gaudenz
full_name: Danuser, Gaudenz
last_name: Danuser
- first_name: Reto
full_name: Fiolka, Reto
last_name: Fiolka
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
citation:
ama: Renkawitz J, Kopf A, Stopp JA, et al. Nuclear positioning facilitates amoeboid
migration along the path of least resistance. Nature. 2019;568:546-550.
doi:10.1038/s41586-019-1087-5
apa: Renkawitz, J., Kopf, A., Stopp, J. A., de Vries, I., Driscoll, M. K., Merrin,
J., … Sixt, M. K. (2019). Nuclear positioning facilitates amoeboid migration along
the path of least resistance. Nature. Springer Nature. https://doi.org/10.1038/s41586-019-1087-5
chicago: Renkawitz, Jörg, Aglaja Kopf, Julian A Stopp, Ingrid de Vries, Meghan K.
Driscoll, Jack Merrin, Robert Hauschild, et al. “Nuclear Positioning Facilitates
Amoeboid Migration along the Path of Least Resistance.” Nature. Springer
Nature, 2019. https://doi.org/10.1038/s41586-019-1087-5.
ieee: J. Renkawitz et al., “Nuclear positioning facilitates amoeboid migration
along the path of least resistance,” Nature, vol. 568. Springer Nature,
pp. 546–550, 2019.
ista: Renkawitz J, Kopf A, Stopp JA, de Vries I, Driscoll MK, Merrin J, Hauschild
R, Welf ES, Danuser G, Fiolka R, Sixt MK. 2019. Nuclear positioning facilitates
amoeboid migration along the path of least resistance. Nature. 568, 546–550.
mla: Renkawitz, Jörg, et al. “Nuclear Positioning Facilitates Amoeboid Migration
along the Path of Least Resistance.” Nature, vol. 568, Springer Nature,
2019, pp. 546–50, doi:10.1038/s41586-019-1087-5.
short: J. Renkawitz, A. Kopf, J.A. Stopp, I. de Vries, M.K. Driscoll, J. Merrin,
R. Hauschild, E.S. Welf, G. Danuser, R. Fiolka, M.K. Sixt, Nature 568 (2019) 546–550.
date_created: 2019-04-17T06:52:28Z
date_published: 2019-04-25T00:00:00Z
date_updated: 2024-03-28T23:30:40Z
day: '25'
department:
- _id: MiSi
- _id: NanoFab
- _id: Bio
doi: 10.1038/s41586-019-1087-5
ec_funded: 1
external_id:
isi:
- '000465594200050'
pmid:
- '30944468'
intvolume: ' 568'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7217284/
month: '04'
oa: 1
oa_version: Submitted Version
page: 546-550
pmid: 1
project:
- _id: 25A603A2-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '281556'
name: Cytoskeletal force generation and force transduction of migrating leukocytes
(EU)
- _id: 25FE9508-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '724373'
name: Cellular navigation along spatial gradients
- _id: 265FAEBA-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: W01250-B20
name: Nano-Analytics of Cellular Systems
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 25A48D24-B435-11E9-9278-68D0E5697425
grant_number: ALTF 1396-2014
name: Molecular and system level view of immune cell migration
publication: Nature
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/leukocytes-use-their-nucleus-as-a-ruler-to-choose-path-of-least-resistance/
record:
- id: '14697'
relation: dissertation_contains
status: public
- id: '6891'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Nuclear positioning facilitates amoeboid migration along the path of least
resistance
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 568
year: '2019'
...
---
_id: '6877'
article_processing_charge: No
article_type: original
author:
- first_name: Aglaja
full_name: Kopf, Aglaja
id: 31DAC7B6-F248-11E8-B48F-1D18A9856A87
last_name: Kopf
orcid: 0000-0002-2187-6656
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
citation:
ama: Kopf A, Sixt MK. The neural crest pitches in to remove apoptotic debris. Cell.
2019;179(1):51-53. doi:10.1016/j.cell.2019.08.047
apa: Kopf, A., & Sixt, M. K. (2019). The neural crest pitches in to remove apoptotic
debris. Cell. Elsevier. https://doi.org/10.1016/j.cell.2019.08.047
chicago: Kopf, Aglaja, and Michael K Sixt. “The Neural Crest Pitches in to Remove
Apoptotic Debris.” Cell. Elsevier, 2019. https://doi.org/10.1016/j.cell.2019.08.047.
ieee: A. Kopf and M. K. Sixt, “The neural crest pitches in to remove apoptotic debris,”
Cell, vol. 179, no. 1. Elsevier, pp. 51–53, 2019.
ista: Kopf A, Sixt MK. 2019. The neural crest pitches in to remove apoptotic debris.
Cell. 179(1), 51–53.
mla: Kopf, Aglaja, and Michael K. Sixt. “The Neural Crest Pitches in to Remove Apoptotic
Debris.” Cell, vol. 179, no. 1, Elsevier, 2019, pp. 51–53, doi:10.1016/j.cell.2019.08.047.
short: A. Kopf, M.K. Sixt, Cell 179 (2019) 51–53.
date_created: 2019-09-15T22:00:46Z
date_published: 2019-09-19T00:00:00Z
date_updated: 2024-03-28T23:30:40Z
day: '19'
department:
- _id: MiSi
doi: 10.1016/j.cell.2019.08.047
external_id:
isi:
- '000486618500011'
pmid:
- '31539498'
intvolume: ' 179'
isi: 1
issue: '1'
language:
- iso: eng
month: '09'
oa_version: None
page: 51-53
pmid: 1
publication: Cell
publication_identifier:
eissn:
- 1097-4172
issn:
- 0092-8674
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '6891'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: The neural crest pitches in to remove apoptotic debris
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 179
year: '2019'
...
---
_id: '6830'
article_processing_charge: No
article_type: letter_note
author:
- first_name: Ximena
full_name: Contreras, Ximena
id: 475990FE-F248-11E8-B48F-1D18A9856A87
last_name: Contreras
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
citation:
ama: Contreras X, Hippenmeyer S. Memo1 tiles the radial glial cell grid. Neuron.
2019;103(5):750-752. doi:10.1016/j.neuron.2019.08.021
apa: Contreras, X., & Hippenmeyer, S. (2019). Memo1 tiles the radial glial cell
grid. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2019.08.021
chicago: Contreras, Ximena, and Simon Hippenmeyer. “Memo1 Tiles the Radial Glial
Cell Grid.” Neuron. Elsevier, 2019. https://doi.org/10.1016/j.neuron.2019.08.021.
ieee: X. Contreras and S. Hippenmeyer, “Memo1 tiles the radial glial cell grid,”
Neuron, vol. 103, no. 5. Elsevier, pp. 750–752, 2019.
ista: Contreras X, Hippenmeyer S. 2019. Memo1 tiles the radial glial cell grid.
Neuron. 103(5), 750–752.
mla: Contreras, Ximena, and Simon Hippenmeyer. “Memo1 Tiles the Radial Glial Cell
Grid.” Neuron, vol. 103, no. 5, Elsevier, 2019, pp. 750–52, doi:10.1016/j.neuron.2019.08.021.
short: X. Contreras, S. Hippenmeyer, Neuron 103 (2019) 750–752.
date_created: 2019-08-25T22:00:50Z
date_published: 2019-09-04T00:00:00Z
date_updated: 2024-03-28T23:30:42Z
day: '04'
department:
- _id: SiHi
doi: 10.1016/j.neuron.2019.08.021
external_id:
isi:
- '000484400200002'
pmid:
- '31487522'
intvolume: ' 103'
isi: 1
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.neuron.2019.08.021
month: '09'
oa: 1
oa_version: Published Version
page: 750-752
pmid: 1
publication: Neuron
publication_identifier:
eissn:
- '10974199'
issn:
- '08966273'
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '7902'
relation: part_of_dissertation
status: public
scopus_import: '1'
status: public
title: Memo1 tiles the radial glial cell grid
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 103
year: '2019'
...
---
_id: '6627'
abstract:
- lang: eng
text: Cortical microtubule arrays in elongating epidermal cells in both the root
and stem of plants have the propensity of dynamic reorientations that are correlated
with the activation or inhibition of growth. Factors regulating plant growth,
among them the hormone auxin, have been recognized as regulators of microtubule
array orientations. Some previous work in the field has aimed at elucidating the
causal relationship between cell growth, the signaling of auxin or other growth-regulating
factors, and microtubule array reorientations, with various conclusions. Here,
we revisit this problem of causality with a comprehensive set of experiments in
Arabidopsis thaliana, using the now available pharmacological and genetic tools.
We use isolated, auxin-depleted hypocotyls, an experimental system allowing for
full control of both growth and auxin signaling. We demonstrate that reorientation
of microtubules is not directly triggered by an auxin signal during growth activation.
Instead, reorientation is triggered by the activation of the growth process itself
and is auxin-independent in its nature. We discuss these findings in the context
of previous relevant work, including that on the mechanical regulation of microtubule
array orientation.
article_number: '3337'
article_processing_charge: Yes
article_type: original
author:
- first_name: Maciek
full_name: Adamowski, Maciek
id: 45F536D2-F248-11E8-B48F-1D18A9856A87
last_name: Adamowski
orcid: 0000-0001-6463-5257
- first_name: Lanxin
full_name: Li, Lanxin
id: 367EF8FA-F248-11E8-B48F-1D18A9856A87
last_name: Li
orcid: 0000-0002-5607-272X
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Adamowski M, Li L, Friml J. Reorientation of cortical microtubule arrays in
the hypocotyl of arabidopsis thaliana is induced by the cell growth process and
independent of auxin signaling. International Journal of Molecular Sciences.
2019;20(13). doi:10.3390/ijms20133337
apa: Adamowski, M., Li, L., & Friml, J. (2019). Reorientation of cortical microtubule
arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth
process and independent of auxin signaling. International Journal of Molecular
Sciences. MDPI. https://doi.org/10.3390/ijms20133337
chicago: Adamowski, Maciek, Lanxin Li, and Jiří Friml. “Reorientation of Cortical
Microtubule Arrays in the Hypocotyl of Arabidopsis Thaliana Is Induced by the
Cell Growth Process and Independent of Auxin Signaling.” International Journal
of Molecular Sciences. MDPI, 2019. https://doi.org/10.3390/ijms20133337.
ieee: M. Adamowski, L. Li, and J. Friml, “Reorientation of cortical microtubule
arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth
process and independent of auxin signaling,” International Journal of Molecular
Sciences, vol. 20, no. 13. MDPI, 2019.
ista: Adamowski M, Li L, Friml J. 2019. Reorientation of cortical microtubule arrays
in the hypocotyl of arabidopsis thaliana is induced by the cell growth process
and independent of auxin signaling. International Journal of Molecular Sciences.
20(13), 3337.
mla: Adamowski, Maciek, et al. “Reorientation of Cortical Microtubule Arrays in
the Hypocotyl of Arabidopsis Thaliana Is Induced by the Cell Growth Process and
Independent of Auxin Signaling.” International Journal of Molecular Sciences,
vol. 20, no. 13, 3337, MDPI, 2019, doi:10.3390/ijms20133337.
short: M. Adamowski, L. Li, J. Friml, International Journal of Molecular Sciences
20 (2019).
date_created: 2019-07-11T12:00:32Z
date_published: 2019-07-07T00:00:00Z
date_updated: 2024-03-28T23:30:44Z
day: '07'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.3390/ijms20133337
ec_funded: 1
external_id:
isi:
- '000477041100221'
pmid:
- '31284661'
file:
- access_level: open_access
checksum: dd9d1cbb933a72ceb666c9667890ac51
content_type: application/pdf
creator: dernst
date_created: 2019-07-17T06:17:15Z
date_updated: 2020-07-14T12:47:34Z
file_id: '6645'
file_name: 2019_JournalMolecularScience_Adamowski.pdf
file_size: 3330291
relation: main_file
file_date_updated: 2020-07-14T12:47:34Z
has_accepted_license: '1'
intvolume: ' 20'
isi: 1
issue: '13'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: International Journal of Molecular Sciences
publication_identifier:
eissn:
- 1422-0067
publication_status: published
publisher: MDPI
quality_controlled: '1'
related_material:
record:
- id: '10083'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis
thaliana is induced by the cell growth process and independent of auxin signaling
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: 20
year: '2019'
...
---
_id: '7117'
abstract:
- lang: eng
text: We propose a novel generic shape optimization method for CAD models based
on the eXtended Finite Element Method (XFEM). Our method works directly on the
intersection between the model and a regular simulation grid, without the need
to mesh or remesh, thus removing a bottleneck of classical shape optimization
strategies. This is made possible by a novel hierarchical integration scheme that
accurately integrates finite element quantities with sub-element precision. For
optimization, we efficiently compute analytical shape derivatives of the entire
framework, from model intersection to integration rule generation and XFEM simulation.
Moreover, we describe a differentiable projection of shape parameters onto a constraint
manifold spanned by user-specified shape preservation, consistency, and manufacturability
constraints. We demonstrate the utility of our approach by optimizing mass distribution,
strength-to-weight ratio, and inverse elastic shape design objectives directly
on parameterized 3D CAD models.
article_number: '157'
article_processing_charge: No
article_type: original
author:
- first_name: Christian
full_name: Hafner, Christian
id: 400429CC-F248-11E8-B48F-1D18A9856A87
last_name: Hafner
- first_name: Christian
full_name: Schumacher, Christian
last_name: Schumacher
- first_name: Espen
full_name: Knoop, Espen
last_name: Knoop
- first_name: Thomas
full_name: Auzinger, Thomas
id: 4718F954-F248-11E8-B48F-1D18A9856A87
last_name: Auzinger
orcid: 0000-0002-1546-3265
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Moritz
full_name: Bächer, Moritz
last_name: Bächer
citation:
ama: 'Hafner C, Schumacher C, Knoop E, Auzinger T, Bickel B, Bächer M. X-CAD: Optimizing
CAD Models with Extended Finite Elements. ACM Transactions on Graphics.
2019;38(6). doi:10.1145/3355089.3356576'
apa: 'Hafner, C., Schumacher, C., Knoop, E., Auzinger, T., Bickel, B., & Bächer,
M. (2019). X-CAD: Optimizing CAD Models with Extended Finite Elements. ACM
Transactions on Graphics. ACM. https://doi.org/10.1145/3355089.3356576'
chicago: 'Hafner, Christian, Christian Schumacher, Espen Knoop, Thomas Auzinger,
Bernd Bickel, and Moritz Bächer. “X-CAD: Optimizing CAD Models with Extended Finite
Elements.” ACM Transactions on Graphics. ACM, 2019. https://doi.org/10.1145/3355089.3356576.'
ieee: 'C. Hafner, C. Schumacher, E. Knoop, T. Auzinger, B. Bickel, and M. Bächer,
“X-CAD: Optimizing CAD Models with Extended Finite Elements,” ACM Transactions
on Graphics, vol. 38, no. 6. ACM, 2019.'
ista: 'Hafner C, Schumacher C, Knoop E, Auzinger T, Bickel B, Bächer M. 2019. X-CAD:
Optimizing CAD Models with Extended Finite Elements. ACM Transactions on Graphics.
38(6), 157.'
mla: 'Hafner, Christian, et al. “X-CAD: Optimizing CAD Models with Extended Finite
Elements.” ACM Transactions on Graphics, vol. 38, no. 6, 157, ACM, 2019,
doi:10.1145/3355089.3356576.'
short: C. Hafner, C. Schumacher, E. Knoop, T. Auzinger, B. Bickel, M. Bächer, ACM
Transactions on Graphics 38 (2019).
date_created: 2019-11-26T14:22:09Z
date_published: 2019-11-06T00:00:00Z
date_updated: 2024-03-28T23:30:47Z
day: '06'
ddc:
- '000'
department:
- _id: BeBi
doi: 10.1145/3355089.3356576
ec_funded: 1
external_id:
isi:
- '000498397300007'
file:
- access_level: open_access
checksum: 56a2fb019adcb556d2b022f5e5acb68c
content_type: application/pdf
creator: bbickel
date_created: 2019-11-26T14:24:26Z
date_updated: 2020-07-14T12:47:49Z
file_id: '7119'
file_name: xcad_sup_mat_siga19.pdf
file_size: 1673176
relation: supplementary_material
title: X-CAD Supplemental Material
- access_level: open_access
checksum: 5f29d76aceb5102e766cbab9b17d776e
content_type: application/pdf
creator: bbickel
date_created: 2019-11-26T14:24:27Z
date_updated: 2020-07-14T12:47:49Z
description: This is the author's version of the work.
file_id: '7120'
file_name: XCAD_authors_version.pdf
file_size: 14563618
relation: main_file
title: 'X-CAD: Optimizing CAD Models with Extended Finite Elements'
- access_level: open_access
checksum: 0d31e123286cbec9e28b2001c2bb0d55
content_type: video/mp4
creator: bbickel
date_created: 2019-11-26T14:27:37Z
date_updated: 2020-07-14T12:47:49Z
file_id: '7121'
file_name: XCAD_video.mp4
file_size: 259979129
relation: main_file
file_date_updated: 2020-07-14T12:47:49Z
has_accepted_license: '1'
intvolume: ' 38'
isi: 1
issue: '6'
language:
- iso: eng
month: '11'
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: ACM Transactions on Graphics
publication_identifier:
issn:
- 0730-0301
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
record:
- id: '12897'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'X-CAD: Optimizing CAD Models with Extended Finite Elements'
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 38
year: '2019'
...
---
_id: '6189'
abstract:
- lang: eng
text: 'Suspended particles can alter the properties of fluids and in particular
also affect the transition fromlaminar to turbulent flow. An earlier study [Mataset
al.,Phys. Rev. Lett.90, 014501 (2003)] reported howthe subcritical (i.e., hysteretic)
transition to turbulent puffs is affected by the addition of particles. Here weshow
that in addition to this known transition, with increasing concentration a supercritical
(i.e.,continuous) transition to a globally fluctuating state is found. At the
same time the Newtonian-typetransition to puffs is delayed to larger Reynolds
numbers. At even higher concentration only the globallyfluctuating state is found.
The dynamics of particle laden flows are hence determined by two competinginstabilities
that give rise to three flow regimes: Newtonian-type turbulence at low, a particle
inducedglobally fluctuating state at high, and a coexistence state at intermediate
concentrations.'
article_number: '114502'
article_processing_charge: No
author:
- first_name: Nishchal
full_name: Agrawal, Nishchal
id: 469E6004-F248-11E8-B48F-1D18A9856A87
last_name: Agrawal
- first_name: George H
full_name: Choueiri, George H
id: 448BD5BC-F248-11E8-B48F-1D18A9856A87
last_name: Choueiri
- 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: Agrawal N, Choueiri GH, Hof B. Transition to turbulence in particle laden flows.
Physical Review Letters. 2019;122(11). doi:10.1103/PhysRevLett.122.114502
apa: Agrawal, N., Choueiri, G. H., & Hof, B. (2019). Transition to turbulence
in particle laden flows. Physical Review Letters. American Physical Society.
https://doi.org/10.1103/PhysRevLett.122.114502
chicago: Agrawal, Nishchal, George H Choueiri, and Björn Hof. “Transition to Turbulence
in Particle Laden Flows.” Physical Review Letters. American Physical Society,
2019. https://doi.org/10.1103/PhysRevLett.122.114502.
ieee: N. Agrawal, G. H. Choueiri, and B. Hof, “Transition to turbulence in particle
laden flows,” Physical Review Letters, vol. 122, no. 11. American Physical
Society, 2019.
ista: Agrawal N, Choueiri GH, Hof B. 2019. Transition to turbulence in particle
laden flows. Physical Review Letters. 122(11), 114502.
mla: Agrawal, Nishchal, et al. “Transition to Turbulence in Particle Laden Flows.”
Physical Review Letters, vol. 122, no. 11, 114502, American Physical Society,
2019, doi:10.1103/PhysRevLett.122.114502.
short: N. Agrawal, G.H. Choueiri, B. Hof, Physical Review Letters 122 (2019).
date_created: 2019-03-31T21:59:12Z
date_published: 2019-03-22T00:00:00Z
date_updated: 2024-03-28T23:30:48Z
day: '22'
department:
- _id: BjHo
doi: 10.1103/PhysRevLett.122.114502
external_id:
arxiv:
- '1809.06358'
isi:
- '000461922000006'
intvolume: ' 122'
isi: 1
issue: '11'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1809.06358
month: '03'
oa: 1
oa_version: Preprint
publication: Physical Review Letters
publication_identifier:
eissn:
- '10797114'
issn:
- '00319007'
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
related_material:
record:
- id: '9728'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Transition to turbulence in particle laden flows
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 122
year: '2019'
...
---
_id: '6371'
abstract:
- lang: eng
text: "Decades of studies have revealed the mechanisms of gene regulation in molecular
detail. We make use of such well-described regulatory systems to explore how the
molecular mechanisms of protein-protein and protein-DNA interactions shape the
dynamics and evolution of gene regulation. \r\n\r\ni) We uncover how the biophysics
of protein-DNA binding determines the potential of regulatory networks to evolve
and adapt, which can be captured using a simple mathematical model. \r\nii) The
evolution of regulatory connections can lead to a significant amount of crosstalk
between binding proteins. We explore the effect of crosstalk on gene expression
from a target promoter, which seems to be modulated through binding competition
at non-specific DNA sites. \r\niii) We investigate how the very same biophysical
characteristics as in i) can generate significant fitness costs for cells through
global crosstalk, meaning non-specific DNA binding across the genomic background.
\r\niv) Binding competition between proteins at a target promoter is a prevailing
regulatory feature due to the prevalence of co-regulation at bacterial promoters.
However, the dynamics of these systems are not always straightforward to determine
even if the molecular mechanisms of regulation are known. A detailed model of
the biophysical interactions reveals that interference between the regulatory
proteins can constitute a new, generic form of system memory that records the
history of the input signals at the promoter. \r\n\r\nWe demonstrate how the biophysics
of protein-DNA binding can be harnessed to investigate the principles that shape
and ultimately limit cellular gene regulation. These results provide a basis for
studies of higher-level functionality, which arises from the underlying regulation.
\ \r\n"
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Claudia
full_name: Igler, Claudia
id: 46613666-F248-11E8-B48F-1D18A9856A87
last_name: Igler
citation:
ama: Igler C. On the nature of gene regulatory design - The biophysics of transcription
factor binding shapes gene regulation. 2019. doi:10.15479/AT:ISTA:6371
apa: Igler, C. (2019). On the nature of gene regulatory design - The biophysics
of transcription factor binding shapes gene regulation. Institute of Science
and Technology Austria. https://doi.org/10.15479/AT:ISTA:6371
chicago: Igler, Claudia. “On the Nature of Gene Regulatory Design - The Biophysics
of Transcription Factor Binding Shapes Gene Regulation.” Institute of Science
and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6371.
ieee: C. Igler, “On the nature of gene regulatory design - The biophysics of transcription
factor binding shapes gene regulation,” Institute of Science and Technology Austria,
2019.
ista: Igler C. 2019. On the nature of gene regulatory design - The biophysics of
transcription factor binding shapes gene regulation. Institute of Science and
Technology Austria.
mla: Igler, Claudia. On the Nature of Gene Regulatory Design - The Biophysics
of Transcription Factor Binding Shapes Gene Regulation. Institute of Science
and Technology Austria, 2019, doi:10.15479/AT:ISTA:6371.
short: C. Igler, On the Nature of Gene Regulatory Design - The Biophysics of Transcription
Factor Binding Shapes Gene Regulation, Institute of Science and Technology Austria,
2019.
date_created: 2019-05-03T11:55:51Z
date_published: 2019-05-03T00:00:00Z
date_updated: 2024-02-21T13:45:52Z
day: '03'
ddc:
- '576'
- '579'
degree_awarded: PhD
department:
- _id: CaGu
doi: 10.15479/AT:ISTA:6371
file:
- access_level: open_access
checksum: c0085d47c58c9cbcab1b0a783480f6da
content_type: application/pdf
creator: cigler
date_created: 2019-05-03T11:54:52Z
date_updated: 2021-02-11T11:17:13Z
embargo: 2020-05-02
file_id: '6373'
file_name: IglerClaudia_OntheNatureofGeneRegulatoryDesign.pdf
file_size: 12597663
relation: main_file
- access_level: closed
checksum: 2eac954de1c8bbf7e6fb35ed0221ae8c
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: cigler
date_created: 2019-05-03T11:54:54Z
date_updated: 2020-07-14T12:47:28Z
embargo_to: open_access
file_id: '6374'
file_name: IglerClaudia_OntheNatureofGeneRegulatoryDesign.docx
file_size: 34644426
relation: source_file
file_date_updated: 2021-02-11T11:17:13Z
has_accepted_license: '1'
keyword:
- gene regulation
- biophysics
- transcription factor binding
- bacteria
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '152'
project:
- _id: 251EE76E-B435-11E9-9278-68D0E5697425
grant_number: '24573'
name: Design principles underlying genetic switch architecture (DOC Fellowship)
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '67'
relation: part_of_dissertation
status: public
- id: '5585'
relation: popular_science
status: public
status: public
supervisor:
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
title: On the nature of gene regulatory design - The biophysics of transcription factor
binding shapes gene regulation
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '10286'
abstract:
- lang: eng
text: 'In this paper, we evaluate clock signals generated in ring oscillators and
self-timed rings and the way their jitter can be transformed into random numbers.
We show that counting the periods of the jittery clock signal produces random
numbers of significantly better quality than the methods in which the jittery
signal is simply sampled (the case in almost all current methods). Moreover, we
use the counter values to characterize and continuously monitor the source of
randomness. However, instead of using the widely used statistical variance, we
propose to use Allan variance to do so. There are two main advantages: Allan variance
is insensitive to low frequency noises such as flicker noise that are known to
be autocorrelated and significantly less circuitry is required for its computation
than that used to compute commonly used variance. We also show that it is essential
to use a differential principle of randomness extraction from the jitter based
on the use of two identical oscillators to avoid autocorrelations originating
from external and internal global jitter sources and that this fact is valid for
both kinds of rings. Last but not least, we propose a method of statistical testing
based on high order Markov model to show the reduced dependencies when the proposed
randomness extraction is applied.'
article_processing_charge: No
article_type: original
author:
- first_name: Elie Noumon
full_name: Allini, Elie Noumon
last_name: Allini
- first_name: Maciej
full_name: Skórski, Maciej
id: EC09FA6A-02D0-11E9-8223-86B7C91467DD
last_name: Skórski
- first_name: Oto
full_name: Petura, Oto
last_name: Petura
- first_name: Florent
full_name: Bernard, Florent
last_name: Bernard
- first_name: Marek
full_name: Laban, Marek
last_name: Laban
- first_name: Viktor
full_name: Fischer, Viktor
last_name: Fischer
citation:
ama: Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. Evaluation and
monitoring of free running oscillators serving as source of randomness. IACR
Transactions on Cryptographic Hardware and Embedded Systems. 2018;2018(3):214-242.
doi:10.13154/tches.v2018.i3.214-242
apa: Allini, E. N., Skórski, M., Petura, O., Bernard, F., Laban, M., & Fischer,
V. (2018). Evaluation and monitoring of free running oscillators serving as source
of randomness. IACR Transactions on Cryptographic Hardware and Embedded Systems.
International Association for Cryptologic Research. https://doi.org/10.13154/tches.v2018.i3.214-242
chicago: Allini, Elie Noumon, Maciej Skórski, Oto Petura, Florent Bernard, Marek
Laban, and Viktor Fischer. “Evaluation and Monitoring of Free Running Oscillators
Serving as Source of Randomness.” IACR Transactions on Cryptographic Hardware
and Embedded Systems. International Association for Cryptologic Research,
2018. https://doi.org/10.13154/tches.v2018.i3.214-242.
ieee: E. N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, and V. Fischer,
“Evaluation and monitoring of free running oscillators serving as source of randomness,”
IACR Transactions on Cryptographic Hardware and Embedded Systems, vol.
2018, no. 3. International Association for Cryptologic Research, pp. 214–242,
2018.
ista: Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. 2018. Evaluation
and monitoring of free running oscillators serving as source of randomness. IACR
Transactions on Cryptographic Hardware and Embedded Systems. 2018(3), 214–242.
mla: Allini, Elie Noumon, et al. “Evaluation and Monitoring of Free Running Oscillators
Serving as Source of Randomness.” IACR Transactions on Cryptographic Hardware
and Embedded Systems, vol. 2018, no. 3, International Association for Cryptologic
Research, 2018, pp. 214–42, doi:10.13154/tches.v2018.i3.214-242.
short: E.N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, V. Fischer, IACR
Transactions on Cryptographic Hardware and Embedded Systems 2018 (2018) 214–242.
date_created: 2021-11-14T23:01:25Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2021-11-15T10:48:49Z
day: '01'
ddc:
- '000'
department:
- _id: KrPi
doi: 10.13154/tches.v2018.i3.214-242
file:
- access_level: open_access
checksum: b816b848f046c48a8357700d9305dce5
content_type: application/pdf
creator: cchlebak
date_created: 2021-11-15T10:27:29Z
date_updated: 2021-11-15T10:27:29Z
file_id: '10289'
file_name: 2018_IACR_Allini.pdf
file_size: 955755
relation: main_file
success: 1
file_date_updated: 2021-11-15T10:27:29Z
has_accepted_license: '1'
intvolume: ' 2018'
issue: '3'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 214-242
publication: IACR Transactions on Cryptographic Hardware and Embedded Systems
publication_identifier:
eissn:
- 2569-2925
publication_status: published
publisher: International Association for Cryptologic Research
quality_controlled: '1'
scopus_import: '1'
status: public
title: Evaluation and monitoring of free running oscillators serving as source of
randomness
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 2018
year: '2018'
...
---
_id: '10883'
abstract:
- lang: eng
text: 'Solving parity games, which are equivalent to modal μ-calculus model checking,
is a central algorithmic problem in formal methods, with applications in reactive
synthesis, program repair, verification of branching-time properties, etc. Besides
the standard compu- tation model with the explicit representation of games, another
important theoretical model of computation is that of set-based symbolic algorithms.
Set-based symbolic algorithms use basic set operations and one-step predecessor
operations on the implicit description of games, rather than the explicit representation.
The significance of symbolic algorithms is that they provide scalable algorithms
for large finite-state systems, as well as for infinite-state systems with finite
quotient. Consider parity games on graphs with n vertices and parity conditions
with d priorities. While there is a rich literature of explicit algorithms for
parity games, the main results for set-based symbolic algorithms are as follows:
(a) the basic algorithm that requires O(nd) symbolic operations and O(d) symbolic
space; and (b) an improved algorithm that requires O(nd/3+1) symbolic operations
and O(n) symbolic space. In this work, our contributions are as follows: (1) We
present a black-box set-based symbolic algorithm based on the explicit progress
measure algorithm. Two important consequences of our algorithm are as follows:
(a) a set-based symbolic algorithm for parity games that requires quasi-polynomially
many symbolic operations and O(n) symbolic space; and (b) any future improvement
in progress measure based explicit algorithms immediately imply an efficiency
improvement in our set-based symbolic algorithm for parity games. (2) We present
a set-based symbolic algorithm that requires quasi-polynomially many symbolic
operations and O(d · log n) symbolic space. Moreover, for the important special
case of d ≤ log n, our algorithm requires only polynomially many symbolic operations
and poly-logarithmic symbolic space.'
acknowledgement: 'A. S. is fully supported by the Vienna Science and Technology Fund
(WWTF) through project ICT15-003. K.C. is supported by the Austrian Science Fund
(FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC Starting grant (279307: Graph
Games). For M.H the research leading to these results has received funding from
the European Research Council under the European Union’s Seventh Framework Programme
(FP/2007-2013) /ERC Grant Agreement no. 340506.'
alternative_title:
- EPiC Series in Computing
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Wolfgang
full_name: Dvořák, Wolfgang
last_name: Dvořák
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Alexander
full_name: Svozil, Alexander
last_name: Svozil
citation:
ama: 'Chatterjee K, Dvořák W, Henzinger MH, Svozil A. Quasipolynomial set-based
symbolic algorithms for parity games. In: 22nd International Conference on
Logic for Programming, Artificial Intelligence and Reasoning. Vol 57. EasyChair;
2018:233-253. doi:10.29007/5z5k'
apa: 'Chatterjee, K., Dvořák, W., Henzinger, M. H., & Svozil, A. (2018). Quasipolynomial
set-based symbolic algorithms for parity games. In 22nd International Conference
on Logic for Programming, Artificial Intelligence and Reasoning (Vol. 57,
pp. 233–253). Awassa, Ethiopia: EasyChair. https://doi.org/10.29007/5z5k'
chicago: Chatterjee, Krishnendu, Wolfgang Dvořák, Monika H Henzinger, and Alexander
Svozil. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” In 22nd
International Conference on Logic for Programming, Artificial Intelligence and
Reasoning, 57:233–53. EasyChair, 2018. https://doi.org/10.29007/5z5k.
ieee: K. Chatterjee, W. Dvořák, M. H. Henzinger, and A. Svozil, “Quasipolynomial
set-based symbolic algorithms for parity games,” in 22nd International Conference
on Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia,
2018, vol. 57, pp. 233–253.
ista: 'Chatterjee K, Dvořák W, Henzinger MH, Svozil A. 2018. Quasipolynomial set-based
symbolic algorithms for parity games. 22nd International Conference on Logic for
Programming, Artificial Intelligence and Reasoning. LPAR: Conference on Logic
for Programming, Artificial Intelligence and Reasoning, EPiC Series in Computing,
vol. 57, 233–253.'
mla: Chatterjee, Krishnendu, et al. “Quasipolynomial Set-Based Symbolic Algorithms
for Parity Games.” 22nd International Conference on Logic for Programming,
Artificial Intelligence and Reasoning, vol. 57, EasyChair, 2018, pp. 233–53,
doi:10.29007/5z5k.
short: K. Chatterjee, W. Dvořák, M.H. Henzinger, A. Svozil, in:, 22nd International
Conference on Logic for Programming, Artificial Intelligence and Reasoning, EasyChair,
2018, pp. 233–253.
conference:
end_date: 2018-11-21
location: Awassa, Ethiopia
name: 'LPAR: Conference on Logic for Programming, Artificial Intelligence and Reasoning'
start_date: 2018-11-17
date_created: 2022-03-18T12:46:32Z
date_published: 2018-10-23T00:00:00Z
date_updated: 2022-07-29T09:24:31Z
day: '23'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.29007/5z5k
ec_funded: 1
external_id:
arxiv:
- '1909.04983'
file:
- access_level: open_access
checksum: 1229aa8640bd6db610c85decf2265480
content_type: application/pdf
creator: dernst
date_created: 2022-05-17T07:51:08Z
date_updated: 2022-05-17T07:51:08Z
file_id: '11392'
file_name: 2018_EPiCs_Chatterjee.pdf
file_size: 720893
relation: main_file
success: 1
file_date_updated: 2022-05-17T07:51:08Z
has_accepted_license: '1'
intvolume: ' 57'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 233-253
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: 22nd International Conference on Logic for Programming, Artificial Intelligence
and Reasoning
publication_identifier:
issn:
- 2398-7340
publication_status: published
publisher: EasyChair
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quasipolynomial set-based symbolic algorithms for parity games
type: conference
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 57
year: '2018'
...
---
_id: '11'
abstract:
- lang: eng
text: We report on a novel strategy to derive mean-field limits of quantum mechanical
systems in which a large number of particles weakly couple to a second-quantized
radiation field. The technique combines the method of counting and the coherent
state approach to study the growth of the correlations among the particles and
in the radiation field. As an instructional example, we derive the Schrödinger–Klein–Gordon
system of equations from the Nelson model with ultraviolet cutoff and possibly
massless scalar field. In particular, we prove the convergence of the reduced
density matrices (of the nonrelativistic particles and the field bosons) associated
with the exact time evolution to the projectors onto the solutions of the Schrödinger–Klein–Gordon
equations in trace norm. Furthermore, we derive explicit bounds on the rate of
convergence of the one-particle reduced density matrix of the nonrelativistic
particles in Sobolev norm.
author:
- first_name: Nikolai K
full_name: Leopold, Nikolai K
id: 4BC40BEC-F248-11E8-B48F-1D18A9856A87
last_name: Leopold
orcid: 0000-0002-0495-6822
- first_name: Peter
full_name: Pickl, Peter
last_name: Pickl
citation:
ama: 'Leopold NK, Pickl P. Mean-field limits of particles in interaction with quantised
radiation fields. In: Vol 270. Springer; 2018:185-214. doi:10.1007/978-3-030-01602-9_9'
apa: 'Leopold, N. K., & Pickl, P. (2018). Mean-field limits of particles in
interaction with quantised radiation fields (Vol. 270, pp. 185–214). Presented
at the MaLiQS: Macroscopic Limits of Quantum Systems, Munich, Germany: Springer.
https://doi.org/10.1007/978-3-030-01602-9_9'
chicago: Leopold, Nikolai K, and Peter Pickl. “Mean-Field Limits of Particles in
Interaction with Quantised Radiation Fields,” 270:185–214. Springer, 2018. https://doi.org/10.1007/978-3-030-01602-9_9.
ieee: 'N. K. Leopold and P. Pickl, “Mean-field limits of particles in interaction
with quantised radiation fields,” presented at the MaLiQS: Macroscopic Limits
of Quantum Systems, Munich, Germany, 2018, vol. 270, pp. 185–214.'
ista: 'Leopold NK, Pickl P. 2018. Mean-field limits of particles in interaction
with quantised radiation fields. MaLiQS: Macroscopic Limits of Quantum Systems
vol. 270, 185–214.'
mla: Leopold, Nikolai K., and Peter Pickl. Mean-Field Limits of Particles in
Interaction with Quantised Radiation Fields. Vol. 270, Springer, 2018, pp.
185–214, doi:10.1007/978-3-030-01602-9_9.
short: N.K. Leopold, P. Pickl, in:, Springer, 2018, pp. 185–214.
conference:
end_date: 2017-04-01
location: Munich, Germany
name: 'MaLiQS: Macroscopic Limits of Quantum Systems'
start_date: 2017-03-30
date_created: 2018-12-11T11:44:08Z
date_published: 2018-10-27T00:00:00Z
date_updated: 2021-01-12T06:48:16Z
day: '27'
department:
- _id: RoSe
doi: 10.1007/978-3-030-01602-9_9
ec_funded: 1
external_id:
arxiv:
- '1806.10843'
intvolume: ' 270'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1806.10843
month: '10'
oa: 1
oa_version: Preprint
page: 185 - 214
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication_status: published
publisher: Springer
publist_id: '8045'
quality_controlled: '1'
scopus_import: 1
status: public
title: Mean-field limits of particles in interaction with quantised radiation fields
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 270
year: '2018'
...
---
_id: '1215'
abstract:
- lang: eng
text: "Two generalizations of Itô formula to infinite-dimensional spaces are given.\r\nThe
first one, in Hilbert spaces, extends the classical one by taking advantage of\r\ncancellations
when they occur in examples and it is applied to the case of a group\r\ngenerator.
The second one, based on the previous one and a limit procedure, is an Itô\r\nformula
in a special class of Banach spaces having a product structure with the noise\r\nin
a Hilbert component; again the key point is the extension due to a cancellation.
This\r\nextension to Banach spaces and in particular the specific cancellation
are motivated\r\nby path-dependent Itô calculus."
acknowledgement: Open access funding provided by Institute of Science and Technology
(IST Austria). The second named author benefited partially from the support of the
“FMJH Program Gaspard Monge in Optimization and Operations Research” (Project 2014-1607H).
He is also grateful for the invitation to the Department of Mathematics of the University
of Pisa. The third named author is grateful for the invitation to ENSTA.
article_processing_charge: Yes (via OA deal)
author:
- first_name: Franco
full_name: Flandoli, Franco
last_name: Flandoli
- first_name: Francesco
full_name: Russo, Francesco
last_name: Russo
- first_name: Giovanni A
full_name: Zanco, Giovanni A
id: 47491882-F248-11E8-B48F-1D18A9856A87
last_name: Zanco
citation:
ama: Flandoli F, Russo F, Zanco GA. Infinite-dimensional calculus under weak spatial
regularity of the processes. Journal of Theoretical Probability. 2018;31(2):789-826.
doi:10.1007/s10959-016-0724-2
apa: Flandoli, F., Russo, F., & Zanco, G. A. (2018). Infinite-dimensional calculus
under weak spatial regularity of the processes. Journal of Theoretical Probability.
Springer. https://doi.org/10.1007/s10959-016-0724-2
chicago: Flandoli, Franco, Francesco Russo, and Giovanni A Zanco. “Infinite-Dimensional
Calculus under Weak Spatial Regularity of the Processes.” Journal of Theoretical
Probability. Springer, 2018. https://doi.org/10.1007/s10959-016-0724-2.
ieee: F. Flandoli, F. Russo, and G. A. Zanco, “Infinite-dimensional calculus under
weak spatial regularity of the processes,” Journal of Theoretical Probability,
vol. 31, no. 2. Springer, pp. 789–826, 2018.
ista: Flandoli F, Russo F, Zanco GA. 2018. Infinite-dimensional calculus under weak
spatial regularity of the processes. Journal of Theoretical Probability. 31(2),
789–826.
mla: Flandoli, Franco, et al. “Infinite-Dimensional Calculus under Weak Spatial
Regularity of the Processes.” Journal of Theoretical Probability, vol.
31, no. 2, Springer, 2018, pp. 789–826, doi:10.1007/s10959-016-0724-2.
short: F. Flandoli, F. Russo, G.A. Zanco, Journal of Theoretical Probability 31
(2018) 789–826.
date_created: 2018-12-11T11:50:45Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2021-01-12T06:49:09Z
day: '01'
ddc:
- '519'
department:
- _id: JaMa
doi: 10.1007/s10959-016-0724-2
file:
- access_level: open_access
checksum: 47686d58ec21c164540f1a980ff2163f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:13Z
date_updated: 2020-07-14T12:44:39Z
file_id: '5266'
file_name: IST-2016-712-v1+1_s10959-016-0724-2.pdf
file_size: 671125
relation: main_file
file_date_updated: 2020-07-14T12:44:39Z
has_accepted_license: '1'
intvolume: ' 31'
issue: '2'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 789-826
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Journal of Theoretical Probability
publication_status: published
publisher: Springer
publist_id: '6119'
pubrep_id: '712'
quality_controlled: '1'
scopus_import: 1
status: public
title: Infinite-dimensional calculus under weak spatial regularity of the processes
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 31
year: '2018'
...
---
_id: '185'
abstract:
- lang: eng
text: We resolve in the affirmative conjectures of A. Skopenkov and Repovš (1998),
and M. Skopenkov (2003) generalizing the classical Hanani-Tutte theorem to the
setting of approximating maps of graphs on 2-dimensional surfaces by embeddings.
Our proof of this result is constructive and almost immediately implies an efficient
algorithm for testing whether a given piecewise linear map of a graph in a surface
is approximable by an embedding. More precisely, an instance of this problem consists
of (i) a graph G whose vertices are partitioned into clusters and whose inter-cluster
edges are partitioned into bundles, and (ii) a region R of a 2-dimensional compact
surface M given as the union of a set of pairwise disjoint discs corresponding
to the clusters and a set of pairwise disjoint "pipes" corresponding
to the bundles, connecting certain pairs of these discs. We are to decide whether
G can be embedded inside M so that the vertices in every cluster are drawn in
the corresponding disc, the edges in every bundle pass only through its corresponding
pipe, and every edge crosses the boundary of each disc at most once.
alternative_title:
- Leibniz International Proceedings in Information, LIPIcs
article_number: '39'
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: Jan
full_name: Kynčl, Jan
last_name: Kynčl
citation:
ama: 'Fulek R, Kynčl J. Hanani-Tutte for approximating maps of graphs. In: Vol 99.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.SoCG.2018.39'
apa: 'Fulek, R., & Kynčl, J. (2018). Hanani-Tutte for approximating maps of
graphs (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry,
Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.39'
chicago: Fulek, Radoslav, and Jan Kynčl. “Hanani-Tutte for Approximating Maps of
Graphs,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.39.
ieee: 'R. Fulek and J. Kynčl, “Hanani-Tutte for approximating maps of graphs,” presented
at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol.
99.'
ista: 'Fulek R, Kynčl J. 2018. Hanani-Tutte for approximating maps of graphs. SoCG:
Symposium on Computational Geometry, Leibniz International Proceedings in Information,
LIPIcs, vol. 99, 39.'
mla: Fulek, Radoslav, and Jan Kynčl. Hanani-Tutte for Approximating Maps of Graphs.
Vol. 99, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.SoCG.2018.39.
short: R. Fulek, J. Kynčl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2018.
conference:
end_date: 2018-06-14
location: Budapest, Hungary
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2018-06-11
date_created: 2018-12-11T11:45:04Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2021-01-12T06:53:36Z
day: '01'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2018.39
file:
- access_level: open_access
checksum: f1b94f1a75b37c414a1f61d59fb2cd4c
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T12:33:52Z
date_updated: 2020-07-14T12:45:19Z
file_id: '5701'
file_name: 2018_LIPIcs_Fulek.pdf
file_size: 718857
relation: main_file
file_date_updated: 2020-07-14T12:45:19Z
has_accepted_license: '1'
intvolume: ' 99'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 261FA626-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02281
name: Eliminating intersections in drawings of graphs
publication_identifier:
isbn:
- 978-3-95977-066-8
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7735'
quality_controlled: '1'
scopus_import: 1
status: public
title: Hanani-Tutte for approximating maps of graphs
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: 99
year: '2018'
...
---
_id: '188'
abstract:
- lang: eng
text: Smallest enclosing spheres of finite point sets are central to methods in
topological data analysis. Focusing on Bregman divergences to measure dissimilarity,
we prove bounds on the location of the center of a smallest enclosing sphere.
These bounds depend on the range of radii for which Bregman balls are convex.
acknowledgement: This research is partially supported by the Office of Naval Research,
through grant no. N62909-18-1-2038, and the DFG Collaborative Research Center TRR
109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of
the Austrian Science Fund
alternative_title:
- Leibniz International Proceedings in Information, LIPIcs
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Ziga
full_name: Virk, Ziga
last_name: Virk
- first_name: Hubert
full_name: Wagner, Hubert
id: 379CA8B8-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
citation:
ama: 'Edelsbrunner H, Virk Z, Wagner H. Smallest enclosing spheres and Chernoff
points in Bregman geometry. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2018:35:1-35:13. doi:10.4230/LIPIcs.SoCG.2018.35'
apa: 'Edelsbrunner, H., Virk, Z., & Wagner, H. (2018). Smallest enclosing spheres
and Chernoff points in Bregman geometry (Vol. 99, p. 35:1-35:13). Presented at
the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.35'
chicago: Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Smallest Enclosing
Spheres and Chernoff Points in Bregman Geometry,” 99:35:1-35:13. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.35.
ieee: 'H. Edelsbrunner, Z. Virk, and H. Wagner, “Smallest enclosing spheres and
Chernoff points in Bregman geometry,” presented at the SoCG: Symposium on Computational
Geometry, Budapest, Hungary, 2018, vol. 99, p. 35:1-35:13.'
ista: 'Edelsbrunner H, Virk Z, Wagner H. 2018. Smallest enclosing spheres and Chernoff
points in Bregman geometry. SoCG: Symposium on Computational Geometry, Leibniz
International Proceedings in Information, LIPIcs, vol. 99, 35:1-35:13.'
mla: Edelsbrunner, Herbert, et al. Smallest Enclosing Spheres and Chernoff Points
in Bregman Geometry. Vol. 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2018, p. 35:1-35:13, doi:10.4230/LIPIcs.SoCG.2018.35.
short: H. Edelsbrunner, Z. Virk, H. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2018, p. 35:1-35:13.
conference:
end_date: 2018-06-14
location: Budapest, Hungary
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2018-06-11
date_created: 2018-12-11T11:45:05Z
date_published: 2018-06-11T00:00:00Z
date_updated: 2021-01-12T06:53:48Z
day: '11'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.4230/LIPIcs.SoCG.2018.35
file:
- access_level: open_access
checksum: 7509403803b3ac1aee94bbc2ad293d21
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T16:31:31Z
date_updated: 2020-07-14T12:45:20Z
file_id: '5724'
file_name: 2018_LIPIcs_Edelsbrunner.pdf
file_size: 489080
relation: main_file
file_date_updated: 2020-07-14T12:45:20Z
has_accepted_license: '1'
intvolume: ' 99'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 35:1 - 35:13
project:
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7733'
quality_controlled: '1'
scopus_import: 1
status: public
title: Smallest enclosing spheres and Chernoff points in Bregman geometry
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: 99
year: '2018'
...
---
_id: '306'
abstract:
- lang: eng
text: A cornerstone of statistical inference, the maximum entropy framework is being
increasingly applied to construct descriptive and predictive models of biological
systems, especially complex biological networks, from large experimental data
sets. Both its broad applicability and the success it obtained in different contexts
hinge upon its conceptual simplicity and mathematical soundness. Here we try to
concisely review the basic elements of the maximum entropy principle, starting
from the notion of ‘entropy’, and describe its usefulness for the analysis of
biological systems. As examples, we focus specifically on the problem of reconstructing
gene interaction networks from expression data and on recent work attempting to
expand our system-level understanding of bacterial metabolism. Finally, we highlight
some extensions and potential limitations of the maximum entropy approach, and
point to more recent developments that are likely to play a key role in the upcoming
challenges of extracting structures and information from increasingly rich, high-throughput
biological data.
article_number: e00596
author:
- first_name: Andrea
full_name: De Martino, Andrea
last_name: De Martino
- first_name: Daniele
full_name: De Martino, Daniele
id: 3FF5848A-F248-11E8-B48F-1D18A9856A87
last_name: De Martino
orcid: 0000-0002-5214-4706
citation:
ama: De Martino A, De Martino D. An introduction to the maximum entropy approach
and its application to inference problems in biology. Heliyon. 2018;4(4).
doi:10.1016/j.heliyon.2018.e00596
apa: De Martino, A., & De Martino, D. (2018). An introduction to the maximum
entropy approach and its application to inference problems in biology. Heliyon.
Elsevier. https://doi.org/10.1016/j.heliyon.2018.e00596
chicago: De Martino, Andrea, and Daniele De Martino. “An Introduction to the Maximum
Entropy Approach and Its Application to Inference Problems in Biology.” Heliyon.
Elsevier, 2018. https://doi.org/10.1016/j.heliyon.2018.e00596.
ieee: A. De Martino and D. De Martino, “An introduction to the maximum entropy approach
and its application to inference problems in biology,” Heliyon, vol. 4,
no. 4. Elsevier, 2018.
ista: De Martino A, De Martino D. 2018. An introduction to the maximum entropy approach
and its application to inference problems in biology. Heliyon. 4(4), e00596.
mla: De Martino, Andrea, and Daniele De Martino. “An Introduction to the Maximum
Entropy Approach and Its Application to Inference Problems in Biology.” Heliyon,
vol. 4, no. 4, e00596, Elsevier, 2018, doi:10.1016/j.heliyon.2018.e00596.
short: A. De Martino, D. De Martino, Heliyon 4 (2018).
date_created: 2018-12-11T11:45:44Z
date_published: 2018-04-01T00:00:00Z
date_updated: 2021-01-12T07:40:46Z
day: '01'
ddc:
- '530'
department:
- _id: GaTk
doi: 10.1016/j.heliyon.2018.e00596
ec_funded: 1
file:
- access_level: open_access
checksum: 67010cf5e3b3e0637c659371714a715a
content_type: application/pdf
creator: dernst
date_created: 2019-02-06T07:36:24Z
date_updated: 2020-07-14T12:45:59Z
file_id: '5929'
file_name: 2018_Heliyon_DeMartino.pdf
file_size: 994490
relation: main_file
file_date_updated: 2020-07-14T12:45:59Z
has_accepted_license: '1'
intvolume: ' 4'
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Heliyon
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: 1
status: public
title: An introduction to the maximum entropy approach and its application to inference
problems in biology
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: 4
year: '2018'
...
---
_id: '3300'
abstract:
- lang: eng
text: "This book first explores the origins of this idea, grounded in theoretical
work on temporal logic and automata. The editors and authors are among the world's
leading researchers in this domain, and they contributed 32 chapters representing
a thorough view of the development and application of the technique. Topics covered
include binary decision diagrams, symbolic model checking, satisfiability modulo
theories, partial-order reduction, abstraction, interpolation, concurrency, security
protocols, games, probabilistic model checking, and process algebra, and chapters
on the transfer of theory to industrial practice, property specification languages
for hardware, and verification of real-time systems and hybrid systems.\r\n\r\nThe
book will be valuable for researchers and graduate students engaged with the development
of formal methods and verification tools."
article_processing_charge: No
author:
- first_name: Edmund M.
full_name: Clarke, Edmund M.
last_name: Clarke
- 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: Helmut
full_name: Veith, Helmut
last_name: Veith
- first_name: Roderick
full_name: Bloem, Roderick
last_name: Bloem
citation:
ama: 'Clarke EM, Henzinger TA, Veith H, Bloem R. Handbook of Model Checking.
1st ed. Cham: Springer Nature; 2018. doi:10.1007/978-3-319-10575-8'
apa: 'Clarke, E. M., Henzinger, T. A., Veith, H., & Bloem, R. (2018). Handbook
of Model Checking (1st ed.). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-10575-8'
chicago: 'Clarke, Edmund M., Thomas A Henzinger, Helmut Veith, and Roderick Bloem.
Handbook of Model Checking. 1st ed. Cham: Springer Nature, 2018. https://doi.org/10.1007/978-3-319-10575-8.'
ieee: 'E. M. Clarke, T. A. Henzinger, H. Veith, and R. Bloem, Handbook of Model
Checking, 1st ed. Cham: Springer Nature, 2018.'
ista: 'Clarke EM, Henzinger TA, Veith H, Bloem R. 2018. Handbook of Model Checking
1st ed., Cham: Springer Nature, XLVIII, 1212p.'
mla: Clarke, Edmund M., et al. Handbook of Model Checking. 1st ed., Springer
Nature, 2018, doi:10.1007/978-3-319-10575-8.
short: E.M. Clarke, T.A. Henzinger, H. Veith, R. Bloem, Handbook of Model Checking,
1st ed., Springer Nature, Cham, 2018.
date_created: 2018-12-11T12:02:32Z
date_published: 2018-06-08T00:00:00Z
date_updated: 2021-12-21T10:49:36Z
day: '08'
department:
- _id: ToHe
doi: 10.1007/978-3-319-10575-8
edition: '1'
language:
- iso: eng
month: '06'
oa_version: None
page: XLVIII, 1212
place: Cham
publication_identifier:
eisbn:
- 978-3-319-10575-8
isbn:
- 978-3-319-10574-1
publication_status: published
publisher: Springer Nature
publist_id: '3340'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Handbook of Model Checking
type: book
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2018'
...
---
_id: '37'
abstract:
- lang: eng
text: Developmental processes are inherently dynamic and understanding them requires
quantitative measurements of gene and protein expression levels in space and time.
While live imaging is a powerful approach for obtaining such data, it is still
a challenge to apply it over long periods of time to large tissues, such as the
embryonic spinal cord in mouse and chick. Nevertheless, dynamics of gene expression
and signaling activity patterns in this organ can be studied by collecting tissue
sections at different developmental stages. In combination with immunohistochemistry,
this allows for measuring the levels of multiple developmental regulators in a
quantitative manner with high spatiotemporal resolution. The mean protein expression
levels over time, as well as embryo-to-embryo variability can be analyzed. A key
aspect of the approach is the ability to compare protein levels across different
samples. This requires a number of considerations in sample preparation, imaging
and data analysis. Here we present a protocol for obtaining time course data of
dorsoventral expression patterns from mouse and chick neural tube in the first
3 days of neural tube development. The described workflow starts from embryo dissection
and ends with a processed dataset. Software scripts for data analysis are included.
The protocol is adaptable and instructions that allow the user to modify different
steps are provided. Thus, the procedure can be altered for analysis of time-lapse
images and applied to systems other than the neural tube.
alternative_title:
- Methods in Molecular Biology
article_processing_charge: No
author:
- first_name: Marcin P
full_name: Zagórski, Marcin P
id: 343DA0DC-F248-11E8-B48F-1D18A9856A87
last_name: Zagórski
orcid: 0000-0001-7896-7762
- first_name: Anna
full_name: Kicheva, Anna
id: 3959A2A0-F248-11E8-B48F-1D18A9856A87
last_name: Kicheva
orcid: 0000-0003-4509-4998
citation:
ama: 'Zagórski MP, Kicheva A. Measuring dorsoventral pattern and morphogen signaling
profiles in the growing neural tube. In: Morphogen Gradients . Vol 1863.
MIMB. Springer Nature; 2018:47-63. doi:10.1007/978-1-4939-8772-6_4'
apa: Zagórski, M. P., & Kicheva, A. (2018). Measuring dorsoventral pattern and
morphogen signaling profiles in the growing neural tube. In Morphogen Gradients
(Vol. 1863, pp. 47–63). Springer Nature. https://doi.org/10.1007/978-1-4939-8772-6_4
chicago: Zagórski, Marcin P, and Anna Kicheva. “Measuring Dorsoventral Pattern and
Morphogen Signaling Profiles in the Growing Neural Tube.” In Morphogen Gradients
, 1863:47–63. MIMB. Springer Nature, 2018. https://doi.org/10.1007/978-1-4939-8772-6_4.
ieee: M. P. Zagórski and A. Kicheva, “Measuring dorsoventral pattern and morphogen
signaling profiles in the growing neural tube,” in Morphogen Gradients ,
vol. 1863, Springer Nature, 2018, pp. 47–63.
ista: 'Zagórski MP, Kicheva A. 2018.Measuring dorsoventral pattern and morphogen
signaling profiles in the growing neural tube. In: Morphogen Gradients . Methods
in Molecular Biology, vol. 1863, 47–63.'
mla: Zagórski, Marcin P., and Anna Kicheva. “Measuring Dorsoventral Pattern and
Morphogen Signaling Profiles in the Growing Neural Tube.” Morphogen Gradients
, vol. 1863, Springer Nature, 2018, pp. 47–63, doi:10.1007/978-1-4939-8772-6_4.
short: M.P. Zagórski, A. Kicheva, in:, Morphogen Gradients , Springer Nature, 2018,
pp. 47–63.
date_created: 2018-12-11T11:44:17Z
date_published: 2018-10-16T00:00:00Z
date_updated: 2021-01-12T07:49:03Z
day: '16'
ddc:
- '570'
department:
- _id: AnKi
doi: 10.1007/978-1-4939-8772-6_4
ec_funded: 1
file:
- access_level: open_access
checksum: 2a97d0649fdcfcf1bdca7c8ad1dce71b
content_type: application/pdf
creator: dernst
date_created: 2020-10-13T14:20:37Z
date_updated: 2020-10-13T14:20:37Z
file_id: '8656'
file_name: 2018_MIMB_Zagorski.pdf
file_size: 4906815
relation: main_file
success: 1
file_date_updated: 2020-10-13T14:20:37Z
has_accepted_license: '1'
intvolume: ' 1863'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 47 - 63
project:
- _id: B6FC0238-B512-11E9-945C-1524E6697425
call_identifier: H2020
grant_number: '680037'
name: Coordination of Patterning And Growth In the Spinal Cord
publication: 'Morphogen Gradients '
publication_identifier:
isbn:
- 978-1-4939-8771-9
issn:
- 1064-3745
publication_status: published
publisher: Springer Nature
publist_id: '8018'
quality_controlled: '1'
scopus_import: '1'
series_title: MIMB
status: public
title: Measuring dorsoventral pattern and morphogen signaling profiles in the growing
neural tube
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1863
year: '2018'
...
---
_id: '305'
abstract:
- lang: eng
text: The hanging-drop network (HDN) is a technology platform based on a completely
open microfluidic network at the bottom of an inverted, surface-patterned substrate.
The platform is predominantly used for the formation, culturing, and interaction
of self-assembled spherical microtissues (spheroids) under precisely controlled
flow conditions. Here, we describe design, fabrication, and operation of microfluidic
hanging-drop networks.
acknowledgement: This work was financially supported by FP7 of the EU through the
project “Body on a chip,” ICT-FET-296257, and the ERC Advanced Grant “NeuroCMOS”
(contract 267351), as well as by an individual Ambizione Grant 142440 from the Swiss
National Science Foundation for Olivier Frey. The research leading to these results
also received funding from the People Programme (Marie Curie Actions) of the European
Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no.
[291734]. We would like to thank Alexander Stettler, ETH Zurich for his expertise
and support in the cleanroom, and we acknowledge the Single Cell Unit of D-BSSE,
ETH Zurich for assistance in microscopy issues. M.L. is grateful to the members
of the Guet and Tkačik groups, IST Austria, for valuable comments and support.
alternative_title:
- MIMB
author:
- first_name: Patrick
full_name: Misun, Patrick
last_name: Misun
- first_name: Axel
full_name: Birchler, Axel
last_name: Birchler
- first_name: Moritz
full_name: Lang, Moritz
id: 29E0800A-F248-11E8-B48F-1D18A9856A87
last_name: Lang
- first_name: Andreas
full_name: Hierlemann, Andreas
last_name: Hierlemann
- first_name: Olivier
full_name: Frey, Olivier
last_name: Frey
citation:
ama: Misun P, Birchler A, Lang M, Hierlemann A, Frey O. Fabrication and operation
of microfluidic hanging drop networks. Methods in Molecular Biology. 2018;1771:183-202.
doi:10.1007/978-1-4939-7792-5_15
apa: Misun, P., Birchler, A., Lang, M., Hierlemann, A., & Frey, O. (2018). Fabrication
and operation of microfluidic hanging drop networks. Methods in Molecular Biology.
Springer. https://doi.org/10.1007/978-1-4939-7792-5_15
chicago: Misun, Patrick, Axel Birchler, Moritz Lang, Andreas Hierlemann, and Olivier
Frey. “Fabrication and Operation of Microfluidic Hanging Drop Networks.” Methods
in Molecular Biology. Springer, 2018. https://doi.org/10.1007/978-1-4939-7792-5_15.
ieee: P. Misun, A. Birchler, M. Lang, A. Hierlemann, and O. Frey, “Fabrication and
operation of microfluidic hanging drop networks,” Methods in Molecular Biology,
vol. 1771. Springer, pp. 183–202, 2018.
ista: Misun P, Birchler A, Lang M, Hierlemann A, Frey O. 2018. Fabrication and operation
of microfluidic hanging drop networks. Methods in Molecular Biology. 1771, 183–202.
mla: Misun, Patrick, et al. “Fabrication and Operation of Microfluidic Hanging Drop
Networks.” Methods in Molecular Biology, vol. 1771, Springer, 2018, pp.
183–202, doi:10.1007/978-1-4939-7792-5_15.
short: P. Misun, A. Birchler, M. Lang, A. Hierlemann, O. Frey, Methods in Molecular
Biology 1771 (2018) 183–202.
date_created: 2018-12-11T11:45:43Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2021-01-12T07:40:42Z
day: '01'
department:
- _id: CaGu
- _id: GaTk
doi: 10.1007/978-1-4939-7792-5_15
ec_funded: 1
intvolume: ' 1771'
language:
- iso: eng
month: '01'
oa_version: None
page: 183 - 202
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Methods in Molecular Biology
publication_status: published
publisher: Springer
publist_id: '7574'
quality_controlled: '1'
scopus_import: 1
status: public
title: Fabrication and operation of microfluidic hanging drop networks
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1771
year: '2018'
...
---
_id: '325'
abstract:
- lang: eng
text: Probabilistic programs extend classical imperative programs with real-valued
random variables and random branching. The most basic liveness property for such
programs is the termination property. The qualitative (aka almost-sure) termination
problem asks whether a given program program terminates with probability 1. While
ranking functions provide a sound and complete method for non-probabilistic programs,
the extension of them to probabilistic programs is achieved via ranking supermartingales
(RSMs). Although deep theoretical results have been established about RSMs, their
application to probabilistic programs with nondeterminism has been limited only
to programs of restricted control-flow structure. For non-probabilistic programs,
lexicographic ranking functions provide a compositional and practical approach
for termination analysis of real-world programs. In this work we introduce lexicographic
RSMs and show that they present a sound method for almost-sure termination of
probabilistic programs with nondeterminism. We show that lexicographic RSMs provide
a tool for compositional reasoning about almost-sure termination, and for probabilistic
programs with linear arithmetic they can be synthesized efficiently (in polynomial
time). We also show that with additional restrictions even asymptotic bounds on
expected termination time can be obtained through lexicographic RSMs. Finally,
we present experimental results on benchmarks adapted from previous work to demonstrate
the effectiveness of our approach.
article_number: '34'
author:
- first_name: Sheshansh
full_name: Agrawal, Sheshansh
last_name: Agrawal
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Petr
full_name: Novotny, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotny
citation:
ama: 'Agrawal S, Chatterjee K, Novotný P. Lexicographic ranking supermartingales:
an efficient approach to termination of probabilistic programs. In: Vol 2. ACM;
2018. doi:10.1145/3158122'
apa: 'Agrawal, S., Chatterjee, K., & Novotný, P. (2018). Lexicographic ranking
supermartingales: an efficient approach to termination of probabilistic programs
(Vol. 2). Presented at the POPL: Principles of Programming Languages, Los Angeles,
CA, USA: ACM. https://doi.org/10.1145/3158122'
chicago: 'Agrawal, Sheshansh, Krishnendu Chatterjee, and Petr Novotný. “Lexicographic
Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic
Programs,” Vol. 2. ACM, 2018. https://doi.org/10.1145/3158122.'
ieee: 'S. Agrawal, K. Chatterjee, and P. Novotný, “Lexicographic ranking supermartingales:
an efficient approach to termination of probabilistic programs,” presented at
the POPL: Principles of Programming Languages, Los Angeles, CA, USA, 2018, vol.
2, no. POPL.'
ista: 'Agrawal S, Chatterjee K, Novotný P. 2018. Lexicographic ranking supermartingales:
an efficient approach to termination of probabilistic programs. POPL: Principles
of Programming Languages vol. 2, 34.'
mla: 'Agrawal, Sheshansh, et al. Lexicographic Ranking Supermartingales: An Efficient
Approach to Termination of Probabilistic Programs. Vol. 2, no. POPL, 34, ACM,
2018, doi:10.1145/3158122.'
short: S. Agrawal, K. Chatterjee, P. Novotný, in:, ACM, 2018.
conference:
end_date: 2018-01-13
location: Los Angeles, CA, USA
name: 'POPL: Principles of Programming Languages'
start_date: 2018-01-07
date_created: 2018-12-11T11:45:50Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2021-01-12T07:42:07Z
day: '01'
department:
- _id: KrCh
doi: 10.1145/3158122
external_id:
arxiv:
- '1709.04037'
intvolume: ' 2'
issue: POPL
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1709.04037
month: '01'
oa: 1
oa_version: Preprint
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: ACM
publist_id: '7540'
quality_controlled: '1'
status: public
title: 'Lexicographic ranking supermartingales: an efficient approach to termination
of probabilistic programs'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2018'
...
---
_id: '408'
abstract:
- lang: eng
text: Adventitious roots (AR) are de novo formed roots that emerge from any part
of the plant or from callus in tissue culture, except root tissue. The plant tissue
origin and the method by which they are induced determine the physiological properties
of emerged ARs. Hence, a standard method encompassing all types of AR does not
exist. Here we describe a method for the induction and analysis of AR that emerge
from the etiolated hypocotyl of dicot plants. The hypocotyl is formed during embryogenesis
and shows a determined developmental pattern which usually does not involve AR
formation. However, the hypocotyl shows propensity to form de novo roots under
specific circumstances such as removal of the root system, high humidity or flooding,
or during de-etiolation. The hypocotyl AR emerge from a pericycle-like cell layer
surrounding the vascular tissue of the central cylinder, which is reminiscent
to the developmental program of lateral roots. Here we propose an easy protocol
for in vitro hypocotyl AR induction from etiolated Arabidopsis seedlings.
alternative_title:
- MIMB
article_processing_charge: No
author:
- first_name: Hoang
full_name: Trinh, Hoang
last_name: Trinh
- first_name: Inge
full_name: Verstraeten, Inge
id: 362BF7FE-F248-11E8-B48F-1D18A9856A87
last_name: Verstraeten
orcid: 0000-0001-7241-2328
- first_name: Danny
full_name: Geelen, Danny
last_name: Geelen
citation:
ama: 'Trinh H, Verstraeten I, Geelen D. In vitro assay for induction of adventitious
rooting on intact arabidopsis hypocotyls. In: Root Development . Vol 1761.
Springer Nature; 2018:95-102. doi:10.1007/978-1-4939-7747-5_7'
apa: Trinh, H., Verstraeten, I., & Geelen, D. (2018). In vitro assay for induction
of adventitious rooting on intact arabidopsis hypocotyls. In Root Development
(Vol. 1761, pp. 95–102). Springer Nature. https://doi.org/10.1007/978-1-4939-7747-5_7
chicago: Trinh, Hoang, Inge Verstraeten, and Danny Geelen. “In Vitro Assay for Induction
of Adventitious Rooting on Intact Arabidopsis Hypocotyls.” In Root Development
, 1761:95–102. Springer Nature, 2018. https://doi.org/10.1007/978-1-4939-7747-5_7.
ieee: H. Trinh, I. Verstraeten, and D. Geelen, “In vitro assay for induction of
adventitious rooting on intact arabidopsis hypocotyls,” in Root Development
, vol. 1761, Springer Nature, 2018, pp. 95–102.
ista: 'Trinh H, Verstraeten I, Geelen D. 2018.In vitro assay for induction of adventitious
rooting on intact arabidopsis hypocotyls. In: Root Development . MIMB, vol. 1761,
95–102.'
mla: Trinh, Hoang, et al. “In Vitro Assay for Induction of Adventitious Rooting
on Intact Arabidopsis Hypocotyls.” Root Development , vol. 1761, Springer
Nature, 2018, pp. 95–102, doi:10.1007/978-1-4939-7747-5_7.
short: H. Trinh, I. Verstraeten, D. Geelen, in:, Root Development , Springer Nature,
2018, pp. 95–102.
date_created: 2018-12-11T11:46:18Z
date_published: 2018-03-01T00:00:00Z
date_updated: 2021-01-12T07:54:21Z
day: '01'
department:
- _id: JiFr
doi: 10.1007/978-1-4939-7747-5_7
external_id:
pmid:
- '29525951'
intvolume: ' 1761'
language:
- iso: eng
month: '03'
oa_version: None
page: 95 - 102
pmid: 1
publication: 'Root Development '
publication_identifier:
issn:
- 1064-3745
publication_status: published
publisher: Springer Nature
publist_id: '7421'
quality_controlled: '1'
scopus_import: '1'
status: public
title: In vitro assay for induction of adventitious rooting on intact arabidopsis
hypocotyls
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1761
year: '2018'
...
---
_id: '411'
abstract:
- lang: eng
text: Immunolocalization is a valuable tool for cell biology research that allows
to rapidly determine the localization and expression levels of endogenous proteins.
In plants, whole-mount in situ immunolocalization remains a challenging method,
especially in tissues protected by waxy layers and complex cell wall carbohydrates.
Here, we present a robust method for whole-mount in situ immunolocalization in
primary root meristems and lateral root primordia in Arabidopsis thaliana. For
good epitope preservation, fixation is done in an alkaline paraformaldehyde/glutaraldehyde
mixture. This fixative is suitable for detecting a wide range of proteins, including
integral transmembrane proteins and proteins peripherally attached to the plasma
membrane. From initiation until emergence from the primary root, lateral root
primordia are surrounded by several layers of differentiated tissues with a complex
cell wall composition that interferes with the efficient penetration of all buffers.
Therefore, immunolocalization in early lateral root primordia requires a modified
method, including a strong solvent treatment for removal of hydrophobic barriers
and a specific cocktail of cell wall-degrading enzymes. The presented method allows
for easy, reliable, and high-quality in situ detection of the subcellular localization
of endogenous proteins in primary and lateral root meristems without the need
of time-consuming crosses or making translational fusions to fluorescent proteins.
alternative_title:
- Methods in Molecular Biology
author:
- first_name: Michael
full_name: Karampelias, Michael
last_name: Karampelias
- first_name: Ricardo
full_name: Tejos, Ricardo
last_name: Tejos
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Steffen
full_name: Vanneste, Steffen
last_name: Vanneste
citation:
ama: 'Karampelias M, Tejos R, Friml J, Vanneste S. Optimized whole mount in situ
immunolocalization for Arabidopsis thaliana root meristems and lateral root primordia.
In: Ristova D, Barbez E, eds. Root Development. Methods and Protocols.
Vol 1761. MIMB. Springer; 2018:131-143. doi:10.1007/978-1-4939-7747-5_10'
apa: Karampelias, M., Tejos, R., Friml, J., & Vanneste, S. (2018). Optimized
whole mount in situ immunolocalization for Arabidopsis thaliana root meristems
and lateral root primordia. In D. Ristova & E. Barbez (Eds.), Root Development.
Methods and Protocols (Vol. 1761, pp. 131–143). Springer. https://doi.org/10.1007/978-1-4939-7747-5_10
chicago: Karampelias, Michael, Ricardo Tejos, Jiří Friml, and Steffen Vanneste.
“Optimized Whole Mount in Situ Immunolocalization for Arabidopsis Thaliana Root
Meristems and Lateral Root Primordia.” In Root Development. Methods and Protocols,
edited by Daniela Ristova and Elke Barbez, 1761:131–43. MIMB. Springer, 2018.
https://doi.org/10.1007/978-1-4939-7747-5_10.
ieee: M. Karampelias, R. Tejos, J. Friml, and S. Vanneste, “Optimized whole mount
in situ immunolocalization for Arabidopsis thaliana root meristems and lateral
root primordia,” in Root Development. Methods and Protocols, vol. 1761,
D. Ristova and E. Barbez, Eds. Springer, 2018, pp. 131–143.
ista: 'Karampelias M, Tejos R, Friml J, Vanneste S. 2018.Optimized whole mount in
situ immunolocalization for Arabidopsis thaliana root meristems and lateral root
primordia. In: Root Development. Methods and Protocols. Methods in Molecular Biology,
vol. 1761, 131–143.'
mla: Karampelias, Michael, et al. “Optimized Whole Mount in Situ Immunolocalization
for Arabidopsis Thaliana Root Meristems and Lateral Root Primordia.” Root
Development. Methods and Protocols, edited by Daniela Ristova and Elke Barbez,
vol. 1761, Springer, 2018, pp. 131–43, doi:10.1007/978-1-4939-7747-5_10.
short: M. Karampelias, R. Tejos, J. Friml, S. Vanneste, in:, D. Ristova, E. Barbez
(Eds.), Root Development. Methods and Protocols, Springer, 2018, pp. 131–143.
date_created: 2018-12-11T11:46:20Z
date_published: 2018-03-11T00:00:00Z
date_updated: 2021-01-12T07:54:34Z
day: '11'
department:
- _id: JiFr
doi: 10.1007/978-1-4939-7747-5_10
editor:
- first_name: Daniela
full_name: Ristova, Daniela
last_name: Ristova
- first_name: Elke
full_name: Barbez, Elke
last_name: Barbez
intvolume: ' 1761'
language:
- iso: eng
month: '03'
oa_version: None
page: 131 - 143
publication: Root Development. Methods and Protocols
publication_status: published
publisher: Springer
publist_id: '7418'
quality_controlled: '1'
scopus_import: 1
series_title: MIMB
status: public
title: Optimized whole mount in situ immunolocalization for Arabidopsis thaliana root
meristems and lateral root primordia
type: book_chapter
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 1761
year: '2018'
...
---
_id: '456'
abstract:
- lang: eng
text: 'Inhibition of the endoplasmic reticulum stress pathway may hold the key to
Zika virus-associated microcephaly treatment. '
article_number: eaar7514
author:
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
citation:
ama: 'Novarino G. Zika-associated microcephaly: Reduce the stress and race for the
treatment. Science Translational Medicine. 2018;10(423). doi:10.1126/scitranslmed.aar7514'
apa: 'Novarino, G. (2018). Zika-associated microcephaly: Reduce the stress and race
for the treatment. Science Translational Medicine. American Association
for the Advancement of Science. https://doi.org/10.1126/scitranslmed.aar7514'
chicago: 'Novarino, Gaia. “Zika-Associated Microcephaly: Reduce the Stress and Race
for the Treatment.” Science Translational Medicine. American Association
for the Advancement of Science, 2018. https://doi.org/10.1126/scitranslmed.aar7514.'
ieee: 'G. Novarino, “Zika-associated microcephaly: Reduce the stress and race for
the treatment,” Science Translational Medicine, vol. 10, no. 423. American
Association for the Advancement of Science, 2018.'
ista: 'Novarino G. 2018. Zika-associated microcephaly: Reduce the stress and race
for the treatment. Science Translational Medicine. 10(423), eaar7514.'
mla: 'Novarino, Gaia. “Zika-Associated Microcephaly: Reduce the Stress and Race
for the Treatment.” Science Translational Medicine, vol. 10, no. 423, eaar7514,
American Association for the Advancement of Science, 2018, doi:10.1126/scitranslmed.aar7514.'
short: G. Novarino, Science Translational Medicine 10 (2018).
date_created: 2018-12-11T11:46:34Z
date_published: 2018-01-10T00:00:00Z
date_updated: 2021-01-12T07:59:42Z
day: '10'
department:
- _id: GaNo
doi: 10.1126/scitranslmed.aar7514
intvolume: ' 10'
issue: '423'
language:
- iso: eng
month: '01'
oa_version: None
publication: Science Translational Medicine
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '7365'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Zika-associated microcephaly: Reduce the stress and race for the treatment'
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 10
year: '2018'
...
---
_id: '53'
abstract:
- lang: eng
text: In 2013, a publication repository was implemented at IST Austria and 2015
after a thorough preparation phase a data repository was implemented - both based
on the Open Source Software EPrints. In this text, designed as field report, we
will reflect on our experiences with Open Source Software in general and specifically
with EPrints regarding technical aspects but also regarding their characteristics
of the user community. The second part is a pleading for including the end users
in the process of implementation, adaption and evaluation.
author:
- first_name: Barbara
full_name: Petritsch, Barbara
id: 406048EC-F248-11E8-B48F-1D18A9856A87
last_name: Petritsch
orcid: 0000-0003-2724-4614
- first_name: Jana
full_name: Porsche, Jana
id: 3252EDC2-F248-11E8-B48F-1D18A9856A87
last_name: Porsche
citation:
ama: 'Petritsch B, Porsche J. IST PubRep and IST DataRep: the institutional repositories
at IST Austria. VÖB Mitteilungen. 2018;71(1):199-206. doi:10.31263/voebm.v71i1.1993'
apa: 'Petritsch, B., & Porsche, J. (2018). IST PubRep and IST DataRep: the institutional
repositories at IST Austria. VÖB Mitteilungen. Vereinigung Österreichischer
Bibliothekarinnen und Bibliothekare. https://doi.org/10.31263/voebm.v71i1.1993'
chicago: 'Petritsch, Barbara, and Jana Porsche. “IST PubRep and IST DataRep: The
Institutional Repositories at IST Austria.” VÖB Mitteilungen. Vereinigung
Österreichischer Bibliothekarinnen und Bibliothekare, 2018. https://doi.org/10.31263/voebm.v71i1.1993.'
ieee: 'B. Petritsch and J. Porsche, “IST PubRep and IST DataRep: the institutional
repositories at IST Austria,” VÖB Mitteilungen, vol. 71, no. 1. Vereinigung
Österreichischer Bibliothekarinnen und Bibliothekare, pp. 199–206, 2018.'
ista: 'Petritsch B, Porsche J. 2018. IST PubRep and IST DataRep: the institutional
repositories at IST Austria. VÖB Mitteilungen. 71(1), 199–206.'
mla: 'Petritsch, Barbara, and Jana Porsche. “IST PubRep and IST DataRep: The Institutional
Repositories at IST Austria.” VÖB Mitteilungen, vol. 71, no. 1, Vereinigung
Österreichischer Bibliothekarinnen und Bibliothekare, 2018, pp. 199–206, doi:10.31263/voebm.v71i1.1993.'
short: B. Petritsch, J. Porsche, VÖB Mitteilungen 71 (2018) 199–206.
date_created: 2018-12-11T11:44:22Z
date_published: 2018-10-01T00:00:00Z
date_updated: 2021-01-12T08:01:26Z
day: '01'
ddc:
- '020'
department:
- _id: E-Lib
doi: 10.31263/voebm.v71i1.1993
file:
- access_level: open_access
checksum: 7ac61bade5f37db011ca435ebcf86797
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T12:40:27Z
date_updated: 2020-07-14T12:46:38Z
file_id: '5702'
file_name: 2018_VOEB_Petritsch.pdf
file_size: 509434
relation: main_file
file_date_updated: 2020-07-14T12:46:38Z
has_accepted_license: '1'
intvolume: ' 71'
issue: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 199 - 206
publication: VÖB Mitteilungen
publication_status: published
publisher: Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare
publist_id: '8001'
scopus_import: 1
status: public
title: 'IST PubRep and IST DataRep: the institutional repositories at IST Austria'
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: 71
year: '2018'
...
---
_id: '536'
abstract:
- lang: eng
text: 'We consider the problem of consensus in the challenging classic model. In
this model, the adversary is adaptive; it can choose which processors crash at
any point during the course of the algorithm. Further, communication is via asynchronous
message passing: there is no known upper bound on the time to send a message from
one processor to another, and all messages and coin flips are seen by the adversary.
We describe a new randomized consensus protocol with expected message complexity
O(n2log2n) when fewer than n / 2 processes may fail by crashing. This is an almost-linear
improvement over the best previously known protocol, and within logarithmic factors
of a known Ω(n2) message lower bound. The protocol further ensures that no process
sends more than O(nlog3n) messages in expectation, which is again within logarithmic
factors of optimal. We also present a generalization of the algorithm to an arbitrary
number of failures t, which uses expected O(nt+t2log2t) total messages. Our approach
is to build a message-efficient, resilient mechanism for aggregating individual
processor votes, implementing the message-passing equivalent of a weak shared
coin. Roughly, in our protocol, a processor first announces its votes to small
groups, then propagates them to increasingly larger groups as it generates more
and more votes. To bound the number of messages that an individual process might
have to send or receive, the protocol progressively increases the weight of generated
votes. The main technical challenge is bounding the impact of votes that are still
“in flight” (generated, but not fully propagated) on the final outcome of the
shared coin, especially since such votes might have different weights. We achieve
this by leveraging the structure of the algorithm, and a technical argument based
on martingale concentration bounds. Overall, we show that it is possible to build
an efficient message-passing implementation of a shared coin, and in the process
(almost-optimally) solve the classic consensus problem in the asynchronous message-passing
model.'
article_processing_charge: Yes (via OA deal)
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: James
full_name: Aspnes, James
last_name: Aspnes
- first_name: Valerie
full_name: King, Valerie
last_name: King
- first_name: Jared
full_name: Saia, Jared
last_name: Saia
citation:
ama: Alistarh D-A, Aspnes J, King V, Saia J. Communication-efficient randomized
consensus. Distributed Computing. 2018;31(6):489-501. doi:10.1007/s00446-017-0315-1
apa: Alistarh, D.-A., Aspnes, J., King, V., & Saia, J. (2018). Communication-efficient
randomized consensus. Distributed Computing. Springer. https://doi.org/10.1007/s00446-017-0315-1
chicago: Alistarh, Dan-Adrian, James Aspnes, Valerie King, and Jared Saia. “Communication-Efficient
Randomized Consensus.” Distributed Computing. Springer, 2018. https://doi.org/10.1007/s00446-017-0315-1.
ieee: D.-A. Alistarh, J. Aspnes, V. King, and J. Saia, “Communication-efficient
randomized consensus,” Distributed Computing, vol. 31, no. 6. Springer,
pp. 489–501, 2018.
ista: Alistarh D-A, Aspnes J, King V, Saia J. 2018. Communication-efficient randomized
consensus. Distributed Computing. 31(6), 489–501.
mla: Alistarh, Dan-Adrian, et al. “Communication-Efficient Randomized Consensus.”
Distributed Computing, vol. 31, no. 6, Springer, 2018, pp. 489–501, doi:10.1007/s00446-017-0315-1.
short: D.-A. Alistarh, J. Aspnes, V. King, J. Saia, Distributed Computing 31 (2018)
489–501.
date_created: 2018-12-11T11:47:01Z
date_published: 2018-11-01T00:00:00Z
date_updated: 2023-02-23T12:23:25Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.1007/s00446-017-0315-1
file:
- access_level: open_access
checksum: 69b46e537acdcac745237ddb853fcbb5
content_type: application/pdf
creator: dernst
date_created: 2019-01-22T07:25:51Z
date_updated: 2020-07-14T12:46:38Z
file_id: '5867'
file_name: 2017_DistribComp_Alistarh.pdf
file_size: 595707
relation: main_file
file_date_updated: 2020-07-14T12:46:38Z
has_accepted_license: '1'
intvolume: ' 31'
issue: '6'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 489-501
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Distributed Computing
publication_identifier:
issn:
- '01782770'
publication_status: published
publisher: Springer
publist_id: '7281'
quality_controlled: '1'
scopus_import: 1
status: public
title: Communication-efficient randomized consensus
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 31
year: '2018'
...
---
_id: '554'
abstract:
- lang: eng
text: We analyse the canonical Bogoliubov free energy functional in three dimensions
at low temperatures in the dilute limit. We prove existence of a first-order phase
transition and, in the limit (Formula presented.), we determine the critical temperature
to be (Formula presented.) to leading order. Here, (Formula presented.) is the
critical temperature of the free Bose gas, ρ is the density of the gas and a is
the scattering length of the pair-interaction potential V. We also prove asymptotic
expansions for the free energy. In particular, we recover the Lee–Huang–Yang formula
in the limit (Formula presented.).
author:
- first_name: Marcin M
full_name: Napiórkowski, Marcin M
id: 4197AD04-F248-11E8-B48F-1D18A9856A87
last_name: Napiórkowski
- first_name: Robin
full_name: Reuvers, Robin
last_name: Reuvers
- first_name: Jan
full_name: Solovej, Jan
last_name: Solovej
citation:
ama: 'Napiórkowski MM, Reuvers R, Solovej J. The Bogoliubov free energy functional
II: The dilute Limit. Communications in Mathematical Physics. 2018;360(1):347-403.
doi:10.1007/s00220-017-3064-x'
apa: 'Napiórkowski, M. M., Reuvers, R., & Solovej, J. (2018). The Bogoliubov
free energy functional II: The dilute Limit. Communications in Mathematical
Physics. Springer. https://doi.org/10.1007/s00220-017-3064-x'
chicago: 'Napiórkowski, Marcin M, Robin Reuvers, and Jan Solovej. “The Bogoliubov
Free Energy Functional II: The Dilute Limit.” Communications in Mathematical
Physics. Springer, 2018. https://doi.org/10.1007/s00220-017-3064-x.'
ieee: 'M. M. Napiórkowski, R. Reuvers, and J. Solovej, “The Bogoliubov free energy
functional II: The dilute Limit,” Communications in Mathematical Physics,
vol. 360, no. 1. Springer, pp. 347–403, 2018.'
ista: 'Napiórkowski MM, Reuvers R, Solovej J. 2018. The Bogoliubov free energy functional
II: The dilute Limit. Communications in Mathematical Physics. 360(1), 347–403.'
mla: 'Napiórkowski, Marcin M., et al. “The Bogoliubov Free Energy Functional II:
The Dilute Limit.” Communications in Mathematical Physics, vol. 360, no.
1, Springer, 2018, pp. 347–403, doi:10.1007/s00220-017-3064-x.'
short: M.M. Napiórkowski, R. Reuvers, J. Solovej, Communications in Mathematical
Physics 360 (2018) 347–403.
date_created: 2018-12-11T11:47:09Z
date_published: 2018-05-01T00:00:00Z
date_updated: 2021-01-12T08:02:35Z
day: '01'
department:
- _id: RoSe
doi: 10.1007/s00220-017-3064-x
external_id:
arxiv:
- '1511.05953'
intvolume: ' 360'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1511.05953
month: '05'
oa: 1
oa_version: Submitted Version
page: 347-403
project:
- _id: 25C878CE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P27533_N27
name: Structure of the Excitation Spectrum for Many-Body Quantum Systems
publication: Communications in Mathematical Physics
publication_identifier:
issn:
- '00103616'
publication_status: published
publisher: Springer
publist_id: '7260'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'The Bogoliubov free energy functional II: The dilute Limit'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 360
year: '2018'
...
---
_id: '562'
abstract:
- lang: eng
text: Primary neuronal cell culture preparations are widely used to investigate
synaptic functions. This chapter describes a detailed protocol for the preparation
of a neuronal cell culture in which giant calyx-type synaptic terminals are formed.
This chapter also presents detailed protocols for utilizing the main technical
advantages provided by such a preparation, namely, labeling and imaging of synaptic
organelles and electrophysiological recordings directly from presynaptic terminals.
alternative_title:
- Methods in Molecular Biology
article_processing_charge: No
author:
- first_name: Dimitar
full_name: Dimitrov, Dimitar
last_name: Dimitrov
- first_name: Laurent
full_name: Guillaud, Laurent
last_name: Guillaud
- first_name: Kohgaku
full_name: Eguchi, Kohgaku
id: 2B7846DC-F248-11E8-B48F-1D18A9856A87
last_name: Eguchi
orcid: 0000-0002-6170-2546
- first_name: Tomoyuki
full_name: Takahashi, Tomoyuki
last_name: Takahashi
citation:
ama: 'Dimitrov D, Guillaud L, Eguchi K, Takahashi T. Culture of mouse giant central
nervous system synapses and application for imaging and electrophysiological analyses.
In: Skaper SD, ed. Neurotrophic Factors. Vol 1727. Springer; 2018:201-215.
doi:10.1007/978-1-4939-7571-6_15'
apa: Dimitrov, D., Guillaud, L., Eguchi, K., & Takahashi, T. (2018). Culture
of mouse giant central nervous system synapses and application for imaging and
electrophysiological analyses. In S. D. Skaper (Ed.), Neurotrophic Factors
(Vol. 1727, pp. 201–215). Springer. https://doi.org/10.1007/978-1-4939-7571-6_15
chicago: Dimitrov, Dimitar, Laurent Guillaud, Kohgaku Eguchi, and Tomoyuki Takahashi.
“Culture of Mouse Giant Central Nervous System Synapses and Application for Imaging
and Electrophysiological Analyses.” In Neurotrophic Factors, edited by
Stephen D. Skaper, 1727:201–15. Springer, 2018. https://doi.org/10.1007/978-1-4939-7571-6_15.
ieee: D. Dimitrov, L. Guillaud, K. Eguchi, and T. Takahashi, “Culture of mouse giant
central nervous system synapses and application for imaging and electrophysiological
analyses,” in Neurotrophic Factors, vol. 1727, S. D. Skaper, Ed. Springer,
2018, pp. 201–215.
ista: 'Dimitrov D, Guillaud L, Eguchi K, Takahashi T. 2018.Culture of mouse giant
central nervous system synapses and application for imaging and electrophysiological
analyses. In: Neurotrophic Factors. Methods in Molecular Biology, vol. 1727, 201–215.'
mla: Dimitrov, Dimitar, et al. “Culture of Mouse Giant Central Nervous System Synapses
and Application for Imaging and Electrophysiological Analyses.” Neurotrophic
Factors, edited by Stephen D. Skaper, vol. 1727, Springer, 2018, pp. 201–15,
doi:10.1007/978-1-4939-7571-6_15.
short: D. Dimitrov, L. Guillaud, K. Eguchi, T. Takahashi, in:, S.D. Skaper (Ed.),
Neurotrophic Factors, Springer, 2018, pp. 201–215.
date_created: 2018-12-11T11:47:11Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2021-01-12T08:03:05Z
day: '01'
ddc:
- '570'
department:
- _id: RySh
doi: 10.1007/978-1-4939-7571-6_15
editor:
- first_name: Stephen D.
full_name: Skaper, Stephen D.
last_name: Skaper
external_id:
pmid:
- '29222783'
file:
- access_level: open_access
checksum: 8aa174ca65a56fbb19e9f88cff3ac3fd
content_type: application/pdf
creator: dernst
date_created: 2019-11-19T07:47:43Z
date_updated: 2020-07-14T12:47:09Z
file_id: '7046'
file_name: 2018_NeurotrophicFactors_Dimitrov.pdf
file_size: 787407
relation: main_file
file_date_updated: 2020-07-14T12:47:09Z
has_accepted_license: '1'
intvolume: ' 1727'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 201 - 215
pmid: 1
publication: Neurotrophic Factors
publication_status: published
publisher: Springer
publist_id: '7252'
quality_controlled: '1'
scopus_import: 1
status: public
title: Culture of mouse giant central nervous system synapses and application for
imaging and electrophysiological analyses
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1727
year: '2018'
...
---
_id: '59'
abstract:
- lang: eng
text: Graph-based games are an important tool in computer science. They have applications
in synthesis, verification, refinement, and far beyond. We review graphbased games
with objectives on infinite plays. We give definitions and algorithms to solve
the games and to give a winning strategy. The objectives we consider are mostly
Boolean, but we also look at quantitative graph-based games and their objectives.
Synthesis aims to turn temporal logic specifications into correct reactive systems.
We explain the reduction of synthesis to graph-based games (or equivalently tree
automata) using synthesis of LTL specifications as an example. We treat the classical
approach that uses determinization of parity automata and more modern approaches.
author:
- first_name: Roderick
full_name: Bloem, Roderick
last_name: Bloem
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Barbara
full_name: Jobstmann, Barbara
last_name: Jobstmann
citation:
ama: 'Bloem R, Chatterjee K, Jobstmann B. Graph games and reactive synthesis. In:
Henzinger TA, Clarke EM, Veith H, Bloem R, eds. Handbook of Model Checking.
1st ed. Springer; 2018:921-962. doi:10.1007/978-3-319-10575-8_27'
apa: Bloem, R., Chatterjee, K., & Jobstmann, B. (2018). Graph games and reactive
synthesis. In T. A. Henzinger, E. M. Clarke, H. Veith, & R. Bloem (Eds.),
Handbook of Model Checking (1st ed., pp. 921–962). Springer. https://doi.org/10.1007/978-3-319-10575-8_27
chicago: Bloem, Roderick, Krishnendu Chatterjee, and Barbara Jobstmann. “Graph Games
and Reactive Synthesis.” In Handbook of Model Checking, edited by Thomas
A Henzinger, Edmund M. Clarke, Helmut Veith, and Roderick Bloem, 1st ed., 921–62.
Springer, 2018. https://doi.org/10.1007/978-3-319-10575-8_27.
ieee: R. Bloem, K. Chatterjee, and B. Jobstmann, “Graph games and reactive synthesis,”
in Handbook of Model Checking, 1st ed., T. A. Henzinger, E. M. Clarke,
H. Veith, and R. Bloem, Eds. Springer, 2018, pp. 921–962.
ista: 'Bloem R, Chatterjee K, Jobstmann B. 2018.Graph games and reactive synthesis.
In: Handbook of Model Checking. , 921–962.'
mla: Bloem, Roderick, et al. “Graph Games and Reactive Synthesis.” Handbook of
Model Checking, edited by Thomas A Henzinger et al., 1st ed., Springer, 2018,
pp. 921–62, doi:10.1007/978-3-319-10575-8_27.
short: R. Bloem, K. Chatterjee, B. Jobstmann, in:, T.A. Henzinger, E.M. Clarke,
H. Veith, R. Bloem (Eds.), Handbook of Model Checking, 1st ed., Springer, 2018,
pp. 921–962.
date_created: 2018-12-11T11:44:24Z
date_published: 2018-05-19T00:00:00Z
date_updated: 2021-01-12T08:05:10Z
day: '19'
department:
- _id: KrCh
doi: 10.1007/978-3-319-10575-8_27
edition: '1'
editor:
- 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: Edmund M.
full_name: Clarke, Edmund M.
last_name: Clarke
- first_name: Helmut
full_name: Veith, Helmut
last_name: Veith
- first_name: Roderick
full_name: Bloem, Roderick
last_name: Bloem
language:
- iso: eng
month: '05'
oa_version: None
page: 921 - 962
publication: Handbook of Model Checking
publication_identifier:
isbn:
- 978-3-319-10574-1
publication_status: published
publisher: Springer
publist_id: '7995'
quality_controlled: '1'
scopus_import: 1
status: public
title: Graph games and reactive synthesis
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '60'
abstract:
- lang: eng
text: Model checking is a computer-assisted method for the analysis of dynamical
systems that can be modeled by state-transition systems. Drawing from research
traditions in mathematical logic, programming languages, hardware design, and
theoretical computer science, model checking is now widely used for the verification
of hardware and software in industry. This chapter is an introduction and short
survey of model checking. The chapter aims to motivate and link the individual
chapters of the handbook, and to provide context for readers who are not familiar
with model checking.
author:
- first_name: Edmund
full_name: Clarke, Edmund
last_name: Clarke
- 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: Helmut
full_name: Veith, Helmut
last_name: Veith
citation:
ama: 'Clarke E, Henzinger TA, Veith H. Introduction to model checking. In: Henzinger
TA, ed. Handbook of Model Checking. Handbook of Model Checking. Springer;
2018:1-26. doi:10.1007/978-3-319-10575-8_1'
apa: Clarke, E., Henzinger, T. A., & Veith, H. (2018). Introduction to model
checking. In T. A. Henzinger (Ed.), Handbook of Model Checking (pp. 1–26).
Springer. https://doi.org/10.1007/978-3-319-10575-8_1
chicago: Clarke, Edmund, Thomas A Henzinger, and Helmut Veith. “Introduction to
Model Checking.” In Handbook of Model Checking, edited by Thomas A Henzinger,
1–26. Handbook of Model Checking. Springer, 2018. https://doi.org/10.1007/978-3-319-10575-8_1.
ieee: E. Clarke, T. A. Henzinger, and H. Veith, “Introduction to model checking,”
in Handbook of Model Checking, T. A. Henzinger, Ed. Springer, 2018, pp.
1–26.
ista: 'Clarke E, Henzinger TA, Veith H. 2018.Introduction to model checking. In:
Handbook of Model Checking. , 1–26.'
mla: Clarke, Edmund, et al. “Introduction to Model Checking.” Handbook of Model
Checking, edited by Thomas A Henzinger, Springer, 2018, pp. 1–26, doi:10.1007/978-3-319-10575-8_1.
short: E. Clarke, T.A. Henzinger, H. Veith, in:, T.A. Henzinger (Ed.), Handbook
of Model Checking, Springer, 2018, pp. 1–26.
date_created: 2018-12-11T11:44:25Z
date_published: 2018-05-19T00:00:00Z
date_updated: 2021-01-12T08:05:35Z
day: '19'
department:
- _id: ToHe
doi: 10.1007/978-3-319-10575-8_1
editor:
- first_name: Thomas A
full_name: Henzinger, Thomas A
last_name: Henzinger
language:
- iso: eng
month: '05'
oa_version: None
page: 1 - 26
publication: Handbook of Model Checking
publication_status: published
publisher: Springer
publist_id: '7994'
quality_controlled: '1'
scopus_import: 1
series_title: Handbook of Model Checking
status: public
title: Introduction to model checking
type: book_chapter
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '61'
abstract:
- lang: eng
text: 'We prove that there is no strongly regular graph (SRG) with parameters (460;
153; 32; 60). The proof is based on a recent lower bound on the number of 4-cliques
in a SRG and some applications of Euclidean representation of SRGs. '
article_processing_charge: No
author:
- first_name: Andriy
full_name: Bondarenko, Andriy
last_name: Bondarenko
- first_name: Anton
full_name: Mellit, Anton
id: 388D3134-F248-11E8-B48F-1D18A9856A87
last_name: Mellit
- first_name: Andriy
full_name: Prymak, Andriy
last_name: Prymak
- first_name: Danylo
full_name: Radchenko, Danylo
last_name: Radchenko
- first_name: Maryna
full_name: Viazovska, Maryna
last_name: Viazovska
citation:
ama: 'Bondarenko A, Mellit A, Prymak A, Radchenko D, Viazovska M. There is no strongly
regular graph with parameters (460; 153; 32; 60). In: Contemporary Computational
Mathematics. Springer; 2018:131-134. doi:10.1007/978-3-319-72456-0_7'
apa: Bondarenko, A., Mellit, A., Prymak, A., Radchenko, D., & Viazovska, M.
(2018). There is no strongly regular graph with parameters (460; 153; 32; 60).
In Contemporary Computational Mathematics (pp. 131–134). Springer. https://doi.org/10.1007/978-3-319-72456-0_7
chicago: Bondarenko, Andriy, Anton Mellit, Andriy Prymak, Danylo Radchenko, and
Maryna Viazovska. “There Is No Strongly Regular Graph with Parameters (460; 153;
32; 60).” In Contemporary Computational Mathematics, 131–34. Springer,
2018. https://doi.org/10.1007/978-3-319-72456-0_7.
ieee: A. Bondarenko, A. Mellit, A. Prymak, D. Radchenko, and M. Viazovska, “There
is no strongly regular graph with parameters (460; 153; 32; 60),” in Contemporary
Computational Mathematics, Springer, 2018, pp. 131–134.
ista: 'Bondarenko A, Mellit A, Prymak A, Radchenko D, Viazovska M. 2018.There is
no strongly regular graph with parameters (460; 153; 32; 60). In: Contemporary
Computational Mathematics. , 131–134.'
mla: Bondarenko, Andriy, et al. “There Is No Strongly Regular Graph with Parameters
(460; 153; 32; 60).” Contemporary Computational Mathematics, Springer,
2018, pp. 131–34, doi:10.1007/978-3-319-72456-0_7.
short: A. Bondarenko, A. Mellit, A. Prymak, D. Radchenko, M. Viazovska, in:, Contemporary
Computational Mathematics, Springer, 2018, pp. 131–134.
date_created: 2018-12-11T11:44:25Z
date_published: 2018-05-23T00:00:00Z
date_updated: 2021-01-12T08:06:06Z
day: '23'
department:
- _id: TaHa
doi: 10.1007/978-3-319-72456-0_7
extern: '1'
external_id:
arxiv:
- '1509.06286'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1509.06286
month: '05'
oa: 1
oa_version: Preprint
page: 131 - 134
publication: Contemporary Computational Mathematics
publication_status: published
publisher: Springer
publist_id: '7993'
quality_controlled: '1'
status: public
title: There is no strongly regular graph with parameters (460; 153; 32; 60)
type: book_chapter
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '6354'
abstract:
- lang: eng
text: Blood platelets are critical for hemostasis and thrombosis, but also play
diverse roles during immune responses. We have recently reported that platelets
migrate at sites of infection in vitro and in vivo. Importantly, platelets use
their ability to migrate to collect and bundle fibrin (ogen)-bound bacteria accomplishing
efficient intravascular bacterial trapping. Here, we describe a method that allows
analyzing platelet migration in vitro, focusing on their ability to collect bacteria
and trap bacteria under flow.
acknowledgement: ' FöFoLe project 947 (F.G.), the Friedrich-Baur-Stiftung project
41/16 (F.G.)'
article_number: e3018
author:
- first_name: Shuxia
full_name: Fan, Shuxia
last_name: Fan
- first_name: Michael
full_name: Lorenz, Michael
last_name: Lorenz
- first_name: Steffen
full_name: Massberg, Steffen
last_name: Massberg
- first_name: Florian R
full_name: Gärtner, Florian R
id: 397A88EE-F248-11E8-B48F-1D18A9856A87
last_name: Gärtner
orcid: 0000-0001-6120-3723
citation:
ama: Fan S, Lorenz M, Massberg S, Gärtner FR. Platelet migration and bacterial trapping
assay under flow. Bio-Protocol. 2018;8(18). doi:10.21769/bioprotoc.3018
apa: Fan, S., Lorenz, M., Massberg, S., & Gärtner, F. R. (2018). Platelet migration
and bacterial trapping assay under flow. Bio-Protocol. Bio-Protocol. https://doi.org/10.21769/bioprotoc.3018
chicago: Fan, Shuxia, Michael Lorenz, Steffen Massberg, and Florian R Gärtner. “Platelet
Migration and Bacterial Trapping Assay under Flow.” Bio-Protocol. Bio-Protocol,
2018. https://doi.org/10.21769/bioprotoc.3018.
ieee: S. Fan, M. Lorenz, S. Massberg, and F. R. Gärtner, “Platelet migration and
bacterial trapping assay under flow,” Bio-Protocol, vol. 8, no. 18. Bio-Protocol,
2018.
ista: Fan S, Lorenz M, Massberg S, Gärtner FR. 2018. Platelet migration and bacterial
trapping assay under flow. Bio-Protocol. 8(18), e3018.
mla: Fan, Shuxia, et al. “Platelet Migration and Bacterial Trapping Assay under
Flow.” Bio-Protocol, vol. 8, no. 18, e3018, Bio-Protocol, 2018, doi:10.21769/bioprotoc.3018.
short: S. Fan, M. Lorenz, S. Massberg, F.R. Gärtner, Bio-Protocol 8 (2018).
date_created: 2019-04-29T09:40:33Z
date_published: 2018-09-20T00:00:00Z
date_updated: 2021-01-12T08:07:12Z
day: '20'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.21769/bioprotoc.3018
ec_funded: 1
file:
- access_level: open_access
checksum: d4588377e789da7f360b553ae02c5119
content_type: application/pdf
creator: dernst
date_created: 2019-04-30T08:04:33Z
date_updated: 2020-07-14T12:47:28Z
file_id: '6360'
file_name: 2018_BioProtocol_Fan.pdf
file_size: 2928337
relation: main_file
file_date_updated: 2020-07-14T12:47:28Z
has_accepted_license: '1'
intvolume: ' 8'
issue: '18'
keyword:
- Platelets
- Cell migration
- Bacteria
- Shear flow
- Fibrinogen
- E. coli
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 260AA4E2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '747687'
name: Mechanical Adaptation of Lamellipodial Actin Networks in Migrating Cells
publication: Bio-Protocol
publication_identifier:
issn:
- 2331-8325
publication_status: published
publisher: Bio-Protocol
quality_controlled: '1'
status: public
title: Platelet migration and bacterial trapping assay under flow
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2018'
...
---
_id: '6459'
author:
- first_name: Barbara
full_name: Petritsch, Barbara
id: 406048EC-F248-11E8-B48F-1D18A9856A87
last_name: Petritsch
orcid: 0000-0003-2724-4614
citation:
ama: Petritsch B. Open Access at IST Austria 2009-2017. IST Austria; 2018.
doi:10.5281/zenodo.1410279
apa: 'Petritsch, B. (2018). Open Access at IST Austria 2009-2017. Presented
at the Open-Access-Tage, Graz, Austria: IST Austria. https://doi.org/10.5281/zenodo.1410279'
chicago: Petritsch, Barbara. Open Access at IST Austria 2009-2017. IST Austria,
2018. https://doi.org/10.5281/zenodo.1410279.
ieee: B. Petritsch, Open Access at IST Austria 2009-2017. IST Austria, 2018.
ista: Petritsch B. 2018. Open Access at IST Austria 2009-2017, IST Austria,p.
mla: Petritsch, Barbara. Open Access at IST Austria 2009-2017. IST Austria,
2018, doi:10.5281/zenodo.1410279.
short: B. Petritsch, Open Access at IST Austria 2009-2017, IST Austria, 2018.
conference:
end_date: 2018-09-26
location: Graz, Austria
name: Open-Access-Tage
start_date: 2018-09-24
date_created: 2019-05-16T07:27:14Z
date_published: 2018-09-24T00:00:00Z
date_updated: 2020-07-14T23:06:21Z
day: '24'
ddc:
- '020'
department:
- _id: E-Lib
doi: 10.5281/zenodo.1410279
file:
- access_level: open_access
checksum: 9063ab4d10ea93353c3a03bbf53fbcf1
content_type: application/pdf
creator: dernst
date_created: 2019-05-16T07:26:25Z
date_updated: 2020-07-14T12:47:30Z
file_id: '6460'
file_name: Poster_Beitrag_125_Petritsch.pdf
file_size: 1967778
relation: main_file
file_date_updated: 2020-07-14T12:47:30Z
has_accepted_license: '1'
keyword:
- Open Access
- Publication Analysis
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
publication_status: published
publisher: IST Austria
status: public
title: Open Access at IST Austria 2009-2017
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_poster
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '6525'
abstract:
- lang: eng
text: This chapter finds an agreement of equivariant indices of semi-classical homomorphisms
between pairwise mirror branes in the GL2 Higgs moduli space on a Riemann surface.
On one side of the agreement, components of the Lagrangian brane of U(1,1) Higgs
bundles, whose mirror was proposed by Hitchin to be certain even exterior powers
of the hyperholomorphic Dirac bundle on the SL2 Higgs moduli space, are present.
The agreement arises from a mysterious functional equation. This gives strong
computational evidence for Hitchin’s proposal.
author:
- first_name: Tamás
full_name: Hausel, Tamás
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
- first_name: Anton
full_name: Mellit, Anton
id: 388D3134-F248-11E8-B48F-1D18A9856A87
last_name: Mellit
- first_name: Du
full_name: Pei, Du
last_name: Pei
citation:
ama: 'Hausel T, Mellit A, Pei D. Mirror symmetry with branes by equivariant verlinde
formulas. In: Geometry and Physics: Volume I. Oxford University Press;
2018:189-218. doi:10.1093/oso/9780198802013.003.0009'
apa: 'Hausel, T., Mellit, A., & Pei, D. (2018). Mirror symmetry with branes
by equivariant verlinde formulas. In Geometry and Physics: Volume I (pp.
189–218). Oxford University Press. https://doi.org/10.1093/oso/9780198802013.003.0009'
chicago: 'Hausel, Tamás, Anton Mellit, and Du Pei. “Mirror Symmetry with Branes
by Equivariant Verlinde Formulas.” In Geometry and Physics: Volume I, 189–218.
Oxford University Press, 2018. https://doi.org/10.1093/oso/9780198802013.003.0009.'
ieee: 'T. Hausel, A. Mellit, and D. Pei, “Mirror symmetry with branes by equivariant
verlinde formulas,” in Geometry and Physics: Volume I, Oxford University
Press, 2018, pp. 189–218.'
ista: 'Hausel T, Mellit A, Pei D. 2018.Mirror symmetry with branes by equivariant
verlinde formulas. In: Geometry and Physics: Volume I. , 189–218.'
mla: 'Hausel, Tamás, et al. “Mirror Symmetry with Branes by Equivariant Verlinde
Formulas.” Geometry and Physics: Volume I, Oxford University Press, 2018,
pp. 189–218, doi:10.1093/oso/9780198802013.003.0009.'
short: 'T. Hausel, A. Mellit, D. Pei, in:, Geometry and Physics: Volume I, Oxford
University Press, 2018, pp. 189–218.'
date_created: 2019-06-06T12:42:01Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2021-01-12T08:07:52Z
day: '01'
department:
- _id: TaHa
doi: 10.1093/oso/9780198802013.003.0009
language:
- iso: eng
month: '01'
oa_version: None
page: 189-218
publication: 'Geometry and Physics: Volume I'
publication_identifier:
isbn:
- '9780198802013'
- '9780191840500'
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: 1
status: public
title: Mirror symmetry with branes by equivariant verlinde formulas
type: book_chapter
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '690'
abstract:
- lang: eng
text: We consider spectral properties and the edge universality of sparse random
matrices, the class of random matrices that includes the adjacency matrices of
the Erdős–Rényi graph model G(N, p). We prove a local law for the eigenvalue density
up to the spectral edges. Under a suitable condition on the sparsity, we also
prove that the rescaled extremal eigenvalues exhibit GOE Tracy–Widom fluctuations
if a deterministic shift of the spectral edge due to the sparsity is included.
For the adjacency matrix of the Erdős–Rényi graph this establishes the Tracy–Widom
fluctuations of the second largest eigenvalue when p is much larger than N−2/3
with a deterministic shift of order (Np)−1.
article_number: 543-616
author:
- first_name: Jii
full_name: Lee, Jii
last_name: Lee
- first_name: Kevin
full_name: Schnelli, Kevin
id: 434AD0AE-F248-11E8-B48F-1D18A9856A87
last_name: Schnelli
orcid: 0000-0003-0954-3231
citation:
ama: Lee J, Schnelli K. Local law and Tracy–Widom limit for sparse random matrices.
Probability Theory and Related Fields. 2018;171(1-2). doi:10.1007/s00440-017-0787-8
apa: Lee, J., & Schnelli, K. (2018). Local law and Tracy–Widom limit for sparse
random matrices. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-017-0787-8
chicago: Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse
Random Matrices.” Probability Theory and Related Fields. Springer, 2018.
https://doi.org/10.1007/s00440-017-0787-8.
ieee: J. Lee and K. Schnelli, “Local law and Tracy–Widom limit for sparse random
matrices,” Probability Theory and Related Fields, vol. 171, no. 1–2. Springer,
2018.
ista: Lee J, Schnelli K. 2018. Local law and Tracy–Widom limit for sparse random
matrices. Probability Theory and Related Fields. 171(1–2), 543–616.
mla: Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random
Matrices.” Probability Theory and Related Fields, vol. 171, no. 1–2, 543–616,
Springer, 2018, doi:10.1007/s00440-017-0787-8.
short: J. Lee, K. Schnelli, Probability Theory and Related Fields 171 (2018).
date_created: 2018-12-11T11:47:56Z
date_published: 2018-06-14T00:00:00Z
date_updated: 2021-01-12T08:09:33Z
day: '14'
department:
- _id: LaEr
doi: 10.1007/s00440-017-0787-8
ec_funded: 1
external_id:
arxiv:
- '1605.08767'
intvolume: ' 171'
issue: 1-2
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1605.08767
month: '06'
oa: 1
oa_version: Preprint
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Probability Theory and Related Fields
publication_status: published
publisher: Springer
publist_id: '7017'
quality_controlled: '1'
scopus_import: 1
status: public
title: Local law and Tracy–Widom limit for sparse random matrices
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 171
year: '2018'
...
---
_id: '703'
abstract:
- lang: eng
text: We consider the NP-hard problem of MAP-inference for undirected discrete graphical
models. We propose a polynomial time and practically efficient algorithm for finding
a part of its optimal solution. Specifically, our algorithm marks some labels
of the considered graphical model either as (i) optimal, meaning that they belong
to all optimal solutions of the inference problem; (ii) non-optimal if they provably
do not belong to any solution. With access to an exact solver of a linear programming
relaxation to the MAP-inference problem, our algorithm marks the maximal possible
(in a specified sense) number of labels. We also present a version of the algorithm,
which has access to a suboptimal dual solver only and still can ensure the (non-)optimality
for the marked labels, although the overall number of the marked labels may decrease.
We propose an efficient implementation, which runs in time comparable to a single
run of a suboptimal dual solver. Our method is well-scalable and shows state-of-the-art
results on computational benchmarks from machine learning and computer vision.
author:
- first_name: Alexander
full_name: Shekhovtsov, Alexander
last_name: Shekhovtsov
- first_name: Paul
full_name: Swoboda, Paul
id: 446560C6-F248-11E8-B48F-1D18A9856A87
last_name: Swoboda
- first_name: Bogdan
full_name: Savchynskyy, Bogdan
last_name: Savchynskyy
citation:
ama: Shekhovtsov A, Swoboda P, Savchynskyy B. Maximum persistency via iterative
relaxed inference with graphical models. IEEE Transactions on Pattern Analysis
and Machine Intelligence. 2018;40(7):1668-1682. doi:10.1109/TPAMI.2017.2730884
apa: Shekhovtsov, A., Swoboda, P., & Savchynskyy, B. (2018). Maximum persistency
via iterative relaxed inference with graphical models. IEEE Transactions on
Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2017.2730884
chicago: Shekhovtsov, Alexander, Paul Swoboda, and Bogdan Savchynskyy. “Maximum
Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions
on Pattern Analysis and Machine Intelligence. IEEE, 2018. https://doi.org/10.1109/TPAMI.2017.2730884.
ieee: A. Shekhovtsov, P. Swoboda, and B. Savchynskyy, “Maximum persistency via iterative
relaxed inference with graphical models,” IEEE Transactions on Pattern Analysis
and Machine Intelligence, vol. 40, no. 7. IEEE, pp. 1668–1682, 2018.
ista: Shekhovtsov A, Swoboda P, Savchynskyy B. 2018. Maximum persistency via iterative
relaxed inference with graphical models. IEEE Transactions on Pattern Analysis
and Machine Intelligence. 40(7), 1668–1682.
mla: Shekhovtsov, Alexander, et al. “Maximum Persistency via Iterative Relaxed Inference
with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence,
vol. 40, no. 7, IEEE, 2018, pp. 1668–82, doi:10.1109/TPAMI.2017.2730884.
short: A. Shekhovtsov, P. Swoboda, B. Savchynskyy, IEEE Transactions on Pattern
Analysis and Machine Intelligence 40 (2018) 1668–1682.
date_created: 2018-12-11T11:48:01Z
date_published: 2018-07-01T00:00:00Z
date_updated: 2021-01-12T08:11:32Z
day: '01'
department:
- _id: VlKo
doi: 10.1109/TPAMI.2017.2730884
external_id:
arxiv:
- '1508.07902'
intvolume: ' 40'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1508.07902
month: '07'
oa: 1
oa_version: Preprint
page: 1668-1682
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_identifier:
issn:
- '01628828'
publication_status: published
publisher: IEEE
publist_id: '6992'
quality_controlled: '1'
scopus_import: 1
status: public
title: Maximum persistency via iterative relaxed inference with graphical models
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 40
year: '2018'
...
---
_id: '7116'
abstract:
- lang: eng
text: 'Training deep learning models has received tremendous research interest recently.
In particular, there has been intensive research on reducing the communication
cost of training when using multiple computational devices, through reducing the
precision of the underlying data representation. Naturally, such methods induce
system trade-offs—lowering communication precision could de-crease communication
overheads and improve scalability; but, on the other hand, it can also reduce
the accuracy of training. In this paper, we study this trade-off space, and ask:Can
low-precision communication consistently improve the end-to-end performance of
training modern neural networks, with no accuracy loss?From the performance point
of view, the answer to this question may appear deceptively easy: compressing
communication through low precision should help when the ratio between communication
and computation is high. However, this answer is less straightforward when we
try to generalize this principle across various neural network architectures (e.g.,
AlexNet vs. ResNet),number of GPUs (e.g., 2 vs. 8 GPUs), machine configurations(e.g.,
EC2 instances vs. NVIDIA DGX-1), communication primitives (e.g., MPI vs. NCCL),
and even different GPU architectures(e.g., Kepler vs. Pascal). Currently, it is
not clear how a realistic realization of all these factors maps to the speed up
provided by low-precision communication. In this paper, we conduct an empirical
study to answer this question and report the insights.'
article_processing_charge: No
author:
- first_name: Demjan
full_name: Grubic, Demjan
last_name: Grubic
- first_name: Leo
full_name: Tam, Leo
last_name: Tam
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Ce
full_name: Zhang, Ce
last_name: Zhang
citation:
ama: 'Grubic D, Tam L, Alistarh D-A, Zhang C. Synchronous multi-GPU training for
deep learning with low-precision communications: An empirical study. In: Proceedings
of the 21st International Conference on Extending Database Technology. OpenProceedings;
2018:145-156. doi:10.5441/002/EDBT.2018.14'
apa: 'Grubic, D., Tam, L., Alistarh, D.-A., & Zhang, C. (2018). Synchronous
multi-GPU training for deep learning with low-precision communications: An empirical
study. In Proceedings of the 21st International Conference on Extending Database
Technology (pp. 145–156). Vienna, Austria: OpenProceedings. https://doi.org/10.5441/002/EDBT.2018.14'
chicago: 'Grubic, Demjan, Leo Tam, Dan-Adrian Alistarh, and Ce Zhang. “Synchronous
Multi-GPU Training for Deep Learning with Low-Precision Communications: An Empirical
Study.” In Proceedings of the 21st International Conference on Extending Database
Technology, 145–56. OpenProceedings, 2018. https://doi.org/10.5441/002/EDBT.2018.14.'
ieee: 'D. Grubic, L. Tam, D.-A. Alistarh, and C. Zhang, “Synchronous multi-GPU training
for deep learning with low-precision communications: An empirical study,” in Proceedings
of the 21st International Conference on Extending Database Technology, Vienna,
Austria, 2018, pp. 145–156.'
ista: 'Grubic D, Tam L, Alistarh D-A, Zhang C. 2018. Synchronous multi-GPU training
for deep learning with low-precision communications: An empirical study. Proceedings
of the 21st International Conference on Extending Database Technology. EDBT: Conference
on Extending Database Technology, 145–156.'
mla: 'Grubic, Demjan, et al. “Synchronous Multi-GPU Training for Deep Learning with
Low-Precision Communications: An Empirical Study.” Proceedings of the 21st
International Conference on Extending Database Technology, OpenProceedings,
2018, pp. 145–56, doi:10.5441/002/EDBT.2018.14.'
short: D. Grubic, L. Tam, D.-A. Alistarh, C. Zhang, in:, Proceedings of the 21st
International Conference on Extending Database Technology, OpenProceedings, 2018,
pp. 145–156.
conference:
end_date: 2018-03-29
location: Vienna, Austria
name: 'EDBT: Conference on Extending Database Technology'
start_date: 2018-03-26
date_created: 2019-11-26T14:19:11Z
date_published: 2018-03-26T00:00:00Z
date_updated: 2023-02-23T12:59:17Z
day: '26'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.5441/002/EDBT.2018.14
file:
- access_level: open_access
checksum: ec979b56abc71016d6e6adfdadbb4afe
content_type: application/pdf
creator: dernst
date_created: 2019-11-26T14:23:04Z
date_updated: 2020-07-14T12:47:49Z
file_id: '7118'
file_name: 2018_OpenProceedings_Grubic.pdf
file_size: 1603204
relation: main_file
file_date_updated: 2020-07-14T12:47:49Z
has_accepted_license: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 145-156
publication: Proceedings of the 21st International Conference on Extending Database
Technology
publication_identifier:
isbn:
- '9783893180783'
issn:
- 2367-2005
publication_status: published
publisher: OpenProceedings
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Synchronous multi-GPU training for deep learning with low-precision communications:
An empirical study'
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: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '7407'
abstract:
- lang: eng
text: 'Proofs of space (PoS) [Dziembowski et al., CRYPTO''15] are proof systems
where a prover can convince a verifier that he "wastes" disk space. PoS were introduced
as a more ecological and economical replacement for proofs of work which are currently
used to secure blockchains like Bitcoin. In this work we investigate extensions
of PoS which allow the prover to embed useful data into the dedicated space, which
later can be recovered. Our first contribution is a security proof for the original
PoS from CRYPTO''15 in the random oracle model (the original proof only applied
to a restricted class of adversaries which can store a subset of the data an honest
prover would store). When this PoS is instantiated with recent constructions of
maximally depth robust graphs, our proof implies basically optimal security. As
a second contribution we show three different extensions of this PoS where useful
data can be embedded into the space required by the prover. Our security proof
for the PoS extends (non-trivially) to these constructions. We discuss how some
of these variants can be used as proofs of catalytic space (PoCS), a notion we
put forward in this work, and which basically is a PoS where most of the space
required by the prover can be used to backup useful data. Finally we discuss how
one of the extensions is a candidate construction for a proof of replication (PoR),
a proof system recently suggested in the Filecoin whitepaper. '
alternative_title:
- LIPIcs
article_processing_charge: No
author:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Pietrzak KZ. Proofs of catalytic space. In: 10th Innovations in Theoretical
Computer Science Conference (ITCS 2019). Vol 124. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2018:59:1-59:25. doi:10.4230/LIPICS.ITCS.2019.59'
apa: 'Pietrzak, K. Z. (2018). Proofs of catalytic space. In 10th Innovations
in Theoretical Computer Science Conference (ITCS 2019) (Vol. 124, p. 59:1-59:25).
San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPICS.ITCS.2019.59'
chicago: Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” In 10th Innovations
in Theoretical Computer Science Conference (ITCS 2019), 124:59:1-59:25. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.ITCS.2019.59.
ieee: K. Z. Pietrzak, “Proofs of catalytic space,” in 10th Innovations in Theoretical
Computer Science Conference (ITCS 2019), San Diego, CA, United States, 2018,
vol. 124, p. 59:1-59:25.
ista: 'Pietrzak KZ. 2018. Proofs of catalytic space. 10th Innovations in Theoretical
Computer Science Conference (ITCS 2019). ITCS: Innovations in theoretical Computer
Science Conference, LIPIcs, vol. 124, 59:1-59:25.'
mla: Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” 10th Innovations in
Theoretical Computer Science Conference (ITCS 2019), vol. 124, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25, doi:10.4230/LIPICS.ITCS.2019.59.
short: K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference
(ITCS 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25.
conference:
end_date: 2019-01-12
location: San Diego, CA, United States
name: 'ITCS: Innovations in theoretical Computer Science Conference'
start_date: 2019-01-10
date_created: 2020-01-30T09:16:05Z
date_published: 2018-12-31T00:00:00Z
date_updated: 2021-01-12T08:13:26Z
day: '31'
ddc:
- '000'
department:
- _id: KrPi
doi: 10.4230/LIPICS.ITCS.2019.59
ec_funded: 1
file:
- access_level: open_access
checksum: 5cebb7f7849a3beda898f697d755dd96
content_type: application/pdf
creator: dernst
date_created: 2020-02-04T08:17:52Z
date_updated: 2020-07-14T12:47:57Z
file_id: '7443'
file_name: 2018_LIPIcs_Pietrzak.pdf
file_size: 822884
relation: main_file
file_date_updated: 2020-07-14T12:47:57Z
has_accepted_license: '1'
intvolume: ' 124'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2018/194
month: '12'
oa: 1
oa_version: Published Version
page: 59:1-59:25
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: 10th Innovations in Theoretical Computer Science Conference (ITCS 2019)
publication_identifier:
isbn:
- 978-3-95977-095-8
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: 1
status: public
title: Proofs of catalytic space
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: 124
year: '2018'
...
---
_id: '6001'
abstract:
- lang: eng
text: "The concurrent memory reclamation problem is that of devising a way for a
deallocating thread to verify that no other concurrent threads hold references
to a memory block being deallocated. To date, in the absence of automatic garbage
collection, there is no satisfactory solution to this problem; existing tracking
methods like hazard pointers, reference counters, or epoch-based techniques like
RCU are either prohibitively expensive or require significant programming expertise
to the extent that implementing them efficiently can be worthy of a publication.
None of the existing techniques are automatic or even semi-automated.\r\nIn this
article, we take a new approach to concurrent memory reclamation. Instead of manually
tracking access to memory locations as done in techniques like hazard pointers,
or restricting shared accesses to specific epoch boundaries as in RCU, our algorithm,
called ThreadScan, leverages operating system signaling to automatically detect
which memory locations are being accessed by concurrent threads.\r\nInitial empirical
evidence shows that ThreadScan scales surprisingly well and requires negligible
programming effort beyond the standard use of Malloc and Free."
article_number: '18'
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: William
full_name: Leiserson, William
last_name: Leiserson
- first_name: Alexander
full_name: Matveev, Alexander
last_name: Matveev
- first_name: Nir
full_name: Shavit, Nir
last_name: Shavit
citation:
ama: 'Alistarh D-A, Leiserson W, Matveev A, Shavit N. ThreadScan: Automatic and
scalable memory reclamation. ACM Transactions on Parallel Computing. 2018;4(4).
doi:10.1145/3201897'
apa: 'Alistarh, D.-A., Leiserson, W., Matveev, A., & Shavit, N. (2018). ThreadScan:
Automatic and scalable memory reclamation. ACM Transactions on Parallel Computing.
Association for Computing Machinery. https://doi.org/10.1145/3201897'
chicago: 'Alistarh, Dan-Adrian, William Leiserson, Alexander Matveev, and Nir Shavit.
“ThreadScan: Automatic and Scalable Memory Reclamation.” ACM Transactions on
Parallel Computing. Association for Computing Machinery, 2018. https://doi.org/10.1145/3201897.'
ieee: 'D.-A. Alistarh, W. Leiserson, A. Matveev, and N. Shavit, “ThreadScan: Automatic
and scalable memory reclamation,” ACM Transactions on Parallel Computing,
vol. 4, no. 4. Association for Computing Machinery, 2018.'
ista: 'Alistarh D-A, Leiserson W, Matveev A, Shavit N. 2018. ThreadScan: Automatic
and scalable memory reclamation. ACM Transactions on Parallel Computing. 4(4),
18.'
mla: 'Alistarh, Dan-Adrian, et al. “ThreadScan: Automatic and Scalable Memory Reclamation.”
ACM Transactions on Parallel Computing, vol. 4, no. 4, 18, Association
for Computing Machinery, 2018, doi:10.1145/3201897.'
short: D.-A. Alistarh, W. Leiserson, A. Matveev, N. Shavit, ACM Transactions on
Parallel Computing 4 (2018).
date_created: 2019-02-14T13:24:11Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2023-02-23T13:17:54Z
day: '01'
department:
- _id: DaAl
doi: 10.1145/3201897
intvolume: ' 4'
issue: '4'
language:
- iso: eng
month: '09'
oa_version: None
publication: ACM Transactions on Parallel Computing
publication_identifier:
issn:
- 2329-4949
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '779'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: 'ThreadScan: Automatic and scalable memory reclamation'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2018'
...
---
_id: '7812'
abstract:
- lang: eng
text: Deep neural networks (DNNs) continue to make significant advances, solving
tasks from image classification to translation or reinforcement learning. One
aspect of the field receiving considerable attention is efficiently executing
deep models in resource-constrained environments, such as mobile or embedded devices.
This paper focuses on this problem, and proposes two new compression methods,
which jointly leverage weight quantization and distillation of larger teacher
networks into smaller student networks. The first method we propose is called
quantized distillation and leverages distillation during the training process,
by incorporating distillation loss, expressed with respect to the teacher, into
the training of a student network whose weights are quantized to a limited set
of levels. The second method, differentiable quantization, optimizes the location
of quantization points through stochastic gradient descent, to better fit the
behavior of the teacher model. We validate both methods through experiments on
convolutional and recurrent architectures. We show that quantized shallow students
can reach similar accuracy levels to full-precision teacher models, while providing
order of magnitude compression, and inference speedup that is linear in the depth
reduction. In sum, our results enable DNNs for resource-constrained environments
to leverage architecture and accuracy advances developed on more powerful devices.
article_processing_charge: No
author:
- first_name: Antonio
full_name: Polino, Antonio
last_name: Polino
- first_name: Razvan
full_name: Pascanu, Razvan
last_name: Pascanu
- 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: 'Polino A, Pascanu R, Alistarh D-A. Model compression via distillation and
quantization. In: 6th International Conference on Learning Representations.
; 2018.'
apa: Polino, A., Pascanu, R., & Alistarh, D.-A. (2018). Model compression via
distillation and quantization. In 6th International Conference on Learning
Representations. Vancouver, Canada.
chicago: Polino, Antonio, Razvan Pascanu, and Dan-Adrian Alistarh. “Model Compression
via Distillation and Quantization.” In 6th International Conference on Learning
Representations, 2018.
ieee: A. Polino, R. Pascanu, and D.-A. Alistarh, “Model compression via distillation
and quantization,” in 6th International Conference on Learning Representations,
Vancouver, Canada, 2018.
ista: 'Polino A, Pascanu R, Alistarh D-A. 2018. Model compression via distillation
and quantization. 6th International Conference on Learning Representations. ICLR:
International Conference on Learning Representations.'
mla: Polino, Antonio, et al. “Model Compression via Distillation and Quantization.”
6th International Conference on Learning Representations, 2018.
short: A. Polino, R. Pascanu, D.-A. Alistarh, in:, 6th International Conference
on Learning Representations, 2018.
conference:
end_date: 2018-05-03
location: Vancouver, Canada
name: 'ICLR: International Conference on Learning Representations'
start_date: 2018-04-30
date_created: 2020-05-10T22:00:51Z
date_published: 2018-05-01T00:00:00Z
date_updated: 2023-02-23T13:18:41Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
external_id:
arxiv:
- '1802.05668'
file:
- access_level: open_access
checksum: a4336c167978e81891970e4e4517a8c3
content_type: application/pdf
creator: dernst
date_created: 2020-05-26T13:02:00Z
date_updated: 2020-07-14T12:48:03Z
file_id: '7894'
file_name: 2018_ICLR_Polino.pdf
file_size: 308339
relation: main_file
file_date_updated: 2020-07-14T12:48:03Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
publication: 6th International Conference on Learning Representations
publication_status: published
quality_controlled: '1'
scopus_import: 1
status: public
title: Model compression via distillation and quantization
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '8547'
abstract:
- lang: eng
text: The cerebral cortex contains multiple hierarchically organized areas with
distinctive cytoarchitectonical patterns, but the cellular mechanisms underlying
the emergence of this diversity remain unclear. Here, we have quantitatively investigated
the neuronal output of individual progenitor cells in the ventricular zone of
the developing mouse neocortex using a combination of methods that together circumvent
the biases and limitations of individual approaches. We found that individual
cortical progenitor cells show a high degree of stochasticity and generate pyramidal
cell lineages that adopt a wide range of laminar configurations. Mathematical
modelling these lineage data suggests that a small number of progenitor cell populations,
each generating pyramidal cells following different stochastic developmental programs,
suffice to generate the heterogenous complement of pyramidal cell lineages that
collectively build the complex cytoarchitecture of the neocortex.
acknowledgement: We thank I. Andrew and S.E. Bae for excellent technical assistance,
F. Gage for plasmids, and K. Nave (Nex-Cre) for mouse colonies. We thank members
of the Marín and Rico laboratories for stimulating discussions and ideas. Our research
on this topic is supported by grants from the European Research Council (ERC-2017-AdG
787355 to O.M and ERC2016-CoG 725780 to S.H.) and Wellcome Trust (103714MA) to O.M.
L.L. was the recipient of an EMBO long-term postdoctoral fellowship, R.B. received
support from FWF Lise-Meitner program (M 2416) and F.K.W. was supported by an EMBO
postdoctoral fellowship and is currently a Marie Skłodowska-Curie Fellow from the
European Commission under the H2020 Programme.
article_processing_charge: No
author:
- first_name: Alfredo
full_name: Llorca, Alfredo
last_name: Llorca
- first_name: Gabriele
full_name: Ciceri, Gabriele
last_name: Ciceri
- first_name: Robert J
full_name: Beattie, Robert J
id: 2E26DF60-F248-11E8-B48F-1D18A9856A87
last_name: Beattie
orcid: 0000-0002-8483-8753
- first_name: Fong K.
full_name: Wong, Fong K.
last_name: Wong
- first_name: Giovanni
full_name: Diana, Giovanni
last_name: Diana
- first_name: Eleni
full_name: Serafeimidou, Eleni
last_name: Serafeimidou
- first_name: Marian
full_name: Fernández-Otero, Marian
last_name: Fernández-Otero
- first_name: Carmen
full_name: Streicher, Carmen
id: 36BCB99C-F248-11E8-B48F-1D18A9856A87
last_name: Streicher
- first_name: Sebastian J.
full_name: Arnold, Sebastian J.
last_name: Arnold
- first_name: Martin
full_name: Meyer, Martin
last_name: Meyer
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: Miguel
full_name: Maravall, Miguel
last_name: Maravall
- first_name: Oscar
full_name: Marín, Oscar
last_name: Marín
citation:
ama: Llorca A, Ciceri G, Beattie RJ, et al. Heterogeneous progenitor cell behaviors
underlie the assembly of neocortical cytoarchitecture. bioRxiv. doi:10.1101/494088
apa: Llorca, A., Ciceri, G., Beattie, R. J., Wong, F. K., Diana, G., Serafeimidou,
E., … Marín, O. (n.d.). Heterogeneous progenitor cell behaviors underlie the assembly
of neocortical cytoarchitecture. bioRxiv. Cold Spring Harbor Laboratory.
https://doi.org/10.1101/494088
chicago: Llorca, Alfredo, Gabriele Ciceri, Robert J Beattie, Fong K. Wong, Giovanni
Diana, Eleni Serafeimidou, Marian Fernández-Otero, et al. “Heterogeneous Progenitor
Cell Behaviors Underlie the Assembly of Neocortical Cytoarchitecture.” BioRxiv.
Cold Spring Harbor Laboratory, n.d. https://doi.org/10.1101/494088.
ieee: A. Llorca et al., “Heterogeneous progenitor cell behaviors underlie
the assembly of neocortical cytoarchitecture,” bioRxiv. Cold Spring Harbor
Laboratory.
ista: Llorca A, Ciceri G, Beattie RJ, Wong FK, Diana G, Serafeimidou E, Fernández-Otero
M, Streicher C, Arnold SJ, Meyer M, Hippenmeyer S, Maravall M, Marín O. Heterogeneous
progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture.
bioRxiv, 10.1101/494088.
mla: Llorca, Alfredo, et al. “Heterogeneous Progenitor Cell Behaviors Underlie the
Assembly of Neocortical Cytoarchitecture.” BioRxiv, Cold Spring Harbor
Laboratory, doi:10.1101/494088.
short: A. Llorca, G. Ciceri, R.J. Beattie, F.K. Wong, G. Diana, E. Serafeimidou,
M. Fernández-Otero, C. Streicher, S.J. Arnold, M. Meyer, S. Hippenmeyer, M. Maravall,
O. Marín, BioRxiv (n.d.).
date_created: 2020-09-21T12:01:50Z
date_published: 2018-12-13T00:00:00Z
date_updated: 2021-01-12T08:20:00Z
day: '13'
department:
- _id: SiHi
doi: 10.1101/494088
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/494088
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 260018B0-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '725780'
name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development
- _id: 264E56E2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02416
name: Molecular Mechanisms Regulating Gliogenesis in the Cerebral Cortex
publication: bioRxiv
publication_status: submitted
publisher: Cold Spring Harbor Laboratory
status: public
title: Heterogeneous progenitor cell behaviors underlie the assembly of neocortical
cytoarchitecture
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '86'
abstract:
- lang: eng
text: Responsiveness—the requirement that every request to a system be eventually
handled—is one of the fundamental liveness properties of a reactive system. Average
response time is a quantitative measure for the responsiveness requirement used
commonly in performance evaluation. We show how average response time can be computed
on state-transition graphs, on Markov chains, and on game graphs. In all three
cases, we give polynomial-time algorithms.
acknowledgement: 'This research was supported in part by the Austrian Science Fund
(FWF) under grants S11402-N23, S11407-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein
Award), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund
(WWTF) through project ICT15-003 and by the National Science Centre (NCN), Poland
under grant 2014/15/D/ST6/04543.'
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: 'Chatterjee K, Henzinger TA, Otop J. Computing average response time. In: Lohstroh
M, Derler P, Sirjani M, eds. Principles of Modeling. Vol 10760. Springer;
2018:143-161. doi:10.1007/978-3-319-95246-8_9'
apa: Chatterjee, K., Henzinger, T. A., & Otop, J. (2018). Computing average
response time. In M. Lohstroh, P. Derler, & M. Sirjani (Eds.), Principles
of Modeling (Vol. 10760, pp. 143–161). Springer. https://doi.org/10.1007/978-3-319-95246-8_9
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Computing Average
Response Time.” In Principles of Modeling, edited by Marten Lohstroh, Patricia
Derler, and Marjan Sirjani, 10760:143–61. Springer, 2018. https://doi.org/10.1007/978-3-319-95246-8_9.
ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, “Computing average response time,”
in Principles of Modeling, vol. 10760, M. Lohstroh, P. Derler, and M. Sirjani,
Eds. Springer, 2018, pp. 143–161.
ista: 'Chatterjee K, Henzinger TA, Otop J. 2018.Computing average response time.
In: Principles of Modeling. LNCS, vol. 10760, 143–161.'
mla: Chatterjee, Krishnendu, et al. “Computing Average Response Time.” Principles
of Modeling, edited by Marten Lohstroh et al., vol. 10760, Springer, 2018,
pp. 143–61, doi:10.1007/978-3-319-95246-8_9.
short: K. Chatterjee, T.A. Henzinger, J. Otop, in:, M. Lohstroh, P. Derler, M. Sirjani
(Eds.), Principles of Modeling, Springer, 2018, pp. 143–161.
date_created: 2018-12-11T11:44:33Z
date_published: 2018-07-20T00:00:00Z
date_updated: 2021-01-12T08:20:14Z
day: '20'
ddc:
- '000'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-319-95246-8_9
ec_funded: 1
editor:
- first_name: Marten
full_name: Lohstroh, Marten
last_name: Lohstroh
- first_name: Patricia
full_name: Derler, Patricia
last_name: Derler
- first_name: Marjan
full_name: Sirjani, Marjan
last_name: Sirjani
file:
- access_level: open_access
checksum: 9995c6ce6957333baf616fc4f20be597
content_type: application/pdf
creator: dernst
date_created: 2019-11-19T08:22:18Z
date_updated: 2020-07-14T12:48:14Z
file_id: '7053'
file_name: 2018_PrinciplesModeling_Chatterjee.pdf
file_size: 516307
relation: main_file
file_date_updated: 2020-07-14T12:48:14Z
has_accepted_license: '1'
intvolume: ' 10760'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 143 - 161
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication: Principles of Modeling
publication_status: published
publisher: Springer
publist_id: '7968'
quality_controlled: '1'
scopus_import: 1
status: public
title: Computing average response time
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10760
year: '2018'
...
---
_id: '9229'
alternative_title:
- Molecular and cellular neuroscience
article_processing_charge: No
article_type: letter_note
author:
- first_name: Johann G
full_name: Danzl, Johann G
id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87
last_name: Danzl
orcid: 0000-0001-8559-3973
citation:
ama: Danzl JG. Diffraction-unlimited optical imaging for synaptic physiology. Opera
Medica et Physiologica. 2018;4(S1):11. doi:10.20388/omp2018.00s1.001
apa: Danzl, J. G. (2018). Diffraction-unlimited optical imaging for synaptic physiology.
Opera Medica et Physiologica. Lobachevsky State University of Nizhny Novgorod.
https://doi.org/10.20388/omp2018.00s1.001
chicago: Danzl, Johann G. “Diffraction-Unlimited Optical Imaging for Synaptic Physiology.”
Opera Medica et Physiologica. Lobachevsky State University of Nizhny Novgorod,
2018. https://doi.org/10.20388/omp2018.00s1.001.
ieee: J. G. Danzl, “Diffraction-unlimited optical imaging for synaptic physiology,”
Opera Medica et Physiologica, vol. 4, no. S1. Lobachevsky State University
of Nizhny Novgorod, p. 11, 2018.
ista: Danzl JG. 2018. Diffraction-unlimited optical imaging for synaptic physiology.
Opera Medica et Physiologica. 4(S1), 11.
mla: Danzl, Johann G. “Diffraction-Unlimited Optical Imaging for Synaptic Physiology.”
Opera Medica et Physiologica, vol. 4, no. S1, Lobachevsky State University
of Nizhny Novgorod, 2018, p. 11, doi:10.20388/omp2018.00s1.001.
short: J.G. Danzl, Opera Medica et Physiologica 4 (2018) 11.
date_created: 2021-03-07T23:01:25Z
date_published: 2018-06-30T00:00:00Z
date_updated: 2021-12-03T07:31:05Z
day: '30'
department:
- _id: JoDa
doi: 10.20388/omp2018.00s1.001
intvolume: ' 4'
issue: S1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://operamedphys.org/content/molecular-and-cellular-neuroscience
month: '06'
oa: 1
oa_version: Published Version
page: '11'
publication: Opera Medica et Physiologica
publication_identifier:
eissn:
- 2500-2295
issn:
- 2500-2287
publication_status: published
publisher: Lobachevsky State University of Nizhny Novgorod
quality_controlled: '1'
scopus_import: '1'
status: public
title: Diffraction-unlimited optical imaging for synaptic physiology
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 4
year: '2018'
...
---
_id: '6005'
abstract:
- lang: eng
text: Network games are widely used as a model for selfish resource-allocation problems.
In the classicalmodel, each player selects a path connecting her source and target
vertices. The cost of traversingan edge depends on theload; namely, number of
players that traverse it. Thus, it abstracts the factthat different users may
use a resource at different times and for different durations, which playsan important
role in determining the costs of the users in reality. For example, when transmittingpackets
in a communication network, routing traffic in a road network, or processing a
task in aproduction system, actual sharing and congestion of resources crucially
depends on time.In [13], we introducedtimed network games, which add a time component
to network games.Each vertexvin the network is associated with a cost function,
mapping the load onvto theprice that a player pays for staying invfor one time
unit with this load. Each edge in thenetwork is guarded by the time intervals
in which it can be traversed, which forces the players tospend time in the vertices.
In this work we significantly extend the way time can be referred toin timed network
games. In the model we study, the network is equipped withclocks, and, as intimed
automata, edges are guarded by constraints on the values of the clocks, and their
traversalmay involve a reset of some clocks. We argue that the stronger model
captures many realisticnetworks. The addition of clocks breaks the techniques
we developed in [13] and we developnew techniques in order to show that positive
results on classic network games carry over to thestronger timed setting.
alternative_title:
- LIPIcs
article_number: '23'
article_processing_charge: No
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Shibashis
full_name: Guha, Shibashis
last_name: Guha
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: 'Avni G, Guha S, Kupferman O. Timed network games with clocks. In: Vol 117.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.MFCS.2018.23'
apa: 'Avni, G., Guha, S., & Kupferman, O. (2018). Timed network games with clocks
(Vol. 117). Presented at the MFCS: Mathematical Foundations of Computer Science,
Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPICS.MFCS.2018.23'
chicago: Avni, Guy, Shibashis Guha, and Orna Kupferman. “Timed Network Games with
Clocks,” Vol. 117. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.MFCS.2018.23.
ieee: 'G. Avni, S. Guha, and O. Kupferman, “Timed network games with clocks,” presented
at the MFCS: Mathematical Foundations of Computer Science, Liverpool, United Kingdom,
2018, vol. 117.'
ista: 'Avni G, Guha S, Kupferman O. 2018. Timed network games with clocks. MFCS:
Mathematical Foundations of Computer Science, LIPIcs, vol. 117, 23.'
mla: Avni, Guy, et al. Timed Network Games with Clocks. Vol. 117, 23, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.MFCS.2018.23.
short: G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2018.
conference:
end_date: 2018-08-31
location: Liverpool, United Kingdom
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2018-08-27
date_created: 2019-02-14T14:12:09Z
date_published: 2018-08-01T00:00:00Z
date_updated: 2023-02-23T14:02:58Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPICS.MFCS.2018.23
file:
- access_level: open_access
checksum: 41ab2ae9b63f5eb49fa995250c0ba128
content_type: application/pdf
creator: dernst
date_created: 2019-02-14T14:22:04Z
date_updated: 2020-07-14T12:47:15Z
file_id: '6007'
file_name: 2018_LIPIcs_Avni.pdf
file_size: 542889
relation: main_file
file_date_updated: 2020-07-14T12:47:15Z
has_accepted_license: '1'
intvolume: ' 117'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
publication_identifier:
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '963'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Timed network games with clocks
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: 117
year: '2018'
...
---
_id: '315'
abstract:
- lang: eng
text: 'More than 100 years after Grigg’s influential analysis of species’ borders,
the causes of limits to species’ ranges still represent a puzzle that has never
been understood with clarity. The topic has become especially important recently
as many scientists have become interested in the potential for species’ ranges
to shift in response to climate change—and yet nearly all of those studies fail
to recognise or incorporate evolutionary genetics in a way that relates to theoretical
developments. I show that range margins can be understood based on just two measurable
parameters: (i) the fitness cost of dispersal—a measure of environmental heterogeneity—and
(ii) the strength of genetic drift, which reduces genetic diversity. Together,
these two parameters define an ‘expansion threshold’: adaptation fails when genetic
drift reduces genetic diversity below that required for adaptation to a heterogeneous
environment. When the key parameters drop below this expansion threshold locally,
a sharp range margin forms. When they drop below this threshold throughout the
species’ range, adaptation collapses everywhere, resulting in either extinction
or formation of a fragmented metapopulation. Because the effects of dispersal
differ fundamentally with dimension, the second parameter—the strength of genetic
drift—is qualitatively different compared to a linear habitat. In two-dimensional
habitats, genetic drift becomes effectively independent of selection. It decreases
with ‘neighbourhood size’—the number of individuals accessible by dispersal within
one generation. Moreover, in contrast to earlier predictions, which neglected
evolution of genetic variance and/or stochasticity in two dimensions, dispersal
into small marginal populations aids adaptation. This is because the reduction
of both genetic and demographic stochasticity has a stronger effect than the cost
of dispersal through increased maladaptation. The expansion threshold thus provides
a novel, theoretically justified, and testable prediction for formation of the
range margin and collapse of the species’ range.'
article_number: e2005372
author:
- first_name: Jitka
full_name: Polechova, Jitka
id: 3BBFB084-F248-11E8-B48F-1D18A9856A87
last_name: Polechova
orcid: 0000-0003-0951-3112
citation:
ama: Polechova J. Is the sky the limit? On the expansion threshold of a species’
range. PLoS Biology. 2018;16(6). doi:10.1371/journal.pbio.2005372
apa: Polechova, J. (2018). Is the sky the limit? On the expansion threshold of a
species’ range. PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.2005372
chicago: Polechova, Jitka. “Is the Sky the Limit? On the Expansion Threshold of
a Species’ Range.” PLoS Biology. Public Library of Science, 2018. https://doi.org/10.1371/journal.pbio.2005372.
ieee: J. Polechova, “Is the sky the limit? On the expansion threshold of a species’
range,” PLoS Biology, vol. 16, no. 6. Public Library of Science, 2018.
ista: Polechova J. 2018. Is the sky the limit? On the expansion threshold of a species’
range. PLoS Biology. 16(6), e2005372.
mla: Polechova, Jitka. “Is the Sky the Limit? On the Expansion Threshold of a Species’
Range.” PLoS Biology, vol. 16, no. 6, e2005372, Public Library of Science,
2018, doi:10.1371/journal.pbio.2005372.
short: J. Polechova, PLoS Biology 16 (2018).
date_created: 2018-12-11T11:45:46Z
date_published: 2018-06-15T00:00:00Z
date_updated: 2023-02-23T14:10:16Z
day: '15'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.1371/journal.pbio.2005372
file:
- access_level: open_access
checksum: 908c52751bba30c55ed36789e5e4c84d
content_type: application/pdf
creator: dernst
date_created: 2019-01-22T08:30:03Z
date_updated: 2020-07-14T12:46:01Z
file_id: '5870'
file_name: 2017_PLOS_Polechova.pdf
file_size: 6968201
relation: main_file
file_date_updated: 2020-07-14T12:46:01Z
has_accepted_license: '1'
intvolume: ' 16'
issue: '6'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: PLoS Biology
publication_identifier:
issn:
- '15449173'
publication_status: published
publisher: Public Library of Science
publist_id: '7550'
quality_controlled: '1'
related_material:
record:
- id: '9839'
relation: research_data
status: public
scopus_import: 1
status: public
title: Is the sky the limit? On the expansion threshold of a species’ range
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: 16
year: '2018'
...
---
_id: '9471'
abstract:
- lang: eng
text: The DEMETER (DME) DNA glycosylase catalyzes genome-wide DNA demethylation
and is required for endosperm genomic imprinting and embryo viability. Targets
of DME-mediated DNA demethylation reside in small, euchromatic, AT-rich transposons
and at the boundaries of large transposons, but how DME interacts with these diverse
chromatin states is unknown. The STRUCTURE SPECIFIC RECOGNITION PROTEIN 1 (SSRP1)
subunit of the chromatin remodeler FACT (facilitates chromatin transactions),
was previously shown to be involved in the DME-dependent regulation of genomic
imprinting in Arabidopsis endosperm. Therefore, to investigate the interaction
between DME and chromatin, we focused on the activity of the two FACT subunits,
SSRP1 and SUPPRESSOR of TY16 (SPT16), during reproduction in Arabidopsis. We found
that FACT colocalizes with nuclear DME in vivo, and that DME has two classes of
target sites, the first being euchromatic and accessible to DME, but the second,
representing over half of DME targets, requiring the action of FACT for DME-mediated
DNA demethylation genome-wide. Our results show that the FACT-dependent DME targets
are GC-rich heterochromatin domains with high nucleosome occupancy enriched with
H3K9me2 and H3K27me1. Further, we demonstrate that heterochromatin-associated
linker histone H1 specifically mediates the requirement for FACT at a subset of
DME-target loci. Overall, our results demonstrate that FACT is required for DME
targeting by facilitating its access to heterochromatin.
article_processing_charge: No
article_type: original
author:
- first_name: Jennifer M.
full_name: Frost, Jennifer M.
last_name: Frost
- first_name: M. Yvonne
full_name: Kim, M. Yvonne
last_name: Kim
- first_name: Guen Tae
full_name: Park, Guen Tae
last_name: Park
- first_name: Ping-Hung
full_name: Hsieh, Ping-Hung
last_name: Hsieh
- first_name: Miyuki
full_name: Nakamura, Miyuki
last_name: Nakamura
- first_name: Samuel J. H.
full_name: Lin, Samuel J. H.
last_name: Lin
- first_name: Hyunjin
full_name: Yoo, Hyunjin
last_name: Yoo
- first_name: Jaemyung
full_name: Choi, Jaemyung
last_name: Choi
- first_name: Yoko
full_name: Ikeda, Yoko
last_name: Ikeda
- first_name: Tetsu
full_name: Kinoshita, Tetsu
last_name: Kinoshita
- first_name: Yeonhee
full_name: Choi, Yeonhee
last_name: Choi
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
- first_name: Robert L.
full_name: Fischer, Robert L.
last_name: Fischer
citation:
ama: Frost JM, Kim MY, Park GT, et al. FACT complex is required for DNA demethylation
at heterochromatin during reproduction in Arabidopsis. Proceedings of the National
Academy of Sciences. 2018;115(20):E4720-E4729. doi:10.1073/pnas.1713333115
apa: Frost, J. M., Kim, M. Y., Park, G. T., Hsieh, P.-H., Nakamura, M., Lin, S.
J. H., … Fischer, R. L. (2018). FACT complex is required for DNA demethylation
at heterochromatin during reproduction in Arabidopsis. Proceedings of the National
Academy of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.1713333115
chicago: Frost, Jennifer M., M. Yvonne Kim, Guen Tae Park, Ping-Hung Hsieh, Miyuki
Nakamura, Samuel J. H. Lin, Hyunjin Yoo, et al. “FACT Complex Is Required for
DNA Demethylation at Heterochromatin during Reproduction in Arabidopsis.” Proceedings
of the National Academy of Sciences. National Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1713333115.
ieee: J. M. Frost et al., “FACT complex is required for DNA demethylation
at heterochromatin during reproduction in Arabidopsis,” Proceedings of the
National Academy of Sciences, vol. 115, no. 20. National Academy of Sciences,
pp. E4720–E4729, 2018.
ista: Frost JM, Kim MY, Park GT, Hsieh P-H, Nakamura M, Lin SJH, Yoo H, Choi J,
Ikeda Y, Kinoshita T, Choi Y, Zilberman D, Fischer RL. 2018. FACT complex is required
for DNA demethylation at heterochromatin during reproduction in Arabidopsis. Proceedings
of the National Academy of Sciences. 115(20), E4720–E4729.
mla: Frost, Jennifer M., et al. “FACT Complex Is Required for DNA Demethylation
at Heterochromatin during Reproduction in Arabidopsis.” Proceedings of the
National Academy of Sciences, vol. 115, no. 20, National Academy of Sciences,
2018, pp. E4720–29, doi:10.1073/pnas.1713333115.
short: J.M. Frost, M.Y. Kim, G.T. Park, P.-H. Hsieh, M. Nakamura, S.J.H. Lin, H.
Yoo, J. Choi, Y. Ikeda, T. Kinoshita, Y. Choi, D. Zilberman, R.L. Fischer, Proceedings
of the National Academy of Sciences 115 (2018) E4720–E4729.
date_created: 2021-06-07T06:11:28Z
date_published: 2018-05-15T00:00:00Z
date_updated: 2021-12-14T07:53:40Z
day: '15'
ddc:
- '580'
department:
- _id: DaZi
doi: 10.1073/pnas.1713333115
extern: '1'
external_id:
pmid:
- '29712855'
file:
- access_level: open_access
checksum: 810260dc0e3cc3033e15c19ad0dc123e
content_type: application/pdf
creator: asandaue
date_created: 2021-06-07T06:16:38Z
date_updated: 2021-06-07T06:16:38Z
file_id: '9472'
file_name: 2018_PNAS_Frost.pdf
file_size: 3045260
relation: main_file
success: 1
file_date_updated: 2021-06-07T06:16:38Z
has_accepted_license: '1'
intvolume: ' 115'
issue: '20'
keyword:
- Multidisciplinary
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: E4720-E4729
pmid: 1
publication: Proceedings of the National Academy of Sciences
publication_identifier:
eissn:
- 1091-6490
issn:
- 0027-8424
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
related_material:
link:
- relation: earlier_version
url: 'https://doi.org/10.1101/187674 '
scopus_import: '1'
status: public
title: FACT complex is required for DNA demethylation at heterochromatin during reproduction
in Arabidopsis
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 115
year: '2018'
...
---
_id: '186'
abstract:
- lang: eng
text: 'A drawing of a graph on a surface is independently even if every pair of
nonadjacent edges in the drawing crosses an even number of times. The ℤ2-genus
of a graph G is the minimum g such that G has an independently even drawing on
the orientable surface of genus g. An unpublished result by Robertson and Seymour
implies that for every t, every graph of sufficiently large genus contains as
a minor a projective t × t grid or one of the following so-called t-Kuratowski
graphs: K3, t, or t copies of K5 or K3,3 sharing at most 2 common vertices. We
show that the ℤ2-genus of graphs in these families is unbounded in t; in fact,
equal to their genus. Together, this implies that the genus of a graph is bounded
from above by a function of its ℤ2-genus, solving a problem posed by Schaefer
and Štefankovič, and giving an approximate version of the Hanani-Tutte theorem
on orientable surfaces.'
alternative_title:
- LIPIcs
article_processing_charge: No
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: Jan
full_name: Kynčl, Jan
last_name: Kynčl
citation:
ama: 'Fulek R, Kynčl J. The ℤ2-Genus of Kuratowski minors. In: Vol 99. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2018:40.1-40.14. doi:10.4230/LIPIcs.SoCG.2018.40'
apa: 'Fulek, R., & Kynčl, J. (2018). The ℤ2-Genus of Kuratowski minors (Vol.
99, p. 40.1-40.14). Presented at the SoCG: Symposium on Computational Geometry,
Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.40'
chicago: Fulek, Radoslav, and Jan Kynčl. “The ℤ2-Genus of Kuratowski Minors,” 99:40.1-40.14.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.40.
ieee: 'R. Fulek and J. Kynčl, “The ℤ2-Genus of Kuratowski minors,” presented at
the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99,
p. 40.1-40.14.'
ista: 'Fulek R, Kynčl J. 2018. The ℤ2-Genus of Kuratowski minors. SoCG: Symposium
on Computational Geometry, LIPIcs, vol. 99, 40.1-40.14.'
mla: Fulek, Radoslav, and Jan Kynčl. The ℤ2-Genus of Kuratowski Minors. Vol.
99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 40.1-40.14, doi:10.4230/LIPIcs.SoCG.2018.40.
short: R. Fulek, J. Kynčl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2018, p. 40.1-40.14.
conference:
end_date: 2018-06-14
location: Budapest, Hungary
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2018-06-11
date_created: 2018-12-11T11:45:05Z
date_published: 2018-06-11T00:00:00Z
date_updated: 2023-08-14T12:43:51Z
day: '11'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2018.40
external_id:
arxiv:
- '1803.05085'
intvolume: ' 99'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1803.05085
month: '06'
oa: 1
oa_version: Submitted Version
page: 40.1 - 40.14
project:
- _id: 261FA626-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02281
name: Eliminating intersections in drawings of graphs
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7734'
quality_controlled: '1'
related_material:
record:
- id: '11593'
relation: later_version
status: public
scopus_import: '1'
status: public
title: The ℤ2-Genus of Kuratowski minors
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 99
year: '2018'
...
---
_id: '433'
abstract:
- lang: eng
text: 'A thrackle is a graph drawn in the plane so that every pair of its edges
meet exactly once: either at a common end vertex or in a proper crossing. We prove
that any thrackle of n vertices has at most 1.3984n edges. Quasi-thrackles are
defined similarly, except that every pair of edges that do not share a vertex
are allowed to cross an odd number of times. It is also shown that the maximum
number of edges of a quasi-thrackle on n vertices is 3/2(n-1), and that this bound
is best possible for infinitely many values of n.'
alternative_title:
- LNCS
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: János
full_name: Pach, János
last_name: Pach
citation:
ama: 'Fulek R, Pach J. Thrackles: An improved upper bound. In: Vol 10692. Springer;
2018:160-166. doi:10.1007/978-3-319-73915-1_14'
apa: 'Fulek, R., & Pach, J. (2018). Thrackles: An improved upper bound (Vol.
10692, pp. 160–166). Presented at the GD 2017: Graph Drawing and Network Visualization,
Boston, MA, United States: Springer. https://doi.org/10.1007/978-3-319-73915-1_14'
chicago: 'Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound,”
10692:160–66. Springer, 2018. https://doi.org/10.1007/978-3-319-73915-1_14.'
ieee: 'R. Fulek and J. Pach, “Thrackles: An improved upper bound,” presented at
the GD 2017: Graph Drawing and Network Visualization, Boston, MA, United States,
2018, vol. 10692, pp. 160–166.'
ista: 'Fulek R, Pach J. 2018. Thrackles: An improved upper bound. GD 2017: Graph
Drawing and Network Visualization, LNCS, vol. 10692, 160–166.'
mla: 'Fulek, Radoslav, and János Pach. Thrackles: An Improved Upper Bound.
Vol. 10692, Springer, 2018, pp. 160–66, doi:10.1007/978-3-319-73915-1_14.'
short: R. Fulek, J. Pach, in:, Springer, 2018, pp. 160–166.
conference:
end_date: 2017-09-27
location: Boston, MA, United States
name: 'GD 2017: Graph Drawing and Network Visualization'
start_date: 201-09-25
date_created: 2018-12-11T11:46:27Z
date_published: 2018-01-21T00:00:00Z
date_updated: 2023-08-24T14:39:32Z
day: '21'
department:
- _id: UlWa
doi: 10.1007/978-3-319-73915-1_14
external_id:
arxiv:
- '1708.08037'
intvolume: ' 10692'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1708.08037
month: '01'
oa: 1
oa_version: Submitted Version
page: 160 - 166
publication_status: published
publisher: Springer
publist_id: '7390'
quality_controlled: '1'
related_material:
record:
- id: '5857'
relation: later_version
status: public
scopus_import: 1
status: public
title: 'Thrackles: An improved upper bound'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10692
year: '2018'
...
---
_id: '9837'
abstract:
- lang: eng
text: Both classical and recent studies suggest that chromosomal inversion polymorphisms
are important in adaptation and speciation. However, biases in discovery and reporting
of inversions make it difficult to assess their prevalence and biological importance.
Here, we use an approach based on linkage disequilibrium among markers genotyped
for samples collected across a transect between contrasting habitats to detect
chromosomal rearrangements de novo. We report 17 polymorphic rearrangements in
a single locality for the coastal marine snail, Littorina saxatilis. Patterns
of diversity in the field and of recombination in controlled crosses provide strong
evidence that at least the majority of these rearrangements are inversions. Most
show clinal changes in frequency between habitats, suggestive of divergent selection,
but only one appears to be fixed for different arrangements in the two habitats.
Consistent with widespread evidence for balancing selection on inversion polymorphisms,
we argue that a combination of heterosis and divergent selection can explain the
observed patterns and should be considered in other systems spanning environmental
gradients.
article_processing_charge: No
author:
- first_name: Rui
full_name: Faria, Rui
last_name: Faria
- first_name: Pragya
full_name: Chaube, Pragya
last_name: Chaube
- first_name: Hernán E.
full_name: Morales, Hernán E.
last_name: Morales
- first_name: Tomas
full_name: Larsson, Tomas
last_name: Larsson
- first_name: Alan R.
full_name: Lemmon, Alan R.
last_name: Lemmon
- first_name: Emily M.
full_name: Lemmon, Emily M.
last_name: Lemmon
- first_name: Marina
full_name: Rafajlović, Marina
last_name: Rafajlović
- first_name: Marina
full_name: Panova, Marina
last_name: Panova
- first_name: Mark
full_name: Ravinet, Mark
last_name: Ravinet
- first_name: Kerstin
full_name: Johannesson, Kerstin
last_name: Johannesson
- first_name: Anja M
full_name: Westram, Anja M
id: 3C147470-F248-11E8-B48F-1D18A9856A87
last_name: Westram
orcid: 0000-0003-1050-4969
- first_name: Roger K.
full_name: Butlin, Roger K.
last_name: Butlin
citation:
ama: 'Faria R, Chaube P, Morales HE, et al. Data from: Multiple chromosomal rearrangements
in a hybrid zone between Littorina saxatilis ecotypes. 2018. doi:10.5061/dryad.72cg113'
apa: 'Faria, R., Chaube, P., Morales, H. E., Larsson, T., Lemmon, A. R., Lemmon,
E. M., … Butlin, R. K. (2018). Data from: Multiple chromosomal rearrangements
in a hybrid zone between Littorina saxatilis ecotypes. Dryad. https://doi.org/10.5061/dryad.72cg113'
chicago: 'Faria, Rui, Pragya Chaube, Hernán E. Morales, Tomas Larsson, Alan R. Lemmon,
Emily M. Lemmon, Marina Rafajlović, et al. “Data from: Multiple Chromosomal Rearrangements
in a Hybrid Zone between Littorina Saxatilis Ecotypes.” Dryad, 2018. https://doi.org/10.5061/dryad.72cg113.'
ieee: 'R. Faria et al., “Data from: Multiple chromosomal rearrangements in
a hybrid zone between Littorina saxatilis ecotypes.” Dryad, 2018.'
ista: 'Faria R, Chaube P, Morales HE, Larsson T, Lemmon AR, Lemmon EM, Rafajlović
M, Panova M, Ravinet M, Johannesson K, Westram AM, Butlin RK. 2018. Data from:
Multiple chromosomal rearrangements in a hybrid zone between Littorina saxatilis
ecotypes, Dryad, 10.5061/dryad.72cg113.'
mla: 'Faria, Rui, et al. Data from: Multiple Chromosomal Rearrangements in a
Hybrid Zone between Littorina Saxatilis Ecotypes. Dryad, 2018, doi:10.5061/dryad.72cg113.'
short: R. Faria, P. Chaube, H.E. Morales, T. Larsson, A.R. Lemmon, E.M. Lemmon,
M. Rafajlović, M. Panova, M. Ravinet, K. Johannesson, A.M. Westram, R.K. Butlin,
(2018).
date_created: 2021-08-09T12:46:39Z
date_published: 2018-10-09T00:00:00Z
date_updated: 2023-08-24T14:50:26Z
day: '09'
department:
- _id: NiBa
doi: 10.5061/dryad.72cg113
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.72cg113
month: '10'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '6095'
relation: used_in_publication
status: public
status: public
title: 'Data from: Multiple chromosomal rearrangements in a hybrid zone between Littorina
saxatilis ecotypes'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2018'
...
---
_id: '10864'
abstract:
- lang: eng
text: We prove that every congruence distributive variety has directed Jónsson terms,
and every congruence modular variety has directed Gumm terms. The directed terms
we construct witness every case of absorption witnessed by the original Jónsson
or Gumm terms. This result is equivalent to a pair of claims about absorption
for admissible preorders in congruence distributive and congruence modular varieties,
respectively. For finite algebras, these absorption theorems have already seen
significant applications, but until now, it was not clear if the theorems hold
for general algebras as well. Our method also yields a novel proof of a result
by P. Lipparini about the existence of a chain of terms (which we call Pixley
terms) in varieties that are at the same time congruence distributive and k-permutable
for some k.
acknowledgement: The second author was supported by National Science Center grant
DEC-2011-/01/B/ST6/01006.
article_processing_charge: No
author:
- first_name: Alexandr
full_name: Kazda, Alexandr
id: 3B32BAA8-F248-11E8-B48F-1D18A9856A87
last_name: Kazda
- first_name: Marcin
full_name: Kozik, Marcin
last_name: Kozik
- first_name: Ralph
full_name: McKenzie, Ralph
last_name: McKenzie
- first_name: Matthew
full_name: Moore, Matthew
last_name: Moore
citation:
ama: 'Kazda A, Kozik M, McKenzie R, Moore M. Absorption and directed Jónsson terms.
In: Czelakowski J, ed. Don Pigozzi on Abstract Algebraic Logic, Universal Algebra,
and Computer Science. Vol 16. OCTR. Cham: Springer Nature; 2018:203-220. doi:10.1007/978-3-319-74772-9_7'
apa: 'Kazda, A., Kozik, M., McKenzie, R., & Moore, M. (2018). Absorption and
directed Jónsson terms. In J. Czelakowski (Ed.), Don Pigozzi on Abstract Algebraic
Logic, Universal Algebra, and Computer Science (Vol. 16, pp. 203–220). Cham:
Springer Nature. https://doi.org/10.1007/978-3-319-74772-9_7'
chicago: 'Kazda, Alexandr, Marcin Kozik, Ralph McKenzie, and Matthew Moore. “Absorption
and Directed Jónsson Terms.” In Don Pigozzi on Abstract Algebraic Logic, Universal
Algebra, and Computer Science, edited by J Czelakowski, 16:203–20. OCTR. Cham:
Springer Nature, 2018. https://doi.org/10.1007/978-3-319-74772-9_7.'
ieee: 'A. Kazda, M. Kozik, R. McKenzie, and M. Moore, “Absorption and directed Jónsson
terms,” in Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and
Computer Science, vol. 16, J. Czelakowski, Ed. Cham: Springer Nature, 2018,
pp. 203–220.'
ista: 'Kazda A, Kozik M, McKenzie R, Moore M. 2018.Absorption and directed Jónsson
terms. In: Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer
Science. vol. 16, 203–220.'
mla: Kazda, Alexandr, et al. “Absorption and Directed Jónsson Terms.” Don Pigozzi
on Abstract Algebraic Logic, Universal Algebra, and Computer Science, edited
by J Czelakowski, vol. 16, Springer Nature, 2018, pp. 203–20, doi:10.1007/978-3-319-74772-9_7.
short: A. Kazda, M. Kozik, R. McKenzie, M. Moore, in:, J. Czelakowski (Ed.), Don
Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science,
Springer Nature, Cham, 2018, pp. 203–220.
date_created: 2022-03-18T10:30:32Z
date_published: 2018-03-21T00:00:00Z
date_updated: 2023-09-05T15:37:18Z
day: '21'
department:
- _id: VlKo
doi: 10.1007/978-3-319-74772-9_7
editor:
- first_name: J
full_name: Czelakowski, J
last_name: Czelakowski
external_id:
arxiv:
- '1502.01072'
intvolume: ' 16'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1502.01072
month: '03'
oa: 1
oa_version: Preprint
page: 203-220
place: Cham
publication: Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer
Science
publication_identifier:
eisbn:
- '9783319747729'
eissn:
- 2211-2766
isbn:
- '9783319747712'
issn:
- 2211-2758
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: OCTR
status: public
title: Absorption and directed Jónsson terms
type: book_chapter
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 16
year: '2018'
...
---
_id: '184'
abstract:
- lang: eng
text: We prove that for every d ≥ 2, deciding if a pure, d-dimensional, simplicial
complex is shellable is NP-hard, hence NP-complete. This resolves a question raised,
e.g., by Danaraj and Klee in 1978. Our reduction also yields that for every d
≥ 2 and k ≥ 0, deciding if a pure, d-dimensional, simplicial complex is k-decomposable
is NP-hard. For d ≥ 3, both problems remain NP-hard when restricted to contractible
pure d-dimensional complexes.
acknowledgement: 'Partially supported by the project EMBEDS II (CZ: 7AMB17FR029, FR:
38087RM) of Czech-French collaboration.'
alternative_title:
- Leibniz International Proceedings in Information, LIPIcs
author:
- first_name: Xavier
full_name: Goaoc, Xavier
last_name: Goaoc
- first_name: Pavel
full_name: Paták, Pavel
last_name: Paták
- first_name: Zuzana
full_name: Patakova, Zuzana
id: 48B57058-F248-11E8-B48F-1D18A9856A87
last_name: Patakova
orcid: 0000-0002-3975-1683
- first_name: Martin
full_name: Tancer, Martin
id: 38AC689C-F248-11E8-B48F-1D18A9856A87
last_name: Tancer
orcid: 0000-0002-1191-6714
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Shellability is NP-complete.
In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:41:1-41:16.
doi:10.4230/LIPIcs.SoCG.2018.41'
apa: 'Goaoc, X., Paták, P., Patakova, Z., Tancer, M., & Wagner, U. (2018). Shellability
is NP-complete (Vol. 99, p. 41:1-41:16). Presented at the SoCG: Symposium on Computational
Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.SoCG.2018.41'
chicago: Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner.
“Shellability Is NP-Complete,” 99:41:1-41:16. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.41.
ieee: 'X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Shellability
is NP-complete,” presented at the SoCG: Symposium on Computational Geometry, Budapest,
Hungary, 2018, vol. 99, p. 41:1-41:16.'
ista: 'Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2018. Shellability is NP-complete.
SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in
Information, LIPIcs, vol. 99, 41:1-41:16.'
mla: Goaoc, Xavier, et al. Shellability Is NP-Complete. Vol. 99, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 41:1-41:16, doi:10.4230/LIPIcs.SoCG.2018.41.
short: X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2018, p. 41:1-41:16.
conference:
end_date: 2018-06-14
location: Budapest, Hungary
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2018-06-11
date_created: 2018-12-11T11:45:04Z
date_published: 2018-06-11T00:00:00Z
date_updated: 2023-09-06T11:10:57Z
day: '11'
ddc:
- '516'
- '000'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2018.41
file:
- access_level: open_access
checksum: d12bdd60f04a57307867704b5f930afd
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T16:35:02Z
date_updated: 2020-07-14T12:45:18Z
file_id: '5725'
file_name: 2018_LIPIcs_Goaoc.pdf
file_size: 718414
relation: main_file
file_date_updated: 2020-07-14T12:45:18Z
has_accepted_license: '1'
intvolume: ' 99'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 41:1 - 41:16
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7736'
quality_controlled: '1'
related_material:
record:
- id: '7108'
relation: later_version
status: public
scopus_import: 1
status: public
title: Shellability is NP-complete
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: 99
year: '2018'
...
---
_id: '285'
abstract:
- lang: eng
text: In graph theory, as well as in 3-manifold topology, there exist several width-type
parameters to describe how "simple" or "thin" a given graph
or 3-manifold is. These parameters, such as pathwidth or treewidth for graphs,
or the concept of thin position for 3-manifolds, play an important role when studying
algorithmic problems; in particular, there is a variety of problems in computational
3-manifold topology - some of them known to be computationally hard in general
- that become solvable in polynomial time as soon as the dual graph of the input
triangulation has bounded treewidth. In view of these algorithmic results, it
is natural to ask whether every 3-manifold admits a triangulation of bounded treewidth.
We show that this is not the case, i.e., that there exists an infinite family
of closed 3-manifolds not admitting triangulations of bounded pathwidth or treewidth
(the latter implies the former, but we present two separate proofs). We derive
these results from work of Agol and of Scharlemann and Thompson, by exhibiting
explicit connections between the topology of a 3-manifold M on the one hand and
width-type parameters of the dual graphs of triangulations of M on the other hand,
answering a question that had been raised repeatedly by researchers in computational
3-manifold topology. In particular, we show that if a closed, orientable, irreducible,
non-Haken 3-manifold M has a triangulation of treewidth (resp. pathwidth) k then
the Heegaard genus of M is at most 48(k+1) (resp. 4(3k+1)).
acknowledgement: Research of the second author was supported by the Einstein Foundation
(project “Einstein Visiting Fellow Santos”) and by the Simons Foundation (“Simons
Visiting Professors” program).
alternative_title:
- LIPIcs
article_number: '46'
article_processing_charge: No
author:
- first_name: Kristóf
full_name: Huszár, Kristóf
id: 33C26278-F248-11E8-B48F-1D18A9856A87
last_name: Huszár
orcid: 0000-0002-5445-5057
- first_name: Jonathan
full_name: Spreer, Jonathan
last_name: Spreer
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Huszár K, Spreer J, Wagner U. On the treewidth of triangulated 3-manifolds.
In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.SoCG.2018.46'
apa: 'Huszár, K., Spreer, J., & Wagner, U. (2018). On the treewidth of triangulated
3-manifolds (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry,
Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.46'
chicago: Huszár, Kristóf, Jonathan Spreer, and Uli Wagner. “On the Treewidth of
Triangulated 3-Manifolds,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.46.
ieee: 'K. Huszár, J. Spreer, and U. Wagner, “On the treewidth of triangulated 3-manifolds,”
presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary,
2018, vol. 99.'
ista: 'Huszár K, Spreer J, Wagner U. 2018. On the treewidth of triangulated 3-manifolds.
SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 46.'
mla: Huszár, Kristóf, et al. On the Treewidth of Triangulated 3-Manifolds.
Vol. 99, 46, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.SoCG.2018.46.
short: K. Huszár, J. Spreer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2018.
conference:
end_date: 2018-06-14
location: Budapest, Hungary
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2018-06-11
date_created: 2018-12-11T11:45:37Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2023-09-06T11:13:41Z
day: '01'
ddc:
- '516'
- '000'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2018.46
external_id:
arxiv:
- '1712.00434'
file:
- access_level: open_access
checksum: 530d084116778135d5bffaa317479cac
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T15:32:38Z
date_updated: 2020-07-14T12:45:51Z
file_id: '5713'
file_name: 2018_LIPIcs_Huszar.pdf
file_size: 642522
relation: main_file
file_date_updated: 2020-07-14T12:45:51Z
has_accepted_license: '1'
intvolume: ' 99'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
publication_identifier:
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7614'
quality_controlled: '1'
related_material:
record:
- id: '7093'
relation: later_version
status: public
scopus_import: 1
status: public
title: On the treewidth of triangulated 3-manifolds
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: 99
year: '2018'
...
---
_id: '13059'
abstract:
- lang: eng
text: "This dataset contains a GitHub repository containing all the data, analysis,
Nextflow workflows and Jupyter notebooks to replicate the manuscript titled \"Fast
and accurate large multiple sequence alignments with a root-to-leaf regressive
method\".\r\nIt also contains the Multiple Sequence Alignments (MSAs) generated
and well as the main figures and tables from the manuscript.\r\nThe repository
is also available at GitHub (https://github.com/cbcrg/dpa-analysis) release `v1.2`.\r\nFor
details on how to use the regressive alignment algorithm, see the T-Coffee software
suite (https://github.com/cbcrg/tcoffee)."
article_processing_charge: No
author:
- first_name: Edgar
full_name: Garriga, Edgar
last_name: Garriga
- first_name: Paolo
full_name: di Tommaso, Paolo
last_name: di Tommaso
- first_name: Cedrik
full_name: Magis, Cedrik
last_name: Magis
- first_name: Ionas
full_name: Erb, Ionas
last_name: Erb
- first_name: Leila
full_name: Mansouri, Leila
last_name: Mansouri
- first_name: Athanasios
full_name: Baltzis, Athanasios
last_name: Baltzis
- first_name: Hafid
full_name: Laayouni, Hafid
last_name: Laayouni
- first_name: Fyodor
full_name: Kondrashov, Fyodor
id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
last_name: Kondrashov
orcid: 0000-0001-8243-4694
- first_name: Evan
full_name: Floden, Evan
last_name: Floden
- first_name: Cedric
full_name: Notredame, Cedric
last_name: Notredame
citation:
ama: Garriga E, di Tommaso P, Magis C, et al. Fast and accurate large multiple sequence
alignments with a root-to-leaf regressive method. 2018. doi:10.5281/ZENODO.2025846
apa: Garriga, E., di Tommaso, P., Magis, C., Erb, I., Mansouri, L., Baltzis, A.,
… Notredame, C. (2018). Fast and accurate large multiple sequence alignments with
a root-to-leaf regressive method. Zenodo. https://doi.org/10.5281/ZENODO.2025846
chicago: Garriga, Edgar, Paolo di Tommaso, Cedrik Magis, Ionas Erb, Leila Mansouri,
Athanasios Baltzis, Hafid Laayouni, Fyodor Kondrashov, Evan Floden, and Cedric
Notredame. “Fast and Accurate Large Multiple Sequence Alignments with a Root-to-Leaf
Regressive Method.” Zenodo, 2018. https://doi.org/10.5281/ZENODO.2025846.
ieee: E. Garriga et al., “Fast and accurate large multiple sequence alignments
with a root-to-leaf regressive method.” Zenodo, 2018.
ista: Garriga E, di Tommaso P, Magis C, Erb I, Mansouri L, Baltzis A, Laayouni H,
Kondrashov F, Floden E, Notredame C. 2018. Fast and accurate large multiple sequence
alignments with a root-to-leaf regressive method, Zenodo, 10.5281/ZENODO.2025846.
mla: Garriga, Edgar, et al. Fast and Accurate Large Multiple Sequence Alignments
with a Root-to-Leaf Regressive Method. Zenodo, 2018, doi:10.5281/ZENODO.2025846.
short: E. Garriga, P. di Tommaso, C. Magis, I. Erb, L. Mansouri, A. Baltzis, H.
Laayouni, F. Kondrashov, E. Floden, C. Notredame, (2018).
date_created: 2023-05-23T16:08:20Z
date_published: 2018-12-07T00:00:00Z
date_updated: 2023-09-06T14:32:51Z
day: '07'
ddc:
- '570'
department:
- _id: FyKo
doi: 10.5281/ZENODO.2025846
main_file_link:
- open_access: '1'
url: https://doi.org/10.5281/zenodo.3271452
month: '12'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
record:
- id: '7181'
relation: used_in_publication
status: public
status: public
title: Fast and accurate large multiple sequence alignments with a root-to-leaf regressive
method
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '49'
abstract:
- lang: eng
text: Nowadays, quantum computation is receiving more and more attention as an alternative
to the classical way of computing. For realizing a quantum computer, different
devices are investigated as potential quantum bits. In this thesis, the focus
is on Ge hut wires, which turned out to be promising candidates for implementing
hole spin quantum bits. The advantages of Ge as a material system are the low
hyperfine interaction for holes and the strong spin orbit coupling, as well as
the compatibility with the highly developed CMOS processes in industry. In addition,
Ge can also be isotopically purified which is expected to boost the spin coherence
times. The strong spin orbit interaction for holes in Ge on the one hand enables
the full electrical control of the quantum bit and on the other hand should allow
short spin manipulation times. Starting with a bare Si wafer, this work covers
the entire process reaching from growth over the fabrication and characterization
of hut wire devices up to the demonstration of hole spin resonance. From experiments
with single quantum dots, a large g-factor anisotropy between the in-plane and
the out-of-plane direction was found. A comparison to a theoretical model unveiled
the heavy-hole character of the lowest energy states. The second part of the thesis
addresses double quantum dot devices, which were realized by adding two gate electrodes
to a hut wire. In such devices, Pauli spin blockade was observed, which can serve
as a read-out mechanism for spin quantum bits. Applying oscillating electric fields
in spin blockade allowed the demonstration of continuous spin rotations and the
extraction of a lower bound for the spin dephasing time. Despite the strong spin
orbit coupling in Ge, the obtained value for the dephasing time is comparable
to what has been recently reported for holes in Si. All in all, the presented
results point out the high potential of Ge hut wires as a platform for long-lived,
fast and fully electrically tunable hole spin quantum bits.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Hannes
full_name: Watzinger, Hannes
id: 35DF8E50-F248-11E8-B48F-1D18A9856A87
last_name: Watzinger
citation:
ama: Watzinger H. Ge hut wires - from growth to hole spin resonance. 2018. doi:10.15479/AT:ISTA:th_1033
apa: Watzinger, H. (2018). Ge hut wires - from growth to hole spin resonance.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1033
chicago: Watzinger, Hannes. “Ge Hut Wires - from Growth to Hole Spin Resonance.”
Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_1033.
ieee: H. Watzinger, “Ge hut wires - from growth to hole spin resonance,” Institute
of Science and Technology Austria, 2018.
ista: Watzinger H. 2018. Ge hut wires - from growth to hole spin resonance. Institute
of Science and Technology Austria.
mla: Watzinger, Hannes. Ge Hut Wires - from Growth to Hole Spin Resonance.
Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1033.
short: H. Watzinger, Ge Hut Wires - from Growth to Hole Spin Resonance, Institute
of Science and Technology Austria, 2018.
date_created: 2018-12-11T11:44:21Z
date_published: 2018-07-30T00:00:00Z
date_updated: 2023-09-07T12:27:43Z
day: '30'
ddc:
- '530'
degree_awarded: PhD
department:
- _id: GeKa
doi: 10.15479/AT:ISTA:th_1033
file:
- access_level: open_access
checksum: b653b5216251f938ddbeafd1de88667c
content_type: application/pdf
creator: dernst
date_created: 2019-04-09T07:13:28Z
date_updated: 2020-07-14T12:46:35Z
file_id: '6249'
file_name: 2018_Thesis_Watzinger.pdf
file_size: 85539748
relation: main_file
- access_level: closed
checksum: 39bcf8de7ac5b1bb516b11ce2f966785
content_type: application/zip
creator: dernst
date_created: 2019-04-09T07:13:27Z
date_updated: 2020-07-14T12:46:35Z
file_id: '6250'
file_name: 2018_Thesis_Watzinger_source.zip
file_size: 21830697
relation: source_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '77'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '8005'
pubrep_id: '1033'
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: Ge hut wires - from growth to hole spin resonance
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '201'
abstract:
- lang: eng
text: 'We describe arrangements of three-dimensional spheres from a geometrical
and topological point of view. Real data (fitting this setup) often consist of
soft spheres which show certain degree of deformation while strongly packing against
each other. In this context, we answer the following questions: If we model a
soft packing of spheres by hard spheres that are allowed to overlap, can we measure
the volume in the overlapped areas? Can we be more specific about the overlap
volume, i.e. quantify how much volume is there covered exactly twice, three times,
or k times? What would be a good optimization criteria that rule the arrangement
of soft spheres while making a good use of the available space? Fixing a particular
criterion, what would be the optimal sphere configuration? The first result of
this thesis are short formulas for the computation of volumes covered by at least
k of the balls. The formulas exploit information contained in the order-k Voronoi
diagrams and its closely related Level-k complex. The used complexes lead to a
natural generalization into poset diagrams, a theoretical formalism that contains
the order-k and degree-k diagrams as special cases. In parallel, we define different
criteria to determine what could be considered an optimal arrangement from a geometrical
point of view. Fixing a criterion, we find optimal soft packing configurations
in 2D and 3D where the ball centers lie on a lattice. As a last step, we use tools
from computational topology on real physical data, to show the potentials of higher-order
diagrams in the description of melting crystals. The results of the experiments
leaves us with an open window to apply the theories developed in this thesis in
real applications.'
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Mabel
full_name: Iglesias Ham, Mabel
id: 41B58C0C-F248-11E8-B48F-1D18A9856A87
last_name: Iglesias Ham
citation:
ama: Iglesias Ham M. Multiple covers with balls. 2018. doi:10.15479/AT:ISTA:th_1026
apa: Iglesias Ham, M. (2018). Multiple covers with balls. Institute of Science
and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1026
chicago: Iglesias Ham, Mabel. “Multiple Covers with Balls.” Institute of Science
and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_1026.
ieee: M. Iglesias Ham, “Multiple covers with balls,” Institute of Science and Technology
Austria, 2018.
ista: Iglesias Ham M. 2018. Multiple covers with balls. Institute of Science and
Technology Austria.
mla: Iglesias Ham, Mabel. Multiple Covers with Balls. Institute of Science
and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1026.
short: M. Iglesias Ham, Multiple Covers with Balls, Institute of Science and Technology
Austria, 2018.
date_created: 2018-12-11T11:45:10Z
date_published: 2018-06-11T00:00:00Z
date_updated: 2023-09-07T12:25:32Z
day: '11'
ddc:
- '514'
- '516'
degree_awarded: PhD
department:
- _id: HeEd
doi: 10.15479/AT:ISTA:th_1026
file:
- access_level: closed
checksum: dd699303623e96d1478a6ae07210dd05
content_type: application/zip
creator: kschuh
date_created: 2019-02-05T07:43:31Z
date_updated: 2020-07-14T12:45:24Z
file_id: '5918'
file_name: IST-2018-1025-v2+5_ist-thesis-iglesias-11June2018(1).zip
file_size: 11827713
relation: source_file
- access_level: open_access
checksum: ba163849a190d2b41d66fef0e4983294
content_type: application/pdf
creator: kschuh
date_created: 2019-02-05T07:43:45Z
date_updated: 2020-07-14T12:45:24Z
file_id: '5919'
file_name: IST-2018-1025-v2+4_ThesisIglesiasFinal11June2018.pdf
file_size: 4783846
relation: main_file
file_date_updated: 2020-07-14T12:45:24Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '171'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7712'
pubrep_id: '1026'
status: public
supervisor:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
title: Multiple covers with balls
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '68'
abstract:
- lang: eng
text: The most common assumption made in statistical learning theory is the assumption
of the independent and identically distributed (i.i.d.) data. While being very
convenient mathematically, it is often very clearly violated in practice. This
disparity between the machine learning theory and applications underlies a growing
demand in the development of algorithms that learn from dependent data and theory
that can provide generalization guarantees similar to the independent situations.
This thesis is dedicated to two variants of dependencies that can arise in practice.
One is a dependence on the level of samples in a single learning task. Another
dependency type arises in the multi-task setting when the tasks are dependent
on each other even though the data for them can be i.i.d. In both cases we model
the data (samples or tasks) as stochastic processes and introduce new algorithms
for both settings that take into account and exploit the resulting dependencies.
We prove the theoretical guarantees on the performance of the introduced algorithms
under different evaluation criteria and, in addition, we compliment the theoretical
study by the empirical one, where we evaluate some of the algorithms on two real
world datasets to highlight their practical applicability.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Alexander
full_name: Zimin, Alexander
id: 37099E9C-F248-11E8-B48F-1D18A9856A87
last_name: Zimin
citation:
ama: Zimin A. Learning from dependent data. 2018. doi:10.15479/AT:ISTA:TH1048
apa: Zimin, A. (2018). Learning from dependent data. Institute of Science
and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH1048
chicago: Zimin, Alexander. “Learning from Dependent Data.” Institute of Science
and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH1048.
ieee: A. Zimin, “Learning from dependent data,” Institute of Science and Technology
Austria, 2018.
ista: Zimin A. 2018. Learning from dependent data. Institute of Science and Technology
Austria.
mla: Zimin, Alexander. Learning from Dependent Data. Institute of Science
and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH1048.
short: A. Zimin, Learning from Dependent Data, Institute of Science and Technology
Austria, 2018.
date_created: 2018-12-11T11:44:27Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2023-09-07T12:29:07Z
day: '01'
ddc:
- '004'
- '519'
degree_awarded: PhD
department:
- _id: ChLa
doi: 10.15479/AT:ISTA:TH1048
ec_funded: 1
file:
- access_level: open_access
checksum: e849dd40a915e4d6c5572b51b517f098
content_type: application/pdf
creator: dernst
date_created: 2019-04-09T07:32:47Z
date_updated: 2020-07-14T12:47:40Z
file_id: '6253'
file_name: 2018_Thesis_Zimin.pdf
file_size: 1036137
relation: main_file
- access_level: closed
checksum: da092153cec55c97461bd53c45c5d139
content_type: application/zip
creator: dernst
date_created: 2019-04-09T07:32:47Z
date_updated: 2020-07-14T12:47:40Z
file_id: '6254'
file_name: 2018_Thesis_Zimin_Source.zip
file_size: 637490
relation: source_file
file_date_updated: 2020-07-14T12:47:40Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '92'
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7986'
pubrep_id: '1048'
status: public
supervisor:
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
title: Learning from dependent data
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '83'
abstract:
- lang: eng
text: "A proof system is a protocol between a prover and a verifier over a common
input in which an honest prover convinces the verifier of the validity of true
statements. Motivated by the success of decentralized cryptocurrencies, exemplified
by Bitcoin, the focus of this thesis will be on proof systems which found applications
in some sustainable alternatives to Bitcoin, such as the Spacemint and Chia cryptocurrencies.
In particular, we focus on proofs of space and proofs of sequential work.\r\nProofs
of space (PoSpace) were suggested as more ecological, economical, and egalitarian
alternative to the energy-wasteful proof-of-work mining of Bitcoin. However, the
state-of-the-art constructions of PoSpace are based on sophisticated graph pebbling
lower bounds, and are therefore complex. Moreover, when these PoSpace are used
in cryptocurrencies like Spacemint, miners can only start mining after ensuring
that a commitment to their space is already added in a special transaction to
the blockchain. Proofs of sequential work (PoSW) are proof systems in which a
prover, upon receiving a statement x and a time parameter T, computes a proof
which convinces the verifier that T time units had passed since x was received.
Whereas Spacemint assumes synchrony to retain some interesting Bitcoin dynamics,
Chia requires PoSW with unique proofs, i.e., PoSW in which it is hard to come
up with more than one accepting proof for any true statement. In this thesis we
construct simple and practically-efficient PoSpace and PoSW. When using our PoSpace
in cryptocurrencies, miners can start mining on the fly, like in Bitcoin, and
unlike current constructions of PoSW, which either achieve efficient verification
of sequential work, or faster-than-recomputing verification of correctness of
proofs, but not both at the same time, ours achieve the best of these two worlds."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Hamza M
full_name: Abusalah, Hamza M
id: 40297222-F248-11E8-B48F-1D18A9856A87
last_name: Abusalah
citation:
ama: Abusalah HM. Proof systems for sustainable decentralized cryptocurrencies.
2018. doi:10.15479/AT:ISTA:TH_1046
apa: Abusalah, H. M. (2018). Proof systems for sustainable decentralized cryptocurrencies.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_1046
chicago: Abusalah, Hamza M. “Proof Systems for Sustainable Decentralized Cryptocurrencies.”
Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH_1046.
ieee: H. M. Abusalah, “Proof systems for sustainable decentralized cryptocurrencies,”
Institute of Science and Technology Austria, 2018.
ista: Abusalah HM. 2018. Proof systems for sustainable decentralized cryptocurrencies.
Institute of Science and Technology Austria.
mla: Abusalah, Hamza M. Proof Systems for Sustainable Decentralized Cryptocurrencies.
Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH_1046.
short: H.M. Abusalah, Proof Systems for Sustainable Decentralized Cryptocurrencies,
Institute of Science and Technology Austria, 2018.
date_created: 2018-12-11T11:44:32Z
date_published: 2018-09-05T00:00:00Z
date_updated: 2023-09-07T12:30:23Z
day: '05'
ddc:
- '004'
degree_awarded: PhD
department:
- _id: KrPi
doi: 10.15479/AT:ISTA:TH_1046
ec_funded: 1
file:
- access_level: open_access
checksum: c4b5f7d111755d1396787f41886fc674
content_type: application/pdf
creator: dernst
date_created: 2019-04-09T06:43:41Z
date_updated: 2020-07-14T12:48:11Z
file_id: '6245'
file_name: 2018_Thesis_Abusalah.pdf
file_size: 876241
relation: main_file
- access_level: closed
checksum: 0f382ac56b471c48fd907d63eb87dafe
content_type: application/x-gzip
creator: dernst
date_created: 2019-04-09T06:43:41Z
date_updated: 2020-07-14T12:48:11Z
file_id: '6246'
file_name: 2018_Thesis_Abusalah_source.tar.gz
file_size: 2029190
relation: source_file
file_date_updated: 2020-07-14T12:48:11Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '59'
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7971'
pubrep_id: '1046'
related_material:
record:
- id: '1229'
relation: part_of_dissertation
status: public
- id: '1235'
relation: part_of_dissertation
status: public
- id: '1236'
relation: part_of_dissertation
status: public
- id: '559'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
title: Proof systems for sustainable decentralized cryptocurrencies
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '197'
abstract:
- lang: eng
text: Modern computer vision systems heavily rely on statistical machine learning
models, which typically require large amounts of labeled data to be learned reliably.
Moreover, very recently computer vision research widely adopted techniques for
representation learning, which further increase the demand for labeled data. However,
for many important practical problems there is relatively small amount of labeled
data available, so it is problematic to leverage full potential of the representation
learning methods. One way to overcome this obstacle is to invest substantial resources
into producing large labelled datasets. Unfortunately, this can be prohibitively
expensive in practice. In this thesis we focus on the alternative way of tackling
the aforementioned issue. We concentrate on methods, which make use of weakly-labeled
or even unlabeled data. Specifically, the first half of the thesis is dedicated
to the semantic image segmentation task. We develop a technique, which achieves
competitive segmentation performance and only requires annotations in a form of
global image-level labels instead of dense segmentation masks. Subsequently, we
present a new methodology, which further improves segmentation performance by
leveraging tiny additional feedback from a human annotator. By using our methods
practitioners can greatly reduce the amount of data annotation effort, which is
required to learn modern image segmentation models. In the second half of the
thesis we focus on methods for learning from unlabeled visual data. We study a
family of autoregressive models for modeling structure of natural images and discuss
potential applications of these models. Moreover, we conduct in-depth study of
one of these applications, where we develop the state-of-the-art model for the
probabilistic image colorization task.
acknowledgement: I also gratefully acknowledge the support of NVIDIA Corporation with
the donation of the GPUs used for this research.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Alexander
full_name: Kolesnikov, Alexander
id: 2D157DB6-F248-11E8-B48F-1D18A9856A87
last_name: Kolesnikov
citation:
ama: Kolesnikov A. Weakly-Supervised Segmentation and Unsupervised Modeling of Natural
Images. 2018. doi:10.15479/AT:ISTA:th_1021
apa: Kolesnikov, A. (2018). Weakly-Supervised Segmentation and Unsupervised Modeling
of Natural Images. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1021
chicago: Kolesnikov, Alexander. “Weakly-Supervised Segmentation and Unsupervised
Modeling of Natural Images.” Institute of Science and Technology Austria, 2018.
https://doi.org/10.15479/AT:ISTA:th_1021.
ieee: A. Kolesnikov, “Weakly-Supervised Segmentation and Unsupervised Modeling of
Natural Images,” Institute of Science and Technology Austria, 2018.
ista: Kolesnikov A. 2018. Weakly-Supervised Segmentation and Unsupervised Modeling
of Natural Images. Institute of Science and Technology Austria.
mla: Kolesnikov, Alexander. Weakly-Supervised Segmentation and Unsupervised Modeling
of Natural Images. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1021.
short: A. Kolesnikov, Weakly-Supervised Segmentation and Unsupervised Modeling of
Natural Images, Institute of Science and Technology Austria, 2018.
date_created: 2018-12-11T11:45:09Z
date_published: 2018-05-25T00:00:00Z
date_updated: 2023-09-07T12:51:46Z
day: '25'
ddc:
- '004'
degree_awarded: PhD
department:
- _id: ChLa
doi: 10.15479/AT:ISTA:th_1021
ec_funded: 1
file:
- access_level: open_access
checksum: bc678e02468d8ebc39dc7267dfb0a1c4
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:57Z
date_updated: 2020-07-14T12:45:22Z
file_id: '5113'
file_name: IST-2018-1021-v1+1_thesis-unsigned-pdfa.pdf
file_size: 12918758
relation: main_file
- access_level: closed
checksum: bc66973b086da5a043f1162dcfb1fde4
content_type: application/zip
creator: dernst
date_created: 2019-04-05T09:34:49Z
date_updated: 2020-07-14T12:45:22Z
file_id: '6225'
file_name: 2018_Thesis_Kolesnikov_source.zip
file_size: 55973760
relation: source_file
file_date_updated: 2020-07-14T12:45:22Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '113'
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7718'
pubrep_id: '1021'
status: public
supervisor:
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
title: Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '6774'
abstract:
- lang: eng
text: "A central problem of algebraic topology is to understand the homotopy groups
\ \U0001D70B\U0001D451(\U0001D44B) of a topological space X. For the computational
version of the problem, it is well known that there is no algorithm to decide
whether the fundamental group \U0001D70B1(\U0001D44B) of a given finite simplicial
complex X is trivial. On the other hand, there are several algorithms that, given
a finite simplicial complex X that is simply connected (i.e., with \U0001D70B1(\U0001D44B)
\ trivial), compute the higher homotopy group \U0001D70B\U0001D451(\U0001D44B)
\ for any given \U0001D451≥2 . However, these algorithms come with a caveat:
They compute the isomorphism type of \U0001D70B\U0001D451(\U0001D44B) , \U0001D451≥2
\ as an abstract finitely generated abelian group given by generators and relations,
but they work with very implicit representations of the elements of \U0001D70B\U0001D451(\U0001D44B)
. Converting elements of this abstract group into explicit geometric maps from
the d-dimensional sphere \U0001D446\U0001D451 to X has been one of the main
unsolved problems in the emerging field of computational homotopy theory. Here
we present an algorithm that, given a simply connected space X, computes \U0001D70B\U0001D451(\U0001D44B)
\ and represents its elements as simplicial maps from a suitable triangulation
of the d-sphere \U0001D446\U0001D451 to X. For fixed d, the algorithm runs
in time exponential in size(\U0001D44B) , the number of simplices of X. Moreover,
we prove that this is optimal: For every fixed \U0001D451≥2 , we construct a
family of simply connected spaces X such that for any simplicial map representing
a generator of \U0001D70B\U0001D451(\U0001D44B) , the size of the triangulation
of \U0001D446\U0001D451 on which the map is defined, is exponential in size(\U0001D44B)
."
article_type: original
author:
- first_name: Marek
full_name: Filakovský, Marek
id: 3E8AF77E-F248-11E8-B48F-1D18A9856A87
last_name: Filakovský
- first_name: Peter
full_name: Franek, Peter
id: 473294AE-F248-11E8-B48F-1D18A9856A87
last_name: Franek
orcid: 0000-0001-8878-8397
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
- first_name: Stephan Y
full_name: Zhechev, Stephan Y
id: 3AA52972-F248-11E8-B48F-1D18A9856A87
last_name: Zhechev
citation:
ama: Filakovský M, Franek P, Wagner U, Zhechev SY. Computing simplicial representatives
of homotopy group elements. Journal of Applied and Computational Topology.
2018;2(3-4):177-231. doi:10.1007/s41468-018-0021-5
apa: Filakovský, M., Franek, P., Wagner, U., & Zhechev, S. Y. (2018). Computing
simplicial representatives of homotopy group elements. Journal of Applied and
Computational Topology. Springer. https://doi.org/10.1007/s41468-018-0021-5
chicago: Filakovský, Marek, Peter Franek, Uli Wagner, and Stephan Y Zhechev. “Computing
Simplicial Representatives of Homotopy Group Elements.” Journal of Applied
and Computational Topology. Springer, 2018. https://doi.org/10.1007/s41468-018-0021-5.
ieee: M. Filakovský, P. Franek, U. Wagner, and S. Y. Zhechev, “Computing simplicial
representatives of homotopy group elements,” Journal of Applied and Computational
Topology, vol. 2, no. 3–4. Springer, pp. 177–231, 2018.
ista: Filakovský M, Franek P, Wagner U, Zhechev SY. 2018. Computing simplicial representatives
of homotopy group elements. Journal of Applied and Computational Topology. 2(3–4),
177–231.
mla: Filakovský, Marek, et al. “Computing Simplicial Representatives of Homotopy
Group Elements.” Journal of Applied and Computational Topology, vol. 2,
no. 3–4, Springer, 2018, pp. 177–231, doi:10.1007/s41468-018-0021-5.
short: M. Filakovský, P. Franek, U. Wagner, S.Y. Zhechev, Journal of Applied and
Computational Topology 2 (2018) 177–231.
date_created: 2019-08-08T06:47:40Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2023-09-07T13:10:36Z
day: '01'
ddc:
- '514'
department:
- _id: UlWa
doi: 10.1007/s41468-018-0021-5
file:
- access_level: open_access
checksum: cf9e7fcd2a113dd4828774fc75cdb7e8
content_type: application/pdf
creator: dernst
date_created: 2019-08-08T06:55:21Z
date_updated: 2020-07-14T12:47:40Z
file_id: '6775'
file_name: 2018_JourAppliedComputTopology_Filakovsky.pdf
file_size: 1056278
relation: main_file
file_date_updated: 2020-07-14T12:47:40Z
has_accepted_license: '1'
intvolume: ' 2'
issue: 3-4
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 177-231
project:
- _id: 25F8B9BC-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M01980
name: Robust invariants of Nonlinear Systems
- _id: 3AC91DDA-15DF-11EA-824D-93A3E7B544D1
call_identifier: FWF
name: FWF Open Access Fund
publication: Journal of Applied and Computational Topology
publication_identifier:
eissn:
- 2367-1734
issn:
- 2367-1726
publication_status: published
publisher: Springer
quality_controlled: '1'
related_material:
record:
- id: '6681'
relation: dissertation_contains
status: public
status: public
title: Computing simplicial representatives of homotopy group elements
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: 2
year: '2018'
...
---
_id: '133'
abstract:
- lang: eng
text: Synchronous programs are easy to specify because the side effects of an operation
are finished by the time the invocation of the operation returns to the caller.
Asynchronous programs, on the other hand, are difficult to specify because there
are side effects due to pending computation scheduled as a result of the invocation
of an operation. They are also difficult to verify because of the large number
of possible interleavings of concurrent computation threads. We present synchronization,
a new proof rule that simplifies the verification of asynchronous programs by
introducing the fiction, for proof purposes, that asynchronous operations complete
synchronously. Synchronization summarizes an asynchronous computation as immediate
atomic effect. Modular verification is enabled via pending asynchronous calls
in atomic summaries, and a complementary proof rule that eliminates pending asynchronous
calls when components and their specifications are composed. We evaluate synchronization
in the context of a multi-layer refinement verification methodology on a collection
of benchmark programs.
alternative_title:
- LIPIcs
article_number: '21'
author:
- first_name: Bernhard
full_name: Kragl, Bernhard
id: 320FC952-F248-11E8-B48F-1D18A9856A87
last_name: Kragl
orcid: 0000-0001-7745-9117
- first_name: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Kragl B, Qadeer S, Henzinger TA. Synchronizing the asynchronous. In: Vol 118.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.CONCUR.2018.21'
apa: 'Kragl, B., Qadeer, S., & Henzinger, T. A. (2018). Synchronizing the asynchronous
(Vol. 118). Presented at the CONCUR: International Conference on Concurrency Theory,
Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2018.21'
chicago: Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Synchronizing the
Asynchronous,” Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
https://doi.org/10.4230/LIPIcs.CONCUR.2018.21.
ieee: 'B. Kragl, S. Qadeer, and T. A. Henzinger, “Synchronizing the asynchronous,”
presented at the CONCUR: International Conference on Concurrency Theory, Beijing,
China, 2018, vol. 118.'
ista: 'Kragl B, Qadeer S, Henzinger TA. 2018. Synchronizing the asynchronous. CONCUR:
International Conference on Concurrency Theory, LIPIcs, vol. 118, 21.'
mla: Kragl, Bernhard, et al. Synchronizing the Asynchronous. Vol. 118, 21,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.CONCUR.2018.21.
short: B. Kragl, S. Qadeer, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2018.
conference:
end_date: 2018-09-07
location: Beijing, China
name: 'CONCUR: International Conference on Concurrency Theory'
start_date: 2018-09-04
date_created: 2018-12-11T11:44:48Z
date_published: 2018-08-13T00:00:00Z
date_updated: 2023-09-07T13:18:00Z
day: '13'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.CONCUR.2018.21
file:
- access_level: open_access
checksum: c90895f4c5fafc18ddc54d1c8848077e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:46Z
date_updated: 2020-07-14T12:44:44Z
file_id: '5368'
file_name: IST-2018-853-v2+2_concur2018.pdf
file_size: 745438
relation: main_file
file_date_updated: 2020-07-14T12:44:44Z
has_accepted_license: '1'
intvolume: ' 118'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication_identifier:
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7790'
pubrep_id: '1039'
quality_controlled: '1'
related_material:
record:
- id: '6426'
relation: earlier_version
status: public
- id: '8332'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Synchronizing the asynchronous
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: 118
year: '2018'
...
---
_id: '187'
abstract:
- lang: eng
text: 'Given a locally finite X ⊆ ℝd and a radius r ≥ 0, the k-fold cover of X and
r consists of all points in ℝd that have k or more points of X within distance
r. We consider two filtrations - one in scale obtained by fixing k and increasing
r, and the other in depth obtained by fixing r and decreasing k - and we compute
the persistence diagrams of both. While standard methods suffice for the filtration
in scale, we need novel geometric and topological concepts for the filtration
in depth. In particular, we introduce a rhomboid tiling in ℝd+1 whose horizontal
integer slices are the order-k Delaunay mosaics of X, and construct a zigzag module
from Delaunay mosaics that is isomorphic to the persistence module of the multi-covers. '
acknowledgement: This work is partially supported by the DFG Collaborative Research
Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35
of the Austrian Science Fund (FWF).
alternative_title:
- LIPIcs
article_number: '34'
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Georg F
full_name: Osang, Georg F
id: 464B40D6-F248-11E8-B48F-1D18A9856A87
last_name: Osang
orcid: 0000-0002-8882-5116
citation:
ama: 'Edelsbrunner H, Osang GF. The multi-cover persistence of Euclidean balls.
In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.SoCG.2018.34'
apa: 'Edelsbrunner, H., & Osang, G. F. (2018). The multi-cover persistence of
Euclidean balls (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry,
Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.34'
chicago: Edelsbrunner, Herbert, and Georg F Osang. “The Multi-Cover Persistence
of Euclidean Balls,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.34.
ieee: 'H. Edelsbrunner and G. F. Osang, “The multi-cover persistence of Euclidean
balls,” presented at the SoCG: Symposium on Computational Geometry, Budapest,
Hungary, 2018, vol. 99.'
ista: 'Edelsbrunner H, Osang GF. 2018. The multi-cover persistence of Euclidean
balls. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 34.'
mla: Edelsbrunner, Herbert, and Georg F. Osang. The Multi-Cover Persistence of
Euclidean Balls. Vol. 99, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2018, doi:10.4230/LIPIcs.SoCG.2018.34.
short: H. Edelsbrunner, G.F. Osang, in:, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2018.
conference:
end_date: 2018-06-14
location: Budapest, Hungary
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2018-06-11
date_created: 2018-12-11T11:45:05Z
date_published: 2018-06-11T00:00:00Z
date_updated: 2023-09-07T13:29:00Z
day: '11'
ddc:
- '516'
department:
- _id: HeEd
doi: 10.4230/LIPIcs.SoCG.2018.34
file:
- access_level: open_access
checksum: d8c0533ad0018eb4ed1077475eb8fc18
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T09:27:22Z
date_updated: 2020-07-14T12:45:19Z
file_id: '5738'
file_name: 2018_LIPIcs_Edelsbrunner_Osang.pdf
file_size: 528018
relation: main_file
file_date_updated: 2020-07-14T12:45:19Z
has_accepted_license: '1'
intvolume: ' 99'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7732'
quality_controlled: '1'
related_material:
record:
- id: '9317'
relation: later_version
status: public
- id: '9056'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: The multi-cover persistence of Euclidean balls
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: 99
year: '2018'
...
---
_id: '692'
abstract:
- lang: eng
text: We consider families of confocal conics and two pencils of Apollonian circles
having the same foci. We will show that these families of curves generate trivial
3-webs and find the exact formulas describing them.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
citation:
ama: Akopyan A. 3-Webs generated by confocal conics and circles. Geometriae Dedicata.
2018;194(1):55-64. doi:10.1007/s10711-017-0265-6
apa: Akopyan, A. (2018). 3-Webs generated by confocal conics and circles. Geometriae
Dedicata. Springer. https://doi.org/10.1007/s10711-017-0265-6
chicago: Akopyan, Arseniy. “3-Webs Generated by Confocal Conics and Circles.” Geometriae
Dedicata. Springer, 2018. https://doi.org/10.1007/s10711-017-0265-6.
ieee: A. Akopyan, “3-Webs generated by confocal conics and circles,” Geometriae
Dedicata, vol. 194, no. 1. Springer, pp. 55–64, 2018.
ista: Akopyan A. 2018. 3-Webs generated by confocal conics and circles. Geometriae
Dedicata. 194(1), 55–64.
mla: Akopyan, Arseniy. “3-Webs Generated by Confocal Conics and Circles.” Geometriae
Dedicata, vol. 194, no. 1, Springer, 2018, pp. 55–64, doi:10.1007/s10711-017-0265-6.
short: A. Akopyan, Geometriae Dedicata 194 (2018) 55–64.
date_created: 2018-12-11T11:47:57Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2023-09-08T11:40:29Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1007/s10711-017-0265-6
ec_funded: 1
external_id:
isi:
- '000431418800004'
file:
- access_level: open_access
checksum: 1febcfc1266486053a069e3425ea3713
content_type: application/pdf
creator: kschuh
date_created: 2020-01-03T11:35:08Z
date_updated: 2020-07-14T12:47:44Z
file_id: '7222'
file_name: 2018_Springer_Akopyan.pdf
file_size: 1140860
relation: main_file
file_date_updated: 2020-07-14T12:47:44Z
has_accepted_license: '1'
intvolume: ' 194'
isi: 1
issue: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 55 - 64
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Geometriae Dedicata
publication_status: published
publisher: Springer
publist_id: '7014'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 3-Webs generated by confocal conics and circles
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 194
year: '2018'
...
---
_id: '77'
abstract:
- lang: eng
text: Holes confined in quantum dots have gained considerable interest in the past
few years due to their potential as spin qubits. Here we demonstrate two-axis
control of a spin 3/2 qubit in natural Ge. The qubit is formed in a hut wire double
quantum dot device. The Pauli spin blockade principle allowed us to demonstrate
electric dipole spin resonance by applying a radio frequency electric field to
one of the electrodes defining the double quantum dot. Coherent hole spin oscillations
with Rabi frequencies reaching 140 MHz are demonstrated and dephasing times of
130 ns are measured. The reported results emphasize the potential of Ge as a platform
for fast and electrically tunable hole spin qubit devices.
acknowledged_ssus:
- _id: M-Shop
- _id: NanoFab
article_processing_charge: Yes
article_type: original
author:
- first_name: Hannes
full_name: Watzinger, Hannes
id: 35DF8E50-F248-11E8-B48F-1D18A9856A87
last_name: Watzinger
- first_name: Josip
full_name: Kukucka, Josip
id: 3F5D8856-F248-11E8-B48F-1D18A9856A87
last_name: Kukucka
- first_name: Lada
full_name: Vukusic, Lada
id: 31E9F056-F248-11E8-B48F-1D18A9856A87
last_name: Vukusic
orcid: 0000-0003-2424-8636
- first_name: Fei
full_name: Gao, Fei
last_name: Gao
- first_name: Ting
full_name: Wang, Ting
last_name: Wang
- first_name: Friedrich
full_name: Schäffler, Friedrich
last_name: Schäffler
- first_name: Jian
full_name: Zhang, Jian
last_name: Zhang
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
citation:
ama: Watzinger H, Kukucka J, Vukušić L, et al. A germanium hole spin qubit. Nature
Communications. 2018;9(3902). doi:10.1038/s41467-018-06418-4
apa: Watzinger, H., Kukucka, J., Vukušić, L., Gao, F., Wang, T., Schäffler, F.,
… Katsaros, G. (2018). A germanium hole spin qubit. Nature Communications.
Nature Publishing Group. https://doi.org/10.1038/s41467-018-06418-4
chicago: Watzinger, Hannes, Josip Kukucka, Lada Vukušić, Fei Gao, Ting Wang, Friedrich
Schäffler, Jian Zhang, and Georgios Katsaros. “A Germanium Hole Spin Qubit.” Nature
Communications. Nature Publishing Group, 2018. https://doi.org/10.1038/s41467-018-06418-4.
ieee: H. Watzinger et al., “A germanium hole spin qubit,” Nature Communications,
vol. 9, no. 3902. Nature Publishing Group, 2018.
ista: Watzinger H, Kukucka J, Vukušić L, Gao F, Wang T, Schäffler F, Zhang J, Katsaros
G. 2018. A germanium hole spin qubit. Nature Communications. 9(3902).
mla: Watzinger, Hannes, et al. “A Germanium Hole Spin Qubit.” Nature Communications,
vol. 9, no. 3902, Nature Publishing Group, 2018, doi:10.1038/s41467-018-06418-4.
short: H. Watzinger, J. Kukucka, L. Vukušić, F. Gao, T. Wang, F. Schäffler, J. Zhang,
G. Katsaros, Nature Communications 9 (2018).
date_created: 2018-12-11T11:44:30Z
date_published: 2018-09-25T00:00:00Z
date_updated: 2023-09-08T11:44:02Z
day: '25'
ddc:
- '530'
department:
- _id: GeKa
doi: 10.1038/s41467-018-06418-4
ec_funded: 1
external_id:
isi:
- '000445560800010'
file:
- access_level: open_access
checksum: e7148c10a64497e279c4de570b6cc544
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T10:28:30Z
date_updated: 2020-07-14T12:48:02Z
file_id: '5687'
file_name: 2018_NatureComm_Watzinger.pdf
file_size: 1063469
relation: main_file
file_date_updated: 2020-07-14T12:48:02Z
has_accepted_license: '1'
intvolume: ' 9'
isi: 1
issue: '3902 '
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 25517E86-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '335497'
name: Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires
- _id: 2552F888-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Y00715
name: Loch Spin-Qubits und Majorana-Fermionen in Germanium
publication: Nature Communications
publication_status: published
publisher: Nature Publishing Group
quality_controlled: '1'
related_material:
record:
- id: '7977'
relation: popular_science
- id: '7996'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: A germanium hole spin qubit
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 9
year: '2018'
...
---
_id: '401'
abstract:
- lang: eng
text: The actomyosin cytoskeleton, a key stress-producing unit in epithelial cells,
oscillates spontaneously in a wide variety of systems. Although much of the signal
cascade regulating myosin activity has been characterized, the origin of such
oscillatory behavior is still unclear. Here, we show that basal myosin II oscillation
in Drosophila ovarian epithelium is not controlled by actomyosin cortical tension,
but instead relies on a biochemical oscillator involving ROCK and myosin phosphatase.
Key to this oscillation is a diffusive ROCK flow, linking junctional Rho1 to medial
actomyosin cortex, and dynamically maintained by a self-activation loop reliant
on ROCK kinase activity. In response to the resulting myosin II recruitment, myosin
phosphatase is locally enriched and shuts off ROCK and myosin II signals. Coupling
Drosophila genetics, live imaging, modeling, and optogenetics, we uncover an intrinsic
biochemical oscillator at the core of myosin II regulatory network, shedding light
on the spatio-temporal dynamics of force generation.
article_number: '1210'
article_processing_charge: No
author:
- first_name: Xiang
full_name: Qin, Xiang
last_name: Qin
- 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: Thomas
full_name: Mangeat, Thomas
last_name: Mangeat
- first_name: Chang
full_name: Liu, Chang
last_name: Liu
- first_name: Pralay
full_name: Majumder, Pralay
last_name: Majumder
- first_name: Jjiaying
full_name: Liu, Jjiaying
last_name: Liu
- first_name: Valerie
full_name: Choesmel Cadamuro, Valerie
last_name: Choesmel Cadamuro
- first_name: Jocelyn
full_name: Mcdonald, Jocelyn
last_name: Mcdonald
- first_name: Yinyao
full_name: Liu, Yinyao
last_name: Liu
- first_name: Bin
full_name: Yi, Bin
last_name: Yi
- first_name: Xiaobo
full_name: Wang, Xiaobo
last_name: Wang
citation:
ama: Qin X, Hannezo EB, Mangeat T, et al. A biochemical network controlling basal
myosin oscillation. Nature Communications. 2018;9(1). doi:10.1038/s41467-018-03574-5
apa: Qin, X., Hannezo, E. B., Mangeat, T., Liu, C., Majumder, P., Liu, J., … Wang,
X. (2018). A biochemical network controlling basal myosin oscillation. Nature
Communications. Nature Publishing Group. https://doi.org/10.1038/s41467-018-03574-5
chicago: Qin, Xiang, Edouard B Hannezo, Thomas Mangeat, Chang Liu, Pralay Majumder,
Jjiaying Liu, Valerie Choesmel Cadamuro, et al. “A Biochemical Network Controlling
Basal Myosin Oscillation.” Nature Communications. Nature Publishing Group,
2018. https://doi.org/10.1038/s41467-018-03574-5.
ieee: X. Qin et al., “A biochemical network controlling basal myosin oscillation,”
Nature Communications, vol. 9, no. 1. Nature Publishing Group, 2018.
ista: Qin X, Hannezo EB, Mangeat T, Liu C, Majumder P, Liu J, Choesmel Cadamuro
V, Mcdonald J, Liu Y, Yi B, Wang X. 2018. A biochemical network controlling basal
myosin oscillation. Nature Communications. 9(1), 1210.
mla: Qin, Xiang, et al. “A Biochemical Network Controlling Basal Myosin Oscillation.”
Nature Communications, vol. 9, no. 1, 1210, Nature Publishing Group, 2018,
doi:10.1038/s41467-018-03574-5.
short: X. Qin, E.B. Hannezo, T. Mangeat, C. Liu, P. Majumder, J. Liu, V. Choesmel
Cadamuro, J. Mcdonald, Y. Liu, B. Yi, X. Wang, Nature Communications 9 (2018).
date_created: 2018-12-11T11:46:16Z
date_published: 2018-03-23T00:00:00Z
date_updated: 2023-09-08T11:41:45Z
day: '23'
ddc:
- '539'
- '570'
department:
- _id: EdHa
doi: 10.1038/s41467-018-03574-5
external_id:
isi:
- '000428165400009'
file:
- access_level: open_access
checksum: 87a427bc2e8724be3dd22a4efdd21a33
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:45Z
date_updated: 2020-07-14T12:46:22Z
file_id: '4902'
file_name: IST-2018-996-v1+1_2018_Hannezo_A-biochemical.pdf
file_size: 3780491
relation: main_file
file_date_updated: 2020-07-14T12:46:22Z
has_accepted_license: '1'
intvolume: ' 9'
isi: 1
issue: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
publication: Nature Communications
publication_status: published
publisher: Nature Publishing Group
publist_id: '7427'
pubrep_id: '996'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A biochemical network controlling basal myosin oscillation
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 9
year: '2018'
...
---
_id: '318'
abstract:
- lang: eng
text: The insect’s fat body combines metabolic and immunological functions. In this
issue of Developmental Cell, Franz et al. (2018) show that in Drosophila, cells
of the fat body are not static, but can actively “swim” toward sites of epithelial
injury, where they physically clog the wound and locally secrete antimicrobial
peptides.
acknowledgement: Short Survey
article_processing_charge: No
author:
- first_name: Alessandra M
full_name: Casano, Alessandra M
id: 3DBA3F4E-F248-11E8-B48F-1D18A9856A87
last_name: Casano
orcid: 0000-0002-6009-6804
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
citation:
ama: Casano AM, Sixt MK. A fat lot of good for wound healing. Developmental Cell.
2018;44(4):405-406. doi:10.1016/j.devcel.2018.02.009
apa: Casano, A. M., & Sixt, M. K. (2018). A fat lot of good for wound healing.
Developmental Cell. Cell Press. https://doi.org/10.1016/j.devcel.2018.02.009
chicago: Casano, Alessandra M, and Michael K Sixt. “A Fat Lot of Good for Wound
Healing.” Developmental Cell. Cell Press, 2018. https://doi.org/10.1016/j.devcel.2018.02.009.
ieee: A. M. Casano and M. K. Sixt, “A fat lot of good for wound healing,” Developmental
Cell, vol. 44, no. 4. Cell Press, pp. 405–406, 2018.
ista: Casano AM, Sixt MK. 2018. A fat lot of good for wound healing. Developmental
Cell. 44(4), 405–406.
mla: Casano, Alessandra M., and Michael K. Sixt. “A Fat Lot of Good for Wound Healing.”
Developmental Cell, vol. 44, no. 4, Cell Press, 2018, pp. 405–06, doi:10.1016/j.devcel.2018.02.009.
short: A.M. Casano, M.K. Sixt, Developmental Cell 44 (2018) 405–406.
date_created: 2018-12-11T11:45:47Z
date_published: 2018-02-26T00:00:00Z
date_updated: 2023-09-08T11:42:28Z
day: '26'
department:
- _id: MiSi
doi: 10.1016/j.devcel.2018.02.009
external_id:
isi:
- '000426150700002'
pmid:
- '29486189'
intvolume: ' 44'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pubmed/29486189
month: '02'
oa: 1
oa_version: Published Version
page: 405 - 406
pmid: 1
publication: Developmental Cell
publication_status: published
publisher: Cell Press
publist_id: '7547'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A fat lot of good for wound healing
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 44
year: '2018'
...
---
_id: '410'
abstract:
- lang: eng
text: Lesion verification and quantification is traditionally done via histological
examination of sectioned brains, a time-consuming process that relies heavily
on manual estimation. Such methods are particularly problematic in posterior cortical
regions (e.g. visual cortex), where sectioning leads to significant damage and
distortion of tissue. Even more challenging is the post hoc localization of micro-electrodes,
which relies on the same techniques, suffers from similar drawbacks and requires
even higher precision. Here, we propose a new, simple method for quantitative
lesion characterization and electrode localization that is less labor-intensive
and yields more detailed results than conventional methods. We leverage staining
techniques standard in electron microscopy with the use of commodity micro-CT
imaging. We stain whole rat and zebra finch brains in osmium tetroxide, embed
these in resin and scan entire brains in a micro-CT machine. The scans result
in 3D reconstructions of the brains with section thickness dependent on sample
size (12–15 and 5–6 microns for rat and zebra finch respectively) that can be
segmented manually or automatically. Because the method captures the entire intact
brain volume, comparisons within and across studies are more tractable, and the
extent of lesions and electrodes may be studied with higher accuracy than with
current methods.
article_number: '5184'
article_processing_charge: No
author:
- first_name: Javier
full_name: Masís, Javier
last_name: Masís
- first_name: David
full_name: Mankus, David
last_name: Mankus
- first_name: Steffen
full_name: Wolff, Steffen
last_name: Wolff
- first_name: Grigori
full_name: Guitchounts, Grigori
last_name: Guitchounts
- first_name: Maximilian A
full_name: Jösch, Maximilian A
id: 2BD278E6-F248-11E8-B48F-1D18A9856A87
last_name: Jösch
orcid: 0000-0002-3937-1330
- first_name: David
full_name: Cox, David
last_name: Cox
citation:
ama: Masís J, Mankus D, Wolff S, Guitchounts G, Jösch MA, Cox D. A micro-CT-based
method for quantitative brain lesion characterization and electrode localization.
Scientific Reports. 2018;8(1). doi:10.1038/s41598-018-23247-z
apa: Masís, J., Mankus, D., Wolff, S., Guitchounts, G., Jösch, M. A., & Cox,
D. (2018). A micro-CT-based method for quantitative brain lesion characterization
and electrode localization. Scientific Reports. Nature Publishing Group.
https://doi.org/10.1038/s41598-018-23247-z
chicago: Masís, Javier, David Mankus, Steffen Wolff, Grigori Guitchounts, Maximilian
A Jösch, and David Cox. “A Micro-CT-Based Method for Quantitative Brain Lesion
Characterization and Electrode Localization.” Scientific Reports. Nature
Publishing Group, 2018. https://doi.org/10.1038/s41598-018-23247-z.
ieee: J. Masís, D. Mankus, S. Wolff, G. Guitchounts, M. A. Jösch, and D. Cox, “A
micro-CT-based method for quantitative brain lesion characterization and electrode
localization,” Scientific Reports, vol. 8, no. 1. Nature Publishing Group,
2018.
ista: Masís J, Mankus D, Wolff S, Guitchounts G, Jösch MA, Cox D. 2018. A micro-CT-based
method for quantitative brain lesion characterization and electrode localization.
Scientific Reports. 8(1), 5184.
mla: Masís, Javier, et al. “A Micro-CT-Based Method for Quantitative Brain Lesion
Characterization and Electrode Localization.” Scientific Reports, vol.
8, no. 1, 5184, Nature Publishing Group, 2018, doi:10.1038/s41598-018-23247-z.
short: J. Masís, D. Mankus, S. Wolff, G. Guitchounts, M.A. Jösch, D. Cox, Scientific
Reports 8 (2018).
date_created: 2018-12-11T11:46:19Z
date_published: 2018-03-26T00:00:00Z
date_updated: 2023-09-08T11:48:39Z
day: '26'
ddc:
- '571'
- '572'
department:
- _id: MaJö
doi: 10.1038/s41598-018-23247-z
external_id:
isi:
- '000428234100005'
file:
- access_level: open_access
checksum: 653fcb852f899c75b00ceee2a670d738
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:42Z
date_updated: 2020-07-14T12:46:23Z
file_id: '4831'
file_name: IST-2018-994-v1+1_2018_Joesch_A-micro-CT-based.pdf
file_size: 2359430
relation: main_file
file_date_updated: 2020-07-14T12:46:23Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
issue: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
publication: Scientific Reports
publication_status: published
publisher: Nature Publishing Group
publist_id: '7419'
pubrep_id: '994'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A micro-CT-based method for quantitative brain lesion characterization and
electrode localization
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 8
year: '2018'
...
---
_id: '277'
abstract:
- lang: eng
text: 'Arabidopsis and human ARM protein interact with telomerase. Deregulated mRNA
levels of DNA repair and ribosomal protein genes in an Arabidopsis arm mutant
suggest non-telomeric ARM function. The human homolog ARMC6 interacts with hTRF2.
Abstract: Telomerase maintains telomeres and has proposed non-telomeric functions.
We previously identified interaction of the C-terminal domain of Arabidopsis telomerase
reverse transcriptase (AtTERT) with an armadillo/β-catenin-like repeat (ARM) containing
protein. Here we explore protein–protein interactions of the ARM protein, AtTERT
domains, POT1a, TRF-like family and SMH family proteins, and the chromatin remodeling
protein CHR19 using bimolecular fluorescence complementation (BiFC), yeast two-hybrid
(Y2H) analysis, and co-immunoprecipitation. The ARM protein interacts with both
the N- and C-terminal domains of AtTERT in different cellular compartments. ARM
interacts with CHR19 and TRF-like I family proteins that also bind AtTERT directly
or through interaction with POT1a. The putative human ARM homolog co-precipitates
telomerase activity and interacts with hTRF2 protein in vitro. Analysis of Arabidopsis
arm mutants shows no obvious changes in telomere length or telomerase activity,
suggesting that ARM is not essential for telomere maintenance. The observed interactions
with telomerase and Myb-like domain proteins (TRF-like family I) may therefore
reflect possible non-telomeric functions. Transcript levels of several DNA repair
and ribosomal genes are affected in arm mutants, and ARM, likely in association
with other proteins, suppressed expression of XRCC3 and RPSAA promoter constructs
in luciferase reporter assays. In conclusion, ARM can participate in non-telomeric
functions of telomerase, and can also perform its own telomerase-independent functions.'
article_processing_charge: No
article_type: original
author:
- first_name: Ladislav
full_name: Dokládal, Ladislav
last_name: Dokládal
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
- first_name: David
full_name: Honys, David
last_name: Honys
- first_name: Nikoleta
full_name: Dupláková, Nikoleta
last_name: Dupláková
- first_name: Lan
full_name: Lee, Lan
last_name: Lee
- first_name: Stanton
full_name: Gelvin, Stanton
last_name: Gelvin
- first_name: Eva
full_name: Sýkorová, Eva
last_name: Sýkorová
citation:
ama: Dokládal L, Benková E, Honys D, et al. An armadillo-domain protein participates
in a telomerase interaction network. Plant Molecular Biology. 2018;97(5):407-420.
doi:10.1007/s11103-018-0747-4
apa: Dokládal, L., Benková, E., Honys, D., Dupláková, N., Lee, L., Gelvin, S., &
Sýkorová, E. (2018). An armadillo-domain protein participates in a telomerase
interaction network. Plant Molecular Biology. Springer. https://doi.org/10.1007/s11103-018-0747-4
chicago: Dokládal, Ladislav, Eva Benková, David Honys, Nikoleta Dupláková, Lan Lee,
Stanton Gelvin, and Eva Sýkorová. “An Armadillo-Domain Protein Participates in
a Telomerase Interaction Network.” Plant Molecular Biology. Springer, 2018.
https://doi.org/10.1007/s11103-018-0747-4.
ieee: L. Dokládal et al., “An armadillo-domain protein participates in a
telomerase interaction network,” Plant Molecular Biology, vol. 97, no.
5. Springer, pp. 407–420, 2018.
ista: Dokládal L, Benková E, Honys D, Dupláková N, Lee L, Gelvin S, Sýkorová E.
2018. An armadillo-domain protein participates in a telomerase interaction network.
Plant Molecular Biology. 97(5), 407–420.
mla: Dokládal, Ladislav, et al. “An Armadillo-Domain Protein Participates in a Telomerase
Interaction Network.” Plant Molecular Biology, vol. 97, no. 5, Springer,
2018, pp. 407–20, doi:10.1007/s11103-018-0747-4.
short: L. Dokládal, E. Benková, D. Honys, N. Dupláková, L. Lee, S. Gelvin, E. Sýkorová,
Plant Molecular Biology 97 (2018) 407–420.
date_created: 2018-12-11T11:45:34Z
date_published: 2018-06-12T00:00:00Z
date_updated: 2023-09-08T13:21:05Z
day: '12'
ddc:
- '580'
department:
- _id: EvBe
doi: 10.1007/s11103-018-0747-4
external_id:
isi:
- '000438981700009'
file:
- access_level: open_access
checksum: 451ae47616e6af2533099f596b2a47fb
content_type: application/pdf
creator: dernst
date_created: 2020-05-14T12:23:08Z
date_updated: 2020-07-14T12:45:45Z
file_id: '7834'
file_name: 2018_PlantMolecBio_Dokladal.pdf
file_size: 1150679
relation: main_file
file_date_updated: 2020-07-14T12:45:45Z
has_accepted_license: '1'
intvolume: ' 97'
isi: 1
issue: '5'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 407 - 420
publication: Plant Molecular Biology
publication_status: published
publisher: Springer
publist_id: '7625'
quality_controlled: '1'
scopus_import: '1'
status: public
title: An armadillo-domain protein participates in a telomerase interaction network
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 97
year: '2018'
...