---
_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
date_created: 2018-12-11T11:46:26Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2023-10-17T12:31:15Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
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'
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: ' 70'
year: '2017'
...
---
_id: '443'
abstract:
- lang: eng
text: Pancreatic cancer has a five-year survival rate of ~8%, with characteristic
molecular heterogeneity and restricted treatment options. Targeting metabolism
has emerged as a potentially effective therapeutic strategy for cancers such as
pancreatic cancer, which are driven by genetic alterations that are not tractable
drug targets. Although somatic mitochondrial genome (mtDNA) mutations have been
observed in various tumors types, understanding of metabolic genotype-phenotype
relationships is limited.
author:
- first_name: Rae
full_name: Hardie, Rae
last_name: Hardie
- first_name: Ellen
full_name: Van Dam, Ellen
last_name: Van Dam
- first_name: Mark
full_name: Cowley, Mark
last_name: Cowley
- first_name: Ting
full_name: Han, Ting
last_name: Han
- first_name: Seher
full_name: Balaban, Seher
last_name: Balaban
- first_name: Marina
full_name: Pajic, Marina
last_name: Pajic
- first_name: Mark
full_name: Pinese, Mark
last_name: Pinese
- first_name: Mary
full_name: Iconomou, Mary
last_name: Iconomou
- first_name: Robert
full_name: Shearer, Robert
last_name: Shearer
- first_name: Jessie
full_name: Mckenna, Jessie
last_name: Mckenna
- first_name: David
full_name: Miller, David
last_name: Miller
- first_name: Nicola
full_name: Waddell, Nicola
last_name: Waddell
- first_name: John
full_name: Pearson, John
last_name: Pearson
- first_name: Sean
full_name: Grimmond, Sean
last_name: Grimmond
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
- first_name: Andrew
full_name: Biankin, Andrew
last_name: Biankin
- first_name: Silas
full_name: Villas Boas, Silas
last_name: Villas Boas
- first_name: Andrew
full_name: Hoy, Andrew
last_name: Hoy
- first_name: Nigel
full_name: Turner, Nigel
last_name: Turner
- first_name: Darren
full_name: Saunders, Darren
last_name: Saunders
citation:
ama: Hardie R, Van Dam E, Cowley M, et al. Mitochondrial mutations and metabolic
adaptation in pancreatic cancer. Cancer & Metabolism. 2017;5(2). doi:10.1186/s40170-017-0164-1
apa: Hardie, R., Van Dam, E., Cowley, M., Han, T., Balaban, S., Pajic, M., … Saunders,
D. (2017). Mitochondrial mutations and metabolic adaptation in pancreatic cancer.
Cancer & Metabolism. BioMed Central. https://doi.org/10.1186/s40170-017-0164-1
chicago: Hardie, Rae, Ellen Van Dam, Mark Cowley, Ting Han, Seher Balaban, Marina
Pajic, Mark Pinese, et al. “Mitochondrial Mutations and Metabolic Adaptation in
Pancreatic Cancer.” Cancer & Metabolism. BioMed Central, 2017. https://doi.org/10.1186/s40170-017-0164-1.
ieee: R. Hardie et al., “Mitochondrial mutations and metabolic adaptation
in pancreatic cancer,” Cancer & Metabolism, vol. 5, no. 2. BioMed Central,
2017.
ista: Hardie R, Van Dam E, Cowley M, Han T, Balaban S, Pajic M, Pinese M, Iconomou
M, Shearer R, Mckenna J, Miller D, Waddell N, Pearson J, Grimmond S, Sazanov LA,
Biankin A, Villas Boas S, Hoy A, Turner N, Saunders D. 2017. Mitochondrial mutations
and metabolic adaptation in pancreatic cancer. Cancer & Metabolism. 5(2).
mla: Hardie, Rae, et al. “Mitochondrial Mutations and Metabolic Adaptation in Pancreatic
Cancer.” Cancer & Metabolism, vol. 5, no. 2, BioMed Central, 2017,
doi:10.1186/s40170-017-0164-1.
short: R. Hardie, E. Van Dam, M. Cowley, T. Han, S. Balaban, M. Pajic, M. Pinese,
M. Iconomou, R. Shearer, J. Mckenna, D. Miller, N. Waddell, J. Pearson, S. Grimmond,
L.A. Sazanov, A. Biankin, S. Villas Boas, A. Hoy, N. Turner, D. Saunders, Cancer
& Metabolism 5 (2017).
date_created: 2018-12-11T11:46:30Z
date_published: 2017-01-30T00:00:00Z
date_updated: 2021-01-12T07:56:55Z
day: '30'
ddc:
- '570'
doi: 10.1186/s40170-017-0164-1
extern: '1'
file:
- access_level: open_access
checksum: 337a65786875f64a1fe9fc0ac24767dc
content_type: application/pdf
creator: dernst
date_created: 2019-01-22T08:17:56Z
date_updated: 2020-07-14T12:46:29Z
file_id: '5868'
file_name: 2017_Cancer_Hardie.pdf
file_size: 1609174
relation: main_file
file_date_updated: 2020-07-14T12:46:29Z
has_accepted_license: '1'
intvolume: ' 5'
issue: '2'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
publication: Cancer & Metabolism
publication_status: published
publisher: BioMed Central
publist_id: '7380'
quality_controlled: '1'
status: public
title: Mitochondrial mutations and metabolic adaptation in pancreatic cancer
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: 5
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.
date_created: 2018-12-11T11:46:30Z
date_published: 2017-11-29T00:00:00Z
date_updated: 2021-01-12T07:56:59Z
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: '445'
abstract:
- lang: eng
text: The Loschmidt echo, defined as the overlap between quantum wave function evolved
with different Hamiltonians, quantifies the sensitivity of quantum dynamics to
perturbations and is often used as a probe of quantum chaos. In this work we consider
the behavior of the Loschmidt echo in the many-body localized phase, which is
characterized by emergent local integrals of motion and provides a generic example
of nonergodic dynamics. We demonstrate that the fluctuations of the Loschmidt
echo decay as a power law in time in the many-body localized phase, in contrast
to the exponential decay in few-body ergodic systems. We consider the spin-echo
generalization of the Loschmidt echo and argue that the corresponding correlation
function saturates to a finite value in localized systems. Slow, power-law decay
of fluctuations of such spin-echo-type overlap is related to the operator spreading
and is present only in the many-body localized phase, but not in a noninteracting
Anderson insulator. While most of the previously considered probes of dephasing
dynamics could be understood by approximating physical spin operators with local
integrals of motion, the Loschmidt echo and its generalizations crucially depend
on the full expansion of the physical operators via local integrals of motion
operators, as well as operators which flip local integrals of motion. Hence these
probes allow one to get insights into the relation between physical operators
and local integrals of motion and access the operator spreading in the many-body
localized phase.
acknowledgement: |-
This research was supported in part by the National
Science Foundation under Grant No. NSF PHY11-25915.
M.S. was supported by Gordon and Betty Moore Foundation’s
EPiQS Initiative through Grant No. GBMF4307. D.A. also
acknowledges support by Swiss National Science Foundation.
author:
- first_name: Maksym
full_name: Maksym Serbyn
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
- first_name: Dimitry
full_name: Abanin, Dimitry A
last_name: Abanin
citation:
ama: Serbyn M, Abanin D. Loschmidt echo in many body localized phases. Physical
Review B - Condensed Matter and Materials Physics. 2017;96(1). doi:10.1103/PhysRevB.96.014202
apa: Serbyn, M., & Abanin, D. (2017). Loschmidt echo in many body localized
phases. Physical Review B - Condensed Matter and Materials Physics. American
Physical Society. https://doi.org/10.1103/PhysRevB.96.014202
chicago: Serbyn, Maksym, and Dimitry Abanin. “Loschmidt Echo in Many Body Localized
Phases.” Physical Review B - Condensed Matter and Materials Physics. American
Physical Society, 2017. https://doi.org/10.1103/PhysRevB.96.014202.
ieee: M. Serbyn and D. Abanin, “Loschmidt echo in many body localized phases,” Physical
Review B - Condensed Matter and Materials Physics, vol. 96, no. 1. American
Physical Society, 2017.
ista: Serbyn M, Abanin D. 2017. Loschmidt echo in many body localized phases. Physical
Review B - Condensed Matter and Materials Physics. 96(1).
mla: Serbyn, Maksym, and Dimitry Abanin. “Loschmidt Echo in Many Body Localized
Phases.” Physical Review B - Condensed Matter and Materials Physics, vol.
96, no. 1, American Physical Society, 2017, doi:10.1103/PhysRevB.96.014202.
short: M. Serbyn, D. Abanin, Physical Review B - Condensed Matter and Materials
Physics 96 (2017).
date_created: 2018-12-11T11:46:31Z
date_published: 2017-07-12T00:00:00Z
date_updated: 2021-01-12T07:57:03Z
day: '12'
doi: 10.1103/PhysRevB.96.014202
extern: 1
intvolume: ' 96'
issue: '1'
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1701.07772
month: '07'
oa: 1
publication: Physical Review B - Condensed Matter and Materials Physics
publication_status: published
publisher: American Physical Society
publist_id: '7378'
quality_controlled: 0
status: public
title: Loschmidt echo in many body localized phases
type: journal_article
volume: 96
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.
date_created: 2018-12-11T11:46:31Z
date_published: 2017-03-23T00:00:00Z
date_updated: 2023-10-10T13:10:32Z
day: '23'
department:
- _id: LaEr
- _id: JaMa
doi: 10.30757/ALEA.v14-17
ec_funded: 1
intvolume: ' 9'
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
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
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: 2022-03-18T12:55:28Z
day: '01'
doi: 10.1145/3068766
extern: '1'
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'
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'
...
---
_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: 2021-01-12T07:59:28Z
day: '07'
ddc:
- '570'
department:
- _id: MaLo
doi: 10.1016/j.bpj.2017.09.006
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
publication: Biophysical Journal
publication_status: published
publisher: Biophysical Society
publist_id: '7369'
pubrep_id: '965'
quality_controlled: '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: '261'
abstract:
- lang: eng
text: Let G = SL(2, R) ⋉R2 and Γ = SL(2, Z) ⋉Z2. Building on recent work of Strömbergsson,
we prove a rate of equidistribution for the orbits of a certain one-dimensional
unipotent flow of Γ\G, which projects to a closed horocycle in the unit tangent
bundle to the modular surface. We use this to answer a question of Elkies and
McMullen by making effective the convergence of the gap distribution of √n mod
1.
acknowledgement: The research leading to these results has received funding from the
European Research Council under the European Union’s Seventh Framework Programme
(FP/2007–2013)/ERC Grant Agreements 291147 and 306457.
author:
- first_name: Timothy D
full_name: Timothy Browning
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Ilya
full_name: Vinogradov, Ilya
last_name: Vinogradov
citation:
ama: Browning TD, Vinogradov I. Effective ratner theorem for SL (2, R) ⋉R2 and gaps
in √n modulo 1. Journal of the London Mathematical Society. 2016;94(1):61-84.
doi:10.1112/jlms/jdw025
apa: Browning, T. D., & Vinogradov, I. (2016). Effective ratner theorem for
SL (2, R) ⋉R2 and gaps in √n modulo 1. Journal of the London Mathematical Society.
John Wiley and Sons Ltd. https://doi.org/10.1112/jlms/jdw025
chicago: Browning, Timothy D, and Ilya Vinogradov. “Effective Ratner Theorem for
SL (2, R) ⋉R2 and Gaps in √n modulo 1.” Journal of the London Mathematical
Society. John Wiley and Sons Ltd, 2016. https://doi.org/10.1112/jlms/jdw025.
ieee: T. D. Browning and I. Vinogradov, “Effective ratner theorem for SL (2, R)
⋉R2 and gaps in √n modulo 1,” Journal of the London Mathematical Society,
vol. 94, no. 1. John Wiley and Sons Ltd, pp. 61–84, 2016.
ista: Browning TD, Vinogradov I. 2016. Effective ratner theorem for SL (2, R) ⋉R2
and gaps in √n modulo 1. Journal of the London Mathematical Society. 94(1), 61–84.
mla: Browning, Timothy D., and Ilya Vinogradov. “Effective Ratner Theorem for SL
(2, R) ⋉R2 and Gaps in √n modulo 1.” Journal of the London Mathematical Society,
vol. 94, no. 1, John Wiley and Sons Ltd, 2016, pp. 61–84, doi:10.1112/jlms/jdw025.
short: T.D. Browning, I. Vinogradov, Journal of the London Mathematical Society
94 (2016) 61–84.
date_created: 2018-12-11T11:45:29Z
date_published: 2016-05-24T00:00:00Z
date_updated: 2021-01-12T06:58:33Z
day: '24'
doi: 10.1112/jlms/jdw025
extern: 1
intvolume: ' 94'
issue: '1'
month: '05'
page: 61 - 84
publication: Journal of the London Mathematical Society
publication_status: published
publisher: John Wiley and Sons Ltd
publist_id: '7641'
quality_controlled: 0
status: public
title: Effective ratner theorem for SL (2, R) ⋉R2 and gaps in √n modulo 1
type: journal_article
volume: 94
year: '2016'
...
---
_id: '262'
abstract:
- lang: eng
text: For any number field we calculate the exact proportion of rational numbers
which are everywhere locally a norm but not globally a norm from the number field.
acknowledgement: While working on this paper the first author was supported by ERC
grant 306457.
author:
- first_name: Timothy D
full_name: Timothy Browning
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Rachel
full_name: Newton, Rachel
last_name: Newton
citation:
ama: Browning TD, Newton R. The proportion of failures of the Hasse norm principle.
Mathematika. 2016;62(2):337-347. doi:10.1112/S0025579315000261
apa: Browning, T. D., & Newton, R. (2016). The proportion of failures of the
Hasse norm principle. Mathematika. Cambridge University Press. https://doi.org/10.1112/S0025579315000261
chicago: Browning, Timothy D, and Rachel Newton. “The Proportion of Failures of
the Hasse Norm Principle.” Mathematika. Cambridge University Press, 2016.
https://doi.org/10.1112/S0025579315000261.
ieee: T. D. Browning and R. Newton, “The proportion of failures of the Hasse norm
principle,” Mathematika, vol. 62, no. 2. Cambridge University Press, pp.
337–347, 2016.
ista: Browning TD, Newton R. 2016. The proportion of failures of the Hasse norm
principle. Mathematika. 62(2), 337–347.
mla: Browning, Timothy D., and Rachel Newton. “The Proportion of Failures of the
Hasse Norm Principle.” Mathematika, vol. 62, no. 2, Cambridge University
Press, 2016, pp. 337–47, doi:10.1112/S0025579315000261.
short: T.D. Browning, R. Newton, Mathematika 62 (2016) 337–347.
date_created: 2018-12-11T11:45:29Z
date_published: 2016-01-22T00:00:00Z
date_updated: 2021-01-12T06:58:37Z
day: '22'
doi: 10.1112/S0025579315000261
extern: 1
intvolume: ' 62'
issue: '2'
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1411.7775
month: '01'
oa: 1
page: 337 - 347
publication: Mathematika
publication_status: published
publisher: Cambridge University Press
publist_id: '7640'
quality_controlled: 0
status: public
title: The proportion of failures of the Hasse norm principle
type: journal_article
volume: 62
year: '2016'
...
---
_id: '263'
abstract:
- lang: eng
text: We count rational points of bounded height on the Cayley ruled cubic surface
and interpret the result in the context of general conjectures due to Batyrev
and Tschinkel.
acknowledgement: 'While working on this paper the first author was supported by an
IUF Junior and the second author was supported by ERC grant 306457. '
author:
- first_name: Régis
full_name: de la Bretèche, Régis
last_name: De La Bretèche
- first_name: Timothy D
full_name: Timothy Browning
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Per
full_name: Salberger, Per
last_name: Salberger
citation:
ama: De La Bretèche R, Browning TD, Salberger P. Counting rational points on the
Cayley ruled cubic. European Journal of Mathematics. 2016;2(1):55-72. doi:10.1007/s40879-015-0049-1
apa: De La Bretèche, R., Browning, T. D., & Salberger, P. (2016). Counting rational
points on the Cayley ruled cubic. European Journal of Mathematics. Springer
Nature. https://doi.org/10.1007/s40879-015-0049-1
chicago: De La Bretèche, Régis, Timothy D Browning, and Per Salberger. “Counting
Rational Points on the Cayley Ruled Cubic.” European Journal of Mathematics.
Springer Nature, 2016. https://doi.org/10.1007/s40879-015-0049-1.
ieee: R. De La Bretèche, T. D. Browning, and P. Salberger, “Counting rational points
on the Cayley ruled cubic,” European Journal of Mathematics, vol. 2, no.
1. Springer Nature, pp. 55–72, 2016.
ista: De La Bretèche R, Browning TD, Salberger P. 2016. Counting rational points
on the Cayley ruled cubic. European Journal of Mathematics. 2(1), 55–72.
mla: De La Bretèche, Régis, et al. “Counting Rational Points on the Cayley Ruled
Cubic.” European Journal of Mathematics, vol. 2, no. 1, Springer Nature,
2016, pp. 55–72, doi:10.1007/s40879-015-0049-1.
short: R. De La Bretèche, T.D. Browning, P. Salberger, European Journal of Mathematics
2 (2016) 55–72.
date_created: 2018-12-11T11:45:30Z
date_published: 2016-03-01T00:00:00Z
date_updated: 2021-01-12T06:58:41Z
day: '01'
doi: 10.1007/s40879-015-0049-1
extern: 1
intvolume: ' 2'
issue: '1'
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1410.3855
month: '03'
oa: 1
page: 55 - 72
publication: European Journal of Mathematics
publication_status: published
publisher: Springer Nature
publist_id: '7639'
quality_controlled: 0
status: public
title: Counting rational points on the Cayley ruled cubic
type: journal_article
volume: 2
year: '2016'
...
---
_id: '264'
abstract:
- lang: eng
text: Given a family of varieties over a number field, we determine conditions under
which there is a Brauer-Manin obstruction to weak approximation for 100% of the
fibres which are everywhere locally soluble.
acknowledgement: While working on this paper the second author was supported by ERC
grant 306457.
author:
- first_name: Maritn
full_name: Bright, Maritn J
last_name: Bright
- first_name: Timothy D
full_name: Timothy Browning
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Daniel
full_name: Loughran, Daniel
last_name: Loughran
citation:
ama: Bright M, Browning TD, Loughran D. Failures of weak approximation in families.
Compositio Mathematica. 2016;152(7):1435-1475. doi:10.1112/S0010437X16007405
apa: Bright, M., Browning, T. D., & Loughran, D. (2016). Failures of weak approximation
in families. Compositio Mathematica. Cambridge University Press. https://doi.org/10.1112/S0010437X16007405
chicago: Bright, Maritn, Timothy D Browning, and Daniel Loughran. “Failures of Weak
Approximation in Families.” Compositio Mathematica. Cambridge University
Press, 2016. https://doi.org/10.1112/S0010437X16007405.
ieee: M. Bright, T. D. Browning, and D. Loughran, “Failures of weak approximation
in families,” Compositio Mathematica, vol. 152, no. 7. Cambridge University
Press, pp. 1435–1475, 2016.
ista: Bright M, Browning TD, Loughran D. 2016. Failures of weak approximation in
families. Compositio Mathematica. 152(7), 1435–1475.
mla: Bright, Maritn, et al. “Failures of Weak Approximation in Families.” Compositio
Mathematica, vol. 152, no. 7, Cambridge University Press, 2016, pp. 1435–75,
doi:10.1112/S0010437X16007405.
short: M. Bright, T.D. Browning, D. Loughran, Compositio Mathematica 152 (2016)
1435–1475.
date_created: 2018-12-11T11:45:30Z
date_published: 2016-07-01T00:00:00Z
date_updated: 2021-01-12T06:58:45Z
day: '01'
doi: 10.1112/S0010437X16007405
extern: 1
intvolume: ' 152'
issue: '7'
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1506.01817
month: '07'
oa: 1
page: 1435 - 1475
publication: Compositio Mathematica
publication_status: published
publisher: Cambridge University Press
publist_id: '7638'
quality_controlled: 0
status: public
title: Failures of weak approximation in families
type: journal_article
volume: 152
year: '2016'
...
---
_id: '1068'
abstract:
- lang: eng
text: 'Games on graphs provide the appropriate framework to study several central
problems in computer science, such as verification and synthesis of reactive systems.
One of the most basic objectives for games on graphs is the liveness (or Büchi)
objective that given a target set of vertices requires that some vertex in the
target set is visited infinitely often. We study generalized Büchi objectives
(i.e., conjunction of liveness objectives), and implications between two generalized
Büchi objectives (known as GR(1) objectives), that arise in numerous applications
in computer-aided verification. We present improved algorithms and conditional
super-linear lower bounds based on widely believed assumptions about the complexity
of (A1) combinatorial Boolean matrix multiplication and (A2) CNF-SAT. We consider
graph games with n vertices, m edges, and generalized Büchi objectives with k
conjunctions. First, we present an algorithm with running time O(k*n^2), improving
the previously known O(k*n*m) and O(k^2*n^2) worst-case bounds. Our algorithm
is optimal for dense graphs under (A1). Second, we show that the basic algorithm
for the problem is optimal for sparse graphs when the target sets have constant
size under (A2). Finally, we consider GR(1) objectives, with k_1 conjunctions
in the antecedent and k_2 conjunctions in the consequent, and present an O(k_1
k_2 n^{2.5})-time algorithm, improving the previously known O(k_1*k_2*n*m)-time
algorithm for m > n^{1.5}. '
acknowledgement: K. C., M. H., and W. D. are partially supported by the Vienna Science
and Technology Fund (WWTF) through project ICT15-003. K. C. is partially supported
by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC
Start grant (279307
alternative_title:
- LIPIcs
article_number: '25'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Wolfgang
full_name: Dvorák, Wolfgang
last_name: Dvorák
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Veronika
full_name: Loitzenbauer, Veronika
last_name: Loitzenbauer
citation:
ama: 'Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. Conditionally optimal
algorithms for generalized Büchi Games. In: Vol 58. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2016. doi:10.4230/LIPIcs.MFCS.2016.25'
apa: 'Chatterjee, K., Dvorák, W., Henzinger, M. H., & Loitzenbauer, V. (2016).
Conditionally optimal algorithms for generalized Büchi Games (Vol. 58). Presented
at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow, Poland:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2016.25'
chicago: Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika
Loitzenbauer. “Conditionally Optimal Algorithms for Generalized Büchi Games,”
Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPIcs.MFCS.2016.25.
ieee: 'K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Conditionally
optimal algorithms for generalized Büchi Games,” presented at the MFCS: Mathematical
Foundations of Computer Science (SG), Krakow, Poland, 2016, vol. 58.'
ista: 'Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2016. Conditionally
optimal algorithms for generalized Büchi Games. MFCS: Mathematical Foundations
of Computer Science (SG), LIPIcs, vol. 58, 25.'
mla: Chatterjee, Krishnendu, et al. Conditionally Optimal Algorithms for Generalized
Büchi Games. Vol. 58, 25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2016, doi:10.4230/LIPIcs.MFCS.2016.25.
short: K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2016.
conference:
end_date: 2016-08-26
location: Krakow, Poland
name: 'MFCS: Mathematical Foundations of Computer Science (SG)'
start_date: 2016-08-22
date_created: 2018-12-11T11:49:58Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2025-06-02T08:53:50Z
day: '01'
ddc:
- '000'
- '004'
- '006'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.MFCS.2016.25
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:02Z
date_updated: 2018-12-12T10:16:02Z
file_id: '5187'
file_name: IST-2017-779-v1+1_LIPIcs-MFCS-2016-25.pdf
file_size: 632786
relation: main_file
file_date_updated: 2018-12-12T10:16:02Z
has_accepted_license: '1'
intvolume: ' 58'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/3.0/
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '6317'
pubrep_id: '779'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Conditionally optimal algorithms for generalized Büchi Games
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 58
year: '2016'
...
---
_id: '1069'
abstract:
- lang: eng
text: "The Continuous Skolem Problem asks whether a real-valued function satisfying
a linear differen-\r\ntial equation has a zero in a given interval of real numbers.
This is a fundamental reachability\r\nproblem for continuous linear dynamical
systems, such as linear hybrid automata and continuous-\r\ntime Markov chains.
Decidability of the problem is currently open – indeed decidability is open\r\neven
for the sub-problem in which a zero is sought in a bounded interval. In this paper
we show\r\ndecidability of the bounded problem subject to Schanuel’s Conjecture,
a unifying conjecture in\r\ntranscendental number theory. We furthermore analyse
the unbounded problem in terms of the\r\nfrequencies of the differential equation,
that is, the imaginary parts of the characteristic roots.\r\nWe show that the
unbounded problem can be reduced to the bounded problem if there is at most\r\none
rationally linearly independent frequency, or if there are two rationally linearly
independent\r\nfrequencies and all characteristic roots are simple. We complete
the picture by showing that de-\r\ncidability of the unbounded problem in the
case of two (or more) rationally linearly independent\r\nfrequencies would entail
a major new effectiveness result in Diophantine approximation, namely\r\ncomputability
of the Diophantine-approximation types of all real algebraic numbers."
acknowledgement: 'Ventsislav Chonev is supported by Austrian Science Fund (FWF) NFN
Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), and ERC
Advanced Grant (267989: QUAREM).'
alternative_title:
- LIPIcs
article_number: '100'
author:
- first_name: Ventsislav K
full_name: Chonev, Ventsislav K
id: 36CBE2E6-F248-11E8-B48F-1D18A9856A87
last_name: Chonev
- first_name: Joël
full_name: Ouaknine, Joël
last_name: Ouaknine
- first_name: James
full_name: Worrell, James
last_name: Worrell
citation:
ama: 'Chonev VK, Ouaknine J, Worrell J. On the skolem problem for continuous linear
dynamical systems. In: Vol 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik;
2016. doi:10.4230/LIPIcs.ICALP.2016.100'
apa: 'Chonev, V. K., Ouaknine, J., & Worrell, J. (2016). On the skolem problem
for continuous linear dynamical systems (Vol. 55). Presented at the ICALP: Automata,
Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur
Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2016.100'
chicago: Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On the Skolem
Problem for Continuous Linear Dynamical Systems,” Vol. 55. Schloss Dagstuhl- Leibniz-Zentrum
fur Informatik, 2016. https://doi.org/10.4230/LIPIcs.ICALP.2016.100.
ieee: 'V. K. Chonev, J. Ouaknine, and J. Worrell, “On the skolem problem for continuous
linear dynamical systems,” presented at the ICALP: Automata, Languages and Programming,
Rome, Italy, 2016, vol. 55.'
ista: 'Chonev VK, Ouaknine J, Worrell J. 2016. On the skolem problem for continuous
linear dynamical systems. ICALP: Automata, Languages and Programming, LIPIcs,
vol. 55, 100.'
mla: Chonev, Ventsislav K., et al. On the Skolem Problem for Continuous Linear
Dynamical Systems. Vol. 55, 100, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik,
2016, doi:10.4230/LIPIcs.ICALP.2016.100.
short: V.K. Chonev, J. Ouaknine, J. Worrell, in:, Schloss Dagstuhl- Leibniz-Zentrum
fur Informatik, 2016.
conference:
end_date: 2016-07-15
location: Rome, Italy
name: 'ICALP: Automata, Languages and Programming'
start_date: 2016-07-12
date_created: 2018-12-11T11:49:59Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2021-01-12T06:48:03Z
day: '01'
ddc:
- '004'
- '006'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.ICALP.2016.100
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:26Z
date_updated: 2018-12-12T10:16:26Z
file_id: '5213'
file_name: IST-2017-778-v1+1_LIPIcs-ICALP-2016-100.pdf
file_size: 521415
relation: main_file
file_date_updated: 2018-12-12T10:16:26Z
has_accepted_license: '1'
intvolume: ' 55'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication_status: published
publisher: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik
publist_id: '6314'
pubrep_id: '778'
quality_controlled: '1'
scopus_import: 1
status: public
title: On the skolem problem for continuous linear dynamical systems
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 55
year: '2016'
...
---
_id: '1070'
abstract:
- lang: eng
text: 'We present a logic that extends CTL (Computation Tree Logic) with operators
that express synchronization properties. A property is synchronized in a system
if it holds in all paths of a certain length. The new logic is obtained by using
the same path quantifiers and temporal operators as in CTL, but allowing a different
order of the quantifiers. This small syntactic variation induces a logic that
can express non-regular properties for which known extensions of MSO with equality
of path length are undecidable. We show that our variant of CTL is decidable and
that the model-checking problem is in Delta_3^P = P^{NP^NP}, and is DP-hard. We
analogously consider quantifier exchange in extensions of CTL, and we present
operators defined using basic operators of CTL* that express the occurrence of
infinitely many synchronization points. We show that the model-checking problem
remains in Delta_3^P. The distinguishing power of CTL and of our new logic coincide
if the Next operator is allowed in the logics, thus the classical bisimulation
quotient can be used for state-space reduction before model checking. '
acknowledgement: "This research was partially supported by Austrian Science Fund (FWF)
NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), Vienna
Science and Technology Fund (WWTF) through project ICT15-003, and European project
Cassting (FP7-601148).\r\n\r\nWe thank Stefan Göller and anonymous reviewers for
their insightful\r\ncomments and suggestions.\r\n"
alternative_title:
- LIPIcs
article_number: '98'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Computation tree logic for synchronization properties.
In: Vol 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik; 2016. doi:10.4230/LIPIcs.ICALP.2016.98'
apa: 'Chatterjee, K., & Doyen, L. (2016). Computation tree logic for synchronization
properties (Vol. 55). Presented at the ICALP: Automata, Languages and Programming,
Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2016.98'
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Computation Tree Logic for
Synchronization Properties,” Vol. 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik,
2016. https://doi.org/10.4230/LIPIcs.ICALP.2016.98.
ieee: 'K. Chatterjee and L. Doyen, “Computation tree logic for synchronization properties,”
presented at the ICALP: Automata, Languages and Programming, Rome, Italy, 2016,
vol. 55.'
ista: 'Chatterjee K, Doyen L. 2016. Computation tree logic for synchronization properties.
ICALP: Automata, Languages and Programming, LIPIcs, vol. 55, 98.'
mla: Chatterjee, Krishnendu, and Laurent Doyen. Computation Tree Logic for Synchronization
Properties. Vol. 55, 98, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik,
2016, doi:10.4230/LIPIcs.ICALP.2016.98.
short: K. Chatterjee, L. Doyen, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik,
2016.
conference:
end_date: 2016-07-15
location: Rome, Italy
name: 'ICALP: Automata, Languages and Programming'
start_date: 2016-07-12
date_created: 2018-12-11T11:49:59Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2021-01-12T06:48:03Z
day: '01'
ddc:
- '005'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.ICALP.2016.98
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:52Z
date_updated: 2018-12-12T10:08:52Z
file_id: '4714'
file_name: IST-2017-812-v1+1_LIPIcs-ICALP-2016-98.pdf
file_size: 546133
relation: main_file
file_date_updated: 2018-12-12T10:08:52Z
has_accepted_license: '1'
intvolume: ' 55'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication_status: published
publisher: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik
publist_id: '6313'
pubrep_id: '812'
quality_controlled: '1'
scopus_import: 1
status: public
title: Computation tree logic for synchronization properties
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 55
year: '2016'
...
---
_id: '1071'
abstract:
- lang: eng
text: 'We consider data-structures for answering reachability and distance queries
on constant-treewidth graphs with n nodes, on the standard RAM computational model
with wordsize W=Theta(log n). Our first contribution is a data-structure that
after O(n) preprocessing time, allows (1) pair reachability queries in O(1) time;
and (2) single-source reachability queries in O(n/log n) time. This is (asymptotically)
optimal and is faster than DFS/BFS when answering more than a constant number
of single-source queries. The data-structure uses at all times O(n) space. Our
second contribution is a space-time tradeoff data-structure for distance queries.
For any epsilon in [1/2,1], we provide a data-structure with polynomial preprocessing
time that allows pair queries in O(n^{1-\epsilon} alpha(n)) time, where alpha
is the inverse of the Ackermann function, and at all times uses O(n^epsilon) space.
The input graph G is not considered in the space complexity. '
acknowledgement: 'The research was partly supported by Austrian Science Fund (FWF)
Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE) and ERC Start grant
(279307: Graph Games).'
alternative_title:
- LIPIcs
article_number: '28'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: 'Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Optimal reachability and a space
time tradeoff for distance queries in constant treewidth graphs. In: Vol 57. Schloss
Dagstuhl- Leibniz-Zentrum fur Informatik; 2016. doi:10.4230/LIPIcs.ESA.2016.28'
apa: 'Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2016). Optimal reachability
and a space time tradeoff for distance queries in constant treewidth graphs (Vol.
57). Presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark:
Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. https://doi.org/10.4230/LIPIcs.ESA.2016.28'
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis.
“Optimal Reachability and a Space Time Tradeoff for Distance Queries in Constant
Treewidth Graphs,” Vol. 57. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik,
2016. https://doi.org/10.4230/LIPIcs.ESA.2016.28.
ieee: 'K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal reachability
and a space time tradeoff for distance queries in constant treewidth graphs,”
presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark, 2016,
vol. 57.'
ista: 'Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2016. Optimal reachability
and a space time tradeoff for distance queries in constant treewidth graphs. ESA:
European Symposium on Algorithms, LIPIcs, vol. 57, 28.'
mla: Chatterjee, Krishnendu, et al. Optimal Reachability and a Space Time Tradeoff
for Distance Queries in Constant Treewidth Graphs. Vol. 57, 28, Schloss Dagstuhl-
Leibniz-Zentrum fur Informatik, 2016, doi:10.4230/LIPIcs.ESA.2016.28.
short: K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Schloss Dagstuhl- Leibniz-Zentrum
fur Informatik, 2016.
conference:
end_date: 2016-08-24
location: Aarhus, Denmark
name: 'ESA: European Symposium on Algorithms'
start_date: 2016-08-22
date_created: 2018-12-11T11:49:59Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2023-09-07T12:01:58Z
day: '01'
ddc:
- '004'
- '006'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.ESA.2016.28
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:31Z
date_updated: 2018-12-12T10:14:31Z
file_id: '5084'
file_name: IST-2017-777-v1+1_LIPIcs-ESA-2016-28.pdf
file_size: 579225
relation: main_file
file_date_updated: 2018-12-12T10:14:31Z
has_accepted_license: '1'
intvolume: ' 57'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_status: published
publisher: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik
publist_id: '6312'
pubrep_id: '777'
quality_controlled: '1'
related_material:
record:
- id: '821'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Optimal reachability and a space time tradeoff for distance queries in constant
treewidth graphs
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 57
year: '2016'
...
---
_id: '10746'
abstract:
- lang: eng
text: Vortex states in superconducting (SC) structures, their dynamics and ways
to manipulate them are topics of great interest. We report a new method of magnetic
force microscopy (MFM) that allows the study of vortex states in mesoscopic SC
samples. For the case of a SC ring, which is biased to a half-integer flux quantum,
the flux modulation through the ring caused by the motion of the magnetic tip
drives the ring between two consecutive fluxoid states. The corresponding current
switching in the ring produces strong position-dependent forces on the cantilever.
In the regime where the frequency of the thermally activated jumps between fluxoid
states is close to the frequency of the cantilever, large changes in the cantilever
frequency and dissipation are observed. This effect may be understood as a stochastic
resonance (SR) process. These changes in the cantilever’s mechanical properties
are used to “image” the barrier energies between fluxoid states. Additionally,
SR imaging of the barrier energies are used to study the effect of the locally
applied magnetic field from the MFM tip on the barrier heights. We report the
results of measurements for Al rings. Further, the same imaging technique can
be applied to more sophisticated SC structures such as arrays of Josephson junctions.
alternative_title:
- Bulletin of the American Physical Society
article_number: E25.00007
article_processing_charge: No
author:
- first_name: Hryhoriy
full_name: Polshyn, Hryhoriy
id: edfc7cb1-526e-11ec-b05a-e6ecc27e4e48
last_name: Polshyn
orcid: 0000-0001-8223-8896
- first_name: Tyler
full_name: Naibert, Tyler
last_name: Naibert
- first_name: Victor
full_name: Chua, Victor
last_name: Chua
- first_name: Raffi
full_name: Budakian, Raffi
last_name: Budakian
citation:
ama: 'Polshyn H, Naibert T, Chua V, Budakian R. Study of vortex states and dynamics
in mesoscopic superconducting samples with MFM. In: APS March Meeting 2016.
Vol 61. American Physical Society; 2016.'
apa: 'Polshyn, H., Naibert, T., Chua, V., & Budakian, R. (2016). Study of vortex
states and dynamics in mesoscopic superconducting samples with MFM. In APS
March Meeting 2016 (Vol. 61). Baltimore, MD, United States: American Physical
Society.'
chicago: Polshyn, Hryhoriy, Tyler Naibert, Victor Chua, and Raffi Budakian. “Study
of Vortex States and Dynamics in Mesoscopic Superconducting Samples with MFM.”
In APS March Meeting 2016, Vol. 61. American Physical Society, 2016.
ieee: H. Polshyn, T. Naibert, V. Chua, and R. Budakian, “Study of vortex states
and dynamics in mesoscopic superconducting samples with MFM,” in APS March
Meeting 2016, Baltimore, MD, United States, 2016, vol. 61, no. 2.
ista: 'Polshyn H, Naibert T, Chua V, Budakian R. 2016. Study of vortex states and
dynamics in mesoscopic superconducting samples with MFM. APS March Meeting 2016.
APS: American Physical Society, Bulletin of the American Physical Society, vol.
61, E25.00007.'
mla: Polshyn, Hryhoriy, et al. “Study of Vortex States and Dynamics in Mesoscopic
Superconducting Samples with MFM.” APS March Meeting 2016, vol. 61, no.
2, E25.00007, American Physical Society, 2016.
short: H. Polshyn, T. Naibert, V. Chua, R. Budakian, in:, APS March Meeting 2016,
American Physical Society, 2016.
conference:
end_date: 2016-03-18
location: Baltimore, MD, United States
name: 'APS: American Physical Society'
start_date: 2016-03-14
date_created: 2022-02-08T09:55:09Z
date_published: 2016-03-01T00:00:00Z
date_updated: 2022-02-08T10:44:06Z
day: '01'
extern: '1'
intvolume: ' 61'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://meetings.aps.org/Meeting/MAR16/Session/E25.7
month: '03'
oa: 1
oa_version: Published Version
publication: APS March Meeting 2016
publication_identifier:
issn:
- 0003-0503
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
status: public
title: Study of vortex states and dynamics in mesoscopic superconducting samples with
MFM
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 61
year: '2016'
...
---
_id: '10747'
abstract:
- lang: eng
text: Vortex interactions are key to explaining the behavior of many two dimensional
superconducting systems. We report on the development of a technique to locally
probe vortex interactions in a 2D array of Josephson junctions. Scanning a magnetic
tip attached to an ultra-soft cantilever over the array produces changes in the
frequency of the cantilever along certain lines, forming geometric patterns in
the scans. Different tip-surface separations and external magnetic fields produce
a number of different patterns. These patterns correspond to tip locations in
which two configurations of vortices in the lattice have degenerate energies.
By imaging the locations of these degeneracies, information on the local vortex
interactions may be obtained.
alternative_title:
- Bulletin of the American Physical Society
article_number: H25.00006
article_processing_charge: No
author:
- first_name: Tyler
full_name: Naibert, Tyler
last_name: Naibert
- first_name: Hryhoriy
full_name: Polshyn, Hryhoriy
id: edfc7cb1-526e-11ec-b05a-e6ecc27e4e48
last_name: Polshyn
orcid: 0000-0001-8223-8896
- first_name: Brian
full_name: Wolin, Brian
last_name: Wolin
- first_name: Malcolm
full_name: Durkin, Malcolm
last_name: Durkin
- first_name: Rita
full_name: Garrido Menacho, Rita
last_name: Garrido Menacho
- first_name: Ian Mondragon
full_name: Shem, Ian Mondragon
last_name: Shem
- first_name: Victor
full_name: Chua, Victor
last_name: Chua
- first_name: Taylor
full_name: Hughes, Taylor
last_name: Hughes
- first_name: Nadya
full_name: Mason, Nadya
last_name: Mason
- first_name: Raffi
full_name: Budakian, Raffi
last_name: Budakian
citation:
ama: 'Naibert T, Polshyn H, Wolin B, et al. Stochastic resonance magnetic force
microscopy imaging of Josephson arrays. In: APS March Meeting 2016. Vol
61. American Physical Society; 2016.'
apa: 'Naibert, T., Polshyn, H., Wolin, B., Durkin, M., Garrido Menacho, R., Shem,
I. M., … Budakian, R. (2016). Stochastic resonance magnetic force microscopy imaging
of Josephson arrays. In APS March Meeting 2016 (Vol. 61). Baltimore, MD,
United States: American Physical Society.'
chicago: Naibert, Tyler, Hryhoriy Polshyn, Brian Wolin, Malcolm Durkin, Rita Garrido
Menacho, Ian Mondragon Shem, Victor Chua, Taylor Hughes, Nadya Mason, and Raffi
Budakian. “Stochastic Resonance Magnetic Force Microscopy Imaging of Josephson
Arrays.” In APS March Meeting 2016, Vol. 61. American Physical Society,
2016.
ieee: T. Naibert et al., “Stochastic resonance magnetic force microscopy
imaging of Josephson arrays,” in APS March Meeting 2016, Baltimore, MD,
United States, 2016, vol. 61, no. 2.
ista: 'Naibert T, Polshyn H, Wolin B, Durkin M, Garrido Menacho R, Shem IM, Chua
V, Hughes T, Mason N, Budakian R. 2016. Stochastic resonance magnetic force microscopy
imaging of Josephson arrays. APS March Meeting 2016. APS: American Physical Society,
Bulletin of the American Physical Society, vol. 61, H25.00006.'
mla: Naibert, Tyler, et al. “Stochastic Resonance Magnetic Force Microscopy Imaging
of Josephson Arrays.” APS March Meeting 2016, vol. 61, no. 2, H25.00006,
American Physical Society, 2016.
short: T. Naibert, H. Polshyn, B. Wolin, M. Durkin, R. Garrido Menacho, I.M. Shem,
V. Chua, T. Hughes, N. Mason, R. Budakian, in:, APS March Meeting 2016, American
Physical Society, 2016.
conference:
end_date: 2016-03-18
location: Baltimore, MD, United States
name: 'APS: American Physical Society'
start_date: 2016-03-14
date_created: 2022-02-08T10:10:39Z
date_published: 2016-03-01T00:00:00Z
date_updated: 2022-02-08T10:43:33Z
day: '01'
extern: '1'
intvolume: ' 61'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://meetings.aps.org/Meeting/MAR16/Session/H25.6
month: '03'
oa: 1
oa_version: Published Version
publication: APS March Meeting 2016
publication_identifier:
issn:
- 0003-0503
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
status: public
title: Stochastic resonance magnetic force microscopy imaging of Josephson arrays
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 61
year: '2016'
...
---
_id: '1081'
abstract:
- lang: eng
text: The asymmetric localization of proteins in the plasma membrane domains of
eukaryotic cells is a fundamental manifestation of cell polarity that is central
to multicellular organization and developmental patterning. In plants, the mechanisms
underlying the polar localization of cargo proteins are still largely unknown
and appear to be fundamentally distinct from those operating in mammals. Here,
we present a systematic, quantitative comparative analysis of the polar delivery
and subcellular localization of proteins that characterize distinct polar plasma
membrane domains in plant cells. The combination of microscopic analyses and computational
modeling revealed a mechanistic framework common to diverse polar cargos and underlying
the establishment and maintenance of apical, basal, and lateral polar domains
in plant cells. This mechanism depends on the polar secretion, constitutive endocytic
recycling, and restricted lateral diffusion of cargos within the plasma membrane.
Moreover, our observations suggest that polar cargo distribution involves the
individual protein potential to form clusters within the plasma membrane and interact
with the extracellular matrix. Our observations provide insights into the shared
cellular mechanisms of polar cargo delivery and polarity maintenance in plant
cells.
acknowledgement: "We thank Bonnie Bartel, Jenny Russinova and Niko Geldner\r\nfor
sharing published material, Martine de Cock and Annick\r\nBleys for help in preparing
the manuscript. This work was\r\nsupported by the European Research Council (project\r\nERC-2011-StG-20101109-PSDP);
Czech Science Foundation\r\nGAČR (GA13-40637S); project CEITEC—Central European\r\nInstitute
of Technology (CZ.1.05/1.1.00/02.0068). SV is a\r\npostdoctoral fellow of the Research
Foundation-Flanders.\r\nSN is a Project Assistant Professor supported by the Japanese\r\nSociety
for the Promotion of Science (JSPS; 30612022 to SN),\r\nthe NC-CARP project of the
Ministry of Education, Culture,\r\nSports, Science and Technology in Japan to SN."
article_number: '16018'
author:
- first_name: Łukasz
full_name: Łangowski, Łukasz
last_name: Łangowski
- first_name: Krzysztof T
full_name: Wabnik, Krzysztof T
id: 4DE369A4-F248-11E8-B48F-1D18A9856A87
last_name: Wabnik
orcid: 0000-0001-7263-0560
- first_name: Hongjiang
full_name: Li, Hongjiang
id: 33CA54A6-F248-11E8-B48F-1D18A9856A87
last_name: Li
orcid: 0000-0001-5039-9660
- first_name: Steffen
full_name: Vanneste, Steffen
last_name: Vanneste
- first_name: Satoshi
full_name: Naramoto, Satoshi
last_name: Naramoto
- first_name: Hirokazu
full_name: Tanaka, Hirokazu
last_name: Tanaka
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Łangowski Ł, Wabnik KT, Li H, et al. Cellular mechanisms for cargo delivery
and polarity maintenance at different polar domains in plant cells. Cell Discovery.
2016;2. doi:10.1038/celldisc.2016.18
apa: Łangowski, Ł., Wabnik, K. T., Li, H., Vanneste, S., Naramoto, S., Tanaka, H.,
& Friml, J. (2016). Cellular mechanisms for cargo delivery and polarity maintenance
at different polar domains in plant cells. Cell Discovery. Nature Publishing
Group. https://doi.org/10.1038/celldisc.2016.18
chicago: Łangowski, Łukasz, Krzysztof T Wabnik, Hongjiang Li, Steffen Vanneste,
Satoshi Naramoto, Hirokazu Tanaka, and Jiří Friml. “Cellular Mechanisms for Cargo
Delivery and Polarity Maintenance at Different Polar Domains in Plant Cells.”
Cell Discovery. Nature Publishing Group, 2016. https://doi.org/10.1038/celldisc.2016.18.
ieee: Ł. Łangowski et al., “Cellular mechanisms for cargo delivery and polarity
maintenance at different polar domains in plant cells,” Cell Discovery,
vol. 2. Nature Publishing Group, 2016.
ista: Łangowski Ł, Wabnik KT, Li H, Vanneste S, Naramoto S, Tanaka H, Friml J. 2016.
Cellular mechanisms for cargo delivery and polarity maintenance at different polar
domains in plant cells. Cell Discovery. 2, 16018.
mla: Łangowski, Łukasz, et al. “Cellular Mechanisms for Cargo Delivery and Polarity
Maintenance at Different Polar Domains in Plant Cells.” Cell Discovery,
vol. 2, 16018, Nature Publishing Group, 2016, doi:10.1038/celldisc.2016.18.
short: Ł. Łangowski, K.T. Wabnik, H. Li, S. Vanneste, S. Naramoto, H. Tanaka, J.
Friml, Cell Discovery 2 (2016).
date_created: 2018-12-11T11:50:02Z
date_published: 2016-07-19T00:00:00Z
date_updated: 2021-01-12T06:48:08Z
day: '19'
ddc:
- '580'
department:
- _id: EvBe
- _id: JiFr
doi: 10.1038/celldisc.2016.18
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:33Z
date_updated: 2018-12-12T10:13:33Z
file_id: '5017'
file_name: IST-2017-757-v1+1_celldisc201618.pdf
file_size: 5261671
relation: main_file
file_date_updated: 2018-12-12T10:13:33Z
has_accepted_license: '1'
intvolume: ' 2'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
publication: Cell Discovery
publication_status: published
publisher: Nature Publishing Group
publist_id: '6299'
pubrep_id: '757'
quality_controlled: '1'
scopus_import: 1
status: public
title: Cellular mechanisms for cargo delivery and polarity maintenance at different
polar domains in plant cells
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2016'
...
---
_id: '10810'
abstract:
- lang: eng
text: "The main goal of the SCP-ECG standard is to address ECG data and related
metadata structuring, semantics and syntax, with the objective of facilitating
interoperability and thus supporting and promoting the exchange of the relevant
information for unary and serial ECG diagnosis. Starting with version V3.0, the
standard now also provides support for the storage of continuous, long-term ECG
recordings and affords a repository for selected ECG sequences and the related
metadata to accommodate stress tests, drug trials and protocol-based ECG recordings.
The global and per-lead measurements sections have been extended and three new
sections have been introduced for storing beat-by-beat and/or spike-by-spike measurements\r\nand
annotations. The used terminology and the provided measurements and annotations
have been harmonized with the ISO/IEEE 11073-10102 Annotated ECG standard. Emphasis
has also been put on harmonizing the Universal Statement Codes with the CDISC
and the categorized AHA statement codes and similarly the drug and implanted devices
codes with the ATC and NASPE/BPEG codes. "
acknowledgement: The authors are thankful to Drs. Roger Abaecherli, Nikus Kjell, Paul
Kligfield, Jay Mason, Patrice Nony, Vito Starc, Anders Thurin and the late Galen
Wagner for their in depth review and constructive comments.
article_processing_charge: No
author:
- first_name: Paul
full_name: Rubel, Paul
last_name: Rubel
- first_name: Danilo
full_name: Pani, Danilo
last_name: Pani
- first_name: Alois
full_name: Schlögl, Alois
id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
last_name: Schlögl
orcid: 0000-0002-5621-8100
- first_name: Jocelyne
full_name: Fayn, Jocelyne
last_name: Fayn
- first_name: Fabio
full_name: Badilini, Fabio
last_name: Badilini
- first_name: Peter
full_name: Macfarlane, Peter
last_name: Macfarlane
- first_name: Alpo
full_name: Varri, Alpo
last_name: Varri
citation:
ama: 'Rubel P, Pani D, Schlögl A, et al. SCP-ECG V3.0: An enhanced standard communication
protocol for computer-assisted electrocardiography. In: 2016 Computing in Cardiology
Conference. Vol 43. Computing in Cardiology; 2016:309-312. doi:10.22489/cinc.2016.090-500'
apa: 'Rubel, P., Pani, D., Schlögl, A., Fayn, J., Badilini, F., Macfarlane, P.,
& Varri, A. (2016). SCP-ECG V3.0: An enhanced standard communication protocol
for computer-assisted electrocardiography. In 2016 Computing in Cardiology
Conference (Vol. 43, pp. 309–312). Vancouver, Canada: Computing in Cardiology.
https://doi.org/10.22489/cinc.2016.090-500'
chicago: 'Rubel, Paul, Danilo Pani, Alois Schlögl, Jocelyne Fayn, Fabio Badilini,
Peter Macfarlane, and Alpo Varri. “SCP-ECG V3.0: An Enhanced Standard Communication
Protocol for Computer-Assisted Electrocardiography.” In 2016 Computing in Cardiology
Conference, 43:309–12. Computing in Cardiology, 2016. https://doi.org/10.22489/cinc.2016.090-500.'
ieee: 'P. Rubel et al., “SCP-ECG V3.0: An enhanced standard communication
protocol for computer-assisted electrocardiography,” in 2016 Computing in Cardiology
Conference, Vancouver, Canada, 2016, vol. 43, pp. 309–312.'
ista: 'Rubel P, Pani D, Schlögl A, Fayn J, Badilini F, Macfarlane P, Varri A. 2016.
SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted
electrocardiography. 2016 Computing in Cardiology Conference. CinC: Computing
in Cardiology vol. 43, 309–312.'
mla: 'Rubel, Paul, et al. “SCP-ECG V3.0: An Enhanced Standard Communication Protocol
for Computer-Assisted Electrocardiography.” 2016 Computing in Cardiology Conference,
vol. 43, Computing in Cardiology, 2016, pp. 309–12, doi:10.22489/cinc.2016.090-500.'
short: P. Rubel, D. Pani, A. Schlögl, J. Fayn, F. Badilini, P. Macfarlane, A. Varri,
in:, 2016 Computing in Cardiology Conference, Computing in Cardiology, 2016, pp.
309–312.
conference:
end_date: 2016-09-14
location: Vancouver, Canada
name: 'CinC: Computing in Cardiology'
start_date: 2016-09-11
date_created: 2022-03-03T10:43:10Z
date_published: 2016-03-01T00:00:00Z
date_updated: 2022-03-04T07:34:45Z
day: '01'
department:
- _id: CampIT
doi: 10.22489/cinc.2016.090-500
intvolume: ' 43'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.22489/cinc.2016.090-500
month: '03'
oa: 1
oa_version: Published Version
page: 309-312
publication: 2016 Computing in Cardiology Conference
publication_identifier:
issn:
- 2325-887X
publication_status: published
publisher: Computing in Cardiology
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted
electrocardiography'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 43
year: '2016'
...
---
_id: '1082'
abstract:
- lang: eng
text: In many applications, it is desirable to extract only the relevant aspects
of data. A principled way to do this is the information bottleneck (IB) method,
where one seeks a code that maximises information about a relevance variable,
Y, while constraining the information encoded about the original data, X. Unfortunately
however, the IB method is computationally demanding when data are high-dimensional
and/or non-gaussian. Here we propose an approximate variational scheme for maximising
a lower bound on the IB objective, analogous to variational EM. Using this method,
we derive an IB algorithm to recover features that are both relevant and sparse.
Finally, we demonstrate how kernelised versions of the algorithm can be used to
address a broad range of problems with non-linear relation between X and Y.
alternative_title:
- Advances in Neural Information Processing Systems
author:
- first_name: Matthew J
full_name: Chalk, Matthew J
id: 2BAAC544-F248-11E8-B48F-1D18A9856A87
last_name: Chalk
orcid: 0000-0001-7782-4436
- first_name: Olivier
full_name: Marre, Olivier
last_name: Marre
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
citation:
ama: 'Chalk MJ, Marre O, Tkačik G. Relevant sparse codes with variational information
bottleneck. In: Vol 29. Neural Information Processing Systems; 2016:1965-1973.'
apa: 'Chalk, M. J., Marre, O., & Tkačik, G. (2016). Relevant sparse codes with
variational information bottleneck (Vol. 29, pp. 1965–1973). Presented at the
NIPS: Neural Information Processing Systems, Barcelona, Spain: Neural Information
Processing Systems.'
chicago: Chalk, Matthew J, Olivier Marre, and Gašper Tkačik. “Relevant Sparse Codes
with Variational Information Bottleneck,” 29:1965–73. Neural Information Processing
Systems, 2016.
ieee: 'M. J. Chalk, O. Marre, and G. Tkačik, “Relevant sparse codes with variational
information bottleneck,” presented at the NIPS: Neural Information Processing
Systems, Barcelona, Spain, 2016, vol. 29, pp. 1965–1973.'
ista: 'Chalk MJ, Marre O, Tkačik G. 2016. Relevant sparse codes with variational
information bottleneck. NIPS: Neural Information Processing Systems, Advances
in Neural Information Processing Systems, vol. 29, 1965–1973.'
mla: Chalk, Matthew J., et al. Relevant Sparse Codes with Variational Information
Bottleneck. Vol. 29, Neural Information Processing Systems, 2016, pp. 1965–73.
short: M.J. Chalk, O. Marre, G. Tkačik, in:, Neural Information Processing Systems,
2016, pp. 1965–1973.
conference:
end_date: 2016-12-10
location: Barcelona, Spain
name: 'NIPS: Neural Information Processing Systems'
start_date: 2016-12-05
date_created: 2018-12-11T11:50:03Z
date_published: 2016-12-01T00:00:00Z
date_updated: 2021-01-12T06:48:09Z
day: '01'
department:
- _id: GaTk
intvolume: ' 29'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1605.07332
month: '12'
oa: 1
oa_version: Preprint
page: 1965-1973
publication_status: published
publisher: Neural Information Processing Systems
publist_id: '6298'
quality_controlled: '1'
related_material:
link:
- relation: other
url: https://papers.nips.cc/paper/6101-relevant-sparse-codes-with-variational-information-bottleneck
scopus_import: 1
status: public
title: Relevant sparse codes with variational information bottleneck
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 29
year: '2016'
...