---
_id: '2056'
abstract:
- lang: eng
  text: 'We consider a continuous-time Markov chain (CTMC) whose state space is partitioned
    into aggregates, and each aggregate is assigned a probability measure. A sufficient
    condition for defining a CTMC over the aggregates is presented as a variant of
    weak lumpability, which also characterizes that the measure over the original
    process can be recovered from that of the aggregated one. We show how the applicability
    of de-aggregation depends on the initial distribution. The application section
    is devoted to illustrate how the developed theory aids in reducing CTMC models
    of biochemical systems particularly in connection to protein-protein interactions.
    We assume that the model is written by a biologist in form of site-graph-rewrite
    rules. Site-graph-rewrite rules compactly express that, often, only a local context
    of a protein (instead of a full molecular species) needs to be in a certain configuration
    in order to trigger a reaction event. This observation leads to suitable aggregate
    Markov chains with smaller state spaces, thereby providing sufficient reduction
    in computational complexity. This is further exemplified in two case studies:
    simple unbounded polymerization and early EGFR/insulin crosstalk.'
acknowledgement: T. Petrov is supported by SystemsX.ch—the Swiss Inititative for Systems
  Biology.
author:
- first_name: Arnab
  full_name: Ganguly, Arnab
  last_name: Ganguly
- first_name: Tatjana
  full_name: Petrov, Tatjana
  id: 3D5811FC-F248-11E8-B48F-1D18A9856A87
  last_name: Petrov
  orcid: 0000-0002-9041-0905
- first_name: Heinz
  full_name: Koeppl, Heinz
  last_name: Koeppl
citation:
  ama: Ganguly A, Petrov T, Koeppl H. Markov chain aggregation and its applications
    to combinatorial reaction networks. <i>Journal of Mathematical Biology</i>. 2014;69(3):767-797.
    doi:<a href="https://doi.org/10.1007/s00285-013-0738-7">10.1007/s00285-013-0738-7</a>
  apa: Ganguly, A., Petrov, T., &#38; Koeppl, H. (2014). Markov chain aggregation
    and its applications to combinatorial reaction networks. <i>Journal of Mathematical
    Biology</i>. Springer. <a href="https://doi.org/10.1007/s00285-013-0738-7">https://doi.org/10.1007/s00285-013-0738-7</a>
  chicago: Ganguly, Arnab, Tatjana Petrov, and Heinz Koeppl. “Markov Chain Aggregation
    and Its Applications to Combinatorial Reaction Networks.” <i>Journal of Mathematical
    Biology</i>. Springer, 2014. <a href="https://doi.org/10.1007/s00285-013-0738-7">https://doi.org/10.1007/s00285-013-0738-7</a>.
  ieee: A. Ganguly, T. Petrov, and H. Koeppl, “Markov chain aggregation and its applications
    to combinatorial reaction networks,” <i>Journal of Mathematical Biology</i>, vol.
    69, no. 3. Springer, pp. 767–797, 2014.
  ista: Ganguly A, Petrov T, Koeppl H. 2014. Markov chain aggregation and its applications
    to combinatorial reaction networks. Journal of Mathematical Biology. 69(3), 767–797.
  mla: Ganguly, Arnab, et al. “Markov Chain Aggregation and Its Applications to Combinatorial
    Reaction Networks.” <i>Journal of Mathematical Biology</i>, vol. 69, no. 3, Springer,
    2014, pp. 767–97, doi:<a href="https://doi.org/10.1007/s00285-013-0738-7">10.1007/s00285-013-0738-7</a>.
  short: A. Ganguly, T. Petrov, H. Koeppl, Journal of Mathematical Biology 69 (2014)
    767–797.
date_created: 2018-12-11T11:55:28Z
date_published: 2014-11-20T00:00:00Z
date_updated: 2021-01-12T06:55:01Z
day: '20'
department:
- _id: CaGu
- _id: ToHe
doi: 10.1007/s00285-013-0738-7
intvolume: '        69'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1303.4532
month: '11'
oa: 1
oa_version: Submitted Version
page: 767 - 797
publication: Journal of Mathematical Biology
publication_status: published
publisher: Springer
publist_id: '4990'
quality_controlled: '1'
scopus_import: 1
status: public
title: Markov chain aggregation and its applications to combinatorial reaction networks
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 69
year: '2014'
...
---
_id: '2057'
abstract:
- lang: eng
  text: 'In the past few years, a lot of attention has been devoted to multimedia
    indexing by fusing multimodal informations. Two kinds of fusion schemes are generally
    considered: The early fusion and the late fusion. We focus on late classifier
    fusion, where one combines the scores of each modality at the decision level.
    To tackle this problem, we investigate a recent and elegant well-founded quadratic
    program named MinCq coming from the machine learning PAC-Bayesian theory. MinCq
    looks for the weighted combination, over a set of real-valued functions seen as
    voters, leading to the lowest misclassification rate, while maximizing the voters’
    diversity. We propose an extension of MinCq tailored to multimedia indexing. Our
    method is based on an order-preserving pairwise loss adapted to ranking that allows
    us to improve Mean Averaged Precision measure while taking into account the diversity
    of the voters that we want to fuse. We provide evidence that this method is naturally
    adapted to late fusion procedures and confirm the good behavior of our approach
    on the challenging PASCAL VOC’07 benchmark.'
alternative_title:
- LNCS
arxiv: 1
author:
- first_name: Emilie
  full_name: Morvant, Emilie
  id: 4BAC2A72-F248-11E8-B48F-1D18A9856A87
  last_name: Morvant
  orcid: 0000-0002-8301-7240
- first_name: Amaury
  full_name: Habrard, Amaury
  last_name: Habrard
- first_name: Stéphane
  full_name: Ayache, Stéphane
  last_name: Ayache
citation:
  ama: 'Morvant E, Habrard A, Ayache S. Majority vote of diverse classifiers for late
    fusion. In: <i>Lecture Notes in Computer Science (Including Subseries Lecture
    Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol
    8621. Springer; 2014:153-162. doi:<a href="https://doi.org/10.1007/978-3-662-44415-3_16">10.1007/978-3-662-44415-3_16</a>'
  apa: 'Morvant, E., Habrard, A., &#38; Ayache, S. (2014). Majority vote of diverse
    classifiers for late fusion. In <i>Lecture Notes in Computer Science (including
    subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>
    (Vol. 8621, pp. 153–162). Joensuu, Finland: Springer. <a href="https://doi.org/10.1007/978-3-662-44415-3_16">https://doi.org/10.1007/978-3-662-44415-3_16</a>'
  chicago: Morvant, Emilie, Amaury Habrard, and Stéphane Ayache. “Majority Vote of
    Diverse Classifiers for Late Fusion.” In <i>Lecture Notes in Computer Science
    (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes
    in Bioinformatics)</i>, 8621:153–62. Springer, 2014. <a href="https://doi.org/10.1007/978-3-662-44415-3_16">https://doi.org/10.1007/978-3-662-44415-3_16</a>.
  ieee: E. Morvant, A. Habrard, and S. Ayache, “Majority vote of diverse classifiers
    for late fusion,” in <i>Lecture Notes in Computer Science (including subseries
    Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>,
    Joensuu, Finland, 2014, vol. 8621, pp. 153–162.
  ista: 'Morvant E, Habrard A, Ayache S. 2014. Majority vote of diverse classifiers
    for late fusion. Lecture Notes in Computer Science (including subseries Lecture
    Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). IAPR: International
    Workshop on Structural, Syntactic, and Statistical Pattern Recognition, LNCS,
    vol. 8621, 153–162.'
  mla: Morvant, Emilie, et al. “Majority Vote of Diverse Classifiers for Late Fusion.”
    <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial
    Intelligence and Lecture Notes in Bioinformatics)</i>, vol. 8621, Springer, 2014,
    pp. 153–62, doi:<a href="https://doi.org/10.1007/978-3-662-44415-3_16">10.1007/978-3-662-44415-3_16</a>.
  short: E. Morvant, A. Habrard, S. Ayache, in:, Lecture Notes in Computer Science
    (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes
    in Bioinformatics), Springer, 2014, pp. 153–162.
conference:
  end_date: 2014-08-22
  location: Joensuu, Finland
  name: 'IAPR: International Workshop on Structural, Syntactic, and Statistical Pattern
    Recognition'
  start_date: 2014-08-20
date_created: 2018-12-11T11:55:28Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:55:01Z
day: '01'
department:
- _id: ChLa
doi: 10.1007/978-3-662-44415-3_16
ec_funded: 1
external_id:
  arxiv:
  - '1404.7796'
intvolume: '      8621'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1404.7796
month: '01'
oa: 1
oa_version: Preprint
page: 153 - 162
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '308036'
  name: Lifelong Learning of Visual Scene Understanding
publication: Lecture Notes in Computer Science (including subseries Lecture Notes
  in Artificial Intelligence and Lecture Notes in Bioinformatics)
publication_status: published
publisher: Springer
publist_id: '4989'
quality_controlled: '1'
scopus_import: 1
status: public
title: Majority vote of diverse classifiers for late fusion
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8621
year: '2014'
...
---
_id: '2058'
abstract:
- lang: eng
  text: We present a method for smoothly blending between existing liquid animations.
    We introduce a semi-automatic method for matching two existing liquid animations,
    which we use to create new fluid motion that plausibly interpolates the input.
    Our contributions include a new space-time non-rigid iterative closest point algorithm
    that incorporates user guidance, a subsampling technique for efficient registration
    of meshes with millions of vertices, and a fast surface extraction algorithm that
    produces 3D triangle meshes from a 4D space-time surface. Our technique can be
    used to instantly create hundreds of new simulations, or to interactively explore
    complex parameter spaces. Our method is guaranteed to produce output that does
    not deviate from the input animations, and it generalizes to multiple dimensions.
    Because our method runs at interactive rates after the initial precomputation
    step, it has potential applications in games and training simulations.
article_number: '137'
article_processing_charge: No
author:
- first_name: Karthik
  full_name: Raveendran, Karthik
  last_name: Raveendran
- first_name: Christopher J
  full_name: Wojtan, Christopher J
  id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
  last_name: Wojtan
  orcid: 0000-0001-6646-5546
- first_name: Nils
  full_name: Thuerey, Nils
  last_name: Thuerey
- first_name: Greg
  full_name: Türk, Greg
  last_name: Türk
citation:
  ama: 'Raveendran K, Wojtan C, Thuerey N, Türk G. Blending liquids. In: <i>ACM Transactions
    on Graphics</i>. Vol 33. ACM; 2014. doi:<a href="https://doi.org/10.1145/2601097.2601126">10.1145/2601097.2601126</a>'
  apa: 'Raveendran, K., Wojtan, C., Thuerey, N., &#38; Türk, G. (2014). Blending liquids.
    In <i>ACM Transactions on Graphics</i> (Vol. 33). Vancouver, Canada: ACM. <a href="https://doi.org/10.1145/2601097.2601126">https://doi.org/10.1145/2601097.2601126</a>'
  chicago: Raveendran, Karthik, Chris Wojtan, Nils Thuerey, and Greg Türk. “Blending
    Liquids.” In <i>ACM Transactions on Graphics</i>, Vol. 33. ACM, 2014. <a href="https://doi.org/10.1145/2601097.2601126">https://doi.org/10.1145/2601097.2601126</a>.
  ieee: K. Raveendran, C. Wojtan, N. Thuerey, and G. Türk, “Blending liquids,” in
    <i>ACM Transactions on Graphics</i>, Vancouver, Canada, 2014, vol. 33, no. 4.
  ista: 'Raveendran K, Wojtan C, Thuerey N, Türk G. 2014. Blending liquids. ACM Transactions
    on Graphics. SIGGRAPH: International Conference and Exhibition on Computer Graphics
    and Interactive Techniques vol. 33, 137.'
  mla: Raveendran, Karthik, et al. “Blending Liquids.” <i>ACM Transactions on Graphics</i>,
    vol. 33, no. 4, 137, ACM, 2014, doi:<a href="https://doi.org/10.1145/2601097.2601126">10.1145/2601097.2601126</a>.
  short: K. Raveendran, C. Wojtan, N. Thuerey, G. Türk, in:, ACM Transactions on Graphics,
    ACM, 2014.
conference:
  end_date: 2014-08-14
  location: Vancouver, Canada
  name: 'SIGGRAPH: International Conference and Exhibition on Computer Graphics and
    Interactive Techniques'
  start_date: 2014-08-10
date_created: 2018-12-11T11:55:28Z
date_published: 2014-07-01T00:00:00Z
date_updated: 2022-08-25T14:02:46Z
day: '01'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/2601097.2601126
file:
- access_level: open_access
  checksum: 1752760a2e71e254537f31c0d10d9c6c
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:08:27Z
  date_updated: 2020-07-14T12:45:27Z
  file_id: '4688'
  file_name: IST-2016-606-v1+1_BlendingLiquids-Preprint.pdf
  file_size: 8387384
  relation: main_file
file_date_updated: 2020-07-14T12:45:27Z
has_accepted_license: '1'
intvolume: '        33'
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 25636330-B435-11E9-9278-68D0E5697425
  grant_number: 11-NSF-1070
  name: ROOTS Genome-wide Analysis of Root Traits
publication: ACM Transactions on Graphics
publication_status: published
publisher: ACM
publist_id: '4988'
pubrep_id: '606'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Blending liquids
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2014'
...
---
_id: '2059'
abstract:
- lang: eng
  text: Plant embryogenesis is regulated by differential distribution of the plant
    hormone auxin. However, the cells establishing these gradients during microspore
    embryogenesis remain to be identified. For the first time, we describe, using
    the DR5 or DR5rev reporter gene systems, the GFP- and GUS-based auxin biosensors
    to monitor auxin during Brassica napus androgenesis at cellular resolution in
    the initial stages. Our study provides evidence that the distribution of auxin
    changes during embryo development and depends on the temperature-inducible in
    vitro culture conditions. For this, microspores (mcs) were induced to embryogenesis
    by heat treatment and then subjected to genetic modification via Agrobacterium
    tumefaciens. The duration of high temperature treatment had a significant influence
    on auxin distribution in isolated and in vitro-cultured microspores and on microspore-derived
    embryo development. In the “mild” heat-treated (1 day at 32 °C) mcs, auxin localized
    in a polar way already at the uni-nucleate microspore, which was critical for
    the initiation of embryos with suspensor-like structure. Assuming a mean mcs radius
    of 20 μm, endogenous auxin content in a single cell corresponded to concentration
    of 1.01 μM. In mcs subjected to a prolonged heat (5 days at 32 °C), although auxin
    concentration increased dozen times, auxin polarization was set up at a few-celled
    pro-embryos without suspensor. Those embryos were enclosed in the outer wall called
    the exine. The exine rupture was accompanied by the auxin gradient polarization.
    Relative quantitative estimation of auxin, using time-lapse imaging, revealed
    that primordia possess up to 1.3-fold higher amounts than those found in the root
    apices of transgenic MDEs in the presence of exogenous auxin. Our results show,
    for the first time, which concentration of endogenous auxin coincides with the
    first cell division and how the high temperature interplays with auxin, by what
    affects delay early establishing microspore polarity. Moreover, we present how
    the local auxin accumulation demonstrates the apical–basal axis formation of the
    androgenic embryo and directs the axiality of the adult haploid plant.
acknowledgement: The research was supported by the IPP PAS-IPGB SAS bilateral project
  (“Molecular analysis of auxin distribution in oilseed androgenic embryos”), IPP
  PAS-FWO VIB bilateral project (“Auxin as signaling molecule in doubled haploid production
  of rape (B. napus var. oleifera)”), individual national research project 2011/01/D/NZ9/02547,
  and VEGA 2-0090-14.
author:
- first_name: Ewa
  full_name: Dubas, Ewa
  last_name: Dubas
- first_name: Jana
  full_name: Moravčíková, Jana
  last_name: Moravčíková
- first_name: Jana
  full_name: Libantová, Jana
  last_name: Libantová
- first_name: Ildikó
  full_name: Matušíková, Ildikó
  last_name: Matušíková
- first_name: Eva
  full_name: Benková, Eva
  id: 38F4F166-F248-11E8-B48F-1D18A9856A87
  last_name: Benková
  orcid: 0000-0002-8510-9739
- first_name: Iwona
  full_name: Zur, Iwona
  last_name: Zur
- first_name: Monika
  full_name: Krzewska, Monika
  last_name: Krzewska
citation:
  ama: Dubas E, Moravčíková J, Libantová J, et al. The influence of heat stress on
    auxin distribution in transgenic B napus microspores and microspore derived embryos.
    <i>Protoplasma</i>. 2014;251(5):1077-1087. doi:<a href="https://doi.org/10.1007/s00709-014-0616-1">10.1007/s00709-014-0616-1</a>
  apa: Dubas, E., Moravčíková, J., Libantová, J., Matušíková, I., Benková, E., Zur,
    I., &#38; Krzewska, M. (2014). The influence of heat stress on auxin distribution
    in transgenic B napus microspores and microspore derived embryos. <i>Protoplasma</i>.
    Springer. <a href="https://doi.org/10.1007/s00709-014-0616-1">https://doi.org/10.1007/s00709-014-0616-1</a>
  chicago: Dubas, Ewa, Jana Moravčíková, Jana Libantová, Ildikó Matušíková, Eva Benková,
    Iwona Zur, and Monika Krzewska. “The Influence of Heat Stress on Auxin Distribution
    in Transgenic B Napus Microspores and Microspore Derived Embryos.” <i>Protoplasma</i>.
    Springer, 2014. <a href="https://doi.org/10.1007/s00709-014-0616-1">https://doi.org/10.1007/s00709-014-0616-1</a>.
  ieee: E. Dubas <i>et al.</i>, “The influence of heat stress on auxin distribution
    in transgenic B napus microspores and microspore derived embryos,” <i>Protoplasma</i>,
    vol. 251, no. 5. Springer, pp. 1077–1087, 2014.
  ista: Dubas E, Moravčíková J, Libantová J, Matušíková I, Benková E, Zur I, Krzewska
    M. 2014. The influence of heat stress on auxin distribution in transgenic B napus
    microspores and microspore derived embryos. Protoplasma. 251(5), 1077–1087.
  mla: Dubas, Ewa, et al. “The Influence of Heat Stress on Auxin Distribution in Transgenic
    B Napus Microspores and Microspore Derived Embryos.” <i>Protoplasma</i>, vol.
    251, no. 5, Springer, 2014, pp. 1077–87, doi:<a href="https://doi.org/10.1007/s00709-014-0616-1">10.1007/s00709-014-0616-1</a>.
  short: E. Dubas, J. Moravčíková, J. Libantová, I. Matušíková, E. Benková, I. Zur,
    M. Krzewska, Protoplasma 251 (2014) 1077–1087.
date_created: 2018-12-11T11:55:29Z
date_published: 2014-02-20T00:00:00Z
date_updated: 2021-01-12T06:55:02Z
day: '20'
ddc:
- '580'
department:
- _id: EvBe
doi: 10.1007/s00709-014-0616-1
file:
- access_level: open_access
  checksum: d570a6073765118fc0bb83c31d96fa53
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:18:31Z
  date_updated: 2020-07-14T12:45:27Z
  file_id: '5353'
  file_name: IST-2015-394-v1+1_s00709-014-0616-1.pdf
  file_size: 6377990
  relation: main_file
file_date_updated: 2020-07-14T12:45:27Z
has_accepted_license: '1'
intvolume: '       251'
issue: '5'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '02'
oa: 1
oa_version: Published Version
page: 1077 - 1087
publication: Protoplasma
publication_status: published
publisher: Springer
publist_id: '4987'
pubrep_id: '394'
quality_controlled: '1'
scopus_import: 1
status: public
title: The influence of heat stress on auxin distribution in transgenic B napus microspores
  and microspore derived embryos
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: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 251
year: '2014'
...
---
_id: '2062'
abstract:
- lang: eng
  text: The success story of fast-spiking, parvalbumin-positive (PV+) GABAergic interneurons
    (GABA, γ-aminobutyric acid) in the mammalian central nervous system is noteworthy.
    In 1995, the properties of these interneurons were completely unknown. Twenty
    years later, thanks to the massive use of subcellular patch-clamp techniques,
    simultaneous multiple-cell recording, optogenetics, in vivo measurements, and
    computational approaches, our knowledge about PV+ interneurons became more extensive
    than for several types of pyramidal neurons. These findings have implications
    beyond the “small world” of basic research on GABAergic cells. For example, the
    results provide a first proof of principle that neuroscientists might be able
    to close the gaps between the molecular, cellular, network, and behavioral levels,
    representing one of the main challenges at the present time. Furthermore, the
    results may form the basis for PV+ interneurons as therapeutic targets for brain
    disease in the future. However, much needs to be learned about the basic function
    of these interneurons before clinical neuroscientists will be able to use PV+
    interneurons for therapeutic purposes.
article_number: '1255263'
author:
- first_name: Hua
  full_name: Hu, Hua
  id: 4AC0145C-F248-11E8-B48F-1D18A9856A87
  last_name: Hu
- first_name: Jian
  full_name: Gan, Jian
  id: 3614E438-F248-11E8-B48F-1D18A9856A87
  last_name: Gan
- first_name: Peter M
  full_name: Jonas, Peter M
  id: 353C1B58-F248-11E8-B48F-1D18A9856A87
  last_name: Jonas
  orcid: 0000-0001-5001-4804
citation:
  ama: 'Hu H, Gan J, Jonas PM. Fast-spiking parvalbumin^+ GABAergic interneurons:
    From cellular design to microcircuit function. <i>Science</i>. 2014;345(6196).
    doi:<a href="https://doi.org/10.1126/science.1255263">10.1126/science.1255263</a>'
  apa: 'Hu, H., Gan, J., &#38; Jonas, P. M. (2014). Fast-spiking parvalbumin^+ GABAergic
    interneurons: From cellular design to microcircuit function. <i>Science</i>. American
    Association for the Advancement of Science. <a href="https://doi.org/10.1126/science.1255263">https://doi.org/10.1126/science.1255263</a>'
  chicago: 'Hu, Hua, Jian Gan, and Peter M Jonas. “Fast-Spiking Parvalbumin^+ GABAergic
    Interneurons: From Cellular Design to Microcircuit Function.” <i>Science</i>.
    American Association for the Advancement of Science, 2014. <a href="https://doi.org/10.1126/science.1255263">https://doi.org/10.1126/science.1255263</a>.'
  ieee: 'H. Hu, J. Gan, and P. M. Jonas, “Fast-spiking parvalbumin^+ GABAergic interneurons:
    From cellular design to microcircuit function,” <i>Science</i>, vol. 345, no.
    6196. American Association for the Advancement of Science, 2014.'
  ista: 'Hu H, Gan J, Jonas PM. 2014. Fast-spiking parvalbumin^+ GABAergic interneurons:
    From cellular design to microcircuit function. Science. 345(6196), 1255263.'
  mla: 'Hu, Hua, et al. “Fast-Spiking Parvalbumin^+ GABAergic Interneurons: From Cellular
    Design to Microcircuit Function.” <i>Science</i>, vol. 345, no. 6196, 1255263,
    American Association for the Advancement of Science, 2014, doi:<a href="https://doi.org/10.1126/science.1255263">10.1126/science.1255263</a>.'
  short: H. Hu, J. Gan, P.M. Jonas, Science 345 (2014).
date_created: 2018-12-11T11:55:29Z
date_published: 2014-08-01T00:00:00Z
date_updated: 2021-01-12T06:55:03Z
day: '01'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1126/science.1255263
ec_funded: 1
file:
- access_level: open_access
  checksum: a0036a589037d37e86364fa25cc0a82f
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:16:00Z
  date_updated: 2020-07-14T12:45:27Z
  file_id: '5185'
  file_name: IST-2017-821-v1+1_1255263JonasPVReviewTextR_Final.pdf
  file_size: 215514
  relation: main_file
- access_level: open_access
  checksum: e1f57d2713725449cb898fdcb8ef47b8
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:16:01Z
  date_updated: 2020-07-14T12:45:27Z
  file_id: '5186'
  file_name: IST-2017-821-v1+2_1255263JonasPVReviewFigures_Final.pdf
  file_size: 1732723
  relation: main_file
file_date_updated: 2020-07-14T12:45:27Z
has_accepted_license: '1'
intvolume: '       345'
issue: '6196'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
project:
- _id: 25C26B1E-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P24909-B24
  name: Mechanisms of transmitter release at GABAergic synapses
- _id: 25C0F108-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '268548'
  name: Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons
publication: Science
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '4984'
pubrep_id: '821'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Fast-spiking parvalbumin^+ GABAergic interneurons: From cellular design to
  microcircuit function'
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 345
year: '2014'
...
---
_id: '2064'
abstract:
- lang: eng
  text: We examined the synaptic structure, quantity, and distribution of α-amino-3-hydroxy-5-methylisoxazole-4-propionic
    acid (AMPA)- and N-methyl-D-aspartate (NMDA)-type glutamate receptors (AMPARs
    and NMDARs, respectively) in rat cochlear nuclei by a highly sensitive freeze-fracture
    replica labeling technique. Four excitatory synapses formed by two distinct inputs,
    auditory nerve (AN) and parallel fibers (PF), on different cell types were analyzed.
    These excitatory synapse types included AN synapses on bushy cells (AN-BC synapses)
    and fusiform cells (AN-FC synapses) and PF synapses on FC (PF-FC synapses) and
    cartwheel cell spines (PF-CwC synapses). Immunogold labeling revealed differences
    in synaptic structure as well as AMPAR and NMDAR number and/or density in both
    AN and PF synapses, indicating a target-dependent organization. The immunogold
    receptor labeling also identified differences in the synaptic organization of
    FCs based on AN or PF connections, indicating an input-dependent organization
    in FCs. Among the four excitatory synapse types, the AN-BC synapses were the smallest
    and had the most densely packed intramembrane particles (IMPs), whereas the PF-CwC
    synapses were the largest and had sparsely packed IMPs. All four synapse types
    showed positive correlations between the IMP-cluster area and the AMPAR number,
    indicating a common intrasynapse-type relationship for glutamatergic synapses.
    Immunogold particles for AMPARs were distributed over the entire area of individual
    AN synapses; PF synapses often showed synaptic areas devoid of labeling. The gold-labeling
    for NMDARs occurred in a mosaic fashion, with less positive correlations between
    the IMP-cluster area and the NMDAR number. Our observations reveal target- and
    input-dependent features in the structure, number, and organization of AMPARs
    and NMDARs in AN and PF synapses.
acknowledgement: "National Institutes of Health (NIH) Grant Number: 1R01DC013048‐0;
  Biotechnology and Biological Sciences Research Council, UK Grant Number: BB/J015938/1\r\n"
author:
- first_name: Maía
  full_name: Rubio, Maía
  last_name: Rubio
- first_name: Yugo
  full_name: Fukazawa, Yugo
  last_name: Fukazawa
- first_name: Naomi
  full_name: Kamasawa, Naomi
  last_name: Kamasawa
- first_name: Cheryl
  full_name: Clarkson, Cheryl
  last_name: Clarkson
- first_name: Elek
  full_name: Molnár, Elek
  last_name: Molnár
- first_name: Ryuichi
  full_name: Shigemoto, Ryuichi
  id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
  last_name: Shigemoto
  orcid: 0000-0001-8761-9444
citation:
  ama: Rubio M, Fukazawa Y, Kamasawa N, Clarkson C, Molnár E, Shigemoto R. Target-
    and input-dependent organization of AMPA and NMDA receptors in synaptic connections
    of the cochlear nucleus. <i>Journal of Comparative Neurology</i>. 2014;522(18):4023-4042.
    doi:<a href="https://doi.org/10.1002/cne.23654">10.1002/cne.23654</a>
  apa: Rubio, M., Fukazawa, Y., Kamasawa, N., Clarkson, C., Molnár, E., &#38; Shigemoto,
    R. (2014). Target- and input-dependent organization of AMPA and NMDA receptors
    in synaptic connections of the cochlear nucleus. <i>Journal of Comparative Neurology</i>.
    Wiley-Blackwell. <a href="https://doi.org/10.1002/cne.23654">https://doi.org/10.1002/cne.23654</a>
  chicago: Rubio, Maía, Yugo Fukazawa, Naomi Kamasawa, Cheryl Clarkson, Elek Molnár,
    and Ryuichi Shigemoto. “Target- and Input-Dependent Organization of AMPA and NMDA
    Receptors in Synaptic Connections of the Cochlear Nucleus.” <i>Journal of Comparative
    Neurology</i>. Wiley-Blackwell, 2014. <a href="https://doi.org/10.1002/cne.23654">https://doi.org/10.1002/cne.23654</a>.
  ieee: M. Rubio, Y. Fukazawa, N. Kamasawa, C. Clarkson, E. Molnár, and R. Shigemoto,
    “Target- and input-dependent organization of AMPA and NMDA receptors in synaptic
    connections of the cochlear nucleus,” <i>Journal of Comparative Neurology</i>,
    vol. 522, no. 18. Wiley-Blackwell, pp. 4023–4042, 2014.
  ista: Rubio M, Fukazawa Y, Kamasawa N, Clarkson C, Molnár E, Shigemoto R. 2014.
    Target- and input-dependent organization of AMPA and NMDA receptors in synaptic
    connections of the cochlear nucleus. Journal of Comparative Neurology. 522(18),
    4023–4042.
  mla: Rubio, Maía, et al. “Target- and Input-Dependent Organization of AMPA and NMDA
    Receptors in Synaptic Connections of the Cochlear Nucleus.” <i>Journal of Comparative
    Neurology</i>, vol. 522, no. 18, Wiley-Blackwell, 2014, pp. 4023–42, doi:<a href="https://doi.org/10.1002/cne.23654">10.1002/cne.23654</a>.
  short: M. Rubio, Y. Fukazawa, N. Kamasawa, C. Clarkson, E. Molnár, R. Shigemoto,
    Journal of Comparative Neurology 522 (2014) 4023–4042.
date_created: 2018-12-11T11:55:30Z
date_published: 2014-07-29T00:00:00Z
date_updated: 2021-01-12T06:55:05Z
day: '29'
department:
- _id: RySh
doi: 10.1002/cne.23654
intvolume: '       522'
issue: '18'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4198489/
month: '07'
oa: 1
oa_version: Submitted Version
page: 4023 - 4042
publication: Journal of Comparative Neurology
publication_status: published
publisher: Wiley-Blackwell
publist_id: '4974'
quality_controlled: '1'
scopus_import: 1
status: public
title: Target- and input-dependent organization of AMPA and NMDA receptors in synaptic
  connections of the cochlear nucleus
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 522
year: '2014'
...
---
_id: '13402'
abstract:
- lang: eng
  text: Nanoporous frameworks are polymeric materials built from rigid molecules,
    which give rise to their nanoporous structures with applications in gas sorption
    and storage, catalysis and others. Conceptually new applications could emerge,
    should these beneficial properties be manipulated by external stimuli in a reversible
    manner. One approach to render nanoporous frameworks responsive to external signals
    would be to immobilize molecular switches within their nanopores. Although the
    majority of molecular switches require conformational freedom to isomerize, and
    switching in the solid state is prohibited, the nanopores may provide enough room
    for the switches to efficiently isomerize. Here we describe two families of nanoporous
    materials incorporating the spiropyran molecular switch. These materials exhibit
    a variety of interesting properties, including reversible photochromism and acidochromism
    under solvent-free conditions, light-controlled capture and release of metal ions,
    as well reversible chromism induced by solvation/desolvation.
article_number: '3588'
article_processing_charge: No
article_type: original
author:
- first_name: Pintu K.
  full_name: Kundu, Pintu K.
  last_name: Kundu
- first_name: Gregory L.
  full_name: Olsen, Gregory L.
  last_name: Olsen
- first_name: Vladimir
  full_name: Kiss, Vladimir
  last_name: Kiss
- first_name: Rafal
  full_name: Klajn, Rafal
  id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
  last_name: Klajn
citation:
  ama: Kundu PK, Olsen GL, Kiss V, Klajn R. Nanoporous frameworks exhibiting multiple
    stimuli responsiveness. <i>Nature Communications</i>. 2014;5. doi:<a href="https://doi.org/10.1038/ncomms4588">10.1038/ncomms4588</a>
  apa: Kundu, P. K., Olsen, G. L., Kiss, V., &#38; Klajn, R. (2014). Nanoporous frameworks
    exhibiting multiple stimuli responsiveness. <i>Nature Communications</i>. Springer
    Nature. <a href="https://doi.org/10.1038/ncomms4588">https://doi.org/10.1038/ncomms4588</a>
  chicago: Kundu, Pintu K., Gregory L. Olsen, Vladimir Kiss, and Rafal Klajn. “Nanoporous
    Frameworks Exhibiting Multiple Stimuli Responsiveness.” <i>Nature Communications</i>.
    Springer Nature, 2014. <a href="https://doi.org/10.1038/ncomms4588">https://doi.org/10.1038/ncomms4588</a>.
  ieee: P. K. Kundu, G. L. Olsen, V. Kiss, and R. Klajn, “Nanoporous frameworks exhibiting
    multiple stimuli responsiveness,” <i>Nature Communications</i>, vol. 5. Springer
    Nature, 2014.
  ista: Kundu PK, Olsen GL, Kiss V, Klajn R. 2014. Nanoporous frameworks exhibiting
    multiple stimuli responsiveness. Nature Communications. 5, 3588.
  mla: Kundu, Pintu K., et al. “Nanoporous Frameworks Exhibiting Multiple Stimuli
    Responsiveness.” <i>Nature Communications</i>, vol. 5, 3588, Springer Nature,
    2014, doi:<a href="https://doi.org/10.1038/ncomms4588">10.1038/ncomms4588</a>.
  short: P.K. Kundu, G.L. Olsen, V. Kiss, R. Klajn, Nature Communications 5 (2014).
date_created: 2023-08-01T09:46:27Z
date_published: 2014-04-07T00:00:00Z
date_updated: 2023-08-08T07:28:10Z
day: '07'
doi: 10.1038/ncomms4588
extern: '1'
external_id:
  pmid:
  - '24709950'
intvolume: '         5'
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/ncomms4588
month: '04'
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: Nanoporous frameworks exhibiting multiple stimuli responsiveness
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2014'
...
---
_id: '13404'
abstract:
- lang: eng
  text: In the past few years, spiropyran has emerged as the molecule-of-choice for
    the construction of novel dynamic materials. This unique molecular switch undergoes
    structural isomerisation in response to a variety of orthogonal stimuli, e.g.
    light, temperature, metal ions, redox potential, and mechanical stress. Incorporation
    of this switch onto macromolecular supports or inorganic scaffolds allows for
    the creation of robust dynamic materials. This review discusses the synthesis,
    switching conditions, and use of dynamic materials in which spiropyran has been
    attached to the surfaces of polymers, biomacromolecules, inorganic nanoparticles,
    as well as solid surfaces. The resulting materials show fascinating properties
    whereby the state of the switch intimately affects a multitude of useful properties
    of the support. The utility of the spiropyran switch will undoubtedly endow these
    materials with far-reaching applications in the near future.
article_processing_charge: No
article_type: original
author:
- first_name: Rafal
  full_name: Klajn, Rafal
  id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
  last_name: Klajn
citation:
  ama: Klajn R. Spiropyran-based dynamic materials. <i>Chemical Society Reviews</i>.
    2014;43(1):148-184. doi:<a href="https://doi.org/10.1039/c3cs60181a">10.1039/c3cs60181a</a>
  apa: Klajn, R. (2014). Spiropyran-based dynamic materials. <i>Chemical Society Reviews</i>.
    Royal Society of Chemistry. <a href="https://doi.org/10.1039/c3cs60181a">https://doi.org/10.1039/c3cs60181a</a>
  chicago: Klajn, Rafal. “Spiropyran-Based Dynamic Materials.” <i>Chemical Society
    Reviews</i>. Royal Society of Chemistry, 2014. <a href="https://doi.org/10.1039/c3cs60181a">https://doi.org/10.1039/c3cs60181a</a>.
  ieee: R. Klajn, “Spiropyran-based dynamic materials,” <i>Chemical Society Reviews</i>,
    vol. 43, no. 1. Royal Society of Chemistry, pp. 148–184, 2014.
  ista: Klajn R. 2014. Spiropyran-based dynamic materials. Chemical Society Reviews.
    43(1), 148–184.
  mla: Klajn, Rafal. “Spiropyran-Based Dynamic Materials.” <i>Chemical Society Reviews</i>,
    vol. 43, no. 1, Royal Society of Chemistry, 2014, pp. 148–84, doi:<a href="https://doi.org/10.1039/c3cs60181a">10.1039/c3cs60181a</a>.
  short: R. Klajn, Chemical Society Reviews 43 (2014) 148–184.
date_created: 2023-08-01T09:47:03Z
date_published: 2014-01-27T00:00:00Z
date_updated: 2023-08-08T07:41:38Z
day: '27'
doi: 10.1039/c3cs60181a
extern: '1'
external_id:
  pmid:
  - '23979515'
intvolume: '        43'
issue: '1'
keyword:
- General Chemistry
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1039/C3CS60181A
month: '01'
oa: 1
oa_version: Published Version
page: 148-184
pmid: 1
publication: Chemical Society Reviews
publication_identifier:
  eissn:
  - 1460-4744
  issn:
  - 0306-0012
publication_status: published
publisher: Royal Society of Chemistry
quality_controlled: '1'
scopus_import: '1'
status: public
title: Spiropyran-based dynamic materials
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 43
year: '2014'
...
---
_id: '1375'
abstract:
- lang: eng
  text: 'We consider directed graphs where each edge is labeled with an integer weight
    and study the fundamental algorithmic question of computing the value of a cycle
    with minimum mean weight. Our contributions are twofold: (1) First we show that
    the algorithmic question is reducible to the problem of a logarithmic number of
    min-plus matrix multiplications of n×n-matrices, where n is the number of vertices
    of the graph. (2) Second, when the weights are nonnegative, we present the first
    (1+ε)-approximation algorithm for the problem and the running time of our algorithm
    is Õ(nωlog3(nW/ε)/ε),1 where O(nω) is the time required for the classic n×n-matrix
    multiplication and W is the maximum value of the weights. With an additional O(log(nW/ε))
    factor in space a cycle with approximately optimal weight can be computed within
    the same time bound.'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
- first_name: Sebastian
  full_name: Krinninger, Sebastian
  last_name: Krinninger
- first_name: Veronika
  full_name: Loitzenbauer, Veronika
  last_name: Loitzenbauer
- first_name: Michael
  full_name: Raskin, Michael
  last_name: Raskin
citation:
  ama: Chatterjee K, Henzinger MH, Krinninger S, Loitzenbauer V, Raskin M. Approximating
    the minimum cycle mean. <i>Theoretical Computer Science</i>. 2014;547(C):104-116.
    doi:<a href="https://doi.org/10.1016/j.tcs.2014.06.031">10.1016/j.tcs.2014.06.031</a>
  apa: Chatterjee, K., Henzinger, M. H., Krinninger, S., Loitzenbauer, V., &#38; Raskin,
    M. (2014). Approximating the minimum cycle mean. <i>Theoretical Computer Science</i>.
    Elsevier. <a href="https://doi.org/10.1016/j.tcs.2014.06.031">https://doi.org/10.1016/j.tcs.2014.06.031</a>
  chicago: Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, Veronika
    Loitzenbauer, and Michael Raskin. “Approximating the Minimum Cycle Mean.” <i>Theoretical
    Computer Science</i>. Elsevier, 2014. <a href="https://doi.org/10.1016/j.tcs.2014.06.031">https://doi.org/10.1016/j.tcs.2014.06.031</a>.
  ieee: K. Chatterjee, M. H. Henzinger, S. Krinninger, V. Loitzenbauer, and M. Raskin,
    “Approximating the minimum cycle mean,” <i>Theoretical Computer Science</i>, vol.
    547, no. C. Elsevier, pp. 104–116, 2014.
  ista: Chatterjee K, Henzinger MH, Krinninger S, Loitzenbauer V, Raskin M. 2014.
    Approximating the minimum cycle mean. Theoretical Computer Science. 547(C), 104–116.
  mla: Chatterjee, Krishnendu, et al. “Approximating the Minimum Cycle Mean.” <i>Theoretical
    Computer Science</i>, vol. 547, no. C, Elsevier, 2014, pp. 104–16, doi:<a href="https://doi.org/10.1016/j.tcs.2014.06.031">10.1016/j.tcs.2014.06.031</a>.
  short: K. Chatterjee, M.H. Henzinger, S. Krinninger, V. Loitzenbauer, M. Raskin,
    Theoretical Computer Science 547 (2014) 104–116.
date_created: 2018-12-11T11:51:40Z
date_published: 2014-08-28T00:00:00Z
date_updated: 2022-09-09T11:50:58Z
day: '28'
department:
- _id: KrCh
doi: 10.1016/j.tcs.2014.06.031
ec_funded: 1
external_id:
  arxiv:
  - '1307.4473'
intvolume: '       547'
issue: C
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1307.4473
month: '08'
oa: 1
oa_version: Preprint
page: 104 - 116
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: Theoretical Computer Science
publication_status: published
publisher: Elsevier
publist_id: '5836'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Approximating the minimum cycle mean
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 547
year: '2014'
...
---
_id: '1392'
abstract:
- lang: eng
  text: Fault-tolerant distributed algorithms play an important role in ensuring the
    reliability of many software applications. In this paper we consider distributed
    algorithms whose computations are organized in rounds. To verify the correctness
    of such algorithms, we reason about (i) properties (such as invariants) of the
    state, (ii) the transitions controlled by the algorithm, and (iii) the communication
    graph. We introduce a logic that addresses these points, and contains set comprehensions
    with cardinality constraints, function symbols to describe the local states of
    each process, and a limited form of quantifier alternation to express the verification
    conditions. We show its use in automating the verification of consensus algorithms.
    In particular, we give a semi-decision procedure for the unsatisfiability problem
    of the logic and identify a decidable fragment. We successfully applied our framework
    to verify the correctness of a variety of consensus algorithms tolerant to both
    benign faults (message loss, process crashes) and value faults (message corruption).
acknowledgement: Supported by the Vienna Science and Technology Fund (WWTF) through
  grant PROSEED.
alternative_title:
- LNCS
author:
- first_name: Cezara
  full_name: Dragoi, Cezara
  id: 2B2B5ED0-F248-11E8-B48F-1D18A9856A87
  last_name: Dragoi
- 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: Helmut
  full_name: Veith, Helmut
  last_name: Veith
- first_name: Josef
  full_name: Widder, Josef
  last_name: Widder
- first_name: Damien
  full_name: Zufferey, Damien
  id: 4397AC76-F248-11E8-B48F-1D18A9856A87
  last_name: Zufferey
  orcid: 0000-0002-3197-8736
citation:
  ama: 'Dragoi C, Henzinger TA, Veith H, Widder J, Zufferey D. A logic-based framework
    for verifying consensus algorithms. In: Vol 8318. Springer; 2014:161-181. doi:<a
    href="https://doi.org/10.1007/978-3-642-54013-4_10">10.1007/978-3-642-54013-4_10</a>'
  apa: 'Dragoi, C., Henzinger, T. A., Veith, H., Widder, J., &#38; Zufferey, D. (2014).
    A logic-based framework for verifying consensus algorithms (Vol. 8318, pp. 161–181).
    Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation,
    San Diego, USA: Springer. <a href="https://doi.org/10.1007/978-3-642-54013-4_10">https://doi.org/10.1007/978-3-642-54013-4_10</a>'
  chicago: Dragoi, Cezara, Thomas A Henzinger, Helmut Veith, Josef Widder, and Damien
    Zufferey. “A Logic-Based Framework for Verifying Consensus Algorithms,” 8318:161–81.
    Springer, 2014. <a href="https://doi.org/10.1007/978-3-642-54013-4_10">https://doi.org/10.1007/978-3-642-54013-4_10</a>.
  ieee: 'C. Dragoi, T. A. Henzinger, H. Veith, J. Widder, and D. Zufferey, “A logic-based
    framework for verifying consensus algorithms,” presented at the VMCAI: Verification,
    Model Checking and Abstract Interpretation, San Diego, USA, 2014, vol. 8318, pp.
    161–181.'
  ista: 'Dragoi C, Henzinger TA, Veith H, Widder J, Zufferey D. 2014. A logic-based
    framework for verifying consensus algorithms. VMCAI: Verification, Model Checking
    and Abstract Interpretation, LNCS, vol. 8318, 161–181.'
  mla: Dragoi, Cezara, et al. <i>A Logic-Based Framework for Verifying Consensus Algorithms</i>.
    Vol. 8318, Springer, 2014, pp. 161–81, doi:<a href="https://doi.org/10.1007/978-3-642-54013-4_10">10.1007/978-3-642-54013-4_10</a>.
  short: C. Dragoi, T.A. Henzinger, H. Veith, J. Widder, D. Zufferey, in:, Springer,
    2014, pp. 161–181.
conference:
  end_date: 2014-01-21
  location: San Diego, USA
  name: 'VMCAI: Verification, Model Checking and Abstract Interpretation'
  start_date: 2014-01-19
date_created: 2018-12-11T11:51:45Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:50:22Z
day: '01'
ddc:
- '000'
- '005'
department:
- _id: ToHe
doi: 10.1007/978-3-642-54013-4_10
ec_funded: 1
file:
- access_level: open_access
  checksum: bffa33d39be77df0da39defe97eabf84
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:11:06Z
  date_updated: 2020-07-14T12:44:48Z
  file_id: '4859'
  file_name: IST-2014-179-v1+1_vmcai14.pdf
  file_size: 444138
  relation: main_file
file_date_updated: 2020-07-14T12:44:48Z
has_accepted_license: '1'
intvolume: '      8318'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 161 - 181
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '267989'
  name: Quantitative Reactive Modeling
publication_status: published
publisher: Springer
publist_id: '5817'
pubrep_id: '179'
quality_controlled: '1'
scopus_import: 1
status: public
title: A logic-based framework for verifying consensus algorithms
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8318
year: '2014'
...
---
_id: '1393'
abstract:
- lang: eng
  text: 'Probabilistic programs are usual functional or imperative programs with two
    added constructs: (1) the ability to draw values at random from distributions,
    and (2) the ability to condition values of variables in a program via observations.
    Models from diverse application areas such as computer vision, coding theory,
    cryptographic protocols, biology and reliability analysis can be written as probabilistic
    programs. Probabilistic inference is the problem of computing an explicit representation
    of the probability distribution implicitly specified by a probabilistic program.
    Depending on the application, the desired output from inference may vary-we may
    want to estimate the expected value of some function f with respect to the distribution,
    or the mode of the distribution, or simply a set of samples drawn from the distribution.
    In this paper, we describe connections this research area called \Probabilistic
    Programming&quot; has with programming languages and software engineering, and
    this includes language design, and the static and dynamic analysis of programs.
    We survey current state of the art and speculate on promising directions for future
    research.'
article_processing_charge: No
author:
- first_name: Andrew
  full_name: Gordon, Andrew
  last_name: Gordon
- 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: Aditya
  full_name: Nori, Aditya
  last_name: Nori
- first_name: Sriram
  full_name: Rajamani, Sriram
  last_name: Rajamani
citation:
  ama: 'Gordon A, Henzinger TA, Nori A, Rajamani S. Probabilistic programming. In:
    <i>Proceedings of the on Future of Software Engineering</i>. ACM; 2014:167-181.
    doi:<a href="https://doi.org/10.1145/2593882.2593900">10.1145/2593882.2593900</a>'
  apa: 'Gordon, A., Henzinger, T. A., Nori, A., &#38; Rajamani, S. (2014). Probabilistic
    programming. In <i>Proceedings of the on Future of Software Engineering</i> (pp.
    167–181). Hyderabad, India: ACM. <a href="https://doi.org/10.1145/2593882.2593900">https://doi.org/10.1145/2593882.2593900</a>'
  chicago: Gordon, Andrew, Thomas A Henzinger, Aditya Nori, and Sriram Rajamani. “Probabilistic
    Programming.” In <i>Proceedings of the on Future of Software Engineering</i>,
    167–81. ACM, 2014. <a href="https://doi.org/10.1145/2593882.2593900">https://doi.org/10.1145/2593882.2593900</a>.
  ieee: A. Gordon, T. A. Henzinger, A. Nori, and S. Rajamani, “Probabilistic programming,”
    in <i>Proceedings of the on Future of Software Engineering</i>, Hyderabad, India,
    2014, pp. 167–181.
  ista: 'Gordon A, Henzinger TA, Nori A, Rajamani S. 2014. Probabilistic programming.
    Proceedings of the on Future of Software Engineering. FOSE: Future of Software
    Engineering, 167–181.'
  mla: Gordon, Andrew, et al. “Probabilistic Programming.” <i>Proceedings of the on
    Future of Software Engineering</i>, ACM, 2014, pp. 167–81, doi:<a href="https://doi.org/10.1145/2593882.2593900">10.1145/2593882.2593900</a>.
  short: A. Gordon, T.A. Henzinger, A. Nori, S. Rajamani, in:, Proceedings of the
    on Future of Software Engineering, ACM, 2014, pp. 167–181.
conference:
  end_date: 2014-06-07
  location: Hyderabad, India
  name: 'FOSE: Future of Software Engineering'
  start_date: 2014-05-31
date_created: 2018-12-11T11:51:45Z
date_published: 2014-05-31T00:00:00Z
date_updated: 2021-01-12T06:50:22Z
day: '31'
department:
- _id: ToHe
doi: 10.1145/2593882.2593900
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1145/2593882.2593900
month: '05'
oa: 1
oa_version: Published Version
page: 167 - 181
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '267989'
  name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
publication: Proceedings of the on Future of Software Engineering
publication_status: published
publisher: ACM
publist_id: '5816'
quality_controlled: '1'
scopus_import: 1
status: public
title: Probabilistic programming
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '14020'
abstract:
- lang: eng
  text: We report the observation of macroscopic field-free orientation, i.e., more
    than 73% of CO molecules pointing in the same direction. This is achieved through
    an all-optical scheme operating at high particle densities (>10(17)  cm(-3)) that
    combines one-color (ω) and two-color (ω+2ω) nonresonant femtosecond laser pulses.
    We show that the achieved orientation solely relies on the hyperpolarizability
    interaction as opposed to an ionization-depletion mechanism, thus, opening a wide
    range of applications. The achieved strong orientation enables us to reveal the
    molecular-frame anisotropies of the photorecombination amplitudes and phases caused
    by a shape resonance. The resonance appears as a local maximum in the even-harmonic
    emission around 28 eV. In contrast, the odd-harmonic emission is suppressed in
    this spectral region through the combined effects of an asymmetric photorecombination
    phase and a subcycle Stark effect, generic for polar molecules, that we experimentally
    identify.
article_number: '023001'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: P. M.
  full_name: Kraus, P. M.
  last_name: Kraus
- first_name: Denitsa Rangelova
  full_name: Baykusheva, Denitsa Rangelova
  id: 71b4d059-2a03-11ee-914d-dfa3beed6530
  last_name: Baykusheva
- first_name: H. J.
  full_name: Wörner, H. J.
  last_name: Wörner
citation:
  ama: Kraus PM, Baykusheva DR, Wörner HJ. Two-pulse field-free orientation reveals
    anisotropy of molecular shape resonance. <i>Physical Review Letters</i>. 2014;113(2).
    doi:<a href="https://doi.org/10.1103/physrevlett.113.023001">10.1103/physrevlett.113.023001</a>
  apa: Kraus, P. M., Baykusheva, D. R., &#38; Wörner, H. J. (2014). Two-pulse field-free
    orientation reveals anisotropy of molecular shape resonance. <i>Physical Review
    Letters</i>. American Physical Society. <a href="https://doi.org/10.1103/physrevlett.113.023001">https://doi.org/10.1103/physrevlett.113.023001</a>
  chicago: Kraus, P. M., Denitsa Rangelova Baykusheva, and H. J. Wörner. “Two-Pulse
    Field-Free Orientation Reveals Anisotropy of Molecular Shape Resonance.” <i>Physical
    Review Letters</i>. American Physical Society, 2014. <a href="https://doi.org/10.1103/physrevlett.113.023001">https://doi.org/10.1103/physrevlett.113.023001</a>.
  ieee: P. M. Kraus, D. R. Baykusheva, and H. J. Wörner, “Two-pulse field-free orientation
    reveals anisotropy of molecular shape resonance,” <i>Physical Review Letters</i>,
    vol. 113, no. 2. American Physical Society, 2014.
  ista: Kraus PM, Baykusheva DR, Wörner HJ. 2014. Two-pulse field-free orientation
    reveals anisotropy of molecular shape resonance. Physical Review Letters. 113(2),
    023001.
  mla: Kraus, P. M., et al. “Two-Pulse Field-Free Orientation Reveals Anisotropy of
    Molecular Shape Resonance.” <i>Physical Review Letters</i>, vol. 113, no. 2, 023001,
    American Physical Society, 2014, doi:<a href="https://doi.org/10.1103/physrevlett.113.023001">10.1103/physrevlett.113.023001</a>.
  short: P.M. Kraus, D.R. Baykusheva, H.J. Wörner, Physical Review Letters 113 (2014).
date_created: 2023-08-10T06:38:38Z
date_published: 2014-07-11T00:00:00Z
date_updated: 2023-08-22T09:02:56Z
day: '11'
doi: 10.1103/physrevlett.113.023001
extern: '1'
external_id:
  arxiv:
  - '1311.3923'
  pmid:
  - '25062172'
intvolume: '       113'
issue: '2'
keyword:
- General Physics and Astronomy
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1311.3923
month: '07'
oa: 1
oa_version: Preprint
pmid: 1
publication: Physical Review Letters
publication_identifier:
  eissn:
  - 1079-7114
  issn:
  - 0031-9007
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Two-pulse field-free orientation reveals anisotropy of molecular shape resonance
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 113
year: '2014'
...
---
_id: '14021'
abstract:
- lang: eng
  text: We present the detailed analysis of a new two-pulse orientation scheme that
    achieves macroscopic field-free orientation at the high particle densities required
    for attosecond and high-harmonic spectroscopies (Kraus et al 2013 arXiv:1311.3923).
    Carbon monoxide molecules are oriented by combining one-colour and delayed two-colour
    non-resonant femtosecond laser pulses. High-harmonic generation is used to probe
    the oriented wave-packet dynamics and reveals that a very high degree of orientation
    (Nup/Ntotal = 0.73–0.82) is achieved. We further extend this approach to orienting
    carbonyl sulphide molecules. We show that the present two-pulse scheme selectively
    enhances orientation created by the hyperpolarizability interaction whereas the
    ionization-depletion mechanism plays no role. We further control and optimize
    orientation through the delay between the one- and two-colour pump pulses. Finally,
    we demonstrate a complementary encoding of electronic-structure features, such
    as shape resonances, in the even- and odd-harmonic spectrum. The achieved progress
    makes two-pulse field-free orientation an attractive tool for a broad class of
    time-resolved measurements.
article_number: '124030'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: P M
  full_name: Kraus, P M
  last_name: Kraus
- first_name: Denitsa Rangelova
  full_name: Baykusheva, Denitsa Rangelova
  id: 71b4d059-2a03-11ee-914d-dfa3beed6530
  last_name: Baykusheva
- first_name: H J
  full_name: Wörner, H J
  last_name: Wörner
citation:
  ama: 'Kraus PM, Baykusheva DR, Wörner HJ. Two-pulse orientation dynamics and high-harmonic
    spectroscopy of strongly-oriented molecules. <i>Journal of Physics B: Atomic,
    Molecular and Optical Physics</i>. 2014;47(12). doi:<a href="https://doi.org/10.1088/0953-4075/47/12/124030">10.1088/0953-4075/47/12/124030</a>'
  apa: 'Kraus, P. M., Baykusheva, D. R., &#38; Wörner, H. J. (2014). Two-pulse orientation
    dynamics and high-harmonic spectroscopy of strongly-oriented molecules. <i>Journal
    of Physics B: Atomic, Molecular and Optical Physics</i>. IOP Publishing. <a href="https://doi.org/10.1088/0953-4075/47/12/124030">https://doi.org/10.1088/0953-4075/47/12/124030</a>'
  chicago: 'Kraus, P M, Denitsa Rangelova Baykusheva, and H J Wörner. “Two-Pulse Orientation
    Dynamics and High-Harmonic Spectroscopy of Strongly-Oriented Molecules.” <i>Journal
    of Physics B: Atomic, Molecular and Optical Physics</i>. IOP Publishing, 2014.
    <a href="https://doi.org/10.1088/0953-4075/47/12/124030">https://doi.org/10.1088/0953-4075/47/12/124030</a>.'
  ieee: 'P. M. Kraus, D. R. Baykusheva, and H. J. Wörner, “Two-pulse orientation dynamics
    and high-harmonic spectroscopy of strongly-oriented molecules,” <i>Journal of
    Physics B: Atomic, Molecular and Optical Physics</i>, vol. 47, no. 12. IOP Publishing,
    2014.'
  ista: 'Kraus PM, Baykusheva DR, Wörner HJ. 2014. Two-pulse orientation dynamics
    and high-harmonic spectroscopy of strongly-oriented molecules. Journal of Physics
    B: Atomic, Molecular and Optical Physics. 47(12), 124030.'
  mla: 'Kraus, P. M., et al. “Two-Pulse Orientation Dynamics and High-Harmonic Spectroscopy
    of Strongly-Oriented Molecules.” <i>Journal of Physics B: Atomic, Molecular and
    Optical Physics</i>, vol. 47, no. 12, 124030, IOP Publishing, 2014, doi:<a href="https://doi.org/10.1088/0953-4075/47/12/124030">10.1088/0953-4075/47/12/124030</a>.'
  short: 'P.M. Kraus, D.R. Baykusheva, H.J. Wörner, Journal of Physics B: Atomic,
    Molecular and Optical Physics 47 (2014).'
date_created: 2023-08-10T06:38:48Z
date_published: 2014-06-10T00:00:00Z
date_updated: 2023-08-22T09:04:30Z
day: '10'
doi: 10.1088/0953-4075/47/12/124030
extern: '1'
external_id:
  arxiv:
  - '1311.3923'
intvolume: '        47'
issue: '12'
keyword:
- Condensed Matter Physics
- Atomic and Molecular Physics
- and Optics
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1311.3923
month: '06'
oa: 1
oa_version: Preprint
publication: 'Journal of Physics B: Atomic, Molecular and Optical Physics'
publication_identifier:
  eissn:
  - 1361-6455
  issn:
  - 0953-4075
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Two-pulse orientation dynamics and high-harmonic spectroscopy of strongly-oriented
  molecules
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 47
year: '2014'
...
---
_id: '14301'
abstract:
- lang: eng
  text: DNA has become a prime material for assembling complex three-dimensional objects
    that promise utility in various areas of application. However, achieving user-defined
    goals with DNA objects has been hampered by the difficulty to prepare them at
    arbitrary concentrations and in user-defined solution conditions. Here, we describe
    a method that solves this problem. The method is based on poly(ethylene glycol)-induced
    depletion of species with high molecular weight. We demonstrate that our method
    is applicable to a wide spectrum of DNA shapes and that it achieves excellent
    recovery yields of target objects up to 97 %, while providing efficient separation
    from non-integrated DNA strands. DNA objects may be prepared at concentrations
    up to the limit of solubility, including the possibility for bringing DNA objects
    into a solid phase. Due to the fidelity and simplicity of our method we anticipate
    that it will help to catalyze the development of new types of applications that
    use self-assembled DNA objects.
article_processing_charge: No
article_type: original
author:
- first_name: Evi
  full_name: Stahl, Evi
  last_name: Stahl
- first_name: Thomas
  full_name: Martin, Thomas
  last_name: Martin
- first_name: Florian M
  full_name: Praetorius, Florian M
  id: dfec9381-4341-11ee-8fd8-faa02bba7d62
  last_name: Praetorius
- first_name: Hendrik
  full_name: Dietz, Hendrik
  last_name: Dietz
citation:
  ama: Stahl E, Martin T, Praetorius FM, Dietz H. Facile and scalable preparation
    of pure and dense DNA origami solutions. <i>Angewandte Chemie International Edition</i>.
    2014;126(47):12949-12954. doi:<a href="https://doi.org/10.1002/ange.201405991">10.1002/ange.201405991</a>
  apa: Stahl, E., Martin, T., Praetorius, F. M., &#38; Dietz, H. (2014). Facile and
    scalable preparation of pure and dense DNA origami solutions. <i>Angewandte Chemie
    International Edition</i>. Wiley. <a href="https://doi.org/10.1002/ange.201405991">https://doi.org/10.1002/ange.201405991</a>
  chicago: Stahl, Evi, Thomas Martin, Florian M Praetorius, and Hendrik Dietz. “Facile
    and Scalable Preparation of Pure and Dense DNA Origami Solutions.” <i>Angewandte
    Chemie International Edition</i>. Wiley, 2014. <a href="https://doi.org/10.1002/ange.201405991">https://doi.org/10.1002/ange.201405991</a>.
  ieee: E. Stahl, T. Martin, F. M. Praetorius, and H. Dietz, “Facile and scalable
    preparation of pure and dense DNA origami solutions,” <i>Angewandte Chemie International
    Edition</i>, vol. 126, no. 47. Wiley, pp. 12949–12954, 2014.
  ista: Stahl E, Martin T, Praetorius FM, Dietz H. 2014. Facile and scalable preparation
    of pure and dense DNA origami solutions. Angewandte Chemie International Edition.
    126(47), 12949–12954.
  mla: Stahl, Evi, et al. “Facile and Scalable Preparation of Pure and Dense DNA Origami
    Solutions.” <i>Angewandte Chemie International Edition</i>, vol. 126, no. 47,
    Wiley, 2014, pp. 12949–54, doi:<a href="https://doi.org/10.1002/ange.201405991">10.1002/ange.201405991</a>.
  short: E. Stahl, T. Martin, F.M. Praetorius, H. Dietz, Angewandte Chemie International
    Edition 126 (2014) 12949–12954.
date_created: 2023-09-06T12:51:14Z
date_published: 2014-11-17T00:00:00Z
date_updated: 2023-11-07T12:14:30Z
day: '17'
doi: 10.1002/ange.201405991
extern: '1'
external_id:
  pmid:
  - '25346175'
intvolume: '       126'
issue: '47'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1002/ange.201405991
month: '11'
oa: 1
oa_version: Published Version
page: 12949-12954
pmid: 1
publication: Angewandte Chemie International Edition
publication_identifier:
  eissn:
  - 1521-3773
  issn:
  - 1433-7851
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Facile and scalable preparation of pure and dense DNA origami solutions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 126
year: '2014'
...
---
_id: '5411'
abstract:
- lang: eng
  text: "Model-based testing is a promising technology for black-box software and
    hardware testing, in which test cases are generated automatically from high-level
    specifications. Nowadays, systems typically consist of multiple interacting components
    and, due to their complexity, testing presents a considerable portion of the effort
    and cost in the design process. Exploiting the compositional structure of system
    specifications can considerably reduce the effort in model-based testing. Moreover,
    inferring properties about the system from testing its individual components allows
    the designer to reduce the amount of integration testing.\r\nIn this paper, we
    study compositional properties of the IOCO-testing theory. We propose a new approach
    to composition and hiding operations, inspired by contract-based design and interface
    theories. These operations preserve behaviors that are compatible under composition
    and hiding, and prune away incompatible ones. The resulting specification characterizes
    the input sequences for which the unit testing of components is sufficient to
    infer the correctness of component integration without the need for further tests.
    We provide a methodology that uses these results to minimize integration testing
    effort, but also to detect potential weaknesses in specifications. While we focus
    on asynchronous models and the IOCO conformance relation, the resulting methodology
    can be applied to a broader class of systems."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Przemyslaw
  full_name: Daca, Przemyslaw
  id: 49351290-F248-11E8-B48F-1D18A9856A87
  last_name: Daca
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
- first_name: Willibald
  full_name: Krenn, Willibald
  last_name: Krenn
- first_name: Dejan
  full_name: Nickovic, Dejan
  id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87
  last_name: Nickovic
citation:
  ama: Daca P, Henzinger TA, Krenn W, Nickovic D. <i>Compositional Specifications
    for IOCO Testing</i>. IST Austria; 2014. doi:<a href="https://doi.org/10.15479/AT:IST-2014-148-v2-1">10.15479/AT:IST-2014-148-v2-1</a>
  apa: Daca, P., Henzinger, T. A., Krenn, W., &#38; Nickovic, D. (2014). <i>Compositional
    specifications for IOCO testing</i>. IST Austria. <a href="https://doi.org/10.15479/AT:IST-2014-148-v2-1">https://doi.org/10.15479/AT:IST-2014-148-v2-1</a>
  chicago: Daca, Przemyslaw, Thomas A Henzinger, Willibald Krenn, and Dejan Nickovic.
    <i>Compositional Specifications for IOCO Testing</i>. IST Austria, 2014. <a href="https://doi.org/10.15479/AT:IST-2014-148-v2-1">https://doi.org/10.15479/AT:IST-2014-148-v2-1</a>.
  ieee: P. Daca, T. A. Henzinger, W. Krenn, and D. Nickovic, <i>Compositional specifications
    for IOCO testing</i>. IST Austria, 2014.
  ista: Daca P, Henzinger TA, Krenn W, Nickovic D. 2014. Compositional specifications
    for IOCO testing, IST Austria, 20p.
  mla: Daca, Przemyslaw, et al. <i>Compositional Specifications for IOCO Testing</i>.
    IST Austria, 2014, doi:<a href="https://doi.org/10.15479/AT:IST-2014-148-v2-1">10.15479/AT:IST-2014-148-v2-1</a>.
  short: P. Daca, T.A. Henzinger, W. Krenn, D. Nickovic, Compositional Specifications
    for IOCO Testing, IST Austria, 2014.
date_created: 2018-12-12T11:39:11Z
date_published: 2014-01-28T00:00:00Z
date_updated: 2023-02-23T10:31:07Z
day: '28'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.15479/AT:IST-2014-148-v2-1
file:
- access_level: open_access
  checksum: 0e03aba625cc334141a3148432aa5760
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:54:21Z
  date_updated: 2020-07-14T12:46:46Z
  file_id: '5543'
  file_name: IST-2014-148-v2+1_main_tr.pdf
  file_size: 534732
  relation: main_file
file_date_updated: 2020-07-14T12:46:46Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: '20'
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '152'
related_material:
  record:
  - id: '2167'
    relation: later_version
    status: public
status: public
title: Compositional specifications for IOCO testing
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5412'
abstract:
- lang: eng
  text: "We consider Markov decision processes (MDPs) which are a standard model for
    probabilistic systems. We focus on qualitative properties for MDPs that can express
    that desired behaviors of the system arise almost-surely (with probability 1)
    or with positive probability.\r\nWe introduce a new simulation relation to capture
    the refinement relation of MDPs with respect to qualitative properties, and present
    discrete graph theoretic algorithms with quadratic complexity to compute the simulation
    relation.\r\nWe present an automated technique for assume-guarantee style reasoning
    for compositional analysis of MDPs with qualitative properties by giving a counter-example
    guided abstraction-refinement approach to compute our new simulation relation.
    We have implemented our algorithms and show that the compositional analysis leads
    to significant improvements. "
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: Przemyslaw
  full_name: Daca, Przemyslaw
  id: 49351290-F248-11E8-B48F-1D18A9856A87
  last_name: Daca
- first_name: Martin
  full_name: Chmelik, Martin
  id: 3624234E-F248-11E8-B48F-1D18A9856A87
  last_name: Chmelik
citation:
  ama: Chatterjee K, Daca P, Chmelik M. <i>CEGAR for Qualitative Analysis of Probabilistic
    Systems</i>. IST Austria; 2014. doi:<a href="https://doi.org/10.15479/AT:IST-2014-153-v1-1">10.15479/AT:IST-2014-153-v1-1</a>
  apa: Chatterjee, K., Daca, P., &#38; Chmelik, M. (2014). <i>CEGAR for qualitative
    analysis of probabilistic systems</i>. IST Austria. <a href="https://doi.org/10.15479/AT:IST-2014-153-v1-1">https://doi.org/10.15479/AT:IST-2014-153-v1-1</a>
  chicago: Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. <i>CEGAR for
    Qualitative Analysis of Probabilistic Systems</i>. IST Austria, 2014. <a href="https://doi.org/10.15479/AT:IST-2014-153-v1-1">https://doi.org/10.15479/AT:IST-2014-153-v1-1</a>.
  ieee: K. Chatterjee, P. Daca, and M. Chmelik, <i>CEGAR for qualitative analysis
    of probabilistic systems</i>. IST Austria, 2014.
  ista: Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic
    systems, IST Austria, 31p.
  mla: Chatterjee, Krishnendu, et al. <i>CEGAR for Qualitative Analysis of Probabilistic
    Systems</i>. IST Austria, 2014, doi:<a href="https://doi.org/10.15479/AT:IST-2014-153-v1-1">10.15479/AT:IST-2014-153-v1-1</a>.
  short: K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic
    Systems, IST Austria, 2014.
date_created: 2018-12-12T11:39:11Z
date_published: 2014-01-29T00:00:00Z
date_updated: 2023-02-23T12:25:18Z
day: '29'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2014-153-v1-1
file:
- access_level: open_access
  checksum: 4d6cda4bebed970926403ad6ad8c745f
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:53:39Z
  date_updated: 2020-07-14T12:46:47Z
  file_id: '5500'
  file_name: IST-2014-153-v1+1_main.pdf
  file_size: 423322
  relation: main_file
file_date_updated: 2020-07-14T12:46:47Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: '31'
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '153'
related_material:
  record:
  - id: '2063'
    relation: later_version
    status: public
  - id: '5413'
    relation: later_version
    status: public
  - id: '5414'
    relation: later_version
    status: public
status: public
title: CEGAR for qualitative analysis of probabilistic systems
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5413'
abstract:
- lang: eng
  text: "We consider Markov decision processes (MDPs) which are a standard model for
    probabilistic systems. We focus on qualitative properties for MDPs that can express
    that desired behaviors of the system arise almost-surely (with probability 1)
    or with positive probability.\r\nWe introduce a new simulation relation to capture
    the refinement relation of MDPs with respect to qualitative properties, and present
    discrete graph theoretic algorithms with quadratic complexity to compute the simulation
    relation.\r\nWe present an automated technique for assume-guarantee style reasoning
    for compositional analysis of MDPs with qualitative properties by giving a counter-example
    guided abstraction-refinement approach to compute our new simulation relation.
    We have implemented our algorithms and show that the compositional analysis leads
    to significant improvements. "
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: Przemyslaw
  full_name: Daca, Przemyslaw
  id: 49351290-F248-11E8-B48F-1D18A9856A87
  last_name: Daca
- first_name: Martin
  full_name: Chmelik, Martin
  id: 3624234E-F248-11E8-B48F-1D18A9856A87
  last_name: Chmelik
citation:
  ama: Chatterjee K, Daca P, Chmelik M. <i>CEGAR for Qualitative Analysis of Probabilistic
    Systems</i>. IST Austria; 2014. doi:<a href="https://doi.org/10.15479/AT:IST-2014-153-v2-2">10.15479/AT:IST-2014-153-v2-2</a>
  apa: Chatterjee, K., Daca, P., &#38; Chmelik, M. (2014). <i>CEGAR for qualitative
    analysis of probabilistic systems</i>. IST Austria. <a href="https://doi.org/10.15479/AT:IST-2014-153-v2-2">https://doi.org/10.15479/AT:IST-2014-153-v2-2</a>
  chicago: Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. <i>CEGAR for
    Qualitative Analysis of Probabilistic Systems</i>. IST Austria, 2014. <a href="https://doi.org/10.15479/AT:IST-2014-153-v2-2">https://doi.org/10.15479/AT:IST-2014-153-v2-2</a>.
  ieee: K. Chatterjee, P. Daca, and M. Chmelik, <i>CEGAR for qualitative analysis
    of probabilistic systems</i>. IST Austria, 2014.
  ista: Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic
    systems, IST Austria, 33p.
  mla: Chatterjee, Krishnendu, et al. <i>CEGAR for Qualitative Analysis of Probabilistic
    Systems</i>. IST Austria, 2014, doi:<a href="https://doi.org/10.15479/AT:IST-2014-153-v2-2">10.15479/AT:IST-2014-153-v2-2</a>.
  short: K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic
    Systems, IST Austria, 2014.
date_created: 2018-12-12T11:39:11Z
date_published: 2014-02-06T00:00:00Z
date_updated: 2023-02-23T12:25:18Z
day: '06'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2014-153-v2-2
file:
- access_level: open_access
  checksum: ce4967a184d84863eec76c66cbac1614
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:54:17Z
  date_updated: 2020-07-14T12:46:47Z
  file_id: '5539'
  file_name: IST-2014-153-v2+2_main.pdf
  file_size: 606049
  relation: main_file
file_date_updated: 2020-07-14T12:46:47Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '33'
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '164'
related_material:
  record:
  - id: '2063'
    relation: later_version
    status: public
  - id: '5412'
    relation: earlier_version
    status: public
  - id: '5414'
    relation: later_version
    status: public
status: public
title: CEGAR for qualitative analysis of probabilistic systems
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5414'
abstract:
- lang: eng
  text: "We consider Markov decision processes (MDPs) which are a standard model for
    probabilistic systems. We focus on qualitative properties for MDPs that can express
    that desired behaviors of the system arise almost-surely (with probability 1)
    or with positive probability.\r\nWe introduce a new simulation relation to capture
    the refinement relation of MDPs with respect to qualitative properties, and present
    discrete graph theoretic algorithms with quadratic complexity to compute the simulation
    relation.\r\nWe present an automated technique for assume-guarantee style reasoning
    for compositional analysis of MDPs with qualitative properties by giving a counter-example
    guided abstraction-refinement approach to compute our new simulation relation.
    \r\nWe have implemented our algorithms and show that the compositional analysis
    leads to significant improvements. "
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: Przemyslaw
  full_name: Daca, Przemyslaw
  id: 49351290-F248-11E8-B48F-1D18A9856A87
  last_name: Daca
- first_name: Martin
  full_name: Chmelik, Martin
  id: 3624234E-F248-11E8-B48F-1D18A9856A87
  last_name: Chmelik
citation:
  ama: Chatterjee K, Daca P, Chmelik M. <i>CEGAR for Qualitative Analysis of Probabilistic
    Systems</i>. IST Austria; 2014. doi:<a href="https://doi.org/10.15479/AT:IST-2014-153-v3-1">10.15479/AT:IST-2014-153-v3-1</a>
  apa: Chatterjee, K., Daca, P., &#38; Chmelik, M. (2014). <i>CEGAR for qualitative
    analysis of probabilistic systems</i>. IST Austria. <a href="https://doi.org/10.15479/AT:IST-2014-153-v3-1">https://doi.org/10.15479/AT:IST-2014-153-v3-1</a>
  chicago: Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. <i>CEGAR for
    Qualitative Analysis of Probabilistic Systems</i>. IST Austria, 2014. <a href="https://doi.org/10.15479/AT:IST-2014-153-v3-1">https://doi.org/10.15479/AT:IST-2014-153-v3-1</a>.
  ieee: K. Chatterjee, P. Daca, and M. Chmelik, <i>CEGAR for qualitative analysis
    of probabilistic systems</i>. IST Austria, 2014.
  ista: Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic
    systems, IST Austria, 33p.
  mla: Chatterjee, Krishnendu, et al. <i>CEGAR for Qualitative Analysis of Probabilistic
    Systems</i>. IST Austria, 2014, doi:<a href="https://doi.org/10.15479/AT:IST-2014-153-v3-1">10.15479/AT:IST-2014-153-v3-1</a>.
  short: K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic
    Systems, IST Austria, 2014.
date_created: 2018-12-12T11:39:12Z
date_published: 2014-02-07T00:00:00Z
date_updated: 2023-02-23T12:25:15Z
day: '07'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2014-153-v3-1
file:
- access_level: open_access
  checksum: 87b93fe9af71fc5c94b0eb6151537e11
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:53:03Z
  date_updated: 2020-07-14T12:46:48Z
  file_id: '5464'
  file_name: IST-2014-153-v3+1_main.pdf
  file_size: 606227
  relation: main_file
file_date_updated: 2020-07-14T12:46:48Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '33'
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '165'
related_material:
  record:
  - id: '2063'
    relation: later_version
    status: public
  - id: '5412'
    relation: earlier_version
    status: public
  - id: '5413'
    relation: earlier_version
    status: public
status: public
title: CEGAR for qualitative analysis of probabilistic systems
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5415'
abstract:
- lang: eng
  text: 'Recently there has been a significant effort to add 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, several basic system properties such as average
    response time cannot be expressed with weighted automata. In this work, we introduce
    nested weighted automata as a new formalism for expressing important quantitative
    properties such as average response time. We establish an almost complete decidability
    picture for the basic decision problems for nested weighted automata, and illustrate
    its applicability in several domains.  '
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: 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. <i>Nested Weighted Automata</i>. IST Austria;
    2014. doi:<a href="https://doi.org/10.15479/AT:IST-2014-170-v1-1">10.15479/AT:IST-2014-170-v1-1</a>
  apa: Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2014). <i>Nested weighted
    automata</i>. IST Austria. <a href="https://doi.org/10.15479/AT:IST-2014-170-v1-1">https://doi.org/10.15479/AT:IST-2014-170-v1-1</a>
  chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. <i>Nested Weighted
    Automata</i>. IST Austria, 2014. <a href="https://doi.org/10.15479/AT:IST-2014-170-v1-1">https://doi.org/10.15479/AT:IST-2014-170-v1-1</a>.
  ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, <i>Nested weighted automata</i>.
    IST Austria, 2014.
  ista: Chatterjee K, Henzinger TA, Otop J. 2014. Nested weighted automata, IST Austria,
    27p.
  mla: Chatterjee, Krishnendu, et al. <i>Nested Weighted Automata</i>. IST Austria,
    2014, doi:<a href="https://doi.org/10.15479/AT:IST-2014-170-v1-1">10.15479/AT:IST-2014-170-v1-1</a>.
  short: K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria,
    2014.
date_created: 2018-12-12T11:39:12Z
date_published: 2014-02-19T00:00:00Z
date_updated: 2023-02-23T12:26:19Z
day: '19'
ddc:
- '004'
department:
- _id: KrCh
- _id: ToHe
doi: 10.15479/AT:IST-2014-170-v1-1
file:
- access_level: open_access
  checksum: 31f90dcf2cf899c3f8c6427cfcc2b3c7
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:53:36Z
  date_updated: 2020-07-14T12:46:48Z
  file_id: '5497'
  file_name: IST-2014-170-v1+1_main.pdf
  file_size: 573457
  relation: main_file
file_date_updated: 2020-07-14T12:46:48Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '27'
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '170'
related_material:
  record:
  - id: '1656'
    relation: later_version
    status: public
  - id: '467'
    relation: later_version
    status: public
  - id: '5436'
    relation: later_version
    status: public
status: public
title: Nested weighted automata
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5416'
abstract:
- lang: eng
  text: As hybrid systems involve continuous behaviors, they should be evaluated by
    quantitative methods, rather than qualitative methods. In this paper we adapt
    a quantitative framework, called model measuring, to the hybrid systems domain.
    The model-measuring problem asks, given a model M and a specification, what is
    the maximal distance such that all models within that distance from M satisfy
    (or violate) the specification. A distance function on models is given as part
    of the input of the problem. Distances, especially related to continuous behaviors
    are more natural in the hybrid case than the discrete case. We are interested
    in distances represented by monotonic hybrid automata, a hybrid counterpart of
    (discrete) weighted automata, whose recognized timed languages are monotone (w.r.t.
    inclusion) in the values of parameters.The contributions of this paper are twofold.
    First, we give sufficient conditions under which the model-measuring problem can
    be solved. Second, we discuss the modeling of distances and applications of the
    model-measuring problem.
alternative_title:
- IST Austria Technical Report
author:
- 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: Henzinger TA, Otop J. <i>Model Measuring for Hybrid Systems</i>. IST Austria;
    2014. doi:<a href="https://doi.org/10.15479/AT:IST-2014-171-v1-1">10.15479/AT:IST-2014-171-v1-1</a>
  apa: Henzinger, T. A., &#38; Otop, J. (2014). <i>Model measuring for hybrid systems</i>.
    IST Austria. <a href="https://doi.org/10.15479/AT:IST-2014-171-v1-1">https://doi.org/10.15479/AT:IST-2014-171-v1-1</a>
  chicago: Henzinger, Thomas A, and Jan Otop. <i>Model Measuring for Hybrid Systems</i>.
    IST Austria, 2014. <a href="https://doi.org/10.15479/AT:IST-2014-171-v1-1">https://doi.org/10.15479/AT:IST-2014-171-v1-1</a>.
  ieee: T. A. Henzinger and J. Otop, <i>Model measuring for hybrid systems</i>. IST
    Austria, 2014.
  ista: Henzinger TA, Otop J. 2014. Model measuring for hybrid systems, IST Austria,
    22p.
  mla: Henzinger, Thomas A., and Jan Otop. <i>Model Measuring for Hybrid Systems</i>.
    IST Austria, 2014, doi:<a href="https://doi.org/10.15479/AT:IST-2014-171-v1-1">10.15479/AT:IST-2014-171-v1-1</a>.
  short: T.A. Henzinger, J. Otop, Model Measuring for Hybrid Systems, IST Austria,
    2014.
date_created: 2018-12-12T11:39:12Z
date_published: 2014-02-19T00:00:00Z
date_updated: 2023-02-23T10:33:21Z
day: '19'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.15479/AT:IST-2014-171-v1-1
file:
- access_level: open_access
  checksum: 445456d22371e4e49aad2b9a0c13bf80
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:53:32Z
  date_updated: 2020-07-14T12:46:49Z
  file_id: '5492'
  file_name: IST-2014-171-v1+1_report.pdf
  file_size: 712077
  relation: main_file
file_date_updated: 2020-07-14T12:46:49Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '22'
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '171'
related_material:
  record:
  - id: '2217'
    relation: later_version
    status: public
status: public
title: Model measuring for hybrid systems
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
