---
_id: '1207'
abstract:
- lang: eng
text: The eigenvalue distribution of the sum of two large Hermitian matrices, when
one of them is conjugated by a Haar distributed unitary matrix, is asymptotically
given by the free convolution of their spectral distributions. We prove that this
convergence also holds locally in the bulk of the spectrum, down to the optimal
scales larger than the eigenvalue spacing. The corresponding eigenvectors are
fully delocalized. Similar results hold for the sum of two real symmetric matrices,
when one is conjugated by Haar orthogonal matrix.
article_processing_charge: Yes (via OA deal)
author:
- first_name: Zhigang
full_name: Bao, Zhigang
id: 442E6A6C-F248-11E8-B48F-1D18A9856A87
last_name: Bao
orcid: 0000-0003-3036-1475
- 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: Kevin
full_name: Schnelli, Kevin
id: 434AD0AE-F248-11E8-B48F-1D18A9856A87
last_name: Schnelli
orcid: 0000-0003-0954-3231
citation:
ama: Bao Z, Erdös L, Schnelli K. Local law of addition of random matrices on optimal
scale. Communications in Mathematical Physics. 2017;349(3):947-990. doi:10.1007/s00220-016-2805-6
apa: Bao, Z., Erdös, L., & Schnelli, K. (2017). Local law of addition of random
matrices on optimal scale. Communications in Mathematical Physics. Springer.
https://doi.org/10.1007/s00220-016-2805-6
chicago: Bao, Zhigang, László Erdös, and Kevin Schnelli. “Local Law of Addition
of Random Matrices on Optimal Scale.” Communications in Mathematical Physics.
Springer, 2017. https://doi.org/10.1007/s00220-016-2805-6.
ieee: Z. Bao, L. Erdös, and K. Schnelli, “Local law of addition of random matrices
on optimal scale,” Communications in Mathematical Physics, vol. 349, no.
3. Springer, pp. 947–990, 2017.
ista: Bao Z, Erdös L, Schnelli K. 2017. Local law of addition of random matrices
on optimal scale. Communications in Mathematical Physics. 349(3), 947–990.
mla: Bao, Zhigang, et al. “Local Law of Addition of Random Matrices on Optimal Scale.”
Communications in Mathematical Physics, vol. 349, no. 3, Springer, 2017,
pp. 947–90, doi:10.1007/s00220-016-2805-6.
short: Z. Bao, L. Erdös, K. Schnelli, Communications in Mathematical Physics 349
(2017) 947–990.
date_created: 2018-12-11T11:50:43Z
date_published: 2017-02-01T00:00:00Z
date_updated: 2023-09-20T11:16:57Z
day: '01'
ddc:
- '530'
department:
- _id: LaEr
doi: 10.1007/s00220-016-2805-6
ec_funded: 1
external_id:
isi:
- '000393696700005'
file:
- access_level: open_access
checksum: ddff79154c3daf27237de5383b1264a9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:47Z
date_updated: 2020-07-14T12:44:39Z
file_id: '5102'
file_name: IST-2016-722-v1+1_s00220-016-2805-6.pdf
file_size: 1033743
relation: main_file
file_date_updated: 2020-07-14T12:44:39Z
has_accepted_license: '1'
intvolume: ' 349'
isi: 1
issue: '3'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 947 - 990
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Communications in Mathematical Physics
publication_identifier:
issn:
- '00103616'
publication_status: published
publisher: Springer
publist_id: '6141'
pubrep_id: '722'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Local law of addition of random matrices on optimal scale
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 349
year: '2017'
...
---
_id: '1208'
abstract:
- lang: eng
text: We study parameter estimation in linear Gaussian covariance models, which
are p-dimensional Gaussian models with linear constraints on the covariance matrix.
Maximum likelihood estimation for this class of models leads to a non-convex optimization
problem which typically has many local maxima. Using recent results on the asymptotic
distribution of extreme eigenvalues of the Wishart distribution, we provide sufficient
conditions for any hill climbing method to converge to the global maximum. Although
we are primarily interested in the case in which n≫p, the proofs of our results
utilize large sample asymptotic theory under the scheme n/p→γ>1. Remarkably,
our numerical simulations indicate that our results remain valid for p as small
as 2. An important consequence of this analysis is that, for sample sizes n≃14p,
maximum likelihood estimation for linear Gaussian covariance models behaves as
if it were a convex optimization problem. © 2016 The Royal Statistical Society
and Blackwell Publishing Ltd.
article_processing_charge: No
author:
- first_name: Piotr
full_name: Zwiernik, Piotr
last_name: Zwiernik
- first_name: Caroline
full_name: Uhler, Caroline
id: 49ADD78E-F248-11E8-B48F-1D18A9856A87
last_name: Uhler
orcid: 0000-0002-7008-0216
- first_name: Donald
full_name: Richards, Donald
last_name: Richards
citation:
ama: 'Zwiernik P, Uhler C, Richards D. Maximum likelihood estimation for linear
Gaussian covariance models. Journal of the Royal Statistical Society Series
B: Statistical Methodology. 2017;79(4):1269-1292. doi:10.1111/rssb.12217'
apa: 'Zwiernik, P., Uhler, C., & Richards, D. (2017). Maximum likelihood estimation
for linear Gaussian covariance models. Journal of the Royal Statistical Society.
Series B: Statistical Methodology. Wiley-Blackwell. https://doi.org/10.1111/rssb.12217'
chicago: 'Zwiernik, Piotr, Caroline Uhler, and Donald Richards. “Maximum Likelihood
Estimation for Linear Gaussian Covariance Models.” Journal of the Royal Statistical
Society. Series B: Statistical Methodology. Wiley-Blackwell, 2017. https://doi.org/10.1111/rssb.12217.'
ieee: 'P. Zwiernik, C. Uhler, and D. Richards, “Maximum likelihood estimation for
linear Gaussian covariance models,” Journal of the Royal Statistical Society.
Series B: Statistical Methodology, vol. 79, no. 4. Wiley-Blackwell, pp. 1269–1292,
2017.'
ista: 'Zwiernik P, Uhler C, Richards D. 2017. Maximum likelihood estimation for
linear Gaussian covariance models. Journal of the Royal Statistical Society. Series
B: Statistical Methodology. 79(4), 1269–1292.'
mla: 'Zwiernik, Piotr, et al. “Maximum Likelihood Estimation for Linear Gaussian
Covariance Models.” Journal of the Royal Statistical Society. Series B: Statistical
Methodology, vol. 79, no. 4, Wiley-Blackwell, 2017, pp. 1269–92, doi:10.1111/rssb.12217.'
short: 'P. Zwiernik, C. Uhler, D. Richards, Journal of the Royal Statistical Society.
Series B: Statistical Methodology 79 (2017) 1269–1292.'
date_created: 2018-12-11T11:50:43Z
date_published: 2017-09-01T00:00:00Z
date_updated: 2023-09-20T11:17:21Z
day: '01'
department:
- _id: CaUh
doi: 10.1111/rssb.12217
external_id:
isi:
- '000411712300012'
intvolume: ' 79'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1408.5604
month: '09'
oa: 1
oa_version: Submitted Version
page: 1269 - 1292
project:
- _id: 2530CA10-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Y 903-N35
name: 'Gaussian Graphical Models: Theory and Applications'
publication: 'Journal of the Royal Statistical Society. Series B: Statistical Methodology'
publication_identifier:
issn:
- '13697412'
publication_status: published
publisher: Wiley-Blackwell
publist_id: '6142'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Maximum likelihood estimation for linear Gaussian covariance models
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 79
year: '2017'
...
---
_id: '1211'
abstract:
- lang: eng
text: Systems such as fluid flows in channels and pipes or the complex Ginzburg–Landau
system, defined over periodic domains, exhibit both continuous symmetries, translational
and rotational, as well as discrete symmetries under spatial reflections or complex
conjugation. The simplest, and very common symmetry of this type is the equivariance
of the defining equations under the orthogonal group O(2). We formulate a novel
symmetry reduction scheme for such systems by combining the method of slices with
invariant polynomial methods, and show how it works by applying it to the Kuramoto–Sivashinsky
system in one spatial dimension. As an example, we track a relative periodic orbit
through a sequence of bifurcations to the onset of chaos. Within the symmetry-reduced
state space we are able to compute and visualize the unstable manifolds of relative
periodic orbits, their torus bifurcations, a transition to chaos via torus breakdown,
and heteroclinic connections between various relative periodic orbits. It would
be very hard to carry through such analysis in the full state space, without a
symmetry reduction such as the one we present here.
acknowledgement: 'This work was supported by the family of late G. Robinson, Jr. and
NSF Grant DMS-1211827. '
author:
- first_name: Nazmi B
full_name: Budanur, Nazmi B
id: 3EA1010E-F248-11E8-B48F-1D18A9856A87
last_name: Budanur
orcid: 0000-0003-0423-5010
- first_name: Predrag
full_name: Cvitanović, Predrag
last_name: Cvitanović
citation:
ama: Budanur NB, Cvitanović P. Unstable manifolds of relative periodic orbits in
the symmetry reduced state space of the Kuramoto–Sivashinsky system. Journal
of Statistical Physics. 2017;167(3-4):636-655. doi:10.1007/s10955-016-1672-z
apa: Budanur, N. B., & Cvitanović, P. (2017). Unstable manifolds of relative
periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky
system. Journal of Statistical Physics. Springer. https://doi.org/10.1007/s10955-016-1672-z
chicago: Budanur, Nazmi B, and Predrag Cvitanović. “Unstable Manifolds of Relative
Periodic Orbits in the Symmetry Reduced State Space of the Kuramoto–Sivashinsky
System.” Journal of Statistical Physics. Springer, 2017. https://doi.org/10.1007/s10955-016-1672-z.
ieee: N. B. Budanur and P. Cvitanović, “Unstable manifolds of relative periodic
orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system,”
Journal of Statistical Physics, vol. 167, no. 3–4. Springer, pp. 636–655,
2017.
ista: Budanur NB, Cvitanović P. 2017. Unstable manifolds of relative periodic orbits
in the symmetry reduced state space of the Kuramoto–Sivashinsky system. Journal
of Statistical Physics. 167(3–4), 636–655.
mla: Budanur, Nazmi B., and Predrag Cvitanović. “Unstable Manifolds of Relative
Periodic Orbits in the Symmetry Reduced State Space of the Kuramoto–Sivashinsky
System.” Journal of Statistical Physics, vol. 167, no. 3–4, Springer, 2017,
pp. 636–55, doi:10.1007/s10955-016-1672-z.
short: N.B. Budanur, P. Cvitanović, Journal of Statistical Physics 167 (2017) 636–655.
date_created: 2018-12-11T11:50:44Z
date_published: 2017-05-01T00:00:00Z
date_updated: 2021-01-12T06:49:07Z
day: '01'
ddc:
- '530'
department:
- _id: BjHo
doi: 10.1007/s10955-016-1672-z
file:
- access_level: open_access
checksum: 3e971d09eb167761aa0888ed415b0056
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:01Z
date_updated: 2020-07-14T12:44:39Z
file_id: '5319'
file_name: IST-2017-782-v1+1_BudCvi15.pdf
file_size: 2820207
relation: main_file
file_date_updated: 2020-07-14T12:44:39Z
has_accepted_license: '1'
intvolume: ' 167'
issue: 3-4
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 636-655
publication: Journal of Statistical Physics
publication_status: published
publisher: Springer
publist_id: '6136'
pubrep_id: '782'
quality_controlled: '1'
scopus_import: 1
status: public
title: Unstable manifolds of relative periodic orbits in the symmetry reduced state
space of the Kuramoto–Sivashinsky system
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 167
year: '2017'
...
---
_id: '1213'
abstract:
- lang: eng
text: Bacterial cytokinesis is commonly initiated by the Z-ring, a dynamic cytoskeletal
structure that assembles at the site of division. Its primary component is FtsZ,
a tubulin-like GTPase, that like its eukaryotic relative forms protein filaments
in the presence of GTP. Since the discovery of the Z-ring 25 years ago, various
models for the role of FtsZ have been suggested. However, important information
about the architecture and dynamics of FtsZ filaments during cytokinesis is still
missing. One reason for this lack of knowledge has been the small size of bacteria,
which has made it difficult to resolve the orientation and dynamics of individual
FtsZ filaments in the Z-ring. While superresolution microscopy experiments have
helped to gain more information about the organization of the Z-ring in the dividing
cell, they were not yet able to elucidate a mechanism of how FtsZ filaments reorganize
during assembly and disassembly of the Z-ring. In this chapter, we explain how
to use an in vitro reconstitution approach to investigate the self-organization
of FtsZ filaments recruited to a biomimetic lipid bilayer by its membrane anchor
FtsA. We show how to perform single-molecule experiments to study the behavior
of individual FtsZ monomers during the constant reorganization of the FtsZ-FtsA
filament network. We describe how to analyze the dynamics of single molecules
and explain why this information can help to shed light onto possible mechanism
of Z-ring constriction. We believe that similar experimental approaches will be
useful to study the mechanism of membrane-based polymerization of other cytoskeletal
systems, not only from prokaryotic but also eukaryotic origin.
acknowledged_ssus:
- _id: Bio
acknowledgement: Natalia Baranova is supported by an EMBO Long-Term Fellowship (EMBO
ALTF 1163-2015) and Martin Loose by an ERC Starting Grant (ERCStG-2015-SelfOrganiCell).
alternative_title:
- Methods in Cell Biology
article_processing_charge: No
author:
- first_name: Natalia
full_name: Baranova, Natalia
id: 38661662-F248-11E8-B48F-1D18A9856A87
last_name: Baranova
orcid: 0000-0002-3086-9124
- first_name: Martin
full_name: Loose, Martin
id: 462D4284-F248-11E8-B48F-1D18A9856A87
last_name: Loose
orcid: 0000-0001-7309-9724
citation:
ama: 'Baranova NS, Loose M. Single-molecule measurements to study polymerization
dynamics of FtsZ-FtsA copolymers. In: Echard A, ed. Cytokinesis. Vol 137.
Academic Press; 2017:355-370. doi:10.1016/bs.mcb.2016.03.036'
apa: Baranova, N. S., & Loose, M. (2017). Single-molecule measurements to study
polymerization dynamics of FtsZ-FtsA copolymers. In A. Echard (Ed.), Cytokinesis
(Vol. 137, pp. 355–370). Academic Press. https://doi.org/10.1016/bs.mcb.2016.03.036
chicago: Baranova, Natalia S., and Martin Loose. “Single-Molecule Measurements to
Study Polymerization Dynamics of FtsZ-FtsA Copolymers.” In Cytokinesis,
edited by Arnaud Echard, 137:355–70. Academic Press, 2017. https://doi.org/10.1016/bs.mcb.2016.03.036.
ieee: N. S. Baranova and M. Loose, “Single-molecule measurements to study polymerization
dynamics of FtsZ-FtsA copolymers,” in Cytokinesis, vol. 137, A. Echard,
Ed. Academic Press, 2017, pp. 355–370.
ista: 'Baranova NS, Loose M. 2017.Single-molecule measurements to study polymerization
dynamics of FtsZ-FtsA copolymers. In: Cytokinesis. Methods in Cell Biology, vol.
137, 355–370.'
mla: Baranova, Natalia S., and Martin Loose. “Single-Molecule Measurements to Study
Polymerization Dynamics of FtsZ-FtsA Copolymers.” Cytokinesis, edited by
Arnaud Echard, vol. 137, Academic Press, 2017, pp. 355–70, doi:10.1016/bs.mcb.2016.03.036.
short: N.S. Baranova, M. Loose, in:, A. Echard (Ed.), Cytokinesis, Academic Press,
2017, pp. 355–370.
date_created: 2018-12-11T11:50:45Z
date_published: 2017-12-01T00:00:00Z
date_updated: 2023-09-20T11:16:30Z
day: '01'
department:
- _id: MaLo
doi: 10.1016/bs.mcb.2016.03.036
ec_funded: 1
editor:
- first_name: 'Arnaud '
full_name: 'Echard, Arnaud '
last_name: Echard
external_id:
isi:
- '000403542900022'
intvolume: ' 137'
isi: 1
language:
- iso: eng
month: '12'
oa_version: None
page: 355 - 370
project:
- _id: 2596EAB6-B435-11E9-9278-68D0E5697425
grant_number: ALTF 2015-1163
name: Synthesis of bacterial cell wall
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Cytokinesis
publication_identifier:
issn:
- 0091679X
publication_status: published
publisher: Academic Press
publist_id: '6134'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Single-molecule measurements to study polymerization dynamics of FtsZ-FtsA
copolymers
type: book_chapter
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 137
year: '2017'
...
---
_id: '274'
abstract:
- lang: eng
text: We consider the problem of estimating the partition function Z(β)=∑xexp(−β(H(x))
of a Gibbs distribution with a Hamilton H(⋅), or more precisely the logarithm
of the ratio q=lnZ(0)/Z(β). It has been recently shown how to approximate q with
high probability assuming the existence of an oracle that produces samples from
the Gibbs distribution for a given parameter value in [0,β]. The current best
known approach due to Huber [9] uses O(qlnn⋅[lnq+lnlnn+ε−2]) oracle calls on average
where ε is the desired accuracy of approximation and H(⋅) is assumed to lie in
{0}∪[1,n]. We improve the complexity to O(qlnn⋅ε−2) oracle calls. We also show
that the same complexity can be achieved if exact oracles are replaced with approximate
sampling oracles that are within O(ε2qlnn) variation distance from exact oracles.
Finally, we prove a lower bound of Ω(q⋅ε−2) oracle calls under a natural model
of computation.
article_processing_charge: No
arxiv: 1
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Kolmogorov V. A faster approximation algorithm for the Gibbs partition function.
In: Proceedings of the 31st Conference On Learning Theory. Vol 75. ML Research
Press; 2017:228-249.'
apa: Kolmogorov, V. (2017). A faster approximation algorithm for the Gibbs partition
function. In Proceedings of the 31st Conference On Learning Theory (Vol.
75, pp. 228–249). ML Research Press.
chicago: Kolmogorov, Vladimir. “A Faster Approximation Algorithm for the Gibbs Partition
Function.” In Proceedings of the 31st Conference On Learning Theory, 75:228–49.
ML Research Press, 2017.
ieee: V. Kolmogorov, “A faster approximation algorithm for the Gibbs partition function,”
in Proceedings of the 31st Conference On Learning Theory, 2017, vol. 75,
pp. 228–249.
ista: 'Kolmogorov V. 2017. A faster approximation algorithm for the Gibbs partition
function. Proceedings of the 31st Conference On Learning Theory. COLT: Annual
Conference on Learning Theory vol. 75, 228–249.'
mla: Kolmogorov, Vladimir. “A Faster Approximation Algorithm for the Gibbs Partition
Function.” Proceedings of the 31st Conference On Learning Theory, vol.
75, ML Research Press, 2017, pp. 228–49.
short: V. Kolmogorov, in:, Proceedings of the 31st Conference On Learning Theory,
ML Research Press, 2017, pp. 228–249.
conference:
end_date: 2018-07-09
name: 'COLT: Annual Conference on Learning Theory '
start_date: 2018-07-06
date_created: 2018-12-11T11:45:33Z
date_published: 2017-12-27T00:00:00Z
date_updated: 2023-10-17T12:32:13Z
day: '27'
ddc:
- '510'
department:
- _id: VlKo
ec_funded: 1
external_id:
arxiv:
- '1608.04223'
file:
- access_level: open_access
checksum: 89db06a0e8083524449cb59b56bf4e5b
content_type: application/pdf
creator: dernst
date_created: 2020-05-12T09:23:27Z
date_updated: 2020-07-14T12:45:45Z
file_id: '7820'
file_name: 2018_PMLR_Kolmogorov.pdf
file_size: 408974
relation: main_file
file_date_updated: 2020-07-14T12:45:45Z
has_accepted_license: '1'
intvolume: ' 75'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 228-249
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: Proceedings of the 31st Conference On Learning Theory
publication_status: published
publisher: ML Research Press
publist_id: '7628'
quality_controlled: '1'
status: public
title: A faster approximation algorithm for the Gibbs partition function
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 75
year: '2017'
...
---
_id: '313'
abstract:
- lang: eng
text: 'Tunneling of a particle through a potential barrier remains one of the most
remarkable quantum phenomena. Owing to advances in laser technology, electric
fields comparable to those electrons experience in atoms are readily generated
and open opportunities to dynamically investigate the process of electron tunneling
through the potential barrier formed by the superposition of both laser and atomic
fields. Attosecond-time and angstrom-space resolution of the strong laser-field
technique allow to address fundamental questions related to tunneling, which are
still open and debated: Which time is spent under the barrier and what momentum
is picked up by the particle in the meantime? In this combined experimental and
theoretical study we demonstrate that for strong-field ionization the leading
quantum mechanical Wigner treatment for the time resolved description of tunneling
is valid. We achieve a high sensitivity on the tunneling barrier and unambiguously
isolate its effects by performing a differential study of two systems with almost
identical tunneling geometry. Moreover, working with a low frequency laser, we
essentially limit the non-adiabaticity of the process as a major source of uncertainty.
The agreement between experiment and theory implies two substantial corrections
with respect to the widely employed quasiclassical treatment: In addition to a
non-vanishing longitudinal momentum along the laser field-direction we provide
clear evidence for a non-zero tunneling time delay. This addresses also the fundamental
question how the transition occurs from the tunnel barrier to free space classical
evolution of the ejected electron.'
alternative_title:
- 'Journal of Physics: Conference Series'
article_number: '012004'
arxiv: 1
author:
- first_name: Nicolas
full_name: Camus, Nicolas
last_name: Camus
- first_name: Enderalp
full_name: Yakaboylu, Enderalp
id: 38CB71F6-F248-11E8-B48F-1D18A9856A87
last_name: Yakaboylu
orcid: 0000-0001-5973-0874
- first_name: Lutz
full_name: Fechner, Lutz
last_name: Fechner
- first_name: Michael
full_name: Klaiber, Michael
last_name: Klaiber
- first_name: Martin
full_name: Laux, Martin
last_name: Laux
- first_name: Yonghao
full_name: Mi, Yonghao
last_name: Mi
- first_name: Karen
full_name: Hatsagortsyan, Karen
last_name: Hatsagortsyan
- first_name: Thomas
full_name: Pfeifer, Thomas
last_name: Pfeifer
- first_name: Cristoph
full_name: Keitel, Cristoph
last_name: Keitel
- first_name: Robert
full_name: Moshammer, Robert
last_name: Moshammer
citation:
ama: 'Camus N, Yakaboylu E, Fechner L, et al. Experimental evidence for Wigner’s
tunneling time. In: Vol 999. American Physical Society; 2017. doi:10.1088/1742-6596/999/1/012004'
apa: 'Camus, N., Yakaboylu, E., Fechner, L., Klaiber, M., Laux, M., Mi, Y., … Moshammer,
R. (2017). Experimental evidence for Wigner’s tunneling time (Vol. 999). Presented
at the Annual International Laser Physics Workshop LPHYS, Kazan, Russian Federation:
American Physical Society. https://doi.org/10.1088/1742-6596/999/1/012004'
chicago: Camus, Nicolas, Enderalp Yakaboylu, Lutz Fechner, Michael Klaiber, Martin
Laux, Yonghao Mi, Karen Hatsagortsyan, Thomas Pfeifer, Cristoph Keitel, and Robert
Moshammer. “Experimental Evidence for Wigner’s Tunneling Time,” Vol. 999. American
Physical Society, 2017. https://doi.org/10.1088/1742-6596/999/1/012004.
ieee: N. Camus et al., “Experimental evidence for Wigner’s tunneling time,”
presented at the Annual International Laser Physics Workshop LPHYS, Kazan, Russian
Federation, 2017, vol. 999, no. 1.
ista: 'Camus N, Yakaboylu E, Fechner L, Klaiber M, Laux M, Mi Y, Hatsagortsyan K,
Pfeifer T, Keitel C, Moshammer R. 2017. Experimental evidence for Wigner’s tunneling
time. Annual International Laser Physics Workshop LPHYS, Journal of Physics: Conference
Series, vol. 999, 012004.'
mla: Camus, Nicolas, et al. Experimental Evidence for Wigner’s Tunneling Time.
Vol. 999, no. 1, 012004, American Physical Society, 2017, doi:10.1088/1742-6596/999/1/012004.
short: N. Camus, E. Yakaboylu, L. Fechner, M. Klaiber, M. Laux, Y. Mi, K. Hatsagortsyan,
T. Pfeifer, C. Keitel, R. Moshammer, in:, American Physical Society, 2017.
conference:
end_date: 2017-08-21
location: Kazan, Russian Federation
name: Annual International Laser Physics Workshop LPHYS
start_date: 2017-08-17
date_created: 2018-12-11T11:45:46Z
date_published: 2017-07-14T00:00:00Z
date_updated: 2023-02-23T12:36:07Z
day: '14'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.1088/1742-6596/999/1/012004
external_id:
arxiv:
- '1611.03701'
file:
- access_level: open_access
checksum: 6e70b525a84f6d5fb175c48e9f5cb59a
content_type: application/pdf
creator: dernst
date_created: 2019-01-22T08:34:10Z
date_updated: 2020-07-14T12:46:00Z
file_id: '5871'
file_name: 2017_Physics_Camus.pdf
file_size: 949321
relation: main_file
file_date_updated: 2020-07-14T12:46:00Z
has_accepted_license: '1'
intvolume: ' 999'
issue: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication_identifier:
issn:
- '17426588'
publication_status: published
publisher: American Physical Society
publist_id: '7552'
quality_controlled: '1'
related_material:
record:
- id: '6013'
relation: later_version
status: public
scopus_import: 1
status: public
title: Experimental evidence for Wigner's tunneling time
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 999
year: '2017'
...
---
_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).'
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: 2024-02-28T12:59:37Z
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
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1310.4613v3
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: 4435EBFC-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
date_created: 2018-12-11T11:46:26Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2023-10-17T11:48:03Z
day: '01'
department:
- _id: DaAl
external_id:
arxiv:
- '1610.02132'
intvolume: ' 2017'
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:
- '10495258'
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
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
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: '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: '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: '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: '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.
date_created: 2018-12-11T11:46:35Z
date_published: 2017-04-04T00:00:00Z
date_updated: 2023-10-17T12:28: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'
...
---
_id: '463'
abstract:
- lang: eng
text: We investigate transient behaviors induced by magnetic fields on the dynamics
of the flow of a ferrofluid in the gap between two concentric, independently rotating
cylinders. Without applying any magnetic fields, we uncover emergence of flow
states constituted by a combination of a localized spiral state (SPIl) in the
top and bottom of the annulus and different multi-cell flow states (SPI2v, SPI3v)
with toroidally closed vortices in the interior of the bulk (SPIl+2v = SPIl +
SPI2v and SPIl+3v = SPIl + SPI3v). However, when a magnetic field is presented,
we observe the transient behaviors between multi-cell states passing through two
critical thresholds in a strength of an axial (transverse) magnetic field. Before
the first critical threshold of a magnetic field strength, multi-stable states
with different number of cells could be observed. After the first critical threshold,
we find the transient behavior between the three- and two-cell flow states. For
more strength of magnetic field or after the second critical threshold, we discover
that multi-cell states are disappeared and a localized spiral state remains to
be stimulated. The studied transient behavior could be understood by the investigation
of various quantities including a modal kinetic energy, a mode amplitude of the
radial velocity, wavenumber, angular momentum, and torque. In addition, the emergence
of new flow states and the transient behavior between their states in ferrofluidic
flows indicate that richer and potentially controllable dynamics through magnetic
fields could be possible in ferrofluic flow.
article_number: '113112'
article_processing_charge: No
article_type: original
author:
- first_name: Sebastian
full_name: Altmeyer, Sebastian
id: 2EE67FDC-F248-11E8-B48F-1D18A9856A87
last_name: Altmeyer
orcid: 0000-0001-5964-0203
- first_name: Younghae
full_name: Do, Younghae
last_name: Do
- first_name: Soorok
full_name: Ryu, Soorok
last_name: Ryu
citation:
ama: Altmeyer S, Do Y, Ryu S. Transient behavior between multi-cell flow states
in ferrofluidic Taylor-Couette flow. Chaos. 2017;27(11). doi:10.1063/1.5002771
apa: Altmeyer, S., Do, Y., & Ryu, S. (2017). Transient behavior between multi-cell
flow states in ferrofluidic Taylor-Couette flow. Chaos. AIP Publishing.
https://doi.org/10.1063/1.5002771
chicago: Altmeyer, Sebastian, Younghae Do, and Soorok Ryu. “Transient Behavior between
Multi-Cell Flow States in Ferrofluidic Taylor-Couette Flow.” Chaos. AIP
Publishing, 2017. https://doi.org/10.1063/1.5002771.
ieee: S. Altmeyer, Y. Do, and S. Ryu, “Transient behavior between multi-cell flow
states in ferrofluidic Taylor-Couette flow,” Chaos, vol. 27, no. 11. AIP
Publishing, 2017.
ista: Altmeyer S, Do Y, Ryu S. 2017. Transient behavior between multi-cell flow
states in ferrofluidic Taylor-Couette flow. Chaos. 27(11), 113112.
mla: Altmeyer, Sebastian, et al. “Transient Behavior between Multi-Cell Flow States
in Ferrofluidic Taylor-Couette Flow.” Chaos, vol. 27, no. 11, 113112, AIP
Publishing, 2017, doi:10.1063/1.5002771.
short: S. Altmeyer, Y. Do, S. Ryu, Chaos 27 (2017).
date_created: 2018-12-11T11:46:37Z
date_published: 2017-11-01T00:00:00Z
date_updated: 2024-02-28T13:02:12Z
day: '01'
ddc:
- '530'
department:
- _id: BjHo
doi: 10.1063/1.5002771
file:
- access_level: open_access
checksum: 0731f9d416760c1062db258ca51f8bdc
content_type: application/pdf
creator: dernst
date_created: 2019-10-24T15:14:30Z
date_updated: 2020-07-14T12:46:32Z
file_id: '6970'
file_name: 2017_Chaos_Altmeyer.pdf
file_size: 7714020
relation: main_file
file_date_updated: 2020-07-14T12:46:32Z
has_accepted_license: '1'
intvolume: ' 27'
issue: '11'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
publication: Chaos
publication_identifier:
issn:
- '10541500'
publication_status: published
publisher: AIP Publishing
publist_id: '7358'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette
flow
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 27
year: '2017'
...
---
_id: '464'
abstract:
- lang: eng
text: The computation of the winning set for parity objectives and for Streett objectives
in graphs as well as in game graphs are central problems in computer-aided verification,
with application to the verification of closed systems with strong fairness conditions,
the verification of open systems, checking interface compatibility, well-formedness
of specifications, and the synthesis of reactive systems. We show how to compute
the winning set on n vertices for (1) parity-3 (aka one-pair Streett) objectives
in game graphs in time O(n5/2) and for (2) k-pair Streett objectives in graphs
in time O(n2+nklogn). For both problems this gives faster algorithms for dense
graphs and represents the first improvement in asymptotic running time in 15 years.
article_number: '26'
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: 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, Henzinger MH, Loitzenbauer V. Improved algorithms for parity
and Streett objectives. Logical Methods in Computer Science. 2017;13(3).
doi:10.23638/LMCS-13(3:26)2017
apa: Chatterjee, K., Henzinger, M. H., & Loitzenbauer, V. (2017). Improved algorithms
for parity and Streett objectives. Logical Methods in Computer Science.
International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:26)2017
chicago: Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer.
“Improved Algorithms for Parity and Streett Objectives.” Logical Methods in
Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:26)2017.
ieee: K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms
for parity and Streett objectives,” Logical Methods in Computer Science,
vol. 13, no. 3. International Federation of Computational Logic, 2017.
ista: Chatterjee K, Henzinger MH, Loitzenbauer V. 2017. Improved algorithms for
parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26.
mla: Chatterjee, Krishnendu, et al. “Improved Algorithms for Parity and Streett
Objectives.” Logical Methods in Computer Science, vol. 13, no. 3, 26, International
Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:26)2017.
short: K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, Logical Methods in Computer
Science 13 (2017).
date_created: 2018-12-11T11:46:37Z
date_published: 2017-09-26T00:00:00Z
date_updated: 2025-06-02T08:53:41Z
day: '26'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.23638/LMCS-13(3:26)2017
ec_funded: 1
external_id:
arxiv:
- '1410.0833'
file:
- access_level: open_access
checksum: 12d469ae69b80361333d7dead965cf5d
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:27Z
date_updated: 2020-07-14T12:46:32Z
file_id: '5010'
file_name: IST-2018-956-v1+1_2017_Chatterjee_Improved_algorithms.pdf
file_size: 582940
relation: main_file
file_date_updated: 2020-07-14T12:46:32Z
has_accepted_license: '1'
intvolume: ' 13'
issue: '3'
language:
- iso: eng
month: '09'
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: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: Logical Methods in Computer Science
publication_identifier:
issn:
- 1860-5974
publication_status: published
publisher: International Federation of Computational Logic
publist_id: '7357'
pubrep_id: '956'
quality_controlled: '1'
related_material:
record:
- id: '1661'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Improved algorithms for parity and Streett objectives
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: 13
year: '2017'
...
---
_id: '465'
abstract:
- lang: eng
text: 'The edit distance between two words w 1 , w 2 is the minimal number of word
operations (letter insertions, deletions, and substitutions) necessary to transform
w 1 to w 2 . The edit distance generalizes to languages L 1 , L 2 , where the
edit distance from L 1 to L 2 is the minimal number k such that for every word
from L 1 there exists a word in L 2 with edit distance at most k . We study the
edit distance computation problem between pushdown automata and their subclasses.
The problem of computing edit distance to a pushdown automaton is undecidable,
and in practice, the interesting question is to compute the edit distance from
a pushdown automaton (the implementation, a standard model for programs with recursion)
to a regular language (the specification). In this work, we present a complete
picture of decidability and complexity for the following problems: (1) deciding
whether, for a given threshold k , the edit distance from a pushdown automaton
to a finite automaton is at most k , and (2) deciding whether the edit distance
from a pushdown automaton to a finite automaton is finite. '
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- 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: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Jan
full_name: Otop, Jan
last_name: Otop
citation:
ama: Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown
automata. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:23)2017
apa: Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2017).
Edit distance for pushdown automata. Logical Methods in Computer Science.
International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:23)2017
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan
Otop. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science.
International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:23)2017.
ieee: K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance
for pushdown automata,” Logical Methods in Computer Science, vol. 13, no.
3. International Federation of Computational Logic, 2017.
ista: Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for
pushdown automata. Logical Methods in Computer Science. 13(3).
mla: Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” Logical
Methods in Computer Science, vol. 13, no. 3, International Federation of Computational
Logic, 2017, doi:10.23638/LMCS-13(3:23)2017.
short: K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods
in Computer Science 13 (2017).
date_created: 2018-12-11T11:46:37Z
date_published: 2017-09-13T00:00:00Z
date_updated: 2023-02-23T12:26:25Z
day: '13'
ddc:
- '004'
department:
- _id: KrCh
- _id: ToHe
doi: 10.23638/LMCS-13(3:23)2017
ec_funded: 1
file:
- access_level: open_access
checksum: 08041379ba408d40664f449eb5907a8f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:37Z
date_updated: 2020-07-14T12:46:33Z
file_id: '5090'
file_name: IST-2015-321-v1+1_main.pdf
file_size: 279071
relation: main_file
- access_level: open_access
checksum: 08041379ba408d40664f449eb5907a8f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:38Z
date_updated: 2020-07-14T12:46:33Z
file_id: '5091'
file_name: IST-2018-955-v1+1_2017_Chatterjee_Edit_distance.pdf
file_size: 279071
relation: main_file
file_date_updated: 2020-07-14T12:46:33Z
has_accepted_license: '1'
intvolume: ' 13'
issue: '3'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: Logical Methods in Computer Science
publication_identifier:
issn:
- '18605974'
publication_status: published
publisher: International Federation of Computational Logic
publist_id: '7356'
pubrep_id: '955'
quality_controlled: '1'
related_material:
record:
- id: '1610'
relation: earlier_version
status: public
- id: '5438'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Edit distance for pushdown automata
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: 13
year: '2017'
...
---
_id: '466'
abstract:
- lang: eng
text: 'We consider Markov decision processes (MDPs) with multiple limit-average
(or mean-payoff) objectives. There exist two different views: (i) the expectation
semantics, where the goal is to optimize the expected mean-payoff objective, and
(ii) the satisfaction semantics, where the goal is to maximize the probability
of runs such that the mean-payoff value stays above a given vector. We consider
optimization with respect to both objectives at once, thus unifying the existing
semantics. Precisely, the goal is to optimize the expectation while ensuring the
satisfaction constraint. Our problem captures the notion of optimization with
respect to strategies that are risk-averse (i.e., ensure certain probabilistic
guarantee). Our main results are as follows: First, we present algorithms for
the decision problems which are always polynomial in the size of the MDP. We also
show that an approximation of the Pareto-curve can be computed in time polynomial
in the size of the MDP, and the approximation factor, but exponential in the number
of dimensions. Second, we present a complete characterization of the strategy
complexity (in terms of memory bounds and randomization) required to solve our
problem. '
article_number: '15'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Zuzana
full_name: Křetínská, Zuzana
last_name: Křetínská
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
citation:
ama: Chatterjee K, Křetínská Z, Kretinsky J. Unifying two views on multiple mean-payoff
objectives in Markov decision processes. Logical Methods in Computer Science.
2017;13(2). doi:10.23638/LMCS-13(2:15)2017
apa: Chatterjee, K., Křetínská, Z., & Kretinsky, J. (2017). Unifying two views
on multiple mean-payoff objectives in Markov decision processes. Logical Methods
in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(2:15)2017
chicago: Chatterjee, Krishnendu, Zuzana Křetínská, and Jan Kretinsky. “Unifying
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical
Methods in Computer Science. International Federation of Computational Logic,
2017. https://doi.org/10.23638/LMCS-13(2:15)2017.
ieee: K. Chatterjee, Z. Křetínská, and J. Kretinsky, “Unifying two views on multiple
mean-payoff objectives in Markov decision processes,” Logical Methods in Computer
Science, vol. 13, no. 2. International Federation of Computational Logic,
2017.
ista: Chatterjee K, Křetínská Z, Kretinsky J. 2017. Unifying two views on multiple
mean-payoff objectives in Markov decision processes. Logical Methods in Computer
Science. 13(2), 15.
mla: Chatterjee, Krishnendu, et al. “Unifying Two Views on Multiple Mean-Payoff
Objectives in Markov Decision Processes.” Logical Methods in Computer Science,
vol. 13, no. 2, 15, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(2:15)2017.
short: K. Chatterjee, Z. Křetínská, J. Kretinsky, Logical Methods in Computer Science
13 (2017).
date_created: 2018-12-11T11:46:38Z
date_published: 2017-07-03T00:00:00Z
date_updated: 2023-02-23T12:26:16Z
day: '03'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.23638/LMCS-13(2:15)2017
ec_funded: 1
file:
- access_level: open_access
checksum: bfa405385ec6229ad5ead89ab5751639
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:32Z
date_updated: 2020-07-14T12:46:33Z
file_id: '5354'
file_name: IST-2018-957-v1+1_2017_Chatterjee_Unifying_two.pdf
file_size: 511832
relation: main_file
file_date_updated: 2020-07-14T12:46:33Z
has_accepted_license: '1'
intvolume: ' 13'
issue: '2'
language:
- iso: eng
month: '07'
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: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2590DB08-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '701309'
name: Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes
(H2020)
publication: Logical Methods in Computer Science
publication_identifier:
issn:
- '18605974'
publication_status: published
publisher: International Federation of Computational Logic
publist_id: '7355'
pubrep_id: '957'
quality_controlled: '1'
related_material:
record:
- id: '1657'
relation: earlier_version
status: public
- id: '5429'
relation: earlier_version
status: public
- id: '5435'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Unifying two views on multiple mean-payoff objectives in Markov decision processes
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: 13
year: '2017'
...
---
_id: '467'
abstract:
- lang: eng
text: Recently there has been a significant effort to handle quantitative properties
in formal verification and synthesis. While weighted automata over finite and
infinite words provide a natural and flexible framework to express quantitative
properties, perhaps surprisingly, some basic system properties such as average
response time cannot be expressed using weighted automata or in any other known
decidable formalism. In this work, we introduce nested weighted automata as a
natural extension of weighted automata, which makes it possible to express important
quantitative properties such as average response time. In nested weighted automata,
a master automaton spins off and collects results from weighted slave automata,
each of which computes a quantity along a finite portion of an infinite word.
Nested weighted automata can be viewed as the quantitative analogue of monitor
automata, which are used in runtime verification. We establish an almost-complete
decidability picture for the basic decision problems about nested weighted automata
and illustrate their applicability in several domains. In particular, nested weighted
automata can be used to decide average response time properties.
article_number: '31'
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: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. ACM Transactions
on Computational Logic (TOCL). 2017;18(4). doi:10.1145/3152769
apa: Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Nested weighted automata.
ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/3152769
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted
Automata.” ACM Transactions on Computational Logic (TOCL). ACM, 2017. https://doi.org/10.1145/3152769.
ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” ACM
Transactions on Computational Logic (TOCL), vol. 18, no. 4. ACM, 2017.
ista: Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions
on Computational Logic (TOCL). 18(4), 31.
mla: Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” ACM Transactions
on Computational Logic (TOCL), vol. 18, no. 4, 31, ACM, 2017, doi:10.1145/3152769.
short: K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational
Logic (TOCL) 18 (2017).
date_created: 2018-12-11T11:46:38Z
date_published: 2017-12-01T00:00:00Z
date_updated: 2023-02-23T12:26:19Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1145/3152769
ec_funded: 1
external_id:
arxiv:
- '1606.03598'
intvolume: ' 18'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1606.03598
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: ACM Transactions on Computational Logic (TOCL)
publication_identifier:
issn:
- '15293785'
publication_status: published
publisher: ACM
publist_id: '7354'
quality_controlled: '1'
related_material:
record:
- id: '1656'
relation: earlier_version
status: public
- id: '5415'
relation: earlier_version
status: public
- id: '5436'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Nested weighted automata
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 18
year: '2017'
...
---
_id: '470'
abstract:
- lang: eng
text: This paper presents a method for simulating water surface waves as a displacement
field on a 2D domain. Our method relies on Lagrangian particles that carry packets
of water wave energy; each packet carries information about an entire group of
wave trains, as opposed to only a single wave crest. Our approach is unconditionally
stable and can simulate high resolution geometric details. This approach also
presents a straightforward interface for artistic control, because it is essentially
a particle system with intuitive parameters like wavelength and amplitude. Our
implementation parallelizes well and runs in real time for moderately challenging
scenarios.
acknowledged_ssus:
- _id: ScienComp
article_number: '103'
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Stefan
full_name: Jeschke, Stefan
id: 44D6411A-F248-11E8-B48F-1D18A9856A87
last_name: Jeschke
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
citation:
ama: Jeschke S, Wojtan C. Water wave packets. ACM Transactions on Graphics.
2017;36(4). doi:10.1145/3072959.3073678
apa: Jeschke, S., & Wojtan, C. (2017). Water wave packets. ACM Transactions
on Graphics. ACM. https://doi.org/10.1145/3072959.3073678
chicago: Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions
on Graphics. ACM, 2017. https://doi.org/10.1145/3072959.3073678.
ieee: S. Jeschke and C. Wojtan, “Water wave packets,” ACM Transactions on Graphics,
vol. 36, no. 4. ACM, 2017.
ista: Jeschke S, Wojtan C. 2017. Water wave packets. ACM Transactions on Graphics.
36(4), 103.
mla: Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions
on Graphics, vol. 36, no. 4, 103, ACM, 2017, doi:10.1145/3072959.3073678.
short: S. Jeschke, C. Wojtan, ACM Transactions on Graphics 36 (2017).
date_created: 2018-12-11T11:46:39Z
date_published: 2017-07-01T00:00:00Z
date_updated: 2023-02-23T12:20:26Z
day: '01'
ddc:
- '006'
department:
- _id: ChWo
doi: 10.1145/3072959.3073678
ec_funded: 1
file:
- access_level: open_access
checksum: 82a3b2bfeee4ddef16ecc21675d1a48a
content_type: application/pdf
creator: wojtan
date_created: 2020-01-24T09:32:35Z
date_updated: 2020-07-14T12:46:34Z
file_id: '7359'
file_name: wavepackets_final.pdf
file_size: 13131683
relation: main_file
file_date_updated: 2020-07-14T12:46:34Z
has_accepted_license: '1'
intvolume: ' 36'
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '638176'
name: Efficient Simulation of Natural Phenomena at Extremely Large Scales
publication: ACM Transactions on Graphics
publication_identifier:
issn:
- '07300301'
publication_status: published
publisher: ACM
publist_id: '7350'
quality_controlled: '1'
scopus_import: 1
status: public
title: Water wave packets
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2017'
...
---
_id: '471'
abstract:
- lang: eng
text: 'We present a new algorithm for the statistical model checking of Markov chains
with respect to unbounded temporal properties, including full linear temporal
logic. The main idea is that we monitor each simulation run on the fly, in order
to detect quickly if a bottom strongly connected component is entered with high
probability, in which case the simulation run can be terminated early. As a result,
our simulation runs are often much shorter than required by termination bounds
that are computed a priori for a desired level of confidence on a large state
space. In comparison to previous algorithms for statistical model checking our
method is not only faster in many cases but also requires less information about
the system, namely, only the minimum transition probability that occurs in the
Markov chain. In addition, our method can be generalised to unbounded quantitative
properties such as mean-payoff bounds. '
article_number: '12'
author:
- first_name: Przemyslaw
full_name: Daca, Przemyslaw
id: 49351290-F248-11E8-B48F-1D18A9856A87
last_name: Daca
- 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: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Tatjana
full_name: Petrov, Tatjana
id: 3D5811FC-F248-11E8-B48F-1D18A9856A87
last_name: Petrov
orcid: 0000-0002-9041-0905
citation:
ama: Daca P, Henzinger TA, Kretinsky J, Petrov T. Faster statistical model checking
for unbounded temporal properties. ACM Transactions on Computational Logic
(TOCL). 2017;18(2). doi:10.1145/3060139
apa: Daca, P., Henzinger, T. A., Kretinsky, J., & Petrov, T. (2017). Faster
statistical model checking for unbounded temporal properties. ACM Transactions
on Computational Logic (TOCL). ACM. https://doi.org/10.1145/3060139
chicago: Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov.
“Faster Statistical Model Checking for Unbounded Temporal Properties.” ACM
Transactions on Computational Logic (TOCL). ACM, 2017. https://doi.org/10.1145/3060139.
ieee: P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Faster statistical
model checking for unbounded temporal properties,” ACM Transactions on Computational
Logic (TOCL), vol. 18, no. 2. ACM, 2017.
ista: Daca P, Henzinger TA, Kretinsky J, Petrov T. 2017. Faster statistical model
checking for unbounded temporal properties. ACM Transactions on Computational
Logic (TOCL). 18(2), 12.
mla: Daca, Przemyslaw, et al. “Faster Statistical Model Checking for Unbounded Temporal
Properties.” ACM Transactions on Computational Logic (TOCL), vol. 18, no.
2, 12, ACM, 2017, doi:10.1145/3060139.
short: P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, ACM Transactions on Computational
Logic (TOCL) 18 (2017).
date_created: 2018-12-11T11:46:39Z
date_published: 2017-05-01T00:00:00Z
date_updated: 2023-02-21T16:48:11Z
day: '01'
department:
- _id: ToHe
doi: 10.1145/3060139
ec_funded: 1
intvolume: ' 18'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1504.05739
month: '05'
oa: 1
oa_version: Submitted Version
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _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: The Wittgenstein Prize
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: ACM Transactions on Computational Logic (TOCL)
publication_identifier:
issn:
- '15293785'
publication_status: published
publisher: ACM
publist_id: '7349'
quality_controlled: '1'
related_material:
record:
- id: '1234'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Faster statistical model checking for unbounded temporal properties
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 18
year: '2017'
...