---
_id: '6183'
abstract:
- lang: eng
text: "We study the unique solution $m$ of the Dyson equation \\[ -m(z)^{-1} = z
- a\r\n+ S[m(z)] \\] on a von Neumann algebra $\\mathcal{A}$ with the constraint\r\n$\\mathrm{Im}\\,m\\geq
0$. Here, $z$ lies in the complex upper half-plane, $a$ is\r\na self-adjoint element
of $\\mathcal{A}$ and $S$ is a positivity-preserving\r\nlinear operator on $\\mathcal{A}$.
We show that $m$ is the Stieltjes transform\r\nof a compactly supported $\\mathcal{A}$-valued
measure on $\\mathbb{R}$. Under\r\nsuitable assumptions, we establish that this
measure has a uniformly\r\n$1/3$-H\\\"{o}lder continuous density with respect
to the Lebesgue measure, which\r\nis supported on finitely many intervals, called
bands. In fact, the density is\r\nanalytic inside the bands with a square-root
growth at the edges and internal\r\ncubic root cusps whenever the gap between
two bands vanishes. The shape of\r\nthese singularities is universal and no other
singularity may occur. We give a\r\nprecise asymptotic description of $m$ near
the singular points. These\r\nasymptotics generalize the analysis at the regular
edges given in the companion\r\npaper on the Tracy-Widom universality for the
edge eigenvalue statistics for\r\ncorrelated random matrices [arXiv:1804.07744]
and they play a key role in the\r\nproof of the Pearcey universality at the cusp
for Wigner-type matrices\r\n[arXiv:1809.03971,arXiv:1811.04055]. We also extend
the finite dimensional band\r\nmass formula from [arXiv:1804.07744] to the von
Neumann algebra setting by\r\nshowing that the spectral mass of the bands is topologically
rigid under\r\ndeformations and we conclude that these masses are quantized in
some important\r\ncases."
acknowledgement: "Partially funded by ERC Advanced Grant RANMAT No. 338804.\r\nPartially
supported by the Hausdorff Center for Mathematics.\r\n"
article_number: '1804.07752'
article_processing_charge: No
arxiv: 1
author:
- first_name: Johannes
full_name: Alt, Johannes
id: 36D3D8B6-F248-11E8-B48F-1D18A9856A87
last_name: Alt
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Torben H
full_name: Krüger, Torben H
id: 3020C786-F248-11E8-B48F-1D18A9856A87
last_name: Krüger
orcid: 0000-0002-4821-3297
citation:
ama: 'Alt J, Erdös L, Krüger TH. The Dyson equation with linear self-energy: Spectral
bands, edges and cusps. arXiv. doi:10.48550/arXiv.1804.07752'
apa: 'Alt, J., Erdös, L., & Krüger, T. H. (n.d.). The Dyson equation with linear
self-energy: Spectral bands, edges and cusps. arXiv. https://doi.org/10.48550/arXiv.1804.07752'
chicago: 'Alt, Johannes, László Erdös, and Torben H Krüger. “The Dyson Equation
with Linear Self-Energy: Spectral Bands, Edges and Cusps.” ArXiv, n.d.
https://doi.org/10.48550/arXiv.1804.07752.'
ieee: 'J. Alt, L. Erdös, and T. H. Krüger, “The Dyson equation with linear self-energy:
Spectral bands, edges and cusps,” arXiv. .'
ista: 'Alt J, Erdös L, Krüger TH. The Dyson equation with linear self-energy: Spectral
bands, edges and cusps. arXiv, 1804.07752.'
mla: 'Alt, Johannes, et al. “The Dyson Equation with Linear Self-Energy: Spectral
Bands, Edges and Cusps.” ArXiv, 1804.07752, doi:10.48550/arXiv.1804.07752.'
short: J. Alt, L. Erdös, T.H. Krüger, ArXiv (n.d.).
date_created: 2019-03-28T09:20:06Z
date_published: 2018-04-20T00:00:00Z
date_updated: 2026-04-08T14:11:36Z
day: '20'
department:
- _id: LaEr
doi: 10.48550/arXiv.1804.07752
ec_funded: 1
external_id:
arxiv:
- '1804.07752'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.07752
month: '04'
oa: 1
oa_version: Preprint
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: arXiv
publication_status: draft
related_material:
record:
- id: '14694'
relation: later_version
status: public
- id: '149'
relation: dissertation_contains
status: public
status: public
title: 'The Dyson equation with linear self-energy: Spectral bands, edges and cusps'
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '6195'
abstract:
- lang: eng
text: In the context of robotic manipulation and grasping, the shift from a view
that is static (force closure of a single posture) and contact-deprived (only
contact for force closure is allowed, everything else is obstacle) towards a view
that is dynamic and contact-rich (soft manipulation) has led to an increased interest
in soft hands. These hands can easily exploit environmental constraints and object
surfaces without risk, and safely interact with humans, but present also some
challenges. Designing them is difficult, as well as predicting, modelling, and
“programming” their interactions with the objects and the environment. This paper
tackles the problem of simulating them in a fast and effective way, leveraging
on novel and existing simulation technologies. We present a triple-layered simulation
framework where dynamic properties such as stiffness are determined from slow
but accurate FEM simulation data once, and then condensed into a lumped parameter
model that can be used to fast simulate soft fingers and soft hands. We apply
our approach to the simulation of soft pneumatic fingers.
article_number: '8461106'
article_processing_charge: No
author:
- first_name: Maria
full_name: Pozzi, Maria
last_name: Pozzi
- first_name: Eder
full_name: Miguel Villalba, Eder
id: 3FB91342-F248-11E8-B48F-1D18A9856A87
last_name: Miguel Villalba
orcid: 0000-0001-5665-0430
- first_name: Raphael
full_name: Deimel, Raphael
last_name: Deimel
- first_name: Monica
full_name: Malvezzi, Monica
last_name: Malvezzi
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Oliver
full_name: Brock, Oliver
last_name: Brock
- first_name: Domenico
full_name: Prattichizzo, Domenico
last_name: Prattichizzo
citation:
ama: 'Pozzi M, Miguel Villalba E, Deimel R, et al. Efficient FEM-based simulation
of soft robots modeled as kinematic chains. In: IEEE; 2018. doi:10.1109/icra.2018.8461106'
apa: 'Pozzi, M., Miguel Villalba, E., Deimel, R., Malvezzi, M., Bickel, B., Brock,
O., & Prattichizzo, D. (2018). Efficient FEM-based simulation of soft robots
modeled as kinematic chains. Presented at the ICRA: International Conference on
Robotics and Automation, Brisbane, Australia: IEEE. https://doi.org/10.1109/icra.2018.8461106'
chicago: Pozzi, Maria, Eder Miguel Villalba, Raphael Deimel, Monica Malvezzi, Bernd
Bickel, Oliver Brock, and Domenico Prattichizzo. “Efficient FEM-Based Simulation
of Soft Robots Modeled as Kinematic Chains.” IEEE, 2018. https://doi.org/10.1109/icra.2018.8461106.
ieee: 'M. Pozzi et al., “Efficient FEM-based simulation of soft robots modeled
as kinematic chains,” presented at the ICRA: International Conference on Robotics
and Automation, Brisbane, Australia, 2018.'
ista: 'Pozzi M, Miguel Villalba E, Deimel R, Malvezzi M, Bickel B, Brock O, Prattichizzo
D. 2018. Efficient FEM-based simulation of soft robots modeled as kinematic chains.
ICRA: International Conference on Robotics and Automation, 8461106.'
mla: Pozzi, Maria, et al. Efficient FEM-Based Simulation of Soft Robots Modeled
as Kinematic Chains. 8461106, IEEE, 2018, doi:10.1109/icra.2018.8461106.
short: M. Pozzi, E. Miguel Villalba, R. Deimel, M. Malvezzi, B. Bickel, O. Brock,
D. Prattichizzo, in:, IEEE, 2018.
conference:
end_date: 2018-05-25
location: Brisbane, Australia
name: 'ICRA: International Conference on Robotics and Automation'
start_date: 2018-05-21
date_created: 2019-04-04T09:50:38Z
date_published: 2018-09-10T00:00:00Z
date_updated: 2023-09-19T14:49:03Z
day: '10'
department:
- _id: BeBi
doi: 10.1109/icra.2018.8461106
external_id:
isi:
- '000446394503031'
isi: 1
language:
- iso: eng
month: '09'
oa_version: None
publication_identifier:
isbn:
- '9781538630815'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Efficient FEM-based simulation of soft robots modeled as kinematic chains
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '62'
abstract:
- lang: eng
text: Imaging is a dominant strategy for data collection in neuroscience, yielding
stacks of images that often scale to gigabytes of data for a single experiment.
Machine learning algorithms from computer vision can serve as a pair of virtual
eyes that tirelessly processes these images, automatically detecting and identifying
microstructures. Unlike learning methods, our Flexible Learning-free Reconstruction
of Imaged Neural volumes (FLoRIN) pipeline exploits structure-specific contextual
clues and requires no training. This approach generalizes across different modalities,
including serially-sectioned scanning electron microscopy (sSEM) of genetically
labeled and contrast enhanced processes, spectral confocal reflectance (SCoRe)
microscopy, and high-energy synchrotron X-ray microtomography (μCT) of large tissue
volumes. We deploy the FLoRIN pipeline on newly published and novel mouse datasets,
demonstrating the high biological fidelity of the pipeline’s reconstructions.
FLoRIN reconstructions are of sufficient quality for preliminary biological study,
for example examining the distribution and morphology of cells or extracting single
axons from functional data. Compared to existing supervised learning methods,
FLoRIN is one to two orders of magnitude faster and produces high-quality reconstructions
that are tolerant to noise and artifacts, as is shown qualitatively and quantitatively.
acknowledgement: 'Equipment was generously donated by the NVIDIA Corporation, and
made available by the National Science Foundation (NSF) through grant #CNS-1629914.
This research used resources of the Argonne Leadership Computing Facility, which
is a DOE Office of Science User Facility supported under Contract DE-AC02-06CH11357.'
article_number: '14247'
article_processing_charge: No
article_type: original
author:
- first_name: Ali
full_name: Shabazi, Ali
last_name: Shabazi
- first_name: Jeffery
full_name: Kinnison, Jeffery
last_name: Kinnison
- first_name: Rafael
full_name: Vescovi, Rafael
last_name: Vescovi
- first_name: Ming
full_name: Du, Ming
last_name: Du
- first_name: Robert
full_name: Hill, Robert
last_name: Hill
- first_name: Maximilian A
full_name: Jösch, Maximilian A
id: 2BD278E6-F248-11E8-B48F-1D18A9856A87
last_name: Jösch
orcid: 0000-0002-3937-1330
- first_name: Marc
full_name: Takeno, Marc
last_name: Takeno
- first_name: Hongkui
full_name: Zeng, Hongkui
last_name: Zeng
- first_name: Nuno
full_name: Da Costa, Nuno
last_name: Da Costa
- first_name: Jaime
full_name: Grutzendler, Jaime
last_name: Grutzendler
- first_name: Narayanan
full_name: Kasthuri, Narayanan
last_name: Kasthuri
- first_name: Walter
full_name: Scheirer, Walter
last_name: Scheirer
citation:
ama: Shabazi A, Kinnison J, Vescovi R, et al. Flexible learning-free segmentation
and reconstruction of neural volumes. Scientific Reports. 2018;8(1). doi:10.1038/s41598-018-32628-3
apa: Shabazi, A., Kinnison, J., Vescovi, R., Du, M., Hill, R., Jösch, M. A., … Scheirer,
W. (2018). Flexible learning-free segmentation and reconstruction of neural volumes.
Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/s41598-018-32628-3
chicago: Shabazi, Ali, Jeffery Kinnison, Rafael Vescovi, Ming Du, Robert Hill, Maximilian
A Jösch, Marc Takeno, et al. “Flexible Learning-Free Segmentation and Reconstruction
of Neural Volumes.” Scientific Reports. Nature Publishing Group, 2018.
https://doi.org/10.1038/s41598-018-32628-3.
ieee: A. Shabazi et al., “Flexible learning-free segmentation and reconstruction
of neural volumes,” Scientific Reports, vol. 8, no. 1. Nature Publishing
Group, 2018.
ista: Shabazi A, Kinnison J, Vescovi R, Du M, Hill R, Jösch MA, Takeno M, Zeng H,
Da Costa N, Grutzendler J, Kasthuri N, Scheirer W. 2018. Flexible learning-free
segmentation and reconstruction of neural volumes. Scientific Reports. 8(1), 14247.
mla: Shabazi, Ali, et al. “Flexible Learning-Free Segmentation and Reconstruction
of Neural Volumes.” Scientific Reports, vol. 8, no. 1, 14247, Nature Publishing
Group, 2018, doi:10.1038/s41598-018-32628-3.
short: A. Shabazi, J. Kinnison, R. Vescovi, M. Du, R. Hill, M.A. Jösch, M. Takeno,
H. Zeng, N. Da Costa, J. Grutzendler, N. Kasthuri, W. Scheirer, Scientific Reports
8 (2018).
date_created: 2018-12-11T11:44:25Z
date_published: 2018-09-24T00:00:00Z
date_updated: 2023-09-11T14:02:55Z
day: '24'
ddc:
- '570'
department:
- _id: MaJö
doi: 10.1038/s41598-018-32628-3
external_id:
isi:
- '000445336600015'
file:
- access_level: open_access
checksum: 1a14ae0666b82fbaa04bef110e3f6bf2
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T12:22:24Z
date_updated: 2020-07-14T12:47:24Z
file_id: '5699'
file_name: 2018_ScientificReports_Shahbazi.pdf
file_size: 4141645
relation: main_file
file_date_updated: 2020-07-14T12:47:24Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
issue: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
publication: Scientific Reports
publication_status: published
publisher: Nature Publishing Group
publist_id: '7992'
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: http://doi.org/10.1038/s41598-018-36220-7
scopus_import: '1'
status: public
title: Flexible learning-free segmentation and reconstruction of neural volumes
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 8
year: '2018'
...
---
_id: '620'
abstract:
- lang: eng
text: Clathrin-mediated endocytosis requires the coordinated assembly of various
endocytic proteins and lipids at the plasma membrane. Accumulating evidence demonstrates
a crucial role for phosphatidylinositol-4,5-bisphosphate (PtdIns(4,5)P2) in endocytosis,
but specific roles for PtdIns(4)P other than as the biosynthetic precursor of
PtdIns(4,5)P2 have not been clarified. In this study we investigated the role
of PtdIns(4)P or PtdIns(4,5)P2 in receptor-mediated endocytosis through the construction
of temperature-sensitive (ts) mutants for the PI 4-kinases Stt4p and Pik1p and
the PtdIns(4) 5-kinase Mss4p. Quantitative analyses of endocytosis revealed that
both the stt4(ts)pik1(ts) and mss4(ts) mutants have a severe defect in endocytic
internalization. Live-cell imaging of endocytic protein dynamics in stt4(ts)pik1(ts)
and mss4(ts) mutants revealed that PtdIns(4)P is required for the recruitment
of the alpha-factor receptor Ste2p to clathrin-coated pits whereas PtdIns(4,5)P2
is required for membrane internalization. We also found that the localization
to endocytic sites of the ENTH/ANTH domain-bearing clathrin adaptors, Ent1p/Ent2p
and Yap1801p/Yap1802p, is significantly impaired in the stt4(ts)pik1(ts) mutant,
but not in the mss4(ts) mutant. These results suggest distinct roles in successive
steps for PtdIns(4)P and PtdIns(4,5)P2 during receptor-mediated endocytosis.
article_number: jcs207696
article_processing_charge: No
author:
- first_name: Wataru
full_name: Yamamoto, Wataru
last_name: Yamamoto
- first_name: Suguru
full_name: Wada, Suguru
last_name: Wada
- first_name: Makoto
full_name: Nagano, Makoto
last_name: Nagano
- first_name: Kaito
full_name: Aoshima, Kaito
last_name: Aoshima
- first_name: Daria E
full_name: Siekhaus, Daria E
id: 3D224B9E-F248-11E8-B48F-1D18A9856A87
last_name: Siekhaus
orcid: 0000-0001-8323-8353
- first_name: Junko
full_name: Toshima, Junko
last_name: Toshima
- first_name: Jiro
full_name: Toshima, Jiro
last_name: Toshima
citation:
ama: Yamamoto W, Wada S, Nagano M, et al. Distinct roles for plasma membrane PtdIns
4 P and PtdIns 4 5 P2 during yeast receptor mediated endocytosis. Journal of
Cell Science. 2018;131(1). doi:10.1242/jcs.207696
apa: Yamamoto, W., Wada, S., Nagano, M., Aoshima, K., Siekhaus, D. E., Toshima,
J., & Toshima, J. (2018). Distinct roles for plasma membrane PtdIns 4 P and
PtdIns 4 5 P2 during yeast receptor mediated endocytosis. Journal of Cell Science.
Company of Biologists. https://doi.org/10.1242/jcs.207696
chicago: Yamamoto, Wataru, Suguru Wada, Makoto Nagano, Kaito Aoshima, Daria E Siekhaus,
Junko Toshima, and Jiro Toshima. “Distinct Roles for Plasma Membrane PtdIns 4
P and PtdIns 4 5 P2 during Yeast Receptor Mediated Endocytosis.” Journal of
Cell Science. Company of Biologists, 2018. https://doi.org/10.1242/jcs.207696.
ieee: W. Yamamoto et al., “Distinct roles for plasma membrane PtdIns 4 P
and PtdIns 4 5 P2 during yeast receptor mediated endocytosis,” Journal of Cell
Science, vol. 131, no. 1. Company of Biologists, 2018.
ista: Yamamoto W, Wada S, Nagano M, Aoshima K, Siekhaus DE, Toshima J, Toshima J.
2018. Distinct roles for plasma membrane PtdIns 4 P and PtdIns 4 5 P2 during yeast
receptor mediated endocytosis. Journal of Cell Science. 131(1), jcs207696.
mla: Yamamoto, Wataru, et al. “Distinct Roles for Plasma Membrane PtdIns 4 P and
PtdIns 4 5 P2 during Yeast Receptor Mediated Endocytosis.” Journal of Cell
Science, vol. 131, no. 1, jcs207696, Company of Biologists, 2018, doi:10.1242/jcs.207696.
short: W. Yamamoto, S. Wada, M. Nagano, K. Aoshima, D.E. Siekhaus, J. Toshima, J.
Toshima, Journal of Cell Science 131 (2018).
date_created: 2018-12-11T11:47:32Z
date_published: 2018-01-04T00:00:00Z
date_updated: 2026-06-18T19:01:31Z
day: '04'
ddc:
- '570'
department:
- _id: DaSi
doi: 10.1242/jcs.207696
external_id:
isi:
- '000424786900012'
pmid:
- '29192062'
intvolume: ' 131'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pubmed/29192062
month: '01'
oa: 1
oa_version: Published Version
pmid: 1
publication: Journal of Cell Science
publication_status: published
publisher: Company of Biologists
publist_id: '7184'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Distinct roles for plasma membrane PtdIns 4 P and PtdIns 4 5 P2 during yeast
receptor mediated endocytosis
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 131
year: '2018'
...
---
_id: '63'
abstract:
- lang: eng
text: African cichlids display a remarkable assortment of jaw morphologies, pigmentation
patterns, and mating behaviors. In addition to this previously documented diversity,
recent studies have documented a rich diversity of sex chromosomes within these
fishes. Here we review the known sex-determination network within vertebrates,
and the extraordinary number of sex chromosomes systems segregating in African
cichlids. We also propose a model for understanding the unusual number of sex
chromosome systems within this clade.
acknowledgement: NSF DEB-1830753 and ISTPlus Fellowship
article_number: '480'
article_processing_charge: No
author:
- first_name: William J
full_name: Gammerdinger, William J
id: 3A7E01BC-F248-11E8-B48F-1D18A9856A87
last_name: Gammerdinger
orcid: 0000-0001-9638-1220
- first_name: Thomas
full_name: Kocher, Thomas
last_name: Kocher
citation:
ama: Gammerdinger WJ, Kocher T. Unusual diversity of sex chromosomes in African
cichlid fishes. Genes. 2018;9(10). doi:10.3390/genes9100480
apa: Gammerdinger, W. J., & Kocher, T. (2018). Unusual diversity of sex chromosomes
in African cichlid fishes. Genes. MDPI. https://doi.org/10.3390/genes9100480
chicago: Gammerdinger, William J, and Thomas Kocher. “Unusual Diversity of Sex Chromosomes
in African Cichlid Fishes.” Genes. MDPI, 2018. https://doi.org/10.3390/genes9100480.
ieee: W. J. Gammerdinger and T. Kocher, “Unusual diversity of sex chromosomes in
African cichlid fishes,” Genes, vol. 9, no. 10. MDPI, 2018.
ista: Gammerdinger WJ, Kocher T. 2018. Unusual diversity of sex chromosomes in African
cichlid fishes. Genes. 9(10), 480.
mla: Gammerdinger, William J., and Thomas Kocher. “Unusual Diversity of Sex Chromosomes
in African Cichlid Fishes.” Genes, vol. 9, no. 10, 480, MDPI, 2018, doi:10.3390/genes9100480.
short: W.J. Gammerdinger, T. Kocher, Genes 9 (2018).
date_created: 2018-12-11T11:44:26Z
date_published: 2018-10-04T00:00:00Z
date_updated: 2025-04-15T06:50:01Z
day: '04'
ddc:
- '570'
department:
- _id: BeVi
doi: 10.3390/genes9100480
ec_funded: 1
external_id:
isi:
- '000448656700018'
file:
- access_level: open_access
checksum: bec527692e2c9b56919c0429634ff337
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T09:54:46Z
date_updated: 2020-07-14T12:47:27Z
file_id: '5743'
file_name: 2018_Genes_Gammerdinger.pdf
file_size: 1415791
relation: main_file
file_date_updated: 2020-07-14T12:47:27Z
has_accepted_license: '1'
intvolume: ' 9'
isi: 1
issue: '10'
language:
- iso: eng
month: '10'
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: Genes
publication_status: published
publisher: MDPI
publist_id: '7991'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Unusual diversity of sex chromosomes in African cichlid fishes
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: 9
year: '2018'
...
---
_id: '6339'
abstract:
- lang: eng
text: We introduce a diagrammatic Monte Carlo approach to angular momentum properties
of quantum many-particle systems possessing a macroscopic number of degrees of
freedom. The treatment is based on a diagrammatic expansion that merges the usual
Feynman diagrams with the angular momentum diagrams known from atomic and nuclear
structure theory, thereby incorporating the non-Abelian algebra inherent to quantum
rotations. Our approach is applicable at arbitrary coupling, is free of systematic
errors and of finite-size effects, and naturally provides access to the impurity
Green function. We exemplify the technique by obtaining an all-coupling solution
of the angulon model; however, the method is quite general and can be applied
to a broad variety of systems in which particles exchange quantum angular momentum
with their many-body environment.
article_number: '165301'
article_processing_charge: No
arxiv: 1
author:
- first_name: Giacomo
full_name: Bighin, Giacomo
id: 4CA96FD4-F248-11E8-B48F-1D18A9856A87
last_name: Bighin
orcid: 0000-0001-8823-9777
- first_name: Timur
full_name: Tscherbul, Timur
last_name: Tscherbul
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Bighin G, Tscherbul T, Lemeshko M. Diagrammatic Monte Carlo approach to angular
momentum in quantum many-particle systems. Physical Review Letters. 2018;121(16).
doi:10.1103/physrevlett.121.165301
apa: Bighin, G., Tscherbul, T., & Lemeshko, M. (2018). Diagrammatic Monte Carlo
approach to angular momentum in quantum many-particle systems. Physical Review
Letters. American Physical Society. https://doi.org/10.1103/physrevlett.121.165301
chicago: Bighin, Giacomo, Timur Tscherbul, and Mikhail Lemeshko. “Diagrammatic Monte Carlo
Approach to Angular Momentum in Quantum Many-Particle Systems.” Physical Review
Letters. American Physical Society, 2018. https://doi.org/10.1103/physrevlett.121.165301.
ieee: G. Bighin, T. Tscherbul, and M. Lemeshko, “Diagrammatic Monte Carlo approach
to angular momentum in quantum many-particle systems,” Physical Review Letters,
vol. 121, no. 16. American Physical Society, 2018.
ista: Bighin G, Tscherbul T, Lemeshko M. 2018. Diagrammatic Monte Carlo approach
to angular momentum in quantum many-particle systems. Physical Review Letters.
121(16), 165301.
mla: Bighin, Giacomo, et al. “Diagrammatic Monte Carlo Approach to Angular Momentum
in Quantum Many-Particle Systems.” Physical Review Letters, vol. 121, no.
16, 165301, American Physical Society, 2018, doi:10.1103/physrevlett.121.165301.
short: G. Bighin, T. Tscherbul, M. Lemeshko, Physical Review Letters 121 (2018).
date_created: 2019-04-17T10:53:38Z
date_published: 2018-10-16T00:00:00Z
date_updated: 2025-04-15T07:59:29Z
day: '16'
department:
- _id: MiLe
doi: 10.1103/physrevlett.121.165301
external_id:
arxiv:
- '1803.07990'
isi:
- '000447468400008'
intvolume: ' 121'
isi: 1
issue: '16'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1803.07990
month: '10'
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: Physical Review Letters
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/description-of-rotating-molecules-made-easy/
scopus_import: '1'
status: public
title: Diagrammatic Monte Carlo approach to angular momentum in quantum many-particle
systems
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 121
year: '2018'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '6354'
abstract:
- lang: eng
text: Blood platelets are critical for hemostasis and thrombosis, but also play
diverse roles during immune responses. We have recently reported that platelets
migrate at sites of infection in vitro and in vivo. Importantly, platelets use
their ability to migrate to collect and bundle fibrin (ogen)-bound bacteria accomplishing
efficient intravascular bacterial trapping. Here, we describe a method that allows
analyzing platelet migration in vitro, focusing on their ability to collect bacteria
and trap bacteria under flow.
acknowledgement: This protocol was adapted from a previously published study (Gaertner
et al., 2017). We thank Michael Lorenz for his excellent assistance in bacteria
culture. This work was funded by the DFG SFB 914 (S.M. [B02 and Z01]), the DFG SFB
1123 (S.M. [B06]), the DFG FOR 2033 (S.M. and F.G.), the German Centre for Cardiovascular
Research (DZHK) (MHA 1.4VD [S.M.]), FP7 program (project 260309, PRESTIGE [S.M.]),
FöFoLe project 947 (F.G.), the Friedrich-Baur-Stiftung project 41/16 (F.G.), Marie
Sklodowska Curie Individual Fellowship (EU project 747687, LamelliaActin [F.G.]).
article_number: e3018
article_processing_charge: Yes
article_type: original
author:
- first_name: Shuxia
full_name: Fan, Shuxia
last_name: Fan
- first_name: Michael
full_name: Lorenz, Michael
last_name: Lorenz
- first_name: Steffen
full_name: Massberg, Steffen
last_name: Massberg
- first_name: Florian R
full_name: Gärtner, Florian R
id: 397A88EE-F248-11E8-B48F-1D18A9856A87
last_name: Gärtner
orcid: 0000-0001-6120-3723
citation:
ama: Fan S, Lorenz M, Massberg S, Gärtner FR. Platelet migration and bacterial trapping
assay under flow. Bio-Protocol. 2018;8(18). doi:10.21769/bioprotoc.3018
apa: Fan, S., Lorenz, M., Massberg, S., & Gärtner, F. R. (2018). Platelet migration
and bacterial trapping assay under flow. Bio-Protocol. Bio-Protocol. https://doi.org/10.21769/bioprotoc.3018
chicago: Fan, Shuxia, Michael Lorenz, Steffen Massberg, and Florian R Gärtner. “Platelet
Migration and Bacterial Trapping Assay under Flow.” Bio-Protocol. Bio-Protocol,
2018. https://doi.org/10.21769/bioprotoc.3018.
ieee: S. Fan, M. Lorenz, S. Massberg, and F. R. Gärtner, “Platelet migration and
bacterial trapping assay under flow,” Bio-Protocol, vol. 8, no. 18. Bio-Protocol,
2018.
ista: Fan S, Lorenz M, Massberg S, Gärtner FR. 2018. Platelet migration and bacterial
trapping assay under flow. Bio-Protocol. 8(18), e3018.
mla: Fan, Shuxia, et al. “Platelet Migration and Bacterial Trapping Assay under
Flow.” Bio-Protocol, vol. 8, no. 18, e3018, Bio-Protocol, 2018, doi:10.21769/bioprotoc.3018.
short: S. Fan, M. Lorenz, S. Massberg, F.R. Gärtner, Bio-Protocol 8 (2018).
corr_author: '1'
date_created: 2019-04-29T09:40:33Z
date_published: 2018-09-20T00:00:00Z
date_updated: 2025-05-20T07:43:06Z
day: '20'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.21769/bioprotoc.3018
ec_funded: 1
external_id:
pmid:
- '34395806'
file:
- access_level: open_access
checksum: d4588377e789da7f360b553ae02c5119
content_type: application/pdf
creator: dernst
date_created: 2019-04-30T08:04:33Z
date_updated: 2020-07-14T12:47:28Z
file_id: '6360'
file_name: 2018_BioProtocol_Fan.pdf
file_size: 2928337
relation: main_file
file_date_updated: 2020-07-14T12:47:28Z
has_accepted_license: '1'
intvolume: ' 8'
issue: '18'
keyword:
- Platelets
- Cell migration
- Bacteria
- Shear flow
- Fibrinogen
- E. coli
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 260AA4E2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '747687'
name: Mechanical Adaptation of Lamellipodial Actin Networks in Migrating Cells
publication: Bio-Protocol
publication_identifier:
issn:
- 2331-8325
publication_status: published
publisher: Bio-Protocol
quality_controlled: '1'
status: public
title: Platelet migration and bacterial trapping assay under flow
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2018'
...
---
_id: '6355'
abstract:
- lang: eng
text: We prove that any cyclic quadrilateral can be inscribed in any closed convex
C1-curve. The smoothness condition is not required if the quadrilateral is a
rectangle.
article_number: e7
article_processing_charge: No
arxiv: 1
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Sergey
full_name: Avvakumov, Sergey
id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
last_name: Avvakumov
orcid: 0000-0002-7840-5062
citation:
ama: Akopyan A, Avvakumov S. Any cyclic quadrilateral can be inscribed in any closed
convex smooth curve. Forum of Mathematics, Sigma. 2018;6. doi:10.1017/fms.2018.7
apa: Akopyan, A., & Avvakumov, S. (2018). Any cyclic quadrilateral can be inscribed
in any closed convex smooth curve. Forum of Mathematics, Sigma. Cambridge
University Press. https://doi.org/10.1017/fms.2018.7
chicago: Akopyan, Arseniy, and Sergey Avvakumov. “Any Cyclic Quadrilateral Can Be
Inscribed in Any Closed Convex Smooth Curve.” Forum of Mathematics, Sigma.
Cambridge University Press, 2018. https://doi.org/10.1017/fms.2018.7.
ieee: A. Akopyan and S. Avvakumov, “Any cyclic quadrilateral can be inscribed in
any closed convex smooth curve,” Forum of Mathematics, Sigma, vol. 6. Cambridge
University Press, 2018.
ista: Akopyan A, Avvakumov S. 2018. Any cyclic quadrilateral can be inscribed in
any closed convex smooth curve. Forum of Mathematics, Sigma. 6, e7.
mla: Akopyan, Arseniy, and Sergey Avvakumov. “Any Cyclic Quadrilateral Can Be Inscribed
in Any Closed Convex Smooth Curve.” Forum of Mathematics, Sigma, vol. 6,
e7, Cambridge University Press, 2018, doi:10.1017/fms.2018.7.
short: A. Akopyan, S. Avvakumov, Forum of Mathematics, Sigma 6 (2018).
corr_author: '1'
date_created: 2019-04-30T06:09:57Z
date_published: 2018-05-31T00:00:00Z
date_updated: 2026-04-08T07:25:54Z
day: '31'
ddc:
- '510'
department:
- _id: UlWa
- _id: HeEd
- _id: JaMa
doi: 10.1017/fms.2018.7
ec_funded: 1
external_id:
arxiv:
- '1712.10205'
isi:
- '000433915500001'
file:
- access_level: open_access
checksum: 5a71b24ba712a3eb2e46165a38fbc30a
content_type: application/pdf
creator: dernst
date_created: 2019-04-30T06:14:58Z
date_updated: 2020-07-14T12:47:28Z
file_id: '6356'
file_name: 2018_ForumMahtematics_Akopyan.pdf
file_size: 249246
relation: main_file
file_date_updated: 2020-07-14T12:47:28Z
has_accepted_license: '1'
intvolume: ' 6'
isi: 1
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
project:
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '716117'
name: Optimal Transport and Stochastic Dynamics
publication: Forum of Mathematics, Sigma
publication_identifier:
issn:
- 2050-5094
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
related_material:
record:
- id: '8156'
relation: dissertation_contains
status: public
status: public
title: Any cyclic quadrilateral can be inscribed in any closed convex smooth curve
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: 6
year: '2018'
...
---
_id: '64'
abstract:
- lang: eng
text: Tropical geometry, an established field in pure mathematics, is a place where
string theory, mirror symmetry, computational algebra, auction theory, and so
forth meet and influence one another. In this paper, we report on our discovery
of a tropical model with self-organized criticality (SOC) behavior. Our model
is continuous, in contrast to all known models of SOC, and is a certain scaling
limit of the sandpile model, the first and archetypical model of SOC. We describe
how our model is related to pattern formation and proportional growth phenomena
and discuss the dichotomy between continuous and discrete models in several contexts.
Our aim in this context is to present an idealized tropical toy model (cf. Turing
reaction-diffusion model), requiring further investigation.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Nikita
full_name: Kalinin, Nikita
last_name: Kalinin
- first_name: Aldo
full_name: Guzmán Sáenz, Aldo
last_name: Guzmán Sáenz
- first_name: Y
full_name: Prieto, Y
last_name: Prieto
- first_name: Mikhail
full_name: Shkolnikov, Mikhail
id: 35084A62-F248-11E8-B48F-1D18A9856A87
last_name: Shkolnikov
orcid: 0000-0002-4310-178X
- first_name: V
full_name: Kalinina, V
last_name: Kalinina
- first_name: Ernesto
full_name: Lupercio, Ernesto
last_name: Lupercio
citation:
ama: Kalinin N, Guzmán Sáenz A, Prieto Y, Shkolnikov M, Kalinina V, Lupercio E.
Self-organized criticality and pattern emergence through the lens of tropical
geometry. Proceedings of the National Academy of Sciences of the United States
of America. 2018;115(35):E8135-E8142. doi:10.1073/pnas.1805847115
apa: Kalinin, N., Guzmán Sáenz, A., Prieto, Y., Shkolnikov, M., Kalinina, V., &
Lupercio, E. (2018). Self-organized criticality and pattern emergence through
the lens of tropical geometry. Proceedings of the National Academy of Sciences
of the United States of America. National Academy of Sciences. https://doi.org/10.1073/pnas.1805847115
chicago: Kalinin, Nikita, Aldo Guzmán Sáenz, Y Prieto, Mikhail Shkolnikov, V Kalinina,
and Ernesto Lupercio. “Self-Organized Criticality and Pattern Emergence through
the Lens of Tropical Geometry.” Proceedings of the National Academy of Sciences
of the United States of America. National Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1805847115.
ieee: N. Kalinin, A. Guzmán Sáenz, Y. Prieto, M. Shkolnikov, V. Kalinina, and E.
Lupercio, “Self-organized criticality and pattern emergence through the lens of
tropical geometry,” Proceedings of the National Academy of Sciences of the
United States of America, vol. 115, no. 35. National Academy of Sciences,
pp. E8135–E8142, 2018.
ista: Kalinin N, Guzmán Sáenz A, Prieto Y, Shkolnikov M, Kalinina V, Lupercio E.
2018. Self-organized criticality and pattern emergence through the lens of tropical
geometry. Proceedings of the National Academy of Sciences of the United States
of America. 115(35), E8135–E8142.
mla: Kalinin, Nikita, et al. “Self-Organized Criticality and Pattern Emergence through
the Lens of Tropical Geometry.” Proceedings of the National Academy of Sciences
of the United States of America, vol. 115, no. 35, National Academy of Sciences,
2018, pp. E8135–42, doi:10.1073/pnas.1805847115.
short: N. Kalinin, A. Guzmán Sáenz, Y. Prieto, M. Shkolnikov, V. Kalinina, E. Lupercio,
Proceedings of the National Academy of Sciences of the United States of America
115 (2018) E8135–E8142.
date_created: 2018-12-11T11:44:26Z
date_published: 2018-08-28T00:00:00Z
date_updated: 2025-06-03T11:21:16Z
day: '28'
department:
- _id: TaHa
doi: 10.1073/pnas.1805847115
ec_funded: 1
external_id:
arxiv:
- '1806.09153'
isi:
- '000442861600009'
intvolume: ' 115'
isi: 1
issue: '35'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1806.09153
month: '08'
oa: 1
oa_version: Preprint
page: E8135 - E8142
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Proceedings of the National Academy of Sciences of the United States
of America
publication_identifier:
issn:
- 0027-8424
publication_status: published
publisher: National Academy of Sciences
publist_id: '7990'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Self-organized criticality and pattern emergence through the lens of tropical
geometry
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 115
year: '2018'
...
---
_id: '199'
abstract:
- lang: eng
text: Sex-biased genes are central to the study of sexual selection, sexual antagonism,
and sex chromosome evolution. We describe a comprehensive de novo assembled transcriptome
in the common frog Rana temporaria based on five developmental stages and three
adult tissues from both sexes, obtained from a population with karyotypically
homomorphic but genetically differentiated sex chromosomes. This allows the study
of sex-biased gene expression throughout development, and its effect on the rate
of gene evolution while accounting for pleiotropic expression, which is known
to negatively correlate with the evolutionary rate. Overall, sex-biased genes
had little overlap among developmental stages and adult tissues. Late developmental
stages and gonad tissues had the highest numbers of stage-or tissue-specific genes.
We find that pleiotropic gene expression is a better predictor than sex bias for
the evolutionary rate of genes, though it often interacts with sex bias. Although
genetically differentiated, the sex chromosomes were not enriched in sex-biased
genes, possibly due to a very recent arrest of XY recombination. These results
extend our understanding of the developmental dynamics, tissue specificity, and
genomic localization of sex-biased genes.
article_number: '294'
article_processing_charge: No
author:
- first_name: Wen
full_name: Ma, Wen
last_name: Ma
- first_name: Paris
full_name: Veltsos, Paris
last_name: Veltsos
- first_name: Melissa A
full_name: Toups, Melissa A
id: 4E099E4E-F248-11E8-B48F-1D18A9856A87
last_name: Toups
orcid: 0000-0002-9752-7380
- first_name: Nicolas
full_name: Rodrigues, Nicolas
last_name: Rodrigues
- first_name: Roberto
full_name: Sermier, Roberto
last_name: Sermier
- first_name: Daniel
full_name: Jeffries, Daniel
last_name: Jeffries
- first_name: Nicolas
full_name: Perrin, Nicolas
last_name: Perrin
citation:
ama: Ma W, Veltsos P, Toups MA, et al. Tissue specificity and dynamics of sex biased
gene expression in a common frog population with differentiated, yet homomorphic,
sex chromosomes. Genes. 2018;9(6). doi:10.3390/genes9060294
apa: Ma, W., Veltsos, P., Toups, M. A., Rodrigues, N., Sermier, R., Jeffries, D.,
& Perrin, N. (2018). Tissue specificity and dynamics of sex biased gene expression
in a common frog population with differentiated, yet homomorphic, sex chromosomes.
Genes. MDPI. https://doi.org/10.3390/genes9060294
chicago: Ma, Wen, Paris Veltsos, Melissa A Toups, Nicolas Rodrigues, Roberto Sermier,
Daniel Jeffries, and Nicolas Perrin. “Tissue Specificity and Dynamics of Sex Biased
Gene Expression in a Common Frog Population with Differentiated, yet Homomorphic,
Sex Chromosomes.” Genes. MDPI, 2018. https://doi.org/10.3390/genes9060294.
ieee: W. Ma et al., “Tissue specificity and dynamics of sex biased gene expression
in a common frog population with differentiated, yet homomorphic, sex chromosomes,”
Genes, vol. 9, no. 6. MDPI, 2018.
ista: Ma W, Veltsos P, Toups MA, Rodrigues N, Sermier R, Jeffries D, Perrin N. 2018.
Tissue specificity and dynamics of sex biased gene expression in a common frog
population with differentiated, yet homomorphic, sex chromosomes. Genes. 9(6),
294.
mla: Ma, Wen, et al. “Tissue Specificity and Dynamics of Sex Biased Gene Expression
in a Common Frog Population with Differentiated, yet Homomorphic, Sex Chromosomes.”
Genes, vol. 9, no. 6, 294, MDPI, 2018, doi:10.3390/genes9060294.
short: W. Ma, P. Veltsos, M.A. Toups, N. Rodrigues, R. Sermier, D. Jeffries, N.
Perrin, Genes 9 (2018).
date_created: 2018-12-11T11:45:09Z
date_published: 2018-06-12T00:00:00Z
date_updated: 2024-12-11T13:13:35Z
day: '12'
ddc:
- '570'
department:
- _id: BeVi
doi: 10.3390/genes9060294
external_id:
isi:
- '000436494200026'
file:
- access_level: open_access
checksum: 423069beb1cd3cdd25bf3f464b38f1d7
content_type: application/pdf
creator: dernst
date_created: 2019-02-01T07:52:28Z
date_updated: 2020-07-14T12:45:22Z
file_id: '5905'
file_name: 2018_Genes_Ma.pdf
file_size: 3985796
relation: main_file
file_date_updated: 2020-07-14T12:45:22Z
has_accepted_license: '1'
intvolume: ' 9'
isi: 1
issue: '6'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: Genes
publication_status: published
publisher: MDPI
publist_id: '7714'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Tissue specificity and dynamics of sex biased gene expression in a common frog
population with differentiated, yet homomorphic, sex chromosomes
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: 9
year: '2018'
...
---
_id: '20'
abstract:
- lang: eng
text: 'Background: Norepinephrine (NE) signaling has a key role in white adipose
tissue (WAT) functions, including lipolysis, free fatty acid liberation and, under
certain conditions, conversion of white into brite (brown-in-white) adipocytes.
However, acute effects of NE stimulation have not been described at the transcriptional
network level. Results: We used RNA-seq to uncover a broad transcriptional response.
The inference of protein-protein and protein-DNA interaction networks allowed
us to identify a set of immediate-early genes (IEGs) with high betweenness, validating
our approach and suggesting a hierarchical control of transcriptional regulation.
In addition, we identified a transcriptional regulatory network with IEGs as master
regulators, including HSF1 and NFIL3 as novel NE-induced IEG candidates. Moreover,
a functional enrichment analysis and gene clustering into functional modules suggest
a crosstalk between metabolic, signaling, and immune responses. Conclusions: Altogether,
our network biology approach explores for the first time the immediate-early systems
level response of human adipocytes to acute sympathetic activation, thereby providing
a first network basis of early cell fate programs and crosstalks between metabolic
and transcriptional networks required for proper WAT function.'
acknowledgement: This work was funded by the German Centre for Diabetes Research (DZD)
and the Austrian Science Fund (FWF, P25729-B19).
article_processing_charge: No
article_type: original
author:
- first_name: Juan
full_name: Higareda Almaraz, Juan
last_name: Higareda Almaraz
- first_name: Michael
full_name: Karbiener, Michael
last_name: Karbiener
- first_name: Maude
full_name: Giroud, Maude
last_name: Giroud
- first_name: Florian
full_name: Pauler, Florian
id: 48EA0138-F248-11E8-B48F-1D18A9856A87
last_name: Pauler
orcid: 0000-0002-7462-0048
- first_name: Teresa
full_name: Gerhalter, Teresa
last_name: Gerhalter
- first_name: Stephan
full_name: Herzig, Stephan
last_name: Herzig
- first_name: Marcel
full_name: Scheideler, Marcel
last_name: Scheideler
citation:
ama: Higareda Almaraz J, Karbiener M, Giroud M, et al. Norepinephrine triggers an
immediate-early regulatory network response in primary human white adipocytes.
BMC Genomics. 2018;19(1). doi:10.1186/s12864-018-5173-0
apa: Higareda Almaraz, J., Karbiener, M., Giroud, M., Pauler, F., Gerhalter, T.,
Herzig, S., & Scheideler, M. (2018). Norepinephrine triggers an immediate-early
regulatory network response in primary human white adipocytes. BMC Genomics.
BioMed Central. https://doi.org/10.1186/s12864-018-5173-0
chicago: Higareda Almaraz, Juan, Michael Karbiener, Maude Giroud, Florian Pauler,
Teresa Gerhalter, Stephan Herzig, and Marcel Scheideler. “Norepinephrine Triggers
an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes.”
BMC Genomics. BioMed Central, 2018. https://doi.org/10.1186/s12864-018-5173-0.
ieee: J. Higareda Almaraz et al., “Norepinephrine triggers an immediate-early
regulatory network response in primary human white adipocytes,” BMC Genomics,
vol. 19, no. 1. BioMed Central, 2018.
ista: Higareda Almaraz J, Karbiener M, Giroud M, Pauler F, Gerhalter T, Herzig S,
Scheideler M. 2018. Norepinephrine triggers an immediate-early regulatory network
response in primary human white adipocytes. BMC Genomics. 19(1).
mla: Higareda Almaraz, Juan, et al. “Norepinephrine Triggers an Immediate-Early
Regulatory Network Response in Primary Human White Adipocytes.” BMC Genomics,
vol. 19, no. 1, BioMed Central, 2018, doi:10.1186/s12864-018-5173-0.
short: J. Higareda Almaraz, M. Karbiener, M. Giroud, F. Pauler, T. Gerhalter, S.
Herzig, M. Scheideler, BMC Genomics 19 (2018).
date_created: 2018-12-11T11:44:12Z
date_published: 2018-11-03T00:00:00Z
date_updated: 2023-09-13T09:10:47Z
day: '03'
ddc:
- '570'
department:
- _id: SiHi
doi: 10.1186/s12864-018-5173-0
external_id:
isi:
- '000450976700002'
file:
- access_level: open_access
checksum: a56516e734dab589dc7f3e1915973b4d
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T14:52:57Z
date_updated: 2020-07-14T12:45:23Z
file_id: '5712'
file_name: 2018_BMCGenomics_Higareda.pdf
file_size: 4629784
relation: main_file
file_date_updated: 2020-07-14T12:45:23Z
has_accepted_license: '1'
intvolume: ' 19'
isi: 1
issue: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
publication: BMC Genomics
publication_identifier:
issn:
- 1471-2164
publication_status: published
publisher: BioMed Central
publist_id: '8035'
quality_controlled: '1'
related_material:
record:
- id: '9807'
relation: research_data
status: public
- id: '9808'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Norepinephrine triggers an immediate-early regulatory network response in primary
human white adipocytes
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: 19
year: '2018'
...
---
OA_place: publisher
_id: '200'
abstract:
- lang: eng
text: This thesis is concerned with the inference of current population structure
based on geo-referenced genetic data. The underlying idea is that population structure
affects its spatial genetic structure. Therefore, genotype information can be
utilized to estimate important demographic parameters such as migration rates.
These indirect estimates of population structure have become very attractive,
as genotype data is now widely available. However, there also has been much concern
about these approaches. Importantly, genetic structure can be influenced by many
complex patterns, which often cannot be disentangled. Moreover, many methods merely
fit heuristic patterns of genetic structure, and do not build upon population
genetics theory. Here, I describe two novel inference methods that address these
shortcomings. In Chapter 2, I introduce an inference scheme based on a new type
of signal, identity by descent (IBD) blocks. Recently, it has become feasible
to detect such long blocks of genome shared between pairs of samples. These blocks
are direct traces of recent coalescence events. As such, they contain ample signal
for inferring recent demography. I examine sharing of IBD blocks in two-dimensional
populations with local migration. Using a diffusion approximation, I derive formulas
for an isolation by distance pattern of long IBD blocks and show that sharing
of long IBD blocks approaches rapid exponential decay for growing sample distance.
I describe an inference scheme based on these results. It can robustly estimate
the dispersal rate and population density, which is demonstrated on simulated
data. I also show an application to estimate mean migration and the rate of recent
population growth within Eastern Europe. Chapter 3 is about a novel method to
estimate barriers to gene flow in a two dimensional population. This inference
scheme utilizes geographically localized allele frequency fluctuations - a classical
isolation by distance signal. The strength of these local fluctuations increases
on average next to a barrier, and there is less correlation across it. I again
use a framework of diffusion of ancestral lineages to model this effect, and provide
an efficient numerical implementation to fit the results to geo-referenced biallelic
SNP data. This inference scheme is able to robustly estimate strong barriers to
gene flow, as tests on simulated data confirm.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Harald
full_name: Ringbauer, Harald
id: 417FCFF4-F248-11E8-B48F-1D18A9856A87
last_name: Ringbauer
orcid: 0000-0002-4884-9682
citation:
ama: Ringbauer H. Inferring recent demography from spatial genetic structure. 2018.
doi:10.15479/AT:ISTA:th_963
apa: Ringbauer, H. (2018). Inferring recent demography from spatial genetic structure.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_963
chicago: Ringbauer, Harald. “Inferring Recent Demography from Spatial Genetic Structure.”
Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_963.
ieee: H. Ringbauer, “Inferring recent demography from spatial genetic structure,”
Institute of Science and Technology Austria, 2018.
ista: Ringbauer H. 2018. Inferring recent demography from spatial genetic structure.
Institute of Science and Technology Austria.
mla: Ringbauer, Harald. Inferring Recent Demography from Spatial Genetic Structure.
Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_963.
short: H. Ringbauer, Inferring Recent Demography from Spatial Genetic Structure,
Institute of Science and Technology Austria, 2018.
corr_author: '1'
date_created: 2018-12-11T11:45:10Z
date_published: 2018-02-21T00:00:00Z
date_updated: 2026-04-08T14:06:37Z
day: '21'
ddc:
- '576'
degree_awarded: PhD
department:
- _id: NiBa
doi: 10.15479/AT:ISTA:th_963
file:
- access_level: open_access
checksum: 8cc534d2b528ae017acf80874cce48c9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:55Z
date_updated: 2020-07-14T12:45:23Z
file_id: '5111'
file_name: IST-2018-963-v1+1_thesis.pdf
file_size: 5792935
relation: main_file
- access_level: closed
checksum: 6af18d7e5a7e2728ceda2f41ee24f628
content_type: application/zip
creator: dernst
date_created: 2019-04-05T09:30:12Z
date_updated: 2020-07-14T12:45:23Z
file_id: '6224'
file_name: 2018_thesis_ringbauer_source.zip
file_size: 113365
relation: source_file
file_date_updated: 2020-07-14T12:45:23Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '146'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7713'
pubrep_id: '963'
related_material:
record:
- id: '563'
relation: part_of_dissertation
status: public
- id: '1074'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
title: Inferring recent demography from spatial genetic structure
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: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2018'
...
---
OA_place: repository
OA_type: green
_id: '203'
abstract:
- lang: eng
text: Asymmetric auxin distribution is instrumental for the differential growth
that causes organ bending on tropic stimuli and curvatures during plant development.
Local differences in auxin concentrations are achieved mainly by polarized cellular
distribution of PIN auxin transporters, but whether other mechanisms involving
auxin homeostasis are also relevant for the formation of auxin gradients is not
clear. Here we show that auxin methylation is required for asymmetric auxin distribution
across the hypocotyl, particularly during its response to gravity. We found that
loss-of-function mutants in Arabidopsis IAA CARBOXYL METHYLTRANSFERASE1 (IAMT1)
prematurely unfold the apical hook, and that their hypocotyls are impaired in
gravitropic reorientation. This defect is linked to an auxin-dependent increase
in PIN gene expression, leading to an increased polar auxin transport and lack
of asymmetric distribution of PIN3 in the iamt1 mutant. Gravitropic reorientation
in the iamt1 mutant could be restored with either endodermis-specific expression
of IAMT1 or partial inhibition of polar auxin transport, which also results in
normal PIN gene expression levels. We propose that IAA methylation is necessary
in gravity-sensing cells to restrict polar auxin transport within the range of
auxin levels that allow for differential responses.
article_processing_charge: No
article_type: original
author:
- first_name: Mohamad
full_name: Abbas, Mohamad
id: 47E8FC1C-F248-11E8-B48F-1D18A9856A87
last_name: Abbas
- first_name: García J
full_name: Hernández, García J
last_name: Hernández
- first_name: Stephan
full_name: Pollmann, Stephan
last_name: Pollmann
- first_name: Sophia L
full_name: Samodelov, Sophia L
last_name: Samodelov
- first_name: Martina
full_name: Kolb, Martina
last_name: Kolb
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Ulrich Z
full_name: Hammes, Ulrich Z
last_name: Hammes
- first_name: Matias D
full_name: Zurbriggen, Matias D
last_name: Zurbriggen
- first_name: Miguel
full_name: Blázquez, Miguel
last_name: Blázquez
- first_name: David
full_name: Alabadí, David
last_name: Alabadí
citation:
ama: Abbas M, Hernández GJ, Pollmann S, et al. Auxin methylation is required for
differential growth in Arabidopsis. PNAS. 2018;115(26):6864-6869. doi:10.1073/pnas.1806565115
apa: Abbas, M., Hernández, G. J., Pollmann, S., Samodelov, S. L., Kolb, M., Friml,
J., … Alabadí, D. (2018). Auxin methylation is required for differential growth
in Arabidopsis. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1806565115
chicago: Abbas, Mohamad, García J Hernández, Stephan Pollmann, Sophia L Samodelov,
Martina Kolb, Jiří Friml, Ulrich Z Hammes, Matias D Zurbriggen, Miguel Blázquez,
and David Alabadí. “Auxin Methylation Is Required for Differential Growth in Arabidopsis.”
PNAS. National Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1806565115.
ieee: M. Abbas et al., “Auxin methylation is required for differential growth
in Arabidopsis,” PNAS, vol. 115, no. 26. National Academy of Sciences,
pp. 6864–6869, 2018.
ista: Abbas M, Hernández GJ, Pollmann S, Samodelov SL, Kolb M, Friml J, Hammes UZ,
Zurbriggen MD, Blázquez M, Alabadí D. 2018. Auxin methylation is required for
differential growth in Arabidopsis. PNAS. 115(26), 6864–6869.
mla: Abbas, Mohamad, et al. “Auxin Methylation Is Required for Differential Growth
in Arabidopsis.” PNAS, vol. 115, no. 26, National Academy of Sciences,
2018, pp. 6864–69, doi:10.1073/pnas.1806565115.
short: M. Abbas, G.J. Hernández, S. Pollmann, S.L. Samodelov, M. Kolb, J. Friml,
U.Z. Hammes, M.D. Zurbriggen, M. Blázquez, D. Alabadí, PNAS 115 (2018) 6864–6869.
date_created: 2018-12-11T11:45:11Z
date_published: 2018-06-26T00:00:00Z
date_updated: 2026-04-28T08:29:26Z
day: '26'
department:
- _id: JiFr
doi: 10.1073/pnas.1806565115
ec_funded: 1
external_id:
isi:
- '000436245000096'
intvolume: ' 115'
isi: 1
issue: '26'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://eprints.nottingham.ac.uk/52388/
month: '06'
oa: 1
oa_version: Submitted Version
page: 6864-6869
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '7710'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Auxin methylation is required for differential growth in Arabidopsis
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 115
year: '2018'
...
---
_id: '104'
abstract:
- lang: eng
text: The biotrophic pathogen Ustilago maydis, the causative agent of corn smut
disease, infects one of the most important crops worldwide – Zea mays. To successfully
colonize its host, U. maydis secretes proteins, known as effectors, that suppress
plant defense responses and facilitate the establishment of biotrophy. In this
work, we describe the U. maydis effector protein Cce1. Cce1 is essential for virulence
and is upregulated during infection. Through microscopic analysis and in vitro
assays, we show that Cce1 is secreted from hyphae during filamentous growth of
the fungus. Strikingly, Δcce1 mutants are blocked at early stages of infection
and induce callose deposition as a plant defense response. Cce1 is highly conserved
among smut fungi and the Ustilago bromivora ortholog complemented the virulence
defect of the SG200Δcce1 deletion strain. These data indicate that Cce1 is a core
effector with apoplastic localization that is essential for U. maydis to infect
its host.
acknowledgement: 'the Austrian Science Fund (FWF): [P27429‐B22, P27818‐B22, I 3033‐B22],
and the Austrian Academy of Science (OEAW).'
article_processing_charge: No
author:
- first_name: Denise
full_name: Seitner, Denise
last_name: Seitner
- first_name: Simon
full_name: Uhse, Simon
last_name: Uhse
- 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: Armin
full_name: Djamei, Armin
last_name: Djamei
citation:
ama: Seitner D, Uhse S, Gallei MC, Djamei A. The core effector Cce1 is required
for early infection of maize by Ustilago maydis. Molecular Plant Pathology.
2018;19(10):2277-2287. doi:10.1111/mpp.12698
apa: Seitner, D., Uhse, S., Gallei, M. C., & Djamei, A. (2018). The core effector
Cce1 is required for early infection of maize by Ustilago maydis. Molecular
Plant Pathology. Wiley. https://doi.org/10.1111/mpp.12698
chicago: Seitner, Denise, Simon Uhse, Michelle C Gallei, and Armin Djamei. “The
Core Effector Cce1 Is Required for Early Infection of Maize by Ustilago Maydis.”
Molecular Plant Pathology. Wiley, 2018. https://doi.org/10.1111/mpp.12698.
ieee: D. Seitner, S. Uhse, M. C. Gallei, and A. Djamei, “The core effector Cce1
is required for early infection of maize by Ustilago maydis,” Molecular Plant
Pathology, vol. 19, no. 10. Wiley, pp. 2277–2287, 2018.
ista: Seitner D, Uhse S, Gallei MC, Djamei A. 2018. The core effector Cce1 is required
for early infection of maize by Ustilago maydis. Molecular Plant Pathology. 19(10),
2277–2287.
mla: Seitner, Denise, et al. “The Core Effector Cce1 Is Required for Early Infection
of Maize by Ustilago Maydis.” Molecular Plant Pathology, vol. 19, no. 10,
Wiley, 2018, pp. 2277–87, doi:10.1111/mpp.12698.
short: D. Seitner, S. Uhse, M.C. Gallei, A. Djamei, Molecular Plant Pathology 19
(2018) 2277–2287.
date_created: 2018-12-11T11:44:39Z
date_published: 2018-10-01T00:00:00Z
date_updated: 2023-09-19T10:06:42Z
day: '01'
ddc:
- '580'
department:
- _id: GradSch
doi: 10.1111/mpp.12698
external_id:
isi:
- '000445624100006'
file:
- access_level: open_access
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T09:46:00Z
date_updated: 2018-12-18T09:46:00Z
file_id: '5740'
file_name: 2018_MolecPlantPath_Seitner.pdf
file_size: 682335
relation: main_file
success: 1
file_date_updated: 2018-12-18T09:46:00Z
has_accepted_license: '1'
intvolume: ' 19'
isi: 1
issue: '10'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 2277 - 2287
publication: Molecular Plant Pathology
publication_status: published
publisher: Wiley
publist_id: '7950'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The core effector Cce1 is required for early infection of maize by Ustilago
maydis
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: 19
year: '2018'
...
---
OA_place: publisher
OA_type: hybrid
_id: '10417'
abstract:
- lang: eng
text: "We present a new dynamic partial-order reduction method for stateless model
checking of concurrent programs. A common approach for exploring program behaviors
relies on enumerating the traces of the program, without storing the visited states
(aka stateless exploration). As the number of distinct traces grows exponentially,
dynamic partial-order reduction (DPOR) techniques have been successfully used
to partition the space of traces into equivalence classes (Mazurkiewicz partitioning),
with the goal of exploring only few representative traces from each class.\r\n\r\nWe
introduce a new equivalence on traces under sequential consistency semantics,
which we call the observation equivalence. Two traces are observationally equivalent
if every read event observes the same write event in both traces. While the traditional
Mazurkiewicz equivalence is control-centric, our new definition is data-centric.
We show that our observation equivalence is coarser than the Mazurkiewicz equivalence,
and in many cases even exponentially coarser. We devise a DPOR exploration of
the trace space, called data-centric DPOR, based on the observation equivalence."
acknowledgement: "The research was partly supported by Austrian Science Fund (FWF)
Grant No P23499- N23, FWF\r\nNFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant
(279307: Graph Games), and Czech\r\nScience Foundation grant GBP202/12/G061."
article_number: '31'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Marek
full_name: Chalupa, Marek
last_name: Chalupa
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Nishant
full_name: Sinha, Nishant
last_name: Sinha
- first_name: Kapil
full_name: Vaidya, Kapil
last_name: Vaidya
citation:
ama: Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. Data-centric dynamic
partial order reduction. Proceedings of the ACM on Programming Languages.
2018;2(POPL). doi:10.1145/3158119
apa: 'Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., & Vaidya, K.
(2018). Data-centric dynamic partial order reduction. Proceedings of the ACM
on Programming Languages. Los Angeles, CA, United States: Association for
Computing Machinery. https://doi.org/10.1145/3158119'
chicago: Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha,
and Kapil Vaidya. “Data-Centric Dynamic Partial Order Reduction.” Proceedings
of the ACM on Programming Languages. Association for Computing Machinery,
2018. https://doi.org/10.1145/3158119.
ieee: M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, “Data-centric
dynamic partial order reduction,” Proceedings of the ACM on Programming Languages,
vol. 2, no. POPL. Association for Computing Machinery, 2018.
ista: Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2018. Data-centric
dynamic partial order reduction. Proceedings of the ACM on Programming Languages.
2(POPL), 31.
mla: Chalupa, Marek, et al. “Data-Centric Dynamic Partial Order Reduction.” Proceedings
of the ACM on Programming Languages, vol. 2, no. POPL, 31, Association for
Computing Machinery, 2018, doi:10.1145/3158119.
short: M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Proceedings
of the ACM on Programming Languages 2 (2018).
conference:
end_date: 2018-01-13
location: Los Angeles, CA, United States
name: 'POPL: Programming Languages'
start_date: 2018-01-07
date_created: 2021-12-05T23:01:49Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2025-05-20T09:45:10Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1145/3158119
ec_funded: 1
external_id:
arxiv:
- '1610.01188'
file:
- access_level: open_access
checksum: b27ab1745f6dba2387deb785798a657c
content_type: application/pdf
creator: dernst
date_created: 2025-05-20T09:44:47Z
date_updated: 2025-05-20T09:44:47Z
file_id: '19716'
file_name: 2018_ACM_Chalupa.pdf
file_size: 388891
relation: main_file
success: 1
file_date_updated: 2025-05-20T09:44:47Z
has_accepted_license: '1'
intvolume: ' 2'
issue: POPL
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published 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: 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:
eissn:
- 2475-1421
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '5448'
relation: earlier_version
status: public
- id: '5456'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Data-centric dynamic partial order reduction
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2018'
...
---
_id: '106'
abstract:
- lang: eng
text: The goal of this article is to introduce the reader to the theory of intrinsic
geometry of convex surfaces. We illustrate the power of the tools by proving a
theorem on convex surfaces containing an arbitrarily long closed simple geodesic.
Let us remind ourselves that a curve in a surface is called geodesic if every
sufficiently short arc of the curve is length minimizing; if, in addition, it
has no self-intersections, we call it simple geodesic. A tetrahedron with equal
opposite edges is called isosceles. The axiomatic method of Alexandrov geometry
allows us to work with the metrics of convex surfaces directly, without approximating
it first by a smooth or polyhedral metric. Such approximations destroy the closed
geodesics on the surface; therefore it is difficult (if at all possible) to apply
approximations in the proof of our theorem. On the other hand, a proof in the
smooth or polyhedral case usually admits a translation into Alexandrov’s language;
such translation makes the result more general. In fact, our proof resembles a
translation of the proof given by Protasov. Note that the main theorem implies
in particular that a smooth convex surface does not have arbitrarily long simple
closed geodesics. However we do not know a proof of this corollary that is essentially
simpler than the one presented below.
article_processing_charge: No
arxiv: 1
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Anton
full_name: Petrunin, Anton
last_name: Petrunin
citation:
ama: Akopyan A, Petrunin A. Long geodesics on convex surfaces. Mathematical Intelligencer.
2018;40(3):26-31. doi:10.1007/s00283-018-9795-5
apa: Akopyan, A., & Petrunin, A. (2018). Long geodesics on convex surfaces.
Mathematical Intelligencer. Springer. https://doi.org/10.1007/s00283-018-9795-5
chicago: Akopyan, Arseniy, and Anton Petrunin. “Long Geodesics on Convex Surfaces.”
Mathematical Intelligencer. Springer, 2018. https://doi.org/10.1007/s00283-018-9795-5.
ieee: A. Akopyan and A. Petrunin, “Long geodesics on convex surfaces,” Mathematical
Intelligencer, vol. 40, no. 3. Springer, pp. 26–31, 2018.
ista: Akopyan A, Petrunin A. 2018. Long geodesics on convex surfaces. Mathematical
Intelligencer. 40(3), 26–31.
mla: Akopyan, Arseniy, and Anton Petrunin. “Long Geodesics on Convex Surfaces.”
Mathematical Intelligencer, vol. 40, no. 3, Springer, 2018, pp. 26–31,
doi:10.1007/s00283-018-9795-5.
short: A. Akopyan, A. Petrunin, Mathematical Intelligencer 40 (2018) 26–31.
date_created: 2018-12-11T11:44:40Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2023-09-13T08:49:16Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/s00283-018-9795-5
external_id:
arxiv:
- '1702.05172'
isi:
- '000444141200005'
intvolume: ' 40'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1702.05172
month: '09'
oa: 1
oa_version: Preprint
page: 26 - 31
publication: Mathematical Intelligencer
publication_status: published
publisher: Springer
publist_id: '7948'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Long geodesics on convex surfaces
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 40
year: '2018'
...
---
_id: '1064'
abstract:
- lang: eng
text: 'In 1945, A.W. Goodman and R.E. Goodman proved the following conjecture by
P. Erdős: Given a family of (round) disks of radii r1, … , rn in the plane, it
is always possible to cover them by a disk of radius R= ∑ ri, provided they cannot
be separated into two subfamilies by a straight line disjoint from the disks.
In this note we show that essentially the same idea may work for different analogues
and generalizations of their result. In particular, we prove the following: Given
a family of positive homothetic copies of a fixed convex body K⊂ Rd with homothety
coefficients τ1, … , τn> 0 , it is always possible to cover them by a translate
of d+12(∑τi)K, provided they cannot be separated into two subfamilies by a hyperplane
disjoint from the homothets.'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Alexey
full_name: Balitskiy, Alexey
last_name: Balitskiy
- first_name: Mikhail
full_name: Grigorev, Mikhail
last_name: Grigorev
citation:
ama: Akopyan A, Balitskiy A, Grigorev M. On the circle covering theorem by A.W.
Goodman and R.E. Goodman. Discrete & Computational Geometry. 2018;59(4):1001-1009.
doi:10.1007/s00454-017-9883-x
apa: Akopyan, A., Balitskiy, A., & Grigorev, M. (2018). On the circle covering
theorem by A.W. Goodman and R.E. Goodman. Discrete & Computational Geometry.
Springer. https://doi.org/10.1007/s00454-017-9883-x
chicago: Akopyan, Arseniy, Alexey Balitskiy, and Mikhail Grigorev. “On the Circle
Covering Theorem by A.W. Goodman and R.E. Goodman.” Discrete & Computational
Geometry. Springer, 2018. https://doi.org/10.1007/s00454-017-9883-x.
ieee: A. Akopyan, A. Balitskiy, and M. Grigorev, “On the circle covering theorem
by A.W. Goodman and R.E. Goodman,” Discrete & Computational Geometry,
vol. 59, no. 4. Springer, pp. 1001–1009, 2018.
ista: Akopyan A, Balitskiy A, Grigorev M. 2018. On the circle covering theorem by
A.W. Goodman and R.E. Goodman. Discrete & Computational Geometry. 59(4), 1001–1009.
mla: Akopyan, Arseniy, et al. “On the Circle Covering Theorem by A.W. Goodman and
R.E. Goodman.” Discrete & Computational Geometry, vol. 59, no. 4, Springer,
2018, pp. 1001–09, doi:10.1007/s00454-017-9883-x.
short: A. Akopyan, A. Balitskiy, M. Grigorev, Discrete & Computational Geometry
59 (2018) 1001–1009.
corr_author: '1'
date_created: 2018-12-11T11:49:57Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2026-05-20T10:19:33Z
day: '01'
ddc:
- '516'
- '000'
department:
- _id: HeEd
doi: 10.1007/s00454-017-9883-x
ec_funded: 1
external_id:
isi:
- '000432205500011'
file:
- access_level: open_access
content_type: application/pdf
creator: dernst
date_created: 2019-01-18T09:27:36Z
date_updated: 2019-01-18T09:27:36Z
file_id: '5844'
file_name: 2018_DiscreteComp_Akopyan.pdf
file_size: 482518
relation: main_file
success: 1
file_date_updated: 2019-01-18T09:27:36Z
has_accepted_license: '1'
intvolume: ' 59'
isi: 1
issue: '4'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 1001-1009
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Discrete & Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer
publist_id: '6324'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the circle covering theorem by A.W. Goodman and R.E. Goodman
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: 59
year: '2018'
...
---
_id: '107'
abstract:
- lang: eng
text: 'We introduce the notion of “non-malleable codes” which relaxes the notion
of error correction and error detection. Informally, a code is non-malleable if
the message contained in a modified codeword is either the original message, or
a completely unrelated value. In contrast to error correction and error detection,
non-malleability can be achieved for very rich classes of modifications. We construct
an efficient code that is non-malleable with respect to modifications that affect
each bit of the codeword arbitrarily (i.e., leave it untouched, flip it, or set
it to either 0 or 1), but independently of the value of the other bits of the
codeword. Using the probabilistic method, we also show a very strong and general
statement: there exists a non-malleable code for every “small enough” family F
of functions via which codewords can be modified. Although this probabilistic
method argument does not directly yield efficient constructions, it gives us efficient
non-malleable codes in the random-oracle model for very general classes of tampering
functions—e.g., functions where every bit in the tampered codeword can depend
arbitrarily on any 99% of the bits in the original codeword. As an application
of non-malleable codes, we show that they provide an elegant algorithmic solution
to the task of protecting functionalities implemented in hardware (e.g., signature
cards) against “tampering attacks.” In such attacks, the secret state of a physical
system is tampered, in the hopes that future interaction with the modified system
will reveal some secret information. This problem was previously studied in the
work of Gennaro et al. in 2004 under the name “algorithmic tamper proof security”
(ATP). We show that non-malleable codes can be used to achieve important improvements
over the prior work. In particular, we show that any functionality can be made
secure against a large class of tampering attacks, simply by encoding the secret
state with a non-malleable code while it is stored in memory.'
article_number: '20'
article_processing_charge: No
article_type: original
author:
- first_name: Stefan
full_name: Dziembowski, Stefan
last_name: Dziembowski
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Daniel
full_name: Wichs, Daniel
last_name: Wichs
citation:
ama: Dziembowski S, Pietrzak KZ, Wichs D. Non-malleable codes. Journal of the
ACM. 2018;65(4). doi:10.1145/3178432
apa: Dziembowski, S., Pietrzak, K. Z., & Wichs, D. (2018). Non-malleable codes.
Journal of the ACM. ACM. https://doi.org/10.1145/3178432
chicago: Dziembowski, Stefan, Krzysztof Z Pietrzak, and Daniel Wichs. “Non-Malleable
Codes.” Journal of the ACM. ACM, 2018. https://doi.org/10.1145/3178432.
ieee: S. Dziembowski, K. Z. Pietrzak, and D. Wichs, “Non-malleable codes,” Journal
of the ACM, vol. 65, no. 4. ACM, 2018.
ista: Dziembowski S, Pietrzak KZ, Wichs D. 2018. Non-malleable codes. Journal of
the ACM. 65(4), 20.
mla: Dziembowski, Stefan, et al. “Non-Malleable Codes.” Journal of the ACM,
vol. 65, no. 4, 20, ACM, 2018, doi:10.1145/3178432.
short: S. Dziembowski, K.Z. Pietrzak, D. Wichs, Journal of the ACM 65 (2018).
date_created: 2018-12-11T11:44:40Z
date_published: 2018-08-01T00:00:00Z
date_updated: 2025-04-14T07:22:06Z
day: '01'
department:
- _id: KrPi
doi: 10.1145/3178432
ec_funded: 1
external_id:
isi:
- '000442938200004'
intvolume: ' 65'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2009/608
month: '08'
oa: 1
oa_version: Preprint
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication: Journal of the ACM
publication_status: published
publisher: ACM
publist_id: '7947'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Non-malleable codes
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 65
year: '2018'
...
---
_id: '108'
abstract:
- lang: eng
text: Universal hashing found a lot of applications in computer science. In cryptography
the most important fact about universal families is the so called Leftover Hash
Lemma, proved by Impagliazzo, Levin and Luby. In the language of modern cryptography
it states that almost universal families are good extractors. In this work we
provide a somewhat surprising characterization in the opposite direction. Namely,
every extractor with sufficiently good parameters yields a universal family on
a noticeable fraction of its inputs. Our proof technique is based on tools from
extremal graph theory applied to the \'collision graph\' induced by the extractor,
and may be of independent interest. We discuss possible applications to the theory
of randomness extractors and non-malleable codes.
alternative_title:
- ISIT Proceedings
article_processing_charge: No
author:
- first_name: Marciej
full_name: Obremski, Marciej
last_name: Obremski
- first_name: Maciej
full_name: Skorski, Maciej
id: EC09FA6A-02D0-11E9-8223-86B7C91467DD
last_name: Skorski
citation:
ama: 'Obremski M, Skórski M. Inverted leftover hash lemma. In: Vol 2018. IEEE; 2018.
doi:10.1109/ISIT.2018.8437654'
apa: 'Obremski, M., & Skórski, M. (2018). Inverted leftover hash lemma (Vol.
2018). Presented at the ISIT: International Symposium on Information Theory, Vail,
CO, USA: IEEE. https://doi.org/10.1109/ISIT.2018.8437654'
chicago: Obremski, Marciej, and Maciej Skórski. “Inverted Leftover Hash Lemma,”
Vol. 2018. IEEE, 2018. https://doi.org/10.1109/ISIT.2018.8437654.
ieee: 'M. Obremski and M. Skórski, “Inverted leftover hash lemma,” presented at
the ISIT: International Symposium on Information Theory, Vail, CO, USA, 2018,
vol. 2018.'
ista: 'Obremski M, Skórski M. 2018. Inverted leftover hash lemma. ISIT: International
Symposium on Information Theory, ISIT Proceedings, vol. 2018.'
mla: Obremski, Marciej, and Maciej Skórski. Inverted Leftover Hash Lemma.
Vol. 2018, IEEE, 2018, doi:10.1109/ISIT.2018.8437654.
short: M. Obremski, M. Skórski, in:, IEEE, 2018.
conference:
end_date: 2018-06-22
location: Vail, CO, USA
name: 'ISIT: International Symposium on Information Theory'
start_date: '2018-06-17 '
date_created: 2018-12-11T11:44:40Z
date_published: 2018-08-16T00:00:00Z
date_updated: 2023-09-13T08:23:18Z
day: '16'
department:
- _id: KrPi
doi: 10.1109/ISIT.2018.8437654
external_id:
isi:
- '000448139300368'
intvolume: ' 2018'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2017/507
month: '08'
oa: 1
oa_version: Submitted Version
publication_status: published
publisher: IEEE
publist_id: '7946'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Inverted leftover hash lemma
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2018
year: '2018'
...
---
_id: '76'
abstract:
- lang: eng
text: 'Consider a fully-connected synchronous distributed system consisting of n
nodes, where up to f nodes may be faulty and every node starts in an arbitrary
initial state. In the synchronous C-counting problem, all nodes need to eventually
agree on a counter that is increased by one modulo C in each round for given C>1.
In the self-stabilising firing squad problem, the task is to eventually guarantee
that all non-faulty nodes have simultaneous responses to external inputs: if a
subset of the correct nodes receive an external “go” signal as input, then all
correct nodes should agree on a round (in the not-too-distant future) in which
to jointly output a “fire” signal. Moreover, no node should generate a “fire”
signal without some correct node having previously received a “go” signal as input.
We present a framework reducing both tasks to binary consensus at very small cost.
For example, we obtain a deterministic algorithm for self-stabilising Byzantine
firing squads with optimal resilience f<n/3, asymptotically optimal stabilisation
and response time O(f), and message size O(log f). As our framework does not restrict
the type of consensus routines used, we also obtain efficient randomised solutions.'
article_processing_charge: Yes (via OA deal)
author:
- first_name: Christoph
full_name: Lenzen, Christoph
last_name: Lenzen
- first_name: Joel
full_name: Rybicki, Joel
id: 334EFD2E-F248-11E8-B48F-1D18A9856A87
last_name: Rybicki
orcid: 0000-0002-6432-6646
citation:
ama: Lenzen C, Rybicki J. Near-optimal self-stabilising counting and firing squads.
Distributed Computing. 2018. doi:10.1007/s00446-018-0342-6
apa: Lenzen, C., & Rybicki, J. (2018). Near-optimal self-stabilising counting
and firing squads. Distributed Computing. Springer. https://doi.org/10.1007/s00446-018-0342-6
chicago: Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting
and Firing Squads.” Distributed Computing. Springer, 2018. https://doi.org/10.1007/s00446-018-0342-6.
ieee: C. Lenzen and J. Rybicki, “Near-optimal self-stabilising counting and firing
squads,” Distributed Computing. Springer, 2018.
ista: Lenzen C, Rybicki J. 2018. Near-optimal self-stabilising counting and firing
squads. Distributed Computing.
mla: Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting
and Firing Squads.” Distributed Computing, Springer, 2018, doi:10.1007/s00446-018-0342-6.
short: C. Lenzen, J. Rybicki, Distributed Computing (2018).
corr_author: '1'
date_created: 2018-12-11T11:44:30Z
date_published: 2018-09-12T00:00:00Z
date_updated: 2025-04-15T06:53:15Z
day: '12'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.1007/s00446-018-0342-6
external_id:
isi:
- '000475627800005'
file:
- access_level: open_access
checksum: 872db70bba9b401500abe3c6ae2f1a61
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T14:21:22Z
date_updated: 2020-07-14T12:48:01Z
file_id: '5711'
file_name: 2018_DistributedComputing_Lenzen.pdf
file_size: 799337
relation: main_file
file_date_updated: 2020-07-14T12:48:01Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
publication: Distributed Computing
publication_status: published
publisher: Springer
publist_id: '7978'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Near-optimal self-stabilising counting and firing squads
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
year: '2018'
...