---
_id: '10052'
abstract:
- lang: eng
text: "A deterministic finite automaton (DFA) \U0001D49C is composite if its language
L(\U0001D49C) can be decomposed into an intersection ⋂_{i = 1}^k L(\U0001D49C_i)
of languages of smaller DFAs. Otherwise, \U0001D49C is prime. This notion of primality
was introduced by Kupferman and Mosheiff in 2013, and while they proved that we
can decide whether a DFA is composite, the precise complexity of this problem
is still open, with a doubly-exponential gap between the upper and lower bounds.
In this work, we focus on permutation DFAs, i.e., those for which the transition
monoid is a group. We provide an NP algorithm to decide whether a permutation
DFA is composite, and show that the difficulty of this problem comes from the
number of non-accepting states of the instance: we give a fixed-parameter tractable
algorithm with the number of rejecting states as the parameter. Moreover, we investigate
the class of commutative permutation DFAs. Their structural properties allow us
to decide compositionality in NL, and even in LOGSPACE if the alphabet size is
fixed. Despite this low complexity, we show that complex behaviors still arise
in this class: we provide a family of composite DFAs each requiring polynomially
many factors with respect to its size. We also consider the variant of the problem
that asks whether a DFA is k-factor composite, that is, decomposable into k smaller
DFAs, for some given integer k ∈ ℕ. We show that, for commutative permutation
DFAs, restricting the number of factors makes the decision computationally harder,
and yields a problem with tight bounds: it is NP-complete. Finally, we show that
in general, this problem is in PSPACE, and it is in LOGSPACE for DFAs with a singleton
alphabet."
acknowledgement: "Ismaël Jecker: Marie Skłodowska-Curie Grant Agreement No. 754411.
Nicolas Mazzocchi: BOSCO project PGC2018-102210-B-I00 (MCIU/AEI/FEDER, UE), BLOQUESCM
project S2018/TCS-4339, and MINECO grant RYC-2016-20281.\r\nPetra Wolf : DFG project
FE 560/9-1.\r\n"
alternative_title:
- LIPIcs
article_number: '18'
article_processing_charge: No
arxiv: 1
author:
- first_name: Ismael R
full_name: Jecker, Ismael R
id: 85D7C63E-7D5D-11E9-9C0F-98C4E5697425
last_name: Jecker
- first_name: Nicolas
full_name: Mazzocchi, Nicolas
last_name: Mazzocchi
- first_name: Petra
full_name: Wolf, Petra
last_name: Wolf
citation:
ama: 'Jecker IR, Mazzocchi N, Wolf P. Decomposing permutation automata. In: 32nd
International Conference on Concurrency Theory. Vol 203. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.CONCUR.2021.18'
apa: 'Jecker, I. R., Mazzocchi, N., & Wolf, P. (2021). Decomposing permutation
automata. In 32nd International Conference on Concurrency Theory (Vol.
203). Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2021.18'
chicago: Jecker, Ismael R, Nicolas Mazzocchi, and Petra Wolf. “Decomposing Permutation
Automata.” In 32nd International Conference on Concurrency Theory, Vol.
203. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.CONCUR.2021.18.
ieee: I. R. Jecker, N. Mazzocchi, and P. Wolf, “Decomposing permutation automata,”
in 32nd International Conference on Concurrency Theory, Paris, France,
2021, vol. 203.
ista: 'Jecker IR, Mazzocchi N, Wolf P. 2021. Decomposing permutation automata. 32nd
International Conference on Concurrency Theory. CONCUR: Conference on Concurrency
Theory, LIPIcs, vol. 203, 18.'
mla: Jecker, Ismael R., et al. “Decomposing Permutation Automata.” 32nd International
Conference on Concurrency Theory, vol. 203, 18, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2021, doi:10.4230/LIPIcs.CONCUR.2021.18.
short: I.R. Jecker, N. Mazzocchi, P. Wolf, in:, 32nd International Conference on
Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
conference:
end_date: 2021-08-27
location: Paris, France
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2021-08-23
date_created: 2021-09-27T14:33:14Z
date_published: 2021-08-13T00:00:00Z
date_updated: 2025-05-14T10:55:28Z
day: '13'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.CONCUR.2021.18
ec_funded: 1
external_id:
arxiv:
- '2107.04683'
file:
- access_level: open_access
checksum: 4722c81be82265cf45e78adf9db91250
content_type: application/pdf
creator: cchlebak
date_created: 2021-10-01T11:10:53Z
date_updated: 2021-10-01T11:10:53Z
file_id: '10064'
file_name: 2021_CONCUR_Jecker.pdf
file_size: 1003552
relation: main_file
success: 1
file_date_updated: 2021-10-01T11:10:53Z
has_accepted_license: '1'
intvolume: ' 203'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
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: 32nd International Conference on Concurrency Theory
publication_identifier:
isbn:
- 978-3-9597-7203-7
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Decomposing permutation automata
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: 203
year: '2021'
...
---
_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: 2025-04-15T07:50:11Z
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 M, 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., 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 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. 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 M, Kale SS, Svozil A. 2021. Faster algorithms for
bounded liveness in graphs and game graphs. 48th International Colloquium on Automata,
Languages, and Programming. ICALP: 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. 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: Automata, Languages and Programming'
start_date: 2021-07-12
corr_author: '1'
date_created: 2021-09-27T14:33:15Z
date_published: 2021-07-02T00:00:00Z
date_updated: 2025-05-14T10:55:19Z
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
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: 2025-05-14T10:55:11Z
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 187
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).
corr_author: '1'
date_created: 2021-10-03T22:01:21Z
date_published: 2021-09-28T00:00:00Z
date_updated: 2024-10-09T21:00:57Z
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).
corr_author: '1'
date_created: 2021-10-03T22:01:21Z
date_published: 2021-09-15T00:00:00Z
date_updated: 2025-04-14T07:27:45Z
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: 2026-02-10T09:59:59Z
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'
related_material:
record:
- id: '21143'
relation: later_version
status: public
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).
corr_author: '1'
date_created: 2021-10-03T22:01:23Z
date_published: 2021-09-19T00:00:00Z
date_updated: 2025-04-14T09:29:32Z
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: 2025-05-14T10:54:50Z
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: 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: 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: 2025-07-10T11:49:40Z
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: '12676 '
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: 2025-04-15T06:48:21Z
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: '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).
corr_author: '1'
date_created: 2021-10-07T09:13:29Z
date_published: 2021-09-17T00:00:00Z
date_updated: 2025-04-15T08:24:49Z
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'
scopus_import: '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
corr_author: '1'
date_created: 2021-10-07T23:30:10Z
date_published: 2021-10-06T00:00:00Z
date_updated: 2025-04-15T06:26:12Z
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: Formal methods for the design and analysis of complex systems
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: '10116'
abstract:
- lang: eng
text: The ubiquitous Ca2+ sensor calmodulin (CaM) binds and regulates many proteins,
including ion channels, CaM kinases, and calcineurin, according to Ca2+-CaM levels.
What regulates neuronal CaM levels, is, however, unclear. CaM-binding transcription
activators (CAMTAs) are ancient proteins expressed broadly in nervous systems
and whose loss confers pleiotropic behavioral defects in flies, mice, and humans.
Using Caenorhabditis elegans and Drosophila, we show that CAMTAs control neuronal
CaM levels. The behavioral and neuronal Ca2+ signaling defects in mutants lacking
camt-1, the sole C. elegans CAMTA, can be rescued by supplementing neuronal CaM.
CAMT-1 binds multiple sites in the CaM promoter and deleting these sites phenocopies
camt-1. Our data suggest CAMTAs mediate a conserved and general mechanism that
controls neuronal CaM levels, thereby regulating Ca2+ signaling, physiology, and
behavior.
acknowledgement: The authors thank the MRC-LMB Flow Cytometry facility and Imaging
Service for support, the Cancer Research UK Cambridge Institute Genomics Core for
Next Generation Sequencing, Julie Ahringer and Alex Appert for advice and technical
help for ChIP-seq experiments, Paula Freire-Pritchett, Tim Stevens, and Gurpreet
Ghattaoraya for RNA-seq and ChIP-seq analyses, Nikos Chronis for the TN-XL plasmid,
Hong-Sheng Li and Daisuke Yamamoto for generously sending the tes2 and cro mutants,
Daria Siekhaus for hosting the fly work, Michaela Misova for technical assistance.
The authors are very grateful to Salihah Ece Sönmez for teaching us how to dissect,
mount and stain Drosophila retinae. This work was supported by an Advanced ERC grant
(269058 ACMO) and a Wellcome Investigator Award (209504/Z/17/Z) to MdB, and an IST
Plus Fellowship to TV-B (Marie Sklodowska-Curie Agreement no 754411).
article_number: e68238
article_processing_charge: No
article_type: original
author:
- first_name: Thanh
full_name: Vuong-Brender, Thanh
id: D389312E-10C4-11EA-ABF4-A4B43DDC885E
last_name: Vuong-Brender
- first_name: Sean
full_name: Flynn, Sean
last_name: Flynn
- first_name: Yvonne
full_name: Vallis, Yvonne
id: 05A2795C-31B5-11EA-83A7-7DA23DDC885E
last_name: Vallis
- first_name: Mario
full_name: De Bono, Mario
id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
last_name: De Bono
orcid: 0000-0001-8347-0443
citation:
ama: Vuong-Brender T, Flynn S, Vallis Y, de Bono M. Neuronal calmodulin levels are
controlled by CAMTA transcription factors. eLife. 2021;10. doi:10.7554/eLife.68238
apa: Vuong-Brender, T., Flynn, S., Vallis, Y., & de Bono, M. (2021). Neuronal
calmodulin levels are controlled by CAMTA transcription factors. ELife.
eLife Sciences Publications. https://doi.org/10.7554/eLife.68238
chicago: Vuong-Brender, Thanh, Sean Flynn, Yvonne Vallis, and Mario de Bono. “Neuronal
Calmodulin Levels Are Controlled by CAMTA Transcription Factors.” ELife.
eLife Sciences Publications, 2021. https://doi.org/10.7554/eLife.68238.
ieee: T. Vuong-Brender, S. Flynn, Y. Vallis, and M. de Bono, “Neuronal calmodulin
levels are controlled by CAMTA transcription factors,” eLife, vol. 10.
eLife Sciences Publications, 2021.
ista: Vuong-Brender T, Flynn S, Vallis Y, de Bono M. 2021. Neuronal calmodulin levels
are controlled by CAMTA transcription factors. eLife. 10, e68238.
mla: Vuong-Brender, Thanh, et al. “Neuronal Calmodulin Levels Are Controlled by
CAMTA Transcription Factors.” ELife, vol. 10, e68238, eLife Sciences Publications,
2021, doi:10.7554/eLife.68238.
short: T. Vuong-Brender, S. Flynn, Y. Vallis, M. de Bono, ELife 10 (2021).
date_created: 2021-10-10T22:01:22Z
date_published: 2021-09-17T00:00:00Z
date_updated: 2025-04-14T07:43:46Z
day: '17'
ddc:
- '610'
department:
- _id: MaDe
doi: 10.7554/eLife.68238
ec_funded: 1
external_id:
isi:
- '000695716100001'
pmid:
- '34499028'
file:
- access_level: open_access
checksum: b465e172d2b1f57aa26a2571a085d052
content_type: application/pdf
creator: cchlebak
date_created: 2021-10-11T14:15:07Z
date_updated: 2021-10-11T14:15:07Z
file_id: '10122'
file_name: 2021_eLife_VuongBrender.pdf
file_size: 1774624
relation: main_file
success: 1
file_date_updated: 2021-10-11T14:15:07Z
has_accepted_license: '1'
intvolume: ' 10'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: eLife
publication_identifier:
eissn:
- 2050-084X
publication_status: published
publisher: eLife Sciences Publications
quality_controlled: '1'
scopus_import: '1'
status: public
title: Neuronal calmodulin levels are controlled by CAMTA transcription factors
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: 10
year: '2021'
...
---
_id: '10117'
abstract:
- lang: eng
text: Proximity labeling provides a powerful in vivo tool to characterize the proteome
of subcellular structures and the interactome of specific proteins. The nematode
Caenorhabditis elegans is one of the most intensely studied organisms in biology,
offering many advantages for biochemistry. Using the highly active biotin ligase
TurboID, we optimize here a proximity labeling protocol for C. elegans. An advantage
of TurboID is that biotin's high affinity for streptavidin means biotin-labeled
proteins can be affinity-purified under harsh denaturing conditions. By combining
extensive sonication with aggressive denaturation using SDS and urea, we achieved
near-complete solubilization of worm proteins. We then used this protocol to characterize
the proteomes of the worm gut, muscle, skin, and nervous system. Neurons are among
the smallest C. elegans cells. To probe the method's sensitivity, we expressed
TurboID exclusively in the two AFD neurons and showed that the protocol could
identify known and previously unknown proteins expressed selectively in AFD. The
active zones of synapses are composed of a protein matrix that is difficult to
solubilize and purify. To test if our protocol could solubilize active zone proteins,
we knocked TurboID into the endogenous elks-1 gene, which encodes a presynaptic
active zone protein. We identified many known ELKS-1-interacting active zone proteins,
as well as previously uncharacterized synaptic proteins. Versatile vectors and
the inherent advantages of using C. elegans, including fast growth and the ability
to rapidly make and functionally test knock-ins, make proximity labeling a valuable
addition to the armory of this model organism.
acknowledgement: We thank de Bono lab members for helpful comments on the manuscript,
IST Austria and University of Vienna Mass Spec Facilities for invaluable discussions
and comments for the optimization of mass spec analyses of worm samples. The biotin
auxotropic E. coli strain MG1655bioB:kan was gift from John Cronan (University of
Illinois) and was kindly sent to us by Jessica Feldman and Ariana Sanchez (Stanford
University). dg398 pEntryslot2_mNeongreen::3XFLAG::stop and dg397 pEntryslot3_mNeongreen::3XFLAG::stop::unc-54
3′UTR entry vector were kindly shared by Dr Dominique Glauser (University of Fribourg).
Codon-optimized mScarlet vector was a generous gift from Dr Manuel Zimmer (University
of Vienna).
article_number: '101094'
article_processing_charge: Yes
article_type: original
author:
- first_name: Murat
full_name: Artan, Murat
id: C407B586-6052-11E9-B3AE-7006E6697425
last_name: Artan
orcid: 0000-0001-8945-6992
- first_name: Stephen
full_name: Barratt, Stephen
id: 57740d2b-2a88-11ec-97cf-d9e6d1b39677
last_name: Barratt
- first_name: Sean M.
full_name: Flynn, Sean M.
last_name: Flynn
- first_name: Farida
full_name: Begum, Farida
last_name: Begum
- first_name: Mark
full_name: Skehel, Mark
last_name: Skehel
- first_name: Armel
full_name: Nicolas, Armel
id: 2A103192-F248-11E8-B48F-1D18A9856A87
last_name: Nicolas
- first_name: Mario
full_name: De Bono, Mario
id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
last_name: De Bono
orcid: 0000-0001-8347-0443
citation:
ama: Artan M, Barratt S, Flynn SM, et al. Interactome analysis of Caenorhabditis
elegans synapses by TurboID-based proximity labeling. Journal of Biological
Chemistry. 2021;297(3). doi:10.1016/J.JBC.2021.101094
apa: Artan, M., Barratt, S., Flynn, S. M., Begum, F., Skehel, M., Nicolas, A., &
de Bono, M. (2021). Interactome analysis of Caenorhabditis elegans synapses by
TurboID-based proximity labeling. Journal of Biological Chemistry. Elsevier.
https://doi.org/10.1016/J.JBC.2021.101094
chicago: Artan, Murat, Stephen Barratt, Sean M. Flynn, Farida Begum, Mark Skehel,
Armel Nicolas, and Mario de Bono. “Interactome Analysis of Caenorhabditis Elegans
Synapses by TurboID-Based Proximity Labeling.” Journal of Biological Chemistry.
Elsevier, 2021. https://doi.org/10.1016/J.JBC.2021.101094.
ieee: M. Artan et al., “Interactome analysis of Caenorhabditis elegans synapses
by TurboID-based proximity labeling,” Journal of Biological Chemistry,
vol. 297, no. 3. Elsevier, 2021.
ista: Artan M, Barratt S, Flynn SM, Begum F, Skehel M, Nicolas A, de Bono M. 2021.
Interactome analysis of Caenorhabditis elegans synapses by TurboID-based proximity
labeling. Journal of Biological Chemistry. 297(3), 101094.
mla: Artan, Murat, et al. “Interactome Analysis of Caenorhabditis Elegans Synapses
by TurboID-Based Proximity Labeling.” Journal of Biological Chemistry,
vol. 297, no. 3, 101094, Elsevier, 2021, doi:10.1016/J.JBC.2021.101094.
short: M. Artan, S. Barratt, S.M. Flynn, F. Begum, M. Skehel, A. Nicolas, M. de
Bono, Journal of Biological Chemistry 297 (2021).
date_created: 2021-10-10T22:01:23Z
date_published: 2021-09-01T00:00:00Z
date_updated: 2025-04-14T07:43:46Z
day: '01'
ddc:
- '612'
department:
- _id: MaDe
- _id: LifeSc
doi: 10.1016/J.JBC.2021.101094
ec_funded: 1
external_id:
isi:
- '000706409200006'
file:
- access_level: open_access
checksum: 19e39d36c5b9387c6dc0e89c9ae856ab
content_type: application/pdf
creator: cchlebak
date_created: 2021-10-11T12:20:58Z
date_updated: 2021-10-11T12:20:58Z
file_id: '10121'
file_name: 2021_JBC_Artan.pdf
file_size: 1680010
relation: main_file
success: 1
file_date_updated: 2021-10-11T12:20:58Z
has_accepted_license: '1'
intvolume: ' 297'
isi: 1
issue: '3'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Journal of Biological Chemistry
publication_identifier:
eissn:
- 1083-351X
issn:
- 0021-9258
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Interactome analysis of Caenorhabditis elegans synapses by TurboID-based proximity
labeling
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: 297
year: '2021'
...
---
_id: '10134'
abstract:
- lang: eng
text: We investigate the effect of coupling between translational and internal degrees
of freedom of composite quantum particles on their localization in a random potential.
We show that entanglement between the two degrees of freedom weakens localization
due to the upper bound imposed on the inverse participation ratio by purity of
a quantum state. We perform numerical calculations for a two-particle system bound
by a harmonic force in a 1D disordered lattice and a rigid rotor in a 2D disordered
lattice. We illustrate that the coupling has a dramatic effect on localization
properties, even with a small number of internal states participating in quantum
dynamics.
acknowledgement: "We acknowledge helpful discussions with W. G. Unruh and A. Rodriguez.
F. S. is supported by European Union’s\r\nHorizon 2020 research and innovation programme
under the Marie Skłodowska-Curie Grant No. 754411. M. L. acknowledges support by
the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). W. H. Z.
is\r\nsupported by Department of Energy under the Los\r\nAlamos National Laboratory
LDRD Program as well as by the U.S. Department of Energy, Office of Science, Basic\r\nEnergy
Sciences, Materials Sciences and Engineering Division, Condensed Matter Theory Program.
R. V. K. is supported by NSERC of Canada.\r\n"
article_number: '160602'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Fumika
full_name: Suzuki, Fumika
id: 650C99FC-1079-11EA-A3C0-73AE3DDC885E
last_name: Suzuki
orcid: 0000-0003-4982-5970
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
- first_name: Wojciech H.
full_name: Zurek, Wojciech H.
last_name: Zurek
- first_name: Roman V.
full_name: Krems, Roman V.
last_name: Krems
citation:
ama: Suzuki F, Lemeshko M, Zurek WH, Krems RV. Anderson localization of composite
particles. Physical Review Letters. 2021;127(16). doi:10.1103/physrevlett.127.160602
apa: Suzuki, F., Lemeshko, M., Zurek, W. H., & Krems, R. V. (2021). Anderson
localization of composite particles. Physical Review Letters. American
Physical Society . https://doi.org/10.1103/physrevlett.127.160602
chicago: Suzuki, Fumika, Mikhail Lemeshko, Wojciech H. Zurek, and Roman V. Krems.
“Anderson Localization of Composite Particles.” Physical Review Letters.
American Physical Society , 2021. https://doi.org/10.1103/physrevlett.127.160602.
ieee: F. Suzuki, M. Lemeshko, W. H. Zurek, and R. V. Krems, “Anderson localization
of composite particles,” Physical Review Letters, vol. 127, no. 16. American
Physical Society , 2021.
ista: Suzuki F, Lemeshko M, Zurek WH, Krems RV. 2021. Anderson localization of composite
particles. Physical Review Letters. 127(16), 160602.
mla: Suzuki, Fumika, et al. “Anderson Localization of Composite Particles.” Physical
Review Letters, vol. 127, no. 16, 160602, American Physical Society , 2021,
doi:10.1103/physrevlett.127.160602.
short: F. Suzuki, M. Lemeshko, W.H. Zurek, R.V. Krems, Physical Review Letters 127
(2021).
corr_author: '1'
date_created: 2021-10-13T09:21:33Z
date_published: 2021-10-12T00:00:00Z
date_updated: 2025-04-14T07:43:46Z
day: '12'
department:
- _id: MiLe
doi: 10.1103/physrevlett.127.160602
ec_funded: 1
external_id:
arxiv:
- '2011.06279'
isi:
- '000707495700001'
intvolume: ' 127'
isi: 1
issue: '16'
keyword:
- General Physics and Astronomy
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2011.06279
month: '10'
oa: 1
oa_version: Preprint
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 2688CF98-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '801770'
name: 'Angulon: physics and applications of a new quasiparticle'
publication: Physical Review Letters
publication_identifier:
eissn:
- 1079-7114
issn:
- 0031-9007
publication_status: published
publisher: 'American Physical Society '
quality_controlled: '1'
scopus_import: '1'
status: public
title: Anderson localization of composite particles
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 127
year: '2021'
...
---
_id: '10146'
abstract:
- lang: eng
text: The enzymes of the mitochondrial electron transport chain are key players
of cell metabolism. Despite being active when isolated, in vivo they associate
into supercomplexes1, whose precise role is debated. Supercomplexes CIII2CIV1-2
(refs. 2,3), CICIII2 (ref. 4) and CICIII2CIV (respirasome)5,6,7,8,9,10 exist in
mammals, but in contrast to CICIII2 and the respirasome, to date the only known
eukaryotic structures of CIII2CIV1-2 come from Saccharomyces cerevisiae11,12 and
plants13, which have different organization. Here we present the first, to our
knowledge, structures of mammalian (mouse and ovine) CIII2CIV and its assembly
intermediates, in different conformations. We describe the assembly of CIII2CIV
from the CIII2 precursor to the final CIII2CIV conformation, driven by the insertion
of the N terminus of the assembly factor SCAF1 (ref. 14) deep into CIII2, while
its C terminus is integrated into CIV. Our structures (which include CICIII2 and
the respirasome) also confirm that SCAF1 is exclusively required for the assembly
of CIII2CIV and has no role in the assembly of the respirasome. We show that CIII2
is asymmetric due to the presence of only one copy of subunit 9, which straddles
both monomers and prevents the attachment of a second copy of SCAF1 to CIII2,
explaining the presence of one copy of CIV in CIII2CIV in mammals. Finally, we
show that CIII2 and CIV gain catalytic advantage when assembled into the supercomplex
and propose a role for CIII2CIV in fine tuning the efficiency of electron transfer
in the electron transport chain.
acknowledged_ssus:
- _id: PreCl
- _id: EM-Fac
- _id: ScienComp
acknowledgement: We thank the pre-clinical facility of the IST Austria and A. Venturino
for assistance with the animals; and V.-V. Hodirnau for assistance during the Titan
Krios data collection, performed at the IST Austria. The data processing was performed
at the IST high-performance computing cluster. This project has received funding
from the European Union’s Horizon 2020 research and innovation program under the
Marie Skłodowska-Curie grant agreement no. 754411.
article_processing_charge: No
article_type: original
author:
- first_name: Irene
full_name: Vercellino, Irene
id: 3ED6AF16-F248-11E8-B48F-1D18A9856A87
last_name: Vercellino
orcid: 0000-0001-5618-3449
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
citation:
ama: Vercellino I, Sazanov LA. Structure and assembly of the mammalian mitochondrial
supercomplex CIII2CIV. Nature. 2021;598(7880):364-367. doi:10.1038/s41586-021-03927-z
apa: Vercellino, I., & Sazanov, L. A. (2021). Structure and assembly of the
mammalian mitochondrial supercomplex CIII2CIV. Nature. Springer
Nature. https://doi.org/10.1038/s41586-021-03927-z
chicago: Vercellino, Irene, and Leonid A Sazanov. “Structure and Assembly of the
Mammalian Mitochondrial Supercomplex CIII2CIV.” Nature. Springer
Nature, 2021. https://doi.org/10.1038/s41586-021-03927-z.
ieee: I. Vercellino and L. A. Sazanov, “Structure and assembly of the mammalian
mitochondrial supercomplex CIII2CIV,” Nature, vol. 598, no.
7880. Springer Nature, pp. 364–367, 2021.
ista: Vercellino I, Sazanov LA. 2021. Structure and assembly of the mammalian mitochondrial
supercomplex CIII2CIV. Nature. 598(7880), 364–367.
mla: Vercellino, Irene, and Leonid A. Sazanov. “Structure and Assembly of the Mammalian
Mitochondrial Supercomplex CIII2CIV.” Nature, vol. 598, no.
7880, Springer Nature, 2021, pp. 364–67, doi:10.1038/s41586-021-03927-z.
short: I. Vercellino, L.A. Sazanov, Nature 598 (2021) 364–367.
corr_author: '1'
date_created: 2021-10-17T22:01:17Z
date_published: 2021-10-14T00:00:00Z
date_updated: 2025-04-14T07:43:46Z
day: '14'
department:
- _id: LeSa
doi: 10.1038/s41586-021-03927-z
ec_funded: 1
external_id:
isi:
- '000704581600001'
pmid:
- '34616041'
intvolume: ' 598'
isi: 1
issue: '7880'
language:
- iso: eng
month: '10'
oa_version: None
page: 364-367
pmid: 1
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Nature
publication_identifier:
eissn:
- 1476-4687
issn:
- 0028-0836
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- description: News on IST Webpage
relation: press_release
url: https://ist.ac.at/en/news/boosting-the-cells-power-house/
scopus_import: '1'
status: public
title: Structure and assembly of the mammalian mitochondrial supercomplex CIII2CIV
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 598
year: '2021'
...
---
_id: '10148'
abstract:
- lang: eng
text: Tactile feedback of an object’s surface enables us to discern its material
properties and affordances. This understanding is used in digital fabrication
processes by creating objects with high-resolution surface variations to influence
a user’s tactile perception. As the design of such surface haptics commonly relies
on knowledge from real-life experiences, it is unclear how to adapt this information
for digital design methods. In this work, we investigate replicating the haptics
of real materials. Using an existing process for capturing an object’s microgeometry,
we digitize and reproduce the stable surface information of a set of 15 fabric
samples. In a psychophysical experiment, we evaluate the tactile qualities of
our set of original samples and their replicas. From our results, we see that
direct reproduction of surface variations is able to influence different psychophysical
dimensions of the tactile perception of surface textures. While the fabrication
process did not preserve all properties, our approach underlines that replication
of surface microgeometries benefits fabrication methods in terms of haptic perception
by covering a large range of tactile variations. Moreover, by changing the surface
structure of a single fabricated material, its material perception can be influenced.
We conclude by proposing strategies for capturing and reproducing digitized textures
to better resemble the perceived haptics of the originals.
acknowledgement: Our gratitude goes out to Kamila Mushkina, Akhmajon Makhsadov, Jordan
Espenshade, Bruno Fruchard, Roland Bennewitz, and Robert Drumm. This project has
received funding from the EU’s Horizon 2020 research and innovation programme, under
the Marie Skłodowska-Curie grant agreement No 642841 (DISTRO).
article_processing_charge: No
author:
- first_name: Donald
full_name: Degraen, Donald
last_name: Degraen
- first_name: Michael
full_name: Piovarci, Michael
id: 62E473F4-5C99-11EA-A40E-AF823DDC885E
last_name: Piovarci
orcid: 0000-0002-5062-4474
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Antonio
full_name: Kruger, Antonio
last_name: Kruger
citation:
ama: 'Degraen D, Piovarci M, Bickel B, Kruger A. Capturing tactile properties of
real surfaces for haptic reproduction. In: 34th Annual ACM Symposium. Association
for Computing Machinery; 2021:954-971. doi:10.1145/3472749.3474798'
apa: 'Degraen, D., Piovarci, M., Bickel, B., & Kruger, A. (2021). Capturing
tactile properties of real surfaces for haptic reproduction. In 34th Annual
ACM Symposium (pp. 954–971). Virtual: Association for Computing Machinery.
https://doi.org/10.1145/3472749.3474798'
chicago: Degraen, Donald, Michael Piovarci, Bernd Bickel, and Antonio Kruger. “Capturing
Tactile Properties of Real Surfaces for Haptic Reproduction.” In 34th Annual
ACM Symposium, 954–71. Association for Computing Machinery, 2021. https://doi.org/10.1145/3472749.3474798.
ieee: D. Degraen, M. Piovarci, B. Bickel, and A. Kruger, “Capturing tactile properties
of real surfaces for haptic reproduction,” in 34th Annual ACM Symposium,
Virtual, 2021, pp. 954–971.
ista: 'Degraen D, Piovarci M, Bickel B, Kruger A. 2021. Capturing tactile properties
of real surfaces for haptic reproduction. 34th Annual ACM Symposium. UIST: User
Interface Software and Technology, 954–971.'
mla: Degraen, Donald, et al. “Capturing Tactile Properties of Real Surfaces for
Haptic Reproduction.” 34th Annual ACM Symposium, Association for Computing
Machinery, 2021, pp. 954–71, doi:10.1145/3472749.3474798.
short: D. Degraen, M. Piovarci, B. Bickel, A. Kruger, in:, 34th Annual ACM Symposium,
Association for Computing Machinery, 2021, pp. 954–971.
conference:
end_date: 2021-10-14
location: Virtual
name: 'UIST: User Interface Software and Technology'
start_date: 2021-10-10
date_created: 2021-10-18T07:36:11Z
date_published: 2021-10-10T00:00:00Z
date_updated: 2025-03-31T15:58:15Z
day: '10'
ddc:
- '000'
department:
- _id: BeBi
doi: 10.1145/3472749.3474798
ec_funded: 1
file:
- access_level: open_access
checksum: b0b26464df79b3a59e8ed82e4e19ab15
content_type: application/pdf
creator: bbickel
date_created: 2021-10-18T07:36:03Z
date_updated: 2021-10-18T07:36:03Z
file_id: '10149'
file_name: degraen-UIST2021_Texture_Appropriation_CR_preprint.pdf
file_size: 29796364
relation: main_file
file_date_updated: 2021-10-18T07:36:03Z
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Preprint
page: 954-971
project:
- _id: 2508E324-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '642841'
name: Distributed 3D Object Design
publication: 34th Annual ACM Symposium
publication_identifier:
isbn:
- 978-1-4503-8635-7
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Capturing tactile properties of real surfaces for haptic reproduction
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2021'
...
---
_id: '10153'
abstract:
- lang: eng
text: "Gradual typing is a principled means for mixing typed and untyped code. But
typed and untyped code often exhibit different programming patterns. There is
already substantial research investigating gradually giving types to code exhibiting
typical untyped patterns, and some research investigating gradually removing types
from code exhibiting typical typed patterns. This paper investigates how to extend
these established gradual-typing concepts to give formal guarantees not only about
how to change types as code evolves but also about how to change such programming
patterns as well.\r\n\r\nIn particular, we explore mixing untyped \"structural\"
code with typed \"nominal\" code in an object-oriented language. But whereas previous
work only allowed \"nominal\" objects to be treated as \"structural\" objects,
we also allow \"structural\" objects to dynamically acquire certain nominal types,
namely interfaces. We present a calculus that supports such \"cross-paradigm\"
code migration and interoperation in a manner satisfying both the static and dynamic
gradual guarantees, and demonstrate that the calculus can be implemented efficiently."
acknowledgement: "We thank the reviewers for their valuable suggestions towards improving
the paper. We also \r\nthank Mae Milano and Adrian Sampson, as well as the members
of the Programming Languages Discussion Group at Cornell University and of the Programming
Research Laboratory at Northeastern University, for their helpful feedback on preliminary
findings of this work.\r\n\r\nThis material is based upon work supported in part
by the National Science Foundation (NSF) through grant CCF-1350182 and the Austrian
Science Fund (FWF) through grant Z211-N23 (Wittgenstein~Award).\r\nAny opinions,
findings, and conclusions or recommendations expressed in this material are those
of the authors and do not necessarily reflect the views of the NSF or the FWF."
article_number: '127'
article_processing_charge: No
article_type: original
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: Ross
full_name: Tate, Ross
last_name: Tate
citation:
ama: Mühlböck F, Tate R. Transitioning from structural to nominal code with efficient
gradual typing. Proceedings of the ACM on Programming Languages. 2021;5.
doi:10.1145/3485504
apa: 'Mühlböck, F., & Tate, R. (2021). Transitioning from structural to nominal
code with efficient gradual typing. Proceedings of the ACM on Programming Languages.
Chicago, IL, United States: Association for Computing Machinery. https://doi.org/10.1145/3485504'
chicago: Mühlböck, Fabian, and Ross Tate. “Transitioning from Structural to Nominal
Code with Efficient Gradual Typing.” Proceedings of the ACM on Programming
Languages. Association for Computing Machinery, 2021. https://doi.org/10.1145/3485504.
ieee: F. Mühlböck and R. Tate, “Transitioning from structural to nominal code with
efficient gradual typing,” Proceedings of the ACM on Programming Languages,
vol. 5. Association for Computing Machinery, 2021.
ista: Mühlböck F, Tate R. 2021. Transitioning from structural to nominal code with
efficient gradual typing. Proceedings of the ACM on Programming Languages. 5,
127.
mla: Mühlböck, Fabian, and Ross Tate. “Transitioning from Structural to Nominal
Code with Efficient Gradual Typing.” Proceedings of the ACM on Programming
Languages, vol. 5, 127, Association for Computing Machinery, 2021, doi:10.1145/3485504.
short: F. Mühlböck, R. Tate, Proceedings of the ACM on Programming Languages 5 (2021).
conference:
end_date: 2021-10-23
location: Chicago, IL, United States
name: 'OOPSLA: Object-Oriented Programming, Systems, Languages, and Applications'
start_date: 2021-10-17
date_created: 2021-10-19T12:48:44Z
date_published: 2021-10-15T00:00:00Z
date_updated: 2025-04-15T06:25:55Z
day: '15'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.1145/3485504
file:
- access_level: open_access
checksum: 71011efd2da771cafdec7f0d9693f8c1
content_type: application/pdf
creator: fmuehlbo
date_created: 2021-10-19T12:52:23Z
date_updated: 2021-10-19T12:52:23Z
file_id: '10154'
file_name: monnom-oopsla21.pdf
file_size: 770269
relation: main_file
success: 1
file_date_updated: 2021-10-19T12:52:23Z
has_accepted_license: '1'
intvolume: ' 5'
keyword:
- gradual typing
- gradual guarantee
- nominal
- structural
- call tags
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nd/4.0/
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication: Proceedings of the ACM on Programming Languages
publication_identifier:
eissn:
- 2475-1421
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Transitioning from structural to nominal code with efficient gradual typing
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 5
year: '2021'
...