---
_id: '15037'
abstract:
- lang: eng
text: Protein abundance and localization at the plasma membrane (PM) shapes plant
development and mediates adaptation to changing environmental conditions. It is
regulated by ubiquitination, a post-translational modification crucial for the
proper sorting of endocytosed PM proteins to the vacuole for subsequent degradation.
To understand the significance and the variety of roles played by this reversible
modification, the function of ubiquitin receptors, which translate the ubiquitin
signature into a cellular response, needs to be elucidated. In this study, we
show that TOL (TOM1-like) proteins function in plants as multivalent ubiquitin
receptors, governing ubiquitinated cargo delivery to the vacuole via the conserved
Endosomal Sorting Complex Required for Transport (ESCRT) pathway. TOL2 and TOL6
interact with components of the ESCRT machinery and bind to K63-linked ubiquitin
via two tandemly arranged conserved ubiquitin-binding domains. Mutation of these
domains results not only in a loss of ubiquitin binding but also altered localization,
abolishing TOL6 ubiquitin receptor activity. Function and localization of TOL6
is itself regulated by ubiquitination, whereby TOL6 ubiquitination potentially
modulates degradation of PM-localized cargoes, assisting in the fine-tuning of
the delicate interplay between protein recycling and downregulation. Taken together,
our findings demonstrate the function and regulation of a ubiquitin receptor that
mediates vacuolar degradation of PM proteins in higher plants.
article_processing_charge: No
article_type: original
author:
- first_name: Jeanette
full_name: Moulinier-Anzola, Jeanette
last_name: Moulinier-Anzola
- first_name: Maximilian
full_name: Schwihla, Maximilian
last_name: Schwihla
- first_name: Lucinda
full_name: De-Araújo, Lucinda
last_name: De-Araújo
- first_name: Christina
full_name: Artner, Christina
id: 45DF286A-F248-11E8-B48F-1D18A9856A87
last_name: Artner
- first_name: Lisa
full_name: Jörg, Lisa
last_name: Jörg
- first_name: Nataliia
full_name: Konstantinova, Nataliia
last_name: Konstantinova
- first_name: Christian
full_name: Luschnig, Christian
last_name: Luschnig
- first_name: Barbara
full_name: Korbei, Barbara
last_name: Korbei
citation:
ama: Moulinier-Anzola J, Schwihla M, De-Araújo L, et al. TOLs function as ubiquitin
receptors in the early steps of the ESCRT pathway in higher plants. Molecular
Plant. 2020;13(5):717-731. doi:10.1016/j.molp.2020.02.012
apa: Moulinier-Anzola, J., Schwihla, M., De-Araújo, L., Artner, C., Jörg, L., Konstantinova,
N., … Korbei, B. (2020). TOLs function as ubiquitin receptors in the early steps
of the ESCRT pathway in higher plants. Molecular Plant. Elsevier. https://doi.org/10.1016/j.molp.2020.02.012
chicago: Moulinier-Anzola, Jeanette, Maximilian Schwihla, Lucinda De-Araújo, Christina
Artner, Lisa Jörg, Nataliia Konstantinova, Christian Luschnig, and Barbara Korbei.
“TOLs Function as Ubiquitin Receptors in the Early Steps of the ESCRT Pathway
in Higher Plants.” Molecular Plant. Elsevier, 2020. https://doi.org/10.1016/j.molp.2020.02.012.
ieee: J. Moulinier-Anzola et al., “TOLs function as ubiquitin receptors in
the early steps of the ESCRT pathway in higher plants,” Molecular Plant,
vol. 13, no. 5. Elsevier, pp. 717–731, 2020.
ista: Moulinier-Anzola J, Schwihla M, De-Araújo L, Artner C, Jörg L, Konstantinova
N, Luschnig C, Korbei B. 2020. TOLs function as ubiquitin receptors in the early
steps of the ESCRT pathway in higher plants. Molecular Plant. 13(5), 717–731.
mla: Moulinier-Anzola, Jeanette, et al. “TOLs Function as Ubiquitin Receptors in
the Early Steps of the ESCRT Pathway in Higher Plants.” Molecular Plant,
vol. 13, no. 5, Elsevier, 2020, pp. 717–31, doi:10.1016/j.molp.2020.02.012.
short: J. Moulinier-Anzola, M. Schwihla, L. De-Araújo, C. Artner, L. Jörg, N. Konstantinova,
C. Luschnig, B. Korbei, Molecular Plant 13 (2020) 717–731.
date_created: 2024-02-28T08:55:56Z
date_published: 2020-05-04T00:00:00Z
date_updated: 2024-02-28T12:41:52Z
day: '04'
ddc:
- '580'
department:
- _id: EvBe
doi: 10.1016/j.molp.2020.02.012
external_id:
pmid:
- '32087370'
file:
- access_level: open_access
checksum: c538a5008f7827f62d17d40a3bfabe65
content_type: application/pdf
creator: dernst
date_created: 2024-02-28T12:39:56Z
date_updated: 2024-02-28T12:39:56Z
file_id: '15038'
file_name: 2020_MolecularPlant_MoulinierAnzola.pdf
file_size: 3089212
relation: main_file
success: 1
file_date_updated: 2024-02-28T12:39:56Z
has_accepted_license: '1'
intvolume: ' 13'
issue: '5'
keyword:
- Plant Science
- Molecular Biology
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '05'
oa: 1
oa_version: Published Version
page: 717-731
pmid: 1
publication: Molecular Plant
publication_identifier:
issn:
- 1674-2052
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway
in higher 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: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2020'
...
---
_id: '15055'
abstract:
- lang: eng
text: Markov decision processes (MDPs) are the defacto framework for sequential
decision making in the presence of stochastic uncertainty. A classical optimization
criterion for MDPs is to maximize the expected discounted-sum payoff, which ignores
low probability catastrophic events with highly negative impact on the system.
On the other hand, risk-averse policies require the probability of undesirable
events to be below a given threshold, but they do not account for optimization
of the expected payoff. We consider MDPs with discounted-sum payoff with failure
states which represent catastrophic outcomes. The objective of risk-constrained
planning is to maximize the expected discounted-sum payoff among risk-averse policies
that ensure the probability to encounter a failure state is below a desired threshold.
Our main contribution is an efficient risk-constrained planning algorithm that
combines UCT-like search with a predictor learned through interaction with the
MDP (in the style of AlphaZero) and with a risk-constrained action selection via
linear programming. We demonstrate the effectiveness of our approach with experiments
on classical MDPs from the literature, including benchmarks with an order of 106
states.
acknowledgement: Krishnendu Chatterjee is supported by the Austrian Science Fund (FWF)
NFN Grant No. S11407-N23 (RiSE/SHiNE), and COST Action GAMENET. Tomas Brazdil is
supported by the Grant Agency of Masaryk University grant no. MUNI/G/0739/2017 and
by the Czech Science Foundation grant No. 18-11193S. Petr Novotny and Jirı Vahala
are supported by the Czech Science Foundation grant No. GJ19-15134Y.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Tomáš
full_name: Brázdil, Tomáš
last_name: Brázdil
- 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: Novotný, Petr
last_name: Novotný
- first_name: Jiří
full_name: Vahala, Jiří
last_name: Vahala
citation:
ama: Brázdil T, Chatterjee K, Novotný P, Vahala J. Reinforcement learning of risk-constrained
policies in Markov decision processes. Proceedings of the 34th AAAI Conference
on Artificial Intelligence. 2020;34(06):9794-9801. doi:10.1609/aaai.v34i06.6531
apa: 'Brázdil, T., Chatterjee, K., Novotný, P., & Vahala, J. (2020). Reinforcement
learning of risk-constrained policies in Markov decision processes. Proceedings
of the 34th AAAI Conference on Artificial Intelligence. New York, NY, United
States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v34i06.6531'
chicago: Brázdil, Tomáš, Krishnendu Chatterjee, Petr Novotný, and Jiří Vahala. “Reinforcement
Learning of Risk-Constrained Policies in Markov Decision Processes.” Proceedings
of the 34th AAAI Conference on Artificial Intelligence. Association for the
Advancement of Artificial Intelligence, 2020. https://doi.org/10.1609/aaai.v34i06.6531.
ieee: T. Brázdil, K. Chatterjee, P. Novotný, and J. Vahala, “Reinforcement learning
of risk-constrained policies in Markov decision processes,” Proceedings of
the 34th AAAI Conference on Artificial Intelligence, vol. 34, no. 06. Association
for the Advancement of Artificial Intelligence, pp. 9794–9801, 2020.
ista: Brázdil T, Chatterjee K, Novotný P, Vahala J. 2020. Reinforcement learning
of risk-constrained policies in Markov decision processes. Proceedings of the
34th AAAI Conference on Artificial Intelligence. 34(06), 9794–9801.
mla: Brázdil, Tomáš, et al. “Reinforcement Learning of Risk-Constrained Policies
in Markov Decision Processes.” Proceedings of the 34th AAAI Conference on Artificial
Intelligence, vol. 34, no. 06, Association for the Advancement of Artificial
Intelligence, 2020, pp. 9794–801, doi:10.1609/aaai.v34i06.6531.
short: T. Brázdil, K. Chatterjee, P. Novotný, J. Vahala, Proceedings of the 34th
AAAI Conference on Artificial Intelligence 34 (2020) 9794–9801.
conference:
end_date: 2020-02-12
location: New York, NY, United States
name: 'AAAI: Conference on Artificial Intelligence'
start_date: 2020-02-07
date_created: 2024-03-04T08:07:22Z
date_published: 2020-04-03T00:00:00Z
date_updated: 2024-03-04T08:30:16Z
day: '03'
department:
- _id: KrCh
doi: 10.1609/aaai.v34i06.6531
external_id:
arxiv:
- '2002.12086'
intvolume: ' 34'
issue: '06'
keyword:
- General Medicine
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2002.12086
month: '04'
oa: 1
oa_version: Preprint
page: 9794-9801
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: Proceedings of the 34th AAAI Conference on Artificial Intelligence
publication_identifier:
issn:
- 2374-3468
publication_status: published
publisher: Association for the Advancement of Artificial Intelligence
quality_controlled: '1'
status: public
title: Reinforcement learning of risk-constrained policies in Markov decision processes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2020'
...
---
_id: '15057'
abstract:
- lang: eng
text: Vaccinia virus–related kinase (VRK) is an evolutionarily conserved nuclear
protein kinase. VRK-1, the single Caenorhabditis elegans VRK ortholog, functions
in cell division and germline proliferation. However, the role of VRK-1 in postmitotic
cells and adult life span remains unknown. Here, we show that VRK-1 increases
organismal longevity by activating the cellular energy sensor, AMP-activated protein
kinase (AMPK), via direct phosphorylation. We found that overexpression of vrk-1
in the soma of adult C. elegans increased life span and, conversely, inhibition
of vrk-1 decreased life span. In addition, vrk-1 was required for longevity conferred
by mutations that inhibit C. elegans mitochondrial respiration, which requires
AMPK. VRK-1 directly phosphorylated and up-regulated AMPK in both C. elegans and
cultured human cells. Thus, our data show that the somatic nuclear kinase, VRK-1,
promotes longevity through AMPK activation, and this function appears to be conserved
between C. elegans and humans.
acknowledgement: 'This research was supported by grants NRF-2019R1A3B2067745 and NRF-2017R1A5A1015366
funded by the Korean Government (MSIT) through the National Research Foundation
(NRF) of Korea to S.-J.V.L. and by grant Basic Science Research Program (No. 2019R1A2C2009440)
funded by the Korean Government (MSIT) through the NRF of Korea to K.-T.K. '
article_number: aaw7824
article_processing_charge: No
article_type: original
author:
- first_name: Sangsoon
full_name: Park, Sangsoon
last_name: Park
- first_name: Murat
full_name: Artan, Murat
id: C407B586-6052-11E9-B3AE-7006E6697425
last_name: Artan
orcid: 0000-0001-8945-6992
- first_name: Seung Hyun
full_name: Han, Seung Hyun
last_name: Han
- first_name: Hae-Eun H.
full_name: Park, Hae-Eun H.
last_name: Park
- first_name: Yoonji
full_name: Jung, Yoonji
last_name: Jung
- first_name: Ara B.
full_name: Hwang, Ara B.
last_name: Hwang
- first_name: Won Sik
full_name: Shin, Won Sik
last_name: Shin
- first_name: Kyong-Tai
full_name: Kim, Kyong-Tai
last_name: Kim
- first_name: Seung-Jae V.
full_name: Lee, Seung-Jae V.
last_name: Lee
citation:
ama: Park S, Artan M, Han SH, et al. VRK-1 extends life span by activation of AMPK
via phosphorylation. Science Advances. 2020;6(27). doi:10.1126/sciadv.aaw7824
apa: Park, S., Artan, M., Han, S. H., Park, H.-E. H., Jung, Y., Hwang, A. B., …
Lee, S.-J. V. (2020). VRK-1 extends life span by activation of AMPK via phosphorylation.
Science Advances. American Association for the Advancement of Science.
https://doi.org/10.1126/sciadv.aaw7824
chicago: Park, Sangsoon, Murat Artan, Seung Hyun Han, Hae-Eun H. Park, Yoonji Jung,
Ara B. Hwang, Won Sik Shin, Kyong-Tai Kim, and Seung-Jae V. Lee. “VRK-1 Extends
Life Span by Activation of AMPK via Phosphorylation.” Science Advances.
American Association for the Advancement of Science, 2020. https://doi.org/10.1126/sciadv.aaw7824.
ieee: S. Park et al., “VRK-1 extends life span by activation of AMPK via
phosphorylation,” Science Advances, vol. 6, no. 27. American Association
for the Advancement of Science, 2020.
ista: Park S, Artan M, Han SH, Park H-EH, Jung Y, Hwang AB, Shin WS, Kim K-T, Lee
S-JV. 2020. VRK-1 extends life span by activation of AMPK via phosphorylation.
Science Advances. 6(27), aaw7824.
mla: Park, Sangsoon, et al. “VRK-1 Extends Life Span by Activation of AMPK via Phosphorylation.”
Science Advances, vol. 6, no. 27, aaw7824, American Association for the
Advancement of Science, 2020, doi:10.1126/sciadv.aaw7824.
short: S. Park, M. Artan, S.H. Han, H.-E.H. Park, Y. Jung, A.B. Hwang, W.S. Shin,
K.-T. Kim, S.-J.V. Lee, Science Advances 6 (2020).
date_created: 2024-03-04T09:41:57Z
date_published: 2020-07-01T00:00:00Z
date_updated: 2024-03-04T09:52:09Z
day: '01'
ddc:
- '570'
department:
- _id: MaDe
doi: 10.1126/sciadv.aaw7824
file:
- access_level: open_access
checksum: a37157cd0de709dce5fe03f4a31cd0b6
content_type: application/pdf
creator: dernst
date_created: 2024-03-04T09:46:41Z
date_updated: 2024-03-04T09:46:41Z
file_id: '15058'
file_name: 2020_ScienceAdvances_Park.pdf
file_size: 1864415
relation: main_file
success: 1
file_date_updated: 2024-03-04T09:46:41Z
has_accepted_license: '1'
intvolume: ' 6'
issue: '27'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '07'
oa: 1
oa_version: Published Version
publication: Science Advances
publication_identifier:
eissn:
- 2375-2548
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
status: public
title: VRK-1 extends life span by activation of AMPK via phosphorylation
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: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2020'
...
---
_id: '15059'
abstract:
- lang: eng
text: "In this paper we present a room temperature radiometer that can eliminate
the need of using cryostats in satellite payload reducing its weight and improving
reliability. The proposed radiometer is based on an electro-optic upconverter
that boosts up microwave photons energy by upconverting them into an optical domain
what makes them immune to thermal noise even if operating at room temperature.
The converter uses a high-quality factor whispering gallery\r\nmode (WGM) resonator
providing naturally narrow bandwidth and therefore might be useful for applications
like microwave hyperspectral sensing. The upconversion process is explained by\r\nproviding
essential information about photon conversion efficiency and sensitivity. To prove
the concept, we describe an experiment which shows state-of-the-art photon conversion
efficiency n=10-5 per mW of pump power at the frequency of 80 GHz."
acknowledgement: This work has been financially supported by Comunidad de Madrid S2018/NMT-4333
ARTINLARA-CM projects, and “FUNDACIÓN SENER” REFTA projects.
article_processing_charge: No
author:
- first_name: Michal
full_name: Wasiak, Michal
last_name: Wasiak
- first_name: Gabriel Santamaria
full_name: Botello, Gabriel Santamaria
last_name: Botello
- first_name: Kerlos Atia
full_name: Abdalmalak, Kerlos Atia
last_name: Abdalmalak
- first_name: Florian
full_name: Sedlmeir, Florian
last_name: Sedlmeir
- first_name: Alfredo R
full_name: Rueda Sanchez, Alfredo R
id: 3B82B0F8-F248-11E8-B48F-1D18A9856A87
last_name: Rueda Sanchez
orcid: 0000-0001-6249-5860
- first_name: Daniel
full_name: Segovia-Vargas, Daniel
last_name: Segovia-Vargas
- first_name: Harald G. L.
full_name: Schwefel, Harald G. L.
last_name: Schwefel
- first_name: Luis Enrique Garcia
full_name: Munoz, Luis Enrique Garcia
last_name: Munoz
citation:
ama: 'Wasiak M, Botello GS, Abdalmalak KA, et al. Compact millimeter and submillimeter-wave
photonic radiometer for cubesats. In: 14th European Conference on Antennas
and Propagation. IEEE; 2020. doi:10.23919/eucap48036.2020.9135962'
apa: 'Wasiak, M., Botello, G. S., Abdalmalak, K. A., Sedlmeir, F., Rueda Sanchez,
A. R., Segovia-Vargas, D., … Munoz, L. E. G. (2020). Compact millimeter and submillimeter-wave
photonic radiometer for cubesats. In 14th European Conference on Antennas and
Propagation. Copenhagen, Denmark: IEEE. https://doi.org/10.23919/eucap48036.2020.9135962'
chicago: Wasiak, Michal, Gabriel Santamaria Botello, Kerlos Atia Abdalmalak, Florian
Sedlmeir, Alfredo R Rueda Sanchez, Daniel Segovia-Vargas, Harald G. L. Schwefel,
and Luis Enrique Garcia Munoz. “Compact Millimeter and Submillimeter-Wave Photonic
Radiometer for Cubesats.” In 14th European Conference on Antennas and Propagation.
IEEE, 2020. https://doi.org/10.23919/eucap48036.2020.9135962.
ieee: M. Wasiak et al., “Compact millimeter and submillimeter-wave photonic
radiometer for cubesats,” in 14th European Conference on Antennas and Propagation,
Copenhagen, Denmark, 2020.
ista: 'Wasiak M, Botello GS, Abdalmalak KA, Sedlmeir F, Rueda Sanchez AR, Segovia-Vargas
D, Schwefel HGL, Munoz LEG. 2020. Compact millimeter and submillimeter-wave photonic
radiometer for cubesats. 14th European Conference on Antennas and Propagation.
EuCAP: European Conference on Antennas and Propagation.'
mla: Wasiak, Michal, et al. “Compact Millimeter and Submillimeter-Wave Photonic
Radiometer for Cubesats.” 14th European Conference on Antennas and Propagation,
IEEE, 2020, doi:10.23919/eucap48036.2020.9135962.
short: M. Wasiak, G.S. Botello, K.A. Abdalmalak, F. Sedlmeir, A.R. Rueda Sanchez,
D. Segovia-Vargas, H.G.L. Schwefel, L.E.G. Munoz, in:, 14th European Conference
on Antennas and Propagation, IEEE, 2020.
conference:
end_date: 2020-03-20
location: Copenhagen, Denmark
name: 'EuCAP: European Conference on Antennas and Propagation'
start_date: 2020-03-15
date_created: 2024-03-04T09:57:48Z
date_published: 2020-07-08T00:00:00Z
date_updated: 2024-03-04T10:02:49Z
day: '08'
department:
- _id: JoFi
doi: 10.23919/eucap48036.2020.9135962
language:
- iso: eng
month: '07'
oa_version: None
publication: 14th European Conference on Antennas and Propagation
publication_identifier:
eisbn:
- '9788831299008'
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: Compact millimeter and submillimeter-wave photonic radiometer for cubesats
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '15061'
abstract:
- lang: eng
text: The actin cytoskeleton, a dynamic network of actin filaments and associated
F-actin–binding proteins, is fundamentally important in eukaryotes. α-Actinins
are major F-actin bundlers that are inhibited by Ca2+ in nonmuscle cells. Here
we report the mechanism of Ca2+-mediated regulation of Entamoeba histolytica α-actinin-2
(EhActn2) with features expected for the common ancestor of Entamoeba and higher
eukaryotic α-actinins. Crystal structures of Ca2+-free and Ca2+-bound EhActn2
reveal a calmodulin-like domain (CaMD) uniquely inserted within the rod domain.
Integrative studies reveal an exceptionally high affinity of the EhActn2 CaMD
for Ca2+, binding of which can only be regulated in the presence of physiological
concentrations of Mg2+. Ca2+ binding triggers an increase in protein multidomain
rigidity, reducing conformational flexibility of F-actin–binding domains via interdomain
cross-talk and consequently inhibiting F-actin bundling. In vivo studies uncover
that EhActn2 plays an important role in phagocytic cup formation and might constitute
a new drug target for amoebic dysentery.
acknowledged_ssus:
- _id: LifeSc
acknowledgement: "We thank the staff of the macromolecular crystallography (MX) and
SAXS beamlines at the European Synchrotron Radiation facility, Diamond, and Swiss
Light Source for excellent support, and the Life Sciences Facility of the Institute
of Science and Technology Austria for usage of the rheometer. We thank Life Sciences
editors for editing assistance. EM data were\r\nrecorded at the EM Facility of the
Vienna BioCenter Core Facilities (Austria). Confocal microscopy was carried out
at the Advanced Instrument Research Facility, Jawaharlal Nehru University. K.D.-C.’s
research was supported by the Initial Training Network MUZIC (ITN-MUZIC) (N°238423),
Austrian Science Fund (FWF) Projects I525, I1593, P22276, P19060, and W1221, Laura
Bassi Centre of Optimized Structural Studies (N°253275), a Wellcome Trust Collaborative
Award (201543/Z/16/Z), COST Action BM1405, Vienna Science and Technology Fund (WWTF)
Chemical Biology Project LS17-008, and Christian Doppler Laboratory for High-Content
Structural Biology and Biotechnology. K.Z., J.L.A., C.S., E.A.G., and A.S. were
supported by the University of Vienna, J.K. by a Wellcome Trust Collaborative Award
and by the Centre of Optimized Structural Studies, M.P. by FWF Project I1593, E.d.A.R.
ITN-MUZIC, and FWF Projects I525 and I1593, and T.C.M. and L.C. by FWF Project I
2408-B22. E.A.G. acknowledges the PhD program Structure and Interaction of Biological
Macromolecules. M.B. acknowledges the University Grant Commission, India, for a
senior research fellowship. A.B. acknowledges a JC Bose Fellowship from the Science
Engineering Research Council. "
article_processing_charge: No
article_type: original
author:
- first_name: Nikos
full_name: Pinotsis, Nikos
last_name: Pinotsis
- first_name: Karolina
full_name: Zielinska, Karolina
last_name: Zielinska
- first_name: Mrigya
full_name: Babuta, Mrigya
last_name: Babuta
- first_name: Joan L.
full_name: Arolas, Joan L.
last_name: Arolas
- first_name: Julius
full_name: Kostan, Julius
last_name: Kostan
- first_name: Muhammad Bashir
full_name: Khan, Muhammad Bashir
last_name: Khan
- first_name: Claudia
full_name: Schreiner, Claudia
last_name: Schreiner
- first_name: Anita P
full_name: Testa Salmazo, Anita P
id: 41F1F098-F248-11E8-B48F-1D18A9856A87
last_name: Testa Salmazo
- first_name: Luciano
full_name: Ciccarelli, Luciano
last_name: Ciccarelli
- first_name: Martin
full_name: Puchinger, Martin
last_name: Puchinger
- first_name: Eirini A.
full_name: Gkougkoulia, Eirini A.
last_name: Gkougkoulia
- first_name: Euripedes de Almeida
full_name: Ribeiro, Euripedes de Almeida
last_name: Ribeiro
- first_name: Thomas C.
full_name: Marlovits, Thomas C.
last_name: Marlovits
- first_name: Alok
full_name: Bhattacharya, Alok
last_name: Bhattacharya
- first_name: Kristina
full_name: Djinovic-Carugo, Kristina
last_name: Djinovic-Carugo
citation:
ama: Pinotsis N, Zielinska K, Babuta M, et al. Calcium modulates the domain flexibility
and function of an α-actinin similar to the ancestral α-actinin. Proceedings
of the National Academy of Sciences. 2020;117(36):22101-22112. doi:10.1073/pnas.1917269117
apa: Pinotsis, N., Zielinska, K., Babuta, M., Arolas, J. L., Kostan, J., Khan, M.
B., … Djinovic-Carugo, K. (2020). Calcium modulates the domain flexibility and
function of an α-actinin similar to the ancestral α-actinin. Proceedings of
the National Academy of Sciences. Proceedings of the National Academy of Sciences.
https://doi.org/10.1073/pnas.1917269117
chicago: Pinotsis, Nikos, Karolina Zielinska, Mrigya Babuta, Joan L. Arolas, Julius
Kostan, Muhammad Bashir Khan, Claudia Schreiner, et al. “Calcium Modulates the
Domain Flexibility and Function of an α-Actinin Similar to the Ancestral α-Actinin.”
Proceedings of the National Academy of Sciences. Proceedings of the National
Academy of Sciences, 2020. https://doi.org/10.1073/pnas.1917269117.
ieee: N. Pinotsis et al., “Calcium modulates the domain flexibility and function
of an α-actinin similar to the ancestral α-actinin,” Proceedings of the National
Academy of Sciences, vol. 117, no. 36. Proceedings of the National Academy
of Sciences, pp. 22101–22112, 2020.
ista: Pinotsis N, Zielinska K, Babuta M, Arolas JL, Kostan J, Khan MB, Schreiner
C, Testa Salmazo AP, Ciccarelli L, Puchinger M, Gkougkoulia EA, Ribeiro E de A,
Marlovits TC, Bhattacharya A, Djinovic-Carugo K. 2020. Calcium modulates the domain
flexibility and function of an α-actinin similar to the ancestral α-actinin. Proceedings
of the National Academy of Sciences. 117(36), 22101–22112.
mla: Pinotsis, Nikos, et al. “Calcium Modulates the Domain Flexibility and Function
of an α-Actinin Similar to the Ancestral α-Actinin.” Proceedings of the National
Academy of Sciences, vol. 117, no. 36, Proceedings of the National Academy
of Sciences, 2020, pp. 22101–12, doi:10.1073/pnas.1917269117.
short: N. Pinotsis, K. Zielinska, M. Babuta, J.L. Arolas, J. Kostan, M.B. Khan,
C. Schreiner, A.P. Testa Salmazo, L. Ciccarelli, M. Puchinger, E.A. Gkougkoulia,
E. de A. Ribeiro, T.C. Marlovits, A. Bhattacharya, K. Djinovic-Carugo, Proceedings
of the National Academy of Sciences 117 (2020) 22101–22112.
date_created: 2024-03-04T10:03:52Z
date_published: 2020-09-08T00:00:00Z
date_updated: 2024-03-04T10:14:44Z
day: '08'
department:
- _id: CaBe
doi: 10.1073/pnas.1917269117
external_id:
pmid:
- '32848067'
intvolume: ' 117'
issue: '36'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1073/pnas.191726911
month: '09'
oa: 1
oa_version: Published Version
page: 22101-22112
pmid: 1
publication: Proceedings of the National Academy of Sciences
publication_identifier:
eissn:
- 1091-6490
issn:
- 0027-8424
publication_status: published
publisher: Proceedings of the National Academy of Sciences
quality_controlled: '1'
status: public
title: Calcium modulates the domain flexibility and function of an α-actinin similar
to the ancestral α-actinin
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 117
year: '2020'
...
---
_id: '15063'
abstract:
- lang: eng
text: We consider the least singular value of a large random matrix with real or
complex i.i.d. Gaussian entries shifted by a constant z∈C. We prove an optimal
lower tail estimate on this singular value in the critical regime where z is around
the spectral edge, thus improving the classical bound of Sankar, Spielman and
Teng (SIAM J. Matrix Anal. Appl. 28:2 (2006), 446–476) for the particular shift-perturbation
in the edge regime. Lacking Brézin–Hikami formulas in the real case, we rely on
the superbosonization formula (Comm. Math. Phys. 283:2 (2008), 343–395).
acknowledgement: Partially supported by ERC Advanced Grant No. 338804. This project
has received funding from the European Union’s Horizon 2020 research and innovation
programme under the Marie Sklodowska-Curie Grant Agreement No. 66538
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Giorgio
full_name: Cipolloni, Giorgio
id: 42198EFA-F248-11E8-B48F-1D18A9856A87
last_name: Cipolloni
orcid: 0000-0002-4901-7992
- 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: Dominik J
full_name: Schröder, Dominik J
id: 408ED176-F248-11E8-B48F-1D18A9856A87
last_name: Schröder
orcid: 0000-0002-2904-1856
citation:
ama: Cipolloni G, Erdös L, Schröder DJ. Optimal lower bound on the least singular
value of the shifted Ginibre ensemble. Probability and Mathematical Physics.
2020;1(1):101-146. doi:10.2140/pmp.2020.1.101
apa: Cipolloni, G., Erdös, L., & Schröder, D. J. (2020). Optimal lower bound
on the least singular value of the shifted Ginibre ensemble. Probability and
Mathematical Physics. Mathematical Sciences Publishers. https://doi.org/10.2140/pmp.2020.1.101
chicago: Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Optimal Lower
Bound on the Least Singular Value of the Shifted Ginibre Ensemble.” Probability
and Mathematical Physics. Mathematical Sciences Publishers, 2020. https://doi.org/10.2140/pmp.2020.1.101.
ieee: G. Cipolloni, L. Erdös, and D. J. Schröder, “Optimal lower bound on the least
singular value of the shifted Ginibre ensemble,” Probability and Mathematical
Physics, vol. 1, no. 1. Mathematical Sciences Publishers, pp. 101–146, 2020.
ista: Cipolloni G, Erdös L, Schröder DJ. 2020. Optimal lower bound on the least
singular value of the shifted Ginibre ensemble. Probability and Mathematical Physics.
1(1), 101–146.
mla: Cipolloni, Giorgio, et al. “Optimal Lower Bound on the Least Singular Value
of the Shifted Ginibre Ensemble.” Probability and Mathematical Physics,
vol. 1, no. 1, Mathematical Sciences Publishers, 2020, pp. 101–46, doi:10.2140/pmp.2020.1.101.
short: G. Cipolloni, L. Erdös, D.J. Schröder, Probability and Mathematical Physics
1 (2020) 101–146.
date_created: 2024-03-04T10:27:57Z
date_published: 2020-11-16T00:00:00Z
date_updated: 2024-03-04T10:33:15Z
day: '16'
department:
- _id: LaEr
doi: 10.2140/pmp.2020.1.101
ec_funded: 1
external_id:
arxiv:
- '1908.01653'
intvolume: ' 1'
issue: '1'
keyword:
- General Medicine
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1908.01653
month: '11'
oa: 1
oa_version: Preprint
page: 101-146
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: Probability and Mathematical Physics
publication_identifier:
issn:
- 2690-1005
- 2690-0998
publication_status: published
publisher: Mathematical Sciences Publishers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimal lower bound on the least singular value of the shifted Ginibre ensemble
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2020'
...
---
_id: '15064'
abstract:
- lang: eng
text: We call a continuous self-map that reveals itself through a discrete set of
point-value pairs a sampled dynamical system. Capturing the available information
with chain maps on Delaunay complexes, we use persistent homology to quantify
the evidence of recurrent behavior. We establish a sampling theorem to recover
the eigenspaces of the endomorphism on homology induced by the self-map. Using
a combinatorial gradient flow arising from the discrete Morse theory for Čech
and Delaunay complexes, we construct a chain map to transform the problem from
the natural but expensive Čech complexes to the computationally efficient Delaunay
triangulations. The fast chain map algorithm has applications beyond dynamical
systems.
acknowledgement: This research has been supported by the DFG Collaborative Research
Center SFB/TRR 109 “Discretization in Geometry and Dynamics”, by Polish MNiSzW Grant
No. 2621/7.PR/12/2013/2, by the Polish National Science Center under Maestro Grant
No. 2014/14/A/ST1/00453 and Grant No. DEC-2013/09/N/ST6/02995. Open Access funding
provided by Projekt DEAL.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: U.
full_name: Bauer, U.
last_name: Bauer
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Grzegorz
full_name: Jablonski, Grzegorz
id: 4483EF78-F248-11E8-B48F-1D18A9856A87
last_name: Jablonski
orcid: 0000-0002-3536-9866
- first_name: M.
full_name: Mrozek, M.
last_name: Mrozek
citation:
ama: Bauer U, Edelsbrunner H, Jablonski G, Mrozek M. Čech-Delaunay gradient flow
and homology inference for self-maps. Journal of Applied and Computational
Topology. 2020;4(4):455-480. doi:10.1007/s41468-020-00058-8
apa: Bauer, U., Edelsbrunner, H., Jablonski, G., & Mrozek, M. (2020). Čech-Delaunay
gradient flow and homology inference for self-maps. Journal of Applied and
Computational Topology. Springer Nature. https://doi.org/10.1007/s41468-020-00058-8
chicago: Bauer, U., Herbert Edelsbrunner, Grzegorz Jablonski, and M. Mrozek. “Čech-Delaunay
Gradient Flow and Homology Inference for Self-Maps.” Journal of Applied and
Computational Topology. Springer Nature, 2020. https://doi.org/10.1007/s41468-020-00058-8.
ieee: U. Bauer, H. Edelsbrunner, G. Jablonski, and M. Mrozek, “Čech-Delaunay gradient
flow and homology inference for self-maps,” Journal of Applied and Computational
Topology, vol. 4, no. 4. Springer Nature, pp. 455–480, 2020.
ista: Bauer U, Edelsbrunner H, Jablonski G, Mrozek M. 2020. Čech-Delaunay gradient
flow and homology inference for self-maps. Journal of Applied and Computational
Topology. 4(4), 455–480.
mla: Bauer, U., et al. “Čech-Delaunay Gradient Flow and Homology Inference for Self-Maps.”
Journal of Applied and Computational Topology, vol. 4, no. 4, Springer
Nature, 2020, pp. 455–80, doi:10.1007/s41468-020-00058-8.
short: U. Bauer, H. Edelsbrunner, G. Jablonski, M. Mrozek, Journal of Applied and
Computational Topology 4 (2020) 455–480.
date_created: 2024-03-04T10:47:49Z
date_published: 2020-12-01T00:00:00Z
date_updated: 2024-03-04T10:54:04Z
day: '01'
ddc:
- '500'
department:
- _id: HeEd
doi: 10.1007/s41468-020-00058-8
file:
- access_level: open_access
checksum: eed1168b6e66cd55272c19bb7fca8a1c
content_type: application/pdf
creator: dernst
date_created: 2024-03-04T10:52:42Z
date_updated: 2024-03-04T10:52:42Z
file_id: '15065'
file_name: 2020_JourApplCompTopology_Bauer.pdf
file_size: 851190
relation: main_file
success: 1
file_date_updated: 2024-03-04T10:52:42Z
has_accepted_license: '1'
intvolume: ' 4'
issue: '4'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 455-480
publication: Journal of Applied and Computational Topology
publication_identifier:
eissn:
- 2367-1734
issn:
- 2367-1726
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Čech-Delaunay gradient flow and homology inference for self-maps
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: '2020'
...
---
_id: '15074'
abstract:
- lang: eng
text: We introduce a new graph problem, the token dropping game, and we show how
to solve it efficiently in a distributed setting. We use the token dropping game
as a tool to design an efficient distributed algorithm for the stable orientation
problem, which is a special case of the more general locally optimal semi-matching
problem. The prior work by Czygrinow et al. (DISC 2012) finds a locally optimal
semi-matching in O(Δ⁵) rounds in graphs of maximum degree Δ, which directly implies
an algorithm with the same runtime for stable orientations. We improve the runtime
to O(Δ⁴) for stable orientations and prove a lower bound of Ω(Δ) rounds.
alternative_title:
- LIPIcs
article_number: '40'
article_processing_charge: No
arxiv: 1
author:
- first_name: Sebastian
full_name: Brandt, Sebastian
last_name: Brandt
- first_name: Barbara
full_name: Keller, Barbara
last_name: Keller
- first_name: Joel
full_name: Rybicki, Joel
id: 334EFD2E-F248-11E8-B48F-1D18A9856A87
last_name: Rybicki
orcid: 0000-0002-6432-6646
- first_name: Jukka
full_name: Suomela, Jukka
last_name: Suomela
- first_name: Jara
full_name: Uitto, Jara
last_name: Uitto
citation:
ama: 'Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. Brief announcement: Efficient
load-balancing through distributed token dropping. In: 34th International Symposium
on Distributed Computing. Vol 179. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2020. doi:10.4230/LIPIcs.DISC.2020.40'
apa: 'Brandt, S., Keller, B., Rybicki, J., Suomela, J., & Uitto, J. (2020).
Brief announcement: Efficient load-balancing through distributed token dropping.
In 34th International Symposium on Distributed Computing (Vol. 179). Virtual:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2020.40'
chicago: 'Brandt, Sebastian, Barbara Keller, Joel Rybicki, Jukka Suomela, and Jara
Uitto. “Brief Announcement: Efficient Load-Balancing through Distributed Token
Dropping.” In 34th International Symposium on Distributed Computing, Vol.
179. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.DISC.2020.40.'
ieee: 'S. Brandt, B. Keller, J. Rybicki, J. Suomela, and J. Uitto, “Brief announcement:
Efficient load-balancing through distributed token dropping,” in 34th International
Symposium on Distributed Computing, Virtual, 2020, vol. 179.'
ista: 'Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. 2020. Brief announcement:
Efficient load-balancing through distributed token dropping. 34th International
Symposium on Distributed Computing. DISC: Symposium on Distributed Computing,
LIPIcs, vol. 179, 40.'
mla: 'Brandt, Sebastian, et al. “Brief Announcement: Efficient Load-Balancing through
Distributed Token Dropping.” 34th International Symposium on Distributed Computing,
vol. 179, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.DISC.2020.40.'
short: S. Brandt, B. Keller, J. Rybicki, J. Suomela, J. Uitto, in:, 34th International
Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2020.
conference:
end_date: 2020-10-16
location: Virtual
name: 'DISC: Symposium on Distributed Computing'
start_date: 2020-10-12
date_created: 2024-03-05T07:09:12Z
date_published: 2020-10-07T00:00:00Z
date_updated: 2024-03-05T07:13:13Z
day: '07'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.4230/LIPIcs.DISC.2020.40
external_id:
arxiv:
- '2005.07761'
file:
- access_level: open_access
checksum: 23e2d9321aef53092dc1e24a8ab82d72
content_type: application/pdf
creator: dernst
date_created: 2024-03-05T07:08:27Z
date_updated: 2024-03-05T07:08:27Z
file_id: '15075'
file_name: 2020_LIPIcs_Brandt.pdf
file_size: 303529
relation: main_file
success: 1
file_date_updated: 2024-03-05T07:08:27Z
has_accepted_license: '1'
intvolume: ' 179'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/3.0/
month: '10'
oa: 1
oa_version: Published Version
publication: 34th International Symposium on Distributed Computing
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '9678'
relation: later_version
status: public
scopus_import: '1'
status: public
title: 'Brief announcement: Efficient load-balancing through distributed token dropping'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 179
year: '2020'
...
---
_id: '15077'
abstract:
- lang: eng
text: "We consider the following dynamic load-balancing process: given an underlying
graph G with n nodes, in each step t≥ 0, one unit of load is created, and placed
at a randomly chosen graph node. In the same step, the chosen node picks a random
neighbor, and the two nodes balance their loads by averaging them. We are interested
in the expected gap between the minimum and maximum loads at nodes as the process
progresses, and its dependence on n and on the graph structure. Variants of the
above graphical balanced allocation process have been studied previously by Peres,
Talwar, and Wieder [Peres et al., 2015], and by Sauerwald and Sun [Sauerwald and
Sun, 2015]. These authors left as open the question of characterizing the gap
in the case of cycle graphs in the dynamic case, where weights are created during
the algorithm’s execution. For this case, the only known upper bound is of \U0001D4AA(n
log n), following from a majorization argument due to [Peres et al., 2015], which
analyzes a related graphical allocation process. In this paper, we provide an
upper bound of \U0001D4AA (√n log n) on the expected gap of the above process
for cycles of length n. We introduce a new potential analysis technique, which
enables us to bound the difference in load between k-hop neighbors on the cycle,
for any k ≤ n/2. We complement this with a \"gap covering\" argument, which bounds
the maximum value of the gap by bounding its value across all possible subsets
of a certain structure, and recursively bounding the gaps within each subset.
We provide analytical and experimental evidence that our upper bound on the gap
is tight up to a logarithmic factor."
acknowledgement: "The authors sincerely thank Thomas Sauerwald and George Giakkoupis
for insightful discussions, and Mohsen Ghaffari, Yuval Peres, and Udi Wieder for
feedback on earlier\r\nversions of this draft. We also thank the ICALP anonymous
reviewers for their very useful comments.\r\nFunding: European Research Council
funding award PR1042ERC01"
alternative_title:
- LIPIcs
article_number: '7'
article_processing_charge: No
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Giorgi
full_name: Nadiradze, Giorgi
id: 3279A00C-F248-11E8-B48F-1D18A9856A87
last_name: Nadiradze
orcid: 0000-0001-5634-0731
- first_name: Amirmojtaba
full_name: Sabour, Amirmojtaba
id: bcc145fd-e77f-11ea-ae8b-80d661dbff67
last_name: Sabour
citation:
ama: 'Alistarh D-A, Nadiradze G, Sabour A. Dynamic averaging load balancing on cycles.
In: 47th International Colloquium on Automata, Languages, and Programming.
Vol 168. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.ICALP.2020.7'
apa: 'Alistarh, D.-A., Nadiradze, G., & Sabour, A. (2020). Dynamic averaging
load balancing on cycles. In 47th International Colloquium on Automata, Languages,
and Programming (Vol. 168). Saarbrücken, Germany, Virtual: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2020.7'
chicago: Alistarh, Dan-Adrian, Giorgi Nadiradze, and Amirmojtaba Sabour. “Dynamic
Averaging Load Balancing on Cycles.” In 47th International Colloquium on Automata,
Languages, and Programming, Vol. 168. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2020. https://doi.org/10.4230/LIPIcs.ICALP.2020.7.
ieee: D.-A. Alistarh, G. Nadiradze, and A. Sabour, “Dynamic averaging load balancing
on cycles,” in 47th International Colloquium on Automata, Languages, and Programming,
Saarbrücken, Germany, Virtual, 2020, vol. 168.
ista: 'Alistarh D-A, Nadiradze G, Sabour A. 2020. Dynamic averaging load balancing
on cycles. 47th International Colloquium on Automata, Languages, and Programming.
ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs,
vol. 168, 7.'
mla: Alistarh, Dan-Adrian, et al. “Dynamic Averaging Load Balancing on Cycles.”
47th International Colloquium on Automata, Languages, and Programming,
vol. 168, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ICALP.2020.7.
short: D.-A. Alistarh, G. Nadiradze, A. Sabour, in:, 47th International Colloquium
on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2020.
conference:
end_date: 2020-07-11
location: Saarbrücken, Germany, Virtual
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2020-07-08
date_created: 2024-03-05T07:25:37Z
date_published: 2020-06-29T00:00:00Z
date_updated: 2024-03-05T07:35:53Z
day: '29'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.4230/LIPIcs.ICALP.2020.7
ec_funded: 1
external_id:
arxiv:
- '2003.09297'
file:
- access_level: open_access
checksum: e5eb16199f4ccfd77a321977eb3f026f
content_type: application/pdf
creator: dernst
date_created: 2024-03-05T07:25:15Z
date_updated: 2024-03-05T07:25:15Z
file_id: '15078'
file_name: 2020_LIPIcs_Alistarh.pdf
file_size: 782987
relation: main_file
success: 1
file_date_updated: 2024-03-05T07:25:15Z
has_accepted_license: '1'
intvolume: ' 168'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: 47th International Colloquium on Automata, Languages, and Programming
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '8286'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Dynamic averaging load balancing on cycles
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 168
year: '2020'
...
---
_id: '15082'
abstract:
- lang: eng
text: "Two plane drawings of geometric graphs on the same set of points are called
disjoint compatible if their union is plane and they do not have an edge in common.
For a given set S of 2n points two plane drawings of perfect matchings M1 and
M2 (which do not need to be disjoint nor compatible) are disjoint tree-compatible
if there exists a plane drawing of a spanning tree T on S which is disjoint compatible
to both M1 and M2.\r\nWe show that the graph of all disjoint tree-compatible perfect
geometric matchings on 2n points in convex position is connected if and only if
2n ≥ 10. Moreover, in that case the diameter\r\nof this graph is either 4 or 5,
independent of n."
acknowledgement: Research on this work was initiated at the 6th Austrian-Japanese-Mexican-Spanish
Workshop on Discrete Geometry and continued during the 16th European Geometric Graph-Week,
both held near Strobl, Austria. We are grateful to the participants for the inspiring
atmosphere. We especially thank Alexander Pilz for bringing this class of problems
to our attention and Birgit Vogtenhuber for inspiring discussions. D.P. is partially
supported by the FWF grant I 3340-N35 (Collaborative DACH project Arrangements and
Drawings). The research stay of P.P. at IST Austria is funded by the project CZ.02.2.69/0.0/0.0/17_050/0008466
Improvement of internationalization in the field of research and development at
Charles University, through the support of quality projects MSCA-IF. This project
has received funding from the European Union’s Horizon 2020 research and innovation
programme under the Marie Skłodowska-Curie grant agreement No 734922.
article_number: '56'
article_processing_charge: No
author:
- first_name: Oswin
full_name: Aichholzer, Oswin
last_name: Aichholzer
- first_name: Julia
full_name: Obmann, Julia
last_name: Obmann
- first_name: Pavel
full_name: Patak, Pavel
id: B593B804-1035-11EA-B4F1-947645A5BB83
last_name: Patak
- first_name: Daniel
full_name: Perz, Daniel
last_name: Perz
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
citation:
ama: 'Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. Disjoint tree-compatible
plane perfect matchings. In: 36th European Workshop on Computational Geometry.
; 2020.'
apa: Aichholzer, O., Obmann, J., Patak, P., Perz, D., & Tkadlec, J. (2020).
Disjoint tree-compatible plane perfect matchings. In 36th European Workshop
on Computational Geometry. Würzburg, Germany, Virtual.
chicago: Aichholzer, Oswin, Julia Obmann, Pavel Patak, Daniel Perz, and Josef Tkadlec.
“Disjoint Tree-Compatible Plane Perfect Matchings.” In 36th European Workshop
on Computational Geometry, 2020.
ieee: O. Aichholzer, J. Obmann, P. Patak, D. Perz, and J. Tkadlec, “Disjoint tree-compatible
plane perfect matchings,” in 36th European Workshop on Computational Geometry,
Würzburg, Germany, Virtual, 2020.
ista: 'Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. 2020. Disjoint tree-compatible
plane perfect matchings. 36th European Workshop on Computational Geometry. EuroCG:
European Workshop on Computational Geometry, 56.'
mla: Aichholzer, Oswin, et al. “Disjoint Tree-Compatible Plane Perfect Matchings.”
36th European Workshop on Computational Geometry, 56, 2020.
short: O. Aichholzer, J. Obmann, P. Patak, D. Perz, J. Tkadlec, in:, 36th European
Workshop on Computational Geometry, 2020.
conference:
end_date: 2020-03-18
location: Würzburg, Germany, Virtual
name: 'EuroCG: European Workshop on Computational Geometry'
start_date: 2020-03-16
date_created: 2024-03-05T08:57:17Z
date_published: 2020-04-01T00:00:00Z
date_updated: 2024-03-05T09:00:07Z
day: '01'
department:
- _id: KrCh
- _id: UlWa
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www1.pub.informatik.uni-wuerzburg.de/eurocg2020/data/uploads/papers/eurocg20_paper_56.pdf
month: '04'
oa: 1
oa_version: Published Version
publication: 36th European Workshop on Computational Geometry
publication_status: published
quality_controlled: '1'
status: public
title: Disjoint tree-compatible plane perfect matchings
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '13056'
abstract:
- lang: eng
text: This datasets comprises all data shown in plots of the submitted article "Converting
microwave and telecom photons with a silicon photonic nanomechanical interface".
Additional raw data are available from the corresponding author on reasonable
request.
article_processing_charge: No
author:
- first_name: Georg M
full_name: Arnold, Georg M
id: 3770C838-F248-11E8-B48F-1D18A9856A87
last_name: Arnold
orcid: 0000-0003-1397-7876
- first_name: Matthias
full_name: Wulf, Matthias
id: 45598606-F248-11E8-B48F-1D18A9856A87
last_name: Wulf
orcid: 0000-0001-6613-1378
- first_name: Shabir
full_name: Barzanjeh, Shabir
id: 2D25E1F6-F248-11E8-B48F-1D18A9856A87
last_name: Barzanjeh
orcid: 0000-0003-0415-1423
- first_name: Elena
full_name: Redchenko, Elena
id: 2C21D6E8-F248-11E8-B48F-1D18A9856A87
last_name: Redchenko
- first_name: Alfredo R
full_name: Rueda Sanchez, Alfredo R
id: 3B82B0F8-F248-11E8-B48F-1D18A9856A87
last_name: Rueda Sanchez
orcid: 0000-0001-6249-5860
- first_name: William J
full_name: Hease, William J
id: 29705398-F248-11E8-B48F-1D18A9856A87
last_name: Hease
orcid: 0000-0001-9868-2166
- first_name: Farid
full_name: Hassani, Farid
id: 2AED110C-F248-11E8-B48F-1D18A9856A87
last_name: Hassani
orcid: 0000-0001-6937-5773
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
citation:
ama: Arnold GM, Wulf M, Barzanjeh S, et al. Converting microwave and telecom photons
with a silicon photonic nanomechanical interface. 2020. doi:10.5281/ZENODO.3961561
apa: Arnold, G. M., Wulf, M., Barzanjeh, S., Redchenko, E., Rueda Sanchez, A. R.,
Hease, W. J., … Fink, J. M. (2020). Converting microwave and telecom photons with
a silicon photonic nanomechanical interface. Zenodo. https://doi.org/10.5281/ZENODO.3961561
chicago: Arnold, Georg M, Matthias Wulf, Shabir Barzanjeh, Elena Redchenko, Alfredo
R Rueda Sanchez, William J Hease, Farid Hassani, and Johannes M Fink. “Converting
Microwave and Telecom Photons with a Silicon Photonic Nanomechanical Interface.”
Zenodo, 2020. https://doi.org/10.5281/ZENODO.3961561.
ieee: G. M. Arnold et al., “Converting microwave and telecom photons with
a silicon photonic nanomechanical interface.” Zenodo, 2020.
ista: Arnold GM, Wulf M, Barzanjeh S, Redchenko E, Rueda Sanchez AR, Hease WJ, Hassani
F, Fink JM. 2020. Converting microwave and telecom photons with a silicon photonic
nanomechanical interface, Zenodo, 10.5281/ZENODO.3961561.
mla: Arnold, Georg M., et al. Converting Microwave and Telecom Photons with a
Silicon Photonic Nanomechanical Interface. Zenodo, 2020, doi:10.5281/ZENODO.3961561.
short: G.M. Arnold, M. Wulf, S. Barzanjeh, E. Redchenko, A.R. Rueda Sanchez, W.J.
Hease, F. Hassani, J.M. Fink, (2020).
date_created: 2023-05-23T13:37:41Z
date_published: 2020-07-27T00:00:00Z
date_updated: 2024-09-10T12:23:51Z
day: '27'
ddc:
- '530'
department:
- _id: JoFi
doi: 10.5281/ZENODO.3961561
main_file_link:
- open_access: '1'
url: https://doi.org/10.5281/zenodo.3961562
month: '07'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
record:
- id: '8529'
relation: used_in_publication
status: public
status: public
title: Converting microwave and telecom photons with a silicon photonic nanomechanical
interface
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '13060'
abstract:
- lang: eng
text: Coinfections with multiple pathogens can result in complex within-host dynamics
affecting virulence and transmission. Whilst multiple infections are intensively
studied in solitary hosts, it is so far unresolved how social host interactions
interfere with pathogen competition, and if this depends on coinfection diversity.
We studied how the collective disease defenses of ants – their social immunity
– influence pathogen competition in coinfections of same or different fungal
pathogen species. Social immunity reduced virulence for all pathogen combinations,
but interfered with spore production only in different-species coinfections. Here,
it decreased overall pathogen sporulation success, whilst simultaneously increasing
co-sporulation on individual cadavers and maintaining a higher pathogen diversity
at the community-level. Mathematical modeling revealed that host sanitary care
alone can modulate competitive outcomes between pathogens, giving advantage to
fast-germinating, thus less grooming-sensitive ones. Host social interactions
can hence modulate infection dynamics in coinfected group members, thereby altering
pathogen communities at the host- and population-level.
article_processing_charge: No
author:
- first_name: Barbara
full_name: Milutinovic, Barbara
id: 2CDC32B8-F248-11E8-B48F-1D18A9856A87
last_name: Milutinovic
orcid: 0000-0002-8214-4758
- first_name: Miriam
full_name: Stock, Miriam
id: 42462816-F248-11E8-B48F-1D18A9856A87
last_name: Stock
- first_name: Anna V
full_name: Grasse, Anna V
id: 406F989C-F248-11E8-B48F-1D18A9856A87
last_name: Grasse
- first_name: Elisabeth
full_name: Naderlinger, Elisabeth
id: 31757262-F248-11E8-B48F-1D18A9856A87
last_name: Naderlinger
- first_name: Christian
full_name: Hilbe, Christian
id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87
last_name: Hilbe
orcid: 0000-0001-5116-955X
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: Milutinovic B, Stock M, Grasse AV, Naderlinger E, Hilbe C, Cremer S. Social
immunity modulates competition between coinfecting pathogens. 2020. doi:10.5061/DRYAD.CRJDFN318
apa: Milutinovic, B., Stock, M., Grasse, A. V., Naderlinger, E., Hilbe, C., &
Cremer, S. (2020). Social immunity modulates competition between coinfecting pathogens.
Dryad. https://doi.org/10.5061/DRYAD.CRJDFN318
chicago: Milutinovic, Barbara, Miriam Stock, Anna V Grasse, Elisabeth Naderlinger,
Christian Hilbe, and Sylvia Cremer. “Social Immunity Modulates Competition between
Coinfecting Pathogens.” Dryad, 2020. https://doi.org/10.5061/DRYAD.CRJDFN318.
ieee: B. Milutinovic, M. Stock, A. V. Grasse, E. Naderlinger, C. Hilbe, and S. Cremer,
“Social immunity modulates competition between coinfecting pathogens.” Dryad,
2020.
ista: Milutinovic B, Stock M, Grasse AV, Naderlinger E, Hilbe C, Cremer S. 2020.
Social immunity modulates competition between coinfecting pathogens, Dryad, 10.5061/DRYAD.CRJDFN318.
mla: Milutinovic, Barbara, et al. Social Immunity Modulates Competition between
Coinfecting Pathogens. Dryad, 2020, doi:10.5061/DRYAD.CRJDFN318.
short: B. Milutinovic, M. Stock, A.V. Grasse, E. Naderlinger, C. Hilbe, S. Cremer,
(2020).
date_created: 2023-05-23T16:11:22Z
date_published: 2020-12-19T00:00:00Z
date_updated: 2023-09-05T16:04:48Z
day: '19'
ddc:
- '570'
department:
- _id: SyCr
- _id: KrCh
doi: 10.5061/DRYAD.CRJDFN318
license: https://creativecommons.org/publicdomain/zero/1.0/
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.crjdfn318
month: '12'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '7343'
relation: used_in_publication
status: public
status: public
title: Social immunity modulates competition between coinfecting pathogens
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '13065'
abstract:
- lang: eng
text: Domestication is a human-induced selection process that imprints the genomes
of domesticated populations over a short evolutionary time scale, and that occurs
in a given demographic context. Reconstructing historical gene flow, effective
population size changes and their timing is therefore of fundamental interest
to understand how plant demography and human selection jointly shape genomic divergence
during domestication. Yet, the comparison under a single statistical framework
of independent domestication histories across different crop species has been
little evaluated so far. Thus, it is unclear whether domestication leads to convergent
demographic changes that similarly affect crop genomes. To address this question,
we used existing and new transcriptome data on three crop species of Solanaceae
(eggplant, pepper and tomato), together with their close wild relatives. We fitted
twelve demographic models of increasing complexity on the unfolded joint allele
frequency spectrum for each wild/crop pair, and we found evidence for both shared
and species-specific demographic processes between species. A convergent history
of domestication with gene-flow was inferred for all three species, along with
evidence of strong reduction in the effective population size during the cultivation
stage of tomato and pepper. The absence of any reduction in size of the crop in
eggplant stands out from the classical view of the domestication process; as does
the existence of a “protracted period” of management before cultivation. Our results
also suggest divergent management strategies of modern cultivars among species
as their current demography substantially differs. Finally, the timing of domestication
is species-specific and supported by the few historical records available.
article_processing_charge: No
author:
- first_name: Stephanie
full_name: Arnoux, Stephanie
last_name: Arnoux
- first_name: Christelle
full_name: Fraisse, Christelle
id: 32DF5794-F248-11E8-B48F-1D18A9856A87
last_name: Fraisse
orcid: 0000-0001-8441-5075
- first_name: Christopher
full_name: Sauvage, Christopher
last_name: Sauvage
citation:
ama: 'Arnoux S, Fraisse C, Sauvage C. VCF files of synonymous SNPs related to: Genomic
inference of complex domestication histories in three Solanaceae species. 2020.
doi:10.5061/DRYAD.Q2BVQ83HD'
apa: 'Arnoux, S., Fraisse, C., & Sauvage, C. (2020). VCF files of synonymous
SNPs related to: Genomic inference of complex domestication histories in three
Solanaceae species. Dryad. https://doi.org/10.5061/DRYAD.Q2BVQ83HD'
chicago: 'Arnoux, Stephanie, Christelle Fraisse, and Christopher Sauvage. “VCF Files
of Synonymous SNPs Related to: Genomic Inference of Complex Domestication Histories
in Three Solanaceae Species.” Dryad, 2020. https://doi.org/10.5061/DRYAD.Q2BVQ83HD.'
ieee: 'S. Arnoux, C. Fraisse, and C. Sauvage, “VCF files of synonymous SNPs related
to: Genomic inference of complex domestication histories in three Solanaceae species.”
Dryad, 2020.'
ista: 'Arnoux S, Fraisse C, Sauvage C. 2020. VCF files of synonymous SNPs related
to: Genomic inference of complex domestication histories in three Solanaceae species,
Dryad, 10.5061/DRYAD.Q2BVQ83HD.'
mla: 'Arnoux, Stephanie, et al. VCF Files of Synonymous SNPs Related to: Genomic
Inference of Complex Domestication Histories in Three Solanaceae Species.
Dryad, 2020, doi:10.5061/DRYAD.Q2BVQ83HD.'
short: S. Arnoux, C. Fraisse, C. Sauvage, (2020).
date_created: 2023-05-23T16:30:20Z
date_published: 2020-10-19T00:00:00Z
date_updated: 2023-08-04T11:19:26Z
day: '19'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.5061/DRYAD.Q2BVQ83HD
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.q2bvq83hd
month: '10'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
link:
- relation: software
url: https://github.com/starnoux/arnoux_et_al_2019
record:
- id: '8928'
relation: used_in_publication
status: public
status: public
title: 'VCF files of synonymous SNPs related to: Genomic inference of complex domestication
histories in three Solanaceae species'
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '13070'
abstract:
- lang: eng
text: This dataset comprises all data shown in the figures of the submitted article
"Surpassing the resistance quantum with a geometric superinductor". Additional
raw data are available from the corresponding author on reasonable request.
article_processing_charge: No
author:
- first_name: Matilda
full_name: Peruzzo, Matilda
id: 3F920B30-F248-11E8-B48F-1D18A9856A87
last_name: Peruzzo
orcid: 0000-0002-3415-4628
- first_name: Andrea
full_name: Trioni, Andrea
id: 42F71B44-F248-11E8-B48F-1D18A9856A87
last_name: Trioni
- first_name: Farid
full_name: Hassani, Farid
id: 2AED110C-F248-11E8-B48F-1D18A9856A87
last_name: Hassani
orcid: 0000-0001-6937-5773
- first_name: Martin
full_name: Zemlicka, Martin
id: 2DCF8DE6-F248-11E8-B48F-1D18A9856A87
last_name: Zemlicka
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
citation:
ama: Peruzzo M, Trioni A, Hassani F, Zemlicka M, Fink JM. Surpassing the resistance
quantum with a geometric superinductor. 2020. doi:10.5281/ZENODO.4052882
apa: Peruzzo, M., Trioni, A., Hassani, F., Zemlicka, M., & Fink, J. M. (2020).
Surpassing the resistance quantum with a geometric superinductor. Zenodo. https://doi.org/10.5281/ZENODO.4052882
chicago: Peruzzo, Matilda, Andrea Trioni, Farid Hassani, Martin Zemlicka, and Johannes
M Fink. “Surpassing the Resistance Quantum with a Geometric Superinductor.” Zenodo,
2020. https://doi.org/10.5281/ZENODO.4052882.
ieee: M. Peruzzo, A. Trioni, F. Hassani, M. Zemlicka, and J. M. Fink, “Surpassing
the resistance quantum with a geometric superinductor.” Zenodo, 2020.
ista: Peruzzo M, Trioni A, Hassani F, Zemlicka M, Fink JM. 2020. Surpassing the
resistance quantum with a geometric superinductor, Zenodo, 10.5281/ZENODO.4052882.
mla: Peruzzo, Matilda, et al. Surpassing the Resistance Quantum with a Geometric
Superinductor. Zenodo, 2020, doi:10.5281/ZENODO.4052882.
short: M. Peruzzo, A. Trioni, F. Hassani, M. Zemlicka, J.M. Fink, (2020).
date_created: 2023-05-23T16:42:30Z
date_published: 2020-09-27T00:00:00Z
date_updated: 2024-09-10T12:23:56Z
day: '27'
ddc:
- '530'
department:
- _id: JoFi
doi: 10.5281/ZENODO.4052882
main_file_link:
- open_access: '1'
url: https://doi.org/10.5281/zenodo.4052883
month: '09'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
record:
- id: '8755'
relation: used_in_publication
status: public
status: public
title: Surpassing the resistance quantum with a geometric superinductor
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '13071'
abstract:
- lang: eng
text: This dataset comprises all data shown in the plots of the main part of the
submitted article "Bidirectional Electro-Optic Wavelength Conversion in the Quantum
Ground State". Additional raw data are available from the corresponding author
on reasonable request.
article_processing_charge: No
author:
- first_name: William J
full_name: Hease, William J
id: 29705398-F248-11E8-B48F-1D18A9856A87
last_name: Hease
orcid: 0000-0001-9868-2166
- first_name: Alfredo R
full_name: Rueda Sanchez, Alfredo R
id: 3B82B0F8-F248-11E8-B48F-1D18A9856A87
last_name: Rueda Sanchez
orcid: 0000-0001-6249-5860
- first_name: Rishabh
full_name: Sahu, Rishabh
id: 47D26E34-F248-11E8-B48F-1D18A9856A87
last_name: Sahu
orcid: 0000-0001-6264-2162
- first_name: Matthias
full_name: Wulf, Matthias
id: 45598606-F248-11E8-B48F-1D18A9856A87
last_name: Wulf
orcid: 0000-0001-6613-1378
- first_name: Georg M
full_name: Arnold, Georg M
id: 3770C838-F248-11E8-B48F-1D18A9856A87
last_name: Arnold
orcid: 0000-0003-1397-7876
- first_name: Harald
full_name: Schwefel, Harald
last_name: Schwefel
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
citation:
ama: Hease WJ, Rueda Sanchez AR, Sahu R, et al. Bidirectional electro-optic wavelength
conversion in the quantum ground state. 2020. doi:10.5281/ZENODO.4266025
apa: Hease, W. J., Rueda Sanchez, A. R., Sahu, R., Wulf, M., Arnold, G. M., Schwefel,
H., & Fink, J. M. (2020). Bidirectional electro-optic wavelength conversion
in the quantum ground state. Zenodo. https://doi.org/10.5281/ZENODO.4266025
chicago: Hease, William J, Alfredo R Rueda Sanchez, Rishabh Sahu, Matthias Wulf,
Georg M Arnold, Harald Schwefel, and Johannes M Fink. “Bidirectional Electro-Optic
Wavelength Conversion in the Quantum Ground State.” Zenodo, 2020. https://doi.org/10.5281/ZENODO.4266025.
ieee: W. J. Hease et al., “Bidirectional electro-optic wavelength conversion
in the quantum ground state.” Zenodo, 2020.
ista: Hease WJ, Rueda Sanchez AR, Sahu R, Wulf M, Arnold GM, Schwefel H, Fink JM.
2020. Bidirectional electro-optic wavelength conversion in the quantum ground
state, Zenodo, 10.5281/ZENODO.4266025.
mla: Hease, William J., et al. Bidirectional Electro-Optic Wavelength Conversion
in the Quantum Ground State. Zenodo, 2020, doi:10.5281/ZENODO.4266025.
short: W.J. Hease, A.R. Rueda Sanchez, R. Sahu, M. Wulf, G.M. Arnold, H. Schwefel,
J.M. Fink, (2020).
date_created: 2023-05-23T16:44:11Z
date_published: 2020-11-10T00:00:00Z
date_updated: 2024-09-10T12:23:54Z
day: '10'
ddc:
- '530'
department:
- _id: JoFi
doi: 10.5281/ZENODO.4266025
main_file_link:
- open_access: '1'
url: https://doi.org/10.5281/zenodo.4266026
month: '11'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
record:
- id: '9114'
relation: used_in_publication
status: public
status: public
title: Bidirectional electro-optic wavelength conversion in the quantum ground state
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '13073'
abstract:
- lang: eng
text: The Mytilus complex of marine mussel species forms a mosaic of hybrid zones,
found across temperate regions of the globe. This allows us to study "replicated"
instances of secondary contact between closely-related species. Previous work
on this complex has shown that local introgression is both widespread and highly
heterogeneous, and has identified SNPs that are outliers of differentiation between
lineages. Here, we developed an ancestry-informative panel of such SNPs. We then
compared their frequencies in newly-sampled populations, including samples from
within the hybrid zones, and parental populations at different distances from
the contact. Results show that close to the hybrid zones, some outlier loci are
near to fixation for the heterospecific allele, suggesting enhanced local introgression,
or the local sweep of a shared ancestral allele. Conversely, genomic cline analyses,
treating local parental populations as the reference, reveal a globally high concordance
among loci, albeit with a few signals of asymmetric introgression. Enhanced local
introgression at specific loci is consistent with the early transfer of adaptive
variants after contact, possibly including asymmetric bi-stable variants (Dobzhansky-Muller
incompatibilities), or haplotypes loaded with fewer deleterious mutations. Having
escaped one barrier, however, these variants can be trapped or delayed at the
next barrier, confining the introgression locally. These results shed light on
the decay of species barriers during phases of contact.
article_processing_charge: No
author:
- first_name: Alexis
full_name: Simon, Alexis
last_name: Simon
- first_name: Christelle
full_name: Fraisse, Christelle
id: 32DF5794-F248-11E8-B48F-1D18A9856A87
last_name: Fraisse
orcid: 0000-0001-8441-5075
- first_name: Tahani
full_name: El Ayari, Tahani
last_name: El Ayari
- first_name: Cathy
full_name: Liautard-Haag, Cathy
last_name: Liautard-Haag
- first_name: Petr
full_name: Strelkov, Petr
last_name: Strelkov
- first_name: John
full_name: Welch, John
last_name: Welch
- first_name: Nicolas
full_name: Bierne, Nicolas
last_name: Bierne
citation:
ama: Simon A, Fraisse C, El Ayari T, et al. How do species barriers decay? concordance
and local introgression in mosaic hybrid zones of mussels. 2020. doi:10.5061/DRYAD.R4XGXD29N
apa: Simon, A., Fraisse, C., El Ayari, T., Liautard-Haag, C., Strelkov, P., Welch,
J., & Bierne, N. (2020). How do species barriers decay? concordance and local
introgression in mosaic hybrid zones of mussels. Dryad. https://doi.org/10.5061/DRYAD.R4XGXD29N
chicago: Simon, Alexis, Christelle Fraisse, Tahani El Ayari, Cathy Liautard-Haag,
Petr Strelkov, John Welch, and Nicolas Bierne. “How Do Species Barriers Decay?
Concordance and Local Introgression in Mosaic Hybrid Zones of Mussels.” Dryad,
2020. https://doi.org/10.5061/DRYAD.R4XGXD29N.
ieee: A. Simon et al., “How do species barriers decay? concordance and local
introgression in mosaic hybrid zones of mussels.” Dryad, 2020.
ista: Simon A, Fraisse C, El Ayari T, Liautard-Haag C, Strelkov P, Welch J, Bierne
N. 2020. How do species barriers decay? concordance and local introgression in
mosaic hybrid zones of mussels, Dryad, 10.5061/DRYAD.R4XGXD29N.
mla: Simon, Alexis, et al. How Do Species Barriers Decay? Concordance and Local
Introgression in Mosaic Hybrid Zones of Mussels. Dryad, 2020, doi:10.5061/DRYAD.R4XGXD29N.
short: A. Simon, C. Fraisse, T. El Ayari, C. Liautard-Haag, P. Strelkov, J. Welch,
N. Bierne, (2020).
date_created: 2023-05-23T16:48:27Z
date_published: 2020-09-22T00:00:00Z
date_updated: 2023-08-04T11:04:11Z
day: '22'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.5061/DRYAD.R4XGXD29N
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.r4xgxd29n
month: '09'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '8708'
relation: used_in_publication
status: public
status: public
title: How do species barriers decay? concordance and local introgression in mosaic
hybrid zones of mussels
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '14125'
abstract:
- lang: eng
text: "Motivation: Recent technological advances have led to an increase in the
production and availability of single-cell data. The ability to integrate a set
of multi-technology measurements would allow the identification of biologically
or clinically meaningful observations through the unification of the perspectives
afforded by each technology. In most cases, however, profiling technologies consume
the used cells and thus pairwise correspondences between datasets are lost. Due
to the sheer size single-cell datasets can acquire, scalable algorithms that are
able to universally match single-cell measurements carried out in one cell to
its corresponding sibling in another technology are needed.\r\nResults: We propose
Single-Cell data Integration via Matching (SCIM), a scalable approach to recover
such correspondences in two or more technologies. SCIM assumes that cells share
a common (low-dimensional) underlying structure and that the underlying cell distribution
is approximately constant across technologies. It constructs a technology-invariant
latent space using an autoencoder framework with an adversarial objective. Multi-modal
datasets are integrated by pairing cells across technologies using a bipartite
matching scheme that operates on the low-dimensional latent representations. We
evaluate SCIM on a simulated cellular branching process and show that the cell-to-cell
matches derived by SCIM reflect the same pseudotime on the simulated dataset.
Moreover, we apply our method to two real-world scenarios, a melanoma tumor sample
and a human bone marrow sample, where we pair cells from a scRNA dataset to their
sibling cells in a CyTOF dataset achieving 90% and 78% cell-matching accuracy
for each one of the samples, respectively."
article_processing_charge: No
article_type: original
author:
- first_name: Stefan G
full_name: Stark, Stefan G
last_name: Stark
- first_name: Joanna
full_name: Ficek, Joanna
last_name: Ficek
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Ximena
full_name: Bonilla, Ximena
last_name: Bonilla
- first_name: Stéphane
full_name: Chevrier, Stéphane
last_name: Chevrier
- first_name: Franziska
full_name: Singer, Franziska
last_name: Singer
- first_name: Rudolf
full_name: Aebersold, Rudolf
last_name: Aebersold
- first_name: Faisal S
full_name: Al-Quaddoomi, Faisal S
last_name: Al-Quaddoomi
- first_name: Jonas
full_name: Albinus, Jonas
last_name: Albinus
- first_name: Ilaria
full_name: Alborelli, Ilaria
last_name: Alborelli
- first_name: Sonali
full_name: Andani, Sonali
last_name: Andani
- first_name: Per-Olof
full_name: Attinger, Per-Olof
last_name: Attinger
- first_name: Marina
full_name: Bacac, Marina
last_name: Bacac
- first_name: Daniel
full_name: Baumhoer, Daniel
last_name: Baumhoer
- first_name: Beatrice
full_name: Beck-Schimmer, Beatrice
last_name: Beck-Schimmer
- first_name: Niko
full_name: Beerenwinkel, Niko
last_name: Beerenwinkel
- first_name: Christian
full_name: Beisel, Christian
last_name: Beisel
- first_name: Lara
full_name: Bernasconi, Lara
last_name: Bernasconi
- first_name: Anne
full_name: Bertolini, Anne
last_name: Bertolini
- first_name: Bernd
full_name: Bodenmiller, Bernd
last_name: Bodenmiller
- first_name: Ximena
full_name: Bonilla, Ximena
last_name: Bonilla
- first_name: Ruben
full_name: Casanova, Ruben
last_name: Casanova
- first_name: Stéphane
full_name: Chevrier, Stéphane
last_name: Chevrier
- first_name: Natalia
full_name: Chicherova, Natalia
last_name: Chicherova
- first_name: Maya
full_name: D'Costa, Maya
last_name: D'Costa
- first_name: Esther
full_name: Danenberg, Esther
last_name: Danenberg
- first_name: Natalie
full_name: Davidson, Natalie
last_name: Davidson
- first_name: Monica-Andreea Dră
full_name: gan, Monica-Andreea Dră
last_name: gan
- first_name: Reinhard
full_name: Dummer, Reinhard
last_name: Dummer
- first_name: Stefanie
full_name: Engler, Stefanie
last_name: Engler
- first_name: Martin
full_name: Erkens, Martin
last_name: Erkens
- first_name: Katja
full_name: Eschbach, Katja
last_name: Eschbach
- first_name: Cinzia
full_name: Esposito, Cinzia
last_name: Esposito
- first_name: André
full_name: Fedier, André
last_name: Fedier
- first_name: Pedro
full_name: Ferreira, Pedro
last_name: Ferreira
- first_name: Joanna
full_name: Ficek, Joanna
last_name: Ficek
- first_name: Anja L
full_name: Frei, Anja L
last_name: Frei
- first_name: Bruno
full_name: Frey, Bruno
last_name: Frey
- first_name: Sandra
full_name: Goetze, Sandra
last_name: Goetze
- first_name: Linda
full_name: Grob, Linda
last_name: Grob
- first_name: Gabriele
full_name: Gut, Gabriele
last_name: Gut
- first_name: Detlef
full_name: Günther, Detlef
last_name: Günther
- first_name: Martina
full_name: Haberecker, Martina
last_name: Haberecker
- first_name: Pirmin
full_name: Haeuptle, Pirmin
last_name: Haeuptle
- first_name: Viola
full_name: Heinzelmann-Schwarz, Viola
last_name: Heinzelmann-Schwarz
- first_name: Sylvia
full_name: Herter, Sylvia
last_name: Herter
- first_name: Rene
full_name: Holtackers, Rene
last_name: Holtackers
- first_name: Tamara
full_name: Huesser, Tamara
last_name: Huesser
- first_name: Anja
full_name: Irmisch, Anja
last_name: Irmisch
- first_name: Francis
full_name: Jacob, Francis
last_name: Jacob
- first_name: Andrea
full_name: Jacobs, Andrea
last_name: Jacobs
- first_name: Tim M
full_name: Jaeger, Tim M
last_name: Jaeger
- first_name: Katharina
full_name: Jahn, Katharina
last_name: Jahn
- first_name: Alva R
full_name: James, Alva R
last_name: James
- first_name: Philip M
full_name: Jermann, Philip M
last_name: Jermann
- first_name: André
full_name: Kahles, André
last_name: Kahles
- first_name: Abdullah
full_name: Kahraman, Abdullah
last_name: Kahraman
- first_name: Viktor H
full_name: Koelzer, Viktor H
last_name: Koelzer
- first_name: Werner
full_name: Kuebler, Werner
last_name: Kuebler
- first_name: Jack
full_name: Kuipers, Jack
last_name: Kuipers
- first_name: Christian P
full_name: Kunze, Christian P
last_name: Kunze
- first_name: Christian
full_name: Kurzeder, Christian
last_name: Kurzeder
- first_name: Kjong-Van
full_name: Lehmann, Kjong-Van
last_name: Lehmann
- first_name: Mitchell
full_name: Levesque, Mitchell
last_name: Levesque
- first_name: Sebastian
full_name: Lugert, Sebastian
last_name: Lugert
- first_name: Gerd
full_name: Maass, Gerd
last_name: Maass
- first_name: Markus
full_name: Manz, Markus
last_name: Manz
- first_name: Philipp
full_name: Markolin, Philipp
last_name: Markolin
- first_name: Julien
full_name: Mena, Julien
last_name: Mena
- first_name: Ulrike
full_name: Menzel, Ulrike
last_name: Menzel
- first_name: Julian M
full_name: Metzler, Julian M
last_name: Metzler
- first_name: Nicola
full_name: Miglino, Nicola
last_name: Miglino
- first_name: Emanuela S
full_name: Milani, Emanuela S
last_name: Milani
- first_name: Holger
full_name: Moch, Holger
last_name: Moch
- first_name: Simone
full_name: Muenst, Simone
last_name: Muenst
- first_name: Riccardo
full_name: Murri, Riccardo
last_name: Murri
- first_name: Charlotte KY
full_name: Ng, Charlotte KY
last_name: Ng
- first_name: Stefan
full_name: Nicolet, Stefan
last_name: Nicolet
- first_name: Marta
full_name: Nowak, Marta
last_name: Nowak
- first_name: Patrick GA
full_name: Pedrioli, Patrick GA
last_name: Pedrioli
- first_name: Lucas
full_name: Pelkmans, Lucas
last_name: Pelkmans
- first_name: Salvatore
full_name: Piscuoglio, Salvatore
last_name: Piscuoglio
- first_name: Michael
full_name: Prummer, Michael
last_name: Prummer
- first_name: Mathilde
full_name: Ritter, Mathilde
last_name: Ritter
- first_name: Christian
full_name: Rommel, Christian
last_name: Rommel
- first_name: María L
full_name: Rosano-González, María L
last_name: Rosano-González
- first_name: Gunnar
full_name: Rätsch, Gunnar
last_name: Rätsch
- first_name: Natascha
full_name: Santacroce, Natascha
last_name: Santacroce
- first_name: Jacobo Sarabia del
full_name: Castillo, Jacobo Sarabia del
last_name: Castillo
- first_name: Ramona
full_name: Schlenker, Ramona
last_name: Schlenker
- first_name: Petra C
full_name: Schwalie, Petra C
last_name: Schwalie
- first_name: Severin
full_name: Schwan, Severin
last_name: Schwan
- first_name: Tobias
full_name: Schär, Tobias
last_name: Schär
- first_name: Gabriela
full_name: Senti, Gabriela
last_name: Senti
- first_name: Franziska
full_name: Singer, Franziska
last_name: Singer
- first_name: Sujana
full_name: Sivapatham, Sujana
last_name: Sivapatham
- first_name: Berend
full_name: Snijder, Berend
last_name: Snijder
- first_name: Bettina
full_name: Sobottka, Bettina
last_name: Sobottka
- first_name: Vipin T
full_name: Sreedharan, Vipin T
last_name: Sreedharan
- first_name: Stefan
full_name: Stark, Stefan
last_name: Stark
- first_name: Daniel J
full_name: Stekhoven, Daniel J
last_name: Stekhoven
- first_name: Alexandre PA
full_name: Theocharides, Alexandre PA
last_name: Theocharides
- first_name: Tinu M
full_name: Thomas, Tinu M
last_name: Thomas
- first_name: Markus
full_name: Tolnay, Markus
last_name: Tolnay
- first_name: Vinko
full_name: Tosevski, Vinko
last_name: Tosevski
- first_name: Nora C
full_name: Toussaint, Nora C
last_name: Toussaint
- first_name: Mustafa A
full_name: Tuncel, Mustafa A
last_name: Tuncel
- first_name: Marina
full_name: Tusup, Marina
last_name: Tusup
- first_name: Audrey Van
full_name: Drogen, Audrey Van
last_name: Drogen
- first_name: Marcus
full_name: Vetter, Marcus
last_name: Vetter
- first_name: Tatjana
full_name: Vlajnic, Tatjana
last_name: Vlajnic
- first_name: Sandra
full_name: Weber, Sandra
last_name: Weber
- first_name: Walter P
full_name: Weber, Walter P
last_name: Weber
- first_name: Rebekka
full_name: Wegmann, Rebekka
last_name: Wegmann
- first_name: Michael
full_name: Weller, Michael
last_name: Weller
- first_name: Fabian
full_name: Wendt, Fabian
last_name: Wendt
- first_name: Norbert
full_name: Wey, Norbert
last_name: Wey
- first_name: Andreas
full_name: Wicki, Andreas
last_name: Wicki
- first_name: Bernd
full_name: Wollscheid, Bernd
last_name: Wollscheid
- first_name: Shuqing
full_name: Yu, Shuqing
last_name: Yu
- first_name: Johanna
full_name: Ziegler, Johanna
last_name: Ziegler
- first_name: Marc
full_name: Zimmermann, Marc
last_name: Zimmermann
- first_name: Martin
full_name: Zoche, Martin
last_name: Zoche
- first_name: Gregor
full_name: Zuend, Gregor
last_name: Zuend
- first_name: Gunnar
full_name: Rätsch, Gunnar
last_name: Rätsch
- first_name: Kjong-Van
full_name: Lehmann, Kjong-Van
last_name: Lehmann
citation:
ama: 'Stark SG, Ficek J, Locatello F, et al. SCIM: Universal single-cell matching
with unpaired feature sets. Bioinformatics. 2020;36(Supplement_2):i919-i927.
doi:10.1093/bioinformatics/btaa843'
apa: 'Stark, S. G., Ficek, J., Locatello, F., Bonilla, X., Chevrier, S., Singer,
F., … Lehmann, K.-V. (2020). SCIM: Universal single-cell matching with unpaired
feature sets. Bioinformatics. Oxford University Press. https://doi.org/10.1093/bioinformatics/btaa843'
chicago: 'Stark, Stefan G, Joanna Ficek, Francesco Locatello, Ximena Bonilla, Stéphane
Chevrier, Franziska Singer, Rudolf Aebersold, et al. “SCIM: Universal Single-Cell
Matching with Unpaired Feature Sets.” Bioinformatics. Oxford University
Press, 2020. https://doi.org/10.1093/bioinformatics/btaa843.'
ieee: 'S. G. Stark et al., “SCIM: Universal single-cell matching with unpaired
feature sets,” Bioinformatics, vol. 36, no. Supplement_2. Oxford University
Press, pp. i919–i927, 2020.'
ista: 'Stark SG et al. 2020. SCIM: Universal single-cell matching with unpaired
feature sets. Bioinformatics. 36(Supplement_2), i919–i927.'
mla: 'Stark, Stefan G., et al. “SCIM: Universal Single-Cell Matching with Unpaired
Feature Sets.” Bioinformatics, vol. 36, no. Supplement_2, Oxford University
Press, 2020, pp. i919–27, doi:10.1093/bioinformatics/btaa843.'
short: S.G. Stark, J. Ficek, F. Locatello, X. Bonilla, S. Chevrier, F. Singer, R.
Aebersold, F.S. Al-Quaddoomi, J. Albinus, I. Alborelli, S. Andani, P.-O. Attinger,
M. Bacac, D. Baumhoer, B. Beck-Schimmer, N. Beerenwinkel, C. Beisel, L. Bernasconi,
A. Bertolini, B. Bodenmiller, X. Bonilla, R. Casanova, S. Chevrier, N. Chicherova,
M. D’Costa, E. Danenberg, N. Davidson, M.-A.D. gan, R. Dummer, S. Engler, M. Erkens,
K. Eschbach, C. Esposito, A. Fedier, P. Ferreira, J. Ficek, A.L. Frei, B. Frey,
S. Goetze, L. Grob, G. Gut, D. Günther, M. Haberecker, P. Haeuptle, V. Heinzelmann-Schwarz,
S. Herter, R. Holtackers, T. Huesser, A. Irmisch, F. Jacob, A. Jacobs, T.M. Jaeger,
K. Jahn, A.R. James, P.M. Jermann, A. Kahles, A. Kahraman, V.H. Koelzer, W. Kuebler,
J. Kuipers, C.P. Kunze, C. Kurzeder, K.-V. Lehmann, M. Levesque, S. Lugert, G.
Maass, M. Manz, P. Markolin, J. Mena, U. Menzel, J.M. Metzler, N. Miglino, E.S.
Milani, H. Moch, S. Muenst, R. Murri, C.K. Ng, S. Nicolet, M. Nowak, P.G. Pedrioli,
L. Pelkmans, S. Piscuoglio, M. Prummer, M. Ritter, C. Rommel, M.L. Rosano-González,
G. Rätsch, N. Santacroce, J.S. del Castillo, R. Schlenker, P.C. Schwalie, S. Schwan,
T. Schär, G. Senti, F. Singer, S. Sivapatham, B. Snijder, B. Sobottka, V.T. Sreedharan,
S. Stark, D.J. Stekhoven, A.P. Theocharides, T.M. Thomas, M. Tolnay, V. Tosevski,
N.C. Toussaint, M.A. Tuncel, M. Tusup, A.V. Drogen, M. Vetter, T. Vlajnic, S.
Weber, W.P. Weber, R. Wegmann, M. Weller, F. Wendt, N. Wey, A. Wicki, B. Wollscheid,
S. Yu, J. Ziegler, M. Zimmermann, M. Zoche, G. Zuend, G. Rätsch, K.-V. Lehmann,
Bioinformatics 36 (2020) i919–i927.
date_created: 2023-08-21T12:28:20Z
date_published: 2020-12-01T00:00:00Z
date_updated: 2023-09-11T10:21:00Z
day: '01'
department:
- _id: FrLo
doi: 10.1093/bioinformatics/btaa843
extern: '1'
external_id:
pmid:
- '33381818'
intvolume: ' 36'
issue: Supplement_2
keyword:
- Computational Mathematics
- Computational Theory and Mathematics
- Computer Science Applications
- Molecular Biology
- Biochemistry
- Statistics and Probability
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1093/bioinformatics/btaa843
month: '12'
oa: 1
oa_version: Published Version
page: i919-i927
pmid: 1
publication: Bioinformatics
publication_identifier:
eissn:
- 1367-4811
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://github.com/ratschlab/scim
scopus_import: '1'
status: public
title: 'SCIM: Universal single-cell matching with unpaired feature sets'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2020'
...
---
_id: '14186'
abstract:
- lang: eng
text: "The goal of the unsupervised learning of disentangled representations is
to\r\nseparate the independent explanatory factors of variation in the data without\r\naccess
to supervision. In this paper, we summarize the results of Locatello et\r\nal.,
2019, and focus on their implications for practitioners. We discuss the\r\ntheoretical
result showing that the unsupervised learning of disentangled\r\nrepresentations
is fundamentally impossible without inductive biases and the\r\npractical challenges
it entails. Finally, we comment on our experimental\r\nfindings, highlighting
the limitations of state-of-the-art approaches and\r\ndirections for future research."
article_processing_charge: No
arxiv: 1
author:
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Stefan
full_name: Bauer, Stefan
last_name: Bauer
- first_name: Mario
full_name: Lucic, Mario
last_name: Lucic
- first_name: Gunnar
full_name: Rätsch, Gunnar
last_name: Rätsch
- first_name: Sylvain
full_name: Gelly, Sylvain
last_name: Gelly
- first_name: Bernhard
full_name: Schölkopf, Bernhard
last_name: Schölkopf
- first_name: Olivier
full_name: Bachem, Olivier
last_name: Bachem
citation:
ama: 'Locatello F, Bauer S, Lucic M, et al. A commentary on the unsupervised learning
of disentangled representations. In: The 34th AAAI Conference on Artificial
Intelligence. Vol 34. Association for the Advancement of Artificial Intelligence;
2020:13681-13684. doi:10.1609/aaai.v34i09.7120'
apa: 'Locatello, F., Bauer, S., Lucic, M., Rätsch, G., Gelly, S., Schölkopf, B.,
& Bachem, O. (2020). A commentary on the unsupervised learning of disentangled
representations. In The 34th AAAI Conference on Artificial Intelligence
(Vol. 34, pp. 13681–13684). New York, NY, United States: Association for the Advancement
of Artificial Intelligence. https://doi.org/10.1609/aaai.v34i09.7120'
chicago: Locatello, Francesco, Stefan Bauer, Mario Lucic, Gunnar Rätsch, Sylvain
Gelly, Bernhard Schölkopf, and Olivier Bachem. “A Commentary on the Unsupervised
Learning of Disentangled Representations.” In The 34th AAAI Conference on Artificial
Intelligence, 34:13681–84. Association for the Advancement of Artificial Intelligence,
2020. https://doi.org/10.1609/aaai.v34i09.7120.
ieee: F. Locatello et al., “A commentary on the unsupervised learning of
disentangled representations,” in The 34th AAAI Conference on Artificial Intelligence,
New York, NY, United States, 2020, vol. 34, no. 9, pp. 13681–13684.
ista: 'Locatello F, Bauer S, Lucic M, Rätsch G, Gelly S, Schölkopf B, Bachem O.
2020. A commentary on the unsupervised learning of disentangled representations.
The 34th AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial
Intelligence vol. 34, 13681–13684.'
mla: Locatello, Francesco, et al. “A Commentary on the Unsupervised Learning of
Disentangled Representations.” The 34th AAAI Conference on Artificial Intelligence,
vol. 34, no. 9, Association for the Advancement of Artificial Intelligence, 2020,
pp. 13681–84, doi:10.1609/aaai.v34i09.7120.
short: F. Locatello, S. Bauer, M. Lucic, G. Rätsch, S. Gelly, B. Schölkopf, O. Bachem,
in:, The 34th AAAI Conference on Artificial Intelligence, Association for the
Advancement of Artificial Intelligence, 2020, pp. 13681–13684.
conference:
end_date: 2020-02-12
location: New York, NY, United States
name: 'AAAI: Conference on Artificial Intelligence'
start_date: 2020-02-07
date_created: 2023-08-22T14:07:26Z
date_published: 2020-07-28T00:00:00Z
date_updated: 2023-09-12T07:44:48Z
day: '28'
department:
- _id: FrLo
doi: 10.1609/aaai.v34i09.7120
extern: '1'
external_id:
arxiv:
- '2007.14184'
intvolume: ' 34'
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2007.14184
month: '07'
oa: 1
oa_version: Preprint
page: 13681-13684
publication: The 34th AAAI Conference on Artificial Intelligence
publication_identifier:
eissn:
- 2374-3468
isbn:
- '9781577358350'
publication_status: published
publisher: Association for the Advancement of Artificial Intelligence
quality_controlled: '1'
scopus_import: '1'
status: public
title: A commentary on the unsupervised learning of disentangled representations
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2020'
...
---
_id: '14187'
abstract:
- lang: eng
text: "We propose a novel Stochastic Frank-Wolfe (a.k.a. conditional gradient)\r\nalgorithm
for constrained smooth finite-sum minimization with a generalized\r\nlinear prediction/structure.
This class of problems includes empirical risk\r\nminimization with sparse, low-rank,
or other structured constraints. The\r\nproposed method is simple to implement,
does not require step-size tuning, and\r\nhas a constant per-iteration cost that
is independent of the dataset size.\r\nFurthermore, as a byproduct of the method
we obtain a stochastic estimator of\r\nthe Frank-Wolfe gap that can be used as
a stopping criterion. Depending on the\r\nsetting, the proposed method matches
or improves on the best computational\r\nguarantees for Stochastic Frank-Wolfe
algorithms. Benchmarks on several\r\ndatasets highlight different regimes in which
the proposed method exhibits a\r\nfaster empirical convergence than related methods.
Finally, we provide an\r\nimplementation of all considered methods in an open-source
package."
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Geoffrey
full_name: Négiar, Geoffrey
last_name: Négiar
- first_name: Gideon
full_name: Dresdner, Gideon
last_name: Dresdner
- first_name: Alicia
full_name: Tsai, Alicia
last_name: Tsai
- first_name: Laurent El
full_name: Ghaoui, Laurent El
last_name: Ghaoui
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Robert M.
full_name: Freund, Robert M.
last_name: Freund
- first_name: Fabian
full_name: Pedregosa, Fabian
last_name: Pedregosa
citation:
ama: 'Négiar G, Dresdner G, Tsai A, et al. Stochastic Frank-Wolfe for constrained
finite-sum minimization. In: Proceedings of the 37th International Conference
on Machine Learning. Vol 119. ; 2020:7253-7262.'
apa: Négiar, G., Dresdner, G., Tsai, A., Ghaoui, L. E., Locatello, F., Freund, R.
M., & Pedregosa, F. (2020). Stochastic Frank-Wolfe for constrained finite-sum
minimization. In Proceedings of the 37th International Conference on Machine
Learning (Vol. 119, pp. 7253–7262). Virtual.
chicago: Négiar, Geoffrey, Gideon Dresdner, Alicia Tsai, Laurent El Ghaoui, Francesco
Locatello, Robert M. Freund, and Fabian Pedregosa. “Stochastic Frank-Wolfe for
Constrained Finite-Sum Minimization.” In Proceedings of the 37th International
Conference on Machine Learning, 119:7253–62, 2020.
ieee: G. Négiar et al., “Stochastic Frank-Wolfe for constrained finite-sum
minimization,” in Proceedings of the 37th International Conference on Machine
Learning, Virtual, 2020, vol. 119, pp. 7253–7262.
ista: Négiar G, Dresdner G, Tsai A, Ghaoui LE, Locatello F, Freund RM, Pedregosa
F. 2020. Stochastic Frank-Wolfe for constrained finite-sum minimization. Proceedings
of the 37th International Conference on Machine Learning. International Conference
on Machine Learning, PMLR, vol. 119, 7253–7262.
mla: Négiar, Geoffrey, et al. “Stochastic Frank-Wolfe for Constrained Finite-Sum
Minimization.” Proceedings of the 37th International Conference on Machine
Learning, vol. 119, 2020, pp. 7253–62.
short: G. Négiar, G. Dresdner, A. Tsai, L.E. Ghaoui, F. Locatello, R.M. Freund,
F. Pedregosa, in:, Proceedings of the 37th International Conference on Machine
Learning, 2020, pp. 7253–7262.
conference:
end_date: 2020-07-18
location: Virtual
name: International Conference on Machine Learning
start_date: 2020-07-13
date_created: 2023-08-22T14:07:52Z
date_published: 2020-07-27T00:00:00Z
date_updated: 2023-09-12T08:03:40Z
day: '27'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '2002.11860'
intvolume: ' 119'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2002.11860
month: '07'
oa: 1
oa_version: Preprint
page: 7253-7262
publication: Proceedings of the 37th International Conference on Machine Learning
publication_status: published
quality_controlled: '1'
status: public
title: Stochastic Frank-Wolfe for constrained finite-sum minimization
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 119
year: '2020'
...
---
_id: '14188'
abstract:
- lang: eng
text: "Intelligent agents should be able to learn useful representations by\r\nobserving
changes in their environment. We model such observations as pairs of\r\nnon-i.i.d.
images sharing at least one of the underlying factors of variation.\r\nFirst,
we theoretically show that only knowing how many factors have changed,\r\nbut
not which ones, is sufficient to learn disentangled representations.\r\nSecond,
we provide practical algorithms that learn disentangled representations\r\nfrom
pairs of images without requiring annotation of groups, individual\r\nfactors,
or the number of factors that have changed. Third, we perform a\r\nlarge-scale
empirical study and show that such pairs of observations are\r\nsufficient to
reliably learn disentangled representations on several benchmark\r\ndata sets.
Finally, we evaluate our learned representations and find that they\r\nare simultaneously
useful on a diverse suite of tasks, including generalization\r\nunder covariate
shifts, fairness, and abstract reasoning. Overall, our results\r\ndemonstrate
that weak supervision enables learning of useful disentangled\r\nrepresentations
in realistic scenarios."
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Ben
full_name: Poole, Ben
last_name: Poole
- first_name: Gunnar
full_name: Rätsch, Gunnar
last_name: Rätsch
- first_name: Bernhard
full_name: Schölkopf, Bernhard
last_name: Schölkopf
- first_name: Olivier
full_name: Bachem, Olivier
last_name: Bachem
- first_name: Michael
full_name: Tschannen, Michael
last_name: Tschannen
citation:
ama: 'Locatello F, Poole B, Rätsch G, Schölkopf B, Bachem O, Tschannen M. Weakly-supervised
disentanglement without compromises. In: Proceedings of the 37th International
Conference on Machine Learning. Vol 119. ; 2020:6348–6359.'
apa: Locatello, F., Poole, B., Rätsch, G., Schölkopf, B., Bachem, O., & Tschannen,
M. (2020). Weakly-supervised disentanglement without compromises. In Proceedings
of the 37th International Conference on Machine Learning (Vol. 119, pp. 6348–6359).
Virtual.
chicago: Locatello, Francesco, Ben Poole, Gunnar Rätsch, Bernhard Schölkopf, Olivier
Bachem, and Michael Tschannen. “Weakly-Supervised Disentanglement without Compromises.”
In Proceedings of the 37th International Conference on Machine Learning,
119:6348–6359, 2020.
ieee: F. Locatello, B. Poole, G. Rätsch, B. Schölkopf, O. Bachem, and M. Tschannen,
“Weakly-supervised disentanglement without compromises,” in Proceedings of
the 37th International Conference on Machine Learning, Virtual, 2020, vol.
119, pp. 6348–6359.
ista: Locatello F, Poole B, Rätsch G, Schölkopf B, Bachem O, Tschannen M. 2020.
Weakly-supervised disentanglement without compromises. Proceedings of the 37th
International Conference on Machine Learning. International Conference on Machine
Learning, PMLR, vol. 119, 6348–6359.
mla: Locatello, Francesco, et al. “Weakly-Supervised Disentanglement without Compromises.”
Proceedings of the 37th International Conference on Machine Learning, vol.
119, 2020, pp. 6348–6359.
short: F. Locatello, B. Poole, G. Rätsch, B. Schölkopf, O. Bachem, M. Tschannen,
in:, Proceedings of the 37th International Conference on Machine Learning, 2020,
pp. 6348–6359.
conference:
end_date: 2020-07-18
location: Virtual
name: International Conference on Machine Learning
start_date: 2020-07-13
date_created: 2023-08-22T14:08:14Z
date_published: 2020-07-07T00:00:00Z
date_updated: 2023-09-12T07:59:29Z
day: '07'
department:
- _id: FrLo
extern: '1'
external_id:
arxiv:
- '2002.02886'
intvolume: ' 119'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2002.02886
month: '07'
oa: 1
oa_version: Preprint
page: 6348–6359
publication: Proceedings of the 37th International Conference on Machine Learning
publication_status: published
quality_controlled: '1'
scopus_import: '1'
status: public
title: Weakly-supervised disentanglement without compromises
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 119
year: '2020'
...