---
_id: '5906'
abstract:
- lang: eng
text: We introduce a simple, exactly solvable strong-randomness renormalization
group (RG) model for the many-body localization (MBL) transition in one dimension.
Our approach relies on a family of RG flows parametrized by the asymmetry between
thermal and localized phases. We identify the physical MBL transition in the limit
of maximal asymmetry, reflecting the instability of MBL against rare thermal inclusions.
We find a critical point that is localized with power-law distributed thermal
inclusions. The typical size of critical inclusions remains finite at the transition,
while the average size is logarithmically diverging. We propose a two-parameter
scaling theory for the many-body localization transition that falls into the Kosterlitz-Thouless
universality class, with the MBL phase corresponding to a stable line of fixed
points with multifractal behavior.
article_number: '040601'
article_processing_charge: No
article_type: original
author:
- first_name: Anna
full_name: Goremykina, Anna
last_name: Goremykina
- first_name: Romain
full_name: Vasseur, Romain
last_name: Vasseur
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
citation:
ama: Goremykina A, Vasseur R, Serbyn M. Analytically solvable renormalization group
for the many-body localization transition. Physical Review Letters. 2019;122(4).
doi:10.1103/physrevlett.122.040601
apa: Goremykina, A., Vasseur, R., & Serbyn, M. (2019). Analytically solvable
renormalization group for the many-body localization transition. Physical Review
Letters. American Physical Society. https://doi.org/10.1103/physrevlett.122.040601
chicago: Goremykina, Anna, Romain Vasseur, and Maksym Serbyn. “Analytically Solvable
Renormalization Group for the Many-Body Localization Transition.” Physical
Review Letters. American Physical Society, 2019. https://doi.org/10.1103/physrevlett.122.040601.
ieee: A. Goremykina, R. Vasseur, and M. Serbyn, “Analytically solvable renormalization
group for the many-body localization transition,” Physical Review Letters,
vol. 122, no. 4. American Physical Society, 2019.
ista: Goremykina A, Vasseur R, Serbyn M. 2019. Analytically solvable renormalization
group for the many-body localization transition. Physical Review Letters. 122(4),
040601.
mla: Goremykina, Anna, et al. “Analytically Solvable Renormalization Group for the
Many-Body Localization Transition.” Physical Review Letters, vol. 122,
no. 4, 040601, American Physical Society, 2019, doi:10.1103/physrevlett.122.040601.
short: A. Goremykina, R. Vasseur, M. Serbyn, Physical Review Letters 122 (2019).
date_created: 2019-02-01T08:22:28Z
date_published: 2019-02-01T00:00:00Z
date_updated: 2024-02-28T13:13:38Z
day: '01'
department:
- _id: MaSe
doi: 10.1103/physrevlett.122.040601
external_id:
arxiv:
- '1807.04285'
isi:
- '000456783700001'
intvolume: ' 122'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1807.04285
month: '02'
oa: 1
oa_version: Preprint
publication: Physical Review Letters
publication_identifier:
eissn:
- 1079-7114
issn:
- 0031-9007
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Analytically solvable renormalization group for the many-body localization
transition
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 122
year: '2019'
...
---
_id: '6632'
abstract:
- lang: eng
text: We consider a two-component Bose gas in two dimensions at a low temperature
with short-range repulsive interaction. In the coexistence phase where both components
are superfluid, interspecies interactions induce a nondissipative drag between
the two superfluid flows (Andreev-Bashkin effect). We show that this behavior
leads to a modification of the usual Berezinskii-Kosterlitz-Thouless (BKT) transition
in two dimensions. We extend the renormalization of the superfluid densities at
finite temperature using the renormalization-group approach and find that the
vortices of one component have a large influence on the superfluid properties
of the other, mediated by the nondissipative drag. The extended BKT flow equations indicate that the occurrence of the
vortex unbinding transition in one of the components can induce the breakdown
of superfluidity also in the other, leading to a locking phenomenon for the critical
temperatures of the two gases.
article_number: '063627'
article_processing_charge: No
author:
- first_name: Volker
full_name: Karle, Volker
last_name: Karle
- first_name: Nicolò
full_name: Defenu, Nicolò
last_name: Defenu
- first_name: Tilman
full_name: Enss, Tilman
last_name: Enss
citation:
ama: Karle V, Defenu N, Enss T. Coupled superfluidity of binary Bose mixtures in
two dimensions. Physical Review A. 2019;99(6). doi:10.1103/PhysRevA.99.063627
apa: Karle, V., Defenu, N., & Enss, T. (2019). Coupled superfluidity of binary
Bose mixtures in two dimensions. Physical Review A. American Physical Society.
https://doi.org/10.1103/PhysRevA.99.063627
chicago: Karle, Volker, Nicolò Defenu, and Tilman Enss. “Coupled Superfluidity of
Binary Bose Mixtures in Two Dimensions.” Physical Review A. American Physical
Society, 2019. https://doi.org/10.1103/PhysRevA.99.063627.
ieee: V. Karle, N. Defenu, and T. Enss, “Coupled superfluidity of binary Bose mixtures
in two dimensions,” Physical Review A, vol. 99, no. 6. American Physical
Society, 2019.
ista: Karle V, Defenu N, Enss T. 2019. Coupled superfluidity of binary Bose mixtures
in two dimensions. Physical Review A. 99(6), 063627.
mla: Karle, Volker, et al. “Coupled Superfluidity of Binary Bose Mixtures in Two
Dimensions.” Physical Review A, vol. 99, no. 6, 063627, American Physical
Society, 2019, doi:10.1103/PhysRevA.99.063627.
short: V. Karle, N. Defenu, T. Enss, Physical Review A 99 (2019).
date_created: 2019-07-14T21:59:17Z
date_published: 2019-06-28T00:00:00Z
date_updated: 2024-02-28T13:12:34Z
day: '28'
department:
- _id: MiLe
doi: 10.1103/PhysRevA.99.063627
external_id:
arxiv:
- '1903.06759'
isi:
- '000473133600007'
intvolume: ' 99'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1903.06759
month: '06'
oa: 1
oa_version: Preprint
publication: Physical Review A
publication_identifier:
eissn:
- '24699934'
issn:
- '24699926'
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Coupled superfluidity of binary Bose mixtures in two dimensions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 99
year: '2019'
...
---
_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: '15147'
abstract:
- lang: eng
text: Circadian rhythms are generated by a transcription-based feedback loop where
CLOCK:BMAL1 drive transcription of their repressors (PER1/2, CRY1/2), which bind
to CLOCK:BMAL1 to close the feedback loop with ~24-hour periodicity. Here we identify
a key biochemical and structural difference between CRY1 and CRY2 that underlies
their differential strengths as transcriptional repressors. While both cryptochromes
bind the BMAL1 transactivation domain with similar affinity to sequester it from
coactivators, CRY1 is recruited with much higher affinity to the PAS domain core
of CLOCK:BMAL1, allowing it to serve as a stronger repressor that lengthens circadian
period. We identify a dynamic loop in the secondary pocket that regulates differential
binding of cryptochromes to the PAS domain core. Notably, PER2 binding remodels
this loop in CRY2 to enhance its affinity for CLOCK:BMAL1, explaining why CRY2
forms an obligate heterodimer with PER2, while CRY1 is capable of repressing CLOCK:BMAL1
both with and without PER2.
article_processing_charge: No
author:
- first_name: Jennifer L.
full_name: Fribourgh, Jennifer L.
last_name: Fribourgh
- first_name: Ashutosh
full_name: Srivastava, Ashutosh
last_name: Srivastava
- first_name: Colby R.
full_name: Sandate, Colby R.
last_name: Sandate
- first_name: Alicia
full_name: Michael, Alicia
id: 6437c950-2a03-11ee-914d-d6476dd7b75c
last_name: Michael
orcid: 0000-0002-6080-839X
- first_name: Peter L.
full_name: Hsu, Peter L.
last_name: Hsu
- first_name: Christin
full_name: Rakers, Christin
last_name: Rakers
- first_name: Leslee T.
full_name: Nguyen, Leslee T.
last_name: Nguyen
- first_name: Megan R.
full_name: Torgrimson, Megan R.
last_name: Torgrimson
- first_name: Gian Carlo G.
full_name: Parico, Gian Carlo G.
last_name: Parico
- first_name: Sarvind
full_name: Tripathi, Sarvind
last_name: Tripathi
- first_name: Ning
full_name: Zheng, Ning
last_name: Zheng
- first_name: Gabriel C.
full_name: Lander, Gabriel C.
last_name: Lander
- first_name: Tsuyoshi
full_name: Hirota, Tsuyoshi
last_name: Hirota
- first_name: Florence
full_name: Tama, Florence
last_name: Tama
- first_name: Carrie L.
full_name: Partch, Carrie L.
last_name: Partch
citation:
ama: Fribourgh JL, Srivastava A, Sandate CR, et al. Protein dynamics regulate distinct
biochemical properties of cryptochromes in mammalian circadian rhythms. bioRxiv.
2019. doi:10.1101/740464
apa: Fribourgh, J. L., Srivastava, A., Sandate, C. R., Michael, A. K., Hsu, P. L.,
Rakers, C., … Partch, C. L. (2019). Protein dynamics regulate distinct biochemical
properties of cryptochromes in mammalian circadian rhythms. bioRxiv. https://doi.org/10.1101/740464
chicago: Fribourgh, Jennifer L., Ashutosh Srivastava, Colby R. Sandate, Alicia K.
Michael, Peter L. Hsu, Christin Rakers, Leslee T. Nguyen, et al. “Protein Dynamics
Regulate Distinct Biochemical Properties of Cryptochromes in Mammalian Circadian
Rhythms.” BioRxiv, 2019. https://doi.org/10.1101/740464.
ieee: J. L. Fribourgh et al., “Protein dynamics regulate distinct biochemical
properties of cryptochromes in mammalian circadian rhythms,” bioRxiv. 2019.
ista: Fribourgh JL, Srivastava A, Sandate CR, Michael AK, Hsu PL, Rakers C, Nguyen
LT, Torgrimson MR, Parico GCG, Tripathi S, Zheng N, Lander GC, Hirota T, Tama
F, Partch CL. 2019. Protein dynamics regulate distinct biochemical properties
of cryptochromes in mammalian circadian rhythms. bioRxiv, 10.1101/740464.
mla: Fribourgh, Jennifer L., et al. “Protein Dynamics Regulate Distinct Biochemical
Properties of Cryptochromes in Mammalian Circadian Rhythms.” BioRxiv, 2019,
doi:10.1101/740464.
short: J.L. Fribourgh, A. Srivastava, C.R. Sandate, A.K. Michael, P.L. Hsu, C. Rakers,
L.T. Nguyen, M.R. Torgrimson, G.C.G. Parico, S. Tripathi, N. Zheng, G.C. Lander,
T. Hirota, F. Tama, C.L. Partch, BioRxiv (2019).
date_created: 2024-03-21T07:51:10Z
date_published: 2019-08-20T00:00:00Z
date_updated: 2024-03-25T12:44:44Z
day: '20'
doi: 10.1101/740464
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/740464
month: '08'
oa: 1
oa_version: None
publication: bioRxiv
publication_status: published
status: public
title: Protein dynamics regulate distinct biochemical properties of cryptochromes
in mammalian circadian rhythms
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
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
license: https://creativecommons.org/licenses/by/4.0/
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-27T23: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-27T23: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-27T23:30:11Z
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-27T23:30:13Z
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-27T23:30:14Z
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-27T23: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-27T23: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-27T23: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-27T23:30:22Z
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-27T23:30:26Z
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-27T23:30:29Z
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-27T23:30:33Z
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-27T23: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-27T23: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-27T23:30:33Z
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-27T23:30:33Z
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-27T23:30:33Z
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-27T23: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-27T23:30:33Z
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-27T23:30:35Z
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-27T23:30:35Z
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-27T23:30:37Z
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-27T23:30:38Z
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-27T23:30:38Z
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-27T23:30:39Z
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-27T23: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-27T23:30:41Z
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-27T23:30:43Z
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-27T23:30:46Z
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-27T23:30:47Z
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: '10362'
abstract:
- lang: eng
text: Nuclear pore complexes (NPCs) form gateways that control molecular exchange
between the nucleus and the cytoplasm. They impose a diffusion barrier to macromolecules
and enable the selective transport of nuclear transport receptors with bound cargo.
The underlying mechanisms that establish these permeability properties remain
to be fully elucidated but require unstructured nuclear pore proteins rich in
Phe-Gly (FG)-repeat domains of different types, such as FxFG and GLFG. While physical
modeling and in vitro approaches have provided a framework for explaining how
the FG network contributes to the barrier and transport properties of the NPC,
it remains unknown whether the number and/or the spatial positioning of different
FG-domains along a cylindrical, ∼40 nm diameter transport channel contributes
to their collective properties and function. To begin to answer these questions,
we have used DNA origami to build a cylinder that mimics the dimensions of the
central transport channel and can house a specified number of FG-domains at specific
positions with easily tunable design parameters, such as grafting density and
topology. We find the overall morphology of the FG-domain assemblies to be dependent
on their chemical composition, determined by the type and density of FG-repeat,
and on their architectural confinement provided by the DNA cylinder, largely consistent
with here presented molecular dynamics simulations based on a coarse-grained polymer
model. In addition, high-speed atomic force microscopy reveals local and reversible
FG-domain condensation that transiently occludes the lumen of the DNA central
channel mimics, suggestive of how the NPC might establish its permeability properties.
acknowledgement: We thank J. Edel and members of the Lusk, Lin and Hoogenboom lab
for discussion and acknowledge A. Pyne and R. Thorogate for support carrying out
the AFM experiments. This work was funded by the NIH (R21GM109466 to CPL, CL and
TJM, DP2GM114830 to CL, RO1GM105672 to CPL, and T32GM007223 to PDEF) and the UK
Engineering and Physical Sciences Research Council (EP/L015277/1, EP/L504889/1,
and EP/M028100/1).
article_processing_charge: No
article_type: original
author:
- first_name: Patrick D. Ellis
full_name: Fisher, Patrick D. Ellis
last_name: Fisher
- first_name: Qi
full_name: Shen, Qi
last_name: Shen
- first_name: Bernice
full_name: Akpinar, Bernice
last_name: Akpinar
- first_name: Luke K.
full_name: Davis, Luke K.
last_name: Davis
- first_name: Kenny Kwok Hin
full_name: Chung, Kenny Kwok Hin
last_name: Chung
- first_name: David
full_name: Baddeley, David
last_name: Baddeley
- first_name: Anđela
full_name: Šarić, Anđela
id: bf63d406-f056-11eb-b41d-f263a6566d8b
last_name: Šarić
orcid: 0000-0002-7854-2139
- first_name: Thomas J.
full_name: Melia, Thomas J.
last_name: Melia
- first_name: Bart W.
full_name: Hoogenboom, Bart W.
last_name: Hoogenboom
- first_name: Chenxiang
full_name: Lin, Chenxiang
last_name: Lin
- first_name: C. Patrick
full_name: Lusk, C. Patrick
last_name: Lusk
citation:
ama: Fisher PDE, Shen Q, Akpinar B, et al. A Programmable DNA origami platform for
organizing intrinsically disordered nucleoporins within nanopore confinement.
ACS Nano. 2018;12(2):1508-1518. doi:10.1021/acsnano.7b08044
apa: Fisher, P. D. E., Shen, Q., Akpinar, B., Davis, L. K., Chung, K. K. H., Baddeley,
D., … Lusk, C. P. (2018). A Programmable DNA origami platform for organizing intrinsically
disordered nucleoporins within nanopore confinement. ACS Nano. American
Chemical Society. https://doi.org/10.1021/acsnano.7b08044
chicago: Fisher, Patrick D. Ellis, Qi Shen, Bernice Akpinar, Luke K. Davis, Kenny
Kwok Hin Chung, David Baddeley, Anđela Šarić, et al. “A Programmable DNA Origami
Platform for Organizing Intrinsically Disordered Nucleoporins within Nanopore
Confinement.” ACS Nano. American Chemical Society, 2018. https://doi.org/10.1021/acsnano.7b08044.
ieee: P. D. E. Fisher et al., “A Programmable DNA origami platform for organizing
intrinsically disordered nucleoporins within nanopore confinement,” ACS Nano,
vol. 12, no. 2. American Chemical Society, pp. 1508–1518, 2018.
ista: Fisher PDE, Shen Q, Akpinar B, Davis LK, Chung KKH, Baddeley D, Šarić A, Melia
TJ, Hoogenboom BW, Lin C, Lusk CP. 2018. A Programmable DNA origami platform for
organizing intrinsically disordered nucleoporins within nanopore confinement.
ACS Nano. 12(2), 1508–1518.
mla: Fisher, Patrick D. Ellis, et al. “A Programmable DNA Origami Platform for Organizing
Intrinsically Disordered Nucleoporins within Nanopore Confinement.” ACS Nano,
vol. 12, no. 2, American Chemical Society, 2018, pp. 1508–18, doi:10.1021/acsnano.7b08044.
short: P.D.E. Fisher, Q. Shen, B. Akpinar, L.K. Davis, K.K.H. Chung, D. Baddeley,
A. Šarić, T.J. Melia, B.W. Hoogenboom, C. Lin, C.P. Lusk, ACS Nano 12 (2018) 1508–1518.
date_created: 2021-11-26T15:15:00Z
date_published: 2018-01-19T00:00:00Z
date_updated: 2021-11-26T15:57:02Z
day: '19'
doi: 10.1021/acsnano.7b08044
extern: '1'
external_id:
pmid:
- '29350911'
intvolume: ' 12'
issue: '2'
keyword:
- general physics and astronomy
language:
- iso: eng
month: '01'
oa_version: None
page: 1508-1518
pmid: 1
publication: ACS Nano
publication_identifier:
eissn:
- 1936-086X
issn:
- 1936-0851
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: A Programmable DNA origami platform for organizing intrinsically disordered
nucleoporins within nanopore confinement
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 12
year: '2018'
...
---
_id: '10360'
abstract:
- lang: eng
text: Mapping free-energy landscapes has proved to be a powerful tool for studying
reaction mechanisms. Many complex biomolecular assembly processes, however, have
remained challenging to access using this approach, including the aggregation
of peptides and proteins into amyloid fibrils implicated in a range of disorders.
Here, we generalize the strategy used to probe free-energy landscapes in protein
folding to determine the activation energies and entropies that characterize each
of the molecular steps in the aggregation of the amyloid-β peptide (Aβ42), which
is associated with Alzheimer’s disease. Our results reveal that interactions between
monomeric Aβ42 and amyloid fibrils during fibril-dependent secondary nucleation
fundamentally reverse the thermodynamic signature of this process relative to
primary nucleation, even though both processes generate aggregates from soluble
peptides. By mapping the energetic and entropic contributions along the reaction
trajectories, we show that the catalytic efficiency of Aβ42 fibril surfaces results
from the enthalpic stabilization of adsorbing peptides in conformations amenable
to nucleation, resulting in a dramatic lowering of the activation energy for nucleation.
acknowledgement: We thank B. Jönsson and I. André for helpful discussions. We acknowledge
financial support from the Schiff Foundation (S.I.A.C.), St John’s College, Cambridge
(S.I.A.C.), the Royal Physiographic Society (R.C.), the Research School FLÄK of
Lund University (S.L., R.C.), the Swedish Research Council (S.L.) and its Linneaus
Centre Organizing Molecular Matter (S.L.), the Crafoord Foundation (S.L.), Alzheimerfonden
(S.L.), the European Research Council (S.L.), NanoLund (S.L.), Knut and Alice Wallenberg
Foundation (S.L.), Peterhouse, Cambridge (T.C.T.M.), the Swiss National Science
Foundation (T.C.T.M.), Magdalene College, Cambridge (A.K.B.), the Leverhulme Trust
(A.K.B.), the Royal Society (A.Š.), the Academy of Medical Sciences (A.Š.), the
Wellcome Trust (C.M.D., T.P.J.K., A.Š.), and the Centre for Misfolding Diseases
(C.M.D., T.P.J.K, M.V.). A.K.B. thanks the Alzheimer Forschung Initiative (AFI).
article_processing_charge: No
article_type: original
author:
- first_name: Samuel I. A.
full_name: Cohen, Samuel I. A.
last_name: Cohen
- first_name: Risto
full_name: Cukalevski, Risto
last_name: Cukalevski
- first_name: Thomas C. T.
full_name: Michaels, Thomas C. T.
last_name: Michaels
- first_name: Anđela
full_name: Šarić, Anđela
id: bf63d406-f056-11eb-b41d-f263a6566d8b
last_name: Šarić
orcid: 0000-0002-7854-2139
- first_name: Mattias
full_name: Törnquist, Mattias
last_name: Törnquist
- first_name: Michele
full_name: Vendruscolo, Michele
last_name: Vendruscolo
- first_name: Christopher M.
full_name: Dobson, Christopher M.
last_name: Dobson
- first_name: Alexander K.
full_name: Buell, Alexander K.
last_name: Buell
- first_name: Tuomas P. J.
full_name: Knowles, Tuomas P. J.
last_name: Knowles
- first_name: Sara
full_name: Linse, Sara
last_name: Linse
citation:
ama: Cohen SIA, Cukalevski R, Michaels TCT, et al. Distinct thermodynamic signatures
of oligomer generation in the aggregation of the amyloid-β peptide. Nature
Chemistry. 2018;10(5):523-531. doi:10.1038/s41557-018-0023-x
apa: Cohen, S. I. A., Cukalevski, R., Michaels, T. C. T., Šarić, A., Törnquist,
M., Vendruscolo, M., … Linse, S. (2018). Distinct thermodynamic signatures of
oligomer generation in the aggregation of the amyloid-β peptide. Nature Chemistry.
Springer Nature. https://doi.org/10.1038/s41557-018-0023-x
chicago: Cohen, Samuel I. A., Risto Cukalevski, Thomas C. T. Michaels, Anđela Šarić,
Mattias Törnquist, Michele Vendruscolo, Christopher M. Dobson, Alexander K. Buell,
Tuomas P. J. Knowles, and Sara Linse. “Distinct Thermodynamic Signatures of Oligomer
Generation in the Aggregation of the Amyloid-β Peptide.” Nature Chemistry.
Springer Nature, 2018. https://doi.org/10.1038/s41557-018-0023-x.
ieee: S. I. A. Cohen et al., “Distinct thermodynamic signatures of oligomer
generation in the aggregation of the amyloid-β peptide,” Nature Chemistry,
vol. 10, no. 5. Springer Nature, pp. 523–531, 2018.
ista: Cohen SIA, Cukalevski R, Michaels TCT, Šarić A, Törnquist M, Vendruscolo M,
Dobson CM, Buell AK, Knowles TPJ, Linse S. 2018. Distinct thermodynamic signatures
of oligomer generation in the aggregation of the amyloid-β peptide. Nature Chemistry.
10(5), 523–531.
mla: Cohen, Samuel I. A., et al. “Distinct Thermodynamic Signatures of Oligomer
Generation in the Aggregation of the Amyloid-β Peptide.” Nature Chemistry,
vol. 10, no. 5, Springer Nature, 2018, pp. 523–31, doi:10.1038/s41557-018-0023-x.
short: S.I.A. Cohen, R. Cukalevski, T.C.T. Michaels, A. Šarić, M. Törnquist, M.
Vendruscolo, C.M. Dobson, A.K. Buell, T.P.J. Knowles, S. Linse, Nature Chemistry
10 (2018) 523–531.
date_created: 2021-11-26T12:41:38Z
date_published: 2018-03-26T00:00:00Z
date_updated: 2021-11-26T15:14:00Z
day: '26'
doi: 10.1038/s41557-018-0023-x
extern: '1'
external_id:
pmid:
- '29581486'
intvolume: ' 10'
issue: '5'
keyword:
- general chemical engineering
- general chemistry
language:
- iso: eng
month: '03'
oa_version: None
page: 523-531
pmid: 1
publication: Nature Chemistry
publication_identifier:
eissn:
- 1755-4349
issn:
- 1755-4330
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Distinct thermodynamic signatures of oligomer generation in the aggregation
of the amyloid-β peptide
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 10
year: '2018'
...
---
_id: '10357'
abstract:
- lang: eng
text: The misfolding and aggregation of proteins into linear fibrils is widespread
in human biology, for example, in connection with amyloid formation and the pathology
of neurodegenerative disorders such as Alzheimer’s and Parkinson’s diseases. The
oligomeric species that are formed in the early stages of protein aggregation
are of great interest, having been linked with the cellular toxicity associated
with these conditions. However, these species are not characterized in any detail
experimentally, and their properties are not well understood. Many of these species
have been found to have approximately spherical morphology and to be held together
by hydrophobic interactions. We present here an analytical statistical mechanical
model of globular oligomer formation from simple idealized amphiphilic protein
monomers and show that this correlates well with Monte Carlo simulations of oligomer
formation. We identify the controlling parameters of the model, which are closely
related to simple quantities that may be fitted directly from experiment. We predict
that globular oligomers are unlikely to form at equilibrium in many polypeptide
systems but instead form transiently in the early stages of amyloid formation.
We contrast the globular model of oligomer formation to a well-established model
of linear oligomer formation, highlighting how the differing ensemble properties
of linear and globular oligomers offer a potential strategy for characterizing
oligomers from experimental measurements.
acknowledgement: We acknowledge support from the Schiff Foundation (A.J.D.), the Royal
Society (A.Š.), the Academy of Medical Sciences and Wellcome Trust (A.Š.), Peterhouse,
Cambridge (T.C.T.M.), the Swiss National Science foundation (T.C.T.M.), the Wellcome
Trust (T.P.J.K.), the Cambridge Centre for Misfolding Diseases (T.P.J.K.), the BBSRC
(T.P.J.K.), the Frances and Augustus Newman foundation (T.P.J.K.). The research
leading to these results has received funding from the European Research Council
under the European Union’s Seventh Framework Programme (Grant FP7/2007-2013) through
the ERC Grant PhysProt (Agreement No. 337969). We thank Daan Frenkel for several
useful discussions.
article_processing_charge: No
article_type: original
author:
- first_name: Alexander J.
full_name: Dear, Alexander J.
last_name: Dear
- first_name: Anđela
full_name: Šarić, Anđela
id: bf63d406-f056-11eb-b41d-f263a6566d8b
last_name: Šarić
orcid: 0000-0002-7854-2139
- first_name: Thomas C. T.
full_name: Michaels, Thomas C. T.
last_name: Michaels
- first_name: Christopher M.
full_name: Dobson, Christopher M.
last_name: Dobson
- first_name: Tuomas P. J.
full_name: Knowles, Tuomas P. J.
last_name: Knowles
citation:
ama: Dear AJ, Šarić A, Michaels TCT, Dobson CM, Knowles TPJ. Statistical mechanics
of globular oligomer formation by protein molecules. The Journal of Physical
Chemistry B. 2018;122(49):11721-11730. doi:10.1021/acs.jpcb.8b07805
apa: Dear, A. J., Šarić, A., Michaels, T. C. T., Dobson, C. M., & Knowles, T.
P. J. (2018). Statistical mechanics of globular oligomer formation by protein
molecules. The Journal of Physical Chemistry B. American Chemical Society.
https://doi.org/10.1021/acs.jpcb.8b07805
chicago: Dear, Alexander J., Anđela Šarić, Thomas C. T. Michaels, Christopher M.
Dobson, and Tuomas P. J. Knowles. “Statistical Mechanics of Globular Oligomer
Formation by Protein Molecules.” The Journal of Physical Chemistry B. American
Chemical Society, 2018. https://doi.org/10.1021/acs.jpcb.8b07805.
ieee: A. J. Dear, A. Šarić, T. C. T. Michaels, C. M. Dobson, and T. P. J. Knowles,
“Statistical mechanics of globular oligomer formation by protein molecules,” The
Journal of Physical Chemistry B, vol. 122, no. 49. American Chemical Society,
pp. 11721–11730, 2018.
ista: Dear AJ, Šarić A, Michaels TCT, Dobson CM, Knowles TPJ. 2018. Statistical
mechanics of globular oligomer formation by protein molecules. The Journal of
Physical Chemistry B. 122(49), 11721–11730.
mla: Dear, Alexander J., et al. “Statistical Mechanics of Globular Oligomer Formation
by Protein Molecules.” The Journal of Physical Chemistry B, vol. 122, no.
49, American Chemical Society, 2018, pp. 11721–30, doi:10.1021/acs.jpcb.8b07805.
short: A.J. Dear, A. Šarić, T.C.T. Michaels, C.M. Dobson, T.P.J. Knowles, The Journal
of Physical Chemistry B 122 (2018) 11721–11730.
date_created: 2021-11-26T11:55:12Z
date_published: 2018-10-18T00:00:00Z
date_updated: 2021-11-26T12:40:02Z
day: '18'
doi: 10.1021/acs.jpcb.8b07805
extern: '1'
external_id:
pmid:
- '30336667'
intvolume: ' 122'
issue: '49'
keyword:
- materials chemistry
language:
- iso: eng
month: '10'
oa_version: None
page: 11721-11730
pmid: 1
publication: The Journal of Physical Chemistry B
publication_identifier:
eissn:
- 1520-5207
issn:
- 1520-6106
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Statistical mechanics of globular oligomer formation by protein molecules
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 122
year: '2018'
...
---
_id: '10359'
abstract:
- lang: eng
text: Biological membranes typically contain a large number of different components
dispersed in small concentrations in the main membrane phase, including proteins,
sugars, and lipids of varying geometrical properties. Most of these components
do not bind the cargo. Here, we show that such “inert” components can be crucial
for the precise control of cross-membrane trafficking. Using a statistical mechanics
model and molecular dynamics simulations, we demonstrate that the presence of
inert membrane components of small isotropic curvatures dramatically influences
cargo endocytosis, even if the total spontaneous curvature of such a membrane
remains unchanged. Curved lipids, such as cholesterol, as well as asymmetrically
included proteins and tethered sugars can, therefore, actively participate in
the control of the membrane trafficking of nanoscopic cargo. We find that even
a low-level expression of curved inert membrane components can determine the membrane
selectivity toward the cargo size and can be used to selectively target membranes
of certain compositions. Our results suggest a robust and general method of controlling
cargo trafficking by adjusting the membrane composition without needing to alter
the concentration of receptors or the average membrane curvature. This study indicates
that cells can prepare for any trafficking event by incorporating curved inert
components in either of the membrane leaflets.
acknowledgement: We acknowledge discussions with Giuseppe Battaglia as well as support
from the Herchel Smith scholarship (T.C.), the CAS PIFI fellowship (T.C.), the UCL
Institute for the Physics of Living Systems (T.C. and A.Š.), the Austrian Academy
of Sciences through a DOC fellowship (P.W.), the European Union Horizon 2020 programme
under ETN grant no. 674979-NANOTRANS and FET grant no. 766972-NANOPHLOW (J.D. and
D.F.), the Engineering and Physical Sciences Research Council (D.F. and A.Š.), the
Academy of Medical Sciences and Wellcome Trust (A.Š.), and the Royal Society (A.Š.).
We thank Claudia Flandoli for help with Figure 1.
article_processing_charge: No
article_type: original
author:
- first_name: Tine
full_name: Curk, Tine
last_name: Curk
- first_name: Peter
full_name: Wirnsberger, Peter
last_name: Wirnsberger
- first_name: Jure
full_name: Dobnikar, Jure
last_name: Dobnikar
- first_name: Daan
full_name: Frenkel, Daan
last_name: Frenkel
- first_name: Anđela
full_name: Šarić, Anđela
id: bf63d406-f056-11eb-b41d-f263a6566d8b
last_name: Šarić
orcid: 0000-0002-7854-2139
citation:
ama: Curk T, Wirnsberger P, Dobnikar J, Frenkel D, Šarić A. Controlling cargo trafficking
in multicomponent membranes. Nano Letters. 2018;18(9):5350-5356. doi:10.1021/acs.nanolett.8b00786
apa: Curk, T., Wirnsberger, P., Dobnikar, J., Frenkel, D., & Šarić, A. (2018).
Controlling cargo trafficking in multicomponent membranes. Nano Letters.
American Chemical Society. https://doi.org/10.1021/acs.nanolett.8b00786
chicago: Curk, Tine, Peter Wirnsberger, Jure Dobnikar, Daan Frenkel, and Anđela
Šarić. “Controlling Cargo Trafficking in Multicomponent Membranes.” Nano Letters.
American Chemical Society, 2018. https://doi.org/10.1021/acs.nanolett.8b00786.
ieee: T. Curk, P. Wirnsberger, J. Dobnikar, D. Frenkel, and A. Šarić, “Controlling
cargo trafficking in multicomponent membranes,” Nano Letters, vol. 18,
no. 9. American Chemical Society, pp. 5350–5356, 2018.
ista: Curk T, Wirnsberger P, Dobnikar J, Frenkel D, Šarić A. 2018. Controlling cargo
trafficking in multicomponent membranes. Nano Letters. 18(9), 5350–5356.
mla: Curk, Tine, et al. “Controlling Cargo Trafficking in Multicomponent Membranes.”
Nano Letters, vol. 18, no. 9, American Chemical Society, 2018, pp. 5350–56,
doi:10.1021/acs.nanolett.8b00786.
short: T. Curk, P. Wirnsberger, J. Dobnikar, D. Frenkel, A. Šarić, Nano Letters
18 (2018) 5350–5356.
date_created: 2021-11-26T12:15:47Z
date_published: 2018-04-18T00:00:00Z
date_updated: 2021-11-26T15:14:08Z
day: '18'
doi: 10.1021/acs.nanolett.8b00786
extern: '1'
external_id:
pmid:
- '29667410'
intvolume: ' 18'
issue: '9'
keyword:
- mechanical engineering
- condensed matter physics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1712.10147
month: '04'
oa: 1
oa_version: Preprint
page: 5350-5356
pmid: 1
publication: Nano Letters
publication_identifier:
eissn:
- 1530-6992
issn:
- 1530-6984
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Controlling cargo trafficking in multicomponent membranes
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 18
year: '2018'
...
---
_id: '10358'
abstract:
- lang: eng
text: Probing reaction mechanisms of supramolecular processes in soft and biological
matter, such as protein aggregation, is inherently challenging. This is because
these processes involve multiple molecular mechanisms that are associated with
the rearrangement of large numbers of weak bonds, resulting in complex free energy
landscapes with many kinetic barriers. Reaction rate measurements at different
temperatures can offer unprecedented insights into the underlying molecular mechanisms.
However, to be able to interpret such measurements, a key challenge is to establish
which properties of the complex free energy landscapes are probed by the reaction
rate. Here, we present a reaction rate theory for supramolecular kinetics based
on Kramers theory of diffusive reactions over multiple kinetic barriers. We find
that reaction rates for protein aggregation are of the Arrhenius–Eyring type and
that the associated activation energies probe only one relevant barrier along
the respective free energy landscapes. We apply this advancement to interpret,
in experiments and in coarse-grained computer simulations, reaction rates of amyloid
aggregation in terms of molecular mechanisms and associated thermodynamic signatures.
These results suggest a practical extension of the concept of rate-determining
steps for complex supramolecular processes and establish a general platform for
probing the underlying energy landscape using kinetic measurements.
acknowledgement: We thank Claudia Flandoli for the help with illustrations.
article_processing_charge: No
article_type: original
author:
- first_name: Thomas C. T.
full_name: Michaels, Thomas C. T.
last_name: Michaels
- first_name: Lucie X.
full_name: Liu, Lucie X.
last_name: Liu
- first_name: Samo
full_name: Curk, Samo
last_name: Curk
- first_name: Peter G.
full_name: Bolhuis, Peter G.
last_name: Bolhuis
- first_name: Anđela
full_name: Šarić, Anđela
id: bf63d406-f056-11eb-b41d-f263a6566d8b
last_name: Šarić
orcid: 0000-0002-7854-2139
- first_name: Tuomas P. J.
full_name: Knowles, Tuomas P. J.
last_name: Knowles
citation:
ama: 'Michaels TCT, Liu LX, Curk S, Bolhuis PG, Šarić A, Knowles TPJ. Reaction rate
theory for supramolecular kinetics: application to protein aggregation. Molecular
Physics. 2018;116(21-22):3055-3065. doi:10.1080/00268976.2018.1474280'
apa: 'Michaels, T. C. T., Liu, L. X., Curk, S., Bolhuis, P. G., Šarić, A., &
Knowles, T. P. J. (2018). Reaction rate theory for supramolecular kinetics: application
to protein aggregation. Molecular Physics. Taylor & Francis. https://doi.org/10.1080/00268976.2018.1474280'
chicago: 'Michaels, Thomas C. T., Lucie X. Liu, Samo Curk, Peter G. Bolhuis, Anđela
Šarić, and Tuomas P. J. Knowles. “Reaction Rate Theory for Supramolecular Kinetics:
Application to Protein Aggregation.” Molecular Physics. Taylor & Francis,
2018. https://doi.org/10.1080/00268976.2018.1474280.'
ieee: 'T. C. T. Michaels, L. X. Liu, S. Curk, P. G. Bolhuis, A. Šarić, and T. P.
J. Knowles, “Reaction rate theory for supramolecular kinetics: application to
protein aggregation,” Molecular Physics, vol. 116, no. 21–22. Taylor &
Francis, pp. 3055–3065, 2018.'
ista: 'Michaels TCT, Liu LX, Curk S, Bolhuis PG, Šarić A, Knowles TPJ. 2018. Reaction
rate theory for supramolecular kinetics: application to protein aggregation. Molecular
Physics. 116(21–22), 3055–3065.'
mla: 'Michaels, Thomas C. T., et al. “Reaction Rate Theory for Supramolecular Kinetics:
Application to Protein Aggregation.” Molecular Physics, vol. 116, no. 21–22,
Taylor & Francis, 2018, pp. 3055–65, doi:10.1080/00268976.2018.1474280.'
short: T.C.T. Michaels, L.X. Liu, S. Curk, P.G. Bolhuis, A. Šarić, T.P.J. Knowles,
Molecular Physics 116 (2018) 3055–3065.
date_created: 2021-11-26T12:08:02Z
date_published: 2018-05-24T00:00:00Z
date_updated: 2021-11-26T12:39:58Z
day: '24'
doi: 10.1080/00268976.2018.1474280
extern: '1'
external_id:
arxiv:
- '1803.04851'
intvolume: ' 116'
issue: 21-22
keyword:
- physical chemistry
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1803.04851
month: '05'
oa: 1
oa_version: Preprint
page: 3055-3065
publication: Molecular Physics
publication_identifier:
eissn:
- 1362-3028
issn:
- 0026-8976
publication_status: published
publisher: Taylor & Francis
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Reaction rate theory for supramolecular kinetics: application to protein aggregation'
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 116
year: '2018'
...
---
_id: '10361'
abstract:
- lang: eng
text: Understanding how normally soluble peptides and proteins aggregate to form
amyloid fibrils is central to many areas of modern biomolecular science, ranging
from the development of functional biomaterials to the design of rational therapeutic
strategies against increasingly prevalent medical conditions such as Alzheimer's
and Parkinson's diseases. As such, there is a great need to develop models to
mechanistically describe how amyloid fibrils are formed from precursor peptides
and proteins. Here we review and discuss how ideas and concepts from chemical
reaction kinetics can help to achieve this objective. In particular, we show how
a combination of theory, experiments, and computer simulations, based on chemical
kinetics, provides a general formalism for uncovering, at the molecular level,
the mechanistic steps that underlie the phenomenon of amyloid fibril formation.
acknowledgement: "We acknowledge support from the Swiss National Science Foundation
(T.C.T.M.); Peterhouse,\r\nCambridge (T.C.T.M.); the Royal Society (A.S.); the Academy
of Medical Sciences (A.S.); the\r\nWellcome Trust (A.S., M.V., C.M.D., T.P.J.K.);
the Cambridge Centre for Misfolding Diseases\r\n(M.V., C.M.D., T.P.J.K.); the Biotechnology
and Biological Sciences Research Council (C.M.D.,\r\nT.P.J.K.); and the Frances
and Augustus Newman Foundation (T.P.J.K.). The research leading\r\nto these results
has received funding from the European Research Council (ERC) under the\r\nEuropean
Union’s Seventh Framework Programme (FP7/2007-2013) through the ERC grant\r\nPhysProt
(337969)."
article_processing_charge: No
article_type: original
author:
- first_name: Thomas C.T.
full_name: Michaels, Thomas C.T.
last_name: Michaels
- first_name: Anđela
full_name: Šarić, Anđela
id: bf63d406-f056-11eb-b41d-f263a6566d8b
last_name: Šarić
orcid: 0000-0002-7854-2139
- first_name: Johnny
full_name: Habchi, Johnny
last_name: Habchi
- first_name: Sean
full_name: Chia, Sean
last_name: Chia
- first_name: Georg
full_name: Meisl, Georg
last_name: Meisl
- first_name: Michele
full_name: Vendruscolo, Michele
last_name: Vendruscolo
- first_name: Christopher M.
full_name: Dobson, Christopher M.
last_name: Dobson
- first_name: Tuomas P.J.
full_name: Knowles, Tuomas P.J.
last_name: Knowles
citation:
ama: Michaels TCT, Šarić A, Habchi J, et al. Chemical kinetics for bridging molecular
mechanisms and macroscopic measurements of amyloid fibril formation. Annual
Review of Physical Chemistry. 2018;69(1):273-298. doi:10.1146/annurev-physchem-050317-021322
apa: Michaels, T. C. T., Šarić, A., Habchi, J., Chia, S., Meisl, G., Vendruscolo,
M., … Knowles, T. P. J. (2018). Chemical kinetics for bridging molecular mechanisms
and macroscopic measurements of amyloid fibril formation. Annual Review of
Physical Chemistry. Annual Reviews. https://doi.org/10.1146/annurev-physchem-050317-021322
chicago: Michaels, Thomas C.T., Anđela Šarić, Johnny Habchi, Sean Chia, Georg Meisl,
Michele Vendruscolo, Christopher M. Dobson, and Tuomas P.J. Knowles. “Chemical
Kinetics for Bridging Molecular Mechanisms and Macroscopic Measurements of Amyloid
Fibril Formation.” Annual Review of Physical Chemistry. Annual Reviews,
2018. https://doi.org/10.1146/annurev-physchem-050317-021322.
ieee: T. C. T. Michaels et al., “Chemical kinetics for bridging molecular
mechanisms and macroscopic measurements of amyloid fibril formation,” Annual
Review of Physical Chemistry, vol. 69, no. 1. Annual Reviews, pp. 273–298,
2018.
ista: Michaels TCT, Šarić A, Habchi J, Chia S, Meisl G, Vendruscolo M, Dobson CM,
Knowles TPJ. 2018. Chemical kinetics for bridging molecular mechanisms and macroscopic
measurements of amyloid fibril formation. Annual Review of Physical Chemistry.
69(1), 273–298.
mla: Michaels, Thomas C. T., et al. “Chemical Kinetics for Bridging Molecular Mechanisms
and Macroscopic Measurements of Amyloid Fibril Formation.” Annual Review of
Physical Chemistry, vol. 69, no. 1, Annual Reviews, 2018, pp. 273–98, doi:10.1146/annurev-physchem-050317-021322.
short: T.C.T. Michaels, A. Šarić, J. Habchi, S. Chia, G. Meisl, M. Vendruscolo,
C.M. Dobson, T.P.J. Knowles, Annual Review of Physical Chemistry 69 (2018) 273–298.
date_created: 2021-11-26T12:52:12Z
date_published: 2018-02-28T00:00:00Z
date_updated: 2021-11-26T15:58:19Z
day: '28'
doi: 10.1146/annurev-physchem-050317-021322
extern: '1'
external_id:
pmid:
- '29490200'
intvolume: ' 69'
issue: '1'
keyword:
- physical and theoretical chemistry
language:
- iso: eng
month: '02'
oa_version: None
page: 273-298
pmid: 1
publication: Annual Review of Physical Chemistry
publication_identifier:
eissn:
- 1545-1593
issn:
- 0066-426X
publication_status: published
publisher: Annual Reviews
quality_controlled: '1'
scopus_import: '1'
status: public
title: Chemical kinetics for bridging molecular mechanisms and macroscopic measurements
of amyloid fibril formation
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 69
year: '2018'
...
---
_id: '10626'
abstract:
- lang: eng
text: "Owing to their wide tunability, multiple internal degrees of freedom, and
low disorder, graphene heterostructures are emerging as a promising experimental
platform for fractional quantum Hall (FQH) studies. Here, we report FQH thermal
activation gap measurements in dual graphite-gated monolayer graphene devices
fabricated in an edgeless Corbino geometry. In devices with substrate-induced
sublattice splitting, we find a tunable crossover between single- and multicomponent
FQH states in the zero energy Landau level. Activation gaps in the single-component
regime show excellent agreement with numerical calculations using a single broadening
parameter \r\nΓ≈7.2K. In the first excited Landau level, in contrast, FQH gaps
are strongly influenced by Landau level mixing, and we observe an unexpected valley-ordered
state at integer filling ν=−4."
acknowledgement: We thank Cory Dean, S. Chen, Y. Zeng, M. Yankowitz, and J. Li for
discussing their unpublished data and for sharing the stack inversion technique.
The authors acknowledge further discussions of the results with I. Sodemann, M.
Zaletel, C. Nayak, and J. Jain. A. F. Y., H. P., H. Z., and E. M. S. were supported
by the ARO under awards 69188PHH and MURI W911NF-17-1-0323. A portion of this work
was performed at the National High Magnetic Field Laboratory, which is supported
by National Science Foundation Cooperative Agreement No. DMR-1644779 and the State
of Florida. K. W. and T. T. acknowledge support from the Elemental Strategy Initiative
conducted by the MEXT, Japan, and JSPS KAKENHI Grant No. JP15K21722. E. M. S. acknowledges
the support of the Elings Prize Fellowship in Science of the California Nanosystems
Institute at the University of California, Santa Barbara. A. F. Y. acknowledges
the support of the David and Lucile Packard Foundation.
article_number: '226801'
article_processing_charge: No
article_type: original
author:
- first_name: Hryhoriy
full_name: Polshyn, Hryhoriy
id: edfc7cb1-526e-11ec-b05a-e6ecc27e4e48
last_name: Polshyn
orcid: 0000-0001-8223-8896
- first_name: H.
full_name: Zhou, H.
last_name: Zhou
- first_name: E. M.
full_name: Spanton, E. M.
last_name: Spanton
- first_name: T.
full_name: Taniguchi, T.
last_name: Taniguchi
- first_name: K.
full_name: Watanabe, K.
last_name: Watanabe
- first_name: A. F.
full_name: Young, A. F.
last_name: Young
citation:
ama: Polshyn H, Zhou H, Spanton EM, Taniguchi T, Watanabe K, Young AF. Quantitative
transport measurements of fractional quantum Hall energy gaps in edgeless graphene
devices. Physical Review Letters. 2018;121(22). doi:10.1103/physrevlett.121.226801
apa: Polshyn, H., Zhou, H., Spanton, E. M., Taniguchi, T., Watanabe, K., & Young,
A. F. (2018). Quantitative transport measurements of fractional quantum Hall energy
gaps in edgeless graphene devices. Physical Review Letters. American Physical
Society. https://doi.org/10.1103/physrevlett.121.226801
chicago: Polshyn, Hryhoriy, H. Zhou, E. M. Spanton, T. Taniguchi, K. Watanabe, and
A. F. Young. “Quantitative Transport Measurements of Fractional Quantum Hall Energy
Gaps in Edgeless Graphene Devices.” Physical Review Letters. American Physical
Society, 2018. https://doi.org/10.1103/physrevlett.121.226801.
ieee: H. Polshyn, H. Zhou, E. M. Spanton, T. Taniguchi, K. Watanabe, and A. F. Young,
“Quantitative transport measurements of fractional quantum Hall energy gaps in
edgeless graphene devices,” Physical Review Letters, vol. 121, no. 22.
American Physical Society, 2018.
ista: Polshyn H, Zhou H, Spanton EM, Taniguchi T, Watanabe K, Young AF. 2018. Quantitative
transport measurements of fractional quantum Hall energy gaps in edgeless graphene
devices. Physical Review Letters. 121(22), 226801.
mla: Polshyn, Hryhoriy, et al. “Quantitative Transport Measurements of Fractional
Quantum Hall Energy Gaps in Edgeless Graphene Devices.” Physical Review Letters,
vol. 121, no. 22, 226801, American Physical Society, 2018, doi:10.1103/physrevlett.121.226801.
short: H. Polshyn, H. Zhou, E.M. Spanton, T. Taniguchi, K. Watanabe, A.F. Young,
Physical Review Letters 121 (2018).
date_created: 2022-01-14T12:15:47Z
date_published: 2018-11-28T00:00:00Z
date_updated: 2022-01-14T13:48:35Z
day: '28'
doi: 10.1103/physrevlett.121.226801
extern: '1'
external_id:
arxiv:
- '1805.04199'
intvolume: ' 121'
issue: '22'
keyword:
- general physics and astronomy
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1805.04199
month: '11'
oa: 1
oa_version: Preprint
publication: Physical Review Letters
publication_identifier:
eissn:
- 1079-7114
issn:
- 0031-9007
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quantitative transport measurements of fractional quantum Hall energy gaps
in edgeless graphene devices
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 121
year: '2018'
...
---
_id: '10627'
abstract:
- lang: eng
text: We present a scanning probe technique for measuring the dynamics of individual
fluxoid transitions in multiply connected superconducting structures. In these
measurements, a small magnetic particle attached to the tip of a silicon cantilever
is scanned over a micron-size superconducting ring fabricated from a thin aluminum
film. We find that near the superconducting transition temperature of the aluminum,
the dissipation and frequency of the cantilever changes significantly at particular
locations where the tip-induced magnetic flux penetrating the ring causes the
two lowest-energy fluxoid states to become nearly degenerate. In this regime,
we show that changes in the cantilever frequency and dissipation are well-described
by a stochastic resonance (SR) process, wherein small oscillations of the cantilever
in the presence of thermally activated phase slips (TAPS) in the ring give rise
to a dynamical force that modifies the mechanical properties of the cantilever.
Using the SR model, we calculate the average fluctuation rate of the TAPS as a
function of temperature over a 32-dB range in frequency, and we compare it to
the Langer-Ambegaokar-McCumber-Halperin theory for TAPS in one-dimensional superconducting
structures.
acknowledgement: "We are grateful to Nadya Mason for useful discussions. This work
was supported by the DOE Basic Energy Sciences under Contract No. DE-SC0012649,
the Department of Physics and the Frederick Seitz Materials Research Laboratory
Central Facilities at the University of Illinois.\r\n"
article_number: '184501'
article_processing_charge: No
article_type: original
author:
- first_name: Hryhoriy
full_name: Polshyn, Hryhoriy
id: edfc7cb1-526e-11ec-b05a-e6ecc27e4e48
last_name: Polshyn
orcid: 0000-0001-8223-8896
- first_name: Tyler R.
full_name: Naibert, Tyler R.
last_name: Naibert
- first_name: Raffi
full_name: Budakian, Raffi
last_name: Budakian
citation:
ama: Polshyn H, Naibert TR, Budakian R. Imaging phase slip dynamics in micron-size
superconducting rings. Physical Review B. 2018;97(18). doi:10.1103/physrevb.97.184501
apa: Polshyn, H., Naibert, T. R., & Budakian, R. (2018). Imaging phase slip
dynamics in micron-size superconducting rings. Physical Review B. American
Physical Society. https://doi.org/10.1103/physrevb.97.184501
chicago: Polshyn, Hryhoriy, Tyler R. Naibert, and Raffi Budakian. “Imaging Phase
Slip Dynamics in Micron-Size Superconducting Rings.” Physical Review B.
American Physical Society, 2018. https://doi.org/10.1103/physrevb.97.184501.
ieee: H. Polshyn, T. R. Naibert, and R. Budakian, “Imaging phase slip dynamics in
micron-size superconducting rings,” Physical Review B, vol. 97, no. 18.
American Physical Society, 2018.
ista: Polshyn H, Naibert TR, Budakian R. 2018. Imaging phase slip dynamics in micron-size
superconducting rings. Physical Review B. 97(18), 184501.
mla: Polshyn, Hryhoriy, et al. “Imaging Phase Slip Dynamics in Micron-Size Superconducting
Rings.” Physical Review B, vol. 97, no. 18, 184501, American Physical Society,
2018, doi:10.1103/physrevb.97.184501.
short: H. Polshyn, T.R. Naibert, R. Budakian, Physical Review B 97 (2018).
date_created: 2022-01-14T13:48:47Z
date_published: 2018-05-08T00:00:00Z
date_updated: 2022-01-14T13:58:24Z
day: '08'
doi: 10.1103/physrevb.97.184501
extern: '1'
external_id:
arxiv:
- '1703.08184'
intvolume: ' 97'
issue: '18'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1703.08184
month: '05'
oa: 1
oa_version: Preprint
publication: Physical Review B
publication_identifier:
eissn:
- 2469-9969
issn:
- 2469-9950
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Imaging phase slip dynamics in micron-size superconducting rings
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 97
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: '1092'
abstract:
- lang: eng
text: 'A graphical model encodes conditional independence relations via the Markov
properties. For an undirected graph these conditional independence relations can
be represented by a simple polytope known as the graph associahedron, which can
be constructed as a Minkowski sum of standard simplices. We show that there is
an analogous polytope for conditional independence relations coming from a regular
Gaussian model, and it can be defined using multiinformation or relative entropy.
For directed acyclic graphical models we give a construction of this polytope
as a Minkowski sum of matroid polytopes. Finally, we apply this geometric insight
to construct a new ordering-based search algorithm for causal inference via directed
acyclic graphical models. '
author:
- first_name: Fatemeh
full_name: Mohammadi, Fatemeh
id: 2C29581E-F248-11E8-B48F-1D18A9856A87
last_name: Mohammadi
- first_name: Caroline
full_name: Uhler, Caroline
id: 49ADD78E-F248-11E8-B48F-1D18A9856A87
last_name: Uhler
orcid: 0000-0002-7008-0216
- first_name: Charles
full_name: Wang, Charles
last_name: Wang
- first_name: Josephine
full_name: Yu, Josephine
last_name: Yu
citation:
ama: Mohammadi F, Uhler C, Wang C, Yu J. Generalized permutohedra from probabilistic
graphical models. SIAM Journal on Discrete Mathematics. 2018;32(1):64-93.
doi:10.1137/16M107894X
apa: Mohammadi, F., Uhler, C., Wang, C., & Yu, J. (2018). Generalized permutohedra
from probabilistic graphical models. SIAM Journal on Discrete Mathematics.
SIAM. https://doi.org/10.1137/16M107894X
chicago: Mohammadi, Fatemeh, Caroline Uhler, Charles Wang, and Josephine Yu. “Generalized
Permutohedra from Probabilistic Graphical Models.” SIAM Journal on Discrete
Mathematics. SIAM, 2018. https://doi.org/10.1137/16M107894X.
ieee: F. Mohammadi, C. Uhler, C. Wang, and J. Yu, “Generalized permutohedra from
probabilistic graphical models,” SIAM Journal on Discrete Mathematics,
vol. 32, no. 1. SIAM, pp. 64–93, 2018.
ista: Mohammadi F, Uhler C, Wang C, Yu J. 2018. Generalized permutohedra from probabilistic
graphical models. SIAM Journal on Discrete Mathematics. 32(1), 64–93.
mla: Mohammadi, Fatemeh, et al. “Generalized Permutohedra from Probabilistic Graphical
Models.” SIAM Journal on Discrete Mathematics, vol. 32, no. 1, SIAM, 2018,
pp. 64–93, doi:10.1137/16M107894X.
short: F. Mohammadi, C. Uhler, C. Wang, J. Yu, SIAM Journal on Discrete Mathematics
32 (2018) 64–93.
date_created: 2018-12-11T11:50:06Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2021-01-12T06:48:13Z
day: '01'
doi: 10.1137/16M107894X
extern: '1'
intvolume: ' 32'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1606.01814
month: '01'
oa: 1
oa_version: Preprint
page: 64-93
publication: SIAM Journal on Discrete Mathematics
publication_status: published
publisher: SIAM
publist_id: '6284'
quality_controlled: '1'
status: public
title: Generalized permutohedra from probabilistic graphical models
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 32
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: '11063'
abstract:
- lang: eng
text: The total number of nuclear pore complexes (NPCs) per nucleus varies greatly
between different cell types and is known to change during cell differentiation
and cell transformation. However, the underlying mechanisms that control how many
nuclear transport channels are assembled into a given nuclear envelope remain
unclear. Here, we report that depletion of the NPC basket protein Tpr, but not
Nup153, dramatically increases the total NPC number in various cell types. This
negative regulation of Tpr occurs via a phosphorylation cascade of extracellular
signal-regulated kinase (ERK), the central kinase of the mitogen-activated protein
kinase (MAPK) pathway. Tpr serves as a scaffold for ERK to phosphorylate the nucleoporin
(Nup) Nup153, which is critical for early stages of NPC biogenesis. Our results
reveal a critical role of the Nup Tpr in coordinating signal transduction pathways
during cell proliferation and the dynamic organization of the nucleus.
article_processing_charge: No
article_type: original
author:
- first_name: Asako
full_name: McCloskey, Asako
last_name: McCloskey
- first_name: Arkaitz
full_name: Ibarra, Arkaitz
last_name: Ibarra
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
citation:
ama: McCloskey A, Ibarra A, Hetzer M. Tpr regulates the total number of nuclear
pore complexes per cell nucleus. Genes & Development. 2018;32(19-20):1321-1331.
doi:10.1101/gad.315523.118
apa: McCloskey, A., Ibarra, A., & Hetzer, M. (2018). Tpr regulates the total
number of nuclear pore complexes per cell nucleus. Genes & Development.
Cold Spring Harbor Laboratory. https://doi.org/10.1101/gad.315523.118
chicago: McCloskey, Asako, Arkaitz Ibarra, and Martin Hetzer. “Tpr Regulates the
Total Number of Nuclear Pore Complexes per Cell Nucleus.” Genes & Development.
Cold Spring Harbor Laboratory, 2018. https://doi.org/10.1101/gad.315523.118.
ieee: A. McCloskey, A. Ibarra, and M. Hetzer, “Tpr regulates the total number of
nuclear pore complexes per cell nucleus,” Genes & Development, vol.
32, no. 19–20. Cold Spring Harbor Laboratory, pp. 1321–1331, 2018.
ista: McCloskey A, Ibarra A, Hetzer M. 2018. Tpr regulates the total number of nuclear
pore complexes per cell nucleus. Genes & Development. 32(19–20), 1321–1331.
mla: McCloskey, Asako, et al. “Tpr Regulates the Total Number of Nuclear Pore Complexes
per Cell Nucleus.” Genes & Development, vol. 32, no. 19–20, Cold Spring
Harbor Laboratory, 2018, pp. 1321–31, doi:10.1101/gad.315523.118.
short: A. McCloskey, A. Ibarra, M. Hetzer, Genes & Development 32 (2018) 1321–1331.
date_created: 2022-04-07T07:45:30Z
date_published: 2018-09-18T00:00:00Z
date_updated: 2022-07-18T08:32:32Z
day: '18'
doi: 10.1101/gad.315523.118
extern: '1'
external_id:
pmid:
- '30228202'
intvolume: ' 32'
issue: 19-20
keyword:
- Developmental Biology
- Genetics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/gad.315523.118
month: '09'
oa: 1
oa_version: Published Version
page: 1321-1331
pmid: 1
publication: Genes & Development
publication_identifier:
issn:
- 0890-9369
- 1549-5477
publication_status: published
publisher: Cold Spring Harbor Laboratory
quality_controlled: '1'
scopus_import: '1'
status: public
title: Tpr regulates the total number of nuclear pore complexes per cell nucleus
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 32
year: '2018'
...
---
_id: '11064'
abstract:
- lang: eng
text: Biomarkers of aging can be used to assess the health of individuals and to
study aging and age-related diseases. We generate a large dataset of genome-wide
RNA-seq profiles of human dermal fibroblasts from 133 people aged 1 to 94 years
old to test whether signatures of aging are encoded within the transcriptome.
We develop an ensemble machine learning method that predicts age to a median error
of 4 years, outperforming previous methods used to predict age. The ensemble was
further validated by testing it on ten progeria patients, and our method is the
only one that predicts accelerated aging in these patients.
article_number: '221'
article_processing_charge: No
article_type: original
author:
- first_name: Jason G.
full_name: Fleischer, Jason G.
last_name: Fleischer
- first_name: Roberta
full_name: Schulte, Roberta
last_name: Schulte
- first_name: Hsiao H.
full_name: Tsai, Hsiao H.
last_name: Tsai
- first_name: Swati
full_name: Tyagi, Swati
last_name: Tyagi
- first_name: Arkaitz
full_name: Ibarra, Arkaitz
last_name: Ibarra
- first_name: Maxim N.
full_name: Shokhirev, Maxim N.
last_name: Shokhirev
- first_name: Ling
full_name: Huang, Ling
last_name: Huang
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
- first_name: Saket
full_name: Navlakha, Saket
last_name: Navlakha
citation:
ama: Fleischer JG, Schulte R, Tsai HH, et al. Predicting age from the transcriptome
of human dermal fibroblasts. Genome Biology. 2018;19. doi:10.1186/s13059-018-1599-6
apa: Fleischer, J. G., Schulte, R., Tsai, H. H., Tyagi, S., Ibarra, A., Shokhirev,
M. N., … Navlakha, S. (2018). Predicting age from the transcriptome of human dermal
fibroblasts. Genome Biology. BioMed Central. https://doi.org/10.1186/s13059-018-1599-6
chicago: Fleischer, Jason G., Roberta Schulte, Hsiao H. Tsai, Swati Tyagi, Arkaitz
Ibarra, Maxim N. Shokhirev, Ling Huang, Martin Hetzer, and Saket Navlakha. “Predicting
Age from the Transcriptome of Human Dermal Fibroblasts.” Genome Biology.
BioMed Central, 2018. https://doi.org/10.1186/s13059-018-1599-6.
ieee: J. G. Fleischer et al., “Predicting age from the transcriptome of human
dermal fibroblasts,” Genome Biology, vol. 19. BioMed Central, 2018.
ista: Fleischer JG, Schulte R, Tsai HH, Tyagi S, Ibarra A, Shokhirev MN, Huang L,
Hetzer M, Navlakha S. 2018. Predicting age from the transcriptome of human dermal
fibroblasts. Genome Biology. 19, 221.
mla: Fleischer, Jason G., et al. “Predicting Age from the Transcriptome of Human
Dermal Fibroblasts.” Genome Biology, vol. 19, 221, BioMed Central, 2018,
doi:10.1186/s13059-018-1599-6.
short: J.G. Fleischer, R. Schulte, H.H. Tsai, S. Tyagi, A. Ibarra, M.N. Shokhirev,
L. Huang, M. Hetzer, S. Navlakha, Genome Biology 19 (2018).
date_created: 2022-04-07T07:45:40Z
date_published: 2018-12-20T00:00:00Z
date_updated: 2022-07-18T08:32:34Z
day: '20'
doi: 10.1186/s13059-018-1599-6
extern: '1'
external_id:
pmid:
- '30567591'
intvolume: ' 19'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1186/s13059-018-1599-6
month: '12'
oa: 1
oa_version: Published Version
pmid: 1
publication: Genome Biology
publication_identifier:
issn:
- 1474-760X
publication_status: published
publisher: BioMed Central
quality_controlled: '1'
scopus_import: '1'
status: public
title: Predicting age from the transcriptome of human dermal fibroblasts
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 19
year: '2018'
...
---
_id: '11508'
abstract:
- lang: eng
text: Distant luminous Lyman-α emitters (LAEs) are excellent targets for spectroscopic
observations of galaxies in the epoch of reionisation (EoR). We present deep high-resolution
(R = 5000) VLT/X-shooter observations, along with an extensive collection of photometric
data of COLA1, a proposed double peaked LAE at z = 6.6. We rule out the possibility
that COLA1’s emission line is an [OII] doublet at z = 1.475 on the basis of i)
the asymmetric red line-profile and flux ratio of the peaks (blue/red=0.31 ± 0.03)
and ii) an unphysical [OII]/Hα ratio ([OII]/Hα > 22). We show that COLA1’s observed
B-band flux is explained by a faint extended foreground LAE, for which we detect
Lyα and [OIII] at z = 2.142. We thus conclude that COLA1 is a real double-peaked
LAE at z = 6.593, the first discovered at z > 6. COLA1 is UV luminous (M1500 = −21.6 ± 0.3),
has a high equivalent width (EW0,Lyα = 120−40+50 Å) and very compact Lyα emission
(r50,Lyα = 0.33−0.04+0.07 kpc). Relatively weak inferred Hβ+[OIII] line-emission
from Spitzer/IRAC indicates an extremely low metallicity of Z < 1/20 Z⊙ or reduced
strength of nebular lines due to high escape of ionising photons. The small Lyα
peak separation of 220 ± 20 km s−1 implies a low HI column density and an ionising
photon escape fraction of ≈15 − 30%, providing the first direct evidence that
such galaxies contribute actively to the reionisation of the Universe at z > 6.
Based on simple estimates, we find that COLA1 could have provided just enough
photons to reionise its own ≈0.3 pMpc (2.3 cMpc) bubble, allowing the blue Lyα
line to be observed. However, we also discuss alternative scenarios explaining
the detected double peaked nature of COLA1. Our results show that future high-resolution
observations of statistical samples of double peaked LAEs at z > 5 are a promising
probe of the occurrence of ionised regions around galaxies in the EoR.
acknowledgement: JM acknowledges the award of a Huygens PhD fellowship from Leiden
University. MG acknowledges support from NASA grant NNX17AK58G. APA, PhD::SPACE
fellow, acknowledges support from the FCT through the fellowship PD/BD/52706/2014.
Based on observations made with ESO Telescopes at the La Silla Paranal Observatory
under programme IDs 294.A-5018, 098.A-0819, 099.A-0254 and 0100.A-0213. We are grateful
for the excellent data-sets from the COSMOS and UltraVISTA survey teams. This research
was supported by the Munich Institute for Astro- and Particle Physics (MIAPP) of
the DFG cluster of excellence “Origin and Structure of the Universe”. We thank the
referee for their comments that improved the paper. We also thank Christoph Behrens,
Len Cowie, Koki Kakiichi, Peter Laursen, Charlotte Mason, Eros Vanzella, Lewis Weinberger
and Johannes Zabl for discussions. We have benefited from the public available programming
language Python, including the numpy, matplotlib, scipy and astropy packages (Hunter
2007; Astropy Collaboration 2013), the astronomical imaging tools Swarp (Bertin
2010) and ds9 and the Topcat analysis tool (Taylor 2013).
article_number: A136
article_processing_charge: No
article_type: original
author:
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: David
full_name: Sobral, David
last_name: Sobral
- first_name: Max
full_name: Gronke, Max
last_name: Gronke
- first_name: Ana
full_name: Paulino-Afonso, Ana
last_name: Paulino-Afonso
- first_name: Mauro
full_name: Stefanon, Mauro
last_name: Stefanon
- first_name: Huub
full_name: Röttgering, Huub
last_name: Röttgering
citation:
ama: 'Matthee JJ, Sobral D, Gronke M, Paulino-Afonso A, Stefanon M, Röttgering H.
Confirmation of double peaked Lyα emission at z = 6.593: Witnessing a galaxy directly
contributing to the reionisation of the universe. Astronomy & Astrophysics.
2018;619. doi:10.1051/0004-6361/201833528'
apa: 'Matthee, J. J., Sobral, D., Gronke, M., Paulino-Afonso, A., Stefanon, M.,
& Röttgering, H. (2018). Confirmation of double peaked Lyα emission at z =
6.593: Witnessing a galaxy directly contributing to the reionisation of the universe.
Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/201833528'
chicago: 'Matthee, Jorryt J, David Sobral, Max Gronke, Ana Paulino-Afonso, Mauro
Stefanon, and Huub Röttgering. “Confirmation of Double Peaked Lyα Emission at
z = 6.593: Witnessing a Galaxy Directly Contributing to the Reionisation of the
Universe.” Astronomy & Astrophysics. EDP Sciences, 2018. https://doi.org/10.1051/0004-6361/201833528.'
ieee: 'J. J. Matthee, D. Sobral, M. Gronke, A. Paulino-Afonso, M. Stefanon, and
H. Röttgering, “Confirmation of double peaked Lyα emission at z = 6.593: Witnessing
a galaxy directly contributing to the reionisation of the universe,” Astronomy
& Astrophysics, vol. 619. EDP Sciences, 2018.'
ista: 'Matthee JJ, Sobral D, Gronke M, Paulino-Afonso A, Stefanon M, Röttgering
H. 2018. Confirmation of double peaked Lyα emission at z = 6.593: Witnessing a
galaxy directly contributing to the reionisation of the universe. Astronomy &
Astrophysics. 619, A136.'
mla: 'Matthee, Jorryt J., et al. “Confirmation of Double Peaked Lyα Emission at
z = 6.593: Witnessing a Galaxy Directly Contributing to the Reionisation of the
Universe.” Astronomy & Astrophysics, vol. 619, A136, EDP Sciences,
2018, doi:10.1051/0004-6361/201833528.'
short: J.J. Matthee, D. Sobral, M. Gronke, A. Paulino-Afonso, M. Stefanon, H. Röttgering,
Astronomy & Astrophysics 619 (2018).
date_created: 2022-07-06T11:14:23Z
date_published: 2018-11-19T00:00:00Z
date_updated: 2022-07-19T09:32:08Z
day: '19'
doi: 10.1051/0004-6361/201833528
extern: '1'
external_id:
arxiv:
- '1805.11621'
intvolume: ' 619'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'galaxies: high-redshift / galaxies: formation / dark ages / reionization / first
stars / techniques: spectroscopic / intergalactic medium'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1805.11621
month: '11'
oa: 1
oa_version: Published Version
publication: Astronomy & Astrophysics
publication_identifier:
eissn:
- 1432-0746
issn:
- 0004-6361
publication_status: published
publisher: EDP Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Confirmation of double peaked Lyα emission at z = 6.593: Witnessing a galaxy
directly contributing to the reionisation of the universe'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 619
year: '2018'
...
---
_id: '11549'
abstract:
- lang: eng
text: We investigate the clustering properties of ∼7000 H β + [O III] and [O II]
narrowband-selected emitters at z ∼ 0.8–4.7 from the High-z Emission Line Survey.
We find clustering lengths, r0, of 1.5–4.0 h−1 Mpc and minimum dark matter halo
masses of 1010.7–12.1 M⊙ for our z = 0.8–3.2 H β + [O III] emitters and r0 ∼ 2.0–8.3
h−1 Mpc and halo masses of 1011.5–12.6 M⊙ for our z = 1.5–4.7 [O II] emitters.
We find r0 to strongly increase both with increasing line luminosity and redshift.
By taking into account the evolution of the characteristic line luminosity, L⋆(z),
and using our model predictions of halo mass given r0, we find a strong, redshift-independent
increasing trend between L/L⋆(z) and minimum halo mass. The faintest H β + [O III]
emitters are found to reside in 109.5 M⊙ haloes and the brightest emitters in
1013.0 M⊙ haloes. For [O II] emitters, the faintest emitters are found in 1010.5
M⊙ haloes and the brightest emitters in 1012.6 M⊙ haloes. A redshift-independent
stellar mass dependency is also observed where the halo mass increases from 1011
to 1012.5 M⊙ for stellar masses of 108.5 to 1011.5 M⊙, respectively. We investigate
the interdependencies of these trends by repeating our analysis in a Lline−Mstar
grid space for our most populated samples (H β + [O III] z = 0.84 and [O II] z
= 1.47) and find that the line luminosity dependency is stronger than the stellar
mass dependency on halo mass. For L > L⋆ emitters at all epochs, we find a relatively
flat trend with halo masses of 1012.5–13 M⊙, which may be due to quenching mechanisms
in massive haloes that is consistent with a transitional halo mass predicted by
models.
acknowledgement: We thank the anonymous referee for their useful comments and suggestions
that improved this study. AAK thanks Anahita Alavi and Irene Shivaei for useful
discussion in the making of this paper. AAK acknowledges that this work was supported
by NASA Headquarters under the NASA Earth and Space Science Fellowship Program –
Grant NNX16AO92H. DS acknowledges financial support from the Netherlands Organization
for Scientific Research (NWO) through a Veni fellowship and from Lancaster University
through an Early Career Internal Grant A100679. PNB is grateful for support from
STFC via grant STM001229/1. IRS acknowledges support from STFC (ST/L00075X/1), the
ERC Advanced Grant DUSTYGAL (321334), and a Royal Society/Wolfson Merit award. JM
acknowledges the support of a Huygens PhD fellowship from Leiden University. BD
acknowledges financial support from NASA through the Astrophysics Data Analysis
Program (ADAP), grant number NNX12AE20G.
article_processing_charge: No
article_type: original
author:
- first_name: A A
full_name: Khostovan, A A
last_name: Khostovan
- first_name: D
full_name: Sobral, D
last_name: Sobral
- first_name: B
full_name: Mobasher, B
last_name: Mobasher
- first_name: P N
full_name: Best, P N
last_name: Best
- first_name: I
full_name: Smail, I
last_name: Smail
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: B
full_name: Darvish, B
last_name: Darvish
- first_name: H
full_name: Nayyeri, H
last_name: Nayyeri
- first_name: S
full_name: Hemmati, S
last_name: Hemmati
- first_name: J P
full_name: Stott, J P
last_name: Stott
citation:
ama: 'Khostovan AA, Sobral D, Mobasher B, et al. The clustering of H β + [O III]
and [O II] emitters since z ∼ 5: Dependencies with line luminosity and stellar
mass. Monthly Notices of the Royal Astronomical Society. 2018;478(3):2999-3015.
doi:10.1093/mnras/sty925'
apa: 'Khostovan, A. A., Sobral, D., Mobasher, B., Best, P. N., Smail, I., Matthee,
J. J., … Stott, J. P. (2018). The clustering of H β + [O III] and [O II] emitters
since z ∼ 5: Dependencies with line luminosity and stellar mass. Monthly Notices
of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/sty925'
chicago: 'Khostovan, A A, D Sobral, B Mobasher, P N Best, I Smail, Jorryt J Matthee,
B Darvish, H Nayyeri, S Hemmati, and J P Stott. “The Clustering of H β + [O III]
and [O II] Emitters since z ∼ 5: Dependencies with Line Luminosity and Stellar
Mass.” Monthly Notices of the Royal Astronomical Society. Oxford University
Press, 2018. https://doi.org/10.1093/mnras/sty925.'
ieee: 'A. A. Khostovan et al., “The clustering of H β + [O III] and [O II]
emitters since z ∼ 5: Dependencies with line luminosity and stellar mass,” Monthly
Notices of the Royal Astronomical Society, vol. 478, no. 3. Oxford University
Press, pp. 2999–3015, 2018.'
ista: 'Khostovan AA, Sobral D, Mobasher B, Best PN, Smail I, Matthee JJ, Darvish
B, Nayyeri H, Hemmati S, Stott JP. 2018. The clustering of H β + [O III] and [O II]
emitters since z ∼ 5: Dependencies with line luminosity and stellar mass. Monthly
Notices of the Royal Astronomical Society. 478(3), 2999–3015.'
mla: 'Khostovan, A. A., et al. “The Clustering of H β + [O III] and [O II] Emitters
since z ∼ 5: Dependencies with Line Luminosity and Stellar Mass.” Monthly Notices
of the Royal Astronomical Society, vol. 478, no. 3, Oxford University Press,
2018, pp. 2999–3015, doi:10.1093/mnras/sty925.'
short: A.A. Khostovan, D. Sobral, B. Mobasher, P.N. Best, I. Smail, J.J. Matthee,
B. Darvish, H. Nayyeri, S. Hemmati, J.P. Stott, Monthly Notices of the Royal Astronomical
Society 478 (2018) 2999–3015.
date_created: 2022-07-08T11:48:48Z
date_published: 2018-08-01T00:00:00Z
date_updated: 2022-08-19T06:53:39Z
day: '01'
doi: 10.1093/mnras/sty925
extern: '1'
external_id:
arxiv:
- '1705.01101'
intvolume: ' 478'
issue: '3'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'galaxies: evolution'
- 'galaxies: haloes'
- 'galaxies: high-redshift'
- 'galaxies: star formation'
- 'cosmology: observations'
- large-scale structure of Universe
language:
- iso: eng
main_file_link:
- url: https://arxiv.org/abs/1705.01101
month: '08'
oa_version: Published Version
page: 2999-3015
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
eissn:
- 1365-2966
issn:
- 0035-8711
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The clustering of H β + [O III] and [O II] emitters since z ∼ 5: Dependencies
with line luminosity and stellar mass'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 478
year: '2018'
...
---
_id: '11557'
abstract:
- lang: eng
text: Deep narrow-band surveys have revealed a large population of faint Ly α emitters
(LAEs) in the distant Universe, but relatively little is known about the most
luminous sources (LLyα≳1042.7 erg s−1; LLyα≳L∗Lyα). Here we present the spectroscopic
follow-up of 21 luminous LAEs at z ∼ 2–3 found with panoramic narrow-band surveys
over five independent extragalactic fields (≈4 × 106 Mpc3 surveyed at z ∼ 2.2
and z ∼ 3.1). We use WHT/ISIS, Keck/DEIMOS, and VLT/X-SHOOTER to study these sources
using high ionization UV lines. Luminous LAEs at z ∼ 2–3 have blue UV slopes (β=−2.0+0.3−0.1)
and high Ly α escape fractions (50+20−15 per cent) and span five orders of magnitude
in UV luminosity (MUV ≈ −19 to −24). Many (70 per cent) show at least one high
ionization rest-frame UV line such as C IV, N V, C III], He II or O III], typically
blue-shifted by ≈100–200 km s−1 relative to Ly α. Their Ly α profiles reveal a
wide variety of shapes, including significant blue-shifted components and widths
from 200 to 4000 km s−1. Overall, 60 ± 11 per cent appear to be active galactic
nucleus (AGN) dominated, and at LLyα > 1043.3 erg s−1 and/or MUV < −21.5 virtually
all LAEs are AGNs with high ionization parameters (log U = 0.6 ± 0.5) and with
metallicities of ≈0.5 − 1 Z⊙. Those lacking signatures of AGNs (40 ± 11 per cent)
have lower ionization parameters (logU=−3.0+1.6−0.9 and log ξion = 25.4 ± 0.2)
and are apparently metal-poor sources likely powered by young, dust-poor ‘maximal’
starbursts. Our results show that luminous LAEs at z ∼ 2–3 are a diverse population
and that 2×L∗Lyα and 2×M∗UV mark a sharp transition in the nature of LAEs, from
star formation dominated to AGN dominated.
acknowledgement: 'We thank the anonymous reviewer for their timely and constructive
comments that greatly helped us to improve the manuscript. DS acknowledges financial
support from the Netherlands Organization for Scientific research (NWO) through
a Veni fellowship and from Lancaster University through an Early Career Internal
Grant A100679. JM acknowledges the support of a Huygens PhD fellowship from Leiden
University. BD acknowledges financial support from NASA through the Astrophysics
Data Analysis Program (ADAP), grant number NNX12AE20G, and the National Science
Foundation, grant number 1716907. IRS acknowledges support from the ERC Advanced
Grant DUSTYGAL (321334), STFC (ST/P000541/1), and a Royal Society/Wolfson Merit
Award. PNB is grateful for support from STFC via grant ST/M001229/1. We thank Anne
Verhamme, Kimihiko Nakajima, Ryan Trainor, Sangeeta Malhotra, Max Gronke, James
Rhoads, Fang Xia An, Matthew Hayes, Takashi Kojima, Mark Dijkstra, and Anne Jaskot
for many helpful and engaging discussions, particularly during the SnowCLAW Ly α
workshop. We thank Bruno Ribeiro, Stephane Charlot, and Joseph Caruana for comments
on the manuscript. The authors would also like to thank Ingrid Tengs, Meg Singleton,
Ali Khostovan, and Sara Perez for participating in part of the observations. We
also thank Joao Calhau, Leah Morabito, Sergio Santos, and Aayush Saxena for their
assistance with the narrow-band observations which allowed to select some of the
sour ces. Based on observations obtained with the William Herschel Telescope, program:
W16AN004; the Very Large Telescope, programs: 098.A-0819 & 099.A-0254; and the Keck
II telescope, program: C267D. Based on data products from observations made with
ESO Telescopes at the La Silla Paranal Observatory under ESO programme IDs 294.A-5018,
294.A-5039, 092.A-0786, 093.A-0561, 097.A-0943, 098.A-0819, 099.A-0254 and 179.A-2005.
The authors acknowledge the award of service time (SW2014b20) on the WHT. WHT and
its service programme are operated on the island of La Palma by the Isaac Newton
Group in the Spanish Observatorio del Roque de los Muchachos of the Instituto de
Astrofisica de Canarias. The authors would also like to thank all the extremely
helpful observatory staff that have greatly contributed towards our observations,
particularly Fiona Riddick, Lilian Dominguez, Florencia Jimenez, and Ian Skillen.
We have benefited greatly from the publicly available programming language PYTHON,
including the NUMPY & SCIPY (Van Der Walt, Colbert & Varoquaux 2011; Jones et al.
2001), MATPLOTLIB (Hunter 2007), ASTROPY (Astropy Collaboration et al. 2013), and
the TOPCAT analysis program (Taylor 2013). This research has made use of the VizieR
catalogue access tool, CDS, Strasbourg, France.'
article_processing_charge: No
article_type: original
author:
- first_name: David
full_name: Sobral, David
last_name: Sobral
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: Behnam
full_name: Darvish, Behnam
last_name: Darvish
- first_name: Ian
full_name: Smail, Ian
last_name: Smail
- first_name: Philip N
full_name: Best, Philip N
last_name: Best
- first_name: Lara
full_name: Alegre, Lara
last_name: Alegre
- first_name: Huub
full_name: Röttgering, Huub
last_name: Röttgering
- first_name: Bahram
full_name: Mobasher, Bahram
last_name: Mobasher
- first_name: Ana
full_name: Paulino-Afonso, Ana
last_name: Paulino-Afonso
- first_name: Andra
full_name: Stroe, Andra
last_name: Stroe
- first_name: Iván
full_name: Oteo, Iván
last_name: Oteo
citation:
ama: 'Sobral D, Matthee JJ, Darvish B, et al. The nature of luminous Ly α emitters
at z ∼ 2–3: Maximal dust-poor starbursts and highly ionizing AGN. Monthly Notices
of the Royal Astronomical Society. 2018;477(2):2817-2840. doi:10.1093/mnras/sty782'
apa: 'Sobral, D., Matthee, J. J., Darvish, B., Smail, I., Best, P. N., Alegre, L.,
… Oteo, I. (2018). The nature of luminous Ly α emitters at z ∼ 2–3: Maximal dust-poor
starbursts and highly ionizing AGN. Monthly Notices of the Royal Astronomical
Society. Oxford University Press. https://doi.org/10.1093/mnras/sty782'
chicago: 'Sobral, David, Jorryt J Matthee, Behnam Darvish, Ian Smail, Philip N Best,
Lara Alegre, Huub Röttgering, et al. “The Nature of Luminous Ly α Emitters at
z ∼ 2–3: Maximal Dust-Poor Starbursts and Highly Ionizing AGN.” Monthly Notices
of the Royal Astronomical Society. Oxford University Press, 2018. https://doi.org/10.1093/mnras/sty782.'
ieee: 'D. Sobral et al., “The nature of luminous Ly α emitters at z ∼ 2–3:
Maximal dust-poor starbursts and highly ionizing AGN,” Monthly Notices of the
Royal Astronomical Society, vol. 477, no. 2. Oxford University Press, pp.
2817–2840, 2018.'
ista: 'Sobral D, Matthee JJ, Darvish B, Smail I, Best PN, Alegre L, Röttgering H,
Mobasher B, Paulino-Afonso A, Stroe A, Oteo I. 2018. The nature of luminous Ly
α emitters at z ∼ 2–3: Maximal dust-poor starbursts and highly ionizing AGN. Monthly
Notices of the Royal Astronomical Society. 477(2), 2817–2840.'
mla: 'Sobral, David, et al. “The Nature of Luminous Ly α Emitters at z ∼ 2–3: Maximal
Dust-Poor Starbursts and Highly Ionizing AGN.” Monthly Notices of the Royal
Astronomical Society, vol. 477, no. 2, Oxford University Press, 2018, pp.
2817–40, doi:10.1093/mnras/sty782.'
short: D. Sobral, J.J. Matthee, B. Darvish, I. Smail, P.N. Best, L. Alegre, H. Röttgering,
B. Mobasher, A. Paulino-Afonso, A. Stroe, I. Oteo, Monthly Notices of the Royal
Astronomical Society 477 (2018) 2817–2840.
date_created: 2022-07-12T07:18:02Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2022-08-19T07:01:08Z
day: '01'
doi: 10.1093/mnras/sty782
extern: '1'
external_id:
arxiv:
- '1802.10102'
intvolume: ' 477'
issue: '2'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'galaxies: active'
- 'galaxies: evolution'
- 'galaxies: high-redshift'
- 'galaxies: ISM'
- 'galaxies: starburst'
- 'cosmology: observations'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1802.10102
month: '06'
oa: 1
oa_version: Preprint
page: 2817-2840
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
eissn:
- 1365-2966
issn:
- 0035-8711
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The nature of luminous Ly α emitters at z ∼ 2–3: Maximal dust-poor starbursts
and highly ionizing AGN'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 477
year: '2018'
...
---
_id: '11558'
abstract:
- lang: eng
text: We present and explore deep narrow- and medium-band data obtained with the
Subaru and the Isaac Newton Telescopes in the ∼2 deg2 COSMOS field. We use these
data as an extremely wide, low-resolution (R ∼ 20–80) Integral Field Unit survey
to slice through the COSMOS field and obtain a large sample of ∼4000 Ly α emitters
(LAEs) from z ∼ 2 to 6 in 16 redshift slices (SC4K). We present new Ly α luminosity
functions (LFs) covering a comoving volume of ∼108 Mpc3. SC4K extensively complements
ultradeep surveys, jointly covering over 4 dex in Ly α luminosity and revealing
a global (2.5 < z < 6) synergy LF with α=−1.93+0.12−0.12, log10Φ∗Lyα=−3.45+0.22−0.29 Mpc−3,
and log10L∗Lyα=42.93+0.15−0.11 erg s−1. The Schechter component of the Ly α LF
reveals a factor ∼5 rise in L∗Lyα and a ∼7 × decline in Φ∗Lyα from z ∼ 2 to 6.
The data reveal an extra power-law (or Schechter) component above LLy α ≈ 1043.3 erg s−1
at z ∼ 2.2–3.5 and we show that it is partially driven by X-ray and radio active
galactic nucleus (AGN), as their Ly α LF resembles the excess. The power-law component
vanishes and/or is below our detection limits above z > 3.5, likely linked with
the evolution of the AGN population. The Ly α luminosity density rises by a factor
∼2 from z ∼ 2 to 3 but is then found to be roughly constant (1.1+0.2−0.2×1040 erg s−1 Mpc−3)
to z ∼ 6, despite the ∼0.7 dex drop in ultraviolet (UV) luminosity density. The
Ly α/UV luminosity density ratio rises from 4 ± 1 per cent to 30 ± 6 per cent
from z ∼ 2.2 to 6. Our results imply a rise of a factor of ≈2 in the global ionization
efficiency (ξion) and a factor ≈4 ± 1 in the Ly α escape fraction from z ∼ 2 to
6, hinting for evolution in both the typical burstiness/stellar populations and
even more so in the typical interstellar medium conditions allowing Ly α photons
to escape.
acknowledgement: "We thank the anonymous referee for their constructive comments that
helped us improve the manuscript. DS acknowledges the hospitality of the IAC and
a Severo Ochoa visiting grant. SS and JC acknowledge studentships from the Lancaster
University. JM acknowledges a Huygens PhD fellowship from Leiden University. APA
acknowledges financial support from the Science and Technology Foundation (FCT,
Portugal) through research grants UID/FIS/04434/2013 and fellowship PD/BD/52706/2014.
The authors thank Alyssa Drake, Kimihiko Nakajima, Yuichi Harikane, Max Gronke,
Irene Shivaei, Helmut Dannerbauer, Huub Rottgering, ¨ Marius Eide, and Masami Ouchi
for many engaging and stimulating discussions. We also thank Sara Perez, Alex Bennett,
and Tom Rose for their involvement in the early stages of this project. Based on
data products from observations made with European Southern Observatory (ESO) Telescopes
at the La Silla Paranal Observatory under ESO programme IDs 294.A-5018, 097.A 0943,\r\n098.A-0819,
099.A-0254, and 179.A-2005 and on data products produced by TERAPIX and the Cambridge
Astronomy Survey Unit on behalf of the UltraVISTA consortium. Based on observations
using the WFC on the 2.5 m INT, as part of programmes 2013AN002, 2013BN008, 2014AC88,
2014AN002, 2014BN006, 2014BC118, and 2016AN001. The INT is operated on the island
of La Palma by the Isaac Newton Group in the Spanish Observatorio del Roque de los
Muchachos of the Instituto de Astrofisica de Canarias. This work is based in part
on data products produced at TERAPIX available at the Canadian Astronomy Data Centre
as part of the Canada–France– Hawaii Telescope Legacy Survey (CFHTLS), a collaborative
project of NRC and CNRS.\r\nWe are grateful to the CFHTLS, COSMOS-UltraVISTA, and
COSMOS survey teams. We are also unmeasurably thankful to the pioneering and continuous
work from previous Ly α surveys’ teams. Without these previous Ly α and the wider
reach legacy surveys, this research would have been impossible. We also thank the
VUDS team for making available spectroscopic redshifts from data obtained with VIMOS
at the European Southern Observatory Very Large Telescope, Paranal, Chile, under
Large Programme 185.A-0791. Finally, the authors acknowledge the unique value of
the publicly available programming language PYTHON, including the NUMPY and SCIPY
(Van Der Walt, Colbert & Varoquaux 2011; Jones et al. 2001), MATPLOTLIB (Hunter
2007), ASTROPY (Astropy Collaboration et al. 2013), and the TOPCAT analysis program
(Taylor 2005). We publicly release a catalogue with all LAEs used in this paper
(SC4K), so it can be freely explored by the community (see five example entries
in Table A1)."
article_processing_charge: No
article_type: original
author:
- first_name: David
full_name: Sobral, David
last_name: Sobral
- first_name: Sérgio
full_name: Santos, Sérgio
last_name: Santos
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: Ana
full_name: Paulino-Afonso, Ana
last_name: Paulino-Afonso
- first_name: Bruno
full_name: Ribeiro, Bruno
last_name: Ribeiro
- first_name: João
full_name: Calhau, João
last_name: Calhau
- first_name: Ali A
full_name: Khostovan, Ali A
last_name: Khostovan
citation:
ama: 'Sobral D, Santos S, Matthee JJ, et al. Slicing COSMOS with SC4K: The evolution
of typical Ly α emitters and the Ly α escape fraction from z ∼ 2 to 6. Monthly
Notices of the Royal Astronomical Society. 2018;476(4):4725-4752. doi:10.1093/mnras/sty378'
apa: 'Sobral, D., Santos, S., Matthee, J. J., Paulino-Afonso, A., Ribeiro, B., Calhau,
J., & Khostovan, A. A. (2018). Slicing COSMOS with SC4K: The evolution of
typical Ly α emitters and the Ly α escape fraction from z ∼ 2 to 6. Monthly
Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/sty378'
chicago: 'Sobral, David, Sérgio Santos, Jorryt J Matthee, Ana Paulino-Afonso, Bruno
Ribeiro, João Calhau, and Ali A Khostovan. “Slicing COSMOS with SC4K: The Evolution
of Typical Ly α Emitters and the Ly α Escape Fraction from z ∼ 2 to 6.” Monthly
Notices of the Royal Astronomical Society. Oxford University Press, 2018.
https://doi.org/10.1093/mnras/sty378.'
ieee: 'D. Sobral et al., “Slicing COSMOS with SC4K: The evolution of typical
Ly α emitters and the Ly α escape fraction from z ∼ 2 to 6,” Monthly Notices
of the Royal Astronomical Society, vol. 476, no. 4. Oxford University Press,
pp. 4725–4752, 2018.'
ista: 'Sobral D, Santos S, Matthee JJ, Paulino-Afonso A, Ribeiro B, Calhau J, Khostovan
AA. 2018. Slicing COSMOS with SC4K: The evolution of typical Ly α emitters and
the Ly α escape fraction from z ∼ 2 to 6. Monthly Notices of the Royal Astronomical
Society. 476(4), 4725–4752.'
mla: 'Sobral, David, et al. “Slicing COSMOS with SC4K: The Evolution of Typical
Ly α Emitters and the Ly α Escape Fraction from z ∼ 2 to 6.” Monthly Notices
of the Royal Astronomical Society, vol. 476, no. 4, Oxford University Press,
2018, pp. 4725–52, doi:10.1093/mnras/sty378.'
short: D. Sobral, S. Santos, J.J. Matthee, A. Paulino-Afonso, B. Ribeiro, J. Calhau,
A.A. Khostovan, Monthly Notices of the Royal Astronomical Society 476 (2018) 4725–4752.
date_created: 2022-07-12T10:41:08Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2022-08-19T07:04:45Z
day: '01'
doi: 10.1093/mnras/sty378
extern: '1'
external_id:
arxiv:
- '1712.04451'
intvolume: ' 476'
issue: '4'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'galaxies: evolution'
- 'galaxies: formation'
- 'galaxies: high-redshift'
- 'galaxies: luminosity function'
- mass function
- 'galaxies: statistics'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1712.04451
month: '06'
oa: 1
oa_version: Preprint
page: 4725-4752
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
eissn:
- 1365-2966
issn:
- 0035-8711
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Slicing COSMOS with SC4K: The evolution of typical Ly α emitters and the Ly α
escape fraction from z ∼ 2 to 6'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 476
year: '2018'
...
---
_id: '11555'
abstract:
- lang: eng
text: We investigate the morphology of the [C II] emission in a sample of ‘normal’
star-forming galaxies at 5 < z < 7.2 in relation to their UV (rest-frame) counterpart.
We use new Atacama Large Millimetre/submillimetre Array (ALMA) observations of
galaxies at z ∼ 6–7, as well as a careful re-analysis of archival ALMA data. In
total 29 galaxies were analysed, 21 of which are detected in [C II]. For several
of the latter the [C II] emission breaks into multiple components. Only a fraction
of these [C II] components, if any, is associated with the primary UV systems,
while the bulk of the [C II] emission is associated either with fainter UV components,
or not associated with any UV counterpart at the current limits. By taking into
account the presence of all these components, we find that the L[CII]–SFR (star
formation rate) relation at early epochs is fully consistent with the local relation,
but it has a dispersion of 0.48 ± 0.07 dex, which is about two times larger than
observed locally. We also find that the deviation from the local L[CII]–SFR relation
has a weak anticorrelation with the EW(Ly α). The morphological analysis also
reveals that [C II] emission is generally much more extended than the UV emission.
As a consequence, these primordial galaxies are characterized by a [C II] surface
brightness generally much lower than expected from the local Σ[CII]−ΣSFR relation.
These properties are likely a consequence of a combination of different effects,
namely gas metallicity, [C II] emission from obscured star-forming regions, strong
variations of the ionization parameter, and circumgalactic gas in accretion or
ejected by these primeval galaxies.
acknowledgement: "This paper makes use of the following ALMA data:\r\nADS/JAO.ALMA#2012.1.00719.S,
ADS/JAO.ALMA#2012.A.00040.S,\r\nADS/JAO.ALMA#2013.A.00433.S, ADS/JAO.ALMA#2011.0.00115.S,\r\nADS/JAO.ALMA#2012.1.00033.S,
ADS/JAO.ALMA#2012.1.00523.S,\r\nADS/JAO.ALMA#2013.1.00815.S, ADS/JAO.ALMA#2015.1.00834.S.,\r\nADS/JAO.ALMA#2015.1.01105.S,
AND ADS/JAO.ALMA#2016.1.01240.S\r\nwhich can be retrieved from the ALMA data archive:\r\nhttps://almascience.eso.org/
alma-data/archive. ALMA is a partnership of ESO (representing its member states),
NSF (USA) and NINS (Japan), together with NRC (Canada) and NSC and ASIAA (Taiwan),
in cooperation with the Republic of Chile. The Joint ALMA Observatory is operated
by ESO, AUI/NRAO, and NAOJ. We are grateful to G. Jones to for providing his [C
II] flux maps. RM and SC acknowledge support by the Science and Technology Facilities
Council (STFC). RM acknowledges ERC Advanced Grant 695671 ‘QUENCH’. AF acknowledges
support from the ERC Advanced Grant INTERSTELLAR H2020/740120."
article_processing_charge: No
article_type: original
author:
- first_name: S
full_name: Carniani, S
last_name: Carniani
- first_name: R
full_name: Maiolino, R
last_name: Maiolino
- first_name: R
full_name: Amorin, R
last_name: Amorin
- first_name: L
full_name: Pentericci, L
last_name: Pentericci
- first_name: A
full_name: Pallottini, A
last_name: Pallottini
- first_name: A
full_name: Ferrara, A
last_name: Ferrara
- first_name: C J
full_name: Willott, C J
last_name: Willott
- first_name: R
full_name: Smit, R
last_name: Smit
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: D
full_name: Sobral, D
last_name: Sobral
- first_name: P
full_name: Santini, P
last_name: Santini
- first_name: M
full_name: Castellano, M
last_name: Castellano
- first_name: S
full_name: De Barros, S
last_name: De Barros
- first_name: A
full_name: Fontana, A
last_name: Fontana
- first_name: A
full_name: Grazian, A
last_name: Grazian
- first_name: L
full_name: Guaita, L
last_name: Guaita
citation:
ama: Carniani S, Maiolino R, Amorin R, et al. Kiloparsec-scale gaseous clumps and
star formation at z = 5–7. Monthly Notices of the Royal Astronomical Society.
2018;478(1):1170-1184. doi:10.1093/mnras/sty1088
apa: Carniani, S., Maiolino, R., Amorin, R., Pentericci, L., Pallottini, A., Ferrara,
A., … Guaita, L. (2018). Kiloparsec-scale gaseous clumps and star formation at
z = 5–7. Monthly Notices of the Royal Astronomical Society. Oxford University
Press. https://doi.org/10.1093/mnras/sty1088
chicago: Carniani, S, R Maiolino, R Amorin, L Pentericci, A Pallottini, A Ferrara,
C J Willott, et al. “Kiloparsec-Scale Gaseous Clumps and Star Formation at z = 5–7.”
Monthly Notices of the Royal Astronomical Society. Oxford University Press,
2018. https://doi.org/10.1093/mnras/sty1088.
ieee: S. Carniani et al., “Kiloparsec-scale gaseous clumps and star formation
at z = 5–7,” Monthly Notices of the Royal Astronomical Society, vol. 478,
no. 1. Oxford University Press, pp. 1170–1184, 2018.
ista: Carniani S, Maiolino R, Amorin R, Pentericci L, Pallottini A, Ferrara A, Willott
CJ, Smit R, Matthee JJ, Sobral D, Santini P, Castellano M, De Barros S, Fontana
A, Grazian A, Guaita L. 2018. Kiloparsec-scale gaseous clumps and star formation
at z = 5–7. Monthly Notices of the Royal Astronomical Society. 478(1), 1170–1184.
mla: Carniani, S., et al. “Kiloparsec-Scale Gaseous Clumps and Star Formation at
z = 5–7.” Monthly Notices of the Royal Astronomical Society, vol. 478,
no. 1, Oxford University Press, 2018, pp. 1170–84, doi:10.1093/mnras/sty1088.
short: S. Carniani, R. Maiolino, R. Amorin, L. Pentericci, A. Pallottini, A. Ferrara,
C.J. Willott, R. Smit, J.J. Matthee, D. Sobral, P. Santini, M. Castellano, S.
De Barros, A. Fontana, A. Grazian, L. Guaita, Monthly Notices of the Royal Astronomical
Society 478 (2018) 1170–1184.
date_created: 2022-07-11T08:05:42Z
date_published: 2018-07-01T00:00:00Z
date_updated: 2022-08-19T06:58:06Z
day: '01'
doi: 10.1093/mnras/sty1088
extern: '1'
external_id:
arxiv:
- '1712.03985'
intvolume: ' 478'
issue: '1'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'galaxies: evolution'
- 'galaxies: high-redshift'
- 'galaxies: ISM'
- 'galaxies: formation'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1712.03985
month: '07'
oa: 1
oa_version: Preprint
page: 1170-1184
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
eissn:
- 1365-2966
issn:
- 0035-8711
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Kiloparsec-scale gaseous clumps and star formation at z = 5–7
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 478
year: '2018'
...
---
_id: '11584'
abstract:
- lang: eng
text: Observations show that star-forming galaxies reside on a tight 3D plane between
mass, gas-phase metallicity, and star formation rate (SFR), which can be explained
by the interplay between metal-poor gas inflows, SFR and outflows. However, different
metals are released on different time-scales, which may affect the slope of this
relation. Here, we use central, star-forming galaxies with Mstar = 109.0–10.5
M⊙ from the EAGLE hydrodynamical simulation to examine 3D relations between mass,
SFR, and chemical enrichment using absolute and relative C, N, O, and Fe abundances.
We show that the scatter is smaller when gas-phase α-enhancement is used rather
than metallicity. A similar plane also exists for stellar α-enhancement, implying
that present-day specific SFRs are correlated with long time-scale star formation
histories. Between z = 0 and 1, the α-enhancement plane is even more insensitive
to redshift than the plane using metallicity. However, it evolves at z > 1 due
to lagging iron yields. At fixed mass, galaxies with higher SFRs have star formation
histories shifted towards late times, are more α-enhanced, and this α-enhancement
increases with redshift as observed. These findings suggest that relations between
physical properties inferred from observations may be affected by systematic variations
in α-enhancements.
acknowledgement: We thank the anonymous referee for their constructive comments. JM
acknowledges the support of a Huygens PhD fellowship from Leiden University. We
thank Jarle Brinchmann, Rob Crain and David Sobral for discussions. We acknowledge
the use of the TOPCAT software (Taylor 2013) for assisting in rapid exploration
of multidimensional data sets and the use of PYTHON and its NUMPY, MATPLOTLIB, and
PANDAS packages.
article_processing_charge: No
article_type: original
author:
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: Joop
full_name: Schaye, Joop
last_name: Schaye
citation:
ama: 'Matthee JJ, Schaye J. Star-forming galaxies are predicted to lie on a fundamental
plane of mass, star formation rate, and α-enhancement. Monthly Notices of the
Royal Astronomical Society: Letters. 2018;479(1):L34-L39. doi:10.1093/mnrasl/sly093'
apa: 'Matthee, J. J., & Schaye, J. (2018). Star-forming galaxies are predicted
to lie on a fundamental plane of mass, star formation rate, and α-enhancement.
Monthly Notices of the Royal Astronomical Society: Letters. Oxford University
Press. https://doi.org/10.1093/mnrasl/sly093'
chicago: 'Matthee, Jorryt J, and Joop Schaye. “Star-Forming Galaxies Are Predicted
to Lie on a Fundamental Plane of Mass, Star Formation Rate, and α-Enhancement.”
Monthly Notices of the Royal Astronomical Society: Letters. Oxford University
Press, 2018. https://doi.org/10.1093/mnrasl/sly093.'
ieee: 'J. J. Matthee and J. Schaye, “Star-forming galaxies are predicted to lie
on a fundamental plane of mass, star formation rate, and α-enhancement,” Monthly
Notices of the Royal Astronomical Society: Letters, vol. 479, no. 1. Oxford
University Press, pp. L34–L39, 2018.'
ista: 'Matthee JJ, Schaye J. 2018. Star-forming galaxies are predicted to lie on
a fundamental plane of mass, star formation rate, and α-enhancement. Monthly Notices
of the Royal Astronomical Society: Letters. 479(1), L34–L39.'
mla: 'Matthee, Jorryt J., and Joop Schaye. “Star-Forming Galaxies Are Predicted
to Lie on a Fundamental Plane of Mass, Star Formation Rate, and α-Enhancement.”
Monthly Notices of the Royal Astronomical Society: Letters, vol. 479, no.
1, Oxford University Press, 2018, pp. L34–39, doi:10.1093/mnrasl/sly093.'
short: 'J.J. Matthee, J. Schaye, Monthly Notices of the Royal Astronomical Society:
Letters 479 (2018) L34–L39.'
date_created: 2022-07-14T12:49:47Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2022-08-19T08:35:45Z
day: '01'
doi: 10.1093/mnrasl/sly093
extern: '1'
external_id:
arxiv:
- '1802.06786'
intvolume: ' 479'
issue: '1'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'galaxies: abundances'
- 'galaxies: evolution'
- 'galaxies: formation'
- 'galaxies: star formation'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1802.06786
month: '09'
oa: 1
oa_version: Preprint
page: L34 - L39
publication: 'Monthly Notices of the Royal Astronomical Society: Letters'
publication_identifier:
eissn:
- 1745-3933
issn:
- 1745-3925
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Star-forming galaxies are predicted to lie on a fundamental plane of mass,
star formation rate, and α-enhancement
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 479
year: '2018'
...
---
_id: '11619'
abstract:
- lang: eng
text: We report on the confirmation and mass determination of π Men c, the first
transiting planet discovered by NASA’s TESS space mission. π Men is a naked-eye
(V = 5.65 mag), quiet G0 V star that was previously known to host a sub-stellar
companion (π Men b) on a longperiod (Porb = 2091 days), eccentric (e = 0.64) orbit.
Using TESS time-series photometry, combined with Gaia data, published UCLES at
AAT Doppler measurements, and archival HARPS at ESO-3.6m radial velocities, we
found that π Men c is a close-in planet with an orbital period of Porb = 6.27
days, a mass of Mc = 4.52 ± 0.81 M⊕, and a radius of Rc = 2.06 ± 0.03 R⊕. Based
on the planet’s orbital period and size, π Men c is a super-Earth located at,
or close to, the radius gap, while its mass and bulk density suggest it may have
held on to a significant atmosphere. Because of the brightness of the host star,
this system is highly suitable for a wide range of further studies to characterize
the planetary atmosphere and dynamical properties. We also performed an asteroseismic
analysis of the TESS data and detected a hint of power excess consistent with
the seismic values expected for this star, although this result depends on the
photometric aperture used to extract the light curve. This marginal detection
is expected from pre-launch simulations hinting at the asteroseismic potential
of the TESS mission for longer, multi-sector observations and/or for more evolved
bright stars.
article_number: L10
article_processing_charge: No
article_type: letter_note
author:
- first_name: D.
full_name: Gandolfi, D.
last_name: Gandolfi
- first_name: O.
full_name: Barragán, O.
last_name: Barragán
- first_name: J. H.
full_name: Livingston, J. H.
last_name: Livingston
- first_name: M.
full_name: Fridlund, M.
last_name: Fridlund
- first_name: A. B.
full_name: Justesen, A. B.
last_name: Justesen
- first_name: S.
full_name: Redfield, S.
last_name: Redfield
- first_name: L.
full_name: Fossati, L.
last_name: Fossati
- first_name: S.
full_name: Mathur, S.
last_name: Mathur
- first_name: S.
full_name: Grziwa, S.
last_name: Grziwa
- first_name: J.
full_name: Cabrera, J.
last_name: Cabrera
- first_name: R. A.
full_name: García, R. A.
last_name: García
- first_name: C. M.
full_name: Persson, C. M.
last_name: Persson
- first_name: V.
full_name: Van Eylen, V.
last_name: Van Eylen
- first_name: A. P.
full_name: Hatzes, A. P.
last_name: Hatzes
- first_name: D.
full_name: Hidalgo, D.
last_name: Hidalgo
- first_name: S.
full_name: Albrecht, S.
last_name: Albrecht
- first_name: Lisa Annabelle
full_name: Bugnet, Lisa Annabelle
id: d9edb345-f866-11ec-9b37-d119b5234501
last_name: Bugnet
orcid: 0000-0003-0142-4000
- first_name: W. D.
full_name: Cochran, W. D.
last_name: Cochran
- first_name: Sz.
full_name: Csizmadia, Sz.
last_name: Csizmadia
- first_name: H.
full_name: Deeg, H.
last_name: Deeg
- first_name: Ph.
full_name: Eigmüller, Ph.
last_name: Eigmüller
- first_name: M.
full_name: Endl, M.
last_name: Endl
- first_name: A.
full_name: Erikson, A.
last_name: Erikson
- first_name: M.
full_name: Esposito, M.
last_name: Esposito
- first_name: E.
full_name: Guenther, E.
last_name: Guenther
- first_name: J.
full_name: Korth, J.
last_name: Korth
- first_name: R.
full_name: Luque, R.
last_name: Luque
- first_name: P.
full_name: Montañes Rodríguez, P.
last_name: Montañes Rodríguez
- first_name: D.
full_name: Nespral, D.
last_name: Nespral
- first_name: G.
full_name: Nowak, G.
last_name: Nowak
- first_name: M.
full_name: Pätzold, M.
last_name: Pätzold
- first_name: J.
full_name: Prieto-Arranz, J.
last_name: Prieto-Arranz
citation:
ama: 'Gandolfi D, Barragán O, Livingston JH, et al. TESS’s first planet: A super-Earth
transiting the naked-eye star π Mensae. Astronomy & Astrophysics. 2018;619.
doi:10.1051/0004-6361/201834289'
apa: 'Gandolfi, D., Barragán, O., Livingston, J. H., Fridlund, M., Justesen, A.
B., Redfield, S., … Prieto-Arranz, J. (2018). TESS’s first planet: A super-Earth
transiting the naked-eye star π Mensae. Astronomy & Astrophysics. EDP
Sciences. https://doi.org/10.1051/0004-6361/201834289'
chicago: 'Gandolfi, D., O. Barragán, J. H. Livingston, M. Fridlund, A. B. Justesen,
S. Redfield, L. Fossati, et al. “TESS’s First Planet: A Super-Earth Transiting
the Naked-Eye Star π Mensae.” Astronomy & Astrophysics. EDP Sciences,
2018. https://doi.org/10.1051/0004-6361/201834289.'
ieee: 'D. Gandolfi et al., “TESS’s first planet: A super-Earth transiting
the naked-eye star π Mensae,” Astronomy & Astrophysics, vol. 619. EDP
Sciences, 2018.'
ista: 'Gandolfi D, Barragán O, Livingston JH, Fridlund M, Justesen AB, Redfield
S, Fossati L, Mathur S, Grziwa S, Cabrera J, García RA, Persson CM, Van Eylen
V, Hatzes AP, Hidalgo D, Albrecht S, Bugnet LA, Cochran WD, Csizmadia S, Deeg
H, Eigmüller P, Endl M, Erikson A, Esposito M, Guenther E, Korth J, Luque R, Montañes
Rodríguez P, Nespral D, Nowak G, Pätzold M, Prieto-Arranz J. 2018. TESS’s first
planet: A super-Earth transiting the naked-eye star π Mensae. Astronomy &
Astrophysics. 619, L10.'
mla: 'Gandolfi, D., et al. “TESS’s First Planet: A Super-Earth Transiting the Naked-Eye
Star π Mensae.” Astronomy & Astrophysics, vol. 619, L10, EDP Sciences,
2018, doi:10.1051/0004-6361/201834289.'
short: D. Gandolfi, O. Barragán, J.H. Livingston, M. Fridlund, A.B. Justesen, S.
Redfield, L. Fossati, S. Mathur, S. Grziwa, J. Cabrera, R.A. García, C.M. Persson,
V. Van Eylen, A.P. Hatzes, D. Hidalgo, S. Albrecht, L.A. Bugnet, W.D. Cochran,
S. Csizmadia, H. Deeg, P. Eigmüller, M. Endl, A. Erikson, M. Esposito, E. Guenther,
J. Korth, R. Luque, P. Montañes Rodríguez, D. Nespral, G. Nowak, M. Pätzold, J.
Prieto-Arranz, Astronomy & Astrophysics 619 (2018).
date_created: 2022-07-18T14:41:16Z
date_published: 2018-11-22T00:00:00Z
date_updated: 2022-08-22T07:43:29Z
day: '22'
doi: 10.1051/0004-6361/201834289
extern: '1'
external_id:
arxiv:
- '1809.07573'
intvolume: ' 619'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- planetary systems / planets and satellites
- detection / planets and satellites
- fundamental parameters / planets and satellites
- terrestrial planets / stars
- fundamental parameters
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1809.07573
month: '11'
oa: 1
oa_version: Preprint
publication: Astronomy & Astrophysics
publication_identifier:
eissn:
- 1432-0746
issn:
- 0004-6361
publication_status: published
publisher: EDP Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'TESS’s first planet: A super-Earth transiting the naked-eye star π Mensae'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 619
year: '2018'
...
---
_id: '11618'
abstract:
- lang: eng
text: Asteroseismology provides global stellar parameters such as masses, radii,
or surface gravities using mean global seismic parameters and effective temperature
for thousands of low-mass stars (0.8 M⊙ < M < 3 M⊙). This methodology has been
successfully applied to stars in which acoustic modes excited by turbulent convection
are measured. Other methods such as the Flicker technique can also be used to
determine stellar surface gravities, but only works for log g above 2.5 dex. In
this work, we present a new metric called FliPer (Flicker in spectral power density,
in opposition to the standard Flicker measurement which is computed in the time
domain); it is able to extend the range for which reliable surface gravities can
be obtained (0.1 < log g < 4.6 dex) without performing any seismic analysis for
stars brighter than Kp < 14. FliPer takes into account the average variability
of a star measured in the power density spectrum in a given range of frequencies.
However, FliPer values calculated on several ranges of frequency are required
to better characterize a star. Using a large set of asteroseismic targets it is
possible to calibrate the behavior of surface gravity with FliPer through machine
learning. This calibration made with a random forest regressor covers a wide range
of surface gravities from main-sequence stars to subgiants and red giants, with
very small uncertainties from 0.04 to 0.1 dex. FliPer values can be inserted in
automatic global seismic pipelines to either give an estimation of the stellar
surface gravity or to assess the quality of the seismic results by detecting any
outliers in the obtained νmax values. FliPer also constrains the surface gravities
of main-sequence dwarfs using only long-cadence data for which the Nyquist frequency
is too low to measure the acoustic-mode properties.
acknowledgement: We thank the anonymous referee for the very useful comments. We would
also like to thank M. Benbakoura for his help in analyzing the light curves of several
binary systems included in our set of stars. L.B. and R.A.G. acknowledge the support
from PLATO and GOLF CNES grants. S.M. acknowledges support from the National Aeronautics
and Space Administration under Grant NNX15AF13G, the National Science Foundation
grant AST-1411685, and the Ramon y Cajal fellowship no. RYC-2015-17697. E.C. is
funded by the European Union’s Horizon 2020 research and innovation program under
the Marie Sklodowska-Curie grant agreement no. 664931. O.J.H and B.M.R. acknowledge
the support of the UK Science and Technology Facilities Council (STFC). Funding
for the Stellar Astrophysics Centre is provided by the Danish National Research
Foundation (Grant DNRF106). This research has made use of NASA’s Astrophysics Data
System. Data presented in this paper were obtained from the Mikulski Archive for
Space Telescopes (MAST). STScI is operated by the Association of Universities for
Research in Astronomy, Inc., under NASA contract NAS5-26555.
article_number: A38
article_processing_charge: No
article_type: original
author:
- first_name: Lisa Annabelle
full_name: Bugnet, Lisa Annabelle
id: d9edb345-f866-11ec-9b37-d119b5234501
last_name: Bugnet
orcid: 0000-0003-0142-4000
- first_name: R. A.
full_name: García, R. A.
last_name: García
- first_name: G. R.
full_name: Davies, G. R.
last_name: Davies
- first_name: S.
full_name: Mathur, S.
last_name: Mathur
- first_name: E.
full_name: Corsaro, E.
last_name: Corsaro
- first_name: O. J.
full_name: Hall, O. J.
last_name: Hall
- first_name: B. M.
full_name: Rendle, B. M.
last_name: Rendle
citation:
ama: 'Bugnet LA, García RA, Davies GR, et al. FliPer: A global measure of power
density to estimate surface gravities of main-sequence solar-like stars and red
giants. Astronomy & Astrophysics. 2018;620. doi:10.1051/0004-6361/201833106'
apa: 'Bugnet, L. A., García, R. A., Davies, G. R., Mathur, S., Corsaro, E., Hall,
O. J., & Rendle, B. M. (2018). FliPer: A global measure of power density to
estimate surface gravities of main-sequence solar-like stars and red giants. Astronomy
& Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/201833106'
chicago: 'Bugnet, Lisa Annabelle, R. A. García, G. R. Davies, S. Mathur, E. Corsaro,
O. J. Hall, and B. M. Rendle. “FliPer: A Global Measure of Power Density to Estimate
Surface Gravities of Main-Sequence Solar-like Stars and Red Giants.” Astronomy
& Astrophysics. EDP Sciences, 2018. https://doi.org/10.1051/0004-6361/201833106.'
ieee: 'L. A. Bugnet et al., “FliPer: A global measure of power density to
estimate surface gravities of main-sequence solar-like stars and red giants,”
Astronomy & Astrophysics, vol. 620. EDP Sciences, 2018.'
ista: 'Bugnet LA, García RA, Davies GR, Mathur S, Corsaro E, Hall OJ, Rendle BM.
2018. FliPer: A global measure of power density to estimate surface gravities
of main-sequence solar-like stars and red giants. Astronomy & Astrophysics.
620, A38.'
mla: 'Bugnet, Lisa Annabelle, et al. “FliPer: A Global Measure of Power Density
to Estimate Surface Gravities of Main-Sequence Solar-like Stars and Red Giants.”
Astronomy & Astrophysics, vol. 620, A38, EDP Sciences, 2018, doi:10.1051/0004-6361/201833106.'
short: L.A. Bugnet, R.A. García, G.R. Davies, S. Mathur, E. Corsaro, O.J. Hall,
B.M. Rendle, Astronomy & Astrophysics 620 (2018).
date_created: 2022-07-18T14:37:39Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2022-08-22T07:41:07Z
day: '01'
doi: 10.1051/0004-6361/201833106
extern: '1'
external_id:
arxiv:
- '1809.05105'
intvolume: ' 620'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- asteroseismology / methods
- data analysis / stars
- oscillations
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1809.05105
month: '12'
oa: 1
oa_version: Preprint
publication: Astronomy & Astrophysics
publication_identifier:
eissn:
- 1432-0746
issn:
- 0004-6361
publication_status: published
publisher: EDP Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'FliPer: A global measure of power density to estimate surface gravities of
main-sequence solar-like stars and red giants'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 620
year: '2018'
...
---
_id: '11620'
abstract:
- lang: eng
text: We report the discovery and characterization of HD 89345b (K2-234b; EPIC 248777106b),
a Saturn-sized planet orbiting a slightly evolved star. HD 89345 is a bright star
(V = 9.3 mag) observed by the K2 mission with 1 min time sampling. It exhibits
solar-like oscillations. We conducted asteroseismology to determine the parameters
of the star, finding the mass and radius to be 1.12+0.04−0.01M⊙ and 1.657+0.020−0.004R⊙,
respectively. The star appears to have recently left the main sequence, based
on the inferred age, 9.4+0.4−1.3Gyr, and the non-detection of mixed modes. The
star hosts a ‘warm Saturn’ (P = 11.8 d, Rp = 6.86 ± 0.14 R⊕). Radial-velocity
follow-up observations performed with the FIbre-fed Echelle Spectrograph, HARPS,
and HARPS-N spectrographs show that the planet has a mass of 35.7 ± 3.3 M⊕. The
data also show that the planet’s orbit is eccentric (e ≈ 0.2). An investigation
of the rotational splitting of the oscillation frequencies of the star yields
no conclusive evidence on the stellar inclination angle. We further obtained Rossiter–McLaughlin
observations, which result in a broad posterior of the stellar obliquity. The
planet seems to confirm to the same patterns that have been observed for other
sub-Saturns regarding planet mass and multiplicity, orbital eccentricity, and
stellar metallicity.
acknowledgement: 'We gratefully acknowledge many helpful suggestions by the anonymous
referee. Based on observations made with a) the Nordic Optical Telescope, operated
by the Nordic Optical Telescope Scientific Association at the Observatorio del Roque
de los Muchachos; b) the ESO-3.6m telescope at La Silla Observatory under programme
ID 0100.C-0808; c) the Italian Telescopio Nazionale Galileo operated on the island
of La Palma by the Fundación Galileo Galilei of the Istituto Nazionale di Astrofisica.
NESSI was funded by the NASA Exoplanet Exploration Program and the NASA Ames Research
Center. NESSI was built at the Ames Research Center by Steve B. Howell, Nic Scott,
Elliott P. Horch, and Emmett Quigley. This project has received funding from the
European Union’s Horizon 2020 research and innovation programme under grant agreement
No 730890. This material reflects only the authors views and the Commission is not
liable for any use that may be made of the information contained therein. DG gratefully
acknowledges the financial support of the Programma Giovani Ricercatori – Rita Levi
Montalcini – Rientro dei Cervelli (2012) awarded by the Italian Ministry of Education,
Universities and Research (MIUR). SaM would like to acknowledge support from the
Ramon y Cajal fellowship number RYC-2015-17697. AJ, MH, and SA acknowledge support
by the Danish Council for Independent Research, through a DFF Sapere Aude Starting
Grant nr. 4181-00487B. SzCs, APH, MP, and HR acknowledge the support of the DFG
priority program SPP 1992Exploring the Diversity of Extrasolar Planets (grants HA
3279/12-1, PA 525/18-1, PA5 25/19-1 and PA525/20-1, RA 714/14-1) HD, CR, and FPH
acknowledge the financial support from MINECO under grants ESP2015-65712-C5-4-R
and AYA2016-76378-P. This paper has made use of the IAC Supercomputing facility
HTCondor (http://research.cs.wisc.edu/htcondor/), partly financed by the Ministry
of Economy and Competitiveness with FEDER funds, code IACA13-3E-2493. MF and CMP
gratefully acknowledge the support of the Swedish National Space Board. RAG and
StM thanks the support of the CNES PLATO grant. PGB is a postdoctoral fellow in
the MINECO-programme ’Juan de la Cierva Incorporacion’ (IJCI-2015-26034). StM acknowledges
support from ERC through SPIRE grant (647383) and from ISSI through the ENCELADE
2.0 team. VSA acknowledges support from VILLUM FONDEN (research grant 10118). MNL
acknowledges support from the ESA-PRODEX programme. Funding for the Stellar Astrophysics
Centre is provided by The Danish National Research Foundation (Grant agreement no.:
DNRF106) This work has made use of data from the European Space Agency (ESA) mission
Gaia (https://www.cosmos.esa.int/gaia), processed by the Gaia Data Processing and
Analysis Consortium (DPAC, https://www.cosmos.esa.int/web/gaia/dpac/consortium).
Funding for the DPAC has been provided by national institutions, in particular the
institutions participating in the Gaia Multilateral Agreement. This research was
made with the use of NASA’s Astrophysics Data System and the NASA Exoplanet Archive,
which is operated by the California Institute of Technology, under contract with
the National Aeronautics and Space Administration under the Exoplanet Exploration
Program.'
article_processing_charge: No
article_type: original
author:
- first_name: V
full_name: Van Eylen, V
last_name: Van Eylen
- first_name: F
full_name: Dai, F
last_name: Dai
- first_name: S
full_name: Mathur, S
last_name: Mathur
- first_name: D
full_name: Gandolfi, D
last_name: Gandolfi
- first_name: S
full_name: Albrecht, S
last_name: Albrecht
- first_name: M
full_name: Fridlund, M
last_name: Fridlund
- first_name: R A
full_name: García, R A
last_name: García
- first_name: E
full_name: Guenther, E
last_name: Guenther
- first_name: M
full_name: Hjorth, M
last_name: Hjorth
- first_name: A B
full_name: Justesen, A B
last_name: Justesen
- first_name: J
full_name: Livingston, J
last_name: Livingston
- first_name: M N
full_name: Lund, M N
last_name: Lund
- first_name: F
full_name: Pérez Hernández, F
last_name: Pérez Hernández
- first_name: J
full_name: Prieto-Arranz, J
last_name: Prieto-Arranz
- first_name: C
full_name: Regulo, C
last_name: Regulo
- first_name: Lisa Annabelle
full_name: Bugnet, Lisa Annabelle
id: d9edb345-f866-11ec-9b37-d119b5234501
last_name: Bugnet
orcid: 0000-0003-0142-4000
- first_name: M E
full_name: Everett, M E
last_name: Everett
- first_name: T
full_name: Hirano, T
last_name: Hirano
- first_name: D
full_name: Nespral, D
last_name: Nespral
- first_name: G
full_name: Nowak, G
last_name: Nowak
- first_name: E
full_name: Palle, E
last_name: Palle
- first_name: V
full_name: Silva Aguirre, V
last_name: Silva Aguirre
- first_name: T
full_name: Trifonov, T
last_name: Trifonov
- first_name: J N
full_name: Winn, J N
last_name: Winn
- first_name: O
full_name: Barragán, O
last_name: Barragán
- first_name: P G
full_name: Beck, P G
last_name: Beck
- first_name: W J
full_name: Chaplin, W J
last_name: Chaplin
- first_name: W D
full_name: Cochran, W D
last_name: Cochran
- first_name: S
full_name: Csizmadia, S
last_name: Csizmadia
- first_name: H
full_name: Deeg, H
last_name: Deeg
- first_name: M
full_name: Endl, M
last_name: Endl
- first_name: P
full_name: Heeren, P
last_name: Heeren
- first_name: S
full_name: Grziwa, S
last_name: Grziwa
- first_name: A P
full_name: Hatzes, A P
last_name: Hatzes
- first_name: D
full_name: Hidalgo, D
last_name: Hidalgo
- first_name: J
full_name: Korth, J
last_name: Korth
- first_name: S
full_name: Mathis, S
last_name: Mathis
- first_name: P
full_name: Montañes Rodriguez, P
last_name: Montañes Rodriguez
- first_name: N
full_name: Narita, N
last_name: Narita
- first_name: M
full_name: Patzold, M
last_name: Patzold
- first_name: C M
full_name: Persson, C M
last_name: Persson
- first_name: F
full_name: Rodler, F
last_name: Rodler
- first_name: A M S
full_name: Smith, A M S
last_name: Smith
citation:
ama: 'Van Eylen V, Dai F, Mathur S, et al. HD 89345: A bright oscillating star hosting
a transiting warm Saturn-sized planet observed by K2. Monthly Notices of the
Royal Astronomical Society. 2018;478(4):4866-4880. doi:10.1093/mnras/sty1390'
apa: 'Van Eylen, V., Dai, F., Mathur, S., Gandolfi, D., Albrecht, S., Fridlund,
M., … Smith, A. M. S. (2018). HD 89345: A bright oscillating star hosting a transiting
warm Saturn-sized planet observed by K2. Monthly Notices of the Royal Astronomical
Society. Oxford University Press. https://doi.org/10.1093/mnras/sty1390'
chicago: 'Van Eylen, V, F Dai, S Mathur, D Gandolfi, S Albrecht, M Fridlund, R A
García, et al. “HD 89345: A Bright Oscillating Star Hosting a Transiting Warm
Saturn-Sized Planet Observed by K2.” Monthly Notices of the Royal Astronomical
Society. Oxford University Press, 2018. https://doi.org/10.1093/mnras/sty1390.'
ieee: 'V. Van Eylen et al., “HD 89345: A bright oscillating star hosting
a transiting warm Saturn-sized planet observed by K2,” Monthly Notices of the
Royal Astronomical Society, vol. 478, no. 4. Oxford University Press, pp.
4866–4880, 2018.'
ista: 'Van Eylen V, Dai F, Mathur S, Gandolfi D, Albrecht S, Fridlund M, García
RA, Guenther E, Hjorth M, Justesen AB, Livingston J, Lund MN, Pérez Hernández
F, Prieto-Arranz J, Regulo C, Bugnet LA, Everett ME, Hirano T, Nespral D, Nowak
G, Palle E, Silva Aguirre V, Trifonov T, Winn JN, Barragán O, Beck PG, Chaplin
WJ, Cochran WD, Csizmadia S, Deeg H, Endl M, Heeren P, Grziwa S, Hatzes AP, Hidalgo
D, Korth J, Mathis S, Montañes Rodriguez P, Narita N, Patzold M, Persson CM, Rodler
F, Smith AMS. 2018. HD 89345: A bright oscillating star hosting a transiting warm
Saturn-sized planet observed by K2. Monthly Notices of the Royal Astronomical
Society. 478(4), 4866–4880.'
mla: 'Van Eylen, V., et al. “HD 89345: A Bright Oscillating Star Hosting a Transiting
Warm Saturn-Sized Planet Observed by K2.” Monthly Notices of the Royal Astronomical
Society, vol. 478, no. 4, Oxford University Press, 2018, pp. 4866–80, doi:10.1093/mnras/sty1390.'
short: V. Van Eylen, F. Dai, S. Mathur, D. Gandolfi, S. Albrecht, M. Fridlund, R.A.
García, E. Guenther, M. Hjorth, A.B. Justesen, J. Livingston, M.N. Lund, F. Pérez Hernández,
J. Prieto-Arranz, C. Regulo, L.A. Bugnet, M.E. Everett, T. Hirano, D. Nespral,
G. Nowak, E. Palle, V. Silva Aguirre, T. Trifonov, J.N. Winn, O. Barragán, P.G.
Beck, W.J. Chaplin, W.D. Cochran, S. Csizmadia, H. Deeg, M. Endl, P. Heeren, S.
Grziwa, A.P. Hatzes, D. Hidalgo, J. Korth, S. Mathis, P. Montañes Rodriguez, N.
Narita, M. Patzold, C.M. Persson, F. Rodler, A.M.S. Smith, Monthly Notices of
the Royal Astronomical Society 478 (2018) 4866–4880.
date_created: 2022-07-18T14:43:17Z
date_published: 2018-08-01T00:00:00Z
date_updated: 2022-08-22T07:45:38Z
day: '01'
doi: 10.1093/mnras/sty1390
extern: '1'
external_id:
arxiv:
- '1805.01860'
intvolume: ' 478'
issue: '4'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- asteroseismology
- 'planets and satellites: composition'
- 'planets and satellites: formation'
- 'planets and satellites: fundamental parameters'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1805.01860
month: '08'
oa: 1
oa_version: Preprint
page: 4866-4880
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
eissn:
- 1365-2966
issn:
- 0035-8711
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'HD 89345: A bright oscillating star hosting a transiting warm Saturn-sized
planet observed by K2'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 478
year: '2018'
...
---
_id: '11631'
abstract:
- lang: eng
text: "The recently launched NASA Transiting Exoplanet Survey Satellite (TESS) mission
is going to collect lightcurves for a few hundred million of stars and we expect
to increase the number of pulsating stars to analyze compared to the few thousand
stars observed by the CoRoT, Kepler and K2 missions. However, most of the TESS
targets have not yet been properly classified and characterized. In order to improve
the analysis of the TESS data, it is crucial to determine the type of stellar
pulsations in a timely manner. We propose an automatic method to classify stars
attending to their pulsation properties, in particular, to identify solar-like
pulsators among all TESS targets. It relies on the use of the global amount of
power contained in the power spectrum (already known as the FliPer method) as
a key parameter, along with\r\nthe effective temperature, to feed into a machine
learning classifier. Our study, based on TESS simulated datasets, shows that we
are able to classify pulsators with a 98% accuracy."
article_number: '1811.12140'
article_processing_charge: No
author:
- first_name: Lisa Annabelle
full_name: Bugnet, Lisa Annabelle
id: d9edb345-f866-11ec-9b37-d119b5234501
last_name: Bugnet
orcid: 0000-0003-0142-4000
- first_name: R. A.
full_name: García, R. A.
last_name: García
- first_name: G. R.
full_name: Davies, G. R.
last_name: Davies
- first_name: S.
full_name: Mathur, S.
last_name: Mathur
- first_name: O. J.
full_name: Hall, O. J.
last_name: Hall
- first_name: B. M.
full_name: Rendle, B. M.
last_name: Rendle
citation:
ama: 'Bugnet LA, García RA, Davies GR, Mathur S, Hall OJ, Rendle BM. FliPer: Classifying
TESS pulsating stars. arXiv. doi:10.48550/arXiv.1811.12140'
apa: 'Bugnet, L. A., García, R. A., Davies, G. R., Mathur, S., Hall, O. J., &
Rendle, B. M. (n.d.). FliPer: Classifying TESS pulsating stars. arXiv.
https://doi.org/10.48550/arXiv.1811.12140'
chicago: 'Bugnet, Lisa Annabelle, R. A. García, G. R. Davies, S. Mathur, O. J. Hall,
and B. M. Rendle. “FliPer: Classifying TESS Pulsating Stars.” ArXiv, n.d.
https://doi.org/10.48550/arXiv.1811.12140.'
ieee: 'L. A. Bugnet, R. A. García, G. R. Davies, S. Mathur, O. J. Hall, and B. M.
Rendle, “FliPer: Classifying TESS pulsating stars,” arXiv. .'
ista: 'Bugnet LA, García RA, Davies GR, Mathur S, Hall OJ, Rendle BM. FliPer: Classifying
TESS pulsating stars. arXiv, 1811.12140.'
mla: 'Bugnet, Lisa Annabelle, et al. “FliPer: Classifying TESS Pulsating Stars.”
ArXiv, 1811.12140, doi:10.48550/arXiv.1811.12140.'
short: L.A. Bugnet, R.A. García, G.R. Davies, S. Mathur, O.J. Hall, B.M. Rendle,
ArXiv (n.d.).
date_created: 2022-07-21T07:05:23Z
date_published: 2018-11-29T00:00:00Z
date_updated: 2022-08-22T08:41:55Z
day: '29'
doi: 10.48550/arXiv.1811.12140
extern: '1'
external_id:
arxiv:
- '1811.12140'
keyword:
- asteroseismology - methods
- data analysis - stars
- oscillations
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.1811.12140'
month: '11'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
status: public
title: 'FliPer: Classifying TESS pulsating stars'
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '11657'
abstract:
- lang: eng
text: The minimum cut problem for an undirected edge-weighted graph asks us to divide
its set of nodes into two blocks while minimizing the weight sum of the cut edges.
Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our algorithm
is based on cluster contraction using label propagation and Padberg and Rinaldi’s
contraction heuristics [SIAM Review, 1991]. We give both sequential and shared-memory
parallel implementations of our algorithm. Extensive experiments on both real-world
and generated instances show that our algorithm finds the optimal cut on nearly
all instances significantly faster than other state-of-the-art exact algorithms,
and our error rate is lower than that of other heuristic algorithms. In addition,
our parallel algorithm runs a factor 7.5× faster on average when using 32 threads.
To further speed up computations, we also give a version of our algorithm that
performs random edge contractions as preprocessing. This version achieves a lower
running time and better parallel scalability at the expense of a higher error
rate.
article_processing_charge: No
article_type: original
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Alexander
full_name: Noe, Alexander
last_name: Noe
- first_name: Christian
full_name: Schulz, Christian
last_name: Schulz
- first_name: Darren
full_name: Strash, Darren
last_name: Strash
citation:
ama: Henzinger MH, Noe A, Schulz C, Strash D. Practical minimum cut algorithms.
ACM Journal of Experimental Algorithmics. 2018;23:1-22. doi:10.1145/3274662
apa: Henzinger, M. H., Noe, A., Schulz, C., & Strash, D. (2018). Practical minimum
cut algorithms. ACM Journal of Experimental Algorithmics. Association for
Computing Machinery. https://doi.org/10.1145/3274662
chicago: Henzinger, Monika H, Alexander Noe, Christian Schulz, and Darren Strash.
“Practical Minimum Cut Algorithms.” ACM Journal of Experimental Algorithmics.
Association for Computing Machinery, 2018. https://doi.org/10.1145/3274662.
ieee: M. H. Henzinger, A. Noe, C. Schulz, and D. Strash, “Practical minimum cut
algorithms,” ACM Journal of Experimental Algorithmics, vol. 23. Association
for Computing Machinery, pp. 1–22, 2018.
ista: Henzinger MH, Noe A, Schulz C, Strash D. 2018. Practical minimum cut algorithms.
ACM Journal of Experimental Algorithmics. 23, 1–22.
mla: Henzinger, Monika H., et al. “Practical Minimum Cut Algorithms.” ACM Journal
of Experimental Algorithmics, vol. 23, Association for Computing Machinery,
2018, pp. 1–22, doi:10.1145/3274662.
short: M.H. Henzinger, A. Noe, C. Schulz, D. Strash, ACM Journal of Experimental
Algorithmics 23 (2018) 1–22.
date_created: 2022-07-27T08:28:26Z
date_published: 2018-10-01T00:00:00Z
date_updated: 2022-09-09T11:32:52Z
day: '01'
doi: 10.1145/3274662
extern: '1'
external_id:
arxiv:
- '1708.06127'
intvolume: ' 23'
keyword:
- Theoretical Computer Science
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1708.06127
month: '10'
oa: 1
oa_version: Preprint
page: 1-22
publication: ACM Journal of Experimental Algorithmics
publication_identifier:
eissn:
- 1084-6654
issn:
- 1084-6654
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Practical minimum cut algorithms
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2018'
...
---
_id: '11667'
abstract:
- lang: eng
text: The focus of classic mechanism design has been on truthful direct-revelation
mechanisms. In the context of combinatorial auctions, the truthful direct-revelation
mechanism that maximizes social welfare is the Vickrey-Clarke-Groves mechanism.
For many valuation spaces, computing the allocation and payments of the VCG mechanism,
however, is a computationally hard problem. We thus study the performance of the
VCG mechanism when bidders are forced to choose bids from a subspace of the valuation
space for which the VCG outcome can be computed efficiently. We prove improved
upper bounds on the welfare loss for restrictions to additive bids and upper and
lower bounds for restrictions to non-additive bids. These bounds show that increased
expressiveness can give rise to additional equilibria of poorer efficiency.
article_number: '5'
article_processing_charge: No
article_type: original
author:
- first_name: Paul
full_name: Dütting, Paul
last_name: Dütting
- 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: Martin
full_name: Starnberger, Martin
last_name: Starnberger
citation:
ama: Dütting P, Henzinger MH, Starnberger M. Valuation compressions in VCG-based
combinatorial auctions. ACM Transactions on Economics and Computation.
2018;6(2). doi:10.1145/3232860
apa: Dütting, P., Henzinger, M. H., & Starnberger, M. (2018). Valuation compressions
in VCG-based combinatorial auctions. ACM Transactions on Economics and Computation.
Association for Computing Machinery. https://doi.org/10.1145/3232860
chicago: Dütting, Paul, Monika H Henzinger, and Martin Starnberger. “Valuation Compressions
in VCG-Based Combinatorial Auctions.” ACM Transactions on Economics and Computation.
Association for Computing Machinery, 2018. https://doi.org/10.1145/3232860.
ieee: P. Dütting, M. H. Henzinger, and M. Starnberger, “Valuation compressions in
VCG-based combinatorial auctions,” ACM Transactions on Economics and Computation,
vol. 6, no. 2. Association for Computing Machinery, 2018.
ista: Dütting P, Henzinger MH, Starnberger M. 2018. Valuation compressions in VCG-based
combinatorial auctions. ACM Transactions on Economics and Computation. 6(2), 5.
mla: Dütting, Paul, et al. “Valuation Compressions in VCG-Based Combinatorial Auctions.”
ACM Transactions on Economics and Computation, vol. 6, no. 2, 5, Association
for Computing Machinery, 2018, doi:10.1145/3232860.
short: P. Dütting, M.H. Henzinger, M. Starnberger, ACM Transactions on Economics
and Computation 6 (2018).
date_created: 2022-07-27T11:46:46Z
date_published: 2018-05-01T00:00:00Z
date_updated: 2022-09-09T12:04:42Z
day: '01'
doi: 10.1145/3232860
extern: '1'
external_id:
arxiv:
- '1310.3153'
intvolume: ' 6'
issue: '2'
keyword:
- Theory of computation
- Algorithmic game theory and mechanism design
- Applied computing
- Economics
- Simplified mechanisms
- Combinatorial auctions with item bidding
- Price of anarchy
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1310.3153
month: '05'
oa: 1
oa_version: Preprint
publication: ACM Transactions on Economics and Computation
publication_identifier:
eissn:
- 2167-8383
issn:
- 2167-8375
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Valuation compressions in VCG-based combinatorial auctions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2018'
...
---
_id: '11664'
abstract:
- lang: eng
text: "We present a deterministic incremental algorithm for exactly maintaining
the size of a minimum cut with O(log3 n log log2 n) amortized time per edge insertion
and O(1) query time. This result partially answers an open question posed by Thorup
(2007). It also stays in sharp contrast to a polynomial conditional lower bound
for the fully dynamic weighted minimum cut problem. Our algorithm is obtained
by combining a sparsification technique of Kawarabayashi and Thorup (2015) or
its recent improvement by Henzinger, Rao, and Wang (2017), and an exact incremental
algorithm of Henzinger (1997).\r\n\r\nWe also study space-efficient incremental
algorithms for the minimum cut problem. Concretely, we show that there exists
an O(nlog n/ε2) space Monte Carlo algorithm that can process a stream of edge
insertions starting from an empty graph, and with high probability, the algorithm
maintains a (1+ε)-approximation to the minimum cut. The algorithm has O((α (n)
log3 n)/ε 2) amortized update time and constant query time, where α (n) stands
for the inverse of Ackermann function."
acknowledgement: "We thank the two anonymous reviewers for their suggestions and comments,
which improved the\r\nquality of the article."
article_number: '17'
article_processing_charge: No
article_type: original
author:
- first_name: Gramoz
full_name: Goranci, Gramoz
last_name: Goranci
- 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: Mikkel
full_name: Thorup, Mikkel
last_name: Thorup
citation:
ama: Goranci G, Henzinger MH, Thorup M. Incremental exact min-cut in polylogarithmic
amortized update time. ACM Transactions on Algorithms. 2018;14(2). doi:10.1145/3174803
apa: Goranci, G., Henzinger, M. H., & Thorup, M. (2018). Incremental exact min-cut
in polylogarithmic amortized update time. ACM Transactions on Algorithms.
Association for Computing Machinery. https://doi.org/10.1145/3174803
chicago: Goranci, Gramoz, Monika H Henzinger, and Mikkel Thorup. “Incremental Exact
Min-Cut in Polylogarithmic Amortized Update Time.” ACM Transactions on Algorithms.
Association for Computing Machinery, 2018. https://doi.org/10.1145/3174803.
ieee: G. Goranci, M. H. Henzinger, and M. Thorup, “Incremental exact min-cut in
polylogarithmic amortized update time,” ACM Transactions on Algorithms,
vol. 14, no. 2. Association for Computing Machinery, 2018.
ista: Goranci G, Henzinger MH, Thorup M. 2018. Incremental exact min-cut in polylogarithmic
amortized update time. ACM Transactions on Algorithms. 14(2), 17.
mla: Goranci, Gramoz, et al. “Incremental Exact Min-Cut in Polylogarithmic Amortized
Update Time.” ACM Transactions on Algorithms, vol. 14, no. 2, 17, Association
for Computing Machinery, 2018, doi:10.1145/3174803.
short: G. Goranci, M.H. Henzinger, M. Thorup, ACM Transactions on Algorithms 14
(2018).
date_created: 2022-07-27T11:29:39Z
date_published: 2018-04-01T00:00:00Z
date_updated: 2022-09-09T11:38:14Z
day: '01'
doi: 10.1145/3174803
extern: '1'
external_id:
arxiv:
- '1611.06500'
intvolume: ' 14'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1611.06500
month: '04'
oa: 1
oa_version: Preprint
publication: ACM Transactions on Algorithms
publication_identifier:
eissn:
- 1549-6333
issn:
- 1549-6325
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Incremental exact min-cut in polylogarithmic amortized update time
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 14
year: '2018'
...
---
_id: '11757'
abstract:
- lang: eng
text: We develop a dynamic version of the primal-dual method for optimization problems,
and apply it to obtain the following results. (1) For the dynamic set-cover problem,
we maintain an O ( f 2)-approximately optimal solution in O ( f · log(m + n))
amortized update time, where f is the maximum “frequency” of an element, n is
the number of sets, and m is the maximum number of elements in the universe at
any point in time. (2) For the dynamic b-matching problem, we maintain an O (1)-approximately
optimal solution in O (log3 n) amortized update time, where n is the number of
nodes in the graph.
article_processing_charge: No
article_type: original
author:
- first_name: Sayan
full_name: Bhattacharya, Sayan
last_name: Bhattacharya
- 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: Giuseppe
full_name: Italiano, Giuseppe
last_name: Italiano
citation:
ama: Bhattacharya S, Henzinger MH, Italiano G. Dynamic algorithms via the primal-dual
method. Information and Computation. 2018;261(08):219-239. doi:10.1016/j.ic.2018.02.005
apa: Bhattacharya, S., Henzinger, M. H., & Italiano, G. (2018). Dynamic algorithms
via the primal-dual method. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2018.02.005
chicago: Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe Italiano. “Dynamic
Algorithms via the Primal-Dual Method.” Information and Computation. Elsevier,
2018. https://doi.org/10.1016/j.ic.2018.02.005.
ieee: S. Bhattacharya, M. H. Henzinger, and G. Italiano, “Dynamic algorithms via
the primal-dual method,” Information and Computation, vol. 261, no. 08.
Elsevier, pp. 219–239, 2018.
ista: Bhattacharya S, Henzinger MH, Italiano G. 2018. Dynamic algorithms via the
primal-dual method. Information and Computation. 261(08), 219–239.
mla: Bhattacharya, Sayan, et al. “Dynamic Algorithms via the Primal-Dual Method.”
Information and Computation, vol. 261, no. 08, Elsevier, 2018, pp. 219–39,
doi:10.1016/j.ic.2018.02.005.
short: S. Bhattacharya, M.H. Henzinger, G. Italiano, Information and Computation
261 (2018) 219–239.
date_created: 2022-08-08T11:20:03Z
date_published: 2018-08-01T00:00:00Z
date_updated: 2023-02-10T07:27:39Z
day: '01'
doi: 10.1016/j.ic.2018.02.005
extern: '1'
intvolume: ' 261'
issue: '08'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.ic.2018.02.005
month: '08'
oa: 1
oa_version: Published Version
page: 219-239
publication: Information and Computation
publication_identifier:
issn:
- 0890-5401
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dynamic algorithms via the primal-dual method
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 261
year: '2018'
...
---
_id: '11828'
abstract:
- lang: eng
text: "We consider the problem of dynamically maintaining (approximate) all-pairs
effective resistances in separable graphs, which are those that admit an n^{c}-separator
theorem for some c<1. We give a fully dynamic algorithm that maintains (1+epsilon)-approximations
of the all-pairs effective resistances of an n-vertex graph G undergoing edge
insertions and deletions with O~(sqrt{n}/epsilon^2) worst-case update time and
O~(sqrt{n}/epsilon^2) worst-case query time, if G is guaranteed to be sqrt{n}-separable
(i.e., it is taken from a class satisfying a sqrt{n}-separator theorem) and its
separator can be computed in O~(n) time. Our algorithm is built upon a dynamic
algorithm for maintaining approximate Schur complement that approximately preserves
pairwise effective resistances among a set of terminals for separable graphs,
which might be of independent interest.\r\nWe complement our result by proving
that for any two fixed vertices s and t, no incremental or decremental algorithm
can maintain the s-t effective resistance for sqrt{n}-separable graphs with worst-case
update time O(n^{1/2-delta}) and query time O(n^{1-delta}) for any delta>0, unless
the Online Matrix Vector Multiplication (OMv) conjecture is false.\r\nWe further
show that for general graphs, no incremental or decremental algorithm can maintain
the s-t effective resistance problem with worst-case update time O(n^{1-delta})
and query-time O(n^{2-delta}) for any delta >0, unless the OMv conjecture is false."
alternative_title:
- LIPIcs
article_number: '40'
article_processing_charge: No
author:
- first_name: Gramoz
full_name: Goranci, Gramoz
last_name: Goranci
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Pan
full_name: Peng, Pan
last_name: Peng
citation:
ama: 'Goranci G, Henzinger MH, Peng P. Dynamic effective resistances and approximate
schur complement on separable graphs. In: 26th Annual European Symposium on
Algorithms. Vol 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018.
doi:10.4230/LIPICS.ESA.2018.40'
apa: 'Goranci, G., Henzinger, M. H., & Peng, P. (2018). Dynamic effective resistances
and approximate schur complement on separable graphs. In 26th Annual European
Symposium on Algorithms (Vol. 112). Helsinki, Finland: Schloss Dagstuhl -
Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2018.40'
chicago: Goranci, Gramoz, Monika H Henzinger, and Pan Peng. “Dynamic Effective Resistances
and Approximate Schur Complement on Separable Graphs.” In 26th Annual European
Symposium on Algorithms, Vol. 112. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2018. https://doi.org/10.4230/LIPICS.ESA.2018.40.
ieee: G. Goranci, M. H. Henzinger, and P. Peng, “Dynamic effective resistances and
approximate schur complement on separable graphs,” in 26th Annual European
Symposium on Algorithms, Helsinki, Finland, 2018, vol. 112.
ista: 'Goranci G, Henzinger MH, Peng P. 2018. Dynamic effective resistances and
approximate schur complement on separable graphs. 26th Annual European Symposium
on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 112,
40.'
mla: Goranci, Gramoz, et al. “Dynamic Effective Resistances and Approximate Schur
Complement on Separable Graphs.” 26th Annual European Symposium on Algorithms,
vol. 112, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.ESA.2018.40.
short: G. Goranci, M.H. Henzinger, P. Peng, in:, 26th Annual European Symposium
on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
conference:
end_date: 2018-08-22
location: Helsinki, Finland
name: 'ESA: Annual European Symposium on Algorithms'
start_date: 2018-08-20
date_created: 2022-08-12T08:26:42Z
date_published: 2018-08-14T00:00:00Z
date_updated: 2023-02-16T11:08:08Z
day: '14'
doi: 10.4230/LIPICS.ESA.2018.40
extern: '1'
external_id:
arxiv:
- '1802.09111'
intvolume: ' 112'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4230/LIPIcs.ESA.2018.40
month: '08'
oa: 1
oa_version: Published Version
publication: 26th Annual European Symposium on Algorithms
publication_identifier:
isbn:
- '9783959770811'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dynamic effective resistances and approximate schur complement on separable
graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 112
year: '2018'
...
---
_id: '11827'
abstract:
- lang: eng
text: We study the metric facility location problem with client insertions and deletions.
This setting differs from the classic dynamic facility location problem, where
the set of clients remains the same, but the metric space can change over time.
We show a deterministic algorithm that maintains a constant factor approximation
to the optimal solution in worst-case time O~(2^{O(kappa^2)}) per client insertion
or deletion in metric spaces while answering queries about the cost in O(1) time,
where kappa denotes the doubling dimension of the metric. For metric spaces with
bounded doubling dimension, the update time is polylogarithmic in the parameters
of the problem.
alternative_title:
- LIPIcs
article_number: '39'
article_processing_charge: No
author:
- first_name: 'Gramoz '
full_name: 'Goranci, Gramoz '
last_name: Goranci
- 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: Dariusz
full_name: Leniowski, Dariusz
last_name: Leniowski
citation:
ama: 'Goranci G, Henzinger MH, Leniowski D. A tree structure for dynamic facility
location. In: 26th Annual European Symposium on Algorithms. Vol 112. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.ESA.2018.39'
apa: 'Goranci, G., Henzinger, M. H., & Leniowski, D. (2018). A tree structure
for dynamic facility location. In 26th Annual European Symposium on Algorithms
(Vol. 112). Helsinki, Finland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPICS.ESA.2018.39'
chicago: Goranci, Gramoz , Monika H Henzinger, and Dariusz Leniowski. “A Tree Structure
for Dynamic Facility Location.” In 26th Annual European Symposium on Algorithms,
Vol. 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.ESA.2018.39.
ieee: G. Goranci, M. H. Henzinger, and D. Leniowski, “A tree structure for dynamic
facility location,” in 26th Annual European Symposium on Algorithms, Helsinki,
Finland, 2018, vol. 112.
ista: 'Goranci G, Henzinger MH, Leniowski D. 2018. A tree structure for dynamic
facility location. 26th Annual European Symposium on Algorithms. ESA: Annual European
Symposium on Algorithms, LIPIcs, vol. 112, 39.'
mla: Goranci, Gramoz, et al. “A Tree Structure for Dynamic Facility Location.” 26th
Annual European Symposium on Algorithms, vol. 112, 39, Schloss Dagstuhl -
Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.ESA.2018.39.
short: G. Goranci, M.H. Henzinger, D. Leniowski, in:, 26th Annual European Symposium
on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
conference:
end_date: 2018-08-22
location: Helsinki, Finland
name: 'ESA: Annual European Symposium on Algorithms'
start_date: 2018-08-20
date_created: 2022-08-12T08:20:57Z
date_published: 2018-08-14T00:00:00Z
date_updated: 2023-02-16T10:50:51Z
day: '14'
doi: 10.4230/LIPICS.ESA.2018.39
extern: '1'
external_id:
arxiv:
- '1909.06653'
intvolume: ' 112'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4230/LIPIcs.ESA.2018.39
month: '08'
oa: 1
oa_version: Published Version
publication: 26th Annual European Symposium on Algorithms
publication_identifier:
isbn:
- '9783959770811'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: A tree structure for dynamic facility location
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 112
year: '2018'
...
---
_id: '11768'
abstract:
- lang: eng
text: "In the decremental single-source shortest paths (SSSP) problem, we want to
maintain the distances between a given source node s and every other node in an
n-node m-edge graph G undergoing edge deletions. While its static counterpart
can be solved in near-linear time, this decremental problem is much more challenging
even in the undirected unweighted case. In this case, the classic O(mn) total
update time of Even and Shiloach [16] has been the fastest known algorithm for
three decades. At the cost of a (1+ϵ)-approximation factor, the running time was
recently improved to n2+o(1) by Bernstein and Roditty [9]. In this article, we
bring the running time down to near-linear: We give a (1+ϵ)-approximation algorithm
with m1+o(1) expected total update time, thus obtaining near-linear time. Moreover,
we obtain m1+o(1) log W time for the weighted case, where the edge weights are
integers from 1 to W. The only prior work on weighted graphs in o(mn) time is
the mn0.9 + o(1)-time algorithm by Henzinger et al. [18, 19], which works for
directed graphs with quasi-polynomial edge weights. The expected running time
bound of our algorithm holds against an oblivious adversary.\r\n\r\nIn contrast
to the previous results, which rely on maintaining a sparse emulator, our algorithm
relies on maintaining a so-called sparse (h, ϵ)-hop set introduced by Cohen [12]
in the PRAM literature. An (h, ϵ)-hop set of a graph G=(V, E) is a set F of weighted
edges such that the distance between any pair of nodes in G can be (1+ϵ)-approximated
by their h-hop distance (given by a path containing at most h edges) on G′=(V,
E ∪ F). Our algorithm can maintain an (no(1), ϵ)-hop set of near-linear size in
near-linear time under edge deletions. It is the first of its kind to the best
of our knowledge. To maintain approximate distances using this hop set, we extend
the monotone Even-Shiloach tree of Henzinger et al. [20] and combine it with the
bounded-hop SSSP technique of Bernstein [4, 5] and Mądry [27]. These two new tools
might be of independent interest."
article_processing_charge: No
article_type: original
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Sebastian
full_name: Krinninger, Sebastian
last_name: Krinninger
- first_name: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
citation:
ama: Henzinger MH, Krinninger S, Nanongkai D. Decremental single-source shortest
paths on undirected graphs in near-linear total update time. Journal of the
ACM. 2018;65(6):1-40. doi:10.1145/3218657
apa: Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2018). Decremental single-source
shortest paths on undirected graphs in near-linear total update time. Journal
of the ACM. Association for Computing Machinery. https://doi.org/10.1145/3218657
chicago: Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Decremental
Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update
Time.” Journal of the ACM. Association for Computing Machinery, 2018. https://doi.org/10.1145/3218657.
ieee: M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Decremental single-source
shortest paths on undirected graphs in near-linear total update time,” Journal
of the ACM, vol. 65, no. 6. Association for Computing Machinery, pp. 1–40,
2018.
ista: Henzinger MH, Krinninger S, Nanongkai D. 2018. Decremental single-source shortest
paths on undirected graphs in near-linear total update time. Journal of the ACM.
65(6), 1–40.
mla: Henzinger, Monika H., et al. “Decremental Single-Source Shortest Paths on Undirected
Graphs in near-Linear Total Update Time.” Journal of the ACM, vol. 65,
no. 6, Association for Computing Machinery, 2018, pp. 1–40, doi:10.1145/3218657.
short: M.H. Henzinger, S. Krinninger, D. Nanongkai, Journal of the ACM 65 (2018)
1–40.
date_created: 2022-08-08T12:33:17Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2023-02-21T16:30:41Z
day: '01'
doi: 10.1145/3218657
extern: '1'
external_id:
arxiv:
- '1512.08148'
intvolume: ' 65'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1512.08148
month: '12'
oa: 1
oa_version: Preprint
page: 1-40
publication: Journal of the ACM
publication_identifier:
eissn:
- 1557-735X
issn:
- 0004-5411
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '11855'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Decremental single-source shortest paths on undirected graphs in near-linear
total update time
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 65
year: '2018'
...
---
_id: '11872'
abstract:
- lang: eng
text: We design fast dynamic algorithms for proper vertex and edge colorings in
a graph undergoing edge insertions and deletions. In the static setting, there
are simple linear time algorithms for (Δ + 1)- vertex coloring and (2Δ – 1)-edge
coloring in a graph with maximum degree Δ. It is natural to ask if we can efficiently
maintain such colorings in the dynamic setting as well. We get the following three
results. (1) We present a randomized algorithm which maintains a (Δ + 1)-vertex
coloring with O(log Δ) expected amortized update time. (2) We present a deterministic
algorithm which maintains a (1 + o(1)Δ-vertex coloring with O(polylog Δ) amortized
update time. (3) We present a simple, deterministic algorithm which maintains
a (2Δ – 1)-edge coloring with O(log Δ) worst-case update time. This improves the
recent O(Δ)-edge coloring algorithm with worst-case update time [4].
article_processing_charge: No
author:
- first_name: Sayan
full_name: Bhattacharya, Sayan
last_name: Bhattacharya
- first_name: Deeparnab
full_name: Chakrabarty, Deeparnab
last_name: Chakrabarty
- 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: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
citation:
ama: 'Bhattacharya S, Chakrabarty D, Henzinger MH, Nanongkai D. Dynamic algorithms
for graph coloring. In: 29th Annual ACM-SIAM Symposium on Discrete Algorithms.
Society for Industrial and Applied Mathematics; 2018:1-20. doi:10.1137/1.9781611975031.1'
apa: 'Bhattacharya, S., Chakrabarty, D., Henzinger, M. H., & Nanongkai, D. (2018).
Dynamic algorithms for graph coloring. In 29th Annual ACM-SIAM Symposium on
Discrete Algorithms (pp. 1–20). New Orleans, LA, United States: Society for
Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975031.1'
chicago: Bhattacharya, Sayan, Deeparnab Chakrabarty, Monika H Henzinger, and Danupon
Nanongkai. “Dynamic Algorithms for Graph Coloring.” In 29th Annual ACM-SIAM
Symposium on Discrete Algorithms, 1–20. Society for Industrial and Applied
Mathematics, 2018. https://doi.org/10.1137/1.9781611975031.1.
ieee: S. Bhattacharya, D. Chakrabarty, M. H. Henzinger, and D. Nanongkai, “Dynamic
algorithms for graph coloring,” in 29th Annual ACM-SIAM Symposium on Discrete
Algorithms, New Orleans, LA, United States, 2018, pp. 1–20.
ista: 'Bhattacharya S, Chakrabarty D, Henzinger MH, Nanongkai D. 2018. Dynamic algorithms
for graph coloring. 29th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA:
Symposium on Discrete Algorithms, 1–20.'
mla: Bhattacharya, Sayan, et al. “Dynamic Algorithms for Graph Coloring.” 29th
Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and
Applied Mathematics, 2018, pp. 1–20, doi:10.1137/1.9781611975031.1.
short: S. Bhattacharya, D. Chakrabarty, M.H. Henzinger, D. Nanongkai, in:, 29th
Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied
Mathematics, 2018, pp. 1–20.
conference:
end_date: 2018-01-10
location: New Orleans, LA, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2018-01-07
date_created: 2022-08-16T12:07:14Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2023-02-17T11:39:01Z
day: '01'
doi: 10.1137/1.9781611975031.1
extern: '1'
external_id:
arxiv:
- '1711.04355'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1711.04355
month: '01'
oa: 1
oa_version: Preprint
page: 1 - 20
publication: 29th Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
eisbn:
- 978-161197503-1
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dynamic algorithms for graph coloring
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '11882'
abstract:
- lang: eng
text: The minimum cut problem for an undirected edge-weighted graph asks us to divide
its set of nodes into two blocks while minimizing the weight sum of the cut edges.
Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our algorithm
is based on cluster contraction using label propagation and Padberg and Rinaldi's
contraction heuristics [SIAM Review, 1991]. We give both sequential and shared-memory
parallel implementations of our algorithm. Extensive experiments on both real-world
and generated instances show that our algorithm finds the optimal cut on nearly
all instances significantly faster than other state-of-the-art exact algorithms,
and our error rate is lower than that of other heuristic algorithms. In addition,
our parallel algorithm shows good scalability.
article_processing_charge: No
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Alexander
full_name: Noe, Alexander
last_name: Noe
- first_name: Christian
full_name: Schulz, Christian
last_name: Schulz
- first_name: Darren
full_name: Strash, Darren
last_name: Strash
citation:
ama: 'Henzinger MH, Noe A, Schulz C, Strash D. Practical minimum cut algorithms.
In: 20th Workshop on Algorithm Engineering and Experiments. Society for
Industrial and Applied Mathematics; 2018:48-61. doi:10.1137/1.9781611975055.5'
apa: 'Henzinger, M. H., Noe, A., Schulz, C., & Strash, D. (2018). Practical
minimum cut algorithms. In 20th Workshop on Algorithm Engineering and Experiments
(pp. 48–61). New Orleans, LA, United States: Society for Industrial and Applied
Mathematics. https://doi.org/10.1137/1.9781611975055.5'
chicago: Henzinger, Monika H, Alexander Noe, Christian Schulz, and Darren Strash.
“Practical Minimum Cut Algorithms.” In 20th Workshop on Algorithm Engineering
and Experiments, 48–61. Society for Industrial and Applied Mathematics, 2018.
https://doi.org/10.1137/1.9781611975055.5.
ieee: M. H. Henzinger, A. Noe, C. Schulz, and D. Strash, “Practical minimum cut
algorithms,” in 20th Workshop on Algorithm Engineering and Experiments,
New Orleans, LA, United States, 2018, pp. 48–61.
ista: 'Henzinger MH, Noe A, Schulz C, Strash D. 2018. Practical minimum cut algorithms.
20th Workshop on Algorithm Engineering and Experiments. ALENEX: Symposium on Algorithm
Engineering and Experiments, 48–61.'
mla: Henzinger, Monika H., et al. “Practical Minimum Cut Algorithms.” 20th Workshop
on Algorithm Engineering and Experiments, Society for Industrial and Applied
Mathematics, 2018, pp. 48–61, doi:10.1137/1.9781611975055.5.
short: M.H. Henzinger, A. Noe, C. Schulz, D. Strash, in:, 20th Workshop on Algorithm
Engineering and Experiments, Society for Industrial and Applied Mathematics, 2018,
pp. 48–61.
conference:
end_date: 2018-01-08
location: New Orleans, LA, United States
name: 'ALENEX: Symposium on Algorithm Engineering and Experiments'
start_date: 2018-01-07
date_created: 2022-08-17T07:04:57Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2023-02-17T14:03:39Z
day: '01'
doi: 10.1137/1.9781611975055.5
extern: '1'
external_id:
arxiv:
- '1708.06127'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1708.06127
month: '01'
oa: 1
oa_version: Preprint
page: 48-61
publication: 20th Workshop on Algorithm Engineering and Experiments
publication_identifier:
eisbn:
- 978-1-61197-505-5
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Practical minimum cut algorithms
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '11890'
abstract:
- lang: eng
text: "We present the first deterministic data structures for maintaining approximate
minimum vertex cover and maximum matching in a fully dynamic graph \U0001D43A=(\U0001D449,\U0001D438),
with |\U0001D449|=\U0001D45B and |\U0001D438|=\U0001D45A, in \U0001D45C(\U0001D45A‾‾√)
time per update. In particular, for minimum vertex cover, we provide deterministic
data structures for maintaining a (2+\U0001D716) approximation in \U0001D442(log\U0001D45B/\U0001D7162)
amortized time per update. For maximum matching, we show how to maintain a (3+\U0001D716)
approximation in \U0001D442(min(\U0001D45B√/\U0001D716,\U0001D45A1/3/\U0001D7162)
amortized time per update and a (4+\U0001D716) approximation in \U0001D442(\U0001D45A1/3/\U0001D7162)
worst-case time per update. Our data structure for fully dynamic minimum vertex
cover is essentially near-optimal and settles an open problem by Onak and Rubinfeld
[in 42nd ACM Symposium on Theory of Computing, Cambridge, MA, ACM, 2010, pp. 457--464]."
article_processing_charge: No
article_type: original
author:
- first_name: Sayan
full_name: Bhattacharya, Sayan
last_name: Bhattacharya
- 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: Giuseppe F.
full_name: Italiano, Giuseppe F.
last_name: Italiano
citation:
ama: Bhattacharya S, Henzinger MH, Italiano GF. Deterministic fully dynamic data
structures for vertex cover and matching. SIAM Journal on Computing. 2018;47(3):859-887.
doi:10.1137/140998925
apa: Bhattacharya, S., Henzinger, M. H., & Italiano, G. F. (2018). Deterministic
fully dynamic data structures for vertex cover and matching. SIAM Journal on
Computing. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/140998925
chicago: Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe F. Italiano. “Deterministic
Fully Dynamic Data Structures for Vertex Cover and Matching.” SIAM Journal
on Computing. Society for Industrial & Applied Mathematics, 2018. https://doi.org/10.1137/140998925.
ieee: S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Deterministic fully
dynamic data structures for vertex cover and matching,” SIAM Journal on Computing,
vol. 47, no. 3. Society for Industrial & Applied Mathematics, pp. 859–887,
2018.
ista: Bhattacharya S, Henzinger MH, Italiano GF. 2018. Deterministic fully dynamic
data structures for vertex cover and matching. SIAM Journal on Computing. 47(3),
859–887.
mla: Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Data Structures for
Vertex Cover and Matching.” SIAM Journal on Computing, vol. 47, no. 3,
Society for Industrial & Applied Mathematics, 2018, pp. 859–87, doi:10.1137/140998925.
short: S. Bhattacharya, M.H. Henzinger, G.F. Italiano, SIAM Journal on Computing
47 (2018) 859–887.
date_created: 2022-08-17T08:21:23Z
date_published: 2018-05-01T00:00:00Z
date_updated: 2023-02-21T16:31:30Z
day: '01'
doi: 10.1137/140998925
extern: '1'
external_id:
arxiv:
- '1412.1318'
intvolume: ' 47'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1412.1318
month: '05'
oa: 1
oa_version: Preprint
page: 859-887
publication: SIAM Journal on Computing
publication_identifier:
eissn:
- 1095-7111
issn:
- 0097-5397
publication_status: published
publisher: Society for Industrial & Applied Mathematics
quality_controlled: '1'
related_material:
record:
- id: '11875'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Deterministic fully dynamic data structures for vertex cover and matching
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 47
year: '2018'
...
---
_id: '11911'
abstract:
- lang: eng
text: It is common knowledge that there is no single best strategy for graph clustering,
which justifies a plethora of existing approaches. In this paper, we present a
general memetic algorithm, VieClus, to tackle the graph clustering problem. This
algorithm can be adapted to optimize different objective functions. A key component
of our contribution are natural recombine operators that employ ensemble clusterings
as well as multi-level techniques. Lastly, we combine these techniques with a
scalable communication protocol, producing a system that is able to compute high-quality
solutions in a short amount of time. We instantiate our scheme with local search
for modularity and show that our algorithm successfully improves or reproduces
all entries of the 10th DIMACS implementation challenge under consideration using
a small amount of time.
alternative_title:
- LIPIcs
article_number: '3'
article_processing_charge: No
author:
- first_name: Sonja
full_name: Biedermann, Sonja
last_name: Biedermann
- 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: Christian
full_name: Schulz, Christian
last_name: Schulz
- first_name: Bernhard
full_name: Schuster, Bernhard
last_name: Schuster
citation:
ama: 'Biedermann S, Henzinger MH, Schulz C, Schuster B. Memetic graph clustering.
In: 17th International Symposium on Experimental Algorithms. Vol 103. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.SEA.2018.3'
apa: 'Biedermann, S., Henzinger, M. H., Schulz, C., & Schuster, B. (2018). Memetic
graph clustering. In 17th International Symposium on Experimental Algorithms
(Vol. 103). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPICS.SEA.2018.3'
chicago: Biedermann, Sonja, Monika H Henzinger, Christian Schulz, and Bernhard Schuster.
“Memetic Graph Clustering.” In 17th International Symposium on Experimental
Algorithms, Vol. 103. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
https://doi.org/10.4230/LIPICS.SEA.2018.3.
ieee: S. Biedermann, M. H. Henzinger, C. Schulz, and B. Schuster, “Memetic graph
clustering,” in 17th International Symposium on Experimental Algorithms,
L’Aquila, Italy, 2018, vol. 103.
ista: 'Biedermann S, Henzinger MH, Schulz C, Schuster B. 2018. Memetic graph clustering.
17th International Symposium on Experimental Algorithms. SEA: Symposium on Experimental
Algorithms, LIPIcs, vol. 103, 3.'
mla: Biedermann, Sonja, et al. “Memetic Graph Clustering.” 17th International
Symposium on Experimental Algorithms, vol. 103, 3, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2018, doi:10.4230/LIPICS.SEA.2018.3.
short: S. Biedermann, M.H. Henzinger, C. Schulz, B. Schuster, in:, 17th International
Symposium on Experimental Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2018.
conference:
end_date: 2018-07-29
location: L'Aquila, Italy
name: 'SEA: Symposium on Experimental Algorithms'
start_date: 2018-07-27
date_created: 2022-08-18T06:49:40Z
date_published: 2018-07-01T00:00:00Z
date_updated: 2023-02-16T11:45:14Z
day: '01'
doi: 10.4230/LIPICS.SEA.2018.3
extern: '1'
external_id:
arxiv:
- '1802.07034'
intvolume: ' 103'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4230/LIPICS.SEA.2018.3
month: '07'
oa: 1
oa_version: Published Version
publication: 17th International Symposium on Experimental Algorithms
publication_identifier:
isbn:
- '9783959770705'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Memetic graph clustering
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 103
year: '2018'
...
---
_id: '11958'
abstract:
- lang: eng
text: Solid reagents, leaching catalysts, and heterogeneous photocatalysts are commonly
employed in batch processes but are ill-suited for continuous-flow chemistry.
Heterogeneous catalysts for thermal reactions are typically used in packed-bed
reactors, which cannot be penetrated by light and thus are not suitable for photocatalytic
reactions involving solids. We demonstrate that serial micro-batch reactors (SMBRs)
allow for the continuous utilization of solid materials together with liquids
and gases in flow. This technology was utilized to develop selective and efficient
fluorination reactions using a modified graphitic carbon nitride heterogeneous
catalyst instead of costly homogeneous metal polypyridyl complexes. The merger
of this inexpensive, recyclable catalyst and the SMBR approach enables sustainable
and scalable photocatalysis.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Bartholomäus
full_name: Pieber, Bartholomäus
id: 93e5e5b2-0da6-11ed-8a41-af589a024726
last_name: Pieber
orcid: 0000-0001-8689-388X
- first_name: Menny
full_name: Shalom, Menny
last_name: Shalom
- first_name: Markus
full_name: Antonietti, Markus
last_name: Antonietti
- first_name: Peter H.
full_name: Seeberger, Peter H.
last_name: Seeberger
- first_name: Kerry
full_name: Gilmore, Kerry
last_name: Gilmore
citation:
ama: Pieber B, Shalom M, Antonietti M, Seeberger PH, Gilmore K. Continuous heterogeneous
photocatalysis in serial micro-batch reactors. Angewandte Chemie International
Edition. 2018;57(31):9976-9979. doi:10.1002/anie.201712568
apa: Pieber, B., Shalom, M., Antonietti, M., Seeberger, P. H., & Gilmore, K.
(2018). Continuous heterogeneous photocatalysis in serial micro-batch reactors.
Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201712568
chicago: Pieber, Bartholomäus, Menny Shalom, Markus Antonietti, Peter H. Seeberger,
and Kerry Gilmore. “Continuous Heterogeneous Photocatalysis in Serial Micro-Batch
Reactors.” Angewandte Chemie International Edition. Wiley, 2018. https://doi.org/10.1002/anie.201712568.
ieee: B. Pieber, M. Shalom, M. Antonietti, P. H. Seeberger, and K. Gilmore, “Continuous
heterogeneous photocatalysis in serial micro-batch reactors,” Angewandte Chemie
International Edition, vol. 57, no. 31. Wiley, pp. 9976–9979, 2018.
ista: Pieber B, Shalom M, Antonietti M, Seeberger PH, Gilmore K. 2018. Continuous
heterogeneous photocatalysis in serial micro-batch reactors. Angewandte Chemie
International Edition. 57(31), 9976–9979.
mla: Pieber, Bartholomäus, et al. “Continuous Heterogeneous Photocatalysis in Serial
Micro-Batch Reactors.” Angewandte Chemie International Edition, vol. 57,
no. 31, Wiley, 2018, pp. 9976–79, doi:10.1002/anie.201712568.
short: B. Pieber, M. Shalom, M. Antonietti, P.H. Seeberger, K. Gilmore, Angewandte
Chemie International Edition 57 (2018) 9976–9979.
date_created: 2022-08-24T10:57:25Z
date_published: 2018-07-26T00:00:00Z
date_updated: 2023-02-21T10:09:18Z
day: '26'
doi: 10.1002/anie.201712568
extern: '1'
external_id:
pmid:
- '29377383'
intvolume: ' 57'
issue: '31'
language:
- iso: eng
month: '07'
oa_version: None
page: 9976-9979
pmid: 1
publication: Angewandte Chemie International Edition
publication_identifier:
eissn:
- ' 1521-3773'
issn:
- 1433-7851
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Continuous heterogeneous photocatalysis in serial micro-batch reactors
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 57
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: '124'
abstract:
- lang: eng
text: By investigating the in situ chemical and O-isotope compositions of olivine
in lightly sintered dust agglomerates from the early Solar System, we constrain
their origins and the retention of dust in the protoplanetary disk. The grain
sizes of silicates in these agglomeratic olivine (AO) chondrules indicate that
the grain sizes of chondrule precursors in the Renazzo-like carbonaceous (CR)
chondrites ranged from <1 to 80 µm. We infer this grain size range to be equivalent
to the size range for dust in the early Solar System. AO chondrules may contain,
but are not solely composed of, recycled fragments of earlier formed chondrules.
They also contain 16O-rich olivine related to amoeboid olivine aggregates and
represent the best record of chondrule-precursor materials. AO chondrules contain
one or more large grains, sometimes similar to FeO-poor (type I) and/or FeO-rich
(type II) chondrules, while others contain a type II chondrule core. These morphologies
are consistent with particle agglomeration by electrostatic charging of grains
during collision, a process that may explain solid agglomeration in the protoplanetary
disk in the micrometer size regime. The petrographic, isotopic, and chemical compositions
of AO chondrules are consistent with chondrule formation by large-scale shocks,
bow shocks, and current sheets. The petrographic, isotopic, and chemical similarities
between AO chondrules in CR chondrites and chondrule-like objects from comet 81P/Wild
2 indicate that comets contain AO chondrules. We infer that these AO chondrules
likely formed in the inner Solar System and migrated to the comet forming region
at least 3 Ma after the formation of the first Solar System solids. Observations
made in this study imply that the protoplanetary disk retained a dusty disk at
least ∼3.7 Ma after the formation of the first Solar System solids, longer than
half of the dusty accretion disks observed around other stars.
author:
- first_name: Scott R
full_name: Waitukaitis, Scott R
id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87
last_name: Waitukaitis
orcid: 0000-0002-2299-3176
- first_name: Devin
full_name: Schrader, Devin
last_name: Schrader
- first_name: Kazuhide
full_name: Nagashima, Kazuhide
last_name: Nagashima
- first_name: Jemma
full_name: Davidson, Jemma
last_name: Davidson
- first_name: Timothy
full_name: Mccoy, Timothy
last_name: Mccoy
- first_name: Harold
full_name: Conolly Jr, Harold
last_name: Conolly Jr
- first_name: Dante
full_name: Lauretta, Dante
last_name: Lauretta
citation:
ama: 'Waitukaitis SR, Schrader D, Nagashima K, et al. The retention of dust in protoplanetary
disks: evidence from agglomeration olivine chondrules from the outer solar system.
Geochimica et Cosmochimica Acta. 2018;223:405-421. doi:10.1016/j.gca.2017.12.014'
apa: 'Waitukaitis, S. R., Schrader, D., Nagashima, K., Davidson, J., Mccoy, T.,
Conolly Jr, H., & Lauretta, D. (2018). The retention of dust in protoplanetary
disks: evidence from agglomeration olivine chondrules from the outer solar system.
Geochimica et Cosmochimica Acta. Elsevier. https://doi.org/10.1016/j.gca.2017.12.014'
chicago: 'Waitukaitis, Scott R, Devin Schrader, Kazuhide Nagashima, Jemma Davidson,
Timothy Mccoy, Harold Conolly Jr, and Dante Lauretta. “The Retention of Dust in
Protoplanetary Disks: Evidence from Agglomeration Olivine Chondrules from the
Outer Solar System.” Geochimica et Cosmochimica Acta. Elsevier, 2018. https://doi.org/10.1016/j.gca.2017.12.014.'
ieee: 'S. R. Waitukaitis et al., “The retention of dust in protoplanetary
disks: evidence from agglomeration olivine chondrules from the outer solar system,”
Geochimica et Cosmochimica Acta, vol. 223. Elsevier, pp. 405–421, 2018.'
ista: 'Waitukaitis SR, Schrader D, Nagashima K, Davidson J, Mccoy T, Conolly Jr
H, Lauretta D. 2018. The retention of dust in protoplanetary disks: evidence from
agglomeration olivine chondrules from the outer solar system. Geochimica et Cosmochimica
Acta. 223, 405–421.'
mla: 'Waitukaitis, Scott R., et al. “The Retention of Dust in Protoplanetary Disks:
Evidence from Agglomeration Olivine Chondrules from the Outer Solar System.” Geochimica
et Cosmochimica Acta, vol. 223, Elsevier, 2018, pp. 405–21, doi:10.1016/j.gca.2017.12.014.'
short: S.R. Waitukaitis, D. Schrader, K. Nagashima, J. Davidson, T. Mccoy, H. Conolly
Jr, D. Lauretta, Geochimica et Cosmochimica Acta 223 (2018) 405–421.
date_created: 2018-12-11T11:44:45Z
date_published: 2018-02-15T00:00:00Z
date_updated: 2021-01-12T06:49:19Z
day: '15'
doi: 10.1016/j.gca.2017.12.014
extern: '1'
intvolume: ' 223'
language:
- iso: eng
month: '02'
oa_version: None
page: 405 - 421
publication: Geochimica et Cosmochimica Acta
publication_status: published
publisher: Elsevier
publist_id: '7930'
quality_controlled: '1'
status: public
title: 'The retention of dust in protoplanetary disks: evidence from agglomeration
olivine chondrules from the outer solar system'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 223
year: '2018'
...
---
_id: '125'
abstract:
- lang: eng
text: Many fields of study, including medical imaging, granular physics, colloidal
physics, and active matter, require the precise identification and tracking of
particle-like objects in images. While many algorithms exist to track particles
in diffuse conditions, these often perform poorly when particles are densely packed
together—as in, for example, solid-like systems of granular materials. Incorrect
particle identification can have significant effects on the calculation of physical
quantities, which makes the development of more precise and faster tracking algorithms
a worthwhile endeavor. In this work, we present a new tracking algorithm to identify
particles in dense systems that is both highly accurate and fast. We demonstrate
the efficacy of our approach by analyzing images of dense, solid-state granular
media, where we achieve an identification error of 5% in the worst evaluated cases.
Going further, we propose a parallelization strategy for our algorithm using a
GPU, which results in a speedup of up to 10× when compared to a sequential CPU
implementation in C and up to 40× when compared to the reference MATLAB library
widely used for particle tracking. Our results extend the capabilities of state-of-the-art
particle tracking methods by allowing fast, high-fidelity detection in dense media
at high resolutions.
author:
- first_name: Mauricio
full_name: Cerda, Mauricio
last_name: Cerda
- first_name: Scott R
full_name: Waitukaitis, Scott R
id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87
last_name: Waitukaitis
orcid: 0000-0002-2299-3176
- first_name: Cristóbal
full_name: Navarro, Cristóbal
last_name: Navarro
- first_name: Juan
full_name: Silva, Juan
last_name: Silva
- first_name: Nicolás
full_name: Mujica, Nicolás
last_name: Mujica
- first_name: Nancy
full_name: Hitschfeld, Nancy
last_name: Hitschfeld
citation:
ama: Cerda M, Waitukaitis SR, Navarro C, Silva J, Mujica N, Hitschfeld N. A high-speed
tracking algorithm for dense granular media. Computer Physics Communications.
2018;227:8-16. doi:10.1016/j.cpc.2018.02.010
apa: Cerda, M., Waitukaitis, S. R., Navarro, C., Silva, J., Mujica, N., & Hitschfeld,
N. (2018). A high-speed tracking algorithm for dense granular media. Computer
Physics Communications. Elsevier. https://doi.org/10.1016/j.cpc.2018.02.010
chicago: Cerda, Mauricio, Scott R Waitukaitis, Cristóbal Navarro, Juan Silva, Nicolás
Mujica, and Nancy Hitschfeld. “A High-Speed Tracking Algorithm for Dense Granular
Media.” Computer Physics Communications. Elsevier, 2018. https://doi.org/10.1016/j.cpc.2018.02.010.
ieee: M. Cerda, S. R. Waitukaitis, C. Navarro, J. Silva, N. Mujica, and N. Hitschfeld,
“A high-speed tracking algorithm for dense granular media,” Computer Physics
Communications, vol. 227. Elsevier, pp. 8–16, 2018.
ista: Cerda M, Waitukaitis SR, Navarro C, Silva J, Mujica N, Hitschfeld N. 2018.
A high-speed tracking algorithm for dense granular media. Computer Physics Communications.
227, 8–16.
mla: Cerda, Mauricio, et al. “A High-Speed Tracking Algorithm for Dense Granular
Media.” Computer Physics Communications, vol. 227, Elsevier, 2018, pp.
8–16, doi:10.1016/j.cpc.2018.02.010.
short: M. Cerda, S.R. Waitukaitis, C. Navarro, J. Silva, N. Mujica, N. Hitschfeld,
Computer Physics Communications 227 (2018) 8–16.
date_created: 2018-12-11T11:44:45Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2021-01-12T06:49:23Z
day: '01'
doi: 10.1016/j.cpc.2018.02.010
extern: '1'
intvolume: ' 227'
language:
- iso: eng
month: '06'
oa_version: None
page: 8 - 16
publication: Computer Physics Communications
publication_status: published
publisher: Elsevier
publist_id: '7928'
quality_controlled: '1'
status: public
title: A high-speed tracking algorithm for dense granular media
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 227
year: '2018'
...
---
_id: '126'
abstract:
- lang: eng
text: The Leidenfrost effect occurs when a liquid or stiff sublimable solid near
a hot surface creates enough vapor beneath it to lift itself up and float. In
contrast, vaporizable soft solids, e.g., hydrogels, have been shown to exhibit
persistent bouncing - the elastic Leidenfrost effect. By carefully lowering hydrogel
spheres towards a hot surface, we discover that they are also capable of floating.
The bounce-to-float transition is controlled by the approach velocity and temperature,
analogously to the "dynamic Leidenfrost effect." For the floating regime,
we measure power-law scalings for the gap geometry, which we explain with a model
that couples the vaporization rate to the spherical shape. Our results reveal
that hydrogels are a promising pathway for controlling floating Leidenfrost objects
through shape.
acknowledgement: We acknowledge funding from the Netherlands Organization for Scientific
Research through Grants VICI No. NWO- 680-47-609 (M. v. H. and S. W.) and VENI No.
NWO-680- 47-453 (S. W.), and from the German Science Foundation through Grant No.
HA8467/1-1 (K. H.).
article_number: '048001 '
author:
- first_name: Scott R
full_name: Waitukaitis, Scott R
id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87
last_name: Waitukaitis
orcid: 0000-0002-2299-3176
- first_name: Kirsten
full_name: Harth, Kirsten
last_name: Harth
- first_name: Martin
full_name: Van Hecke, Martin
last_name: Van Hecke
citation:
ama: 'Waitukaitis SR, Harth K, Van Hecke M. From bouncing to floating: the Leidenfrost
effect with hydrogel spheres. Physical Review Letters. 2018;121(4). doi:10.1103/PhysRevLett.121.048001'
apa: 'Waitukaitis, S. R., Harth, K., & Van Hecke, M. (2018). From bouncing to
floating: the Leidenfrost effect with hydrogel spheres. Physical Review Letters.
American Physical Society. https://doi.org/10.1103/PhysRevLett.121.048001'
chicago: 'Waitukaitis, Scott R, Kirsten Harth, and Martin Van Hecke. “From Bouncing
to Floating: The Leidenfrost Effect with Hydrogel Spheres.” Physical Review
Letters. American Physical Society, 2018. https://doi.org/10.1103/PhysRevLett.121.048001.'
ieee: 'S. R. Waitukaitis, K. Harth, and M. Van Hecke, “From bouncing to floating:
the Leidenfrost effect with hydrogel spheres,” Physical Review Letters,
vol. 121, no. 4. American Physical Society, 2018.'
ista: 'Waitukaitis SR, Harth K, Van Hecke M. 2018. From bouncing to floating: the
Leidenfrost effect with hydrogel spheres. Physical Review Letters. 121(4), 048001.'
mla: 'Waitukaitis, Scott R., et al. “From Bouncing to Floating: The Leidenfrost
Effect with Hydrogel Spheres.” Physical Review Letters, vol. 121, no. 4,
048001, American Physical Society, 2018, doi:10.1103/PhysRevLett.121.048001.'
short: S.R. Waitukaitis, K. Harth, M. Van Hecke, Physical Review Letters 121 (2018).
date_created: 2018-12-11T11:44:46Z
date_published: 2018-07-25T00:00:00Z
date_updated: 2021-01-12T06:49:27Z
day: '25'
doi: 10.1103/PhysRevLett.121.048001
extern: '1'
intvolume: ' 121'
issue: '4'
language:
- iso: eng
month: '07'
oa_version: None
publication: Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '7927'
quality_controlled: '1'
status: public
title: 'From bouncing to floating: the Leidenfrost effect with hydrogel spheres'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 121
year: '2018'
...
---
_id: '127'
abstract:
- lang: eng
text: The ideas of topology are breaking ground in origami-based metamaterials.
Experiments now show that certain shapes — doughnuts included — exhibit topological
bistability, and can be made to click between different topologically stable states.
author:
- first_name: Scott R
full_name: Waitukaitis, Scott R
id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87
last_name: Waitukaitis
orcid: 0000-0002-2299-3176
citation:
ama: Waitukaitis SR. Clicks for doughnuts. Nature Physics. 2018;14(8):777-778.
doi:10.1038/s41567-018-0160-6
apa: Waitukaitis, S. R. (2018). Clicks for doughnuts. Nature Physics. Nature
Publishing Group. https://doi.org/10.1038/s41567-018-0160-6
chicago: Waitukaitis, Scott R. “Clicks for Doughnuts.” Nature Physics. Nature
Publishing Group, 2018. https://doi.org/10.1038/s41567-018-0160-6.
ieee: S. R. Waitukaitis, “Clicks for doughnuts,” Nature Physics, vol. 14,
no. 8. Nature Publishing Group, pp. 777–778, 2018.
ista: Waitukaitis SR. 2018. Clicks for doughnuts. Nature Physics. 14(8), 777–778.
mla: Waitukaitis, Scott R. “Clicks for Doughnuts.” Nature Physics, vol. 14,
no. 8, Nature Publishing Group, 2018, pp. 777–78, doi:10.1038/s41567-018-0160-6.
short: S.R. Waitukaitis, Nature Physics 14 (2018) 777–778.
date_created: 2018-12-11T11:44:46Z
date_published: 2018-05-28T00:00:00Z
date_updated: 2021-01-12T06:49:31Z
day: '28'
doi: 10.1038/s41567-018-0160-6
extern: '1'
intvolume: ' 14'
issue: '8'
language:
- iso: eng
month: '05'
oa_version: None
page: 777 - 778
publication: Nature Physics
publication_status: published
publisher: Nature Publishing Group
publist_id: '7926'
status: public
title: Clicks for doughnuts
type: journal_article
user_id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
volume: 14
year: '2018'
...
---
_id: '174'
abstract:
- lang: eng
text: We survey recent efforts to quantify failures of the Hasse principle in families
of rationally connected varieties.
alternative_title:
- Proceedings of Symposia in Pure Mathematics
article_processing_charge: No
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
citation:
ama: 'Browning TD. How often does the Hasse principle hold? In: Vol 97. American
Mathematical Society; 2018:89-102. doi:10.1090/pspum/097.2/01700'
apa: 'Browning, T. D. (2018). How often does the Hasse principle hold? (Vol. 97,
pp. 89–102). Presented at the Algebraic Geometry, Salt Lake City, Utah, USA: American
Mathematical Society. https://doi.org/10.1090/pspum/097.2/01700'
chicago: Browning, Timothy D. “How Often Does the Hasse Principle Hold?,” 97:89–102.
American Mathematical Society, 2018. https://doi.org/10.1090/pspum/097.2/01700.
ieee: T. D. Browning, “How often does the Hasse principle hold?,” presented at the
Algebraic Geometry, Salt Lake City, Utah, USA, 2018, vol. 97, no. 2, pp. 89–102.
ista: Browning TD. 2018. How often does the Hasse principle hold? Algebraic Geometry,
Proceedings of Symposia in Pure Mathematics, vol. 97, 89–102.
mla: Browning, Timothy D. How Often Does the Hasse Principle Hold? Vol. 97,
no. 2, American Mathematical Society, 2018, pp. 89–102, doi:10.1090/pspum/097.2/01700.
short: T.D. Browning, in:, American Mathematical Society, 2018, pp. 89–102.
conference:
end_date: 2015-07-10
location: Salt Lake City, Utah, USA
name: Algebraic Geometry
start_date: 2015-07-06
date_created: 2018-12-11T11:45:01Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2021-01-12T06:52:54Z
day: '01'
doi: 10.1090/pspum/097.2/01700
extern: '1'
intvolume: ' 97'
issue: '2'
language:
- iso: eng
month: '01'
oa_version: None
page: 89 - 102
publication_status: published
publisher: American Mathematical Society
quality_controlled: '1'
status: public
title: How often does the Hasse principle hold?
type: conference
user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425
volume: 97
year: '2018'
...
---
_id: '176'
abstract:
- lang: eng
text: For a general class of non-negative functions defined on integral ideals of
number fields, upper bounds are established for their average over the values
of certain principal ideals that are associated to irreducible binary forms with
integer coefficients.
article_processing_charge: No
article_type: original
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Efthymios
full_name: Sofos, Efthymios
last_name: Sofos
citation:
ama: Browning TD, Sofos E. Averages of arithmetic functions over principal ideals.
International Journal of Nuber Theory. 2018;15(3):547-567. doi:10.1142/S1793042119500283
apa: Browning, T. D., & Sofos, E. (2018). Averages of arithmetic functions over
principal ideals. International Journal of Nuber Theory. World Scientific
Publishing. https://doi.org/10.1142/S1793042119500283
chicago: Browning, Timothy D, and Efthymios Sofos. “Averages of Arithmetic Functions
over Principal Ideals.” International Journal of Nuber Theory. World Scientific
Publishing, 2018. https://doi.org/10.1142/S1793042119500283.
ieee: T. D. Browning and E. Sofos, “Averages of arithmetic functions over principal
ideals,” International Journal of Nuber Theory, vol. 15, no. 3. World Scientific
Publishing, pp. 547–567, 2018.
ista: Browning TD, Sofos E. 2018. Averages of arithmetic functions over principal
ideals. International Journal of Nuber Theory. 15(3), 547–567.
mla: Browning, Timothy D., and Efthymios Sofos. “Averages of Arithmetic Functions
over Principal Ideals.” International Journal of Nuber Theory, vol. 15,
no. 3, World Scientific Publishing, 2018, pp. 547–67, doi:10.1142/S1793042119500283.
short: T.D. Browning, E. Sofos, International Journal of Nuber Theory 15 (2018)
547–567.
date_created: 2018-12-11T11:45:01Z
date_published: 2018-11-16T00:00:00Z
date_updated: 2021-01-12T06:53:01Z
day: '16'
doi: 10.1142/S1793042119500283
extern: '1'
external_id:
arxiv:
- '1706.04331'
intvolume: ' 15'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1706.04331
month: '11'
oa: 1
oa_version: Preprint
page: 547-567
publication: International Journal of Nuber Theory
publication_status: published
publisher: World Scientific Publishing
status: public
title: Averages of arithmetic functions over principal ideals
type: journal_article
user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425
volume: 15
year: '2018'
...
---
_id: '178'
abstract:
- lang: eng
text: We give an upper bound for the number of rational points of height at most
B, lying on a surface defined by a quadratic form Q. The bound shows an explicit
dependence on Q. It is optimal with respect to B, and is also optimal for typical
forms Q.
article_processing_charge: No
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Roger
full_name: Heath-Brown, Roger
last_name: Heath-Brown
citation:
ama: Browning TD, Heath-Brown R. Counting rational points on quadric surfaces. Discrete
Analysis. 2018;15:1-29. doi:10.19086/da.4375
apa: Browning, T. D., & Heath-Brown, R. (2018). Counting rational points on
quadric surfaces. Discrete Analysis. Alliance of Diamond Open Access Journals.
https://doi.org/10.19086/da.4375
chicago: Browning, Timothy D, and Roger Heath-Brown. “Counting Rational Points on
Quadric Surfaces.” Discrete Analysis. Alliance of Diamond Open Access Journals,
2018. https://doi.org/10.19086/da.4375.
ieee: T. D. Browning and R. Heath-Brown, “Counting rational points on quadric surfaces,”
Discrete Analysis, vol. 15. Alliance of Diamond Open Access Journals, pp.
1–29, 2018.
ista: Browning TD, Heath-Brown R. 2018. Counting rational points on quadric surfaces.
Discrete Analysis. 15, 1–29.
mla: Browning, Timothy D., and Roger Heath-Brown. “Counting Rational Points on Quadric
Surfaces.” Discrete Analysis, vol. 15, Alliance of Diamond Open Access
Journals, 2018, pp. 1–29, doi:10.19086/da.4375.
short: T.D. Browning, R. Heath-Brown, Discrete Analysis 15 (2018) 1–29.
date_created: 2018-12-11T11:45:02Z
date_published: 2018-09-07T00:00:00Z
date_updated: 2022-08-26T09:13:02Z
day: '07'
ddc:
- '512'
doi: 10.19086/da.4375
extern: '1'
external_id:
arxiv:
- '1801.00979'
intvolume: ' 15'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1801.00979
month: '09'
oa: 1
oa_version: Preprint
page: 1 - 29
publication: Discrete Analysis
publication_identifier:
eissn:
- 2397-3129
publication_status: published
publisher: Alliance of Diamond Open Access Journals
quality_controlled: '1'
status: public
title: Counting rational points on quadric surfaces
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: 15
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: '2015'
abstract:
- lang: eng
text: We consider the problem of learning a Bayesian network or directed acyclic
graph model from observational data. A number of constraint‐based, score‐based
and hybrid algorithms have been developed for this purpose. Statistical consistency
guarantees of these algorithms rely on the faithfulness assumption, which has
been shown to be restrictive especially for graphs with cycles in the skeleton.
We here propose the sparsest permutation (SP) algorithm, showing that learning
Bayesian networks is possible under strictly weaker assumptions than faithfulness.
This comes at a computational price, thereby indicating a statistical‐computational
trade‐off for causal inference algorithms. In the Gaussian noiseless setting,
we prove that the SP algorithm boils down to finding the permutation of the variables
with the sparsest Cholesky decomposition of the inverse covariance matrix, which
is equivalent to ℓ0‐penalized maximum likelihood estimation. We end with a simulation
study showing that in line with the proven stronger consistency guarantees, and
the SP algorithm compares favourably to standard causal inference algorithms in
terms of accuracy for a given sample size.
article_number: e183
article_processing_charge: No
article_type: original
author:
- first_name: Garvesh
full_name: Raskutti, Garvesh
last_name: Raskutti
- first_name: Caroline
full_name: Uhler, Caroline
id: 49ADD78E-F248-11E8-B48F-1D18A9856A87
last_name: Uhler
orcid: 0000-0002-7008-0216
citation:
ama: Raskutti G, Uhler C. Learning directed acyclic graphs based on sparsest permutations.
STAT. 2018;7(1). doi:10.1002/sta4.183
apa: Raskutti, G., & Uhler, C. (2018). Learning directed acyclic graphs based
on sparsest permutations. STAT. Wiley. https://doi.org/10.1002/sta4.183
chicago: Raskutti, Garvesh, and Caroline Uhler. “Learning Directed Acyclic Graphs
Based on Sparsest Permutations.” STAT. Wiley, 2018. https://doi.org/10.1002/sta4.183.
ieee: G. Raskutti and C. Uhler, “Learning directed acyclic graphs based on sparsest
permutations,” STAT, vol. 7, no. 1. Wiley, 2018.
ista: Raskutti G, Uhler C. 2018. Learning directed acyclic graphs based on sparsest
permutations. STAT. 7(1), e183.
mla: Raskutti, Garvesh, and Caroline Uhler. “Learning Directed Acyclic Graphs Based
on Sparsest Permutations.” STAT, vol. 7, no. 1, e183, Wiley, 2018, doi:10.1002/sta4.183.
short: G. Raskutti, C. Uhler, STAT 7 (2018).
date_created: 2018-12-11T11:55:13Z
date_published: 2018-04-17T00:00:00Z
date_updated: 2021-01-12T06:54:44Z
day: '17'
doi: 10.1002/sta4.183
extern: '1'
external_id:
arxiv:
- '1307.0366'
intvolume: ' 7'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1307.0366
month: '04'
oa: 1
oa_version: Preprint
publication: STAT
publication_status: published
publisher: Wiley
publist_id: '5061'
quality_controlled: '1'
status: public
title: Learning directed acyclic graphs based on sparsest permutations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7
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: '394'
abstract:
- lang: eng
text: 'The valley pseudospin in monolayer transition metal dichalcogenides (TMDs)
has been proposed as a new way to manipulate information in various optoelectronic
devices. This relies on a large valley polarization that remains stable over long
time scales (hundreds of nanoseconds). However, time-resolved measurements report
valley lifetimes of only a few picoseconds. This has been attributed to mechanisms
such as phonon-mediated intervalley scattering and a precession of the valley
pseudospin through electron-hole exchange. Here we use transient spin grating
to directly measure the valley depolarization lifetime in monolayer MoSe2. We
find a fast valley decay rate that scales linearly with the excitation density
at different temperatures. This establishes the presence of strong exciton-exciton
Coulomb exchange interactions enhancing the valley depolarization. Our work highlights
the microscopic processes inhibiting the efficient use of the exciton valley pseudospin
in monolayer TMDs. '
author:
- first_name: Fahad
full_name: Mahmood, Fahad
last_name: Mahmood
- first_name: Zhanybek
full_name: Alpichshev, Zhanybek
id: 45E67A2A-F248-11E8-B48F-1D18A9856A87
last_name: Alpichshev
orcid: 0000-0002-7183-5203
- first_name: Yi
full_name: Lee, Yi
last_name: Lee
- first_name: Jing
full_name: Kong, Jing
last_name: Kong
- first_name: Nuh
full_name: Gedik, Nuh
last_name: Gedik
citation:
ama: Mahmood F, Alpichshev Z, Lee Y, Kong J, Gedik N. Observation of exciton-exciton
interaction mediated valley Depolarization in Monolayer MoSe2. Nano Letters.
2018;18(1):223-228. doi:10.1021/acs.nanolett.7b03953
apa: Mahmood, F., Alpichshev, Z., Lee, Y., Kong, J., & Gedik, N. (2018). Observation
of exciton-exciton interaction mediated valley Depolarization in Monolayer MoSe2.
Nano Letters. American Chemical Society. https://doi.org/10.1021/acs.nanolett.7b03953
chicago: Mahmood, Fahad, Zhanybek Alpichshev, Yi Lee, Jing Kong, and Nuh Gedik.
“Observation of Exciton-Exciton Interaction Mediated Valley Depolarization in
Monolayer MoSe2.” Nano Letters. American Chemical Society, 2018. https://doi.org/10.1021/acs.nanolett.7b03953.
ieee: F. Mahmood, Z. Alpichshev, Y. Lee, J. Kong, and N. Gedik, “Observation of
exciton-exciton interaction mediated valley Depolarization in Monolayer MoSe2,”
Nano Letters, vol. 18, no. 1. American Chemical Society, pp. 223–228, 2018.
ista: Mahmood F, Alpichshev Z, Lee Y, Kong J, Gedik N. 2018. Observation of exciton-exciton
interaction mediated valley Depolarization in Monolayer MoSe2. Nano Letters. 18(1),
223–228.
mla: Mahmood, Fahad, et al. “Observation of Exciton-Exciton Interaction Mediated
Valley Depolarization in Monolayer MoSe2.” Nano Letters, vol. 18, no. 1,
American Chemical Society, 2018, pp. 223–28, doi:10.1021/acs.nanolett.7b03953.
short: F. Mahmood, Z. Alpichshev, Y. Lee, J. Kong, N. Gedik, Nano Letters 18 (2018)
223–228.
date_created: 2018-12-11T11:46:13Z
date_published: 2018-01-10T00:00:00Z
date_updated: 2021-01-12T07:53:20Z
day: '10'
doi: 10.1021/acs.nanolett.7b03953
extern: '1'
external_id:
arxiv:
- '1712.07925'
intvolume: ' 18'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1712.07925
month: '01'
oa: 1
oa_version: Submitted Version
page: 223 - 228
publication: Nano Letters
publication_status: published
publisher: American Chemical Society
publist_id: '7435'
quality_controlled: '1'
status: public
title: Observation of exciton-exciton interaction mediated valley Depolarization in
Monolayer MoSe2
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 18
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'
...