---
_id: '3863'
abstract:
- lang: eng
  text: 'We consider two-player parity games with imperfect information in which strategies
    rely on observations that provide imperfect information about the history of a
    play. To solve such games, i.e., to determine the winning regions of players and
    corresponding winning strategies, one can use the subset construction to build
    an equivalent perfect-information game. Recently, an algorithm that avoids the
    inefficient subset construction has been proposed. The algorithm performs a fixed-point
    computation in a lattice of antichains, thus maintaining a succinct representation
    of state sets. However, this representation does not allow to recover winning
    strategies. In this paper, we build on the antichain approach to develop an algorithm
    for constructing the winning strategies in parity games of imperfect information.
    One major obstacle in adapting the classical procedure is that the complementation
    of attractor sets would break the invariant of downward-closedness on which the
    antichain representation relies. We overcome this difficulty by decomposing problem
    instances recursively into games with a combination of reachability, safety, and
    simpler parity conditions. We also report on an experimental implementation of
    our algorithm: to our knowledge, this is the first implementation of a procedure
    for solving imperfect-information parity games on graphs.'
author:
- first_name: Dietmar
  full_name: Berwanger, Dietmar
  last_name: Berwanger
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Martin
  full_name: De Wulf, Martin
  last_name: De Wulf
- first_name: Laurent
  full_name: Doyen, Laurent
  last_name: Doyen
- 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: Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. Strategy construction
    for parity games with imperfect information. <i>Information and Computation</i>.
    2010;208(10):1206-1220. doi:<a href="https://doi.org/10.1016/j.ic.2009.09.006">10.1016/j.ic.2009.09.006</a>
  apa: Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., &#38; Henzinger, T.
    A. (2010). Strategy construction for parity games with imperfect information.
    <i>Information and Computation</i>. Elsevier. <a href="https://doi.org/10.1016/j.ic.2009.09.006">https://doi.org/10.1016/j.ic.2009.09.006</a>
  chicago: Berwanger, Dietmar, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen,
    and Thomas A Henzinger. “Strategy Construction for Parity Games with Imperfect
    Information.” <i>Information and Computation</i>. Elsevier, 2010. <a href="https://doi.org/10.1016/j.ic.2009.09.006">https://doi.org/10.1016/j.ic.2009.09.006</a>.
  ieee: D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, and T. A. Henzinger, “Strategy
    construction for parity games with imperfect information,” <i>Information and
    Computation</i>, vol. 208, no. 10. Elsevier, pp. 1206–1220, 2010.
  ista: Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. 2010. Strategy
    construction for parity games with imperfect information. Information and Computation.
    208(10), 1206–1220.
  mla: Berwanger, Dietmar, et al. “Strategy Construction for Parity Games with Imperfect
    Information.” <i>Information and Computation</i>, vol. 208, no. 10, Elsevier,
    2010, pp. 1206–20, doi:<a href="https://doi.org/10.1016/j.ic.2009.09.006">10.1016/j.ic.2009.09.006</a>.
  short: D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, T.A. Henzinger, Information
    and Computation 208 (2010) 1206–1220.
date_created: 2018-12-11T12:05:35Z
date_published: 2010-10-01T00:00:00Z
date_updated: 2023-02-23T11:46:47Z
day: '01'
ddc:
- '005'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1016/j.ic.2009.09.006
ec_funded: 1
file:
- access_level: open_access
  checksum: 29d146e4f8049dbb7f80bbf7ea3700ed
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:17:44Z
  date_updated: 2020-07-14T12:46:18Z
  file_id: '5300'
  file_name: IST-2012-58-v1+1_Strategy_construction_for_parity_games_with_imperfect_information.pdf
  file_size: 287496
  relation: main_file
file_date_updated: 2020-07-14T12:46:18Z
has_accepted_license: '1'
intvolume: '       208'
issue: '10'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 1206 - 1220
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '215543'
  name: COMponent-Based Embedded Systems design Techniques
publication: Information and Computation
publication_status: published
publisher: Elsevier
publist_id: '2319'
pubrep_id: '58'
quality_controlled: '1'
related_material:
  record:
  - id: '3880'
    relation: earlier_version
    status: public
scopus_import: 1
status: public
title: Strategy construction for parity games with imperfect information
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 208
year: '2010'
...
---
_id: '3864'
abstract:
- lang: eng
  text: 'Often one has a preference order among the different systems that satisfy
    a given specification. Under a probabilistic assumption about the possible inputs,
    such a preference order is naturally expressed by a weighted automaton, which
    assigns to each word a value, such that a system is preferred if it generates
    a higher expected value. We solve the following optimal-synthesis problem: given
    an omega-regular specification, a Markov chain that describes the distribution
    of inputs, and a weighted automaton that measures how well a system satisfies
    the given specification tinder the given input assumption, synthesize a system
    that optimizes the measured value. For safety specifications and measures that
    are defined by mean-payoff automata, the optimal-synthesis problem amounts to
    finding a strategy in a Markov decision process (MDP) that is optimal for a long-run
    average reward objective, which can be done in polynomial time. For general omega-regular
    specifications, the solution rests on a new, polynomial-time algorithm for computing
    optimal strategies in MDPs with mean-payoff parity objectives. We present some
    experimental results showing optimal systems that were automatically generated
    in this way.'
acknowledgement: This research was supported by the European Union project COMBEST
  and the European Network of Excellence ArtistDesign.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
- first_name: Barbara
  full_name: Jobstmann, Barbara
  last_name: Jobstmann
- first_name: Rohit
  full_name: Singh, Rohit
  last_name: Singh
citation:
  ama: 'Chatterjee K, Henzinger TA, Jobstmann B, Singh R. Measuring and synthesizing
    systems in probabilistic environments. In: Vol 6174. Springer; 2010:380-395. doi:<a
    href="https://doi.org/10.1007/978-3-642-14295-6_34">10.1007/978-3-642-14295-6_34</a>'
  apa: 'Chatterjee, K., Henzinger, T. A., Jobstmann, B., &#38; Singh, R. (2010). Measuring
    and synthesizing systems in probabilistic environments (Vol. 6174, pp. 380–395).
    Presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom:
    Springer. <a href="https://doi.org/10.1007/978-3-642-14295-6_34">https://doi.org/10.1007/978-3-642-14295-6_34</a>'
  chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit
    Singh. “Measuring and Synthesizing Systems in Probabilistic Environments,” 6174:380–95.
    Springer, 2010. <a href="https://doi.org/10.1007/978-3-642-14295-6_34">https://doi.org/10.1007/978-3-642-14295-6_34</a>.
  ieee: 'K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and
    synthesizing systems in probabilistic environments,” presented at the CAV: Computer
    Aided Verification, Edinburgh, United Kingdom, 2010, vol. 6174, pp. 380–395.'
  ista: 'Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2010. Measuring and synthesizing
    systems in probabilistic environments. CAV: Computer Aided Verification, LNCS,
    vol. 6174, 380–395.'
  mla: Chatterjee, Krishnendu, et al. <i>Measuring and Synthesizing Systems in Probabilistic
    Environments</i>. Vol. 6174, Springer, 2010, pp. 380–95, doi:<a href="https://doi.org/10.1007/978-3-642-14295-6_34">10.1007/978-3-642-14295-6_34</a>.
  short: K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2010,
    pp. 380–395.
conference:
  end_date: 2010-07-19
  location: Edinburgh, United Kingdom
  name: 'CAV: Computer Aided Verification'
  start_date: 201-07-15
date_created: 2018-12-11T12:05:35Z
date_published: 2010-07-09T00:00:00Z
date_updated: 2023-02-23T10:17:28Z
day: '09'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-642-14295-6_34
intvolume: '      6174'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1004.0739
month: '07'
oa: 1
oa_version: Preprint
page: 380 - 395
publication_status: published
publisher: Springer
publist_id: '2313'
quality_controlled: '1'
related_material:
  record:
  - id: '1856'
    relation: later_version
    status: public
scopus_import: 1
status: public
title: Measuring and synthesizing systems in probabilistic environments
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6174
year: '2010'
...
---
_id: '3865'
abstract:
- lang: eng
  text: We introduce a technique for debugging multi-threaded C programs and analyzing
    the impact of source code changes, and its implementation in the prototype tool
    DIRECT. Our approach uses a combination of source code instrumentation and runtime
    management. The source code along with a test harness is instrumented to monitor
    Operating System (OS) and user defined function calls. DIRECT tracks all concurrency
    control primitives and, optionally, data from the program. DIRECT maintains an
    abstract global state that combines information from every thread, including the
    sequence of function calls and concurrency primitives executed. The runtime manager
    can insert delays, provoking thread inter-leavings that may exhibit bugs that
    are difficult to reach otherwise. The runtime manager collects an approximation
    of the reachable state space and uses this approximation to assess the impact
    of change in a new version of the program.
alternative_title:
- LNCS
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: Vishwanath
  full_name: Raman, Vishwanath
  last_name: Raman
- first_name: César
  full_name: Sánchez, César
  last_name: Sánchez
citation:
  ama: 'Chatterjee K, De Alfaro L, Raman V, Sánchez C. Analyzing the impact of change
    in multi-threaded programs. In: Rosenblum D, Taenzer G, eds. Vol 6013. Springer;
    2010:293-307. doi:<a href="https://doi.org/10.1007/978-3-642-12029-9_21">10.1007/978-3-642-12029-9_21</a>'
  apa: 'Chatterjee, K., De Alfaro, L., Raman, V., &#38; Sánchez, C. (2010). Analyzing
    the impact of change in multi-threaded programs. In D. Rosenblum &#38; G. Taenzer
    (Eds.) (Vol. 6013, pp. 293–307). Presented at the FASE: Fundamental Approaches
    To Software Engineering, Paphos, Cyprus: Springer. <a href="https://doi.org/10.1007/978-3-642-12029-9_21">https://doi.org/10.1007/978-3-642-12029-9_21</a>'
  chicago: Chatterjee, Krishnendu, Luca De Alfaro, Vishwanath Raman, and César Sánchez.
    “Analyzing the Impact of Change in Multi-Threaded Programs.” edited by David Rosenblum
    and Gabriele Taenzer, 6013:293–307. Springer, 2010. <a href="https://doi.org/10.1007/978-3-642-12029-9_21">https://doi.org/10.1007/978-3-642-12029-9_21</a>.
  ieee: 'K. Chatterjee, L. De Alfaro, V. Raman, and C. Sánchez, “Analyzing the impact
    of change in multi-threaded programs,” presented at the FASE: Fundamental Approaches
    To Software Engineering, Paphos, Cyprus, 2010, vol. 6013, pp. 293–307.'
  ista: 'Chatterjee K, De Alfaro L, Raman V, Sánchez C. 2010. Analyzing the impact
    of change in multi-threaded programs. FASE: Fundamental Approaches To Software
    Engineering, LNCS, vol. 6013, 293–307.'
  mla: Chatterjee, Krishnendu, et al. <i>Analyzing the Impact of Change in Multi-Threaded
    Programs</i>. Edited by David Rosenblum and Gabriele Taenzer, vol. 6013, Springer,
    2010, pp. 293–307, doi:<a href="https://doi.org/10.1007/978-3-642-12029-9_21">10.1007/978-3-642-12029-9_21</a>.
  short: K. Chatterjee, L. De Alfaro, V. Raman, C. Sánchez, in:, D. Rosenblum, G.
    Taenzer (Eds.), Springer, 2010, pp. 293–307.
conference:
  end_date: 2010-03-28
  location: Paphos, Cyprus
  name: 'FASE: Fundamental Approaches To Software Engineering'
  start_date: 2010-03-20
date_created: 2018-12-11T12:05:35Z
date_published: 2010-04-21T00:00:00Z
date_updated: 2021-01-12T07:52:47Z
day: '21'
department:
- _id: KrCh
doi: 10.1007/978-3-642-12029-9_21
editor:
- first_name: David
  full_name: Rosenblum, David
  last_name: Rosenblum
- first_name: Gabriele
  full_name: Taenzer, Gabriele
  last_name: Taenzer
intvolume: '      6013'
language:
- iso: eng
month: '04'
oa_version: None
page: 293 - 307
publication_status: published
publisher: Springer
publist_id: '2315'
quality_controlled: '1'
scopus_import: 1
status: public
title: Analyzing the impact of change in multi-threaded programs
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 6013
year: '2010'
...
---
_id: '3866'
abstract:
- lang: eng
  text: Systems ought to behave reasonably even in circumstances that are not anticipated
    in their specifications. We propose a definition of robustness for liveness specifications
    which prescribes, for any number of environment assumptions that are violated,
    a minimal number of system guarantees that must still be fulfilled. This notion
    of robustness can be formulated and realized using a Generalized Reactivity formula.
    We present an algorithm for synthesizing robust systems from such formulas. For
    the important special case of Generalized Reactivity formulas of rank 1, our algorithm
    improves the complexity of [PPS06] for large specifications with a small number
    of assumptions and guarantees.
alternative_title:
- LNCS
author:
- first_name: Roderick
  full_name: Bloem, Roderick
  last_name: Bloem
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Karin
  full_name: Greimel, Karin
  last_name: Greimel
- 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: Barbara
  full_name: Jobstmann, Barbara
  last_name: Jobstmann
citation:
  ama: 'Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. Robustness in
    the presence of liveness. In: Touili T, Cook B, Jackson P, eds. Vol 6174. Springer;
    2010:410-424. doi:<a href="https://doi.org/10.1007/978-3-642-14295-6_36">10.1007/978-3-642-14295-6_36</a>'
  apa: 'Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., &#38; Jobstmann,
    B. (2010). Robustness in the presence of liveness. In T. Touili, B. Cook, &#38;
    P. Jackson (Eds.) (Vol. 6174, pp. 410–424). Presented at the CAV: Computer Aided
    Verification, Edinburgh, UK: Springer. <a href="https://doi.org/10.1007/978-3-642-14295-6_36">https://doi.org/10.1007/978-3-642-14295-6_36</a>'
  chicago: Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger,
    and Barbara Jobstmann. “Robustness in the Presence of Liveness.” edited by Tayssir
    Touili, Byron Cook, and Paul Jackson, 6174:410–24. Springer, 2010. <a href="https://doi.org/10.1007/978-3-642-14295-6_36">https://doi.org/10.1007/978-3-642-14295-6_36</a>.
  ieee: 'R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Robustness
    in the presence of liveness,” presented at the CAV: Computer Aided Verification,
    Edinburgh, UK, 2010, vol. 6174, pp. 410–424.'
  ista: 'Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2010. Robustness
    in the presence of liveness. CAV: Computer Aided Verification, LNCS, vol. 6174,
    410–424.'
  mla: Bloem, Roderick, et al. <i>Robustness in the Presence of Liveness</i>. Edited
    by Tayssir Touili et al., vol. 6174, Springer, 2010, pp. 410–24, doi:<a href="https://doi.org/10.1007/978-3-642-14295-6_36">10.1007/978-3-642-14295-6_36</a>.
  short: R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, T.
    Touili, B. Cook, P. Jackson (Eds.), Springer, 2010, pp. 410–424.
conference:
  end_date: 2010-07-19
  location: Edinburgh, UK
  name: 'CAV: Computer Aided Verification'
  start_date: 2010-07-15
date_created: 2018-12-11T12:05:36Z
date_published: 2010-07-01T00:00:00Z
date_updated: 2021-01-12T07:52:47Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-642-14295-6_36
ec_funded: 1
editor:
- first_name: Tayssir
  full_name: Touili, Tayssir
  last_name: Touili
- first_name: Byron
  full_name: Cook, Byron
  last_name: Cook
- first_name: Paul
  full_name: Jackson, Paul
  last_name: Jackson
file:
- access_level: open_access
  checksum: 9d204611c8d7855bed8134f8708a0010
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:16:52Z
  date_updated: 2020-07-14T12:46:19Z
  file_id: '5243'
  file_name: IST-2012-54-v1+1_Robustness_in_the_presence_of_liveness.pdf
  file_size: 213083
  relation: main_file
file_date_updated: 2020-07-14T12:46:19Z
has_accepted_license: '1'
intvolume: '      6174'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 410 - 424
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '215543'
  name: COMponent-Based Embedded Systems design Techniques
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '214373'
  name: Design for Embedded Systems
publication_status: published
publisher: Springer
publist_id: '2310'
pubrep_id: '54'
quality_controlled: '1'
scopus_import: 1
status: public
title: Robustness in the presence of liveness
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 6174
year: '2010'
...
---
_id: '3867'
abstract:
- lang: eng
  text: Weighted automata are nondeterministic automata with numerical weights on
    transitions. They can define quantitative languages L that assign to each word
    w a real number L(w). In the case of infinite words, the value of a run is naturally
    computed as the maximum, limsup, liminf, limit-average, or discounted-sum of the
    transition weights. The value of a word w is the supremum of the values of the
    runs over w. We study expressiveness and closure questions about these quantitative
    languages. We first show that the set of words with value greater than a threshold
    can be omega-regular for deterministic limit-average and discounted-sum automata,
    while this set is always omega-regular when the threshold is isolated (i.e., some
    neighborhood around the threshold contains no word). In the latter case, we prove
    that the omega-regular language is robust against small perturbations of the transition
    weights. We next consider automata with transition weights 0 or 1 and show that
    they are as expressive as general weighted automata in the limit-average case,
    but not in the discounted-sum case. Third, for quantitative languages L-1 and
    L-2, we consider the operations max(L-1, L-2), min(L-1, L-2), and 1 - L-1, which
    generalize the boolean operations on languages, as well as the sum L-1 + L-2.
    We establish the closure properties of all classes of quantitative languages with
    respect to these four operations.
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
- 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, Doyen L, Henzinger TA. Expressiveness and closure properties
    for quantitative languages. <i>Logical Methods in Computer Science</i>. 2010;6(3):1-23.
    doi:<a href="https://doi.org/10.2168/LMCS-6(3:10)2010">10.2168/LMCS-6(3:10)2010</a>
  apa: Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2010). Expressiveness and
    closure properties for quantitative languages. <i>Logical Methods in Computer
    Science</i>. International Federation of Computational Logic. <a href="https://doi.org/10.2168/LMCS-6(3:10)2010">https://doi.org/10.2168/LMCS-6(3:10)2010</a>
  chicago: Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Expressiveness
    and Closure Properties for Quantitative Languages.” <i>Logical Methods in Computer
    Science</i>. International Federation of Computational Logic, 2010. <a href="https://doi.org/10.2168/LMCS-6(3:10)2010">https://doi.org/10.2168/LMCS-6(3:10)2010</a>.
  ieee: K. Chatterjee, L. Doyen, and T. A. Henzinger, “Expressiveness and closure
    properties for quantitative languages,” <i>Logical Methods in Computer Science</i>,
    vol. 6, no. 3. International Federation of Computational Logic, pp. 1–23, 2010.
  ista: Chatterjee K, Doyen L, Henzinger TA. 2010. Expressiveness and closure properties
    for quantitative languages. Logical Methods in Computer Science. 6(3), 1–23.
  mla: Chatterjee, Krishnendu, et al. “Expressiveness and Closure Properties for Quantitative
    Languages.” <i>Logical Methods in Computer Science</i>, vol. 6, no. 3, International
    Federation of Computational Logic, 2010, pp. 1–23, doi:<a href="https://doi.org/10.2168/LMCS-6(3:10)2010">10.2168/LMCS-6(3:10)2010</a>.
  short: K. Chatterjee, L. Doyen, T.A. Henzinger, Logical Methods in Computer Science
    6 (2010) 1–23.
date_created: 2018-12-11T12:05:36Z
date_published: 2010-08-30T00:00:00Z
date_updated: 2023-02-23T12:15:42Z
day: '30'
ddc:
- '000'
- '004'
department:
- _id: KrCh
- _id: ToHe
doi: 10.2168/LMCS-6(3:10)2010
ec_funded: 1
file:
- access_level: open_access
  checksum: 0243da726476817f2ea33b48b78be696
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:17:54Z
  date_updated: 2020-07-14T12:46:19Z
  file_id: '5312'
  file_name: IST-2012-55-v1+1_Expressiveness_Closure_Properties_Quantitative_Languages.pdf
  file_size: 216598
  relation: main_file
- access_level: open_access
  checksum: 5e512b8503a9cb263de26331c4ee9cf2
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:17:55Z
  date_updated: 2020-07-14T12:46:19Z
  file_id: '5313'
  file_name: IST-2016-55-v2+1_1007.4018.pdf
  file_size: 302416
  relation: main_file
file_date_updated: 2020-07-14T12:46:19Z
has_accepted_license: '1'
intvolume: '         6'
issue: '3'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nd/4.0/
month: '08'
oa: 1
oa_version: Published Version
page: 1 - 23
project:
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '214373'
  name: Design for Embedded Systems
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '215543'
  name: COMponent-Based Embedded Systems design Techniques
publication: Logical Methods in Computer Science
publication_status: published
publisher: International Federation of Computational Logic
publist_id: '2311'
pubrep_id: '504'
quality_controlled: '1'
related_material:
  record:
  - id: '4540'
    relation: earlier_version
    status: public
scopus_import: 1
status: public
title: Expressiveness and closure properties for quantitative languages
tmp:
  image: /image/cc_by_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
  name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
  short: CC BY-ND (4.0)
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2010'
...
---
_id: '3868'
abstract:
- lang: eng
  text: Simulation and bisimulation metrics for stochastic systems provide a quantitative
    generalization of the classical simulation and bisimulation relations. These metrics
    capture the similarity of states with respect to quantitative specifications written
    in the quantitative mu-calculus and related probabilistic logics. We first show
    that the metrics provide a bound for the difference in long-run average and discounted
    average behavior across states, indicating that the metrics can be used both in
    system verification, and in performance evaluation. For turn-based games and MDPs,
    we provide a polynomial-time algorithm for the computation of the one-step metric
    distance between states. The algorithm is based on linear programming; it improves
    on the previous known exponential-time algorithm based on a reduction to the theory
    of reals. We then present PSPACE algorithms for both the decision problem and
    the problem of approximating the metric distance between two states, matching
    the best known algorithms for Markov chains. For the bisimulation kernel of the
    metric our algorithm works in time O(n(4)) for both turn-based games and MDPs;
    improving the previously best known O(n(9).log(n)) time algorithm for MDPs. For
    a concurrent game G, we show that computing the exact distance be tween states
    is at least as hard as computing the value of concurrent reachability games and
    the square-root-sum problem in computational geometry. We show that checking whether
    the metric distance is bounded by a rational r, can be done via a reduction to
    the theory of real closed fields, involving a formula with three quantifier alternations,
    yielding O(vertical bar G vertical bar(O(vertical bar G vertical bar 5))) time
    complexity, improving the previously known reduction, which yielded O(vertical
    bar G vertical bar(O(vertical bar G vertical bar 7))) time complexity. These algorithms
    can be iterated to approximate the metrics using binary search
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: Ritankar
  full_name: Majumdar, Ritankar
  last_name: Majumdar
- first_name: Vishwanath
  full_name: Raman, Vishwanath
  last_name: Raman
citation:
  ama: Chatterjee K, De Alfaro L, Majumdar R, Raman V. Algorithms for game metrics.
    <i>Logical Methods in Computer Science</i>. 2010;6(3):1-27. doi:<a href="https://doi.org/10.2168/LMCS-6(3:13)2010">10.2168/LMCS-6(3:13)2010</a>
  apa: Chatterjee, K., De Alfaro, L., Majumdar, R., &#38; Raman, V. (2010). Algorithms
    for game metrics. <i>Logical Methods in Computer Science</i>. International Federation
    of Computational Logic. <a href="https://doi.org/10.2168/LMCS-6(3:13)2010">https://doi.org/10.2168/LMCS-6(3:13)2010</a>
  chicago: Chatterjee, Krishnendu, Luca De Alfaro, Ritankar Majumdar, and Vishwanath
    Raman. “Algorithms for Game Metrics.” <i>Logical Methods in Computer Science</i>.
    International Federation of Computational Logic, 2010. <a href="https://doi.org/10.2168/LMCS-6(3:13)2010">https://doi.org/10.2168/LMCS-6(3:13)2010</a>.
  ieee: K. Chatterjee, L. De Alfaro, R. Majumdar, and V. Raman, “Algorithms for game
    metrics,” <i>Logical Methods in Computer Science</i>, vol. 6, no. 3. International
    Federation of Computational Logic, pp. 1–27, 2010.
  ista: Chatterjee K, De Alfaro L, Majumdar R, Raman V. 2010. Algorithms for game
    metrics. Logical Methods in Computer Science. 6(3), 1–27.
  mla: Chatterjee, Krishnendu, et al. “Algorithms for Game Metrics.” <i>Logical Methods
    in Computer Science</i>, vol. 6, no. 3, International Federation of Computational
    Logic, 2010, pp. 1–27, doi:<a href="https://doi.org/10.2168/LMCS-6(3:13)2010">10.2168/LMCS-6(3:13)2010</a>.
  short: K. Chatterjee, L. De Alfaro, R. Majumdar, V. Raman, Logical Methods in Computer
    Science 6 (2010) 1–27.
date_created: 2018-12-11T12:05:36Z
date_published: 2010-09-01T00:00:00Z
date_updated: 2023-02-23T11:30:18Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.2168/LMCS-6(3:13)2010
file:
- access_level: open_access
  checksum: a18988135fef3016c93808ecb15b55f5
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:08:11Z
  date_updated: 2020-07-14T12:46:19Z
  file_id: '4671'
  file_name: IST-2015-370-v1+1_0809.4326.pdf
  file_size: 346527
  relation: main_file
file_date_updated: 2020-07-14T12:46:19Z
has_accepted_license: '1'
intvolume: '         6'
issue: '3'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 1 - 27
publication: Logical Methods in Computer Science
publication_status: published
publisher: International Federation of Computational Logic
publist_id: '2312'
pubrep_id: '370'
quality_controlled: '1'
related_material:
  record:
  - id: '3504'
    relation: earlier_version
    status: public
scopus_import: 1
status: public
title: Algorithms for game metrics
tmp:
  image: /image/cc_by_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
  name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
  short: CC BY-ND (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2010'
...
---
_id: '3899'
abstract:
- lang: eng
  text: 'Combining concepts from topology and algorithms, this book delivers what
    its title promises: an introduction to the field of computational topology. Starting
    with motivating problems in both mathematics and computer science and building
    up from classic topics in geometric and algebraic topology, the third part of
    the text advances to persistent homology. This point of view is critically important
    in turning a mostly theoretical field of mathematics into one that is relevant
    to a multitude of disciplines in the sciences and engineering. The main approach
    is the discovery of topology through algorithms. The book is ideal for teaching
    a graduate or advanced undergraduate course in computational topology, as it develops
    all the background of both the mathematical and algorithmic aspects of the subject
    from first principles. Thus the text could serve equally well in a course taught
    in a mathematics department or computer science department.'
article_processing_charge: No
author:
- first_name: Herbert
  full_name: Edelsbrunner, Herbert
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
- first_name: John
  full_name: Harer, John
  last_name: Harer
citation:
  ama: 'Edelsbrunner H, Harer J. <i>Computational Topology: An Introduction</i>. Vol
    69. American Mathematical Society; 2010. doi:<a href="https://doi.org/10.1090/mbk/069">10.1090/mbk/069</a>'
  apa: 'Edelsbrunner, H., &#38; Harer, J. (2010). <i>Computational Topology: An Introduction</i>
    (Vol. 69). American Mathematical Society. <a href="https://doi.org/10.1090/mbk/069">https://doi.org/10.1090/mbk/069</a>'
  chicago: 'Edelsbrunner, Herbert, and John Harer. <i>Computational Topology: An Introduction</i>.
    Vol. 69. American Mathematical Society, 2010. <a href="https://doi.org/10.1090/mbk/069">https://doi.org/10.1090/mbk/069</a>.'
  ieee: 'H. Edelsbrunner and J. Harer, <i>Computational Topology: An Introduction</i>,
    vol. 69. American Mathematical Society, 2010.'
  ista: 'Edelsbrunner H, Harer J. 2010. Computational Topology: An Introduction, American
    Mathematical Society, XII, 241p.'
  mla: 'Edelsbrunner, Herbert, and John Harer. <i>Computational Topology: An Introduction</i>.
    Vol. 69, American Mathematical Society, 2010, doi:<a href="https://doi.org/10.1090/mbk/069">10.1090/mbk/069</a>.'
  short: 'H. Edelsbrunner, J. Harer, Computational Topology: An Introduction, American
    Mathematical Society, 2010.'
date_created: 2018-12-11T12:05:46Z
date_published: 2010-01-15T00:00:00Z
date_updated: 2021-12-21T12:26:50Z
day: '15'
doi: 10.1090/mbk/069
extern: '1'
intvolume: '        69'
language:
- iso: eng
main_file_link:
- url: https://www.ams.org/books/mbk/069/
month: '01'
oa_version: None
page: XII, 241
publication_identifier:
  eisbn:
  - 978-1-4704-1208-1
  isbn:
  - 978-0-8218-4925-5
publication_status: published
publisher: American Mathematical Society
publist_id: '2258'
quality_controlled: '1'
related_material:
  link:
  - description: available via catalog IST BookList
    relation: other
    url: https://koha.app.ist.ac.at/cgi-bin/koha/opac-detail.pl?biblionumber=3289
status: public
title: 'Computational Topology: An Introduction'
type: book
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 69
year: '2010'
...
---
_id: '3901'
abstract:
- lang: eng
  text: We are interested in 3-dimensional images given as arrays of voxels with intensity
    values. Extending these values to acontinuous function, we study the robustness
    of homology classes in its level and interlevel sets, that is, the amount of perturbationneeded
    to destroy these classes. The structure of the homology classes and their robustness,
    over all level and interlevel sets, can bevisualized by a triangular diagram of
    dots obtained by computing the extended persistence of the function. We give a
    fast hierarchicalalgorithm using the dual complexes of oct-tree approximations
    of the function. In addition, we show that for balanced oct-trees, thedual complexes
    are geometrically realized in $R^3$ and can thus be used to construct level and
    interlevel sets. We apply these tools tostudy 3-dimensional images of plant root
    systems.
author:
- first_name: Paul
  full_name: Bendich, Paul
  id: 43F6EC54-F248-11E8-B48F-1D18A9856A87
  last_name: Bendich
- first_name: Herbert
  full_name: Edelsbrunner, Herbert
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
- first_name: Michael
  full_name: Kerber, Michael
  id: 36E4574A-F248-11E8-B48F-1D18A9856A87
  last_name: Kerber
  orcid: 0000-0002-8030-9299
citation:
  ama: Bendich P, Edelsbrunner H, Kerber M. Computing robustness and persistence for
    images. <i>IEEE Transactions of Visualization and Computer Graphics</i>. 2010;16(6):1251-1260.
    doi:<a href="https://doi.org/10.1109/TVCG.2010.139">10.1109/TVCG.2010.139</a>
  apa: Bendich, P., Edelsbrunner, H., &#38; Kerber, M. (2010). Computing robustness
    and persistence for images. <i>IEEE Transactions of Visualization and Computer
    Graphics</i>. IEEE. <a href="https://doi.org/10.1109/TVCG.2010.139">https://doi.org/10.1109/TVCG.2010.139</a>
  chicago: Bendich, Paul, Herbert Edelsbrunner, and Michael Kerber. “Computing Robustness
    and Persistence for Images.” <i>IEEE Transactions of Visualization and Computer
    Graphics</i>. IEEE, 2010. <a href="https://doi.org/10.1109/TVCG.2010.139">https://doi.org/10.1109/TVCG.2010.139</a>.
  ieee: P. Bendich, H. Edelsbrunner, and M. Kerber, “Computing robustness and persistence
    for images,” <i>IEEE Transactions of Visualization and Computer Graphics</i>,
    vol. 16, no. 6. IEEE, pp. 1251–1260, 2010.
  ista: Bendich P, Edelsbrunner H, Kerber M. 2010. Computing robustness and persistence
    for images. IEEE Transactions of Visualization and Computer Graphics. 16(6), 1251–1260.
  mla: Bendich, Paul, et al. “Computing Robustness and Persistence for Images.” <i>IEEE
    Transactions of Visualization and Computer Graphics</i>, vol. 16, no. 6, IEEE,
    2010, pp. 1251–60, doi:<a href="https://doi.org/10.1109/TVCG.2010.139">10.1109/TVCG.2010.139</a>.
  short: P. Bendich, H. Edelsbrunner, M. Kerber, IEEE Transactions of Visualization
    and Computer Graphics 16 (2010) 1251–1260.
date_created: 2018-12-11T12:05:47Z
date_published: 2010-10-28T00:00:00Z
date_updated: 2021-01-12T07:53:04Z
day: '28'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1109/TVCG.2010.139
file:
- access_level: open_access
  checksum: f6d813c04f4b46023cec6b9a17f15472
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:17:10Z
  date_updated: 2020-07-14T12:46:21Z
  file_id: '5262'
  file_name: IST-2016-536-v1+1_2010-J-02-PersistenceforImages.pdf
  file_size: 721994
  relation: main_file
file_date_updated: 2020-07-14T12:46:21Z
has_accepted_license: '1'
intvolume: '        16'
issue: '6'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 1251 - 1260
publication: IEEE Transactions of Visualization and Computer Graphics
publication_status: published
publisher: IEEE
publist_id: '2253'
pubrep_id: '536'
quality_controlled: '1'
scopus_import: 1
status: public
title: Computing robustness and persistence for images
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 16
year: '2010'
...
---
_id: '3904'
abstract:
- lang: eng
  text: Social organisms are constantly exposed to infectious agents via physical
    contact with conspecifics. While previous work has shown that disease susceptibility
    at the individual and group level is influenced by gen- etic diversity within
    and between group members, it remains poorly understood how group-level resistance
    to pathogens relates directly to individual physiology, defence behaviour and
    social interactions. We investigated the effects of high versus low genetic diversity
    on both the individual and collective disease defences in the ant Cardiocondyla
    obscurior. We compared the antiseptic behaviours (grooming and hygienic behaviour)
    of workers from genetically homogeneous and diverse colonies after exposure of
    their brood to the entomopathogenic fungus Metarhizium anisopliae. While workers
    from diverse colonies performed intensive allogrooming and quickly removed larvae
    covered with live fungal spores from the nest, workers from homogeneous colonies
    only removed sick larvae late after infection. This difference was not caused
    by a reduced repertoire of antiseptic behaviours or a generally decreased brood
    care activity in ants from homogeneous colonies. Our data instead suggest that
    reduced genetic diversity compromises the ability of Cardiocondyla colonies to
    quickly detect or react to the presence of pathogenic fungal spores before an
    infection is established, thereby affecting the dynamics of social immunity in
    the colony.
author:
- first_name: Line V
  full_name: Ugelvig, Line V
  id: 3DC97C8E-F248-11E8-B48F-1D18A9856A87
  last_name: Ugelvig
  orcid: 0000-0003-1832-8883
- first_name: Daniel
  full_name: Kronauer, Daniel
  last_name: Kronauer
- first_name: Alexandra
  full_name: Schrempf, Alexandra
  last_name: Schrempf
- first_name: Jürgen
  full_name: Heinze, Jürgen
  last_name: Heinze
- first_name: Sylvia
  full_name: Cremer, Sylvia
  id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
  last_name: Cremer
  orcid: 0000-0002-2193-3868
citation:
  ama: Ugelvig LV, Kronauer D, Schrempf A, Heinze J, Cremer S. Rapid anti-pathogen
    response in ant societies relies on high genetic diversity. <i>Proceedings of
    the Royal Society of London Series B Biological Sciences</i>. 2010;277(1695):2821-2828.
    doi:<a href="https://doi.org/10.1098/rspb.2010.0644">10.1098/rspb.2010.0644</a>
  apa: Ugelvig, L. V., Kronauer, D., Schrempf, A., Heinze, J., &#38; Cremer, S. (2010).
    Rapid anti-pathogen response in ant societies relies on high genetic diversity.
    <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>.
    Royal Society, The. <a href="https://doi.org/10.1098/rspb.2010.0644">https://doi.org/10.1098/rspb.2010.0644</a>
  chicago: Ugelvig, Line V, Daniel Kronauer, Alexandra Schrempf, Jürgen Heinze, and
    Sylvia Cremer. “Rapid Anti-Pathogen Response in Ant Societies Relies on High Genetic
    Diversity.” <i>Proceedings of the Royal Society of London Series B Biological
    Sciences</i>. Royal Society, The, 2010. <a href="https://doi.org/10.1098/rspb.2010.0644">https://doi.org/10.1098/rspb.2010.0644</a>.
  ieee: L. V. Ugelvig, D. Kronauer, A. Schrempf, J. Heinze, and S. Cremer, “Rapid
    anti-pathogen response in ant societies relies on high genetic diversity,” <i>Proceedings
    of the Royal Society of London Series B Biological Sciences</i>, vol. 277, no.
    1695. Royal Society, The, pp. 2821–2828, 2010.
  ista: Ugelvig LV, Kronauer D, Schrempf A, Heinze J, Cremer S. 2010. Rapid anti-pathogen
    response in ant societies relies on high genetic diversity. Proceedings of the
    Royal Society of London Series B Biological Sciences. 277(1695), 2821–2828.
  mla: Ugelvig, Line V., et al. “Rapid Anti-Pathogen Response in Ant Societies Relies
    on High Genetic Diversity.” <i>Proceedings of the Royal Society of London Series
    B Biological Sciences</i>, vol. 277, no. 1695, Royal Society, The, 2010, pp. 2821–28,
    doi:<a href="https://doi.org/10.1098/rspb.2010.0644">10.1098/rspb.2010.0644</a>.
  short: L.V. Ugelvig, D. Kronauer, A. Schrempf, J. Heinze, S. Cremer, Proceedings
    of the Royal Society of London Series B Biological Sciences 277 (2010) 2821–2828.
date_created: 2018-12-11T12:05:48Z
date_published: 2010-05-05T00:00:00Z
date_updated: 2021-01-12T07:53:05Z
day: '05'
doi: 10.1098/rspb.2010.0644
extern: '1'
intvolume: '       277'
issue: '1695'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2981995/
month: '05'
oa: 1
oa_version: None
page: 2821 - 2828
publication: Proceedings of the Royal Society of London Series B Biological Sciences
publication_status: published
publisher: Royal Society, The
publist_id: '2251'
status: public
title: Rapid anti-pathogen response in ant societies relies on high genetic diversity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 277
year: '2010'
...
---
_id: '3956'
abstract:
- lang: eng
  text: The shuttling of leukocytes between the bloodstream and interstitial tissues
    involves different locomotion strategies that are governed by locally presented
    soluble and cell-bound signals. Recent studies have furthered our understanding
    of the rapidly advancing field of leukocyte migration, particularly regarding
    cellular and subcellular events at the level of the venular wall. Furthermore,
    emerging cellular models are now addressing the transition from an adherent mode
    to a non-adherent state, incorporating mechanisms that support an efficient migratory
    profile of leukocytes in the interstitial tissue beyond the venular wall.
author:
- first_name: Sussan
  full_name: Nourshargh, Sussan
  last_name: Nourshargh
- first_name: Peter
  full_name: Hordijk, Peter L
  last_name: Hordijk
- first_name: Michael K
  full_name: Michael Sixt
  id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
  last_name: Sixt
  orcid: 0000-0002-6620-9179
citation:
  ama: 'Nourshargh S, Hordijk P, Sixt MK. Breaching multiple barriers: leukocyte motility
    through venular walls and the interstitium. <i>Nature Reviews Molecular Cell Biology</i>.
    2010;11(5):366-378. doi:<a href="https://doi.org/10.1038/nrm2889">10.1038/nrm2889</a>'
  apa: 'Nourshargh, S., Hordijk, P., &#38; Sixt, M. K. (2010). Breaching multiple
    barriers: leukocyte motility through venular walls and the interstitium. <i>Nature
    Reviews Molecular Cell Biology</i>. Nature Publishing Group. <a href="https://doi.org/10.1038/nrm2889">https://doi.org/10.1038/nrm2889</a>'
  chicago: 'Nourshargh, Sussan, Peter Hordijk, and Michael K Sixt. “Breaching Multiple
    Barriers: Leukocyte Motility through Venular Walls and the Interstitium.” <i>Nature
    Reviews Molecular Cell Biology</i>. Nature Publishing Group, 2010. <a href="https://doi.org/10.1038/nrm2889">https://doi.org/10.1038/nrm2889</a>.'
  ieee: 'S. Nourshargh, P. Hordijk, and M. K. Sixt, “Breaching multiple barriers:
    leukocyte motility through venular walls and the interstitium,” <i>Nature Reviews
    Molecular Cell Biology</i>, vol. 11, no. 5. Nature Publishing Group, pp. 366–378,
    2010.'
  ista: 'Nourshargh S, Hordijk P, Sixt MK. 2010. Breaching multiple barriers: leukocyte
    motility through venular walls and the interstitium. Nature Reviews Molecular
    Cell Biology. 11(5), 366–378.'
  mla: 'Nourshargh, Sussan, et al. “Breaching Multiple Barriers: Leukocyte Motility
    through Venular Walls and the Interstitium.” <i>Nature Reviews Molecular Cell
    Biology</i>, vol. 11, no. 5, Nature Publishing Group, 2010, pp. 366–78, doi:<a
    href="https://doi.org/10.1038/nrm2889">10.1038/nrm2889</a>.'
  short: S. Nourshargh, P. Hordijk, M.K. Sixt, Nature Reviews Molecular Cell Biology
    11 (2010) 366–378.
date_created: 2018-12-11T12:06:06Z
date_published: 2010-05-01T00:00:00Z
date_updated: 2021-01-12T07:53:27Z
day: '01'
doi: 10.1038/nrm2889
extern: 1
intvolume: '        11'
issue: '5'
month: '05'
page: 366 - 378
publication: Nature Reviews Molecular Cell Biology
publication_status: published
publisher: Nature Publishing Group
publist_id: '2170'
quality_controlled: 0
status: public
title: 'Breaching multiple barriers: leukocyte motility through venular walls and
  the interstitium'
type: journal_article
volume: 11
year: '2010'
...
---
_id: '3957'
author:
- first_name: Julia
  full_name: Riedl, Julia
  last_name: Riedl
- first_name: Kevin
  full_name: Flynn, Kevin C
  last_name: Flynn
- first_name: Aurelia
  full_name: Raducanu, Aurelia
  last_name: Raducanu
- first_name: Florian R
  full_name: Florian Gärtner
  id: 397A88EE-F248-11E8-B48F-1D18A9856A87
  last_name: Gärtner
  orcid: 0000-0001-6120-3723
- first_name: Gisela
  full_name: Beck, Gisela
  last_name: Beck
- first_name: Michael
  full_name: Bosl, Michael
  last_name: Bosl
- first_name: Frank
  full_name: Bradke, Frank
  last_name: Bradke
- first_name: Steffen
  full_name: Massberg, Steffen
  last_name: Massberg
- first_name: Attila
  full_name: Aszodi, Attila
  last_name: Aszodi
- first_name: Michael K
  full_name: Michael Sixt
  id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
  last_name: Sixt
  orcid: 0000-0002-6620-9179
- first_name: Roland
  full_name: Wedlich-Söldner, Roland
  last_name: Wedlich Söldner
citation:
  ama: Riedl J, Flynn K, Raducanu A, et al. Lifeact mice for studying F-actin dynamics.
    <i>Nature Methods</i>. 2010;7(3):168-169. doi:<a href="https://doi.org/10.1038/nmeth0310-168">10.1038/nmeth0310-168</a>
  apa: Riedl, J., Flynn, K., Raducanu, A., Gärtner, F. R., Beck, G., Bosl, M., … Wedlich
    Söldner, R. (2010). Lifeact mice for studying F-actin dynamics. <i>Nature Methods</i>.
    Nature Publishing Group. <a href="https://doi.org/10.1038/nmeth0310-168">https://doi.org/10.1038/nmeth0310-168</a>
  chicago: Riedl, Julia, Kevin Flynn, Aurelia Raducanu, Florian R Gärtner, Gisela
    Beck, Michael Bosl, Frank Bradke, et al. “Lifeact Mice for Studying F-Actin Dynamics.”
    <i>Nature Methods</i>. Nature Publishing Group, 2010. <a href="https://doi.org/10.1038/nmeth0310-168">https://doi.org/10.1038/nmeth0310-168</a>.
  ieee: J. Riedl <i>et al.</i>, “Lifeact mice for studying F-actin dynamics,” <i>Nature
    Methods</i>, vol. 7, no. 3. Nature Publishing Group, pp. 168–169, 2010.
  ista: Riedl J, Flynn K, Raducanu A, Gärtner FR, Beck G, Bosl M, Bradke F, Massberg
    S, Aszodi A, Sixt MK, Wedlich Söldner R. 2010. Lifeact mice for studying F-actin
    dynamics. Nature Methods. 7(3), 168–169.
  mla: Riedl, Julia, et al. “Lifeact Mice for Studying F-Actin Dynamics.” <i>Nature
    Methods</i>, vol. 7, no. 3, Nature Publishing Group, 2010, pp. 168–69, doi:<a
    href="https://doi.org/10.1038/nmeth0310-168">10.1038/nmeth0310-168</a>.
  short: J. Riedl, K. Flynn, A. Raducanu, F.R. Gärtner, G. Beck, M. Bosl, F. Bradke,
    S. Massberg, A. Aszodi, M.K. Sixt, R. Wedlich Söldner, Nature Methods 7 (2010)
    168–169.
date_created: 2018-12-11T12:06:06Z
date_published: 2010-03-01T00:00:00Z
date_updated: 2021-01-12T07:53:28Z
day: '01'
doi: 10.1038/nmeth0310-168
extern: 1
intvolume: '         7'
issue: '3'
month: '03'
page: 168 - 169
publication: Nature Methods
publication_status: published
publisher: Nature Publishing Group
publist_id: '2171'
quality_controlled: 0
status: public
title: Lifeact mice for studying F-actin dynamics
type: journal_article
volume: 7
year: '2010'
...
---
_id: '3958'
abstract:
- lang: eng
  text: Extracellular matrix (ECM) proteins can modify immune reactions, e.g. by sequestering
    or displaying growth factors and by interacting with immune and glial cells. Here
    we quantified by quantitative polymerase chain reaction (qPCR) expression of 50
    ECM components and 34 ECM degrading enzymes in multiple sclerosis (MS) active
    and inactive white matter lesions. COL1A1, COL3A1, COL5A1 and COL5A2 chains were
    induced strongly in active lesions and even more in inactive lesions. These chains
    interact to form collagen types I, III and V, which are fibrillar collagens. Biglycan
    and decorin, which can decorate fibrillar collagens, were also induced strongly.
    The fibrillar collagens, biglycan and decorin were largely found between the endothelium
    and astrocytic glia limitans in the perivascular space where they formed a meshwork
    which was closely associated with infiltrating immune cells. In active lesions
    collagen V was also seen in the heavily infiltrated parenchyma. Fibrillar collagens
    I and III inhibited in vitro human monocyte production of CCL2 (MCP-1), an inflammatory
    chemokine involved in recruitment of immune cells. Together, ECM changes in lesions
    with different activities were quantified and proteins forming a perivascular
    fibrosis were identified. Induced fibrillar collagens may contribute to limiting
    enlargement of MS lesions by inhibiting the production of CCL2 by monocytes.
author:
- first_name: Hema
  full_name: Mohan, Hema
  last_name: Mohan
- first_name: Markus
  full_name: Krumbholz, Markus
  last_name: Krumbholz
- first_name: Rakhi
  full_name: Sharma, Rakhi
  last_name: Sharma
- first_name: Sylvia
  full_name: Eisele, Sylvia
  last_name: Eisele
- first_name: Andreas
  full_name: Junker, Andreas
  last_name: Junker
- first_name: Michael K
  full_name: Michael Sixt
  id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
  last_name: Sixt
  orcid: 0000-0002-6620-9179
- first_name: Jia
  full_name: Newcombe, Jia
  last_name: Newcombe
- first_name: Hartmut
  full_name: Wekerle, Hartmut
  last_name: Wekerle
- first_name: Reinhard
  full_name: Hohlfeld, Reinhard
  last_name: Hohlfeld
- first_name: Hans
  full_name: Lassmann, Hans
  last_name: Lassmann
- first_name: Edgar
  full_name: Meinl, Edgar
  last_name: Meinl
citation:
  ama: 'Mohan H, Krumbholz M, Sharma R, et al. Extracellular matrix in multiple sclerosis
    lesions: fibrillar collagens, biglycan and decorin are upregulated and associated
    with infiltrating immune cells. <i>Brain Pathology</i>. 2010;20(5):966-975. doi:<a
    href="https://doi.org/10.1111/j.1750-3639.2010.00399.x">10.1111/j.1750-3639.2010.00399.x</a>'
  apa: 'Mohan, H., Krumbholz, M., Sharma, R., Eisele, S., Junker, A., Sixt, M. K.,
    … Meinl, E. (2010). Extracellular matrix in multiple sclerosis lesions: fibrillar
    collagens, biglycan and decorin are upregulated and associated with infiltrating
    immune cells. <i>Brain Pathology</i>. Wiley-Blackwell. <a href="https://doi.org/10.1111/j.1750-3639.2010.00399.x">https://doi.org/10.1111/j.1750-3639.2010.00399.x</a>'
  chicago: 'Mohan, Hema, Markus Krumbholz, Rakhi Sharma, Sylvia Eisele, Andreas Junker,
    Michael K Sixt, Jia Newcombe, et al. “Extracellular Matrix in Multiple Sclerosis
    Lesions: Fibrillar Collagens, Biglycan and Decorin Are Upregulated and Associated
    with Infiltrating Immune Cells.” <i>Brain Pathology</i>. Wiley-Blackwell, 2010.
    <a href="https://doi.org/10.1111/j.1750-3639.2010.00399.x">https://doi.org/10.1111/j.1750-3639.2010.00399.x</a>.'
  ieee: 'H. Mohan <i>et al.</i>, “Extracellular matrix in multiple sclerosis lesions:
    fibrillar collagens, biglycan and decorin are upregulated and associated with
    infiltrating immune cells,” <i>Brain Pathology</i>, vol. 20, no. 5. Wiley-Blackwell,
    pp. 966–975, 2010.'
  ista: 'Mohan H, Krumbholz M, Sharma R, Eisele S, Junker A, Sixt MK, Newcombe J,
    Wekerle H, Hohlfeld R, Lassmann H, Meinl E. 2010. Extracellular matrix in multiple
    sclerosis lesions: fibrillar collagens, biglycan and decorin are upregulated and
    associated with infiltrating immune cells. Brain Pathology. 20(5), 966–975.'
  mla: 'Mohan, Hema, et al. “Extracellular Matrix in Multiple Sclerosis Lesions: Fibrillar
    Collagens, Biglycan and Decorin Are Upregulated and Associated with Infiltrating
    Immune Cells.” <i>Brain Pathology</i>, vol. 20, no. 5, Wiley-Blackwell, 2010,
    pp. 966–75, doi:<a href="https://doi.org/10.1111/j.1750-3639.2010.00399.x">10.1111/j.1750-3639.2010.00399.x</a>.'
  short: H. Mohan, M. Krumbholz, R. Sharma, S. Eisele, A. Junker, M.K. Sixt, J. Newcombe,
    H. Wekerle, R. Hohlfeld, H. Lassmann, E. Meinl, Brain Pathology 20 (2010) 966–975.
date_created: 2018-12-11T12:06:07Z
date_published: 2010-09-01T00:00:00Z
date_updated: 2021-01-12T07:53:28Z
day: '01'
doi: 10.1111/j.1750-3639.2010.00399.x
extern: 1
intvolume: '        20'
issue: '5'
month: '09'
page: 966 - 975
publication: Brain Pathology
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2169'
quality_controlled: 0
status: public
title: 'Extracellular matrix in multiple sclerosis lesions: fibrillar collagens, biglycan
  and decorin are upregulated and associated with infiltrating immune cells'
type: journal_article
volume: 20
year: '2010'
...
---
_id: '3959'
abstract:
- lang: eng
  text: Chemokines orchestrate immune cell trafficking by eliciting either directed
    or random migration and by activating integrins in order to induce cell adhesion.
    Analyzing dendritic cell (DC) migration, we showed that these distinct cellular
    responses depended on the mode of chemokine presentation within tissues. The surface-immobilized
    form of the chemokine CCL21, the heparan sulfate-anchoring ligand of the CC-chemokine
    receptor 7 (CCR7), caused random movement of DCs that was confined to the chemokine-presenting
    surface because it triggered integrin-mediated adhesion. Upon direct contact with
    CCL21, DCs truncated the anchoring residues of CCL21, thereby releasing it from
    the solid phase. Soluble CCL21 functionally resembles the second CCR7 ligand,
    CCL19, which lacks anchoring residues and forms soluble gradients. Both soluble
    CCR7 ligands triggered chemotactic movement, but not surface adhesion. Adhesive
    random migration and directional steering cooperate to produce dynamic but spatially
    restricted locomotion patterns closely resembling the cellular dynamics observed
    in secondary lymphoid organs.
author:
- first_name: Kathrin
  full_name: Schumann, Kathrin
  id: F44D762E-4F9D-11E9-B64C-9EB26CEFFB5F
  last_name: Schumann
- first_name: Tim
  full_name: Lämmermann, Tim
  last_name: Lämmermann
- first_name: Markus
  full_name: Bruckner, Markus
  last_name: Bruckner
- first_name: Daniel
  full_name: Legler, Daniel
  last_name: Legler
- first_name: Julien
  full_name: Polleux, Julien
  last_name: Polleux
- first_name: Joachim
  full_name: Spatz, Joachim
  last_name: Spatz
- first_name: Gerold
  full_name: Schuler, Gerold
  last_name: Schuler
- first_name: Reinhold
  full_name: Förster, Reinhold
  last_name: Förster
- first_name: Manfred
  full_name: Lutz, Manfred
  last_name: Lutz
- first_name: Lydia
  full_name: Sorokin, Lydia
  last_name: Sorokin
- 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: Schumann K, Lämmermann T, Bruckner M, et al. Immobilized chemokine fields and
    soluble chemokine gradients cooperatively shape migration patterns of dendritic
    cells. <i>Immunity</i>. 2010;32(5):703-713. doi:<a href="https://doi.org/10.1016/j.immuni.2010.04.017">10.1016/j.immuni.2010.04.017</a>
  apa: Schumann, K., Lämmermann, T., Bruckner, M., Legler, D., Polleux, J., Spatz,
    J., … Sixt, M. K. (2010). Immobilized chemokine fields and soluble chemokine gradients
    cooperatively shape migration patterns of dendritic cells. <i>Immunity</i>. Cell
    Press. <a href="https://doi.org/10.1016/j.immuni.2010.04.017">https://doi.org/10.1016/j.immuni.2010.04.017</a>
  chicago: Schumann, Kathrin, Tim Lämmermann, Markus Bruckner, Daniel Legler, Julien
    Polleux, Joachim Spatz, Gerold Schuler, et al. “Immobilized Chemokine Fields and
    Soluble Chemokine Gradients Cooperatively Shape Migration Patterns of Dendritic
    Cells.” <i>Immunity</i>. Cell Press, 2010. <a href="https://doi.org/10.1016/j.immuni.2010.04.017">https://doi.org/10.1016/j.immuni.2010.04.017</a>.
  ieee: K. Schumann <i>et al.</i>, “Immobilized chemokine fields and soluble chemokine
    gradients cooperatively shape migration patterns of dendritic cells,” <i>Immunity</i>,
    vol. 32, no. 5. Cell Press, pp. 703–713, 2010.
  ista: Schumann K, Lämmermann T, Bruckner M, Legler D, Polleux J, Spatz J, Schuler
    G, Förster R, Lutz M, Sorokin L, Sixt MK. 2010. Immobilized chemokine fields and
    soluble chemokine gradients cooperatively shape migration patterns of dendritic
    cells. Immunity. 32(5), 703–713.
  mla: Schumann, Kathrin, et al. “Immobilized Chemokine Fields and Soluble Chemokine
    Gradients Cooperatively Shape Migration Patterns of Dendritic Cells.” <i>Immunity</i>,
    vol. 32, no. 5, Cell Press, 2010, pp. 703–13, doi:<a href="https://doi.org/10.1016/j.immuni.2010.04.017">10.1016/j.immuni.2010.04.017</a>.
  short: K. Schumann, T. Lämmermann, M. Bruckner, D. Legler, J. Polleux, J. Spatz,
    G. Schuler, R. Förster, M. Lutz, L. Sorokin, M.K. Sixt, Immunity 32 (2010) 703–713.
date_created: 2018-12-11T12:06:07Z
date_published: 2010-05-28T00:00:00Z
date_updated: 2021-01-12T07:53:29Z
day: '28'
doi: 10.1016/j.immuni.2010.04.017
extern: '1'
intvolume: '        32'
issue: '5'
language:
- iso: eng
month: '05'
oa_version: None
page: 703 - 713
publication: Immunity
publication_status: published
publisher: Cell Press
publist_id: '2168'
status: public
title: Immobilized chemokine fields and soluble chemokine gradients cooperatively
  shape migration patterns of dendritic cells
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2010'
...
---
_id: '3960'
abstract:
- lang: eng
  text: When lymphocytes follow chemotactic cues, they can adopt different migratory
    modes depending on the geometry and molecular composition of their extracellular
    environment. In this issue of The EMBO Journal, Klemke et al (2010) describe a
    novel Ras-dependent chemokine receptor signalling pathway that leads to activation
    of cofilin, which in turn amplifies actin turnover. This signalling module is
    exclusively required for lymphocyte migration in three-dimensional (3D) environments,
    but not for locomotion on two-dimensional (2D) surfaces.
author:
- first_name: Michele
  full_name: Michele Weber
  id: 3A3FC708-F248-11E8-B48F-1D18A9856A87
  last_name: Weber
- first_name: Michael K
  full_name: Michael Sixt
  id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
  last_name: Sixt
  orcid: 0000-0002-6620-9179
citation:
  ama: Weber M, Sixt MK. MEK signalling tunes actin treadmilling for interstitial
    lymphocyte migration. <i>EMBO Journal</i>. 2010;29(17):2861-2863. doi:<a href="https://doi.org/10.1038/emboj.2010.183">10.1038/emboj.2010.183</a>
  apa: Weber, M., &#38; Sixt, M. K. (2010). MEK signalling tunes actin treadmilling
    for interstitial lymphocyte migration. <i>EMBO Journal</i>. Wiley-Blackwell. <a
    href="https://doi.org/10.1038/emboj.2010.183">https://doi.org/10.1038/emboj.2010.183</a>
  chicago: Weber, Michele, and Michael K Sixt. “MEK Signalling Tunes Actin Treadmilling
    for Interstitial Lymphocyte Migration.” <i>EMBO Journal</i>. Wiley-Blackwell,
    2010. <a href="https://doi.org/10.1038/emboj.2010.183">https://doi.org/10.1038/emboj.2010.183</a>.
  ieee: M. Weber and M. K. Sixt, “MEK signalling tunes actin treadmilling for interstitial
    lymphocyte migration,” <i>EMBO Journal</i>, vol. 29, no. 17. Wiley-Blackwell,
    pp. 2861–2863, 2010.
  ista: Weber M, Sixt MK. 2010. MEK signalling tunes actin treadmilling for interstitial
    lymphocyte migration. EMBO Journal. 29(17), 2861–2863.
  mla: Weber, Michele, and Michael K. Sixt. “MEK Signalling Tunes Actin Treadmilling
    for Interstitial Lymphocyte Migration.” <i>EMBO Journal</i>, vol. 29, no. 17,
    Wiley-Blackwell, 2010, pp. 2861–63, doi:<a href="https://doi.org/10.1038/emboj.2010.183">10.1038/emboj.2010.183</a>.
  short: M. Weber, M.K. Sixt, EMBO Journal 29 (2010) 2861–2863.
date_created: 2018-12-11T12:06:07Z
date_published: 2010-09-01T00:00:00Z
date_updated: 2021-01-12T07:53:29Z
day: '01'
doi: 10.1038/emboj.2010.183
extern: 1
intvolume: '        29'
issue: '17'
main_file_link:
- open_access: '1'
  url: http://www.ncbi.nlm.nih.gov/pmc/issues/190105/
month: '09'
oa: 1
page: 2861 - 2863
publication: EMBO Journal
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2167'
quality_controlled: 0
status: public
title: MEK signalling tunes actin treadmilling for interstitial lymphocyte migration
type: journal_article
volume: 29
year: '2010'
...
---
_id: '3961'
abstract:
- lang: eng
  text: For innate and adaptive immune responses it is essential that inflammatory
    cells use quick and flexible locomotion strategies. Accordingly, most leukocytes
    can efficiently infiltrate and traverse almost every physiological or artificial
    environment. Here, we review how leukocytes might achieve this task mechanistically,
    and summarize recent findings on the principles of cytoskeletal force generation
    and transduction at the leading edge of leukocytes. We propose a model in which
    the cells switch between adhesion-receptor-mediated force transmission and locomotion
    modes that are based on cellular deformations, but independent of adhesion receptors.
    This plasticity in migration strategies allows leukocytes to adapt to the geometry
    and molecular composition of their environment.
acknowledgement: We are grateful to Michele Weber for critical comments on the manuscript.
  Work in the laboratory of M.S. is supported by the German Research Foundation, the
  Peter Hans Hofschneider Foundation for Experimental Biomedicine and the Max Planck
  Society. J.R. is supported by a PhD fellowship of the Böhringer Ingelheim Fond.
  We thank Reinhard Fässler and Stefan Jentsch for their continuous support.
author:
- first_name: Jörg
  full_name: Jörg Renkawitz
  id: 3F0587C8-F248-11E8-B48F-1D18A9856A87
  last_name: Renkawitz
  orcid: 0000-0003-2856-3369
- first_name: Michael K
  full_name: Michael Sixt
  id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
  last_name: Sixt
  orcid: 0000-0002-6620-9179
citation:
  ama: Renkawitz J, Sixt MK. Mechanisms of force generation and force transmission
    during interstitial leukocyte migration. <i>EMBO Reports</i>. 2010;11(10):744-750.
    doi:<a href="https://doi.org/10.1038/embor.2010.147">10.1038/embor.2010.147</a>
  apa: Renkawitz, J., &#38; Sixt, M. K. (2010). Mechanisms of force generation and
    force transmission during interstitial leukocyte migration. <i>EMBO Reports</i>.
    Wiley-Blackwell. <a href="https://doi.org/10.1038/embor.2010.147">https://doi.org/10.1038/embor.2010.147</a>
  chicago: Renkawitz, Jörg, and Michael K Sixt. “Mechanisms of Force Generation and
    Force Transmission during Interstitial Leukocyte Migration.” <i>EMBO Reports</i>.
    Wiley-Blackwell, 2010. <a href="https://doi.org/10.1038/embor.2010.147">https://doi.org/10.1038/embor.2010.147</a>.
  ieee: J. Renkawitz and M. K. Sixt, “Mechanisms of force generation and force transmission
    during interstitial leukocyte migration,” <i>EMBO Reports</i>, vol. 11, no. 10.
    Wiley-Blackwell, pp. 744–750, 2010.
  ista: Renkawitz J, Sixt MK. 2010. Mechanisms of force generation and force transmission
    during interstitial leukocyte migration. EMBO Reports. 11(10), 744–750.
  mla: Renkawitz, Jörg, and Michael K. Sixt. “Mechanisms of Force Generation and Force
    Transmission during Interstitial Leukocyte Migration.” <i>EMBO Reports</i>, vol.
    11, no. 10, Wiley-Blackwell, 2010, pp. 744–50, doi:<a href="https://doi.org/10.1038/embor.2010.147">10.1038/embor.2010.147</a>.
  short: J. Renkawitz, M.K. Sixt, EMBO Reports 11 (2010) 744–750.
date_created: 2018-12-11T12:06:08Z
date_published: 2010-09-24T00:00:00Z
date_updated: 2021-01-12T07:53:30Z
day: '24'
doi: 10.1038/embor.2010.147
extern: 1
intvolume: '        11'
issue: '10'
month: '09'
page: 744 - 750
publication: EMBO Reports
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2166'
quality_controlled: 0
status: public
title: Mechanisms of force generation and force transmission during interstitial leukocyte
  migration
type: journal_article
volume: 11
year: '2010'
...
---
_id: '3962'
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Holger
  full_name: Pflicke, Holger
  id: CAA57A9A-5B61-11E9-B130-E0C1E1F2C83D
  last_name: Pflicke
citation:
  ama: Pflicke H.   Dendritic cell migration across basement membranes in the skin.
    2010.
  apa: Pflicke, H. (2010). <i>  Dendritic cell migration across basement membranes
    in the skin</i>. Institute of Science and Technology Austria.
  chicago: Pflicke, Holger. “  Dendritic Cell Migration across Basement Membranes
    in the Skin.” Institute of Science and Technology Austria, 2010.
  ieee: H. Pflicke, “  Dendritic cell migration across basement membranes in the skin,”
    Institute of Science and Technology Austria, 2010.
  ista: Pflicke H. 2010.   Dendritic cell migration across basement membranes in the
    skin. Institute of Science and Technology Austria.
  mla: Pflicke, Holger. <i>  Dendritic Cell Migration across Basement Membranes in
    the Skin</i>. Institute of Science and Technology Austria, 2010.
  short: H. Pflicke,   Dendritic Cell Migration across Basement Membranes in the Skin,
    Institute of Science and Technology Austria, 2010.
date_created: 2018-12-11T12:06:08Z
date_published: 2010-07-01T00:00:00Z
date_updated: 2023-09-07T11:28:47Z
day: '01'
degree_awarded: PhD
department:
- _id: CaHe
- _id: GradSch
language:
- iso: eng
month: '07'
oa_version: None
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '2165'
status: public
supervisor:
- 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
title: "\uFEFF\uFEFFDendritic cell migration across basement membranes in the skin"
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2010'
...
---
_id: '3963'
abstract:
- lang: eng
  text: Almost all species of the orchid genus Ophrys are pollinated by sexual deception.
    The orchids mimic the sex pheromone of receptive female insects, mainly hymenopterans,
    in order to attract males seeking to copulate. Most Ophrys species have achromatic
    flowers, but some exhibit a coloured perianth and a bright, conspicuous labellum
    pattern. We recently showed that the pink perianth of Ophrys heldreichii flowers
    increases detectability by its pollinator, males of the long-horned bee Eucera
    berlandi. Here we tested the hypothesis that the bright, complex labellum pattern
    mimics the female of the pollinator to increase attractiveness toward males. In
    a dual-choice test we offered E. berlandi males an O. heldreichii flower and a
    flower from O. dictynnae, which also exhibits a pinkish perianth but no conspicuous
    labellum pattern. Both flowers were housed in UV-transmitting acrylic glass boxes
    to exclude olfactory signals. Males significantly preferred O. heldreichii to
    O. dictynnae flowers. In a second experiment, we replaced the perianth of both
    flowers with identical artificial perianths made from pink card, so that only
    the labellum differed between the two flower stimuli. Males then chose between
    both stimuli at random, suggesting that the presence of a labellum pattern does
    not affect their choice. Spectral measurements revealed higher colour contrast
    with the background of the perianth of O. heldreichii compared to O. dictynnae,
    but no difference in green receptor-specific contrast or brightness. Our results
    show that male choice is guided by the chromatic contrast of the perianth during
    the initial flower approach but is not affected by the presence of a labellum
    pattern. Instead, we hypothesise that the labellum pattern is involved in aversive
    learning during post-copulatory behaviour and used by the orchid as a strategy
    to increase outcrossing.
article_processing_charge: No
author:
- first_name: M.
  full_name: Streinzer, M.
  last_name: Streinzer
- first_name: Thomas
  full_name: Ellis, Thomas
  id: 3153D6D4-F248-11E8-B48F-1D18A9856A87
  last_name: Ellis
  orcid: 0000-0002-8511-0254
- first_name: H.
  full_name: Paulus, H.
  last_name: Paulus
- first_name: J.
  full_name: Spaethe, J.
  last_name: Spaethe
citation:
  ama: Streinzer M, Ellis T, Paulus H, Spaethe J. Visual discrimination between two
    sexually deceptive Ophrys species by a bee pollinator. <i>Arthropod-Plant Interactions</i>.
    2010;4(3):141-148. doi:<a href="https://doi.org/10.1007/s11829-010-9093-4">10.1007/s11829-010-9093-4</a>
  apa: Streinzer, M., Ellis, T., Paulus, H., &#38; Spaethe, J. (2010). Visual discrimination
    between two sexually deceptive Ophrys species by a bee pollinator. <i>Arthropod-Plant
    Interactions</i>. Springer. <a href="https://doi.org/10.1007/s11829-010-9093-4">https://doi.org/10.1007/s11829-010-9093-4</a>
  chicago: Streinzer, M., Thomas Ellis, H. Paulus, and J. Spaethe. “Visual Discrimination
    between Two Sexually Deceptive Ophrys Species by a Bee Pollinator.” <i>Arthropod-Plant
    Interactions</i>. Springer, 2010. <a href="https://doi.org/10.1007/s11829-010-9093-4">https://doi.org/10.1007/s11829-010-9093-4</a>.
  ieee: M. Streinzer, T. Ellis, H. Paulus, and J. Spaethe, “Visual discrimination
    between two sexually deceptive Ophrys species by a bee pollinator,” <i>Arthropod-Plant
    Interactions</i>, vol. 4, no. 3. Springer, pp. 141–148, 2010.
  ista: Streinzer M, Ellis T, Paulus H, Spaethe J. 2010. Visual discrimination between
    two sexually deceptive Ophrys species by a bee pollinator. Arthropod-Plant Interactions.
    4(3), 141–148.
  mla: Streinzer, M., et al. “Visual Discrimination between Two Sexually Deceptive
    Ophrys Species by a Bee Pollinator.” <i>Arthropod-Plant Interactions</i>, vol.
    4, no. 3, Springer, 2010, pp. 141–48, doi:<a href="https://doi.org/10.1007/s11829-010-9093-4">10.1007/s11829-010-9093-4</a>.
  short: M. Streinzer, T. Ellis, H. Paulus, J. Spaethe, Arthropod-Plant Interactions
    4 (2010) 141–148.
date_created: 2018-12-11T12:06:08Z
date_published: 2010-01-01T00:00:00Z
date_updated: 2021-01-12T07:53:30Z
day: '01'
doi: 10.1007/s11829-010-9093-4
extern: '1'
intvolume: '         4'
issue: '3'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '01'
oa_version: None
page: 141 - 148
publication: Arthropod-Plant Interactions
publication_status: published
publisher: Springer
publist_id: '2164'
status: public
title: Visual discrimination between two sexually deceptive Ophrys species by a bee
  pollinator
tmp:
  image: /images/cc_by_nc.png
  legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
  short: CC BY-NC (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2010'
...
---
_id: '3964'
abstract:
- lang: eng
  text: We prove two stability results for Lipschitz functions on triangulable, compact
    metric spaces and consider applications of both to problems in systems biology.
    Given two functions, the first result is formulated in terms of the Wasserstein
    distance between their persistence diagrams and the second in terms of their total
    persistence.
acknowledgement: This research is partially supported by the Defense Advanced Research
  Projects Agency (DARPA) under grants HR0011-05-1-0007 and HR0011-05-1-0057 and by
  CNRS under grant PICS-3416.
author:
- first_name: David
  full_name: Cohen-Steiner, David
  last_name: Cohen Steiner
- first_name: Herbert
  full_name: Herbert Edelsbrunner
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
- first_name: John
  full_name: Harer, John
  last_name: Harer
- first_name: Yuriy
  full_name: Mileyko, Yuriy
  last_name: Mileyko
citation:
  ama: Cohen Steiner D, Edelsbrunner H, Harer J, Mileyko Y. Lipschitz functions have
    L_p-stable persistence. <i>Foundations of Computational Mathematics</i>. 2010;10(2):127-139.
    doi:<a href="https://doi.org/10.1007/s10208-010-9060-6">10.1007/s10208-010-9060-6</a>
  apa: Cohen Steiner, D., Edelsbrunner, H., Harer, J., &#38; Mileyko, Y. (2010). Lipschitz
    functions have L_p-stable persistence. <i>Foundations of Computational Mathematics</i>.
    Springer. <a href="https://doi.org/10.1007/s10208-010-9060-6">https://doi.org/10.1007/s10208-010-9060-6</a>
  chicago: Cohen Steiner, David, Herbert Edelsbrunner, John Harer, and Yuriy Mileyko.
    “Lipschitz Functions Have L_p-Stable Persistence.” <i>Foundations of Computational
    Mathematics</i>. Springer, 2010. <a href="https://doi.org/10.1007/s10208-010-9060-6">https://doi.org/10.1007/s10208-010-9060-6</a>.
  ieee: D. Cohen Steiner, H. Edelsbrunner, J. Harer, and Y. Mileyko, “Lipschitz functions
    have L_p-stable persistence,” <i>Foundations of Computational Mathematics</i>,
    vol. 10, no. 2. Springer, pp. 127–139, 2010.
  ista: Cohen Steiner D, Edelsbrunner H, Harer J, Mileyko Y. 2010. Lipschitz functions
    have L_p-stable persistence. Foundations of Computational Mathematics. 10(2),
    127–139.
  mla: Cohen Steiner, David, et al. “Lipschitz Functions Have L_p-Stable Persistence.”
    <i>Foundations of Computational Mathematics</i>, vol. 10, no. 2, Springer, 2010,
    pp. 127–39, doi:<a href="https://doi.org/10.1007/s10208-010-9060-6">10.1007/s10208-010-9060-6</a>.
  short: D. Cohen Steiner, H. Edelsbrunner, J. Harer, Y. Mileyko, Foundations of Computational
    Mathematics 10 (2010) 127–139.
date_created: 2018-12-11T12:06:09Z
date_published: 2010-01-28T00:00:00Z
date_updated: 2021-01-12T07:53:31Z
day: '28'
doi: 10.1007/s10208-010-9060-6
extern: 1
intvolume: '        10'
issue: '2'
month: '01'
page: 127 - 139
publication: Foundations of Computational Mathematics
publication_status: published
publisher: Springer
publist_id: '2163'
quality_controlled: 0
status: public
title: Lipschitz functions have L_p-stable persistence
type: journal_article
volume: 10
year: '2010'
...
---
_id: '4134'
abstract:
- lang: eng
  text: 'All species are restricted in their distribution. Currently, ecological models
    can only explain such limits if patches vary in quality, leading to asymmetrical
    dispersal, or if genetic variation is too low at the margins for adaptation. However,
    population genetic models suggest that the increase in genetic variance resulting
    from dispersal should allow adaptation to almost any ecological gradient. Clearly
    therefore, these models miss something that prevents evolution in natural populations.
    We developed an individual-based simulation to explore stochastic effects in these
    models. At high carrying capacities, our simulations largely agree with deterministic
    predictions. However, when carrying capacity is low, the population fails to establish
    for a wide range of parameter values where adaptation was expected from previous
    models. Stochastic or transient effects appear critical around the boundaries
    in parameter space between simulation behaviours. Dispersal, gradient steepness,
    and population density emerge as key factors determining adaptation on an ecological
    gradient. '
acknowledgement: We are very grateful to Nick Barton.
author:
- first_name: Jon
  full_name: Bridle, Jon
  last_name: Bridle
- first_name: Jitka
  full_name: Polechova, Jitka
  id: 3BBFB084-F248-11E8-B48F-1D18A9856A87
  last_name: Polechova
  orcid: 0000-0003-0951-3112
- first_name: Masakado
  full_name: Kawata, Masakado
  last_name: Kawata
- first_name: Roger
  full_name: Butlin, Roger
  last_name: Butlin
citation:
  ama: Bridle J, Polechova J, Kawata M, Butlin R. Why is adaptation prevented at ecological
    margins? New insights from individual-based simulations. <i>Ecology Letters</i>.
    2010;13(4):485-494. doi:<a href="https://doi.org/10.1111/j.1461-0248.2010.01442.x">10.1111/j.1461-0248.2010.01442.x</a>
  apa: Bridle, J., Polechova, J., Kawata, M., &#38; Butlin, R. (2010). Why is adaptation
    prevented at ecological margins? New insights from individual-based simulations.
    <i>Ecology Letters</i>. Wiley-Blackwell. <a href="https://doi.org/10.1111/j.1461-0248.2010.01442.x">https://doi.org/10.1111/j.1461-0248.2010.01442.x</a>
  chicago: Bridle, Jon, Jitka Polechova, Masakado Kawata, and Roger Butlin. “Why Is
    Adaptation Prevented at Ecological Margins? New Insights from Individual-Based
    Simulations.” <i>Ecology Letters</i>. Wiley-Blackwell, 2010. <a href="https://doi.org/10.1111/j.1461-0248.2010.01442.x">https://doi.org/10.1111/j.1461-0248.2010.01442.x</a>.
  ieee: J. Bridle, J. Polechova, M. Kawata, and R. Butlin, “Why is adaptation prevented
    at ecological margins? New insights from individual-based simulations,” <i>Ecology
    Letters</i>, vol. 13, no. 4. Wiley-Blackwell, pp. 485–494, 2010.
  ista: Bridle J, Polechova J, Kawata M, Butlin R. 2010. Why is adaptation prevented
    at ecological margins? New insights from individual-based simulations. Ecology
    Letters. 13(4), 485–494.
  mla: Bridle, Jon, et al. “Why Is Adaptation Prevented at Ecological Margins? New
    Insights from Individual-Based Simulations.” <i>Ecology Letters</i>, vol. 13,
    no. 4, Wiley-Blackwell, 2010, pp. 485–94, doi:<a href="https://doi.org/10.1111/j.1461-0248.2010.01442.x">10.1111/j.1461-0248.2010.01442.x</a>.
  short: J. Bridle, J. Polechova, M. Kawata, R. Butlin, Ecology Letters 13 (2010)
    485–494.
date_created: 2018-12-11T12:07:08Z
date_published: 2010-03-15T00:00:00Z
date_updated: 2021-01-12T07:54:45Z
day: '15'
department:
- _id: NiBa
doi: 10.1111/j.1461-0248.2010.01442.x
ec_funded: 1
intvolume: '        13'
issue: '4'
language:
- iso: eng
month: '03'
oa_version: None
page: 485 - 494
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '291734'
  name: International IST Postdoc Fellowship Programme
publication: Ecology Letters
publication_status: published
publisher: Wiley-Blackwell
publist_id: '1987'
quality_controlled: '1'
scopus_import: 1
status: public
title: Why is adaptation prevented at ecological margins? New insights from individual-based
  simulations
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2010'
...
---
_id: '4157'
abstract:
- lang: eng
  text: Integrin- and cadherin-mediated adhesion is central for cell and tissue morphogenesis,
    allowing cells and tissues to change shape without loosing integrity. Studies
    predominantly in cell culture showed that mechanosensation through adhesion structures
    is achieved by force-mediated modulation of their molecular composition. The specific
    molecular composition of adhesion sites in turn determines their signalling activity
    and dynamic reorganization. Here, we will review how adhesion sites respond to
    mecanical stimuli, and how spatially and temporally regulated signalling from
    different adhesion sites controls cell migration and tissue morphogenesis.
acknowledged_ssus:
- _id: Bio
author:
- first_name: Ekaterina
  full_name: Papusheva, Ekaterina
  id: 41DB591E-F248-11E8-B48F-1D18A9856A87
  last_name: Papusheva
- 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: 'Papusheva E, Heisenberg C-PJ. Spatial organization of adhesion: force-dependent
    regulation and function in tissue morphogenesis. <i>EMBO Journal</i>. 2010;29(16):2753-2768.
    doi:<a href="https://doi.org/10.1038/emboj.2010.182">10.1038/emboj.2010.182</a>'
  apa: 'Papusheva, E., &#38; Heisenberg, C.-P. J. (2010). Spatial organization of
    adhesion: force-dependent regulation and function in tissue morphogenesis. <i>EMBO
    Journal</i>. Wiley-Blackwell. <a href="https://doi.org/10.1038/emboj.2010.182">https://doi.org/10.1038/emboj.2010.182</a>'
  chicago: 'Papusheva, Ekaterina, and Carl-Philipp J Heisenberg. “Spatial Organization
    of Adhesion: Force-Dependent Regulation and Function in Tissue Morphogenesis.”
    <i>EMBO Journal</i>. Wiley-Blackwell, 2010. <a href="https://doi.org/10.1038/emboj.2010.182">https://doi.org/10.1038/emboj.2010.182</a>.'
  ieee: 'E. Papusheva and C.-P. J. Heisenberg, “Spatial organization of adhesion:
    force-dependent regulation and function in tissue morphogenesis,” <i>EMBO Journal</i>,
    vol. 29, no. 16. Wiley-Blackwell, pp. 2753–2768, 2010.'
  ista: 'Papusheva E, Heisenberg C-PJ. 2010. Spatial organization of adhesion: force-dependent
    regulation and function in tissue morphogenesis. EMBO Journal. 29(16), 2753–2768.'
  mla: 'Papusheva, Ekaterina, and Carl-Philipp J. Heisenberg. “Spatial Organization
    of Adhesion: Force-Dependent Regulation and Function in Tissue Morphogenesis.”
    <i>EMBO Journal</i>, vol. 29, no. 16, Wiley-Blackwell, 2010, pp. 2753–68, doi:<a
    href="https://doi.org/10.1038/emboj.2010.182">10.1038/emboj.2010.182</a>.'
  short: E. Papusheva, C.-P.J. Heisenberg, EMBO Journal 29 (2010) 2753–2768.
date_created: 2018-12-11T12:07:17Z
date_published: 2010-08-18T00:00:00Z
date_updated: 2021-01-12T07:54:55Z
day: '18'
department:
- _id: Bio
- _id: CaHe
doi: 10.1038/emboj.2010.182
external_id:
  pmid:
  - '20717145'
intvolume: '        29'
issue: '16'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2924654/
month: '08'
oa: 1
oa_version: Submitted Version
page: 2753 - 2768
pmid: 1
publication: EMBO Journal
publication_status: published
publisher: Wiley-Blackwell
publist_id: '1962'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Spatial organization of adhesion: force-dependent regulation and function
  in tissue morphogenesis'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 29
year: '2010'
...
