---
_id: '2034'
abstract:
- lang: eng
  text: Opacity is a generic security property, that has been defined on (non-probabilistic)
    transition systems and later on Markov chains with labels. For a secret predicate,
    given as a subset of runs, and a function describing the view of an external observer,
    the value of interest for opacity is a measure of the set of runs disclosing the
    secret. We extend this definition to the richer framework of Markov decision processes,
    where non-deterministicchoice is combined with probabilistic transitions, and
    we study related decidability problems with partial or complete observation hypotheses
    for the schedulers. We prove that all questions are decidable with complete observation
    and ω-regular secrets. With partial observation, we prove that all quantitative
    questions are undecidable but the question whether a system is almost surely non-opaquebecomes
    decidable for a restricted class of ω-regular secrets, as well as for all ω-regular
    secrets under finite-memory schedulers.
author:
- first_name: Béatrice
  full_name: Bérard, Béatrice
  last_name: Bérard
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Nathalie
  full_name: Sznajder, Nathalie
  last_name: Sznajder
citation:
  ama: Bérard B, Chatterjee K, Sznajder N. Probabilistic opacity for Markov decision
    processes. <i> Information Processing Letters</i>. 2015;115(1):52-59. doi:<a href="https://doi.org/10.1016/j.ipl.2014.09.001">10.1016/j.ipl.2014.09.001</a>
  apa: Bérard, B., Chatterjee, K., &#38; Sznajder, N. (2015). Probabilistic opacity
    for Markov decision processes. <i> Information Processing Letters</i>. Elsevier.
    <a href="https://doi.org/10.1016/j.ipl.2014.09.001">https://doi.org/10.1016/j.ipl.2014.09.001</a>
  chicago: Bérard, Béatrice, Krishnendu Chatterjee, and Nathalie Sznajder. “Probabilistic
    Opacity for Markov Decision Processes.” <i> Information Processing Letters</i>.
    Elsevier, 2015. <a href="https://doi.org/10.1016/j.ipl.2014.09.001">https://doi.org/10.1016/j.ipl.2014.09.001</a>.
  ieee: B. Bérard, K. Chatterjee, and N. Sznajder, “Probabilistic opacity for Markov
    decision processes,” <i> Information Processing Letters</i>, vol. 115, no. 1.
    Elsevier, pp. 52–59, 2015.
  ista: Bérard B, Chatterjee K, Sznajder N. 2015. Probabilistic opacity for Markov
    decision processes.  Information Processing Letters. 115(1), 52–59.
  mla: Bérard, Béatrice, et al. “Probabilistic Opacity for Markov Decision Processes.”
    <i> Information Processing Letters</i>, vol. 115, no. 1, Elsevier, 2015, pp. 52–59,
    doi:<a href="https://doi.org/10.1016/j.ipl.2014.09.001">10.1016/j.ipl.2014.09.001</a>.
  short: B. Bérard, K. Chatterjee, N. Sznajder,  Information Processing Letters 115
    (2015) 52–59.
date_created: 2018-12-11T11:55:20Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T06:54:52Z
day: '01'
department:
- _id: KrCh
doi: 10.1016/j.ipl.2014.09.001
ec_funded: 1
intvolume: '       115'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1407.4225
month: '01'
oa: 1
oa_version: Preprint
page: 52 - 59
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: 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: ' Information Processing Letters'
publication_status: published
publisher: Elsevier
publist_id: '5025'
quality_controlled: '1'
scopus_import: 1
status: public
title: Probabilistic opacity for Markov decision processes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 115
year: '2015'
...
---
_id: '2035'
abstract:
- lang: eng
  text: "Considering a continuous self-map and the induced endomorphism on homology,
    we study the eigenvalues and eigenspaces of the latter. Taking a filtration of
    representations, we define the persistence of the eigenspaces, effectively introducing
    a hierarchical organization of the map. The algorithm that computes this information
    for a finite sample is proved to be stable, and to give the correct answer for
    a sufficiently dense sample. Results computed with an implementation of the algorithm
    provide evidence of its practical utility.\r\n"
acknowledgement: This research is partially supported by the Toposys project FP7-ICT-318493-STREP,
  by ESF under the ACAT Research Network Programme, by the Russian Government under
  mega project 11.G34.31.0053, and by the Polish National Science Center under Grant
  No. N201 419639.
author:
- first_name: Herbert
  full_name: Edelsbrunner, Herbert
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
- first_name: Grzegorz
  full_name: Jablonski, Grzegorz
  id: 4483EF78-F248-11E8-B48F-1D18A9856A87
  last_name: Jablonski
  orcid: 0000-0002-3536-9866
- first_name: Marian
  full_name: Mrozek, Marian
  last_name: Mrozek
citation:
  ama: Edelsbrunner H, Jablonski G, Mrozek M. The persistent homology of a self-map.
    <i>Foundations of Computational Mathematics</i>. 2015;15(5):1213-1244. doi:<a
    href="https://doi.org/10.1007/s10208-014-9223-y">10.1007/s10208-014-9223-y</a>
  apa: Edelsbrunner, H., Jablonski, G., &#38; Mrozek, M. (2015). The persistent homology
    of a self-map. <i>Foundations of Computational Mathematics</i>. Springer. <a href="https://doi.org/10.1007/s10208-014-9223-y">https://doi.org/10.1007/s10208-014-9223-y</a>
  chicago: Edelsbrunner, Herbert, Grzegorz Jablonski, and Marian Mrozek. “The Persistent
    Homology of a Self-Map.” <i>Foundations of Computational Mathematics</i>. Springer,
    2015. <a href="https://doi.org/10.1007/s10208-014-9223-y">https://doi.org/10.1007/s10208-014-9223-y</a>.
  ieee: H. Edelsbrunner, G. Jablonski, and M. Mrozek, “The persistent homology of
    a self-map,” <i>Foundations of Computational Mathematics</i>, vol. 15, no. 5.
    Springer, pp. 1213–1244, 2015.
  ista: Edelsbrunner H, Jablonski G, Mrozek M. 2015. The persistent homology of a
    self-map. Foundations of Computational Mathematics. 15(5), 1213–1244.
  mla: Edelsbrunner, Herbert, et al. “The Persistent Homology of a Self-Map.” <i>Foundations
    of Computational Mathematics</i>, vol. 15, no. 5, Springer, 2015, pp. 1213–44,
    doi:<a href="https://doi.org/10.1007/s10208-014-9223-y">10.1007/s10208-014-9223-y</a>.
  short: H. Edelsbrunner, G. Jablonski, M. Mrozek, Foundations of Computational Mathematics
    15 (2015) 1213–1244.
date_created: 2018-12-11T11:55:20Z
date_published: 2015-10-01T00:00:00Z
date_updated: 2021-01-12T06:54:53Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1007/s10208-014-9223-y
ec_funded: 1
file:
- access_level: open_access
  checksum: 3566f3a8b0c1bc550e62914a88c584ff
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:08:10Z
  date_updated: 2020-07-14T12:45:26Z
  file_id: '4670'
  file_name: IST-2016-486-v1+1_s10208-014-9223-y.pdf
  file_size: 1317546
  relation: main_file
file_date_updated: 2020-07-14T12:45:26Z
has_accepted_license: '1'
intvolume: '        15'
issue: '5'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '10'
oa: 1
oa_version: Published Version
page: 1213 - 1244
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '318493'
  name: Topological Complex Systems
publication: Foundations of Computational Mathematics
publication_status: published
publisher: Springer
publist_id: '5022'
pubrep_id: '486'
quality_controlled: '1'
scopus_import: 1
status: public
title: The persistent homology of a self-map
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: '2015'
...
---
_id: '13395'
abstract:
- lang: eng
  text: Metallic nanoparticles co-functionalised with monolayers of UV- and CO2-sensitive
    ligands were prepared and shown to respond to these two types of stimuli reversibly
    and in an orthogonal fashion. The composition of the coating could be tailored
    to yield nanoparticles capable of aggregating exclusively when both UV and CO2
    were applied at the same time, analogously to the behaviour of an AND logic gate.
article_processing_charge: No
article_type: original
author:
- first_name: Ji-Woong
  full_name: Lee, Ji-Woong
  last_name: Lee
- first_name: Rafal
  full_name: Klajn, Rafal
  id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
  last_name: Klajn
citation:
  ama: Lee J-W, Klajn R. Dual-responsive nanoparticles that aggregate under the simultaneous
    action of light and CO2. <i>Chemical Communications</i>. 2015;51(11):2036-2039.
    doi:<a href="https://doi.org/10.1039/c4cc08541h">10.1039/c4cc08541h</a>
  apa: Lee, J.-W., &#38; Klajn, R. (2015). Dual-responsive nanoparticles that aggregate
    under the simultaneous action of light and CO2. <i>Chemical Communications</i>.
    Royal Society of Chemistry. <a href="https://doi.org/10.1039/c4cc08541h">https://doi.org/10.1039/c4cc08541h</a>
  chicago: Lee, Ji-Woong, and Rafal Klajn. “Dual-Responsive Nanoparticles That Aggregate
    under the Simultaneous Action of Light and CO2.” <i>Chemical Communications</i>.
    Royal Society of Chemistry, 2015. <a href="https://doi.org/10.1039/c4cc08541h">https://doi.org/10.1039/c4cc08541h</a>.
  ieee: J.-W. Lee and R. Klajn, “Dual-responsive nanoparticles that aggregate under
    the simultaneous action of light and CO2,” <i>Chemical Communications</i>, vol.
    51, no. 11. Royal Society of Chemistry, pp. 2036–2039, 2015.
  ista: Lee J-W, Klajn R. 2015. Dual-responsive nanoparticles that aggregate under
    the simultaneous action of light and CO2. Chemical Communications. 51(11), 2036–2039.
  mla: Lee, Ji-Woong, and Rafal Klajn. “Dual-Responsive Nanoparticles That Aggregate
    under the Simultaneous Action of Light and CO2.” <i>Chemical Communications</i>,
    vol. 51, no. 11, Royal Society of Chemistry, 2015, pp. 2036–39, doi:<a href="https://doi.org/10.1039/c4cc08541h">10.1039/c4cc08541h</a>.
  short: J.-W. Lee, R. Klajn, Chemical Communications 51 (2015) 2036–2039.
date_created: 2023-08-01T09:44:48Z
date_published: 2015-11-18T00:00:00Z
date_updated: 2023-08-07T13:01:53Z
day: '18'
doi: 10.1039/c4cc08541h
extern: '1'
external_id:
  pmid:
  - '25417754'
intvolume: '        51'
issue: '11'
keyword:
- Materials Chemistry
- Metals and Alloys
- Surfaces
- Coatings and Films
- General Chemistry
- Ceramics and Composites
- Electronic
- Optical and Magnetic Materials
- Catalysis
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1039/C4CC08541H
month: '11'
oa: 1
oa_version: Published Version
page: 2036-2039
pmid: 1
publication: Chemical Communications
publication_identifier:
  eissn:
  - 1364-548X
  issn:
  - 1359-7345
publication_status: published
publisher: Royal Society of Chemistry
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dual-responsive nanoparticles that aggregate under the simultaneous action
  of light and CO2
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 51
year: '2015'
...
---
_id: '13397'
abstract:
- lang: eng
  text: Self-assembly of inorganic nanoparticles has been studied extensively for
    particles having different sizes and compositions. However, relatively little
    attention has been devoted to how the shape and surface chemistry of magnetic
    nanoparticles affects their self-assembly properties. Here, we undertook a combined
    experiment–theory study aimed at better understanding of the self-assembly of
    cubic magnetite (Fe3O4) particles. We demonstrated that, depending on the experimental
    parameters, such as the direction of the magnetic field and nanoparticle density,
    a variety of superstructures can be obtained, including one-dimensional filaments
    and helices, as well as C-shaped assemblies described here for the first time.
    Furthermore, we functionalized the surfaces of the magnetic nanocubes with light-sensitive
    ligands. Using these modified nanoparticles, we were able to achieve orthogonal
    control of self-assembly using a magnetic field and light.
article_processing_charge: No
article_type: original
author:
- first_name: Gurvinder
  full_name: Singh, Gurvinder
  last_name: Singh
- first_name: Henry
  full_name: Chan, Henry
  last_name: Chan
- first_name: T.
  full_name: Udayabhaskararao, T.
  last_name: Udayabhaskararao
- first_name: Elijah
  full_name: Gelman, Elijah
  last_name: Gelman
- first_name: Davide
  full_name: Peddis, Davide
  last_name: Peddis
- first_name: Artem
  full_name: Baskin, Artem
  last_name: Baskin
- first_name: Gregory
  full_name: Leitus, Gregory
  last_name: Leitus
- first_name: Petr
  full_name: Král, Petr
  last_name: Král
- first_name: Rafal
  full_name: Klajn, Rafal
  id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
  last_name: Klajn
citation:
  ama: Singh G, Chan H, Udayabhaskararao T, et al. Magnetic field-induced self-assembly
    of iron oxide nanocubes. <i>Faraday Discussions</i>. 2015;181:403-421. doi:<a
    href="https://doi.org/10.1039/c4fd00265b">10.1039/c4fd00265b</a>
  apa: Singh, G., Chan, H., Udayabhaskararao, T., Gelman, E., Peddis, D., Baskin,
    A., … Klajn, R. (2015). Magnetic field-induced self-assembly of iron oxide nanocubes.
    <i>Faraday Discussions</i>. Royal Society of Chemistry. <a href="https://doi.org/10.1039/c4fd00265b">https://doi.org/10.1039/c4fd00265b</a>
  chicago: Singh, Gurvinder, Henry Chan, T. Udayabhaskararao, Elijah Gelman, Davide
    Peddis, Artem Baskin, Gregory Leitus, Petr Král, and Rafal Klajn. “Magnetic Field-Induced
    Self-Assembly of Iron Oxide Nanocubes.” <i>Faraday Discussions</i>. Royal Society
    of Chemistry, 2015. <a href="https://doi.org/10.1039/c4fd00265b">https://doi.org/10.1039/c4fd00265b</a>.
  ieee: G. Singh <i>et al.</i>, “Magnetic field-induced self-assembly of iron oxide
    nanocubes,” <i>Faraday Discussions</i>, vol. 181. Royal Society of Chemistry,
    pp. 403–421, 2015.
  ista: Singh G, Chan H, Udayabhaskararao T, Gelman E, Peddis D, Baskin A, Leitus
    G, Král P, Klajn R. 2015. Magnetic field-induced self-assembly of iron oxide nanocubes.
    Faraday Discussions. 181, 403–421.
  mla: Singh, Gurvinder, et al. “Magnetic Field-Induced Self-Assembly of Iron Oxide
    Nanocubes.” <i>Faraday Discussions</i>, vol. 181, Royal Society of Chemistry,
    2015, pp. 403–21, doi:<a href="https://doi.org/10.1039/c4fd00265b">10.1039/c4fd00265b</a>.
  short: G. Singh, H. Chan, T. Udayabhaskararao, E. Gelman, D. Peddis, A. Baskin,
    G. Leitus, P. Král, R. Klajn, Faraday Discussions 181 (2015) 403–421.
date_created: 2023-08-01T09:45:17Z
date_published: 2015-01-02T00:00:00Z
date_updated: 2023-08-07T13:06:23Z
day: '02'
doi: 10.1039/c4fd00265b
extern: '1'
external_id:
  pmid:
  - '25920522'
intvolume: '       181'
keyword:
- Physical and Theoretical Chemistry
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1039/C4FD00265B
month: '01'
oa: 1
oa_version: Published Version
page: 403-421
pmid: 1
publication: Faraday Discussions
publication_identifier:
  eissn:
  - 1364-5498
  issn:
  - 1359-6640
publication_status: published
publisher: Royal Society of Chemistry
quality_controlled: '1'
scopus_import: '1'
status: public
title: Magnetic field-induced self-assembly of iron oxide nanocubes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 181
year: '2015'
...
---
_id: '1383'
abstract:
- lang: eng
  text: In plants, vacuolar H+-ATPase (V-ATPase) activity acidifies both the trans-Golgi
    network/early endosome (TGN/EE) and the vacuole. This dual V-ATPase function has
    impeded our understanding of how the pH homeostasis within the plant TGN/EE controls
    exo- and endocytosis. Here, we show that the weak V-ATPase mutant deetiolated3
    (det3) displayed a pH increase in the TGN/EE, but not in the vacuole, strongly
    impairing secretion and recycling of the brassinosteroid receptor and the cellulose
    synthase complexes to the plasma membrane, in contrast to mutants lacking tonoplast-localized
    V-ATPase activity only. The brassinosteroid insensitivity and the cellulose deficiency
    defects in det3 were tightly correlated with reduced Golgi and TGN/EE motility.
    Thus, our results provide strong evidence that acidification of the TGN/EE, but
    not of the vacuole, is indispensable for functional secretion and recycling in
    plants.
article_number: '15094'
article_processing_charge: No
article_type: original
author:
- first_name: Luo
  full_name: Yu, Luo
  last_name: Yu
- first_name: Stefan
  full_name: Scholl, Stefan
  last_name: Scholl
- first_name: Anett
  full_name: Doering, Anett
  last_name: Doering
- first_name: Zhang
  full_name: Yi, Zhang
  last_name: Yi
- first_name: Niloufer
  full_name: Irani, Niloufer
  last_name: Irani
- first_name: Simone
  full_name: Di Rubbo, Simone
  last_name: Di Rubbo
- first_name: Lutz
  full_name: Neumetzler, Lutz
  last_name: Neumetzler
- first_name: Praveen
  full_name: Krishnamoorthy, Praveen
  last_name: Krishnamoorthy
- first_name: Isabelle
  full_name: Van Houtte, Isabelle
  last_name: Van Houtte
- first_name: Evelien
  full_name: Mylle, Evelien
  last_name: Mylle
- first_name: Volker
  full_name: Bischoff, Volker
  last_name: Bischoff
- first_name: Samantha
  full_name: Vernhettes, Samantha
  last_name: Vernhettes
- first_name: Johan
  full_name: Winne, Johan
  last_name: Winne
- first_name: Jirí
  full_name: Friml, Jirí
  id: 4159519E-F248-11E8-B48F-1D18A9856A87
  last_name: Friml
  orcid: 0000-0002-8302-7596
- first_name: York
  full_name: Stierhof, York
  last_name: Stierhof
- first_name: Karin
  full_name: Schumacher, Karin
  last_name: Schumacher
- first_name: Staffan
  full_name: Persson, Staffan
  last_name: Persson
- first_name: Eugenia
  full_name: Russinova, Eugenia
  last_name: Russinova
citation:
  ama: Yu L, Scholl S, Doering A, et al. V-ATPase activity in the TGN/EE is required
    for exocytosis and recycling in Arabidopsis. <i>Nature Plants</i>. 2015;1(7).
    doi:<a href="https://doi.org/10.1038/nplants.2015.94">10.1038/nplants.2015.94</a>
  apa: Yu, L., Scholl, S., Doering, A., Yi, Z., Irani, N., Di Rubbo, S., … Russinova,
    E. (2015). V-ATPase activity in the TGN/EE is required for exocytosis and recycling
    in Arabidopsis. <i>Nature Plants</i>. Nature Publishing Group. <a href="https://doi.org/10.1038/nplants.2015.94">https://doi.org/10.1038/nplants.2015.94</a>
  chicago: Yu, Luo, Stefan Scholl, Anett Doering, Zhang Yi, Niloufer Irani, Simone
    Di Rubbo, Lutz Neumetzler, et al. “V-ATPase Activity in the TGN/EE Is Required
    for Exocytosis and Recycling in Arabidopsis.” <i>Nature Plants</i>. Nature Publishing
    Group, 2015. <a href="https://doi.org/10.1038/nplants.2015.94">https://doi.org/10.1038/nplants.2015.94</a>.
  ieee: L. Yu <i>et al.</i>, “V-ATPase activity in the TGN/EE is required for exocytosis
    and recycling in Arabidopsis,” <i>Nature Plants</i>, vol. 1, no. 7. Nature Publishing
    Group, 2015.
  ista: Yu L, Scholl S, Doering A, Yi Z, Irani N, Di Rubbo S, Neumetzler L, Krishnamoorthy
    P, Van Houtte I, Mylle E, Bischoff V, Vernhettes S, Winne J, Friml J, Stierhof
    Y, Schumacher K, Persson S, Russinova E. 2015. V-ATPase activity in the TGN/EE
    is required for exocytosis and recycling in Arabidopsis. Nature Plants. 1(7),
    15094.
  mla: Yu, Luo, et al. “V-ATPase Activity in the TGN/EE Is Required for Exocytosis
    and Recycling in Arabidopsis.” <i>Nature Plants</i>, vol. 1, no. 7, 15094, Nature
    Publishing Group, 2015, doi:<a href="https://doi.org/10.1038/nplants.2015.94">10.1038/nplants.2015.94</a>.
  short: L. Yu, S. Scholl, A. Doering, Z. Yi, N. Irani, S. Di Rubbo, L. Neumetzler,
    P. Krishnamoorthy, I. Van Houtte, E. Mylle, V. Bischoff, S. Vernhettes, J. Winne,
    J. Friml, Y. Stierhof, K. Schumacher, S. Persson, E. Russinova, Nature Plants
    1 (2015).
date_created: 2018-12-11T11:51:42Z
date_published: 2015-07-06T00:00:00Z
date_updated: 2021-01-12T06:50:18Z
day: '06'
department:
- _id: JiFr
doi: 10.1038/nplants.2015.94
external_id:
  pmid:
  - '27250258'
intvolume: '         1'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4905525/
month: '07'
oa: 1
oa_version: Submitted Version
pmid: 1
publication: Nature Plants
publication_status: published
publisher: Nature Publishing Group
publist_id: '5827'
quality_controlled: '1'
scopus_import: 1
status: public
title: V-ATPase activity in the TGN/EE is required for exocytosis and recycling in
  Arabidopsis
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2015'
...
---
_id: '1401'
abstract:
- lang: eng
  text: 'The human ability to recognize objects in complex scenes has driven research
    in the computer vision field over couple of decades. This thesis focuses on the
    object recognition task in images. That is, given the image, we want the computer
    system to be able to predict the class of the object that appears in the image.
    A recent successful attempt to bridge semantic understanding of the image perceived
    by humans and by computers uses attribute-based models. Attributes are semantic
    properties of the objects shared across different categories, which humans and
    computers can decide on. To explore the attribute-based models we take a statistical
    machine learning approach, and address two key learning challenges in view of
    object recognition task: learning augmented attributes as mid-level discriminative
    feature representation, and learning with attributes as privileged information.
    Our main contributions are parametric and non-parametric models and algorithms
    to solve these frameworks. In the parametric approach, we explore an autoencoder
    model combined with the large margin nearest neighbor principle for mid-level
    feature learning, and linear support vector machines for learning with privileged
    information. In the non-parametric approach, we propose a supervised Indian Buffet
    Process for automatic augmentation of semantic attributes, and explore the Gaussian
    Processes classification framework for learning with privileged information. A
    thorough experimental analysis shows the effectiveness of the proposed models
    in both parametric and non-parametric views.'
acknowledgement: "I would like to thank my supervisor, Christoph Lampert, for guidance
  throughout my studies and for patience in transforming me into a scientist, and
  my thesis committee, Chris Wojtan and Horst Bischof, for their help and advice.
  \r\n\r\nI would like to thank Elisabeth Hacker who perfectly assisted all my administrative
  needs and was always nice and friendly to me, and the campus team for making the
  IST Austria campus my second home. \r\nI was honored to collaborate with brilliant
  researchers and to learn from their experience. Undoubtedly, I learned most of all
  from Novi Quadrianto: brainstorming our projects and getting exciting results was
  the most enjoyable part of my work – thank you! I am also grateful to David Knowles,
  Zoubin Ghahramani, Daniel Hernández-Lobato, Kristian Kersting and Anastasia Pentina
  for the fantastic projects we worked on together, and to Kristen Grauman and Adriana
  Kovashka for the exceptional experience working with user studies. I would like
  to thank my colleagues at IST Austria and my office mates who shared their happy
  moods, scientific breakthroughs and thought-provoking conversations with me: Chao,
  Filip, Rustem, Asya, Sameh, Alex, Vlad, Mayu, Neel, Csaba, Thomas, Vladimir, Cristina,
  Alex Z., Avro, Amelie and Emilie, Andreas H. and Andreas E., Chris, Lena, Michael,
  Ali and Ipek, Vera, Igor, Katia. Special thanks to Morten for the countless games
  of table soccer we played together and the tournaments we teamed up for: we will
  definitely win next time:) A very warm hug to Asya for always being so inspiring
  and supportive to me, and for helping me to increase the proportion of female computer
  scientists in our group. "
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Viktoriia
  full_name: Sharmanska, Viktoriia
  id: 2EA6D09E-F248-11E8-B48F-1D18A9856A87
  last_name: Sharmanska
  orcid: 0000-0003-0192-9308
citation:
  ama: 'Sharmanska V. Learning with attributes for object recognition: Parametric
    and non-parametrics views. 2015. doi:<a href="https://doi.org/10.15479/at:ista:1401">10.15479/at:ista:1401</a>'
  apa: 'Sharmanska, V. (2015). <i>Learning with attributes for object recognition:
    Parametric and non-parametrics views</i>. Institute of Science and Technology
    Austria. <a href="https://doi.org/10.15479/at:ista:1401">https://doi.org/10.15479/at:ista:1401</a>'
  chicago: 'Sharmanska, Viktoriia. “Learning with Attributes for Object Recognition:
    Parametric and Non-Parametrics Views.” Institute of Science and Technology Austria,
    2015. <a href="https://doi.org/10.15479/at:ista:1401">https://doi.org/10.15479/at:ista:1401</a>.'
  ieee: 'V. Sharmanska, “Learning with attributes for object recognition: Parametric
    and non-parametrics views,” Institute of Science and Technology Austria, 2015.'
  ista: 'Sharmanska V. 2015. Learning with attributes for object recognition: Parametric
    and non-parametrics views. Institute of Science and Technology Austria.'
  mla: 'Sharmanska, Viktoriia. <i>Learning with Attributes for Object Recognition:
    Parametric and Non-Parametrics Views</i>. Institute of Science and Technology
    Austria, 2015, doi:<a href="https://doi.org/10.15479/at:ista:1401">10.15479/at:ista:1401</a>.'
  short: 'V. Sharmanska, Learning with Attributes for Object Recognition: Parametric
    and Non-Parametrics Views, Institute of Science and Technology Austria, 2015.'
date_created: 2018-12-11T11:51:48Z
date_published: 2015-04-01T00:00:00Z
date_updated: 2023-09-07T11:40:11Z
day: '01'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: ChLa
- _id: GradSch
doi: 10.15479/at:ista:1401
file:
- access_level: open_access
  checksum: 3605b402bb6934e09ae4cf672c84baf7
  content_type: application/pdf
  creator: dernst
  date_created: 2021-02-22T11:33:17Z
  date_updated: 2021-02-22T11:33:17Z
  file_id: '9177'
  file_name: 2015_Thesis_Sharmanska.pdf
  file_size: 7964342
  relation: main_file
  success: 1
- access_level: closed
  checksum: e37593b3ee75bf3180629df2d6ca8f4e
  content_type: application/pdf
  creator: cchlebak
  date_created: 2021-11-16T14:40:45Z
  date_updated: 2021-11-17T13:47:24Z
  file_id: '10297'
  file_name: 2015_Thesis_Sharmanska_pdfa.pdf
  file_size: 7372241
  relation: main_file
file_date_updated: 2021-11-17T13:47:24Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: http://users.sussex.ac.uk/~nq28/viktoriia/Thesis_Sharmanska.pdf
month: '04'
oa: 1
oa_version: Published Version
page: '144'
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '5806'
status: public
supervisor:
- first_name: Christoph
  full_name: Lampert, Christoph
  id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
  last_name: Lampert
  orcid: 0000-0001-8622-7887
title: 'Learning with attributes for object recognition: Parametric and non-parametrics
  views'
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2015'
...
---
_id: '14014'
abstract:
- lang: eng
  text: We have studied a coupled electronic-nuclear wave packet in nitric oxide using
    time-resolved strong-field photoelectron holography and rescattering. We show
    that the electronic dynamics mainly appears in the holographic structures whereas
    nuclear motion strongly modulates the angular distribution of the rescattered
    photoelectrons.
article_number: '112135'
article_processing_charge: No
article_type: original
author:
- first_name: Samuel G
  full_name: Walt, Samuel G
  last_name: Walt
- first_name: N Bhargava
  full_name: Ram, N Bhargava
  last_name: Ram
- first_name: Aaron
  full_name: von Conta, Aaron
  last_name: von Conta
- first_name: Denitsa Rangelova
  full_name: Baykusheva, Denitsa Rangelova
  id: 71b4d059-2a03-11ee-914d-dfa3beed6530
  last_name: Baykusheva
- first_name: Marcos
  full_name: Atala, Marcos
  last_name: Atala
- first_name: Hans Jakob
  full_name: Wörner, Hans Jakob
  last_name: Wörner
citation:
  ama: 'Walt SG, Ram NB, von Conta A, Baykusheva DR, Atala M, Wörner HJ. Resolving
    the dynamics of valence-shell electrons and nuclei through laser-induced diffraction
    and holography. <i>Journal of Physics: Conference Series</i>. 2015;635(11). doi:<a
    href="https://doi.org/10.1088/1742-6596/635/11/112135">10.1088/1742-6596/635/11/112135</a>'
  apa: 'Walt, S. G., Ram, N. B., von Conta, A., Baykusheva, D. R., Atala, M., &#38;
    Wörner, H. J. (2015). Resolving the dynamics of valence-shell electrons and nuclei
    through laser-induced diffraction and holography. <i>Journal of Physics: Conference
    Series</i>. IOP Publishing. <a href="https://doi.org/10.1088/1742-6596/635/11/112135">https://doi.org/10.1088/1742-6596/635/11/112135</a>'
  chicago: 'Walt, Samuel G, N Bhargava Ram, Aaron von Conta, Denitsa Rangelova Baykusheva,
    Marcos Atala, and Hans Jakob Wörner. “Resolving the Dynamics of Valence-Shell
    Electrons and Nuclei through Laser-Induced Diffraction and Holography.” <i>Journal
    of Physics: Conference Series</i>. IOP Publishing, 2015. <a href="https://doi.org/10.1088/1742-6596/635/11/112135">https://doi.org/10.1088/1742-6596/635/11/112135</a>.'
  ieee: 'S. G. Walt, N. B. Ram, A. von Conta, D. R. Baykusheva, M. Atala, and H. J.
    Wörner, “Resolving the dynamics of valence-shell electrons and nuclei through
    laser-induced diffraction and holography,” <i>Journal of Physics: Conference Series</i>,
    vol. 635, no. 11. IOP Publishing, 2015.'
  ista: 'Walt SG, Ram NB, von Conta A, Baykusheva DR, Atala M, Wörner HJ. 2015. Resolving
    the dynamics of valence-shell electrons and nuclei through laser-induced diffraction
    and holography. Journal of Physics: Conference Series. 635(11), 112135.'
  mla: 'Walt, Samuel G., et al. “Resolving the Dynamics of Valence-Shell Electrons
    and Nuclei through Laser-Induced Diffraction and Holography.” <i>Journal of Physics:
    Conference Series</i>, vol. 635, no. 11, 112135, IOP Publishing, 2015, doi:<a
    href="https://doi.org/10.1088/1742-6596/635/11/112135">10.1088/1742-6596/635/11/112135</a>.'
  short: 'S.G. Walt, N.B. Ram, A. von Conta, D.R. Baykusheva, M. Atala, H.J. Wörner,
    Journal of Physics: Conference Series 635 (2015).'
date_created: 2023-08-10T06:37:44Z
date_published: 2015-11-01T00:00:00Z
date_updated: 2023-08-22T08:51:33Z
day: '01'
doi: 10.1088/1742-6596/635/11/112135
extern: '1'
intvolume: '       635'
issue: '11'
keyword:
- General Physics and Astronomy
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1088/1742-6596/635/11/112135
month: '11'
oa: 1
oa_version: Published Version
publication: 'Journal of Physics: Conference Series'
publication_identifier:
  eissn:
  - 1742-6596
  issn:
  - 1742-6588
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Resolving the dynamics of valence-shell electrons and nuclei through laser-induced
  diffraction and holography
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 635
year: '2015'
...
---
_id: '14015'
abstract:
- lang: eng
  text: We advance high-harmonic spectroscopy to resolve molecular charge migration
    in time and space and simultaneously demonstrate extensive control over the process.
    A multidimensional approach enables us to reconstruct both quantum amplitudes
    and phases with a resolution of better than 100 attoseconds and to separately
    reconstruct field-free and laser- driven charge migration. Our techniques make
    charge migration in molecules measurable on the attosecond time scale and open
    new avenues for laser control of electronic primary processes.
article_number: '112136'
article_processing_charge: No
article_type: original
author:
- first_name: P M
  full_name: Kraus, P M
  last_name: Kraus
- first_name: B
  full_name: Mignolet, B
  last_name: Mignolet
- first_name: Denitsa Rangelova
  full_name: Baykusheva, Denitsa Rangelova
  id: 71b4d059-2a03-11ee-914d-dfa3beed6530
  last_name: Baykusheva
- first_name: A
  full_name: Rupenyan, A
  last_name: Rupenyan
- first_name: L
  full_name: Horný, L
  last_name: Horný
- first_name: E F
  full_name: Penka, E F
  last_name: Penka
- first_name: O I
  full_name: Tolstikhin, O I
  last_name: Tolstikhin
- first_name: J
  full_name: Schneider, J
  last_name: Schneider
- first_name: F
  full_name: Jensen, F
  last_name: Jensen
- first_name: L B
  full_name: Madsen, L B
  last_name: Madsen
- first_name: A D
  full_name: Bandrauk, A D
  last_name: Bandrauk
- first_name: F
  full_name: Remacle, F
  last_name: Remacle
- first_name: H J
  full_name: Wörner, H J
  last_name: Wörner
citation:
  ama: 'Kraus PM, Mignolet B, Baykusheva DR, et al. Attosecond charge migration and
    its laser control. <i>Journal of Physics: Conference Series</i>. 2015;635(11).
    doi:<a href="https://doi.org/10.1088/1742-6596/635/11/112136">10.1088/1742-6596/635/11/112136</a>'
  apa: 'Kraus, P. M., Mignolet, B., Baykusheva, D. R., Rupenyan, A., Horný, L., Penka,
    E. F., … Wörner, H. J. (2015). Attosecond charge migration and its laser control.
    <i>Journal of Physics: Conference Series</i>. IOP Publishing. <a href="https://doi.org/10.1088/1742-6596/635/11/112136">https://doi.org/10.1088/1742-6596/635/11/112136</a>'
  chicago: 'Kraus, P M, B Mignolet, Denitsa Rangelova Baykusheva, A Rupenyan, L Horný,
    E F Penka, O I Tolstikhin, et al. “Attosecond Charge Migration and Its Laser Control.”
    <i>Journal of Physics: Conference Series</i>. IOP Publishing, 2015. <a href="https://doi.org/10.1088/1742-6596/635/11/112136">https://doi.org/10.1088/1742-6596/635/11/112136</a>.'
  ieee: 'P. M. Kraus <i>et al.</i>, “Attosecond charge migration and its laser control,”
    <i>Journal of Physics: Conference Series</i>, vol. 635, no. 11. IOP Publishing,
    2015.'
  ista: 'Kraus PM, Mignolet B, Baykusheva DR, Rupenyan A, Horný L, Penka EF, Tolstikhin
    OI, Schneider J, Jensen F, Madsen LB, Bandrauk AD, Remacle F, Wörner HJ. 2015.
    Attosecond charge migration and its laser control. Journal of Physics: Conference
    Series. 635(11), 112136.'
  mla: 'Kraus, P. M., et al. “Attosecond Charge Migration and Its Laser Control.”
    <i>Journal of Physics: Conference Series</i>, vol. 635, no. 11, 112136, IOP Publishing,
    2015, doi:<a href="https://doi.org/10.1088/1742-6596/635/11/112136">10.1088/1742-6596/635/11/112136</a>.'
  short: 'P.M. Kraus, B. Mignolet, D.R. Baykusheva, A. Rupenyan, L. Horný, E.F. Penka,
    O.I. Tolstikhin, J. Schneider, F. Jensen, L.B. Madsen, A.D. Bandrauk, F. Remacle,
    H.J. Wörner, Journal of Physics: Conference Series 635 (2015).'
date_created: 2023-08-10T06:37:53Z
date_published: 2015-07-01T00:00:00Z
date_updated: 2023-08-22T08:49:14Z
day: '01'
doi: 10.1088/1742-6596/635/11/112136
extern: '1'
intvolume: '       635'
issue: '11'
keyword:
- General Physics and Astronomy
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1088/1742-6596/635/11/112136
month: '07'
oa: 1
oa_version: Published Version
publication: 'Journal of Physics: Conference Series'
publication_identifier:
  eissn:
  - 1742-6596
  issn:
  - 1742-6588
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Attosecond charge migration and its laser control
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 635
year: '2015'
...
---
_id: '14016'
abstract:
- lang: eng
  text: All attosecond time-resolved measurements have so far relied on the use of
    intense near-infrared laser pulses. In particular, attosecond streaking, laser-induced
    electron diffraction and high-harmonic generation all make use of non-perturbative
    light–matter interactions. Remarkably, the effect of the strong laser field on
    the studied sample has often been neglected in previous studies. Here we use high-harmonic
    spectroscopy to measure laser-induced modifications of the electronic structure
    of molecules. We study high-harmonic spectra of spatially oriented CH3F and CH3Br
    as generic examples of polar polyatomic molecules. We accurately measure intensity
    ratios of even and odd-harmonic orders, and of the emission from aligned and unaligned
    molecules. We show that these robust observables reveal a substantial modification
    of the molecular electronic structure by the external laser field. Our insights
    offer new challenges and opportunities for a range of emerging strong-field attosecond
    spectroscopies.
article_number: '7039'
article_processing_charge: No
article_type: original
author:
- first_name: P. M.
  full_name: Kraus, P. M.
  last_name: Kraus
- first_name: O. I.
  full_name: Tolstikhin, O. I.
  last_name: Tolstikhin
- first_name: Denitsa Rangelova
  full_name: Baykusheva, Denitsa Rangelova
  id: 71b4d059-2a03-11ee-914d-dfa3beed6530
  last_name: Baykusheva
- first_name: A.
  full_name: Rupenyan, A.
  last_name: Rupenyan
- first_name: J.
  full_name: Schneider, J.
  last_name: Schneider
- first_name: C. Z.
  full_name: Bisgaard, C. Z.
  last_name: Bisgaard
- first_name: T.
  full_name: Morishita, T.
  last_name: Morishita
- first_name: F.
  full_name: Jensen, F.
  last_name: Jensen
- first_name: L. B.
  full_name: Madsen, L. B.
  last_name: Madsen
- first_name: H. J.
  full_name: Wörner, H. J.
  last_name: Wörner
citation:
  ama: Kraus PM, Tolstikhin OI, Baykusheva DR, et al. Observation of laser-induced
    electronic structure in oriented polyatomic molecules. <i>Nature Communications</i>.
    2015;6. doi:<a href="https://doi.org/10.1038/ncomms8039">10.1038/ncomms8039</a>
  apa: Kraus, P. M., Tolstikhin, O. I., Baykusheva, D. R., Rupenyan, A., Schneider,
    J., Bisgaard, C. Z., … Wörner, H. J. (2015). Observation of laser-induced electronic
    structure in oriented polyatomic molecules. <i>Nature Communications</i>. Springer
    Nature. <a href="https://doi.org/10.1038/ncomms8039">https://doi.org/10.1038/ncomms8039</a>
  chicago: Kraus, P. M., O. I. Tolstikhin, Denitsa Rangelova Baykusheva, A. Rupenyan,
    J. Schneider, C. Z. Bisgaard, T. Morishita, F. Jensen, L. B. Madsen, and H. J.
    Wörner. “Observation of Laser-Induced Electronic Structure in Oriented Polyatomic
    Molecules.” <i>Nature Communications</i>. Springer Nature, 2015. <a href="https://doi.org/10.1038/ncomms8039">https://doi.org/10.1038/ncomms8039</a>.
  ieee: P. M. Kraus <i>et al.</i>, “Observation of laser-induced electronic structure
    in oriented polyatomic molecules,” <i>Nature Communications</i>, vol. 6. Springer
    Nature, 2015.
  ista: Kraus PM, Tolstikhin OI, Baykusheva DR, Rupenyan A, Schneider J, Bisgaard
    CZ, Morishita T, Jensen F, Madsen LB, Wörner HJ. 2015. Observation of laser-induced
    electronic structure in oriented polyatomic molecules. Nature Communications.
    6, 7039.
  mla: Kraus, P. M., et al. “Observation of Laser-Induced Electronic Structure in
    Oriented Polyatomic Molecules.” <i>Nature Communications</i>, vol. 6, 7039, Springer
    Nature, 2015, doi:<a href="https://doi.org/10.1038/ncomms8039">10.1038/ncomms8039</a>.
  short: P.M. Kraus, O.I. Tolstikhin, D.R. Baykusheva, A. Rupenyan, J. Schneider,
    C.Z. Bisgaard, T. Morishita, F. Jensen, L.B. Madsen, H.J. Wörner, Nature Communications
    6 (2015).
date_created: 2023-08-10T06:38:01Z
date_published: 2015-05-05T00:00:00Z
date_updated: 2023-08-22T08:52:56Z
day: '05'
doi: 10.1038/ncomms8039
extern: '1'
external_id:
  pmid:
  - '25940229'
intvolume: '         6'
keyword:
- General Physics and Astronomy
- General Biochemistry
- Genetics and Molecular Biology
- General Chemistry
- Multidisciplinary
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1038/ncomms8039
month: '05'
oa: 1
oa_version: Published Version
pmid: 1
publication: Nature Communications
publication_identifier:
  eissn:
  - 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Observation of laser-induced electronic structure in oriented polyatomic molecules
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2015'
...
---
_id: '14017'
abstract:
- lang: eng
  text: The detection of electron motion and electronic wave-packet dynamics is one
    of the core goals of attosecond science. Recently, choosing the nitric oxide molecule
    as an example, we have introduced and demonstrated an experimental approach to
    measure coupled valence electronic and rotational wave packets using high-order-harmonic-generation
    (HHG) spectroscopy [Kraus et al., Phys. Rev. Lett. 111, 243005 (2013)]. A short
    outline of the theory to describe the combination of the pump and HHG probe process
    was published together with an extensive discussion of experimental results [Baykusheva
    et al., Faraday Discuss. 171, 113 (2014)]. The comparison of theory and experiment
    showed good agreement on a quantitative level. Here, we present the theory in
    detail, which is based on a generalized density-matrix approach that describes
    the pump process and the subsequent probing of the wave packets by a semiclassical
    quantitative rescattering approach. An in-depth analysis of the different Raman
    scattering contributions to the creation of the coupled rotational and electronic
    spin-orbit wave packets is made. We present results for parallel and perpendicular
    linear polarizations of the pump and probe laser pulses. Furthermore, an analysis
    of the combined rotational-electronic density matrix in terms of irreducible components
    is presented that facilitates interpretation of the results.
article_number: '023421'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Song Bin
  full_name: Zhang, Song Bin
  last_name: Zhang
- first_name: Denitsa Rangelova
  full_name: Baykusheva, Denitsa Rangelova
  id: 71b4d059-2a03-11ee-914d-dfa3beed6530
  last_name: Baykusheva
- first_name: Peter M.
  full_name: Kraus, Peter M.
  last_name: Kraus
- first_name: Hans Jakob
  full_name: Wörner, Hans Jakob
  last_name: Wörner
- first_name: Nina
  full_name: Rohringer, Nina
  last_name: Rohringer
citation:
  ama: Zhang SB, Baykusheva DR, Kraus PM, Wörner HJ, Rohringer N. Theoretical study
    of molecular electronic and rotational coherences by high-order-harmonic generation.
    <i>Physical Review A</i>. 2015;91(2). doi:<a href="https://doi.org/10.1103/physreva.91.023421">10.1103/physreva.91.023421</a>
  apa: Zhang, S. B., Baykusheva, D. R., Kraus, P. M., Wörner, H. J., &#38; Rohringer,
    N. (2015). Theoretical study of molecular electronic and rotational coherences
    by high-order-harmonic generation. <i>Physical Review A</i>. American Physical
    Society. <a href="https://doi.org/10.1103/physreva.91.023421">https://doi.org/10.1103/physreva.91.023421</a>
  chicago: Zhang, Song Bin, Denitsa Rangelova Baykusheva, Peter M. Kraus, Hans Jakob
    Wörner, and Nina Rohringer. “Theoretical Study of Molecular Electronic and Rotational
    Coherences by High-Order-Harmonic Generation.” <i>Physical Review A</i>. American
    Physical Society, 2015. <a href="https://doi.org/10.1103/physreva.91.023421">https://doi.org/10.1103/physreva.91.023421</a>.
  ieee: S. B. Zhang, D. R. Baykusheva, P. M. Kraus, H. J. Wörner, and N. Rohringer,
    “Theoretical study of molecular electronic and rotational coherences by high-order-harmonic
    generation,” <i>Physical Review A</i>, vol. 91, no. 2. American Physical Society,
    2015.
  ista: Zhang SB, Baykusheva DR, Kraus PM, Wörner HJ, Rohringer N. 2015. Theoretical
    study of molecular electronic and rotational coherences by high-order-harmonic
    generation. Physical Review A. 91(2), 023421.
  mla: Zhang, Song Bin, et al. “Theoretical Study of Molecular Electronic and Rotational
    Coherences by High-Order-Harmonic Generation.” <i>Physical Review A</i>, vol.
    91, no. 2, 023421, American Physical Society, 2015, doi:<a href="https://doi.org/10.1103/physreva.91.023421">10.1103/physreva.91.023421</a>.
  short: S.B. Zhang, D.R. Baykusheva, P.M. Kraus, H.J. Wörner, N. Rohringer, Physical
    Review A 91 (2015).
date_created: 2023-08-10T06:38:10Z
date_published: 2015-02-19T00:00:00Z
date_updated: 2023-08-22T08:56:34Z
day: '19'
doi: 10.1103/physreva.91.023421
extern: '1'
external_id:
  arxiv:
  - '1504.03933'
intvolume: '        91'
issue: '2'
keyword:
- Atomic and Molecular Physics
- and Optics
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1504.03933
month: '02'
oa: 1
oa_version: Preprint
publication: Physical Review A
publication_identifier:
  eissn:
  - 1094-1622
  issn:
  - 1050-2947
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Theoretical study of molecular electronic and rotational coherences by high-order-harmonic
  generation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 91
year: '2015'
...
---
_id: '1424'
abstract:
- lang: eng
  text: We consider the problem of statistical computations with persistence diagrams,
    a summary representation of topological features in data. These diagrams encode
    persistent homology, a widely used invariant in topological data analysis. While
    several avenues towards a statistical treatment of the diagrams have been explored
    recently, we follow an alternative route that is motivated by the success of methods
    based on the embedding of probability measures into reproducing kernel Hilbert
    spaces. In fact, a positive definite kernel on persistence diagrams has recently
    been proposed, connecting persistent homology to popular kernel-based learning
    techniques such as support vector machines. However, important properties of that
    kernel enabling a principled use in the context of probability measure embeddings
    remain to be explored. Our contribution is to close this gap by proving universality
    of a variant of the original kernel, and to demonstrate its effective use in twosample
    hypothesis testing on synthetic as well as real-world data.
acknowledgement: This work was partially supported by the Austrian Science FUnd, project
  no. KLI 00012.
alternative_title:
- Advances in Neural Information Processing Systems
author:
- first_name: Roland
  full_name: Kwitt, Roland
  last_name: Kwitt
- first_name: Stefan
  full_name: Huber, Stefan
  id: 4700A070-F248-11E8-B48F-1D18A9856A87
  last_name: Huber
  orcid: 0000-0002-8871-5814
- first_name: Marc
  full_name: Niethammer, Marc
  last_name: Niethammer
- first_name: Weili
  full_name: Lin, Weili
  last_name: Lin
- first_name: Ulrich
  full_name: Bauer, Ulrich
  id: 2ADD483A-F248-11E8-B48F-1D18A9856A87
  last_name: Bauer
  orcid: 0000-0002-9683-0724
citation:
  ama: 'Kwitt R, Huber S, Niethammer M, Lin W, Bauer U. Statistical topological data
    analysis-A kernel perspective. In: Vol 28. Neural Information Processing Systems;
    2015:3070-3078.'
  apa: 'Kwitt, R., Huber, S., Niethammer, M., Lin, W., &#38; Bauer, U. (2015). Statistical
    topological data analysis-A kernel perspective (Vol. 28, pp. 3070–3078). Presented
    at the NIPS: Neural Information Processing Systems, Montreal, Canada: Neural Information
    Processing Systems.'
  chicago: Kwitt, Roland, Stefan Huber, Marc Niethammer, Weili Lin, and Ulrich Bauer.
    “Statistical Topological Data Analysis-A Kernel Perspective,” 28:3070–78. Neural
    Information Processing Systems, 2015.
  ieee: 'R. Kwitt, S. Huber, M. Niethammer, W. Lin, and U. Bauer, “Statistical topological
    data analysis-A kernel perspective,” presented at the NIPS: Neural Information
    Processing Systems, Montreal, Canada, 2015, vol. 28, pp. 3070–3078.'
  ista: 'Kwitt R, Huber S, Niethammer M, Lin W, Bauer U. 2015. Statistical topological
    data analysis-A kernel perspective. NIPS: Neural Information Processing Systems,
    Advances in Neural Information Processing Systems, vol. 28, 3070–3078.'
  mla: Kwitt, Roland, et al. <i>Statistical Topological Data Analysis-A Kernel Perspective</i>.
    Vol. 28, Neural Information Processing Systems, 2015, pp. 3070–78.
  short: R. Kwitt, S. Huber, M. Niethammer, W. Lin, U. Bauer, in:, Neural Information
    Processing Systems, 2015, pp. 3070–3078.
conference:
  end_date: 2015-12-12
  location: Montreal, Canada
  name: 'NIPS: Neural Information Processing Systems'
  start_date: 2015-12-07
date_created: 2018-12-11T11:51:56Z
date_published: 2015-12-01T00:00:00Z
date_updated: 2021-01-12T06:50:38Z
day: '01'
department:
- _id: HeEd
intvolume: '        28'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://papers.nips.cc/paper/5887-statistical-topological-data-analysis-a-kernel-perspective
month: '12'
oa: 1
oa_version: Submitted Version
page: 3070 - 3078
publication_status: published
publisher: Neural Information Processing Systems
publist_id: '5782'
quality_controlled: '1'
status: public
title: Statistical topological data analysis-A kernel perspective
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 28
year: '2015'
...
---
_id: '1425'
abstract:
- lang: eng
  text: 'In this work we aim at extending the theoretical foundations of lifelong
    learning. Previous work analyzing this scenario is based on the assumption that
    learning tasks are sampled i.i.d. from a task environment or limited to strongly
    constrained data distributions. Instead, we study two scenarios when lifelong
    learning is possible, even though the observed tasks do not form an i.i.d. sample:
    first, when they are sampled from the same environment, but possibly with dependencies,
    and second, when the task environment is allowed to change over time in a consistent
    way. In the first case we prove a PAC-Bayesian theorem that can be seen as a direct
    generalization of the analogous previous result for the i.i.d. case. For the second
    scenario we propose to learn an inductive bias in form of a transfer procedure.
    We present a generalization bound and show on a toy example how it can be used
    to identify a beneficial transfer algorithm.'
alternative_title:
- Advances in Neural Information Processing Systems
author:
- first_name: Anastasia
  full_name: Pentina, Anastasia
  id: 42E87FC6-F248-11E8-B48F-1D18A9856A87
  last_name: Pentina
- first_name: Christoph
  full_name: Lampert, Christoph
  id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
  last_name: Lampert
  orcid: 0000-0001-8622-7887
citation:
  ama: 'Pentina A, Lampert C. Lifelong learning with non-i.i.d. tasks. In: Vol 2015.
    Neural Information Processing Systems; 2015:1540-1548.'
  apa: 'Pentina, A., &#38; Lampert, C. (2015). Lifelong learning with non-i.i.d. tasks
    (Vol. 2015, pp. 1540–1548). Presented at the NIPS: Neural Information Processing
    Systems, Montreal, Canada: Neural Information Processing Systems.'
  chicago: Pentina, Anastasia, and Christoph Lampert. “Lifelong Learning with Non-i.i.d.
    Tasks,” 2015:1540–48. Neural Information Processing Systems, 2015.
  ieee: 'A. Pentina and C. Lampert, “Lifelong learning with non-i.i.d. tasks,” presented
    at the NIPS: Neural Information Processing Systems, Montreal, Canada, 2015, vol.
    2015, pp. 1540–1548.'
  ista: 'Pentina A, Lampert C. 2015. Lifelong learning with non-i.i.d. tasks. NIPS:
    Neural Information Processing Systems, Advances in Neural Information Processing
    Systems, vol. 2015, 1540–1548.'
  mla: Pentina, Anastasia, and Christoph Lampert. <i>Lifelong Learning with Non-i.i.d.
    Tasks</i>. Vol. 2015, Neural Information Processing Systems, 2015, pp. 1540–48.
  short: A. Pentina, C. Lampert, in:, Neural Information Processing Systems, 2015,
    pp. 1540–1548.
conference:
  end_date: 2015-12-12
  location: Montreal, Canada
  name: 'NIPS: Neural Information Processing Systems'
  start_date: 2015-12-07
date_created: 2018-12-11T11:51:57Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T06:50:39Z
day: '01'
department:
- _id: ChLa
ec_funded: 1
intvolume: '      2015'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://papers.nips.cc/paper/6007-lifelong-learning-with-non-iid-tasks
month: '01'
oa: 1
oa_version: None
page: 1540 - 1548
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '308036'
  name: Lifelong Learning of Visual Scene Understanding
publication_status: published
publisher: Neural Information Processing Systems
publist_id: '5781'
quality_controlled: '1'
scopus_import: 1
status: public
title: Lifelong learning with non-i.i.d. tasks
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 2015
year: '2015'
...
---
_id: '1430'
abstract:
- lang: eng
  text: Evolutionary algorithms (EAs) form a popular optimisation paradigm inspired
    by natural evolution. In recent years the field of evolutionary computation has
    developed a rigorous analytical theory to analyse their runtime on many illustrative
    problems. Here we apply this theory to a simple model of natural evolution. In
    the Strong Selection Weak Mutation (SSWM) evolutionary regime the time between
    occurrence of new mutations is much longer than the time it takes for a new beneficial
    mutation to take over the population. In this situation, the population only contains
    copies of one genotype and evolution can be modelled as a (1+1)-type process where
    the probability of accepting a new genotype (improvements or worsenings) depends
    on the change in fitness. We present an initial runtime analysis of SSWM, quantifying
    its performance for various parameters and investigating differences to the (1+1)
    EA. We show that SSWM can have a moderate advantage over the (1+1) EA at crossing
    fitness valleys and study an example where SSWM outperforms the (1+1) EA by taking
    advantage of information on the fitness gradient.
author:
- first_name: Tiago
  full_name: Paixao, Tiago
  id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
  last_name: Paixao
  orcid: 0000-0003-2361-3953
- first_name: Dirk
  full_name: Sudholt, Dirk
  last_name: Sudholt
- first_name: Jorge
  full_name: Heredia, Jorge
  last_name: Heredia
- first_name: Barbora
  full_name: Trubenova, Barbora
  id: 42302D54-F248-11E8-B48F-1D18A9856A87
  last_name: Trubenova
  orcid: 0000-0002-6873-2967
citation:
  ama: 'Paixao T, Sudholt D, Heredia J, Trubenova B. First steps towards a runtime
    comparison of natural and artificial evolution. In: <i>Proceedings of the 2015
    Annual Conference on Genetic and Evolutionary Computation</i>. ACM; 2015:1455-1462.
    doi:<a href="https://doi.org/10.1145/2739480.2754758">10.1145/2739480.2754758</a>'
  apa: 'Paixao, T., Sudholt, D., Heredia, J., &#38; Trubenova, B. (2015). First steps
    towards a runtime comparison of natural and artificial evolution. In <i>Proceedings
    of the 2015 Annual Conference on Genetic and Evolutionary Computation</i> (pp.
    1455–1462). Madrid, Spain: ACM. <a href="https://doi.org/10.1145/2739480.2754758">https://doi.org/10.1145/2739480.2754758</a>'
  chicago: Paixao, Tiago, Dirk Sudholt, Jorge Heredia, and Barbora Trubenova. “First
    Steps towards a Runtime Comparison of Natural and Artificial Evolution.” In <i>Proceedings
    of the 2015 Annual Conference on Genetic and Evolutionary Computation</i>, 1455–62.
    ACM, 2015. <a href="https://doi.org/10.1145/2739480.2754758">https://doi.org/10.1145/2739480.2754758</a>.
  ieee: T. Paixao, D. Sudholt, J. Heredia, and B. Trubenova, “First steps towards
    a runtime comparison of natural and artificial evolution,” in <i>Proceedings of
    the 2015 Annual Conference on Genetic and Evolutionary Computation</i>, Madrid,
    Spain, 2015, pp. 1455–1462.
  ista: 'Paixao T, Sudholt D, Heredia J, Trubenova B. 2015. First steps towards a
    runtime comparison of natural and artificial evolution. Proceedings of the 2015
    Annual Conference on Genetic and Evolutionary Computation. GECCO: Genetic and
    evolutionary computation conference, 1455–1462.'
  mla: Paixao, Tiago, et al. “First Steps towards a Runtime Comparison of Natural
    and Artificial Evolution.” <i>Proceedings of the 2015 Annual Conference on Genetic
    and Evolutionary Computation</i>, ACM, 2015, pp. 1455–62, doi:<a href="https://doi.org/10.1145/2739480.2754758">10.1145/2739480.2754758</a>.
  short: T. Paixao, D. Sudholt, J. Heredia, B. Trubenova, in:, Proceedings of the
    2015 Annual Conference on Genetic and Evolutionary Computation, ACM, 2015, pp.
    1455–1462.
conference:
  end_date: 2015-07-15
  location: Madrid, Spain
  name: 'GECCO: Genetic and evolutionary computation conference'
  start_date: 2015-07-11
date_created: 2018-12-11T11:51:58Z
date_published: 2015-07-11T00:00:00Z
date_updated: 2021-01-12T06:50:41Z
day: '11'
department:
- _id: NiBa
- _id: CaGu
doi: 10.1145/2739480.2754758
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1504.06260
month: '07'
oa: 1
oa_version: Preprint
page: 1455 - 1462
project:
- _id: 25B1EC9E-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '618091'
  name: Speed of Adaptation in Population Genetics and Evolutionary Computation
publication: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary
  Computation
publication_status: published
publisher: ACM
publist_id: '5768'
quality_controlled: '1'
scopus_import: 1
status: public
title: First steps towards a runtime comparison of natural and artificial evolution
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '14303'
abstract:
- lang: eng
  text: Scaffolded DNA origami enables the fabrication of a variety of complex nanostructures
    that promise utility in diverse fields of application, ranging from biosensing
    over advanced therapeutics to metamaterials. The broad applicability of DNA origami
    as a material beyond the level of proof-of-concept studies critically depends,
    among other factors, on the availability of large amounts of pure single-stranded
    scaffold DNA. Here, we present a method for the efficient production of M13 bacteriophage-derived
    genomic DNA using high-cell-density fermentation of Escherichia coli in stirred-tank
    bioreactors. We achieve phage titers of up to 1.6 × 1014 plaque-forming units
    per mL. Downstream processing yields up to 410 mg of high-quality single-stranded
    DNA per one liter reaction volume, thus upgrading DNA origami-based nanotechnology
    from the milligram to the gram scale.
article_processing_charge: No
article_type: letter_note
author:
- first_name: B
  full_name: Kick, B
  last_name: Kick
- first_name: Florian M
  full_name: Praetorius, Florian M
  id: dfec9381-4341-11ee-8fd8-faa02bba7d62
  last_name: Praetorius
- first_name: H
  full_name: Dietz, H
  last_name: Dietz
- first_name: D
  full_name: Weuster-Botz, D
  last_name: Weuster-Botz
citation:
  ama: Kick B, Praetorius FM, Dietz H, Weuster-Botz D. Efficient production of single-stranded
    phage DNA as scaffolds for DNA origami. <i>Nano Letters</i>. 2015;15(7):4672-4676.
    doi:<a href="https://doi.org/10.1021/acs.nanolett.5b01461">10.1021/acs.nanolett.5b01461</a>
  apa: Kick, B., Praetorius, F. M., Dietz, H., &#38; Weuster-Botz, D. (2015). Efficient
    production of single-stranded phage DNA as scaffolds for DNA origami. <i>Nano
    Letters</i>. ACS Publications. <a href="https://doi.org/10.1021/acs.nanolett.5b01461">https://doi.org/10.1021/acs.nanolett.5b01461</a>
  chicago: Kick, B, Florian M Praetorius, H Dietz, and D Weuster-Botz. “Efficient
    Production of Single-Stranded Phage DNA as Scaffolds for DNA Origami.” <i>Nano
    Letters</i>. ACS Publications, 2015. <a href="https://doi.org/10.1021/acs.nanolett.5b01461">https://doi.org/10.1021/acs.nanolett.5b01461</a>.
  ieee: B. Kick, F. M. Praetorius, H. Dietz, and D. Weuster-Botz, “Efficient production
    of single-stranded phage DNA as scaffolds for DNA origami,” <i>Nano Letters</i>,
    vol. 15, no. 7. ACS Publications, pp. 4672–4676, 2015.
  ista: Kick B, Praetorius FM, Dietz H, Weuster-Botz D. 2015. Efficient production
    of single-stranded phage DNA as scaffolds for DNA origami. Nano Letters. 15(7),
    4672–4676.
  mla: Kick, B., et al. “Efficient Production of Single-Stranded Phage DNA as Scaffolds
    for DNA Origami.” <i>Nano Letters</i>, vol. 15, no. 7, ACS Publications, 2015,
    pp. 4672–76, doi:<a href="https://doi.org/10.1021/acs.nanolett.5b01461">10.1021/acs.nanolett.5b01461</a>.
  short: B. Kick, F.M. Praetorius, H. Dietz, D. Weuster-Botz, Nano Letters 15 (2015)
    4672–4676.
date_created: 2023-09-06T12:52:47Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2023-11-07T11:56:32Z
day: '01'
doi: 10.1021/acs.nanolett.5b01461
extern: '1'
external_id:
  pmid:
  - '26028443'
intvolume: '        15'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1021/acs.nanolett.5b01461
month: '06'
oa: 1
oa_version: Published Version
page: 4672-4676
pmid: 1
publication: Nano Letters
publication_identifier:
  eissn:
  - 1530-6992
  issn:
  - 1530-6984
publication_status: published
publisher: ACS Publications
quality_controlled: '1'
status: public
title: Efficient production of single-stranded phage DNA as scaffolds for DNA origami
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2015'
...
---
_id: '1473'
abstract:
- lang: eng
  text: In this paper we survey geometric and arithmetic techniques to study the cohomology
    of semiprojective hyperkähler manifolds including toric hyperkähler varieties,
    Nakajima quiver varieties and moduli spaces of Higgs bundles on Riemann surfaces.
    The resulting formulae for their Poincaré polynomials are combinatorial and representation
    theoretical in nature. In particular we will look at their Betti numbers and will
    establish some results and state some expectations on their asymptotic shape.
author:
- first_name: Tamas
  full_name: Tamas Hausel
  id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
  last_name: Hausel
- first_name: Fernando
  full_name: Rodríguez Villegas, Fernando
  last_name: Rodríguez Villegas
citation:
  ama: Hausel T, Rodríguez Villegas F. Cohomology of large semiprojective hyperkähler
    varieties. <i>Asterisque</i>. 2015;2015(370):113-156.
  apa: Hausel, T., &#38; Rodríguez Villegas, F. (2015). Cohomology of large semiprojective
    hyperkähler varieties. <i>Asterisque</i>. Societe Mathematique de France.
  chicago: Hausel, Tamás, and Fernando Rodríguez Villegas. “Cohomology of Large Semiprojective
    Hyperkähler Varieties.” <i>Asterisque</i>. Societe Mathematique de France, 2015.
  ieee: T. Hausel and F. Rodríguez Villegas, “Cohomology of large semiprojective hyperkähler
    varieties,” <i>Asterisque</i>, vol. 2015, no. 370. Societe Mathematique de France,
    pp. 113–156, 2015.
  ista: Hausel T, Rodríguez Villegas F. 2015. Cohomology of large semiprojective hyperkähler
    varieties. Asterisque. 2015(370), 113–156.
  mla: Hausel, Tamás, and Fernando Rodríguez Villegas. “Cohomology of Large Semiprojective
    Hyperkähler Varieties.” <i>Asterisque</i>, vol. 2015, no. 370, Societe Mathematique
    de France, 2015, pp. 113–56.
  short: T. Hausel, F. Rodríguez Villegas, Asterisque 2015 (2015) 113–156.
date_created: 2018-12-11T11:52:13Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T06:50:59Z
day: '01'
extern: 1
intvolume: '      2015'
issue: '370'
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1309.4914
month: '01'
oa: 1
page: 113 - 156
publication: Asterisque
publication_status: published
publisher: Societe Mathematique de France
publist_id: '5723'
quality_controlled: 0
status: public
title: Cohomology of large semiprojective hyperkähler varieties
type: review
volume: 2015
year: '2015'
...
---
_id: '1474'
abstract:
- lang: eng
  text: Cryptographic access control offers selective access to encrypted data via
    a combination of key management and functionality-rich cryptographic schemes,
    such as attribute-based encryption. Using this approach, publicly available meta-data
    may inadvertently leak information on the access policy that is enforced by cryptography,
    which renders cryptographic access control unusable in settings where this information
    is highly sensitive. We begin to address this problem by presenting rigorous definitions
    for policy privacy in cryptographic access control. For concreteness we set our
    results in the model of Role-Based Access Control (RBAC), where we identify and
    formalize several different flavors of privacy, however, our framework should
    serve as inspiration for other models of access control. Based on our insights
    we propose a new system which significantly improves on the privacy properties
    of state-of-the-art constructions. Our design is based on a novel type of privacy-preserving
    attribute-based encryption, which we introduce and show how to instantiate. We
    present our results in the context of a cryptographic RBAC system by Ferrara et
    al. (CSF'13), which uses cryptography to control read access to files, while write
    access is still delegated to trusted monitors. We give an extension of the construction
    that permits cryptographic control over write access. Our construction assumes
    that key management uses out-of-band channels between the policy enforcer and
    the users but eliminates completely the need for monitoring read/write access
    to the data.
article_processing_charge: No
author:
- first_name: Anna
  full_name: Ferrara, Anna
  last_name: Ferrara
- first_name: Georg
  full_name: Fuchsbauer, Georg
  id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
  last_name: Fuchsbauer
- first_name: Bin
  full_name: Liu, Bin
  last_name: Liu
- first_name: Bogdan
  full_name: Warinschi, Bogdan
  last_name: Warinschi
citation:
  ama: 'Ferrara A, Fuchsbauer G, Liu B, Warinschi B. Policy privacy in cryptographic
    access control. In: IEEE; 2015:46-60. doi:<a href="https://doi.org/10.1109/CSF.2015.11">10.1109/CSF.2015.11</a>'
  apa: 'Ferrara, A., Fuchsbauer, G., Liu, B., &#38; Warinschi, B. (2015). Policy privacy
    in cryptographic access control (pp. 46–60). Presented at the CSF: Computer Security
    Foundations, Verona, Italy: IEEE. <a href="https://doi.org/10.1109/CSF.2015.11">https://doi.org/10.1109/CSF.2015.11</a>'
  chicago: Ferrara, Anna, Georg Fuchsbauer, Bin Liu, and Bogdan Warinschi. “Policy
    Privacy in Cryptographic Access Control,” 46–60. IEEE, 2015. <a href="https://doi.org/10.1109/CSF.2015.11">https://doi.org/10.1109/CSF.2015.11</a>.
  ieee: 'A. Ferrara, G. Fuchsbauer, B. Liu, and B. Warinschi, “Policy privacy in cryptographic
    access control,” presented at the CSF: Computer Security Foundations, Verona,
    Italy, 2015, pp. 46–60.'
  ista: 'Ferrara A, Fuchsbauer G, Liu B, Warinschi B. 2015. Policy privacy in cryptographic
    access control. CSF: Computer Security Foundations, 46–60.'
  mla: Ferrara, Anna, et al. <i>Policy Privacy in Cryptographic Access Control</i>.
    IEEE, 2015, pp. 46–60, doi:<a href="https://doi.org/10.1109/CSF.2015.11">10.1109/CSF.2015.11</a>.
  short: A. Ferrara, G. Fuchsbauer, B. Liu, B. Warinschi, in:, IEEE, 2015, pp. 46–60.
conference:
  end_date: 2015-07-17
  location: Verona, Italy
  name: 'CSF: Computer Security Foundations'
  start_date: 2015-07-13
date_created: 2018-12-11T11:52:14Z
date_published: 2015-09-04T00:00:00Z
date_updated: 2021-01-12T06:50:59Z
day: '04'
department:
- _id: KrPi
doi: 10.1109/CSF.2015.11
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://epubs.surrey.ac.uk/808055/
month: '09'
oa: 1
oa_version: Submitted Version
page: 46-60
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '259668'
  name: Provable Security for Physical Cryptography
publication_status: published
publisher: IEEE
publist_id: '5722'
quality_controlled: '1'
status: public
title: Policy privacy in cryptographic access control
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5429'
abstract:
- lang: eng
  text: "We consider Markov decision processes (MDPs) with multiple limit-average
    (or mean-payoff) objectives. \r\nThere have been 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.
    \ \r\nWe consider the problem where the goal is to optimize the expectation under
    the constraint that the satisfaction semantics is ensured, and thus consider a
    generalization that unifies the existing semantics.\r\nOur problem captures the
    notion of optimization with respect to strategies that are risk-averse (i.e.,
    ensures certain probabilistic guarantee).\r\nOur main results are algorithms for
    the decision problem 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.\r\nFinally, we present a complete characterization of the strategy
    complexity (in terms of memory bounds and randomization) required to solve our
    problem."
alternative_title:
- IST Austria Technical Report
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: Komarkova, Zuzana
  last_name: Komarkova
- 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, Komarkova Z, Kretinsky J. <i>Unifying Two Views on Multiple Mean-Payoff
    Objectives in Markov Decision Processes</i>. IST Austria; 2015. doi:<a href="https://doi.org/10.15479/AT:IST-2015-318-v1-1">10.15479/AT:IST-2015-318-v1-1</a>
  apa: Chatterjee, K., Komarkova, Z., &#38; Kretinsky, J. (2015). <i>Unifying two
    views on multiple mean-payoff objectives in Markov decision processes</i>. IST
    Austria. <a href="https://doi.org/10.15479/AT:IST-2015-318-v1-1">https://doi.org/10.15479/AT:IST-2015-318-v1-1</a>
  chicago: Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. <i>Unifying
    Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>.
    IST Austria, 2015. <a href="https://doi.org/10.15479/AT:IST-2015-318-v1-1">https://doi.org/10.15479/AT:IST-2015-318-v1-1</a>.
  ieee: K. Chatterjee, Z. Komarkova, and J. Kretinsky, <i>Unifying two views on multiple
    mean-payoff objectives in Markov decision processes</i>. IST Austria, 2015.
  ista: Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple
    mean-payoff objectives in Markov decision processes, IST Austria, 41p.
  mla: Chatterjee, Krishnendu, et al. <i>Unifying Two Views on Multiple Mean-Payoff
    Objectives in Markov Decision Processes</i>. IST Austria, 2015, doi:<a href="https://doi.org/10.15479/AT:IST-2015-318-v1-1">10.15479/AT:IST-2015-318-v1-1</a>.
  short: K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple
    Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.
date_created: 2018-12-12T11:39:17Z
date_published: 2015-01-12T00:00:00Z
date_updated: 2023-02-23T12:26:16Z
day: '12'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-318-v1-1
file:
- access_level: open_access
  checksum: e4869a584567c506349abda9c8ec7db3
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:54:11Z
  date_updated: 2020-07-14T12:46:52Z
  file_id: '5533'
  file_name: IST-2015-318-v1+1_main.pdf
  file_size: 689863
  relation: main_file
file_date_updated: 2020-07-14T12:46:52Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: '41'
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '318'
related_material:
  record:
  - id: '1657'
    relation: later_version
    status: public
  - id: '466'
    relation: later_version
    status: public
  - id: '5435'
    relation: later_version
    status: public
status: public
title: Unifying two views on multiple mean-payoff objectives in Markov decision processes
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5430'
abstract:
- lang: eng
  text: We consider the core algorithmic problems related to verification of systems
    with respect to three classical quantitative properties, namely, the mean- payoff
    property, the ratio property, and the minimum initial credit for energy property.
    The algorithmic problem given a graph and a quantitative property asks to compute
    the optimal value (the infimum value over all traces) from every node of the graph.
    We consider graphs with constant treewidth, and it is well-known that the control-flow
    graphs of most programs have constant treewidth. Let n denote the number of nodes
    of a graph, m the number of edges (for constant treewidth graphs m = O ( n ) )
    and W the largest absolute value of the weights. Our main theoretical results
    are as follows. First, for constant treewidth graphs we present an algorithm that
    approximates the mean-payoff value within a mul- tiplicative factor of ∊ in time
    O ( n · log( n/∊ )) and linear space, as compared to the classical algorithms
    that require quadratic time. Second, for the ratio property we present an algorithm
    that for constant treewidth graphs works in time O ( n · log( | a · b · n | ))
    = O ( n · log( n · W )) , when the output is a b , as compared to the previously
    best known algorithm with running time O ( n 2 · log( n · W )) . Third, for the
    minimum initial credit problem we show that (i) for general graphs the problem
    can be solved in O ( n 2 · m ) time and the associated decision problem can be
    solved in O ( n · m ) time, improving the previous known O ( n 3 · m · log( n
    · W )) and O ( n 2 · m ) bounds, respectively; and (ii) for constant treewidth
    graphs we present an algorithm that requires O ( n · log n ) time, improving the
    previous known O ( n 4 · log( n · W )) bound. We have implemented some of our
    algorithms and show that they present a significant speedup on standard benchmarks.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Rasmus
  full_name: Ibsen-Jensen, Rasmus
  id: 3B699956-F248-11E8-B48F-1D18A9856A87
  last_name: Ibsen-Jensen
  orcid: 0000-0003-4783-0389
- first_name: Andreas
  full_name: Pavlogiannis, Andreas
  id: 49704004-F248-11E8-B48F-1D18A9856A87
  last_name: Pavlogiannis
  orcid: 0000-0002-8943-0722
citation:
  ama: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. <i>Faster Algorithms for Quantitative
    Verification in Constant Treewidth Graphs</i>. IST Austria; 2015. doi:<a href="https://doi.org/10.15479/AT:IST-2015-319-v1-1">10.15479/AT:IST-2015-319-v1-1</a>
  apa: Chatterjee, K., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2015). <i>Faster
    algorithms for quantitative verification in constant treewidth graphs</i>. IST
    Austria. <a href="https://doi.org/10.15479/AT:IST-2015-319-v1-1">https://doi.org/10.15479/AT:IST-2015-319-v1-1</a>
  chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis.
    <i>Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs</i>.
    IST Austria, 2015. <a href="https://doi.org/10.15479/AT:IST-2015-319-v1-1">https://doi.org/10.15479/AT:IST-2015-319-v1-1</a>.
  ieee: K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, <i>Faster algorithms
    for quantitative verification in constant treewidth graphs</i>. IST Austria, 2015.
  ista: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for
    quantitative verification in constant treewidth graphs, IST Austria, 31p.
  mla: Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Quantitative Verification
    in Constant Treewidth Graphs</i>. IST Austria, 2015, doi:<a href="https://doi.org/10.15479/AT:IST-2015-319-v1-1">10.15479/AT:IST-2015-319-v1-1</a>.
  short: K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative
    Verification in Constant Treewidth Graphs, IST Austria, 2015.
date_created: 2018-12-12T11:39:17Z
date_published: 2015-02-10T00:00:00Z
date_updated: 2023-02-23T12:26:22Z
day: '10'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-319-v1-1
file:
- access_level: open_access
  checksum: 62c6ea01e342553dcafb88a070fb1ad5
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:53:21Z
  date_updated: 2020-07-14T12:46:52Z
  file_id: '5482'
  file_name: IST-2015-319-v1+1_long.pdf
  file_size: 1089651
  relation: main_file
file_date_updated: 2020-07-14T12:46:52Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '31'
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '319'
related_material:
  record:
  - id: '1607'
    relation: later_version
    status: public
  - id: '5437'
    relation: later_version
    status: public
status: public
title: Faster algorithms for quantitative verification in constant treewidth graphs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5431'
abstract:
- lang: eng
  text: "We consider finite-state concurrent stochastic games, played by k>=2 players
    for an infinite number of rounds, where in every round, each player simultaneously
    and independently of the other players chooses an action, whereafter the successor
    state is determined by a probability distribution given by the current state and
    the chosen actions. We consider reachability objectives that given a target set
    of states require that some state in the target set is visited, and the dual safety
    objectives that given a target set require that only states in the target set
    are visited. We are interested in the complexity of stationary strategies measured
    by their patience, which is defined as the inverse of the smallest non-zero probability
    employed.\r\n\r\n Our main results are as follows: We show that in two-player
    zero-sum concurrent stochastic games (with reachability objective for one player
    and the complementary safety objective for the other player): (i) the optimal
    bound on the patience of optimal and epsilon-optimal strategies, for both players
    is doubly exponential; and (ii) even in games with a single non-absorbing state
    exponential (in the number of actions) patience is necessary. In general we study
    the class of non-zero-sum games admitting epsilon-Nash equilibria. We show that
    if there is at least one player with reachability objective, then doubly-exponential
    patience is needed in general for epsilon-Nash equilibrium strategies, whereas
    in contrast if all players have safety objectives, then the optimal bound on patience
    for epsilon-Nash equilibrium strategies is only exponential."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Rasmus
  full_name: Ibsen-Jensen, Rasmus
  id: 3B699956-F248-11E8-B48F-1D18A9856A87
  last_name: Ibsen-Jensen
  orcid: 0000-0003-4783-0389
- first_name: Kristoffer
  full_name: Hansen, Kristoffer
  last_name: Hansen
citation:
  ama: Chatterjee K, Ibsen-Jensen R, Hansen K. <i>The Patience of Concurrent Stochastic
    Games with Safety and Reachability Objectives</i>. IST Austria; 2015. doi:<a href="https://doi.org/10.15479/AT:IST-2015-322-v1-1">10.15479/AT:IST-2015-322-v1-1</a>
  apa: Chatterjee, K., Ibsen-Jensen, R., &#38; Hansen, K. (2015). <i>The patience
    of concurrent stochastic games with safety and reachability objectives</i>. IST
    Austria. <a href="https://doi.org/10.15479/AT:IST-2015-322-v1-1">https://doi.org/10.15479/AT:IST-2015-322-v1-1</a>
  chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Kristoffer Hansen. <i>The
    Patience of Concurrent Stochastic Games with Safety and Reachability Objectives</i>.
    IST Austria, 2015. <a href="https://doi.org/10.15479/AT:IST-2015-322-v1-1">https://doi.org/10.15479/AT:IST-2015-322-v1-1</a>.
  ieee: K. Chatterjee, R. Ibsen-Jensen, and K. Hansen, <i>The patience of concurrent
    stochastic games with safety and reachability objectives</i>. IST Austria, 2015.
  ista: Chatterjee K, Ibsen-Jensen R, Hansen K. 2015. The patience of concurrent stochastic
    games with safety and reachability objectives, IST Austria, 25p.
  mla: Chatterjee, Krishnendu, et al. <i>The Patience of Concurrent Stochastic Games
    with Safety and Reachability Objectives</i>. IST Austria, 2015, doi:<a href="https://doi.org/10.15479/AT:IST-2015-322-v1-1">10.15479/AT:IST-2015-322-v1-1</a>.
  short: K. Chatterjee, R. Ibsen-Jensen, K. Hansen, The Patience of Concurrent Stochastic
    Games with Safety and Reachability Objectives, IST Austria, 2015.
date_created: 2018-12-12T11:39:17Z
date_published: 2015-02-19T00:00:00Z
date_updated: 2021-01-12T08:02:13Z
day: '19'
ddc:
- '005'
- '519'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-322-v1-1
file:
- access_level: open_access
  checksum: bfb858262c30445b8e472c40069178a2
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:53:31Z
  date_updated: 2020-07-14T12:46:53Z
  file_id: '5491'
  file_name: IST-2015-322-v1+1_safetygames.pdf
  file_size: 661015
  relation: main_file
file_date_updated: 2020-07-14T12:46:53Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '25'
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '322'
status: public
title: The patience of concurrent stochastic games with safety and reachability objectives
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5432'
abstract:
- lang: eng
  text: "Evolution occurs in populations of reproducing individuals. The structure
    of the population affects the outcome of the evolutionary process. Evolutionary
    graph theory is a powerful approach to study this phenomenon. There are two graphs.
    The interaction graph specifies who interacts with whom in the context of evolution.The
    replacement graph specifies who competes with whom for reproduction. \r\nThe vertices
    of the two graphs are the same, and each vertex corresponds to an individual of
    the population. A key quantity is the fixation probability of a new mutant. It
    is defined as the probability that a newly introduced mutant (on a single vertex)
    generates a lineage of offspring which eventually takes over the entire population
    of resident individuals. The basic computational questions are as follows: (i)
    the qualitative question asks whether the fixation probability is positive; and
    (ii) the quantitative approximation question asks for an approximation of the
    fixation probability. \r\nOur main results are:\r\n(1) We show that the qualitative
    question is NP-complete and the quantitative approximation question is #P-hard
    in the special case when the interaction and the replacement graphs coincide and
    even with the restriction that the resident individuals do not reproduce (which
    corresponds to an invading population taking over an empty structure).\r\n(2)
    We show that in general the qualitative question is PSPACE-complete and the quantitative
    approximation question is PSPACE-hard and can be solved in exponential time.\r\n"
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Rasmus
  full_name: Ibsen-Jensen, Rasmus
  id: 3B699956-F248-11E8-B48F-1D18A9856A87
  last_name: Ibsen-Jensen
  orcid: 0000-0003-4783-0389
- first_name: Martin
  full_name: Nowak, Martin
  last_name: Nowak
citation:
  ama: Chatterjee K, Ibsen-Jensen R, Nowak M. <i>The Complexity of Evolutionary Games
    on Graphs</i>. IST Austria; 2015. doi:<a href="https://doi.org/10.15479/AT:IST-2015-323-v1-1">10.15479/AT:IST-2015-323-v1-1</a>
  apa: Chatterjee, K., Ibsen-Jensen, R., &#38; Nowak, M. (2015). <i>The complexity
    of evolutionary games on graphs</i>. IST Austria. <a href="https://doi.org/10.15479/AT:IST-2015-323-v1-1">https://doi.org/10.15479/AT:IST-2015-323-v1-1</a>
  chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. <i>The Complexity
    of Evolutionary Games on Graphs</i>. IST Austria, 2015. <a href="https://doi.org/10.15479/AT:IST-2015-323-v1-1">https://doi.org/10.15479/AT:IST-2015-323-v1-1</a>.
  ieee: K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, <i>The complexity of evolutionary
    games on graphs</i>. IST Austria, 2015.
  ista: Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary
    games on graphs, IST Austria, 29p.
  mla: Chatterjee, Krishnendu, et al. <i>The Complexity of Evolutionary Games on Graphs</i>.
    IST Austria, 2015, doi:<a href="https://doi.org/10.15479/AT:IST-2015-323-v1-1">10.15479/AT:IST-2015-323-v1-1</a>.
  short: K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary
    Games on Graphs, IST Austria, 2015.
date_created: 2018-12-12T11:39:18Z
date_published: 2015-02-19T00:00:00Z
date_updated: 2023-02-23T12:26:33Z
day: '19'
ddc:
- '005'
- '576'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-323-v1-1
file:
- access_level: open_access
  checksum: 546c1b291d545e7b24aaaf4199dac671
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:53:57Z
  date_updated: 2020-07-14T12:46:53Z
  file_id: '5519'
  file_name: IST-2015-323-v1+1_main.pdf
  file_size: 576347
  relation: main_file
file_date_updated: 2020-07-14T12:46:53Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '29'
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '323'
related_material:
  record:
  - id: '5421'
    relation: earlier_version
    status: public
  - id: '5440'
    relation: later_version
    status: public
status: public
title: The complexity of evolutionary games on graphs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
