---
_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: '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
license: https://creativecommons.org/licenses/by-nd/4.0/
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'
...
---
_id: '1000'
abstract:
- lang: eng
text: 'We study probabilistic models of natural images and extend the autoregressive
family of PixelCNN models by incorporating latent variables. Subsequently, we
describe two new generative image models that exploit different image transformations
as latent variables: a quantized grayscale view of the image or a multi-resolution
image pyramid. The proposed models tackle two known shortcomings of existing PixelCNN
models: 1) their tendency to focus on low-level image details, while largely ignoring
high-level image information, such as object shapes, and 2) their computationally
costly procedure for image sampling. We experimentally demonstrate benefits of
our LatentPixelCNN models, in particular showing that they produce much more realistically
looking image samples than previous state-of-the-art probabilistic models. '
acknowledgement: We thank Tim Salimans for spotting a mistake in our preliminary arXiv
manuscript. This work was funded by the European Research Council under the European
Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no 308036.
article_processing_charge: No
arxiv: 1
author:
- first_name: Alexander
full_name: Kolesnikov, Alexander
id: 2D157DB6-F248-11E8-B48F-1D18A9856A87
last_name: Kolesnikov
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Kolesnikov A, Lampert C. PixelCNN models with auxiliary variables for natural
image modeling. In: 34th International Conference on Machine Learning.
Vol 70. Journal of Machine Learning Research; 2017:1905-1914.'
apa: 'Kolesnikov, A., & Lampert, C. (2017). PixelCNN models with auxiliary variables
for natural image modeling. In 34th International Conference on Machine Learning
(Vol. 70, pp. 1905–1914). Sydney, Australia: Journal of Machine Learning Research.'
chicago: Kolesnikov, Alexander, and Christoph Lampert. “PixelCNN Models with Auxiliary
Variables for Natural Image Modeling.” In 34th International Conference on
Machine Learning, 70:1905–14. Journal of Machine Learning Research, 2017.
ieee: A. Kolesnikov and C. Lampert, “PixelCNN models with auxiliary variables for
natural image modeling,” in 34th International Conference on Machine Learning,
Sydney, Australia, 2017, vol. 70, pp. 1905–1914.
ista: 'Kolesnikov A, Lampert C. 2017. PixelCNN models with auxiliary variables for
natural image modeling. 34th International Conference on Machine Learning. ICML:
International Conference on Machine Learning vol. 70, 1905–1914.'
mla: Kolesnikov, Alexander, and Christoph Lampert. “PixelCNN Models with Auxiliary
Variables for Natural Image Modeling.” 34th International Conference on Machine
Learning, vol. 70, Journal of Machine Learning Research, 2017, pp. 1905–14.
short: A. Kolesnikov, C. Lampert, in:, 34th International Conference on Machine
Learning, Journal of Machine Learning Research, 2017, pp. 1905–1914.
conference:
end_date: 2017-08-11
location: Sydney, Australia
name: 'ICML: International Conference on Machine Learning'
start_date: 2017-08-06
das_tickbox: '1'
date_created: 2018-12-11T11:49:37Z
date_published: 2017-08-01T00:00:00Z
date_updated: 2026-07-06T13:41:23Z
day: '01'
department:
- _id: ChLa
ec_funded: 1
external_id:
arxiv:
- '1612.08185'
isi:
- '000683309501102'
has_accepted_license: '1'
intvolume: ' 70'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1612.08185
month: '08'
oa: 1
oa_version: Submitted Version
page: 1905 - 1914
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication: 34th International Conference on Machine Learning
publication_identifier:
isbn:
- 978-151085514-4
publication_status: published
publisher: Journal of Machine Learning Research
publist_id: '6398'
quality_controlled: '1'
scopus_import: '1'
status: public
title: PixelCNN models with auxiliary variables for natural image modeling
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 70
year: '2017'
...
---
_id: '568'
abstract:
- lang: eng
text: 'We study robust properties of zero sets of continuous maps f: X → ℝn. Formally,
we analyze the family Z< r(f) := (g-1(0): ||g - f|| < r) of all zero sets
of all continuous maps g closer to f than r in the max-norm. All of these sets
are outside A := (x: |f(x)| ≥ r) and we claim that Z< r(f) is fully determined
by A and an element of a certain cohomotopy group which (by a recent result) is
computable whenever the dimension of X is at most 2n - 3. By considering all r
> 0 simultaneously, the pointed cohomotopy groups form a persistence module-a
structure leading to persistence diagrams as in the case of persistent homology
or well groups. Eventually, we get a descriptor of persistent robust properties
of zero sets that has better descriptive power (Theorem A) and better computability
status (Theorem B) than the established well diagrams. Moreover, if we endow every
point of each zero set with gradients of the perturbation, the robust description
of the zero sets by elements of cohomotopy groups is in some sense the best possible
(Theorem C).'
article_processing_charge: No
arxiv: 1
author:
- first_name: Peter
full_name: Franek, Peter
id: 473294AE-F248-11E8-B48F-1D18A9856A87
last_name: Franek
orcid: 0000-0001-8878-8397
- first_name: Marek
full_name: Krcál, Marek
id: 33E21118-F248-11E8-B48F-1D18A9856A87
last_name: Krcál
citation:
ama: Franek P, Krcál M. Persistence of zero sets. Homology, Homotopy and Applications.
2017;19(2):313-342. doi:10.4310/HHA.2017.v19.n2.a16
apa: Franek, P., & Krcál, M. (2017). Persistence of zero sets. Homology,
Homotopy and Applications. International Press of Boston. https://doi.org/10.4310/HHA.2017.v19.n2.a16
chicago: Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.” Homology,
Homotopy and Applications. International Press of Boston, 2017. https://doi.org/10.4310/HHA.2017.v19.n2.a16.
ieee: P. Franek and M. Krcál, “Persistence of zero sets,” Homology, Homotopy
and Applications, vol. 19, no. 2. International Press of Boston, pp. 313–342,
2017.
ista: Franek P, Krcál M. 2017. Persistence of zero sets. Homology, Homotopy and
Applications. 19(2), 313–342.
mla: Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.” Homology, Homotopy
and Applications, vol. 19, no. 2, International Press of Boston, 2017, pp.
313–42, doi:10.4310/HHA.2017.v19.n2.a16.
short: P. Franek, M. Krcál, Homology, Homotopy and Applications 19 (2017) 313–342.
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T11:47:14Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2026-07-06T13:38:28Z
day: '01'
department:
- _id: UlWa
- _id: HeEd
doi: 10.4310/HHA.2017.v19.n2.a16
ec_funded: 1
external_id:
arxiv:
- '1507.04310'
isi:
- '000440749400010'
fulldoi: https://doi.org/10.4310/HHA.2017.v19.n2.a16
intvolume: ' 19'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1507.04310
month: '01'
oa: 1
oa_version: Submitted Version
page: 313 - 342
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 2590DB08-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '701309'
name: Atomic Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes
publication: Homology, Homotopy and Applications
publication_identifier:
issn:
- 1532-0073
publication_status: published
publisher: International Press of Boston
publist_id: '7246'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Persistence of zero sets
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 19
year: '2017'
...
---
_id: '701'
abstract:
- lang: eng
text: A d-dimensional simplex S is called a k-reptile (or a k-reptile simplex) if
it can be tiled by k simplices with disjoint interiors that are all mutually congruent
and similar to S. For d = 2, triangular k-reptiles exist for all k of the form
a^2, 3a^2 or a^2+b^2 and they have been completely characterized by Snover, Waiveris,
and Williams. On the other hand, the only k-reptile simplices that are known for
d ≥ 3, have k = m^d, where m is a positive integer. We substantially simplify
the proof by Matoušek and the second author that for d = 3, k-reptile tetrahedra
can exist only for k = m^3. We then prove a weaker analogue of this result for
d = 4 by showing that four-dimensional k-reptile simplices can exist only for
k = m^2.
article_processing_charge: No
author:
- first_name: Jan
full_name: Kynčl, Jan
last_name: Kynčl
- first_name: Zuzana
full_name: Patakova, Zuzana
id: 48B57058-F248-11E8-B48F-1D18A9856A87
last_name: Patakova
orcid: 0000-0002-3975-1683
citation:
ama: Kynčl J, Patakova Z. On the nonexistence of k reptile simplices in ℝ^3 and
ℝ^4. The Electronic Journal of Combinatorics. 2017;24(3):1-44.
apa: Kynčl, J., & Patakova, Z. (2017). On the nonexistence of k reptile simplices
in ℝ^3 and ℝ^4. The Electronic Journal of Combinatorics. International
Press of Boston.
chicago: Kynčl, Jan, and Zuzana Patakova. “On the Nonexistence of k Reptile Simplices
in ℝ^3 and ℝ^4.” The Electronic Journal of Combinatorics. International
Press of Boston, 2017.
ieee: J. Kynčl and Z. Patakova, “On the nonexistence of k reptile simplices in ℝ^3
and ℝ^4,” The Electronic Journal of Combinatorics, vol. 24, no. 3. International
Press of Boston, pp. 1–44, 2017.
ista: Kynčl J, Patakova Z. 2017. On the nonexistence of k reptile simplices in ℝ^3
and ℝ^4. The Electronic Journal of Combinatorics. 24(3), 1–44.
mla: Kynčl, Jan, and Zuzana Patakova. “On the Nonexistence of k Reptile Simplices
in ℝ^3 and ℝ^4.” The Electronic Journal of Combinatorics, vol. 24, no.
3, International Press of Boston, 2017, pp. 1–44.
short: J. Kynčl, Z. Patakova, The Electronic Journal of Combinatorics 24 (2017)
1–44.
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T11:48:00Z
date_published: 2017-07-14T00:00:00Z
date_updated: 2026-07-06T13:38:44Z
day: '14'
ddc:
- '500'
department:
- _id: UlWa
file:
- access_level: open_access
checksum: a431e573e31df13bc0f66de3061006ec
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:25Z
date_updated: 2020-07-14T12:47:47Z
file_id: '5077'
file_name: IST-2018-984-v1+1_Patakova_on_the_nonexistence_of_k-reptile_simplices_in_R_3_and_R_4_2017.pdf
file_size: 544042
relation: main_file
file_date_updated: 2020-07-14T12:47:47Z
has_accepted_license: '1'
intvolume: ' 24'
issue: '3'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 1-44
publication: The Electronic Journal of Combinatorics
publication_identifier:
issn:
- 1077-8926
publication_status: published
publisher: International Press of Boston
publist_id: '6996'
pubrep_id: '984'
quality_controlled: '1'
status: public
title: On the nonexistence of k reptile simplices in ℝ^3 and ℝ^4
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 24
year: '2017'
...
---
_id: '951'
abstract:
- lang: eng
text: Dengue-suppressing Wolbachia strains are promising tools for arbovirus control,
particularly as they have the potential to self-spread following local introductions.
To test this, we followed the frequency of the transinfected Wolbachia strain
wMel through Ae. aegypti in Cairns, Australia, following releases at 3 nonisolated
locations within the city in early 2013. Spatial spread was analysed graphically
using interpolation and by fitting a statistical model describing the position
and width of the wave. For the larger 2 of the 3 releases (covering 0.97 km2 and
0.52 km2), we observed slow but steady spatial spread, at about 100–200 m per
year, roughly consistent with theoretical predictions. In contrast, the smallest
release (0.11 km2) produced erratic temporal and spatial dynamics, with little
evidence of spread after 2 years. This is consistent with the prediction concerning
fitness-decreasing Wolbachia transinfections that a minimum release area is needed
to achieve stable local establishment and spread in continuous habitats. Our graphical
and likelihood analyses produced broadly consistent estimates of wave speed and
wave width. Spread at all sites was spatially heterogeneous, suggesting that environmental
heterogeneity will affect large-scale Wolbachia transformations of urban mosquito
populations. The persistence and spread of Wolbachia in release areas meeting
minimum area requirements indicates the promise of successful large-scale population
transfo
article_number: e2001894
article_processing_charge: No
author:
- first_name: Tom
full_name: Schmidt, Tom
last_name: Schmidt
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Gordana
full_name: Rasic, Gordana
last_name: Rasic
- first_name: Andrew
full_name: Turley, Andrew
last_name: Turley
- first_name: Brian
full_name: Montgomery, Brian
last_name: Montgomery
- first_name: Inaki
full_name: Iturbe Ormaetxe, Inaki
last_name: Iturbe Ormaetxe
- first_name: Peter
full_name: Cook, Peter
last_name: Cook
- first_name: Peter
full_name: Ryan, Peter
last_name: Ryan
- first_name: Scott
full_name: Ritchie, Scott
last_name: Ritchie
- first_name: Ary
full_name: Hoffmann, Ary
last_name: Hoffmann
- first_name: Scott
full_name: O’Neill, Scott
last_name: O’Neill
- first_name: Michael
full_name: Turelli, Michael
last_name: Turelli
citation:
ama: Schmidt T, Barton NH, Rasic G, et al. Local introduction and heterogeneous
spatial spread of dengue-suppressing Wolbachia through an urban population of
Aedes Aegypti. PLoS Biology. 2017;15(5). doi:10.1371/journal.pbio.2001894
apa: Schmidt, T., Barton, N. H., Rasic, G., Turley, A., Montgomery, B., Iturbe Ormaetxe,
I., … Turelli, M. (2017). Local introduction and heterogeneous spatial spread
of dengue-suppressing Wolbachia through an urban population of Aedes Aegypti.
PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.2001894
chicago: Schmidt, Tom, Nicholas H Barton, Gordana Rasic, Andrew Turley, Brian Montgomery,
Inaki Iturbe Ormaetxe, Peter Cook, et al. “Local Introduction and Heterogeneous
Spatial Spread of Dengue-Suppressing Wolbachia through an Urban Population of
Aedes Aegypti.” PLoS Biology. Public Library of Science, 2017. https://doi.org/10.1371/journal.pbio.2001894.
ieee: T. Schmidt et al., “Local introduction and heterogeneous spatial spread
of dengue-suppressing Wolbachia through an urban population of Aedes Aegypti,”
PLoS Biology, vol. 15, no. 5. Public Library of Science, 2017.
ista: Schmidt T, Barton NH, Rasic G, Turley A, Montgomery B, Iturbe Ormaetxe I,
Cook P, Ryan P, Ritchie S, Hoffmann A, O’Neill S, Turelli M. 2017. Local introduction
and heterogeneous spatial spread of dengue-suppressing Wolbachia through an urban
population of Aedes Aegypti. PLoS Biology. 15(5), e2001894.
mla: Schmidt, Tom, et al. “Local Introduction and Heterogeneous Spatial Spread of
Dengue-Suppressing Wolbachia through an Urban Population of Aedes Aegypti.” PLoS
Biology, vol. 15, no. 5, e2001894, Public Library of Science, 2017, doi:10.1371/journal.pbio.2001894.
short: T. Schmidt, N.H. Barton, G. Rasic, A. Turley, B. Montgomery, I. Iturbe Ormaetxe,
P. Cook, P. Ryan, S. Ritchie, A. Hoffmann, S. O’Neill, M. Turelli, PLoS Biology
15 (2017).
date_created: 2018-12-11T11:49:22Z
date_published: 2017-05-30T00:00:00Z
date_updated: 2026-07-06T13:53:54Z
day: '30'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.1371/journal.pbio.2001894
external_id:
isi:
- '000402520000012'
file:
- access_level: open_access
checksum: 107d290bd1159ec77b734eb2824b01c8
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:30Z
date_updated: 2020-07-14T12:48:16Z
file_id: '4691'
file_name: IST-2017-843-v1+1_journal.pbio.2001894.pdf
file_size: 5541206
relation: main_file
file_date_updated: 2020-07-14T12:48:16Z
fulldoi: https://doi.org/10.1371/journal.pbio.2001894
has_accepted_license: '1'
intvolume: ' 15'
isi: 1
issue: '5'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
publication: PLoS Biology
publication_identifier:
issn:
- 1544-9173
publication_status: published
publisher: Public Library of Science
publist_id: '6464'
pubrep_id: '843'
quality_controlled: '1'
related_material:
record:
- id: '9856'
relation: research_data
status: public
- id: '9858'
relation: research_data
status: public
- id: '9857'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Local introduction and heterogeneous spatial spread of dengue-suppressing Wolbachia
through an urban population of Aedes Aegypti
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: 15
year: '2017'
...
---
_id: '9857'
article_processing_charge: No
author:
- first_name: Tom
full_name: Schmidt, Tom
last_name: Schmidt
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Gordana
full_name: Rasic, Gordana
last_name: Rasic
- first_name: Andrew
full_name: Turley, Andrew
last_name: Turley
- first_name: Brian
full_name: Montgomery, Brian
last_name: Montgomery
- first_name: Inaki
full_name: Iturbe Ormaetxe, Inaki
last_name: Iturbe Ormaetxe
- first_name: Peter
full_name: Cook, Peter
last_name: Cook
- first_name: Peter
full_name: Ryan, Peter
last_name: Ryan
- first_name: Scott
full_name: Ritchie, Scott
last_name: Ritchie
- first_name: Ary
full_name: Hoffmann, Ary
last_name: Hoffmann
- first_name: Scott
full_name: O’Neill, Scott
last_name: O’Neill
- first_name: Michael
full_name: Turelli, Michael
last_name: Turelli
citation:
ama: Schmidt T, Barton NH, Rasic G, et al. Supporting information concerning observed
wMel frequencies and analyses of habitat variables. 2017. doi:10.1371/journal.pbio.2001894.s015
apa: Schmidt, T., Barton, N. H., Rasic, G., Turley, A., Montgomery, B., Iturbe Ormaetxe,
I., … Turelli, M. (2017). Supporting information concerning observed wMel frequencies
and analyses of habitat variables. Public Library of Science. https://doi.org/10.1371/journal.pbio.2001894.s015
chicago: Schmidt, Tom, Nicholas H Barton, Gordana Rasic, Andrew Turley, Brian Montgomery,
Inaki Iturbe Ormaetxe, Peter Cook, et al. “Supporting Information Concerning Observed
WMel Frequencies and Analyses of Habitat Variables.” Public Library of Science,
2017. https://doi.org/10.1371/journal.pbio.2001894.s015.
ieee: T. Schmidt et al., “Supporting information concerning observed wMel
frequencies and analyses of habitat variables.” Public Library of Science, 2017.
ista: Schmidt T, Barton NH, Rasic G, Turley A, Montgomery B, Iturbe Ormaetxe I,
Cook P, Ryan P, Ritchie S, Hoffmann A, O’Neill S, Turelli M. 2017. Supporting
information concerning observed wMel frequencies and analyses of habitat variables,
Public Library of Science, 10.1371/journal.pbio.2001894.s015.
mla: Schmidt, Tom, et al. Supporting Information Concerning Observed WMel Frequencies
and Analyses of Habitat Variables. Public Library of Science, 2017, doi:10.1371/journal.pbio.2001894.s015.
short: T. Schmidt, N.H. Barton, G. Rasic, A. Turley, B. Montgomery, I. Iturbe Ormaetxe,
P. Cook, P. Ryan, S. Ritchie, A. Hoffmann, S. O’Neill, M. Turelli, (2017).
date_created: 2021-08-10T07:41:52Z
date_published: 2017-05-30T00:00:00Z
date_updated: 2026-07-06T13:53:55Z
day: '30'
department:
- _id: NiBa
doi: 10.1371/journal.pbio.2001894.s015
fulldoi: https://doi.org/10.1371/journal.pbio.2001894.s015
month: '05'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '951'
relation: used_in_publication
status: public
status: public
title: Supporting information concerning observed wMel frequencies and analyses of
habitat variables
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '604'
abstract:
- lang: eng
text: In several settings of physics and chemistry one has to deal with molecules
interacting with some kind of an external environment, be it a gas, a solution,
or a crystal surface. Understanding molecular processes in the presence of such
a many-particle bath is inherently challenging, and usually requires large-scale
numerical computations. Here, we present an alternative approach to the problem,
based on the notion of the angulon quasiparticle. We show that molecules rotating
inside superfluid helium nanodroplets and Bose–Einstein condensates form angulons,
and therefore can be described by straightforward solutions of a simple microscopic
Hamiltonian. Casting the problem in the language of angulons allows us not only
to greatly simplify it, but also to gain insights into the origins of the observed
phenomena and to make predictions for future experimental studies.
alternative_title:
- Theoretical and Computational Chemistry Series
article_processing_charge: No
arxiv: 1
author:
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
- first_name: Richard
full_name: Schmidt, Richard
last_name: Schmidt
citation:
ama: 'Lemeshko M, Schmidt R. Molecular impurities interacting with a many-particle
environment: From ultracold gases to helium nanodroplets. In: Dulieu O, Osterwalder
A, eds. Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero
. Vol 11. Theoretical and Computational Chemistry Series. Royal Society of
Chemistry; 2017:444-495. doi:10.1039/9781782626800-00444'
apa: 'Lemeshko, M., & Schmidt, R. (2017). Molecular impurities interacting with
a many-particle environment: From ultracold gases to helium nanodroplets. In O.
Dulieu & A. Osterwalder (Eds.), Cold Chemistry: Molecular Scattering and
Reactivity Near Absolute Zero (Vol. 11, pp. 444–495). Royal Society of Chemistry.
https://doi.org/10.1039/9781782626800-00444'
chicago: 'Lemeshko, Mikhail, and Richard Schmidt. “Molecular Impurities Interacting
with a Many-Particle Environment: From Ultracold Gases to Helium Nanodroplets.”
In Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero ,
edited by Oliver Dulieu and Andreas Osterwalder, 11:444–95. Theoretical and Computational
Chemistry Series. Royal Society of Chemistry, 2017. https://doi.org/10.1039/9781782626800-00444.'
ieee: 'M. Lemeshko and R. Schmidt, “Molecular impurities interacting with a many-particle
environment: From ultracold gases to helium nanodroplets,” in Cold Chemistry:
Molecular Scattering and Reactivity Near Absolute Zero , vol. 11, O. Dulieu
and A. Osterwalder, Eds. Royal Society of Chemistry, 2017, pp. 444–495.'
ista: 'Lemeshko M, Schmidt R. 2017.Molecular impurities interacting with a many-particle
environment: From ultracold gases to helium nanodroplets. In: Cold Chemistry:
Molecular Scattering and Reactivity Near Absolute Zero . Theoretical and Computational
Chemistry Series, vol. 11, 444–495.'
mla: 'Lemeshko, Mikhail, and Richard Schmidt. “Molecular Impurities Interacting
with a Many-Particle Environment: From Ultracold Gases to Helium Nanodroplets.”
Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero ,
edited by Oliver Dulieu and Andreas Osterwalder, vol. 11, Royal Society of Chemistry,
2017, pp. 444–95, doi:10.1039/9781782626800-00444.'
short: 'M. Lemeshko, R. Schmidt, in:, O. Dulieu, A. Osterwalder (Eds.), Cold Chemistry:
Molecular Scattering and Reactivity Near Absolute Zero , Royal Society of Chemistry,
2017, pp. 444–495.'
das_tickbox: '1'
date_created: 2018-12-11T11:47:27Z
date_published: 2017-12-14T00:00:00Z
date_updated: 2026-07-07T05:50:51Z
day: '14'
department:
- _id: MiLe
doi: 10.1039/9781782626800-00444
editor:
- first_name: Oliver
full_name: Dulieu, Oliver
last_name: Dulieu
- first_name: Andreas
full_name: Osterwalder, Andreas
last_name: Osterwalder
external_id:
arxiv:
- '1703.06753'
fulldoi: https://doi.org/10.1039/9781782626800-00444
intvolume: ' 11'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1703.06753
month: '12'
oa: 1
oa_version: Submitted Version
page: 444 - 495
publication: 'Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero '
publication_identifier:
issn:
- 2041-3181
publication_status: published
publisher: Royal Society of Chemistry
publist_id: '7201'
quality_controlled: '1'
scopus_import: '1'
series_title: Theoretical and Computational Chemistry Series
status: public
title: 'Molecular impurities interacting with a many-particle environment: From ultracold
gases to helium nanodroplets'
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 11
year: '2017'
...
---
_id: '823'
abstract:
- lang: eng
text: The resolution of a linear system with positive integer variables is a basic
yet difficult computational problem with many applications. We consider sparse
uncorrelated random systems parametrised by the density c and the ratio α=N/M
between number of variables N and number of constraints M. By means of ensemble
calculations we show that the space of feasible solutions endows a Van-Der-Waals
phase diagram in the plane (c, α). We give numerical evidence that the associated
computational problems become more difficult across the critical point and in
particular in the coexistence region.
article_number: '093404'
article_processing_charge: No
arxiv: 1
author:
- first_name: Simona
full_name: Colabrese, Simona
last_name: Colabrese
- first_name: Daniele
full_name: De Martino, Daniele
id: 3FF5848A-F248-11E8-B48F-1D18A9856A87
last_name: De Martino
orcid: 0000-0002-5214-4706
- first_name: Luca
full_name: Leuzzi, Luca
last_name: Leuzzi
- first_name: Enzo
full_name: Marinari, Enzo
last_name: Marinari
citation:
ama: 'Colabrese S, De Martino D, Leuzzi L, Marinari E. Phase transitions in integer
linear problems. Journal of Statistical Mechanics: Theory and Experiment.
2017;2017(9). doi:10.1088/1742-5468/aa85c3'
apa: 'Colabrese, S., De Martino, D., Leuzzi, L., & Marinari, E. (2017). Phase
transitions in integer linear problems. Journal of Statistical Mechanics: Theory
and Experiment. IOP Publishing. https://doi.org/10.1088/1742-5468/aa85c3'
chicago: 'Colabrese, Simona, Daniele De Martino, Luca Leuzzi, and Enzo Marinari.
“Phase Transitions in Integer Linear Problems.” Journal of Statistical Mechanics:
Theory and Experiment. IOP Publishing, 2017. https://doi.org/10.1088/1742-5468/aa85c3.'
ieee: 'S. Colabrese, D. De Martino, L. Leuzzi, and E. Marinari, “Phase transitions
in integer linear problems,” Journal of Statistical Mechanics: Theory and Experiment,
vol. 2017, no. 9. IOP Publishing, 2017.'
ista: 'Colabrese S, De Martino D, Leuzzi L, Marinari E. 2017. Phase transitions
in integer linear problems. Journal of Statistical Mechanics: Theory and Experiment.
2017(9), 093404.'
mla: 'Colabrese, Simona, et al. “Phase Transitions in Integer Linear Problems.”
Journal of Statistical Mechanics: Theory and Experiment, vol. 2017, no.
9, 093404, IOP Publishing, 2017, doi:10.1088/1742-5468/aa85c3.'
short: 'S. Colabrese, D. De Martino, L. Leuzzi, E. Marinari, Journal of Statistical
Mechanics: Theory and Experiment 2017 (2017).'
das_tickbox: '1'
date_created: 2018-12-11T11:48:41Z
date_published: 2017-09-26T00:00:00Z
date_updated: 2026-07-07T13:11:04Z
day: '26'
department:
- _id: GaTk
doi: 10.1088/1742-5468/aa85c3
ec_funded: 1
external_id:
arxiv:
- '1705.06303'
isi:
- '000411842900001'
fulldoi: https://doi.org/10.1088/1742-5468/aa85c3
intvolume: ' 2017'
isi: 1
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1705.06303
month: '09'
oa: 1
oa_version: Submitted Version
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: 'Journal of Statistical Mechanics: Theory and Experiment'
publication_identifier:
issn:
- 1742-5468
publication_status: published
publisher: IOP Publishing
publist_id: '6826'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Phase transitions in integer linear problems
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2017
year: '2017'
...
---
_id: '912'
abstract:
- lang: eng
text: "We consider a many-body system of fermionic atoms interacting via a local
pair potential and subject to an external potential within the framework of Bardeen-Cooper-Schrieffer
(BCS) theory. We measure the free energy of the whole sample with respect to the
free energy of a reference state which allows us to define a BCS functional with
boundary conditions at infinity. Our main result is a lower bound for this energy
functional in terms of expressions that typically appear in Ginzburg-Landau functionals.\r\n"
article_number: '081901'
article_processing_charge: No
arxiv: 1
author:
- first_name: Andreas
full_name: Deuchert, Andreas
id: 4DA65CD0-F248-11E8-B48F-1D18A9856A87
last_name: Deuchert
orcid: 0000-0003-3146-6746
citation:
ama: Deuchert A. A lower bound for the BCS functional with boundary conditions at
infinity. Journal of Mathematical Physics. 2017;58(8). doi:10.1063/1.4996580
apa: Deuchert, A. (2017). A lower bound for the BCS functional with boundary conditions
at infinity. Journal of Mathematical Physics. AIP Publishing. https://doi.org/10.1063/1.4996580
chicago: Deuchert, Andreas. “A Lower Bound for the BCS Functional with Boundary
Conditions at Infinity.” Journal of Mathematical Physics. AIP Publishing,
2017. https://doi.org/10.1063/1.4996580.
ieee: A. Deuchert, “A lower bound for the BCS functional with boundary conditions
at infinity,” Journal of Mathematical Physics, vol. 58, no. 8. AIP Publishing,
2017.
ista: Deuchert A. 2017. A lower bound for the BCS functional with boundary conditions
at infinity. Journal of Mathematical Physics. 58(8), 081901.
mla: Deuchert, Andreas. “A Lower Bound for the BCS Functional with Boundary Conditions
at Infinity.” Journal of Mathematical Physics, vol. 58, no. 8, 081901,
AIP Publishing, 2017, doi:10.1063/1.4996580.
short: A. Deuchert, Journal of Mathematical Physics 58 (2017).
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T11:49:10Z
date_published: 2017-08-01T00:00:00Z
date_updated: 2026-07-07T13:10:46Z
day: '01'
department:
- _id: RoSe
doi: 10.1063/1.4996580
ec_funded: 1
external_id:
arxiv:
- '1703.04616'
isi:
- '000409197200015'
fulldoi: https://doi.org/10.1063/1.4996580
intvolume: ' 58'
isi: 1
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1703.04616
month: '08'
oa: 1
oa_version: Submitted Version
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: Journal of Mathematical Physics
publication_identifier:
issn:
- 0022-2488
publication_status: published
publisher: AIP Publishing
publist_id: '6531'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A lower bound for the BCS functional with boundary conditions at infinity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 58
year: '2017'
...
---
_id: '744'
abstract:
- lang: eng
text: In evolutionary game theory interactions between individuals are often assumed
obligatory. However, in many real-life situations, individuals can decide to opt
out of an interaction depending on the information they have about the opponent.
We consider a simple evolutionary game theoretic model to study such a scenario,
where at each encounter between two individuals the type of the opponent (cooperator/defector)
is known with some probability, and where each individual either accepts or opts
out of the interaction. If the type of the opponent is unknown, a trustful individual
accepts the interaction, whereas a suspicious individual opts out of the interaction.
If either of the two individuals opt out both individuals remain without an interaction.
We show that in the prisoners dilemma optional interactions along with suspicious
behaviour facilitates the emergence of trustful cooperation.
article_processing_charge: No
article_type: original
author:
- first_name: Tadeas
full_name: Priklopil, Tadeas
id: 3C869AA0-F248-11E8-B48F-1D18A9856A87
last_name: Priklopil
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Priklopil T, Chatterjee K, Nowak M. Optional interactions and suspicious behaviour
facilitates trustful cooperation in prisoners dilemma. Journal of Theoretical
Biology. 2017;433:64-72. doi:10.1016/j.jtbi.2017.08.025
apa: Priklopil, T., Chatterjee, K., & Nowak, M. (2017). Optional interactions
and suspicious behaviour facilitates trustful cooperation in prisoners dilemma.
Journal of Theoretical Biology. Elsevier. https://doi.org/10.1016/j.jtbi.2017.08.025
chicago: Priklopil, Tadeas, Krishnendu Chatterjee, and Martin Nowak. “Optional Interactions
and Suspicious Behaviour Facilitates Trustful Cooperation in Prisoners Dilemma.”
Journal of Theoretical Biology. Elsevier, 2017. https://doi.org/10.1016/j.jtbi.2017.08.025.
ieee: T. Priklopil, K. Chatterjee, and M. Nowak, “Optional interactions and suspicious
behaviour facilitates trustful cooperation in prisoners dilemma,” Journal of
Theoretical Biology, vol. 433. Elsevier, pp. 64–72, 2017.
ista: Priklopil T, Chatterjee K, Nowak M. 2017. Optional interactions and suspicious
behaviour facilitates trustful cooperation in prisoners dilemma. Journal of Theoretical
Biology. 433, 64–72.
mla: Priklopil, Tadeas, et al. “Optional Interactions and Suspicious Behaviour Facilitates
Trustful Cooperation in Prisoners Dilemma.” Journal of Theoretical Biology,
vol. 433, Elsevier, 2017, pp. 64–72, doi:10.1016/j.jtbi.2017.08.025.
short: T. Priklopil, K. Chatterjee, M. Nowak, Journal of Theoretical Biology 433
(2017) 64–72.
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T11:48:16Z
date_published: 2017-11-21T00:00:00Z
date_updated: 2026-07-07T13:11:54Z
day: '21'
ddc:
- '000'
- '570'
department:
- _id: KrCh
doi: 10.1016/j.jtbi.2017.08.025
ec_funded: 1
external_id:
isi:
- '000412039800007'
pmid:
- '28867224'
file:
- access_level: open_access
checksum: 4b43af1615ebf1a861840cb03d8a320c
content_type: application/pdf
creator: dernst
date_created: 2019-11-19T07:57:39Z
date_updated: 2020-07-14T12:47:58Z
file_id: '7047'
file_name: 2017_JournTheoretBio_Priklopil.pdf
file_size: 537323
relation: main_file
file_date_updated: 2020-07-14T12:47:58Z
fulldoi: https://doi.org/10.1016/j.jtbi.2017.08.025
has_accepted_license: '1'
intvolume: ' 433'
isi: 1
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
page: 64 - 72
pmid: 1
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: Journal of Theoretical Biology
publication_identifier:
issn:
- 0022-5193
publication_status: published
publisher: Elsevier
publist_id: '6923'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optional interactions and suspicious behaviour facilitates trustful cooperation
in prisoners dilemma
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 433
year: '2017'
...
---
_id: '1076'
abstract:
- lang: eng
text: Signatures of the Coulomb corrections in the photoelectron momentum distribution
during laser-induced ionization of atoms or ions in tunneling and multiphoton
regimes are investigated analytically in the case of a one-dimensional problem.
A high-order Coulomb-corrected strong-field approximation is applied, where the
exact continuum state in the S matrix is approximated by the eikonal Coulomb-Volkov
state including the second-order corrections to the eikonal. Although without
high-order corrections our theory coincides with the known analytical R-matrix
(ARM) theory, we propose a simplified procedure for the matrix element derivation.
Rather than matching the eikonal Coulomb-Volkov wave function with the bound state
as in the ARM theory to remove the Coulomb singularity, we calculate the matrix
element via the saddle-point integration method by time as well as by coordinate,
and in this way avoiding the Coulomb singularity. The momentum shift in the photoelectron
momentum distribution with respect to the ARM theory due to high-order corrections
is analyzed for tunneling and multiphoton regimes. The relation of the quantum
corrections to the tunneling delay time is discussed.
article_number: '023403'
article_processing_charge: No
arxiv: 1
author:
- first_name: Michael
full_name: Klaiber, Michael
last_name: Klaiber
- first_name: Jiří
full_name: Daněk, Jiří
last_name: Daněk
- first_name: Enderalp
full_name: Yakaboylu, Enderalp
id: 38CB71F6-F248-11E8-B48F-1D18A9856A87
last_name: Yakaboylu
orcid: 0000-0001-5973-0874
- first_name: Karen
full_name: Hatsagortsyan, Karen
last_name: Hatsagortsyan
- first_name: Christoph
full_name: Keitel, Christoph
last_name: Keitel
citation:
ama: Klaiber M, Daněk J, Yakaboylu E, Hatsagortsyan K, Keitel C. Strong-field ionization
via a high-order Coulomb-corrected strong-field approximation. Physical Review
A. 2017;95(2). doi:10.1103/PhysRevA.95.023403
apa: Klaiber, M., Daněk, J., Yakaboylu, E., Hatsagortsyan, K., & Keitel, C.
(2017). Strong-field ionization via a high-order Coulomb-corrected strong-field
approximation. Physical Review A. American Physical Society. https://doi.org/10.1103/PhysRevA.95.023403
chicago: Klaiber, Michael, Jiří Daněk, Enderalp Yakaboylu, Karen Hatsagortsyan,
and Christoph Keitel. “Strong-Field Ionization via a High-Order Coulomb-Corrected
Strong-Field Approximation.” Physical Review A. American Physical Society,
2017. https://doi.org/10.1103/PhysRevA.95.023403.
ieee: M. Klaiber, J. Daněk, E. Yakaboylu, K. Hatsagortsyan, and C. Keitel, “Strong-field
ionization via a high-order Coulomb-corrected strong-field approximation,” Physical
Review A, vol. 95, no. 2. American Physical Society, 2017.
ista: Klaiber M, Daněk J, Yakaboylu E, Hatsagortsyan K, Keitel C. 2017. Strong-field
ionization via a high-order Coulomb-corrected strong-field approximation. Physical
Review A. 95(2), 023403.
mla: Klaiber, Michael, et al. “Strong-Field Ionization via a High-Order Coulomb-Corrected
Strong-Field Approximation.” Physical Review A, vol. 95, no. 2, 023403,
American Physical Society, 2017, doi:10.1103/PhysRevA.95.023403.
short: M. Klaiber, J. Daněk, E. Yakaboylu, K. Hatsagortsyan, C. Keitel, Physical
Review A 95 (2017).
das_tickbox: '1'
date_created: 2018-12-11T11:50:01Z
date_published: 2017-02-01T00:00:00Z
date_updated: 2026-07-07T13:17:34Z
day: '01'
department:
- _id: MiLe
doi: 10.1103/PhysRevA.95.023403
ec_funded: 1
external_id:
arxiv:
- '1609.07018'
isi:
- '000400571700011'
fulldoi: https://doi.org/10.1103/PhysRevA.95.023403
intvolume: ' 95'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1609.07018
month: '02'
oa: 1
oa_version: Submitted Version
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Physical Review A
publication_identifier:
issn:
- 2469-9926
publication_status: published
publisher: American Physical Society
publist_id: '6305'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Strong-field ionization via a high-order Coulomb-corrected strong-field approximation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 95
year: '2017'
...
---
_id: '6526'
abstract:
- lang: eng
text: 'This paper studies the complexity of estimating Rényi divergences of discrete
distributions: p observed from samples and the baseline distribution q known a
priori. Extending the results of Acharya et al. (SODA''15) on estimating Rényi
entropy, we present improved estimation techniques together with upper and lower
bounds on the sample complexity. We show that, contrarily to estimating Rényi
entropy where a sublinear (in the alphabet size) number of samples suffices, the
sample complexity is heavily dependent on events occurring unlikely in q, and
is unbounded in general (no matter what an estimation technique is used). For
any divergence of integer order bigger than 1, we provide upper and lower bounds
on the number of samples dependent on probabilities of p and q (the lower bounds
hold for non-integer orders as well). We conclude that the worst-case sample complexity
is polynomial in the alphabet size if and only if the probabilities of q are non-negligible.
This gives theoretical insights into heuristics used in the applied literature
to handle numerical instability, which occurs for small probabilities of q. Our
result shows that they should be handled with care not only because of numerical
issues, but also because of a blow up in the sample complexity.'
article_number: '8006529'
article_processing_charge: No
arxiv: 1
author:
- first_name: Maciej
full_name: Skórski, Maciej
id: EC09FA6A-02D0-11E9-8223-86B7C91467DD
last_name: Skórski
citation:
ama: 'Skórski M. On the complexity of estimating Rènyi divergences. In: 2017
IEEE International Symposium on Information Theory. IEEE; 2017. doi:10.1109/isit.2017.8006529'
apa: 'Skórski, M. (2017). On the complexity of estimating Rènyi divergences. In
2017 IEEE International Symposium on Information Theory. Aachen, Germany:
IEEE. https://doi.org/10.1109/isit.2017.8006529'
chicago: Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.” In
2017 IEEE International Symposium on Information Theory. IEEE, 2017. https://doi.org/10.1109/isit.2017.8006529.
ieee: M. Skórski, “On the complexity of estimating Rènyi divergences,” in 2017
IEEE International Symposium on Information Theory, Aachen, Germany, 2017.
ista: 'Skórski M. 2017. On the complexity of estimating Rènyi divergences. 2017
IEEE International Symposium on Information Theory. ISIT: International Symposium
on Information Theory, 8006529.'
mla: Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.” 2017
IEEE International Symposium on Information Theory, 8006529, IEEE, 2017, doi:10.1109/isit.2017.8006529.
short: M. Skórski, in:, 2017 IEEE International Symposium on Information Theory,
IEEE, 2017.
conference:
end_date: 2017-06-30
location: Aachen, Germany
name: 'ISIT: International Symposium on Information Theory'
start_date: 2017-06-25
das_tickbox: '1'
date_created: 2019-06-06T12:53:09Z
date_published: 2017-08-09T00:00:00Z
date_updated: 2026-07-07T13:32:59Z
day: '09'
department:
- _id: KrPi
doi: 10.1109/isit.2017.8006529
ec_funded: 1
external_id:
arxiv:
- '1702.01666'
fulldoi: https://doi.org/10.1109/isit.2017.8006529
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1702.01666
month: '08'
oa: 1
oa_version: Preprint
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: 2017 IEEE International Symposium on Information Theory
publication_identifier:
isbn:
- '9781509040964'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the complexity of estimating Rènyi divergences
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...