---
_id: '632'
abstract:
- lang: eng
text: 'We consider a 2D quantum system of N bosons in a trapping potential |x|s,
interacting via a pair potential of the form N2β−1 w(Nβ x). We show that for all
0 < β < (s + 1)/(s + 2), the leading order behavior of ground states of
the many-body system is described in the large N limit by the corresponding cubic
nonlinear Schrödinger energy functional. Our result covers the focusing case (w
< 0) where even the stability of the many-body system is not obvious. This
answers an open question mentioned by X. Chen and J. Holmer for harmonic traps
(s = 2). Together with the BBGKY hierarchy approach used by these authors, our
result implies the convergence of the many-body quantum dynamics to the focusing
NLS equation with harmonic trap for all 0 < β < 3/4. '
article_processing_charge: No
arxiv: 1
author:
- first_name: Mathieu
full_name: Lewin, Mathieu
last_name: Lewin
- first_name: Phan
full_name: Nam, Phan
id: 404092F4-F248-11E8-B48F-1D18A9856A87
last_name: Nam
- first_name: Nicolas
full_name: Rougerie, Nicolas
last_name: Rougerie
citation:
ama: Lewin M, Nam P, Rougerie N. A note on 2D focusing many boson systems. Proceedings
of the American Mathematical Society. 2017;145(6):2441-2454. doi:10.1090/proc/13468
apa: Lewin, M., Nam, P., & Rougerie, N. (2017). A note on 2D focusing many boson
systems. Proceedings of the American Mathematical Society. American Mathematical
Society. https://doi.org/10.1090/proc/13468
chicago: Lewin, Mathieu, Phan Nam, and Nicolas Rougerie. “A Note on 2D Focusing
Many Boson Systems.” Proceedings of the American Mathematical Society.
American Mathematical Society, 2017. https://doi.org/10.1090/proc/13468.
ieee: M. Lewin, P. Nam, and N. Rougerie, “A note on 2D focusing many boson systems,”
Proceedings of the American Mathematical Society, vol. 145, no. 6. American
Mathematical Society, pp. 2441–2454, 2017.
ista: Lewin M, Nam P, Rougerie N. 2017. A note on 2D focusing many boson systems.
Proceedings of the American Mathematical Society. 145(6), 2441–2454.
mla: Lewin, Mathieu, et al. “A Note on 2D Focusing Many Boson Systems.” Proceedings
of the American Mathematical Society, vol. 145, no. 6, American Mathematical
Society, 2017, pp. 2441–54, doi:10.1090/proc/13468.
short: M. Lewin, P. Nam, N. Rougerie, Proceedings of the American Mathematical Society
145 (2017) 2441–2454.
corr_author: '1'
date_created: 2018-12-11T11:47:36Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2025-09-11T07:26:38Z
day: '01'
department:
- _id: RoSe
doi: 10.1090/proc/13468
ec_funded: 1
external_id:
arxiv:
- '1509.09045'
isi:
- '000398833500014'
fulldoi: https://doi.org/10.1090/proc/13468
intvolume: ' 145'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1509.09045
month: '01'
oa: 1
oa_version: Submitted Version
page: 2441 - 2454
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Proceedings of the American Mathematical Society
publication_status: published
publisher: American Mathematical Society
publist_id: '7160'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A note on 2D focusing many boson systems
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 145
year: '2017'
...
---
_id: '633'
abstract:
- lang: eng
text: A Rapidly-exploring Random Tree (RRT) is an algorithm which can search a non-convex
region of space by incrementally building a space-filling tree. The tree is constructed
from random points drawn from system’s state space and is biased to grow towards
large unexplored areas in the system. RRT can provide better coverage of a system’s
possible behaviors compared with random simulations, but is more lightweight than
full reachability analysis. In this paper, we explore some of the design decisions
encountered while implementing a hybrid extension of the RRT algorithm, which
have not been elaborated on before. In particular, we focus on handling non-determinism,
which arises due to discrete transitions. We introduce the notion of important
points to account for this phenomena. We showcase our ideas using heater and navigation
benchmarks.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Stanley
full_name: Bak, Stanley
last_name: Bak
- first_name: Sergiy
full_name: Bogomolov, Sergiy
id: 369D9A44-F248-11E8-B48F-1D18A9856A87
last_name: Bogomolov
orcid: 0000-0002-0686-0365
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Aviral
full_name: Kumar, Aviral
last_name: Kumar
citation:
ama: 'Bak S, Bogomolov S, Henzinger TA, Kumar A. Challenges and tool implementation
of hybrid rapidly exploring random trees. In: Abate A, Bodo S, eds. Vol 10381.
Springer; 2017:83-89. doi:10.1007/978-3-319-63501-9_6'
apa: 'Bak, S., Bogomolov, S., Henzinger, T. A., & Kumar, A. (2017). Challenges
and tool implementation of hybrid rapidly exploring random trees. In A. Abate
& S. Bodo (Eds.) (Vol. 10381, pp. 83–89). Presented at the NSV: Numerical
Software Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63501-9_6'
chicago: Bak, Stanley, Sergiy Bogomolov, Thomas A Henzinger, and Aviral Kumar. “Challenges
and Tool Implementation of Hybrid Rapidly Exploring Random Trees.” edited by Alessandro
Abate and Sylvie Bodo, 10381:83–89. Springer, 2017. https://doi.org/10.1007/978-3-319-63501-9_6.
ieee: 'S. Bak, S. Bogomolov, T. A. Henzinger, and A. Kumar, “Challenges and tool
implementation of hybrid rapidly exploring random trees,” presented at the NSV:
Numerical Software Verification, Heidelberg, Germany, 2017, vol. 10381, pp. 83–89.'
ista: 'Bak S, Bogomolov S, Henzinger TA, Kumar A. 2017. Challenges and tool implementation
of hybrid rapidly exploring random trees. NSV: Numerical Software Verification,
LNCS, vol. 10381, 83–89.'
mla: Bak, Stanley, et al. Challenges and Tool Implementation of Hybrid Rapidly
Exploring Random Trees. Edited by Alessandro Abate and Sylvie Bodo, vol. 10381,
Springer, 2017, pp. 83–89, doi:10.1007/978-3-319-63501-9_6.
short: S. Bak, S. Bogomolov, T.A. Henzinger, A. Kumar, in:, A. Abate, S. Bodo (Eds.),
Springer, 2017, pp. 83–89.
conference:
end_date: 2017-07-23
location: Heidelberg, Germany
name: 'NSV: Numerical Software Verification'
start_date: 2017-07-22
date_created: 2018-12-11T11:47:37Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2025-09-11T07:25:57Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/978-3-319-63501-9_6
editor:
- first_name: Alessandro
full_name: Abate, Alessandro
last_name: Abate
- first_name: Sylvie
full_name: Bodo, Sylvie
last_name: Bodo
external_id:
isi:
- '000440724800006'
fulldoi: https://doi.org/10.1007/978-3-319-63501-9_6
intvolume: ' 10381'
isi: 1
language:
- iso: eng
month: '01'
oa_version: None
page: 83 - 89
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication_identifier:
isbn:
- 978-331963500-2
publication_status: published
publisher: Springer
publist_id: '7159'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Challenges and tool implementation of hybrid rapidly exploring random trees
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 10381
year: '2017'
...
---
_id: '634'
abstract:
- lang: eng
text: As autism spectrum disorder (ASD) is largely regarded as a neurodevelopmental
condition, long-time consensus was that its hallmark features are irreversible.
However, several studies from recent years using defined mouse models of ASD have
provided clear evidence that in mice neurobiological and behavioural alterations
can be ameliorated or even reversed by genetic restoration or pharmacological
treatment either before or after symptom onset. Here, we review findings on genetic
and pharmacological reversibility of phenotypes in mouse models of ASD. Our review
should give a comprehensive overview on both aspects and encourage future studies
to better understand the underlying molecular mechanisms that might be translatable
from animals to humans.
alternative_title:
- ADVSANAT
article_processing_charge: No
author:
- first_name: Jan
full_name: Schroeder, Jan
last_name: Schroeder
- first_name: Elena
full_name: Deliu, Elena
id: 37A40D7E-F248-11E8-B48F-1D18A9856A87
last_name: Deliu
orcid: 0000-0002-7370-5293
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
- first_name: Michael
full_name: Schmeisser, Michael
last_name: Schmeisser
citation:
ama: 'Schroeder J, Deliu E, Novarino G, Schmeisser M. Genetic and pharmacological
reversibility of phenotypes in mouse models of autism spectrum disorder. In: Schmeisser
M, Boekers T, eds. Translational Anatomy and Cell Biology of Autism Spectrum
Disorder. Vol 224. Advances in Anatomy Embryology and Cell Biology. Springer;
2017:189-211. doi:10.1007/978-3-319-52498-6_10'
apa: Schroeder, J., Deliu, E., Novarino, G., & Schmeisser, M. (2017). Genetic
and pharmacological reversibility of phenotypes in mouse models of autism spectrum
disorder. In M. Schmeisser & T. Boekers (Eds.), Translational Anatomy and
Cell Biology of Autism Spectrum Disorder (Vol. 224, pp. 189–211). Springer.
https://doi.org/10.1007/978-3-319-52498-6_10
chicago: Schroeder, Jan, Elena Deliu, Gaia Novarino, and Michael Schmeisser. “Genetic
and Pharmacological Reversibility of Phenotypes in Mouse Models of Autism Spectrum
Disorder.” In Translational Anatomy and Cell Biology of Autism Spectrum Disorder,
edited by Michael Schmeisser and Tobias Boekers, 224:189–211. Advances in Anatomy
Embryology and Cell Biology. Springer, 2017. https://doi.org/10.1007/978-3-319-52498-6_10.
ieee: J. Schroeder, E. Deliu, G. Novarino, and M. Schmeisser, “Genetic and pharmacological
reversibility of phenotypes in mouse models of autism spectrum disorder,” in Translational
Anatomy and Cell Biology of Autism Spectrum Disorder, vol. 224, M. Schmeisser
and T. Boekers, Eds. Springer, 2017, pp. 189–211.
ista: 'Schroeder J, Deliu E, Novarino G, Schmeisser M. 2017.Genetic and pharmacological
reversibility of phenotypes in mouse models of autism spectrum disorder. In: Translational
Anatomy and Cell Biology of Autism Spectrum Disorder. ADVSANAT, vol. 224, 189–211.'
mla: Schroeder, Jan, et al. “Genetic and Pharmacological Reversibility of Phenotypes
in Mouse Models of Autism Spectrum Disorder.” Translational Anatomy and Cell
Biology of Autism Spectrum Disorder, edited by Michael Schmeisser and Tobias
Boekers, vol. 224, Springer, 2017, pp. 189–211, doi:10.1007/978-3-319-52498-6_10.
short: J. Schroeder, E. Deliu, G. Novarino, M. Schmeisser, in:, M. Schmeisser, T.
Boekers (Eds.), Translational Anatomy and Cell Biology of Autism Spectrum Disorder,
Springer, 2017, pp. 189–211.
corr_author: '1'
date_created: 2018-12-11T11:47:37Z
date_published: 2017-05-28T00:00:00Z
date_updated: 2025-09-11T07:25:25Z
day: '28'
department:
- _id: GaNo
doi: 10.1007/978-3-319-52498-6_10
editor:
- first_name: Michael
full_name: Schmeisser, Michael
last_name: Schmeisser
- first_name: Tobias
full_name: Boekers, Tobias
last_name: Boekers
external_id:
isi:
- '000443802500011'
fulldoi: https://doi.org/10.1007/978-3-319-52498-6_10
intvolume: ' 224'
isi: 1
language:
- iso: eng
month: '05'
oa_version: None
page: 189 - 211
project:
- _id: 25473368-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: F03523
name: Transmembrane Transporters in Health and Disease
publication: Translational Anatomy and Cell Biology of Autism Spectrum Disorder
publication_identifier:
eisbn:
- 978-3-319-52498-6
publication_status: published
publisher: Springer
publist_id: '7156'
quality_controlled: '1'
scopus_import: '1'
series_title: Advances in Anatomy Embryology and Cell Biology
status: public
title: Genetic and pharmacological reversibility of phenotypes in mouse models of
autism spectrum disorder
type: book_chapter
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 224
year: '2017'
...
---
_id: '635'
abstract:
- lang: eng
text: Memory-hard functions (MHFs) are hash algorithms whose evaluation cost is
dominated by memory cost. As memory, unlike computation, costs about the same
across different platforms, MHFs cannot be evaluated at significantly lower cost
on dedicated hardware like ASICs. MHFs have found widespread applications including
password hashing, key derivation, and proofs-of-work. This paper focuses on scrypt,
a simple candidate MHF designed by Percival, and described in RFC 7914. It has
been used within a number of cryptocurrencies (e.g., Litecoin and Dogecoin) and
has been an inspiration for Argon2d, one of the winners of the recent password-hashing
competition. Despite its popularity, no rigorous lower bounds on its memory complexity
are known. We prove that scrypt is optimally memory-hard, i.e., its cumulative
memory complexity (cmc) in the parallel random oracle model is Ω(n2w), where w
and n are the output length and number of invocations of the underlying hash function,
respectively. High cmc is a strong security target for MHFs introduced by Alwen
and Serbinenko (STOC’15) which implies high memory cost even for adversaries who
can amortize the cost over many evaluations and evaluate the underlying hash functions
many times in parallel. Our proof is the first showing optimal memory-hardness
for any MHF. Our result improves both quantitatively and qualitatively upon the
recent work by Alwen et al. (EUROCRYPT’16) who proved a weaker lower bound of
Ω(n2w/ log2 n) for a restricted class of adversaries.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Binchi
full_name: Chen, Binchi
last_name: Chen
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Leonid
full_name: Reyzin, Leonid
last_name: Reyzin
- first_name: Stefano
full_name: Tessaro, Stefano
last_name: Tessaro
citation:
ama: 'Alwen JF, Chen B, Pietrzak KZ, Reyzin L, Tessaro S. Scrypt is maximally memory
hard. In: Coron J-S, Buus Nielsen J, eds. Vol 10212. Springer; 2017:33-62. doi:10.1007/978-3-319-56617-7_2'
apa: 'Alwen, J. F., Chen, B., Pietrzak, K. Z., Reyzin, L., & Tessaro, S. (2017).
Scrypt is maximally memory hard. In J.-S. Coron & J. Buus Nielsen (Eds.) (Vol.
10212, pp. 33–62). Presented at the EUROCRYPT: Theory and Applications of Cryptographic
Techniques, Paris, France: Springer. https://doi.org/10.1007/978-3-319-56617-7_2'
chicago: Alwen, Joel F, Binchi Chen, Krzysztof Z Pietrzak, Leonid Reyzin, and Stefano
Tessaro. “Scrypt Is Maximally Memory Hard.” edited by Jean-Sébastien Coron and
Jesper Buus Nielsen, 10212:33–62. Springer, 2017. https://doi.org/10.1007/978-3-319-56617-7_2.
ieee: 'J. F. Alwen, B. Chen, K. Z. Pietrzak, L. Reyzin, and S. Tessaro, “Scrypt
is maximally memory hard,” presented at the EUROCRYPT: Theory and Applications
of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 33–62.'
ista: 'Alwen JF, Chen B, Pietrzak KZ, Reyzin L, Tessaro S. 2017. Scrypt is maximally
memory hard. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS,
vol. 10212, 33–62.'
mla: Alwen, Joel F., et al. Scrypt Is Maximally Memory Hard. Edited by Jean-Sébastien
Coron and Jesper Buus Nielsen, vol. 10212, Springer, 2017, pp. 33–62, doi:10.1007/978-3-319-56617-7_2.
short: J.F. Alwen, B. Chen, K.Z. Pietrzak, L. Reyzin, S. Tessaro, in:, J.-S. Coron,
J. Buus Nielsen (Eds.), Springer, 2017, pp. 33–62.
conference:
end_date: 2017-05-04
location: Paris, France
name: 'EUROCRYPT: Theory and Applications of Cryptographic Techniques'
start_date: 2017-04-30
date_created: 2018-12-11T11:47:37Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2025-09-11T07:24:51Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-319-56617-7_2
ec_funded: 1
editor:
- first_name: Jean-Sébastien
full_name: Coron, Jean-Sébastien
last_name: Coron
- first_name: Jesper
full_name: Buus Nielsen, Jesper
last_name: Buus Nielsen
external_id:
isi:
- '000419175900002'
fulldoi: https://doi.org/10.1007/978-3-319-56617-7_2
intvolume: ' 10212'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2016/989
month: '01'
oa: 1
oa_version: Submitted Version
page: 33 - 62
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_identifier:
isbn:
- 978-331956616-0
publication_status: published
publisher: Springer
publist_id: '7154'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Scrypt is maximally memory hard
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 10212
year: '2017'
...
---
_id: '636'
abstract:
- lang: eng
text: Signal regular expressions can specify sequential properties of real-valued
signals based on threshold conditions, regular operations, and duration constraints.
In this paper we endow them with a quantitative semantics which indicates how
robustly a signal matches or does not match a given expression. First, we show
that this semantics is a safe approximation of a distance between the signal and
the language defined by the expression. Then, we consider the robust matching
problem, that is, computing the quantitative semantics of every segment of a given
signal relative to an expression. We present an algorithm that solves this problem
for piecewise-constant and piecewise-linear signals and show that for such signals
the robustness map is a piecewise-linear function. The availability of an indicator
describing how robustly a signal segment matches some regular pattern provides
a general framework for quantitative monitoring of cyber-physical systems.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Alexey
full_name: Bakhirkin, Alexey
last_name: Bakhirkin
- first_name: Thomas
full_name: Ferrere, Thomas
id: 40960E6E-F248-11E8-B48F-1D18A9856A87
last_name: Ferrere
orcid: 0000-0001-5199-3143
- first_name: Oded
full_name: Maler, Oded
last_name: Maler
- first_name: Dogan
full_name: Ulus, Dogan
last_name: Ulus
citation:
ama: 'Bakhirkin A, Ferrere T, Maler O, Ulus D. On the quantitative semantics of
regular expressions over real-valued signals. In: Abate A, Geeraerts G, eds. Vol
10419. Springer; 2017:189-206. doi:10.1007/978-3-319-65765-3_11'
apa: 'Bakhirkin, A., Ferrere, T., Maler, O., & Ulus, D. (2017). On the quantitative
semantics of regular expressions over real-valued signals. In A. Abate & G.
Geeraerts (Eds.) (Vol. 10419, pp. 189–206). Presented at the FORMATS: Formal Modelling
and Analysis of Timed Systems, Berlin, Germany: Springer. https://doi.org/10.1007/978-3-319-65765-3_11'
chicago: Bakhirkin, Alexey, Thomas Ferrere, Oded Maler, and Dogan Ulus. “On the
Quantitative Semantics of Regular Expressions over Real-Valued Signals.” edited
by Alessandro Abate and Gilles Geeraerts, 10419:189–206. Springer, 2017. https://doi.org/10.1007/978-3-319-65765-3_11.
ieee: 'A. Bakhirkin, T. Ferrere, O. Maler, and D. Ulus, “On the quantitative semantics
of regular expressions over real-valued signals,” presented at the FORMATS: Formal
Modelling and Analysis of Timed Systems, Berlin, Germany, 2017, vol. 10419, pp.
189–206.'
ista: 'Bakhirkin A, Ferrere T, Maler O, Ulus D. 2017. On the quantitative semantics
of regular expressions over real-valued signals. FORMATS: Formal Modelling and
Analysis of Timed Systems, LNCS, vol. 10419, 189–206.'
mla: Bakhirkin, Alexey, et al. On the Quantitative Semantics of Regular Expressions
over Real-Valued Signals. Edited by Alessandro Abate and Gilles Geeraerts,
vol. 10419, Springer, 2017, pp. 189–206, doi:10.1007/978-3-319-65765-3_11.
short: A. Bakhirkin, T. Ferrere, O. Maler, D. Ulus, in:, A. Abate, G. Geeraerts
(Eds.), Springer, 2017, pp. 189–206.
conference:
end_date: 2017-09-07
location: Berlin, Germany
name: 'FORMATS: Formal Modelling and Analysis of Timed Systems'
start_date: 2017-09-05
date_created: 2018-12-11T11:47:38Z
date_published: 2017-08-03T00:00:00Z
date_updated: 2025-09-11T07:24:11Z
day: '03'
department:
- _id: ToHe
doi: 10.1007/978-3-319-65765-3_11
editor:
- first_name: Alessandro
full_name: Abate, Alessandro
last_name: Abate
- first_name: Gilles
full_name: Geeraerts, Gilles
last_name: Geeraerts
external_id:
isi:
- '000611678300011'
fulldoi: https://doi.org/10.1007/978-3-319-65765-3_11
intvolume: ' 10419'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal.archives-ouvertes.fr/hal-01552132
month: '08'
oa: 1
oa_version: Submitted Version
page: 189 - 206
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication_identifier:
isbn:
- 978-331965764-6
publication_status: published
publisher: Springer
publist_id: '7152'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the quantitative semantics of regular expressions over real-valued signals
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 10419
year: '2017'
...
---
_id: '637'
abstract:
- lang: eng
text: For many cryptographic primitives, it is relatively easy to achieve selective
security (where the adversary commits a-priori to some of the choices to be made
later in the attack) but appears difficult to achieve the more natural notion
of adaptive security (where the adversary can make all choices on the go as the
attack progresses). A series of several recent works shows how to cleverly achieve
adaptive security in several such scenarios including generalized selective decryption
(Panjwani, TCC ’07 and Fuchsbauer et al., CRYPTO ’15), constrained PRFs (Fuchsbauer
et al., ASIACRYPT ’14), and Yao garbled circuits (Jafargholi and Wichs, TCC ’16b).
Although the above works expressed vague intuition that they share a common technique,
the connection was never made precise. In this work we present a new framework
that connects all of these works and allows us to present them in a unified and
simplified fashion. Moreover, we use the framework to derive a new result for
adaptively secure secret sharing over access structures defined via monotone circuits.
We envision that further applications will follow in the future. Underlying our
framework is the following simple idea. It is well known that selective security,
where the adversary commits to n-bits of information about his future choices,
automatically implies adaptive security at the cost of amplifying the adversary’s
advantage by a factor of up to 2n. However, in some cases the proof of selective
security proceeds via a sequence of hybrids, where each pair of adjacent hybrids
locally only requires some smaller partial information consisting of m ≪ n bits.
The partial information needed might be completely different between different
pairs of hybrids, and if we look across all the hybrids we might rely on the entire
n-bit commitment. Nevertheless, the above is sufficient to prove adaptive security,
at the cost of amplifying the adversary’s advantage by a factor of only 2m ≪ 2n.
In all of our examples using the above framework, the different hybrids are captured
by some sort of a graph pebbling game and the amount of information that the adversary
needs to commit to in each pair of hybrids is bounded by the maximum number of
pebbles in play at any point in time. Therefore, coming up with better strategies
for proving adaptive security translates to various pebbling strategies for different
types of graphs.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Zahra
full_name: Jafargholi, Zahra
last_name: Jafargholi
- first_name: Chethan
full_name: Kamath Hosdurg, Chethan
id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87
last_name: Kamath Hosdurg
orcid: 0009-0006-6812-7317
- first_name: Karen
full_name: Klein, Karen
id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87
last_name: Klein
- first_name: Ilan
full_name: Komargodski, Ilan
last_name: Komargodski
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Daniel
full_name: Wichs, Daniel
last_name: Wichs
citation:
ama: 'Jafargholi Z, Kamath Hosdurg C, Klein K, Komargodski I, Pietrzak KZ, Wichs
D. Be adaptive avoid overcommitting. In: Katz J, Shacham H, eds. Vol 10401. Springer;
2017:133-163. doi:10.1007/978-3-319-63688-7_5'
apa: 'Jafargholi, Z., Kamath Hosdurg, C., Klein, K., Komargodski, I., Pietrzak,
K. Z., & Wichs, D. (2017). Be adaptive avoid overcommitting. In J. Katz &
H. Shacham (Eds.) (Vol. 10401, pp. 133–163). Presented at the CRYPTO: Cryptology,
Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-319-63688-7_5'
chicago: Jafargholi, Zahra, Chethan Kamath Hosdurg, Karen Klein, Ilan Komargodski,
Krzysztof Z Pietrzak, and Daniel Wichs. “Be Adaptive Avoid Overcommitting.” edited
by Jonathan Katz and Hovav Shacham, 10401:133–63. Springer, 2017. https://doi.org/10.1007/978-3-319-63688-7_5.
ieee: 'Z. Jafargholi, C. Kamath Hosdurg, K. Klein, I. Komargodski, K. Z. Pietrzak,
and D. Wichs, “Be adaptive avoid overcommitting,” presented at the CRYPTO: Cryptology,
Santa Barbara, CA, United States, 2017, vol. 10401, pp. 133–163.'
ista: 'Jafargholi Z, Kamath Hosdurg C, Klein K, Komargodski I, Pietrzak KZ, Wichs
D. 2017. Be adaptive avoid overcommitting. CRYPTO: Cryptology, LNCS, vol. 10401,
133–163.'
mla: Jafargholi, Zahra, et al. Be Adaptive Avoid Overcommitting. Edited by
Jonathan Katz and Hovav Shacham, vol. 10401, Springer, 2017, pp. 133–63, doi:10.1007/978-3-319-63688-7_5.
short: Z. Jafargholi, C. Kamath Hosdurg, K. Klein, I. Komargodski, K.Z. Pietrzak,
D. Wichs, in:, J. Katz, H. Shacham (Eds.), Springer, 2017, pp. 133–163.
conference:
end_date: 2017-07-24
location: Santa Barbara, CA, United States
name: 'CRYPTO: Cryptology'
start_date: 2017-07-20
date_created: 2018-12-11T11:47:38Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2026-04-08T07:01:44Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-319-63688-7_5
ec_funded: 1
editor:
- first_name: Jonathan
full_name: Katz, Jonathan
last_name: Katz
- first_name: Hovav
full_name: Shacham, Hovav
last_name: Shacham
external_id:
isi:
- '000438672600005'
fulldoi: https://doi.org/10.1007/978-3-319-63688-7_5
intvolume: ' 10401'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2017/515
month: '01'
oa: 1
oa_version: Submitted Version
page: 133 - 163
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_identifier:
isbn:
- 978-331963687-0
publication_status: published
publisher: Springer
publist_id: '7151'
quality_controlled: '1'
related_material:
record:
- id: '10035'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Be adaptive avoid overcommitting
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 10401
year: '2017'
...
---
_id: '638'
abstract:
- lang: eng
text: "This book constitutes the refereed proceedings of the 9th InternationalWorkshop
on Numerical Software Verification, NSV 2016, held in Toronto, ON, Canada in July
2011 - colocated with CAV 2016, the 28th International Conference on Computer
Aided Verification.\r\nThe NSV workshop is dedicated to the development of logical
and mathematical techniques for the reasoning about programmability and reliability."
alternative_title:
- LNCS
article_processing_charge: No
citation:
ama: Bogomolov S, Martel M, Prabhakar P, eds. Numerical Software Verification.
Vol 10152. Springer; 2017. doi:10.1007/978-3-319-54292-8
apa: 'Bogomolov, S., Martel, M., & Prabhakar, P. (Eds.). (2017). Numerical
Software Verification (Vol. 10152). Presented at the NSV: Numerical Software
Verification, Toronto, ON, Canada: Springer. https://doi.org/10.1007/978-3-319-54292-8'
chicago: Bogomolov, Sergiy, Matthieu Martel, and Pavithra Prabhakar, eds. Numerical
Software Verification. Vol. 10152. Springer, 2017. https://doi.org/10.1007/978-3-319-54292-8.
ieee: S. Bogomolov, M. Martel, and P. Prabhakar, Eds., Numerical Software Verification,
vol. 10152. Springer, 2017.
ista: Bogomolov S, Martel M, Prabhakar P eds. 2017. Numerical Software Verification,
Springer,p.
mla: Bogomolov, Sergiy, et al., editors. Numerical Software Verification.
Vol. 10152, Springer, 2017, doi:10.1007/978-3-319-54292-8.
short: S. Bogomolov, M. Martel, P. Prabhakar, eds., Numerical Software Verification,
Springer, 2017.
conference:
end_date: 2016-07-18
location: Toronto, ON, Canada
name: 'NSV: Numerical Software Verification'
start_date: 2016-07-17
date_created: 2018-12-11T11:47:38Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2026-03-31T12:28:01Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/978-3-319-54292-8
editor:
- first_name: Sergiy
full_name: Bogomolov, Sergiy
id: 369D9A44-F248-11E8-B48F-1D18A9856A87
last_name: Bogomolov
orcid: 0000-0002-0686-0365
- first_name: Matthieu
full_name: Martel, Matthieu
last_name: Martel
- first_name: Pavithra
full_name: Prabhakar, Pavithra
last_name: Prabhakar
fulldoi: https://doi.org/10.1007/978-3-319-54292-8
intvolume: ' 10152'
language:
- iso: eng
month: '01'
oa_version: None
publication_identifier:
eisbn:
- 978-3-319-54292-8
issn:
- 0302-9743
publication_status: published
publisher: Springer
publist_id: '7150'
quality_controlled: '1'
status: public
title: Numerical Software Verification
type: conference_editor
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10152
year: '2017'
...
---
_id: '640'
abstract:
- lang: eng
text: 'Data-independent Memory Hard Functions (iMHFS) are finding a growing number
of applications in security; especially in the domain of password hashing. An
important property of a concrete iMHF is specified by fixing a directed acyclic
graph (DAG) Gn on n nodes. The quality of that iMHF is then captured by the following
two pebbling complexities of Gn: – The parallel cumulative pebbling complexity
Π∥cc(Gn) must be as high as possible (to ensure that the amortized cost of computing
the function on dedicated hardware is dominated by the cost of memory). – The
sequential space-time pebbling complexity Πst(Gn) should be as close as possible
to Π∥cc(Gn) (to ensure that using many cores in parallel and amortizing over many
instances does not give much of an advantage). In this paper we construct a family
of DAGs with best possible parameters in an asymptotic sense, i.e., where Π∥cc(Gn)
= Ω(n2/ log(n)) (which matches a known upper bound) and Πst(Gn) is within a constant
factor of Π∥cc(Gn). Our analysis relies on a new connection between the pebbling
complexity of a DAG and its depth-robustness (DR) – a well studied combinatorial
property. We show that high DR is sufficient for high Π∥cc. Alwen and Blocki (CRYPTO’16)
showed that high DR is necessary and so, together, these results fully characterize
DAGs with high Π∥cc in terms of DR. Complementing these results, we provide new
upper and lower bounds on the Π∥cc of several important candidate iMHFs from the
literature. We give the first lower bounds on the memory hardness of the Catena
and Balloon Hashing functions in a parallel model of computation and we give the
first lower bounds of any kind for (a version) of Argon2i. Finally we describe
a new class of pebbling attacks improving on those of Alwen and Blocki (CRYPTO’16).
By instantiating these attacks we upperbound the Π∥cc of the Password Hashing
Competition winner Argon2i and one of the Balloon Hashing functions by O (n1.71).
We also show an upper bound of O(n1.625) for the Catena functions and the two
remaining Balloon Hashing functions.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Jeremiah
full_name: Blocki, Jeremiah
last_name: Blocki
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Alwen JF, Blocki J, Pietrzak KZ. Depth-robust graphs and their cumulative
memory complexity. In: Coron J-S, Buus Nielsen J, eds. Vol 10212. Springer; 2017:3-32.
doi:10.1007/978-3-319-56617-7_1'
apa: 'Alwen, J. F., Blocki, J., & Pietrzak, K. Z. (2017). Depth-robust graphs
and their cumulative memory complexity. In J.-S. Coron & J. Buus Nielsen (Eds.)
(Vol. 10212, pp. 3–32). Presented at the EUROCRYPT: Theory and Applications of
Cryptographic Techniques, Paris, France: Springer. https://doi.org/10.1007/978-3-319-56617-7_1'
chicago: Alwen, Joel F, Jeremiah Blocki, and Krzysztof Z Pietrzak. “Depth-Robust
Graphs and Their Cumulative Memory Complexity.” edited by Jean-Sébastien Coron
and Jesper Buus Nielsen, 10212:3–32. Springer, 2017. https://doi.org/10.1007/978-3-319-56617-7_1.
ieee: 'J. F. Alwen, J. Blocki, and K. Z. Pietrzak, “Depth-robust graphs and their
cumulative memory complexity,” presented at the EUROCRYPT: Theory and Applications
of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 3–32.'
ista: 'Alwen JF, Blocki J, Pietrzak KZ. 2017. Depth-robust graphs and their cumulative
memory complexity. EUROCRYPT: Theory and Applications of Cryptographic Techniques,
LNCS, vol. 10212, 3–32.'
mla: Alwen, Joel F., et al. Depth-Robust Graphs and Their Cumulative Memory Complexity.
Edited by Jean-Sébastien Coron and Jesper Buus Nielsen, vol. 10212, Springer,
2017, pp. 3–32, doi:10.1007/978-3-319-56617-7_1.
short: J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, J.-S. Coron, J. Buus Nielsen (Eds.),
Springer, 2017, pp. 3–32.
conference:
end_date: 2017-05-04
location: Paris, France
name: 'EUROCRYPT: Theory and Applications of Cryptographic Techniques'
start_date: 2017-04-30
corr_author: '1'
date_created: 2018-12-11T11:47:39Z
date_published: 2017-04-01T00:00:00Z
date_updated: 2025-09-11T07:21:36Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-319-56617-7_1
ec_funded: 1
editor:
- first_name: Jean-Sébastien
full_name: Coron, Jean-Sébastien
last_name: Coron
- first_name: Jesper
full_name: Buus Nielsen, Jesper
last_name: Buus Nielsen
external_id:
isi:
- '000419175900001'
fulldoi: https://doi.org/10.1007/978-3-319-56617-7_1
intvolume: ' 10212'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2016/875
month: '04'
oa: 1
oa_version: Submitted Version
page: 3 - 32
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_identifier:
isbn:
- 978-331956616-0
publication_status: published
publisher: Springer
publist_id: '7148'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Depth-robust graphs and their cumulative memory complexity
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 10212
year: '2017'
...
---
_id: '641'
abstract:
- lang: eng
text: 'We introduce two novel methods for learning parameters of graphical models
for image labelling. The following two tasks underline both methods: (i) perturb
model parameters based on given features and ground truth labelings, so as to
exactly reproduce these labelings as optima of the local polytope relaxation of
the labelling problem; (ii) train a predictor for the perturbed model parameters
so that improved model parameters can be applied to the labelling of novel data.
Our first method implements task (i) by inverse linear programming and task (ii)
using a regressor e.g. a Gaussian process. Our second approach simultaneously
solves tasks (i) and (ii) in a joint manner, while being restricted to linearly
parameterised predictors. Experiments demonstrate the merits of both approaches.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Vera
full_name: Trajkovska, Vera
last_name: Trajkovska
- first_name: Paul
full_name: Swoboda, Paul
id: 446560C6-F248-11E8-B48F-1D18A9856A87
last_name: Swoboda
- first_name: Freddie
full_name: Åström, Freddie
last_name: Åström
- first_name: Stefanie
full_name: Petra, Stefanie
last_name: Petra
citation:
ama: 'Trajkovska V, Swoboda P, Åström F, Petra S. Graphical model parameter learning
by inverse linear programming. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol
10302. Springer; 2017:323-334. doi:10.1007/978-3-319-58771-4_26'
apa: 'Trajkovska, V., Swoboda, P., Åström, F., & Petra, S. (2017). Graphical
model parameter learning by inverse linear programming. In F. Lauze, Y. Dong,
& A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 323–334). Presented at the SSVM:
Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer.
https://doi.org/10.1007/978-3-319-58771-4_26'
chicago: Trajkovska, Vera, Paul Swoboda, Freddie Åström, and Stefanie Petra. “Graphical
Model Parameter Learning by Inverse Linear Programming.” edited by François Lauze,
Yiqiu Dong, and Anders Bjorholm Dahl, 10302:323–34. Springer, 2017. https://doi.org/10.1007/978-3-319-58771-4_26.
ieee: 'V. Trajkovska, P. Swoboda, F. Åström, and S. Petra, “Graphical model parameter
learning by inverse linear programming,” presented at the SSVM: Scale Space and
Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp.
323–334.'
ista: 'Trajkovska V, Swoboda P, Åström F, Petra S. 2017. Graphical model parameter
learning by inverse linear programming. SSVM: Scale Space and Variational Methods
in Computer Vision, LNCS, vol. 10302, 323–334.'
mla: Trajkovska, Vera, et al. Graphical Model Parameter Learning by Inverse Linear
Programming. Edited by François Lauze et al., vol. 10302, Springer, 2017,
pp. 323–34, doi:10.1007/978-3-319-58771-4_26.
short: V. Trajkovska, P. Swoboda, F. Åström, S. Petra, in:, F. Lauze, Y. Dong, A.
Bjorholm Dahl (Eds.), Springer, 2017, pp. 323–334.
conference:
end_date: 2017-06-08
location: Kolding, Denmark
name: 'SSVM: Scale Space and Variational Methods in Computer Vision'
start_date: 2017-06-04
date_created: 2018-12-11T11:47:39Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2025-09-11T07:20:56Z
day: '01'
department:
- _id: VlKo
doi: 10.1007/978-3-319-58771-4_26
editor:
- first_name: François
full_name: Lauze, François
last_name: Lauze
- first_name: Yiqiu
full_name: Dong, Yiqiu
last_name: Dong
- first_name: Anders
full_name: Bjorholm Dahl, Anders
last_name: Bjorholm Dahl
external_id:
isi:
- '000432210900026'
fulldoi: https://doi.org/10.1007/978-3-319-58771-4_26
intvolume: ' 10302'
isi: 1
language:
- iso: eng
month: '01'
oa_version: None
page: 323 - 334
publication_identifier:
isbn:
- 978-331958770-7
publication_status: published
publisher: Springer
publist_id: '7147'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Graphical model parameter learning by inverse linear programming
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 10302
year: '2017'
...
---
OA_place: repository
OA_type: green
_id: '19810'
abstract:
- lang: eng
text: Engineering and enhancing the breaking of inversion symmetry in solids—that
is, allowing electrons to differentiate between ‘up’ and ‘down’—is a key goal
in condensed-matter physics and materials science because it can be used to stabilize
states that are of fundamental interest and also have potential practical applications.
Examples include improved ferroelectrics for memory devices and materials that
host Majorana zero modes for quantum computing1,2. Although inversion symmetry
is naturally broken in several crystalline environments, such as at surfaces and
interfaces, maximizing the influence of this effect on the electronic states of
interest remains a challenge. Here we present a mechanism for realizing a much
larger coupling of inversion-symmetry breaking to itinerant surface electrons
than is typically achieved. The key element is a pronounced asymmetry of surface
hopping energies—that is, a kinetic-energy-coupled inversion-symmetry breaking,
the energy scale of which is a substantial fraction of the bandwidth. Using spin-
and angle-resolved photoemission spectroscopy, we demonstrate that such a strong
inversion-symmetry breaking, when combined with spin–orbit interactions, can mediate
Rashba-like3,4 spin splittings that are much larger than would typically be expected.
The energy scale of the inversion-symmetry breaking that we achieve is so large
that the spin splitting in the CoO2- and RhO2-derived surface states of delafossite
oxides becomes controlled by the full atomic spin–orbit coupling of the 3d and
4d transition metals, resulting in some of the largest known Rashba-like3,4 spin
splittings. The core structural building blocks that facilitate the bandwidth-scaled
inversion-symmetry breaking are common to numerous materials. Our findings therefore
provide opportunities for creating spin-textured states and suggest routes to
interfacial control of inversion-symmetry breaking in designer heterostructures
of oxides and other material classes.
article_processing_charge: No
article_type: letter_note
arxiv: 1
author:
- first_name: Veronika
full_name: Sunko, Veronika
id: 23cb1cf6-2c7a-11ef-91a4-f72fc19f20b3
last_name: Sunko
orcid: 0000-0003-2724-3523
- first_name: H.
full_name: Rosner, H.
last_name: Rosner
- first_name: P.
full_name: Kushwaha, P.
last_name: Kushwaha
- first_name: S.
full_name: Khim, S.
last_name: Khim
- first_name: F.
full_name: Mazzola, F.
last_name: Mazzola
- first_name: L.
full_name: Bawden, L.
last_name: Bawden
- first_name: O. J.
full_name: Clark, O. J.
last_name: Clark
- first_name: J. M.
full_name: Riley, J. M.
last_name: Riley
- first_name: D.
full_name: Kasinathan, D.
last_name: Kasinathan
- first_name: M. W.
full_name: Haverkort, M. W.
last_name: Haverkort
- first_name: T. K.
full_name: Kim, T. K.
last_name: Kim
- first_name: M.
full_name: Hoesch, M.
last_name: Hoesch
- first_name: J.
full_name: Fujii, J.
last_name: Fujii
- first_name: I.
full_name: Vobornik, I.
last_name: Vobornik
- first_name: A. P.
full_name: Mackenzie, A. P.
last_name: Mackenzie
- first_name: P. D. C.
full_name: King, P. D. C.
last_name: King
citation:
ama: Sunko V, Rosner H, Kushwaha P, et al. Maximal Rashba-like spin splitting via
kinetic-energy-coupled inversion-symmetry breaking. Nature. 2017;549(7673):492-496.
doi:10.1038/nature23898
apa: Sunko, V., Rosner, H., Kushwaha, P., Khim, S., Mazzola, F., Bawden, L., … King,
P. D. C. (2017). Maximal Rashba-like spin splitting via kinetic-energy-coupled
inversion-symmetry breaking. Nature. Springer Nature. https://doi.org/10.1038/nature23898
chicago: Sunko, Veronika, H. Rosner, P. Kushwaha, S. Khim, F. Mazzola, L. Bawden,
O. J. Clark, et al. “Maximal Rashba-like Spin Splitting via Kinetic-Energy-Coupled
Inversion-Symmetry Breaking.” Nature. Springer Nature, 2017. https://doi.org/10.1038/nature23898.
ieee: V. Sunko et al., “Maximal Rashba-like spin splitting via kinetic-energy-coupled
inversion-symmetry breaking,” Nature, vol. 549, no. 7673. Springer Nature,
pp. 492–496, 2017.
ista: Sunko V, Rosner H, Kushwaha P, Khim S, Mazzola F, Bawden L, Clark OJ, Riley
JM, Kasinathan D, Haverkort MW, Kim TK, Hoesch M, Fujii J, Vobornik I, Mackenzie
AP, King PDC. 2017. Maximal Rashba-like spin splitting via kinetic-energy-coupled
inversion-symmetry breaking. Nature. 549(7673), 492–496.
mla: Sunko, Veronika, et al. “Maximal Rashba-like Spin Splitting via Kinetic-Energy-Coupled
Inversion-Symmetry Breaking.” Nature, vol. 549, no. 7673, Springer Nature,
2017, pp. 492–96, doi:10.1038/nature23898.
short: V. Sunko, H. Rosner, P. Kushwaha, S. Khim, F. Mazzola, L. Bawden, O.J. Clark,
J.M. Riley, D. Kasinathan, M.W. Haverkort, T.K. Kim, M. Hoesch, J. Fujii, I. Vobornik,
A.P. Mackenzie, P.D.C. King, Nature 549 (2017) 492–496.
date_created: 2025-06-10T09:13:08Z
date_published: 2017-09-28T00:00:00Z
date_updated: 2025-06-10T11:55:09Z
day: '28'
doi: 10.1038/nature23898
extern: '1'
external_id:
arxiv:
- '1708.03887'
pmid:
- '28959958'
fulldoi: https://doi.org/10.1038/nature23898
intvolume: ' 549'
issue: '7673'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1708.03887
month: '09'
oa: 1
oa_version: Preprint
page: 492-496
pmid: 1
publication: Nature
publication_identifier:
eissn:
- 1476-4687
issn:
- 0028-0836
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Maximal Rashba-like spin splitting via kinetic-energy-coupled inversion-symmetry
breaking
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 549
year: '2017'
...
---
OA_place: repository
OA_type: green
_id: '19811'
abstract:
- lang: eng
text: We report on a combined study of the de Haas-van Alphen effect and angle-resolved
photoemission spectroscopy on single crystals of the metallic delafossite rounded
off by ab initio band structure calculations. A high-sensitivity torque magnetometry
setup with superconducting quantum interference device readout and synchrotron-based
photoemission with a light spot size of enabled high-resolution data to be obtained
from samples as small as . The Fermi surface shape is nearly cylindrical with
a rounded hexagonal cross section enclosing a Luttinger volume of 1.00(1) electrons
per formula unit.
article_number: '075163'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: F.
full_name: Arnold, F.
last_name: Arnold
- first_name: M.
full_name: Naumann, M.
last_name: Naumann
- first_name: S.
full_name: Khim, S.
last_name: Khim
- first_name: H.
full_name: Rosner, H.
last_name: Rosner
- first_name: Veronika
full_name: Sunko, Veronika
id: 23cb1cf6-2c7a-11ef-91a4-f72fc19f20b3
last_name: Sunko
orcid: 0000-0003-2724-3523
- first_name: F.
full_name: Mazzola, F.
last_name: Mazzola
- first_name: P. D. C.
full_name: King, P. D. C.
last_name: King
- first_name: A. P.
full_name: Mackenzie, A. P.
last_name: Mackenzie
- first_name: E.
full_name: Hassinger, E.
last_name: Hassinger
citation:
ama: Arnold F, Naumann M, Khim S, et al. Quasi-two-dimensional Fermi surface topography
of the delafossite PdRhO2. Physical Review B. 2017;96(7). doi:10.1103/physrevb.96.075163
apa: Arnold, F., Naumann, M., Khim, S., Rosner, H., Sunko, V., Mazzola, F., … Hassinger,
E. (2017). Quasi-two-dimensional Fermi surface topography of the delafossite PdRhO2.
Physical Review B. American Physical Society. https://doi.org/10.1103/physrevb.96.075163
chicago: Arnold, F., M. Naumann, S. Khim, H. Rosner, Veronika Sunko, F. Mazzola,
P. D. C. King, A. P. Mackenzie, and E. Hassinger. “Quasi-Two-Dimensional Fermi
Surface Topography of the Delafossite PdRhO2.” Physical Review B. American
Physical Society, 2017. https://doi.org/10.1103/physrevb.96.075163.
ieee: F. Arnold et al., “Quasi-two-dimensional Fermi surface topography of
the delafossite PdRhO2,” Physical Review B, vol. 96, no. 7. American Physical
Society, 2017.
ista: Arnold F, Naumann M, Khim S, Rosner H, Sunko V, Mazzola F, King PDC, Mackenzie
AP, Hassinger E. 2017. Quasi-two-dimensional Fermi surface topography of the delafossite
PdRhO2. Physical Review B. 96(7), 075163.
mla: Arnold, F., et al. “Quasi-Two-Dimensional Fermi Surface Topography of the Delafossite
PdRhO2.” Physical Review B, vol. 96, no. 7, 075163, American Physical Society,
2017, doi:10.1103/physrevb.96.075163.
short: F. Arnold, M. Naumann, S. Khim, H. Rosner, V. Sunko, F. Mazzola, P.D.C. King,
A.P. Mackenzie, E. Hassinger, Physical Review B 96 (2017).
date_created: 2025-06-10T09:13:38Z
date_published: 2017-08-31T00:00:00Z
date_updated: 2025-06-10T11:59:05Z
day: '31'
doi: 10.1103/physrevb.96.075163
extern: '1'
external_id:
arxiv:
- '1706.08865'
fulldoi: https://doi.org/10.1103/physrevb.96.075163
intvolume: ' 96'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1706.08865
month: '08'
oa: 1
oa_version: Preprint
publication: Physical Review B
publication_identifier:
eissn:
- 2469-9969
issn:
- 2469-9950
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quasi-two-dimensional Fermi surface topography of the delafossite PdRhO2
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 96
year: '2017'
...
---
OA_place: repository
OA_type: green
_id: '19815'
abstract:
- lang: eng
text: We report growth of single crystals of the nonmagnetic metallic delafossite
PdRhO2, comparing the results from three different methods. Complete crystallographic
data were obtained from single crystal X-ray diffraction, and electronic structure
calculations were made using the refined structural parameters. Focused-ion beam
microstructuring was used to prepare a sample for measurements of the in- and
out-of-plane electrical resistivity, and the large observed anisotropy is qualitatively
consistent with the cylindrical Fermi surface predicted by the calculations.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: P.
full_name: Kushwaha, P.
last_name: Kushwaha
- first_name: H.
full_name: Borrmann, H.
last_name: Borrmann
- first_name: S.
full_name: Khim, S.
last_name: Khim
- first_name: H.
full_name: Rosner, H.
last_name: Rosner
- first_name: P. J. W.
full_name: Moll, P. J. W.
last_name: Moll
- first_name: D. A.
full_name: Sokolov, D. A.
last_name: Sokolov
- first_name: Veronika
full_name: Sunko, Veronika
id: 23cb1cf6-2c7a-11ef-91a4-f72fc19f20b3
last_name: Sunko
orcid: 0000-0003-2724-3523
- first_name: Yu.
full_name: Grin, Yu.
last_name: Grin
- first_name: A. P.
full_name: Mackenzie, A. P.
last_name: Mackenzie
citation:
ama: Kushwaha P, Borrmann H, Khim S, et al. Single crystal growth, structure, and
electronic properties of metallic delafossite PdRhO2. Crystal Growth &
Design. 2017;17(8):4144-4150. doi:10.1021/acs.cgd.7b00418
apa: Kushwaha, P., Borrmann, H., Khim, S., Rosner, H., Moll, P. J. W., Sokolov,
D. A., … Mackenzie, A. P. (2017). Single crystal growth, structure, and electronic
properties of metallic delafossite PdRhO2. Crystal Growth & Design.
American Chemical Society. https://doi.org/10.1021/acs.cgd.7b00418
chicago: Kushwaha, P., H. Borrmann, S. Khim, H. Rosner, P. J. W. Moll, D. A. Sokolov,
Veronika Sunko, Yu. Grin, and A. P. Mackenzie. “Single Crystal Growth, Structure,
and Electronic Properties of Metallic Delafossite PdRhO2.” Crystal Growth &
Design. American Chemical Society, 2017. https://doi.org/10.1021/acs.cgd.7b00418.
ieee: P. Kushwaha et al., “Single crystal growth, structure, and electronic
properties of metallic delafossite PdRhO2,” Crystal Growth & Design,
vol. 17, no. 8. American Chemical Society, pp. 4144–4150, 2017.
ista: Kushwaha P, Borrmann H, Khim S, Rosner H, Moll PJW, Sokolov DA, Sunko V, Grin
Y, Mackenzie AP. 2017. Single crystal growth, structure, and electronic properties
of metallic delafossite PdRhO2. Crystal Growth & Design. 17(8), 4144–4150.
mla: Kushwaha, P., et al. “Single Crystal Growth, Structure, and Electronic Properties
of Metallic Delafossite PdRhO2.” Crystal Growth & Design, vol. 17,
no. 8, American Chemical Society, 2017, pp. 4144–50, doi:10.1021/acs.cgd.7b00418.
short: P. Kushwaha, H. Borrmann, S. Khim, H. Rosner, P.J.W. Moll, D.A. Sokolov,
V. Sunko, Y. Grin, A.P. Mackenzie, Crystal Growth & Design 17 (2017) 4144–4150.
date_created: 2025-06-10T09:16:10Z
date_published: 2017-06-30T00:00:00Z
date_updated: 2025-06-10T12:24:49Z
day: '30'
doi: 10.1021/acs.cgd.7b00418
extern: '1'
external_id:
arxiv:
- '1706.07614'
fulldoi: https://doi.org/10.1021/acs.cgd.7b00418
intvolume: ' 17'
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1706.07614
month: '06'
oa: 1
oa_version: Preprint
page: 4144-4150
publication: Crystal Growth & Design
publication_identifier:
eissn:
- 1528-7505
issn:
- 1528-7483
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Single crystal growth, structure, and electronic properties of metallic delafossite
PdRhO2
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2017'
...
---
_id: '2016'
abstract:
- lang: eng
text: The Ising model is one of the simplest and most famous models of interacting
systems. It was originally proposed to model ferromagnetic interactions in statistical
physics and is now widely used to model spatial processes in many areas such as
ecology, sociology, and genetics, usually without testing its goodness-of-fit.
Here, we propose an exact goodness-of-fit test for the finite-lattice Ising model.
The theory of Markov bases has been developed in algebraic statistics for exact
goodness-of-fit testing using a Monte Carlo approach. However, this beautiful
theory has fallen short of its promise for applications, because finding a Markov
basis is usually computationally intractable. We develop a Monte Carlo method
for exact goodness-of-fit testing for the Ising model which avoids computing a
Markov basis and also leads to a better connectivity of the Markov chain and hence
to a faster convergence. We show how this method can be applied to analyze the
spatial organization of receptors on the cell membrane.
article_processing_charge: No
arxiv: 1
author:
- first_name: Abraham
full_name: Martin Del Campo Sanchez, Abraham
last_name: Martin Del Campo Sanchez
- first_name: Sarah A
full_name: Cepeda Humerez, Sarah A
id: 3DEE19A4-F248-11E8-B48F-1D18A9856A87
last_name: Cepeda Humerez
- first_name: Caroline
full_name: Uhler, Caroline
id: 49ADD78E-F248-11E8-B48F-1D18A9856A87
last_name: Uhler
orcid: 0000-0002-7008-0216
citation:
ama: Martin Del Campo Sanchez A, Cepeda Humerez SA, Uhler C. Exact goodness-of-fit
testing for the Ising model. Scandinavian Journal of Statistics. 2017;44(2):285-306.
doi:10.1111/sjos.12251
apa: Martin Del Campo Sanchez, A., Cepeda Humerez, S. A., & Uhler, C. (2017).
Exact goodness-of-fit testing for the Ising model. Scandinavian Journal of
Statistics. Wiley-Blackwell. https://doi.org/10.1111/sjos.12251
chicago: Martin Del Campo Sanchez, Abraham, Sarah A Cepeda Humerez, and Caroline
Uhler. “Exact Goodness-of-Fit Testing for the Ising Model.” Scandinavian Journal
of Statistics. Wiley-Blackwell, 2017. https://doi.org/10.1111/sjos.12251.
ieee: A. Martin Del Campo Sanchez, S. A. Cepeda Humerez, and C. Uhler, “Exact goodness-of-fit
testing for the Ising model,” Scandinavian Journal of Statistics, vol.
44, no. 2. Wiley-Blackwell, pp. 285–306, 2017.
ista: Martin Del Campo Sanchez A, Cepeda Humerez SA, Uhler C. 2017. Exact goodness-of-fit
testing for the Ising model. Scandinavian Journal of Statistics. 44(2), 285–306.
mla: Martin Del Campo Sanchez, Abraham, et al. “Exact Goodness-of-Fit Testing for
the Ising Model.” Scandinavian Journal of Statistics, vol. 44, no. 2, Wiley-Blackwell,
2017, pp. 285–306, doi:10.1111/sjos.12251.
short: A. Martin Del Campo Sanchez, S.A. Cepeda Humerez, C. Uhler, Scandinavian
Journal of Statistics 44 (2017) 285–306.
date_created: 2018-12-11T11:55:13Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2026-04-08T13:55:45Z
day: '01'
department:
- _id: GaTk
doi: 10.1111/sjos.12251
external_id:
arxiv:
- '1410.1242'
isi:
- '000400985000001'
fulldoi: https://doi.org/10.1111/sjos.12251
intvolume: ' 44'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1410.1242
month: '06'
oa: 1
oa_version: Preprint
page: 285 - 306
publication: Scandinavian Journal of Statistics
publication_identifier:
issn:
- '03036898'
publication_status: published
publisher: Wiley-Blackwell
publist_id: '5060'
quality_controlled: '1'
related_material:
record:
- id: '6473'
relation: part_of_dissertation
status: public
scopus_import: '1'
status: public
title: Exact goodness-of-fit testing for the Ising model
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 44
year: '2017'
...
---
OA_place: publisher
_id: '202'
abstract:
- lang: eng
text: 'Restriction-modification (RM) represents the simplest and possibly the most
widespread mechanism of self/non-self discrimination in nature. In order to provide
bacteria with immunity against bacteriophages and other parasitic genetic elements,
RM systems rely on a balance between two enzymes: the restriction enzyme, which
cleaves non-self DNA at specific restriction sites, and the modification enzyme,
which tags the host’s DNA as self and thus protects it from cleavage. In this
thesis, I use population and single-cell level experiments in combination with
mathematical modeling to study different aspects of the interplay between RM systems,
bacteria and bacteriophages. First, I analyze how mutations in phage restriction
sites affect the probability of phage escape – an inherently stochastic process,
during which phages accidently get modified instead of restricted. Next, I use
single-cell experiments to show that RM systems can, with a low probability, attack
the genome of their bacterial host and that this primitive form of autoimmunity
leads to a tradeoff between the evolutionary cost and benefit of RM systems. Finally,
I investigate the nature of interactions between bacteria, RM systems and temperate
bacteriophages to find that, as a consequence of phage escape and its impact on
population dynamics, RM systems can promote acquisition of symbiotic bacteriophages,
rather than limit it. The results presented here uncover new fundamental biological
properties of RM systems and highlight their importance in the ecology and evolution
of bacteria, bacteriophages and their interactions.'
acknowledgement: "During my PhD studies, I received help from many people, all of
which unfortunately cannot be listed here. I thank them deeply and hope that I never
made them regret their kindness.\r\nI would like to express my deepest gratitude
to Călin Guet, who went far beyond his responsibilities as an advisor and was to
me also a great mentor and a friend. Călin never questioned my potential or lacked
compassion and I cannot thank him enough for cultivating in me an independent scientist.
I was amazed by his ability to recognize the most fascinating scientific problems
in objects of study that others would find mundane. I hope I adopted at least a
fraction of this ability.\r\nI will be forever grateful to Bruce Levin for all his
support and especially for giving me the best possible example of how one can practice
excellent science with humor and style. Working with Bruce was a true privilege.\r\nI
thank Jonathan Bollback and Gašper Tkačik for serving in my PhD committee and the
Austrian Academy of Science for funding my PhD research via the DOC fellowship.\r\nI
thank all our lab members: Tobias Bergmiller for his guidance, especially in the
first years of my research, and for being a good friend throughout; Remy Chait for
staying in the lab at unreasonable hours and for the good laughs at bad jokes we
shared; Anna Staron for supportively listening to my whines whenever I had to run
a gel; Magdalena Steinrück for her pioneering work in the lab; Kathrin Tomasek for
keeping the entropic forces in check and for her FACS virtuosity; Isabella Tomanek
for always being nice to me, no matter how much bench space I took from her.\r\nI
thank all my collaborators: Reiko Okura and Yuichi Wakamoto for performing and analyzing
the microfluidic experiments; Long Qian and Edo Kussell for their bioinformatics
analysis; Dominik Refardt for the λ kan phage; Moritz for his help with the mathematical
modeling. I thank Fabienne Jesse for her tireless editorial work on all our manuscripts.\r\nFinally,
I would like to thank my family and especially my wife Edita, who sacrificed a lot
so that I can pursue my goals and dreams.\r\n"
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Maros
full_name: Pleska, Maros
id: 4569785E-F248-11E8-B48F-1D18A9856A87
last_name: Pleska
orcid: 0000-0001-7460-7479
citation:
ama: Pleska M. Biology of restriction-modification systems at the single-cell and
population level. 2017. doi:10.15479/AT:ISTA:th_916
apa: Pleska, M. (2017). Biology of restriction-modification systems at the single-cell
and population level. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_916
chicago: Pleska, Maros. “Biology of Restriction-Modification Systems at the Single-Cell
and Population Level.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_916.
ieee: M. Pleska, “Biology of restriction-modification systems at the single-cell
and population level,” Institute of Science and Technology Austria, 2017.
ista: Pleska M. 2017. Biology of restriction-modification systems at the single-cell
and population level. Institute of Science and Technology Austria.
mla: Pleska, Maros. Biology of Restriction-Modification Systems at the Single-Cell
and Population Level. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_916.
short: M. Pleska, Biology of Restriction-Modification Systems at the Single-Cell
and Population Level, Institute of Science and Technology Austria, 2017.
corr_author: '1'
date_created: 2018-12-11T11:45:10Z
date_published: 2017-10-01T00:00:00Z
date_updated: 2026-06-18T18:54:19Z
day: '01'
ddc:
- '576'
- '579'
degree_awarded: PhD
department:
- _id: CaGu
doi: 10.15479/AT:ISTA:th_916
file:
- access_level: open_access
checksum: 33cfb59674e91f82e3738396d3fb3776
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:48Z
date_updated: 2020-07-14T12:45:24Z
file_id: '4710'
file_name: IST-2018-916-v1+3_2017_Pleska_Maros_Thesis.pdf
file_size: 18569590
relation: main_file
- access_level: closed
checksum: dcc239968decb233e7f98cf1083d8c26
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: dernst
date_created: 2019-04-05T08:33:14Z
date_updated: 2020-07-14T12:45:24Z
file_id: '6204'
file_name: 2017_Pleska_Maros_Thesis.docx
file_size: 2801649
relation: source_file
file_date_updated: 2020-07-14T12:45:24Z
fulldoi: https://doi.org/10.15479/AT:ISTA:th_916
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '126'
project:
- _id: 251D65D8-B435-11E9-9278-68D0E5697425
grant_number: '24210'
name: Effects of Stochasticity on the Function of Restriction-Modi cation Systems
at the Single-Cell Level
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '7711'
pubrep_id: '916'
related_material:
record:
- id: '457'
relation: part_of_dissertation
status: public
- id: '1243'
relation: part_of_dissertation
status: public
- id: '561'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
title: Biology of restriction-modification systems at the single-cell and population
level
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2017'
...
---
_id: '1001'
abstract:
- lang: eng
text: We present a computational approach for designing CurveUps, curvy shells that
form from an initially flat state. They consist of small rigid tiles that are
tightly held together by two pre-stretched elastic sheets attached to them. Our
method allows the realization of smooth, doubly curved surfaces that can be fabricated
as a flat piece. Once released, the restoring forces of the pre-stretched sheets
support the object to take shape in 3D. CurveUps are structurally stable in their
target configuration. The design process starts with a target surface. Our method
generates a tile layout in 2D and optimizes the distribution, shape, and attachment
areas of the tiles to obtain a configuration that is fabricable and in which the
curved up state closely matches the target. Our approach is based on an efficient
approximate model and a local optimization strategy for an otherwise intractable
nonlinear optimization problem. We demonstrate the effectiveness of our approach
for a wide range of shapes, all realized as physical prototypes.
alternative_title:
- ACM Transactions on Graphics
article_number: '64'
article_processing_charge: No
author:
- first_name: Ruslan
full_name: Guseinov, Ruslan
id: 3AB45EE2-F248-11E8-B48F-1D18A9856A87
last_name: Guseinov
orcid: 0000-0001-9819-5077
- first_name: Eder
full_name: Miguel, Eder
last_name: Miguel
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
citation:
ama: 'Guseinov R, Miguel E, Bickel B. CurveUps: Shaping objects from flat plates
with tension-actuated curvature. In: Vol 36. ACM; 2017. doi:10.1145/3072959.3073709'
apa: 'Guseinov, R., Miguel, E., & Bickel, B. (2017). CurveUps: Shaping objects
from flat plates with tension-actuated curvature (Vol. 36). Presented at the SIGGRAPH:
Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles,
CA, United States: ACM. https://doi.org/10.1145/3072959.3073709'
chicago: 'Guseinov, Ruslan, Eder Miguel, and Bernd Bickel. “CurveUps: Shaping Objects
from Flat Plates with Tension-Actuated Curvature,” Vol. 36. ACM, 2017. https://doi.org/10.1145/3072959.3073709.'
ieee: 'R. Guseinov, E. Miguel, and B. Bickel, “CurveUps: Shaping objects from flat
plates with tension-actuated curvature,” presented at the SIGGRAPH: Special Interest
Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United
States, 2017, vol. 36, no. 4.'
ista: 'Guseinov R, Miguel E, Bickel B. 2017. CurveUps: Shaping objects from flat
plates with tension-actuated curvature. SIGGRAPH: Special Interest Group on Computer
Graphics and Interactive Techniques, ACM Transactions on Graphics, vol. 36, 64.'
mla: 'Guseinov, Ruslan, et al. CurveUps: Shaping Objects from Flat Plates with
Tension-Actuated Curvature. Vol. 36, no. 4, 64, ACM, 2017, doi:10.1145/3072959.3073709.'
short: R. Guseinov, E. Miguel, B. Bickel, in:, ACM, 2017.
conference:
end_date: 2017-08-25
location: Los Angeles, CA, United States
name: 'SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques'
start_date: 2017-08-19
date_created: 2018-12-11T11:49:38Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2026-04-08T07:25:22Z
day: '01'
ddc:
- '003'
- '004'
department:
- _id: BeBi
doi: 10.1145/3072959.3073709
ec_funded: 1
external_id:
isi:
- '000406432100032'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:24Z
date_updated: 2018-12-12T10:10:24Z
file_id: '4811'
file_name: IST-2018-1053-v1+1_CurveUp.pdf
file_size: 36159696
relation: main_file
file_date_updated: 2018-12-12T10:10:24Z
fulldoi: https://doi.org/10.1145/3072959.3073709
has_accepted_license: '1'
intvolume: ' 36'
isi: 1
issue: '4'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
project:
- _id: 25082902-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '645599'
name: Soft-bodied intelligence for Manipulation
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715767'
name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
Modeling'
publication_status: published
publisher: ACM
publist_id: '6397'
pubrep_id: '1053'
quality_controlled: '1'
related_material:
record:
- id: '8366'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'CurveUps: Shaping objects from flat plates with tension-actuated curvature'
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 36
year: '2017'
...
---
_id: '1002'
abstract:
- lang: eng
text: " We present an interactive design system to create functional mechanical
\ objects. Our computational approach allows novice users to retarget an existing
mechanical template to a user-specified input shape. Our proposed representation
for a mechanical template encodes a parameterized mechanism, mechanical constraints
that ensure a physically valid configuration, spatial relationships of mechanical
parts to the user-provided shape, and functional constraints that specify an intended
functionality. We provide an intuitive interface and optimization-in-the-loop
approach for finding a valid configuration of the mechanism and the shape to
ensure that higher-level functional goals are met. Our algorithm interactively
optimizes the mechanism while the user manipulates the placement of mechanical
components and the shape. Our system allows users to efficiently explore various
design choices and to synthesize customized mechanical objects that can be fabricated
with rapid prototyping technologies. We demonstrate the efficacy of our approach
by retargeting various mechanical templates to different shapes and fabricating
the resulting functional mechanical objects.\r\n"
alternative_title:
- ACM Transactions on Graphics
article_number: '81'
article_processing_charge: No
author:
- first_name: Ran
full_name: Zhang, Ran
id: 4DDBCEB0-F248-11E8-B48F-1D18A9856A87
last_name: Zhang
orcid: 0000-0002-3808-281X
- first_name: Thomas
full_name: Auzinger, Thomas
id: 4718F954-F248-11E8-B48F-1D18A9856A87
last_name: Auzinger
orcid: 0000-0002-1546-3265
- first_name: Duygu
full_name: Ceylan, Duygu
last_name: Ceylan
- first_name: Wilmot
full_name: Li, Wilmot
last_name: Li
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
citation:
ama: 'Zhang R, Auzinger T, Ceylan D, Li W, Bickel B. Functionality-aware retargeting
of mechanisms to 3D shapes. In: Vol 36. ACM; 2017. doi:10.1145/3072959.3073710'
apa: 'Zhang, R., Auzinger, T., Ceylan, D., Li, W., & Bickel, B. (2017). Functionality-aware
retargeting of mechanisms to 3D shapes (Vol. 36). Presented at the SIGGRAPH: Computer
Graphics and Interactive Techniques, Los Angeles, CA, United States : ACM. https://doi.org/10.1145/3072959.3073710'
chicago: Zhang, Ran, Thomas Auzinger, Duygu Ceylan, Wilmot Li, and Bernd Bickel.
“Functionality-Aware Retargeting of Mechanisms to 3D Shapes,” Vol. 36. ACM, 2017.
https://doi.org/10.1145/3072959.3073710.
ieee: 'R. Zhang, T. Auzinger, D. Ceylan, W. Li, and B. Bickel, “Functionality-aware
retargeting of mechanisms to 3D shapes,” presented at the SIGGRAPH: Computer Graphics
and Interactive Techniques, Los Angeles, CA, United States , 2017, vol. 36, no.
4.'
ista: 'Zhang R, Auzinger T, Ceylan D, Li W, Bickel B. 2017. Functionality-aware
retargeting of mechanisms to 3D shapes. SIGGRAPH: Computer Graphics and Interactive
Techniques, ACM Transactions on Graphics, vol. 36, 81.'
mla: Zhang, Ran, et al. Functionality-Aware Retargeting of Mechanisms to 3D Shapes.
Vol. 36, no. 4, 81, ACM, 2017, doi:10.1145/3072959.3073710.
short: R. Zhang, T. Auzinger, D. Ceylan, W. Li, B. Bickel, in:, ACM, 2017.
conference:
end_date: 2017-08-03
location: 'Los Angeles, CA, United States '
name: 'SIGGRAPH: Computer Graphics and Interactive Techniques'
start_date: 2017-07-30
date_created: 2018-12-11T11:49:38Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2026-04-16T10:06:32Z
day: '01'
ddc:
- '003'
- '004'
department:
- _id: BeBi
doi: 10.1145/3072959.3073710
ec_funded: 1
external_id:
isi:
- '000406432100049'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:05Z
date_updated: 2018-12-12T10:09:05Z
file_id: '4728'
file_name: IST-2018-1050-v1+1_MechRet.pdf
file_size: 25463895
relation: main_file
file_date_updated: 2018-12-12T10:09:05Z
fulldoi: https://doi.org/10.1145/3072959.3073710
has_accepted_license: '1'
intvolume: ' 36'
isi: 1
issue: '4'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
project:
- _id: 2508E324-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '642841'
name: Distributed 3D Object Design
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715767'
name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
Modeling'
publication_identifier:
issn:
- 0730-0301
publication_status: published
publisher: ACM
publist_id: '6396'
pubrep_id: '1050'
quality_controlled: '1'
related_material:
record:
- id: '8386'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Functionality-aware retargeting of mechanisms to 3D shapes
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 36
year: '2017'
...
---
_id: '1003'
abstract:
- lang: eng
text: Network games (NGs) are played on directed graphs and are extensively used
in network design and analysis. Search problems for NGs include finding special
strategy profiles such as a Nash equilibrium and a globally optimal solution.
The networks modeled by NGs may be huge. In formal verification, abstraction has
proven to be an extremely effective technique for reasoning about systems with
big and even infinite state spaces. We describe an abstraction-refinement methodology
for reasoning about NGs. Our methodology is based on an abstraction function that
maps the state space of an NG to a much smaller state space. We search for a global
optimum and a Nash equilibrium by reasoning on an under- and an overapproximation
defined on top of this smaller state space. When the approximations are too coarse
to find such profiles, we refine the abstraction function. Our experimental results
demonstrate the efficiency of the methodology.
article_processing_charge: No
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Shibashis
full_name: Guha, Shibashis
last_name: Guha
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: 'Avni G, Guha S, Kupferman O. An abstraction-refinement methodology for reasoning
about network games. In: AAAI Press; 2017:70-76. doi:10.24963/ijcai.2017/11'
apa: 'Avni, G., Guha, S., & Kupferman, O. (2017). An abstraction-refinement
methodology for reasoning about network games (pp. 70–76). Presented at the IJCAI:
International Joint Conference on Artificial Intelligence , Melbourne, Australia:
AAAI Press. https://doi.org/10.24963/ijcai.2017/11'
chicago: Avni, Guy, Shibashis Guha, and Orna Kupferman. “An Abstraction-Refinement
Methodology for Reasoning about Network Games,” 70–76. AAAI Press, 2017. https://doi.org/10.24963/ijcai.2017/11.
ieee: 'G. Avni, S. Guha, and O. Kupferman, “An abstraction-refinement methodology
for reasoning about network games,” presented at the IJCAI: International Joint
Conference on Artificial Intelligence , Melbourne, Australia, 2017, pp. 70–76.'
ista: 'Avni G, Guha S, Kupferman O. 2017. An abstraction-refinement methodology
for reasoning about network games. IJCAI: International Joint Conference on Artificial
Intelligence , 70–76.'
mla: Avni, Guy, et al. An Abstraction-Refinement Methodology for Reasoning about
Network Games. AAAI Press, 2017, pp. 70–76, doi:10.24963/ijcai.2017/11.
short: G. Avni, S. Guha, O. Kupferman, in:, AAAI Press, 2017, pp. 70–76.
conference:
end_date: 2017-08-25
location: Melbourne, Australia
name: 'IJCAI: International Joint Conference on Artificial Intelligence '
start_date: 2017-08-19
date_created: 2018-12-11T11:49:38Z
date_published: 2017-05-30T00:00:00Z
date_updated: 2025-07-10T11:49:38Z
day: '30'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.24963/ijcai.2017/11
external_id:
isi:
- '000764137500011'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:58Z
date_updated: 2018-12-12T10:16:58Z
file_id: '5249'
file_name: IST-2017-818-v1+1_allIJCAI_CR.pdf
file_size: 365172
relation: main_file
file_date_updated: 2018-12-12T10:16:58Z
fulldoi: https://doi.org/10.24963/ijcai.2017/11
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 70 - 76
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
publication_identifier:
issn:
- 1045-0823
publication_status: published
publisher: AAAI Press
publist_id: '6395'
pubrep_id: '818'
quality_controlled: '1'
related_material:
record:
- id: '6006'
relation: later_version
status: public
scopus_import: '1'
status: public
title: An abstraction-refinement methodology for reasoning about network games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '1004'
abstract:
- lang: eng
text: The fundamental tasks of the root system are, besides anchoring, mediating
interactions between plant and soil and providing the plant with water and nutrients.
The architecture of the root system is controlled by endogenous mechanisms that
constantly integrate environmental signals, such as availability of nutrients
and water. Extremely important for efficient soil exploitation and survival under
less favorable conditions is the developmental flexibility of the root system
that is largely determined by its postembryonic branching capacity. Modulation
of initiation and outgrowth of lateral roots provides roots with an exceptional
plasticity, allows optimal adjustment to underground heterogeneity, and enables
effective soil exploitation and use of resources. Here we discuss recent advances
in understanding the molecular mechanisms that shape the plant root system and
integrate external cues to adapt to the changing environment.
article_processing_charge: No
author:
- first_name: Krisztina
full_name: Ötvös, Krisztina
id: 29B901B0-F248-11E8-B48F-1D18A9856A87
last_name: Ötvös
orcid: 0000-0002-5503-4983
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
citation:
ama: Ötvös K, Benková E. Spatiotemporal mechanisms of root branching. Current
Opinion in Genetics & Development. 2017;45:82-89. doi:10.1016/j.gde.2017.03.010
apa: Ötvös, K., & Benková, E. (2017). Spatiotemporal mechanisms of root branching.
Current Opinion in Genetics & Development. Elsevier. https://doi.org/10.1016/j.gde.2017.03.010
chicago: Ötvös, Krisztina, and Eva Benková. “Spatiotemporal Mechanisms of Root Branching.”
Current Opinion in Genetics & Development. Elsevier, 2017. https://doi.org/10.1016/j.gde.2017.03.010.
ieee: K. Ötvös and E. Benková, “Spatiotemporal mechanisms of root branching,” Current
Opinion in Genetics & Development, vol. 45. Elsevier, pp. 82–89, 2017.
ista: Ötvös K, Benková E. 2017. Spatiotemporal mechanisms of root branching. Current
Opinion in Genetics & Development. 45, 82–89.
mla: Ötvös, Krisztina, and Eva Benková. “Spatiotemporal Mechanisms of Root Branching.”
Current Opinion in Genetics & Development, vol. 45, Elsevier, 2017,
pp. 82–89, doi:10.1016/j.gde.2017.03.010.
short: K. Ötvös, E. Benková, Current Opinion in Genetics & Development 45 (2017)
82–89.
date_created: 2018-12-11T11:49:38Z
date_published: 2017-08-01T00:00:00Z
date_updated: 2026-04-16T09:56:36Z
day: '01'
ddc:
- '575'
department:
- _id: EvBe
doi: 10.1016/j.gde.2017.03.010
external_id:
isi:
- '000404880400013'
pmid:
- '28391060'
file:
- access_level: open_access
content_type: application/pdf
creator: dernst
date_created: 2019-04-17T08:00:36Z
date_updated: 2019-04-17T08:00:36Z
file_id: '6336'
file_name: Otvos_Benkova_CurOpDevBiol_2017.pdf
file_size: 364133
relation: main_file
success: 1
file_date_updated: 2019-04-17T08:00:36Z
fulldoi: https://doi.org/10.1016/j.gde.2017.03.010
has_accepted_license: '1'
intvolume: ' 45'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '08'
oa: 1
oa_version: Submitted Version
page: 82 - 89
pmid: 1
project:
- _id: 2542D156-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I 1774-B16
name: Hormone cross-talk drives nutrient dependent plant development
publication: Current Opinion in Genetics & Development
publication_identifier:
issn:
- 0959-437X
publication_status: published
publisher: Elsevier
publist_id: '6394'
pubrep_id: '1017'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Spatiotemporal mechanisms of root branching
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 45
year: '2017'
...
---
_id: '1006'
abstract:
- lang: eng
text: 'Background: The phenomenon of immune priming, i.e. enhanced protection following
a secondary exposure to a pathogen, has now been demonstrated in a wide range
of invertebrate species. Despite accumulating phenotypic evidence, knowledge of
its mechanistic underpinnings is currently very limited. Here we used the system
of the red flour beetle, Tribolium castaneum and the insect pathogen Bacillus
thuringiensis (Bt) to further our molecular understanding of the oral immune priming
phenomenon. We addressed how ingestion of bacterial cues (derived from spore supernatants)
of an orally pathogenic and non-pathogenic Bt strain affects gene expression upon
later challenge exposure, using a whole-transcriptome sequencing approach. Results:
Whereas gene expression of individuals primed with the orally non-pathogenic strain
showed minor changes to controls, we found that priming with the pathogenic strain
induced regulation of a large set of distinct genes, many of which are known immune
candidates. Intriguingly, the immune repertoire activated upon priming and subsequent
challenge qualitatively differed from the one mounted upon infection with Bt without
previous priming. Moreover, a large subset of priming-specific genes showed an
inverse regulation compared to their regulation upon challenge only. Conclusions:
Our data demonstrate that gene expression upon infection is strongly affected
by previous immune priming. We hypothesise that this shift in gene expression
indicates activation of a more targeted and efficient response towards a previously
encountered pathogen, in anticipation of potential secondary encounter.'
article_processing_charge: No
author:
- first_name: Jenny
full_name: Greenwood, Jenny
last_name: Greenwood
- first_name: Barbara
full_name: Milutinovic, Barbara
id: 2CDC32B8-F248-11E8-B48F-1D18A9856A87
last_name: Milutinovic
orcid: 0000-0002-8214-4758
- first_name: Robert
full_name: Peuß, Robert
last_name: Peuß
- first_name: Sarah
full_name: Behrens, Sarah
last_name: Behrens
- first_name: Daniela
full_name: Essar, Daniela
last_name: Essar
- first_name: Philip
full_name: Rosenstiel, Philip
last_name: Rosenstiel
- first_name: Hinrich
full_name: Schulenburg, Hinrich
last_name: Schulenburg
- first_name: Joachim
full_name: Kurtz, Joachim
last_name: Kurtz
citation:
ama: Greenwood J, Milutinovic B, Peuß R, et al. Oral immune priming with Bacillus
thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae.
BMC Genomics. 2017;18(1):329. doi:10.1186/s12864-017-3705-7
apa: Greenwood, J., Milutinovic, B., Peuß, R., Behrens, S., Essar, D., Rosenstiel,
P., … Kurtz, J. (2017). Oral immune priming with Bacillus thuringiensis induces
a shift in the gene expression of Tribolium castaneum larvae. BMC Genomics.
BioMed Central. https://doi.org/10.1186/s12864-017-3705-7
chicago: Greenwood, Jenny, Barbara Milutinovic, Robert Peuß, Sarah Behrens, Daniela
Essar, Philip Rosenstiel, Hinrich Schulenburg, and Joachim Kurtz. “Oral Immune
Priming with Bacillus Thuringiensis Induces a Shift in the Gene Expression of
Tribolium Castaneum Larvae.” BMC Genomics. BioMed Central, 2017. https://doi.org/10.1186/s12864-017-3705-7.
ieee: J. Greenwood et al., “Oral immune priming with Bacillus thuringiensis
induces a shift in the gene expression of Tribolium castaneum larvae,” BMC
Genomics, vol. 18, no. 1. BioMed Central, p. 329, 2017.
ista: Greenwood J, Milutinovic B, Peuß R, Behrens S, Essar D, Rosenstiel P, Schulenburg
H, Kurtz J. 2017. Oral immune priming with Bacillus thuringiensis induces a shift
in the gene expression of Tribolium castaneum larvae. BMC Genomics. 18(1), 329.
mla: Greenwood, Jenny, et al. “Oral Immune Priming with Bacillus Thuringiensis Induces
a Shift in the Gene Expression of Tribolium Castaneum Larvae.” BMC Genomics,
vol. 18, no. 1, BioMed Central, 2017, p. 329, doi:10.1186/s12864-017-3705-7.
short: J. Greenwood, B. Milutinovic, R. Peuß, S. Behrens, D. Essar, P. Rosenstiel,
H. Schulenburg, J. Kurtz, BMC Genomics 18 (2017) 329.
date_created: 2018-12-11T11:49:39Z
date_published: 2017-04-26T00:00:00Z
date_updated: 2025-07-10T11:49:40Z
day: '26'
ddc:
- '570'
department:
- _id: SyCr
doi: 10.1186/s12864-017-3705-7
external_id:
isi:
- '000400625200004'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:46Z
date_updated: 2018-12-12T10:16:46Z
file_id: '5236'
file_name: IST-2017-814-v1+1_s12864-017-3705-7.pdf
file_size: 2379672
relation: main_file
file_date_updated: 2018-12-12T10:16:46Z
fulldoi: https://doi.org/10.1186/s12864-017-3705-7
has_accepted_license: '1'
intvolume: ' 18'
isi: 1
issue: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '329'
publication: BMC Genomics
publication_identifier:
issn:
- 1471-2164
publication_status: published
publisher: BioMed Central
publist_id: '6392'
pubrep_id: '814'
quality_controlled: '1'
related_material:
record:
- id: '9859'
relation: research_data
status: public
- id: '9860'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Oral immune priming with Bacillus thuringiensis induces a shift in the gene
expression of Tribolium castaneum larvae
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 18
year: '2017'
...
---
_id: '1007'
abstract:
- lang: eng
text: 'A nonlinear system possesses an invariance with respect to a set of transformations
if its output dynamics remain invariant when transforming the input, and adjusting
the initial condition accordingly. Most research has focused on invariances with
respect to time-independent pointwise transformations like translational-invariance
(u(t) -> u(t) + p, p in R) or scale-invariance (u(t) -> pu(t), p in R>0).
In this article, we introduce the concept of s0-invariances with respect to continuous
input transformations exponentially growing/decaying over time. We show that s0-invariant
systems not only encompass linear time-invariant (LTI) systems with transfer functions
having an irreducible zero at s0 in R, but also that the input/output relationship
of nonlinear s0-invariant systems possesses properties well known from their linear
counterparts. Furthermore, we extend the concept of s0-invariances to second-
and higher-order s0-invariances, corresponding to invariances with respect to
transformations of the time-derivatives of the input, and encompassing LTI systems
with zeros of multiplicity two or higher. Finally, we show that nth-order 0-invariant
systems realize – under mild conditions – nth-order nonlinear differential operators:
when excited by an input of a characteristic functional form, the system’s output
converges to a constant value only depending on the nth (nonlinear) derivative
of the input.'
article_processing_charge: Yes (in subscription journal)
author:
- first_name: Moritz
full_name: Lang, Moritz
id: 29E0800A-F248-11E8-B48F-1D18A9856A87
last_name: Lang
- first_name: Eduardo
full_name: Sontag, Eduardo
last_name: Sontag
citation:
ama: Lang M, Sontag E. Zeros of nonlinear systems with input invariances. Automatica.
2017;81C:46-55. doi:10.1016/j.automatica.2017.03.030
apa: Lang, M., & Sontag, E. (2017). Zeros of nonlinear systems with input invariances.
Automatica. International Federation of Automatic Control. https://doi.org/10.1016/j.automatica.2017.03.030
chicago: Lang, Moritz, and Eduardo Sontag. “Zeros of Nonlinear Systems with Input
Invariances.” Automatica. International Federation of Automatic Control,
2017. https://doi.org/10.1016/j.automatica.2017.03.030.
ieee: M. Lang and E. Sontag, “Zeros of nonlinear systems with input invariances,”
Automatica, vol. 81C. International Federation of Automatic Control, pp.
46–55, 2017.
ista: Lang M, Sontag E. 2017. Zeros of nonlinear systems with input invariances.
Automatica. 81C, 46–55.
mla: Lang, Moritz, and Eduardo Sontag. “Zeros of Nonlinear Systems with Input Invariances.”
Automatica, vol. 81C, International Federation of Automatic Control, 2017,
pp. 46–55, doi:10.1016/j.automatica.2017.03.030.
short: M. Lang, E. Sontag, Automatica 81C (2017) 46–55.
date_created: 2018-12-11T11:49:39Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2025-04-15T06:50:01Z
day: '01'
ddc:
- '000'
department:
- _id: CaGu
- _id: GaTk
doi: 10.1016/j.automatica.2017.03.030
ec_funded: 1
external_id:
isi:
- '000403513900006'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:29Z
date_updated: 2018-12-12T10:11:29Z
file_id: '4884'
file_name: IST-2017-813-v1+1_ZerosOfNonlinearSystems.pdf
file_size: 1401954
relation: main_file
file_date_updated: 2018-12-12T10:11:29Z
fulldoi: https://doi.org/10.1016/j.automatica.2017.03.030
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 46 - 55
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Automatica
publication_identifier:
issn:
- 0005-1098
publication_status: published
publisher: International Federation of Automatic Control
publist_id: '6391'
pubrep_id: '813'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Zeros of nonlinear systems with input invariances
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 81C
year: '2017'
...