---
_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'
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'
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
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
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'
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: '807'
abstract:
- lang: eng
text: 'On January the 1st, 2016 a new agreement between 32 Austrian scientific libraries
and the publisher Springer took its effect: this deal covers accessing the licensed
content on the one hand, and publishing open access on the other hand. More than
1000 papers by Austrian authors were published open access at Springer in the
first year alone. The working group "Springer Compact Evaluierung" made
the data for these articles available via the platform OpenAPC and would like
to use this opportunity to give a short account of what this publishing agreement
actually entails and the working group intends to do.'
article_processing_charge: No
author:
- first_name: Magdalena
full_name: Andrae, Magdalena
last_name: Andrae
- first_name: Márton
full_name: Villányi, Márton
id: 3FFCCD3A-F248-11E8-B48F-1D18A9856A87
last_name: Villányi
orcid: 0000-0001-8126-0426
citation:
ama: Andrae M, Villányi M. Der Springer Compact-Deal – Ein erster Einblick in die
Evaluierung einer Offsetting-Vereinbarung. Mitteilungen der Vereinigung Österreichischer
Bibliothekarinnen und Bibliothekare. 2017;70(2):274-280. doi:10.31263/voebm.v70i2.1898
apa: Andrae, M., & Villányi, M. (2017). Der Springer Compact-Deal – Ein erster
Einblick in die Evaluierung einer Offsetting-Vereinbarung. Mitteilungen Der
Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare. Vereinigung
Österreichischer Bibliothekarinnen und Bibliothekare. https://doi.org/10.31263/voebm.v70i2.1898
chicago: Andrae, Magdalena, and Márton Villányi. “Der Springer Compact-Deal – Ein
Erster Einblick in Die Evaluierung Einer Offsetting-Vereinbarung.” Mitteilungen
Der Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare. Vereinigung
Österreichischer Bibliothekarinnen und Bibliothekare, 2017. https://doi.org/10.31263/voebm.v70i2.1898.
ieee: M. Andrae and M. Villányi, “Der Springer Compact-Deal – Ein erster Einblick
in die Evaluierung einer Offsetting-Vereinbarung,” Mitteilungen der Vereinigung
Österreichischer Bibliothekarinnen und Bibliothekare, vol. 70, no. 2. Vereinigung
Österreichischer Bibliothekarinnen und Bibliothekare, pp. 274–280, 2017.
ista: Andrae M, Villányi M. 2017. Der Springer Compact-Deal – Ein erster Einblick
in die Evaluierung einer Offsetting-Vereinbarung. Mitteilungen der Vereinigung
Österreichischer Bibliothekarinnen und Bibliothekare. 70(2), 274–280.
mla: Andrae, Magdalena, and Márton Villányi. “Der Springer Compact-Deal – Ein Erster
Einblick in Die Evaluierung Einer Offsetting-Vereinbarung.” Mitteilungen Der
Vereinigung Österreichischer Bibliothekarinnen Und Bibliothekare, vol. 70,
no. 2, Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2017,
pp. 274–80, doi:10.31263/voebm.v70i2.1898.
short: M. Andrae, M. Villányi, Mitteilungen Der Vereinigung Österreichischer Bibliothekarinnen
Und Bibliothekare 70 (2017) 274–280.
das_tickbox: '1'
date_created: 2018-12-11T11:48:36Z
date_published: 2017-08-01T00:00:00Z
date_updated: 2026-07-07T06:08:32Z
day: '01'
ddc:
- '020'
department:
- _id: E-Lib
doi: 10.31263/voebm.v70i2.1898
file:
- access_level: open_access
checksum: 558c18bcf5580d87dd371ec626d52075
content_type: application/pdf
creator: dernst
date_created: 2019-01-18T13:39:26Z
date_updated: 2020-07-14T12:48:09Z
file_id: '5851'
file_name: 2017_VOEB_Andrae.pdf
file_size: 125065
relation: main_file
file_date_updated: 2020-07-14T12:48:09Z
has_accepted_license: '1'
intvolume: ' 70'
issue: '2'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 274 - 280
popular_science: '1'
publication: Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare
publication_identifier:
issn:
- 1022-2588
publication_status: published
publisher: Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare
publist_id: '6843'
scopus_import: '1'
status: public
title: Der Springer Compact-Deal – Ein erster Einblick in die Evaluierung einer Offsetting-Vereinbarung
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: 70
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'
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'
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
has_accepted_license: '1'
intvolume: ' 433'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
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'
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'
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'
...
---
_id: '467'
abstract:
- lang: eng
text: Recently there has been a significant effort to handle quantitative properties
in formal verification and synthesis. While weighted automata over finite and
infinite words provide a natural and flexible framework to express quantitative
properties, perhaps surprisingly, some basic system properties such as average
response time cannot be expressed using weighted automata or in any other known
decidable formalism. In this work, we introduce nested weighted automata as a
natural extension of weighted automata, which makes it possible to express important
quantitative properties such as average response time. In nested weighted automata,
a master automaton spins off and collects results from weighted slave automata,
each of which computes a quantity along a finite portion of an infinite word.
Nested weighted automata can be viewed as the quantitative analogue of monitor
automata, which are used in runtime verification. We establish an almost-complete
decidability picture for the basic decision problems about nested weighted automata
and illustrate their applicability in several domains. In particular, nested weighted
automata can be used to decide average response time properties.
article_number: '31'
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: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. ACM Transactions
on Computational Logic. 2017;18(4). doi:10.1145/3152769
apa: Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Nested weighted automata.
ACM Transactions on Computational Logic. ACM. https://doi.org/10.1145/3152769
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted
Automata.” ACM Transactions on Computational Logic. ACM, 2017. https://doi.org/10.1145/3152769.
ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” ACM
Transactions on Computational Logic, vol. 18, no. 4. ACM, 2017.
ista: Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions
on Computational Logic. 18(4), 31.
mla: Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” ACM Transactions
on Computational Logic, vol. 18, no. 4, 31, ACM, 2017, doi:10.1145/3152769.
short: K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational
Logic 18 (2017).
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T11:46:38Z
date_published: 2017-12-01T00:00:00Z
date_updated: 2026-07-07T14:01:10Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1145/3152769
ec_funded: 1
external_id:
arxiv:
- '1606.03598'
isi:
- '000419237100006'
intvolume: ' 18'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1606.03598
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: ACM Transactions on Computational Logic
publication_identifier:
issn:
- 1529-3785
publication_status: published
publisher: ACM
publist_id: '7354'
quality_controlled: '1'
related_material:
record:
- id: '5415'
relation: earlier_version
status: public
- id: '5436'
relation: earlier_version
status: public
- id: '1656'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Nested weighted automata
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 18
year: '2017'
...
---
OA_place: publisher
_id: '6287'
abstract:
- lang: eng
text: The main objects considered in the present work are simplicial and CW-complexes
with vertices forming a random point cloud. In particular, we consider a Poisson
point process in R^n and study Delaunay and Voronoi complexes of the first and
higher orders and weighted Delaunay complexes obtained as sections of Delaunay
complexes, as well as the Čech complex. Further, we examine theDelaunay complex
of a Poisson point process on the sphere S^n, as well as of a uniform point cloud,
which is equivalent to the convex hull, providing a connection to the theory of
random polytopes. Each of the complexes in question can be endowed with a radius
function, which maps its cells to the radii of appropriately chosen circumspheres,
called the radius of the cell. Applying and developing discrete Morse theory for
these functions, joining it together with probabilistic and sometimes analytic
machinery, and developing several integral geometric tools, we aim at getting
the distributions of circumradii of typical cells. For all considered complexes,
we are able to generalize and obtain up to constants the distribution of radii
of typical intervals of all types. In low dimensions the constants can be computed
explicitly, thus providing the explicit expressions for the expected numbers of
cells. In particular, it allows to find the expected density of simplices of every
dimension for a Poisson point process in R^4, whereas the result for R^3 was known
already in 1970's.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Anton
full_name: Nikitenko, Anton
id: 3E4FF1BA-F248-11E8-B48F-1D18A9856A87
last_name: Nikitenko
orcid: 0000-0002-0659-3201
citation:
ama: Nikitenko A. Discrete Morse theory for random complexes . 2017. doi:10.15479/AT:ISTA:th_873
apa: Nikitenko, A. (2017). Discrete Morse theory for random complexes . Institute
of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_873
chicago: Nikitenko, Anton. “Discrete Morse Theory for Random Complexes .” Institute
of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_873.
ieee: A. Nikitenko, “Discrete Morse theory for random complexes ,” Institute of
Science and Technology Austria, 2017.
ista: Nikitenko A. 2017. Discrete Morse theory for random complexes . Institute
of Science and Technology Austria.
mla: Nikitenko, Anton. Discrete Morse Theory for Random Complexes . Institute
of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_873.
short: A. Nikitenko, Discrete Morse Theory for Random Complexes , Institute of Science
and Technology Austria, 2017.
corr_author: '1'
date_created: 2019-04-09T15:04:32Z
date_published: 2017-10-27T00:00:00Z
date_updated: 2026-07-28T13:38:07Z
day: '27'
ddc:
- '514'
- '516'
- '519'
degree_awarded: PhD
department:
- _id: HeEd
doi: 10.15479/AT:ISTA:th_873
file:
- access_level: open_access
checksum: ece7e598a2f060b263c2febf7f3fe7f9
content_type: application/pdf
creator: dernst
date_created: 2019-04-09T14:54:51Z
date_updated: 2020-07-14T12:47:26Z
file_id: '6289'
file_name: 2017_Thesis_Nikitenko.pdf
file_size: 2324870
relation: main_file
- access_level: closed
checksum: 99b7ad76e317efd447af60f91e29b49b
content_type: application/zip
creator: dernst
date_created: 2019-04-09T14:54:51Z
date_updated: 2020-07-14T12:47:26Z
file_id: '6290'
file_name: 2017_Thesis_Nikitenko_source.zip
file_size: 2863219
relation: source_file
file_date_updated: 2020-07-14T12:47:26Z
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '86'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
pubrep_id: '873'
related_material:
record:
- id: '87'
relation: part_of_dissertation
status: public
- id: '718'
relation: part_of_dissertation
status: public
- id: '5678'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
title: 'Discrete Morse theory for random complexes '
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: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2017'
...
---
OA_place: publisher
_id: '1127'
abstract:
- lang: eng
text: "Plant hormone auxin and its transport between cells belong to the most important\r\nmechanisms
controlling plant development. Auxin itself could change localization of PINs
and\r\nthereby control direction of its own flow. We performed an expression profiling
experiment\r\nin Arabidopsis roots to identify potential regulators of PIN polarity
which are transcriptionally\r\nregulated by auxin signalling. We identified several
novel regulators and performed a detailed\r\ncharacterization of the transcription
factor WRKY23 (At2g47260) and its role in auxin\r\nfeedback on PIN polarity. Gain-of-function
and dominant-negative mutants revealed that\r\nWRKY23 plays a crucial role in
mediating the auxin effect on PIN polarity. In concordance,\r\ntypical polar auxin
transport processes such as gravitropism and leaf vascular pattern\r\nformation
were disturbed by interfering with WRKY23 function.\r\nIn order to identify direct
targets of WRKY23, we performed consequential expression\r\nprofiling experiments
using a WRKY23 inducible gain-of-function line and dominant-negative\r\nWRKY23
line that is defunct in PIN re-arrangement. Among several genes mostly related
to\r\nthe groups of cell wall and defense process regulators, we identified LYSINE-HISTIDINE\r\nTRANSPORTER
1 (LHT1; At5g40780), a small amino acid permease gene from the amino\r\nacid/auxin
permease family (AAAP), we present its detailed characterisation in auxin feedback\r\non
PIN repolarization, identified its transcriptional regulation, we propose a potential\r\nmechanism
of its action. Moreover, we identified also a member of receptor-like protein\r\nkinase
LRR-RLK (LEUCINE-RICH REPEAT TRANSMEMBRANE PROTEIN KINASE PROTEIN 1;\r\nLRRK1;
At1g05700), which also affects auxin-dependent PIN re-arrangement. We described\r\nits
transcriptional behaviour, subcellular localization. Based on global expression
data, we\r\ntried to identify ligand responsible for mechanism of signalling and
suggest signalling partner\r\nand interactors. Additionally, we described role
of novel phytohormone group, strigolactone,\r\nin auxin-dependent PIN re-arrangement,
that could be a fundament for future studies in this\r\nfield.\r\nOur results
provide first insights into an auxin transcriptional network targeting PIN\r\nlocalization
and thus regulating plant development. We highlighted WRKY23 transcriptional\r\nnetwork
and characterised its mediatory role in plant development. We identified direct\r\neffectors
of this network, LHT1 and LRRK1, and describe their roles in PIN re-arrangement
and\r\nPIN-dependent auxin transport processes."
acknowledgement: I would like to first acknowledge my supervisor Jiří Friml for support,
kind advice and patience. It was a pleasure to be a part of your lab, Jiří. I will
remember the atmosphere present in auxin lab at VIB in Ghent and at IST in Klosterneuburg
forever. I would like to thank all past and present lab members for the friendship
and friendly and scientific environment in the groups. It was so nice to cooperate
with you, guys. There was always someone who helped me with experiments, troubleshoot
issues coming from our work etc. At this place, I would like to thank especially
to Gergo Molnár. I’m happy (and lucky) that I have met him; he naturally became
my tutor and guide through my PhD. From no one else during my entire professional
career, I’ve learned that much.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Tomas
full_name: Prat, Tomas
id: 3DA3BFEE-F248-11E8-B48F-1D18A9856A87
last_name: Prat
citation:
ama: Prat T. Identification of novel regulators of PIN polarity and development
of novel auxin sensor. 2017.
apa: Prat, T. (2017). Identification of novel regulators of PIN polarity and
development of novel auxin sensor. Institute of Science and Technology Austria.
chicago: Prat, Tomas. “Identification of Novel Regulators of PIN Polarity and Development
of Novel Auxin Sensor.” Institute of Science and Technology Austria, 2017.
ieee: T. Prat, “Identification of novel regulators of PIN polarity and development
of novel auxin sensor,” Institute of Science and Technology Austria, 2017.
ista: Prat T. 2017. Identification of novel regulators of PIN polarity and development
of novel auxin sensor. Institute of Science and Technology Austria.
mla: Prat, Tomas. Identification of Novel Regulators of PIN Polarity and Development
of Novel Auxin Sensor. Institute of Science and Technology Austria, 2017.
short: T. Prat, Identification of Novel Regulators of PIN Polarity and Development
of Novel Auxin Sensor, Institute of Science and Technology Austria, 2017.
corr_author: '1'
date_created: 2018-12-11T11:50:17Z
date_published: 2017-01-12T00:00:00Z
date_updated: 2026-07-29T12:01:27Z
day: '12'
ddc:
- '580'
degree_awarded: PhD
department:
- _id: JiFr
- _id: GradSch
doi_confirm: '1'
file:
- access_level: closed
checksum: d192c7c6c5ea32c8432437286dc4909e
content_type: application/pdf
creator: dernst
date_created: 2019-04-05T08:45:14Z
date_updated: 2019-04-05T08:45:14Z
file_id: '6209'
file_name: IST_Austria_Thesis_Tomáš_Prát.pdf
file_size: 10285946
relation: main_file
- access_level: open_access
checksum: bab18b52cf98145926042d8ed99fdb3b
content_type: application/pdf
creator: dernst
date_created: 2021-02-22T11:52:56Z
date_updated: 2021-02-22T11:52:56Z
file_id: '9185'
file_name: 2017_Thesis_Prat.pdf
file_size: 9802991
relation: main_file
success: 1
file_date_updated: 2021-02-22T11:52:56Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: '131'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6233'
related_material:
record:
- id: '449'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
title: Identification of novel regulators of PIN polarity and development of novel
auxin sensor
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2017'
...
---
OA_place: publisher
_id: '839'
abstract:
- lang: eng
text: 'This thesis describes a brittle fracture simulation method for visual effects
applications. Building upon a symmetric Galerkin boundary element method, we first
compute stress intensity factors following the theory of linear elastic fracture
mechanics. We then use these stress intensities to simulate the motion of a propagating
crack front at a significantly higher resolution than the overall deformation
of the breaking object. Allowing for spatial variations of the material''s toughness
during crack propagation produces visually realistic, highly-detailed fracture
surfaces. Furthermore, we introduce approximations for stress intensities and
crack opening displacements, resulting in both practical speed-up and theoretically
superior runtime complexity compared to previous methods. While we choose a quasi-static
approach to fracture mechanics, ignoring dynamic deformations, we also couple
our fracture simulation framework to a standard rigid-body dynamics solver, enabling
visual effects artists to simulate both large scale motion, as well as fracturing
due to collision forces in a combined system. As fractures inside of an object
grow, their geometry must be represented both in the coarse boundary element mesh,
as well as at the desired fine output resolution. Using a boundary element method,
we avoid complicated volumetric meshing operations. Instead we describe a simple
set of surface meshing operations that allow us to progressively add cracks to
the mesh of an object and still re-use all previously computed entries of the
linear boundary element system matrix. On the high resolution level, we opt for
an implicit surface representation. We then describe how to capture fracture surfaces
during crack propagation, as well as separate the individual fragments resulting
from the fracture process, based on this implicit representation. We show results
obtained with our method, either solving the full boundary element system in every
time step, or alternatively using our fast approximations. These results demonstrate
that both of these methods perform well in basic test cases and produce realistic
fracture surfaces. Furthermore we show that our fast approximations substantially
out-perform the standard approach in more demanding scenarios. Finally, these
two methods naturally combine, using the full solution while the problem size
is manageably small and switching to the fast approximations later on. The resulting
hybrid method gives the user a direct way to choose between speed and accuracy
of the simulation. '
acknowledgement: "ERC H2020 programme (grant agreement no. 638176)\r\nFirst of all,
let me thank my committee members, especially my supervisor, Chris\r\nWojtan, for
supporting me throughout my PhD. Obviously, none of this work would\r\nhave been
possible without you.\r\nFurthermore, Thank You to all the people who have contributed
to this work in various\r\nways, in particular Martin Schanz and his group for providing
and supporting the\r\nHyENA boundary element library, as well as Eder Miguel and
Morten Bojsen-Hansen\r\nfor (repeatedly) proof reading and providing valuable suggestions
during the writing\r\nof this thesis.\r\nI would also like to thank Bernd Bickel,
and all the members – past and present – of his\r\nand Chris’ research groups at
IST Austria for always providing honest and insightful\r\nfeedback throughout many
joint group meetings, as well as Christopher Batty, Eitan\r\nGrinspun, and Fang
Da for many insights into boundary element methods during our\r\ncollaboration.\r\nAs
only virtual objects have been harmed in the process of creating this work, I would\r\nlike
to acknowledge the Stanford scanning repository for providing the “Bunny” and\r\n“Armadillo”
models, the AIM@SHAPE repository for “Pierre’s hand, watertight”, and\r\nS. Gainsbourg
for the “Column” via Archive3D.net. Sorry for breaking these models\r\nin many different
ways.\r\n"
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: David
full_name: Hahn, David
id: 357A6A66-F248-11E8-B48F-1D18A9856A87
last_name: Hahn
citation:
ama: Hahn D. Brittle fracture simulation with boundary elements for computer graphics.
2017. doi:10.15479/AT:ISTA:th_855
apa: Hahn, D. (2017). Brittle fracture simulation with boundary elements for
computer graphics. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_855
chicago: Hahn, David. “Brittle Fracture Simulation with Boundary Elements for Computer
Graphics.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_855.
ieee: D. Hahn, “Brittle fracture simulation with boundary elements for computer
graphics,” Institute of Science and Technology Austria, 2017.
ista: Hahn D. 2017. Brittle fracture simulation with boundary elements for computer
graphics. Institute of Science and Technology Austria.
mla: Hahn, David. Brittle Fracture Simulation with Boundary Elements for Computer
Graphics. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_855.
short: D. Hahn, Brittle Fracture Simulation with Boundary Elements for Computer
Graphics, Institute of Science and Technology Austria, 2017.
corr_author: '1'
date_created: 2018-12-11T11:48:47Z
date_published: 2017-08-14T00:00:00Z
date_updated: 2026-07-29T13:27:25Z
day: '14'
ddc:
- '004'
- '005'
- '006'
- '531'
- '621'
degree_awarded: PhD
department:
- _id: ChWo
- _id: GradSch
doi: 10.15479/AT:ISTA:th_855
doi_confirm: '1'
ec_funded: 1
file:
- access_level: open_access
checksum: 6c1ae8c90bfaba5e089417fefbc4a272
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:46Z
date_updated: 2020-07-14T12:48:13Z
file_id: '5100'
file_name: IST-2017-855-v1+1_thesis_online_pdfA.pdf
file_size: 14596191
relation: main_file
- access_level: closed
checksum: 421672f68d563b029869c5cf1713f919
content_type: application/zip
creator: dernst
date_created: 2019-04-05T08:40:30Z
date_updated: 2020-07-14T12:48:13Z
file_id: '6207'
file_name: 2017_thesis_Hahn_source.zip
file_size: 15060566
relation: source_file
file_date_updated: 2020-07-14T12:48:13Z
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-sa/4.0/
month: '08'
oa: 1
oa_version: Published Version
page: '124'
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '638176'
name: 'Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large
Scales'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6809'
pubrep_id: '855'
related_material:
record:
- id: '5568'
relation: popular_science
status: public
- id: '1362'
relation: part_of_dissertation
status: public
- id: '1633'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
title: Brittle fracture simulation with boundary elements for computer graphics
tmp:
image: /images/cc_by_sa.png
legal_code_url: https://creativecommons.org/licenses/by-sa/4.0/legalcode
name: Creative Commons Attribution-ShareAlike 4.0 International Public License (CC
BY-SA 4.0)
short: CC BY-SA (4.0)
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2017'
...
---
_id: '5568'
abstract:
- lang: eng
text: Includes source codes, test cases, and example data used in the thesis Brittle
Fracture Simulation with Boundary Elements for Computer Graphics. Also includes
pre-built binaries of the HyENA library, but not sources - please contact the
HyENA authors to obtain these sources if required (https://mech.tugraz.at/hyena)
article_processing_charge: No
author:
- first_name: David
full_name: Hahn, David
id: 357A6A66-F248-11E8-B48F-1D18A9856A87
last_name: Hahn
citation:
ama: 'Hahn D. Source codes: Brittle fracture simulation with boundary elements for
computer graphics. 2017. doi:10.15479/AT:ISTA:73'
apa: 'Hahn, D. (2017). Source codes: Brittle fracture simulation with boundary elements
for computer graphics. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:73'
chicago: 'Hahn, David. “Source Codes: Brittle Fracture Simulation with Boundary
Elements for Computer Graphics.” Institute of Science and Technology Austria,
2017. https://doi.org/10.15479/AT:ISTA:73.'
ieee: 'D. Hahn, “Source codes: Brittle fracture simulation with boundary elements
for computer graphics.” Institute of Science and Technology Austria, 2017.'
ista: 'Hahn D. 2017. Source codes: Brittle fracture simulation with boundary elements
for computer graphics, Institute of Science and Technology Austria, 10.15479/AT:ISTA:73.'
mla: 'Hahn, David. Source Codes: Brittle Fracture Simulation with Boundary Elements
for Computer Graphics. Institute of Science and Technology Austria, 2017,
doi:10.15479/AT:ISTA:73.'
short: D. Hahn, (2017).
datarep_id: '73'
date_created: 2018-12-12T12:31:35Z
date_published: 2017-08-16T00:00:00Z
date_updated: 2026-07-29T13:27:24Z
day: '16'
ddc:
- '004'
department:
- _id: ChWo
doi: 10.15479/AT:ISTA:73
ec_funded: 1
file:
- access_level: open_access
checksum: 2323a755842a3399cbc47d76545fc9a0
content_type: application/zip
creator: system
date_created: 2018-12-12T13:02:57Z
date_updated: 2020-07-14T12:47:04Z
file_id: '5615'
file_name: IST-2017-73-v1+1_FractureRB_v1.1_2017_07_20_final_public.zip
file_size: 199353471
relation: main_file
file_date_updated: 2020-07-14T12:47:04Z
has_accepted_license: '1'
keyword:
- Boundary elements
- brittle fracture
- computer graphics
- fracture simulation
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '638176'
name: 'Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large
Scales'
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '839'
relation: research_paper
status: public
status: public
title: 'Source codes: Brittle fracture simulation with boundary elements for computer
graphics'
tmp:
image: /images/cc_by_sa.png
legal_code_url: https://creativecommons.org/licenses/by-sa/4.0/legalcode
name: Creative Commons Attribution-ShareAlike 4.0 International Public License (CC
BY-SA 4.0)
short: CC BY-SA (4.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '559'
abstract:
- lang: eng
text: 'Proofs of space (PoS) were suggested as more ecological and economical alternative
to proofs of work, which are currently used in blockchain designs like Bitcoin.
The existing PoS are based on rather sophisticated graph pebbling lower bounds.
Much simpler and in several aspects more efficient schemes based on inverting
random functions have been suggested, but they don’t give meaningful security
guarantees due to existing time-memory trade-offs. In particular, Hellman showed
that any permutation over a domain of size N can be inverted in time T by an algorithm
that is given S bits of auxiliary information whenever (Formula presented). For
functions Hellman gives a weaker attack with S2· T≈ N2 (e.g., S= T≈ N2/3). To
prove lower bounds, one considers an adversary who has access to an oracle f:
[ N] → [N] and can make T oracle queries. The best known lower bound is S· T∈
Ω(N) and holds for random functions and permutations. We construct functions that
provably require more time and/or space to invert. Specifically, for any constant
k we construct a function [N] → [N] that cannot be inverted unless Sk· T∈ Ω(Nk)
(in particular, S= T≈ (Formula presented). Our construction does not contradict
Hellman’s time-memory trade-off, because it cannot be efficiently evaluated in
forward direction. However, its entire function table can be computed in time
quasilinear in N, which is sufficient for the PoS application. Our simplest construction
is built from a random function oracle g: [N] × [N] → [ N] and a random permutation
oracle f: [N] → N] and is defined as h(x) = g(x, x′) where f(x) = π(f(x′)) with
π being any involution without a fixed point, e.g. flipping all the bits. For
this function we prove that any adversary who gets S bits of auxiliary information,
makes at most T oracle queries, and inverts h on an ϵ fraction of outputs must
satisfy S2· T∈ Ω(ϵ2N2).'
alternative_title:
- LNCS
author:
- first_name: Hamza M
full_name: Abusalah, Hamza M
id: 40297222-F248-11E8-B48F-1D18A9856A87
last_name: Abusalah
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Bram
full_name: Cohen, Bram
last_name: Cohen
- first_name: Danylo
full_name: Khilko, Danylo
last_name: Khilko
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Leonid
full_name: Reyzin, Leonid
last_name: Reyzin
citation:
ama: 'Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. Beyond Hellman’s
time-memory trade-offs with applications to proofs of space. In: Vol 10625. Springer;
2017:357-379. doi:10.1007/978-3-319-70697-9_13'
apa: 'Abusalah, H. M., Alwen, J. F., Cohen, B., Khilko, D., Pietrzak, K. Z., &
Reyzin, L. (2017). Beyond Hellman’s time-memory trade-offs with applications to
proofs of space (Vol. 10625, pp. 357–379). Presented at the ASIACRYPT: Theory
and Applications of Cryptology and Information Security, Hong Kong, China: Springer.
https://doi.org/10.1007/978-3-319-70697-9_13'
chicago: Abusalah, Hamza M, Joel F Alwen, Bram Cohen, Danylo Khilko, Krzysztof Z
Pietrzak, and Leonid Reyzin. “Beyond Hellman’s Time-Memory Trade-Offs with Applications
to Proofs of Space,” 10625:357–79. Springer, 2017. https://doi.org/10.1007/978-3-319-70697-9_13.
ieee: 'H. M. Abusalah, J. F. Alwen, B. Cohen, D. Khilko, K. Z. Pietrzak, and L.
Reyzin, “Beyond Hellman’s time-memory trade-offs with applications to proofs of
space,” presented at the ASIACRYPT: Theory and Applications of Cryptology and
Information Security, Hong Kong, China, 2017, vol. 10625, pp. 357–379.'
ista: 'Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. 2017. Beyond
Hellman’s time-memory trade-offs with applications to proofs of space. ASIACRYPT:
Theory and Applications of Cryptology and Information Security, LNCS, vol. 10625,
357–379.'
mla: Abusalah, Hamza M., et al. Beyond Hellman’s Time-Memory Trade-Offs with
Applications to Proofs of Space. Vol. 10625, Springer, 2017, pp. 357–79, doi:10.1007/978-3-319-70697-9_13.
short: H.M. Abusalah, J.F. Alwen, B. Cohen, D. Khilko, K.Z. Pietrzak, L. Reyzin,
in:, Springer, 2017, pp. 357–379.
conference:
end_date: 2017-12-07
location: Hong Kong, China
name: 'ASIACRYPT: Theory and Applications of Cryptology and Information Security'
start_date: 2017-12-03
corr_author: '1'
date_created: 2018-12-11T11:47:10Z
date_published: 2017-11-18T00:00:00Z
date_updated: 2026-07-29T13:38:07Z
day: '18'
department:
- _id: KrPi
doi: 10.1007/978-3-319-70697-9_13
ec_funded: 1
intvolume: ' 10625'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2017/893.pdf
month: '11'
oa: 1
oa_version: Submitted Version
page: 357 - 379
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_identifier:
isbn:
- 978-331970696-2
publication_status: published
publisher: Springer
publist_id: '7257'
quality_controlled: '1'
related_material:
record:
- id: '83'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Beyond Hellman’s time-memory trade-offs with applications to proofs of space
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10625
year: '2017'
...
---
_id: '1144'
abstract:
- lang: eng
text: We show that matrix elements of functions of N × N Wigner matrices fluctuate
on a scale of order N−1/2 and we identify the limiting fluctuation. Our result
holds for any function f of the matrix that has bounded variation thus considerably
relaxing the regularity requirement imposed in [7, 11].
acknowledgement: Partially supported by the IST Austria Excellence Scholarship.
article_number: '86'
article_processing_charge: No
author:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Dominik J
full_name: Schröder, Dominik J
id: 408ED176-F248-11E8-B48F-1D18A9856A87
last_name: Schröder
orcid: 0000-0002-2904-1856
citation:
ama: Erdös L, Schröder DJ. Fluctuations of functions of Wigner matrices. Electronic
Communications in Probability. 2017;21. doi:10.1214/16-ECP38
apa: Erdös, L., & Schröder, D. J. (2017). Fluctuations of functions of Wigner
matrices. Electronic Communications in Probability. Institute of Mathematical
Statistics. https://doi.org/10.1214/16-ECP38
chicago: Erdös, László, and Dominik J Schröder. “Fluctuations of Functions of Wigner
Matrices.” Electronic Communications in Probability. Institute of Mathematical
Statistics, 2017. https://doi.org/10.1214/16-ECP38.
ieee: L. Erdös and D. J. Schröder, “Fluctuations of functions of Wigner matrices,”
Electronic Communications in Probability, vol. 21. Institute of Mathematical
Statistics, 2017.
ista: Erdös L, Schröder DJ. 2017. Fluctuations of functions of Wigner matrices.
Electronic Communications in Probability. 21, 86.
mla: Erdös, László, and Dominik J. Schröder. “Fluctuations of Functions of Wigner
Matrices.” Electronic Communications in Probability, vol. 21, 86, Institute
of Mathematical Statistics, 2017, doi:10.1214/16-ECP38.
short: L. Erdös, D.J. Schröder, Electronic Communications in Probability 21 (2017).
date_created: 2018-12-11T11:50:23Z
date_published: 2017-01-02T00:00:00Z
date_updated: 2026-07-29T13:46:19Z
day: '02'
ddc:
- '510'
department:
- _id: LaEr
doi: 10.1214/16-ECP38
ec_funded: 1
external_id:
isi:
- '000396604900037'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:10Z
date_updated: 2018-12-12T10:18:10Z
file_id: '5329'
file_name: IST-2017-747-v1+1_euclid.ecp.1483347665.pdf
file_size: 440770
relation: main_file
file_date_updated: 2018-12-12T10:18:10Z
has_accepted_license: '1'
intvolume: ' 21'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Electronic Communications in Probability
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '6214'
pubrep_id: '747'
quality_controlled: '1'
related_material:
record:
- id: '6179'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Fluctuations of functions of Wigner matrices
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 21
year: '2017'
...