---
_id: '989'
abstract:
- lang: eng
text: We present a generalized optimal transport model in which the mass-preserving
constraint for the L2-Wasserstein distance is relaxed by introducing a source
term in the continuity equation. The source term is also incorporated in the path
energy by means of its squared L2-norm in time of a functional with linear growth
in space. This extension of the original transport model enables local density
modulations, which is a desirable feature in applications such as image warping
and blending. A key advantage of the use of a functional with linear growth in
space is that it allows for singular sources and sinks, which can be supported
on points or lines. On a technical level, the L2-norm in time ensures a disintegration
of the source in time, which we use to obtain the well-posedness of the model
and the existence of geodesic paths. The numerical discretization is based on
the proximal splitting approach [18] and selected numerical test cases show the
potential of the proposed approach. Furthermore, the approach is applied to the
warping and blending of textures.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
- first_name: Martin
full_name: Rumpf, Martin
last_name: Rumpf
- first_name: Stefan
full_name: Simon, Stefan
last_name: Simon
citation:
ama: 'Maas J, Rumpf M, Simon S. Transport based image morphing with intensity modulation.
In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:563-577.
doi:10.1007/978-3-319-58771-4_45'
apa: 'Maas, J., Rumpf, M., & Simon, S. (2017). Transport based image morphing
with intensity modulation. In F. Lauze, Y. Dong, & A. Bjorholm Dahl (Eds.)
(Vol. 10302, pp. 563–577). Presented at the SSVM: Scale Space and Variational
Methods in Computer Vision, Kolding, Denmark: Springer. https://doi.org/10.1007/978-3-319-58771-4_45'
chicago: Maas, Jan, Martin Rumpf, and Stefan Simon. “Transport Based Image Morphing
with Intensity Modulation.” edited by François Lauze, Yiqiu Dong, and Anders Bjorholm
Dahl, 10302:563–77. Springer, 2017. https://doi.org/10.1007/978-3-319-58771-4_45.
ieee: J. Maas, M. Rumpf, and S. Simon, “Transport based image morphing with intensity
modulation,” presented at the SSVM: Scale Space and Variational Methods in Computer
Vision, Kolding, Denmark, 2017, vol. 10302, pp. 563–577.
ista: Maas J, Rumpf M, Simon S. 2017. Transport based image morphing with intensity
modulation. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS,
vol. 10302, 563–577.
mla: Maas, Jan, et al. Transport Based Image Morphing with Intensity Modulation.
Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 563–77, doi:10.1007/978-3-319-58771-4_45.
short: J. Maas, M. Rumpf, S. Simon, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.),
Springer, 2017, pp. 563–577.
conference:
end_date: 2017-06-08
location: Kolding, Denmark
name: 'SSVM: Scale Space and Variational Methods in Computer Vision'
start_date: 2017-06-04
date_created: 2018-12-11T11:49:34Z
date_published: 2017-05-18T00:00:00Z
date_updated: 2026-04-16T10:05:10Z
day: '18'
department:
- _id: JaMa
doi: 10.1007/978-3-319-58771-4_45
editor:
- first_name: François
full_name: Lauze, François
last_name: Lauze
- first_name: Yiqiu
full_name: Dong, Yiqiu
last_name: Dong
- first_name: Anders
full_name: Bjorholm Dahl, Anders
last_name: Bjorholm Dahl
external_id:
isi:
- '000432210900045'
fulldoi: https://doi.org/10.1007/978-3-319-58771-4_45
intvolume: ' 10302'
isi: 1
language:
- iso: eng
month: '05'
oa_version: None
page: 563 - 577
publication_identifier:
issn:
- 0302-9743
publication_status: published
publisher: Springer
publist_id: '6410'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Transport based image morphing with intensity modulation
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 10302
year: '2017'
...
---
_id: '990'
abstract:
- lang: eng
text: Assortative mating is an important driver of speciation in populations with
gene flow and is predicted to evolve under certain conditions in few-locus models.
However, the evolution of assortment is less understood for mating based on quantitative
traits, which are often characterized by high genetic variability and extensive
linkage disequilibrium between trait loci. We explore this scenario for a two-deme
model with migration, by considering a single polygenic trait subject to divergent
viability selection across demes, as well as assortative mating and sexual selection
within demes, and investigate how trait divergence is shaped by various evolutionary
forces. Our analysis reveals the existence of sharp thresholds of assortment strength,
at which divergence increases dramatically. We also study the evolution of assortment
via invasion of modifiers of mate discrimination and show that the ES assortment
strength has an intermediate value under a range of migration-selection parameters,
even in diverged populations, due to subtle effects which depend sensitively on
the extent of phenotypic variation within these populations. The evolutionary
dynamics of the polygenic trait is studied using the hypergeometric and infinitesimal
models. We further investigate the sensitivity of our results to the assumptions
of the hypergeometric model, using individual-based simulations.
article_processing_charge: No
author:
- first_name: Himani
full_name: Sachdeva, Himani
id: 42377A0A-F248-11E8-B48F-1D18A9856A87
last_name: Sachdeva
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: Sachdeva H, Barton NH. Divergence and evolution of assortative mating in a
polygenic trait model of speciation with gene flow. Evolution; International
Journal of Organic Evolution. 2017;71(6):1478-1493. doi:10.1111/evo.13252
apa: Sachdeva, H., & Barton, N. H. (2017). Divergence and evolution of assortative
mating in a polygenic trait model of speciation with gene flow. Evolution;
International Journal of Organic Evolution. Wiley-Blackwell. https://doi.org/10.1111/evo.13252
chicago: Sachdeva, Himani, and Nicholas H Barton. “Divergence and Evolution of Assortative
Mating in a Polygenic Trait Model of Speciation with Gene Flow.” Evolution;
International Journal of Organic Evolution. Wiley-Blackwell, 2017. https://doi.org/10.1111/evo.13252.
ieee: H. Sachdeva and N. H. Barton, “Divergence and evolution of assortative mating
in a polygenic trait model of speciation with gene flow,” Evolution; International
Journal of Organic Evolution, vol. 71, no. 6. Wiley-Blackwell, pp. 1478–1493,
2017.
ista: Sachdeva H, Barton NH. 2017. Divergence and evolution of assortative mating
in a polygenic trait model of speciation with gene flow. Evolution; International
Journal of Organic Evolution. 71(6), 1478–1493.
mla: Sachdeva, Himani, and Nicholas H. Barton. “Divergence and Evolution of Assortative
Mating in a Polygenic Trait Model of Speciation with Gene Flow.” Evolution;
International Journal of Organic Evolution, vol. 71, no. 6, Wiley-Blackwell,
2017, pp. 1478–93, doi:10.1111/evo.13252.
short: H. Sachdeva, N.H. Barton, Evolution; International Journal of Organic Evolution
71 (2017) 1478–1493.
corr_author: '1'
date_created: 2018-12-11T11:49:34Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2025-07-10T12:02:04Z
day: '01'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.1111/evo.13252
ec_funded: 1
external_id:
isi:
- '000403014800005'
pmid:
- '28419447'
file:
- access_level: open_access
checksum: 6d4c38cb1347fd43620d1736c6df5c79
content_type: application/pdf
creator: dernst
date_created: 2019-04-17T07:37:04Z
date_updated: 2020-07-14T12:48:18Z
file_id: '6329'
file_name: 2017_Evolution_Sachdeva_supplement.pdf
file_size: 625260
relation: main_file
- access_level: open_access
checksum: f1d90dd8831b44baf49b4dd176f263af
content_type: application/pdf
creator: dernst
date_created: 2019-04-17T07:37:04Z
date_updated: 2020-07-14T12:48:18Z
file_id: '6330'
file_name: 2017_Evolution_Sachdeva_article.pdf
file_size: 520110
relation: main_file
file_date_updated: 2020-07-14T12:48:18Z
fulldoi: https://doi.org/10.1111/evo.13252
has_accepted_license: '1'
intvolume: ' 71'
isi: 1
issue: '6'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: '1478 - 1493 '
pmid: 1
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Evolution; International Journal of Organic Evolution
publication_identifier:
issn:
- 0014-3820
publication_status: published
publisher: Wiley-Blackwell
publist_id: '6409'
pubrep_id: '977'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Divergence and evolution of assortative mating in a polygenic trait model of
speciation with gene flow
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 71
year: '2017'
...
---
_id: '991'
abstract:
- lang: eng
text: Synaptotagmin 7 (Syt7) was originally identified as a slow Ca2+ sensor for
lysosome fusion, but its function at fast synapses is controversial. The paper
by Luo and Südhof (2017) in this issue of Neuron shows that at the calyx of Held
in the auditory brainstem Syt7 triggers asynchronous release during stimulus trains,
resulting in reliable and temporally precise high-frequency transmission. Thus,
a slow Ca2+ sensor contributes to the fast signaling properties of the calyx synapse.
article_processing_charge: No
author:
- first_name: Chong
full_name: Chen, Chong
id: 3DFD581A-F248-11E8-B48F-1D18A9856A87
last_name: Chen
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: 'Chen C, Jonas PM. Synaptotagmins: That’s why so many. Neuron. 2017;94(4):694-696.
doi:10.1016/j.neuron.2017.05.011'
apa: 'Chen, C., & Jonas, P. M. (2017). Synaptotagmins: That’s why so many. Neuron.
Elsevier. https://doi.org/10.1016/j.neuron.2017.05.011'
chicago: 'Chen, Chong, and Peter M Jonas. “Synaptotagmins: That’s Why so Many.”
Neuron. Elsevier, 2017. https://doi.org/10.1016/j.neuron.2017.05.011.'
ieee: 'C. Chen and P. M. Jonas, “Synaptotagmins: That’s why so many,” Neuron,
vol. 94, no. 4. Elsevier, pp. 694–696, 2017.'
ista: 'Chen C, Jonas PM. 2017. Synaptotagmins: That’s why so many. Neuron. 94(4),
694–696.'
mla: 'Chen, Chong, and Peter M. Jonas. “Synaptotagmins: That’s Why so Many.” Neuron,
vol. 94, no. 4, Elsevier, 2017, pp. 694–96, doi:10.1016/j.neuron.2017.05.011.'
short: C. Chen, P.M. Jonas, Neuron 94 (2017) 694–696.
date_created: 2018-12-11T11:49:34Z
date_published: 2017-05-17T00:00:00Z
date_updated: 2026-04-16T10:05:51Z
day: '17'
department:
- _id: PeJo
doi: 10.1016/j.neuron.2017.05.011
external_id:
isi:
- '000401415100002'
fulldoi: https://doi.org/10.1016/j.neuron.2017.05.011
intvolume: ' 94'
isi: 1
issue: '4'
language:
- iso: eng
month: '05'
oa_version: None
page: 694 - 696
publication: Neuron
publication_identifier:
issn:
- 0896-6273
publication_status: published
publisher: Elsevier
publist_id: '6408'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Synaptotagmins: That’s why so many'
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 94
year: '2017'
...
---
OA_place: publisher
_id: '992'
abstract:
- lang: eng
text: "An instance of the Constraint Satisfaction Problem (CSP) is given by a finite
set of\r\nvariables, a finite domain of labels, and a set of constraints, each
constraint acting on\r\na subset of the variables. The goal is to find an assignment
of labels to its variables\r\nthat satisfies all constraints (or decide whether
one exists). If we allow more general\r\n“soft” constraints, which come with (possibly
infinite) costs of particular assignments,\r\nwe obtain instances from a richer
class called Valued Constraint Satisfaction Problem\r\n(VCSP). There the goal
is to find an assignment with minimum total cost.\r\nIn this thesis, we focus
(assuming that P\r\n6\r\n=\r\nNP) on classifying computational com-\r\nplexity
of CSPs and VCSPs under certain restricting conditions. Two results are the core\r\ncontent
of the work. In one of them, we consider VCSPs parametrized by a constraint\r\nlanguage,
that is the set of “soft” constraints allowed to form the instances, and finish\r\nthe
complexity classification modulo (missing pieces of) complexity classification
for\r\nanalogously parametrized CSP. The other result is a generalization of Edmonds’
perfect\r\nmatching algorithm. This generalization contributes to complexity classfications
in two\r\nways. First, it gives a new (largest known) polynomial-time solvable
class of Boolean\r\nCSPs in which every variable may appear in at most two constraints
and second, it\r\nsettles full classification of Boolean CSPs with planar drawing
(again parametrized by a\r\nconstraint language)."
acknowledgement: FP7/2007-2013/ERC grant agreement no 616160
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Michal
full_name: Rolinek, Michal
id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
last_name: Rolinek
citation:
ama: Rolinek M. Complexity of constraint satisfaction. 2017. doi:10.15479/AT:ISTA:th_815
apa: Rolinek, M. (2017). Complexity of constraint satisfaction. Institute
of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_815
chicago: Rolinek, Michal. “Complexity of Constraint Satisfaction.” Institute of
Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_815.
ieee: M. Rolinek, “Complexity of constraint satisfaction,” Institute of Science
and Technology Austria, 2017.
ista: Rolinek M. 2017. Complexity of constraint satisfaction. Institute of Science
and Technology Austria.
mla: Rolinek, Michal. Complexity of Constraint Satisfaction. Institute of
Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_815.
short: M. Rolinek, Complexity of Constraint Satisfaction, Institute of Science and
Technology Austria, 2017.
corr_author: '1'
date_created: 2018-12-11T11:49:35Z
date_published: 2017-05-01T00:00:00Z
date_updated: 2026-04-08T14:17:06Z
day: '01'
ddc:
- '004'
degree_awarded: PhD
department:
- _id: VlKo
doi: 10.15479/AT:ISTA:th_815
ec_funded: 1
file:
- access_level: open_access
checksum: 81761fb939acb7585c36629f765b4373
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:55Z
date_updated: 2020-07-14T12:48:18Z
file_id: '4654'
file_name: IST-2017-815-v1+3_final_blank_signature_maybe_pdfa.pdf
file_size: 786145
relation: main_file
- access_level: closed
checksum: 2b2d7e1d6c1c79a9795a7aa0f860baf3
content_type: application/zip
creator: dernst
date_created: 2019-04-05T08:43:24Z
date_updated: 2020-07-14T12:48:18Z
file_id: '6208'
file_name: 2017_Thesis_Rolinek_source.zip
file_size: 5936337
relation: source_file
file_date_updated: 2020-07-14T12:48:18Z
fulldoi: https://doi.org/10.15479/AT:ISTA:th_815
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '97'
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6407'
pubrep_id: '815'
status: public
supervisor:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
title: Complexity of constraint satisfaction
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2017'
...
---
_id: '993'
abstract:
- lang: eng
text: In real-world applications, observations are often constrained to a small
fraction of a system. Such spatial subsampling can be caused by the inaccessibility
or the sheer size of the system, and cannot be overcome by longer sampling. Spatial
subsampling can strongly bias inferences about a system’s aggregated properties.
To overcome the bias, we derive analytically a subsampling scaling framework that
is applicable to different observables, including distributions of neuronal avalanches,
of number of people infected during an epidemic outbreak, and of node degrees.
We demonstrate how to infer the correct distributions of the underlying full system,
how to apply it to distinguish critical from subcritical systems, and how to disentangle
subsampling and finite size effects. Lastly, we apply subsampling scaling to neuronal
avalanche models and to recordings from developing neural networks. We show that
only mature, but not young networks follow power-law scaling, indicating self-organization
to criticality during development.
article_number: '15140'
article_processing_charge: Yes (in subscription journal)
author:
- first_name: Anna
full_name: Levina (Martius), Anna
id: 35AF8020-F248-11E8-B48F-1D18A9856A87
last_name: Levina (Martius)
- first_name: Viola
full_name: Priesemann, Viola
last_name: Priesemann
citation:
ama: Levina (Martius) A, Priesemann V. Subsampling scaling. Nature Communications.
2017;8. doi:10.1038/ncomms15140
apa: Levina (Martius), A., & Priesemann, V. (2017). Subsampling scaling. Nature
Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms15140
chicago: Levina (Martius), Anna, and Viola Priesemann. “Subsampling Scaling.” Nature
Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/ncomms15140.
ieee: A. Levina (Martius) and V. Priesemann, “Subsampling scaling,” Nature Communications,
vol. 8. Nature Publishing Group, 2017.
ista: Levina (Martius) A, Priesemann V. 2017. Subsampling scaling. Nature Communications.
8, 15140.
mla: Levina (Martius), Anna, and Viola Priesemann. “Subsampling Scaling.” Nature
Communications, vol. 8, 15140, Nature Publishing Group, 2017, doi:10.1038/ncomms15140.
short: A. Levina (Martius), V. Priesemann, Nature Communications 8 (2017).
date_created: 2018-12-11T11:49:35Z
date_published: 2017-05-04T00:00:00Z
date_updated: 2025-07-10T12:02:06Z
day: '04'
ddc:
- '005'
- '571'
department:
- _id: GaTk
- _id: JoCs
doi: 10.1038/ncomms15140
ec_funded: 1
external_id:
isi:
- '000400560700001'
file:
- access_level: open_access
checksum: 9880212f8c4c53404c7c6fbf9023c53a
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:05Z
date_updated: 2020-07-14T12:48:19Z
file_id: '5122'
file_name: IST-2017-819-v1+1_2017_Levina_SubsamplingScaling.pdf
file_size: 746224
relation: main_file
file_date_updated: 2020-07-14T12:48:19Z
fulldoi: https://doi.org/10.1038/ncomms15140
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
language:
- iso: eng
month: '05'
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
publication: Nature Communications
publication_identifier:
issn:
- 2041-1723
publication_status: published
publisher: Nature Publishing Group
publist_id: '6406'
pubrep_id: '819'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Subsampling scaling
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2017'
...
---
_id: '994'
abstract:
- lang: eng
text: The formation of vortices is usually considered to be the main mechanism of
angular momentum disposal in superfluids. Recently, it was predicted that a superfluid
can acquire angular momentum via an alternative, microscopic route -- namely,
through interaction with rotating impurities, forming so-called `angulon quasiparticles'
[Phys. Rev. Lett. 114, 203001 (2015)]. The angulon instabilities correspond to
transfer of a small number of angular momentum quanta from the impurity to the
superfluid, as opposed to vortex instabilities, where angular momentum is quantized
in units of ℏ per atom. Furthermore, since conventional impurities (such as molecules)
represent three-dimensional (3D) rotors, the angular momentum transferred is intrinsically
3D as well, as opposed to a merely planar rotation which is inherent to vortices.
Herein we show that the angulon theory can explain the anomalous broadening of
the spectroscopic lines observed for CH 3 and NH 3 molecules in superfluid
helium nanodroplets, thereby providing a fingerprint of the emerging angulon instabilities
in experiment.
article_processing_charge: No
arxiv: 1
author:
- first_name: Igor
full_name: Cherepanov, Igor
id: 339C7E5A-F248-11E8-B48F-1D18A9856A87
last_name: Cherepanov
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Cherepanov I, Lemeshko M. Fingerprints of angulon instabilities in the spectra
of matrix-isolated molecules. Physical Review Materials. 2017;1(3). doi:10.1103/PhysRevMaterials.1.035602
apa: Cherepanov, I., & Lemeshko, M. (2017). Fingerprints of angulon instabilities
in the spectra of matrix-isolated molecules. Physical Review Materials.
American Physical Society. https://doi.org/10.1103/PhysRevMaterials.1.035602
chicago: Cherepanov, Igor, and Mikhail Lemeshko. “Fingerprints of Angulon Instabilities
in the Spectra of Matrix-Isolated Molecules.” Physical Review Materials.
American Physical Society, 2017. https://doi.org/10.1103/PhysRevMaterials.1.035602.
ieee: I. Cherepanov and M. Lemeshko, “Fingerprints of angulon instabilities in the
spectra of matrix-isolated molecules,” Physical Review Materials, vol.
1, no. 3. American Physical Society, 2017.
ista: Cherepanov I, Lemeshko M. 2017. Fingerprints of angulon instabilities in the
spectra of matrix-isolated molecules. Physical Review Materials. 1(3).
mla: Cherepanov, Igor, and Mikhail Lemeshko. “Fingerprints of Angulon Instabilities
in the Spectra of Matrix-Isolated Molecules.” Physical Review Materials,
vol. 1, no. 3, American Physical Society, 2017, doi:10.1103/PhysRevMaterials.1.035602.
short: I. Cherepanov, M. Lemeshko, Physical Review Materials 1 (2017).
corr_author: '1'
date_created: 2018-12-11T11:49:35Z
date_published: 2017-08-08T00:00:00Z
date_updated: 2025-06-04T10:15:04Z
day: '08'
department:
- _id: MiLe
doi: 10.1103/PhysRevMaterials.1.035602
ec_funded: 1
external_id:
arxiv:
- '1705.09220'
isi:
- '000416564000004'
fulldoi: https://doi.org/10.1103/PhysRevMaterials.1.035602
intvolume: ' 1'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1705.09220
month: '08'
oa: 1
oa_version: Submitted Version
project:
- _id: 26031614-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P29902
name: Quantum rotations in the presence of a many-body environment
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: Physical Review Materials
publication_status: published
publisher: American Physical Society
publist_id: '6405'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fingerprints of angulon instabilities in the spectra of matrix-isolated molecules
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2017'
...
---
_id: '996'
abstract:
- lang: eng
text: 'Iodine (I 2 ) molecules embedded in He nanodroplets are aligned by a 160
ps long laser pulse. The highest degree of alignment, occurring at the peak of
the pulse and quantified by ⟨cos 2 θ 2D ⟩ , is measured as a function of the laser
intensity. The results are well described by ⟨cos 2 θ 2D ⟩ calculated for a gas
of isolated molecules each with an effective rotational constant of 0.6 times
the gas-phase value, and at a temperature of 0.4 K. Theoretical analysis using
the angulon quasiparticle to describe rotating molecules in superfluid helium
rationalizes why the alignment mechanism is similar to that of isolated molecules
with an effective rotational constant. A major advantage of molecules in He droplets
is that their 0.4 K temperature leads to stronger alignment than what can generally
be achieved for gas phase molecules -- here demonstrated by a direct comparison
of the droplet results to measurements on a ∼ 1 K supersonic beam of isolated
molecules. This point is further illustrated for more complex system by measurements
on 1,4-diiodobenzene and 1,4-dibromobenzene. For all three molecular species studied
the highest values of ⟨cos 2 θ 2D ⟩ achieved in He droplets exceed 0.96. '
article_number: '013946'
article_processing_charge: No
arxiv: 1
author:
- first_name: Benjamin
full_name: Shepperson, Benjamin
last_name: Shepperson
- first_name: Adam
full_name: Chatterley, Adam
last_name: Chatterley
- first_name: Anders
full_name: Søndergaard, Anders
last_name: Søndergaard
- first_name: Lars
full_name: Christiansen, Lars
last_name: Christiansen
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
- first_name: Henrik
full_name: Stapelfeldt, Henrik
last_name: Stapelfeldt
citation:
ama: Shepperson B, Chatterley A, Søndergaard A, Christiansen L, Lemeshko M, Stapelfeldt
H. Strongly aligned molecules inside helium droplets in the near-adiabatic regime.
The Journal of Chemical Physics. 2017;147(1). doi:10.1063/1.4983703
apa: Shepperson, B., Chatterley, A., Søndergaard, A., Christiansen, L., Lemeshko,
M., & Stapelfeldt, H. (2017). Strongly aligned molecules inside helium droplets
in the near-adiabatic regime. The Journal of Chemical Physics. AIP Publishing.
https://doi.org/10.1063/1.4983703
chicago: Shepperson, Benjamin, Adam Chatterley, Anders Søndergaard, Lars Christiansen,
Mikhail Lemeshko, and Henrik Stapelfeldt. “Strongly Aligned Molecules inside Helium
Droplets in the Near-Adiabatic Regime.” The Journal of Chemical Physics.
AIP Publishing, 2017. https://doi.org/10.1063/1.4983703.
ieee: B. Shepperson, A. Chatterley, A. Søndergaard, L. Christiansen, M. Lemeshko,
and H. Stapelfeldt, “Strongly aligned molecules inside helium droplets in the
near-adiabatic regime,” The Journal of Chemical Physics, vol. 147, no.
1. AIP Publishing, 2017.
ista: Shepperson B, Chatterley A, Søndergaard A, Christiansen L, Lemeshko M, Stapelfeldt
H. 2017. Strongly aligned molecules inside helium droplets in the near-adiabatic
regime. The Journal of Chemical Physics. 147(1), 013946.
mla: Shepperson, Benjamin, et al. “Strongly Aligned Molecules inside Helium Droplets
in the Near-Adiabatic Regime.” The Journal of Chemical Physics, vol. 147,
no. 1, 013946, AIP Publishing, 2017, doi:10.1063/1.4983703.
short: B. Shepperson, A. Chatterley, A. Søndergaard, L. Christiansen, M. Lemeshko,
H. Stapelfeldt, The Journal of Chemical Physics 147 (2017).
date_created: 2018-12-11T11:49:36Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2025-06-04T08:17:46Z
day: '01'
department:
- _id: MiLe
doi: 10.1063/1.4983703
external_id:
arxiv:
- '1704.03684'
isi:
- '000405089400047'
fulldoi: https://doi.org/10.1063/1.4983703
intvolume: ' 147'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1704.03684
month: '06'
oa: 1
oa_version: Submitted Version
publication: The Journal of Chemical Physics
publication_identifier:
issn:
- 0021-9606
publication_status: published
publisher: AIP Publishing
publist_id: '6403'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Strongly aligned molecules inside helium droplets in the near-adiabatic regime
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 147
year: '2017'
...
---
_id: '997'
abstract:
- lang: eng
text: Recently it was shown that molecules rotating in superfluid helium can be
described in terms of the angulon quasiparticles (Phys. Rev. Lett. 118, 095301
(2017)). Here we demonstrate that in the experimentally realized regime the angulon
can be seen as a point charge on a 2-sphere interacting with a gauge field of
a non-abelian magnetic monopole. Unlike in several other settings, the gauge fields
of the angulon problem emerge in the real coordinate space, as opposed to the
momentum space or some effective parameter space. Furthermore, we find a topological
transition associated with making the monopole abelian, which takes place in the
vicinity of the previously reported angulon instabilities. These results pave
the way for studying topological phenomena in experiments on molecules trapped
in superfluid helium nanodroplets, as well as on other realizations of orbital
impurity problems.
article_number: '235301'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Enderalp
full_name: Yakaboylu, Enderalp
id: 38CB71F6-F248-11E8-B48F-1D18A9856A87
last_name: Yakaboylu
orcid: 0000-0001-5973-0874
- first_name: Andreas
full_name: Deuchert, Andreas
id: 4DA65CD0-F248-11E8-B48F-1D18A9856A87
last_name: Deuchert
orcid: 0000-0003-3146-6746
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Yakaboylu E, Deuchert A, Lemeshko M. Emergence of non-abelian magnetic monopoles
in a quantum impurity problem. Physical Review Letters. 2017;119(23). doi:10.1103/PhysRevLett.119.235301
apa: Yakaboylu, E., Deuchert, A., & Lemeshko, M. (2017). Emergence of non-abelian
magnetic monopoles in a quantum impurity problem. Physical Review Letters.
American Physical Society. https://doi.org/10.1103/PhysRevLett.119.235301
chicago: Yakaboylu, Enderalp, Andreas Deuchert, and Mikhail Lemeshko. “Emergence
of Non-Abelian Magnetic Monopoles in a Quantum Impurity Problem.” Physical
Review Letters. American Physical Society, 2017. https://doi.org/10.1103/PhysRevLett.119.235301.
ieee: E. Yakaboylu, A. Deuchert, and M. Lemeshko, “Emergence of non-abelian magnetic
monopoles in a quantum impurity problem,” Physical Review Letters, vol.
119, no. 23. American Physical Society, 2017.
ista: Yakaboylu E, Deuchert A, Lemeshko M. 2017. Emergence of non-abelian magnetic
monopoles in a quantum impurity problem. Physical Review Letters. 119(23), 235301.
mla: Yakaboylu, Enderalp, et al. “Emergence of Non-Abelian Magnetic Monopoles in
a Quantum Impurity Problem.” Physical Review Letters, vol. 119, no. 23,
235301, American Physical Society, 2017, doi:10.1103/PhysRevLett.119.235301.
short: E. Yakaboylu, A. Deuchert, M. Lemeshko, Physical Review Letters 119 (2017).
corr_author: '1'
date_created: 2018-12-11T11:49:36Z
date_published: 2017-12-06T00:00:00Z
date_updated: 2025-04-14T07:26:54Z
day: '06'
department:
- _id: MiLe
- _id: RoSe
doi: 10.1103/PhysRevLett.119.235301
ec_funded: 1
external_id:
arxiv:
- '1705.05162'
isi:
- '000417132100007'
fulldoi: https://doi.org/10.1103/PhysRevLett.119.235301
intvolume: ' 119'
isi: 1
issue: '23'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1705.05162
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
- _id: 26031614-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P29902
name: Quantum rotations in the presence of a many-body environment
publication: Physical Review Letters
publication_identifier:
issn:
- 0031-9007
publication_status: published
publisher: American Physical Society
publist_id: '6401'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Emergence of non-abelian magnetic monopoles in a quantum impurity problem
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 119
year: '2017'
...
---
_id: '998'
abstract:
- lang: eng
text: 'A major open problem on the road to artificial intelligence is the development
of incrementally learning systems that learn about more and more concepts over
time from a stream of data. In this work, we introduce a new training strategy,
iCaRL, that allows learning in such a class-incremental way: only the training
data for a small number of classes has to be present at the same time and new
classes can be added progressively. iCaRL learns strong classifiers and a data
representation simultaneously. This distinguishes it from earlier works that were
fundamentally limited to fixed data representations and therefore incompatible
with deep learning architectures. We show by experiments on CIFAR-100 and ImageNet
ILSVRC 2012 data that iCaRL can learn many classes incrementally over a long period
of time where other strategies quickly fail. '
article_processing_charge: No
arxiv: 1
author:
- first_name: Sylvestre Alvise
full_name: Rebuffi, Sylvestre Alvise
last_name: Rebuffi
- first_name: Alexander
full_name: Kolesnikov, Alexander
id: 2D157DB6-F248-11E8-B48F-1D18A9856A87
last_name: Kolesnikov
- first_name: Georg
full_name: Sperl, Georg
id: 4DD40360-F248-11E8-B48F-1D18A9856A87
last_name: Sperl
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Rebuffi SA, Kolesnikov A, Sperl G, Lampert C. iCaRL: Incremental classifier
and representation learning. In: Vol 2017. IEEE; 2017:5533-5542. doi:10.1109/CVPR.2017.587'
apa: 'Rebuffi, S. A., Kolesnikov, A., Sperl, G., & Lampert, C. (2017). iCaRL:
Incremental classifier and representation learning (Vol. 2017, pp. 5533–5542).
Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA,
United States: IEEE. https://doi.org/10.1109/CVPR.2017.587'
chicago: 'Rebuffi, Sylvestre Alvise, Alexander Kolesnikov, Georg Sperl, and Christoph
Lampert. “ICaRL: Incremental Classifier and Representation Learning,” 2017:5533–42.
IEEE, 2017. https://doi.org/10.1109/CVPR.2017.587.'
ieee: 'S. A. Rebuffi, A. Kolesnikov, G. Sperl, and C. Lampert, “iCaRL: Incremental
classifier and representation learning,” presented at the CVPR: Computer Vision
and Pattern Recognition, Honolulu, HA, United States, 2017, vol. 2017, pp. 5533–5542.'
ista: 'Rebuffi SA, Kolesnikov A, Sperl G, Lampert C. 2017. iCaRL: Incremental classifier
and representation learning. CVPR: Computer Vision and Pattern Recognition vol.
2017, 5533–5542.'
mla: 'Rebuffi, Sylvestre Alvise, et al. ICaRL: Incremental Classifier and Representation
Learning. Vol. 2017, IEEE, 2017, pp. 5533–42, doi:10.1109/CVPR.2017.587.'
short: S.A. Rebuffi, A. Kolesnikov, G. Sperl, C. Lampert, in:, IEEE, 2017, pp. 5533–5542.
conference:
end_date: 2017-07-26
location: Honolulu, HA, United States
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2017-07-21
date_created: 2018-12-11T11:49:37Z
date_published: 2017-04-14T00:00:00Z
date_updated: 2025-06-04T08:18:32Z
day: '14'
department:
- _id: ChLa
- _id: ChWo
doi: 10.1109/CVPR.2017.587
ec_funded: 1
external_id:
arxiv:
- '1611.07725'
isi:
- '000418371405066'
fulldoi: https://doi.org/10.1109/CVPR.2017.587
intvolume: ' 2017'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1611.07725
month: '04'
oa: 1
oa_version: Submitted Version
page: 5533 - 5542
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_identifier:
isbn:
- 978-153860457-1
publication_status: published
publisher: IEEE
publist_id: '6400'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'iCaRL: Incremental classifier and representation learning'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2017
year: '2017'
...
---
_id: '999'
abstract:
- lang: eng
text: 'In multi-task learning, a learner is given a collection of prediction tasks
and needs to solve all of them. In contrast to previous work, which required that
annotated training data must be available for all tasks, we consider a new setting,
in which for some tasks, potentially most of them, only unlabeled training data
is provided. Consequently, to solve all tasks, information must be transferred
between tasks with labels and tasks without labels. Focusing on an instance-based
transfer method we analyze two variants of this setting: when the set of labeled
tasks is fixed, and when it can be actively selected by the learner. We state
and prove a generalization bound that covers both scenarios and derive from it
an algorithm for making the choice of labeled tasks (in the active case) and for
transferring information between the tasks in a principled way. We also illustrate
the effectiveness of the algorithm on synthetic and real data. '
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Anastasia
full_name: Pentina, Anastasia
id: 42E87FC6-F248-11E8-B48F-1D18A9856A87
last_name: Pentina
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Pentina A, Lampert C. Multi-task learning with labeled and unlabeled tasks.
In: Vol 70. ML Research Press; 2017:2807-2816.'
apa: 'Pentina, A., & Lampert, C. (2017). Multi-task learning with labeled and
unlabeled tasks (Vol. 70, pp. 2807–2816). Presented at the ICML: International
Conference on Machine Learning, Sydney, Australia: ML Research Press.'
chicago: Pentina, Anastasia, and Christoph Lampert. “Multi-Task Learning with Labeled
and Unlabeled Tasks,” 70:2807–16. ML Research Press, 2017.
ieee: 'A. Pentina and C. Lampert, “Multi-task learning with labeled and unlabeled
tasks,” presented at the ICML: International Conference on Machine Learning, Sydney,
Australia, 2017, vol. 70, pp. 2807–2816.'
ista: 'Pentina A, Lampert C. 2017. Multi-task learning with labeled and unlabeled
tasks. ICML: International Conference on Machine Learning, PMLR, vol. 70, 2807–2816.'
mla: Pentina, Anastasia, and Christoph Lampert. Multi-Task Learning with Labeled
and Unlabeled Tasks. Vol. 70, ML Research Press, 2017, pp. 2807–16.
short: A. Pentina, C. Lampert, in:, ML Research Press, 2017, pp. 2807–2816.
conference:
end_date: 2017-08-11
location: Sydney, Australia
name: 'ICML: International Conference on Machine Learning'
start_date: 2017-08-06
corr_author: '1'
date_created: 2018-12-11T11:49:37Z
date_published: 2017-06-08T00:00:00Z
date_updated: 2025-06-04T08:19:03Z
day: '08'
department:
- _id: ChLa
ec_funded: 1
external_id:
arxiv:
- '1602.06518'
isi:
- '000683309502093'
intvolume: ' 70'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1602.06518
month: '06'
oa: 1
oa_version: Submitted Version
page: 2807 - 2816
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_identifier:
isbn:
- '9781510855144'
publication_status: published
publisher: ML Research Press
publist_id: '6399'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Multi-task learning with labeled and unlabeled tasks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 70
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'
article_processing_charge: No
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: 2025-09-18T10:29:07Z
day: '14'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.1088/1742-6596/999/1/012004
external_id:
arxiv:
- '1611.03701'
isi:
- '000432427200004'
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
fulldoi: https://doi.org/10.1088/1742-6596/999/1/012004
has_accepted_license: '1'
intvolume: ' 999'
isi: 1
issue: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication_identifier:
issn:
- 1742-6588
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
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).'
article_processing_charge: No
arxiv: 1
author:
- first_name: Xavier
full_name: Goaoc, Xavier
last_name: Goaoc
- first_name: Pavel
full_name: Paták, Pavel
last_name: Paták
- first_name: Zuzana
full_name: Patakova, Zuzana
last_name: Patakova
orcid: 0000-0002-3975-1683
- first_name: Martin
full_name: Tancer, Martin
last_name: Tancer
orcid: 0000-0002-1191-6714
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Bounding helly numbers via
betti numbers. In: Loebl M, Nešetřil J, Thomas R, eds. A Journey through Discrete
Mathematics: A Tribute to Jiri Matousek. A Journey Through Discrete Mathematics.
Springer; 2017:407-447. doi:10.1007/978-3-319-44479-6_17'
apa: 'Goaoc, X., Paták, P., Patakova, Z., Tancer, M., & Wagner, U. (2017). Bounding
helly numbers via betti numbers. In M. Loebl, J. Nešetřil, & R. Thomas (Eds.),
A Journey through Discrete Mathematics: A Tribute to Jiri Matousek (pp.
407–447). Springer. https://doi.org/10.1007/978-3-319-44479-6_17'
chicago: 'Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner.
“Bounding Helly Numbers via Betti Numbers.” In A Journey through Discrete Mathematics:
A Tribute to Jiri Matousek, edited by Martin Loebl, Jaroslav Nešetřil, and
Robin Thomas, 407–47. A Journey Through Discrete Mathematics. Springer, 2017.
https://doi.org/10.1007/978-3-319-44479-6_17.'
ieee: 'X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Bounding helly
numbers via betti numbers,” in A Journey through Discrete Mathematics: A Tribute
to Jiri Matousek, M. Loebl, J. Nešetřil, and R. Thomas, Eds. Springer, 2017,
pp. 407–447.'
ista: 'Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2017.Bounding helly numbers
via betti numbers. In: A Journey through Discrete Mathematics: A Tribute to Jiri
Matousek. , 407–447.'
mla: 'Goaoc, Xavier, et al. “Bounding Helly Numbers via Betti Numbers.” A Journey
through Discrete Mathematics: A Tribute to Jiri Matousek, edited by Martin
Loebl et al., Springer, 2017, pp. 407–47, doi:10.1007/978-3-319-44479-6_17.'
short: 'X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, M. Loebl, J.
Nešetřil, R. Thomas (Eds.), A Journey through Discrete Mathematics: A Tribute
to Jiri Matousek, Springer, 2017, pp. 407–447.'
date_created: 2018-12-11T11:46:24Z
date_published: 2017-10-06T00:00:00Z
date_updated: 2026-06-18T18:48:49Z
day: '06'
ddc:
- '500'
department:
- _id: UlWa
doi: 10.1007/978-3-319-44479-6_17
editor:
- first_name: Martin
full_name: Loebl, Martin
last_name: Loebl
- first_name: Jaroslav
full_name: Nešetřil, Jaroslav
last_name: Nešetřil
- first_name: Robin
full_name: Thomas, Robin
last_name: Thomas
external_id:
arxiv:
- '1310.4613'
fulldoi: https://doi.org/10.1007/978-3-319-44479-6_17
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1310.4613
month: '10'
oa: 1
oa_version: Published Version
page: 407 - 447
publication: 'A Journey through Discrete Mathematics: A Tribute to Jiri Matousek'
publication_identifier:
isbn:
- 978-331944479-6
publication_status: published
publisher: Springer
publist_id: '7399'
quality_controlled: '1'
related_material:
record:
- id: '1512'
relation: earlier_version
status: public
scopus_import: '1'
series_title: A Journey Through Discrete Mathematics
status: public
title: Bounding helly numbers via betti numbers
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '431'
abstract:
- lang: eng
text: 'Parallel implementations of stochastic gradient descent (SGD) have received
significant research attention, thanks to its excellent scalability properties.
A fundamental barrier when parallelizing SGD is the high bandwidth cost of communicating
gradient updates between nodes; consequently, several lossy compresion heuristics
have been proposed, by which nodes only communicate quantized gradients. Although
effective in practice, these heuristics do not always converge. In this paper,
we propose Quantized SGD (QSGD), a family of compression schemes with convergence
guarantees and good practical performance. QSGD allows the user to smoothly trade
off communication bandwidth and convergence time: nodes can adjust the number
of bits sent per iteration, at the cost of possibly higher variance. We show that
this trade-off is inherent, in the sense that improving it past some threshold
would violate information-theoretic lower bounds. QSGD guarantees convergence
for convex and non-convex objectives, under asynchrony, and can be extended to
stochastic variance-reduced techniques. When applied to training deep neural networks
for image classification and automated speech recognition, QSGD leads to significant
reductions in end-to-end training time. For instance, on 16GPUs, we can train
the ResNet-152 network to full accuracy on ImageNet 1.8 × faster than the full-precision
variant. '
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Demjan
full_name: Grubic, Demjan
last_name: Grubic
- first_name: Jerry
full_name: Li, Jerry
last_name: Li
- first_name: Ryota
full_name: Tomioka, Ryota
last_name: Tomioka
- first_name: Milan
full_name: Vojnović, Milan
last_name: Vojnović
citation:
ama: 'Alistarh D-A, Grubic D, Li J, Tomioka R, Vojnović M. QSGD: Communication-efficient
SGD via gradient quantization and encoding. In: Vol 2017. Neural Information Processing
Systems Foundation; 2017:1710-1721.'
apa: 'Alistarh, D.-A., Grubic, D., Li, J., Tomioka, R., & Vojnović, M. (2017).
QSGD: Communication-efficient SGD via gradient quantization and encoding (Vol.
2017, pp. 1710–1721). Presented at the NIPS: Neural Information Processing System,
Long Beach, CA, United States: Neural Information Processing Systems Foundation.'
chicago: 'Alistarh, Dan-Adrian, Demjan Grubic, Jerry Li, Ryota Tomioka, and Milan
Vojnović. “QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding,”
2017:1710–21. Neural Information Processing Systems Foundation, 2017.'
ieee: 'D.-A. Alistarh, D. Grubic, J. Li, R. Tomioka, and M. Vojnović, “QSGD: Communication-efficient
SGD via gradient quantization and encoding,” presented at the NIPS: Neural Information
Processing System, Long Beach, CA, United States, 2017, vol. 2017, pp. 1710–1721.'
ista: 'Alistarh D-A, Grubic D, Li J, Tomioka R, Vojnović M. 2017. QSGD: Communication-efficient
SGD via gradient quantization and encoding. NIPS: Neural Information Processing
System, Advances in Neural Information Processing Systems, vol. 2017, 1710–1721.'
mla: 'Alistarh, Dan-Adrian, et al. QSGD: Communication-Efficient SGD via Gradient
Quantization and Encoding. Vol. 2017, Neural Information Processing Systems
Foundation, 2017, pp. 1710–21.'
short: D.-A. Alistarh, D. Grubic, J. Li, R. Tomioka, M. Vojnović, in:, Neural Information
Processing Systems Foundation, 2017, pp. 1710–1721.
conference:
end_date: 2017-12-09
location: Long Beach, CA, United States
name: 'NIPS: Neural Information Processing System'
start_date: 2017-12-04
corr_author: '1'
date_created: 2018-12-11T11:46:26Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2025-09-18T10:07:20Z
day: '01'
department:
- _id: DaAl
external_id:
arxiv:
- '1610.02132'
isi:
- '000452649401072'
intvolume: ' 2017'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1610.02132
month: '01'
oa: 1
oa_version: Submitted Version
page: 1710-1721
publication_identifier:
issn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
publist_id: '7392'
quality_controlled: '1'
status: public
title: 'QSGD: Communication-efficient SGD via gradient quantization and encoding'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 2017
year: '2017'
...
---
_id: '432'
abstract:
- lang: eng
text: 'Recently there has been significant interest in training machine-learning
models at low precision: by reducing precision, one can reduce computation and
communication by one order of magnitude. We examine training at reduced precision,
both from a theoretical and practical perspective, and ask: is it possible to
train models at end-to-end low precision with provable guarantees? Can this lead
to consistent order-of-magnitude speedups? We mainly focus on linear models, and
the answer is yes for linear models. We develop a simple framework called ZipML
based on one simple but novel strategy called double sampling. Our ZipML framework
is able to execute training at low precision with no bias, guaranteeing convergence,
whereas naive quanti- zation would introduce significant bias. We val- idate our
framework across a range of applica- tions, and show that it enables an FPGA proto-
type that is up to 6.5 × faster than an implemen- tation using full 32-bit precision.
We further de- velop a variance-optimal stochastic quantization strategy and show
that it can make a significant difference in a variety of settings. When applied
to linear models together with double sampling, we save up to another 1.7 × in
data movement compared with uniform quantization. When training deep networks
with quantized models, we achieve higher accuracy than the state-of-the- art XNOR-Net. '
alternative_title:
- PMLR Press
article_processing_charge: No
author:
- first_name: Hantian
full_name: Zhang, Hantian
last_name: Zhang
- first_name: Jerry
full_name: Li, Jerry
last_name: Li
- first_name: Kaan
full_name: Kara, Kaan
last_name: Kara
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Ji
full_name: Liu, Ji
last_name: Liu
- first_name: Ce
full_name: Zhang, Ce
last_name: Zhang
citation:
ama: 'Zhang H, Li J, Kara K, Alistarh D-A, Liu J, Zhang C. ZipML: Training linear
models with end-to-end low precision, and a little bit of deep learning. In: Proceedings
of Machine Learning Research. Vol 70. ML Research Press; 2017:4035-4043.'
apa: 'Zhang, H., Li, J., Kara, K., Alistarh, D.-A., Liu, J., & Zhang, C. (2017).
ZipML: Training linear models with end-to-end low precision, and a little bit
of deep learning. In Proceedings of Machine Learning Research (Vol. 70,
pp. 4035–4043). Sydney, Australia: ML Research Press.'
chicago: 'Zhang, Hantian, Jerry Li, Kaan Kara, Dan-Adrian Alistarh, Ji Liu, and
Ce Zhang. “ZipML: Training Linear Models with End-to-End Low Precision, and a
Little Bit of Deep Learning.” In Proceedings of Machine Learning Research,
70:4035–43. ML Research Press, 2017.'
ieee: 'H. Zhang, J. Li, K. Kara, D.-A. Alistarh, J. Liu, and C. Zhang, “ZipML: Training
linear models with end-to-end low precision, and a little bit of deep learning,”
in Proceedings of Machine Learning Research, Sydney, Australia, 2017, vol.
70, pp. 4035–4043.'
ista: 'Zhang H, Li J, Kara K, Alistarh D-A, Liu J, Zhang C. 2017. ZipML: Training
linear models with end-to-end low precision, and a little bit of deep learning.
Proceedings of Machine Learning Research. ICML: International Conference on Machine
Learning, PMLR Press, vol. 70, 4035–4043.'
mla: 'Zhang, Hantian, et al. “ZipML: Training Linear Models with End-to-End Low
Precision, and a Little Bit of Deep Learning.” Proceedings of Machine Learning
Research, vol. 70, ML Research Press, 2017, pp. 4035–43.'
short: H. Zhang, J. Li, K. Kara, D.-A. Alistarh, J. Liu, C. Zhang, in:, Proceedings
of Machine Learning Research, ML Research Press, 2017, pp. 4035–4043.
conference:
end_date: 2017-08-11
location: Sydney, Australia
name: 'ICML: International Conference on Machine Learning'
start_date: 2017-08-06
corr_author: '1'
date_created: 2018-12-11T11:46:26Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2025-09-18T10:06:02Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
external_id:
isi:
- '000683309504015'
file:
- access_level: open_access
checksum: 86156ba7f4318e47cef3eb9092593c10
content_type: application/pdf
creator: dernst
date_created: 2019-01-22T08:23:58Z
date_updated: 2020-07-14T12:46:26Z
file_id: '5869'
file_name: 2017_ICML_Zhang.pdf
file_size: 849345
relation: main_file
file_date_updated: 2020-07-14T12:46:26Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 4035 - 4043
publication: Proceedings of Machine Learning Research
publication_identifier:
isbn:
- 978-151085514-4
publication_status: published
publisher: ML Research Press
publist_id: '7391'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'ZipML: Training linear models with end-to-end low precision, and a little
bit of deep learning'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: ' 70'
year: '2017'
...
---
_id: '18286'
abstract:
- lang: eng
text: We introduce a new framework for learning dense correspondence between deformable
3D shapes. Existing learning based approaches model shape correspondence as a
labelling problem, where each point of a query shape receives a label identifying
a point on some reference domain; the correspondence is then constructed a posteriori
by composing the label predictions of two input shapes. We propose a paradigm
shift and design a structured prediction model in the space of functional maps,
linear operators that provide a compact representation of the correspondence.
We model the learning process via a deep residual network which takes dense descriptor
fields defined on two shapes as input, and outputs a soft map between the two
given objects. The resulting correspondence is shown to be accurate on several
challenging benchmarks comprising multiple categories, synthetic models, real
scans with acquisition artifacts, topological noise, and partiality.
article_number: '8237865'
article_processing_charge: No
arxiv: 1
author:
- first_name: Or
full_name: Litany, Or
last_name: Litany
- first_name: Tal
full_name: Remez, Tal
last_name: Remez
- first_name: Emanuele
full_name: Rodola, Emanuele
last_name: Rodola
- first_name: Alexander
full_name: Bronstein, Alexander
last_name: Bronstein
- first_name: Michael
full_name: Bronstein, Michael
last_name: Bronstein
citation:
ama: 'Litany O, Remez T, Rodola E, Bronstein A, Bronstein M. Deep functional maps:
Structured prediction for dense shape correspondence. In: 2017 IEEE International
Conference on Computer Vision (ICCV). Vol 31. IEEE; 2017. doi:10.1109/iccv.2017.603'
apa: 'Litany, O., Remez, T., Rodola, E., Bronstein, A., & Bronstein, M. (2017).
Deep functional maps: Structured prediction for dense shape correspondence. In
2017 IEEE International Conference on Computer Vision (ICCV) (Vol. 31).
IEEE. https://doi.org/10.1109/iccv.2017.603'
chicago: 'Litany, Or, Tal Remez, Emanuele Rodola, Alexander Bronstein, and Michael
Bronstein. “Deep Functional Maps: Structured Prediction for Dense Shape Correspondence.”
In 2017 IEEE International Conference on Computer Vision (ICCV), Vol. 31.
IEEE, 2017. https://doi.org/10.1109/iccv.2017.603.'
ieee: 'O. Litany, T. Remez, E. Rodola, A. Bronstein, and M. Bronstein, “Deep functional
maps: Structured prediction for dense shape correspondence,” in 2017 IEEE International
Conference on Computer Vision (ICCV), 2017, vol. 31.'
ista: 'Litany O, Remez T, Rodola E, Bronstein A, Bronstein M. 2017. Deep functional
maps: Structured prediction for dense shape correspondence. 2017 IEEE International
Conference on Computer Vision (ICCV). 16th IEEE International Conference on Computer
Vision vol. 31, 8237865.'
mla: 'Litany, Or, et al. “Deep Functional Maps: Structured Prediction for Dense
Shape Correspondence.” 2017 IEEE International Conference on Computer Vision
(ICCV), vol. 31, 8237865, IEEE, 2017, doi:10.1109/iccv.2017.603.'
short: O. Litany, T. Remez, E. Rodola, A. Bronstein, M. Bronstein, in:, 2017 IEEE
International Conference on Computer Vision (ICCV), IEEE, 2017.
conference:
end_date: 2017-10-29
name: 16th IEEE International Conference on Computer Vision
start_date: 2017-10-22
date_created: 2024-10-09T07:48:43Z
date_published: 2017-12-25T00:00:00Z
date_updated: 2024-12-05T14:20:54Z
day: '25'
department:
- _id: E-Lib
doi: 10.1109/iccv.2017.603
extern: '1'
external_id:
arxiv:
- '1704.08686'
fulldoi: https://doi.org/10.1109/iccv.2017.603
intvolume: ' 31'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1704.08686
month: '12'
oa: 1
oa_version: Preprint
publication: 2017 IEEE International Conference on Computer Vision (ICCV)
publication_identifier:
eissn:
- '9781538610329'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Deep functional maps: Structured prediction for dense shape correspondence'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 31
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'
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: 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 for 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 for 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 for 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 for 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).
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T11:46:38Z
date_published: 2017-07-03T00:00:00Z
date_updated: 2026-07-06T13:26:27Z
day: '03'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.23638/LMCS-13(2:15)2017
ec_funded: 1
external_id:
isi:
- '000419160800002'
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
fulldoi: https://doi.org/10.23638/LMCS-13(2:15)2017
has_accepted_license: '1'
intvolume: ' 13'
isi: 1
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
publication: Logical Methods in Computer Science
publication_identifier:
issn:
- 1860-5974
publication_status: published
publisher: International Federation for Computational Logic
publist_id: '7355'
pubrep_id: '957'
quality_controlled: '1'
related_material:
record:
- id: '5429'
relation: earlier_version
status: public
- id: '5435'
relation: earlier_version
status: public
- id: '1657'
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: '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. '
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: 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 for 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 for 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 for 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 for
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).
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T11:46:37Z
date_published: 2017-09-13T00:00:00Z
date_updated: 2026-07-06T13:27:53Z
day: '13'
ddc:
- '004'
department:
- _id: KrCh
- _id: ToHe
doi: 10.23638/LMCS-13(3:23)2017
ec_funded: 1
external_id:
isi:
- '000419163000005'
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
fulldoi: https://doi.org/10.23638/LMCS-13(3:23)2017
has_accepted_license: '1'
intvolume: ' 13'
isi: 1
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: Formal methods for the design and analysis of complex systems
- _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:
- 1860-5974
publication_status: published
publisher: International Federation for Computational Logic
publist_id: '7356'
pubrep_id: '955'
quality_controlled: '1'
related_material:
record:
- id: '5438'
relation: earlier_version
status: public
- id: '1610'
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: '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 M, 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., & Loitzenbauer, V. (2017). Improved algorithms
for parity and Streett objectives. Logical Methods in Computer Science.
International Federation for Computational Logic. https://doi.org/10.23638/LMCS-13(3:26)2017
chicago: Chatterjee, Krishnendu, Monika Henzinger, and Veronika Loitzenbauer. “Improved
Algorithms for Parity and Streett Objectives.” Logical Methods in Computer
Science. International Federation for Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:26)2017.
ieee: K. Chatterjee, M. Henzinger, and V. Loitzenbauer, “Improved algorithms for
parity and Streett objectives,” Logical Methods in Computer Science, vol.
13, no. 3. International Federation for Computational Logic, 2017.
ista: Chatterjee K, Henzinger M, 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 for Computational Logic, 2017, doi:10.23638/LMCS-13(3:26)2017.
short: K. Chatterjee, M. Henzinger, V. Loitzenbauer, Logical Methods in Computer
Science 13 (2017).
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T11:46:37Z
date_published: 2017-09-26T00:00:00Z
date_updated: 2026-07-06T13:28:05Z
day: '26'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.23638/LMCS-13(3:26)2017
ec_funded: 1
external_id:
arxiv:
- '1410.0833'
isi:
- '000419163000001'
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
fulldoi: https://doi.org/10.23638/LMCS-13(3:26)2017
has_accepted_license: '1'
intvolume: ' 13'
isi: 1
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 for 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: '484'
abstract:
- lang: eng
text: We consider the dynamics of a large quantum system of N identical bosons in
3D interacting via a two-body potential of the form N3β-1w(Nβ(x - y)). For fixed
0 = β < 1/3 and large N, we obtain a norm approximation to the many-body evolution
in the Nparticle Hilbert space. The leading order behaviour of the dynamics is
determined by Hartree theory while the second order is given by Bogoliubov theory.
article_processing_charge: No
arxiv: 1
author:
- first_name: Phan
full_name: Nam, Phan
id: 404092F4-F248-11E8-B48F-1D18A9856A87
last_name: Nam
- first_name: Marcin M
full_name: Napiórkowski, Marcin M
id: 4197AD04-F248-11E8-B48F-1D18A9856A87
last_name: Napiórkowski
citation:
ama: Nam P, Napiórkowski MM. Bogoliubov correction to the mean-field dynamics of
interacting bosons. Advances in Theoretical and Mathematical Physics. 2017;21(3):683-738.
doi:10.4310/ATMP.2017.v21.n3.a4
apa: Nam, P., & Napiórkowski, M. M. (2017). Bogoliubov correction to the mean-field
dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics.
International Press of Boston. https://doi.org/10.4310/ATMP.2017.v21.n3.a4
chicago: Nam, Phan, and Marcin M Napiórkowski. “Bogoliubov Correction to the Mean-Field
Dynamics of Interacting Bosons.” Advances in Theoretical and Mathematical Physics.
International Press of Boston, 2017. https://doi.org/10.4310/ATMP.2017.v21.n3.a4.
ieee: P. Nam and M. M. Napiórkowski, “Bogoliubov correction to the mean-field dynamics
of interacting bosons,” Advances in Theoretical and Mathematical Physics,
vol. 21, no. 3. International Press of Boston, pp. 683–738, 2017.
ista: Nam P, Napiórkowski MM. 2017. Bogoliubov correction to the mean-field dynamics
of interacting bosons. Advances in Theoretical and Mathematical Physics. 21(3),
683–738.
mla: Nam, Phan, and Marcin M. Napiórkowski. “Bogoliubov Correction to the Mean-Field
Dynamics of Interacting Bosons.” Advances in Theoretical and Mathematical Physics,
vol. 21, no. 3, International Press of Boston, 2017, pp. 683–738, doi:10.4310/ATMP.2017.v21.n3.a4.
short: P. Nam, M.M. Napiórkowski, Advances in Theoretical and Mathematical Physics
21 (2017) 683–738.
das_tickbox: '1'
date_created: 2018-12-11T11:46:43Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2026-07-06T13:34:16Z
day: '01'
department:
- _id: RoSe
doi: 10.4310/ATMP.2017.v21.n3.a4
ec_funded: 1
external_id:
arxiv:
- '1509.04631'
isi:
- '000409382300004'
fulldoi: https://doi.org/10.4310/ATMP.2017.v21.n3.a4
intvolume: ' 21'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1509.04631
month: '01'
oa: 1
oa_version: Submitted Version
page: 683 - 738
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 25C878CE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P27533_N27
name: Structure of the Excitation Spectrum for Many-Body Quantum Systems
publication: Advances in Theoretical and Mathematical Physics
publication_identifier:
issn:
- 1095-0761
publication_status: published
publisher: International Press of Boston
publist_id: '7336'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Bogoliubov correction to the mean-field dynamics of interacting bosons
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 21
year: '2017'
...
---
_id: '483'
abstract:
- lang: eng
text: We prove the universality for the eigenvalue gap statistics in the bulk of
the spectrum for band matrices, in the regime where the band width is comparable
with the dimension of the matrix, W ~ N. All previous results concerning universality
of non-Gaussian random matrices are for mean-field models. By relying on a new
mean-field reduction technique, we deduce universality from quantum unique ergodicity
for band matrices.
article_processing_charge: No
arxiv: 1
author:
- first_name: Paul
full_name: Bourgade, Paul
last_name: Bourgade
- 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: Horng
full_name: Yau, Horng
last_name: Yau
- first_name: Jun
full_name: Yin, Jun
last_name: Yin
citation:
ama: Bourgade P, Erdös L, Yau H, Yin J. Universality for a class of random band
matrices. Advances in Theoretical and Mathematical Physics. 2017;21(3):739-800.
doi:10.4310/ATMP.2017.v21.n3.a5
apa: Bourgade, P., Erdös, L., Yau, H., & Yin, J. (2017). Universality for a
class of random band matrices. Advances in Theoretical and Mathematical Physics.
International Press of Boston. https://doi.org/10.4310/ATMP.2017.v21.n3.a5
chicago: Bourgade, Paul, László Erdös, Horng Yau, and Jun Yin. “Universality for
a Class of Random Band Matrices.” Advances in Theoretical and Mathematical
Physics. International Press of Boston, 2017. https://doi.org/10.4310/ATMP.2017.v21.n3.a5.
ieee: P. Bourgade, L. Erdös, H. Yau, and J. Yin, “Universality for a class of random
band matrices,” Advances in Theoretical and Mathematical Physics, vol.
21, no. 3. International Press of Boston, pp. 739–800, 2017.
ista: Bourgade P, Erdös L, Yau H, Yin J. 2017. Universality for a class of random
band matrices. Advances in Theoretical and Mathematical Physics. 21(3), 739–800.
mla: Bourgade, Paul, et al. “Universality for a Class of Random Band Matrices.”
Advances in Theoretical and Mathematical Physics, vol. 21, no. 3, International
Press of Boston, 2017, pp. 739–800, doi:10.4310/ATMP.2017.v21.n3.a5.
short: P. Bourgade, L. Erdös, H. Yau, J. Yin, Advances in Theoretical and Mathematical
Physics 21 (2017) 739–800.
das_tickbox: '1'
date_created: 2018-12-11T11:46:43Z
date_published: 2017-08-25T00:00:00Z
date_updated: 2026-07-06T13:35:08Z
day: '25'
department:
- _id: LaEr
doi: 10.4310/ATMP.2017.v21.n3.a5
ec_funded: 1
external_id:
arxiv:
- '1602.02312'
isi:
- '000409382300005'
fulldoi: https://doi.org/10.4310/ATMP.2017.v21.n3.a5
intvolume: ' 21'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1602.02312
month: '08'
oa: 1
oa_version: Submitted Version
page: 739 - 800
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Advances in Theoretical and Mathematical Physics
publication_identifier:
issn:
- 1095-0761
publication_status: published
publisher: International Press of Boston
publist_id: '7337'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Universality for a class of random band matrices
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 21
year: '2017'
...