---
OA_place: publisher
OA_type: free access
_id: '8271'
acknowledgement: We thank Dr. Gai Huang for his comments and help. We apologize to
authors whose work could not be cited due to space limitation. No conflict of interest
declared.
article_processing_charge: No
article_type: original
author:
- first_name: Peng
full_name: He, Peng
last_name: He
- first_name: Yuzhou
full_name: Zhang, Yuzhou
id: 3B6137F2-F248-11E8-B48F-1D18A9856A87
last_name: Zhang
orcid: 0000-0003-2627-6956
- first_name: Guanghui
full_name: Xiao, Guanghui
last_name: Xiao
citation:
ama: He P, Zhang Y, Xiao G. Origin of a subgenome and genome evolution of allotetraploid
cotton species. Molecular Plant. 2020;13(9):1238-1240. doi:10.1016/j.molp.2020.07.006
apa: He, P., Zhang, Y., & Xiao, G. (2020). Origin of a subgenome and genome
evolution of allotetraploid cotton species. Molecular Plant. Elsevier.
https://doi.org/10.1016/j.molp.2020.07.006
chicago: He, Peng, Yuzhou Zhang, and Guanghui Xiao. “Origin of a Subgenome and Genome
Evolution of Allotetraploid Cotton Species.” Molecular Plant. Elsevier,
2020. https://doi.org/10.1016/j.molp.2020.07.006.
ieee: P. He, Y. Zhang, and G. Xiao, “Origin of a subgenome and genome evolution
of allotetraploid cotton species,” Molecular Plant, vol. 13, no. 9. Elsevier,
pp. 1238–1240, 2020.
ista: He P, Zhang Y, Xiao G. 2020. Origin of a subgenome and genome evolution of
allotetraploid cotton species. Molecular Plant. 13(9), 1238–1240.
mla: He, Peng, et al. “Origin of a Subgenome and Genome Evolution of Allotetraploid
Cotton Species.” Molecular Plant, vol. 13, no. 9, Elsevier, 2020, pp. 1238–40,
doi:10.1016/j.molp.2020.07.006.
short: P. He, Y. Zhang, G. Xiao, Molecular Plant 13 (2020) 1238–1240.
date_created: 2020-08-16T22:00:57Z
date_published: 2020-09-07T00:00:00Z
date_updated: 2025-06-25T07:51:18Z
day: '07'
department:
- _id: JiFr
doi: 10.1016/j.molp.2020.07.006
external_id:
isi:
- '000566895400007'
pmid:
- '32688032'
intvolume: ' 13'
isi: 1
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.molp.2020.07.006
month: '09'
oa: 1
oa_version: Published Version
page: 1238-1240
pmid: 1
publication: Molecular Plant
publication_identifier:
eissn:
- 1752-9867
issn:
- 1674-2052
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Origin of a subgenome and genome evolution of allotetraploid cotton species
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2020'
...
---
_id: '8285'
abstract:
- lang: eng
text: We demonstrate the utility of optical cavity generated spin-squeezed states
in free space atomic fountain clocks in ensembles of 390 000 87Rb atoms. Fluorescence
imaging, correlated to an initial quantum nondemolition measurement, is used for
population spectroscopy after the atoms are released from a confining lattice.
For a free fall time of 4 milliseconds, we resolve a single-shot phase sensitivity
of 814(61) microradians, which is 5.8(0.6) decibels (dB) below the quantum projection
limit. We observe that this squeezing is preserved as the cloud expands to a roughly
200 μm radius and falls roughly 300 μm in free space. Ramsey spectroscopy with
240 000 atoms at a 3.6 ms Ramsey time results in a single-shot fractional frequency
stability of 8.4(0.2)×10−12, 3.8(0.2) dB below the quantum projection limit. The
sensitivity and stability are limited by the technical noise in the fluorescence
detection protocol and the microwave system, respectively.
acknowledgement: This work is supported by the Office of Naval Research (N00014-16-1-2927-
A00003), Vannevar Bush Faculty Fellowship (N00014-16-1-2812- P00005), Department
of Energy (DE-SC0019174- 0001), and Defense Threat Reduction Agency (HDTRA1-15-1-0017-
P00005).
article_number: '043202'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Benjamin K.
full_name: Malia, Benjamin K.
last_name: Malia
- first_name: Julián
full_name: Martínez-Rincón, Julián
last_name: Martínez-Rincón
- first_name: Yunfan
full_name: Wu, Yunfan
last_name: Wu
- first_name: Onur
full_name: Hosten, Onur
id: 4C02D85E-F248-11E8-B48F-1D18A9856A87
last_name: Hosten
orcid: 0000-0002-2031-204X
- first_name: Mark A.
full_name: Kasevich, Mark A.
last_name: Kasevich
citation:
ama: Malia BK, Martínez-Rincón J, Wu Y, Hosten O, Kasevich MA. Free space Ramsey
spectroscopy in rubidium with noise below the quantum projection limit. Physical
Review Letters. 2020;125(4). doi:10.1103/PhysRevLett.125.043202
apa: Malia, B. K., Martínez-Rincón, J., Wu, Y., Hosten, O., & Kasevich, M. A.
(2020). Free space Ramsey spectroscopy in rubidium with noise below the quantum
projection limit. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.125.043202
chicago: Malia, Benjamin K., Julián Martínez-Rincón, Yunfan Wu, Onur Hosten, and
Mark A. Kasevich. “Free Space Ramsey Spectroscopy in Rubidium with Noise below
the Quantum Projection Limit.” Physical Review Letters. American Physical
Society, 2020. https://doi.org/10.1103/PhysRevLett.125.043202.
ieee: B. K. Malia, J. Martínez-Rincón, Y. Wu, O. Hosten, and M. A. Kasevich, “Free
space Ramsey spectroscopy in rubidium with noise below the quantum projection
limit,” Physical Review Letters, vol. 125, no. 4. American Physical Society,
2020.
ista: Malia BK, Martínez-Rincón J, Wu Y, Hosten O, Kasevich MA. 2020. Free space
Ramsey spectroscopy in rubidium with noise below the quantum projection limit.
Physical Review Letters. 125(4), 043202.
mla: Malia, Benjamin K., et al. “Free Space Ramsey Spectroscopy in Rubidium with
Noise below the Quantum Projection Limit.” Physical Review Letters, vol.
125, no. 4, 043202, American Physical Society, 2020, doi:10.1103/PhysRevLett.125.043202.
short: B.K. Malia, J. Martínez-Rincón, Y. Wu, O. Hosten, M.A. Kasevich, Physical
Review Letters 125 (2020).
date_created: 2020-08-24T06:24:04Z
date_published: 2020-07-24T00:00:00Z
date_updated: 2023-10-18T08:38:35Z
day: '24'
department:
- _id: OnHo
doi: 10.1103/PhysRevLett.125.043202
external_id:
arxiv:
- '1912.10218'
isi:
- '000552227400008'
pmid:
- '32794788'
intvolume: ' 125'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1912.10218
month: '07'
oa: 1
oa_version: Preprint
pmid: 1
publication: Physical Review Letters
publication_identifier:
eissn:
- 1079-7114
issn:
- 0031-9007
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Free space Ramsey spectroscopy in rubidium with noise below the quantum projection
limit
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 125
year: '2020'
...
---
_id: '8294'
abstract:
- lang: eng
text: 'Automated root growth analysis and tracking of root tips. '
author:
- first_name: Robert
full_name: Hauschild, Robert
id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
last_name: Hauschild
orcid: 0000-0001-9843-3522
citation:
ama: Hauschild R. RGtracker. 2020. doi:10.15479/AT:ISTA:8294
apa: Hauschild, R. (2020). RGtracker. IST Austria. https://doi.org/10.15479/AT:ISTA:8294
chicago: Hauschild, Robert. “RGtracker.” IST Austria, 2020. https://doi.org/10.15479/AT:ISTA:8294.
ieee: R. Hauschild, “RGtracker.” IST Austria, 2020.
ista: Hauschild R. 2020. RGtracker, IST Austria, 10.15479/AT:ISTA:8294.
mla: Hauschild, Robert. RGtracker. IST Austria, 2020, doi:10.15479/AT:ISTA:8294.
short: R. Hauschild, (2020).
corr_author: '1'
date_created: 2020-08-25T12:52:48Z
date_published: 2020-09-10T00:00:00Z
date_updated: 2024-10-09T21:05:14Z
day: '10'
ddc:
- '570'
department:
- _id: Bio
doi: 10.15479/AT:ISTA:8294
file:
- access_level: open_access
checksum: 108352149987ac6f066e4925bd56e35e
content_type: text/plain
creator: rhauschild
date_created: 2020-09-08T14:26:31Z
date_updated: 2020-09-08T14:26:31Z
file_id: '8346'
file_name: readme.txt
file_size: 882
relation: main_file
success: 1
- access_level: open_access
checksum: ffd6c643b28e0cc7c6d0060a18a7e8ea
content_type: application/octet-stream
creator: rhauschild
date_created: 2020-09-08T14:26:33Z
date_updated: 2020-09-08T14:26:33Z
file_id: '8347'
file_name: RGtracker.mlappinstall
file_size: 246121
relation: main_file
success: 1
file_date_updated: 2020-09-08T14:26:33Z
has_accepted_license: '1'
license: https://opensource.org/licenses/BSD-3-Clause
month: '09'
oa: 1
publisher: IST Austria
status: public
title: RGtracker
tmp:
legal_code_url: https://opensource.org/licenses/BSD-3-Clause
name: The 3-Clause BSD License
short: 3-Clause BSD
type: software
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '8307'
abstract:
- lang: eng
text: "Classic Byzantine fault-tolerant consensus protocols forfeit liveness in
the face of asynchrony in order to preserve safety, whereas most deployed blockchain
protocols forfeit safety in order to remain live. In this work, we achieve the
best of both worlds by proposing a novel abstractions called the finality gadget.
A finality gadget allows for transactions to always optimistically commit but
informs the clients that these transactions might be unsafe. As a result, a blockchain
can execute transactions optimistically and only commit them after they have been
sufficiently and provably audited. In\r\nthis work, we formally model the finality
gadget abstraction, prove that it is impossible to solve it deterministically
in full asynchrony (even though it is stronger than consensus) and provide a partially
synchronous protocol which is currently securing a major blockchain. This way
we show that the protocol designer can decouple safety and liveness in order to
speed up recovery from failures. We believe that there can be other types of finality
gadgets that provide weaker safety (e.g., probabilistic) in order to gain more
efficiency and this can depend on the probability that the network is not in synchrony."
article_number: '2007.01560'
article_processing_charge: No
arxiv: 1
author:
- first_name: Alistair
full_name: Stewart, Alistair
last_name: Stewart
- first_name: Eleftherios
full_name: Kokoris Kogias, Eleftherios
id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
last_name: Kokoris Kogias
citation:
ama: 'Stewart A, Kokoris Kogias E. GRANDPA: A Byzantine finality gadget. arXiv.
doi:10.48550/arXiv.2007.01560'
apa: 'Stewart, A., & Kokoris Kogias, E. (n.d.). GRANDPA: A Byzantine finality
gadget. arXiv. https://doi.org/10.48550/arXiv.2007.01560'
chicago: 'Stewart, Alistair, and Eleftherios Kokoris Kogias. “GRANDPA: A Byzantine
Finality Gadget.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2007.01560.'
ieee: 'A. Stewart and E. Kokoris Kogias, “GRANDPA: A Byzantine finality gadget,”
arXiv. .'
ista: 'Stewart A, Kokoris Kogias E. GRANDPA: A Byzantine finality gadget. arXiv,
2007.01560.'
mla: 'Stewart, Alistair, and Eleftherios Kokoris Kogias. “GRANDPA: A Byzantine Finality
Gadget.” ArXiv, 2007.01560, doi:10.48550/arXiv.2007.01560.'
short: A. Stewart, E. Kokoris Kogias, ArXiv (n.d.).
date_created: 2020-08-26T12:32:10Z
date_published: 2020-07-03T00:00:00Z
date_updated: 2025-06-26T11:27:41Z
day: '03'
doi: 10.48550/arXiv.2007.01560
extern: '1'
external_id:
arxiv:
- '2007.01560'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2007.01560
month: '07'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
status: public
title: 'GRANDPA: A Byzantine finality gadget'
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '8319'
abstract:
- lang: eng
text: We demonstrate that releasing atoms into free space from an optical lattice
does not deteriorate cavity-generated spin squeezing for metrological purposes.
In this work, an ensemble of 500000 spin-squeezed atoms in a high-finesse optical
cavity with near-uniform atom-cavity coupling is prepared, released into free
space, recaptured in the cavity, and probed. Up to ∼10 dB of metrologically relevant
squeezing is retrieved for 700μs free-fall times, and decaying levels of squeezing
are realized for up to 3 ms free-fall times. The degradation of squeezing results
from loss of atom-cavity coupling homogeneity between the initial squeezed state
generation and final collective state readout. A theoretical model is developed
to quantify this degradation and this model is experimentally validated.
acknowledgement: We thank N. Engelsen for comments on the manuscript. This work was
supported by the Office of Naval Research, Vannevar Bush Faculty Fellowship, Department
of Energy, and Defense Threat Reduction Agency. R.K. was partly supported by the
AQT/INQNET program at Caltech.
article_number: '012224'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Yunfan
full_name: Wu, Yunfan
last_name: Wu
- first_name: Rajiv
full_name: Krishnakumar, Rajiv
last_name: Krishnakumar
- first_name: Julián
full_name: Martínez-Rincón, Julián
last_name: Martínez-Rincón
- first_name: Benjamin K.
full_name: Malia, Benjamin K.
last_name: Malia
- first_name: Onur
full_name: Hosten, Onur
id: 4C02D85E-F248-11E8-B48F-1D18A9856A87
last_name: Hosten
orcid: 0000-0002-2031-204X
- first_name: Mark A.
full_name: Kasevich, Mark A.
last_name: Kasevich
citation:
ama: Wu Y, Krishnakumar R, Martínez-Rincón J, Malia BK, Hosten O, Kasevich MA. Retrieval
of cavity-generated atomic spin squeezing after free-space release. Physical
Review A. 2020;102(1). doi:10.1103/PhysRevA.102.012224
apa: Wu, Y., Krishnakumar, R., Martínez-Rincón, J., Malia, B. K., Hosten, O., &
Kasevich, M. A. (2020). Retrieval of cavity-generated atomic spin squeezing after
free-space release. Physical Review A. American Physical Society. https://doi.org/10.1103/PhysRevA.102.012224
chicago: Wu, Yunfan, Rajiv Krishnakumar, Julián Martínez-Rincón, Benjamin K. Malia,
Onur Hosten, and Mark A. Kasevich. “Retrieval of Cavity-Generated Atomic Spin
Squeezing after Free-Space Release.” Physical Review A. American Physical
Society, 2020. https://doi.org/10.1103/PhysRevA.102.012224.
ieee: Y. Wu, R. Krishnakumar, J. Martínez-Rincón, B. K. Malia, O. Hosten, and M.
A. Kasevich, “Retrieval of cavity-generated atomic spin squeezing after free-space
release,” Physical Review A, vol. 102, no. 1. American Physical Society,
2020.
ista: Wu Y, Krishnakumar R, Martínez-Rincón J, Malia BK, Hosten O, Kasevich MA.
2020. Retrieval of cavity-generated atomic spin squeezing after free-space release.
Physical Review A. 102(1), 012224.
mla: Wu, Yunfan, et al. “Retrieval of Cavity-Generated Atomic Spin Squeezing after
Free-Space Release.” Physical Review A, vol. 102, no. 1, 012224, American
Physical Society, 2020, doi:10.1103/PhysRevA.102.012224.
short: Y. Wu, R. Krishnakumar, J. Martínez-Rincón, B.K. Malia, O. Hosten, M.A. Kasevich,
Physical Review A 102 (2020).
date_created: 2020-08-30T22:01:10Z
date_published: 2020-07-30T00:00:00Z
date_updated: 2025-07-10T11:55:14Z
day: '30'
department:
- _id: OnHo
doi: 10.1103/PhysRevA.102.012224
external_id:
arxiv:
- '1912.08334'
isi:
- '000555104200011'
intvolume: ' 102'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1912.08334
month: '07'
oa: 1
oa_version: Preprint
publication: Physical Review A
publication_identifier:
eissn:
- 2469-9934
issn:
- 2469-9926
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Retrieval of cavity-generated atomic spin squeezing after free-space release
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 102
year: '2020'
...
---
_id: '8320'
abstract:
- lang: eng
text: The genetic code is considered to use five nucleic bases (adenine, guanine,
cytosine, thymine and uracil), which form two pairs for encoding information in
DNA and two pairs for encoding information in RNA. Nevertheless, in recent years
several artificial base pairs have been developed in attempts to expand the genetic
code. Employment of these additional base pairs increases the information capacity
and variety of DNA sequences, and provides a platform for the site-specific, enzymatic
incorporation of extra functional components into DNA and RNA. As a result, of
the development of such expanded systems, many artificial base pairs have been
synthesized and tested under various conditions. Following many stages of enhancement,
unnatural base pairs have been modified to eliminate their weak points, qualifying
them for specific research needs. Moreover, the first attempts to create a semi-synthetic
organism containing DNA with unnatural base pairs seem to have been successful.
This further extends the possible applications of these kinds of pairs. Herein,
we describe the most significant qualities of unnatural base pairs and their actual
applications.
acknowledgement: We would like to thank our co-workers and members of the Alkalaeva
lab for participating in discussions about the topics covered in this essay.
article_processing_charge: No
article_type: original
author:
- first_name: S. A.
full_name: Mukba, S. A.
last_name: Mukba
- first_name: Petr
full_name: Vlasov, Petr
id: 38BB9AC4-F248-11E8-B48F-1D18A9856A87
last_name: Vlasov
- first_name: P. M.
full_name: Kolosov, P. M.
last_name: Kolosov
- first_name: E. Y.
full_name: Shuvalova, E. Y.
last_name: Shuvalova
- first_name: T. V.
full_name: Egorova, T. V.
last_name: Egorova
- first_name: E. Z.
full_name: Alkalaeva, E. Z.
last_name: Alkalaeva
citation:
ama: 'Mukba SA, Vlasov P, Kolosov PM, Shuvalova EY, Egorova TV, Alkalaeva EZ. Expanding
the genetic code: Unnatural base pairs in biological systems. Molecular Biology.
2020;54(4):475-484. doi:10.1134/S0026893320040111'
apa: 'Mukba, S. A., Vlasov, P., Kolosov, P. M., Shuvalova, E. Y., Egorova, T. V.,
& Alkalaeva, E. Z. (2020). Expanding the genetic code: Unnatural base pairs
in biological systems. Molecular Biology. Springer Nature. https://doi.org/10.1134/S0026893320040111'
chicago: 'Mukba, S. A., Petr Vlasov, P. M. Kolosov, E. Y. Shuvalova, T. V. Egorova,
and E. Z. Alkalaeva. “Expanding the Genetic Code: Unnatural Base Pairs in Biological
Systems.” Molecular Biology. Springer Nature, 2020. https://doi.org/10.1134/S0026893320040111.'
ieee: 'S. A. Mukba, P. Vlasov, P. M. Kolosov, E. Y. Shuvalova, T. V. Egorova, and
E. Z. Alkalaeva, “Expanding the genetic code: Unnatural base pairs in biological
systems,” Molecular Biology, vol. 54, no. 4. Springer Nature, pp. 475–484,
2020.'
ista: 'Mukba SA, Vlasov P, Kolosov PM, Shuvalova EY, Egorova TV, Alkalaeva EZ. 2020.
Expanding the genetic code: Unnatural base pairs in biological systems. Molecular
Biology. 54(4), 475–484.'
mla: 'Mukba, S. A., et al. “Expanding the Genetic Code: Unnatural Base Pairs in
Biological Systems.” Molecular Biology, vol. 54, no. 4, Springer Nature,
2020, pp. 475–84, doi:10.1134/S0026893320040111.'
short: S.A. Mukba, P. Vlasov, P.M. Kolosov, E.Y. Shuvalova, T.V. Egorova, E.Z. Alkalaeva,
Molecular Biology 54 (2020) 475–484.
date_created: 2020-08-30T22:01:11Z
date_published: 2020-08-19T00:00:00Z
date_updated: 2025-07-10T11:57:02Z
day: '19'
department:
- _id: FyKo
doi: 10.1134/S0026893320040111
external_id:
isi:
- '000562110300001'
intvolume: ' 54'
isi: 1
issue: '4'
language:
- iso: eng
month: '08'
oa_version: None
page: 475-484
publication: Molecular Biology
publication_identifier:
eissn:
- 1608-3245
issn:
- 0026-8933
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '8321'
relation: original
status: public
scopus_import: '1'
status: public
title: 'Expanding the genetic code: Unnatural base pairs in biological systems'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 54
year: '2020'
...
---
_id: '8321'
abstract:
- lang: eng
text: The genetic code is considered to use five nucleic bases (adenine, guanine,
cytosine, thymine and uracil), which form two pairs for encoding information in
DNA and two pairs for encoding information in RNA. Nevertheless, in recent years
several artificial base pairs have been developed in attempts to expand the genetic
code. Employment of these additional base pairs increases the information capacity
and variety of DNA sequences, and provides a platform for the site-specific, enzymatic
incorporation of extra functional components into DNA and RNA. As a result, of
the development of such expanded systems, many artificial base pairs have been
synthesized and tested under various conditions. Following many stages of enhancement,
unnatural base pairs have been modified to eliminate their weak points, qualifying
them for specific research needs. Moreover, the first attempts to create a semi-synthetic
organism containing DNA with unnatural base pairs seem to have been successful.
This further extends the possible applications of these kinds of pairs. Herein,
we describe the most significant qualities of unnatural base pairs and their actual
applications.
article_processing_charge: No
article_type: original
author:
- first_name: S. A.
full_name: Mukba, S. A.
last_name: Mukba
- first_name: Petr
full_name: Vlasov, Petr
id: 38BB9AC4-F248-11E8-B48F-1D18A9856A87
last_name: Vlasov
- first_name: P. M.
full_name: Kolosov, P. M.
last_name: Kolosov
- first_name: E. Y.
full_name: Shuvalova, E. Y.
last_name: Shuvalova
- first_name: T. V.
full_name: Egorova, T. V.
last_name: Egorova
- first_name: E. Z.
full_name: Alkalaeva, E. Z.
last_name: Alkalaeva
citation:
ama: 'Mukba SA, Vlasov P, Kolosov PM, Shuvalova EY, Egorova TV, Alkalaeva EZ. Expanding
the genetic code: Unnatural base pairs in biological systems. Molekuliarnaia
biologiia. 2020;54(4):531-541. doi:10.31857/S0026898420040126'
apa: 'Mukba, S. A., Vlasov, P., Kolosov, P. M., Shuvalova, E. Y., Egorova, T. V.,
& Alkalaeva, E. Z. (2020). Expanding the genetic code: Unnatural base pairs
in biological systems. Molekuliarnaia biologiia. Russian Academy of Sciences.
https://doi.org/10.31857/S0026898420040126'
chicago: 'Mukba, S. A., Petr Vlasov, P. M. Kolosov, E. Y. Shuvalova, T. V. Egorova,
and E. Z. Alkalaeva. “Expanding the genetic code: Unnatural base pairs in biological
systems.” Molekuliarnaia biologiia. Russian Academy of Sciences, 2020.
https://doi.org/10.31857/S0026898420040126.'
ieee: 'S. A. Mukba, P. Vlasov, P. M. Kolosov, E. Y. Shuvalova, T. V. Egorova, and
E. Z. Alkalaeva, “Expanding the genetic code: Unnatural base pairs in biological
systems,” Molekuliarnaia biologiia, vol. 54, no. 4. Russian Academy of
Sciences, pp. 531–541, 2020.'
ista: 'Mukba SA, Vlasov P, Kolosov PM, Shuvalova EY, Egorova TV, Alkalaeva EZ. 2020.
Expanding the genetic code: Unnatural base pairs in biological systems. Molekuliarnaia
biologiia. 54(4), 531–541.'
mla: 'Mukba, S. A., et al. “Expanding the genetic code: Unnatural base pairs in
biological systems.” Molekuliarnaia biologiia, vol. 54, no. 4, Russian
Academy of Sciences, 2020, pp. 531–41, doi:10.31857/S0026898420040126.'
short: S.A. Mukba, P. Vlasov, P.M. Kolosov, E.Y. Shuvalova, T.V. Egorova, E.Z. Alkalaeva,
Molekuliarnaia biologiia 54 (2020) 531–541.
date_created: 2020-08-30T22:01:11Z
date_published: 2020-07-01T00:00:00Z
date_updated: 2025-07-10T11:57:03Z
day: '01'
department:
- _id: FyKo
doi: 10.31857/S0026898420040126
external_id:
pmid:
- '32799218'
intvolume: ' 54'
issue: '4'
language:
- iso: rus
month: '07'
oa_version: None
page: 531-541
pmid: 1
publication: Molekuliarnaia biologiia
publication_identifier:
issn:
- 0026-8984
publication_status: published
publisher: Russian Academy of Sciences
quality_controlled: '1'
related_material:
record:
- id: '8320'
relation: translation
status: public
scopus_import: '1'
status: public
title: 'Expanding the genetic code: Unnatural base pairs in biological systems'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 54
year: '2020'
...
---
_id: '8323'
article_processing_charge: No
article_type: letter_note
author:
- first_name: János
full_name: Pach, János
id: E62E3130-B088-11EA-B919-BF823C25FEA4
last_name: Pach
citation:
ama: Pach J. A farewell to Ricky Pollack. Discrete and Computational Geometry.
2020;64:571-574. doi:10.1007/s00454-020-00237-5
apa: Pach, J. (2020). A farewell to Ricky Pollack. Discrete and Computational
Geometry. Springer Nature. https://doi.org/10.1007/s00454-020-00237-5
chicago: Pach, János. “A Farewell to Ricky Pollack.” Discrete and Computational
Geometry. Springer Nature, 2020. https://doi.org/10.1007/s00454-020-00237-5.
ieee: J. Pach, “A farewell to Ricky Pollack,” Discrete and Computational Geometry,
vol. 64. Springer Nature, pp. 571–574, 2020.
ista: Pach J. 2020. A farewell to Ricky Pollack. Discrete and Computational Geometry.
64, 571–574.
mla: Pach, János. “A Farewell to Ricky Pollack.” Discrete and Computational Geometry,
vol. 64, Springer Nature, 2020, pp. 571–74, doi:10.1007/s00454-020-00237-5.
short: J. Pach, Discrete and Computational Geometry 64 (2020) 571–574.
corr_author: '1'
date_created: 2020-08-30T22:01:12Z
date_published: 2020-10-01T00:00:00Z
date_updated: 2024-10-09T20:59:55Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/s00454-020-00237-5
external_id:
isi:
- '000561483500001'
intvolume: ' 64'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1007/s00454-020-00237-5
month: '10'
oa: 1
oa_version: None
page: 571-574
publication: Discrete and Computational Geometry
publication_identifier:
eissn:
- '14320444'
issn:
- '01795376'
publication_status: published
publisher: Springer Nature
scopus_import: '1'
status: public
title: A farewell to Ricky Pollack
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 64
year: '2020'
...
---
_id: '8324'
abstract:
- lang: eng
text: The notion of program sensitivity (aka Lipschitz continuity) specifies that
changes in the program input result in proportional changes to the program output.
For probabilistic programs the notion is naturally extended to expected sensitivity.
A previous approach develops a relational program logic framework for proving
expected sensitivity of probabilistic while loops, where the number of iterations
is fixed and bounded. In this work, we consider probabilistic while loops where
the number of iterations is not fixed, but randomized and depends on the initial
input values. We present a sound approach for proving expected sensitivity of
such programs. Our sound approach is martingale-based and can be automated through
existing martingale-synthesis algorithms. Furthermore, our approach is compositional
for sequential composition of while loops under a mild side condition. We demonstrate
the effectiveness of our approach on several classical examples from Gambler's
Ruin, stochastic hybrid systems and stochastic gradient descent. We also present
experimental results showing that our automated approach can handle various probabilistic
programs in the literature.
acknowledgement: We thank anonymous reviewers for helpful comments, especially for
pointing to us a scenario of piecewise-linear approximation (Remark5). The research
was partially supported by the National Natural Science Foundation of China (NSFC)
under Grant No. 61802254, 61672229, 61832015,61772336,11871221 and Austrian Science
Fund (FWF) NFN under Grant No. S11407-N23 (RiSE/SHiNE). We thank Prof. Yuxi Fu,
director of the BASICS Lab at Shanghai Jiao Tong University, for his support.
article_number: '25'
article_processing_charge: No
arxiv: 1
author:
- first_name: Peixin
full_name: Wang, Peixin
last_name: Wang
- first_name: Hongfei
full_name: Fu, Hongfei
last_name: Fu
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Yuxin
full_name: Deng, Yuxin
last_name: Deng
- first_name: Ming
full_name: Xu, Ming
last_name: Xu
citation:
ama: 'Wang P, Fu H, Chatterjee K, Deng Y, Xu M. Proving expected sensitivity of
probabilistic programs with randomized variable-dependent termination time. In:
Proceedings of the ACM on Programming Languages. Vol 4. ACM; 2020. doi:10.1145/3371093'
apa: Wang, P., Fu, H., Chatterjee, K., Deng, Y., & Xu, M. (2020). Proving expected
sensitivity of probabilistic programs with randomized variable-dependent termination
time. In Proceedings of the ACM on Programming Languages (Vol. 4). ACM.
https://doi.org/10.1145/3371093
chicago: Wang, Peixin, Hongfei Fu, Krishnendu Chatterjee, Yuxin Deng, and Ming Xu.
“Proving Expected Sensitivity of Probabilistic Programs with Randomized Variable-Dependent
Termination Time.” In Proceedings of the ACM on Programming Languages,
Vol. 4. ACM, 2020. https://doi.org/10.1145/3371093.
ieee: P. Wang, H. Fu, K. Chatterjee, Y. Deng, and M. Xu, “Proving expected sensitivity
of probabilistic programs with randomized variable-dependent termination time,”
in Proceedings of the ACM on Programming Languages, 2020, vol. 4, no. POPL.
ista: Wang P, Fu H, Chatterjee K, Deng Y, Xu M. 2020. Proving expected sensitivity
of probabilistic programs with randomized variable-dependent termination time.
Proceedings of the ACM on Programming Languages. vol. 4, 25.
mla: Wang, Peixin, et al. “Proving Expected Sensitivity of Probabilistic Programs
with Randomized Variable-Dependent Termination Time.” Proceedings of the ACM
on Programming Languages, vol. 4, no. POPL, 25, ACM, 2020, doi:10.1145/3371093.
short: P. Wang, H. Fu, K. Chatterjee, Y. Deng, M. Xu, in:, Proceedings of the ACM
on Programming Languages, ACM, 2020.
date_created: 2020-08-30T22:01:12Z
date_published: 2020-01-01T00:00:00Z
date_updated: 2025-04-15T06:30:10Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.1145/3371093
external_id:
arxiv:
- '1902.04744'
file:
- access_level: open_access
checksum: c6193d109ff4ecb17e7a6513d8eb34c0
content_type: application/pdf
creator: cziletti
date_created: 2020-09-01T11:12:58Z
date_updated: 2020-09-01T11:12:58Z
file_id: '8328'
file_name: 2019_ACM_POPL_Wang.pdf
file_size: 564151
relation: main_file
success: 1
file_date_updated: 2020-09-01T11:12:58Z
has_accepted_license: '1'
intvolume: ' 4'
issue: POPL
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: Proceedings of the ACM on Programming Languages
publication_identifier:
eissn:
- 2475-1421
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://doi.org/10.5281/zenodo.3533633
scopus_import: '1'
status: public
title: Proving expected sensitivity of probabilistic programs with randomized variable-dependent
termination time
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2020'
...
---
_id: '8325'
abstract:
- lang: eng
text: "Let \U0001D439:ℤ2→ℤ be the pointwise minimum of several linear functions.
The theory of smoothing allows us to prove that under certain conditions there
exists the pointwise minimal function among all integer-valued superharmonic functions
coinciding with F “at infinity”. We develop such a theory to prove existence of
so-called solitons (or strings) in a sandpile model, studied by S. Caracciolo,
G. Paoletti, and A. Sportiello. Thus we made a step towards understanding the
phenomena of the identity in the sandpile group for planar domains where solitons
appear according to experiments. We prove that sandpile states, defined using
our smoothing procedure, move changeless when we apply the wave operator (that
is why we call them solitons), and can interact, forming triads and nodes. "
acknowledgement: We thank Andrea Sportiello for sharing his insights on perturbative
regimes of the Abelian sandpile model which was the starting point of our work.
We also thank Grigory Mikhalkin, who encouraged us to approach this problem. We
thank an anonymous referee. Also we thank Misha Khristoforov and Sergey Lanzat who
participated on the initial state of this project, when we had nothing except the
computer simulation and pictures. We thank Mikhail Raskin for providing us the code
on Golly for faster simulations. Ilia Zharkov, Ilia Itenberg, Kristin Shaw, Max
Karev, Lionel Levine, Ernesto Lupercio, Pavol Ševera, Yulieth Prieto, Michael Polyak,
Danila Cherkashin asked us a lot of questions and listened to us; not all of their
questions found answers here, but we are going to treat them in subsequent papers.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Nikita
full_name: Kalinin, Nikita
last_name: Kalinin
- first_name: Mikhail
full_name: Shkolnikov, Mikhail
id: 35084A62-F248-11E8-B48F-1D18A9856A87
last_name: Shkolnikov
orcid: 0000-0002-4310-178X
citation:
ama: Kalinin N, Shkolnikov M. Sandpile solitons via smoothing of superharmonic functions.
Communications in Mathematical Physics. 2020;378(9):1649-1675. doi:10.1007/s00220-020-03828-8
apa: Kalinin, N., & Shkolnikov, M. (2020). Sandpile solitons via smoothing of
superharmonic functions. Communications in Mathematical Physics. Springer
Nature. https://doi.org/10.1007/s00220-020-03828-8
chicago: Kalinin, Nikita, and Mikhail Shkolnikov. “Sandpile Solitons via Smoothing
of Superharmonic Functions.” Communications in Mathematical Physics. Springer
Nature, 2020. https://doi.org/10.1007/s00220-020-03828-8.
ieee: N. Kalinin and M. Shkolnikov, “Sandpile solitons via smoothing of superharmonic
functions,” Communications in Mathematical Physics, vol. 378, no. 9. Springer
Nature, pp. 1649–1675, 2020.
ista: Kalinin N, Shkolnikov M. 2020. Sandpile solitons via smoothing of superharmonic
functions. Communications in Mathematical Physics. 378(9), 1649–1675.
mla: Kalinin, Nikita, and Mikhail Shkolnikov. “Sandpile Solitons via Smoothing of
Superharmonic Functions.” Communications in Mathematical Physics, vol.
378, no. 9, Springer Nature, 2020, pp. 1649–75, doi:10.1007/s00220-020-03828-8.
short: N. Kalinin, M. Shkolnikov, Communications in Mathematical Physics 378 (2020)
1649–1675.
date_created: 2020-08-30T22:01:13Z
date_published: 2020-09-01T00:00:00Z
date_updated: 2025-07-10T11:57:03Z
day: '01'
department:
- _id: TaHa
doi: 10.1007/s00220-020-03828-8
ec_funded: 1
external_id:
arxiv:
- '1711.04285'
isi:
- '000560620600001'
intvolume: ' 378'
isi: 1
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1711.04285
month: '09'
oa: 1
oa_version: Preprint
page: 1649-1675
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Communications in Mathematical Physics
publication_identifier:
eissn:
- 1432-0916
issn:
- 0010-3616
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sandpile solitons via smoothing of superharmonic functions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 378
year: '2020'
...
---
_id: '8329'
abstract:
- lang: eng
text: We show the synthesis of a redox‐active quinone, 2‐methoxy‐1,4‐hydroquinone
(MHQ), from a bio‐based feedstock and its suitability as electrolyte in aqueous
redox flow batteries. We identified semiquinone intermediates at insufficiently
low pH and quinoid radicals as responsible for decomposition of MHQ under electrochemical
conditions. Both can be avoided and/or stabilized, respectively, using H 3 PO
4 electrolyte, allowing for reversible cycling in a redox flow battery for hundreds
of cycles.
acknowledgement: The Austrian Research Promotion Agency (FFG) is gratefully acknowledged
for financial support of the project LignoBatt (860429).
article_processing_charge: No
article_type: original
author:
- first_name: Werner
full_name: Schlemmer, Werner
last_name: Schlemmer
- first_name: Philipp
full_name: Nothdurft, Philipp
last_name: Nothdurft
- first_name: Alina
full_name: Petzold, Alina
last_name: Petzold
- first_name: Philipp
full_name: Frühwirt, Philipp
last_name: Frühwirt
- first_name: Max
full_name: Schmallegger, Max
last_name: Schmallegger
- first_name: Georg
full_name: Gescheidt-Demner, Georg
last_name: Gescheidt-Demner
- first_name: Roland
full_name: Fischer, Roland
last_name: Fischer
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
- first_name: Wolfgang
full_name: Kern, Wolfgang
last_name: Kern
- first_name: Stefan
full_name: Spirk, Stefan
last_name: Spirk
citation:
ama: Schlemmer W, Nothdurft P, Petzold A, et al. 2‐methoxyhydroquinone from vanillin
for aqueous redox‐flow batteries. Angewandte Chemie International Edition.
2020;59(51):22943-22946. doi:10.1002/anie.202008253
apa: Schlemmer, W., Nothdurft, P., Petzold, A., Frühwirt, P., Schmallegger, M.,
Gescheidt-Demner, G., … Spirk, S. (2020). 2‐methoxyhydroquinone from vanillin
for aqueous redox‐flow batteries. Angewandte Chemie International Edition.
Wiley. https://doi.org/10.1002/anie.202008253
chicago: Schlemmer, Werner, Philipp Nothdurft, Alina Petzold, Philipp Frühwirt,
Max Schmallegger, Georg Gescheidt-Demner, Roland Fischer, Stefan Alexander Freunberger,
Wolfgang Kern, and Stefan Spirk. “2‐methoxyhydroquinone from Vanillin for Aqueous
Redox‐flow Batteries.” Angewandte Chemie International Edition. Wiley,
2020. https://doi.org/10.1002/anie.202008253.
ieee: W. Schlemmer et al., “2‐methoxyhydroquinone from vanillin for aqueous
redox‐flow batteries,” Angewandte Chemie International Edition, vol. 59,
no. 51. Wiley, pp. 22943–22946, 2020.
ista: Schlemmer W, Nothdurft P, Petzold A, Frühwirt P, Schmallegger M, Gescheidt-Demner
G, Fischer R, Freunberger SA, Kern W, Spirk S. 2020. 2‐methoxyhydroquinone from
vanillin for aqueous redox‐flow batteries. Angewandte Chemie International Edition.
59(51), 22943–22946.
mla: Schlemmer, Werner, et al. “2‐methoxyhydroquinone from Vanillin for Aqueous
Redox‐flow Batteries.” Angewandte Chemie International Edition, vol. 59,
no. 51, Wiley, 2020, pp. 22943–46, doi:10.1002/anie.202008253.
short: W. Schlemmer, P. Nothdurft, A. Petzold, P. Frühwirt, M. Schmallegger, G.
Gescheidt-Demner, R. Fischer, S.A. Freunberger, W. Kern, S. Spirk, Angewandte
Chemie International Edition 59 (2020) 22943–22946.
date_created: 2020-09-03T16:10:56Z
date_published: 2020-12-14T00:00:00Z
date_updated: 2023-09-05T16:03:47Z
day: '14'
department:
- _id: StFr
doi: 10.1002/anie.202008253
external_id:
isi:
- '000576148700001'
intvolume: ' 59'
isi: 1
issue: '51'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1002/anie.202008253
month: '12'
oa: 1
oa_version: Published Version
page: 22943-22946
publication: Angewandte Chemie International Edition
publication_identifier:
eissn:
- 1521-3773
issn:
- 1433-7851
publication_status: published
publisher: Wiley
quality_controlled: '1'
related_material:
record:
- id: '9780'
relation: research_data
status: public
scopus_import: '1'
status: public
title: 2‐methoxyhydroquinone from vanillin for aqueous redox‐flow batteries
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 59
year: '2020'
...
---
_id: '8361'
abstract:
- lang: eng
text: With the lithium-ion technology approaching its intrinsic limit with graphite-based
anodes, Li metal is recently receiving renewed interest from the battery community
as potential high capacity anode for next-generation rechargeable batteries. In
this focus paper, we review the main advances in this field since the first attempts
in the mid-1970s. Strategies for enabling reversible cycling and avoiding dendrite
growth are thoroughly discussed, including specific applications in all-solid-state
(inorganic and polymeric), Lithium–Sulfur (Li–S) and Lithium-O2 (air) batteries.
A particular attention is paid to recent developments of these battery technologies
and their current state with respect to the 2030 targets of the EU Integrated
Strategic Energy Technology Plan (SET-Plan) Action 7.
acknowledgement: A.V. and K.T. acknowledge, respectively, the financial support of
the Helmholtz Association and BMW AG. J.H. acknowledges the collabo-ration project
“Accordo di Collaborazione Quadro 2015” between Uni-versity of Ferrara (Department
of Chemical and Pharmaceutical Sciences) and Sapienza University of Rome (Department
of Chemistry). S.D., H.A. and S.K. thank the Fraunhofer Gesellschaft, Technische
Uni-versit ̈at Dresden and would like to acknowledge European Union’s Horizon
2020 research and innovation programme under grant agree-ment No 814471. S.A.F.
and C.P. are indebted to the European Research Council (ERC) under the European
Union’s Horizon 2020 research and innovation program (grant agreement no. 636069)
and IST Austria.
article_number: '228803'
article_processing_charge: No
article_type: original
author:
- first_name: Alberto
full_name: Varzi, Alberto
last_name: Varzi
orcid: 0000-0001-5069-0589
- first_name: Katharina
full_name: Thanner, Katharina
last_name: Thanner
orcid: 0000-0001-5394-2323
- first_name: Roberto
full_name: Scipioni, Roberto
last_name: Scipioni
orcid: 0000-0003-1926-421X
- first_name: Daniele
full_name: Di Lecce, Daniele
last_name: Di Lecce
- first_name: Jusef
full_name: Hassoun, Jusef
last_name: Hassoun
- first_name: Susanne
full_name: Dörfler, Susanne
last_name: Dörfler
- first_name: Holger
full_name: Altheus, Holger
last_name: Altheus
- first_name: Stefan
full_name: Kaskel, Stefan
last_name: Kaskel
- first_name: Christian
full_name: Prehal, Christian
last_name: Prehal
orcid: 0000-0003-0654-0940
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
citation:
ama: Varzi A, Thanner K, Scipioni R, et al. Current status and future perspectives
of lithium metal batteries. Journal of Power Sources. 2020;480(12). doi:10.1016/j.jpowsour.2020.228803
apa: Varzi, A., Thanner, K., Scipioni, R., Di Lecce, D., Hassoun, J., Dörfler, S.,
… Freunberger, S. A. (2020). Current status and future perspectives of lithium
metal batteries. Journal of Power Sources. Elsevier. https://doi.org/10.1016/j.jpowsour.2020.228803
chicago: Varzi, Alberto, Katharina Thanner, Roberto Scipioni, Daniele Di Lecce,
Jusef Hassoun, Susanne Dörfler, Holger Altheus, Stefan Kaskel, Christian Prehal,
and Stefan Alexander Freunberger. “Current Status and Future Perspectives of Lithium
Metal Batteries.” Journal of Power Sources. Elsevier, 2020. https://doi.org/10.1016/j.jpowsour.2020.228803.
ieee: A. Varzi et al., “Current status and future perspectives of lithium
metal batteries,” Journal of Power Sources, vol. 480, no. 12. Elsevier,
2020.
ista: Varzi A, Thanner K, Scipioni R, Di Lecce D, Hassoun J, Dörfler S, Altheus
H, Kaskel S, Prehal C, Freunberger SA. 2020. Current status and future perspectives
of lithium metal batteries. Journal of Power Sources. 480(12), 228803.
mla: Varzi, Alberto, et al. “Current Status and Future Perspectives of Lithium Metal
Batteries.” Journal of Power Sources, vol. 480, no. 12, 228803, Elsevier,
2020, doi:10.1016/j.jpowsour.2020.228803.
short: A. Varzi, K. Thanner, R. Scipioni, D. Di Lecce, J. Hassoun, S. Dörfler, H.
Altheus, S. Kaskel, C. Prehal, S.A. Freunberger, Journal of Power Sources 480
(2020).
date_created: 2020-09-10T10:48:40Z
date_published: 2020-12-31T00:00:00Z
date_updated: 2024-10-21T06:02:28Z
day: '31'
department:
- _id: StFr
doi: 10.1016/j.jpowsour.2020.228803
external_id:
isi:
- '000593857300001'
intvolume: ' 480'
isi: 1
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.jpowsour.2020.228803
month: '12'
oa: 1
oa_version: Published Version
publication: Journal of Power Sources
publication_identifier:
issn:
- 0378-7753
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '8067'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Current status and future perspectives of lithium metal batteries
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 480
year: '2020'
...
---
_id: '8382'
abstract:
- lang: eng
text: We present the first deterministic wait-free long-lived snapshot algorithm,
using only read and write operations, that guarantees polylogarithmic amortized
step complexity in all executions. This is the first non-blocking snapshot algorithm,
using reads and writes only, that has sub-linear amortized step complexity in
executions of arbitrary length. The key to our construction is a novel implementation
of a 2-component max array object which may be of independent interest.
article_processing_charge: No
author:
- first_name: Mirza Ahad
full_name: Baig, Mirza Ahad
id: 3EDE6DE4-AA5A-11E9-986D-341CE6697425
last_name: Baig
- first_name: Danny
full_name: Hendler, Danny
last_name: Hendler
- first_name: Alessia
full_name: Milani, Alessia
last_name: Milani
- first_name: Corentin
full_name: Travers, Corentin
last_name: Travers
citation:
ama: 'Baig MA, Hendler D, Milani A, Travers C. Long-lived snapshots with polylogarithmic
amortized step complexity. In: Proceedings of the 39th Symposium on Principles
of Distributed Computing. Association for Computing Machinery; 2020:31-40.
doi:10.1145/3382734.3406005'
apa: 'Baig, M. A., Hendler, D., Milani, A., & Travers, C. (2020). Long-lived
snapshots with polylogarithmic amortized step complexity. In Proceedings of
the 39th Symposium on Principles of Distributed Computing (pp. 31–40). Virtual,
Italy: Association for Computing Machinery. https://doi.org/10.1145/3382734.3406005'
chicago: Baig, Mirza Ahad, Danny Hendler, Alessia Milani, and Corentin Travers.
“Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity.” In Proceedings
of the 39th Symposium on Principles of Distributed Computing, 31–40. Association
for Computing Machinery, 2020. https://doi.org/10.1145/3382734.3406005.
ieee: M. A. Baig, D. Hendler, A. Milani, and C. Travers, “Long-lived snapshots with
polylogarithmic amortized step complexity,” in Proceedings of the 39th Symposium
on Principles of Distributed Computing, Virtual, Italy, 2020, pp. 31–40.
ista: 'Baig MA, Hendler D, Milani A, Travers C. 2020. Long-lived snapshots with
polylogarithmic amortized step complexity. Proceedings of the 39th Symposium on
Principles of Distributed Computing. PODC: Principles of Distributed Computing,
31–40.'
mla: Baig, Mirza Ahad, et al. “Long-Lived Snapshots with Polylogarithmic Amortized
Step Complexity.” Proceedings of the 39th Symposium on Principles of Distributed
Computing, Association for Computing Machinery, 2020, pp. 31–40, doi:10.1145/3382734.3406005.
short: M.A. Baig, D. Hendler, A. Milani, C. Travers, in:, Proceedings of the 39th
Symposium on Principles of Distributed Computing, Association for Computing Machinery,
2020, pp. 31–40.
conference:
end_date: 2020-08-07
location: Virtual, Italy
name: 'PODC: Principles of Distributed Computing'
start_date: 2020-08-03
date_created: 2020-09-13T22:01:17Z
date_published: 2020-07-31T00:00:00Z
date_updated: 2025-09-10T10:25:23Z
day: '31'
doi: 10.1145/3382734.3406005
external_id:
isi:
- '001436693500004'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal.archives-ouvertes.fr/hal-02860087/document
month: '07'
oa: 1
oa_version: Preprint
page: 31-40
publication: Proceedings of the 39th Symposium on Principles of Distributed Computing
publication_identifier:
isbn:
- '9781450375825'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Long-lived snapshots with polylogarithmic amortized step complexity
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2020'
...
---
_id: '8383'
abstract:
- lang: eng
text: We introduce extension-based proofs, a class of impossibility proofs that
includes valency arguments. They are modelled as an interaction between a prover
and a protocol. Using proofs based on combinatorial topology, it has been shown
that it is impossible to deterministically solve k-set agreement among n > k ≥
2 processes in a wait-free manner. However, it was unknown whether proofs based
on simpler techniques were possible. We explain why this impossibility result
cannot be obtained by an extension-based proof and, hence, extension-based proofs
are limited in power.
article_processing_charge: No
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: James
full_name: Aspnes, James
last_name: Aspnes
- first_name: Faith
full_name: Ellen, Faith
last_name: Ellen
- first_name: Rati
full_name: Gelashvili, Rati
last_name: Gelashvili
- first_name: Leqi
full_name: Zhu, Leqi
last_name: Zhu
citation:
ama: 'Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. Brief Announcement:
Why Extension-Based Proofs Fail. In: Proceedings of the 39th Symposium on Principles
of Distributed Computing. Association for Computing Machinery; 2020:54-56.
doi:10.1145/3382734.3405743'
apa: 'Alistarh, D.-A., Aspnes, J., Ellen, F., Gelashvili, R., & Zhu, L. (2020).
Brief Announcement: Why Extension-Based Proofs Fail. In Proceedings of the
39th Symposium on Principles of Distributed Computing (pp. 54–56). Virtual,
Italy: Association for Computing Machinery. https://doi.org/10.1145/3382734.3405743'
chicago: 'Alistarh, Dan-Adrian, James Aspnes, Faith Ellen, Rati Gelashvili, and
Leqi Zhu. “Brief Announcement: Why Extension-Based Proofs Fail.” In Proceedings
of the 39th Symposium on Principles of Distributed Computing, 54–56. Association
for Computing Machinery, 2020. https://doi.org/10.1145/3382734.3405743.'
ieee: 'D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, and L. Zhu, “Brief Announcement:
Why Extension-Based Proofs Fail,” in Proceedings of the 39th Symposium on Principles
of Distributed Computing, Virtual, Italy, 2020, pp. 54–56.'
ista: 'Alistarh D-A, Aspnes J, Ellen F, Gelashvili R, Zhu L. 2020. Brief Announcement:
Why Extension-Based Proofs Fail. Proceedings of the 39th Symposium on Principles
of Distributed Computing. PODC: Principles of Distributed Computing, 54–56.'
mla: 'Alistarh, Dan-Adrian, et al. “Brief Announcement: Why Extension-Based Proofs
Fail.” Proceedings of the 39th Symposium on Principles of Distributed Computing,
Association for Computing Machinery, 2020, pp. 54–56, doi:10.1145/3382734.3405743.'
short: D.-A. Alistarh, J. Aspnes, F. Ellen, R. Gelashvili, L. Zhu, in:, Proceedings
of the 39th Symposium on Principles of Distributed Computing, Association for
Computing Machinery, 2020, pp. 54–56.
conference:
end_date: 2020-08-07
location: Virtual, Italy
name: 'PODC: Principles of Distributed Computing'
start_date: 2020-08-03
date_created: 2020-09-13T22:01:18Z
date_published: 2020-07-31T00:00:00Z
date_updated: 2025-09-10T10:26:32Z
day: '31'
department:
- _id: DaAl
doi: 10.1145/3382734.3405743
external_id:
isi:
- '001436693500007'
isi: 1
language:
- iso: eng
month: '07'
oa_version: None
page: 54-56
publication: Proceedings of the 39th Symposium on Principles of Distributed Computing
publication_identifier:
isbn:
- '9781450375825'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Brief Announcement: Why Extension-Based Proofs Fail'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2020'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '8402'
abstract:
- lang: eng
text: "Background: The mitochondrial pyruvate carrier (MPC) plays a central role
in energy metabolism by transporting pyruvate across the inner mitochondrial membrane.
Its heterodimeric composition and homology to SWEET and semiSWEET transporters
set the MPC apart from the canonical mitochondrial carrier family (named MCF or
SLC25). The import of the canonical carriers is mediated by the carrier translocase
of the inner membrane (TIM22) pathway and is dependent on their structure, which
features an even number of transmembrane segments and both termini in the intermembrane
space. The import pathway of MPC proteins has not been elucidated. The odd number
of transmembrane segments and positioning of the N-terminus in the matrix argues
against an import via the TIM22 carrier pathway but favors an import via the flexible
presequence pathway.\r\nResults: Here, we systematically analyzed the import pathways
of Mpc2 and Mpc3 and report that, contrary to an expected import via the flexible
presequence pathway, yeast MPC proteins with an odd number of transmembrane segments
and matrix-exposed N-terminus are imported by the carrier pathway, using the receptor
Tom70, small TIM chaperones, and the TIM22 complex. The TIM9·10 complex chaperones
MPC proteins through the mitochondrial intermembrane space using conserved hydrophobic
motifs that are also required for the interaction with canonical carrier proteins.\r\nConclusions:
The carrier pathway can import paired and non-paired transmembrane helices and
translocate N-termini to either side of the mitochondrial inner membrane, revealing
an unexpected versatility of the mitochondrial import pathway for non-cleavable
inner membrane proteins."
article_number: '2'
article_processing_charge: No
article_type: original
author:
- first_name: Heike
full_name: Rampelt, Heike
last_name: Rampelt
- first_name: Iva
full_name: Sucec, Iva
last_name: Sucec
- first_name: Beate
full_name: Bersch, Beate
last_name: Bersch
- first_name: Patrick
full_name: Horten, Patrick
last_name: Horten
- first_name: Inge
full_name: Perschil, Inge
last_name: Perschil
- first_name: Jean-Claude
full_name: Martinou, Jean-Claude
last_name: Martinou
- first_name: Martin
full_name: van der Laan, Martin
last_name: van der Laan
- first_name: Nils
full_name: Wiedemann, Nils
last_name: Wiedemann
- first_name: Paul
full_name: Schanda, Paul
id: 7B541462-FAF6-11E9-A490-E8DFE5697425
last_name: Schanda
orcid: 0000-0002-9350-7606
- first_name: Nikolaus
full_name: Pfanner, Nikolaus
last_name: Pfanner
citation:
ama: Rampelt H, Sucec I, Bersch B, et al. The mitochondrial carrier pathway transports
non-canonical substrates with an odd number of transmembrane segments. BMC
Biology. 2020;18. doi:10.1186/s12915-019-0733-6
apa: Rampelt, H., Sucec, I., Bersch, B., Horten, P., Perschil, I., Martinou, J.-C.,
… Pfanner, N. (2020). The mitochondrial carrier pathway transports non-canonical
substrates with an odd number of transmembrane segments. BMC Biology. Springer
Nature. https://doi.org/10.1186/s12915-019-0733-6
chicago: Rampelt, Heike, Iva Sucec, Beate Bersch, Patrick Horten, Inge Perschil,
Jean-Claude Martinou, Martin van der Laan, Nils Wiedemann, Paul Schanda, and Nikolaus
Pfanner. “The Mitochondrial Carrier Pathway Transports Non-Canonical Substrates
with an Odd Number of Transmembrane Segments.” BMC Biology. Springer Nature,
2020. https://doi.org/10.1186/s12915-019-0733-6.
ieee: H. Rampelt et al., “The mitochondrial carrier pathway transports non-canonical
substrates with an odd number of transmembrane segments,” BMC Biology,
vol. 18. Springer Nature, 2020.
ista: Rampelt H, Sucec I, Bersch B, Horten P, Perschil I, Martinou J-C, van der
Laan M, Wiedemann N, Schanda P, Pfanner N. 2020. The mitochondrial carrier pathway
transports non-canonical substrates with an odd number of transmembrane segments.
BMC Biology. 18, 2.
mla: Rampelt, Heike, et al. “The Mitochondrial Carrier Pathway Transports Non-Canonical
Substrates with an Odd Number of Transmembrane Segments.” BMC Biology,
vol. 18, 2, Springer Nature, 2020, doi:10.1186/s12915-019-0733-6.
short: H. Rampelt, I. Sucec, B. Bersch, P. Horten, I. Perschil, J.-C. Martinou,
M. van der Laan, N. Wiedemann, P. Schanda, N. Pfanner, BMC Biology 18 (2020).
date_created: 2020-09-17T10:26:53Z
date_published: 2020-01-06T00:00:00Z
date_updated: 2024-10-15T13:23:11Z
day: '06'
doi: 10.1186/s12915-019-0733-6
extern: '1'
external_id:
pmid:
- '31907035'
intvolume: ' 18'
keyword:
- Biotechnology
- Plant Science
- General Biochemistry
- Genetics and Molecular Biology
- Developmental Biology
- Cell Biology
- Physiology
- Ecology
- Evolution
- Behavior and Systematics
- Structural Biology
- General Agricultural and Biological Sciences
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1186/s12915-019-0733-6
month: '01'
oa: 1
oa_version: Published Version
pmid: 1
publication: BMC Biology
publication_identifier:
issn:
- 1741-7007
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: The mitochondrial carrier pathway transports non-canonical substrates with
an odd number of transmembrane segments
type: journal_article
user_id: 0043cee0-e5fc-11ee-9736-f83bc23afbf0
volume: 18
year: '2020'
...
---
_id: '8403'
abstract:
- lang: eng
text: Chaperones are essential for assisting protein folding, and for transferring
poorly soluble proteins to their functional locations within cells. Hydrophobic
interactions drive promiscuous chaperone–client binding, but our understanding
of how additional interactions enable client specificity is sparse. Here we decipher
what determines binding of two chaperones (TIM8·13, TIM9·10) to different integral
membrane proteins, the all-transmembrane mitochondrial carrier Ggc1, and Tim23
which has an additional disordered hydrophilic domain. Combining NMR, SAXS and
molecular dynamics simulations, we determine the structures of Tim23/TIM8·13 and
Tim23/TIM9·10 complexes. TIM8·13 uses transient salt bridges to interact with
the hydrophilic part of its client, but its interactions to the transmembrane
part are weaker than in TIM9·10. Consequently, TIM9·10 outcompetes TIM8·13 in
binding hydrophobic clients, while TIM8·13 is tuned to few clients with both hydrophilic
and hydrophobic parts. Our study exemplifies how chaperones fine-tune the balance
of promiscuity vs. specificity.
article_processing_charge: No
author:
- first_name: Iva
full_name: Sučec, Iva
last_name: Sučec
- first_name: Yong
full_name: Wang, Yong
last_name: Wang
- first_name: Ons
full_name: Dakhlaoui, Ons
last_name: Dakhlaoui
- first_name: Katharina
full_name: Weinhäupl, Katharina
last_name: Weinhäupl
- first_name: Tobias
full_name: Jores, Tobias
last_name: Jores
- first_name: Doriane
full_name: Costa, Doriane
last_name: Costa
- first_name: Audrey
full_name: Hessel, Audrey
last_name: Hessel
- first_name: Martha
full_name: Brennich, Martha
last_name: Brennich
- first_name: Doron
full_name: Rapaport, Doron
last_name: Rapaport
- first_name: Kresten
full_name: Lindorff-Larsen, Kresten
last_name: Lindorff-Larsen
- first_name: Beate
full_name: Bersch, Beate
last_name: Bersch
- first_name: Paul
full_name: Schanda, Paul
id: 7B541462-FAF6-11E9-A490-E8DFE5697425
last_name: Schanda
orcid: 0000-0002-9350-7606
citation:
ama: Sučec I, Wang Y, Dakhlaoui O, et al. Structural basis of client specificity
in mitochondrial membrane-protein chaperones. bioRxiv. doi:10.1101/2020.06.08.140772
apa: Sučec, I., Wang, Y., Dakhlaoui, O., Weinhäupl, K., Jores, T., Costa, D., …
Schanda, P. (n.d.). Structural basis of client specificity in mitochondrial membrane-protein
chaperones. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/2020.06.08.140772
chicago: Sučec, Iva, Yong Wang, Ons Dakhlaoui, Katharina Weinhäupl, Tobias Jores,
Doriane Costa, Audrey Hessel, et al. “Structural Basis of Client Specificity in
Mitochondrial Membrane-Protein Chaperones.” BioRxiv. Cold Spring Harbor
Laboratory, n.d. https://doi.org/10.1101/2020.06.08.140772.
ieee: I. Sučec et al., “Structural basis of client specificity in mitochondrial
membrane-protein chaperones,” bioRxiv. Cold Spring Harbor Laboratory.
ista: Sučec I, Wang Y, Dakhlaoui O, Weinhäupl K, Jores T, Costa D, Hessel A, Brennich
M, Rapaport D, Lindorff-Larsen K, Bersch B, Schanda P. Structural basis of client
specificity in mitochondrial membrane-protein chaperones. bioRxiv, 10.1101/2020.06.08.140772.
mla: Sučec, Iva, et al. “Structural Basis of Client Specificity in Mitochondrial
Membrane-Protein Chaperones.” BioRxiv, Cold Spring Harbor Laboratory, doi:10.1101/2020.06.08.140772.
short: I. Sučec, Y. Wang, O. Dakhlaoui, K. Weinhäupl, T. Jores, D. Costa, A. Hessel,
M. Brennich, D. Rapaport, K. Lindorff-Larsen, B. Bersch, P. Schanda, BioRxiv (n.d.).
date_created: 2020-09-17T10:27:47Z
date_published: 2020-09-17T00:00:00Z
date_updated: 2021-01-12T08:19:02Z
day: '17'
doi: 10.1101/2020.06.08.140772
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/2020.06.08.140772
month: '09'
oa: 1
oa_version: Preprint
publication: bioRxiv
publication_status: submitted
publisher: Cold Spring Harbor Laboratory
status: public
title: Structural basis of client specificity in mitochondrial membrane-protein chaperones
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '8404'
abstract:
- lang: eng
text: The mitochondrial Tim chaperones are responsible for the transport
of membrane proteins across the inter-membrane space to the inner and outer mitochondrial
membranes. TIM9·10, a hexameric 70 kDa protein complex formed by 3 copies of Tim9
and Tim10, guides its clients across the aqueous compartment. The TIM9·10·12 complex
is the anchor point at the inner-membrane insertase complex TIM22. The mechanism
of client transport by TIM9·10 has been resolved recently, but the structure and
subunit composition of the TIM9·10·12 complex remains largely unresolved. Furthermore,
the assembly process of the hexameric TIM chaperones from its subunits remained
elusive. We investigate the structural and dynamical properties of the Tim subunits,
and show that they are highly dynamic. In their non-assembled form, the subunits
behave as intrinsically disordered proteins; when the conserved cysteines of the
CX3C-Xn-CX3C
motifs are formed, short marginally stable α-helices
are formed, which are only fully stabilized upon hexamer formation to the mature
chaperone. Subunits are in equilibrium between their hexamer-embedded and a free
form, with exchange kinetics on a minutes time scale. Joint NMR, small-angle X-ray
scattering and MD simulation data allow us to derive a structural model of the
TIM9·10·12 assembly, which has a 2:3:1 stoichiometry (Tim9:Tim10:Tim12) with a
conserved hydrophobic client-binding groove and flexible N- and C-terminal tentacles.
article_processing_charge: No
author:
- first_name: Katharina
full_name: Weinhäupl, Katharina
last_name: Weinhäupl
- first_name: Yong
full_name: Wang, Yong
last_name: Wang
- first_name: Audrey
full_name: Hessel, Audrey
last_name: Hessel
- first_name: Martha
full_name: Brennich, Martha
last_name: Brennich
- first_name: Kresten
full_name: Lindorff-Larsen, Kresten
last_name: Lindorff-Larsen
- first_name: Paul
full_name: Schanda, Paul
id: 7B541462-FAF6-11E9-A490-E8DFE5697425
last_name: Schanda
orcid: 0000-0002-9350-7606
citation:
ama: Weinhäupl K, Wang Y, Hessel A, Brennich M, Lindorff-Larsen K, Schanda P. Architecture
and subunit dynamics of the mitochondrial TIM9·10·12 chaperone. bioRxiv.
doi:10.1101/2020.03.13.990150
apa: Weinhäupl, K., Wang, Y., Hessel, A., Brennich, M., Lindorff-Larsen, K., &
Schanda, P. (n.d.). Architecture and subunit dynamics of the mitochondrial TIM9·10·12
chaperone. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/2020.03.13.990150
chicago: Weinhäupl, Katharina, Yong Wang, Audrey Hessel, Martha Brennich, Kresten
Lindorff-Larsen, and Paul Schanda. “Architecture and Subunit Dynamics of the Mitochondrial
TIM9·10·12 Chaperone.” BioRxiv. Cold Spring Harbor Laboratory, n.d. https://doi.org/10.1101/2020.03.13.990150.
ieee: K. Weinhäupl, Y. Wang, A. Hessel, M. Brennich, K. Lindorff-Larsen, and P.
Schanda, “Architecture and subunit dynamics of the mitochondrial TIM9·10·12 chaperone,”
bioRxiv. Cold Spring Harbor Laboratory.
ista: Weinhäupl K, Wang Y, Hessel A, Brennich M, Lindorff-Larsen K, Schanda P. Architecture
and subunit dynamics of the mitochondrial TIM9·10·12 chaperone. bioRxiv, 10.1101/2020.03.13.990150.
mla: Weinhäupl, Katharina, et al. “Architecture and Subunit Dynamics of the Mitochondrial
TIM9·10·12 Chaperone.” BioRxiv, Cold Spring Harbor Laboratory, doi:10.1101/2020.03.13.990150.
short: K. Weinhäupl, Y. Wang, A. Hessel, M. Brennich, K. Lindorff-Larsen, P. Schanda,
BioRxiv (n.d.).
date_created: 2020-09-17T10:27:59Z
date_published: 2020-03-14T00:00:00Z
date_updated: 2021-01-12T08:19:03Z
day: '14'
doi: 10.1101/2020.03.13.990150
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/2020.03.13.990150
month: '03'
oa: 1
oa_version: Preprint
publication: bioRxiv
publication_status: submitted
publisher: Cold Spring Harbor Laboratory
status: public
title: Architecture and subunit dynamics of the mitochondrial TIM9·10·12 chaperone
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2020'
...
---
_id: '8414'
abstract:
- lang: eng
text: "Arnold diffusion, which concerns the appearance of chaos in classical mechanics,
is one of the most important problems in the fields of dynamical systems and mathematical
physics. Since it was discovered by Vladimir Arnold in 1963, it has attracted
the efforts of some of the most prominent researchers in mathematics. The question
is whether a typical perturbation of a particular system will result in chaotic
or unstable dynamical phenomena. In this groundbreaking book, Vadim Kaloshin and
Ke Zhang provide the first complete proof of Arnold diffusion, demonstrating that
that there is topological instability for typical perturbations of five-dimensional
integrable systems (two and a half degrees of freedom).\r\nThis proof realizes
a plan John Mather announced in 2003 but was unable to complete before his death.
Kaloshin and Zhang follow Mather’s strategy but emphasize a more Hamiltonian approach,
tying together normal forms theory, hyperbolic theory, Mather theory, and weak
KAM theory. Offering a complete, clean, and modern explanation of the steps involved
in the proof, and a clear account of background material, this book is designed
to be accessible to students as well as researchers. The result is a critical
contribution to mathematical physics and dynamical systems, especially Hamiltonian
systems."
alternative_title:
- Annals of Mathematics Studies
article_processing_charge: No
author:
- first_name: Vadim
full_name: Kaloshin, Vadim
id: FE553552-CDE8-11E9-B324-C0EBE5697425
last_name: Kaloshin
orcid: 0000-0002-6051-2628
- first_name: Ke
full_name: Zhang, Ke
last_name: Zhang
citation:
ama: Kaloshin V, Zhang K. Arnold Diffusion for Smooth Systems of Two and a Half
Degrees of Freedom. Vol 208. 1st ed. Princeton University Press; 2020. doi:10.1515/9780691204932
apa: Kaloshin, V., & Zhang, K. (2020). Arnold Diffusion for Smooth Systems
of Two and a Half Degrees of Freedom (1st ed., Vol. 208). Princeton University
Press. https://doi.org/10.1515/9780691204932
chicago: Kaloshin, Vadim, and Ke Zhang. Arnold Diffusion for Smooth Systems of
Two and a Half Degrees of Freedom. 1st ed. Vol. 208. AMS. Princeton University
Press, 2020. https://doi.org/10.1515/9780691204932.
ieee: V. Kaloshin and K. Zhang, Arnold Diffusion for Smooth Systems of Two and
a Half Degrees of Freedom, 1st ed., vol. 208. Princeton University Press,
2020.
ista: Kaloshin V, Zhang K. 2020. Arnold Diffusion for Smooth Systems of Two and
a Half Degrees of Freedom 1st ed., Princeton University Press, 224p.
mla: Kaloshin, Vadim, and Ke Zhang. Arnold Diffusion for Smooth Systems of Two
and a Half Degrees of Freedom. 1st ed., vol. 208, Princeton University Press,
2020, doi:10.1515/9780691204932.
short: V. Kaloshin, K. Zhang, Arnold Diffusion for Smooth Systems of Two and a Half
Degrees of Freedom, 1st ed., Princeton University Press, 2020.
date_created: 2020-09-17T10:41:05Z
date_published: 2020-03-01T00:00:00Z
date_updated: 2021-12-21T10:50:49Z
day: '01'
doi: 10.1515/9780691204932
edition: '1'
extern: '1'
intvolume: ' 208'
language:
- iso: eng
month: '03'
oa_version: None
page: '224'
publication_identifier:
isbn:
- 9-780-6912-0253-2
publication_status: published
publisher: Princeton University Press
quality_controlled: '1'
scopus_import: '1'
series_title: AMS
status: public
title: Arnold Diffusion for Smooth Systems of Two and a Half Degrees of Freedom
type: book
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 208
year: '2020'
...
---
_id: '8533'
abstract:
- lang: eng
text: Game of Life is a simple and elegant model to study dynamical system over
networks. The model consists of a graph where every vertex has one of two types,
namely, dead or alive. A configuration is a mapping of the vertices to the types.
An update rule describes how the type of a vertex is updated given the types of
its neighbors. In every round, all vertices are updated synchronously, which leads
to a configuration update. While in general, Game of Life allows a broad range
of update rules, we focus on two simple families of update rules, namely, underpopulation
and overpopulation, that model several interesting dynamics studied in the literature.
In both settings, a dead vertex requires at least a desired number of live neighbors
to become alive. For underpopulation (resp., overpopulation), a live vertex requires
at least (resp. at most) a desired number of live neighbors to remain alive. We
study the basic computation problems, e.g., configuration reachability, for these
two families of rules. For underpopulation rules, we show that these problems
can be solved in polynomial time, whereas for overpopulation rules they are PSPACE-complete.
acknowledgement: "Krishnendu Chatterjee: The research was partially supported by the
Vienna Science and\r\nTechnology Fund (WWTF) Project ICT15-003.\r\nIsmaël Jecker:
This project has received funding from the European Union’s Horizon 2020 research\r\nand
innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411."
alternative_title:
- LIPIcs
article_number: 22:1-22:13
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Ismael R
full_name: Jecker, Ismael R
id: 85D7C63E-7D5D-11E9-9C0F-98C4E5697425
last_name: Jecker
- first_name: Jakub
full_name: Svoboda, Jakub
id: 130759D2-D7DD-11E9-87D2-DE0DE6697425
last_name: Svoboda
orcid: 0000-0002-1419-3267
citation:
ama: 'Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. Simplified game of life:
Algorithms and complexity. In: 45th International Symposium on Mathematical
Foundations of Computer Science. Vol 170. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2020. doi:10.4230/LIPIcs.MFCS.2020.22'
apa: 'Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., & Svoboda, J. (2020).
Simplified game of life: Algorithms and complexity. In 45th International Symposium
on Mathematical Foundations of Computer Science (Vol. 170). Prague, Czech
Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2020.22'
chicago: 'Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub
Svoboda. “Simplified Game of Life: Algorithms and Complexity.” In 45th International
Symposium on Mathematical Foundations of Computer Science, Vol. 170. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.MFCS.2020.22.'
ieee: 'K. Chatterjee, R. Ibsen-Jensen, I. R. Jecker, and J. Svoboda, “Simplified
game of life: Algorithms and complexity,” in 45th International Symposium on
Mathematical Foundations of Computer Science, Prague, Czech Republic, 2020,
vol. 170.'
ista: 'Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. 2020. Simplified game
of life: Algorithms and complexity. 45th International Symposium on Mathematical
Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science,
LIPIcs, vol. 170, 22:1-22:13.'
mla: 'Chatterjee, Krishnendu, et al. “Simplified Game of Life: Algorithms and Complexity.”
45th International Symposium on Mathematical Foundations of Computer Science,
vol. 170, 22:1-22:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020,
doi:10.4230/LIPIcs.MFCS.2020.22.'
short: K. Chatterjee, R. Ibsen-Jensen, I.R. Jecker, J. Svoboda, in:, 45th International
Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl -
Leibniz-Zentrum für Informatik, 2020.
conference:
end_date: 2020-08-28
location: Prague, Czech Republic
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2020-08-24
date_created: 2020-09-20T22:01:36Z
date_published: 2020-08-18T00:00:00Z
date_updated: 2025-07-10T11:57:06Z
day: '18'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.MFCS.2020.22
ec_funded: 1
external_id:
arxiv:
- '2007.02894'
file:
- access_level: open_access
checksum: bbd7c4f55d45f2ff2a0a4ef0e10a77b1
content_type: application/pdf
creator: dernst
date_created: 2020-09-21T13:57:34Z
date_updated: 2020-09-21T13:57:34Z
file_id: '8550'
file_name: 2020_LIPIcs_Chatterjee.pdf
file_size: 491374
relation: main_file
success: 1
file_date_updated: 2020-09-21T13:57:34Z
has_accepted_license: '1'
intvolume: ' 170'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 45th International Symposium on Mathematical Foundations of Computer
Science
publication_identifier:
isbn:
- '9783959771597'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Simplified game of life: Algorithms and complexity'
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: 170
year: '2020'
...
---
_id: '8534'
abstract:
- lang: eng
text: A regular language L of finite words is composite if there are regular languages
L₁,L₂,…,L_t such that L = ⋂_{i = 1}^t L_i and the index (number of states in a
minimal DFA) of every language L_i is strictly smaller than the index of L. Otherwise,
L is prime. Primality of regular languages was introduced and studied in [O. Kupferman
and J. Mosheiff, 2015], where the complexity of deciding the primality of the
language of a given DFA was left open, with a doubly-exponential gap between the
upper and lower bounds. We study primality for unary regular languages, namely
regular languages with a singleton alphabet. A unary language corresponds to a
subset of ℕ, making the study of unary prime languages closer to that of primality
in number theory. We show that the setting of languages is richer. In particular,
while every composite number is the product of two smaller numbers, the number
t of languages necessary to decompose a composite unary language induces a strict
hierarchy. In addition, a primality witness for a unary language L, namely a word
that is not in L but is in all products of languages that contain L and have an
index smaller than L’s, may be of exponential length. Still, we are able to characterize
compositionality by structural properties of a DFA for L, leading to a LogSpace
algorithm for primality checking of unary DFAs.
acknowledgement: "Ismaël Jecker: This project has received funding from the European
Union’s Horizon\r\n2020 research and innovation programme under the Marie Skłodowska-Curie
Grant Agreement No.\r\n754411. Nicolas Mazzocchi: PhD fellowship FRIA from the F.R.S.-FNRS."
alternative_title:
- LIPIcs
article_number: 51:1-51:12
article_processing_charge: No
author:
- first_name: Ismael R
full_name: Jecker, Ismael R
id: 85D7C63E-7D5D-11E9-9C0F-98C4E5697425
last_name: Jecker
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
- first_name: Nicolas
full_name: Mazzocchi, Nicolas
last_name: Mazzocchi
citation:
ama: 'Jecker IR, Kupferman O, Mazzocchi N. Unary prime languages. In: 45th International
Symposium on Mathematical Foundations of Computer Science. Vol 170. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.MFCS.2020.51'
apa: 'Jecker, I. R., Kupferman, O., & Mazzocchi, N. (2020). Unary prime languages.
In 45th International Symposium on Mathematical Foundations of Computer Science
(Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.MFCS.2020.51'
chicago: Jecker, Ismael R, Orna Kupferman, and Nicolas Mazzocchi. “Unary Prime Languages.”
In 45th International Symposium on Mathematical Foundations of Computer Science,
Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.MFCS.2020.51.
ieee: I. R. Jecker, O. Kupferman, and N. Mazzocchi, “Unary prime languages,” in
45th International Symposium on Mathematical Foundations of Computer Science,
Prague, Czech Republic, 2020, vol. 170.
ista: 'Jecker IR, Kupferman O, Mazzocchi N. 2020. Unary prime languages. 45th International
Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical
Foundations of Computer Science, LIPIcs, vol. 170, 51:1-51:12.'
mla: Jecker, Ismael R., et al. “Unary Prime Languages.” 45th International Symposium
on Mathematical Foundations of Computer Science, vol. 170, 51:1-51:12, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.MFCS.2020.51.
short: I.R. Jecker, O. Kupferman, N. Mazzocchi, in:, 45th International Symposium
on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2020.
conference:
end_date: 2020-08-28
location: Prague, Czech Republic
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2020-08-24
corr_author: '1'
date_created: 2020-09-20T22:01:36Z
date_published: 2020-08-18T00:00:00Z
date_updated: 2025-07-10T11:57:07Z
day: '18'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.MFCS.2020.51
ec_funded: 1
file:
- access_level: open_access
checksum: 2dc9e2fad6becd4563aef3e27a473f70
content_type: application/pdf
creator: dernst
date_created: 2020-09-21T14:17:08Z
date_updated: 2020-09-21T14:17:08Z
file_id: '8552'
file_name: 2020_LIPIcsMFCS_Jecker.pdf
file_size: 597977
relation: main_file
success: 1
file_date_updated: 2020-09-21T14:17:08Z
has_accepted_license: '1'
intvolume: ' 170'
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: 45th International Symposium on Mathematical Foundations of Computer
Science
publication_identifier:
isbn:
- '9783959771597'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Unary prime languages
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: 170
year: '2020'
...