---
_id: '14305'
abstract:
- lang: eng
  text: Understanding the mechanism of protein folding requires a detailed knowledge
    of the structural properties of the barriers separating unfolded from native conformations.
    The S-peptide from ribonuclease S forms its α-helical structure only upon binding
    to the folded S-protein. We characterized the transition state for this binding-induced
    folding reaction at high resolution by determining the effect of site-specific
    backbone thioxylation and side-chain modifications on the kinetics and thermodynamics
    of the reaction, which allows us to monitor formation of backbone hydrogen bonds
    and side-chain interactions in the transition state. The experiments reveal that
    α-helical structure in the S-peptide is absent in the transition state of binding.
    Recognition between the unfolded S-peptide and the S-protein is mediated by loosely
    packed hydrophobic side-chain interactions in two well defined regions on the
    S-peptide. Close packing and helix formation occurs rapidly after binding. Introducing
    hydrophobic residues at positions outside the recognition region can drastically
    slow down association.
article_processing_charge: No
article_type: original
author:
- first_name: Annett
  full_name: Bachmann, Annett
  last_name: Bachmann
- first_name: Dirk
  full_name: Wildemann, Dirk
  last_name: Wildemann
- first_name: Florian M
  full_name: Praetorius, Florian M
  id: dfec9381-4341-11ee-8fd8-faa02bba7d62
  last_name: Praetorius
- first_name: Gunter
  full_name: Fischer, Gunter
  last_name: Fischer
- first_name: Thomas
  full_name: Kiefhaber, Thomas
  last_name: Kiefhaber
citation:
  ama: Bachmann A, Wildemann D, Praetorius FM, Fischer G, Kiefhaber T. Mapping backbone
    and side-chain interactions in the transition state of a coupled protein folding
    and binding reaction. <i>PNAS</i>. 2011;108(10):3952-3957. doi:<a href="https://doi.org/10.1073/pnas.1012668108">10.1073/pnas.1012668108</a>
  apa: Bachmann, A., Wildemann, D., Praetorius, F. M., Fischer, G., &#38; Kiefhaber,
    T. (2011). Mapping backbone and side-chain interactions in the transition state
    of a coupled protein folding and binding reaction. <i>PNAS</i>. Proceedings of
    the National Academy of Sciences. <a href="https://doi.org/10.1073/pnas.1012668108">https://doi.org/10.1073/pnas.1012668108</a>
  chicago: Bachmann, Annett, Dirk Wildemann, Florian M Praetorius, Gunter Fischer,
    and Thomas Kiefhaber. “Mapping Backbone and Side-Chain Interactions in the Transition
    State of a Coupled Protein Folding and Binding Reaction.” <i>PNAS</i>. Proceedings
    of the National Academy of Sciences, 2011. <a href="https://doi.org/10.1073/pnas.1012668108">https://doi.org/10.1073/pnas.1012668108</a>.
  ieee: A. Bachmann, D. Wildemann, F. M. Praetorius, G. Fischer, and T. Kiefhaber,
    “Mapping backbone and side-chain interactions in the transition state of a coupled
    protein folding and binding reaction,” <i>PNAS</i>, vol. 108, no. 10. Proceedings
    of the National Academy of Sciences, pp. 3952–3957, 2011.
  ista: Bachmann A, Wildemann D, Praetorius FM, Fischer G, Kiefhaber T. 2011. Mapping
    backbone and side-chain interactions in the transition state of a coupled protein
    folding and binding reaction. PNAS. 108(10), 3952–3957.
  mla: Bachmann, Annett, et al. “Mapping Backbone and Side-Chain Interactions in the
    Transition State of a Coupled Protein Folding and Binding Reaction.” <i>PNAS</i>,
    vol. 108, no. 10, Proceedings of the National Academy of Sciences, 2011, pp. 3952–57,
    doi:<a href="https://doi.org/10.1073/pnas.1012668108">10.1073/pnas.1012668108</a>.
  short: A. Bachmann, D. Wildemann, F.M. Praetorius, G. Fischer, T. Kiefhaber, PNAS
    108 (2011) 3952–3957.
date_created: 2023-09-06T12:54:36Z
date_published: 2011-01-12T00:00:00Z
date_updated: 2023-11-07T11:50:29Z
day: '12'
doi: 10.1073/pnas.1012668108
extern: '1'
external_id:
  pmid:
  - '21325613'
fulldoi: https://doi.org/10.1073/pnas.1012668108
intvolume: '       108'
issue: '10'
keyword:
- Multidisciplinary
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1073/pnas.1012668108
month: '01'
oa: 1
oa_version: Published Version
page: 3952-3957
pmid: 1
publication: PNAS
publication_identifier:
  eissn:
  - 1091-6490
  issn:
  - 0027-8424
publication_status: published
publisher: Proceedings of the National Academy of Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mapping backbone and side-chain interactions in the transition state of a coupled
  protein folding and binding reaction
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 108
year: '2011'
...
---
_id: '1467'
abstract:
- lang: eng
  text: We propose a general conjecture for the mixed Hodge polynomial of the generic
    character varieties of representations of the fundamental group of a Riemann surface
    of genus g to GLn(C) with fixed generic semisimple conjugacy classes at k punctures.
    This conjecture generalizes the Cauchy identity for Macdonald polynomials and
    is a common generalization of two formulas that we prove in this paper. The first
    is a formula for the E-polynomial of these character varieties which we obtain
    using the character table of GLn(Fq). We use this formula to compute the Euler
    characteristic of character varieties. The second formula gives the Poincaré polynomial
    of certain associated quiver varieties which we obtain using the character table
    of gln(Fq). In the last main result we prove that the Poincaré polynomials of
    the quiver varieties equal certain multiplicities in the tensor product of irreducible
    characters of GLn(Fq). As a consequence we find a curious connection between Kac-Moody
    algebras associated with comet-shaped, and typically wild, quivers and the representation
    theory of GLn(Fq).
acknowledgement: |-
  Hausel’s work was supported by National Science Foundation grants DMS-0305505 and DMS-0604775, by an Alfred Sloan Fellowship, and by a Royal Society University Research Fellowship. Letellier’s work supported by Agence Nationale de la Recherche grant ANR-09-JCJC-0102-01.
  Rodriguez-Villegas’s work supported by National Science Foundation grant DMS-0200605, by an FRA from the University of Texas at Austin, by EPSRC grant EP/G027110/1, by visiting fellowships at All Souls and Wadham Colleges in Oxford, and by a Research Scholarship from the Clay Mathematical Institute.
author:
- first_name: Tamas
  full_name: Tamas Hausel
  id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
  last_name: Hausel
- first_name: Emmanuel
  full_name: Letellier, Emmanuel
  last_name: Letellier
- first_name: Fernando
  full_name: Rodríguez Villegas, Fernando
  last_name: Rodríguez Villegas
citation:
  ama: Hausel T, Letellier E, Rodríguez Villegas F. Arithmetic harmonic analysis on
    character and quiver varieties. <i>Duke Mathematical Journal</i>. 2011;160(2):323-400.
    doi:<a href="https://doi.org/10.1215/00127094-1444258">10.1215/00127094-1444258</a>
  apa: Hausel, T., Letellier, E., &#38; Rodríguez Villegas, F. (2011). Arithmetic
    harmonic analysis on character and quiver varieties. <i>Duke Mathematical Journal</i>.
    Duke University Press. <a href="https://doi.org/10.1215/00127094-1444258">https://doi.org/10.1215/00127094-1444258</a>
  chicago: Hausel, Tamás, Emmanuel Letellier, and Fernando Rodríguez Villegas. “Arithmetic
    Harmonic Analysis on Character and Quiver Varieties.” <i>Duke Mathematical Journal</i>.
    Duke University Press, 2011. <a href="https://doi.org/10.1215/00127094-1444258">https://doi.org/10.1215/00127094-1444258</a>.
  ieee: T. Hausel, E. Letellier, and F. Rodríguez Villegas, “Arithmetic harmonic analysis
    on character and quiver varieties,” <i>Duke Mathematical Journal</i>, vol. 160,
    no. 2. Duke University Press, pp. 323–400, 2011.
  ista: Hausel T, Letellier E, Rodríguez Villegas F. 2011. Arithmetic harmonic analysis
    on character and quiver varieties. Duke Mathematical Journal. 160(2), 323–400.
  mla: Hausel, Tamás, et al. “Arithmetic Harmonic Analysis on Character and Quiver
    Varieties.” <i>Duke Mathematical Journal</i>, vol. 160, no. 2, Duke University
    Press, 2011, pp. 323–400, doi:<a href="https://doi.org/10.1215/00127094-1444258">10.1215/00127094-1444258</a>.
  short: T. Hausel, E. Letellier, F. Rodríguez Villegas, Duke Mathematical Journal
    160 (2011) 323–400.
date_created: 2018-12-11T11:52:11Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2021-01-12T06:50:56Z
day: '01'
doi: 10.1215/00127094-1444258
extern: 1
fulldoi: https://doi.org/10.1215/00127094-1444258
intvolume: '       160'
issue: '2'
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/0810.2076
month: '01'
oa: 1
page: 323 - 400
publication: Duke Mathematical Journal
publication_status: published
publisher: Duke University Press
publist_id: '5728'
quality_controlled: 0
status: public
title: Arithmetic harmonic analysis on character and quiver varieties
type: journal_article
volume: 160
year: '2011'
...
---
_id: '1863'
abstract:
- lang: eng
  text: The Levene model is the simplest mathematical model to describe the evolution
    of gene frequencies in spatially subdivided populations. It provides insight into
    how locally varying selection promotes a population’s genetic diversity. Despite
    its simplicity, interesting problems have remained unsolved even in the diallelic
    case. In this paper we answer an open problem by establishing that for two alleles
    at one locus and J demes, up to 2J−1 polymorphic equilibria may coexist. We first
    present a proof for the case of stable monomorphisms and then show that the result
    also holds for protected alleles. These findings allow us to prove that any odd
    number (up to 2J−1) of equilibria is possible, before we extend the proof to even
    numbers. We conclude with some numerical results and show that for J&gt;2, the
    proportion of parameter space affording this maximum is extremely small.
acknowledgement: FWF 21305
author:
- first_name: Sebastian
  full_name: Sebastian Novak
  id: 461468AE-F248-11E8-B48F-1D18A9856A87
  last_name: Novak
citation:
  ama: Novak S. The number of equilibria in the diallelic Levene model with multiple
    demes. <i>Theoretical Population Biology</i>. 2011;79(3):97-101. doi:<a href="https://doi.org/10.1016/j.tpb.2010.12.002">10.1016/j.tpb.2010.12.002</a>
  apa: Novak, S. (2011). The number of equilibria in the diallelic Levene model with
    multiple demes. <i>Theoretical Population Biology</i>. Academic Press. <a href="https://doi.org/10.1016/j.tpb.2010.12.002">https://doi.org/10.1016/j.tpb.2010.12.002</a>
  chicago: Novak, Sebastian. “The Number of Equilibria in the Diallelic Levene Model
    with Multiple Demes.” <i>Theoretical Population Biology</i>. Academic Press, 2011.
    <a href="https://doi.org/10.1016/j.tpb.2010.12.002">https://doi.org/10.1016/j.tpb.2010.12.002</a>.
  ieee: S. Novak, “The number of equilibria in the diallelic Levene model with multiple
    demes,” <i>Theoretical Population Biology</i>, vol. 79, no. 3. Academic Press,
    pp. 97–101, 2011.
  ista: Novak S. 2011. The number of equilibria in the diallelic Levene model with
    multiple demes. Theoretical Population Biology. 79(3), 97–101.
  mla: Novak, Sebastian. “The Number of Equilibria in the Diallelic Levene Model with
    Multiple Demes.” <i>Theoretical Population Biology</i>, vol. 79, no. 3, Academic
    Press, 2011, pp. 97–101, doi:<a href="https://doi.org/10.1016/j.tpb.2010.12.002">10.1016/j.tpb.2010.12.002</a>.
  short: S. Novak, Theoretical Population Biology 79 (2011) 97–101.
date_created: 2018-12-11T11:54:25Z
date_published: 2011-05-01T00:00:00Z
date_updated: 2021-01-12T06:53:42Z
day: '01'
doi: 10.1016/j.tpb.2010.12.002
extern: 1
fulldoi: https://doi.org/10.1016/j.tpb.2010.12.002
intvolume: '        79'
issue: '3'
month: '05'
page: 97 - 101
publication: Theoretical Population Biology
publication_status: published
publisher: Academic Press
publist_id: '5236'
quality_controlled: 0
status: public
title: The number of equilibria in the diallelic Levene model with multiple demes
tmp:
  image: /images/cc_by_nc_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
    (CC BY-NC-ND 4.0)
  short: CC BY-NC-ND (4.0)
type: journal_article
volume: 79
year: '2011'
...
---
_id: '1973'
abstract:
- lang: eng
  text: Complex I is the first and largest enzyme of the respiratory chain, coupling
    electron transfer between NADH and ubiquinone to the translocation of four protons
    across the membrane. It has a central role in cellular energy production and has
    been implicated in many human neurodegenerative diseases. The L-shaped enzyme
    consists of hydrophilic and membrane domains. Previously, we determined the structure
    of the hydrophilic domain. Here we report the crystal structure of the Esherichia
    coli complex I membrane domain at 3.0 Ã. resolution. It includes six subunits,
    NuoL, NuoM, NuoN, NuoA, NuoJ and NuoK, with 55 transmembrane helices. The fold
    of the homologous antiporter-like subunits L, M and N is novel, with two inverted
    structural repeats of five transmembrane helices arranged, unusually, face-to-back.
    Each repeat includes a discontinuous transmembrane helix and forms half of a channel
    across the membrane. A network of conserved polar residues connects the two half-channels,
    completing the proton translocation pathway. Unexpectedly, lysines rather than
    carboxylate residues act as the main elements of the proton pump in these subunits.
    The fourth probable proton-translocation channel is at the interface of subunits
    N, K, J and A. The structure indicates that proton translocation in complex I,
    uniquely, involves coordinated conformational changes in six symmetrical structural
    elements.
acknowledgement: This work was funded by the Medical Research Council.
author:
- first_name: Rouslan
  full_name: Efremov, Rouslan G
  last_name: Efremov
- first_name: Leonid A
  full_name: Leonid Sazanov
  id: 338D39FE-F248-11E8-B48F-1D18A9856A87
  last_name: Sazanov
  orcid: 0000-0002-0977-7989
citation:
  ama: Efremov R, Sazanov LA. Structure of the membrane domain of respiratory complex
    i. <i>Nature</i>. 2011;476(7361):414-421. doi:<a href="https://doi.org/10.1038/nature10330">10.1038/nature10330</a>
  apa: Efremov, R., &#38; Sazanov, L. A. (2011). Structure of the membrane domain
    of respiratory complex i. <i>Nature</i>. Nature Publishing Group. <a href="https://doi.org/10.1038/nature10330">https://doi.org/10.1038/nature10330</a>
  chicago: Efremov, Rouslan, and Leonid A Sazanov. “Structure of the Membrane Domain
    of Respiratory Complex I.” <i>Nature</i>. Nature Publishing Group, 2011. <a href="https://doi.org/10.1038/nature10330">https://doi.org/10.1038/nature10330</a>.
  ieee: R. Efremov and L. A. Sazanov, “Structure of the membrane domain of respiratory
    complex i,” <i>Nature</i>, vol. 476, no. 7361. Nature Publishing Group, pp. 414–421,
    2011.
  ista: Efremov R, Sazanov LA. 2011. Structure of the membrane domain of respiratory
    complex i. Nature. 476(7361), 414–421.
  mla: Efremov, Rouslan, and Leonid A. Sazanov. “Structure of the Membrane Domain
    of Respiratory Complex I.” <i>Nature</i>, vol. 476, no. 7361, Nature Publishing
    Group, 2011, pp. 414–21, doi:<a href="https://doi.org/10.1038/nature10330">10.1038/nature10330</a>.
  short: R. Efremov, L.A. Sazanov, Nature 476 (2011) 414–421.
date_created: 2018-12-11T11:54:59Z
date_published: 2011-08-25T00:00:00Z
date_updated: 2021-01-12T06:54:26Z
day: '25'
doi: 10.1038/nature10330
extern: 1
fulldoi: https://doi.org/10.1038/nature10330
intvolume: '       476'
issue: '7361'
month: '08'
page: 414 - 421
publication: Nature
publication_status: published
publisher: Nature Publishing Group
publist_id: '5110'
quality_controlled: 0
status: public
title: Structure of the membrane domain of respiratory complex i
type: journal_article
volume: 476
year: '2011'
...
---
_id: '1974'
abstract:
- lang: eng
  text: Complex I is the first enzyme of the respiratory chain and plays a central
    role in cellular energy production. It has been implicated in many human neurodegenerative
    diseases, as well as in ageing. One of the biggest membrane protein complexes,
    it is an L-shaped assembly consisting of hydrophilic and membrane domains. Previously,
    we have determined structures of the hydrophilic domain in several redox states.
    Last year was marked by fascinating breakthroughs in the understanding of the
    complete structure. We described the architecture of the membrane domain and of
    the entire bacterial complex I. X-ray analysis of the larger mitochondrial enzyme
    has also been published. The core subunits of the bacterial and mitochondrial
    enzymes have remarkably similar structures. The proposed mechanism of coupling
    between electron transfer and proton translocation involves long-range conformational
    changes, coordinated in part by a long α-helix, akin to the coupling rod of a
    steam engine.
acknowledgement: The work in authors’ laboratory was funded by the Medical Research
  Council.
author:
- first_name: Rouslan
  full_name: Efremov, Rouslan G
  last_name: Efremov
- first_name: Leonid A
  full_name: Leonid Sazanov
  id: 338D39FE-F248-11E8-B48F-1D18A9856A87
  last_name: Sazanov
  orcid: 0000-0002-0977-7989
citation:
  ama: 'Efremov R, Sazanov LA. Respiratory complex I: “steam engine” of the cell?
    <i>Current Opinion in Structural Biology</i>. 2011;21(4):532-540. doi:<a href="https://doi.org/10.1016/j.sbi.2011.07.002">10.1016/j.sbi.2011.07.002</a>'
  apa: 'Efremov, R., &#38; Sazanov, L. A. (2011). Respiratory complex I: “steam engine”
    of the cell? <i>Current Opinion in Structural Biology</i>. Elsevier. <a href="https://doi.org/10.1016/j.sbi.2011.07.002">https://doi.org/10.1016/j.sbi.2011.07.002</a>'
  chicago: 'Efremov, Rouslan, and Leonid A Sazanov. “Respiratory Complex I: ‘steam
    Engine’ of the Cell?” <i>Current Opinion in Structural Biology</i>. Elsevier,
    2011. <a href="https://doi.org/10.1016/j.sbi.2011.07.002">https://doi.org/10.1016/j.sbi.2011.07.002</a>.'
  ieee: 'R. Efremov and L. A. Sazanov, “Respiratory complex I: ‘steam engine’ of the
    cell?,” <i>Current Opinion in Structural Biology</i>, vol. 21, no. 4. Elsevier,
    pp. 532–540, 2011.'
  ista: 'Efremov R, Sazanov LA. 2011. Respiratory complex I: ‘steam engine’ of the
    cell? Current Opinion in Structural Biology. 21(4), 532–540.'
  mla: 'Efremov, Rouslan, and Leonid A. Sazanov. “Respiratory Complex I: ‘steam Engine’
    of the Cell?” <i>Current Opinion in Structural Biology</i>, vol. 21, no. 4, Elsevier,
    2011, pp. 532–40, doi:<a href="https://doi.org/10.1016/j.sbi.2011.07.002">10.1016/j.sbi.2011.07.002</a>.'
  short: R. Efremov, L.A. Sazanov, Current Opinion in Structural Biology 21 (2011)
    532–540.
date_created: 2018-12-11T11:54:59Z
date_published: 2011-08-01T00:00:00Z
date_updated: 2021-01-12T06:54:27Z
day: '01'
doi: 10.1016/j.sbi.2011.07.002
extern: 1
fulldoi: https://doi.org/10.1016/j.sbi.2011.07.002
intvolume: '        21'
issue: '4'
month: '08'
page: 532 - 540
publication: Current Opinion in Structural Biology
publication_status: published
publisher: Elsevier
publist_id: '5111'
quality_controlled: 0
status: public
title: 'Respiratory complex I: ''steam engine'' of the cell?'
type: journal_article
volume: 21
year: '2011'
...
---
_id: '1975'
abstract:
- lang: eng
  text: 'Modern α-proteobacteria are thought to be closely related to the ancient
    symbiont of eukaryotes, an ancestor of mitochondria. Respiratory complex I from
    α-proteobacteria and mitochondria is well conserved at the level of the 14 &quot;core&quot;
    subunits, consistent with that notion. Mitochondrial complex I contains the core
    subunits, present in all species, and up to 31 &quot;supernumerary&quot; subunits,
    generally thought to have originated only within eukaryotic lineages. However,
    the full protein composition of an α-proteobacterial complex I has not been established
    previously. Here, we report the first purification and characterization of complex
    I from the α-proteobacterium Paracoccus denitrificans. Single particle electron
    microscopy shows that the complex has a well defined L-shape. Unexpectedly, in
    addition to the 14 core subunits, the enzyme also contains homologues of three
    supernumerary mitochondrial subunits as follows: B17.2, AQDQ/18, and 13 kDa (bovine
    nomenclature). This finding suggests that evolution of complex I via addition
    of supernumerary or &quot;accessory&quot; subunits started before the original
    endosymbiotic event that led to the creation of the eukaryotic cell. It also provides
    further confirmation that α-proteobacteria are the closest extant relatives of
    mitochondria.'
acknowledgement: 'This work was supported by the Medical Research Council. '
author:
- first_name: Chui
  full_name: Yip, Chui Y
  last_name: Yip
- first_name: Michael
  full_name: Harbour, Michael E
  last_name: Harbour
- first_name: Kamburapola
  full_name: Jayawardena, Kamburapola G
  last_name: Jayawardena
- first_name: Ian
  full_name: Fearnley, Ian M
  last_name: Fearnley
- first_name: Leonid A
  full_name: Leonid Sazanov
  id: 338D39FE-F248-11E8-B48F-1D18A9856A87
  last_name: Sazanov
  orcid: 0000-0002-0977-7989
citation:
  ama: Yip C, Harbour M, Jayawardena K, Fearnley I, Sazanov LA. Evolution of respiratory
    complex I &#38;quot;Supernumerary&#38;quot; subunits are present in the α-proteobacterial
    enzyme. <i>Journal of Biological Chemistry</i>. 2011;286(7):5023-5033. doi:<a
    href="https://doi.org/10.1074/jbc.M110.194993">10.1074/jbc.M110.194993</a>
  apa: Yip, C., Harbour, M., Jayawardena, K., Fearnley, I., &#38; Sazanov, L. A. (2011).
    Evolution of respiratory complex I &#38;quot;Supernumerary&#38;quot; subunits
    are present in the α-proteobacterial enzyme. <i>Journal of Biological Chemistry</i>.
    American Society for Biochemistry and Molecular Biology. <a href="https://doi.org/10.1074/jbc.M110.194993">https://doi.org/10.1074/jbc.M110.194993</a>
  chicago: Yip, Chui, Michael Harbour, Kamburapola Jayawardena, Ian Fearnley, and
    Leonid A Sazanov. “Evolution of Respiratory Complex I &#38;quot;Supernumerary&#38;quot;
    Subunits Are Present in the α-Proteobacterial Enzyme.” <i>Journal of Biological
    Chemistry</i>. American Society for Biochemistry and Molecular Biology, 2011.
    <a href="https://doi.org/10.1074/jbc.M110.194993">https://doi.org/10.1074/jbc.M110.194993</a>.
  ieee: C. Yip, M. Harbour, K. Jayawardena, I. Fearnley, and L. A. Sazanov, “Evolution
    of respiratory complex I &#38;quot;Supernumerary&#38;quot; subunits are present
    in the α-proteobacterial enzyme,” <i>Journal of Biological Chemistry</i>, vol.
    286, no. 7. American Society for Biochemistry and Molecular Biology, pp. 5023–5033,
    2011.
  ista: Yip C, Harbour M, Jayawardena K, Fearnley I, Sazanov LA. 2011. Evolution of
    respiratory complex I &#38;quot;Supernumerary&#38;quot; subunits are present in
    the α-proteobacterial enzyme. Journal of Biological Chemistry. 286(7), 5023–5033.
  mla: Yip, Chui, et al. “Evolution of Respiratory Complex I &#38;quot;Supernumerary&#38;quot;
    Subunits Are Present in the α-Proteobacterial Enzyme.” <i>Journal of Biological
    Chemistry</i>, vol. 286, no. 7, American Society for Biochemistry and Molecular
    Biology, 2011, pp. 5023–33, doi:<a href="https://doi.org/10.1074/jbc.M110.194993">10.1074/jbc.M110.194993</a>.
  short: C. Yip, M. Harbour, K. Jayawardena, I. Fearnley, L.A. Sazanov, Journal of
    Biological Chemistry 286 (2011) 5023–5033.
date_created: 2018-12-11T11:55:00Z
date_published: 2011-02-18T00:00:00Z
date_updated: 2021-01-12T06:54:27Z
day: '18'
doi: 10.1074/jbc.M110.194993
extern: 1
fulldoi: https://doi.org/10.1074/jbc.M110.194993
intvolume: '       286'
issue: '7'
month: '02'
page: 5023 - 5033
publication: Journal of Biological Chemistry
publication_status: published
publisher: American Society for Biochemistry and Molecular Biology
publist_id: '5112'
quality_controlled: 0
status: public
title: Evolution of respiratory complex I &quot;Supernumerary&quot; subunits are present
  in the α-proteobacterial enzyme
type: journal_article
volume: 286
year: '2011'
...
---
_id: '469'
abstract:
- lang: eng
  text: 'Spontaneous release of glutamate is important for maintaining synaptic strength
    and controlling spike timing in the brain. Mechanisms regulating spontaneous exocytosis
    remain poorly understood. Extracellular calcium concentration ([Ca2+]o) regulates
    Ca2+ entry through voltage-activated calcium channels (VACCs) and consequently
    is a pivotal determinant of action potential-evoked vesicle fusion. Extracellular
    Ca 2+ also enhances spontaneous release, but via unknown mechanisms. Here we report
    that external Ca2+ triggers spontaneous glutamate release more weakly than evoked
    release in mouse neocortical neurons. Blockade of VACCs has no effect on the spontaneous
    release rate or its dependence on [Ca2+]o. Intracellular [Ca2+] slowly increases
    in a minority of neurons following increases in [Ca2+]o. Furthermore, the enhancement
    of spontaneous release by extracellular calcium is insensitive to chelation of
    intracellular calcium by BAPTA. Activation of the calcium-sensing receptor (CaSR),
    a G-protein-coupled receptor present in nerve terminals, by several specific agonists
    increased spontaneous glutamate release. The frequency of spontaneous synaptic
    transmission was decreased in CaSR mutant neurons. The concentration-effect relationship
    for extracellular calcium regulation of spontaneous release was well described
    by a combination of CaSR-dependent and CaSR-independent mechanisms. Overall these
    results indicate that extracellular Ca2+ does not trigger spontaneous glutamate
    release by simply increasing calcium influx but stimulates CaSR and thereby promotes
    resting spontaneous glutamate release. '
article_processing_charge: No
author:
- first_name: Nicholas
  full_name: Vyleta, Nicholas
  id: 36C4978E-F248-11E8-B48F-1D18A9856A87
  last_name: Vyleta
- first_name: Stephen
  full_name: Smith, Stephen
  last_name: Smith
citation:
  ama: Vyleta N, Smith S. Spontaneous glutamate release is independent of calcium
    influx and tonically activated by the calcium-sensing receptor. <i>European Journal
    of Neuroscience</i>. 2011;31(12):4593-4606. doi:<a href="https://doi.org/10.1523/JNEUROSCI.6398-10.2011">10.1523/JNEUROSCI.6398-10.2011</a>
  apa: Vyleta, N., &#38; Smith, S. (2011). Spontaneous glutamate release is independent
    of calcium influx and tonically activated by the calcium-sensing receptor. <i>European
    Journal of Neuroscience</i>. Wiley-Blackwell. <a href="https://doi.org/10.1523/JNEUROSCI.6398-10.2011">https://doi.org/10.1523/JNEUROSCI.6398-10.2011</a>
  chicago: Vyleta, Nicholas, and Stephen Smith. “Spontaneous Glutamate Release Is
    Independent of Calcium Influx and Tonically Activated by the Calcium-Sensing Receptor.”
    <i>European Journal of Neuroscience</i>. Wiley-Blackwell, 2011. <a href="https://doi.org/10.1523/JNEUROSCI.6398-10.2011">https://doi.org/10.1523/JNEUROSCI.6398-10.2011</a>.
  ieee: N. Vyleta and S. Smith, “Spontaneous glutamate release is independent of calcium
    influx and tonically activated by the calcium-sensing receptor,” <i>European Journal
    of Neuroscience</i>, vol. 31, no. 12. Wiley-Blackwell, pp. 4593–4606, 2011.
  ista: Vyleta N, Smith S. 2011. Spontaneous glutamate release is independent of calcium
    influx and tonically activated by the calcium-sensing receptor. European Journal
    of Neuroscience. 31(12), 4593–4606.
  mla: Vyleta, Nicholas, and Stephen Smith. “Spontaneous Glutamate Release Is Independent
    of Calcium Influx and Tonically Activated by the Calcium-Sensing Receptor.” <i>European
    Journal of Neuroscience</i>, vol. 31, no. 12, Wiley-Blackwell, 2011, pp. 4593–606,
    doi:<a href="https://doi.org/10.1523/JNEUROSCI.6398-10.2011">10.1523/JNEUROSCI.6398-10.2011</a>.
  short: N. Vyleta, S. Smith, European Journal of Neuroscience 31 (2011) 4593–4606.
date_created: 2018-12-11T11:46:39Z
date_published: 2011-03-23T00:00:00Z
date_updated: 2025-09-30T09:25:10Z
day: '23'
department:
- _id: PeJo
doi: 10.1523/JNEUROSCI.6398-10.2011
external_id:
  isi:
  - '000288750700025'
fulldoi: https://doi.org/10.1523/JNEUROSCI.6398-10.2011
intvolume: '        31'
isi: 1
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3097128/
month: '03'
oa: 1
oa_version: Submitted Version
page: 4593 - 4606
publication: European Journal of Neuroscience
publication_status: published
publisher: Wiley-Blackwell
publist_id: '7353'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Spontaneous glutamate release is independent of calcium influx and tonically
  activated by the calcium-sensing receptor
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 31
year: '2011'
...
---
_id: '490'
abstract:
- lang: eng
  text: 'BioSig is an open source software library for biomedical signal processing.
    The aim of the BioSig project is to foster research in biomedical signal processing
    by providing free and open source software tools for many different application
    areas. Some of the areas where BioSig can be employed are neuroinformatics, brain-computer
    interfaces, neurophysiology, psychology, cardiovascular systems, and sleep research.
    Moreover, the analysis of biosignals such as the electroencephalogram (EEG), electrocorticogram
    (ECoG), electrocardiogram (ECG), electrooculogram (EOG), electromyogram (EMG),
    or respiration signals is a very relevant element of the BioSig project. Specifically,
    BioSig provides solutions for data acquisition, artifact processing, quality control,
    feature extraction, classification, modeling, and data visualization, to name
    a few. In this paper, we highlight several methods to help students and researchers
    to work more efficiently with biomedical signals. '
article_number: '935364'
article_processing_charge: No
author:
- first_name: Alois
  full_name: Schlögl, Alois
  id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
  last_name: Schlögl
  orcid: 0000-0002-5621-8100
- first_name: Carmen
  full_name: Vidaurre, Carmen
  last_name: Vidaurre
- first_name: Tilmann
  full_name: Sander, Tilmann
  last_name: Sander
citation:
  ama: 'Schlögl A, Vidaurre C, Sander T. BioSig: The free and open source software
    library for biomedical signal processing. <i>Computational Intelligence and Neuroscience</i>.
    2011;2011. doi:<a href="https://doi.org/10.1155/2011/935364">10.1155/2011/935364</a>'
  apa: 'Schlögl, A., Vidaurre, C., &#38; Sander, T. (2011). BioSig: The free and open
    source software library for biomedical signal processing. <i>Computational Intelligence
    and Neuroscience</i>. Hindawi Publishing Corporation. <a href="https://doi.org/10.1155/2011/935364">https://doi.org/10.1155/2011/935364</a>'
  chicago: 'Schlögl, Alois, Carmen Vidaurre, and Tilmann Sander. “BioSig: The Free
    and Open Source Software Library for Biomedical Signal Processing.” <i>Computational
    Intelligence and Neuroscience</i>. Hindawi Publishing Corporation, 2011. <a href="https://doi.org/10.1155/2011/935364">https://doi.org/10.1155/2011/935364</a>.'
  ieee: 'A. Schlögl, C. Vidaurre, and T. Sander, “BioSig: The free and open source
    software library for biomedical signal processing,” <i>Computational Intelligence
    and Neuroscience</i>, vol. 2011. Hindawi Publishing Corporation, 2011.'
  ista: 'Schlögl A, Vidaurre C, Sander T. 2011. BioSig: The free and open source software
    library for biomedical signal processing. Computational Intelligence and Neuroscience.
    2011, 935364.'
  mla: 'Schlögl, Alois, et al. “BioSig: The Free and Open Source Software Library
    for Biomedical Signal Processing.” <i>Computational Intelligence and Neuroscience</i>,
    vol. 2011, 935364, Hindawi Publishing Corporation, 2011, doi:<a href="https://doi.org/10.1155/2011/935364">10.1155/2011/935364</a>.'
  short: A. Schlögl, C. Vidaurre, T. Sander, Computational Intelligence and Neuroscience
    2011 (2011).
corr_author: '1'
date_created: 2018-12-11T11:46:45Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2025-09-30T09:24:43Z
day: '01'
ddc:
- '005'
department:
- _id: ScienComp
- _id: PeJo
doi: 10.1155/2011/935364
external_id:
  isi:
  - '000208906100033'
file:
- access_level: open_access
  checksum: 8263bbf255171f2054f43f3db5f53b6e
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:07:44Z
  date_updated: 2020-07-14T12:46:35Z
  file_id: '4642'
  file_name: IST-2018-947-v1+1_2011_Schloegl_BioSig.pdf
  file_size: 2863551
  relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
fulldoi: https://doi.org/10.1155/2011/935364
has_accepted_license: '1'
intvolume: '      2011'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
publication: Computational Intelligence and Neuroscience
publication_status: published
publisher: Hindawi Publishing Corporation
publist_id: '7330'
pubrep_id: '947'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'BioSig: The free and open source software library for biomedical signal processing'
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 2011
year: '2011'
...
---
_id: '491'
abstract:
- lang: eng
  text: In their search for antigens, lymphocytes continuously shuttle among blood
    vessels, lymph vessels, and lymphatic tissues. Chemokines mediate entry of lymphocytes
    into lymphatic tissues, and sphingosine 1-phosphate (S1P) promotes localization
    of lymphocytes to the vasculature. Both signals are sensed through G protein-coupled
    receptors (GPCRs). Most GPCRs undergo ligand-dependent homologous receptor desensitization,
    a process that decreases their signaling output after previous exposure to high
    ligand concentration. Such desensitization can explain why lymphocytes do not
    take an intermediate position between two signals but rather oscillate between
    them. The desensitization of S1P receptor 1 (S1PR1) is mediated by GPCR kinase
    2 (GRK2). Deletion of GRK2 in lymphocytes compromises desensitization by high
    vascular S1P concentrations, thereby reducing responsiveness to the chemokine
    signal and trapping the cells in the vascular compartment. The desensitization
    kinetics of S1PR1 allows lymphocytes to dynamically shuttle between vasculature
    and lymphatic tissue, although the positional information in both compartments
    is static.
article_number: pe43
article_processing_charge: No
author:
- first_name: Alexander
  full_name: Eichner, Alexander
  id: 4DFA52AE-F248-11E8-B48F-1D18A9856A87
  last_name: Eichner
- first_name: Michael K
  full_name: Sixt, Michael K
  id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
  last_name: Sixt
  orcid: 0000-0002-6620-9179
citation:
  ama: Eichner A, Sixt MK. Setting the clock for recirculating lymphocytes. <i>Science
    Signaling</i>. 2011;4(198). doi:<a href="https://doi.org/10.1126/scisignal.2002617">10.1126/scisignal.2002617</a>
  apa: Eichner, A., &#38; Sixt, M. K. (2011). Setting the clock for recirculating
    lymphocytes. <i>Science Signaling</i>. American Association for the Advancement
    of Science. <a href="https://doi.org/10.1126/scisignal.2002617">https://doi.org/10.1126/scisignal.2002617</a>
  chicago: Eichner, Alexander, and Michael K Sixt. “Setting the Clock for Recirculating
    Lymphocytes.” <i>Science Signaling</i>. American Association for the Advancement
    of Science, 2011. <a href="https://doi.org/10.1126/scisignal.2002617">https://doi.org/10.1126/scisignal.2002617</a>.
  ieee: A. Eichner and M. K. Sixt, “Setting the clock for recirculating lymphocytes,”
    <i>Science Signaling</i>, vol. 4, no. 198. American Association for the Advancement
    of Science, 2011.
  ista: Eichner A, Sixt MK. 2011. Setting the clock for recirculating lymphocytes.
    Science Signaling. 4(198), pe43.
  mla: Eichner, Alexander, and Michael K. Sixt. “Setting the Clock for Recirculating
    Lymphocytes.” <i>Science Signaling</i>, vol. 4, no. 198, pe43, American Association
    for the Advancement of Science, 2011, doi:<a href="https://doi.org/10.1126/scisignal.2002617">10.1126/scisignal.2002617</a>.
  short: A. Eichner, M.K. Sixt, Science Signaling 4 (2011).
corr_author: '1'
date_created: 2018-12-11T11:46:46Z
date_published: 2011-11-08T00:00:00Z
date_updated: 2025-09-30T09:24:17Z
day: '08'
department:
- _id: MiSi
doi: 10.1126/scisignal.2002617
external_id:
  isi:
  - '000296800500002'
fulldoi: https://doi.org/10.1126/scisignal.2002617
intvolume: '         4'
isi: 1
issue: '198'
language:
- iso: eng
month: '11'
oa_version: None
publication: Science Signaling
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '7329'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Setting the clock for recirculating lymphocytes
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 4
year: '2011'
...
---
_id: '518'
abstract:
- lang: eng
  text: Cancer stem cells or cancer initiating cells are believed to contribute to
    cancer recurrence after therapy. MicroRNAs (miRNAs) are short RNA molecules with
    fundamental roles in gene regulation. The role of miRNAs in cancer stem cells
    is only poorly understood. Here, we report miRNA expression profiles of glioblastoma
    stem cell-containing CD133 + cell populations. We find that miR-9, miR-9 * (referred
    to as miR-9/9 *), miR-17 and miR-106b are highly abundant in CD133 + cells. Furthermore,
    inhibition of miR-9/9 * or miR-17 leads to reduced neurosphere formation and stimulates
    cell differentiation. Calmodulin-binding transcription activator 1 (CAMTA1) is
    a putative transcription factor, which induces the expression of the anti-proliferative
    cardiac hormone natriuretic peptide A (NPPA). We identify CAMTA1 as an miR-9/9
    * and miR-17 target. CAMTA1 expression leads to reduced neurosphere formation
    and tumour growth in nude mice, suggesting that CAMTA1 can function as tumour
    suppressor. Consistently, CAMTA1 and NPPA expression correlate with patient survival.
    Our findings could provide a basis for novel strategies of glioblastoma therapy.
article_processing_charge: No
article_type: original
author:
- first_name: Daniel
  full_name: Schraivogel, Daniel
  last_name: Schraivogel
- first_name: Lasse
  full_name: Weinmann, Lasse
  last_name: Weinmann
- first_name: Dagmar
  full_name: Beier, Dagmar
  last_name: Beier
- first_name: Ghazaleh
  full_name: Tabatabai, Ghazaleh
  last_name: Tabatabai
- first_name: Alexander
  full_name: Eichner, Alexander
  id: 4DFA52AE-F248-11E8-B48F-1D18A9856A87
  last_name: Eichner
- first_name: Jia
  full_name: Zhu, Jia
  last_name: Zhu
- first_name: Martina
  full_name: Anton, Martina
  last_name: Anton
- first_name: Michael K
  full_name: Sixt, Michael K
  id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
  last_name: Sixt
  orcid: 0000-0002-6620-9179
- first_name: Michael
  full_name: Weller, Michael
  last_name: Weller
- first_name: Christoph
  full_name: Beier, Christoph
  last_name: Beier
- first_name: Gunter
  full_name: Meister, Gunter
  last_name: Meister
citation:
  ama: Schraivogel D, Weinmann L, Beier D, et al. CAMTA1 is a novel tumour suppressor
    regulated by miR-9/9 * in glioblastoma stem cells. <i>EMBO Journal</i>. 2011;30(20):4309-4322.
    doi:<a href="https://doi.org/10.1038/emboj.2011.301">10.1038/emboj.2011.301</a>
  apa: Schraivogel, D., Weinmann, L., Beier, D., Tabatabai, G., Eichner, A., Zhu,
    J., … Meister, G. (2011). CAMTA1 is a novel tumour suppressor regulated by miR-9/9
    * in glioblastoma stem cells. <i>EMBO Journal</i>. Wiley-Blackwell. <a href="https://doi.org/10.1038/emboj.2011.301">https://doi.org/10.1038/emboj.2011.301</a>
  chicago: Schraivogel, Daniel, Lasse Weinmann, Dagmar Beier, Ghazaleh Tabatabai,
    Alexander Eichner, Jia Zhu, Martina Anton, et al. “CAMTA1 Is a Novel Tumour Suppressor
    Regulated by MiR-9/9 * in Glioblastoma Stem Cells.” <i>EMBO Journal</i>. Wiley-Blackwell,
    2011. <a href="https://doi.org/10.1038/emboj.2011.301">https://doi.org/10.1038/emboj.2011.301</a>.
  ieee: D. Schraivogel <i>et al.</i>, “CAMTA1 is a novel tumour suppressor regulated
    by miR-9/9 * in glioblastoma stem cells,” <i>EMBO Journal</i>, vol. 30, no. 20.
    Wiley-Blackwell, pp. 4309–4322, 2011.
  ista: Schraivogel D, Weinmann L, Beier D, Tabatabai G, Eichner A, Zhu J, Anton M,
    Sixt MK, Weller M, Beier C, Meister G. 2011. CAMTA1 is a novel tumour suppressor
    regulated by miR-9/9 * in glioblastoma stem cells. EMBO Journal. 30(20), 4309–4322.
  mla: Schraivogel, Daniel, et al. “CAMTA1 Is a Novel Tumour Suppressor Regulated
    by MiR-9/9 * in Glioblastoma Stem Cells.” <i>EMBO Journal</i>, vol. 30, no. 20,
    Wiley-Blackwell, 2011, pp. 4309–22, doi:<a href="https://doi.org/10.1038/emboj.2011.301">10.1038/emboj.2011.301</a>.
  short: D. Schraivogel, L. Weinmann, D. Beier, G. Tabatabai, A. Eichner, J. Zhu,
    M. Anton, M.K. Sixt, M. Weller, C. Beier, G. Meister, EMBO Journal 30 (2011) 4309–4322.
date_created: 2018-12-11T11:46:55Z
date_published: 2011-10-19T00:00:00Z
date_updated: 2025-09-30T09:23:51Z
day: '19'
department:
- _id: MiSi
doi: 10.1038/emboj.2011.301
external_id:
  isi:
  - '000296715800018'
  pmid:
  - '21857646'
fulldoi: https://doi.org/10.1038/emboj.2011.301
intvolume: '        30'
isi: 1
issue: '20'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3199389/
month: '10'
oa: 1
oa_version: Submitted Version
page: 4309 - 4322
pmid: 1
publication: EMBO Journal
publication_status: published
publisher: Wiley-Blackwell
publist_id: '7301'
quality_controlled: '1'
scopus_import: '1'
status: public
title: CAMTA1 is a novel tumour suppressor regulated by miR-9/9 * in glioblastoma
  stem cells
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 30
year: '2011'
...
---
_id: '531'
abstract:
- lang: eng
  text: Software transactional memories (STM) are described in the literature with
    assumptions of sequentially consistent program execution and atomicity of high
    level operations like read, write, and abort. However, in a realistic setting,
    processors use relaxed memory models to optimize hardware performance. Moreover,
    the atomicity of operations depends on the underlying hardware. This paper presents
    the first approach to verify STMs under relaxed memory models with atomicity of
    32 bit loads and stores, and read-modify-write operations. We describe RML, a
    simple language for expressing concurrent programs. We develop a semantics of
    RML parametrized by a relaxed memory model. We then present our tool, FOIL, which
    takes as input the RML description of an STM algorithm restricted to two threads
    and two variables, and the description of a memory model, and automatically determines
    the locations of fences, which if inserted, ensure the correctness of the restricted
    STM algorithm under the given memory model. We use FOIL to verify DSTM, TL2, and
    McRT STM under the memory models of sequential consistency, total store order,
    partial store order, and relaxed memory order for two threads and two variables.
    Finally, we extend the verification results for DSTM and TL2 to an arbitrary number
    of threads and variables by manually proving that the structural properties of
    STMs are satisfied at the hardware level of atomicity under the considered relaxed
    memory models.
article_processing_charge: No
article_type: original
author:
- first_name: Rachid
  full_name: Guerraoui, Rachid
  last_name: Guerraoui
- 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: Vasu
  full_name: Singh, Vasu
  id: 4DAE2708-F248-11E8-B48F-1D18A9856A87
  last_name: Singh
citation:
  ama: Guerraoui R, Henzinger TA, Singh V. Verification of STM on relaxed memory models.
    <i>Formal Methods in System Design</i>. 2011;39(3):297-331. doi:<a href="https://doi.org/10.1007/s10703-011-0131-3">10.1007/s10703-011-0131-3</a>
  apa: Guerraoui, R., Henzinger, T. A., &#38; Singh, V. (2011). Verification of STM
    on relaxed memory models. <i>Formal Methods in System Design</i>. Springer. <a
    href="https://doi.org/10.1007/s10703-011-0131-3">https://doi.org/10.1007/s10703-011-0131-3</a>
  chicago: Guerraoui, Rachid, Thomas A Henzinger, and Vasu Singh. “Verification of
    STM on Relaxed Memory Models.” <i>Formal Methods in System Design</i>. Springer,
    2011. <a href="https://doi.org/10.1007/s10703-011-0131-3">https://doi.org/10.1007/s10703-011-0131-3</a>.
  ieee: R. Guerraoui, T. A. Henzinger, and V. Singh, “Verification of STM on relaxed
    memory models,” <i>Formal Methods in System Design</i>, vol. 39, no. 3. Springer,
    pp. 297–331, 2011.
  ista: Guerraoui R, Henzinger TA, Singh V. 2011. Verification of STM on relaxed memory
    models. Formal Methods in System Design. 39(3), 297–331.
  mla: Guerraoui, Rachid, et al. “Verification of STM on Relaxed Memory Models.” <i>Formal
    Methods in System Design</i>, vol. 39, no. 3, Springer, 2011, pp. 297–331, doi:<a
    href="https://doi.org/10.1007/s10703-011-0131-3">10.1007/s10703-011-0131-3</a>.
  short: R. Guerraoui, T.A. Henzinger, V. Singh, Formal Methods in System Design 39
    (2011) 297–331.
corr_author: '1'
date_created: 2018-12-11T11:47:00Z
date_published: 2011-12-01T00:00:00Z
date_updated: 2025-09-30T09:23:08Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/s10703-011-0131-3
external_id:
  isi:
  - '000297596900004'
fulldoi: https://doi.org/10.1007/s10703-011-0131-3
intvolume: '        39'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://infoscience.epfl.ch/record/178042/files/art3A10.10072Fs10703-011-0131-3.pdf
month: '12'
oa: 1
oa_version: Published Version
page: 297 - 331
publication: Formal Methods in System Design
publication_status: published
publisher: Springer
publist_id: '7288'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Verification of STM on relaxed memory models
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 39
year: '2011'
...
---
_id: '5379'
abstract:
- lang: eng
  text: Computing the winning set for Büchi objectives in alternating games on graphs
    is a central problem in computer aided verification with a large number of applications.
    The long standing best known upper bound for solving the problem is ̃O(n·m), where
    n is the number of vertices and m is the number of edges in the graph. We are
    the first to break the ̃O(n·m) boundary by presenting a new technique that reduces
    the running time to O(n2). This bound also leads to O(n2) time algorithms for
    computing the set of almost-sure winning vertices for Büchi objectives (1) in
    alternating games with probabilistic transitions (improving an earlier bound of
    O(n·m)), (2) in concurrent graph games with constant actions (improving an earlier
    bound of O(n3)), and (3) in Markov decision processes (improving for m > n4/3
    an earlier bound of O(min(m1.5, m·n2/3)). We also show that the same technique
    can be used to compute the maximal end-component decomposition of a graph in time
    O(n2), which is an improvement over earlier bounds for m > n4/3. Finally, we show
    how to maintain the winning set for Büchi objectives in alternating games under
    a sequence of edge insertions or a sequence of edge deletions in O(n) amortized
    time per operation. This is the first dynamic algorithm for this problem.
alternative_title:
- IST Austria Technical Report
article_processing_charge: No
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
citation:
  ama: Chatterjee K, Henzinger M. <i>An O(N2) Time Algorithm for Alternating Büchi
    Games</i>. IST Austria; 2011. doi:<a href="https://doi.org/10.15479/AT:IST-2011-0009">10.15479/AT:IST-2011-0009</a>
  apa: Chatterjee, K., &#38; Henzinger, M. (2011). <i>An O(n2) time algorithm for
    alternating Büchi games</i>. IST Austria. <a href="https://doi.org/10.15479/AT:IST-2011-0009">https://doi.org/10.15479/AT:IST-2011-0009</a>
  chicago: Chatterjee, Krishnendu, and Monika Henzinger. <i>An O(N2) Time Algorithm
    for Alternating Büchi Games</i>. IST Austria, 2011. <a href="https://doi.org/10.15479/AT:IST-2011-0009">https://doi.org/10.15479/AT:IST-2011-0009</a>.
  ieee: K. Chatterjee and M. Henzinger, <i>An O(n2) time algorithm for alternating
    Büchi games</i>. IST Austria, 2011.
  ista: Chatterjee K, Henzinger M. 2011. An O(n2) time algorithm for alternating Büchi
    games, IST Austria, 20p.
  mla: Chatterjee, Krishnendu, and Monika Henzinger. <i>An O(N2) Time Algorithm for
    Alternating Büchi Games</i>. IST Austria, 2011, doi:<a href="https://doi.org/10.15479/AT:IST-2011-0009">10.15479/AT:IST-2011-0009</a>.
  short: K. Chatterjee, M. Henzinger, An O(N2) Time Algorithm for Alternating Büchi
    Games, IST Austria, 2011.
date_created: 2018-12-12T11:38:59Z
date_published: 2011-07-11T00:00:00Z
date_updated: 2025-07-10T11:52:28Z
day: '11'
ddc:
- '000'
- '004'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2011-0009
file:
- access_level: open_access
  checksum: 0b354264229045d982332fd2cb5b9a26
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:53:43Z
  date_updated: 2020-07-14T12:46:39Z
  file_id: '5504'
  file_name: IST-2011-0009_IST-2011-0009.pdf
  file_size: 388665
  relation: main_file
file_date_updated: 2020-07-14T12:46:39Z
fulldoi: https://doi.org/10.15479/AT:IST-2011-0009
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '20'
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '15'
related_material:
  record:
  - id: '3165'
    relation: later_version
    status: public
status: public
title: An O(n2) time algorithm for alternating Büchi games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '5380'
abstract:
- lang: eng
  text: 'We consider 2-player games played on a finite state space for an infinite
    number of rounds.  The games are concurrent: in each round, the two players (player
    1 and player 2) choose their moves independently and simultaneously; the current
    state and the two moves determine the successor state. We study concurrent games
    with ω-regular winning conditions specified as parity objectives.  We consider
    the qualitative analysis problems: the computation of the almost-sure and limit-sure
    winning set of states, where player 1 can ensure to win with probability 1 and
    with probability arbitrarily close to 1, respectively. In general the almost-sure
    and limit-sure winning strategies require both infinite-memory as well as infinite-precision
    (to describe probabilities). We study the bounded-rationality problem for qualitative
    analysis of concurrent parity games, where the strategy set for player 1 is restricted
    to bounded-resource strategies.  In terms of precision, strategies can be deterministic,
    uniform, finite-precision or infinite-precision;  and in terms of memory, strategies
    can be memoryless, finite-memory or infinite-memory. We present a precise and
    complete characterization of the qualitative winning sets for all combinations
    of classes of strategies. In particular, we show that uniform memoryless strategies
    are as powerful as finite-precision infinite-memory strategies, and infinite-precision
    memoryless strategies are as powerful as infinite-precision finite-memory strategies.  We
    show that the winning sets can be computed in O(n2d+3) time, where n is the size
    of the game structure and 2d is the number of priorities (or colors), and our
    algorithms are symbolic. The membership problem of whether a state belongs to
    a winning set can be decided in NP ∩ coNP. While this complexity is the same as
    for the simpler class of turn-based parity games, where in each state only one
    of the two players has a choice of moves, our algorithms,that are obtained by
    characterization of the winning sets as μ-calculus formulas, are considerably
    more involved than those for turn-based games.'
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
citation:
  ama: Chatterjee K. <i>Bounded Rationality in Concurrent Parity Games</i>. IST Austria;
    2011. doi:<a href="https://doi.org/10.15479/AT:IST-2011-0008">10.15479/AT:IST-2011-0008</a>
  apa: Chatterjee, K. (2011). <i>Bounded rationality in concurrent parity games</i>.
    IST Austria. <a href="https://doi.org/10.15479/AT:IST-2011-0008">https://doi.org/10.15479/AT:IST-2011-0008</a>
  chicago: Chatterjee, Krishnendu. <i>Bounded Rationality in Concurrent Parity Games</i>.
    IST Austria, 2011. <a href="https://doi.org/10.15479/AT:IST-2011-0008">https://doi.org/10.15479/AT:IST-2011-0008</a>.
  ieee: K. Chatterjee, <i>Bounded rationality in concurrent parity games</i>. IST
    Austria, 2011.
  ista: Chatterjee K. 2011. Bounded rationality in concurrent parity games, IST Austria,
    53p.
  mla: Chatterjee, Krishnendu. <i>Bounded Rationality in Concurrent Parity Games</i>.
    IST Austria, 2011, doi:<a href="https://doi.org/10.15479/AT:IST-2011-0008">10.15479/AT:IST-2011-0008</a>.
  short: K. Chatterjee, Bounded Rationality in Concurrent Parity Games, IST Austria,
    2011.
date_created: 2018-12-12T11:39:00Z
date_published: 2011-07-11T00:00:00Z
date_updated: 2025-06-26T09:28:52Z
day: '11'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2011-0008
file:
- access_level: open_access
  checksum: 0fd38186409be819a911c4990fa79d1f
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:54:22Z
  date_updated: 2020-07-14T12:46:39Z
  file_id: '5544'
  file_name: IST-2011-0008_IST-2011-0008.pdf
  file_size: 500399
  relation: main_file
file_date_updated: 2020-07-14T12:46:39Z
fulldoi: https://doi.org/10.15479/AT:IST-2011-0008
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '53'
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '16'
related_material:
  record:
  - id: '3338'
    relation: later_version
    status: public
status: public
title: Bounded rationality in concurrent parity games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '5382'
abstract:
- lang: eng
  text: 'We consider two-player stochastic games played on a finite state space for
    an infinite num- ber of rounds. The games are concurrent: in each round, the two
    players (player 1 and player 2) choose their moves independently and simultaneously;
    the current state and the two moves determine a probability distribution over
    the successor states. We also consider the important special case of turn-based
    stochastic games where players make moves in turns, rather than concurrently.
    We study concurrent games with ω-regular winning conditions specified as parity
    objectives. The value for player 1 for a parity objective is the maximal probability
    with which the player can guarantee the satisfaction of the objective against
    all strategies of the opponent. We study the problem of continuity and robustness
    of the value function in concurrent and turn-based stochastic parity games with
    respect to imprecision in the transition probabilities. We present quantitative
    bounds on the difference of the value function (in terms of the imprecision of
    the transition probabilities) and show the value continuity for structurally equivalent
    concurrent games (two games are structurally equivalent if the support of the
    transition func- tion is same and the probabilities differ). We also show robustness
    of optimal strategies for structurally equivalent turn-based stochastic parity
    games. Finally we show that the value continuity property breaks without the structurally
    equivalent assumption (even for Markov chains) and show that our quantitative
    bound is asymptotically optimal. Hence our results are tight (the assumption is
    both necessary and sufficient) and optimal (our quantitative bound is asymptotically
    optimal).'
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
citation:
  ama: Chatterjee K. <i>Robustness of Structurally Equivalent Concurrent Parity Games</i>.
    IST Austria; 2011. doi:<a href="https://doi.org/10.15479/AT:IST-2011-0006">10.15479/AT:IST-2011-0006</a>
  apa: Chatterjee, K. (2011). <i>Robustness of structurally equivalent concurrent
    parity games</i>. IST Austria. <a href="https://doi.org/10.15479/AT:IST-2011-0006">https://doi.org/10.15479/AT:IST-2011-0006</a>
  chicago: Chatterjee, Krishnendu. <i>Robustness of Structurally Equivalent Concurrent
    Parity Games</i>. IST Austria, 2011. <a href="https://doi.org/10.15479/AT:IST-2011-0006">https://doi.org/10.15479/AT:IST-2011-0006</a>.
  ieee: K. Chatterjee, <i>Robustness of structurally equivalent concurrent parity
    games</i>. IST Austria, 2011.
  ista: Chatterjee K. 2011. Robustness of structurally equivalent concurrent parity
    games, IST Austria, 18p.
  mla: Chatterjee, Krishnendu. <i>Robustness of Structurally Equivalent Concurrent
    Parity Games</i>. IST Austria, 2011, doi:<a href="https://doi.org/10.15479/AT:IST-2011-0006">10.15479/AT:IST-2011-0006</a>.
  short: K. Chatterjee, Robustness of Structurally Equivalent Concurrent Parity Games,
    IST Austria, 2011.
date_created: 2018-12-12T11:39:00Z
date_published: 2011-06-27T00:00:00Z
date_updated: 2025-04-15T08:12:24Z
day: '27'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2011-0006
file:
- access_level: open_access
  checksum: 1322b652d6ab07eb5248298a3f91c1cf
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:54:24Z
  date_updated: 2020-07-14T12:46:40Z
  file_id: '5546'
  file_name: IST-2011-0006_IST-2011-0006.pdf
  file_size: 335997
  relation: main_file
file_date_updated: 2020-07-14T12:46:40Z
fulldoi: https://doi.org/10.15479/AT:IST-2011-0006
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '18'
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '18'
related_material:
  record:
  - id: '3341'
    relation: later_version
    status: public
status: public
title: Robustness of structurally equivalent concurrent parity games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '5383'
abstract:
- lang: eng
  text: We present a new decidable logic called TREX for expressing constraints about
    imperative tree data structures. In particular, TREX supports a transitive closure
    operator that can express reachability constraints, which often appear in data
    structure invariants. We show that our logic is closed under weakest precondition
    computation, which enables its use for automated software verification. We further
    show that satisfiability of formulas in TREX is decidable in NP. The low complexity
    makes it an attractive alternative to more expensive logics such as monadic second-order
    logic (MSOL) over trees, which have been traditionally used for reasoning about
    tree data structures.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Thomas
  full_name: Wies, Thomas
  id: 447BFB88-F248-11E8-B48F-1D18A9856A87
  last_name: Wies
- first_name: Marco
  full_name: Muñiz, Marco
  last_name: Muñiz
- first_name: Viktor
  full_name: Kuncak, Viktor
  last_name: Kuncak
citation:
  ama: Wies T, Muñiz M, Kuncak V. <i>On an Efficient Decision Procedure for Imperative
    Tree Data Structures</i>. IST Austria; 2011. doi:<a href="https://doi.org/10.15479/AT:IST-2011-0005">10.15479/AT:IST-2011-0005</a>
  apa: Wies, T., Muñiz, M., &#38; Kuncak, V. (2011). <i>On an efficient decision procedure
    for imperative tree data structures</i>. IST Austria. <a href="https://doi.org/10.15479/AT:IST-2011-0005">https://doi.org/10.15479/AT:IST-2011-0005</a>
  chicago: Wies, Thomas, Marco Muñiz, and Viktor Kuncak. <i>On an Efficient Decision
    Procedure for Imperative Tree Data Structures</i>. IST Austria, 2011. <a href="https://doi.org/10.15479/AT:IST-2011-0005">https://doi.org/10.15479/AT:IST-2011-0005</a>.
  ieee: T. Wies, M. Muñiz, and V. Kuncak, <i>On an efficient decision procedure for
    imperative tree data structures</i>. IST Austria, 2011.
  ista: Wies T, Muñiz M, Kuncak V. 2011. On an efficient decision procedure for imperative
    tree data structures, IST Austria, 25p.
  mla: Wies, Thomas, et al. <i>On an Efficient Decision Procedure for Imperative Tree
    Data Structures</i>. IST Austria, 2011, doi:<a href="https://doi.org/10.15479/AT:IST-2011-0005">10.15479/AT:IST-2011-0005</a>.
  short: T. Wies, M. Muñiz, V. Kuncak, On an Efficient Decision Procedure for Imperative
    Tree Data Structures, IST Austria, 2011.
date_created: 2018-12-12T11:39:01Z
date_published: 2011-04-26T00:00:00Z
date_updated: 2024-10-09T20:54:31Z
day: '26'
ddc:
- '000'
- '006'
department:
- _id: ToHe
doi: 10.15479/AT:IST-2011-0005
file:
- access_level: open_access
  checksum: b20029184c4a819c5f4466a4a3d238b5
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:53:01Z
  date_updated: 2020-07-14T12:46:40Z
  file_id: '5462'
  file_name: IST-2011-0005_IST-2011-0005.pdf
  file_size: 619053
  relation: main_file
file_date_updated: 2020-07-14T12:46:40Z
fulldoi: https://doi.org/10.15479/AT:IST-2011-0005
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '25'
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '19'
related_material:
  record:
  - id: '3323'
    relation: later_version
    status: public
status: public
title: On an efficient decision procedure for imperative tree data structures
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '5384'
abstract:
- lang: eng
  text: 'We consider probabilistic automata on infinite words with acceptance defined
    by parity conditions. We consider three qualitative decision problems: (i) the
    positive decision problem asks whether there is a word that is accepted with positive
    probability; (ii) the almost decision problem asks whether there is a word that
    is accepted with probability 1; and (iii) the limit decision problem asks whether
    for every ε > 0 there is a word that is accepted with probability at least 1 −
    ε. We unify and generalize several decidability results for probabilistic automata
    over infinite words, and identify a robust (closed under union and intersection)
    subclass of probabilistic automata for which all the qualitative decision problems
    are decidable for parity conditions. We also show that if the input words are
    restricted to lasso shape words, then the positive and almost problems are decidable
    for all probabilistic automata with parity conditions.'
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: Mathieu
  full_name: Tracol, Mathieu
  id: 3F54FA38-F248-11E8-B48F-1D18A9856A87
  last_name: Tracol
citation:
  ama: Chatterjee K, Tracol M. <i>Decidable Problems for Probabilistic Automata on
    Infinite Words</i>. IST Austria; 2011. doi:<a href="https://doi.org/10.15479/AT:IST-2011-0004">10.15479/AT:IST-2011-0004</a>
  apa: Chatterjee, K., &#38; Tracol, M. (2011). <i>Decidable problems for probabilistic
    automata on infinite words</i>. IST Austria. <a href="https://doi.org/10.15479/AT:IST-2011-0004">https://doi.org/10.15479/AT:IST-2011-0004</a>
  chicago: Chatterjee, Krishnendu, and Mathieu Tracol. <i>Decidable Problems for Probabilistic
    Automata on Infinite Words</i>. IST Austria, 2011. <a href="https://doi.org/10.15479/AT:IST-2011-0004">https://doi.org/10.15479/AT:IST-2011-0004</a>.
  ieee: K. Chatterjee and M. Tracol, <i>Decidable problems for probabilistic automata
    on infinite words</i>. IST Austria, 2011.
  ista: Chatterjee K, Tracol M. 2011. Decidable problems for probabilistic automata
    on infinite words, IST Austria, 30p.
  mla: Chatterjee, Krishnendu, and Mathieu Tracol. <i>Decidable Problems for Probabilistic
    Automata on Infinite Words</i>. IST Austria, 2011, doi:<a href="https://doi.org/10.15479/AT:IST-2011-0004">10.15479/AT:IST-2011-0004</a>.
  short: K. Chatterjee, M. Tracol, Decidable Problems for Probabilistic Automata on
    Infinite Words, IST Austria, 2011.
corr_author: '1'
date_created: 2018-12-12T11:39:01Z
date_published: 2011-04-11T00:00:00Z
date_updated: 2025-09-30T08:07:38Z
day: '11'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2011-0004
file:
- access_level: open_access
  checksum: f5a0f664fadc335990f5fcf138df19f1
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:54:23Z
  date_updated: 2020-07-14T12:46:40Z
  file_id: '5545'
  file_name: IST-2011-004_IST-2011-0004.pdf
  file_size: 570827
  relation: main_file
file_date_updated: 2020-07-14T12:46:40Z
fulldoi: https://doi.org/10.15479/AT:IST-2011-0004
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '30'
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '20'
related_material:
  record:
  - id: '2957'
    relation: later_version
    status: public
status: public
title: Decidable problems for probabilistic automata on infinite words
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '5386'
abstract:
- lang: eng
  text: 'We introduce TopoCut: a new way to integrate knowledge about topological
    properties (TPs) into random field image segmentation model. Instead of including
    TPs as additional constraints during minimization of the energy function, we devise
    an efficient algorithm for modifying the unary potentials such that the resulting
    segmentation is guaranteed with the desired properties. Our method is more flexible
    in the sense that it handles more topology constraints than previous methods,
    which were only able to enforce pairwise or global connectivity. In particular,
    our method is very fast, making it for the first time possible to enforce global
    topological properties in practical image segmentation tasks.'
alternative_title:
- IST Austria Technical Report
author:
- first_name: Chao
  full_name: Chen, Chao
  id: 3E92416E-F248-11E8-B48F-1D18A9856A87
  last_name: Chen
- first_name: Daniel
  full_name: Freedman, Daniel
  last_name: Freedman
- first_name: Christoph
  full_name: Lampert, Christoph
  id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
  last_name: Lampert
  orcid: 0000-0001-8622-7887
citation:
  ama: Chen C, Freedman D, Lampert C. <i>Enforcing Topological Constraints in Random
    Field Image Segmentation</i>. IST Austria; 2011. doi:<a href="https://doi.org/10.15479/AT:IST-2011-0002">10.15479/AT:IST-2011-0002</a>
  apa: Chen, C., Freedman, D., &#38; Lampert, C. (2011). <i>Enforcing topological
    constraints in random field image segmentation</i>. IST Austria. <a href="https://doi.org/10.15479/AT:IST-2011-0002">https://doi.org/10.15479/AT:IST-2011-0002</a>
  chicago: Chen, Chao, Daniel Freedman, and Christoph Lampert. <i>Enforcing Topological
    Constraints in Random Field Image Segmentation</i>. IST Austria, 2011. <a href="https://doi.org/10.15479/AT:IST-2011-0002">https://doi.org/10.15479/AT:IST-2011-0002</a>.
  ieee: C. Chen, D. Freedman, and C. Lampert, <i>Enforcing topological constraints
    in random field image segmentation</i>. IST Austria, 2011.
  ista: Chen C, Freedman D, Lampert C. 2011. Enforcing topological constraints in
    random field image segmentation, IST Austria, 69p.
  mla: Chen, Chao, et al. <i>Enforcing Topological Constraints in Random Field Image
    Segmentation</i>. IST Austria, 2011, doi:<a href="https://doi.org/10.15479/AT:IST-2011-0002">10.15479/AT:IST-2011-0002</a>.
  short: C. Chen, D. Freedman, C. Lampert, Enforcing Topological Constraints in Random
    Field Image Segmentation, IST Austria, 2011.
date_created: 2018-12-12T11:39:02Z
date_published: 2011-03-28T00:00:00Z
date_updated: 2024-10-09T20:54:30Z
day: '28'
ddc:
- '000'
department:
- _id: ChLa
doi: 10.15479/AT:IST-2011-0002
file:
- access_level: open_access
  checksum: ad64c2add5fe2ad10e9d5c669f3f9526
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:53:34Z
  date_updated: 2020-07-14T12:46:41Z
  file_id: '5495'
  file_name: IST-2011-0002_IST-2011-0002.pdf
  file_size: 26390601
  relation: main_file
file_date_updated: 2020-07-14T12:46:41Z
fulldoi: https://doi.org/10.15479/AT:IST-2011-0002
has_accepted_license: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: '69'
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '22'
related_material:
  record:
  - id: '3336'
    relation: later_version
    status: public
status: public
title: Enforcing topological constraints in random field image segmentation
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '5387'
abstract:
- lang: eng
  text: We consider Markov Decision Processes (MDPs) with mean-payoff parity and energy
    parity objectives. In system design, the parity objective is used to encode ω-regular
    specifications, and the mean-payoff and energy objectives can be used to model
    quantitative resource constraints. The energy condition re- quires that the resource
    level never drops below 0, and the mean-payoff condi- tion requires that the limit-average
    value of the resource consumption is within a threshold. While these two (energy
    and mean-payoff) classical conditions are equivalent for two-player games, we
    show that they differ for MDPs. We show that the problem of deciding whether a
    state is almost-sure winning (i.e., winning with probability 1) in energy parity
    MDPs is in NP ∩ coNP, while for mean- payoff parity MDPs, the problem is solvable
    in polynomial time, improving a recent PSPACE bound.
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: Laurent
  full_name: Doyen, Laurent
  last_name: Doyen
citation:
  ama: Chatterjee K, Doyen L. <i>Energy and Mean-Payoff Parity Markov Decision Processes</i>.
    IST Austria; 2011. doi:<a href="https://doi.org/10.15479/AT:IST-2011-0001">10.15479/AT:IST-2011-0001</a>
  apa: Chatterjee, K., &#38; Doyen, L. (2011). <i>Energy and mean-payoff parity Markov
    decision processes</i>. IST Austria. <a href="https://doi.org/10.15479/AT:IST-2011-0001">https://doi.org/10.15479/AT:IST-2011-0001</a>
  chicago: Chatterjee, Krishnendu, and Laurent Doyen. <i>Energy and Mean-Payoff Parity
    Markov Decision Processes</i>. IST Austria, 2011. <a href="https://doi.org/10.15479/AT:IST-2011-0001">https://doi.org/10.15479/AT:IST-2011-0001</a>.
  ieee: K. Chatterjee and L. Doyen, <i>Energy and mean-payoff parity Markov decision
    processes</i>. IST Austria, 2011.
  ista: Chatterjee K, Doyen L. 2011. Energy and mean-payoff parity Markov decision
    processes, IST Austria, 20p.
  mla: Chatterjee, Krishnendu, and Laurent Doyen. <i>Energy and Mean-Payoff Parity
    Markov Decision Processes</i>. IST Austria, 2011, doi:<a href="https://doi.org/10.15479/AT:IST-2011-0001">10.15479/AT:IST-2011-0001</a>.
  short: K. Chatterjee, L. Doyen, Energy and Mean-Payoff Parity Markov Decision Processes,
    IST Austria, 2011.
date_created: 2018-12-12T11:39:02Z
date_published: 2011-02-16T00:00:00Z
date_updated: 2025-04-15T08:12:14Z
day: '16'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2011-0001
file:
- access_level: open_access
  checksum: 824d6c70e6d3feb3e836b009e0b3cf73
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:52:57Z
  date_updated: 2020-07-14T12:46:41Z
  file_id: '5458'
  file_name: IST-2011-0001_IST-2011-0001.pdf
  file_size: 329976
  relation: main_file
file_date_updated: 2020-07-14T12:46:41Z
fulldoi: https://doi.org/10.15479/AT:IST-2011-0001
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '20'
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '23'
related_material:
  record:
  - id: '3345'
    relation: later_version
    status: public
status: public
title: Energy and mean-payoff parity Markov decision processes
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '580'
author:
- first_name: Onur
  full_name: Onur Hosten
  id: 4C02D85E-F248-11E8-B48F-1D18A9856A87
  last_name: Hosten
  orcid: 0000-0002-2031-204X
citation:
  ama: 'Hosten O. Quantum physics: How to catch a wave. <i>Nature</i>. 2011;474(7350):170-171.
    doi:<a href="https://doi.org/10.1038/474170a">10.1038/474170a</a>'
  apa: 'Hosten, O. (2011). Quantum physics: How to catch a wave. <i>Nature</i>. Nature
    Publishing Group. <a href="https://doi.org/10.1038/474170a">https://doi.org/10.1038/474170a</a>'
  chicago: 'Hosten, Onur. “Quantum Physics: How to Catch a Wave.” <i>Nature</i>. Nature
    Publishing Group, 2011. <a href="https://doi.org/10.1038/474170a">https://doi.org/10.1038/474170a</a>.'
  ieee: 'O. Hosten, “Quantum physics: How to catch a wave,” <i>Nature</i>, vol. 474,
    no. 7350. Nature Publishing Group, pp. 170–171, 2011.'
  ista: 'Hosten O. 2011. Quantum physics: How to catch a wave. Nature. 474(7350),
    170–171.'
  mla: 'Hosten, Onur. “Quantum Physics: How to Catch a Wave.” <i>Nature</i>, vol.
    474, no. 7350, Nature Publishing Group, 2011, pp. 170–71, doi:<a href="https://doi.org/10.1038/474170a">10.1038/474170a</a>.'
  short: O. Hosten, Nature 474 (2011) 170–171.
date_created: 2018-12-11T11:47:18Z
date_published: 2011-06-08T00:00:00Z
date_updated: 2021-01-12T08:03:34Z
day: '08'
doi: 10.1038/474170a
extern: 1
fulldoi: https://doi.org/10.1038/474170a
intvolume: '       474'
issue: '7350'
month: '06'
page: 170 - 171
publication: Nature
publication_status: published
publisher: Nature Publishing Group
publist_id: '7224'
quality_controlled: 0
status: public
title: 'Quantum physics: How to catch a wave'
type: journal_article
volume: 474
year: '2011'
...
---
_id: '585'
abstract:
- lang: eng
  text: |+
    We present two independent schemes for the precise focusing of orthogonal polarizations of light at arbitrary relative locations. The first scheme uses a polarization Sagnac interferometer, the second a set of three birefringent elements.

alternative_title:
- Optics InfoBase Conference Papers
author:
- first_name: David
  full_name: Schmid, David
  last_name: Schmid
- first_name: Shiraz
  full_name: Hazrat, Shiraz
  last_name: Hazrat
- first_name: Radhika
  full_name: Rangarajan, Radhika
  last_name: Rangarajan
- first_name: Onur
  full_name: Onur Hosten
  id: 4C02D85E-F248-11E8-B48F-1D18A9856A87
  last_name: Hosten
  orcid: 0000-0002-2031-204X
- first_name: Stephan
  full_name: Quint, Stephan
  last_name: Quint
- first_name: Paul
  full_name: Kwiat, Paul G
  last_name: Kwiat
citation:
  ama: 'Schmid D, Hazrat S, Rangarajan R, Hosten O, Quint S, Kwiat P. Methods towards
    achieving precise birefringent focusing. In: OSA; 2011. doi:<a href="https://doi.org/10.1364/CLEO_AT.2011.JThB130">10.1364/CLEO_AT.2011.JThB130</a>'
  apa: 'Schmid, D., Hazrat, S., Rangarajan, R., Hosten, O., Quint, S., &#38; Kwiat,
    P. (2011). Methods towards achieving precise birefringent focusing. Presented
    at the QELS: Quantum Electronics and Laser Science, OSA. <a href="https://doi.org/10.1364/CLEO_AT.2011.JThB130">https://doi.org/10.1364/CLEO_AT.2011.JThB130</a>'
  chicago: Schmid, David, Shiraz Hazrat, Radhika Rangarajan, Onur Hosten, Stephan
    Quint, and Paul Kwiat. “Methods towards Achieving Precise Birefringent Focusing.”
    OSA, 2011. <a href="https://doi.org/10.1364/CLEO_AT.2011.JThB130">https://doi.org/10.1364/CLEO_AT.2011.JThB130</a>.
  ieee: 'D. Schmid, S. Hazrat, R. Rangarajan, O. Hosten, S. Quint, and P. Kwiat, “Methods
    towards achieving precise birefringent focusing,” presented at the QELS: Quantum
    Electronics and Laser Science, 2011.'
  ista: 'Schmid D, Hazrat S, Rangarajan R, Hosten O, Quint S, Kwiat P. 2011. Methods
    towards achieving precise birefringent focusing. QELS: Quantum Electronics and
    Laser Science, Optics InfoBase Conference Papers, .'
  mla: Schmid, David, et al. <i>Methods towards Achieving Precise Birefringent Focusing</i>.
    OSA, 2011, doi:<a href="https://doi.org/10.1364/CLEO_AT.2011.JThB130">10.1364/CLEO_AT.2011.JThB130</a>.
  short: D. Schmid, S. Hazrat, R. Rangarajan, O. Hosten, S. Quint, P. Kwiat, in:,
    OSA, 2011.
conference:
  name: 'QELS: Quantum Electronics and Laser Science'
date_created: 2018-12-11T11:47:20Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2021-01-12T08:03:44Z
day: '01'
doi: 10.1364/CLEO_AT.2011.JThB130
extern: 1
fulldoi: https://doi.org/10.1364/CLEO_AT.2011.JThB130
month: '01'
publication_status: published
publisher: OSA
publist_id: '7220'
quality_controlled: 0
status: public
title: Methods towards achieving precise birefringent focusing
type: conference
year: '2011'
...
...
