---
_id: '10053'
abstract:
- lang: eng
text: 'This paper characterizes the latency of the simplified successive-cancellation
(SSC) decoding scheme for polar codes under hardware resource constraints. In
particular, when the number of processing elements P that can perform SSC decoding
operations in parallel is limited, as is the case in practice, the latency of
SSC decoding is O(N1−1 μ+NPlog2log2NP), where N is the block length of the code
and μ is the scaling exponent of polar codes for the channel. Three direct consequences
of this bound are presented. First, in a fully-parallel implementation where P=N2
, the latency of SSC decoding is O(N1−1/μ) , which is sublinear in the block length.
This recovers a result from an earlier work. Second, in a fully-serial implementation
where P=1 , the latency of SSC decoding scales as O(Nlog2log2N) . The multiplicative
constant is also calculated: we show that the latency of SSC decoding when P=1
is given by (2+o(1))Nlog2log2N . Third, in a semi-parallel implementation, the
smallest P that gives the same latency as that of the fully-parallel implementation
is P=N1/μ . The tightness of our bound on SSC decoding latency and the applicability
of the foregoing results is validated through extensive simulations.'
acknowledgement: "S. A. Hashemi is supported by a Postdoctoral Fellowship from the
Natural Sciences and Engineering Research Council\r\nof Canada (NSERC) and by Huawei.
M. Mondelli is partially supported by the 2019 Lopez-Loreta Prize. A. Fazeli and
A. Vardy were supported in part by the National Science Foundation under Grant CCF-1764104."
article_processing_charge: No
arxiv: 1
author:
- first_name: Seyyed Ali
full_name: Hashemi, Seyyed Ali
last_name: Hashemi
- first_name: Marco
full_name: Mondelli, Marco
id: 27EB676C-8706-11E9-9510-7717E6697425
last_name: Mondelli
orcid: 0000-0002-3242-7020
- first_name: Arman
full_name: Fazeli, Arman
last_name: Fazeli
- first_name: Alexander
full_name: Vardy, Alexander
last_name: Vardy
- first_name: John
full_name: Cioffi, John
last_name: Cioffi
- first_name: Andrea
full_name: Goldsmith, Andrea
last_name: Goldsmith
citation:
ama: 'Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. Parallelism
versus latency in simplified successive-cancellation decoding of polar codes.
In: 2021 IEEE International Symposium on Information Theory. Institute
of Electrical and Electronics Engineers; 2021:2369-2374. doi:10.1109/ISIT45174.2021.9518153'
apa: 'Hashemi, S. A., Mondelli, M., Fazeli, A., Vardy, A., Cioffi, J., & Goldsmith,
A. (2021). Parallelism versus latency in simplified successive-cancellation decoding
of polar codes. In 2021 IEEE International Symposium on Information Theory
(pp. 2369–2374). Melbourne, Australia: Institute of Electrical and Electronics
Engineers. https://doi.org/10.1109/ISIT45174.2021.9518153'
chicago: Hashemi, Seyyed Ali, Marco Mondelli, Arman Fazeli, Alexander Vardy, John
Cioffi, and Andrea Goldsmith. “Parallelism versus Latency in Simplified Successive-Cancellation
Decoding of Polar Codes.” In 2021 IEEE International Symposium on Information
Theory, 2369–74. Institute of Electrical and Electronics Engineers, 2021.
https://doi.org/10.1109/ISIT45174.2021.9518153.
ieee: S. A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, and A. Goldsmith,
“Parallelism versus latency in simplified successive-cancellation decoding of
polar codes,” in 2021 IEEE International Symposium on Information Theory,
Melbourne, Australia, 2021, pp. 2369–2374.
ista: 'Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. 2021. Parallelism
versus latency in simplified successive-cancellation decoding of polar codes.
2021 IEEE International Symposium on Information Theory. ISIT: International Symposium
on Information Theory, 2369–2374.'
mla: Hashemi, Seyyed Ali, et al. “Parallelism versus Latency in Simplified Successive-Cancellation
Decoding of Polar Codes.” 2021 IEEE International Symposium on Information
Theory, Institute of Electrical and Electronics Engineers, 2021, pp. 2369–74,
doi:10.1109/ISIT45174.2021.9518153.
short: S.A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, A. Goldsmith,
in:, 2021 IEEE International Symposium on Information Theory, Institute of Electrical
and Electronics Engineers, 2021, pp. 2369–2374.
conference:
end_date: 2021-07-20
location: Melbourne, Australia
name: 'ISIT: International Symposium on Information Theory'
start_date: 2021-07-12
date_created: 2021-09-27T14:33:14Z
date_published: 2021-09-01T00:00:00Z
date_updated: 2024-09-10T13:03:18Z
day: '01'
department:
- _id: MaMo
doi: 10.1109/ISIT45174.2021.9518153
external_id:
arxiv:
- '2012.13378'
isi:
- '000701502202078'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2012.13378
month: '09'
oa: 1
oa_version: Preprint
page: 2369-2374
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
name: Prix Lopez-Loretta 2019 - Marco Mondelli
publication: 2021 IEEE International Symposium on Information Theory
publication_identifier:
eisbn:
- 978-1-5386-8209-8
isbn:
- 978-1-5386-8210-4
issn:
- 2157-8095
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
related_material:
record:
- id: '10364'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Parallelism versus latency in simplified successive-cancellation decoding of
polar codes
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2021'
...
---
_id: '10054'
abstract:
- lang: eng
text: 'Graphs and games on graphs are fundamental models for the analysis of reactive
systems, in particular, for model-checking and the synthesis of reactive systems.
The class of ω-regular languages provides a robust specification formalism for
the desired properties of reactive systems. In the classical infinitary formulation
of the liveness part of an ω-regular specification, a "good" event must happen
eventually without any bound between the good events. A stronger notion of liveness
is bounded liveness, which requires that good events happen within d transitions.
Given a graph or a game graph with n vertices, m edges, and a bounded liveness
objective, the previous best-known algorithmic bounds are as follows: (i) O(dm)
for graphs, which in the worst-case is O(n³); and (ii) O(n² d²) for games on graphs.
Our main contributions improve these long-standing algorithmic bounds. For graphs
we present: (i) a randomized algorithm with one-sided error with running time
O(n^{2.5} log n) for the bounded liveness objectives; and (ii) a deterministic
linear-time algorithm for the complement of bounded liveness objectives. For games
on graphs, we present an O(n² d) time algorithm for the bounded liveness objectives.'
acknowledgement: 'Krishnendu Chatterjee: Supported by the ERC CoG 863818 (ForM-SMArt).
Monika Henzinger: Supported by the Austrian Science Fund (FWF) and netIDEE SCIENCE
project P 33775-N. Sagar Sudhir Kale: Partially supported by the Vienna Science
and Technology Fund (WWTF) through project ICT15-003. Alexander Svozil: Fully supported
by the Vienna Science and Technology Fund (WWTF) through project ICT15-003.'
alternative_title:
- LIPIcs
article_number: '124'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Sagar Sudhir
full_name: Kale, Sagar Sudhir
last_name: Kale
- first_name: Alexander
full_name: Svozil, Alexander
last_name: Svozil
citation:
ama: 'Chatterjee K, Henzinger MH, Kale SS, Svozil A. Faster algorithms for bounded
liveness in graphs and game graphs. In: 48th International Colloquium on Automata,
Languages, and Programming. Vol 198. Schloss Dagstuhl - Leibniz Zentrum für
Informatik; 2021. doi:10.4230/LIPIcs.ICALP.2021.124'
apa: 'Chatterjee, K., Henzinger, M. H., Kale, S. S., & Svozil, A. (2021). Faster
algorithms for bounded liveness in graphs and game graphs. In 48th International
Colloquium on Automata, Languages, and Programming (Vol. 198). Glasgow, Scotland:
Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2021.124'
chicago: Chatterjee, Krishnendu, Monika H Henzinger, Sagar Sudhir Kale, and Alexander
Svozil. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.” In
48th International Colloquium on Automata, Languages, and Programming,
Vol. 198. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.ICALP.2021.124.
ieee: K. Chatterjee, M. H. Henzinger, S. S. Kale, and A. Svozil, “Faster algorithms
for bounded liveness in graphs and game graphs,” in 48th International Colloquium
on Automata, Languages, and Programming, Glasgow, Scotland, 2021, vol. 198.
ista: 'Chatterjee K, Henzinger MH, Kale SS, Svozil A. 2021. Faster algorithms for
bounded liveness in graphs and game graphs. 48th International Colloquium on Automata,
Languages, and Programming. ICALP: International Colloquium on Automata, Languages,
and Programming, LIPIcs, vol. 198, 124.'
mla: Chatterjee, Krishnendu, et al. “Faster Algorithms for Bounded Liveness in Graphs
and Game Graphs.” 48th International Colloquium on Automata, Languages, and
Programming, vol. 198, 124, Schloss Dagstuhl - Leibniz Zentrum für Informatik,
2021, doi:10.4230/LIPIcs.ICALP.2021.124.
short: K. Chatterjee, M.H. Henzinger, S.S. Kale, A. Svozil, in:, 48th International
Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz
Zentrum für Informatik, 2021.
conference:
end_date: 2021-07-16
location: Glasgow, Scotland
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2021-07-12
date_created: 2021-09-27T14:33:15Z
date_published: 2021-07-02T00:00:00Z
date_updated: 2025-07-14T09:10:08Z
day: '02'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.ICALP.2021.124
ec_funded: 1
file:
- access_level: open_access
checksum: 5a3fed8dbba8c088cbeac1e24cc10bc5
content_type: application/pdf
creator: cchlebak
date_created: 2021-10-01T08:49:26Z
date_updated: 2021-10-01T08:49:26Z
file_id: '10062'
file_name: 2021_LIPIcs_Chatterjee.pdf
file_size: 854576
relation: main_file
success: 1
file_date_updated: 2021-10-01T08:49:26Z
has_accepted_license: '1'
intvolume: ' 198'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: 48th International Colloquium on Automata, Languages, and Programming
publication_identifier:
isbn:
- 978-3-95977-195-5
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Faster algorithms for bounded liveness in graphs and game graphs
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 198
year: '2021'
...
---
_id: '10055'
abstract:
- lang: eng
text: "Repeated idempotent elements are commonly used to characterise iterable behaviours
in abstract models of computation. Therefore, given a monoid M, it is natural
to ask how long a sequence of elements of M needs to be to ensure the presence
of consecutive idempotent factors. This question is formalised through the notion
of the Ramsey function R_M associated to M, obtained by mapping every k ∈ ℕ to
the minimal integer R_M(k) such that every word u ∈ M^* of length R_M(k) contains
k consecutive non-empty factors that correspond to the same idempotent element
of M. In this work, we study the behaviour of the Ramsey function R_M by investigating
the regular \U0001D49F-length of M, defined as the largest size L(M) of a submonoid
of M isomorphic to the set of natural numbers {1,2, …, L(M)} equipped with the
max operation. We show that the regular \U0001D49F-length of M determines the
degree of R_M, by proving that k^L(M) ≤ R_M(k) ≤ (k|M|⁴)^L(M). To allow applications
of this result, we provide the value of the regular \U0001D49F-length of diverse
monoids. In particular, we prove that the full monoid of n × n Boolean matrices,
which is used to express transition monoids of non-deterministic automata, has
a regular \U0001D49F-length of (n²+n+2)/2."
acknowledgement: This project has received funding from the European Union’s Horizon
2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement
No. 754411. I wish to thank Michaël Cadilhac, Emmanuel Filiot and Charles Paperman
for their valuable insights concerning Green’s relations.
alternative_title:
- LIPIcs
article_number: '44'
article_processing_charge: No
author:
- first_name: Ismael R
full_name: Jecker, Ismael R
id: 85D7C63E-7D5D-11E9-9C0F-98C4E5697425
last_name: Jecker
citation:
ama: 'Jecker IR. A Ramsey theorem for finite monoids. In: 38th International
Symposium on Theoretical Aspects of Computer Science. Vol 187. Schloss Dagstuhl
- Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.STACS.2021.44'
apa: 'Jecker, I. R. (2021). A Ramsey theorem for finite monoids. In 38th International
Symposium on Theoretical Aspects of Computer Science (Vol. 187). Saarbrücken,
Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2021.44'
chicago: Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.” In 38th International
Symposium on Theoretical Aspects of Computer Science, Vol. 187. Schloss Dagstuhl
- Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.STACS.2021.44.
ieee: I. R. Jecker, “A Ramsey theorem for finite monoids,” in 38th International
Symposium on Theoretical Aspects of Computer Science, Saarbrücken, Germany,
2021, vol. 187.
ista: 'Jecker IR. 2021. A Ramsey theorem for finite monoids. 38th International
Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical
Aspects of Computer Science, LIPIcs, vol. 187, 44.'
mla: Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.” 38th International
Symposium on Theoretical Aspects of Computer Science, vol. 187, 44, Schloss
Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.STACS.2021.44.
short: I.R. Jecker, in:, 38th International Symposium on Theoretical Aspects of
Computer Science, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
conference:
end_date: 2021-03-19
location: Saarbrücken, Germany
name: 'STACS: Symposium on Theoretical Aspects of Computer Science'
start_date: 2021-03-16
date_created: 2021-09-27T14:33:15Z
date_published: 2021-03-10T00:00:00Z
date_updated: 2023-08-14T07:03:23Z
day: '10'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.STACS.2021.44
ec_funded: 1
external_id:
isi:
- '000635691700044'
file:
- access_level: open_access
checksum: 17432a05733f408de300e17e390a90e4
content_type: application/pdf
creator: cchlebak
date_created: 2021-10-01T09:55:00Z
date_updated: 2021-10-01T09:55:00Z
file_id: '10063'
file_name: 2021_LIPIcs_Jecker.pdf
file_size: 720250
relation: main_file
success: 1
file_date_updated: 2021-10-01T09:55:00Z
has_accepted_license: '1'
intvolume: ' 187'
isi: 1
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 38th International Symposium on Theoretical Aspects of Computer Science
publication_identifier:
isbn:
- 978-3-9597-7180-1
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: A Ramsey theorem for finite monoids
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 187
year: '2021'
...
---
_id: '10058'
abstract:
- lang: eng
text: 'Quantum information and computation has become a vast field paved with opportunities
for researchers and investors. As large multinational companies and international
funds are heavily investing in quantum technologies it is still a question which
platform is best suited for the task of realizing a scalable quantum processor.
In this work we investigate hole spins in Ge quantum wells. These hold great promise
as they possess several favorable properties: a small effective mass, a strong
spin-orbit coupling, long relaxation time and an inherent immunity to hyperfine
noise. All these characteristics helped Ge hole spin qubits to evolve from a single
qubit to a fully entangled four qubit processor in only 3 years. Here, we investigated
a qubit approach leveraging the large out-of-plane g-factors of heavy hole states
in Ge quantum dots. We found this qubit to be reproducibly operable at extremely
low magnetic field and at large speeds while maintaining coherence. This was possible
because large differences of g-factors in adjacent dots can be achieved in the
out-of-plane direction. In the in-plane direction the small g-factors, on the
other hand, can be altered very effectively by the confinement potentials. Here,
we found that this can even lead to a sign change of the g-factors. The resulting
g-factor difference alters the dynamics of the system drastically and produces
effects typically attributed to a spin-orbit induced spin-flip term. The investigations
carried out in this thesis give further insights into the possibilities of holes
in Ge and reveal new physical properties that need to be considered when designing
future spin qubit experiments.'
acknowledged_ssus:
- _id: M-Shop
- _id: NanoFab
acknowledgement: The author gratefully acknowledges support by the Austrian Science
Fund (FWF), grants No P30207, and the Nomis foundation.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Daniel
full_name: Jirovec, Daniel
id: 4C473F58-F248-11E8-B48F-1D18A9856A87
last_name: Jirovec
orcid: 0000-0002-7197-4801
citation:
ama: Jirovec D. Singlet-Triplet qubits and spin-orbit interaction in 2-dimensional
Ge hole gases. 2021. doi:10.15479/at:ista:10058
apa: Jirovec, D. (2021). Singlet-Triplet qubits and spin-orbit interaction in
2-dimensional Ge hole gases. Institute of Science and Technology Austria.
https://doi.org/10.15479/at:ista:10058
chicago: Jirovec, Daniel. “Singlet-Triplet Qubits and Spin-Orbit Interaction in
2-Dimensional Ge Hole Gases.” Institute of Science and Technology Austria, 2021.
https://doi.org/10.15479/at:ista:10058.
ieee: D. Jirovec, “Singlet-Triplet qubits and spin-orbit interaction in 2-dimensional
Ge hole gases,” Institute of Science and Technology Austria, 2021.
ista: Jirovec D. 2021. Singlet-Triplet qubits and spin-orbit interaction in 2-dimensional
Ge hole gases. Institute of Science and Technology Austria.
mla: Jirovec, Daniel. Singlet-Triplet Qubits and Spin-Orbit Interaction in 2-Dimensional
Ge Hole Gases. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10058.
short: D. Jirovec, Singlet-Triplet Qubits and Spin-Orbit Interaction in 2-Dimensional
Ge Hole Gases, Institute of Science and Technology Austria, 2021.
date_created: 2021-09-30T07:53:49Z
date_published: 2021-10-05T00:00:00Z
date_updated: 2023-09-08T11:41:08Z
day: '05'
ddc:
- '621'
- '539'
degree_awarded: PhD
department:
- _id: GradSch
- _id: GeKa
doi: 10.15479/at:ista:10058
file:
- access_level: closed
checksum: ad6bcb24083ed7c02baaf1885c9ea3d5
content_type: application/x-zip-compressed
creator: djirovec
date_created: 2021-09-30T14:29:14Z
date_updated: 2022-12-20T23:30:07Z
embargo_to: open_access
file_id: '10061'
file_name: PHD_Thesis_Jirovec_Source.zip
file_size: 32397600
relation: source_file
- access_level: open_access
checksum: 5fbe08d4f66d1153e04c47971538fae8
content_type: application/pdf
creator: djirovec
date_created: 2021-10-05T07:56:49Z
date_updated: 2022-12-20T23:30:07Z
embargo: 2022-10-06
file_id: '10087'
file_name: PHD_Thesis_pdfa2b_1.pdf
file_size: 26910829
relation: main_file
file_date_updated: 2022-12-20T23:30:07Z
has_accepted_license: '1'
keyword:
- qubits
- quantum computing
- holes
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '151'
project:
- _id: 2641CE5E-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P30207
name: Hole spin orbit qubits in Ge quantum wells
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '8831'
relation: part_of_dissertation
status: public
- id: '10065'
relation: part_of_dissertation
status: public
- id: '10066'
relation: part_of_dissertation
status: public
- id: '8909'
relation: part_of_dissertation
status: public
- id: '5816'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
title: Singlet-Triplet qubits and spin-orbit interaction in 2-dimensional Ge hole
gases
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '10066'
abstract:
- lang: eng
text: The potential of Si and SiGe-based devices for the scaling of quantum circuits
is tainted by device variability. Each device needs to be tuned to operation conditions.
We give a key step towards tackling this variability with an algorithm that, without
modification, is capable of tuning a 4-gate Si FinFET, a 5-gate GeSi nanowire
and a 7-gate SiGe heterostructure double quantum dot device from scratch. We achieve
tuning times of 30, 10, and 92 minutes, respectively. The algorithm also provides
insight into the parameter space landscape for each of these devices. These results
show that overarching solutions for the tuning of quantum devices are enabled
by machine learning.
acknowledged_ssus:
- _id: NanoFab
acknowledgement: "We acknowledge Ang Li, Erik P. A. M. Bakkers (University of Eindhoven)
for the fabrication of the Ge/Si nanowire. This work was supported by the Royal
Society, the EPSRC National Quantum Technology Hub in Networked Quantum Information
Technology (EP/M013243/1), Quantum Technology Capital (EP/N014995/1), EPSRC Platform
Grant\r\n(EP/R029229/1), the European Research Council (Grant agreement 948932),
the Swiss Nanoscience Institute, the\r\nNCCR SPIN, the EU H2020 European Microkelvin
Platform EMP grant No. 824109, the Scientific Service Units\r\nof IST Austria through
resources provided by the nanofabrication facility and, the FWF-P30207 project.
This publication was also made possible through support from Templeton World Charity
Foundation and John Templeton Foundation. The opinions expressed in this publication
are those of the authors and do not necessarily reflect the views of the Templeton
Foundations."
article_number: '2107.12975'
article_processing_charge: No
arxiv: 1
author:
- first_name: B.
full_name: Severin, B.
last_name: Severin
- first_name: D. T.
full_name: Lennon, D. T.
last_name: Lennon
- first_name: L. C.
full_name: Camenzind, L. C.
last_name: Camenzind
- first_name: F.
full_name: Vigneau, F.
last_name: Vigneau
- first_name: F.
full_name: Fedele, F.
last_name: Fedele
- first_name: Daniel
full_name: Jirovec, Daniel
id: 4C473F58-F248-11E8-B48F-1D18A9856A87
last_name: Jirovec
orcid: 0000-0002-7197-4801
- first_name: A.
full_name: Ballabio, A.
last_name: Ballabio
- first_name: D.
full_name: Chrastina, D.
last_name: Chrastina
- first_name: G.
full_name: Isella, G.
last_name: Isella
- first_name: M. de
full_name: Kruijf, M. de
last_name: Kruijf
- first_name: M. J.
full_name: Carballido, M. J.
last_name: Carballido
- first_name: S.
full_name: Svab, S.
last_name: Svab
- first_name: A. V.
full_name: Kuhlmann, A. V.
last_name: Kuhlmann
- first_name: F. R.
full_name: Braakman, F. R.
last_name: Braakman
- first_name: S.
full_name: Geyer, S.
last_name: Geyer
- first_name: F. N. M.
full_name: Froning, F. N. M.
last_name: Froning
- first_name: H.
full_name: Moon, H.
last_name: Moon
- first_name: M. A.
full_name: Osborne, M. A.
last_name: Osborne
- first_name: D.
full_name: Sejdinovic, D.
last_name: Sejdinovic
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
- first_name: D. M.
full_name: Zumbühl, D. M.
last_name: Zumbühl
- first_name: G. A. D.
full_name: Briggs, G. A. D.
last_name: Briggs
- first_name: N.
full_name: Ares, N.
last_name: Ares
citation:
ama: Severin B, Lennon DT, Camenzind LC, et al. Cross-architecture tuning of silicon
and SiGe-based quantum devices using machine learning. arXiv. doi:10.48550/arXiv.2107.12975
apa: Severin, B., Lennon, D. T., Camenzind, L. C., Vigneau, F., Fedele, F., Jirovec,
D., … Ares, N. (n.d.). Cross-architecture tuning of silicon and SiGe-based quantum
devices using machine learning. arXiv. https://doi.org/10.48550/arXiv.2107.12975
chicago: Severin, B., D. T. Lennon, L. C. Camenzind, F. Vigneau, F. Fedele, Daniel
Jirovec, A. Ballabio, et al. “Cross-Architecture Tuning of Silicon and SiGe-Based
Quantum Devices Using Machine Learning.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2107.12975.
ieee: B. Severin et al., “Cross-architecture tuning of silicon and SiGe-based
quantum devices using machine learning,” arXiv. .
ista: Severin B, Lennon DT, Camenzind LC, Vigneau F, Fedele F, Jirovec D, Ballabio
A, Chrastina D, Isella G, Kruijf M de, Carballido MJ, Svab S, Kuhlmann AV, Braakman
FR, Geyer S, Froning FNM, Moon H, Osborne MA, Sejdinovic D, Katsaros G, Zumbühl
DM, Briggs GAD, Ares N. Cross-architecture tuning of silicon and SiGe-based quantum
devices using machine learning. arXiv, 2107.12975.
mla: Severin, B., et al. “Cross-Architecture Tuning of Silicon and SiGe-Based Quantum
Devices Using Machine Learning.” ArXiv, 2107.12975, doi:10.48550/arXiv.2107.12975.
short: B. Severin, D.T. Lennon, L.C. Camenzind, F. Vigneau, F. Fedele, D. Jirovec,
A. Ballabio, D. Chrastina, G. Isella, M. de Kruijf, M.J. Carballido, S. Svab,
A.V. Kuhlmann, F.R. Braakman, S. Geyer, F.N.M. Froning, H. Moon, M.A. Osborne,
D. Sejdinovic, G. Katsaros, D.M. Zumbühl, G.A.D. Briggs, N. Ares, ArXiv (n.d.).
date_created: 2021-10-01T12:40:22Z
date_published: 2021-07-27T00:00:00Z
date_updated: 2024-03-25T23:30:14Z
day: '27'
department:
- _id: GeKa
doi: 10.48550/arXiv.2107.12975
external_id:
arxiv:
- '2107.12975'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2107.12975
month: '07'
oa: 1
oa_version: Preprint
project:
- _id: 2641CE5E-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P30207
name: Hole spin orbit qubits in Ge quantum wells
publication: arXiv
publication_status: submitted
related_material:
record:
- id: '10058'
relation: dissertation_contains
status: public
status: public
title: Cross-architecture tuning of silicon and SiGe-based quantum devices using machine
learning
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10067'
abstract:
- lang: eng
text: The search for novel entangled phases of matter has lead to the recent discovery
of a new class of “entanglement transitions,” exemplified by random tensor networks
and monitored quantum circuits. Most known examples can be understood as some
classical ordering transitions in an underlying statistical mechanics model, where
entanglement maps onto the free-energy cost of inserting a domain wall. In this
paper we study the possibility of entanglement transitions driven by physics beyond
such statistical mechanics mappings. Motivated by recent applications of neural-network-inspired
variational Ansätze, we investigate under what conditions on the variational parameters
these Ansätze can capture an entanglement transition. We study the entanglement
scaling of short-range restricted Boltzmann machine (RBM) quantum states with
random phases. For uncorrelated random phases, we analytically demonstrate the
absence of an entanglement transition and reveal subtle finite-size effects in
finite-size numerical simulations. Introducing phases with correlations decaying
as 1/r^α in real space, we observe three regions with a different scaling of entanglement
entropy depending on the exponent α. We study the nature of the transition between
these regions, finding numerical evidence for critical behavior. Our work establishes
the presence of long-range correlated phases in RBM-based wave functions as a
required ingredient for entanglement transitions.
acknowledgement: We would like to thank S. De Nicola, P. Brighi, and V. Karle for
fruitful discussions and valuable feedback on the manuscript. R.M. and M.S. acknowledge
support by the European Research Council (ERC) under the European Union's Horizon
2020 research and innovation program (Grant Agreement No. 850899). R.V. acknowledges
support from the US Department of Energy, Office of Science, Basic Energy Sciences,
under Early Career Award No. DE-SC0019168, and the Alfred P. Sloan Foundation through
a Sloan Research Fellowship.
article_number: '104205'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Raimel A
full_name: Medina Ramos, Raimel A
id: CE680B90-D85A-11E9-B684-C920E6697425
last_name: Medina Ramos
orcid: 0000-0002-5383-2869
- first_name: Romain
full_name: Vasseur, Romain
last_name: Vasseur
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
citation:
ama: Medina Ramos RA, Vasseur R, Serbyn M. Entanglement transitions from restricted
Boltzmann machines. Physical Review B. 2021;104(10). doi:10.1103/physrevb.104.104205
apa: Medina Ramos, R. A., Vasseur, R., & Serbyn, M. (2021). Entanglement transitions
from restricted Boltzmann machines. Physical Review B. American Physical
Society. https://doi.org/10.1103/physrevb.104.104205
chicago: Medina Ramos, Raimel A, Romain Vasseur, and Maksym Serbyn. “Entanglement
Transitions from Restricted Boltzmann Machines.” Physical Review B. American
Physical Society, 2021. https://doi.org/10.1103/physrevb.104.104205.
ieee: R. A. Medina Ramos, R. Vasseur, and M. Serbyn, “Entanglement transitions from
restricted Boltzmann machines,” Physical Review B, vol. 104, no. 10. American
Physical Society, 2021.
ista: Medina Ramos RA, Vasseur R, Serbyn M. 2021. Entanglement transitions from
restricted Boltzmann machines. Physical Review B. 104(10), 104205.
mla: Medina Ramos, Raimel A., et al. “Entanglement Transitions from Restricted Boltzmann
Machines.” Physical Review B, vol. 104, no. 10, 104205, American Physical
Society, 2021, doi:10.1103/physrevb.104.104205.
short: R.A. Medina Ramos, R. Vasseur, M. Serbyn, Physical Review B 104 (2021).
date_created: 2021-10-02T09:03:42Z
date_published: 2021-09-30T00:00:00Z
date_updated: 2023-08-14T07:24:47Z
day: '30'
department:
- _id: MaSe
doi: 10.1103/physrevb.104.104205
ec_funded: 1
external_id:
arxiv:
- '2107.05735'
isi:
- '000704414400002'
intvolume: ' 104'
isi: 1
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2107.05735
month: '09'
oa: 1
oa_version: Preprint
project:
- _id: 23841C26-32DE-11EA-91FC-C7463DDC885E
call_identifier: H2020
grant_number: '850899'
name: 'Non-Ergodic Quantum Matter: Universality, Dynamics and Control'
publication: Physical Review B
publication_identifier:
eissn:
- 2469-9969
issn:
- 2469-9950
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
status: public
title: Entanglement transitions from restricted Boltzmann machines
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 104
year: '2021'
...
---
_id: '10069'
abstract:
- lang: eng
text: 'The extent to which women differ in the course of blood cell counts throughout
pregnancy, and the importance of these changes to pregnancy outcomes has not been
well defined. Here, we develop a series of statistical analyses of repeated measures
data to reveal the degree to which women differ in the course of pregnancy, predict
the changes that occur, and determine the importance of these changes for post-partum
hemorrhage (PPH) which is one of the leading causes of maternal mortality. We
present a prospective cohort of 4082 births recorded at the University Hospital,
Lausanne, Switzerland between 2009 and 2014 where full labour records could be
obtained, along with complete blood count data taken at hospital admission. We
find significant differences, at a [Formula: see text] level, among women in how
blood count values change through pregnancy for mean corpuscular hemoglobin, mean
corpuscular volume, mean platelet volume, platelet count and red cell distribution
width. We find evidence that almost all complete blood count values show trimester-specific
associations with PPH. For example, high platelet count (OR 1.20, 95% CI 1.01-1.53),
high mean platelet volume (OR 1.58, 95% CI 1.04-2.08), and high erythrocyte levels
(OR 1.36, 95% CI 1.01-1.57) in trimester 1 increased PPH, but high values in trimester
3 decreased PPH risk (OR 0.85, 0.79, 0.67 respectively). We show that differences
among women in the course of blood cell counts throughout pregnancy have an important
role in shaping pregnancy outcome and tracking blood count value changes through
pregnancy improves identification of women at increased risk of postpartum hemorrhage.
This study provides greater understanding of the complex changes in blood count
values that occur through pregnancy and provides indicators to guide the stratification
of patients into risk groups.'
acknowledgement: This project was funded by an SNSF Eccellenza Grant to MRR (PCEGP3-181181),
and by core funding from the Institute of Science and Technology Austria. We would
like to thank the participants of the study and all the midwives and doctors for
the computerized obstetrical data.
article_number: '19238'
article_processing_charge: Yes
article_type: original
author:
- first_name: Matthew Richard
full_name: Robinson, Matthew Richard
id: E5D42276-F5DA-11E9-8E24-6303E6697425
last_name: Robinson
orcid: 0000-0001-8982-8813
- first_name: Marion
full_name: Patxot, Marion
last_name: Patxot
- first_name: Miloš
full_name: Stojanov, Miloš
last_name: Stojanov
- first_name: Sabine
full_name: Blum, Sabine
last_name: Blum
- first_name: David
full_name: Baud, David
last_name: Baud
citation:
ama: Robinson MR, Patxot M, Stojanov M, Blum S, Baud D. Postpartum hemorrhage risk
is driven by changes in blood composition through pregnancy. Scientific Reports.
2021;11. doi:10.1038/s41598-021-98411-z
apa: Robinson, M. R., Patxot, M., Stojanov, M., Blum, S., & Baud, D. (2021).
Postpartum hemorrhage risk is driven by changes in blood composition through pregnancy.
Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-021-98411-z
chicago: Robinson, Matthew Richard, Marion Patxot, Miloš Stojanov, Sabine Blum,
and David Baud. “Postpartum Hemorrhage Risk Is Driven by Changes in Blood Composition
through Pregnancy.” Scientific Reports. Springer Nature, 2021. https://doi.org/10.1038/s41598-021-98411-z.
ieee: M. R. Robinson, M. Patxot, M. Stojanov, S. Blum, and D. Baud, “Postpartum
hemorrhage risk is driven by changes in blood composition through pregnancy,”
Scientific Reports, vol. 11. Springer Nature, 2021.
ista: Robinson MR, Patxot M, Stojanov M, Blum S, Baud D. 2021. Postpartum hemorrhage
risk is driven by changes in blood composition through pregnancy. Scientific Reports.
11, 19238.
mla: Robinson, Matthew Richard, et al. “Postpartum Hemorrhage Risk Is Driven by
Changes in Blood Composition through Pregnancy.” Scientific Reports, vol.
11, 19238, Springer Nature, 2021, doi:10.1038/s41598-021-98411-z.
short: M.R. Robinson, M. Patxot, M. Stojanov, S. Blum, D. Baud, Scientific Reports
11 (2021).
date_created: 2021-10-03T22:01:21Z
date_published: 2021-09-28T00:00:00Z
date_updated: 2023-08-14T07:05:15Z
day: '28'
ddc:
- '618'
department:
- _id: MaRo
doi: 10.1038/s41598-021-98411-z
external_id:
isi:
- '000701575500083'
pmid:
- '34584125'
file:
- access_level: open_access
checksum: f002ec22f609f58e1263b79e7f79601e
content_type: application/pdf
creator: cchlebak
date_created: 2021-10-05T14:56:48Z
date_updated: 2021-10-05T14:56:48Z
file_id: '10091'
file_name: 2021_ScientificReports_Robinson.pdf
file_size: 6970368
relation: main_file
success: 1
file_date_updated: 2021-10-05T14:56:48Z
has_accepted_license: '1'
intvolume: ' 11'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
pmid: 1
publication: Scientific Reports
publication_identifier:
eissn:
- 2045-2322
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Postpartum hemorrhage risk is driven by changes in blood composition through
pregnancy
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: 11
year: '2021'
...
---
_id: '10070'
abstract:
- lang: eng
text: We extensively discuss the Rademacher and Sobolev-to-Lipschitz properties
for generalized intrinsic distances on strongly local Dirichlet spaces possibly
without square field operator. We present many non-smooth and infinite-dimensional
examples. As an application, we prove the integral Varadhan short-time asymptotic
with respect to a given distance function for a large class of strongly local
Dirichlet forms.
acknowledgement: 'The authors are grateful to Professor Kazuhiro Kuwae for kindly
providing a copy of [49]. They are also grateful to Dr. Bang-Xian Han for helpful
discussions on the Sobolev-to-Lipschitz property on metric measure spaces. They
wish to express their deepest gratitude to an anonymous Reviewer, whose punctual
remarks and comments greatly improved the accessibility and overall quality of the
initial submission. This work was completed while L.D.S. was a member of the Institut
für Angewandte Mathematik of the University of Bonn. He acknowledges funding of
his position at that time by the Deutsche Forschungsgemeinschaft (DFG, German Research
Foundation) through the Sonderforschungsbereich (Sfb, Collaborative Research Center)
1060 - project number 211504053. He also acknowledges funding of his current position
by the Austrian Science Fund (FWF) grant F65, and by the European Research Council
(ERC, grant No. 716117, awarded to Prof. Dr. Jan Maas). K.S. gratefully acknowledges
funding by: the JSPS Overseas Research Fellowships, Grant Nr. 290142; World Premier
International Research Center Initiative (WPI), MEXT, Japan; and JSPS Grant-in-Aid
for Scientific Research on Innovative Areas “Discrete Geometric Analysis for Materials
Design”, Grant Number 17H06465.'
article_number: '109234'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Lorenzo
full_name: Dello Schiavo, Lorenzo
id: ECEBF480-9E4F-11EA-B557-B0823DDC885E
last_name: Dello Schiavo
orcid: 0000-0002-9881-6870
- first_name: Kohei
full_name: Suzuki, Kohei
last_name: Suzuki
citation:
ama: Dello Schiavo L, Suzuki K. Rademacher-type theorems and Sobolev-to-Lipschitz
properties for strongly local Dirichlet spaces. Journal of Functional Analysis.
2021;281(11). doi:10.1016/j.jfa.2021.109234
apa: Dello Schiavo, L., & Suzuki, K. (2021). Rademacher-type theorems and Sobolev-to-Lipschitz
properties for strongly local Dirichlet spaces. Journal of Functional Analysis.
Elsevier. https://doi.org/10.1016/j.jfa.2021.109234
chicago: Dello Schiavo, Lorenzo, and Kohei Suzuki. “Rademacher-Type Theorems and
Sobolev-to-Lipschitz Properties for Strongly Local Dirichlet Spaces.” Journal
of Functional Analysis. Elsevier, 2021. https://doi.org/10.1016/j.jfa.2021.109234.
ieee: L. Dello Schiavo and K. Suzuki, “Rademacher-type theorems and Sobolev-to-Lipschitz
properties for strongly local Dirichlet spaces,” Journal of Functional Analysis,
vol. 281, no. 11. Elsevier, 2021.
ista: Dello Schiavo L, Suzuki K. 2021. Rademacher-type theorems and Sobolev-to-Lipschitz
properties for strongly local Dirichlet spaces. Journal of Functional Analysis.
281(11), 109234.
mla: Dello Schiavo, Lorenzo, and Kohei Suzuki. “Rademacher-Type Theorems and Sobolev-to-Lipschitz
Properties for Strongly Local Dirichlet Spaces.” Journal of Functional Analysis,
vol. 281, no. 11, 109234, Elsevier, 2021, doi:10.1016/j.jfa.2021.109234.
short: L. Dello Schiavo, K. Suzuki, Journal of Functional Analysis 281 (2021).
date_created: 2021-10-03T22:01:21Z
date_published: 2021-09-15T00:00:00Z
date_updated: 2023-08-14T07:05:44Z
day: '15'
department:
- _id: JaMa
doi: 10.1016/j.jfa.2021.109234
ec_funded: 1
external_id:
arxiv:
- '2008.01492'
isi:
- '000703896600005'
intvolume: ' 281'
isi: 1
issue: '11'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2008.01492
month: '09'
oa: 1
oa_version: Preprint
project:
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
grant_number: F6504
name: Taming Complexity in Partial Differential Systems
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '716117'
name: Optimal Transport and Stochastic Dynamics
publication: Journal of Functional Analysis
publication_identifier:
eissn:
- 1096-0783
issn:
- 0022-1236
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Rademacher-type theorems and Sobolev-to-Lipschitz properties for strongly local
Dirichlet spaces
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 281
year: '2021'
...
---
_id: '10071'
alternative_title:
- Early Career
article_processing_charge: No
article_type: letter_note
author:
- first_name: Henry
full_name: Adams, Henry
last_name: Adams
- first_name: Hana
full_name: Kourimska, Hana
id: D9B8E14C-3C26-11EA-98F5-1F833DDC885E
last_name: Kourimska
- first_name: Teresa
full_name: Heiss, Teresa
id: 4879BB4E-F248-11E8-B48F-1D18A9856A87
last_name: Heiss
orcid: 0000-0002-1780-2689
- first_name: Sarah
full_name: Percival, Sarah
last_name: Percival
- first_name: Lori
full_name: Ziegelmeier, Lori
last_name: Ziegelmeier
citation:
ama: Adams H, Kourimska H, Heiss T, Percival S, Ziegelmeier L. How to tutorial-a-thon.
Notices of the American Mathematical Society. 2021;68(9):1511-1514. doi:10.1090/noti2349
apa: Adams, H., Kourimska, H., Heiss, T., Percival, S., & Ziegelmeier, L. (2021).
How to tutorial-a-thon. Notices of the American Mathematical Society. American
Mathematical Society. https://doi.org/10.1090/noti2349
chicago: Adams, Henry, Hana Kourimska, Teresa Heiss, Sarah Percival, and Lori Ziegelmeier.
“How to Tutorial-a-Thon.” Notices of the American Mathematical Society.
American Mathematical Society, 2021. https://doi.org/10.1090/noti2349.
ieee: H. Adams, H. Kourimska, T. Heiss, S. Percival, and L. Ziegelmeier, “How to
tutorial-a-thon,” Notices of the American Mathematical Society, vol. 68,
no. 9. American Mathematical Society, pp. 1511–1514, 2021.
ista: Adams H, Kourimska H, Heiss T, Percival S, Ziegelmeier L. 2021. How to tutorial-a-thon.
Notices of the American Mathematical Society. 68(9), 1511–1514.
mla: Adams, Henry, et al. “How to Tutorial-a-Thon.” Notices of the American Mathematical
Society, vol. 68, no. 9, American Mathematical Society, 2021, pp. 1511–14,
doi:10.1090/noti2349.
short: H. Adams, H. Kourimska, T. Heiss, S. Percival, L. Ziegelmeier, Notices of
the American Mathematical Society 68 (2021) 1511–1514.
date_created: 2021-10-03T22:01:22Z
date_published: 2021-10-01T00:00:00Z
date_updated: 2021-12-03T07:31:26Z
day: '01'
department:
- _id: HeEd
doi: 10.1090/noti2349
intvolume: ' 68'
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ams.org/notices/
month: '10'
oa: 1
oa_version: Published Version
page: 1511-1514
publication: Notices of the American Mathematical Society
publication_identifier:
eissn:
- 1088-9477
issn:
- 0002-9920
publication_status: published
publisher: American Mathematical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: How to tutorial-a-thon
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 68
year: '2021'
...
---
_id: '10072'
abstract:
- lang: eng
text: The Lovász Local Lemma (LLL) is a powerful tool in probabilistic combinatorics
which can be used to establish the existence of objects that satisfy certain properties.
The breakthrough paper of Moser and Tardos and follow-up works revealed that the
LLL has intimate connections with a class of stochastic local search algorithms
for finding such desirable objects. In particular, it can be seen as a sufficient
condition for this type of algorithms to converge fast. Besides conditions for
existence of and fast convergence to desirable objects, one may naturally ask
further questions regarding properties of these algorithms. For instance, "are
they parallelizable?", "how many solutions can they output?", "what is the expected
"weight" of a solution?", etc. These questions and more have been answered for
a class of LLL-inspired algorithms called commutative. In this paper we introduce
a new, very natural and more general notion of commutativity (essentially matrix
commutativity) which allows us to show a number of new refined properties of LLL-inspired
local search algorithms with significantly simpler proofs.
acknowledgement: "Fotis Iliopoulos: This material is based upon work directly supported
by the IAS Fund for Math and indirectly supported by the National Science Foundation
Grant No. CCF-1900460. Any opinions, findings and conclusions or recommendations
expressed in this material are those of the author(s) and do not necessarily reflect
the views of the National Science Foundation. This work is also supported by the
National Science Foundation Grant No. CCF-1815328.\r\nVladimir Kolmogorov: Supported
by the European Research Council under the European Unions Seventh Framework Programme
(FP7/2007-2013)/ERC grant agreement no 616160."
alternative_title:
- LIPIcs
article_number: '31'
article_processing_charge: Yes
arxiv: 1
author:
- first_name: David G.
full_name: Harris, David G.
last_name: Harris
- first_name: Fotis
full_name: Iliopoulos, Fotis
last_name: Iliopoulos
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Harris DG, Iliopoulos F, Kolmogorov V. A new notion of commutativity for the
algorithmic Lovász Local Lemma. In: Approximation, Randomization, and Combinatorial
Optimization. Algorithms and Techniques. Vol 207. Schloss Dagstuhl - Leibniz
Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.APPROX/RANDOM.2021.31'
apa: 'Harris, D. G., Iliopoulos, F., & Kolmogorov, V. (2021). A new notion of
commutativity for the algorithmic Lovász Local Lemma. In Approximation, Randomization,
and Combinatorial Optimization. Algorithms and Techniques (Vol. 207). Virtual:
Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31'
chicago: Harris, David G., Fotis Iliopoulos, and Vladimir Kolmogorov. “A New Notion
of Commutativity for the Algorithmic Lovász Local Lemma.” In Approximation,
Randomization, and Combinatorial Optimization. Algorithms and Techniques,
Vol. 207. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31.
ieee: D. G. Harris, F. Iliopoulos, and V. Kolmogorov, “A new notion of commutativity
for the algorithmic Lovász Local Lemma,” in Approximation, Randomization, and
Combinatorial Optimization. Algorithms and Techniques, Virtual, 2021, vol.
207.
ista: 'Harris DG, Iliopoulos F, Kolmogorov V. 2021. A new notion of commutativity
for the algorithmic Lovász Local Lemma. Approximation, Randomization, and Combinatorial
Optimization. Algorithms and Techniques. APPROX/RANDOM: Approximation Algorithms
for Combinatorial Optimization Problems/ Randomization and Computation, LIPIcs,
vol. 207, 31.'
mla: Harris, David G., et al. “A New Notion of Commutativity for the Algorithmic
Lovász Local Lemma.” Approximation, Randomization, and Combinatorial Optimization.
Algorithms and Techniques, vol. 207, 31, Schloss Dagstuhl - Leibniz Zentrum
für Informatik, 2021, doi:10.4230/LIPIcs.APPROX/RANDOM.2021.31.
short: D.G. Harris, F. Iliopoulos, V. Kolmogorov, in:, Approximation, Randomization,
and Combinatorial Optimization. Algorithms and Techniques, Schloss Dagstuhl -
Leibniz Zentrum für Informatik, 2021.
conference:
end_date: 2021-08-18
location: Virtual
name: 'APPROX/RANDOM: Approximation Algorithms for Combinatorial Optimization Problems/
Randomization and Computation'
start_date: 2021-08-16
date_created: 2021-10-03T22:01:22Z
date_published: 2021-09-15T00:00:00Z
date_updated: 2022-03-18T10:08:25Z
day: '15'
ddc:
- '000'
department:
- _id: VlKo
doi: 10.4230/LIPIcs.APPROX/RANDOM.2021.31
ec_funded: 1
external_id:
arxiv:
- '2008.05569'
file:
- access_level: open_access
checksum: 9d2544d53aa5b01565c6891d97a4d765
content_type: application/pdf
creator: cchlebak
date_created: 2021-10-06T13:51:54Z
date_updated: 2021-10-06T13:51:54Z
file_id: '10098'
file_name: 2021_LIPIcs_Harris.pdf
file_size: 804472
relation: main_file
success: 1
file_date_updated: 2021-10-06T13:51:54Z
has_accepted_license: '1'
intvolume: ' 207'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques
publication_identifier:
isbn:
- 978-3-9597-7207-5
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: A new notion of commutativity for the algorithmic Lovász Local Lemma
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 207
year: '2021'
...
---
_id: '10073'
abstract:
- lang: eng
text: Thermoelectric materials enable the direct conversion between heat and electricity.
SnTe is a promising candidate due to its high charge transport performance. Here,
we prepared SnTe nanocomposites by employing an aqueous method to synthetize SnTe
nanoparticles (NP), followed by a unique surface treatment prior NP consolidation.
This synthetic approach allowed optimizing the charge and phonon transport synergistically.
The novelty of this strategy was the use of a soluble PbS molecular complex prepared
using a thiol-amine solvent mixture that upon blending is adsorbed on the SnTe
NP surface. Upon consolidation with spark plasma sintering, SnTe-PbS nanocomposite
is formed. The presence of PbS complexes significantly compensates for the Sn
vacancy and increases the average grain size of the nanocomposite, thus improving
the carrier mobility. Moreover, lattice thermal conductivity is also reduced by
the Pb and S-induced mass and strain fluctuation. As a result, an enhanced ZT
of ca. 0.8 is reached at 873 K. Our finding provides a novel strategy to conduct
rational surface treatment on NP-based thermoelectrics.
acknowledged_ssus:
- _id: EM-Fac
acknowledgement: "The authors thank the EMF facility in IST Austria for providing
SEM and EDX measurements.\r\n"
article_number: '5416'
article_processing_charge: Yes
article_type: original
author:
- first_name: Cheng
full_name: Chang, Cheng
id: 9E331C2E-9F27-11E9-AE48-5033E6697425
last_name: Chang
orcid: 0000-0002-9515-4277
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
citation:
ama: Chang C, Ibáñez M. Enhanced thermoelectric performance by surface engineering
in SnTe-PbS nanocomposites. Materials. 2021;14(18). doi:10.3390/ma14185416
apa: Chang, C., & Ibáñez, M. (2021). Enhanced thermoelectric performance by
surface engineering in SnTe-PbS nanocomposites. Materials. MDPI. https://doi.org/10.3390/ma14185416
chicago: Chang, Cheng, and Maria Ibáñez. “Enhanced Thermoelectric Performance by
Surface Engineering in SnTe-PbS Nanocomposites.” Materials. MDPI, 2021.
https://doi.org/10.3390/ma14185416.
ieee: C. Chang and M. Ibáñez, “Enhanced thermoelectric performance by surface engineering
in SnTe-PbS nanocomposites,” Materials, vol. 14, no. 18. MDPI, 2021.
ista: Chang C, Ibáñez M. 2021. Enhanced thermoelectric performance by surface engineering
in SnTe-PbS nanocomposites. Materials. 14(18), 5416.
mla: Chang, Cheng, and Maria Ibáñez. “Enhanced Thermoelectric Performance by Surface
Engineering in SnTe-PbS Nanocomposites.” Materials, vol. 14, no. 18, 5416,
MDPI, 2021, doi:10.3390/ma14185416.
short: C. Chang, M. Ibáñez, Materials 14 (2021).
date_created: 2021-10-03T22:01:23Z
date_published: 2021-09-19T00:00:00Z
date_updated: 2023-08-14T08:00:01Z
day: '19'
ddc:
- '540'
department:
- _id: MaIb
doi: 10.3390/ma14185416
external_id:
isi:
- '000700689400001'
pmid:
- '34576640'
file:
- access_level: open_access
checksum: 4929dfc673a3ae77c010b6174279cc1d
content_type: application/pdf
creator: cchlebak
date_created: 2021-10-14T11:56:39Z
date_updated: 2021-10-14T11:56:39Z
file_id: '10140'
file_name: 2021_Materials_Chang.pdf
file_size: 4404141
relation: main_file
success: 1
file_date_updated: 2021-10-14T11:56:39Z
has_accepted_license: '1'
intvolume: ' 14'
isi: 1
issue: '18'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 9B8804FC-BA93-11EA-9121-9846C619BF3A
grant_number: M02889
name: Bottom-up Engineering for Thermoelectric Applications
publication: Materials
publication_identifier:
eissn:
- 1996-1944
publication_status: published
publisher: MDPI
quality_controlled: '1'
scopus_import: '1'
status: public
title: Enhanced thermoelectric performance by surface engineering in SnTe-PbS nanocomposites
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: 14
year: '2021'
...
---
_id: '10075'
abstract:
- lang: eng
text: We study the expressiveness and succinctness of good-for-games pushdown automata
(GFG-PDA) over finite words, that is, pushdown automata whose nondeterminism can
be resolved based on the run constructed so far, but independently of the remainder
of the input word. We prove that GFG-PDA recognise more languages than deterministic
PDA (DPDA) but not all context-free languages (CFL). This class is orthogonal
to unambiguous CFL. We further show that GFG-PDA can be exponentially more succinct
than DPDA, while PDA can be double-exponentially more succinct than GFG-PDA. We
also study GFGness in visibly pushdown automata (VPA), which enjoy better closure
properties than PDA, and for which we show GFGness to be ExpTime-complete. GFG-VPA
can be exponentially more succinct than deterministic VPA, while VPA can be exponentially
more succinct than GFG-VPA. Both of these lower bounds are tight. Finally, we
study the complexity of resolving nondeterminism in GFG-PDA. Every GFG-PDA has
a positional resolver, a function that resolves nondeterminism and that is only
dependant on the current configuration. Pushdown transducers are sufficient to
implement the resolvers of GFG-VPA, but not those of GFG-PDA. GFG-PDA with finite-state
resolvers are determinisable.
acknowledgement: 'Ismaël Jecker: Funded by the European Union’s Horizon 2020 research
and innovation programme under the Marie Skłodowska-Curie grant agreement No 754411.
Karoliina Lehtinen: Funded by the European Union’s Horizon 2020 research and innovation
programme under the Marie Skłodowska-Curie grant agreement No 892704.'
alternative_title:
- LIPIcs
article_number: '53'
article_processing_charge: No
arxiv: 1
author:
- first_name: Shibashis
full_name: Guha, Shibashis
last_name: Guha
- first_name: Ismael R
full_name: Jecker, Ismael R
id: 85D7C63E-7D5D-11E9-9C0F-98C4E5697425
last_name: Jecker
- first_name: Karoliina
full_name: Lehtinen, Karoliina
last_name: Lehtinen
- first_name: Martin
full_name: Zimmermann, Martin
last_name: Zimmermann
citation:
ama: 'Guha S, Jecker IR, Lehtinen K, Zimmermann M. A bit of nondeterminism makes
pushdown automata expressive and succinct. In: 46th International Symposium
on Mathematical Foundations of Computer Science. Vol 202. Schloss Dagstuhl
- Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.MFCS.2021.53'
apa: 'Guha, S., Jecker, I. R., Lehtinen, K., & Zimmermann, M. (2021). A bit
of nondeterminism makes pushdown automata expressive and succinct. In 46th
International Symposium on Mathematical Foundations of Computer Science (Vol.
202). Tallinn, Estonia: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2021.53'
chicago: Guha, Shibashis, Ismael R Jecker, Karoliina Lehtinen, and Martin Zimmermann.
“A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.” In
46th International Symposium on Mathematical Foundations of Computer Science,
Vol. 202. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.MFCS.2021.53.
ieee: S. Guha, I. R. Jecker, K. Lehtinen, and M. Zimmermann, “A bit of nondeterminism
makes pushdown automata expressive and succinct,” in 46th International Symposium
on Mathematical Foundations of Computer Science, Tallinn, Estonia, 2021, vol.
202.
ista: 'Guha S, Jecker IR, Lehtinen K, Zimmermann M. 2021. A bit of nondeterminism
makes pushdown automata expressive and succinct. 46th International Symposium
on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations
of Computer Science, LIPIcs, vol. 202, 53.'
mla: Guha, Shibashis, et al. “A Bit of Nondeterminism Makes Pushdown Automata Expressive
and Succinct.” 46th International Symposium on Mathematical Foundations of
Computer Science, vol. 202, 53, Schloss Dagstuhl - Leibniz Zentrum für Informatik,
2021, doi:10.4230/LIPIcs.MFCS.2021.53.
short: S. Guha, I.R. Jecker, K. Lehtinen, M. Zimmermann, in:, 46th International
Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl -
Leibniz Zentrum für Informatik, 2021.
conference:
end_date: 2021-08-27
location: Tallinn, Estonia
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2021-08-23
date_created: 2021-10-03T22:01:23Z
date_published: 2021-08-18T00:00:00Z
date_updated: 2022-05-13T08:21:56Z
day: '18'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.MFCS.2021.53
ec_funded: 1
external_id:
arxiv:
- '2105.02611'
file:
- access_level: open_access
checksum: f4d407d43a97330c3fb11e6a7a6fbfb2
content_type: application/pdf
creator: cchlebak
date_created: 2021-10-06T12:44:05Z
date_updated: 2021-10-06T12:44:05Z
file_id: '10097'
file_name: 2021_LIPIcs_Guha.pdf
file_size: 825567
relation: main_file
success: 1
file_date_updated: 2021-10-06T12:44:05Z
has_accepted_license: '1'
intvolume: ' 202'
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: 46th International Symposium on Mathematical Foundations of Computer
Science
publication_identifier:
isbn:
- 978-3-9597-7201-3
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: A bit of nondeterminism makes pushdown automata expressive and succinct
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 202
year: '2021'
...
---
_id: '10076'
abstract:
- lang: eng
text: We present a novel approach for blockchain asset owners to reclaim their funds
in case of accidental private-key loss or transfer to a mistyped address. Our
solution can be deployed upon failure or absence of proactively implemented backup
mechanisms, such as secret sharing and cold storage. The main advantages against
previous proposals is it does not require any prior action from users and works
with both single-key and multi-sig accounts. We achieve this by a 3-phase Commit()→Reveal()→Claim()−or−Challenge() smart
contract that enables accessing funds of addresses for which the spending key
is not available. We provide an analysis of the threat and incentive models and
formalize the concept of reactive KEy-Loss Protection (KELP).
acknowledgement: The authors would like to thank all anonymous reviewers of FC21 WTSC
workshop for comments and suggestions that greatly improved the quality of this
paper.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Sam
full_name: Blackshear, Sam
last_name: Blackshear
- first_name: Konstantinos
full_name: Chalkias, Konstantinos
last_name: Chalkias
- first_name: Panagiotis
full_name: Chatzigiannis, Panagiotis
last_name: Chatzigiannis
- first_name: Riyaz
full_name: Faizullabhoy, Riyaz
last_name: Faizullabhoy
- first_name: Irakliy
full_name: Khaburzaniya, Irakliy
last_name: Khaburzaniya
- first_name: Eleftherios
full_name: Kokoris Kogias, Eleftherios
id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
last_name: Kokoris Kogias
- first_name: Joshua
full_name: Lind, Joshua
last_name: Lind
- first_name: David
full_name: Wong, David
last_name: Wong
- first_name: Tim
full_name: Zakian, Tim
last_name: Zakian
citation:
ama: 'Blackshear S, Chalkias K, Chatzigiannis P, et al. Reactive key-loss protection
in blockchains. In: FC 2021 Workshops. Vol 12676. Springer Nature; 2021:431-450.
doi:10.1007/978-3-662-63958-0_34'
apa: 'Blackshear, S., Chalkias, K., Chatzigiannis, P., Faizullabhoy, R., Khaburzaniya,
I., Kokoris Kogias, E., … Zakian, T. (2021). Reactive key-loss protection in blockchains.
In FC 2021 Workshops (Vol. 12676, pp. 431–450). Virtual: Springer Nature.
https://doi.org/10.1007/978-3-662-63958-0_34'
chicago: Blackshear, Sam, Konstantinos Chalkias, Panagiotis Chatzigiannis, Riyaz
Faizullabhoy, Irakliy Khaburzaniya, Eleftherios Kokoris Kogias, Joshua Lind, David
Wong, and Tim Zakian. “Reactive Key-Loss Protection in Blockchains.” In FC
2021 Workshops, 12676:431–50. Springer Nature, 2021. https://doi.org/10.1007/978-3-662-63958-0_34.
ieee: S. Blackshear et al., “Reactive key-loss protection in blockchains,”
in FC 2021 Workshops, Virtual, 2021, vol. 12676, pp. 431–450.
ista: 'Blackshear S, Chalkias K, Chatzigiannis P, Faizullabhoy R, Khaburzaniya I,
Kokoris Kogias E, Lind J, Wong D, Zakian T. 2021. Reactive key-loss protection
in blockchains. FC 2021 Workshops. FC: International Conference on Financial Cryptography
and Data Security, LNCS, vol. 12676, 431–450.'
mla: Blackshear, Sam, et al. “Reactive Key-Loss Protection in Blockchains.” FC
2021 Workshops, vol. 12676, Springer Nature, 2021, pp. 431–50, doi:10.1007/978-3-662-63958-0_34.
short: S. Blackshear, K. Chalkias, P. Chatzigiannis, R. Faizullabhoy, I. Khaburzaniya,
E. Kokoris Kogias, J. Lind, D. Wong, T. Zakian, in:, FC 2021 Workshops, Springer
Nature, 2021, pp. 431–450.
conference:
end_date: 2021-03-05
location: Virtual
name: 'FC: International Conference on Financial Cryptography and Data Security'
start_date: 2021-03-01
date_created: 2021-10-03T22:01:24Z
date_published: 2021-09-17T00:00:00Z
date_updated: 2023-08-14T07:06:16Z
day: '17'
department:
- _id: ElKo
doi: 10.1007/978-3-662-63958-0_34
external_id:
isi:
- '000713005000034'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://research.fb.com/publications/reactive-key-loss-protection-in-blockchains/
month: '09'
oa: 1
oa_version: Preprint
page: 431-450
publication: FC 2021 Workshops
publication_identifier:
eisbn:
- 978-3-662-63958-0
eissn:
- 1611-3349
isbn:
- 978-3-6626-3957-3
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Reactive key-loss protection in blockchains
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: '12676 '
year: '2021'
...
---
_id: '10077'
abstract:
- lang: eng
text: Although much is known about how single neurons in the hippocampus represent
an animal’s position, how cell-cell interactions contribute to spatial coding
remains poorly understood. Using a novel statistical estimator and theoretical
modeling, both developed in the framework of maximum entropy models, we reveal
highly structured cell-to-cell interactions whose statistics depend on familiar
vs. novel environment. In both conditions the circuit interactions optimize the
encoding of spatial information, but for regimes that differ in the signal-to-noise
ratio of their spatial inputs. Moreover, the topology of the interactions facilitates
linear decodability, making the information easy to read out by downstream circuits.
These findings suggest that the efficient coding hypothesis is not applicable
only to individual neuron properties in the sensory periphery, but also to neural
interactions in the central brain.
acknowledgement: We thank Peter Baracskay, Karola Kaefer and Hugo Malagon-Vina for
the acquisition of the data. We thank Federico Stella for comments on an earlier
version of the manuscript. MN was supported by European Union Horizon 2020 grant
665385, JC was supported by European Research Council consolidator grant 281511,
GT was supported by the Austrian Science Fund (FWF) grant P34015, CS was supported
by an IST fellow grant, National Institute of Mental Health Award 1R01MH125571-01,
by the National Science Foundation under NSF Award No. 1922658 and a Google faculty
award.
article_processing_charge: No
author:
- first_name: Michele
full_name: Nardin, Michele
id: 30BD0376-F248-11E8-B48F-1D18A9856A87
last_name: Nardin
orcid: 0000-0001-8849-6570
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
- 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: Cristina
full_name: Savin, Cristina
id: 3933349E-F248-11E8-B48F-1D18A9856A87
last_name: Savin
citation:
ama: Nardin M, Csicsvari JL, Tkačik G, Savin C. The structure of hippocampal CA1
interactions optimizes spatial coding across experience. bioRxiv. doi:10.1101/2021.09.28.460602
apa: Nardin, M., Csicsvari, J. L., Tkačik, G., & Savin, C. (n.d.). The structure
of hippocampal CA1 interactions optimizes spatial coding across experience. bioRxiv.
Cold Spring Harbor Laboratory. https://doi.org/10.1101/2021.09.28.460602
chicago: Nardin, Michele, Jozsef L Csicsvari, Gašper Tkačik, and Cristina Savin.
“The Structure of Hippocampal CA1 Interactions Optimizes Spatial Coding across
Experience.” BioRxiv. Cold Spring Harbor Laboratory, n.d. https://doi.org/10.1101/2021.09.28.460602.
ieee: M. Nardin, J. L. Csicsvari, G. Tkačik, and C. Savin, “The structure of hippocampal
CA1 interactions optimizes spatial coding across experience,” bioRxiv.
Cold Spring Harbor Laboratory.
ista: Nardin M, Csicsvari JL, Tkačik G, Savin C. The structure of hippocampal CA1
interactions optimizes spatial coding across experience. bioRxiv, 10.1101/2021.09.28.460602.
mla: Nardin, Michele, et al. “The Structure of Hippocampal CA1 Interactions Optimizes
Spatial Coding across Experience.” BioRxiv, Cold Spring Harbor Laboratory,
doi:10.1101/2021.09.28.460602.
short: M. Nardin, J.L. Csicsvari, G. Tkačik, C. Savin, BioRxiv (n.d.).
date_created: 2021-10-04T06:23:34Z
date_published: 2021-09-29T00:00:00Z
date_updated: 2024-03-25T23:30:09Z
day: '29'
department:
- _id: GradSch
- _id: JoCs
- _id: GaTk
doi: 10.1101/2021.09.28.460602
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.biorxiv.org/content/10.1101/2021.09.28.460602
month: '09'
oa: 1
oa_version: Preprint
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 257A4776-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '281511'
name: Memory-related information processing in neuronal circuits of the hippocampus
and entorhinal cortex
- _id: 626c45b5-2b32-11ec-9570-e509828c1ba6
grant_number: P34015
name: Efficient coding with biophysical realism
publication: bioRxiv
publication_status: submitted
publisher: Cold Spring Harbor Laboratory
related_material:
record:
- id: '11932'
relation: dissertation_contains
status: public
status: public
title: The structure of hippocampal CA1 interactions optimizes spatial coding across
experience
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: preprint
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2021'
...
---
_id: '10080'
abstract:
- lang: eng
text: Hippocampal and neocortical neural activity is modulated by the position of
the individual in space. While hippocampal neurons provide the basis for a spatial
map, prefrontal cortical neurons generalize over environmental features. Whether
these generalized representations result from a bidirectional interaction with,
or are mainly derived from hippocampal spatial representations is not known. By
examining simultaneously recorded hippocampal and medial prefrontal neurons, we
observed that prefrontal spatial representations show a delayed coherence with
hippocampal ones. We also identified subpopulations of cells in the hippocampus
and medial prefrontal cortex that formed functional cross-area couplings; these
resembled the optimal connections predicted by a probabilistic model of spatial
information transfer and generalization. Moreover, cross-area couplings were strongest
and had the shortest delay preceding spatial decision-making. Our results suggest
that generalized spatial coding in the medial prefrontal cortex is inherited from
spatial representations in the hippocampus, and that the routing of information
can change dynamically with behavioral demands.
acknowledgement: We thank Federico Stella for invaluable suggestions and discussions.
We thank Yosman BapatDhar and Andrea Cumpelik for comments, help and suggestions
on the exposure of the text. We thank Predrag Živadinović and Juliana Couras for
comments on the text and the figures. This work was supported by the EU-FP7 MC-ITN
IN-SENS (grant 607616).
article_processing_charge: No
author:
- first_name: Michele
full_name: Nardin, Michele
id: 30BD0376-F248-11E8-B48F-1D18A9856A87
last_name: Nardin
orcid: 0000-0001-8849-6570
- first_name: Karola
full_name: Käfer, Karola
id: 2DAA49AA-F248-11E8-B48F-1D18A9856A87
last_name: Käfer
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
citation:
ama: Nardin M, Käfer K, Csicsvari JL. The generalized spatial representation in
the prefrontal cortex is inherited from the hippocampus. bioRxiv. doi:10.1101/2021.09.30.462269
apa: Nardin, M., Käfer, K., & Csicsvari, J. L. (n.d.). The generalized spatial
representation in the prefrontal cortex is inherited from the hippocampus. bioRxiv.
Cold Spring Harbor Laboratory. https://doi.org/10.1101/2021.09.30.462269
chicago: Nardin, Michele, Karola Käfer, and Jozsef L Csicsvari. “The Generalized
Spatial Representation in the Prefrontal Cortex Is Inherited from the Hippocampus.”
BioRxiv. Cold Spring Harbor Laboratory, n.d. https://doi.org/10.1101/2021.09.30.462269.
ieee: M. Nardin, K. Käfer, and J. L. Csicsvari, “The generalized spatial representation
in the prefrontal cortex is inherited from the hippocampus,” bioRxiv. Cold
Spring Harbor Laboratory.
ista: Nardin M, Käfer K, Csicsvari JL. The generalized spatial representation in
the prefrontal cortex is inherited from the hippocampus. bioRxiv, 10.1101/2021.09.30.462269.
mla: Nardin, Michele, et al. “The Generalized Spatial Representation in the Prefrontal
Cortex Is Inherited from the Hippocampus.” BioRxiv, Cold Spring Harbor
Laboratory, doi:10.1101/2021.09.30.462269.
short: M. Nardin, K. Käfer, J.L. Csicsvari, BioRxiv (n.d.).
date_created: 2021-10-04T06:28:32Z
date_published: 2021-10-02T00:00:00Z
date_updated: 2021-10-05T12:34:26Z
day: '02'
department:
- _id: GradSch
- _id: JoCs
doi: 10.1101/2021.09.30.462269
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.biorxiv.org/content/10.1101/2021.09.30.462269
month: '10'
oa: 1
oa_version: Preprint
project:
- _id: 257BBB4C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '607616'
name: Inter-and intracellular signalling in schizophrenia
publication: bioRxiv
publication_status: submitted
publisher: Cold Spring Harbor Laboratory
status: public
title: The generalized spatial representation in the prefrontal cortex is inherited
from the hippocampus
type: preprint
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2021'
...
---
_id: '10083'
abstract:
- lang: eng
text: "Plant motions occur across a wide spectrum of timescales, ranging from seed
dispersal through bursting (milliseconds) and stomatal opening (minutes) to long-term
adaptation of gross architecture. Relatively fast motions include water-driven
growth as exemplified by root cell expansion under abiotic/biotic stresses or
during gravitropism. A showcase is a root growth inhibition in 30 seconds triggered
by the phytohormone auxin. However, the cellular and molecular mechanisms are
still largely unknown. This thesis covers the studies about this topic as follows.
By taking advantage of microfluidics combined with live imaging, pharmaceutical
tools, and transgenic lines, we examined the kinetics of and causal relationship
among various auxininduced rapid cellular changes in root growth, apoplastic pH,
cytosolic Ca2+, cortical microtubule (CMT) orientation, and vacuolar morphology.
We revealed that CMT reorientation and vacuolar constriction are the consequence
of growth itself instead of responding directly to auxin. In contrast, auxin induces
apoplast alkalinization to rapidly inhibit root growth in 30 seconds. This auxin-triggered
apoplast alkalinization results from rapid H+- influx that is contributed by Ca2+
inward channel CYCLIC NUCLEOTIDE-GATED CHANNEL 14 (CNGC14)-dependent Ca2+ signaling.
To dissect which auxin signaling mediates the rapid apoplast alkalinization, we\r\ncombined
microfluidics and genetic engineering to verify that TIR1/AFB receptors conduct
a non-transcriptional regulation on Ca2+ and H+ -influx. This non-canonical pathway
is mostly mediated by the cytosolic portion of TIR1/AFB. On the other hand, we
uncovered, using biochemical and phospho-proteomic analysis, that auxin cell surface
signaling component TRANSMEMBRANE KINASE 1 (TMK1) plays a negative role during
auxin-trigger apoplast\r\nalkalinization and root growth inhibition through directly
activating PM H+ -ATPases. Therefore, we discovered that PM H+ -ATPases counteract
instead of mediate the auxintriggered rapid H+ -influx, and that TIR1/AFB and
TMK1 regulate root growth antagonistically. This opposite effect of TIR1/AFB and
TMK1 is consistent during auxin-induced hypocotyl elongation, leading us to explore
the relation of two signaling pathways. Assisted with biochemistry and fluorescent
imaging, we verified for the first time that TIR1/AFB and TMK1 can interact with
each other. The ability of TIR1/AFB binding to membrane lipid provides a basis
for the interaction of plasma membrane- and cytosol-localized proteins.\r\nBesides,
transgenic analysis combined with genetic engineering and biochemistry showed
that vi\r\nthey do function in the same pathway. Particularly, auxin-induced
TMK1 increase is TIR1/AFB dependent, suggesting TIR1/AFB regulation on TMK1. Conversely,
TMK1 also regulates TIR1/AFB protein levels and thus auxin canonical signaling.
To follow the study of rapid growth regulation, we analyzed another rapid growth
regulator, signaling peptide RALF1. We showed that RALF1 also triggers a rapid
and reversible growth inhibition caused by H + influx, highly resembling but not
dependent on auxin. Besides, RALF1 promotes auxin biosynthesis by increasing expression
of auxin biosynthesis enzyme YUCCAs and thus induces auxin signaling in ca. 1
hour, contributing to the sustained RALF1-triggered growth inhibition. These studies
collectively contribute to understanding rapid regulation on plant cell\r\ngrowth,
novel auxin signaling pathway as well as auxin-peptide crosstalk. "
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Lanxin
full_name: Li, Lanxin
last_name: Li
citation:
ama: Li L. Rapid cell growth regulation in Arabidopsis. 2021. doi:10.15479/at:ista:10083
apa: Li, L. (2021). Rapid cell growth regulation in Arabidopsis. Institute
of Science and Technology Austria. https://doi.org/10.15479/at:ista:10083
chicago: Li, Lanxin. “Rapid Cell Growth Regulation in Arabidopsis.” Institute of
Science and Technology Austria, 2021. https://doi.org/10.15479/at:ista:10083.
ieee: L. Li, “Rapid cell growth regulation in Arabidopsis,” Institute of Science
and Technology Austria, 2021.
ista: Li L. 2021. Rapid cell growth regulation in Arabidopsis. Institute of Science
and Technology Austria.
mla: Li, Lanxin. Rapid Cell Growth Regulation in Arabidopsis. Institute of
Science and Technology Austria, 2021, doi:10.15479/at:ista:10083.
short: L. Li, Rapid Cell Growth Regulation in Arabidopsis, Institute of Science
and Technology Austria, 2021.
date_created: 2021-10-04T13:33:10Z
date_published: 2021-10-06T00:00:00Z
date_updated: 2025-05-07T11:12:33Z
day: '06'
ddc:
- '575'
degree_awarded: PhD
department:
- _id: GradSch
- _id: JiFr
doi: 10.15479/at:ista:10083
ec_funded: 1
file:
- access_level: open_access
checksum: 3b2f55b3b8ae05337a0dcc1cd8595b10
content_type: application/pdf
creator: cchlebak
date_created: 2021-10-14T08:00:07Z
date_updated: 2022-12-20T23:30:03Z
embargo: 2022-10-14
file_id: '10138'
file_name: 0._IST_Austria_Thesis_Lanxin_Li_1014_pdftron.pdf
file_size: 8616142
relation: main_file
- access_level: closed
checksum: f23ed258ca894f6aabf58b0c128bf242
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: cchlebak
date_created: 2021-10-14T08:00:13Z
date_updated: 2022-12-20T23:30:03Z
embargo_to: open_access
file_id: '10139'
file_name: 0._IST_Austria_Thesis_Lanxin_Li_1014.docx
file_size: 15058499
relation: source_file
file_date_updated: 2022-12-20T23:30:03Z
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 26B4D67E-B435-11E9-9278-68D0E5697425
grant_number: '25351'
name: 'A Case Study of Plant Growth Regulation: Molecular Mechanism of Auxin-mediated
Rapid Growth Inhibition in Arabidopsis Root'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '442'
relation: part_of_dissertation
status: public
- id: '8931'
relation: part_of_dissertation
status: public
- id: '9287'
relation: part_of_dissertation
status: public
- id: '8283'
relation: part_of_dissertation
status: public
- id: '8986'
relation: part_of_dissertation
status: public
- id: '10015'
relation: part_of_dissertation
status: public
- id: '10095'
relation: part_of_dissertation
status: public
- id: '6627'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
title: Rapid cell growth regulation in Arabidopsis
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: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2021'
...
---
_id: '10095'
abstract:
- lang: eng
text: Growth regulation tailors plant development to its environment. A showcase
is response to gravity, where shoots bend up and roots down1. This paradox is
based on opposite effects of the phytohormone auxin, which promotes cell expansion
in shoots, while inhibiting it in roots via a yet unknown cellular mechanism2.
Here, by combining microfluidics, live imaging, genetic engineering and phospho-proteomics
in Arabidopsis thaliana, we advance our understanding how auxin inhibits root
growth. We show that auxin activates two distinct, antagonistically acting signalling
pathways that converge on the rapid regulation of the apoplastic pH, a causative
growth determinant. Cell surface-based TRANSMEMBRANE KINASE1 (TMK1) interacts
with and mediates phosphorylation and activation of plasma membrane H+-ATPases
for apoplast acidification, while intracellular canonical auxin signalling promotes
net cellular H+-influx, causing apoplast alkalinisation. The simultaneous activation
of these two counteracting mechanisms poises the root for a rapid, fine-tuned
growth modulation while navigating complex soil environment.
acknowledged_ssus:
- _id: LifeSc
- _id: M-Shop
- _id: Bio
acknowledgement: We thank Nataliia Gnyliukh and Lukas Hörmayer for technical assistance
and Nadine Paris for sharing PM-Cyto seeds. We gratefully acknowledge Life Science,
Machine Shop and Bioimaging Facilities of IST Austria. This project has received
funding from the European Research Council Advanced Grant (ETAP-742985) and the
Austrian Science Fund (FWF) I 3630-B25 to J.F., the National Institutes of Health
(GM067203) to W.M.G., the Netherlands Organization for Scientific Research (NWO;
VIDI-864.13.001.), the Research Foundation-Flanders (FWO; Odysseus II G0D0515N)
and a European Research Council Starting Grant (TORPEDO-714055) to W.S. and B.D.R.,
the VICI grant (865.14.001) from the Netherlands Organization for Scientific Research
to M.R and D.W., the Australian Research Council and China National Distinguished
Expert Project (WQ20174400441) to S.S., the MEXT/JSPS KAKENHI to K.T. (20K06685)
and T.K. (20H05687 and 20H05910), the European Union’s Horizon 2020 research and
innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385
and the DOC Fellowship of the Austrian Academy of Sciences to L.L., the China Scholarship
Council to J.C.
article_number: '266395'
article_processing_charge: No
author:
- first_name: Lanxin
full_name: Li, Lanxin
id: 367EF8FA-F248-11E8-B48F-1D18A9856A87
last_name: Li
orcid: 0000-0002-5607-272X
- first_name: Inge
full_name: Verstraeten, Inge
id: 362BF7FE-F248-11E8-B48F-1D18A9856A87
last_name: Verstraeten
orcid: 0000-0001-7241-2328
- first_name: Mark
full_name: Roosjen, Mark
last_name: Roosjen
- first_name: Koji
full_name: Takahashi, Koji
last_name: Takahashi
- 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: Jack
full_name: Merrin, Jack
id: 4515C308-F248-11E8-B48F-1D18A9856A87
last_name: Merrin
orcid: 0000-0001-5145-4609
- first_name: Jian
full_name: Chen, Jian
last_name: Chen
- first_name: Lana
full_name: Shabala, Lana
last_name: Shabala
- first_name: Wouter
full_name: Smet, Wouter
last_name: Smet
- first_name: Hong
full_name: Ren, Hong
last_name: Ren
- first_name: Steffen
full_name: Vanneste, Steffen
last_name: Vanneste
- first_name: Sergey
full_name: Shabala, Sergey
last_name: Shabala
- first_name: Bert
full_name: De Rybel, Bert
last_name: De Rybel
- first_name: Dolf
full_name: Weijers, Dolf
last_name: Weijers
- first_name: Toshinori
full_name: Kinoshita, Toshinori
last_name: Kinoshita
- first_name: William M.
full_name: Gray, William M.
last_name: Gray
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Li L, Verstraeten I, Roosjen M, et al. Cell surface and intracellular auxin
signalling for H+-fluxes in root growth. Research Square. doi:10.21203/rs.3.rs-266395/v3
apa: Li, L., Verstraeten, I., Roosjen, M., Takahashi, K., Rodriguez Solovey, L.,
Merrin, J., … Friml, J. (n.d.). Cell surface and intracellular auxin signalling
for H+-fluxes in root growth. Research Square. https://doi.org/10.21203/rs.3.rs-266395/v3
chicago: Li, Lanxin, Inge Verstraeten, Mark Roosjen, Koji Takahashi, Lesia Rodriguez
Solovey, Jack Merrin, Jian Chen, et al. “Cell Surface and Intracellular Auxin
Signalling for H+-Fluxes in Root Growth.” Research Square, n.d. https://doi.org/10.21203/rs.3.rs-266395/v3.
ieee: L. Li et al., “Cell surface and intracellular auxin signalling for
H+-fluxes in root growth,” Research Square. .
ista: Li L, Verstraeten I, Roosjen M, Takahashi K, Rodriguez Solovey L, Merrin J,
Chen J, Shabala L, Smet W, Ren H, Vanneste S, Shabala S, De Rybel B, Weijers D,
Kinoshita T, Gray WM, Friml J. Cell surface and intracellular auxin signalling
for H+-fluxes in root growth. Research Square, 266395.
mla: Li, Lanxin, et al. “Cell Surface and Intracellular Auxin Signalling for H+-Fluxes
in Root Growth.” Research Square, 266395, doi:10.21203/rs.3.rs-266395/v3.
short: L. Li, I. Verstraeten, M. Roosjen, K. Takahashi, L. Rodriguez Solovey, J.
Merrin, J. Chen, L. Shabala, W. Smet, H. Ren, S. Vanneste, S. Shabala, B. De Rybel,
D. Weijers, T. Kinoshita, W.M. Gray, J. Friml, Research Square (n.d.).
date_created: 2021-10-06T08:56:22Z
date_published: 2021-09-09T00:00:00Z
date_updated: 2024-10-29T10:22:44Z
day: '09'
department:
- _id: JiFr
- _id: NanoFab
doi: 10.21203/rs.3.rs-266395/v3
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.doi.org/10.21203/rs.3.rs-266395/v3
month: '09'
oa: 1
oa_version: Preprint
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _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: 26B4D67E-B435-11E9-9278-68D0E5697425
grant_number: '25351'
name: 'A Case Study of Plant Growth Regulation: Molecular Mechanism of Auxin-mediated
Rapid Growth Inhibition in Arabidopsis Root'
publication: Research Square
publication_identifier:
issn:
- 2693-5015
publication_status: accepted
related_material:
record:
- id: '10083'
relation: dissertation_contains
status: public
- id: '10223'
relation: later_version
status: public
status: public
title: Cell surface and intracellular auxin signalling for H+-fluxes in root growth
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: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2021'
...
---
_id: '10103'
abstract:
- lang: eng
text: The small cellular molecule inositol hexakisphosphate (IP6) has been known
for ~20 years to promote the in vitro assembly of HIV-1 into immature virus-like
particles. However, the molecular details underlying this effect have been determined
only recently, with the identification of the IP6 binding site in the immature
Gag lattice. IP6 also promotes formation of the mature capsid protein (CA) lattice
via a second IP6 binding site, and enhances core stability, creating a favorable
environment for reverse transcription. IP6 also enhances assembly of other retroviruses,
from both the Lentivirus and the Alpharetrovirus genera. These findings suggest
that IP6 may have a conserved function throughout the family Retroviridae. Here,
we discuss the different steps in the viral life cycle that are influenced by
IP6, and describe in detail how IP6 interacts with the immature and mature lattices
of different retroviruses.
acknowledgement: We thank Volker M. Vogt for his critical comments in preparation
of the review.
article_number: '1853'
article_processing_charge: Yes
article_type: original
author:
- first_name: Martin
full_name: Obr, Martin
id: 4741CA5A-F248-11E8-B48F-1D18A9856A87
last_name: Obr
orcid: 0000-0003-1756-6564
- first_name: Florian KM
full_name: Schur, Florian KM
id: 48AD8942-F248-11E8-B48F-1D18A9856A87
last_name: Schur
orcid: 0000-0003-4790-8078
- first_name: Robert A.
full_name: Dick, Robert A.
last_name: Dick
citation:
ama: Obr M, Schur FK, Dick RA. A structural perspective of the role of IP6 in immature
and mature retroviral assembly. Viruses. 2021;13(9). doi:10.3390/v13091853
apa: Obr, M., Schur, F. K., & Dick, R. A. (2021). A structural perspective of
the role of IP6 in immature and mature retroviral assembly. Viruses. MDPI.
https://doi.org/10.3390/v13091853
chicago: Obr, Martin, Florian KM Schur, and Robert A. Dick. “A Structural Perspective
of the Role of IP6 in Immature and Mature Retroviral Assembly.” Viruses.
MDPI, 2021. https://doi.org/10.3390/v13091853.
ieee: M. Obr, F. K. Schur, and R. A. Dick, “A structural perspective of the role
of IP6 in immature and mature retroviral assembly,” Viruses, vol. 13, no.
9. MDPI, 2021.
ista: Obr M, Schur FK, Dick RA. 2021. A structural perspective of the role of IP6
in immature and mature retroviral assembly. Viruses. 13(9), 1853.
mla: Obr, Martin, et al. “A Structural Perspective of the Role of IP6 in Immature
and Mature Retroviral Assembly.” Viruses, vol. 13, no. 9, 1853, MDPI, 2021,
doi:10.3390/v13091853.
short: M. Obr, F.K. Schur, R.A. Dick, Viruses 13 (2021).
date_created: 2021-10-07T09:13:29Z
date_published: 2021-09-17T00:00:00Z
date_updated: 2023-08-14T07:21:51Z
day: '17'
ddc:
- '616'
department:
- _id: FlSc
doi: 10.3390/v13091853
external_id:
isi:
- '000699841100001'
pmid:
- '34578434'
file:
- access_level: open_access
checksum: bcfd72a12977d48e22df3d0cc55aacf1
content_type: application/pdf
creator: cchlebak
date_created: 2021-10-08T10:38:15Z
date_updated: 2021-10-08T10:38:15Z
file_id: '10115'
file_name: 2021_Viruses_Obr.pdf
file_size: 4146796
relation: main_file
success: 1
file_date_updated: 2021-10-08T10:38:15Z
has_accepted_license: '1'
intvolume: ' 13'
isi: 1
issue: '9'
keyword:
- virology
- infectious diseases
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 26736D6A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P31445
name: Structural conservation and diversity in retroviral capsid
publication: Viruses
publication_identifier:
issn:
- 1999-4915
publication_status: published
publisher: MDPI
quality_controlled: '1'
status: public
title: A structural perspective of the role of IP6 in immature and mature retroviral
assembly
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: 13
year: '2021'
...
---
_id: '10108'
abstract:
- lang: eng
text: We argue that the time is ripe to investigate differential monitoring, in
which the specification of a program's behavior is implicitly given by a second
program implementing the same informal specification. Similar ideas have been
proposed before, and are currently implemented in restricted form for testing
and specialized run-time analyses, aspects of which we combine. We discuss the
challenges of implementing differential monitoring as a general-purpose, black-box
run-time monitoring framework, and present promising results of a preliminary
implementation, showing low monitoring overheads for diverse programs.
acknowledgement: The authors would like to thank Borzoo Bonakdarpour, Derek Dreyer,
Adrian Francalanza, Owolabi Legunsen, Mae Milano, Manuel Rigger, Cesar Sanchez,
and the members of the IST Verification Seminar for their helpful comments and insights
on various stages of this work, as well as the reviewers of RV’21 for their helpful
suggestions on the actual paper.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Fabian
full_name: Mühlböck, Fabian
id: 6395C5F6-89DF-11E9-9C97-6BDFE5697425
last_name: Mühlböck
orcid: 0000-0003-1548-0177
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
citation:
ama: 'Mühlböck F, Henzinger TA. Differential monitoring. In: International Conference
on Runtime Verification. Vol 12974. Cham: Springer Nature; 2021:231-243. doi:10.1007/978-3-030-88494-9_12'
apa: 'Mühlböck, F., & Henzinger, T. A. (2021). Differential monitoring. In International
Conference on Runtime Verification (Vol. 12974, pp. 231–243). Cham: Springer
Nature. https://doi.org/10.1007/978-3-030-88494-9_12'
chicago: 'Mühlböck, Fabian, and Thomas A Henzinger. “Differential Monitoring.” In
International Conference on Runtime Verification, 12974:231–43. Cham: Springer
Nature, 2021. https://doi.org/10.1007/978-3-030-88494-9_12.'
ieee: F. Mühlböck and T. A. Henzinger, “Differential monitoring,” in International
Conference on Runtime Verification, Virtual, 2021, vol. 12974, pp. 231–243.
ista: 'Mühlböck F, Henzinger TA. 2021. Differential monitoring. International Conference
on Runtime Verification. RV: Runtime Verification, LNCS, vol. 12974, 231–243.'
mla: Mühlböck, Fabian, and Thomas A. Henzinger. “Differential Monitoring.” International
Conference on Runtime Verification, vol. 12974, Springer Nature, 2021, pp.
231–43, doi:10.1007/978-3-030-88494-9_12.
short: F. Mühlböck, T.A. Henzinger, in:, International Conference on Runtime Verification,
Springer Nature, Cham, 2021, pp. 231–243.
conference:
end_date: 2021-10-14
location: Virtual
name: 'RV: Runtime Verification'
start_date: 2021-10-11
date_created: 2021-10-07T23:30:10Z
date_published: 2021-10-06T00:00:00Z
date_updated: 2023-08-14T07:20:30Z
day: '06'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.1007/978-3-030-88494-9_12
external_id:
isi:
- '000719383800012'
file:
- access_level: open_access
checksum: 554c7fdb259eda703a8b6328a6dad55a
content_type: application/pdf
creator: fmuehlbo
date_created: 2021-10-07T23:32:18Z
date_updated: 2021-10-07T23:32:18Z
file_id: '10109'
file_name: differentialmonitoring-cameraready-openaccess.pdf
file_size: 350632
relation: main_file
success: 1
file_date_updated: 2021-10-07T23:32:18Z
has_accepted_license: '1'
intvolume: ' 12974'
isi: 1
keyword:
- run-time verification
- software engineering
- implicit specification
language:
- iso: eng
month: '10'
oa: 1
oa_version: Preprint
page: 231-243
place: Cham
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: International Conference on Runtime Verification
publication_identifier:
eisbn:
- 978-3-030-88494-9
eissn:
- 1611-3349
isbn:
- 978-3-030-88493-2
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '9946'
relation: extended_version
status: public
scopus_import: '1'
status: public
title: Differential monitoring
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 12974
year: '2021'
...
---
_id: '10110'
abstract:
- lang: eng
text: Pattern separation is a fundamental brain computation that converts small
differences in input patterns into large differences in output patterns. Several
synaptic mechanisms of pattern separation have been proposed, including code expansion,
inhibition and plasticity; however, which of these mechanisms play a role in the
entorhinal cortex (EC)–dentate gyrus (DG)–CA3 circuit, a classical pattern separation
circuit, remains unclear. Here we show that a biologically realistic, full-scale
EC–DG–CA3 circuit model, including granule cells (GCs) and parvalbumin-positive
inhibitory interneurons (PV+-INs) in the DG, is an efficient pattern separator.
Both external gamma-modulated inhibition and internal lateral inhibition mediated
by PV+-INs substantially contributed to pattern separation. Both local connectivity
and fast signaling at GC–PV+-IN synapses were important for maximum effectiveness.
Similarly, mossy fiber synapses with conditional detonator properties contributed
to pattern separation. By contrast, perforant path synapses with Hebbian synaptic
plasticity and direct EC–CA3 connection shifted the network towards pattern completion.
Our results demonstrate that the specific properties of cells and synapses optimize
higher-order computations in biological networks and might be useful to improve
the deep learning capabilities of technical networks.
author:
- first_name: José
full_name: Guzmán, José
id: 30CC5506-F248-11E8-B48F-1D18A9856A87
last_name: Guzmán
orcid: 0000-0003-2209-5242
- first_name: Alois
full_name: Schlögl, Alois
id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
last_name: Schlögl
orcid: 0000-0002-5621-8100
- first_name: 'Claudia '
full_name: 'Espinoza Martinez, Claudia '
id: 31FFEE2E-F248-11E8-B48F-1D18A9856A87
last_name: Espinoza Martinez
orcid: 0000-0003-4710-2082
- first_name: Xiaomin
full_name: Zhang, Xiaomin
id: 423EC9C2-F248-11E8-B48F-1D18A9856A87
last_name: Zhang
- first_name: Benjamin
full_name: Suter, Benjamin
id: 4952F31E-F248-11E8-B48F-1D18A9856A87
last_name: Suter
orcid: 0000-0002-9885-6936
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Guzmán J, Schlögl A, Espinoza Martinez C, Zhang X, Suter B, Jonas PM. How connectivity
rules and synaptic properties shape the efficacy of pattern separation in the
entorhinal cortex–dentate gyrus–CA3 network. 2021. doi:10.15479/AT:ISTA:10110
apa: Guzmán, J., Schlögl, A., Espinoza Martinez, C., Zhang, X., Suter, B., &
Jonas, P. M. (2021). How connectivity rules and synaptic properties shape the
efficacy of pattern separation in the entorhinal cortex–dentate gyrus–CA3 network.
IST Austria. https://doi.org/10.15479/AT:ISTA:10110
chicago: Guzmán, José, Alois Schlögl, Claudia Espinoza Martinez, Xiaomin Zhang,
Benjamin Suter, and Peter M Jonas. “How Connectivity Rules and Synaptic Properties
Shape the Efficacy of Pattern Separation in the Entorhinal Cortex–Dentate Gyrus–CA3
Network.” IST Austria, 2021. https://doi.org/10.15479/AT:ISTA:10110.
ieee: J. Guzmán, A. Schlögl, C. Espinoza Martinez, X. Zhang, B. Suter, and P. M.
Jonas, “How connectivity rules and synaptic properties shape the efficacy of pattern
separation in the entorhinal cortex–dentate gyrus–CA3 network.” IST Austria, 2021.
ista: Guzmán J, Schlögl A, Espinoza Martinez C, Zhang X, Suter B, Jonas PM. 2021.
How connectivity rules and synaptic properties shape the efficacy of pattern separation
in the entorhinal cortex–dentate gyrus–CA3 network, IST Austria, 10.15479/AT:ISTA:10110.
mla: Guzmán, José, et al. How Connectivity Rules and Synaptic Properties Shape
the Efficacy of Pattern Separation in the Entorhinal Cortex–Dentate Gyrus–CA3
Network. IST Austria, 2021, doi:10.15479/AT:ISTA:10110.
short: J. Guzmán, A. Schlögl, C. Espinoza Martinez, X. Zhang, B. Suter, P.M. Jonas,
(2021).
date_created: 2021-10-08T06:44:22Z
date_published: 2021-12-16T00:00:00Z
date_updated: 2024-03-25T23:30:07Z
day: '16'
ddc:
- '005'
department:
- _id: PeJo
- _id: ScienComp
doi: 10.15479/AT:ISTA:10110
file:
- access_level: open_access
checksum: f92f8931cad0aa7e411c1715337bf408
content_type: application/x-zip-compressed
creator: cchlebak
date_created: 2021-10-08T08:46:04Z
date_updated: 2021-10-08T08:46:04Z
file_id: '10114'
file_name: patternseparation-main (1).zip
file_size: 332990101
relation: main_file
success: 1
file_date_updated: 2021-10-08T08:46:04Z
has_accepted_license: '1'
license: https://opensource.org/licenses/GPL-3.0
month: '12'
oa: 1
publisher: IST Austria
related_material:
link:
- description: News on IST Webpage
relation: press_release
url: https://ist.ac.at/en/news/spot-the-difference/
record:
- id: '10816'
relation: used_for_analysis_in
status: public
status: public
title: How connectivity rules and synaptic properties shape the efficacy of pattern
separation in the entorhinal cortex–dentate gyrus–CA3 network
tmp:
legal_code_url: https://www.gnu.org/licenses/gpl-3.0.en.html
name: GNU General Public License 3.0
short: GPL 3.0
type: software
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2021'
...