---
OA_type: closed access
_id: '4555'
abstract:
- lang: eng
  text: Strategies in repeated games can be classified as to whether or not they use
    memory and/or randomization. We consider Markov decision processes and 2-player
    graph games, both of the deterministic and probabilistic varieties. We characterize
    when memory and/or randomization are required for winning with respect to various
    classes of w-regular objectives, noting particularly when the use of memory can
    be traded for the use of randomization. In particular, we show that Markov decision
    processes allow randomized memoryless optimal strategies for all M?ller objectives.
    Furthermore, we show that 2-player probabilistic graph games allow randomized
    memoryless strategies for winning with probability 1 those M?ller objectives which
    are upward-closed. Upward-closure means that if a set α of infinitely repeating
    vertices is winning, then all supersets of α are also winning.
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: Luca
  full_name: De Alfaro, Luca
  last_name: De Alfaro
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
citation:
  ama: 'Chatterjee K, De Alfaro L, Henzinger TA. Trading memory for randomness. In:
    IEEE; 2004:206-217. doi:<a href="https://doi.org/10.1109/QEST.2004.10051">10.1109/QEST.2004.10051</a>'
  apa: 'Chatterjee, K., De Alfaro, L., &#38; Henzinger, T. A. (2004). Trading memory
    for randomness (pp. 206–217). Presented at the QEST: Quantitative Evaluation of
    Systems, Enschede, Netherlands: IEEE. <a href="https://doi.org/10.1109/QEST.2004.10051">https://doi.org/10.1109/QEST.2004.10051</a>'
  chicago: Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Trading
    Memory for Randomness,” 206–17. IEEE, 2004. <a href="https://doi.org/10.1109/QEST.2004.10051">https://doi.org/10.1109/QEST.2004.10051</a>.
  ieee: 'K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Trading memory for randomness,”
    presented at the QEST: Quantitative Evaluation of Systems, Enschede, Netherlands,
    2004, pp. 206–217.'
  ista: 'Chatterjee K, De Alfaro L, Henzinger TA. 2004. Trading memory for randomness.
    QEST: Quantitative Evaluation of Systems, 206–217.'
  mla: Chatterjee, Krishnendu, et al. <i>Trading Memory for Randomness</i>. IEEE,
    2004, pp. 206–17, doi:<a href="https://doi.org/10.1109/QEST.2004.10051">10.1109/QEST.2004.10051</a>.
  short: K. Chatterjee, L. De Alfaro, T.A. Henzinger, in:, IEEE, 2004, pp. 206–217.
conference:
  end_date: 2004-09-30
  location: Enschede, Netherlands
  name: 'QEST: Quantitative Evaluation of Systems'
  start_date: 2004-09-27
date_created: 2018-12-11T12:09:27Z
date_published: 2004-09-30T00:00:00Z
date_updated: 2026-05-29T09:05:35Z
day: '30'
doi: 10.1109/QEST.2004.10051
extern: '1'
fulldoi: https://doi.org/10.1109/QEST.2004.10051
language:
- iso: eng
month: '09'
oa_version: None
page: 206 - 217
publication_identifier:
  isbn:
  - '0769521851'
publication_status: published
publisher: IEEE
publist_id: '155'
quality_controlled: '1'
status: public
title: Trading memory for randomness
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2004'
...
---
OA_place: publisher
OA_type: free access
_id: '4556'
abstract:
- lang: eng
  text: We study the problem of determining stack boundedness and the exact maximum
    stack size for three classes of interrupt-driven programs. Interrupt-driven programs
    are used in many real-time applications that require responsive interrupt handling.
    In order to ensure responsiveness, programmers often enable interrupt processing
    in the body of lower-priority interrupt handlers. In such programs a programming
    error can allow interrupt handlers to be interrupted in a cyclic fashion to lead
    to an unbounded stack, causing the system to crash. For a restricted class of
    interrupt-driven programs, we show that there is a polynomial-time procedure to
    check stack boundedness, while determining the exact maximum stack size is PSPACE-complete.
    For a larger class of programs, the two problems are both PSPACE-complete, and
    for the largest class of programs we consider, the two problems are PSPACE-hard
    and can be solved in exponential time. While the complexities are high, our algorithms
    are exponential only in the number of handlers, and polynomial in the size of
    the program.
article_processing_charge: No
article_type: original
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Di
  full_name: Ma, Di
  last_name: Ma
- first_name: Ritankar
  full_name: Majumdar, Ritankar
  last_name: Majumdar
- first_name: Tian
  full_name: Zhao, Tian
  last_name: Zhao
- 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: Jens
  full_name: Palsberg, Jens
  last_name: Palsberg
citation:
  ama: Chatterjee K, Ma D, Majumdar R, Zhao T, Henzinger TA, Palsberg J. Stack size
    analysis for interrupt-driven programs. <i>Information and Computation</i>. 2004;194(2):144-174.
    doi:<a href="https://doi.org/10.1016/j.ic.2004.06.001">10.1016/j.ic.2004.06.001</a>
  apa: Chatterjee, K., Ma, D., Majumdar, R., Zhao, T., Henzinger, T. A., &#38; Palsberg,
    J. (2004). Stack size analysis for interrupt-driven programs. <i>Information and
    Computation</i>. Elsevier. <a href="https://doi.org/10.1016/j.ic.2004.06.001">https://doi.org/10.1016/j.ic.2004.06.001</a>
  chicago: Chatterjee, Krishnendu, Di Ma, Ritankar Majumdar, Tian Zhao, Thomas A Henzinger,
    and Jens Palsberg. “Stack Size Analysis for Interrupt-Driven Programs.” <i>Information
    and Computation</i>. Elsevier, 2004. <a href="https://doi.org/10.1016/j.ic.2004.06.001">https://doi.org/10.1016/j.ic.2004.06.001</a>.
  ieee: K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T. A. Henzinger, and J. Palsberg,
    “Stack size analysis for interrupt-driven programs,” <i>Information and Computation</i>,
    vol. 194, no. 2. Elsevier, pp. 144–174, 2004.
  ista: Chatterjee K, Ma D, Majumdar R, Zhao T, Henzinger TA, Palsberg J. 2004. Stack
    size analysis for interrupt-driven programs. Information and Computation. 194(2),
    144–174.
  mla: Chatterjee, Krishnendu, et al. “Stack Size Analysis for Interrupt-Driven Programs.”
    <i>Information and Computation</i>, vol. 194, no. 2, Elsevier, 2004, pp. 144–74,
    doi:<a href="https://doi.org/10.1016/j.ic.2004.06.001">10.1016/j.ic.2004.06.001</a>.
  short: K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T.A. Henzinger, J. Palsberg,
    Information and Computation 194 (2004) 144–174.
date_created: 2018-12-11T12:09:28Z
date_published: 2004-11-01T00:00:00Z
date_updated: 2026-05-29T09:10:28Z
day: '01'
doi: 10.1016/j.ic.2004.06.001
extern: '1'
fulldoi: https://doi.org/10.1016/j.ic.2004.06.001
intvolume: '       194'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1016/j.ic.2004.06.001
month: '11'
oa: 1
oa_version: Accepted Version
page: 144 - 174
publication: Information and Computation
publication_identifier:
  eissn:
  - 1090-2651
  issn:
  - 0890-5401
publication_status: published
publisher: Elsevier
publist_id: '156'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Stack size analysis for interrupt-driven programs
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 194
year: '2004'
...
---
OA_place: repository
OA_type: green
_id: '4558'
abstract:
- lang: eng
  text: We study perfect-information stochastic parity games. These are two-player
    nonterminating games which are played on a graph with turn-based probabilistic
    transitions. A play results in an infinite path and the conflicting goals of the
    two players are ω-regular path properties, formalized as parity winning conditions.
    The qualitative solution of such a game amounts to computing the set of vertices
    from which a player has a strategy to win with probability 1 (or with positive
    probability). The quantitative solution amounts to computing the value of the
    game in every vertex, i.e., the highest probability with which a player can guarantee
    satisfaction of his own objective in a play that starts from the vertex.For the
    important special case of one-player stochastic parity games (parity Markov decision
    processes) we give polynomial-time algorithms both for the qualitative and the
    quantitative solution. The running time of the qualitative solution is O(d · m3/2)
    for graphs with m edges and d priorities. The quantitative solution is based on
    a linear-programming formulation.For the two-player case, we establish the existence
    of optimal pure memoryless strategies. This has several important ramifications.
    First, it implies that the values of the games are rational. This is in contrast
    to the concurrent stochastic parity games of de Alfaro et al.; there, values are
    in general algebraic numbers, optimal strategies do not exist, and ε-optimal strategies
    have to be mixed and with infinite memory. Second, the existence of optimal pure
    memoryless strategies together with the polynomial-time solution forone-player
    case implies that the quantitative two-player stochastic parity game problem is
    in NP ∩ co-NP. This generalizes a result of Condon for stochastic games with reachability
    objectives. It also constitutes an exponential improvement over the best previous
    algorithm, which is based on a doubly exponential procedure of de Alfaro and Majumdar
    for concurrent stochastic parity games and provides only ε-approximations of the
    values.
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: Marcin
  full_name: Jurdziński, Marcin
  last_name: Jurdziński
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
citation:
  ama: 'Chatterjee K, Jurdziński M, Henzinger TA. Quantitative stochastic parity games.
    In: <i>Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms</i>.
    Association for Computing Machinery; 2004:121-130. doi:<a href="https://doi.org/10.5555/982792.982808">10.5555/982792.982808</a>'
  apa: 'Chatterjee, K., Jurdziński, M., &#38; Henzinger, T. A. (2004). Quantitative
    stochastic parity games. In <i>Proceedings of the 15th annual ACM-SIAM symposium
    on Discrete algorithms</i> (pp. 121–130). New Orleans, LA, United States: Association
    for Computing Machinery. <a href="https://doi.org/10.5555/982792.982808">https://doi.org/10.5555/982792.982808</a>'
  chicago: Chatterjee, Krishnendu, Marcin Jurdziński, and Thomas A Henzinger. “Quantitative
    Stochastic Parity Games.” In <i>Proceedings of the 15th Annual ACM-SIAM Symposium
    on Discrete Algorithms</i>, 121–30. Association for Computing Machinery, 2004.
    <a href="https://doi.org/10.5555/982792.982808">https://doi.org/10.5555/982792.982808</a>.
  ieee: K. Chatterjee, M. Jurdziński, and T. A. Henzinger, “Quantitative stochastic
    parity games,” in <i>Proceedings of the 15th annual ACM-SIAM symposium on Discrete
    algorithms</i>, New Orleans, LA, United States, 2004, pp. 121–130.
  ista: 'Chatterjee K, Jurdziński M, Henzinger TA. 2004. Quantitative stochastic parity
    games. Proceedings of the 15th annual ACM-SIAM symposium on Discrete algorithms.
    SODA: Symposium on Discrete Algorithms, 121–130.'
  mla: Chatterjee, Krishnendu, et al. “Quantitative Stochastic Parity Games.” <i>Proceedings
    of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Association
    for Computing Machinery, 2004, pp. 121–30, doi:<a href="https://doi.org/10.5555/982792.982808">10.5555/982792.982808</a>.
  short: K. Chatterjee, M. Jurdziński, T.A. Henzinger, in:, Proceedings of the 15th
    Annual ACM-SIAM Symposium on Discrete Algorithms, Association for Computing Machinery,
    2004, pp. 121–130.
conference:
  end_date: 2004-01-14
  location: New Orleans, LA, United States
  name: 'SODA: Symposium on Discrete Algorithms'
  start_date: 2004-01-11
date_created: 2018-12-11T12:09:28Z
date_published: 2004-02-01T00:00:00Z
date_updated: 2026-05-29T08:40:03Z
day: '01'
doi: 10.5555/982792.982808
extern: '1'
fulldoi: https://doi.org/10.5555/982792.982808
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.dcs.warwick.ac.uk/people/academic/Marcin.Jurdzinski/Papers/CJH04-SODA.pdf
month: '02'
oa: 1
oa_version: Preprint
page: 121 - 130
publication: Proceedings of the 15th annual ACM-SIAM symposium on Discrete algorithms
publication_identifier:
  isbn:
  - 089871558X
publication_status: published
publisher: Association for Computing Machinery
publist_id: '153'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quantitative stochastic parity games
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2004'
...
---
OA_type: closed access
_id: '4577'
abstract:
- lang: eng
  text: While model checking has been successful in uncovering subtle bugs in code,
    its adoption in software engineering practice has been hampered by the absence
    of a simple interface to the programmer in an integrated development environment.
    We describe an integration of the software model checker BLAST into the Eclipse
    development environment. We provide a verification interface for practical solutions
    for some typical program analysis problems - assertion checking, reachability
    analysis, dead code analysis, and test generation - directly on the source code.
    The analysis is completely automatic, and assumes no knowledge of model checking
    or formal notation. Moreover, the interface supports incremental program verification
    to support incremental design and evolution of code.
acknowledgement: This research was supported in part by the NSF grants CCR-0085949,
  CCR-0234690, and ITR-0326577.
article_processing_charge: No
author:
- first_name: Dirk
  full_name: Beyer, Dirk
  last_name: Beyer
- 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: Ranjit
  full_name: Jhala, Ranjit
  last_name: Jhala
- first_name: Ritankar
  full_name: Majumdar, Ritankar
  last_name: Majumdar
citation:
  ama: 'Beyer D, Henzinger TA, Jhala R, Majumdar R. An eclipse plug-in for model checking.
    In: <i>Proceedings of the 12th IEEE International Workshop on Program Comprehension</i>.
    IEEE; 2004:251-255. doi:<a href="https://doi.org/10.1109/WPC.2004.1311069  ">10.1109/WPC.2004.1311069 
    </a>'
  apa: 'Beyer, D., Henzinger, T. A., Jhala, R., &#38; Majumdar, R. (2004). An eclipse
    plug-in for model checking. In <i>Proceedings of the 12th IEEE International Workshop
    on Program Comprehension</i> (pp. 251–255). Bari, Italy: IEEE. <a href="https://doi.org/10.1109/WPC.2004.1311069 
    ">https://doi.org/10.1109/WPC.2004.1311069  </a>'
  chicago: Beyer, Dirk, Thomas A Henzinger, Ranjit Jhala, and Ritankar Majumdar. “An
    Eclipse Plug-in for Model Checking.” In <i>Proceedings of the 12th IEEE International
    Workshop on Program Comprehension</i>, 251–55. IEEE, 2004. <a href="https://doi.org/10.1109/WPC.2004.1311069 
    ">https://doi.org/10.1109/WPC.2004.1311069  </a>.
  ieee: D. Beyer, T. A. Henzinger, R. Jhala, and R. Majumdar, “An eclipse plug-in
    for model checking,” in <i>Proceedings of the 12th IEEE International Workshop
    on Program Comprehension</i>, Bari, Italy, 2004, pp. 251–255.
  ista: 'Beyer D, Henzinger TA, Jhala R, Majumdar R. 2004. An eclipse plug-in for
    model checking. Proceedings of the 12th IEEE International Workshop on Program
    Comprehension. IWPC: Program Comprehension, 251–255.'
  mla: Beyer, Dirk, et al. “An Eclipse Plug-in for Model Checking.” <i>Proceedings
    of the 12th IEEE International Workshop on Program Comprehension</i>, IEEE, 2004,
    pp. 251–55, doi:<a href="https://doi.org/10.1109/WPC.2004.1311069  ">10.1109/WPC.2004.1311069 
    </a>.
  short: D. Beyer, T.A. Henzinger, R. Jhala, R. Majumdar, in:, Proceedings of the
    12th IEEE International Workshop on Program Comprehension, IEEE, 2004, pp. 251–255.
conference:
  end_date: 2004-06-26
  location: Bari, Italy
  name: 'IWPC: Program Comprehension'
  start_date: 2004-06-26
date_created: 2018-12-11T12:09:34Z
date_published: 2004-07-12T00:00:00Z
date_updated: 2026-05-29T08:23:32Z
day: '12'
doi: '10.1109/WPC.2004.1311069  '
extern: '1'
fulldoi: 'https://doi.org/10.1109/WPC.2004.1311069  '
language:
- iso: eng
month: '07'
oa_version: None
page: 251 - 255
publication: Proceedings of the 12th IEEE International Workshop on Program Comprehension
publication_identifier:
  isbn:
  - '0769521495'
  issn:
  - 1092-8138
publication_status: published
publisher: IEEE
publist_id: '129'
quality_controlled: '1'
scopus_import: '1'
status: public
title: An eclipse plug-in for model checking
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2004'
...
---
OA_type: closed access
_id: '4578'
abstract:
- lang: eng
  text: 'BLAST is an automatic verification tool for checking temporal safety properties
    of C programs. Blast is based on lazy predicate abstraction driven by interpolation-based
    predicate discovery. In this paper, we present the Blast specification language.
    The language specifies program properties at two levels of precision. At the lower
    level, monitor automata are used to specify temporal safety properties of program
    executions (traces). At the higher level, relational reachability queries over
    program locations are used to combine lower-level trace properties. The two-level
    specification language can be used to break down a verification task into several
    independent calls of the model-checking engine. In this way, each call to the
    model checker may have to analyze only part of the program, or part of the specification,
    and may thus succeed in a reduction of the number of predicates needed for the
    analysis. In addition, the two-level specification language provides a means for
    structuring and maintaining specifications. '
acknowledgement: This research was supported in part by the NSF grants CCR-0085949,
  CCR-0234690, and ITR-0326577.
alternative_title:
- Lecture Notes in Computer Science
article_processing_charge: No
author:
- first_name: Dirk
  full_name: Beyer, Dirk
  last_name: Beyer
- first_name: Adam
  full_name: Chlipala, Adam
  last_name: Chlipala
- 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: Ranjit
  full_name: Jhala, Ranjit
  last_name: Jhala
- first_name: Ritankar
  full_name: Majumdar, Ritankar
  last_name: Majumdar
citation:
  ama: 'Beyer D, Chlipala A, Henzinger TA, Jhala R, Majumdar R. The BLAST query language
    for software verification. In: Vol 3148. Springer; 2004:2-18. doi:<a href="https://doi.org/10.1007/978-3-540-27864-1_2">10.1007/978-3-540-27864-1_2</a>'
  apa: 'Beyer, D., Chlipala, A., Henzinger, T. A., Jhala, R., &#38; Majumdar, R. (2004).
    The BLAST query language for software verification (Vol. 3148, pp. 2–18). Presented
    at the SAS: Static Analysis Symposium, Verona, Italy: Springer. <a href="https://doi.org/10.1007/978-3-540-27864-1_2">https://doi.org/10.1007/978-3-540-27864-1_2</a>'
  chicago: Beyer, Dirk, Adam Chlipala, Thomas A Henzinger, Ranjit Jhala, and Ritankar
    Majumdar. “The BLAST Query Language for Software Verification,” 3148:2–18. Springer,
    2004. <a href="https://doi.org/10.1007/978-3-540-27864-1_2">https://doi.org/10.1007/978-3-540-27864-1_2</a>.
  ieee: 'D. Beyer, A. Chlipala, T. A. Henzinger, R. Jhala, and R. Majumdar, “The BLAST
    query language for software verification,” presented at the SAS: Static Analysis
    Symposium, Verona, Italy, 2004, vol. 3148, pp. 2–18.'
  ista: 'Beyer D, Chlipala A, Henzinger TA, Jhala R, Majumdar R. 2004. The BLAST query
    language for software verification. SAS: Static Analysis Symposium, Lecture Notes
    in Computer Science, vol. 3148, 2–18.'
  mla: Beyer, Dirk, et al. <i>The BLAST Query Language for Software Verification</i>.
    Vol. 3148, Springer, 2004, pp. 2–18, doi:<a href="https://doi.org/10.1007/978-3-540-27864-1_2">10.1007/978-3-540-27864-1_2</a>.
  short: D. Beyer, A. Chlipala, T.A. Henzinger, R. Jhala, R. Majumdar, in:, Springer,
    2004, pp. 2–18.
conference:
  end_date: 2004-08-28
  location: Verona, Italy
  name: 'SAS: Static Analysis Symposium'
  start_date: 2004-08-26
date_created: 2018-12-11T12:09:34Z
date_published: 2004-08-17T00:00:00Z
date_updated: 2026-05-29T08:31:41Z
day: '17'
doi: 10.1007/978-3-540-27864-1_2
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-540-27864-1_2
intvolume: '      3148'
language:
- iso: eng
month: '08'
oa_version: None
page: 2 - 18
publication_identifier:
  eisbn:
  - '9783540278641'
  isbn:
  - '9783540227915'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer
publist_id: '130'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The BLAST query language for software verification
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 3148
year: '2004'
...
---
OA_type: closed access
_id: '4581'
abstract:
- lang: eng
  text: We have extended the software model checker BLAST to automatically generate
    test suites that guarantee full coverage with respect to a given predicate. More
    precisely, given a C program and a target predicate p, BLAST determines the set
    L of program locations which program execution can reach with p true, and automatically
    generates a set of test vectors that exhibit the truth of p at all locations in
    L. We have used BLAST to generate test suites and to detect dead code in C programs
    with up to 30 K lines of code. The analysis and test vector generation is fully
    automatic (no user intervention) and exact (no false positives).
article_processing_charge: No
author:
- first_name: Dirk
  full_name: Beyer, Dirk
  last_name: Beyer
- first_name: Adam
  full_name: Chlipala, Adam
  last_name: Chlipala
- 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: Ranjit
  full_name: Jhala, Ranjit
  last_name: Jhala
- first_name: Ritankar
  full_name: Majumdar, Ritankar
  last_name: Majumdar
citation:
  ama: 'Beyer D, Chlipala A, Henzinger TA, Jhala R, Majumdar R. Generating tests from
    counterexamples. In: <i>Proceedings of the 26th International Conference on Software
    Engineering</i>. IEEE; 2004:326-335. doi:<a href="https://doi.org/10.1109/ICSE.2004.1317455">10.1109/ICSE.2004.1317455</a>'
  apa: 'Beyer, D., Chlipala, A., Henzinger, T. A., Jhala, R., &#38; Majumdar, R. (2004).
    Generating tests from counterexamples. In <i>Proceedings of the 26th International
    Conference on Software Engineering</i> (pp. 326–335). Edinburgh, United Kingdom:
    IEEE. <a href="https://doi.org/10.1109/ICSE.2004.1317455">https://doi.org/10.1109/ICSE.2004.1317455</a>'
  chicago: Beyer, Dirk, Adam Chlipala, Thomas A Henzinger, Ranjit Jhala, and Ritankar
    Majumdar. “Generating Tests from Counterexamples.” In <i>Proceedings of the 26th
    International Conference on Software Engineering</i>, 326–35. IEEE, 2004. <a href="https://doi.org/10.1109/ICSE.2004.1317455">https://doi.org/10.1109/ICSE.2004.1317455</a>.
  ieee: D. Beyer, A. Chlipala, T. A. Henzinger, R. Jhala, and R. Majumdar, “Generating
    tests from counterexamples,” in <i>Proceedings of the 26th International Conference
    on Software Engineering</i>, Edinburgh, United Kingdom, 2004, pp. 326–335.
  ista: 'Beyer D, Chlipala A, Henzinger TA, Jhala R, Majumdar R. 2004. Generating
    tests from counterexamples. Proceedings of the 26th International Conference on
    Software Engineering. ICSE: Software Engineering, 326–335.'
  mla: Beyer, Dirk, et al. “Generating Tests from Counterexamples.” <i>Proceedings
    of the 26th International Conference on Software Engineering</i>, IEEE, 2004,
    pp. 326–35, doi:<a href="https://doi.org/10.1109/ICSE.2004.1317455">10.1109/ICSE.2004.1317455</a>.
  short: D. Beyer, A. Chlipala, T.A. Henzinger, R. Jhala, R. Majumdar, in:, Proceedings
    of the 26th International Conference on Software Engineering, IEEE, 2004, pp.
    326–335.
conference:
  end_date: 2004-05-28
  location: Edinburgh, United Kingdom
  name: 'ICSE: Software Engineering'
  start_date: 2004-05-23
date_created: 2018-12-11T12:09:35Z
date_published: 2004-07-26T00:00:00Z
date_updated: 2026-05-29T07:46:59Z
day: '26'
doi: 10.1109/ICSE.2004.1317455
extern: '1'
fulldoi: https://doi.org/10.1109/ICSE.2004.1317455
language:
- iso: eng
month: '07'
oa_version: None
page: 326 - 335
publication: Proceedings of the 26th International Conference on Software Engineering
publication_identifier:
  isbn:
  - '0769521630'
  issn:
  - 0270-5257
publication_status: published
publisher: IEEE
publist_id: '128'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Generating tests from counterexamples
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2004'
...
---
OA_type: closed access
_id: '4629'
abstract:
- lang: eng
  text: 'Temporal logic is two-valued: a property is either true or false. When applied
    to the analysis of stochastic systems, or systems with imprecise formal models,
    temporal logic is therefore fragile: even small changes in the model can lead
    to opposite truth values for a specification. We present a generalization of the
    branching-time logic Ctl which achieves robustness with respect to model perturbations
    by giving a quantitative interpretation to predicates and logical operators, and
    by discounting the importance of events according to how late they occur. In every
    state, the value of a formula is a real number in the interval [0,1], where 1
    corresponds to truth and 0 to falsehood. The boolean operators and and or are
    replaced by min and max, the path quantifiers ∃ and ∀ determine sup and inf over
    all paths from a given state, and the temporal operators and □ specify sup and
    inf over a given path; a new operator averages all values along a path. Furthermore,
    all path operators are discounted by a parameter that can be chosen to give more
    weight to states that are closer to the beginning of the path. We interpret the
    resulting logic Dctl over transition systems, Markov chains, and Markov decision
    processes. We present two semantics for Dctl: a path semantics, inspired by the
    standard interpretation of state and path formulas in CTL, and a fixpoint semantics,
    inspired by the μ-calculus evaluation of CTL formulas. We show that, while these
    semantics coincide for CTL, they differ for Dctl, and we provide model-checking
    algorithms for both semantics.'
acknowledgement: This research was supported in part by the AFOSR MURI grant F49620-00-1-0327,
  the ONR grant N00014-02-1-0671, and the NSF grants CCR-0132780, CCR-9988172, CCR-0225610,
  and CCR-0234690.
alternative_title:
- Lecture Notes in Computer Science
article_processing_charge: No
author:
- first_name: Luca
  full_name: De Alfaro, Luca
  last_name: De Alfaro
- first_name: Marco
  full_name: Faella, Marco
  last_name: Faella
- 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: Ritankar
  full_name: Majumdar, Ritankar
  last_name: Majumdar
- first_name: Mariëlle
  full_name: Stoelinga, Mariëlle
  last_name: Stoelinga
citation:
  ama: 'De Alfaro L, Faella M, Henzinger TA, Majumdar R, Stoelinga M. Model checking
    discounted temporal properties. In: Vol 2988. Springer Nature; 2004:77-92. doi:<a
    href="https://doi.org/10.1007/978-3-540-24730-2_6">10.1007/978-3-540-24730-2_6</a>'
  apa: 'De Alfaro, L., Faella, M., Henzinger, T. A., Majumdar, R., &#38; Stoelinga,
    M. (2004). Model checking discounted temporal properties (Vol. 2988, pp. 77–92).
    Presented at the TACAS: Tools and Algorithms for the Construction and Analysis
    of Systems, Barcelona, Spain: Springer Nature. <a href="https://doi.org/10.1007/978-3-540-24730-2_6">https://doi.org/10.1007/978-3-540-24730-2_6</a>'
  chicago: De Alfaro, Luca, Marco Faella, Thomas A Henzinger, Ritankar Majumdar, and
    Mariëlle Stoelinga. “Model Checking Discounted Temporal Properties,” 2988:77–92.
    Springer Nature, 2004. <a href="https://doi.org/10.1007/978-3-540-24730-2_6">https://doi.org/10.1007/978-3-540-24730-2_6</a>.
  ieee: 'L. De Alfaro, M. Faella, T. A. Henzinger, R. Majumdar, and M. Stoelinga,
    “Model checking discounted temporal properties,” presented at the TACAS: Tools
    and Algorithms for the Construction and Analysis of Systems, Barcelona, Spain,
    2004, vol. 2988, pp. 77–92.'
  ista: 'De Alfaro L, Faella M, Henzinger TA, Majumdar R, Stoelinga M. 2004. Model
    checking discounted temporal properties. TACAS: Tools and Algorithms for the Construction
    and Analysis of Systems, Lecture Notes in Computer Science, vol. 2988, 77–92.'
  mla: De Alfaro, Luca, et al. <i>Model Checking Discounted Temporal Properties</i>.
    Vol. 2988, Springer Nature, 2004, pp. 77–92, doi:<a href="https://doi.org/10.1007/978-3-540-24730-2_6">10.1007/978-3-540-24730-2_6</a>.
  short: L. De Alfaro, M. Faella, T.A. Henzinger, R. Majumdar, M. Stoelinga, in:,
    Springer Nature, 2004, pp. 77–92.
conference:
  end_date: 2004-04-02
  location: Barcelona, Spain
  name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
  start_date: 2004-03-29
date_created: 2018-12-11T12:09:50Z
date_published: 2004-04-03T00:00:00Z
date_updated: 2026-05-29T07:32:26Z
day: '03'
doi: 10.1007/978-3-540-24730-2_6
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-540-24730-2_6
intvolume: '      2988'
language:
- iso: eng
month: '04'
oa_version: None
page: 77 - 92
publication_identifier:
  eisbn:
  - '9783540247302'
  isbn:
  - '9783540212997'
publication_status: published
publisher: Springer Nature
publist_id: '79'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Model checking discounted temporal properties
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 2988
year: '2004'
...
---
_id: '6155'
abstract:
- lang: eng
  text: 'The genome of the nematode Caenorhabditis elegans encodes seven soluble guanylate
    cyclases (sGCs) [1]. In mammals, sGCs function as α/β heterodimers activated by
    gaseous ligands binding to a haem prosthetic group 2, 3. The principal activator
    is nitric oxide, which acts through sGCs to regulate diverse cellular events.
    In C. elegans the function of sGCs is mysterious: the worm genome does not appear
    to encode nitric oxide synthase, and all C. elegans sGC subunits are more closely
    related to mammalian β than α subunits [1]. Here, we show that two of the seven
    C. elegans sGCs, GCY-35 and GCY-36, promote aggregation behavior. gcy-35 and gcy-36
    are expressed in a small number of neurons. These include the body cavity neurons
    AQR, PQR, and URX, which are directly exposed to the blood equivalent of C. elegans
    and regulate aggregation behavior [4]. We show that GCY-35 and GCY-36 act as α-like
    and β-like sGC subunits and that their function in the URX sensory neurons is
    sufficient for strong nematode aggregation. Neither GCY-35 nor GCY-36 is absolutely
    required for C. elegans to aggregate. Instead, these molecules may transduce one
    of several pathways that induce C. elegans to aggregate or may modulate aggregation
    by responding to cues in C. elegans body fluid.'
author:
- first_name: Benny H.H
  full_name: Cheung, Benny H.H
  last_name: Cheung
- first_name: Fausto
  full_name: Arellano-Carbajal, Fausto
  last_name: Arellano-Carbajal
- first_name: Irene
  full_name: Rybicki, Irene
  last_name: Rybicki
- first_name: Mario
  full_name: de Bono, Mario
  id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
  last_name: de Bono
  orcid: 0000-0001-8347-0443
citation:
  ama: Cheung BH., Arellano-Carbajal F, Rybicki I, de Bono M. Soluble guanylate cyclases
    act in neurons exposed to the body fluid to promote C. elegans aggregation behavior.
    <i>Current Biology</i>. 2004;14(12):1105-1111. doi:<a href="https://doi.org/10.1016/j.cub.2004.06.027">10.1016/j.cub.2004.06.027</a>
  apa: Cheung, B. H. ., Arellano-Carbajal, F., Rybicki, I., &#38; de Bono, M. (2004).
    Soluble guanylate cyclases act in neurons exposed to the body fluid to promote
    C. elegans aggregation behavior. <i>Current Biology</i>. Elsevier. <a href="https://doi.org/10.1016/j.cub.2004.06.027">https://doi.org/10.1016/j.cub.2004.06.027</a>
  chicago: Cheung, Benny H.H, Fausto Arellano-Carbajal, Irene Rybicki, and Mario de
    Bono. “Soluble Guanylate Cyclases Act in Neurons Exposed to the Body Fluid to
    Promote C. Elegans Aggregation Behavior.” <i>Current Biology</i>. Elsevier, 2004.
    <a href="https://doi.org/10.1016/j.cub.2004.06.027">https://doi.org/10.1016/j.cub.2004.06.027</a>.
  ieee: B. H. . Cheung, F. Arellano-Carbajal, I. Rybicki, and M. de Bono, “Soluble
    guanylate cyclases act in neurons exposed to the body fluid to promote C. elegans
    aggregation behavior,” <i>Current Biology</i>, vol. 14, no. 12. Elsevier, pp.
    1105–1111, 2004.
  ista: Cheung BH., Arellano-Carbajal F, Rybicki I, de Bono M. 2004. Soluble guanylate
    cyclases act in neurons exposed to the body fluid to promote C. elegans aggregation
    behavior. Current Biology. 14(12), 1105–1111.
  mla: Cheung, Benny H. .., et al. “Soluble Guanylate Cyclases Act in Neurons Exposed
    to the Body Fluid to Promote C. Elegans Aggregation Behavior.” <i>Current Biology</i>,
    vol. 14, no. 12, Elsevier, 2004, pp. 1105–11, doi:<a href="https://doi.org/10.1016/j.cub.2004.06.027">10.1016/j.cub.2004.06.027</a>.
  short: B.H.. Cheung, F. Arellano-Carbajal, I. Rybicki, M. de Bono, Current Biology
    14 (2004) 1105–1111.
date_created: 2019-03-21T09:42:01Z
date_published: 2004-06-22T00:00:00Z
date_updated: 2021-01-12T08:06:25Z
day: '22'
doi: 10.1016/j.cub.2004.06.027
extern: '1'
external_id:
  pmid:
  - '15203005'
fulldoi: https://doi.org/10.1016/j.cub.2004.06.027
intvolume: '        14'
issue: '12'
language:
- iso: eng
month: '06'
oa_version: None
page: 1105-1111
pmid: 1
publication: Current Biology
publication_identifier:
  issn:
  - 0960-9822
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: Soluble guanylate cyclases act in neurons exposed to the body fluid to promote
  C. elegans aggregation behavior
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 14
year: '2004'
...
---
_id: '7706'
abstract:
- lang: eng
  text: 'The Sir2 deacetylase modulates organismal life-span in various species. However,
    the molecular mechanisms by which Sir2 increases longevity are largely unknown.
    We show that in mammalian cells, the Sir2 homolog SIRT1 appears to control the
    cellular response to stress by regulating the FOXO family of Forkhead transcription
    factors, a family of proteins that function as sensors of the insulin signaling
    pathway and as regulators of organismal longevity. SIRT1 and the FOXO transcription
    factor FOXO3 formed a complex in cells in response to oxidative stress, and SIRT1
    deacetylated FOXO3 in vitro and within cells. SIRT1 had a dual effect on FOXO3
    function: SIRT1 increased FOXO3''s ability to induce cell cycle arrest and resistance
    to oxidative stress but inhibited FOXO3''s ability to induce cell death. Thus,
    one way in which members of the Sir2 family of proteins may increase organismal
    longevity is by tipping FOXO-dependent responses away from apoptosis and toward
    stress resistance.'
article_processing_charge: No
article_type: original
author:
- first_name: Anne
  full_name: Brunet, Anne
  last_name: Brunet
- first_name: Lora Beatrice Jaeger
  full_name: Sweeney, Lora Beatrice Jaeger
  id: 56BE8254-C4F0-11E9-8E45-0B23E6697425
  last_name: Sweeney
  orcid: 0000-0001-9242-5601
- first_name: 'J Fitzhugh '
  full_name: 'Sturgill, J Fitzhugh '
  last_name: Sturgill
- first_name: Katrin
  full_name: Chua, Katrin
  last_name: Chua
- first_name: Paul
  full_name: Greer, Paul
  last_name: Greer
- first_name: Yingxi
  full_name: Lin, Yingxi
  last_name: Lin
- first_name: Hien
  full_name: Tran, Hien
  last_name: Tran
- first_name: Sarah
  full_name: Ross, Sarah
  last_name: Ross
- first_name: Raul
  full_name: Mostoslavsky, Raul
  last_name: Mostoslavsky
- first_name: Haim
  full_name: Cohen, Haim
  last_name: Cohen
- first_name: Linda
  full_name: Hu, Linda
  last_name: Hu
- first_name: Hwei-Ling
  full_name: Chen, Hwei-Ling
  last_name: Chen
- first_name: Mark
  full_name: Jedrychowski, Mark
  last_name: Jedrychowski
- first_name: Steven
  full_name: Gygi, Steven
  last_name: Gygi
- first_name: David
  full_name: Sinclair, David
  last_name: Sinclair
- first_name: Frederick
  full_name: Alt, Frederick
  last_name: Alt
- first_name: Michael
  full_name: Greenberg, Michael
  last_name: Greenberg
citation:
  ama: Brunet A, Sweeney LB, Sturgill JF, et al. Stress-dependent regulation of FOXO
    transcription factors by the SIRT1 deacetylase. <i>Science</i>. 2004;303(5666):2011-2015.
    doi:<a href="https://doi.org/10.1126/science.1094637">10.1126/science.1094637</a>
  apa: Brunet, A., Sweeney, L. B., Sturgill, J. F., Chua, K., Greer, P., Lin, Y.,
    … Greenberg, M. (2004). Stress-dependent regulation of FOXO transcription factors
    by the SIRT1 deacetylase. <i>Science</i>. American Association for the Advancement
    of Science. <a href="https://doi.org/10.1126/science.1094637">https://doi.org/10.1126/science.1094637</a>
  chicago: Brunet, Anne, Lora B. Sweeney, J Fitzhugh  Sturgill, Katrin Chua, Paul
    Greer, Yingxi Lin, Hien Tran, et al. “Stress-Dependent Regulation of FOXO Transcription
    Factors by the SIRT1 Deacetylase.” <i>Science</i>. American Association for the
    Advancement of Science, 2004. <a href="https://doi.org/10.1126/science.1094637">https://doi.org/10.1126/science.1094637</a>.
  ieee: A. Brunet <i>et al.</i>, “Stress-dependent regulation of FOXO transcription
    factors by the SIRT1 deacetylase,” <i>Science</i>, vol. 303, no. 5666. American
    Association for the Advancement of Science, pp. 2011–2015, 2004.
  ista: Brunet A, Sweeney LB, Sturgill JF, Chua K, Greer P, Lin Y, Tran H, Ross S,
    Mostoslavsky R, Cohen H, Hu L, Chen H-L, Jedrychowski M, Gygi S, Sinclair D, Alt
    F, Greenberg M. 2004. Stress-dependent regulation of FOXO transcription factors
    by the SIRT1 deacetylase. Science. 303(5666), 2011–2015.
  mla: Brunet, Anne, et al. “Stress-Dependent Regulation of FOXO Transcription Factors
    by the SIRT1 Deacetylase.” <i>Science</i>, vol. 303, no. 5666, American Association
    for the Advancement of Science, 2004, pp. 2011–15, doi:<a href="https://doi.org/10.1126/science.1094637">10.1126/science.1094637</a>.
  short: A. Brunet, L.B. Sweeney, J.F. Sturgill, K. Chua, P. Greer, Y. Lin, H. Tran,
    S. Ross, R. Mostoslavsky, H. Cohen, L. Hu, H.-L. Chen, M. Jedrychowski, S. Gygi,
    D. Sinclair, F. Alt, M. Greenberg, Science 303 (2004) 2011–2015.
date_created: 2020-04-30T10:37:41Z
date_published: 2004-03-26T00:00:00Z
date_updated: 2024-01-31T10:14:17Z
day: '26'
doi: 10.1126/science.1094637
extern: '1'
fulldoi: https://doi.org/10.1126/science.1094637
intvolume: '       303'
issue: '5666'
language:
- iso: eng
month: '03'
oa_version: None
page: 2011-2015
publication: Science
publication_identifier:
  issn:
  - 0036-8075
  - 1095-9203
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
status: public
title: Stress-dependent regulation of FOXO transcription factors by the SIRT1 deacetylase
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 303
year: '2004'
...
---
_id: '8517'
abstract:
- lang: eng
  text: We consider the evolution of a connected set on the plane carried by a space
    periodic incompressible stochastic flow. While for almost every realization of
    the stochastic flow at time t most of the particles are at a distance of order
    equation image away from the origin, there is a measure zero set of points that
    escape to infinity at the linear rate. We study the set of points visited by the
    original set by time t and show that such a set, when scaled down by the factor
    of t, has a limiting nonrandom shape.
article_processing_charge: No
article_type: original
author:
- first_name: Dmitry
  full_name: Dolgopyat, Dmitry
  last_name: Dolgopyat
- first_name: Vadim
  full_name: Kaloshin, Vadim
  id: FE553552-CDE8-11E9-B324-C0EBE5697425
  last_name: Kaloshin
  orcid: 0000-0002-6051-2628
- first_name: Leonid
  full_name: Koralov, Leonid
  last_name: Koralov
citation:
  ama: Dolgopyat D, Kaloshin V, Koralov L. A limit shape theorem for periodic stochastic
    dispersion. <i>Communications on Pure and Applied Mathematics</i>. 2004;57(9):1127-1158.
    doi:<a href="https://doi.org/10.1002/cpa.20032">10.1002/cpa.20032</a>
  apa: Dolgopyat, D., Kaloshin, V., &#38; Koralov, L. (2004). A limit shape theorem
    for periodic stochastic dispersion. <i>Communications on Pure and Applied Mathematics</i>.
    Wiley. <a href="https://doi.org/10.1002/cpa.20032">https://doi.org/10.1002/cpa.20032</a>
  chicago: Dolgopyat, Dmitry, Vadim Kaloshin, and Leonid Koralov. “A Limit Shape Theorem
    for Periodic Stochastic Dispersion.” <i>Communications on Pure and Applied Mathematics</i>.
    Wiley, 2004. <a href="https://doi.org/10.1002/cpa.20032">https://doi.org/10.1002/cpa.20032</a>.
  ieee: D. Dolgopyat, V. Kaloshin, and L. Koralov, “A limit shape theorem for periodic
    stochastic dispersion,” <i>Communications on Pure and Applied Mathematics</i>,
    vol. 57, no. 9. Wiley, pp. 1127–1158, 2004.
  ista: Dolgopyat D, Kaloshin V, Koralov L. 2004. A limit shape theorem for periodic
    stochastic dispersion. Communications on Pure and Applied Mathematics. 57(9),
    1127–1158.
  mla: Dolgopyat, Dmitry, et al. “A Limit Shape Theorem for Periodic Stochastic Dispersion.”
    <i>Communications on Pure and Applied Mathematics</i>, vol. 57, no. 9, Wiley,
    2004, pp. 1127–58, doi:<a href="https://doi.org/10.1002/cpa.20032">10.1002/cpa.20032</a>.
  short: D. Dolgopyat, V. Kaloshin, L. Koralov, Communications on Pure and Applied
    Mathematics 57 (2004) 1127–1158.
date_created: 2020-09-18T10:49:12Z
date_published: 2004-09-01T00:00:00Z
date_updated: 2021-01-12T08:19:50Z
day: '01'
doi: 10.1002/cpa.20032
extern: '1'
fulldoi: https://doi.org/10.1002/cpa.20032
intvolume: '        57'
issue: '9'
keyword:
- Applied Mathematics
- General Mathematics
language:
- iso: eng
month: '09'
oa_version: None
page: 1127-1158
publication: Communications on Pure and Applied Mathematics
publication_identifier:
  issn:
  - 0010-3640
  - 1097-0312
publication_status: published
publisher: Wiley
quality_controlled: '1'
status: public
title: A limit shape theorem for periodic stochastic dispersion
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 57
year: '2004'
...
---
_id: '8518'
article_processing_charge: No
article_type: original
author:
- first_name: Leonid
  full_name: Koralov, Leonid
  last_name: Koralov
- first_name: Vadim
  full_name: Kaloshin, Vadim
  id: FE553552-CDE8-11E9-B324-C0EBE5697425
  last_name: Kaloshin
  orcid: 0000-0002-6051-2628
- first_name: Dmitry
  full_name: Dolgopyat, Dmitry
  last_name: Dolgopyat
citation:
  ama: Koralov L, Kaloshin V, Dolgopyat D. Sample path properties of the stochastic
    flows. <i>The Annals of Probability</i>. 2004;32(1A):1-27. doi:<a href="https://doi.org/10.1214/aop/1078415827">10.1214/aop/1078415827</a>
  apa: Koralov, L., Kaloshin, V., &#38; Dolgopyat, D. (2004). Sample path properties
    of the stochastic flows. <i>The Annals of Probability</i>. Institute of Mathematical
    Statistics. <a href="https://doi.org/10.1214/aop/1078415827">https://doi.org/10.1214/aop/1078415827</a>
  chicago: Koralov, Leonid, Vadim Kaloshin, and Dmitry Dolgopyat. “Sample Path Properties
    of the Stochastic Flows.” <i>The Annals of Probability</i>. Institute of Mathematical
    Statistics, 2004. <a href="https://doi.org/10.1214/aop/1078415827">https://doi.org/10.1214/aop/1078415827</a>.
  ieee: L. Koralov, V. Kaloshin, and D. Dolgopyat, “Sample path properties of the
    stochastic flows,” <i>The Annals of Probability</i>, vol. 32, no. 1A. Institute
    of Mathematical Statistics, pp. 1–27, 2004.
  ista: Koralov L, Kaloshin V, Dolgopyat D. 2004. Sample path properties of the stochastic
    flows. The Annals of Probability. 32(1A), 1–27.
  mla: Koralov, Leonid, et al. “Sample Path Properties of the Stochastic Flows.” <i>The
    Annals of Probability</i>, vol. 32, no. 1A, Institute of Mathematical Statistics,
    2004, pp. 1–27, doi:<a href="https://doi.org/10.1214/aop/1078415827">10.1214/aop/1078415827</a>.
  short: L. Koralov, V. Kaloshin, D. Dolgopyat, The Annals of Probability 32 (2004)
    1–27.
date_created: 2020-09-18T10:49:19Z
date_published: 2004-03-04T00:00:00Z
date_updated: 2021-01-12T08:19:50Z
day: '04'
doi: 10.1214/aop/1078415827
extern: '1'
fulldoi: https://doi.org/10.1214/aop/1078415827
intvolume: '        32'
issue: 1A
language:
- iso: eng
month: '03'
oa_version: None
page: 1-27
publication: The Annals of Probability
publication_identifier:
  issn:
  - 0091-1798
publication_status: published
publisher: Institute of Mathematical Statistics
quality_controlled: '1'
status: public
title: Sample path properties of the stochastic flows
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2004'
...
---
_id: '9454'
article_processing_charge: No
article_type: original
author:
- first_name: Simon W.-L.
  full_name: Chan, Simon W.-L.
  last_name: Chan
- first_name: Daniel
  full_name: Zilberman, Daniel
  id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
  last_name: Zilberman
  orcid: 0000-0002-0123-8649
- first_name: ' Zhixin'
  full_name: Xie,  Zhixin
  last_name: Xie
- first_name: ' Lisa K.'
  full_name: Johansen,  Lisa K.
  last_name: Johansen
- first_name: James C.
  full_name: Carrington, James C.
  last_name: Carrington
- first_name: Steven E.
  full_name: Jacobsen, Steven E.
  last_name: Jacobsen
citation:
  ama: Chan SW-L, Zilberman D, Xie  Zhixin, Johansen  Lisa K., Carrington JC, Jacobsen
    SE. RNA silencing genes control de novo DNA methylation. <i>Science</i>. 2004;303(5662):1336.
    doi:<a href="https://doi.org/10.1126/science.1095989">10.1126/science.1095989</a>
  apa: Chan, S. W.-L., Zilberman, D., Xie,  Zhixin, Johansen,  Lisa K., Carrington,
    J. C., &#38; Jacobsen, S. E. (2004). RNA silencing genes control de novo DNA methylation.
    <i>Science</i>. American Association for the Advancement of Science. <a href="https://doi.org/10.1126/science.1095989">https://doi.org/10.1126/science.1095989</a>
  chicago: Chan, Simon W.-L., Daniel Zilberman,  Zhixin Xie,  Lisa K. Johansen, James
    C. Carrington, and Steven E. Jacobsen. “RNA Silencing Genes Control de Novo DNA
    Methylation.” <i>Science</i>. American Association for the Advancement of Science,
    2004. <a href="https://doi.org/10.1126/science.1095989">https://doi.org/10.1126/science.1095989</a>.
  ieee: S. W.-L. Chan, D. Zilberman,  Zhixin Xie,  Lisa K. Johansen, J. C. Carrington,
    and S. E. Jacobsen, “RNA silencing genes control de novo DNA methylation,” <i>Science</i>,
    vol. 303, no. 5662. American Association for the Advancement of Science, p. 1336,
    2004.
  ista: Chan SW-L, Zilberman D, Xie  Zhixin, Johansen  Lisa K., Carrington JC, Jacobsen
    SE. 2004. RNA silencing genes control de novo DNA methylation. Science. 303(5662),
    1336.
  mla: Chan, Simon W. L., et al. “RNA Silencing Genes Control de Novo DNA Methylation.”
    <i>Science</i>, vol. 303, no. 5662, American Association for the Advancement of
    Science, 2004, p. 1336, doi:<a href="https://doi.org/10.1126/science.1095989">10.1126/science.1095989</a>.
  short: S.W.-L. Chan, D. Zilberman,  Zhixin Xie,  Lisa K. Johansen, J.C. Carrington,
    S.E. Jacobsen, Science 303 (2004) 1336.
date_created: 2021-06-04T11:12:35Z
date_published: 2004-02-27T00:00:00Z
date_updated: 2021-12-14T09:13:53Z
day: '27'
department:
- _id: DaZi
doi: 10.1126/science.1095989
extern: '1'
external_id:
  pmid:
  - '14988555'
fulldoi: https://doi.org/10.1126/science.1095989
intvolume: '       303'
issue: '5662'
keyword:
- Multidisciplinary
language:
- iso: eng
month: '02'
oa_version: None
page: '1336'
pmid: 1
publication: Science
publication_identifier:
  eissn:
  - 1095-9203
  issn:
  - 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: RNA silencing genes control de novo DNA methylation
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 303
year: '2004'
...
---
_id: '9493'
abstract:
- lang: eng
  text: In a number of organisms, transgenes containing transcribed inverted repeats
    (IRs) that produce hairpin RNA can trigger RNA-mediated silencing, which is associated
    with 21-24 nucleotide small interfering RNAs (siRNAs). In plants, IR-driven RNA
    silencing also causes extensive cytosine methylation of homologous DNA in both
    the transgene "trigger" and any other homologous DNA sequences--"targets". Endogenous
    genomic sequences, including transposable elements and repeated elements, are
    also subject to RNA-mediated silencing. The RNA silencing gene ARGONAUTE4 (AGO4)
    is required for maintenance of DNA methylation at several endogenous loci and
    for the establishment of methylation at the FWA gene. Here, we show that mutation
    of AGO4 substantially reduces the maintenance of DNA methylation triggered by
    IR transgenes, but AGO4 loss-of-function does not block the initiation of DNA
    methylation by IRs. AGO4 primarily affects non-CG methylation of the target sequences,
    while the IR trigger sequences lose methylation in all sequence contexts. Finally,
    we find that AGO4 and the DRM methyltransferase genes are required for maintenance
    of siRNAs at a subset of endogenous sequences, but AGO4 is not required for the
    accumulation of IR-induced siRNAs or a number of endogenous siRNAs, suggesting
    that AGO4 may function downstream of siRNA production.
article_processing_charge: No
article_type: original
author:
- first_name: Daniel
  full_name: Zilberman, Daniel
  id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
  last_name: Zilberman
  orcid: 0000-0002-0123-8649
- first_name: Xiaofeng
  full_name: Cao, Xiaofeng
  last_name: Cao
- first_name: Lisa K.
  full_name: Johansen, Lisa K.
  last_name: Johansen
- first_name: Zhixin
  full_name: Xie, Zhixin
  last_name: Xie
- first_name: James C.
  full_name: Carrington, James C.
  last_name: Carrington
- first_name: Steven E.
  full_name: Jacobsen, Steven E.
  last_name: Jacobsen
citation:
  ama: Zilberman D, Cao X, Johansen LK, Xie Z, Carrington JC, Jacobsen SE. Role of
    Arabidopsis ARGONAUTE4 in RNA-directed DNA methylation triggered by inverted repeats.
    <i>Current Biology</i>. 2004;14(13):1214-1220. doi:<a href="https://doi.org/10.1016/j.cub.2004.06.055">10.1016/j.cub.2004.06.055</a>
  apa: Zilberman, D., Cao, X., Johansen, L. K., Xie, Z., Carrington, J. C., &#38;
    Jacobsen, S. E. (2004). Role of Arabidopsis ARGONAUTE4 in RNA-directed DNA methylation
    triggered by inverted repeats. <i>Current Biology</i>. Elsevier. <a href="https://doi.org/10.1016/j.cub.2004.06.055">https://doi.org/10.1016/j.cub.2004.06.055</a>
  chicago: Zilberman, Daniel, Xiaofeng Cao, Lisa K. Johansen, Zhixin Xie, James C.
    Carrington, and Steven E. Jacobsen. “Role of Arabidopsis ARGONAUTE4 in RNA-Directed
    DNA Methylation Triggered by Inverted Repeats.” <i>Current Biology</i>. Elsevier,
    2004. <a href="https://doi.org/10.1016/j.cub.2004.06.055">https://doi.org/10.1016/j.cub.2004.06.055</a>.
  ieee: D. Zilberman, X. Cao, L. K. Johansen, Z. Xie, J. C. Carrington, and S. E.
    Jacobsen, “Role of Arabidopsis ARGONAUTE4 in RNA-directed DNA methylation triggered
    by inverted repeats,” <i>Current Biology</i>, vol. 14, no. 13. Elsevier, pp. 1214–1220,
    2004.
  ista: Zilberman D, Cao X, Johansen LK, Xie Z, Carrington JC, Jacobsen SE. 2004.
    Role of Arabidopsis ARGONAUTE4 in RNA-directed DNA methylation triggered by inverted
    repeats. Current Biology. 14(13), 1214–1220.
  mla: Zilberman, Daniel, et al. “Role of Arabidopsis ARGONAUTE4 in RNA-Directed DNA
    Methylation Triggered by Inverted Repeats.” <i>Current Biology</i>, vol. 14, no.
    13, Elsevier, 2004, pp. 1214–20, doi:<a href="https://doi.org/10.1016/j.cub.2004.06.055">10.1016/j.cub.2004.06.055</a>.
  short: D. Zilberman, X. Cao, L.K. Johansen, Z. Xie, J.C. Carrington, S.E. Jacobsen,
    Current Biology 14 (2004) 1214–1220.
date_created: 2021-06-07T10:33:00Z
date_published: 2004-07-13T00:00:00Z
date_updated: 2021-12-14T08:52:00Z
day: '13'
department:
- _id: DaZi
doi: 10.1016/j.cub.2004.06.055
extern: '1'
external_id:
  pmid:
  - '15242620 '
fulldoi: https://doi.org/10.1016/j.cub.2004.06.055
intvolume: '        14'
issue: '13'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1016/j.cub.2004.06.055
month: '07'
oa: 1
oa_version: Published Version
page: 1214-1220
pmid: 1
publication: Current Biology
publication_identifier:
  eissn:
  - 1879-0445
  issn:
  - 0960-9822
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Role of Arabidopsis ARGONAUTE4 in RNA-directed DNA methylation triggered by
  inverted repeats
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 14
year: '2004'
...
---
_id: '9511'
abstract:
- lang: eng
  text: Recent progress in understanding the silencing of transposable elements in
    the model plant Arabidopsis has revealed an interplay between DNA methylation,
    histone methylation and small interfering RNAs. DNA and histone methylation are
    not always sufficient to maintain silencing, and RNA-based reinforcement can be
    needed to maintain as well as initiate it.
article_number: '249'
article_processing_charge: No
article_type: review
author:
- first_name: Daniel
  full_name: Zilberman, Daniel
  id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
  last_name: Zilberman
  orcid: 0000-0002-0123-8649
- first_name: Steven
  full_name: Henikoff, Steven
  last_name: Henikoff
citation:
  ama: 'Zilberman D, Henikoff S. Silencing of transposons in plant genomes: kick them
    when they’re down. <i>Genome Biology</i>. 2004;5(12). doi:<a href="https://doi.org/10.1186/gb-2004-5-12-249">10.1186/gb-2004-5-12-249</a>'
  apa: 'Zilberman, D., &#38; Henikoff, S. (2004). Silencing of transposons in plant
    genomes: kick them when they’re down. <i>Genome Biology</i>. Springer Nature.
    <a href="https://doi.org/10.1186/gb-2004-5-12-249">https://doi.org/10.1186/gb-2004-5-12-249</a>'
  chicago: 'Zilberman, Daniel, and Steven Henikoff. “Silencing of Transposons in Plant
    Genomes: Kick Them When They’re Down.” <i>Genome Biology</i>. Springer Nature,
    2004. <a href="https://doi.org/10.1186/gb-2004-5-12-249">https://doi.org/10.1186/gb-2004-5-12-249</a>.'
  ieee: 'D. Zilberman and S. Henikoff, “Silencing of transposons in plant genomes:
    kick them when they’re down,” <i>Genome Biology</i>, vol. 5, no. 12. Springer
    Nature, 2004.'
  ista: 'Zilberman D, Henikoff S. 2004. Silencing of transposons in plant genomes:
    kick them when they’re down. Genome Biology. 5(12), 249.'
  mla: 'Zilberman, Daniel, and Steven Henikoff. “Silencing of Transposons in Plant
    Genomes: Kick Them When They’re Down.” <i>Genome Biology</i>, vol. 5, no. 12,
    249, Springer Nature, 2004, doi:<a href="https://doi.org/10.1186/gb-2004-5-12-249">10.1186/gb-2004-5-12-249</a>.'
  short: D. Zilberman, S. Henikoff, Genome Biology 5 (2004).
date_created: 2021-06-07T12:58:06Z
date_published: 2004-11-16T00:00:00Z
date_updated: 2021-12-14T08:44:24Z
day: '16'
department:
- _id: DaZi
doi: 10.1186/gb-2004-5-12-249
extern: '1'
external_id:
  pmid:
  - '15575975'
fulldoi: https://doi.org/10.1186/gb-2004-5-12-249
intvolume: '         5'
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1186/gb-2004-5-12-249
month: '11'
oa: 1
oa_version: Published Version
pmid: 1
publication: Genome Biology
publication_identifier:
  eissn:
  - 1465-6906
  issn:
  - 1474-760X
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Silencing of transposons in plant genomes: kick them when they''re down'
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 5
year: '2004'
...
---
_id: '9517'
abstract:
- lang: eng
  text: Multicellular eukaryotes produce small RNA molecules (approximately 21–24
    nucleotides) of two general types, microRNA (miRNA) and short interfering RNA
    (siRNA). They collectively function as sequence-specific guides to silence or
    regulate genes, transposons, and viruses and to modify chromatin and genome structure.
    Formation or activity of small RNAs requires factors belonging to gene families
    that encode DICER (or DICER-LIKE [DCL]) and ARGONAUTE proteins and, in the case
    of some siRNAs, RNA-dependent RNA polymerase (RDR) proteins. Unlike many animals,
    plants encode multiple DCL and RDR proteins. Using a series of insertion mutants
    of Arabidopsis thaliana, unique functions for three DCL proteins in miRNA (DCL1),
    endogenous siRNA (DCL3), and viral siRNA (DCL2) biogenesis were identified. One
    RDR protein (RDR2) was required for all endogenous siRNAs analyzed. The loss of
    endogenous siRNA in dcl3 and rdr2 mutants was associated with loss of heterochromatic
    marks and increased transcript accumulation at some loci. Defects in siRNA-generation
    activity in response to turnip crinkle virus in dcl2 mutant plants correlated
    with increased virus susceptibility. We conclude that proliferation and diversification
    of DCL and RDR genes during evolution of plants contributed to specialization
    of small RNA-directed pathways for development, chromatin structure, and defense.
article_processing_charge: No
article_type: original
author:
- first_name: Zhixin
  full_name: Xie, Zhixin
  last_name: Xie
- first_name: Lisa K.
  full_name: Johansen, Lisa K.
  last_name: Johansen
- first_name: Adam M.
  full_name: Gustafson, Adam M.
  last_name: Gustafson
- first_name: Kristin D.
  full_name: Kasschau, Kristin D.
  last_name: Kasschau
- first_name: 'Andrew D. '
  full_name: 'Lellis, Andrew D. '
  last_name: Lellis
- first_name: Daniel
  full_name: Zilberman, Daniel
  id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
  last_name: Zilberman
  orcid: 0000-0002-0123-8649
- first_name: Steven E.
  full_name: Jacobsen, Steven E.
  last_name: Jacobsen
- first_name: James C.
  full_name: Carrington, James C.
  last_name: Carrington
citation:
  ama: Xie Z, Johansen LK, Gustafson AM, et al. Genetic and functional diversification
    of small RNA pathways in plants. <i>PLoS Biology</i>. 2004;2(5):0642-0652. doi:<a
    href="https://doi.org/10.1371/journal.pbio.0020104">10.1371/journal.pbio.0020104</a>
  apa: Xie, Z., Johansen, L. K., Gustafson, A. M., Kasschau, K. D., Lellis, A. D.,
    Zilberman, D., … Carrington, J. C. (2004). Genetic and functional diversification
    of small RNA pathways in plants. <i>PLoS Biology</i>. Public Library of Science.
    <a href="https://doi.org/10.1371/journal.pbio.0020104">https://doi.org/10.1371/journal.pbio.0020104</a>
  chicago: Xie, Zhixin, Lisa K. Johansen, Adam M. Gustafson, Kristin D. Kasschau,
    Andrew D.  Lellis, Daniel Zilberman, Steven E. Jacobsen, and James C. Carrington.
    “Genetic and Functional Diversification of Small RNA Pathways in Plants.” <i>PLoS
    Biology</i>. Public Library of Science, 2004. <a href="https://doi.org/10.1371/journal.pbio.0020104">https://doi.org/10.1371/journal.pbio.0020104</a>.
  ieee: Z. Xie <i>et al.</i>, “Genetic and functional diversification of small RNA
    pathways in plants,” <i>PLoS Biology</i>, vol. 2, no. 5. Public Library of Science,
    pp. 0642–0652, 2004.
  ista: Xie Z, Johansen LK, Gustafson AM, Kasschau KD, Lellis AD, Zilberman D, Jacobsen
    SE, Carrington JC. 2004. Genetic and functional diversification of small RNA pathways
    in plants. PLoS Biology. 2(5), 0642–0652.
  mla: Xie, Zhixin, et al. “Genetic and Functional Diversification of Small RNA Pathways
    in Plants.” <i>PLoS Biology</i>, vol. 2, no. 5, Public Library of Science, 2004,
    pp. 0642–52, doi:<a href="https://doi.org/10.1371/journal.pbio.0020104">10.1371/journal.pbio.0020104</a>.
  short: Z. Xie, L.K. Johansen, A.M. Gustafson, K.D. Kasschau, A.D. Lellis, D. Zilberman,
    S.E. Jacobsen, J.C. Carrington, PLoS Biology 2 (2004) 0642–0652.
date_created: 2021-06-07T14:12:08Z
date_published: 2004-02-24T00:00:00Z
date_updated: 2021-12-14T08:43:57Z
day: '24'
department:
- _id: DaZi
doi: 10.1371/journal.pbio.0020104
extern: '1'
external_id:
  pmid:
  - '15024409'
fulldoi: https://doi.org/10.1371/journal.pbio.0020104
intvolume: '         2'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1371/journal.pbio.0020104
month: '02'
oa: 1
oa_version: Published Version
page: 0642-0652
pmid: 1
publication: PLoS Biology
publication_identifier:
  eissn:
  - 1545-7885
  issn:
  - 1544-9173
publication_status: published
publisher: Public Library of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: Genetic and functional diversification of small RNA pathways in plants
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 2
year: '2004'
...
---
_id: '7333'
abstract:
- lang: eng
  text: The analysis of the complete H2/air polymer electrolyte fuel cell system shows
    that process air humidification is one of the biggest obstacles for a high performance
    portable system in the kW range. Therefore, a new concept, with passive process
    air humidification integrated into the stack, has been developed. Humidification
    in each cell makes the process independent from the number of cells and the operation
    mode, thus making the concept fully scalable. Without external humidification
    the system is simpler, smaller, and cheaper. The humidification of the process
    air is achieved by transfer of product water from the exhaust air, through part
    of the membrane, to the dry intake air. Tests have shown that cells using the
    concept of internal humidification and operated with dry air at 70 ° have almost
    the same performance as when operated with external humidification. A 42‐cell
    stack with this internal humidification concept was built and integrated into
    a portable 1 kW power generator system.
article_processing_charge: No
article_type: original
author:
- first_name: M.
  full_name: Santis, M.
  last_name: Santis
- first_name: D.
  full_name: Schmid, D.
  last_name: Schmid
- first_name: M.
  full_name: Ruge, M.
  last_name: Ruge
- first_name: Stefan Alexander
  full_name: Freunberger, Stefan Alexander
  id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
  last_name: Freunberger
  orcid: 0000-0003-2902-5319
- first_name: F.N.
  full_name: Büchi, F.N.
  last_name: Büchi
citation:
  ama: Santis M, Schmid D, Ruge M, Freunberger SA, Büchi FN. Modular stack-internal
    air humidification concept-verification in a 1 kW stack. <i>Fuel Cells</i>. 2004;4(3):214-218.
    doi:<a href="https://doi.org/10.1002/fuce.200400028">10.1002/fuce.200400028</a>
  apa: Santis, M., Schmid, D., Ruge, M., Freunberger, S. A., &#38; Büchi, F. N. (2004).
    Modular stack-internal air humidification concept-verification in a 1 kW stack.
    <i>Fuel Cells</i>. Wiley. <a href="https://doi.org/10.1002/fuce.200400028">https://doi.org/10.1002/fuce.200400028</a>
  chicago: Santis, M., D. Schmid, M. Ruge, Stefan Alexander Freunberger, and F.N.
    Büchi. “Modular Stack-Internal Air Humidification Concept-Verification in a 1 KW
    Stack.” <i>Fuel Cells</i>. Wiley, 2004. <a href="https://doi.org/10.1002/fuce.200400028">https://doi.org/10.1002/fuce.200400028</a>.
  ieee: M. Santis, D. Schmid, M. Ruge, S. A. Freunberger, and F. N. Büchi, “Modular
    stack-internal air humidification concept-verification in a 1 kW stack,” <i>Fuel
    Cells</i>, vol. 4, no. 3. Wiley, pp. 214–218, 2004.
  ista: Santis M, Schmid D, Ruge M, Freunberger SA, Büchi FN. 2004. Modular stack-internal
    air humidification concept-verification in a 1 kW stack. Fuel Cells. 4(3), 214–218.
  mla: Santis, M., et al. “Modular Stack-Internal Air Humidification Concept-Verification
    in a 1 KW Stack.” <i>Fuel Cells</i>, vol. 4, no. 3, Wiley, 2004, pp. 214–18, doi:<a
    href="https://doi.org/10.1002/fuce.200400028">10.1002/fuce.200400028</a>.
  short: M. Santis, D. Schmid, M. Ruge, S.A. Freunberger, F.N. Büchi, Fuel Cells 4
    (2004) 214–218.
date_created: 2020-01-15T12:24:14Z
date_published: 2004-08-01T00:00:00Z
date_updated: 2021-01-12T08:13:08Z
day: '01'
doi: 10.1002/fuce.200400028
extern: '1'
fulldoi: https://doi.org/10.1002/fuce.200400028
intvolume: '         4'
issue: '3'
language:
- iso: eng
month: '08'
oa_version: None
page: 214-218
publication: Fuel Cells
publication_identifier:
  issn:
  - 1615-6846
  - 1615-6854
publication_status: published
publisher: Wiley
quality_controlled: '1'
status: public
title: Modular stack-internal air humidification concept-verification in a 1 kW stack
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2004'
...
---
_id: '7334'
abstract:
- lang: eng
  text: 'Fundamental and phenomenological models for cells, stacks, and complete systems
    of PEFC and SOFC are reviewed and their predictive power is assessed by comparing
    model simulations against experiments. Computationally efficient models suited
    for engineering design include the (1+1) dimensionality approach, which decouples
    the membrane in-plane and through-plane processes, and the volume-averaged-method
    (VAM) that considers only the lumped effect of pre-selected system components.
    The former model was shown to capture the measured lateral current density inhomogeneities
    in a PEFC and the latter was used for the optimization of commercial SOFC systems.
    State Space Modeling (SSM) was used to identify the main reaction pathways in
    SOFC and, in conjunction with the implementation of geometrically well-defined
    electrodes, has opened a new direction for the understanding of electrochemical
    reactions. Furthermore, SSM has advanced the understanding of the COpoisoning-induced
    anode impedance in PEFC. Detailed numerical models such as the Lattice Boltzmann
    (LB) method for transport in porous media and the full 3-D Computational Fluid
    Dynamics (CFD) Navier-Stokes simulations are addressed. These models contain all
    components of the relevant physics and they can improve the understanding of the
    related phenomena, a necessary condition for the development of both appropriate
    simplified models as well as reliable technologies. Within the LB framework, a
    technique for the characterization and computer-reconstruction of the porous electrode
    structure was developed using advanced pattern recognition algorithms. In CFD
    modeling, 3-D simulations were used to investigate SOFC with internal methane
    steam reforming and have exemplified the significance of porous and novel fractal
    channel distributors for the fuel and oxidant delivery, as well as for the cooling
    of PEFC. As importantly, the novel concept has been put forth of functionally
    designed, fractal-shaped fuel cells, showing promise of significant performance
    improvements over the conventional rectangular shaped units. Thermo-economic modeling
    for the optimization of PEFC is finally addressed. '
article_processing_charge: No
article_type: original
author:
- first_name: John
  full_name: Mantzaras, John
  last_name: Mantzaras
- first_name: Stefan Alexander
  full_name: Freunberger, Stefan Alexander
  id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
  last_name: Freunberger
  orcid: 0000-0003-2902-5319
- first_name: Felix N.
  full_name: Büchi, Felix N.
  last_name: Büchi
- first_name: Markus
  full_name: Roos, Markus
  last_name: Roos
- first_name: Wilhelm
  full_name: Brandstätter, Wilhelm
  last_name: Brandstätter
- first_name: Michel
  full_name: Prestat, Michel
  last_name: Prestat
- first_name: Ludwig J.
  full_name: Gauckler, Ludwig J.
  last_name: Gauckler
- first_name: Bernhard
  full_name: Andreaus, Bernhard
  last_name: Andreaus
- first_name: Faegheh
  full_name: Hajbolouri, Faegheh
  last_name: Hajbolouri
- first_name: Stephan M.
  full_name: Senn, Stephan M.
  last_name: Senn
- first_name: Dimos
  full_name: Poulikakos, Dimos
  last_name: Poulikakos
- first_name: Andreas K.
  full_name: Chaniotis, Andreas K.
  last_name: Chaniotis
- first_name: Diego
  full_name: Larrain, Diego
  last_name: Larrain
- first_name: Nordahl
  full_name: Autissier, Nordahl
  last_name: Autissier
- first_name: François
  full_name: Maréchal, François
  last_name: Maréchal
citation:
  ama: Mantzaras J, Freunberger SA, Büchi FN, et al. Fuel cell modeling and simulations.
    <i>CHIMIA International Journal for Chemistry</i>. 2004;58(12):857-868. doi:<a
    href="https://doi.org/10.2533/000942904777677029">10.2533/000942904777677029</a>
  apa: Mantzaras, J., Freunberger, S. A., Büchi, F. N., Roos, M., Brandstätter, W.,
    Prestat, M., … Maréchal, F. (2004). Fuel cell modeling and simulations. <i>CHIMIA
    International Journal for Chemistry</i>. Swiss Chemical Society. <a href="https://doi.org/10.2533/000942904777677029">https://doi.org/10.2533/000942904777677029</a>
  chicago: Mantzaras, John, Stefan Alexander Freunberger, Felix N. Büchi, Markus Roos,
    Wilhelm Brandstätter, Michel Prestat, Ludwig J. Gauckler, et al. “Fuel Cell Modeling
    and Simulations.” <i>CHIMIA International Journal for Chemistry</i>. Swiss Chemical
    Society, 2004. <a href="https://doi.org/10.2533/000942904777677029">https://doi.org/10.2533/000942904777677029</a>.
  ieee: J. Mantzaras <i>et al.</i>, “Fuel cell modeling and simulations,” <i>CHIMIA
    International Journal for Chemistry</i>, vol. 58, no. 12. Swiss Chemical Society,
    pp. 857–868, 2004.
  ista: Mantzaras J, Freunberger SA, Büchi FN, Roos M, Brandstätter W, Prestat M,
    Gauckler LJ, Andreaus B, Hajbolouri F, Senn SM, Poulikakos D, Chaniotis AK, Larrain
    D, Autissier N, Maréchal F. 2004. Fuel cell modeling and simulations. CHIMIA International
    Journal for Chemistry. 58(12), 857–868.
  mla: Mantzaras, John, et al. “Fuel Cell Modeling and Simulations.” <i>CHIMIA International
    Journal for Chemistry</i>, vol. 58, no. 12, Swiss Chemical Society, 2004, pp.
    857–68, doi:<a href="https://doi.org/10.2533/000942904777677029">10.2533/000942904777677029</a>.
  short: J. Mantzaras, S.A. Freunberger, F.N. Büchi, M. Roos, W. Brandstätter, M.
    Prestat, L.J. Gauckler, B. Andreaus, F. Hajbolouri, S.M. Senn, D. Poulikakos,
    A.K. Chaniotis, D. Larrain, N. Autissier, F. Maréchal, CHIMIA International Journal
    for Chemistry 58 (2004) 857–868.
date_created: 2020-01-15T12:24:23Z
date_published: 2004-12-01T00:00:00Z
date_updated: 2021-01-12T08:13:09Z
day: '01'
doi: 10.2533/000942904777677029
extern: '1'
fulldoi: https://doi.org/10.2533/000942904777677029
intvolume: '        58'
issue: '12'
language:
- iso: eng
month: '12'
oa_version: None
page: 857-868
publication: CHIMIA International Journal for Chemistry
publication_identifier:
  issn:
  - 0009-4293
publication_status: published
publisher: Swiss Chemical Society
quality_controlled: '1'
status: public
title: Fuel cell modeling and simulations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 58
year: '2004'
...
---
OA_place: repository
OA_type: green
_id: '3988'
abstract:
- lang: eng
  text: We give an algorithm that locally improves the fit between two proteins modeled
    as space-filling diagrams. The algorithm defines the fit in purely geometric terms
    and improves by applying a rigid motion to one of the two proteins. Our implementation
    of the algorithm takes between three and ten seconds and converges with high likelihood
    to the correct docked configuration, provided it starts at a position away from
    the correct one by at most 18 degrees of rotation and at most 3.0Angstrom of translation.
    The speed and convergence radius make this an attractive algorithm to use in combination
    with a coarse sampling of the six-dimensional space of rigid motions.
acknowledgement: Supported by NSF under grant CCR-00-86013, BGT Postdoc Program from
  Duke University and NIH under grant R01 GM61822-01.
alternative_title:
- Lecture Notes in Computer Science
article_processing_charge: No
author:
- first_name: Vicky
  full_name: Choi, Vicky
  last_name: Choi
- first_name: Pankaj
  full_name: Agarwal, Pankaj
  last_name: Agarwal
- first_name: Herbert
  full_name: Edelsbrunner, Herbert
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
- first_name: Johannes
  full_name: Rudolph, Johannes
  last_name: Rudolph
citation:
  ama: 'Choi V, Agarwal P, Edelsbrunner H, Rudolph J. Local search heuristic for rigid
    protein docking. In: <i>Proceedings of the 4th International Workshop of Algorithms
    in Bioinformatics</i>. Vol 3240. Springer Nature; 2004:218-229. doi:<a href="https://doi.org/10.1007/978-3-540-30219-3_19">10.1007/978-3-540-30219-3_19</a>'
  apa: 'Choi, V., Agarwal, P., Edelsbrunner, H., &#38; Rudolph, J. (2004). Local search
    heuristic for rigid protein docking. In <i>Proceedings of the 4th International
    Workshop of Algorithms in Bioinformatics</i> (Vol. 3240, pp. 218–229). Bergen,
    Norway: Springer Nature. <a href="https://doi.org/10.1007/978-3-540-30219-3_19">https://doi.org/10.1007/978-3-540-30219-3_19</a>'
  chicago: Choi, Vicky, Pankaj Agarwal, Herbert Edelsbrunner, and Johannes Rudolph.
    “Local Search Heuristic for Rigid Protein Docking.” In <i>Proceedings of the 4th
    International Workshop of Algorithms in Bioinformatics</i>, 3240:218–29. Springer
    Nature, 2004. <a href="https://doi.org/10.1007/978-3-540-30219-3_19">https://doi.org/10.1007/978-3-540-30219-3_19</a>.
  ieee: V. Choi, P. Agarwal, H. Edelsbrunner, and J. Rudolph, “Local search heuristic
    for rigid protein docking,” in <i>Proceedings of the 4th International Workshop
    of Algorithms in Bioinformatics</i>, Bergen, Norway, 2004, vol. 3240, pp. 218–229.
  ista: 'Choi V, Agarwal P, Edelsbrunner H, Rudolph J. 2004. Local search heuristic
    for rigid protein docking. Proceedings of the 4th International Workshop of Algorithms
    in Bioinformatics. WABI: 4th International Workshop on Algorithms in Bioinformatics,
    Lecture Notes in Computer Science, vol. 3240, 218–229.'
  mla: Choi, Vicky, et al. “Local Search Heuristic for Rigid Protein Docking.” <i>Proceedings
    of the 4th International Workshop of Algorithms in Bioinformatics</i>, vol. 3240,
    Springer Nature, 2004, pp. 218–29, doi:<a href="https://doi.org/10.1007/978-3-540-30219-3_19">10.1007/978-3-540-30219-3_19</a>.
  short: V. Choi, P. Agarwal, H. Edelsbrunner, J. Rudolph, in:, Proceedings of the
    4th International Workshop of Algorithms in Bioinformatics, Springer Nature, 2004,
    pp. 218–229.
conference:
  end_date: 2004-09-21
  location: Bergen, Norway
  name: 'WABI: 4th International Workshop on Algorithms in Bioinformatics'
  start_date: 2004-09-17
date_created: 2018-12-11T12:06:17Z
date_published: 2004-10-01T00:00:00Z
date_updated: 2026-05-29T12:02:16Z
day: '01'
doi: 10.1007/978-3-540-30219-3_19
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-540-30219-3_19
intvolume: '      3240'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.math.unm.edu/~vageli/courses/Ma504/matlab/project/pdf/docking_RMSD.pdf
month: '10'
oa: 1
oa_version: Preprint
page: 218 - 229
publication: Proceedings of the 4th International Workshop of Algorithms in Bioinformatics
publication_identifier:
  eisbn:
  - '9783540302193'
  isbn:
  - '9783540230182'
publication_status: published
publisher: Springer Nature
publist_id: '2136'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Local search heuristic for rigid protein docking
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 3240
year: '2004'
...
---
OA_type: closed access
_id: '4172'
abstract:
- lang: eng
  text: 'During vertebrate gastrulation, a relatively limited number of blastodermal
    cells undergoes a stereotypical set of cellular movements that leads to formation
    of the three germ layers: ectoderm, mesoderm and endoderm. Gastrulation, therefore,
    provides a unique developmental system in which to study cell movements in vivo
    in a fairly simple cellular context. Recent advances have been made in elucidating
    the cellular and molecular mechanisms that underlie cell movements during zebrafish
    gastrulation. These findings can be compared with observations made in other model
    systems to identify potential general mechanisms of cell migration during development.'
article_processing_charge: No
article_type: review
author:
- first_name: Juan
  full_name: Montero, Juan
  last_name: Montero
- first_name: Carl-Philipp J
  full_name: Heisenberg, Carl-Philipp J
  id: 39427864-F248-11E8-B48F-1D18A9856A87
  last_name: Heisenberg
  orcid: 0000-0002-0912-4566
citation:
  ama: 'Montero J, Heisenberg C-PJ. Gastrulation dynamics: cells move into focus.
    <i>Trends in Cell Biology</i>. 2004;14(11):620-627. doi:<a href="https://doi.org/10.1016/j.tcb.2004.09.008">10.1016/j.tcb.2004.09.008</a>'
  apa: 'Montero, J., &#38; Heisenberg, C.-P. J. (2004). Gastrulation dynamics: cells
    move into focus. <i>Trends in Cell Biology</i>. Elsevier. <a href="https://doi.org/10.1016/j.tcb.2004.09.008">https://doi.org/10.1016/j.tcb.2004.09.008</a>'
  chicago: 'Montero, Juan, and Carl-Philipp J Heisenberg. “Gastrulation Dynamics:
    Cells Move into Focus.” <i>Trends in Cell Biology</i>. Elsevier, 2004. <a href="https://doi.org/10.1016/j.tcb.2004.09.008">https://doi.org/10.1016/j.tcb.2004.09.008</a>.'
  ieee: 'J. Montero and C.-P. J. Heisenberg, “Gastrulation dynamics: cells move into
    focus,” <i>Trends in Cell Biology</i>, vol. 14, no. 11. Elsevier, pp. 620–627,
    2004.'
  ista: 'Montero J, Heisenberg C-PJ. 2004. Gastrulation dynamics: cells move into
    focus. Trends in Cell Biology. 14(11), 620–627.'
  mla: 'Montero, Juan, and Carl-Philipp J. Heisenberg. “Gastrulation Dynamics: Cells
    Move into Focus.” <i>Trends in Cell Biology</i>, vol. 14, no. 11, Elsevier, 2004,
    pp. 620–27, doi:<a href="https://doi.org/10.1016/j.tcb.2004.09.008">10.1016/j.tcb.2004.09.008</a>.'
  short: J. Montero, C.-P.J. Heisenberg, Trends in Cell Biology 14 (2004) 620–627.
date_created: 2018-12-11T12:07:23Z
date_published: 2004-11-01T00:00:00Z
date_updated: 2026-05-29T11:53:49Z
day: '01'
doi: 10.1016/j.tcb.2004.09.008
extern: '1'
external_id:
  pmid:
  - '15519851'
fulldoi: https://doi.org/10.1016/j.tcb.2004.09.008
intvolume: '        14'
issue: '11'
language:
- iso: eng
month: '11'
oa_version: None
page: 620 - 627
pmid: 1
publication: Trends in Cell Biology
publication_identifier:
  issn:
  - 0962-8924
  unknown:
  - 1879-3088
publication_status: published
publisher: Elsevier
publist_id: '1948'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Gastrulation dynamics: cells move into focus'
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 14
year: '2004'
...
---
OA_type: closed access
_id: '4224'
abstract:
- lang: eng
  text: Developing cells acquire positional information by reading the graded distribution
    of morphogens. In Drosophila, the Dpp morphogen forms a long-range concentration
    gradient by spreading from a restricted source in the developing wing. It has
    been assumed that Dpp spreads by extracellular diffusion. Under this assumption,
    the main role of endocytosis in gradient formation is to downregulate receptors
    at the cell surface. These surface receptors bind to the ligand and thereby interfere
    with its long-range movement. Recent experiments indicate that Dpp spreading is
    mediated by Dynamin-dependent endocytosis in the target tissue, suggesting that
    extracellular diffusion alone cannot account for Dpp dispersal. Here, we perform
    a theoretical study of a model for morphogen spreading based on extracellular
    diffusion, which takes into account receptor binding and trafficking. We compare
    profiles of ligand and surface receptors obtained in this model with experimental
    data. To this end, we monitored directly the pool of surface receptors and extracellular
    Dpp with specific antibodies. We conclude that current models considering pure
    extracellular diffusion cannot explain the observed role of endocytosis during
    Dpp long-range movement.
article_processing_charge: No
article_type: original
author:
- first_name: Karsten
  full_name: Kruse, Karsten
  last_name: Kruse
- first_name: Periklis
  full_name: Pantazis, Periklis
  last_name: Pantazis
- first_name: Mark Tobias
  full_name: Bollenbach, Mark Tobias
  id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
  last_name: Bollenbach
  orcid: 0000-0003-4398-476X
- first_name: Frank
  full_name: Julicher, Frank
  last_name: Julicher
- first_name: Marcos
  full_name: Gonzalez Gaitan, Marcos
  last_name: Gonzalez Gaitan
citation:
  ama: 'Kruse K, Pantazis P, Bollenbach MT, Julicher F, Gonzalez Gaitan M. Dpp gradient
    formation by dynamin-dependent endocytosis: receptor trafficking and the diffusion
    model. <i>Development</i>. 2004;131(19):4843-4856. doi:<a href="https://doi.org/10.1242/dev.01335">10.1242/dev.01335</a>'
  apa: 'Kruse, K., Pantazis, P., Bollenbach, M. T., Julicher, F., &#38; Gonzalez Gaitan,
    M. (2004). Dpp gradient formation by dynamin-dependent endocytosis: receptor trafficking
    and the diffusion model. <i>Development</i>. Company of Biologists. <a href="https://doi.org/10.1242/dev.01335">https://doi.org/10.1242/dev.01335</a>'
  chicago: 'Kruse, Karsten, Periklis Pantazis, Mark Tobias Bollenbach, Frank Julicher,
    and Marcos Gonzalez Gaitan. “Dpp Gradient Formation by Dynamin-Dependent Endocytosis:
    Receptor Trafficking and the Diffusion Model.” <i>Development</i>. Company of
    Biologists, 2004. <a href="https://doi.org/10.1242/dev.01335">https://doi.org/10.1242/dev.01335</a>.'
  ieee: 'K. Kruse, P. Pantazis, M. T. Bollenbach, F. Julicher, and M. Gonzalez Gaitan,
    “Dpp gradient formation by dynamin-dependent endocytosis: receptor trafficking
    and the diffusion model,” <i>Development</i>, vol. 131, no. 19. Company of Biologists,
    pp. 4843–4856, 2004.'
  ista: 'Kruse K, Pantazis P, Bollenbach MT, Julicher F, Gonzalez Gaitan M. 2004.
    Dpp gradient formation by dynamin-dependent endocytosis: receptor trafficking
    and the diffusion model. Development. 131(19), 4843–4856.'
  mla: 'Kruse, Karsten, et al. “Dpp Gradient Formation by Dynamin-Dependent Endocytosis:
    Receptor Trafficking and the Diffusion Model.” <i>Development</i>, vol. 131, no.
    19, Company of Biologists, 2004, pp. 4843–56, doi:<a href="https://doi.org/10.1242/dev.01335">10.1242/dev.01335</a>.'
  short: K. Kruse, P. Pantazis, M.T. Bollenbach, F. Julicher, M. Gonzalez Gaitan,
    Development 131 (2004) 4843–4856.
date_created: 2018-12-11T12:07:41Z
date_published: 2004-10-01T00:00:00Z
date_updated: 2026-05-29T11:09:03Z
day: '01'
doi: 10.1242/dev.01335
extern: '1'
external_id:
  pmid:
  - '15358671'
fulldoi: https://doi.org/10.1242/dev.01335
intvolume: '       131'
issue: '19'
keyword:
- Drosophila
- Morphogens
- TGFβ
language:
- iso: eng
month: '10'
oa_version: None
page: 4843 - 4856
pmid: 1
publication: Development
publication_status: published
publisher: Company of Biologists
publist_id: '1893'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Dpp gradient formation by dynamin-dependent endocytosis: receptor trafficking
  and the diffusion model'
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 131
year: '2004'
...
