---
_id: '424'
abstract:
- lang: eng
text: 'We show that very weak topological assumptions are enough to ensure the existence
of a Helly-type theorem. More precisely, we show that for any non-negative integers
b and d there exists an integer h(b, d) such that the following holds. If F is
a finite family of subsets of Rd such that βi(∩G)≤b for any G⊊F and every 0 ≤
i ≤ [d/2]-1 then F has Helly number at most h(b, d). Here βi denotes the reduced
Z2-Betti numbers (with singular homology). These topological conditions are sharp:
not controlling any of these [d/2] first Betti numbers allow for families with
unbounded Helly number. Our proofs combine homological non-embeddability results
with a Ramsey-based approach to build, given an arbitrary simplicial complex K,
some well-behaved chain map C*(K)→C*(Rd).'
article_processing_charge: No
arxiv: 1
author:
- first_name: Xavier
full_name: Goaoc, Xavier
last_name: Goaoc
- first_name: Pavel
full_name: Paták, Pavel
last_name: Paták
- first_name: Zuzana
full_name: Patakova, Zuzana
last_name: Patakova
orcid: 0000-0002-3975-1683
- first_name: Martin
full_name: Tancer, Martin
last_name: Tancer
orcid: 0000-0002-1191-6714
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Bounding helly numbers via
betti numbers. In: Loebl M, Nešetřil J, Thomas R, eds. A Journey through Discrete
Mathematics: A Tribute to Jiri Matousek. A Journey Through Discrete Mathematics.
Springer; 2017:407-447. doi:10.1007/978-3-319-44479-6_17'
apa: 'Goaoc, X., Paták, P., Patakova, Z., Tancer, M., & Wagner, U. (2017). Bounding
helly numbers via betti numbers. In M. Loebl, J. Nešetřil, & R. Thomas (Eds.),
A Journey through Discrete Mathematics: A Tribute to Jiri Matousek (pp.
407–447). Springer. https://doi.org/10.1007/978-3-319-44479-6_17'
chicago: 'Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner.
“Bounding Helly Numbers via Betti Numbers.” In A Journey through Discrete Mathematics:
A Tribute to Jiri Matousek, edited by Martin Loebl, Jaroslav Nešetřil, and
Robin Thomas, 407–47. A Journey Through Discrete Mathematics. Springer, 2017.
https://doi.org/10.1007/978-3-319-44479-6_17.'
ieee: 'X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Bounding helly
numbers via betti numbers,” in A Journey through Discrete Mathematics: A Tribute
to Jiri Matousek, M. Loebl, J. Nešetřil, and R. Thomas, Eds. Springer, 2017,
pp. 407–447.'
ista: 'Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2017.Bounding helly numbers
via betti numbers. In: A Journey through Discrete Mathematics: A Tribute to Jiri
Matousek. , 407–447.'
mla: 'Goaoc, Xavier, et al. “Bounding Helly Numbers via Betti Numbers.” A Journey
through Discrete Mathematics: A Tribute to Jiri Matousek, edited by Martin
Loebl et al., Springer, 2017, pp. 407–47, doi:10.1007/978-3-319-44479-6_17.'
short: 'X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, M. Loebl, J.
Nešetřil, R. Thomas (Eds.), A Journey through Discrete Mathematics: A Tribute
to Jiri Matousek, Springer, 2017, pp. 407–447.'
date_created: 2018-12-11T11:46:24Z
date_published: 2017-10-06T00:00:00Z
date_updated: 2025-06-04T08:47:28Z
day: '06'
department:
- _id: UlWa
doi: 10.1007/978-3-319-44479-6_17
editor:
- first_name: Martin
full_name: Loebl, Martin
last_name: Loebl
- first_name: Jaroslav
full_name: Nešetřil, Jaroslav
last_name: Nešetřil
- first_name: Robin
full_name: Thomas, Robin
last_name: Thomas
external_id:
arxiv:
- '1310.4613'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1310.4613
month: '10'
oa: 1
oa_version: Published Version
page: 407 - 447
publication: 'A Journey through Discrete Mathematics: A Tribute to Jiri Matousek'
publication_identifier:
isbn:
- 978-331944479-6
publication_status: published
publisher: Springer
publist_id: '7399'
quality_controlled: '1'
related_material:
record:
- id: '1512'
relation: earlier_version
status: public
scopus_import: '1'
series_title: A Journey Through Discrete Mathematics
status: public
title: Bounding helly numbers via betti numbers
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '431'
abstract:
- lang: eng
text: 'Parallel implementations of stochastic gradient descent (SGD) have received
significant research attention, thanks to its excellent scalability properties.
A fundamental barrier when parallelizing SGD is the high bandwidth cost of communicating
gradient updates between nodes; consequently, several lossy compresion heuristics
have been proposed, by which nodes only communicate quantized gradients. Although
effective in practice, these heuristics do not always converge. In this paper,
we propose Quantized SGD (QSGD), a family of compression schemes with convergence
guarantees and good practical performance. QSGD allows the user to smoothly trade
off communication bandwidth and convergence time: nodes can adjust the number
of bits sent per iteration, at the cost of possibly higher variance. We show that
this trade-off is inherent, in the sense that improving it past some threshold
would violate information-theoretic lower bounds. QSGD guarantees convergence
for convex and non-convex objectives, under asynchrony, and can be extended to
stochastic variance-reduced techniques. When applied to training deep neural networks
for image classification and automated speech recognition, QSGD leads to significant
reductions in end-to-end training time. For instance, on 16GPUs, we can train
the ResNet-152 network to full accuracy on ImageNet 1.8 × faster than the full-precision
variant. '
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Demjan
full_name: Grubic, Demjan
last_name: Grubic
- first_name: Jerry
full_name: Li, Jerry
last_name: Li
- first_name: Ryota
full_name: Tomioka, Ryota
last_name: Tomioka
- first_name: Milan
full_name: Vojnović, Milan
last_name: Vojnović
citation:
ama: 'Alistarh D-A, Grubic D, Li J, Tomioka R, Vojnović M. QSGD: Communication-efficient
SGD via gradient quantization and encoding. In: Vol 2017. Neural Information Processing
Systems Foundation; 2017:1710-1721.'
apa: 'Alistarh, D.-A., Grubic, D., Li, J., Tomioka, R., & Vojnović, M. (2017).
QSGD: Communication-efficient SGD via gradient quantization and encoding (Vol.
2017, pp. 1710–1721). Presented at the NIPS: Neural Information Processing System,
Long Beach, CA, United States: Neural Information Processing Systems Foundation.'
chicago: 'Alistarh, Dan-Adrian, Demjan Grubic, Jerry Li, Ryota Tomioka, and Milan
Vojnović. “QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding,”
2017:1710–21. Neural Information Processing Systems Foundation, 2017.'
ieee: 'D.-A. Alistarh, D. Grubic, J. Li, R. Tomioka, and M. Vojnović, “QSGD: Communication-efficient
SGD via gradient quantization and encoding,” presented at the NIPS: Neural Information
Processing System, Long Beach, CA, United States, 2017, vol. 2017, pp. 1710–1721.'
ista: 'Alistarh D-A, Grubic D, Li J, Tomioka R, Vojnović M. 2017. QSGD: Communication-efficient
SGD via gradient quantization and encoding. NIPS: Neural Information Processing
System, Advances in Neural Information Processing Systems, vol. 2017, 1710–1721.'
mla: 'Alistarh, Dan-Adrian, et al. QSGD: Communication-Efficient SGD via Gradient
Quantization and Encoding. Vol. 2017, Neural Information Processing Systems
Foundation, 2017, pp. 1710–21.'
short: D.-A. Alistarh, D. Grubic, J. Li, R. Tomioka, M. Vojnović, in:, Neural Information
Processing Systems Foundation, 2017, pp. 1710–1721.
conference:
end_date: 2017-12-09
location: Long Beach, CA, United States
name: 'NIPS: Neural Information Processing System'
start_date: 2017-12-04
corr_author: '1'
date_created: 2018-12-11T11:46:26Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2025-09-18T10:07:20Z
day: '01'
department:
- _id: DaAl
external_id:
arxiv:
- '1610.02132'
isi:
- '000452649401072'
intvolume: ' 2017'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1610.02132
month: '01'
oa: 1
oa_version: Submitted Version
page: 1710-1721
publication_identifier:
issn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
publist_id: '7392'
quality_controlled: '1'
status: public
title: 'QSGD: Communication-efficient SGD via gradient quantization and encoding'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 2017
year: '2017'
...
---
_id: '432'
abstract:
- lang: eng
text: 'Recently there has been significant interest in training machine-learning
models at low precision: by reducing precision, one can reduce computation and
communication by one order of magnitude. We examine training at reduced precision,
both from a theoretical and practical perspective, and ask: is it possible to
train models at end-to-end low precision with provable guarantees? Can this lead
to consistent order-of-magnitude speedups? We mainly focus on linear models, and
the answer is yes for linear models. We develop a simple framework called ZipML
based on one simple but novel strategy called double sampling. Our ZipML framework
is able to execute training at low precision with no bias, guaranteeing convergence,
whereas naive quanti- zation would introduce significant bias. We val- idate our
framework across a range of applica- tions, and show that it enables an FPGA proto-
type that is up to 6.5 × faster than an implemen- tation using full 32-bit precision.
We further de- velop a variance-optimal stochastic quantization strategy and show
that it can make a significant difference in a variety of settings. When applied
to linear models together with double sampling, we save up to another 1.7 × in
data movement compared with uniform quantization. When training deep networks
with quantized models, we achieve higher accuracy than the state-of-the- art XNOR-Net. '
alternative_title:
- PMLR Press
article_processing_charge: No
author:
- first_name: Hantian
full_name: Zhang, Hantian
last_name: Zhang
- first_name: Jerry
full_name: Li, Jerry
last_name: Li
- first_name: Kaan
full_name: Kara, Kaan
last_name: Kara
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Ji
full_name: Liu, Ji
last_name: Liu
- first_name: Ce
full_name: Zhang, Ce
last_name: Zhang
citation:
ama: 'Zhang H, Li J, Kara K, Alistarh D-A, Liu J, Zhang C. ZipML: Training linear
models with end-to-end low precision, and a little bit of deep learning. In: Proceedings
of Machine Learning Research. Vol 70. ML Research Press; 2017:4035-4043.'
apa: 'Zhang, H., Li, J., Kara, K., Alistarh, D.-A., Liu, J., & Zhang, C. (2017).
ZipML: Training linear models with end-to-end low precision, and a little bit
of deep learning. In Proceedings of Machine Learning Research (Vol. 70,
pp. 4035–4043). Sydney, Australia: ML Research Press.'
chicago: 'Zhang, Hantian, Jerry Li, Kaan Kara, Dan-Adrian Alistarh, Ji Liu, and
Ce Zhang. “ZipML: Training Linear Models with End-to-End Low Precision, and a
Little Bit of Deep Learning.” In Proceedings of Machine Learning Research,
70:4035–43. ML Research Press, 2017.'
ieee: 'H. Zhang, J. Li, K. Kara, D.-A. Alistarh, J. Liu, and C. Zhang, “ZipML: Training
linear models with end-to-end low precision, and a little bit of deep learning,”
in Proceedings of Machine Learning Research, Sydney, Australia, 2017, vol.
70, pp. 4035–4043.'
ista: 'Zhang H, Li J, Kara K, Alistarh D-A, Liu J, Zhang C. 2017. ZipML: Training
linear models with end-to-end low precision, and a little bit of deep learning.
Proceedings of Machine Learning Research. ICML: International Conference on Machine
Learning, PMLR Press, vol. 70, 4035–4043.'
mla: 'Zhang, Hantian, et al. “ZipML: Training Linear Models with End-to-End Low
Precision, and a Little Bit of Deep Learning.” Proceedings of Machine Learning
Research, vol. 70, ML Research Press, 2017, pp. 4035–43.'
short: H. Zhang, J. Li, K. Kara, D.-A. Alistarh, J. Liu, C. Zhang, in:, Proceedings
of Machine Learning Research, ML Research Press, 2017, pp. 4035–4043.
conference:
end_date: 2017-08-11
location: Sydney, Australia
name: 'ICML: International Conference on Machine Learning'
start_date: 2017-08-06
corr_author: '1'
date_created: 2018-12-11T11:46:26Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2025-09-18T10:06:02Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
external_id:
isi:
- '000683309504015'
file:
- access_level: open_access
checksum: 86156ba7f4318e47cef3eb9092593c10
content_type: application/pdf
creator: dernst
date_created: 2019-01-22T08:23:58Z
date_updated: 2020-07-14T12:46:26Z
file_id: '5869'
file_name: 2017_ICML_Zhang.pdf
file_size: 849345
relation: main_file
file_date_updated: 2020-07-14T12:46:26Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 4035 - 4043
publication: Proceedings of Machine Learning Research
publication_identifier:
isbn:
- 978-151085514-4
publication_status: published
publisher: ML Research Press
publist_id: '7391'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'ZipML: Training linear models with end-to-end low precision, and a little
bit of deep learning'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: ' 70'
year: '2017'
...
---
_id: '444'
abstract:
- lang: eng
text: Complex I (NADH:ubiquinone oxidoreductase) plays a central role in cellular
energy generation, contributing to the proton motive force used to produce ATP.
It couples the transfer of two electrons between NADH and quinone to translocation
of four protons across the membrane. It is the largest protein assembly of bacterial
and mitochondrial respiratory chains, composed, in mammals, of up to 45 subunits
with a total molecular weight of ∼1 MDa. Bacterial enzyme is about half the size,
providing the important “minimal” model of complex I. The l-shaped complex consists
of a hydrophilic arm, where electron transfer occurs, and a membrane arm, where
proton translocation takes place. Previously, we have solved the crystal structures
of the hydrophilic domain of complex I from Thermus thermophilus and of the membrane
domain from Escherichia coli, followed by the atomic structure of intact, entire
complex I from T. thermophilus. Recently, we have solved by cryo-EM a first complete
atomic structure of mammalian (ovine) mitochondrial complex I. Core subunits are
well conserved from the bacterial version, whilst supernumerary subunits form
an interlinked, stabilizing shell around the core. Subunits containing additional
cofactors, including Zn ion, NADPH and phosphopantetheine, probably have regulatory
roles. Dysfunction of mitochondrial complex I is implicated in many human neurodegenerative
diseases. The structure of mammalian enzyme provides many insights into complex
I mechanism, assembly, maturation and dysfunction, allowing detailed molecular
analysis of disease-causing mutations.
author:
- 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: 'Sazanov LA. Structure of respiratory complex I: “Minimal” bacterial and “de
luxe” mammalian versions. In: Wikström M, ed. Mechanisms of Primary Energy
Transduction in Biology . Mechanisms of Primary Energy Transduction in Biology
. Royal Society of Chemistry; 2017:25-59. doi:10.1039/9781788010405-00025'
apa: 'Sazanov, L. A. (2017). Structure of respiratory complex I: “Minimal” bacterial
and “de luxe” mammalian versions. In M. Wikström (Ed.), Mechanisms of primary
energy transduction in biology (pp. 25–59). Royal Society of Chemistry. https://doi.org/10.1039/9781788010405-00025'
chicago: 'Sazanov, Leonid A. “Structure of Respiratory Complex I: ‘Minimal’ Bacterial
and ‘de Luxe’ Mammalian Versions.” In Mechanisms of Primary Energy Transduction
in Biology , edited by Mårten Wikström, 25–59. Mechanisms of Primary Energy
Transduction in Biology . Royal Society of Chemistry, 2017. https://doi.org/10.1039/9781788010405-00025.'
ieee: 'L. A. Sazanov, “Structure of respiratory complex I: ‘Minimal’ bacterial and
‘de luxe’ mammalian versions,” in Mechanisms of primary energy transduction
in biology , M. Wikström, Ed. Royal Society of Chemistry, 2017, pp. 25–59.'
ista: 'Sazanov LA. 2017.Structure of respiratory complex I: “Minimal” bacterial
and “de luxe” mammalian versions. In: Mechanisms of primary energy transduction
in biology . , 25–59.'
mla: 'Sazanov, Leonid A. “Structure of Respiratory Complex I: ‘Minimal’ Bacterial
and ‘de Luxe’ Mammalian Versions.” Mechanisms of Primary Energy Transduction
in Biology , edited by Mårten Wikström, Royal Society of Chemistry, 2017,
pp. 25–59, doi:10.1039/9781788010405-00025.'
short: L.A. Sazanov, in:, M. Wikström (Ed.), Mechanisms of Primary Energy Transduction
in Biology , Royal Society of Chemistry, 2017, pp. 25–59.
corr_author: '1'
date_created: 2018-12-11T11:46:30Z
date_published: 2017-11-29T00:00:00Z
date_updated: 2024-10-09T20:58:14Z
day: '29'
department:
- _id: LeSa
doi: 10.1039/9781788010405-00025
editor:
- first_name: Mårten
full_name: Wikström, Mårten
last_name: Wikström
language:
- iso: eng
month: '11'
oa_version: None
page: 25 - 59
publication: 'Mechanisms of primary energy transduction in biology '
publication_identifier:
isbn:
- 978-1-78262-865-1
publication_status: published
publisher: Royal Society of Chemistry
publist_id: '7379'
quality_controlled: '1'
series_title: 'Mechanisms of Primary Energy Transduction in Biology '
status: public
title: 'Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian
versions'
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '447'
abstract:
- lang: eng
text: We consider last passage percolation (LPP) models with exponentially distributed
random variables, which are linked to the totally asymmetric simple exclusion
process (TASEP). The competition interface for LPP was introduced and studied
in Ferrari and Pimentel (2005a) for cases where the corresponding exclusion process
had a rarefaction fan. Here we consider situations with a shock and determine
the law of the fluctuations of the competition interface around its deter- ministic
law of large number position. We also study the multipoint distribution of the
LPP around the shock, extending our one-point result of Ferrari and Nejjar (2015).
article_processing_charge: No
article_type: original
author:
- first_name: Patrik
full_name: Ferrari, Patrik
last_name: Ferrari
- first_name: Peter
full_name: Nejjar, Peter
id: 4BF426E2-F248-11E8-B48F-1D18A9856A87
last_name: Nejjar
citation:
ama: Ferrari P, Nejjar P. Fluctuations of the competition interface in presence
of shocks. Revista Latino-Americana de Probabilidade e Estatística. 2017;9:299-325.
doi:10.30757/ALEA.v14-17
apa: Ferrari, P., & Nejjar, P. (2017). Fluctuations of the competition interface
in presence of shocks. Revista Latino-Americana de Probabilidade e Estatística.
Instituto Nacional de Matematica Pura e Aplicada. https://doi.org/10.30757/ALEA.v14-17
chicago: Ferrari, Patrik, and Peter Nejjar. “Fluctuations of the Competition Interface
in Presence of Shocks.” Revista Latino-Americana de Probabilidade e Estatística.
Instituto Nacional de Matematica Pura e Aplicada, 2017. https://doi.org/10.30757/ALEA.v14-17.
ieee: P. Ferrari and P. Nejjar, “Fluctuations of the competition interface in presence
of shocks,” Revista Latino-Americana de Probabilidade e Estatística, vol.
9. Instituto Nacional de Matematica Pura e Aplicada, pp. 299–325, 2017.
ista: Ferrari P, Nejjar P. 2017. Fluctuations of the competition interface in presence
of shocks. Revista Latino-Americana de Probabilidade e Estatística. 9, 299–325.
mla: Ferrari, Patrik, and Peter Nejjar. “Fluctuations of the Competition Interface
in Presence of Shocks.” Revista Latino-Americana de Probabilidade e Estatística,
vol. 9, Instituto Nacional de Matematica Pura e Aplicada, 2017, pp. 299–325, doi:10.30757/ALEA.v14-17.
short: P. Ferrari, P. Nejjar, Revista Latino-Americana de Probabilidade e Estatística
9 (2017) 299–325.
corr_author: '1'
date_created: 2018-12-11T11:46:31Z
date_published: 2017-03-23T00:00:00Z
date_updated: 2025-09-18T10:02:36Z
day: '23'
department:
- _id: LaEr
- _id: JaMa
doi: 10.30757/ALEA.v14-17
ec_funded: 1
external_id:
isi:
- '000404011700017'
intvolume: ' 9'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://alea.impa.br/articles/v14/14-17.pdf
month: '03'
oa: 1
oa_version: Submitted Version
page: 299 - 325
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Revista Latino-Americana de Probabilidade e Estatística
publication_status: published
publisher: Instituto Nacional de Matematica Pura e Aplicada
publist_id: '7376'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fluctuations of the competition interface in presence of shocks
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9
year: '2017'
...
---
_id: '452'
abstract:
- lang: eng
text: 'Spinning tops and yo-yos have long fascinated cultures around the world with
their unexpected, graceful motions that seemingly elude gravity. Yet, due to the
exceeding difficulty of creating stably spinning objects of asymmetric shape in
a manual trial-and-error process, there has been little departure from rotationally
symmetric designs. With modern 3D printing technologies, however, we can manufacture
shapes of almost unbounded complexity at the press of a button, shifting this
design complexity toward computation. In this article, we describe an algorithm
to generate designs for spinning objects by optimizing their mass distribution:
as input, the user provides a solid 3D model and a desired axis of rotation. Our
approach then modifies the interior mass distribution such that the principal
directions of the moment of inertia align with the target rotation frame. To create
voids inside the model, we represent its volume with an adaptive multiresolution
voxelization and optimize the discrete voxel fill values using a continuous, nonlinear
formulation. We further optimize for rotational stability by maximizing the dominant
principal moment. Our method is well-suited for a variety of 3D printed models,
ranging from characters to abstract shapes. We demonstrate tops and yo-yos that
spin surprisingly stably despite their asymmetric appearance.'
acknowledgement: "This project was supported in part by the ERC Starting Grant iModel
(StG-2012-306877). Emily Whiting was supported by the ETH Zurich/Marie Curie COFUND
Postdoctoral Fellowship. \r\nFirst and foremost, we would like to thank our editor
Steve Marschner for his invaluable feedback. We were fortunate to get further help
from Maurizio Nitti for model design, Romain Prévost for Make-It-Stand comparisons,
Alexander Sorkine-Hornung, Kaan Yücer, and Changil Kim for video and photo assistance,
Ronnie Gänsli for metal casting, Alec Jacobson for the posed Elephant and Armadillo
models, and Romain Prévost and Amit Bermano for print preparation. Model sources
include: Woven Ring: generated by “Sculpture Generator 1” by Carlo H. Séquin, UC
Berkeley; Elephant: De Espona model library, courtesy of Robert Sumner; T-Rex: TurboSquid;
Armadillo: Stanford Computer Graphics Laboratory; and Utah Teapot: Martin Newell,
University of Utah. "
article_processing_charge: No
article_type: original
author:
- first_name: Moritz
full_name: Bächer, Moritz
last_name: Bächer
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Emily
full_name: Whiting, Emily
last_name: Whiting
- first_name: Olga
full_name: Sorkine Hornung, Olga
last_name: Sorkine Hornung
citation:
ama: 'Bächer M, Bickel B, Whiting E, Sorkine Hornung O. Spin it: Optimizing moment
of inertia for spinnable objects. Communications of the ACM. 2017;60(8):92-99.
doi:10.1145/3068766'
apa: 'Bächer, M., Bickel, B., Whiting, E., & Sorkine Hornung, O. (2017). Spin
it: Optimizing moment of inertia for spinnable objects. Communications of the
ACM. ACM. https://doi.org/10.1145/3068766'
chicago: 'Bächer, Moritz, Bernd Bickel, Emily Whiting, and Olga Sorkine Hornung.
“Spin It: Optimizing Moment of Inertia for Spinnable Objects.” Communications
of the ACM. ACM, 2017. https://doi.org/10.1145/3068766.'
ieee: 'M. Bächer, B. Bickel, E. Whiting, and O. Sorkine Hornung, “Spin it: Optimizing
moment of inertia for spinnable objects,” Communications of the ACM, vol.
60, no. 8. ACM, pp. 92–99, 2017.'
ista: 'Bächer M, Bickel B, Whiting E, Sorkine Hornung O. 2017. Spin it: Optimizing
moment of inertia for spinnable objects. Communications of the ACM. 60(8), 92–99.'
mla: 'Bächer, Moritz, et al. “Spin It: Optimizing Moment of Inertia for Spinnable
Objects.” Communications of the ACM, vol. 60, no. 8, ACM, 2017, pp. 92–99,
doi:10.1145/3068766.'
short: M. Bächer, B. Bickel, E. Whiting, O. Sorkine Hornung, Communications of the
ACM 60 (2017) 92–99.
date_created: 2018-12-11T11:46:33Z
date_published: 2017-08-01T00:00:00Z
date_updated: 2025-08-05T14:20:24Z
day: '01'
department:
- _id: BeBi
doi: 10.1145/3068766
intvolume: ' 60'
issue: '8'
language:
- iso: eng
month: '08'
oa_version: None
page: 92 - 99
publication: Communications of the ACM
publication_status: published
publisher: ACM
publist_id: '7370'
quality_controlled: '1'
related_material:
record:
- id: '2080'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: 'Spin it: Optimizing moment of inertia for spinnable objects'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 60
year: '2017'
...
---
OA_place: publisher
OA_type: hybrid
_id: '453'
abstract:
- lang: eng
text: Most kinesin motors move in only one direction along microtubules. Members
of the kinesin-5 subfamily were initially described as unidirectional plus-end-directed
motors and shown to produce piconewton forces. However, some fungal kinesin-5
motors are bidirectional. The force production of a bidirectional kinesin-5 has
not yet been measured. Therefore, it remains unknown whether the mechanism of
the unconventional minus-end-directed motility differs fundamentally from that
of plus-end-directed stepping. Using force spectroscopy, we have measured here
the forces that ensembles of purified budding yeast kinesin-5 Cin8 produce in
microtubule gliding assays in both plus- and minus-end direction. Correlation
analysis of pause forces demonstrated that individual Cin8 molecules produce additive
forces in both directions of movement. In ensembles, Cin8 motors were able to
produce single-motor forces up to a magnitude of ∼1.5 pN. Hence, these properties
appear to be conserved within the kinesin-5 subfamily. Force production was largely
independent of the directionality of movement, indicating similarities between
the motility mechanisms for both directions. These results provide constraints
for the development of models for the bidirectional motility mechanism of fission
yeast kinesin-5 and provide insight into the function of this mitotic motor.
acknowledgement: 'The plasmid for full-length kinesin-1 was a gift from G. Holzwarth
and J. Macosko with permission from J. Howard. We thank I. Lueke and N. I. Cade
for technical assistance. G.P. thanks the Francis Crick Institute, and in particular
the Surrey and Salbreux groups, for their hospitality during his sabbatical stay,
as well as Imperial College London for making it possible. This work was supported
by the Francis Crick Institute, which receives its core funding from Cancer Research
UK (FC001163), the United Kingdom Medical Research Council (FC001163), and the Wellcome
Trust (FC001163), and by Imperial College London. J.R. was also supported by a Sir
Henry Wellcome Postdoctoral Fellowship (100145/Z/12/Z) and T.S. by the European
Research Council (Advanced Grant, project 323042). '
article_processing_charge: No
article_type: original
author:
- first_name: Todd
full_name: Fallesen, Todd
last_name: Fallesen
- first_name: Johanna
full_name: Roostalu, Johanna
last_name: Roostalu
- first_name: Christian F
full_name: Düllberg, Christian F
id: 459064DC-F248-11E8-B48F-1D18A9856A87
last_name: Düllberg
orcid: 0000-0001-6335-9748
- first_name: Gunnar
full_name: Pruessner, Gunnar
last_name: Pruessner
- first_name: Thomas
full_name: Surrey, Thomas
last_name: Surrey
citation:
ama: Fallesen T, Roostalu J, Düllberg CF, Pruessner G, Surrey T. Ensembles of bidirectional
kinesin Cin8 produce additive forces in both directions of movement. Biophysical
Journal. 2017;113(9):2055-2067. doi:10.1016/j.bpj.2017.09.006
apa: Fallesen, T., Roostalu, J., Düllberg, C. F., Pruessner, G., & Surrey, T.
(2017). Ensembles of bidirectional kinesin Cin8 produce additive forces in both
directions of movement. Biophysical Journal. Biophysical Society. https://doi.org/10.1016/j.bpj.2017.09.006
chicago: Fallesen, Todd, Johanna Roostalu, Christian F Düllberg, Gunnar Pruessner,
and Thomas Surrey. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive Forces
in Both Directions of Movement.” Biophysical Journal. Biophysical Society,
2017. https://doi.org/10.1016/j.bpj.2017.09.006.
ieee: T. Fallesen, J. Roostalu, C. F. Düllberg, G. Pruessner, and T. Surrey, “Ensembles
of bidirectional kinesin Cin8 produce additive forces in both directions of movement,”
Biophysical Journal, vol. 113, no. 9. Biophysical Society, pp. 2055–2067,
2017.
ista: Fallesen T, Roostalu J, Düllberg CF, Pruessner G, Surrey T. 2017. Ensembles
of bidirectional kinesin Cin8 produce additive forces in both directions of movement.
Biophysical Journal. 113(9), 2055–2067.
mla: Fallesen, Todd, et al. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive
Forces in Both Directions of Movement.” Biophysical Journal, vol. 113,
no. 9, Biophysical Society, 2017, pp. 2055–67, doi:10.1016/j.bpj.2017.09.006.
short: T. Fallesen, J. Roostalu, C.F. Düllberg, G. Pruessner, T. Surrey, Biophysical
Journal 113 (2017) 2055–2067.
date_created: 2018-12-11T11:46:33Z
date_published: 2017-11-07T00:00:00Z
date_updated: 2025-08-05T14:08:52Z
day: '07'
ddc:
- '570'
department:
- _id: MaLo
doi: 10.1016/j.bpj.2017.09.006
external_id:
pmid:
- '29117528'
file:
- access_level: open_access
checksum: 99a2474088e20ac74b1882c4fbbb45b1
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:03Z
date_updated: 2020-07-14T12:46:31Z
file_id: '5052'
file_name: IST-2018-965-v1+1_2017_Duellberg_Ensembles_of.pdf
file_size: 977192
relation: main_file
file_date_updated: 2020-07-14T12:46:31Z
has_accepted_license: '1'
intvolume: ' 113'
issue: '9'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 2055 - 2067
pmid: 1
publication: Biophysical Journal
publication_identifier:
eissn:
- 1542-0086
issn:
- 0006-3495
publication_status: published
publisher: Biophysical Society
publist_id: '7369'
pubrep_id: '965'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions
of movement
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: 113
year: '2017'
...
---
_id: '459'
abstract:
- lang: eng
text: The social insects bees, wasps, ants, and termites are species-rich, occur
in many habitats, and often constitute a large part of the biomass. Many are also
invasive, including species of termites, the red imported fire ant, and the Argentine
ant. While invasive social insects have been a problem in Southern Europe for
some time, Central Europa was free of invasive ant species until recently because
most ants are adapted to warmer climates. Only in the 1990s, did Lasius neglectus,
a close relative of the common black garden ant, arrive in Germany. First described
in 1990 based on individuals collected in Budapest, the species has since been
detected for example in France, Germany, Spain, England, and Kyrgyzstan. The species
is spread with soil during construction work or plantings, and L. neglectus therefore
is often found in parks and botanical gardens. Another invasive ant now spreading
in southern Germany is Formica fuscocinerea, which occurs along rivers, including
in the sandy floodplains of the river Isar. As is typical of pioneer species,
F. fuscocinerea quickly becomes extremely abundant and therefore causes problems
for example on playgrounds in Munich. All invasive ant species are characterized
by cooperation across nests, leading to strongly interconnected, very large super-colonies.
The resulting dominance results in the extinction of native ant species as well
as other arthropod species and thus in the reduction of biodiversity.
article_processing_charge: No
author:
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: 'Cremer S. Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische
Fauna verändern. Rundgespräche Forum Ökologie. 2017;46:105-116.'
apa: 'Cremer, S. (2017). Invasive Ameisen in Europa: Wie sie sich ausbreiten und
die heimische Fauna verändern. Rundgespräche Forum Ökologie. Verlag Dr.
Friedrich Pfeil.'
chicago: 'Cremer, Sylvia. “Invasive Ameisen in Europa: Wie Sie Sich Ausbreiten Und
Die Heimische Fauna Verändern.” Rundgespräche Forum Ökologie. Verlag Dr.
Friedrich Pfeil, 2017.'
ieee: 'S. Cremer, “Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische
Fauna verändern,” Rundgespräche Forum Ökologie, vol. 46. Verlag Dr. Friedrich
Pfeil, pp. 105–116, 2017.'
ista: 'Cremer S. 2017. Invasive Ameisen in Europa: Wie sie sich ausbreiten und die
heimische Fauna verändern. Rundgespräche Forum Ökologie. 46, 105–116.'
mla: 'Cremer, Sylvia. “Invasive Ameisen in Europa: Wie Sie Sich Ausbreiten Und Die
Heimische Fauna Verändern.” Rundgespräche Forum Ökologie, vol. 46, Verlag
Dr. Friedrich Pfeil, 2017, pp. 105–16.'
short: S. Cremer, Rundgespräche Forum Ökologie 46 (2017) 105–116.
corr_author: '1'
date_created: 2018-12-11T11:46:35Z
date_published: 2017-04-04T00:00:00Z
date_updated: 2024-10-09T20:58:13Z
day: '04'
ddc:
- '592'
department:
- _id: SyCr
file:
- access_level: open_access
checksum: 4919baf9050415ca151fe22497379f78
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:52Z
date_updated: 2020-07-14T12:46:32Z
file_id: '5175'
file_name: IST-2018-962-v1+1_044676698_07_Cremer__Invasive_Ameisen_in_Europa_...__BY-ND_.pdf
file_size: 1711131
relation: main_file
file_date_updated: 2020-07-14T12:46:32Z
has_accepted_license: '1'
intvolume: ' 46'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nd/4.0/
month: '04'
oa: 1
oa_version: Published Version
page: 105 - 116
publication: Rundgespräche Forum Ökologie
publication_identifier:
issn:
- 2366-2875
publication_status: published
publisher: Verlag Dr. Friedrich Pfeil
publist_id: '7362'
pubrep_id: '962'
quality_controlled: '1'
status: public
title: 'Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische Fauna
verändern'
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 46
year: '2017'
...
---
OA_place: repository
OA_type: green
_id: '12193'
abstract:
- lang: eng
text: DNA methylation regulates eukaryotic gene expression and is extensively reprogrammed
during animal development. However, whether developmental methylation reprogramming
during the sporophytic life cycle of flowering plants regulates genes is presently
unknown. Here we report a distinctive gene-targeted RNA-directed DNA methylation
(RdDM) activity in the Arabidopsis thaliana male sexual lineage that regulates
gene expression in meiocytes. Loss of sexual-lineage-specific RdDM causes mis-splicing
of the MPS1 gene (also known as PRD2), thereby disrupting meiosis. Our results
establish a regulatory paradigm in which de novo methylation creates a cell-lineage-specific
epigenetic signature that controls gene expression and contributes to cellular
function in flowering plants.
acknowledgement: We thank Daniel Zilberman for intellectual contributions to this
work and assistance with manuscript preparation. We also thank Caroline Dean, Kirsten
Bomblies, Vinod Kumar, Siobhan Brady and Sophien Kamoun for comments on the manuscript,
Hugh Dickinson and Josephine Hellberg for developing the meiocyte isolation method,
Giles Oldroyd for the pGWB13-Bar vector, Elisa Fiume for the pMDC107-NTF vector,
Matthew Hartley, Matthew Couchman and Tjelvar Sten Gunnar Olsson for bioinformatics
support, and the John Innes Centre Bioimaging Facility (Elaine Barclay and Grant
Calder) for their assistance with microscopy. This work was funded by a Biotechnology
and Biological Sciences Research Council (BBSRC) David Phillips Fellowship (BBL0250431)
to X.F., a BBSRC grant (BBM01973X1) to J.H., and a Sainsbury PhD Studentship to
J.W.
article_processing_charge: No
article_type: original
author:
- first_name: James
full_name: Walker, James
last_name: Walker
- first_name: Hongbo
full_name: Gao, Hongbo
last_name: Gao
- first_name: Jingyi
full_name: Zhang, Jingyi
last_name: Zhang
- first_name: Billy
full_name: Aldridge, Billy
last_name: Aldridge
- first_name: Martin
full_name: Vickers, Martin
last_name: Vickers
- first_name: James D.
full_name: Higgins, James D.
last_name: Higgins
- first_name: Xiaoqi
full_name: Feng, Xiaoqi
id: e0164712-22ee-11ed-b12a-d80fcdf35958
last_name: Feng
orcid: 0000-0002-4008-1234
citation:
ama: Walker J, Gao H, Zhang J, et al. Sexual-lineage-specific DNA methylation regulates
meiosis in Arabidopsis. Nature Genetics. 2017;50(1):130-137. doi:10.1038/s41588-017-0008-5
apa: Walker, J., Gao, H., Zhang, J., Aldridge, B., Vickers, M., Higgins, J. D.,
& Feng, X. (2017). Sexual-lineage-specific DNA methylation regulates meiosis
in Arabidopsis. Nature Genetics. Nature Research. https://doi.org/10.1038/s41588-017-0008-5
chicago: Walker, James, Hongbo Gao, Jingyi Zhang, Billy Aldridge, Martin Vickers,
James D. Higgins, and Xiaoqi Feng. “Sexual-Lineage-Specific DNA Methylation Regulates
Meiosis in Arabidopsis.” Nature Genetics. Nature Research, 2017. https://doi.org/10.1038/s41588-017-0008-5.
ieee: J. Walker et al., “Sexual-lineage-specific DNA methylation regulates
meiosis in Arabidopsis,” Nature Genetics, vol. 50, no. 1. Nature Research,
pp. 130–137, 2017.
ista: Walker J, Gao H, Zhang J, Aldridge B, Vickers M, Higgins JD, Feng X. 2017.
Sexual-lineage-specific DNA methylation regulates meiosis in Arabidopsis. Nature
Genetics. 50(1), 130–137.
mla: Walker, James, et al. “Sexual-Lineage-Specific DNA Methylation Regulates Meiosis
in Arabidopsis.” Nature Genetics, vol. 50, no. 1, Nature Research, 2017,
pp. 130–37, doi:10.1038/s41588-017-0008-5.
short: J. Walker, H. Gao, J. Zhang, B. Aldridge, M. Vickers, J.D. Higgins, X. Feng,
Nature Genetics 50 (2017) 130–137.
date_created: 2023-01-16T09:18:05Z
date_published: 2017-12-18T00:00:00Z
date_updated: 2026-03-19T10:51:18Z
day: '18'
department:
- _id: XiFe
doi: 10.1038/s41588-017-0008-5
extern: '1'
external_id:
pmid:
- '29255257'
intvolume: ' 50'
issue: '1'
keyword:
- Genetics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7611288/
month: '12'
oa: 1
oa_version: Submitted Version
page: 130-137
pmid: 1
publication: Nature Genetics
publication_identifier:
eissn:
- 1546-1718
issn:
- 1061-4036
publication_status: published
publisher: Nature Research
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sexual-lineage-specific DNA methylation regulates meiosis in Arabidopsis
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 50
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
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: '1194'
abstract:
- lang: eng
text: 'Termination is one of the basic liveness properties, and we study the termination
problem for probabilistic programs with real-valued variables. Previous works
focused on the qualitative problem that asks whether an input program terminates
with probability~1 (almost-sure termination). A powerful approach for this qualitative
problem is the notion of ranking supermartingales with respect to a given set
of invariants. The quantitative problem (probabilistic termination) asks for bounds
on the termination probability. A fundamental and conceptual drawback of the existing
approaches to address probabilistic termination is that even though the supermartingales
consider the probabilistic behavior of the programs, the invariants are obtained
completely ignoring the probabilistic aspect. In this work we address the probabilistic
termination problem for linear-arithmetic probabilistic programs with nondeterminism.
We define the notion of {\em stochastic invariants}, which are constraints along
with a probability bound that the constraints hold. We introduce a concept of
{\em repulsing supermartingales}. First, we show that repulsing supermartingales
can be used to obtain bounds on the probability of the stochastic invariants.
Second, we show the effectiveness of repulsing supermartingales in the following
three ways: (1)~With a combination of ranking and repulsing supermartingales we
can compute lower bounds on the probability of termination; (2)~repulsing supermartingales
provide witnesses for refutation of almost-sure termination; and (3)~with a combination
of ranking and repulsing supermartingales we can establish persistence properties
of probabilistic programs. We also present results on related computational problems
and an experimental evaluation of our approach on academic examples. '
alternative_title:
- ACM SIGPLAN Notices
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Petr
full_name: Novotny, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotny
- first_name: Djordje
full_name: Zikelic, Djordje
last_name: Zikelic
citation:
ama: 'Chatterjee K, Novotný P, Zikelic D. Stochastic invariants for probabilistic
termination. In: Vol 52. ACM; 2017:145-160. doi:10.1145/3009837.3009873'
apa: 'Chatterjee, K., Novotný, P., & Zikelic, D. (2017). Stochastic invariants
for probabilistic termination (Vol. 52, pp. 145–160). Presented at the POPL: Principles
of Programming Languages, Paris, France: ACM. https://doi.org/10.1145/3009837.3009873'
chicago: Chatterjee, Krishnendu, Petr Novotný, and Djordje Zikelic. “Stochastic
Invariants for Probabilistic Termination,” 52:145–60. ACM, 2017. https://doi.org/10.1145/3009837.3009873.
ieee: 'K. Chatterjee, P. Novotný, and D. Zikelic, “Stochastic invariants for probabilistic
termination,” presented at the POPL: Principles of Programming Languages, Paris,
France, 2017, vol. 52, no. 1, pp. 145–160.'
ista: 'Chatterjee K, Novotný P, Zikelic D. 2017. Stochastic invariants for probabilistic
termination. POPL: Principles of Programming Languages, ACM SIGPLAN Notices, vol.
52, 145–160.'
mla: Chatterjee, Krishnendu, et al. Stochastic Invariants for Probabilistic Termination.
Vol. 52, no. 1, ACM, 2017, pp. 145–60, doi:10.1145/3009837.3009873.
short: K. Chatterjee, P. Novotný, D. Zikelic, in:, ACM, 2017, pp. 145–160.
conference:
end_date: 2017-01-21
location: Paris, France
name: 'POPL: Principles of Programming Languages'
start_date: 2017-01-15
date_created: 2018-12-11T11:50:39Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2026-04-07T13:27:56Z
day: '01'
department:
- _id: KrCh
doi: 10.1145/3009837.3009873
ec_funded: 1
external_id:
arxiv:
- '1611.01063'
isi:
- '000408311200013'
intvolume: ' 52'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1611.01063
month: '01'
oa: 1
oa_version: Submitted Version
page: 145 - 160
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_identifier:
issn:
- 0730-8566
publication_status: published
publisher: ACM
publist_id: '6157'
quality_controlled: '1'
related_material:
record:
- id: '14539'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Stochastic invariants for probabilistic termination
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 52
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'
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: '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
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: '1120'
abstract:
- lang: eng
text: 'The existence of a self-localization transition in the polaron problem has
been under an active debate ever since Landau suggested it 83 years ago. Here
we reveal the self-localization transition for the rotational analogue of the
polaron -- the angulon quasiparticle. We show that, unlike for the polarons, self-localization
of angulons occurs at finite impurity-bath coupling already at the mean-field
level. The transition is accompanied by the spherical-symmetry breaking of the
angulon ground state and a discontinuity in the first derivative of the ground-state
energy. Moreover, the type of the symmetry breaking is dictated by the symmetry
of the microscopic impurity-bath interaction, which leads to a number of distinct
self-localized states. The predicted effects can potentially be addressed in experiments
on cold molecules trapped in superfluid helium droplets and ultracold quantum
gases, as well as on electronic excitations in solids and Bose-Einstein condensates. '
article_number: '033608'
article_processing_charge: No
arxiv: 1
author:
- first_name: Xiang
full_name: Li, Xiang
id: 4B7E523C-F248-11E8-B48F-1D18A9856A87
last_name: Li
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Li X, Seiringer R, Lemeshko M. Angular self-localization of impurities rotating
in a bosonic bath. Physical Review A. 2017;95(3). doi:10.1103/PhysRevA.95.033608
apa: Li, X., Seiringer, R., & Lemeshko, M. (2017). Angular self-localization
of impurities rotating in a bosonic bath. Physical Review A. American Physical
Society. https://doi.org/10.1103/PhysRevA.95.033608
chicago: Li, Xiang, Robert Seiringer, and Mikhail Lemeshko. “Angular Self-Localization
of Impurities Rotating in a Bosonic Bath.” Physical Review A. American
Physical Society, 2017. https://doi.org/10.1103/PhysRevA.95.033608.
ieee: X. Li, R. Seiringer, and M. Lemeshko, “Angular self-localization of impurities
rotating in a bosonic bath,” Physical Review A, vol. 95, no. 3. American
Physical Society, 2017.
ista: Li X, Seiringer R, Lemeshko M. 2017. Angular self-localization of impurities
rotating in a bosonic bath. Physical Review A. 95(3), 033608.
mla: Li, Xiang, et al. “Angular Self-Localization of Impurities Rotating in a Bosonic
Bath.” Physical Review A, vol. 95, no. 3, 033608, American Physical Society,
2017, doi:10.1103/PhysRevA.95.033608.
short: X. Li, R. Seiringer, M. Lemeshko, Physical Review A 95 (2017).
date_created: 2018-12-11T11:50:15Z
date_published: 2017-03-06T00:00:00Z
date_updated: 2026-04-08T07:26:09Z
day: '06'
department:
- _id: MiLe
- _id: RoSe
doi: 10.1103/PhysRevA.95.033608
ec_funded: 1
external_id:
arxiv:
- '1610.04908'
isi:
- '000395981900009'
intvolume: ' 95'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1610.04908
month: '03'
oa: 1
oa_version: Published Version
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
- _id: 25C878CE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P27533_N27
name: Structure of the Excitation Spectrum for Many-Body Quantum Systems
- _id: 26031614-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P29902
name: Quantum rotations in the presence of a many-body environment
publication: Physical Review A
publication_identifier:
issn:
- 2469-9926
publication_status: published
publisher: American Physical Society
publist_id: '6242'
quality_controlled: '1'
related_material:
record:
- id: '8958'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Angular self-localization of impurities rotating in a bosonic bath
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 95
year: '2017'
...
---
_id: '911'
abstract:
- lang: eng
text: We develop a probabilistic technique for colorizing grayscale natural images.
In light of the intrinsic uncertainty of this task, the proposed probabilistic
framework has numerous desirable properties. In particular, our model is able
to produce multiple plausible and vivid colorizations for a given grayscale image
and is one of the first colorization models to provide a proper stochastic sampling
scheme. Moreover, our training procedure is supported by a rigorous theoretical
framework that does not require any ad hoc heuristics and allows for efficient
modeling and learning of the joint pixel color distribution.We demonstrate strong
quantitative and qualitative experimental results on the CIFAR-10 dataset and
the challenging ILSVRC 2012 dataset.
article_processing_charge: No
arxiv: 1
author:
- first_name: Amélie
full_name: Royer, Amélie
id: 3811D890-F248-11E8-B48F-1D18A9856A87
last_name: Royer
orcid: 0000-0002-8407-0705
- first_name: Alexander
full_name: Kolesnikov, Alexander
id: 2D157DB6-F248-11E8-B48F-1D18A9856A87
last_name: Kolesnikov
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Royer A, Kolesnikov A, Lampert C. Probabilistic image colorization. In: BMVA
Press; 2017:85.1-85.12. doi:10.5244/c.31.85'
apa: 'Royer, A., Kolesnikov, A., & Lampert, C. (2017). Probabilistic image colorization
(p. 85.1-85.12). Presented at the BMVC: British Machine Vision Conference, London,
United Kingdom: BMVA Press. https://doi.org/10.5244/c.31.85'
chicago: Royer, Amélie, Alexander Kolesnikov, and Christoph Lampert. “Probabilistic
Image Colorization,” 85.1-85.12. BMVA Press, 2017. https://doi.org/10.5244/c.31.85.
ieee: 'A. Royer, A. Kolesnikov, and C. Lampert, “Probabilistic image colorization,”
presented at the BMVC: British Machine Vision Conference, London, United Kingdom,
2017, p. 85.1-85.12.'
ista: 'Royer A, Kolesnikov A, Lampert C. 2017. Probabilistic image colorization.
BMVC: British Machine Vision Conference, 85.1-85.12.'
mla: Royer, Amélie, et al. Probabilistic Image Colorization. BMVA Press,
2017, p. 85.1-85.12, doi:10.5244/c.31.85.
short: A. Royer, A. Kolesnikov, C. Lampert, in:, BMVA Press, 2017, p. 85.1-85.12.
conference:
end_date: 2017-09-07
location: London, United Kingdom
name: 'BMVC: British Machine Vision Conference'
start_date: 2017-09-04
corr_author: '1'
date_created: 2018-12-11T11:49:09Z
date_published: 2017-09-01T00:00:00Z
date_updated: 2026-04-08T07:26:44Z
day: '01'
ddc:
- '000'
department:
- _id: ChLa
doi: 10.5244/c.31.85
ec_funded: 1
external_id:
arxiv:
- '1705.04258'
file:
- access_level: open_access
content_type: application/pdf
creator: dernst
date_created: 2020-08-10T07:14:33Z
date_updated: 2020-08-10T07:14:33Z
file_id: '8224'
file_name: 2017_BMVC_Royer.pdf
file_size: 1625363
relation: main_file
success: 1
file_date_updated: 2020-08-10T07:14:33Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 85.1-85.12
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_identifier:
eisbn:
- 190172560X
publication_status: published
publisher: BMVA Press
publist_id: '6532'
quality_controlled: '1'
related_material:
record:
- id: '8390'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Probabilistic image colorization
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '647'
abstract:
- lang: eng
text: Despite researchers’ efforts in the last couple of decades, reachability analysis
is still a challenging problem even for linear hybrid systems. Among the existing
approaches, the most practical ones are mainly based on bounded-time reachable
set over-approximations. For the purpose of unbounded-time analysis, one important
strategy is to abstract the original system and find an invariant for the abstraction.
In this paper, we propose an approach to constructing a new kind of abstraction
called conic abstraction for affine hybrid systems, and to computing reachable
sets based on this abstraction. The essential feature of a conic abstraction is
that it partitions the state space of a system into a set of convex polyhedral
cones which is derived from a uniform conic partition of the derivative space.
Such a set of polyhedral cones is able to cut all trajectories of the system into
almost straight segments so that every segment of a reach pipe in a polyhedral
cone tends to be straight as well, and hence can be over-approximated tightly
by polyhedra using similar techniques as HyTech or PHAVer. In particular, for
diagonalizable affine systems, our approach can guarantee to find an invariant
for unbounded reachable sets, which is beyond the capability of bounded-time reachability
analysis tools. We implemented the approach in a tool and experiments on benchmarks
show that our approach is more powerful than SpaceEx and PHAVer in dealing with
diagonalizable systems.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Sergiy
full_name: Bogomolov, Sergiy
id: 369D9A44-F248-11E8-B48F-1D18A9856A87
last_name: Bogomolov
orcid: 0000-0002-0686-0365
- first_name: Mirco
full_name: Giacobbe, Mirco
id: 3444EA5E-F248-11E8-B48F-1D18A9856A87
last_name: Giacobbe
orcid: 0000-0001-8180-0904
- 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: Hui
full_name: Kong, Hui
id: 3BDE25AA-F248-11E8-B48F-1D18A9856A87
last_name: Kong
orcid: 0000-0002-3066-6941
citation:
ama: 'Bogomolov S, Giacobbe M, Henzinger TA, Kong H. Conic abstractions for hybrid
systems. In: Vol 10419. Springer; 2017:116-132. doi:10.1007/978-3-319-65765-3_7'
apa: 'Bogomolov, S., Giacobbe, M., Henzinger, T. A., & Kong, H. (2017). Conic
abstractions for hybrid systems (Vol. 10419, pp. 116–132). Presented at the FORMATS:
Formal Modelling and Analysis of Timed Systems, Berlin, Germany: Springer. https://doi.org/10.1007/978-3-319-65765-3_7'
chicago: Bogomolov, Sergiy, Mirco Giacobbe, Thomas A Henzinger, and Hui Kong. “Conic
Abstractions for Hybrid Systems,” 10419:116–32. Springer, 2017. https://doi.org/10.1007/978-3-319-65765-3_7.
ieee: 'S. Bogomolov, M. Giacobbe, T. A. Henzinger, and H. Kong, “Conic abstractions
for hybrid systems,” presented at the FORMATS: Formal Modelling and Analysis of
Timed Systems, Berlin, Germany, 2017, vol. 10419, pp. 116–132.'
ista: 'Bogomolov S, Giacobbe M, Henzinger TA, Kong H. 2017. Conic abstractions for
hybrid systems. FORMATS: Formal Modelling and Analysis of Timed Systems, LNCS,
vol. 10419, 116–132.'
mla: Bogomolov, Sergiy, et al. Conic Abstractions for Hybrid Systems. Vol.
10419, Springer, 2017, pp. 116–32, doi:10.1007/978-3-319-65765-3_7.
short: S. Bogomolov, M. Giacobbe, T.A. Henzinger, H. Kong, in:, Springer, 2017,
pp. 116–132.
conference:
end_date: 2017-09-07
location: Berlin, Germany
name: 'FORMATS: Formal Modelling and Analysis of Timed Systems'
start_date: 2017-09-05
corr_author: '1'
date_created: 2018-12-11T11:47:41Z
date_published: 2017-09-01T00:00:00Z
date_updated: 2026-04-08T07:47:13Z
day: '01'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.1007/978-3-319-65765-3_7
external_id:
isi:
- '000611678300007'
file:
- access_level: open_access
checksum: faf546914ba29bcf9974ee36b6b16750
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:38Z
date_updated: 2020-07-14T12:47:31Z
file_id: '4956'
file_name: IST-2017-831-v1+1_main.pdf
file_size: 3806864
relation: main_file
file_date_updated: 2020-07-14T12:47:31Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 116 - 132
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: '7129'
pubrep_id: '831'
quality_controlled: '1'
related_material:
record:
- id: '6894'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Conic abstractions for hybrid systems
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: '10419 '
year: '2017'
...
---
_id: '631'
abstract:
- lang: eng
text: Template polyhedra generalize intervals and octagons to polyhedra whose facets
are orthogonal to a given set of arbitrary directions. They have been employed
in the abstract interpretation of programs and, with particular success, in the
reachability analysis of hybrid automata. While previously, the choice of directions
has been left to the user or a heuristic, we present a method for the automatic
discovery of directions that generalize and eliminate spurious counterexamples.
We show that for the class of convex hybrid automata, i.e., hybrid automata with
(possibly nonlinear) convex constraints on derivatives, such directions always
exist and can be found using convex optimization. We embed our method inside a
CEGAR loop, thus enabling the time-unbounded reachability analysis of an important
and richer class of hybrid automata than was previously possible. We evaluate
our method on several benchmarks, demonstrating also its superior efficiency for
the special case of linear hybrid automata.
acknowledgement: This research was supported in part by the Austrian Science Fund
(FWF) under grants S11402-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), by
the European Commission under grant 643921 (UnCoVerCPS), and by the ARC project
DP140104219 (Robust AI Planning for Hybrid Systems).
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Sergiy
full_name: Bogomolov, Sergiy
id: 369D9A44-F248-11E8-B48F-1D18A9856A87
last_name: Bogomolov
orcid: 0000-0002-0686-0365
- first_name: Goran
full_name: Frehse, Goran
last_name: Frehse
- first_name: Mirco
full_name: Giacobbe, Mirco
id: 3444EA5E-F248-11E8-B48F-1D18A9856A87
last_name: Giacobbe
orcid: 0000-0001-8180-0904
- 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: 'Bogomolov S, Frehse G, Giacobbe M, Henzinger TA. Counterexample guided refinement
of template polyhedra. In: Vol 10205. Springer; 2017:589-606. doi:10.1007/978-3-662-54577-5_34'
apa: 'Bogomolov, S., Frehse, G., Giacobbe, M., & Henzinger, T. A. (2017). Counterexample
guided refinement of template polyhedra (Vol. 10205, pp. 589–606). Presented at
the TACAS: Tools and Algorithms for the Construction and Analysis of Systems,
Uppsala, Sweden: Springer. https://doi.org/10.1007/978-3-662-54577-5_34'
chicago: Bogomolov, Sergiy, Goran Frehse, Mirco Giacobbe, and Thomas A Henzinger.
“Counterexample Guided Refinement of Template Polyhedra,” 10205:589–606. Springer,
2017. https://doi.org/10.1007/978-3-662-54577-5_34.
ieee: 'S. Bogomolov, G. Frehse, M. Giacobbe, and T. A. Henzinger, “Counterexample
guided refinement of template polyhedra,” presented at the TACAS: Tools and Algorithms
for the Construction and Analysis of Systems, Uppsala, Sweden, 2017, vol. 10205,
pp. 589–606.'
ista: 'Bogomolov S, Frehse G, Giacobbe M, Henzinger TA. 2017. Counterexample guided
refinement of template polyhedra. TACAS: Tools and Algorithms for the Construction
and Analysis of Systems, LNCS, vol. 10205, 589–606.'
mla: Bogomolov, Sergiy, et al. Counterexample Guided Refinement of Template Polyhedra.
Vol. 10205, Springer, 2017, pp. 589–606, doi:10.1007/978-3-662-54577-5_34.
short: S. Bogomolov, G. Frehse, M. Giacobbe, T.A. Henzinger, in:, Springer, 2017,
pp. 589–606.
conference:
end_date: 2017-04-29
location: Uppsala, Sweden
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2017-04-22
corr_author: '1'
date_created: 2018-12-11T11:47:36Z
date_published: 2017-03-31T00:00:00Z
date_updated: 2026-04-08T07:47:13Z
day: '31'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-662-54577-5_34
external_id:
isi:
- '000440734900034'
file:
- access_level: open_access
checksum: f395d0d20102b89aeaad8b4ef4f18f4f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:41Z
date_updated: 2020-07-14T12:47:27Z
file_id: '4897'
file_name: IST-2017-741-v1+1_main.pdf
file_size: 569863
relation: main_file
- access_level: open_access
checksum: f416ee1ae4497b23ecdf28b1f18bb8df
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:42Z
date_updated: 2020-07-14T12:47:27Z
file_id: '4898'
file_name: IST-2018-741-v2+2_main.pdf
file_size: 563276
relation: main_file
file_date_updated: 2020-07-14T12:47:27Z
has_accepted_license: '1'
intvolume: ' 10205'
isi: 1
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
page: 589 - 606
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-366254576-8
publication_status: published
publisher: Springer
publist_id: '7162'
pubrep_id: '966'
quality_controlled: '1'
related_material:
record:
- id: '6894'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Counterexample guided refinement of template polyhedra
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 10205
year: '2017'
...
---
_id: '955'
abstract:
- lang: eng
text: 'Gene expression is controlled by networks of regulatory proteins that interact
specifically with external signals and DNA regulatory sequences. These interactions
force the network components to co-evolve so as to continually maintain function.
Yet, existing models of evolution mostly focus on isolated genetic elements. In
contrast, we study the essential process by which regulatory networks grow: the
duplication and subsequent specialization of network components. We synthesize
a biophysical model of molecular interactions with the evolutionary framework
to find the conditions and pathways by which new regulatory functions emerge.
We show that specialization of new network components is usually slow, but can
be drastically accelerated in the presence of regulatory crosstalk and mutations
that promote promiscuous interactions between network components.'
article_number: '216'
article_processing_charge: Yes (in subscription journal)
author:
- first_name: Tamar
full_name: Friedlander, Tamar
id: 36A5845C-F248-11E8-B48F-1D18A9856A87
last_name: Friedlander
- first_name: Roshan
full_name: Prizak, Roshan
id: 4456104E-F248-11E8-B48F-1D18A9856A87
last_name: Prizak
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
citation:
ama: Friedlander T, Prizak R, Barton NH, Tkačik G. Evolution of new regulatory functions
on biophysically realistic fitness landscapes. Nature Communications. 2017;8(1).
doi:10.1038/s41467-017-00238-8
apa: Friedlander, T., Prizak, R., Barton, N. H., & Tkačik, G. (2017). Evolution
of new regulatory functions on biophysically realistic fitness landscapes. Nature
Communications. Nature Publishing Group. https://doi.org/10.1038/s41467-017-00238-8
chicago: Friedlander, Tamar, Roshan Prizak, Nicholas H Barton, and Gašper Tkačik.
“Evolution of New Regulatory Functions on Biophysically Realistic Fitness Landscapes.”
Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/s41467-017-00238-8.
ieee: T. Friedlander, R. Prizak, N. H. Barton, and G. Tkačik, “Evolution of new
regulatory functions on biophysically realistic fitness landscapes,” Nature
Communications, vol. 8, no. 1. Nature Publishing Group, 2017.
ista: Friedlander T, Prizak R, Barton NH, Tkačik G. 2017. Evolution of new regulatory
functions on biophysically realistic fitness landscapes. Nature Communications.
8(1), 216.
mla: Friedlander, Tamar, et al. “Evolution of New Regulatory Functions on Biophysically
Realistic Fitness Landscapes.” Nature Communications, vol. 8, no. 1, 216,
Nature Publishing Group, 2017, doi:10.1038/s41467-017-00238-8.
short: T. Friedlander, R. Prizak, N.H. Barton, G. Tkačik, Nature Communications
8 (2017).
corr_author: '1'
date_created: 2018-12-11T11:49:23Z
date_published: 2017-08-09T00:00:00Z
date_updated: 2026-04-08T13:54:24Z
day: '09'
ddc:
- '539'
- '576'
department:
- _id: GaTk
- _id: NiBa
doi: 10.1038/s41467-017-00238-8
ec_funded: 1
external_id:
isi:
- '000407198800005'
file:
- access_level: open_access
checksum: 29a1b5db458048d3bd5c67e0e2a56818
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:14Z
date_updated: 2020-07-14T12:48:16Z
file_id: '5064'
file_name: IST-2017-864-v1+1_s41467-017-00238-8.pdf
file_size: 998157
relation: main_file
- access_level: open_access
checksum: 7b78401e52a576cf3e6bbf8d0abadc17
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:15Z
date_updated: 2020-07-14T12:48:16Z
file_id: '5065'
file_name: IST-2017-864-v1+2_41467_2017_238_MOESM1_ESM.pdf
file_size: 9715993
relation: main_file
file_date_updated: 2020-07-14T12:48:16Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
issue: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
- _id: 254E9036-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P28844-B27
name: Biophysics of information processing in gene regulation
publication: Nature Communications
publication_identifier:
issn:
- 2041-1723
publication_status: published
publisher: Nature Publishing Group
publist_id: '6459'
pubrep_id: '864'
quality_controlled: '1'
related_material:
record:
- id: '6071'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Evolution of new regulatory functions on biophysically realistic fitness landscapes
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: 8
year: '2017'
...
---
_id: '1144'
abstract:
- lang: eng
text: We show that matrix elements of functions of N × N Wigner matrices fluctuate
on a scale of order N−1/2 and we identify the limiting fluctuation. Our result
holds for any function f of the matrix that has bounded variation thus considerably
relaxing the regularity requirement imposed in [7, 11].
acknowledgement: Partially supported by the IST Austria Excellence Scholarship.
article_number: '86'
article_processing_charge: No
author:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Dominik J
full_name: Schröder, Dominik J
id: 408ED176-F248-11E8-B48F-1D18A9856A87
last_name: Schröder
orcid: 0000-0002-2904-1856
citation:
ama: Erdös L, Schröder DJ. Fluctuations of functions of Wigner matrices. Electronic
Communications in Probability. 2017;21. doi:10.1214/16-ECP38
apa: Erdös, L., & Schröder, D. J. (2017). Fluctuations of functions of Wigner
matrices. Electronic Communications in Probability. Institute of Mathematical
Statistics. https://doi.org/10.1214/16-ECP38
chicago: Erdös, László, and Dominik J Schröder. “Fluctuations of Functions of Wigner
Matrices.” Electronic Communications in Probability. Institute of Mathematical
Statistics, 2017. https://doi.org/10.1214/16-ECP38.
ieee: L. Erdös and D. J. Schröder, “Fluctuations of functions of Wigner matrices,”
Electronic Communications in Probability, vol. 21. Institute of Mathematical
Statistics, 2017.
ista: Erdös L, Schröder DJ. 2017. Fluctuations of functions of Wigner matrices.
Electronic Communications in Probability. 21, 86.
mla: Erdös, László, and Dominik J. Schröder. “Fluctuations of Functions of Wigner
Matrices.” Electronic Communications in Probability, vol. 21, 86, Institute
of Mathematical Statistics, 2017, doi:10.1214/16-ECP38.
short: L. Erdös, D.J. Schröder, Electronic Communications in Probability 21 (2017).
date_created: 2018-12-11T11:50:23Z
date_published: 2017-01-02T00:00:00Z
date_updated: 2026-04-08T13:55:03Z
day: '02'
ddc:
- '510'
department:
- _id: LaEr
doi: 10.1214/16-ECP38
ec_funded: 1
external_id:
isi:
- '000396604900037'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:10Z
date_updated: 2018-12-12T10:18:10Z
file_id: '5329'
file_name: IST-2017-747-v1+1_euclid.ecp.1483347665.pdf
file_size: 440770
relation: main_file
file_date_updated: 2018-12-12T10:18:10Z
has_accepted_license: '1'
intvolume: ' 21'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Electronic Communications in Probability
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '6214'
pubrep_id: '747'
quality_controlled: '1'
related_material:
record:
- id: '6179'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Fluctuations of functions of Wigner matrices
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 21
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'
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'
...