---
_id: '8671'
abstract:
- lang: eng
text: 'We study relations between evidence theory and S-approximation spaces. Both
theories have their roots in the analysis of Dempsterchr(''39'')s multivalued
mappings and lower and upper probabilities, and have close relations to rough
sets. We show that an S-approximation space, satisfying a monotonicity condition,
can induce a natural belief structure which is a fundamental block in evidence
theory. We also demonstrate that one can induce a natural belief structure on
one set, given a belief structure on another set, if the two sets are related
by a partial monotone S-approximation space. '
acknowledgement: We are very grateful to the anonymous reviewer for detailed comments
and suggestions that significantly improved the presentation of this paper. The
research was partially supported by a DOC fellowship of the Austrian Academy of
Sciences.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: A.
full_name: Shakiba, A.
last_name: Shakiba
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: M.R.
full_name: Hooshmandasl, M.R.
last_name: Hooshmandasl
- first_name: M.
full_name: Alambardar Meybodi, M.
last_name: Alambardar Meybodi
citation:
ama: Shakiba A, Goharshady AK, Hooshmandasl MR, Alambardar Meybodi M. A note on
belief structures and s-approximation spaces. Iranian Journal of Mathematical
Sciences and Informatics. 2020;15(2):117-128. doi:10.29252/ijmsi.15.2.117
apa: Shakiba, A., Goharshady, A. K., Hooshmandasl, M. R., & Alambardar Meybodi,
M. (2020). A note on belief structures and s-approximation spaces. Iranian
Journal of Mathematical Sciences and Informatics. Iranian Academic Center
for Education, Culture and Research. https://doi.org/10.29252/ijmsi.15.2.117
chicago: Shakiba, A., Amir Kafshdar Goharshady, M.R. Hooshmandasl, and M. Alambardar
Meybodi. “A Note on Belief Structures and S-Approximation Spaces.” Iranian
Journal of Mathematical Sciences and Informatics. Iranian Academic Center
for Education, Culture and Research, 2020. https://doi.org/10.29252/ijmsi.15.2.117.
ieee: A. Shakiba, A. K. Goharshady, M. R. Hooshmandasl, and M. Alambardar Meybodi,
“A note on belief structures and s-approximation spaces,” Iranian Journal of
Mathematical Sciences and Informatics, vol. 15, no. 2. Iranian Academic Center
for Education, Culture and Research, pp. 117–128, 2020.
ista: Shakiba A, Goharshady AK, Hooshmandasl MR, Alambardar Meybodi M. 2020. A note
on belief structures and s-approximation spaces. Iranian Journal of Mathematical
Sciences and Informatics. 15(2), 117–128.
mla: Shakiba, A., et al. “A Note on Belief Structures and S-Approximation Spaces.”
Iranian Journal of Mathematical Sciences and Informatics, vol. 15, no.
2, Iranian Academic Center for Education, Culture and Research, 2020, pp. 117–28,
doi:10.29252/ijmsi.15.2.117.
short: A. Shakiba, A.K. Goharshady, M.R. Hooshmandasl, M. Alambardar Meybodi, Iranian
Journal of Mathematical Sciences and Informatics 15 (2020) 117–128.
date_created: 2020-10-18T22:01:36Z
date_published: 2020-10-01T00:00:00Z
date_updated: 2023-10-16T09:25:00Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.29252/ijmsi.15.2.117
external_id:
arxiv:
- '1805.10672'
file:
- access_level: open_access
checksum: f299661a6d51cda6d255a76be696f48d
content_type: application/pdf
creator: dernst
date_created: 2020-10-19T11:14:20Z
date_updated: 2020-10-19T11:14:20Z
file_id: '8676'
file_name: 2020_ijmsi_Shakiba_accepted.pdf
file_size: 261688
relation: main_file
success: 1
file_date_updated: 2020-10-19T11:14:20Z
has_accepted_license: '1'
intvolume: ' 15'
issue: '2'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 117-128
project:
- _id: 267066CE-B435-11E9-9278-68D0E5697425
name: Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies
publication: Iranian Journal of Mathematical Sciences and Informatics
publication_identifier:
eissn:
- 2008-9473
issn:
- 1735-4463
publication_status: published
publisher: Iranian Academic Center for Education, Culture and Research
quality_controlled: '1'
scopus_import: '1'
status: public
title: A note on belief structures and s-approximation spaces
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2020'
...
---
_id: '8672'
abstract:
- lang: eng
text: Cell fate transitions are key to development and homeostasis. It is thus essential
to understand the cellular mechanisms controlling fate transitions. Cell division
has been implicated in fate decisions in many stem cell types, including neuronal
and epithelial progenitors. In other stem cells, such as embryonic stem (ES) cells,
the role of division remains unclear. Here, we show that exit from naive pluripotency
in mouse ES cells generally occurs after a division. We further show that exit
timing is strongly correlated between sister cells, which remain connected by
cytoplasmic bridges long after division, and that bridge abscission progressively
accelerates as cells exit naive pluripotency. Finally, interfering with abscission
impairs naive pluripotency exit, and artificially inducing abscission accelerates
it. Altogether, our data indicate that a switch in the division machinery leading
to faster abscission regulates pluripotency exit. Our study identifies abscission
as a key cellular process coupling cell division to fate transitions.
acknowledgement: This work was supported by the Medical Research Council UK (MRC Program
award MC_UU_12018/5 ), the European Research Council (starting grant 311637 -MorphoCorDiv
and consolidator grant 820188 -NanoMechShape to E.K.P.), and the Leverhulme Trust
(Leverhulme Prize in Biological Sciences to E.K.P.). K.J.C. acknowledges support
from the Royal Society (Royal Society Research Fellowship). A.C. acknowledges support
from EMBO ( ALTF 2015-563 ), the Wellcome Trust ( 201334/Z/16/Z ), and the Fondation
Bettencourt-Schueller (Prix Jeune Chercheur, 2015).
article_processing_charge: No
article_type: original
author:
- first_name: Agathe
full_name: Chaigne, Agathe
last_name: Chaigne
- first_name: Céline
full_name: Labouesse, Céline
last_name: Labouesse
- first_name: Ian J.
full_name: White, Ian J.
last_name: White
- first_name: Meghan
full_name: Agnew, Meghan
last_name: Agnew
- first_name: Edouard B
full_name: Hannezo, Edouard B
id: 3A9DB764-F248-11E8-B48F-1D18A9856A87
last_name: Hannezo
orcid: 0000-0001-6005-1561
- first_name: Kevin J.
full_name: Chalut, Kevin J.
last_name: Chalut
- first_name: Ewa K.
full_name: Paluch, Ewa K.
last_name: Paluch
citation:
ama: Chaigne A, Labouesse C, White IJ, et al. Abscission couples cell division to
embryonic stem cell fate. Developmental Cell. 2020;55(2):195-208. doi:10.1016/j.devcel.2020.09.001
apa: Chaigne, A., Labouesse, C., White, I. J., Agnew, M., Hannezo, E. B., Chalut,
K. J., & Paluch, E. K. (2020). Abscission couples cell division to embryonic
stem cell fate. Developmental Cell. Elsevier. https://doi.org/10.1016/j.devcel.2020.09.001
chicago: Chaigne, Agathe, Céline Labouesse, Ian J. White, Meghan Agnew, Edouard
B Hannezo, Kevin J. Chalut, and Ewa K. Paluch. “Abscission Couples Cell Division
to Embryonic Stem Cell Fate.” Developmental Cell. Elsevier, 2020. https://doi.org/10.1016/j.devcel.2020.09.001.
ieee: A. Chaigne et al., “Abscission couples cell division to embryonic stem
cell fate,” Developmental Cell, vol. 55, no. 2. Elsevier, pp. 195–208,
2020.
ista: Chaigne A, Labouesse C, White IJ, Agnew M, Hannezo EB, Chalut KJ, Paluch EK.
2020. Abscission couples cell division to embryonic stem cell fate. Developmental
Cell. 55(2), 195–208.
mla: Chaigne, Agathe, et al. “Abscission Couples Cell Division to Embryonic Stem
Cell Fate.” Developmental Cell, vol. 55, no. 2, Elsevier, 2020, pp. 195–208,
doi:10.1016/j.devcel.2020.09.001.
short: A. Chaigne, C. Labouesse, I.J. White, M. Agnew, E.B. Hannezo, K.J. Chalut,
E.K. Paluch, Developmental Cell 55 (2020) 195–208.
date_created: 2020-10-18T22:01:37Z
date_published: 2020-10-26T00:00:00Z
date_updated: 2023-08-22T10:16:58Z
day: '26'
ddc:
- '570'
department:
- _id: EdHa
doi: 10.1016/j.devcel.2020.09.001
external_id:
isi:
- '000582501100012'
pmid:
- '32979313'
file:
- access_level: open_access
checksum: 88e1a031a61689165d19a19c2f16d795
content_type: application/pdf
creator: dernst
date_created: 2021-02-04T10:20:02Z
date_updated: 2021-02-04T10:20:02Z
file_id: '9086'
file_name: 2020_DevelopmCell_Chaigne.pdf
file_size: 6929686
relation: main_file
success: 1
file_date_updated: 2021-02-04T10:20:02Z
has_accepted_license: '1'
intvolume: ' 55'
isi: 1
issue: '2'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 195-208
pmid: 1
publication: Developmental Cell
publication_identifier:
eissn:
- '18781551'
issn:
- '15345807'
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Abscission couples cell division to embryonic stem cell fate
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 55
year: '2020'
...
---
_id: '8674'
abstract:
- lang: eng
text: 'Extrasynaptic actions of glutamate are limited by high-affinity transporters
expressed by perisynaptic astroglial processes (PAPs): this helps maintain point-to-point
transmission in excitatory circuits. Memory formation in the brain is associated
with synaptic remodeling, but how this affects PAPs and therefore extrasynaptic
glutamate actions is poorly understood. Here, we used advanced imaging methods,
in situ and in vivo, to find that a classical synaptic memory mechanism, long-term
potentiation (LTP), triggers withdrawal of PAPs from potentiated synapses. Optical
glutamate sensors combined with patch-clamp and 3D molecular localization reveal
that LTP induction thus prompts spatial retreat of astroglial glutamate transporters,
boosting glutamate spillover and NMDA-receptor-mediated inter-synaptic cross-talk.
The LTP-triggered PAP withdrawal involves NKCC1 transporters and the actin-controlling
protein cofilin but does not depend on major Ca2+-dependent cascades in astrocytes.
We have therefore uncovered a mechanism by which a memory trace at one synapse
could alter signal handling by multiple neighboring connections.'
acknowledgement: We thank J. Angibaud for organotypic cultures and R. Chereau and
J. Tonnesen for help with the STED microscope; also D. Gonzales and the Neurocentre
Magendie INSERM U1215 Genotyping Platform, for breeding management and genotyping.
This work was supported by the Wellcome Trust Principal Fellowships 101896 and 212251,
ERC Advanced Grant 323113, ERC Proof-of-Concept Grant 767372, EC FP7 ITN 606950,
and EU CSA 811011 (D.A.R.); NRW-Rückkehrerpogramm, UCL Excellence Fellowship, German
Research Foundation (DFG) SPP1757 and SFB1089 (C.H.); Human Frontiers Science Program
(C.H., C.J.J., and H.J.); EMBO Long-Term Fellowship (L.B.); Marie Curie FP7 PIRG08-GA-2010-276995
(A.P.), ASTROMODULATION (S.R.); Equipe FRM DEQ 201 303 26519, Conseil Régional d’Aquitaine
R12056GG, INSERM (S.H.R.O.); ANR SUPERTri, ANR Castro (ANR-17-CE16-0002), R-13-BSV4-0007-01,
Université de Bordeaux, labex BRAIN (S.H.R.O. and U.V.N.); CNRS (A.P., S.H.R.O.,
and U.V.N.); HFSP, ANR CEXC, and France-BioImaging ANR-10-INSB-04 (U.V.N.); and
FP7 MemStick Project No. 201600 (M.G.S.).
article_processing_charge: No
article_type: original
author:
- first_name: Christian
full_name: Henneberger, Christian
last_name: Henneberger
- first_name: Lucie
full_name: Bard, Lucie
last_name: Bard
- first_name: Aude
full_name: Panatier, Aude
last_name: Panatier
- first_name: James P.
full_name: Reynolds, James P.
last_name: Reynolds
- first_name: Olga
full_name: Kopach, Olga
last_name: Kopach
- first_name: Nikolay I.
full_name: Medvedev, Nikolay I.
last_name: Medvedev
- first_name: Daniel
full_name: Minge, Daniel
last_name: Minge
- first_name: Michel K.
full_name: Herde, Michel K.
last_name: Herde
- first_name: Stefanie
full_name: Anders, Stefanie
last_name: Anders
- first_name: Igor
full_name: Kraev, Igor
last_name: Kraev
- first_name: Janosch P.
full_name: Heller, Janosch P.
last_name: Heller
- first_name: Sylvain
full_name: Rama, Sylvain
last_name: Rama
- first_name: Kaiyu
full_name: Zheng, Kaiyu
last_name: Zheng
- first_name: Thomas P.
full_name: Jensen, Thomas P.
last_name: Jensen
- first_name: Inmaculada
full_name: Sanchez-Romero, Inmaculada
id: 3D9C5D30-F248-11E8-B48F-1D18A9856A87
last_name: Sanchez-Romero
- first_name: Colin J.
full_name: Jackson, Colin J.
last_name: Jackson
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
- first_name: Ole Petter
full_name: Ottersen, Ole Petter
last_name: Ottersen
- first_name: Erlend Arnulf
full_name: Nagelhus, Erlend Arnulf
last_name: Nagelhus
- first_name: Stephane H.R.
full_name: Oliet, Stephane H.R.
last_name: Oliet
- first_name: Michael G.
full_name: Stewart, Michael G.
last_name: Stewart
- first_name: U. VAlentin
full_name: Nägerl, U. VAlentin
last_name: Nägerl
- first_name: 'Dmitri A. '
full_name: 'Rusakov, Dmitri A. '
last_name: Rusakov
citation:
ama: Henneberger C, Bard L, Panatier A, et al. LTP induction boosts glutamate spillover
by driving withdrawal of perisynaptic astroglia. Neuron. 2020;108(5):P919-936.E11.
doi:10.1016/j.neuron.2020.08.030
apa: Henneberger, C., Bard, L., Panatier, A., Reynolds, J. P., Kopach, O., Medvedev,
N. I., … Rusakov, D. A. (2020). LTP induction boosts glutamate spillover by driving
withdrawal of perisynaptic astroglia. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2020.08.030
chicago: Henneberger, Christian, Lucie Bard, Aude Panatier, James P. Reynolds, Olga
Kopach, Nikolay I. Medvedev, Daniel Minge, et al. “LTP Induction Boosts Glutamate
Spillover by Driving Withdrawal of Perisynaptic Astroglia.” Neuron. Elsevier,
2020. https://doi.org/10.1016/j.neuron.2020.08.030.
ieee: C. Henneberger et al., “LTP induction boosts glutamate spillover by
driving withdrawal of perisynaptic astroglia,” Neuron, vol. 108, no. 5.
Elsevier, p. P919–936.E11, 2020.
ista: Henneberger C, Bard L, Panatier A, Reynolds JP, Kopach O, Medvedev NI, Minge
D, Herde MK, Anders S, Kraev I, Heller JP, Rama S, Zheng K, Jensen TP, Sanchez-Romero
I, Jackson CJ, Janovjak HL, Ottersen OP, Nagelhus EA, Oliet SHR, Stewart MG, Nägerl
UVa, Rusakov DA. 2020. LTP induction boosts glutamate spillover by driving withdrawal
of perisynaptic astroglia. Neuron. 108(5), P919–936.E11.
mla: Henneberger, Christian, et al. “LTP Induction Boosts Glutamate Spillover by
Driving Withdrawal of Perisynaptic Astroglia.” Neuron, vol. 108, no. 5,
Elsevier, 2020, p. P919–936.E11, doi:10.1016/j.neuron.2020.08.030.
short: C. Henneberger, L. Bard, A. Panatier, J.P. Reynolds, O. Kopach, N.I. Medvedev,
D. Minge, M.K. Herde, S. Anders, I. Kraev, J.P. Heller, S. Rama, K. Zheng, T.P.
Jensen, I. Sanchez-Romero, C.J. Jackson, H.L. Janovjak, O.P. Ottersen, E.A. Nagelhus,
S.H.R. Oliet, M.G. Stewart, U.Va. Nägerl, D.A. Rusakov, Neuron 108 (2020) P919–936.E11.
date_created: 2020-10-18T22:01:38Z
date_published: 2020-12-09T00:00:00Z
date_updated: 2023-08-22T09:59:29Z
day: '09'
ddc:
- '570'
department:
- _id: HaJa
doi: 10.1016/j.neuron.2020.08.030
external_id:
isi:
- '000603428000010'
pmid:
- '32976770'
file:
- access_level: open_access
checksum: 054562bb50165ef9a1f46631c1c5e36b
content_type: application/pdf
creator: dernst
date_created: 2020-12-10T14:42:09Z
date_updated: 2020-12-10T14:42:09Z
file_id: '8939'
file_name: 2020_Neuron_Henneberger.pdf
file_size: 7518960
relation: main_file
success: 1
file_date_updated: 2020-12-10T14:42:09Z
has_accepted_license: '1'
intvolume: ' 108'
isi: 1
issue: '5'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: P919-936.E11
pmid: 1
publication: Neuron
publication_identifier:
eissn:
- '10974199'
issn:
- '08966273'
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: LTP induction boosts glutamate spillover by driving withdrawal of perisynaptic
astroglia
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 108
year: '2020'
...
---
_id: '8680'
abstract:
- lang: eng
text: Animal development entails the organization of specific cell types in space
and time, and spatial patterns must form in a robust manner. In the zebrafish
spinal cord, neural progenitors form stereotypic patterns despite noisy morphogen
signaling and large-scale cellular rearrangements during morphogenesis and growth.
By directly measuring adhesion forces and preferences for three types of endogenous
neural progenitors, we provide evidence for the differential adhesion model in
which differences in intercellular adhesion mediate cell sorting. Cell type–specific
combinatorial expression of different classes of cadherins (N-cadherin, cadherin
11, and protocadherin 19) results in homotypic preference ex vivo and patterning
robustness in vivo. Furthermore, the differential adhesion code is regulated by
the sonic hedgehog morphogen gradient. We propose that robust patterning during
tissue morphogenesis results from interplay between adhesion-based self-organization
and morphogen-directed patterning.
acknowledgement: "We thank the members of the Megason and Heisenberg labs for critical
discussions of and technical assistance during the work and B. Appel, S. Holley,
J. Jontes, and D. Gilmour for transgenic fish. This work is supported by the Damon
Runyon Cancer Foundation, a NICHD K99 fellowship (1K99HD092623), a Travelling Fellowship
of the Company of Biologists, a Collaborative Research grant from the Burroughs
Wellcome Foundation (T.Y.-C.T.), NIH grant 01GM107733 (T.Y.-C.T. and S.G.M.), NIH
grant R01NS102322 (T.C.-C. and H.K.), and an ERC advanced grant\r\n(MECSPEC) (C.-P.H.)."
article_processing_charge: No
article_type: original
author:
- first_name: Tony Y.-C.
full_name: Tsai, Tony Y.-C.
last_name: Tsai
- first_name: Mateusz K
full_name: Sikora, Mateusz K
id: 2F74BCDE-F248-11E8-B48F-1D18A9856A87
last_name: Sikora
- first_name: Peng
full_name: Xia, Peng
id: 4AB6C7D0-F248-11E8-B48F-1D18A9856A87
last_name: Xia
orcid: 0000-0002-5419-7756
- first_name: Tugba
full_name: Colak-Champollion, Tugba
last_name: Colak-Champollion
- first_name: Holger
full_name: Knaut, Holger
last_name: Knaut
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
- first_name: Sean G.
full_name: Megason, Sean G.
last_name: Megason
citation:
ama: Tsai TY-C, Sikora MK, Xia P, et al. An adhesion code ensures robust pattern
formation during tissue morphogenesis. Science. 2020;370(6512):113-116.
doi:10.1126/science.aba6637
apa: Tsai, T. Y.-C., Sikora, M. K., Xia, P., Colak-Champollion, T., Knaut, H., Heisenberg,
C.-P. J., & Megason, S. G. (2020). An adhesion code ensures robust pattern
formation during tissue morphogenesis. Science. American Association for
the Advancement of Science. https://doi.org/10.1126/science.aba6637
chicago: Tsai, Tony Y.-C., Mateusz K Sikora, Peng Xia, Tugba Colak-Champollion,
Holger Knaut, Carl-Philipp J Heisenberg, and Sean G. Megason. “An Adhesion Code
Ensures Robust Pattern Formation during Tissue Morphogenesis.” Science.
American Association for the Advancement of Science, 2020. https://doi.org/10.1126/science.aba6637.
ieee: T. Y.-C. Tsai et al., “An adhesion code ensures robust pattern formation
during tissue morphogenesis,” Science, vol. 370, no. 6512. American Association
for the Advancement of Science, pp. 113–116, 2020.
ista: Tsai TY-C, Sikora MK, Xia P, Colak-Champollion T, Knaut H, Heisenberg C-PJ,
Megason SG. 2020. An adhesion code ensures robust pattern formation during tissue
morphogenesis. Science. 370(6512), 113–116.
mla: Tsai, Tony Y. C., et al. “An Adhesion Code Ensures Robust Pattern Formation
during Tissue Morphogenesis.” Science, vol. 370, no. 6512, American Association
for the Advancement of Science, 2020, pp. 113–16, doi:10.1126/science.aba6637.
short: T.Y.-C. Tsai, M.K. Sikora, P. Xia, T. Colak-Champollion, H. Knaut, C.-P.J.
Heisenberg, S.G. Megason, Science 370 (2020) 113–116.
date_created: 2020-10-19T14:09:38Z
date_published: 2020-10-02T00:00:00Z
date_updated: 2023-08-22T10:36:35Z
day: '02'
department:
- _id: CaHe
doi: 10.1126/science.aba6637
ec_funded: 1
external_id:
isi:
- '000579169000053'
intvolume: ' 370'
isi: 1
issue: '6512'
keyword:
- Multidisciplinary
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.biorxiv.org/content/10.1101/803635v1
month: '10'
oa: 1
oa_version: Preprint
page: 113-116
project:
- _id: 260F1432-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '742573'
name: Interaction and feedback between cell mechanics and fate specification in
vertebrate gastrulation
publication: Science
publication_identifier:
eissn:
- 1095-9203
issn:
- 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/sticking-together/
scopus_import: '1'
status: public
title: An adhesion code ensures robust pattern formation during tissue morphogenesis
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 370
year: '2020'
...
---
_id: '8691'
abstract:
- lang: eng
text: Given l>2ν>2d≥4, we prove the persistence of a Cantor--family of KAM tori
of measure O(ε1/2−ν/l) for any non--degenerate nearly integrable Hamiltonian system
of class Cl(D×Td), where D⊂Rd is a bounded domain, provided that the size ε of
the perturbation is sufficiently small. This extends a result by D. Salamon in
\cite{salamon2004kolmogorov} according to which we do have the persistence of
a single KAM torus in the same framework. Moreover, it is well--known that, for
the persistence of a single torus, the regularity assumption can not be improved.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Edmond
full_name: Koudjinan, Edmond
id: 52DF3E68-AEFA-11EA-95A4-124A3DDC885E
last_name: Koudjinan
orcid: 0000-0003-2640-4049
citation:
ama: Koudjinan E. A KAM theorem for finitely differentiable Hamiltonian systems.
Journal of Differential Equations. 2020;269(6):4720-4750. doi:10.1016/j.jde.2020.03.044
apa: Koudjinan, E. (2020). A KAM theorem for finitely differentiable Hamiltonian
systems. Journal of Differential Equations. Elsevier. https://doi.org/10.1016/j.jde.2020.03.044
chicago: Koudjinan, Edmond. “A KAM Theorem for Finitely Differentiable Hamiltonian
Systems.” Journal of Differential Equations. Elsevier, 2020. https://doi.org/10.1016/j.jde.2020.03.044.
ieee: E. Koudjinan, “A KAM theorem for finitely differentiable Hamiltonian systems,”
Journal of Differential Equations, vol. 269, no. 6. Elsevier, pp. 4720–4750,
2020.
ista: Koudjinan E. 2020. A KAM theorem for finitely differentiable Hamiltonian systems.
Journal of Differential Equations. 269(6), 4720–4750.
mla: Koudjinan, Edmond. “A KAM Theorem for Finitely Differentiable Hamiltonian Systems.”
Journal of Differential Equations, vol. 269, no. 6, Elsevier, 2020, pp.
4720–50, doi:10.1016/j.jde.2020.03.044.
short: E. Koudjinan, Journal of Differential Equations 269 (2020) 4720–4750.
date_created: 2020-10-21T15:03:05Z
date_published: 2020-09-05T00:00:00Z
date_updated: 2021-01-12T08:20:33Z
day: '05'
doi: 10.1016/j.jde.2020.03.044
extern: '1'
external_id:
arxiv:
- '1909.04099'
intvolume: ' 269'
issue: '6'
keyword:
- Analysis
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1909.04099
month: '09'
oa: 1
oa_version: Preprint
page: 4720-4750
publication: Journal of Differential Equations
publication_identifier:
issn:
- 0022-0396
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: A KAM theorem for finitely differentiable Hamiltonian systems
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 269
year: '2020'
...
---
_id: '8694'
abstract:
- lang: eng
text: "We develop algorithms and techniques to compute rigorous bounds for finite
pieces of orbits of the critical points, for intervals of parameter values, in
the quadratic family of one-dimensional maps fa(x)=a−x2. We illustrate the effectiveness
of our approach by constructing a dynamically defined partition \U0001D4AB of
the parameter interval Ω=[1.4,2] into almost 4×106 subintervals, for each of which
we compute to high precision the orbits of the critical points up to some time
N and other dynamically relevant quantities, several of which can vary greatly,
possibly spanning several orders of magnitude. We also subdivide \U0001D4AB into
a family \U0001D4AB+ of intervals, which we call stochastic intervals, and a family
\U0001D4AB− of intervals, which we call regular intervals. We numerically prove
that each interval ω∈\U0001D4AB+ has an escape time, which roughly means that
some iterate of the critical point taken over all the parameters in ω has considerable
width in the phase space. This suggests, in turn, that most parameters belonging
to the intervals in \U0001D4AB+ are stochastic and most parameters belonging to
the intervals in \U0001D4AB− are regular, thus the names. We prove that the intervals
in \U0001D4AB+ occupy almost 90% of the total measure of Ω. The software and the
data are freely available at http://www.pawelpilarczyk.com/quadr/, and a web page
is provided for carrying out the calculations. The ideas and procedures can be
easily generalized to apply to other parameterized families of dynamical systems."
article_number: '073143'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Ali
full_name: Golmakani, Ali
last_name: Golmakani
- first_name: Edmond
full_name: Koudjinan, Edmond
id: 52DF3E68-AEFA-11EA-95A4-124A3DDC885E
last_name: Koudjinan
orcid: 0000-0003-2640-4049
- first_name: Stefano
full_name: Luzzatto, Stefano
last_name: Luzzatto
- first_name: Pawel
full_name: Pilarczyk, Pawel
last_name: Pilarczyk
citation:
ama: Golmakani A, Koudjinan E, Luzzatto S, Pilarczyk P. Rigorous numerics for critical
orbits in the quadratic family. Chaos. 2020;30(7). doi:10.1063/5.0012822
apa: Golmakani, A., Koudjinan, E., Luzzatto, S., & Pilarczyk, P. (2020). Rigorous
numerics for critical orbits in the quadratic family. Chaos. AIP. https://doi.org/10.1063/5.0012822
chicago: Golmakani, Ali, Edmond Koudjinan, Stefano Luzzatto, and Pawel Pilarczyk.
“Rigorous Numerics for Critical Orbits in the Quadratic Family.” Chaos.
AIP, 2020. https://doi.org/10.1063/5.0012822.
ieee: A. Golmakani, E. Koudjinan, S. Luzzatto, and P. Pilarczyk, “Rigorous numerics
for critical orbits in the quadratic family,” Chaos, vol. 30, no. 7. AIP,
2020.
ista: Golmakani A, Koudjinan E, Luzzatto S, Pilarczyk P. 2020. Rigorous numerics
for critical orbits in the quadratic family. Chaos. 30(7), 073143.
mla: Golmakani, Ali, et al. “Rigorous Numerics for Critical Orbits in the Quadratic
Family.” Chaos, vol. 30, no. 7, 073143, AIP, 2020, doi:10.1063/5.0012822.
short: A. Golmakani, E. Koudjinan, S. Luzzatto, P. Pilarczyk, Chaos 30 (2020).
date_created: 2020-10-21T15:43:05Z
date_published: 2020-07-31T00:00:00Z
date_updated: 2021-01-12T08:20:34Z
day: '31'
doi: 10.1063/5.0012822
extern: '1'
external_id:
arxiv:
- '2004.13444'
intvolume: ' 30'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2004.13444
month: '07'
oa: 1
oa_version: Preprint
publication: Chaos
publication_status: published
publisher: AIP
quality_controlled: '1'
status: public
title: Rigorous numerics for critical orbits in the quadratic family
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 30
year: '2020'
...
---
_id: '8695'
abstract:
- lang: eng
text: A look at international activities on Open Science reveals a broad spectrum
from individual institutional policies to national action plans. The present Recommendations
for a National Open Science Strategy in Austria are based on these international
initiatives and present practical considerations for their coordinated implementation
with regard to strategic developments in research, technology and innovation (RTI)
in Austria until 2030. They are addressed to all relevant actors in the RTI system,
in particular to Research Performing Organisations, Research Funding Organisations,
Research Policy, memory institutions such as Libraries and Researchers. The recommendation
paper was developed from 2018 to 2020 by the OANA working group "Open Science
Strategy" and published for the first time in spring 2020 for a public consultation.
The now available final version of the recommendation document, which contains
feedback and comments from the consultation, is intended to provide an impetus
for further discussion and implementation of Open Science in Austria and serves
as a contribution and basis for a potential national Open Science Strategy in
Austria. The document builds on the diverse expertise of the authors (academia,
administration, library and archive, information technology, science policy, funding
system, etc.) and reflects their personal experiences and opinions.
- lang: ger
text: Der Blick auf internationale Aktivitäten zu Open Science zeigt ein breites
Spektrum von einzelnen institutionellen Policies bis hin zu nationalen Aktionsplänen.
Die vorliegenden Empfehlungen für eine nationale Open Science Strategie in Österreich
orientieren sich an diesen internationalen Initiativen und stellen praktische
Überlegungen für ihre koordinierte Implementierung im Hinblick auf strategische
Entwicklungen in Forschung, Technologie und Innovation (FTI) bis 2030 in Österreich
dar. Dabei richten sie sich an alle relevanten Akteur*innen im FTI System, im
Besonderen an Forschungsstätten, Forschungsförderer, Forschungspolitik, Gedächtnisinstitutionen
wie Bibliotheken und Wissenschafter*innen. Das Empfehlungspapier wurde von 2018
bis 2020 von der OANA-Arbeitsgruppe "Open Science Strategie" entwickelt und im
Frühling 2020 das erste Mal für eine öffentliche Konsultation veröffentlicht.
Die nun vorliegende finale Version des Empfehlungsdokuments, die Feedback und
Kommentare aus der Konsultation enthält, soll ein Anstoß für die weitere Diskussion
und Umsetzung von Open Science in Österreich sein und als Beitrag und Grundlage
einer potentiellen nationalen Open Science Strategie in Österreich dienen. Das
Dokument baut auf der vielfältigen Expertise der Autor*innen auf (Wissenschaft,
Administration, Bibliothek und Archiv, Informationstechnologie, Wissenschaftspolitik,
Förderwesen etc.) und spiegelt deren persönliche Erfahrungen und Meinung wider.
article_processing_charge: No
author:
- first_name: Katja
full_name: Mayer, Katja
last_name: Mayer
- first_name: Katharina
full_name: Rieck, Katharina
last_name: Rieck
- first_name: Stefan
full_name: Reichmann, Stefan
last_name: Reichmann
- first_name: Patrick
full_name: Danowski, Patrick
id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
last_name: Danowski
orcid: 0000-0002-6026-4409
- first_name: Anton
full_name: Graschopf, Anton
last_name: Graschopf
- first_name: Thomas
full_name: König, Thomas
last_name: König
- first_name: Peter
full_name: Kraker, Peter
last_name: Kraker
- first_name: Patrick
full_name: Lehner, Patrick
last_name: Lehner
- first_name: Falk
full_name: Reckling, Falk
last_name: Reckling
- first_name: Tony
full_name: Ross-Hellauer, Tony
last_name: Ross-Hellauer
- first_name: Daniel
full_name: Spichtinger, Daniel
last_name: Spichtinger
- first_name: Michalis
full_name: Tzatzanis, Michalis
last_name: Tzatzanis
- first_name: Stefanie
full_name: Schürz, Stefanie
last_name: Schürz
citation:
ama: Mayer K, Rieck K, Reichmann S, et al. Empfehlungen für eine nationale Open
Science Strategie in Österreich / Recommendations for a National Open Science
Strategy in Austria. OANA; 2020. doi:10.5281/ZENODO.4109242
apa: Mayer, K., Rieck, K., Reichmann, S., Danowski, P., Graschopf, A., König, T.,
… Schürz, S. (2020). Empfehlungen für eine nationale Open Science Strategie
in Österreich / Recommendations for a National Open Science Strategy in Austria.
OANA. https://doi.org/10.5281/ZENODO.4109242
chicago: Mayer, Katja, Katharina Rieck, Stefan Reichmann, Patrick Danowski, Anton
Graschopf, Thomas König, Peter Kraker, et al. Empfehlungen für eine nationale
Open Science Strategie in Österreich / Recommendations for a National Open Science
Strategy in Austria. OANA, 2020. https://doi.org/10.5281/ZENODO.4109242.
ieee: K. Mayer et al., Empfehlungen für eine nationale Open Science Strategie
in Österreich / Recommendations for a National Open Science Strategy in Austria.
OANA, 2020.
ista: Mayer K, Rieck K, Reichmann S, Danowski P, Graschopf A, König T, Kraker P,
Lehner P, Reckling F, Ross-Hellauer T, Spichtinger D, Tzatzanis M, Schürz S. 2020.
Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations
for a National Open Science Strategy in Austria, OANA, 36p.
mla: Mayer, Katja, et al. Empfehlungen für eine nationale Open Science Strategie
in Österreich / Recommendations for a National Open Science Strategy in Austria.
OANA, 2020, doi:10.5281/ZENODO.4109242.
short: K. Mayer, K. Rieck, S. Reichmann, P. Danowski, A. Graschopf, T. König, P.
Kraker, P. Lehner, F. Reckling, T. Ross-Hellauer, D. Spichtinger, M. Tzatzanis,
S. Schürz, Empfehlungen für eine nationale Open Science Strategie in Österreich
/ Recommendations for a National Open Science Strategy in Austria, OANA, 2020.
date_created: 2020-10-23T09:08:28Z
date_published: 2020-10-21T00:00:00Z
date_updated: 2020-10-23T09:34:40Z
day: '21'
ddc:
- '020'
department:
- _id: E-Lib
doi: 10.5281/ZENODO.4109242
file:
- access_level: open_access
checksum: 8eba912bb4b20b4f82f8010f2110461a
content_type: application/pdf
creator: dernst
date_created: 2020-10-23T09:29:45Z
date_updated: 2020-10-23T09:29:45Z
file_id: '8696'
file_name: 2020_OANA_Mayer.pdf
file_size: 2298363
relation: main_file
success: 1
file_date_updated: 2020-10-23T09:29:45Z
has_accepted_license: '1'
language:
- iso: ger
month: '10'
oa: 1
oa_version: Published Version
page: '36'
publication_status: published
publisher: OANA
status: public
title: Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations
for a National Open Science Strategy in Austria
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: working_paper
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '8697'
abstract:
- lang: eng
text: In the computation of the material properties of random alloys, the method
of 'special quasirandom structures' attempts to approximate the properties of
the alloy on a finite volume with higher accuracy by replicating certain statistics
of the random atomic lattice in the finite volume as accurately as possible. In
the present work, we provide a rigorous justification for a variant of this method
in the framework of the Thomas–Fermi–von Weizsäcker (TFW) model. Our approach
is based on a recent analysis of a related variance reduction method in stochastic
homogenization of linear elliptic PDEs and the locality properties of the TFW
model. Concerning the latter, we extend an exponential locality result by Nazar
and Ortner to include point charges, a result that may be of independent interest.
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Julian L
full_name: Fischer, Julian L
id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87
last_name: Fischer
orcid: 0000-0002-0479-558X
- first_name: Michael
full_name: Kniely, Michael
id: 2CA2C08C-F248-11E8-B48F-1D18A9856A87
last_name: Kniely
orcid: 0000-0001-5645-4333
citation:
ama: Fischer JL, Kniely M. Variance reduction for effective energies of random lattices
in the Thomas-Fermi-von Weizsäcker model. Nonlinearity. 2020;33(11):5733-5772.
doi:10.1088/1361-6544/ab9728
apa: Fischer, J. L., & Kniely, M. (2020). Variance reduction for effective energies
of random lattices in the Thomas-Fermi-von Weizsäcker model. Nonlinearity.
IOP Publishing. https://doi.org/10.1088/1361-6544/ab9728
chicago: Fischer, Julian L, and Michael Kniely. “Variance Reduction for Effective
Energies of Random Lattices in the Thomas-Fermi-von Weizsäcker Model.” Nonlinearity.
IOP Publishing, 2020. https://doi.org/10.1088/1361-6544/ab9728.
ieee: J. L. Fischer and M. Kniely, “Variance reduction for effective energies of
random lattices in the Thomas-Fermi-von Weizsäcker model,” Nonlinearity,
vol. 33, no. 11. IOP Publishing, pp. 5733–5772, 2020.
ista: Fischer JL, Kniely M. 2020. Variance reduction for effective energies of random
lattices in the Thomas-Fermi-von Weizsäcker model. Nonlinearity. 33(11), 5733–5772.
mla: Fischer, Julian L., and Michael Kniely. “Variance Reduction for Effective Energies
of Random Lattices in the Thomas-Fermi-von Weizsäcker Model.” Nonlinearity,
vol. 33, no. 11, IOP Publishing, 2020, pp. 5733–72, doi:10.1088/1361-6544/ab9728.
short: J.L. Fischer, M. Kniely, Nonlinearity 33 (2020) 5733–5772.
date_created: 2020-10-25T23:01:16Z
date_published: 2020-11-01T00:00:00Z
date_updated: 2023-08-22T10:38:38Z
day: '01'
ddc:
- '510'
department:
- _id: JuFi
doi: 10.1088/1361-6544/ab9728
external_id:
arxiv:
- '1906.12245'
isi:
- '000576492700001'
file:
- access_level: open_access
checksum: ed90bc6eb5f32ee6157fef7f3aabc057
content_type: application/pdf
creator: cziletti
date_created: 2020-10-27T12:09:57Z
date_updated: 2020-10-27T12:09:57Z
file_id: '8710'
file_name: 2020_Nonlinearity_Fischer.pdf
file_size: 1223899
relation: main_file
success: 1
file_date_updated: 2020-10-27T12:09:57Z
has_accepted_license: '1'
intvolume: ' 33'
isi: 1
issue: '11'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/3.0/
month: '11'
oa: 1
oa_version: Published Version
page: 5733-5772
publication: Nonlinearity
publication_identifier:
eissn:
- '13616544'
issn:
- '09517715'
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Variance reduction for effective energies of random lattices in the Thomas-Fermi-von
Weizsäcker model
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: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 33
year: '2020'
...
---
_id: '8698'
abstract:
- lang: eng
text: The brain represents and reasons probabilistically about complex stimuli and
motor actions using a noisy, spike-based neural code. A key building block for
such neural computations, as well as the basis for supervised and unsupervised
learning, is the ability to estimate the surprise or likelihood of incoming high-dimensional
neural activity patterns. Despite progress in statistical modeling of neural responses
and deep learning, current approaches either do not scale to large neural populations
or cannot be implemented using biologically realistic mechanisms. Inspired by
the sparse and random connectivity of real neuronal circuits, we present a model
for neural codes that accurately estimates the likelihood of individual spiking
patterns and has a straightforward, scalable, efficient, learnable, and realistic
neural implementation. This model’s performance on simultaneously recorded spiking
activity of >100 neurons in the monkey visual and prefrontal cortices is comparable
with or better than that of state-of-the-art models. Importantly, the model can
be learned using a small number of samples and using a local learning rule that
utilizes noise intrinsic to neural circuits. Slower, structural changes in random
connectivity, consistent with rewiring and pruning processes, further improve
the efficiency and sparseness of the resulting neural representations. Our results
merge insights from neuroanatomy, machine learning, and theoretical neuroscience
to suggest random sparse connectivity as a key design principle for neuronal computation.
acknowledgement: We thank Udi Karpas, Roy Harpaz, Tal Tamir, Adam Haber, and Amir
Bar for discussions and suggestions; and especially Oren Forkosh and Walter Senn
for invaluable discussions of the learning rule. This work was supported by European
Research Council Grant 311238 (to E.S.) and Israel Science Foundation Grant 1629/12
(to E.S.); as well as research support from Martin Kushner Schnur and Mr. and Mrs.
Lawrence Feis (E.S.); National Institute of Mental Health Grant R01MH109180 (to
R.K.); a Pew Scholarship in Biomedical Sciences (to R.K.); Simons Collaboration
on the Global Brain Grant 542997 (to R.K. and E.S.); and a CRCNS (Collaborative
Research in Computational Neuroscience) grant (to R.K. and E.S.).
article_processing_charge: No
article_type: original
author:
- first_name: Ori
full_name: Maoz, Ori
last_name: Maoz
- first_name: Gašper
full_name: Tkačik, Gašper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkačik
orcid: 0000-0002-6699-1455
- first_name: Mohamad Saleh
full_name: Esteki, Mohamad Saleh
last_name: Esteki
- first_name: Roozbeh
full_name: Kiani, Roozbeh
last_name: Kiani
- first_name: Elad
full_name: Schneidman, Elad
last_name: Schneidman
citation:
ama: Maoz O, Tkačik G, Esteki MS, Kiani R, Schneidman E. Learning probabilistic
neural representations with randomly connected circuits. Proceedings of the
National Academy of Sciences of the United States of America. 2020;117(40):25066-25073.
doi:10.1073/pnas.1912804117
apa: Maoz, O., Tkačik, G., Esteki, M. S., Kiani, R., & Schneidman, E. (2020).
Learning probabilistic neural representations with randomly connected circuits.
Proceedings of the National Academy of Sciences of the United States of America.
National Academy of Sciences. https://doi.org/10.1073/pnas.1912804117
chicago: Maoz, Ori, Gašper Tkačik, Mohamad Saleh Esteki, Roozbeh Kiani, and Elad
Schneidman. “Learning Probabilistic Neural Representations with Randomly Connected
Circuits.” Proceedings of the National Academy of Sciences of the United States
of America. National Academy of Sciences, 2020. https://doi.org/10.1073/pnas.1912804117.
ieee: O. Maoz, G. Tkačik, M. S. Esteki, R. Kiani, and E. Schneidman, “Learning probabilistic
neural representations with randomly connected circuits,” Proceedings of the
National Academy of Sciences of the United States of America, vol. 117, no.
40. National Academy of Sciences, pp. 25066–25073, 2020.
ista: Maoz O, Tkačik G, Esteki MS, Kiani R, Schneidman E. 2020. Learning probabilistic
neural representations with randomly connected circuits. Proceedings of the National
Academy of Sciences of the United States of America. 117(40), 25066–25073.
mla: Maoz, Ori, et al. “Learning Probabilistic Neural Representations with Randomly
Connected Circuits.” Proceedings of the National Academy of Sciences of the
United States of America, vol. 117, no. 40, National Academy of Sciences,
2020, pp. 25066–73, doi:10.1073/pnas.1912804117.
short: O. Maoz, G. Tkačik, M.S. Esteki, R. Kiani, E. Schneidman, Proceedings of
the National Academy of Sciences of the United States of America 117 (2020) 25066–25073.
date_created: 2020-10-25T23:01:16Z
date_published: 2020-10-06T00:00:00Z
date_updated: 2023-08-22T12:11:23Z
day: '06'
ddc:
- '570'
department:
- _id: GaTk
doi: 10.1073/pnas.1912804117
external_id:
isi:
- '000579045200012'
pmid:
- '32948691'
file:
- access_level: open_access
checksum: c6a24fdecf3f28faf447078e7a274a88
content_type: application/pdf
creator: cziletti
date_created: 2020-10-27T14:57:50Z
date_updated: 2020-10-27T14:57:50Z
file_id: '8713'
file_name: 2020_PNAS_Maoz.pdf
file_size: 1755359
relation: main_file
success: 1
file_date_updated: 2020-10-27T14:57:50Z
has_accepted_license: '1'
intvolume: ' 117'
isi: 1
issue: '40'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 25066-25073
pmid: 1
publication: Proceedings of the National Academy of Sciences of the United States
of America
publication_identifier:
eissn:
- '10916490'
issn:
- '00278424'
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: Learning probabilistic neural representations with randomly connected circuits
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 117
year: '2020'
...
---
_id: '8699'
abstract:
- lang: eng
text: In the high spin–orbit-coupled Sr2IrO4, the high sensitivity of the ground
state to the details of the local lattice structure shows a large potential for
the manipulation of the functional properties by inducing local lattice distortions.
We use epitaxial strain to modify the Ir–O bond geometry in Sr2IrO4 and perform
momentum-dependent resonant inelastic X-ray scattering (RIXS) at the metal and
at the ligand sites to unveil the response of the low-energy elementary excitations.
We observe that the pseudospin-wave dispersion for tensile-strained Sr2IrO4 films
displays large softening along the [h,0] direction, while along the [h,h] direction
it shows hardening. This evolution reveals a renormalization of the magnetic interactions
caused by a strain-driven cross-over from anisotropic to isotropic interactions
between the magnetic moments. Moreover, we detect dispersive electron–hole pair
excitations which shift to lower (higher) energies upon compressive (tensile)
strain, manifesting a reduction (increase) in the size of the charge gap. This
behavior shows an intimate coupling between charge excitations and lattice distortions
in Sr2IrO4, originating from the modified hopping elements between the t2g orbitals.
Our work highlights the central role played by the lattice degrees of freedom
in determining both the pseudospin and charge excitations of Sr2IrO4 and provides
valuable information toward the control of the ground state of complex oxides
in the presence of high spin–orbit coupling.
acknowledgement: 'We gratefully acknowledge C. Sahle for experimental support at the
ID20 beamline of the ESRF. The soft X-ray experiments were carried out at the ADRESS
beamline of the Swiss Light Source, Paul Scherrer Institut (PSI). E. Paris and T.S.
thank X. Lu and C. Monney for valuable discussions. The work at PSI is supported
by the Swiss National Science Foundation (SNSF) through Project 200021_178867, the
NCCR (National Centre of Competence in Research) MARVEL (Materials’ Revolution:
Computational Design and Discovery of Novel Materials) and the Sinergia network
Mott Physics Beyond the Heisenberg Model (MPBH) (SNSF Research Grants CRSII2_160765/1
and CRSII2_141962). K.W. acknowledges support by the Narodowe Centrum Nauki Projects
2016/22/E/ST3/00560 and 2016/23/B/ST3/00839. E.M.P. and M.N. acknowledge funding
from the European Union’s Horizon 2020 research and innovation programme under the
Marie Sklodowska-Curie Grant Agreements 754411 and 701647, respectively. M.R. was
supported by the Swiss National Science Foundation under Project 200021 – 182695.
This research used resources of the APS, a U.S. Department of Energy (DOE) Office
of Science User Facility operated for the DOE Office of Science by Argonne National
Laboratory under Contract DE-AC02-06CH11357.'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Eugenio
full_name: Paris, Eugenio
last_name: Paris
- first_name: Yi
full_name: Tseng, Yi
last_name: Tseng
- first_name: Ekaterina
full_name: Paerschke, Ekaterina
id: 8275014E-6063-11E9-9B7F-6338E6697425
last_name: Paerschke
orcid: 0000-0003-0853-8182
- first_name: Wenliang
full_name: Zhang, Wenliang
last_name: Zhang
- first_name: Mary H
full_name: Upton, Mary H
last_name: Upton
- first_name: Anna
full_name: Efimenko, Anna
last_name: Efimenko
- first_name: Katharina
full_name: Rolfs, Katharina
last_name: Rolfs
- first_name: Daniel E
full_name: McNally, Daniel E
last_name: McNally
- first_name: Laura
full_name: Maurel, Laura
last_name: Maurel
- first_name: Muntaser
full_name: Naamneh, Muntaser
last_name: Naamneh
- first_name: Marco
full_name: Caputo, Marco
last_name: Caputo
- first_name: Vladimir N
full_name: Strocov, Vladimir N
last_name: Strocov
- first_name: Zhiming
full_name: Wang, Zhiming
last_name: Wang
- first_name: Diego
full_name: Casa, Diego
last_name: Casa
- first_name: Christof W
full_name: Schneider, Christof W
last_name: Schneider
- first_name: Ekaterina
full_name: Pomjakushina, Ekaterina
last_name: Pomjakushina
- first_name: Krzysztof
full_name: Wohlfeld, Krzysztof
last_name: Wohlfeld
- first_name: Milan
full_name: Radovic, Milan
last_name: Radovic
- first_name: Thorsten
full_name: Schmitt, Thorsten
last_name: Schmitt
citation:
ama: Paris E, Tseng Y, Paerschke E, et al. Strain engineering of the charge and
spin-orbital interactions in Sr2IrO4. Proceedings of the National Academy of
Sciences of the United States of America. 2020;117(40):24764-24770. doi:10.1073/pnas.2012043117
apa: Paris, E., Tseng, Y., Paerschke, E., Zhang, W., Upton, M. H., Efimenko, A.,
… Schmitt, T. (2020). Strain engineering of the charge and spin-orbital interactions
in Sr2IrO4. Proceedings of the National Academy of Sciences of the United States
of America. National Academy of Sciences. https://doi.org/10.1073/pnas.2012043117
chicago: Paris, Eugenio, Yi Tseng, Ekaterina Paerschke, Wenliang Zhang, Mary H Upton,
Anna Efimenko, Katharina Rolfs, et al. “Strain Engineering of the Charge and Spin-Orbital
Interactions in Sr2IrO4.” Proceedings of the National Academy of Sciences of
the United States of America. National Academy of Sciences, 2020. https://doi.org/10.1073/pnas.2012043117.
ieee: E. Paris et al., “Strain engineering of the charge and spin-orbital
interactions in Sr2IrO4,” Proceedings of the National Academy of Sciences of
the United States of America, vol. 117, no. 40. National Academy of Sciences,
pp. 24764–24770, 2020.
ista: Paris E, Tseng Y, Paerschke E, Zhang W, Upton MH, Efimenko A, Rolfs K, McNally
DE, Maurel L, Naamneh M, Caputo M, Strocov VN, Wang Z, Casa D, Schneider CW, Pomjakushina
E, Wohlfeld K, Radovic M, Schmitt T. 2020. Strain engineering of the charge and
spin-orbital interactions in Sr2IrO4. Proceedings of the National Academy of Sciences
of the United States of America. 117(40), 24764–24770.
mla: Paris, Eugenio, et al. “Strain Engineering of the Charge and Spin-Orbital Interactions
in Sr2IrO4.” Proceedings of the National Academy of Sciences of the United
States of America, vol. 117, no. 40, National Academy of Sciences, 2020, pp.
24764–70, doi:10.1073/pnas.2012043117.
short: E. Paris, Y. Tseng, E. Paerschke, W. Zhang, M.H. Upton, A. Efimenko, K. Rolfs,
D.E. McNally, L. Maurel, M. Naamneh, M. Caputo, V.N. Strocov, Z. Wang, D. Casa,
C.W. Schneider, E. Pomjakushina, K. Wohlfeld, M. Radovic, T. Schmitt, Proceedings
of the National Academy of Sciences of the United States of America 117 (2020)
24764–24770.
date_created: 2020-10-25T23:01:17Z
date_published: 2020-10-06T00:00:00Z
date_updated: 2023-08-22T12:11:52Z
day: '06'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.1073/pnas.2012043117
ec_funded: 1
external_id:
arxiv:
- '2009.12262'
isi:
- '000579059100029'
pmid:
- '32958669'
file:
- access_level: open_access
checksum: 1638fa36b442e2868576c6dd7d6dc505
content_type: application/pdf
creator: cziletti
date_created: 2020-10-28T11:53:12Z
date_updated: 2020-10-28T11:53:12Z
file_id: '8715'
file_name: 2020_PNAS_Paris.pdf
file_size: 1176522
relation: main_file
success: 1
file_date_updated: 2020-10-28T11:53:12Z
has_accepted_license: '1'
intvolume: ' 117'
isi: 1
issue: '40'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 24764-24770
pmid: 1
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Proceedings of the National Academy of Sciences of the United States
of America
publication_identifier:
eissn:
- '10916490'
issn:
- '00278424'
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: Strain engineering of the charge and spin-orbital interactions in Sr2IrO4
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 117
year: '2020'
...
---
_id: '8703'
abstract:
- lang: eng
text: 'Even though Delaunay originally introduced his famous triangulations in the
case of infinite point sets with translational periodicity, a software that computes
such triangulations in the general case is not yet available, to the best of our
knowledge. Combining and generalizing previous work, we present a practical algorithm
for computing such triangulations. The algorithm has been implemented and experiments
show that its performance is as good as the one of the CGAL package, which is
restricted to cubic periodicity. '
alternative_title:
- LIPIcs
article_number: '75'
article_processing_charge: No
author:
- first_name: Georg F
full_name: Osang, Georg F
id: 464B40D6-F248-11E8-B48F-1D18A9856A87
last_name: Osang
orcid: 0000-0002-8882-5116
- first_name: Mael
full_name: Rouxel-Labbé, Mael
last_name: Rouxel-Labbé
- first_name: Monique
full_name: Teillaud, Monique
last_name: Teillaud
citation:
ama: 'Osang GF, Rouxel-Labbé M, Teillaud M. Generalizing CGAL periodic Delaunay
triangulations. In: 28th Annual European Symposium on Algorithms. Vol 173.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.ESA.2020.75'
apa: 'Osang, G. F., Rouxel-Labbé, M., & Teillaud, M. (2020). Generalizing CGAL
periodic Delaunay triangulations. In 28th Annual European Symposium on Algorithms
(Vol. 173). Virtual, Online; Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für
Informatik. https://doi.org/10.4230/LIPIcs.ESA.2020.75'
chicago: Osang, Georg F, Mael Rouxel-Labbé, and Monique Teillaud. “Generalizing
CGAL Periodic Delaunay Triangulations.” In 28th Annual European Symposium on
Algorithms, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
https://doi.org/10.4230/LIPIcs.ESA.2020.75.
ieee: G. F. Osang, M. Rouxel-Labbé, and M. Teillaud, “Generalizing CGAL periodic
Delaunay triangulations,” in 28th Annual European Symposium on Algorithms,
Virtual, Online; Pisa, Italy, 2020, vol. 173.
ista: 'Osang GF, Rouxel-Labbé M, Teillaud M. 2020. Generalizing CGAL periodic Delaunay
triangulations. 28th Annual European Symposium on Algorithms. ESA: Annual European
Symposium on Algorithms, LIPIcs, vol. 173, 75.'
mla: Osang, Georg F., et al. “Generalizing CGAL Periodic Delaunay Triangulations.”
28th Annual European Symposium on Algorithms, vol. 173, 75, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ESA.2020.75.
short: G.F. Osang, M. Rouxel-Labbé, M. Teillaud, in:, 28th Annual European Symposium
on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
conference:
end_date: 2020-09-09
location: Virtual, Online; Pisa, Italy
name: 'ESA: Annual European Symposium on Algorithms'
start_date: 2020-09-07
date_created: 2020-10-25T23:01:18Z
date_published: 2020-08-26T00:00:00Z
date_updated: 2023-09-07T13:29:00Z
day: '26'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.4230/LIPIcs.ESA.2020.75
ec_funded: 1
file:
- access_level: open_access
checksum: fe0f7c49a99ed870c671b911e10d5496
content_type: application/pdf
creator: cziletti
date_created: 2020-10-27T14:31:52Z
date_updated: 2020-10-27T14:31:52Z
file_id: '8712'
file_name: 2020_LIPIcs_Osang.pdf
file_size: 733291
relation: main_file
success: 1
file_date_updated: 2020-10-27T14:31:52Z
has_accepted_license: '1'
intvolume: ' 173'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
publication: 28th Annual European Symposium on Algorithms
publication_identifier:
isbn:
- '9783959771627'
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '9056'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Generalizing CGAL periodic Delaunay triangulations
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: 173
year: '2020'
...
---
_id: '8704'
abstract:
- lang: eng
text: Traditional robotic control suits require profound task-specific knowledge
for designing, building and testing control software. The rise of Deep Learning
has enabled end-to-end solutions to be learned entirely from data, requiring minimal
knowledge about the application area. We design a learning scheme to train end-to-end
linear dynamical systems (LDS)s by gradient descent in imitation learning robotic
domains. We introduce a new regularization loss component together with a learning
algorithm that improves the stability of the learned autonomous system, by forcing
the eigenvalues of the internal state updates of an LDS to be negative reals.
We evaluate our approach on a series of real-life and simulated robotic experiments,
in comparison to linear and nonlinear Recurrent Neural Network (RNN) architectures.
Our results show that our stabilizing method significantly improves test performance
of LDS, enabling such linear models to match the performance of contemporary nonlinear
RNN architectures. A video of the obstacle avoidance performance of our method
on a mobile robot, in unseen environments, compared to other methods can be viewed
at https://youtu.be/mhEsCoNao5E.
acknowledgement: M.L. is supported in parts by the Austrian Science Fund (FWF) under
grant Z211-N23 (Wittgenstein Award). R.H., and R.G. are partially supported by the
Horizon-2020 ECSELProject grant No. 783163 (iDev40), and the Austrian Research Promotion
Agency (FFG), Project No. 860424. R.H. and D.R. is partially supported by the Boeing
Company.
alternative_title:
- ICRA
article_processing_charge: No
author:
- first_name: Mathias
full_name: Lechner, Mathias
id: 3DC22916-F248-11E8-B48F-1D18A9856A87
last_name: Lechner
- first_name: Ramin
full_name: Hasani, Ramin
last_name: Hasani
- first_name: Daniela
full_name: Rus, Daniela
last_name: Rus
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
citation:
ama: 'Lechner M, Hasani R, Rus D, Grosu R. Gershgorin loss stabilizes the recurrent
neural network compartment of an end-to-end robot learning scheme. In: Proceedings
- IEEE International Conference on Robotics and Automation. IEEE; 2020:5446-5452.
doi:10.1109/ICRA40945.2020.9196608'
apa: 'Lechner, M., Hasani, R., Rus, D., & Grosu, R. (2020). Gershgorin loss
stabilizes the recurrent neural network compartment of an end-to-end robot learning
scheme. In Proceedings - IEEE International Conference on Robotics and Automation
(pp. 5446–5452). Paris, France: IEEE. https://doi.org/10.1109/ICRA40945.2020.9196608'
chicago: Lechner, Mathias, Ramin Hasani, Daniela Rus, and Radu Grosu. “Gershgorin
Loss Stabilizes the Recurrent Neural Network Compartment of an End-to-End Robot
Learning Scheme.” In Proceedings - IEEE International Conference on Robotics
and Automation, 5446–52. IEEE, 2020. https://doi.org/10.1109/ICRA40945.2020.9196608.
ieee: M. Lechner, R. Hasani, D. Rus, and R. Grosu, “Gershgorin loss stabilizes the
recurrent neural network compartment of an end-to-end robot learning scheme,”
in Proceedings - IEEE International Conference on Robotics and Automation,
Paris, France, 2020, pp. 5446–5452.
ista: 'Lechner M, Hasani R, Rus D, Grosu R. 2020. Gershgorin loss stabilizes the
recurrent neural network compartment of an end-to-end robot learning scheme. Proceedings
- IEEE International Conference on Robotics and Automation. ICRA: International
Conference on Robotics and Automation, ICRA, , 5446–5452.'
mla: Lechner, Mathias, et al. “Gershgorin Loss Stabilizes the Recurrent Neural Network
Compartment of an End-to-End Robot Learning Scheme.” Proceedings - IEEE International
Conference on Robotics and Automation, IEEE, 2020, pp. 5446–52, doi:10.1109/ICRA40945.2020.9196608.
short: M. Lechner, R. Hasani, D. Rus, R. Grosu, in:, Proceedings - IEEE International
Conference on Robotics and Automation, IEEE, 2020, pp. 5446–5452.
conference:
end_date: 2020-08-31
location: Paris, France
name: 'ICRA: International Conference on Robotics and Automation'
start_date: 2020-05-31
date_created: 2020-10-25T23:01:19Z
date_published: 2020-05-01T00:00:00Z
date_updated: 2023-08-22T10:40:15Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1109/ICRA40945.2020.9196608
external_id:
isi:
- '000712319503110'
file:
- access_level: open_access
checksum: fccf7b986ac78046918a298cc6849a50
content_type: application/pdf
creator: dernst
date_created: 2020-11-06T10:58:49Z
date_updated: 2020-11-06T10:58:49Z
file_id: '8733'
file_name: 2020_ICRA_Lechner.pdf
file_size: 1070010
relation: main_file
success: 1
file_date_updated: 2020-11-06T10:58:49Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 5446-5452
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: Proceedings - IEEE International Conference on Robotics and Automation
publication_identifier:
isbn:
- '9781728173955'
issn:
- '10504729'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Gershgorin loss stabilizes the recurrent neural network compartment of an end-to-end
robot learning scheme
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2020'
...
---
_id: '8705'
abstract:
- lang: eng
text: We consider the quantum mechanical many-body problem of a single impurity
particle immersed in a weakly interacting Bose gas. The impurity interacts with
the bosons via a two-body potential. We study the Hamiltonian of this system in
the mean-field limit and rigorously show that, at low energies, the problem is
well described by the Fröhlich polaron model.
acknowledgement: Financial support through the European Research Council (ERC) under
the European Union’s Horizon 2020 research and innovation programme Grant agreement
No. 694227 (R.S.) and the Maria Skłodowska-Curie Grant agreement No. 665386 (K.M.)
is gratefully acknowledged. Funding Open access funding provided by Institute of
Science and Technology (IST Austria)
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Krzysztof
full_name: Mysliwy, Krzysztof
id: 316457FC-F248-11E8-B48F-1D18A9856A87
last_name: Mysliwy
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Mysliwy K, Seiringer R. Microscopic derivation of the Fröhlich Hamiltonian
for the Bose polaron in the mean-field limit. Annales Henri Poincare. 2020;21(12):4003-4025.
doi:10.1007/s00023-020-00969-3
apa: Mysliwy, K., & Seiringer, R. (2020). Microscopic derivation of the Fröhlich
Hamiltonian for the Bose polaron in the mean-field limit. Annales Henri Poincare.
Springer Nature. https://doi.org/10.1007/s00023-020-00969-3
chicago: Mysliwy, Krzysztof, and Robert Seiringer. “Microscopic Derivation of the
Fröhlich Hamiltonian for the Bose Polaron in the Mean-Field Limit.” Annales
Henri Poincare. Springer Nature, 2020. https://doi.org/10.1007/s00023-020-00969-3.
ieee: K. Mysliwy and R. Seiringer, “Microscopic derivation of the Fröhlich Hamiltonian
for the Bose polaron in the mean-field limit,” Annales Henri Poincare,
vol. 21, no. 12. Springer Nature, pp. 4003–4025, 2020.
ista: Mysliwy K, Seiringer R. 2020. Microscopic derivation of the Fröhlich Hamiltonian
for the Bose polaron in the mean-field limit. Annales Henri Poincare. 21(12),
4003–4025.
mla: Mysliwy, Krzysztof, and Robert Seiringer. “Microscopic Derivation of the Fröhlich
Hamiltonian for the Bose Polaron in the Mean-Field Limit.” Annales Henri Poincare,
vol. 21, no. 12, Springer Nature, 2020, pp. 4003–25, doi:10.1007/s00023-020-00969-3.
short: K. Mysliwy, R. Seiringer, Annales Henri Poincare 21 (2020) 4003–4025.
date_created: 2020-10-25T23:01:19Z
date_published: 2020-12-01T00:00:00Z
date_updated: 2023-09-07T13:43:51Z
day: '01'
ddc:
- '530'
department:
- _id: RoSe
doi: 10.1007/s00023-020-00969-3
ec_funded: 1
external_id:
arxiv:
- '2003.12371'
isi:
- '000578111800002'
file:
- access_level: open_access
checksum: c12c9c1e6f08def245e42f3cb1d83827
content_type: application/pdf
creator: cziletti
date_created: 2020-10-27T12:49:04Z
date_updated: 2020-10-27T12:49:04Z
file_id: '8711'
file_name: 2020_Annales_Mysliwy.pdf
file_size: 469831
relation: main_file
success: 1
file_date_updated: 2020-10-27T12:49:04Z
has_accepted_license: '1'
intvolume: ' 21'
isi: 1
issue: '12'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 4003-4025
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: Annales Henri Poincare
publication_identifier:
issn:
- 1424-0637
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '11473'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Microscopic derivation of the Fröhlich Hamiltonian for the Bose polaron in
the mean-field limit
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 21
year: '2020'
...
---
_id: '8706'
abstract:
- lang: eng
text: As part of the Austrian Transition to Open Access (AT2OA) project, subproject
TP1-B is working on designing a monitoring solution for the output of Open Access
publications in Austria. This report on a potential Open Access monitoring approach
in Austria is one of the results of these efforts and can serve as a basis for
discussion on an international level.
- lang: ger
text: Als Teil des Hochschulraumstrukturmittel-Projekts Austrian Transition to Open
Access (AT2OA) befasst sich das Teilprojekt TP1-B mit der Konzeption einer Monitoring-Lösung
für den Open Access-Publikationsoutput in Österreich. Der nun vorliegende Bericht
zu einem potentiellen Open Access-Monitoring in Österreich ist eines der Ergebnisse
dieser Bemühungen und kann als Grundlage einer Diskussion auf internationaler
Ebene dienen.
article_processing_charge: No
article_type: original
author:
- first_name: Patrick
full_name: Danowski, Patrick
id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
last_name: Danowski
orcid: 0000-0002-6026-4409
- first_name: Andreas
full_name: Ferus, Andreas
last_name: Ferus
- first_name: Anna-Laetitia
full_name: Hikl, Anna-Laetitia
last_name: Hikl
- first_name: Gerda
full_name: McNeill, Gerda
last_name: McNeill
- first_name: Clemens
full_name: Miniberger, Clemens
last_name: Miniberger
- first_name: Steve
full_name: Reding, Steve
last_name: Reding
- first_name: Tobias
full_name: Zarka, Tobias
last_name: Zarka
- first_name: Michael
full_name: Zojer, Michael
last_name: Zojer
citation:
ama: Danowski P, Ferus A, Hikl A-L, et al. „Recommendation“ for the further procedure
for open access monitoring. Deliverable of the AT2OA subproject TP1-B. Mitteilungen
der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. 2020;73(2):278-284.
doi:10.31263/voebm.v73i2.3941
apa: Danowski, P., Ferus, A., Hikl, A.-L., McNeill, G., Miniberger, C., Reding,
S., … Zojer, M. (2020). „Recommendation“ for the further procedure for open access
monitoring. Deliverable of the AT2OA subproject TP1-B. Mitteilungen der Vereinigung
Österreichischer Bibliothekarinnen und Bibliothekare. Vereinigung Osterreichischer
Bibliothekarinnen und Bibliothekare. https://doi.org/10.31263/voebm.v73i2.3941
chicago: Danowski, Patrick, Andreas Ferus, Anna-Laetitia Hikl, Gerda McNeill, Clemens
Miniberger, Steve Reding, Tobias Zarka, and Michael Zojer. “„Recommendation“ for
the further procedure for open access monitoring. Deliverable of the AT2OA subproject
TP1-B.” Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und
Bibliothekare. Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare,
2020. https://doi.org/10.31263/voebm.v73i2.3941.
ieee: P. Danowski et al., “„Recommendation“ for the further procedure for
open access monitoring. Deliverable of the AT2OA subproject TP1-B,” Mitteilungen
der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, vol.
73, no. 2. Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare, pp.
278–284, 2020.
ista: Danowski P, Ferus A, Hikl A-L, McNeill G, Miniberger C, Reding S, Zarka T,
Zojer M. 2020. „Recommendation“ for the further procedure for open access monitoring.
Deliverable of the AT2OA subproject TP1-B. Mitteilungen der Vereinigung Österreichischer
Bibliothekarinnen und Bibliothekare. 73(2), 278–284.
mla: Danowski, Patrick, et al. “„Recommendation“ for the further procedure for open
access monitoring. Deliverable of the AT2OA subproject TP1-B.” Mitteilungen
der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, vol.
73, no. 2, Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare, 2020,
pp. 278–84, doi:10.31263/voebm.v73i2.3941.
short: P. Danowski, A. Ferus, A.-L. Hikl, G. McNeill, C. Miniberger, S. Reding,
T. Zarka, M. Zojer, Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen
und Bibliothekare 73 (2020) 278–284.
date_created: 2020-10-25T23:01:19Z
date_published: 2020-07-14T00:00:00Z
date_updated: 2021-01-12T08:20:40Z
day: '14'
ddc:
- '020'
department:
- _id: E-Lib
doi: 10.31263/voebm.v73i2.3941
file:
- access_level: open_access
checksum: 37443c34d91d5bdbeb38c78b14792537
content_type: application/pdf
creator: kschuh
date_created: 2020-10-27T16:27:25Z
date_updated: 2020-10-27T16:27:25Z
file_id: '8714'
file_name: 2020_VOEB_Danowski.pdf
file_size: 960317
relation: main_file
success: 1
file_date_updated: 2020-10-27T16:27:25Z
has_accepted_license: '1'
intvolume: ' 73'
issue: '2'
language:
- iso: ger
month: '07'
oa: 1
oa_version: Published Version
page: 278-284
publication: Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare
publication_identifier:
eissn:
- '10222588'
publication_status: published
publisher: Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare
quality_controlled: '1'
scopus_import: '1'
status: public
title: „Recommendation“ for the further procedure for open access monitoring. Deliverable
of the AT2OA subproject TP1-B
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: 73
year: '2020'
...
---
_id: '8721'
abstract:
- lang: eng
text: Spontaneously arising channels that transport the phytohormone auxin provide
positional cues for self-organizing aspects of plant development such as flexible
vasculature regeneration or its patterning during leaf venation. The auxin canalization
hypothesis proposes a feedback between auxin signaling and transport as the underlying
mechanism, but molecular players await discovery. We identified part of the machinery
that routes auxin transport. The auxin-regulated receptor CAMEL (Canalization-related
Auxin-regulated Malectin-type RLK) together with CANAR (Canalization-related Receptor-like
kinase) interact with and phosphorylate PIN auxin transporters. camel and canar
mutants are impaired in PIN1 subcellular trafficking and auxin-mediated PIN polarization,
which macroscopically manifests as defects in leaf venation and vasculature regeneration
after wounding. The CAMEL-CANAR receptor complex is part of the auxin feedback
that coordinates polarization of individual cells during auxin canalization.
acknowledged_ssus:
- _id: Bio
- _id: LifeSc
acknowledgement: 'We acknowledge M. Glanc and Y. Zhang for providing entryclones;
Vienna Biocenter Core Facilities (VBCF) for recombinantprotein production and purification;
Vienna Biocenter Massspectrometry Facility, Bioimaging, and Life Science Facilities
at IST Austria and Proteomics Core Facility CEITEC for a great assistance.Funding:This
project received funding from the European Research Council (ERC) under the European
Union’s Horizon 2020 research and innovation program (grant agreement 742985) and
Austrian Science Fund (FWF): I 3630-B25 to J.F.and by grants from the Austrian Academy
of Science through the Gregor Mendel Institute (Y.B.) and the Austrian Agency for
International Cooperation in Education and Research (D.D.); the Netherlands Organization
for Scientific Research (NWO; VIDI-864.13.001) (W.S.); the Research Foundation–Flanders
(FWO;Odysseus II G0D0515N) and a European Research Council grant (ERC; StG TORPEDO;
714055) to B.D.R., B.Y., and E.M.; and the Hertha Firnberg Programme postdoctoral
fellowship (T-947) from the FWF Austrian Science Fund to E.S.-L.; J.H. is the recipient
of a DOC Fellowship of the Austrian Academy of Sciences at IST Austria.'
article_processing_charge: No
article_type: original
author:
- first_name: Jakub
full_name: Hajny, Jakub
id: 4800CC20-F248-11E8-B48F-1D18A9856A87
last_name: Hajny
orcid: 0000-0003-2140-7195
- first_name: Tomas
full_name: Prat, Tomas
id: 3DA3BFEE-F248-11E8-B48F-1D18A9856A87
last_name: Prat
- first_name: N
full_name: Rydza, N
last_name: Rydza
- first_name: Lesia
full_name: Rodriguez Solovey, Lesia
id: 3922B506-F248-11E8-B48F-1D18A9856A87
last_name: Rodriguez Solovey
orcid: 0000-0002-7244-7237
- first_name: Shutang
full_name: Tan, Shutang
id: 2DE75584-F248-11E8-B48F-1D18A9856A87
last_name: Tan
orcid: 0000-0002-0471-8285
- first_name: Inge
full_name: Verstraeten, Inge
id: 362BF7FE-F248-11E8-B48F-1D18A9856A87
last_name: Verstraeten
orcid: 0000-0001-7241-2328
- first_name: David
full_name: Domjan, David
id: C684CD7A-257E-11EA-9B6F-D8588B4F947F
last_name: Domjan
orcid: 0000-0003-2267-106X
- first_name: E
full_name: Mazur, E
last_name: Mazur
- first_name: E
full_name: Smakowska-Luzan, E
last_name: Smakowska-Luzan
- first_name: W
full_name: Smet, W
last_name: Smet
- first_name: E
full_name: Mor, E
last_name: Mor
- first_name: J
full_name: Nolf, J
last_name: Nolf
- first_name: B
full_name: Yang, B
last_name: Yang
- first_name: W
full_name: Grunewald, W
last_name: Grunewald
- first_name: Gergely
full_name: Molnar, Gergely
id: 34F1AF46-F248-11E8-B48F-1D18A9856A87
last_name: Molnar
- first_name: Y
full_name: Belkhadir, Y
last_name: Belkhadir
- first_name: B
full_name: De Rybel, B
last_name: De Rybel
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Hajny J, Prat T, Rydza N, et al. Receptor kinase module targets PIN-dependent
auxin transport during canalization. Science. 2020;370(6516):550-557. doi:10.1126/science.aba3178
apa: Hajny, J., Prat, T., Rydza, N., Rodriguez Solovey, L., Tan, S., Verstraeten,
I., … Friml, J. (2020). Receptor kinase module targets PIN-dependent auxin transport
during canalization. Science. American Association for the Advancement
of Science. https://doi.org/10.1126/science.aba3178
chicago: Hajny, Jakub, Tomas Prat, N Rydza, Lesia Rodriguez Solovey, Shutang Tan,
Inge Verstraeten, David Domjan, et al. “Receptor Kinase Module Targets PIN-Dependent
Auxin Transport during Canalization.” Science. American Association for
the Advancement of Science, 2020. https://doi.org/10.1126/science.aba3178.
ieee: J. Hajny et al., “Receptor kinase module targets PIN-dependent auxin
transport during canalization,” Science, vol. 370, no. 6516. American Association
for the Advancement of Science, pp. 550–557, 2020.
ista: Hajny J, Prat T, Rydza N, Rodriguez Solovey L, Tan S, Verstraeten I, Domjan
D, Mazur E, Smakowska-Luzan E, Smet W, Mor E, Nolf J, Yang B, Grunewald W, Molnar
G, Belkhadir Y, De Rybel B, Friml J. 2020. Receptor kinase module targets PIN-dependent
auxin transport during canalization. Science. 370(6516), 550–557.
mla: Hajny, Jakub, et al. “Receptor Kinase Module Targets PIN-Dependent Auxin Transport
during Canalization.” Science, vol. 370, no. 6516, American Association
for the Advancement of Science, 2020, pp. 550–57, doi:10.1126/science.aba3178.
short: J. Hajny, T. Prat, N. Rydza, L. Rodriguez Solovey, S. Tan, I. Verstraeten,
D. Domjan, E. Mazur, E. Smakowska-Luzan, W. Smet, E. Mor, J. Nolf, B. Yang, W.
Grunewald, G. Molnar, Y. Belkhadir, B. De Rybel, J. Friml, Science 370 (2020)
550–557.
date_created: 2020-11-02T10:04:46Z
date_published: 2020-10-30T00:00:00Z
date_updated: 2023-09-05T12:02:35Z
day: '30'
department:
- _id: JiFr
doi: 10.1126/science.aba3178
ec_funded: 1
external_id:
isi:
- '000583031800041'
pmid:
- '33122378'
intvolume: ' 370'
isi: 1
issue: '6516'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://europepmc.org/article/MED/33122378#free-full-text
month: '10'
oa: 1
oa_version: Published Version
page: 550-557
pmid: 1
project:
- _id: 261099A6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '742985'
name: Tracing Evolution of Auxin Transport and Polarity in Plants
- _id: 26538374-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I03630
name: Molecular mechanisms of endocytic cargo recognition in plants
- _id: 2699E3D2-B435-11E9-9278-68D0E5697425
grant_number: '25239'
name: Cell surface receptor complexes for PIN polarity and auxin-mediated development
publication: Science
publication_identifier:
eissn:
- 1095-9203
issn:
- 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/molecular-compass-for-cell-orientation/
scopus_import: '1'
status: public
title: Receptor kinase module targets PIN-dependent auxin transport during canalization
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 370
year: '2020'
...
---
_id: '8722'
abstract:
- lang: eng
text: "Load imbalance pervasively exists in distributed deep learning training systems,
either caused by the inherent imbalance in learned tasks or by the system itself.
Traditional synchronous Stochastic Gradient Descent (SGD)\r\nachieves good accuracy
for a wide variety of tasks, but relies on global synchronization to accumulate
the gradients at every training step. In this paper, we propose eager-SGD, which
relaxes the global synchronization for\r\ndecentralized accumulation. To implement
eager-SGD, we propose to use two partial collectives: solo and majority. With
solo allreduce, the faster processes contribute their gradients eagerly without
waiting for the slower processes, whereas with majority allreduce, at least half
of the participants must contribute gradients before continuing, all without using
a central parameter server. We theoretically prove the convergence of the algorithms
and describe the partial collectives in detail. Experimental results on load-imbalanced
environments (CIFAR-10, ImageNet, and UCF101 datasets) show\r\nthat eager-SGD
achieves 1.27x speedup over the state-of-the-art synchronous SGD, without losing
accuracy."
article_processing_charge: No
arxiv: 1
author:
- first_name: Shigang
full_name: Li, Shigang
last_name: Li
- first_name: Tal Ben-Nun
full_name: Tal Ben-Nun, Tal Ben-Nun
last_name: Tal Ben-Nun
- first_name: Salvatore Di
full_name: Girolamo, Salvatore Di
last_name: Girolamo
- 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: Torsten
full_name: Hoefler, Torsten
last_name: Hoefler
citation:
ama: 'Li S, Tal Ben-Nun TB-N, Girolamo SD, Alistarh D-A, Hoefler T. Taming unbalanced
training workloads in deep learning with partial collective operations. In: Proceedings
of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming.
Association for Computing Machinery; 2020:45-61. doi:10.1145/3332466.3374528'
apa: 'Li, S., Tal Ben-Nun, T. B.-N., Girolamo, S. D., Alistarh, D.-A., & Hoefler,
T. (2020). Taming unbalanced training workloads in deep learning with partial
collective operations. In Proceedings of the 25th ACM SIGPLAN Symposium on
Principles and Practice of Parallel Programming (pp. 45–61). San Diego, CA,
United States: Association for Computing Machinery. https://doi.org/10.1145/3332466.3374528'
chicago: Li, Shigang, Tal Ben-Nun Tal Ben-Nun, Salvatore Di Girolamo, Dan-Adrian
Alistarh, and Torsten Hoefler. “Taming Unbalanced Training Workloads in Deep Learning
with Partial Collective Operations.” In Proceedings of the 25th ACM SIGPLAN
Symposium on Principles and Practice of Parallel Programming, 45–61. Association
for Computing Machinery, 2020. https://doi.org/10.1145/3332466.3374528.
ieee: S. Li, T. B.-N. Tal Ben-Nun, S. D. Girolamo, D.-A. Alistarh, and T. Hoefler,
“Taming unbalanced training workloads in deep learning with partial collective
operations,” in Proceedings of the 25th ACM SIGPLAN Symposium on Principles
and Practice of Parallel Programming, San Diego, CA, United States, 2020,
pp. 45–61.
ista: 'Li S, Tal Ben-Nun TB-N, Girolamo SD, Alistarh D-A, Hoefler T. 2020. Taming
unbalanced training workloads in deep learning with partial collective operations.
Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel
Programming. PPoPP: Sympopsium on Principles and Practice of Parallel Programming,
45–61.'
mla: Li, Shigang, et al. “Taming Unbalanced Training Workloads in Deep Learning
with Partial Collective Operations.” Proceedings of the 25th ACM SIGPLAN Symposium
on Principles and Practice of Parallel Programming, Association for Computing
Machinery, 2020, pp. 45–61, doi:10.1145/3332466.3374528.
short: S. Li, T.B.-N. Tal Ben-Nun, S.D. Girolamo, D.-A. Alistarh, T. Hoefler, in:,
Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel
Programming, Association for Computing Machinery, 2020, pp. 45–61.
conference:
end_date: 2020-02-26
location: San Diego, CA, United States
name: 'PPoPP: Sympopsium on Principles and Practice of Parallel Programming'
start_date: 2020-02-22
date_created: 2020-11-05T15:25:30Z
date_published: 2020-02-01T00:00:00Z
date_updated: 2023-08-22T12:13:48Z
day: '01'
department:
- _id: DaAl
doi: 10.1145/3332466.3374528
ec_funded: 1
external_id:
arxiv:
- '1908.04207'
isi:
- '000564476500004'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1908.04207
month: '02'
oa: 1
oa_version: Preprint
page: 45-61
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice
of Parallel Programming
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
status: public
title: Taming unbalanced training workloads in deep learning with partial collective
operations
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2020'
...
---
_id: '8724'
abstract:
- lang: eng
text: "We study the problem of learning from multiple untrusted data sources, a
scenario of increasing practical relevance given the recent emergence of crowdsourcing
and collaborative learning paradigms. Specifically, we analyze the situation in
which a learning system obtains datasets from multiple sources, some of which
might be biased or even adversarially perturbed. It is\r\nknown that in the single-source
case, an adversary with the power to corrupt a fixed fraction of the training
data can prevent PAC-learnability, that is, even in the limit of infinitely much
training data, no learning system can approach the optimal test error. In this
work we show that, surprisingly, the same is not true in the multi-source setting,
where the adversary can arbitrarily\r\ncorrupt a fixed fraction of the data sources.
Our main results are a generalization bound that provides finite-sample guarantees
for this learning setting, as well as corresponding lower bounds. Besides establishing
PAC-learnability our results also show that in a cooperative learning setting
sharing data with other parties has provable benefits, even if some\r\nparticipants
are malicious. "
acknowledged_ssus:
- _id: ScienComp
acknowledgement: Dan Alistarh is supported in part by the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(grant agreement No 805223 ScaleML). This research was supported by the Scientific
Service Units (SSU) of IST Austria through resources provided by Scientific Computing
(SciComp).
article_processing_charge: No
arxiv: 1
author:
- first_name: Nikola H
full_name: Konstantinov, Nikola H
id: 4B9D76E4-F248-11E8-B48F-1D18A9856A87
last_name: Konstantinov
- first_name: Elias
full_name: Frantar, Elias
id: 09a8f98d-ec99-11ea-ae11-c063a7b7fe5f
last_name: Frantar
- 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: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Konstantinov NH, Frantar E, Alistarh D-A, Lampert C. On the sample complexity
of adversarial multi-source PAC learning. In: Proceedings of the 37th International
Conference on Machine Learning. Vol 119. ML Research Press; 2020:5416-5425.'
apa: 'Konstantinov, N. H., Frantar, E., Alistarh, D.-A., & Lampert, C. (2020).
On the sample complexity of adversarial multi-source PAC learning. In Proceedings
of the 37th International Conference on Machine Learning (Vol. 119, pp. 5416–5425).
Online: ML Research Press.'
chicago: Konstantinov, Nikola H, Elias Frantar, Dan-Adrian Alistarh, and Christoph
Lampert. “On the Sample Complexity of Adversarial Multi-Source PAC Learning.”
In Proceedings of the 37th International Conference on Machine Learning,
119:5416–25. ML Research Press, 2020.
ieee: N. H. Konstantinov, E. Frantar, D.-A. Alistarh, and C. Lampert, “On the sample
complexity of adversarial multi-source PAC learning,” in Proceedings of the
37th International Conference on Machine Learning, Online, 2020, vol. 119,
pp. 5416–5425.
ista: 'Konstantinov NH, Frantar E, Alistarh D-A, Lampert C. 2020. On the sample
complexity of adversarial multi-source PAC learning. Proceedings of the 37th International
Conference on Machine Learning. ICML: International Conference on Machine Learning
vol. 119, 5416–5425.'
mla: Konstantinov, Nikola H., et al. “On the Sample Complexity of Adversarial Multi-Source
PAC Learning.” Proceedings of the 37th International Conference on Machine
Learning, vol. 119, ML Research Press, 2020, pp. 5416–25.
short: N.H. Konstantinov, E. Frantar, D.-A. Alistarh, C. Lampert, in:, Proceedings
of the 37th International Conference on Machine Learning, ML Research Press, 2020,
pp. 5416–5425.
conference:
end_date: 2020-07-18
location: Online
name: 'ICML: International Conference on Machine Learning'
start_date: 2020-07-12
date_created: 2020-11-05T15:25:58Z
date_published: 2020-07-12T00:00:00Z
date_updated: 2023-09-07T13:42:08Z
day: '12'
ddc:
- '000'
department:
- _id: DaAl
- _id: ChLa
ec_funded: 1
external_id:
arxiv:
- '2002.10384'
file:
- access_level: open_access
checksum: cc755d0054bc4b2be778ea7aa7884d2f
content_type: application/pdf
creator: dernst
date_created: 2021-02-15T09:00:01Z
date_updated: 2021-02-15T09:00:01Z
file_id: '9120'
file_name: 2020_PMLR_Konstantinov.pdf
file_size: 281286
relation: main_file
success: 1
file_date_updated: 2021-02-15T09:00:01Z
has_accepted_license: '1'
intvolume: ' 119'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 5416-5425
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: Proceedings of the 37th International Conference on Machine Learning
publication_identifier:
issn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
related_material:
link:
- relation: supplementary_material
url: http://proceedings.mlr.press/v119/konstantinov20a/konstantinov20a-supp.pdf
record:
- id: '10799'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: On the sample complexity of adversarial multi-source PAC learning
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 119
year: '2020'
...
---
_id: '8725'
abstract:
- lang: eng
text: "The design and implementation of efficient concurrent data structures have\r\nseen
significant attention. However, most of this work has focused on\r\nconcurrent
data structures providing good \\emph{worst-case} guarantees. In real\r\nworkloads,
objects are often accessed at different rates, since access\r\ndistributions may
be non-uniform. Efficient distribution-adaptive data\r\nstructures are known in
the sequential case, e.g. the splay-trees; however,\r\nthey often are hard to
translate efficiently in the concurrent case.\r\n In this paper, we investigate
distribution-adaptive concurrent data\r\nstructures and propose a new design called
the splay-list. At a high level, the\r\nsplay-list is similar to a standard skip-list,
with the key distinction that\r\nthe height of each element adapts dynamically
to its access rate: popular\r\nelements ``move up,'' whereas rarely-accessed elements
decrease in height. We\r\nshow that the splay-list provides order-optimal amortized
complexity bounds for\r\na subset of operations while being amenable to efficient
concurrent\r\nimplementation. Experimental results show that the splay-list can
leverage\r\ndistribution-adaptivity to improve on the performance of classic concurrent\r\ndesigns,
and can outperform the only previously-known distribution-adaptive\r\ndesign in
certain settings."
acknowledgement: "Vitaly Aksenov: Government of Russian Federation (Grant 08-08).\r\nDan
Alistarh: ERC Starting Grant 805223 ScaleML."
article_processing_charge: No
arxiv: 1
author:
- first_name: Vitaly
full_name: Aksenov, Vitaly
last_name: Aksenov
- 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: Alexandra
full_name: Drozdova, Alexandra
last_name: Drozdova
- first_name: Amirkeivan
full_name: Mohtashami, Amirkeivan
last_name: Mohtashami
citation:
ama: 'Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. The splay-list: A distribution-adaptive
concurrent skip-list. In: 34th International Symposium on Distributed Computing.
Vol 179. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020:3:1-3:18.
doi:10.4230/LIPIcs.DISC.2020.3'
apa: 'Aksenov, V., Alistarh, D.-A., Drozdova, A., & Mohtashami, A. (2020). The
splay-list: A distribution-adaptive concurrent skip-list. In 34th International
Symposium on Distributed Computing (Vol. 179, p. 3:1-3:18). Freiburg, Germany:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2020.3'
chicago: 'Aksenov, Vitaly, Dan-Adrian Alistarh, Alexandra Drozdova, and Amirkeivan
Mohtashami. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.” In
34th International Symposium on Distributed Computing, 179:3:1-3:18. LIPIcs.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.DISC.2020.3.'
ieee: 'V. Aksenov, D.-A. Alistarh, A. Drozdova, and A. Mohtashami, “The splay-list:
A distribution-adaptive concurrent skip-list,” in 34th International Symposium
on Distributed Computing, Freiburg, Germany, 2020, vol. 179, p. 3:1-3:18.'
ista: 'Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. 2020. The splay-list:
A distribution-adaptive concurrent skip-list. 34th International Symposium on
Distributed Computing. DISC: Symposium on Distributed ComputingLIPIcs vol. 179,
3:1-3:18.'
mla: 'Aksenov, Vitaly, et al. “The Splay-List: A Distribution-Adaptive Concurrent
Skip-List.” 34th International Symposium on Distributed Computing, vol.
179, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 3:1-3:18, doi:10.4230/LIPIcs.DISC.2020.3.'
short: V. Aksenov, D.-A. Alistarh, A. Drozdova, A. Mohtashami, in:, 34th International
Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2020, p. 3:1-3:18.
conference:
end_date: 2020-10-16
location: Freiburg, Germany
name: 'DISC: Symposium on Distributed Computing'
start_date: 2020-10-12
date_created: 2020-11-05T15:26:17Z
date_published: 2020-08-03T00:00:00Z
date_updated: 2023-02-23T13:41:40Z
day: '03'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.4230/LIPIcs.DISC.2020.3
ec_funded: 1
external_id:
arxiv:
- '2008.01009'
file:
- access_level: open_access
checksum: a626a9c47df52b6f6d97edd910dae4ba
content_type: application/pdf
creator: dernst
date_created: 2021-03-11T12:33:35Z
date_updated: 2021-03-11T12:33:35Z
file_id: '9237'
file_name: 2020_LIPIcs_Aksenov.pdf
file_size: 740358
relation: main_file
success: 1
file_date_updated: 2021-03-11T12:33:35Z
has_accepted_license: '1'
intvolume: ' 179'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 3:1-3:18
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: 34th International Symposium on Distributed Computing
publication_identifier:
isbn:
- '9783959771689'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
series_title: LIPIcs
status: public
title: 'The splay-list: A distribution-adaptive concurrent skip-list'
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: '8726'
abstract:
- lang: eng
text: Several realistic spin-orbital models for transition metal oxides go beyond
the classical expectations and could be understood only by employing the quantum
entanglement. Experiments on these materials confirm that spin-orbital entanglement
has measurable consequences. Here, we capture the essential features of spin-orbital
entanglement in complex quantum matter utilizing 1D spin-orbital model which accommodates
SU(2)⊗SU(2) symmetric Kugel-Khomskii superexchange as well as the Ising on-site
spin-orbit coupling. Building on the results obtained for full and effective models
in the regime of strong spin-orbit coupling, we address the question whether the
entanglement found on superexchange bonds always increases when the Ising spin-orbit
coupling is added. We show that (i) quantum entanglement is amplified by strong
spin-orbit coupling and, surprisingly, (ii) almost classical disentangled states
are possible. We complete the latter case by analyzing how the entanglement existing
for intermediate values of spin-orbit coupling can disappear for higher values
of this coupling.
article_number: '53'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Dorota
full_name: Gotfryd, Dorota
last_name: Gotfryd
- first_name: Ekaterina
full_name: Paerschke, Ekaterina
id: 8275014E-6063-11E9-9B7F-6338E6697425
last_name: Paerschke
orcid: 0000-0003-0853-8182
- first_name: Krzysztof
full_name: Wohlfeld, Krzysztof
last_name: Wohlfeld
- first_name: Andrzej M.
full_name: Oleś, Andrzej M.
last_name: Oleś
citation:
ama: Gotfryd D, Paerschke E, Wohlfeld K, Oleś AM. Evolution of spin-orbital entanglement
with increasing ising spin-orbit coupling. Condensed Matter. 2020;5(3).
doi:10.3390/condmat5030053
apa: Gotfryd, D., Paerschke, E., Wohlfeld, K., & Oleś, A. M. (2020). Evolution
of spin-orbital entanglement with increasing ising spin-orbit coupling. Condensed
Matter. MDPI. https://doi.org/10.3390/condmat5030053
chicago: Gotfryd, Dorota, Ekaterina Paerschke, Krzysztof Wohlfeld, and Andrzej M.
Oleś. “Evolution of Spin-Orbital Entanglement with Increasing Ising Spin-Orbit
Coupling.” Condensed Matter. MDPI, 2020. https://doi.org/10.3390/condmat5030053.
ieee: D. Gotfryd, E. Paerschke, K. Wohlfeld, and A. M. Oleś, “Evolution of spin-orbital
entanglement with increasing ising spin-orbit coupling,” Condensed Matter,
vol. 5, no. 3. MDPI, 2020.
ista: Gotfryd D, Paerschke E, Wohlfeld K, Oleś AM. 2020. Evolution of spin-orbital
entanglement with increasing ising spin-orbit coupling. Condensed Matter. 5(3),
53.
mla: Gotfryd, Dorota, et al. “Evolution of Spin-Orbital Entanglement with Increasing
Ising Spin-Orbit Coupling.” Condensed Matter, vol. 5, no. 3, 53, MDPI,
2020, doi:10.3390/condmat5030053.
short: D. Gotfryd, E. Paerschke, K. Wohlfeld, A.M. Oleś, Condensed Matter 5 (2020).
date_created: 2020-11-06T07:21:00Z
date_published: 2020-08-26T00:00:00Z
date_updated: 2021-01-12T08:20:46Z
day: '26'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.3390/condmat5030053
ec_funded: 1
external_id:
arxiv:
- '2009.11773'
file:
- access_level: open_access
checksum: a57a698ff99a11b6665bafd1bac7afbc
content_type: application/pdf
creator: dernst
date_created: 2020-11-06T07:24:40Z
date_updated: 2020-11-06T07:24:40Z
file_id: '8727'
file_name: 2020_CondensedMatter_Gotfryd.pdf
file_size: 768336
relation: main_file
success: 1
file_date_updated: 2020-11-06T07:24:40Z
has_accepted_license: '1'
intvolume: ' 5'
issue: '3'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Condensed Matter
publication_identifier:
issn:
- 2410-3896
publication_status: published
publisher: MDPI
quality_controlled: '1'
scopus_import: '1'
status: public
title: Evolution of spin-orbital entanglement with increasing ising spin-orbit coupling
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: 5
year: '2020'
...
---
_id: '8728'
abstract:
- lang: eng
text: Discrete-time Markov Chains (MCs) and Markov Decision Processes (MDPs) are
two standard formalisms in system analysis. Their main associated quantitative
objectives are hitting probabilities, discounted sum, and mean payoff. Although
there are many techniques for computing these objectives in general MCs/MDPs,
they have not been thoroughly studied in terms of parameterized algorithms, particularly
when treewidth is used as the parameter. This is in sharp contrast to qualitative
objectives for MCs, MDPs and graph games, for which treewidth-based algorithms
yield significant complexity improvements. In this work, we show that treewidth
can also be used to obtain faster algorithms for the quantitative problems. For
an MC with n states and m transitions, we show that each of the classical quantitative
objectives can be computed in O((n+m)⋅t2) time, given a tree decomposition
of the MC with width t. Our results also imply a bound of O(κ⋅(n+m)⋅t2) for
each objective on MDPs, where κ is the number of strategy-iteration refinements
required for the given input and objective. Finally, we make an experimental evaluation
of our new algorithms on low-treewidth MCs and MDPs obtained from the DaCapo benchmark
suite. Our experiments show that on low-treewidth MCs and MDPs, our algorithms
outperform existing well-established methods by one or more orders of magnitude.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Ali
full_name: Asadi, Ali
last_name: Asadi
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Kiarash
full_name: Mohammadi, Kiarash
last_name: Mohammadi
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: 'Asadi A, Chatterjee K, Goharshady AK, Mohammadi K, Pavlogiannis A. Faster
algorithms for quantitative analysis of MCs and MDPs with small treewidth. In:
Automated Technology for Verification and Analysis. Vol 12302. Springer
Nature; 2020:253-270. doi:10.1007/978-3-030-59152-6_14'
apa: 'Asadi, A., Chatterjee, K., Goharshady, A. K., Mohammadi, K., & Pavlogiannis,
A. (2020). Faster algorithms for quantitative analysis of MCs and MDPs with small
treewidth. In Automated Technology for Verification and Analysis (Vol.
12302, pp. 253–270). Hanoi, Vietnam: Springer Nature. https://doi.org/10.1007/978-3-030-59152-6_14'
chicago: Asadi, Ali, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi,
and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Analysis of MCs
and MDPs with Small Treewidth.” In Automated Technology for Verification and
Analysis, 12302:253–70. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-59152-6_14.
ieee: A. Asadi, K. Chatterjee, A. K. Goharshady, K. Mohammadi, and A. Pavlogiannis,
“Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth,”
in Automated Technology for Verification and Analysis, Hanoi, Vietnam,
2020, vol. 12302, pp. 253–270.
ista: 'Asadi A, Chatterjee K, Goharshady AK, Mohammadi K, Pavlogiannis A. 2020.
Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth.
Automated Technology for Verification and Analysis. ATVA: Automated Technology
for Verification and Analysis, LNCS, vol. 12302, 253–270.'
mla: Asadi, Ali, et al. “Faster Algorithms for Quantitative Analysis of MCs and
MDPs with Small Treewidth.” Automated Technology for Verification and Analysis,
vol. 12302, Springer Nature, 2020, pp. 253–70, doi:10.1007/978-3-030-59152-6_14.
short: A. Asadi, K. Chatterjee, A.K. Goharshady, K. Mohammadi, A. Pavlogiannis,
in:, Automated Technology for Verification and Analysis, Springer Nature, 2020,
pp. 253–270.
conference:
end_date: 2020-10-23
location: Hanoi, Vietnam
name: 'ATVA: Automated Technology for Verification and Analysis'
start_date: 2020-10-19
date_created: 2020-11-06T07:30:05Z
date_published: 2020-10-12T00:00:00Z
date_updated: 2025-06-02T08:53:43Z
day: '12'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-030-59152-6_14
external_id:
isi:
- '000723555700014'
file:
- access_level: open_access
checksum: ae83f27e5b189d5abc2e7514f1b7e1b5
content_type: application/pdf
creator: dernst
date_created: 2020-11-06T07:41:03Z
date_updated: 2020-11-06T07:41:03Z
file_id: '8729'
file_name: 2020_LNCS_ATVA_Asadi_accepted.pdf
file_size: 726648
relation: main_file
success: 1
file_date_updated: 2020-11-06T07:41:03Z
has_accepted_license: '1'
intvolume: ' 12302'
isi: 1
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 253-270
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 267066CE-B435-11E9-9278-68D0E5697425
name: Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies
publication: Automated Technology for Verification and Analysis
publication_identifier:
eisbn:
- '9783030591526'
eissn:
- 1611-3349
isbn:
- '9783030591519'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 12302
year: '2020'
...