---
_id: '3302'
abstract:
- lang: eng
  text: Cloud computing aims to give users virtually unlimited pay-per-use computing
    resources without the burden of managing the underlying infrastructure. We present
    a new job execution environment Flextic that exploits scal- able static scheduling
    techniques to provide the user with a flexible pricing model, such as a tradeoff
    between dif- ferent degrees of execution speed and execution price, and at the
    same time, reduce scheduling overhead for the cloud provider. We have evaluated
    a prototype of Flextic on Amazon EC2 and compared it against Hadoop. For various
    data parallel jobs from machine learning, im- age processing, and gene sequencing
    that we considered, Flextic has low scheduling overhead and reduces job du- ration
    by up to 15% compared to Hadoop, a dynamic cloud scheduler.
article_processing_charge: No
author:
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
- first_name: Anmol
  full_name: Singh, Anmol
  id: 72A86902-E99F-11E9-9F62-915534D1B916
  last_name: Singh
- first_name: Vasu
  full_name: Singh, Vasu
  id: 4DAE2708-F248-11E8-B48F-1D18A9856A87
  last_name: Singh
- first_name: Thomas
  full_name: Wies, Thomas
  id: 447BFB88-F248-11E8-B48F-1D18A9856A87
  last_name: Wies
- first_name: Damien
  full_name: Zufferey, Damien
  id: 4397AC76-F248-11E8-B48F-1D18A9856A87
  last_name: Zufferey
  orcid: 0000-0002-3197-8736
citation:
  ama: 'Henzinger TA, Singh A, Singh V, Wies T, Zufferey D. Static scheduling in clouds.
    In: <i>3rd USENIX Workshop on Hot Topics in Cloud Computing</i>. Usenix Association;
    2011:1-6.'
  apa: 'Henzinger, T. A., Singh, A., Singh, V., Wies, T., &#38; Zufferey, D. (2011).
    Static scheduling in clouds. In <i>3rd USENIX Workshop on Hot Topics in Cloud
    Computing</i> (pp. 1–6). Portland, OR, United States: Usenix Association.'
  chicago: Henzinger, Thomas A, Anmol Singh, Vasu Singh, Thomas Wies, and Damien Zufferey.
    “Static Scheduling in Clouds.” In <i>3rd USENIX Workshop on Hot Topics in Cloud
    Computing</i>, 1–6. Usenix Association, 2011.
  ieee: T. A. Henzinger, A. Singh, V. Singh, T. Wies, and D. Zufferey, “Static scheduling
    in clouds,” in <i>3rd USENIX Workshop on Hot Topics in Cloud Computing</i>, Portland,
    OR, United States, 2011, pp. 1–6.
  ista: 'Henzinger TA, Singh A, Singh V, Wies T, Zufferey D. 2011. Static scheduling
    in clouds. 3rd USENIX Workshop on Hot Topics in Cloud Computing. HotCloud: Workshop
    on Hot Topics in Cloud Computing, 1–6.'
  mla: Henzinger, Thomas A., et al. “Static Scheduling in Clouds.” <i>3rd USENIX Workshop
    on Hot Topics in Cloud Computing</i>, Usenix Association, 2011, pp. 1–6.
  short: T.A. Henzinger, A. Singh, V. Singh, T. Wies, D. Zufferey, in:, 3rd USENIX
    Workshop on Hot Topics in Cloud Computing, Usenix Association, 2011, pp. 1–6.
conference:
  end_date: 2011-06-15
  location: Portland, OR, United States
  name: 'HotCloud: Workshop on Hot Topics in Cloud Computing'
  start_date: 2011-06-14
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T12:02:33Z
date_published: 2011-06-14T00:00:00Z
date_updated: 2026-07-07T06:07:16Z
day: '14'
ddc:
- '000'
- '005'
department:
- _id: ToHe
file:
- access_level: open_access
  checksum: 21a461ac004bb535c83320fe79b30375
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:18:14Z
  date_updated: 2020-07-14T12:46:06Z
  file_id: '5333'
  file_name: IST-2012-90-v1+1_Static_scheduling_in_clouds.pdf
  file_size: 232770
  relation: main_file
file_date_updated: 2020-07-14T12:46:06Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 1 - 6
publication: 3rd USENIX Workshop on Hot Topics in Cloud Computing
publication_status: published
publisher: Usenix Association
publist_id: '3338'
pubrep_id: '90'
quality_controlled: '1'
status: public
title: Static scheduling in clouds
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3356'
abstract:
- lang: eng
  text: There is recently a significant effort to add quantitative objectives to formal
    verification and synthesis. We introduce and investigate the extension of temporal
    logics with quantitative atomic assertions, aiming for a general and flexible
    framework for quantitative-oriented specifications. In the heart of quantitative
    objectives lies the accumulation of values along a computation. It is either the
    accumulated summation, as with the energy objectives, or the accumulated average,
    as with the mean-payoff objectives. We investigate the extension of temporal logics
    with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is
    a numeric variable of the system, c is a constant rational number, and Sum(v)
    and Avg(v) denote the accumulated sum and average of the values of v from the
    beginning of the computation up to the current point of time. We also allow the
    path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring
    to the average value along an entire computation. We study the border of decidability
    for extensions of various temporal logics. In particular, we show that extending
    the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities by
    prefix-accumulation assertions and extending LTL with path-accumulation assertions,
    result in temporal logics whose model-checking problem is decidable. The extended
    logics allow to significantly extend the currently known energy and mean-payoff
    objectives. Moreover, the prefix-accumulation assertions may be refined with "controlled-accumulation",
    allowing, for example, to specify constraints on the average waiting time between
    a request and a grant. On the negative side, we show that the fragment we point
    to is, in a sense, the maximal logic whose extension with prefix-accumulation
    assertions permits a decidable model-checking procedure. Extending a temporal
    logic that has the EG or EU modalities, and in particular CTL and LTL, makes the
    problem undecidable.
article_number: '5970226'
article_processing_charge: No
author:
- first_name: Udi
  full_name: Boker, Udi
  id: 31E297B6-F248-11E8-B48F-1D18A9856A87
  last_name: Boker
- 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: Orna
  full_name: Kupferman, Orna
  last_name: Kupferman
citation:
  ama: 'Boker U, Chatterjee K, Henzinger TA, Kupferman O. Temporal specifications
    with accumulative values. In: IEEE; 2011. doi:<a href="https://doi.org/10.1109/LICS.2011.33">10.1109/LICS.2011.33</a>'
  apa: 'Boker, U., Chatterjee, K., Henzinger, T. A., &#38; Kupferman, O. (2011). Temporal
    specifications with accumulative values. Presented at the LICS: Logic in Computer
    Science, Toronto, Canada: IEEE. <a href="https://doi.org/10.1109/LICS.2011.33">https://doi.org/10.1109/LICS.2011.33</a>'
  chicago: Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman.
    “Temporal Specifications with Accumulative Values.” IEEE, 2011. <a href="https://doi.org/10.1109/LICS.2011.33">https://doi.org/10.1109/LICS.2011.33</a>.
  ieee: 'U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications
    with accumulative values,” presented at the LICS: Logic in Computer Science, Toronto,
    Canada, 2011.'
  ista: 'Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications
    with accumulative values. LICS: Logic in Computer Science, 5970226.'
  mla: Boker, Udi, et al. <i>Temporal Specifications with Accumulative Values</i>.
    5970226, IEEE, 2011, doi:<a href="https://doi.org/10.1109/LICS.2011.33">10.1109/LICS.2011.33</a>.
  short: U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011.
conference:
  end_date: 2011-06-24
  location: Toronto, Canada
  name: 'LICS: Logic in Computer Science'
  start_date: 2011-06-21
date_created: 2018-12-11T12:02:52Z
date_published: 2011-06-21T00:00:00Z
date_updated: 2026-07-07T14:01:43Z
day: '21'
ddc:
- '000'
- '004'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1109/LICS.2011.33
ec_funded: 1
external_id:
  isi:
  - '000297350400007'
file:
- access_level: open_access
  checksum: 792128f5455f0f40f1105f0398e05fa9
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:12:42Z
  date_updated: 2020-07-14T12:46:09Z
  file_id: '4960'
  file_name: IST-2012-83-v1+1_Temporal_specifications_with_accumulative_values.pdf
  file_size: 225426
  relation: main_file
file_date_updated: 2020-07-14T12:46:09Z
fulldoi: https://doi.org/10.1109/LICS.2011.33
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '215543'
  name: COMponent-Based Embedded Systems design Techniques
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '267989'
  name: Quantitative Reactive Modeling
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '214373'
  name: Design for Embedded Systems
- _id: 2587B514-B435-11E9-9278-68D0E5697425
  name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: IEEE
publist_id: '3259'
pubrep_id: '83'
related_material:
  record:
  - id: '5385'
    relation: earlier_version
    status: public
  - id: '2038'
    relation: later_version
    status: public
scopus_import: '1'
status: public
title: Temporal specifications with accumulative values
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2011'
...
---
_id: '5385'
abstract:
- lang: eng
  text: There is recently a significant effort to add quantitative objectives to formal
    verification and synthesis. We introduce and investigate the extension of temporal
    logics with quantitative atomic assertions, aiming for a general and flexible
    framework for quantitative-oriented specifications. In the heart of quantitative
    objectives lies the accumulation of values along a computation. It is either the
    accumulated summation, as with the energy objectives, or the accumulated average,
    as with the mean-payoff objectives. We investigate the extension of temporal logics
    with the prefix-accumulation assertions Sum(v) ≥ c and Avg(v) ≥ c, where v is
    a numeric variable of the system, c is a constant rational number, and Sum(v)
    and Avg(v) denote the accumulated sum and average of the values of v from the
    beginning of the computation up to the current point of time. We also allow the
    path-accumulation assertions LimInfAvg(v) ≥ c and LimSupAvg(v) ≥ c, referring
    to the average value along an entire computation. We study the border of decidability
    for extensions of various temporal logics. In particular, we show that extending
    the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities by
    prefix-accumulation assertions and extending LTL with path-accumulation assertions,
    result in temporal logics whose model-checking problem is decidable. The extended
    logics allow to significantly extend the currently known energy and mean-payoff
    objectives. Moreover, the prefix-accumulation assertions may be refined with “controlled-accumulation”,
    allowing, for example, to specify constraints on the average waiting time between
    a request and a grant. On the negative side, we show that the fragment we point
    to is, in a sense, the maximal logic whose extension with prefix-accumulation
    assertions permits a decidable model-checking procedure. Extending a temporal
    logic that has the EG or EU modalities, and in particular CTL and LTL, makes the
    problem undecidable.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Udi
  full_name: Boker, Udi
  id: 31E297B6-F248-11E8-B48F-1D18A9856A87
  last_name: Boker
- 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: Orna
  full_name: Kupferman, Orna
  last_name: Kupferman
citation:
  ama: Boker U, Chatterjee K, Henzinger TA, Kupferman O. <i>Temporal Specifications
    with Accumulative Values</i>. IST Austria; 2011. doi:<a href="https://doi.org/10.15479/AT:IST-2011-0003">10.15479/AT:IST-2011-0003</a>
  apa: Boker, U., Chatterjee, K., Henzinger, T. A., &#38; Kupferman, O. (2011). <i>Temporal
    specifications with accumulative values</i>. IST Austria. <a href="https://doi.org/10.15479/AT:IST-2011-0003">https://doi.org/10.15479/AT:IST-2011-0003</a>
  chicago: Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman.
    <i>Temporal Specifications with Accumulative Values</i>. IST Austria, 2011. <a
    href="https://doi.org/10.15479/AT:IST-2011-0003">https://doi.org/10.15479/AT:IST-2011-0003</a>.
  ieee: U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, <i>Temporal specifications
    with accumulative values</i>. IST Austria, 2011.
  ista: Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications
    with accumulative values, IST Austria, 14p.
  mla: Boker, Udi, et al. <i>Temporal Specifications with Accumulative Values</i>.
    IST Austria, 2011, doi:<a href="https://doi.org/10.15479/AT:IST-2011-0003">10.15479/AT:IST-2011-0003</a>.
  short: U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications
    with Accumulative Values, IST Austria, 2011.
date_created: 2018-12-12T11:39:02Z
date_published: 2011-04-04T00:00:00Z
date_updated: 2026-07-07T14:01:43Z
day: '04'
ddc:
- '000'
- '004'
department:
- _id: ToHe
- _id: KrCh
doi: 10.15479/AT:IST-2011-0003
ec_funded: 1
file:
- access_level: open_access
  checksum: 8491d0d48c4911620ecd5350b413c11e
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:53:00Z
  date_updated: 2020-07-14T12:46:41Z
  file_id: '5461'
  file_name: IST-2011-0003_IST-2011-0003.pdf
  file_size: 366281
  relation: main_file
file_date_updated: 2020-07-14T12:46:41Z
fulldoi: https://doi.org/10.15479/AT:IST-2011-0003
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '14'
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '215543'
  name: COMponent-Based Embedded Systems design Techniques
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '267989'
  name: Quantitative Reactive Modeling
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '214373'
  name: Design for Embedded Systems
- _id: 2587B514-B435-11E9-9278-68D0E5697425
  name: Microsoft Research Faculty Fellowship
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '21'
related_material:
  record:
  - id: '3356'
    relation: later_version
    status: public
  - id: '2038'
    relation: later_version
    status: public
status: public
title: Temporal specifications with accumulative values
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '5381'
abstract:
- lang: eng
  text: "In two-player finite-state stochastic games of partial obser- vation on graphs,
    in every state of the graph, the players simultaneously choose an action, and
    their joint actions determine a probability distri- bution over the successor
    states. The game is played for infinitely many rounds and thus the players construct
    an infinite path in the graph. We consider reachability objectives where the first
    player tries to ensure a target state to be visited almost-surely (i.e., with
    probability 1) or pos- itively (i.e., with positive probability), no matter the
    strategy of the second player.\r\n\r\nWe classify such games according to the
    information and to the power of randomization available to the players. On the
    basis of information, the game can be one-sided with either (a) player 1, or (b)
    player 2 having partial observation (and the other player has perfect observation),
    or two- sided with (c) both players having partial observation. On the basis of
    randomization, (a) the players may not be allowed to use randomization (pure strategies),
    or (b) they may choose a probability distribution over actions but the actual
    random choice is external and not visible to the player (actions invisible), or
    (c) they may use full randomization.\r\n\r\nOur main results for pure strategies
    are as follows: (1) For one-sided games with player 2 perfect observation we show
    that (in contrast to full randomized strategies) belief-based (subset-construction
    based) strate- gies are not sufficient, and present an exponential upper bound
    on mem- ory both for almost-sure and positive winning strategies; we show that
    the problem of deciding the existence of almost-sure and positive winning strategies
    for player 1 is EXPTIME-complete and present symbolic algo- rithms that avoid
    the explicit exponential construction. (2) For one-sided games with player 1 perfect
    observation we show that non-elementary memory is both necessary and sufficient
    for both almost-sure and posi- tive winning strategies. (3) We show that for the
    general (two-sided) case finite-memory strategies are sufficient for both positive
    and almost-sure winning, and at least non-elementary memory is required. We establish
    the equivalence of the almost-sure winning problems for pure strategies and for
    randomized strategies with actions invisible. Our equivalence re- sult exhibit
    serious flaws in previous results in the literature: we show a non-elementary
    memory lower bound for almost-sure winning whereas an exponential upper bound
    was previously claimed."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Laurent
  full_name: Doyen, Laurent
  last_name: Doyen
citation:
  ama: 'Chatterjee K, Doyen L. <i>Partial-Observation Stochastic Games: How to Win
    When Belief Fails</i>. IST Austria; 2011. doi:<a href="https://doi.org/10.15479/AT:IST-2011-0007">10.15479/AT:IST-2011-0007</a>'
  apa: 'Chatterjee, K., &#38; Doyen, L. (2011). <i>Partial-observation stochastic
    games: How to win when belief fails</i>. IST Austria. <a href="https://doi.org/10.15479/AT:IST-2011-0007">https://doi.org/10.15479/AT:IST-2011-0007</a>'
  chicago: 'Chatterjee, Krishnendu, and Laurent Doyen. <i>Partial-Observation Stochastic
    Games: How to Win When Belief Fails</i>. IST Austria, 2011. <a href="https://doi.org/10.15479/AT:IST-2011-0007">https://doi.org/10.15479/AT:IST-2011-0007</a>.'
  ieee: 'K. Chatterjee and L. Doyen, <i>Partial-observation stochastic games: How
    to win when belief fails</i>. IST Austria, 2011.'
  ista: 'Chatterjee K, Doyen L. 2011. Partial-observation stochastic games: How to
    win when belief fails, IST Austria, 43p.'
  mla: 'Chatterjee, Krishnendu, and Laurent Doyen. <i>Partial-Observation Stochastic
    Games: How to Win When Belief Fails</i>. IST Austria, 2011, doi:<a href="https://doi.org/10.15479/AT:IST-2011-0007">10.15479/AT:IST-2011-0007</a>.'
  short: 'K. Chatterjee, L. Doyen, Partial-Observation Stochastic Games: How to Win
    When Belief Fails, IST Austria, 2011.'
date_created: 2018-12-12T11:39:00Z
date_published: 2011-07-05T00:00:00Z
date_updated: 2026-07-07T14:01:25Z
day: '05'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2011-0007
file:
- access_level: open_access
  checksum: 06bf6dfc97f6006e3fd0e9a3f31bc961
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:53:27Z
  date_updated: 2020-07-14T12:46:39Z
  file_id: '5488'
  file_name: IST-2011-0007_IST-2011-0007.pdf
  file_size: 574055
  relation: main_file
file_date_updated: 2020-07-14T12:46:39Z
fulldoi: https://doi.org/10.15479/AT:IST-2011-0007
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '43'
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '17'
related_material:
  record:
  - id: '1903'
    relation: later_version
    status: public
  - id: '2955'
    relation: later_version
    status: public
  - id: '2211'
    relation: later_version
    status: public
status: public
title: 'Partial-observation stochastic games: How to win when belief fails'
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3353'
abstract:
- lang: eng
  text: 'Compositional theories are crucial when designing large and complex systems
    from smaller components. In this work we propose such a theory for synchronous
    concurrent systems. Our approach follows so-called interface theories, which use
    game-theoretic interpretations of composition and refinement. These are appropriate
    for systems with distinct inputs and outputs, and explicit conditions on inputs
    that must be enforced during composition. Our interfaces model systems that execute
    in an infinite sequence of synchronous rounds. At each round, a contract must
    be satisfied. The contract is simply a relation specifying the set of valid input/output
    pairs. Interfaces can be composed by parallel, serial or feedback composition.
    A refinement relation between interfaces is defined, and shown to have two main
    properties: (1) it is preserved by composition, and (2) it is equivalent to substitutability,
    namely, the ability to replace an interface by another one in any context. Shared
    refinement and abstraction operators, corresponding to greatest lower and least
    upper bounds with respect to refinement, are also defined. Input-complete interfaces,
    that impose no restrictions on inputs, and deterministic interfaces, that produce
    a unique output for any legal input, are discussed as special cases, and an interesting
    duality between the two classes is exposed. A number of illustrative examples
    are provided, as well as algorithms to compute compositions, check refinement,
    and so on, for finite-state interfaces.'
article_number: '14'
article_processing_charge: No
author:
- first_name: Stavros
  full_name: Tripakis, Stavros
  last_name: Tripakis
- first_name: Ben
  full_name: Lickly, Ben
  last_name: Lickly
- 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: Edward
  full_name: Lee, Edward
  last_name: Lee
citation:
  ama: Tripakis S, Lickly B, Henzinger TA, Lee E. A theory of synchronous relational
    interfaces. <i>ACM Transactions on Programming Languages and Systems</i>. 2011;33(4).
    doi:<a href="https://doi.org/10.1145/1985342.1985345">10.1145/1985342.1985345</a>
  apa: Tripakis, S., Lickly, B., Henzinger, T. A., &#38; Lee, E. (2011). A theory
    of synchronous relational interfaces. <i>ACM Transactions on Programming Languages
    and Systems</i>. ACM. <a href="https://doi.org/10.1145/1985342.1985345">https://doi.org/10.1145/1985342.1985345</a>
  chicago: Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “A Theory
    of Synchronous Relational Interfaces.” <i>ACM Transactions on Programming Languages
    and Systems</i>. ACM, 2011. <a href="https://doi.org/10.1145/1985342.1985345">https://doi.org/10.1145/1985342.1985345</a>.
  ieee: S. Tripakis, B. Lickly, T. A. Henzinger, and E. Lee, “A theory of synchronous
    relational interfaces,” <i>ACM Transactions on Programming Languages and Systems</i>,
    vol. 33, no. 4. ACM, 2011.
  ista: Tripakis S, Lickly B, Henzinger TA, Lee E. 2011. A theory of synchronous relational
    interfaces. ACM Transactions on Programming Languages and Systems. 33(4), 14.
  mla: Tripakis, Stavros, et al. “A Theory of Synchronous Relational Interfaces.”
    <i>ACM Transactions on Programming Languages and Systems</i>, vol. 33, no. 4,
    14, ACM, 2011, doi:<a href="https://doi.org/10.1145/1985342.1985345">10.1145/1985342.1985345</a>.
  short: S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, ACM Transactions on Programming
    Languages and Systems 33 (2011).
das_tickbox: '1'
date_created: 2018-12-11T12:02:51Z
date_published: 2011-07-01T00:00:00Z
date_updated: 2026-07-07T14:03:34Z
day: '01'
ddc:
- '000'
- '005'
department:
- _id: ToHe
doi: 10.1145/1985342.1985345
ec_funded: 1
external_id:
  isi:
  - '000292766400003'
file:
- access_level: open_access
  checksum: 5d44a8aa81e33210649beae507602138
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:16:45Z
  date_updated: 2020-07-14T12:46:09Z
  file_id: '5235'
  file_name: IST-2012-85-v1+1_A_theory_of_synchronous_relational_interfaces.pdf
  file_size: 775662
  relation: main_file
file_date_updated: 2020-07-14T12:46:09Z
fulldoi: https://doi.org/10.1145/1985342.1985345
has_accepted_license: '1'
intvolume: '        33'
isi: 1
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
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
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '267989'
  name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S11402-N23
  name: Moderne Concurrency Paradigms
publication: ACM Transactions on Programming Languages and Systems
publication_status: published
publisher: ACM
publist_id: '3263'
pubrep_id: '85'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A theory of synchronous relational interfaces
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2011'
...
---
_id: '3354'
abstract:
- lang: eng
  text: 'We consider two-player games played on a finite state space for an infinite
    number of rounds. The games are concurrent: in each round, the two players (player
    1 and player 2) choose their moves independently and simultaneously; the current
    state and the two moves determine the successor state. We consider ω-regular winning
    conditions specified as parity objectives. Both players are allowed to use randomization
    when choosing their moves. We study the computation of the limit-winning set of
    states, consisting of the states where the sup-inf value of the game for player
    1 is 1: in other words, a state is limit-winning if player 1 can ensure a probability
    of winning arbitrarily close to 1. We show that the limit-winning set can be computed
    in O(n2d+2) time, where n is the size of the game structure and 2d is the number
    of priorities (or colors). The membership problem of whether a state belongs to
    the limit-winning set can be decided in NP ∩ coNP. While this complexity is the
    same as for the simpler class of turn-based parity games, where in each state
    only one of the two players has a choice of moves, our algorithms are considerably
    more involved than those for turn-based games. This is because concurrent games
    do not satisfy two of the most fundamental properties of turn-based parity games.
    First, in concurrent games limit-winning strategies require randomization; and
    second, they require infinite memory.'
article_number: '28'
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. Qualitative concurrent parity games.
    <i>ACM Transactions on Computational Logic</i>. 2011;12(4). doi:<a href="https://doi.org/10.1145/1970398.1970404">10.1145/1970398.1970404</a>
  apa: Chatterjee, K., De Alfaro, L., &#38; Henzinger, T. A. (2011). Qualitative concurrent
    parity games. <i>ACM Transactions on Computational Logic</i>. ACM. <a href="https://doi.org/10.1145/1970398.1970404">https://doi.org/10.1145/1970398.1970404</a>
  chicago: Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Qualitative
    Concurrent Parity Games.” <i>ACM Transactions on Computational Logic</i>. ACM,
    2011. <a href="https://doi.org/10.1145/1970398.1970404">https://doi.org/10.1145/1970398.1970404</a>.
  ieee: K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Qualitative concurrent
    parity games,” <i>ACM Transactions on Computational Logic</i>, vol. 12, no. 4.
    ACM, 2011.
  ista: Chatterjee K, De Alfaro L, Henzinger TA. 2011. Qualitative concurrent parity
    games. ACM Transactions on Computational Logic. 12(4), 28.
  mla: Chatterjee, Krishnendu, et al. “Qualitative Concurrent Parity Games.” <i>ACM
    Transactions on Computational Logic</i>, vol. 12, no. 4, 28, ACM, 2011, doi:<a
    href="https://doi.org/10.1145/1970398.1970404">10.1145/1970398.1970404</a>.
  short: K. Chatterjee, L. De Alfaro, T.A. Henzinger, ACM Transactions on Computational
    Logic 12 (2011).
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T12:02:51Z
date_published: 2011-07-04T00:00:00Z
date_updated: 2026-07-07T14:02:38Z
day: '04'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1145/1970398.1970404
external_id:
  isi:
  - '000296202300006'
fulldoi: https://doi.org/10.1145/1970398.1970404
intvolume: '        12'
isi: 1
issue: '4'
language:
- iso: eng
month: '07'
oa_version: None
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 2587B514-B435-11E9-9278-68D0E5697425
  name: Microsoft Research Faculty Fellowship
publication: ACM Transactions on Computational Logic
publication_status: published
publisher: ACM
publist_id: '3262'
quality_controlled: '1'
related_material:
  record:
  - id: '2054'
    relation: later_version
    status: public
scopus_import: '1'
status: public
title: Qualitative concurrent parity games
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 12
year: '2011'
...
---
_id: '3396'
abstract:
- lang: eng
  text: Facial branchiomotor neurons (FBMNs) in zebrafish and mouse embryonic hindbrain
    undergo a characteristic tangential migration from rhombomere (r) 4, where they
    are born, to r6/7. Cohesion among neuroepithelial cells (NCs) has been suggested
    to function in FBMN migration by inhibiting FBMNs positioned in the basal neuroepithelium
    such that they move apically between NCs towards the midline of the neuroepithelium
    instead of tangentially along the basal side of the neuroepithelium towards r6/7.
    However, direct experimental evaluation of this hypothesis is still lacking. Here,
    we have used a combination of biophysical cell adhesion measurements and high-resolution
    time-lapse microscopy to determine the role of NC cohesion in FBMN migration.
    We show that reducing NC cohesion by interfering with Cadherin 2 (Cdh2) activity
    results in FBMNs positioned at the basal side of the neuroepithelium moving apically
    towards the neural tube midline instead of tangentially towards r6/7. In embryos
    with strongly reduced NC cohesion, ectopic apical FBMN movement frequently results
    in fusion of the bilateral FBMN clusters over the apical midline of the neural
    tube. By contrast, reducing cohesion among FBMNs by interfering with Contactin
    2 (Cntn2) expression in these cells has little effect on apical FBMN movement,
    but reduces the fusion of the bilateral FBMN clusters in embryos with strongly
    diminished NC cohesion. These data provide direct experimental evidence that NC
    cohesion functions in tangential FBMN migration by restricting their apical movement.
acknowledged_ssus:
- _id: Bio
- _id: PreCl
acknowledgement: We thank C. Moens and J. Geiger for critical reading of earlier versions
  of this manuscript and members of the Heisenberg laboratory for discussions. We
  are grateful to the microscopy facility of the MPI-CBG and IST Austria for continuous
  support; I. Nüsslein, J. Compagnon and Alex Eichner for help with cell sorting;
  and the fish facility of the MPI-CBG and IST Austria for excellent fish care.
article_processing_charge: No
article_type: original
author:
- first_name: Petra
  full_name: Stockinger, Petra
  id: 261CB030-E90D-11E9-B182-F697D44B663C
  last_name: Stockinger
- 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
- first_name: Jean-Léon
  full_name: Maître, Jean-Léon
  id: 48F1E0D8-F248-11E8-B48F-1D18A9856A87
  last_name: Maître
  orcid: 0000-0002-3688-1474
citation:
  ama: Stockinger P, Heisenberg C-PJ, Maître J-L. Defective neuroepithelial cell cohesion
    affects tangential branchiomotor neuron migration in the zebrafish neural tube.
    <i>Development</i>. 2011;138(21):4673-4683. doi:<a href="https://doi.org/10.1242/dev.071233">10.1242/dev.071233</a>
  apa: Stockinger, P., Heisenberg, C.-P. J., &#38; Maître, J.-L. (2011). Defective
    neuroepithelial cell cohesion affects tangential branchiomotor neuron migration
    in the zebrafish neural tube. <i>Development</i>. Company of Biologists. <a href="https://doi.org/10.1242/dev.071233">https://doi.org/10.1242/dev.071233</a>
  chicago: Stockinger, Petra, Carl-Philipp J Heisenberg, and Jean-Léon Maître. “Defective
    Neuroepithelial Cell Cohesion Affects Tangential Branchiomotor Neuron Migration
    in the Zebrafish Neural Tube.” <i>Development</i>. Company of Biologists, 2011.
    <a href="https://doi.org/10.1242/dev.071233">https://doi.org/10.1242/dev.071233</a>.
  ieee: P. Stockinger, C.-P. J. Heisenberg, and J.-L. Maître, “Defective neuroepithelial
    cell cohesion affects tangential branchiomotor neuron migration in the zebrafish
    neural tube,” <i>Development</i>, vol. 138, no. 21. Company of Biologists, pp.
    4673–4683, 2011.
  ista: Stockinger P, Heisenberg C-PJ, Maître J-L. 2011. Defective neuroepithelial
    cell cohesion affects tangential branchiomotor neuron migration in the zebrafish
    neural tube. Development. 138(21), 4673–4683.
  mla: Stockinger, Petra, et al. “Defective Neuroepithelial Cell Cohesion Affects
    Tangential Branchiomotor Neuron Migration in the Zebrafish Neural Tube.” <i>Development</i>,
    vol. 138, no. 21, Company of Biologists, 2011, pp. 4673–83, doi:<a href="https://doi.org/10.1242/dev.071233">10.1242/dev.071233</a>.
  short: P. Stockinger, C.-P.J. Heisenberg, J.-L. Maître, Development 138 (2011) 4673–4683.
corr_author: '1'
date_created: 2018-12-11T12:03:06Z
date_published: 2011-11-01T00:00:00Z
date_updated: 2026-07-28T08:23:30Z
day: '01'
ddc:
- '570'
department:
- _id: CaHe
doi: 10.1242/dev.071233
external_id:
  isi:
  - '000296060100011'
file:
- access_level: open_access
  checksum: ca12b79e01ef36c1ef1aea31cf7e7139
  content_type: application/pdf
  creator: dernst
  date_created: 2019-10-07T14:19:42Z
  date_updated: 2020-07-14T12:46:12Z
  file_id: '6930'
  file_name: 2011_Development_Stockinger.pdf
  file_size: 4672439
  relation: main_file
file_date_updated: 2020-07-14T12:46:12Z
fulldoi: https://doi.org/10.1242/dev.071233
has_accepted_license: '1'
intvolume: '       138'
isi: 1
issue: '21'
keyword:
- Epithelial cohesion
- Hindbrain
- Neuronal migration
- Zebrafish
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 4673 - 4683
publication: Development
publication_status: published
publisher: Company of Biologists
publist_id: '3210'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron
  migration in the zebrafish neural tube
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 138
year: '2011'
...
---
OA_place: repository
OA_type: green
_id: '3379'
abstract:
- lang: eng
  text: The process of gastrulation is highly conserved across vertebrates on both
    the genetic and morphological levels, despite great variety in embryonic shape
    and speed of development. This mechanism spatially separates the germ layers and
    establishes the organizational foundation for future development. Mesodermal identity
    is specified in a superficial layer of cells, the epiblast, where cells maintain
    an epithelioid morphology. These cells involute to join the deeper hypoblast layer
    where they adopt a migratory, mesenchymal morphology. Expression of a cascade
    of related transcription factors orchestrates the parallel genetic transition
    from primitive to mature mesoderm. Although the early and late stages of this
    process are increasingly well understood, the transition between them has remained
    largely mysterious. We present here the first high resolution in vivo observations
    of the blebby transitional morphology of involuting mesodermal cells in a vertebrate
    embryo. We further demonstrate that the zebrafish spadetail mutation creates a
    reversible block in the maturation program, stalling cells in the transition state.
    This mutation creates an ideal system for dissecting the specific properties of
    cells undergoing the morphological transition of maturing mesoderm, as we demonstrate
    with a direct measurement of cell–cell adhesion.
acknowledgement: We thank David Grunwald for providing the spadetail-myc fusion construct.
  This work was supported by an NIH grant (GM079203) to D.K. and grants from the Austrian
  Academy of Sciences to P.S., and from the DFG, MPG and IST Austria to C.-P.H. R.R.
  was supported by a Developmental Biology Predoctoral Training Grant, T32HD007183,
  from the National Institute of Child Health and Human Development. B.L.M. was supported
  by an American Cancer Society fellowship (PF-07-048-01-DDC).
article_processing_charge: No
article_type: original
author:
- first_name: Richard
  full_name: Row, Richard
  last_name: Row
- first_name: Jean-Léon
  full_name: Maître, Jean-Léon
  id: 48F1E0D8-F248-11E8-B48F-1D18A9856A87
  last_name: Maître
  orcid: 0000-0002-3688-1474
- first_name: Benjamin
  full_name: Martin, Benjamin
  last_name: Martin
- first_name: Petra
  full_name: Stockinger, Petra
  id: 261CB030-E90D-11E9-B182-F697D44B663C
  last_name: Stockinger
- 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
- first_name: David
  full_name: Kimelman, David
  last_name: Kimelman
citation:
  ama: Row R, Maître J-L, Martin B, Stockinger P, Heisenberg C-PJ, Kimelman D. Completion
    of the epithelial to mesenchymal transition in zebrafish mesoderm requires Spadetail.
    <i>Developmental Biology</i>. 2011;354(1):102-110. doi:<a href="https://doi.org/10.1016/j.ydbio.2011.03.025">10.1016/j.ydbio.2011.03.025</a>
  apa: Row, R., Maître, J.-L., Martin, B., Stockinger, P., Heisenberg, C.-P. J., &#38;
    Kimelman, D. (2011). Completion of the epithelial to mesenchymal transition in
    zebrafish mesoderm requires Spadetail. <i>Developmental Biology</i>. Elsevier.
    <a href="https://doi.org/10.1016/j.ydbio.2011.03.025">https://doi.org/10.1016/j.ydbio.2011.03.025</a>
  chicago: Row, Richard, Jean-Léon Maître, Benjamin Martin, Petra Stockinger, Carl-Philipp
    J Heisenberg, and David Kimelman. “Completion of the Epithelial to Mesenchymal
    Transition in Zebrafish Mesoderm Requires Spadetail.” <i>Developmental Biology</i>.
    Elsevier, 2011. <a href="https://doi.org/10.1016/j.ydbio.2011.03.025">https://doi.org/10.1016/j.ydbio.2011.03.025</a>.
  ieee: R. Row, J.-L. Maître, B. Martin, P. Stockinger, C.-P. J. Heisenberg, and D.
    Kimelman, “Completion of the epithelial to mesenchymal transition in zebrafish
    mesoderm requires Spadetail,” <i>Developmental Biology</i>, vol. 354, no. 1. Elsevier,
    pp. 102–110, 2011.
  ista: Row R, Maître J-L, Martin B, Stockinger P, Heisenberg C-PJ, Kimelman D. 2011.
    Completion of the epithelial to mesenchymal transition in zebrafish mesoderm requires
    Spadetail. Developmental Biology. 354(1), 102–110.
  mla: Row, Richard, et al. “Completion of the Epithelial to Mesenchymal Transition
    in Zebrafish Mesoderm Requires Spadetail.” <i>Developmental Biology</i>, vol.
    354, no. 1, Elsevier, 2011, pp. 102–10, doi:<a href="https://doi.org/10.1016/j.ydbio.2011.03.025">10.1016/j.ydbio.2011.03.025</a>.
  short: R. Row, J.-L. Maître, B. Martin, P. Stockinger, C.-P.J. Heisenberg, D. Kimelman,
    Developmental Biology 354 (2011) 102–110.
das_tickbox: '1'
date_created: 2018-12-11T12:03:00Z
date_published: 2011-06-01T00:00:00Z
date_updated: 2026-07-28T08:31:27Z
day: '01'
department:
- _id: CaHe
doi: 10.1016/j.ydbio.2011.03.025
external_id:
  isi:
  - '000290550500010'
  pmid:
  - '21463614'
fulldoi: https://doi.org/10.1016/j.ydbio.2011.03.025
intvolume: '       354'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3090540/
month: '06'
oa: 1
oa_version: Submitted Version
page: 102 - 110
pmid: 1
publication: Developmental Biology
publication_status: published
publisher: Elsevier
publist_id: '3228'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Completion of the epithelial to mesenchymal transition in zebrafish mesoderm
  requires Spadetail
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 354
year: '2011'
...
---
OA_type: closed access
_id: '3781'
abstract:
- lang: eng
  text: We bound the difference in length of two curves in terms of their total curvatures
    and the Fréchet distance. The bound is independent of the dimension of the ambient
    Euclidean space, it improves upon a bound by Cohen-Steiner and Edelsbrunner, and
    it generalizes a result by Fáry and Chakerian.
acknowledgement: Funded by Graduate Aid in Areas of National Need (GAANN) Fellowship.
  The author would like to thank Herbert Edelsbrunner for his discussions and guidance.
article_processing_charge: No
article_type: original
author:
- first_name: Brittany Terese
  full_name: Fasy, Brittany Terese
  id: F65D502E-E68D-11E9-9252-C644099818F6
  last_name: Fasy
citation:
  ama: Fasy BT. The difference in length of curves in R^n. <i>Acta Scientiarum Mathematicarum</i>.
    2011;77(1-2):359-367. doi:<a href="https://doi.org/10.1007/BF03651375">10.1007/BF03651375</a>
  apa: Fasy, B. T. (2011). The difference in length of curves in R^n. <i>Acta Scientiarum
    Mathematicarum</i>. Springer Nature. <a href="https://doi.org/10.1007/BF03651375">https://doi.org/10.1007/BF03651375</a>
  chicago: Fasy, Brittany Terese. “The Difference in Length of Curves in R^n.” <i>Acta
    Scientiarum Mathematicarum</i>. Springer Nature, 2011. <a href="https://doi.org/10.1007/BF03651375">https://doi.org/10.1007/BF03651375</a>.
  ieee: B. T. Fasy, “The difference in length of curves in R^n,” <i>Acta Scientiarum
    Mathematicarum</i>, vol. 77, no. 1–2. Springer Nature, pp. 359–367, 2011.
  ista: Fasy BT. 2011. The difference in length of curves in R^n. Acta Scientiarum
    Mathematicarum. 77(1–2), 359–367.
  mla: Fasy, Brittany Terese. “The Difference in Length of Curves in R^n.” <i>Acta
    Scientiarum Mathematicarum</i>, vol. 77, no. 1–2, Springer Nature, 2011, pp. 359–67,
    doi:<a href="https://doi.org/10.1007/BF03651375">10.1007/BF03651375</a>.
  short: B.T. Fasy, Acta Scientiarum Mathematicarum 77 (2011) 359–367.
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T12:05:08Z
date_published: 2011-06-01T00:00:00Z
date_updated: 2026-07-28T08:11:07Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/BF03651375
fulldoi: https://doi.org/10.1007/BF03651375
intvolume: '        77'
issue: 1-2
language:
- iso: eng
month: '06'
oa_version: None
page: 359 - 367
publication: Acta Scientiarum Mathematicarum
publication_identifier:
  eissn:
  - 2064-8316
  issn:
  - 0001-6969
publication_status: published
publisher: Springer Nature
publist_id: '2446'
quality_controlled: '1'
status: public
title: The difference in length of curves in R^n
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 77
year: '2011'
...
---
OA_place: publisher
OA_type: free access
_id: '3383'
article_processing_charge: No
author:
- 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: 'Heisenberg C-PJ. Invited Lectures ‐ Symposia Area. In: <i>The FEBS Journal</i>.
    Vol 278. Wiley; 2011:24-24. doi:<a href="https://doi.org/10.1111/j.1742-4658.2011.08136.x">10.1111/j.1742-4658.2011.08136.x</a>'
  apa: 'Heisenberg, C.-P. J. (2011). Invited Lectures ‐ Symposia Area. In <i>The FEBS
    Journal</i> (Vol. 278, pp. 24–24). Torino, Italy: Wiley. <a href="https://doi.org/10.1111/j.1742-4658.2011.08136.x">https://doi.org/10.1111/j.1742-4658.2011.08136.x</a>'
  chicago: Heisenberg, Carl-Philipp J. “Invited Lectures ‐ Symposia Area.” In <i>The
    FEBS Journal</i>, 278:24–24. Wiley, 2011. <a href="https://doi.org/10.1111/j.1742-4658.2011.08136.x">https://doi.org/10.1111/j.1742-4658.2011.08136.x</a>.
  ieee: C.-P. J. Heisenberg, “Invited Lectures ‐ Symposia Area,” in <i>The FEBS Journal</i>,
    Torino, Italy, 2011, vol. 278, no. S1, pp. 24–24.
  ista: Heisenberg C-PJ. 2011. Invited Lectures ‐ Symposia Area. The FEBS Journal.
    FEBS Congress on Biochemistry for Tomorrow’s Medicine vol. 278, 24–24.
  mla: Heisenberg, Carl-Philipp J. “Invited Lectures ‐ Symposia Area.” <i>The FEBS
    Journal</i>, vol. 278, no. S1, Wiley, 2011, pp. 24–24, doi:<a href="https://doi.org/10.1111/j.1742-4658.2011.08136.x">10.1111/j.1742-4658.2011.08136.x</a>.
  short: C.-P.J. Heisenberg, in:, The FEBS Journal, Wiley, 2011, pp. 24–24.
conference:
  end_date: 2011-06-30
  location: Torino, Italy
  name: FEBS Congress on Biochemistry for Tomorrow's Medicine
  start_date: 2011-06-25
corr_author: '1'
date_created: 2018-12-11T12:03:01Z
date_published: 2011-07-01T00:00:00Z
date_updated: 2026-07-28T08:27:55Z
day: '01'
department:
- _id: CaHe
doi: 10.1111/j.1742-4658.2011.08136.x
fulldoi: https://doi.org/10.1111/j.1742-4658.2011.08136.x
intvolume: '       278'
issue: S1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1111/j.1742-4658.2011.08136.x
month: '07'
oa: 1
oa_version: Published Version
page: 24 - 24
publication: The FEBS Journal
publication_status: published
publisher: Wiley
publist_id: '3224'
quality_controlled: '1'
status: public
title: Invited Lectures ‐ Symposia Area
type: conference_abstract
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 278
year: '2011'
...
---
_id: '3368'
abstract:
- lang: eng
  text: Tissue surface tension (TST) is an important mechanical property influencing
    cell sorting and tissue envelopment. The study by Manning et al. (1) reported
    on a mathematical model describing TST on the basis of the balance between adhesive
    and tensile properties of the constituent cells. The model predicts that, in high-adhesion
    cell aggregates, surface cells will be stretched to maintain the same area of
    cell–cell contact as interior bulk cells, resulting in an elongated and flattened
    cell shape. The authors (1) observed flat and elongated cells at the surface of
    high-adhesion zebrafish germ-layer explants, which they argue are undifferentiated
    stretched germ-layer progenitor cells, and they use this observation as a validation
    of their model.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Gabriel
  full_name: Krens, Gabriel
  id: 2B819732-F248-11E8-B48F-1D18A9856A87
  last_name: Krens
  orcid: 0000-0003-4761-5996
- first_name: Stephanie
  full_name: Möllmert, Stephanie
  id: 260FD49C-E911-11E9-B5EA-D9538404589B
  last_name: Möllmert
- 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: Krens G, Möllmert S, Heisenberg C-PJ. Enveloping cell layer differentiation
    at the surface of zebrafish germ layer tissue explants. <i>PNAS</i>. 2011;108(3):E9-E10.
    doi:<a href="https://doi.org/10.1073/pnas.1010767108">10.1073/pnas.1010767108</a>
  apa: Krens, G., Möllmert, S., &#38; Heisenberg, C.-P. J. (2011). Enveloping cell
    layer differentiation at the surface of zebrafish germ layer tissue explants.
    <i>PNAS</i>. National Academy of Sciences. <a href="https://doi.org/10.1073/pnas.1010767108">https://doi.org/10.1073/pnas.1010767108</a>
  chicago: Krens, Gabriel, Stephanie Möllmert, and Carl-Philipp J Heisenberg. “Enveloping
    Cell Layer Differentiation at the Surface of Zebrafish Germ Layer Tissue Explants.”
    <i>PNAS</i>. National Academy of Sciences, 2011. <a href="https://doi.org/10.1073/pnas.1010767108">https://doi.org/10.1073/pnas.1010767108</a>.
  ieee: G. Krens, S. Möllmert, and C.-P. J. Heisenberg, “Enveloping cell layer differentiation
    at the surface of zebrafish germ layer tissue explants,” <i>PNAS</i>, vol. 108,
    no. 3. National Academy of Sciences, pp. E9–E10, 2011.
  ista: Krens G, Möllmert S, Heisenberg C-PJ. 2011. Enveloping cell layer differentiation
    at the surface of zebrafish germ layer tissue explants. PNAS. 108(3), E9–E10.
  mla: Krens, Gabriel, et al. “Enveloping Cell Layer Differentiation at the Surface
    of Zebrafish Germ Layer Tissue Explants.” <i>PNAS</i>, vol. 108, no. 3, National
    Academy of Sciences, 2011, pp. E9–10, doi:<a href="https://doi.org/10.1073/pnas.1010767108">10.1073/pnas.1010767108</a>.
  short: G. Krens, S. Möllmert, C.-P.J. Heisenberg, PNAS 108 (2011) E9–E10.
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T12:02:56Z
date_published: 2011-01-18T00:00:00Z
date_updated: 2026-07-28T09:03:18Z
day: '18'
department:
- _id: CaHe
doi: 10.1073/pnas.1010767108
external_id:
  isi:
  - '000286310300003'
  pmid:
  - '21212360'
fulldoi: https://doi.org/10.1073/pnas.1010767108
intvolume: '       108'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3024655
month: '01'
oa: 1
oa_version: Submitted Version
page: E9 - E10
pmid: 1
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '3244'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Enveloping cell layer differentiation at the surface of zebrafish germ layer
  tissue explants
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 108
year: '2011'
...
---
_id: '3373'
abstract:
- lang: eng
  text: The use of optical traps to measure or apply forces on the molecular level
    requires a precise knowledge of the trapping force field. Close to the trap center,
    this field is typically approximated as linear in the displacement of the trapped
    microsphere. However, applications demanding high forces at low laser intensities
    can probe the light-microsphere interaction beyond the linear regime. Here, we
    measured the full nonlinear force and displacement response of an optical trap
    in two dimensions using a dual-beam optical trap setup with back-focal-plane photodetection.
    We observed a substantial stiffening of the trap beyond the linear regime that
    depends on microsphere size, in agreement with Mie theory calculations. Surprisingly,
    we found that the linear detection range for forces exceeds the one for displacement
    by far. Our approach allows for a complete calibration of an optical trap.
article_processing_charge: No
author:
- first_name: Marcus
  full_name: Jahnel, Marcus
  last_name: Jahnel
- first_name: Martin
  full_name: Behrndt, Martin
  id: 3ECECA3A-F248-11E8-B48F-1D18A9856A87
  last_name: Behrndt
- first_name: Anita
  full_name: Jannasch, Anita
  last_name: Jannasch
- first_name: Erik
  full_name: Schaeffer, Erik
  last_name: Schaeffer
- first_name: Stephan
  full_name: Grill, Stephan
  last_name: Grill
citation:
  ama: Jahnel M, Behrndt M, Jannasch A, Schaeffer E, Grill S. Measuring the complete
    force field of an optical trap. <i>Optics Letters</i>. 2011;36(7):1260-1262. doi:<a
    href="https://doi.org/10.1364/OL.36.001260">10.1364/OL.36.001260</a>
  apa: Jahnel, M., Behrndt, M., Jannasch, A., Schaeffer, E., &#38; Grill, S. (2011).
    Measuring the complete force field of an optical trap. <i>Optics Letters</i>.
    Optica Publishing Group. <a href="https://doi.org/10.1364/OL.36.001260">https://doi.org/10.1364/OL.36.001260</a>
  chicago: Jahnel, Marcus, Martin Behrndt, Anita Jannasch, Erik Schaeffer, and Stephan
    Grill. “Measuring the Complete Force Field of an Optical Trap.” <i>Optics Letters</i>.
    Optica Publishing Group, 2011. <a href="https://doi.org/10.1364/OL.36.001260">https://doi.org/10.1364/OL.36.001260</a>.
  ieee: M. Jahnel, M. Behrndt, A. Jannasch, E. Schaeffer, and S. Grill, “Measuring
    the complete force field of an optical trap,” <i>Optics Letters</i>, vol. 36,
    no. 7. Optica Publishing Group, pp. 1260–1262, 2011.
  ista: Jahnel M, Behrndt M, Jannasch A, Schaeffer E, Grill S. 2011. Measuring the
    complete force field of an optical trap. Optics Letters. 36(7), 1260–1262.
  mla: Jahnel, Marcus, et al. “Measuring the Complete Force Field of an Optical Trap.”
    <i>Optics Letters</i>, vol. 36, no. 7, Optica Publishing Group, 2011, pp. 1260–62,
    doi:<a href="https://doi.org/10.1364/OL.36.001260">10.1364/OL.36.001260</a>.
  short: M. Jahnel, M. Behrndt, A. Jannasch, E. Schaeffer, S. Grill, Optics Letters
    36 (2011) 1260–1262.
date_created: 2018-12-11T12:02:58Z
date_published: 2011-03-30T00:00:00Z
date_updated: 2026-07-29T10:07:18Z
day: '30'
ddc:
- '570'
department:
- _id: CaHe
doi: 10.1364/OL.36.001260
external_id:
  isi:
  - '000289251000080'
fulldoi: https://doi.org/10.1364/OL.36.001260
intvolume: '        36'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.osapublishing.org/ol/abstract.cfm?uri=ol-36-7-1260
month: '03'
oa: 1
oa_version: Published Version
page: 1260 - 1262
publication: Optics Letters
publication_status: published
publisher: Optica Publishing Group
publist_id: '3234'
quality_controlled: '1'
related_material:
  record:
  - id: '1403'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Measuring the complete force field of an optical trap
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2011'
...
---
_id: '3393'
abstract:
- lang: eng
  text: 'Unlike unconditionally advantageous “Fisherian” variants that tend to spread
    throughout a species range once introduced anywhere, “bistable” variants, such
    as chromosome translocations, have two alternative stable frequencies, absence
    and (near) fixation. Analogous to populations with Allee effects, bistable variants
    tend to increase locally only once they become sufficiently common, and their
    spread depends on their rate of increase averaged over all frequencies. Several
    proposed manipulations of insect populations, such as using Wolbachia or “engineered
    underdominance” to suppress vector-borne diseases, produce bistable rather than
    Fisherian dynamics. We synthesize and extend theoretical analyses concerning three
    features of their spatial behavior: rate of spread, conditions to initiate spread
    from a localized introduction, and wave stopping caused by variation in population
    densities or dispersal rates. Unlike Fisherian variants, bistable variants tend
    to spread spatially only for particular parameter combinations and initial conditions.
    Wave initiation requires introduction over an extended region, while subsequent
    spatial spread is slower than for Fisherian waves and can easily be halted by
    local spatial inhomogeneities. We present several new results, including robust
    sufficient conditions to initiate (and stop) spread, using a one-parameter cubic
    approximation applicable to several models. The results have both basic and applied
    implications.'
article_processing_charge: No
article_type: original
author:
- first_name: Nicholas H
  full_name: Barton, Nicholas H
  id: 4880FE40-F248-11E8-B48F-1D18A9856A87
  last_name: Barton
  orcid: 0000-0002-8548-5240
- first_name: Michael
  full_name: Turelli, Michael
  last_name: Turelli
citation:
  ama: 'Barton NH, Turelli M. Spatial waves of advance with bistable dynamics: Cytoplasmic
    and genetic analogues of Allee effects. <i>American Naturalist</i>. 2011;178(3):E48-E75.
    doi:<a href="https://doi.org/10.1086/661246">10.1086/661246</a>'
  apa: 'Barton, N. H., &#38; Turelli, M. (2011). Spatial waves of advance with bistable
    dynamics: Cytoplasmic and genetic analogues of Allee effects. <i>American Naturalist</i>.
    University of Chicago Press. <a href="https://doi.org/10.1086/661246">https://doi.org/10.1086/661246</a>'
  chicago: 'Barton, Nicholas H, and Michael Turelli. “Spatial Waves of Advance with
    Bistable Dynamics: Cytoplasmic and Genetic Analogues of Allee Effects.” <i>American
    Naturalist</i>. University of Chicago Press, 2011. <a href="https://doi.org/10.1086/661246">https://doi.org/10.1086/661246</a>.'
  ieee: 'N. H. Barton and M. Turelli, “Spatial waves of advance with bistable dynamics:
    Cytoplasmic and genetic analogues of Allee effects,” <i>American Naturalist</i>,
    vol. 178, no. 3. University of Chicago Press, pp. E48–E75, 2011.'
  ista: 'Barton NH, Turelli M. 2011. Spatial waves of advance with bistable dynamics:
    Cytoplasmic and genetic analogues of Allee effects. American Naturalist. 178(3),
    E48–E75.'
  mla: 'Barton, Nicholas H., and Michael Turelli. “Spatial Waves of Advance with Bistable
    Dynamics: Cytoplasmic and Genetic Analogues of Allee Effects.” <i>American Naturalist</i>,
    vol. 178, no. 3, University of Chicago Press, 2011, pp. E48–75, doi:<a href="https://doi.org/10.1086/661246">10.1086/661246</a>.'
  short: N.H. Barton, M. Turelli, American Naturalist 178 (2011) E48–E75.
date_created: 2018-12-11T12:03:05Z
date_published: 2011-09-01T00:00:00Z
date_updated: 2026-08-04T09:17:38Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1086/661246
external_id:
  isi:
  - '000294256800001'
file:
- access_level: open_access
  checksum: 7fd22a2ef3321a6fca6a439b3be5d8f4
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:08:31Z
  date_updated: 2020-07-14T12:46:11Z
  file_id: '4692'
  file_name: IST-2016-554-v1+1_BartonTurelli2011_copy.pdf
  file_size: 629130
  relation: main_file
file_date_updated: 2020-07-14T12:46:11Z
fulldoi: https://doi.org/10.1086/661246
has_accepted_license: '1'
intvolume: '       178'
isi: 1
issue: '3'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: E48 - E75
publication: American Naturalist
publication_identifier:
  eissn:
  - 1537-5323
  issn:
  - 0003-0147
publication_status: published
publisher: University of Chicago Press
publist_id: '3214'
pubrep_id: '554'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Spatial waves of advance with bistable dynamics: Cytoplasmic and genetic analogues
  of Allee effects'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 178
year: '2011'
...
---
_id: '3375'
abstract:
- lang: eng
  text: 'By exploiting an analogy between population genetics and statistical mechanics,
    we study the evolution of a polygenic trait under stabilizing selection, mutation
    and genetic drift. This requires us to track only four macroscopic variables,
    instead of the distribution of all the allele frequencies that influence the trait.
    These macroscopic variables are the expectations of: the trait mean and its square,
    the genetic variance, and of a measure of heterozygosity, and are derived from
    a generating function that is in turn derived by maximizing an entropy measure.
    These four macroscopics are enough to accurately describe the dynamics of the
    trait mean and of its genetic variance (and in principle of any other quantity).
    Unlike previous approaches that were based on an infinite series of moments or
    cumulants, which had to be truncated arbitrarily, our calculations provide a well-defined
    approximation procedure. We apply the framework to abrupt and gradual changes
    in the optimum, as well as to changes in the strength of stabilizing selection.
    Our approximations are surprisingly accurate, even for systems with as few as
    five loci. We find that when the effects of drift are included, the expected genetic
    variance is hardly altered by directional selection, even though it fluctuates
    in any particular instance. We also find hysteresis, showing that even after averaging
    over the microscopic variables, the macroscopic trajectories retain a memory of
    the underlying genetic states.'
article_processing_charge: No
article_type: original
author:
- first_name: Harold
  full_name: de Vladar, Harold
  id: 2A181218-F248-11E8-B48F-1D18A9856A87
  last_name: de Vladar
  orcid: 0000-0002-5985-7653
- first_name: Nicholas H
  full_name: Barton, Nicholas H
  id: 4880FE40-F248-11E8-B48F-1D18A9856A87
  last_name: Barton
  orcid: 0000-0002-8548-5240
citation:
  ama: de Vladar H, Barton NH. The statistical mechanics of a polygenic character
    under stabilizing selection mutation and drift. <i>Journal of the Royal Society
    Interface</i>. 2011;8(58):720-739. doi:<a href="https://doi.org/10.1098/rsif.2010.0438">10.1098/rsif.2010.0438</a>
  apa: de Vladar, H., &#38; Barton, N. H. (2011). The statistical mechanics of a polygenic
    character under stabilizing selection mutation and drift. <i>Journal of the Royal
    Society Interface</i>. Royal Society. <a href="https://doi.org/10.1098/rsif.2010.0438">https://doi.org/10.1098/rsif.2010.0438</a>
  chicago: Vladar, Harold de, and Nicholas H Barton. “The Statistical Mechanics of
    a Polygenic Character under Stabilizing Selection Mutation and Drift.” <i>Journal
    of the Royal Society Interface</i>. Royal Society, 2011. <a href="https://doi.org/10.1098/rsif.2010.0438">https://doi.org/10.1098/rsif.2010.0438</a>.
  ieee: H. de Vladar and N. H. Barton, “The statistical mechanics of a polygenic character
    under stabilizing selection mutation and drift,” <i>Journal of the Royal Society
    Interface</i>, vol. 8, no. 58. Royal Society, pp. 720–739, 2011.
  ista: de Vladar H, Barton NH. 2011. The statistical mechanics of a polygenic character
    under stabilizing selection mutation and drift. Journal of the Royal Society Interface.
    8(58), 720–739.
  mla: de Vladar, Harold, and Nicholas H. Barton. “The Statistical Mechanics of a
    Polygenic Character under Stabilizing Selection Mutation and Drift.” <i>Journal
    of the Royal Society Interface</i>, vol. 8, no. 58, Royal Society, 2011, pp. 720–39,
    doi:<a href="https://doi.org/10.1098/rsif.2010.0438">10.1098/rsif.2010.0438</a>.
  short: H. de Vladar, N.H. Barton, Journal of the Royal Society Interface 8 (2011)
    720–739.
corr_author: '1'
date_created: 2018-12-11T12:02:58Z
date_published: 2011-05-01T00:00:00Z
date_updated: 2026-08-12T14:07:44Z
day: '01'
department:
- _id: NiBa
doi: 10.1098/rsif.2010.0438
ec_funded: 1
external_id:
  isi:
  - '000289671700011'
  pmid:
  - '21084341'
fulldoi: https://doi.org/10.1098/rsif.2010.0438
intvolume: '         8'
isi: 1
issue: '58'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3061091/
month: '05'
oa: 1
oa_version: Submitted Version
page: 720 - 739
pmid: 1
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '250152'
  name: Limits to selection in biology and in evolutionary computation
publication: Journal of the Royal Society Interface
publication_status: published
publisher: Royal Society
publist_id: '3232'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The statistical mechanics of a polygenic character under stabilizing selection
  mutation and drift
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2011'
...
---
_id: '10908'
abstract:
- lang: eng
  text: We present ABC, a software tool for automatically computing symbolic upper
    bounds on the number of iterations of nested program loops. The system combines
    static analysis of programs with symbolic summation techniques to derive loop
    invariant relations between program variables. Iteration bounds are obtained from
    the inferred invariants, by replacing variables with bounds on their greatest
    values. We have successfully applied ABC to a large number of examples. The derived
    symbolic bounds express non-trivial polynomial relations over loop variables.
    We also report on results to automatically infer symbolic expressions over harmonic
    numbers as upper bounds on loop iteration counts.
acknowledgement: This work was supported in part by the Swiss NSF. The fourth author
  is supported by an FWF Hertha Firnberg Research grant (T425-N23).
article_processing_charge: No
author:
- first_name: Régis
  full_name: Blanc, Régis
  last_name: Blanc
- 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: Thibaud
  full_name: Hottelier, Thibaud
  last_name: Hottelier
- first_name: Laura
  full_name: Kovács, Laura
  last_name: Kovács
citation:
  ama: 'Blanc R, Henzinger TA, Hottelier T, Kovács L. ABC: Algebraic Bound Computation
    for loops. In: Clarke EM, Voronkov A, eds. <i>Logic for Programming, Artificial
    Intelligence, and Reasoning</i>. Vol 6355. LNCS. Berlin, Heidelberg: Springer
    Nature; 2010:103-118. doi:<a href="https://doi.org/10.1007/978-3-642-17511-4_7">10.1007/978-3-642-17511-4_7</a>'
  apa: 'Blanc, R., Henzinger, T. A., Hottelier, T., &#38; Kovács, L. (2010). ABC:
    Algebraic Bound Computation for loops. In E. M. Clarke &#38; A. Voronkov (Eds.),
    <i>Logic for Programming, Artificial Intelligence, and Reasoning</i> (Vol. 6355,
    pp. 103–118). Berlin, Heidelberg: Springer Nature. <a href="https://doi.org/10.1007/978-3-642-17511-4_7">https://doi.org/10.1007/978-3-642-17511-4_7</a>'
  chicago: 'Blanc, Régis, Thomas A Henzinger, Thibaud Hottelier, and Laura Kovács.
    “ABC: Algebraic Bound Computation for Loops.” In <i>Logic for Programming, Artificial
    Intelligence, and Reasoning</i>, edited by Edmund M Clarke and Andrei Voronkov,
    6355:103–18. LNCS. Berlin, Heidelberg: Springer Nature, 2010. <a href="https://doi.org/10.1007/978-3-642-17511-4_7">https://doi.org/10.1007/978-3-642-17511-4_7</a>.'
  ieee: 'R. Blanc, T. A. Henzinger, T. Hottelier, and L. Kovács, “ABC: Algebraic Bound
    Computation for loops,” in <i>Logic for Programming, Artificial Intelligence,
    and Reasoning</i>, Dakar, Senegal, 2010, vol. 6355, pp. 103–118.'
  ista: 'Blanc R, Henzinger TA, Hottelier T, Kovács L. 2010. ABC: Algebraic Bound
    Computation for loops. Logic for Programming, Artificial Intelligence, and Reasoning.
    LPAR: Logic for Programming, Artificial Intelligence and ReasoningLNCS vol. 6355,
    103–118.'
  mla: 'Blanc, Régis, et al. “ABC: Algebraic Bound Computation for Loops.” <i>Logic
    for Programming, Artificial Intelligence, and Reasoning</i>, edited by Edmund
    M Clarke and Andrei Voronkov, vol. 6355, Springer Nature, 2010, pp. 103–18, doi:<a
    href="https://doi.org/10.1007/978-3-642-17511-4_7">10.1007/978-3-642-17511-4_7</a>.'
  short: R. Blanc, T.A. Henzinger, T. Hottelier, L. Kovács, in:, E.M. Clarke, A. Voronkov
    (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning, Springer
    Nature, Berlin, Heidelberg, 2010, pp. 103–118.
conference:
  end_date: 2010-05-01
  location: Dakar, Senegal
  name: 'LPAR: Logic for Programming, Artificial Intelligence and Reasoning'
  start_date: 2010-04-25
corr_author: '1'
date_created: 2022-03-21T08:14:35Z
date_published: 2010-05-01T00:00:00Z
date_updated: 2025-09-30T09:51:13Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/978-3-642-17511-4_7
editor:
- first_name: Edmund M
  full_name: Clarke, Edmund M
  last_name: Clarke
- first_name: Andrei
  full_name: Voronkov, Andrei
  last_name: Voronkov
external_id:
  isi:
  - '000309668000007'
fulldoi: https://doi.org/10.1007/978-3-642-17511-4_7
intvolume: '      6355'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://infoscience.epfl.ch/record/186096
month: '05'
oa: 1
oa_version: Submitted Version
page: 103-118
place: Berlin, Heidelberg
publication: Logic for Programming, Artificial Intelligence, and Reasoning
publication_identifier:
  eisbn:
  - '9783642175114'
  eissn:
  - 1611-3349
  isbn:
  - '9783642175107'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: LNCS
status: public
title: 'ABC: Algebraic Bound Computation for loops'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 6355
year: '2010'
...
---
_id: '10909'
abstract:
- lang: eng
  text: We address the problem of localizing homology classes, namely, finding the
    cycle representing a given class with the most concise geometric measure. We focus
    on the volume measure, that is, the 1-norm of a cycle. Two main results are presented.
    First, we prove the problem is NP-hard to approximate within any constant factor.
    Second, we prove that for homology of dimension two or higher, the problem is
    NP-hard to approximate even when the Betti number is O(1). A side effect is the
    inapproximability of the problem of computing the nonbounding cycle with the smallest
    volume, and computing cycles representing a homology basis with the minimal total
    volume. We also discuss other geometric measures (diameter and radius) and show
    their disadvantages in homology localization. Our work is restricted to homology
    over the ℤ2 field.
acknowledgement: Partially supported by the Austrian Science Fund under grantFSP-S9103-N04
  and P20134-N13.
article_processing_charge: No
author:
- first_name: Chao
  full_name: Chen, Chao
  id: 3E92416E-F248-11E8-B48F-1D18A9856A87
  last_name: Chen
- first_name: Daniel
  full_name: Freedman, Daniel
  last_name: Freedman
citation:
  ama: 'Chen C, Freedman D. Hardness results for homology localization. In: <i>Proceedings
    of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for
    Industrial and Applied Mathematics; 2010:1594-1604. doi:<a href="https://doi.org/10.1137/1.9781611973075.129">10.1137/1.9781611973075.129</a>'
  apa: 'Chen, C., &#38; Freedman, D. (2010). Hardness results for homology localization.
    In <i>Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms</i>
    (pp. 1594–1604). Austin, TX, United States: Society for Industrial and Applied
    Mathematics. <a href="https://doi.org/10.1137/1.9781611973075.129">https://doi.org/10.1137/1.9781611973075.129</a>'
  chicago: Chen, Chao, and Daniel Freedman. “Hardness Results for Homology Localization.”
    In <i>Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms</i>,
    1594–1604. Society for Industrial and Applied Mathematics, 2010. <a href="https://doi.org/10.1137/1.9781611973075.129">https://doi.org/10.1137/1.9781611973075.129</a>.
  ieee: C. Chen and D. Freedman, “Hardness results for homology localization,” in
    <i>Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms</i>,
    Austin, TX, United States, 2010, pp. 1594–1604.
  ista: 'Chen C, Freedman D. 2010. Hardness results for homology localization. Proceedings
    of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium
    on Discrete Algorithms, 1594–1604.'
  mla: Chen, Chao, and Daniel Freedman. “Hardness Results for Homology Localization.”
    <i>Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms</i>,
    Society for Industrial and Applied Mathematics, 2010, pp. 1594–604, doi:<a href="https://doi.org/10.1137/1.9781611973075.129">10.1137/1.9781611973075.129</a>.
  short: C. Chen, D. Freedman, in:, Proceedings of the 2010 Annual ACM-SIAM Symposium
    on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2010,
    pp. 1594–1604.
conference:
  end_date: 2010-01-19
  location: Austin, TX, United States
  name: 'SODA: Symposium on Discrete Algorithms'
  start_date: 2010-01-17
corr_author: '1'
date_created: 2022-03-21T08:24:07Z
date_published: 2010-02-01T00:00:00Z
date_updated: 2025-09-30T09:22:32Z
day: '01'
department:
- _id: HeEd
doi: 10.1137/1.9781611973075.129
fulldoi: https://doi.org/10.1137/1.9781611973075.129
language:
- iso: eng
month: '02'
oa_version: None
page: 1594-1604
publication: Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
  eisbn:
  - '9781611973075'
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
related_material:
  record:
  - id: '3267'
    relation: later_version
    status: public
scopus_import: '1'
status: public
title: Hardness results for homology localization
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2010'
...
---
_id: '2409'
abstract:
- lang: eng
  text: "Background: The availability of many gene alignments with overlapping taxon
    sets raises the question of which strategy is the best to infer species phylogenies
    from multiple gene information. Methods and programs abound that use the gene
    alignment in different ways to reconstruct the species tree. In particular, different
    methods combine the original data at different points along the way from the underlying
    sequences to the final tree. Accordingly, they are classified into superalignment,
    supertree and medium-level approaches. Here, we present a simulation study to
    compare different methods from each of these three approaches.\r\n\r\nResults:
    We observe that superalignment methods usually outperform the other approaches
    over a wide range of parameters including sparse data and gene-specific evolutionary
    parameters. In the presence of high incongruency among gene trees, however, other
    combination methods show better performance than the superalignment approach.
    Surprisingly, some supertree and medium-level methods exhibit, on average, worse
    results than a single gene phylogeny with complete taxon information.\r\n\r\nConclusions:
    For some methods, using the reconstructed gene tree as an estimation of the species
    tree is superior to the combination of incomplete information. Superalignment
    usually performs best since it is less susceptible to stochastic error. Supertree
    methods can outperform superalignment in the presence of gene-tree conflict."
acknowledgement: Financial support from the Wiener Wissenschafts-, Forschungs- and
  Technologiefonds (WWTF) is greatly appreciated. A.v.H. acknowledges support from
  the German Research Foundation (DFG, SPP-1174).
article_number: '37'
article_processing_charge: No
author:
- first_name: Anne
  full_name: Kupczok, Anne
  id: 2BB22BC2-F248-11E8-B48F-1D18A9856A87
  last_name: Kupczok
- first_name: Heiko
  full_name: Schmidt, Heiko
  last_name: Schmidt
- first_name: Arndt
  full_name: Von Haeseler, Arndt
  last_name: Von Haeseler
citation:
  ama: Kupczok A, Schmidt H, Von Haeseler A. Accuracy of phylogeny reconstruction
    methods combining overlapping gene data sets. <i>Algorithms for Molecular Biology</i>.
    2010;5(1). doi:<a href="https://doi.org/10.1186/1748-7188-5-37">10.1186/1748-7188-5-37</a>
  apa: Kupczok, A., Schmidt, H., &#38; Von Haeseler, A. (2010). Accuracy of phylogeny
    reconstruction methods combining overlapping gene data sets. <i>Algorithms for
    Molecular Biology</i>. BioMed Central. <a href="https://doi.org/10.1186/1748-7188-5-37">https://doi.org/10.1186/1748-7188-5-37</a>
  chicago: Kupczok, Anne, Heiko Schmidt, and Arndt Von Haeseler. “Accuracy of Phylogeny
    Reconstruction Methods Combining Overlapping Gene Data Sets.” <i>Algorithms for
    Molecular Biology</i>. BioMed Central, 2010. <a href="https://doi.org/10.1186/1748-7188-5-37">https://doi.org/10.1186/1748-7188-5-37</a>.
  ieee: A. Kupczok, H. Schmidt, and A. Von Haeseler, “Accuracy of phylogeny reconstruction
    methods combining overlapping gene data sets,” <i>Algorithms for Molecular Biology</i>,
    vol. 5, no. 1. BioMed Central, 2010.
  ista: Kupczok A, Schmidt H, Von Haeseler A. 2010. Accuracy of phylogeny reconstruction
    methods combining overlapping gene data sets. Algorithms for Molecular Biology.
    5(1), 37.
  mla: Kupczok, Anne, et al. “Accuracy of Phylogeny Reconstruction Methods Combining
    Overlapping Gene Data Sets.” <i>Algorithms for Molecular Biology</i>, vol. 5,
    no. 1, 37, BioMed Central, 2010, doi:<a href="https://doi.org/10.1186/1748-7188-5-37">10.1186/1748-7188-5-37</a>.
  short: A. Kupczok, H. Schmidt, A. Von Haeseler, Algorithms for Molecular Biology
    5 (2010).
date_created: 2018-12-11T11:57:30Z
date_published: 2010-12-06T00:00:00Z
date_updated: 2025-09-30T09:48:29Z
day: '06'
ddc:
- '576'
department:
- _id: JoBo
doi: 10.1186/1748-7188-5-37
external_id:
  isi:
  - '000286183400001'
file:
- access_level: open_access
  checksum: e2497285388bc4da629bafb46662eb43
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:09:16Z
  date_updated: 2020-07-14T12:45:40Z
  file_id: '4739'
  file_name: IST-2018-939-v1+1_2010_Kupczok_Accuracy_of.pdf
  file_size: 723929
  relation: main_file
file_date_updated: 2020-07-14T12:45:40Z
fulldoi: https://doi.org/10.1186/1748-7188-5-37
has_accepted_license: '1'
intvolume: '         5'
isi: 1
issue: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
publication: Algorithms for Molecular Biology
publication_status: published
publisher: BioMed Central
publist_id: '4517'
pubrep_id: '939'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Accuracy of phylogeny reconstruction methods combining overlapping gene data
  sets
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 5
year: '2010'
...
---
_id: '12199'
abstract:
- lang: eng
  text: The four microsporangia of the flowering plant anther develop from archesporial
    cells in the L2 of the primordium. Within each microsporangium, developing microsporocytes
    are surrounded by concentric monolayers of tapetal, middle layer and endothecial
    cells. How this intricate array of tissues, each containing relatively few cells,
    is established in an organ possessing no formal meristems is poorly understood.
    We describe here the pivotal role of the LRR receptor kinase EXCESS MICROSPOROCYTES
    1 (EMS1) in forming the monolayer of tapetal nurse cells in Arabidopsis. Unusually
    for plants, tapetal cells are specified very early in development, and are subsequently
    stimulated to proliferate by a receptor-like kinase (RLK) complex that includes
    EMS1. Mutations in members of this EMS1 signalling complex and its putative ligand
    result in male-sterile plants in which tapetal initials fail to proliferate. Surprisingly,
    these cells continue to develop, isolated at the locular periphery. Mutant and
    wild-type microsporangia expand at similar rates and the ‘tapetal’ space at the
    periphery of mutant locules becomes occupied by microsporocytes. However, induction
    of late expression of EMS1 in the few tapetal initials in ems1 plants results
    in their proliferation to generate a functional tapetum, and this proliferation
    suppresses microsporocyte number. Our experiments also show that integrity of
    the tapetal monolayer is crucial for the maintenance of the polarity of divisions
    within it. This unexpected autonomy of the tapetal ‘lineage’ is discussed in the
    context of tissue development in complex plant organs, where constancy in size,
    shape and cell number is crucial.
acknowledgement: 'We thank the following for providing mutant lines and reagents:
  Hong Ma, De Ye, Sacco De Vries, and Rod Scott for providing the pA9::Barnase lines
  and information on A9 expression patterns. Carla Galinha and Paolo Piazza gave valuable
  help with in situ hybridisation and qRT-PCR, respectively, and we acknowledge Qing
  Zhang, Helen Prescott and Matthew Dicks for providing excellent technical assistance.
  We are indebted to Miltos Tsiantis and Angela Hay for helpful discussion, and the
  research was funded by Oxford University through a Clarendon Scholarship to X.F.,
  with additional financial support from Magdalen College (Oxford).'
article_processing_charge: No
article_type: original
author:
- first_name: Xiaoqi
  full_name: Feng, Xiaoqi
  id: e0164712-22ee-11ed-b12a-d80fcdf35958
  last_name: Feng
  orcid: 0000-0002-4008-1234
- first_name: Hugh G.
  full_name: Dickinson, Hugh G.
  last_name: Dickinson
citation:
  ama: Feng X, Dickinson HG. Tapetal cell fate, lineage and proliferation in the Arabidopsis
    anther. <i>Development</i>. 2010;137(14):2409-2416. doi:<a href="https://doi.org/10.1242/dev.049320">10.1242/dev.049320</a>
  apa: Feng, X., &#38; Dickinson, H. G. (2010). Tapetal cell fate, lineage and proliferation
    in the Arabidopsis anther. <i>Development</i>. The Company of Biologists. <a href="https://doi.org/10.1242/dev.049320">https://doi.org/10.1242/dev.049320</a>
  chicago: Feng, Xiaoqi, and Hugh G. Dickinson. “Tapetal Cell Fate, Lineage and Proliferation
    in the Arabidopsis Anther.” <i>Development</i>. The Company of Biologists, 2010.
    <a href="https://doi.org/10.1242/dev.049320">https://doi.org/10.1242/dev.049320</a>.
  ieee: X. Feng and H. G. Dickinson, “Tapetal cell fate, lineage and proliferation
    in the Arabidopsis anther,” <i>Development</i>, vol. 137, no. 14. The Company
    of Biologists, pp. 2409–2416, 2010.
  ista: Feng X, Dickinson HG. 2010. Tapetal cell fate, lineage and proliferation in
    the Arabidopsis anther. Development. 137(14), 2409–2416.
  mla: Feng, Xiaoqi, and Hugh G. Dickinson. “Tapetal Cell Fate, Lineage and Proliferation
    in the Arabidopsis Anther.” <i>Development</i>, vol. 137, no. 14, The Company
    of Biologists, 2010, pp. 2409–16, doi:<a href="https://doi.org/10.1242/dev.049320">10.1242/dev.049320</a>.
  short: X. Feng, H.G. Dickinson, Development 137 (2010) 2409–2416.
date_created: 2023-01-16T09:21:54Z
date_published: 2010-07-15T00:00:00Z
date_updated: 2023-05-08T10:57:11Z
day: '15'
department:
- _id: XiFe
doi: 10.1242/dev.049320
extern: '1'
external_id:
  pmid:
  - '20570940'
fulldoi: https://doi.org/10.1242/dev.049320
intvolume: '       137'
issue: '14'
keyword:
- Developmental Biology
- Molecular Biology
- Anther Tapetum
- Arabidopsis
- Cell Fate Establishment
- EMS1
- Reproductive Cell Lineage
language:
- iso: eng
month: '07'
oa_version: None
page: 2409-2416
pmid: 1
publication: Development
publication_identifier:
  issn:
  - 1477-9129
  - 0950-1991
publication_status: published
publisher: The Company of Biologists
quality_controlled: '1'
scopus_import: '1'
status: public
title: Tapetal cell fate, lineage and proliferation in the Arabidopsis anther
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 137
year: '2010'
...
---
_id: '12200'
abstract:
- lang: eng
  text: Key steps in the evolution of the angiosperm anther include the patterning
    of the concentrically organized microsporangium and the incorporation of four
    such microsporangia into a leaf-like structure. Mutant studies in the model plant
    Arabidopsis thaliana are leading to an increasingly accurate picture of (i) the
    cell lineages culminating in the different cell types present in the microsporangium
    (the microsporocytes, the tapetum, and the middle and endothecial layers), and
    (ii) some of the genes responsible for specifying their fates. However, the processes
    that confer polarity on the developing anther and position the microsporangia
    within it remain unclear. Certainly, data from a range of experimental strategies
    suggest that hormones play a central role in establishing polarity and the patterning
    of the anther initial, and may be responsible for locating the microsporangia.
    But the fact that microsporangia were originally positioned externally suggests
    that their development is likely to be autonomous, perhaps with the reproductive
    cells generating signals controlling the growth and division of the investing
    anther epidermis. These possibilities are discussed in the context of the expression
    of genes which initiate and maintain male and female reproductive development,
    and in the perspective of our current views of anther evolution.
article_processing_charge: No
article_type: original
author:
- first_name: Xiaoqi
  full_name: Feng, Xiaoqi
  id: e0164712-22ee-11ed-b12a-d80fcdf35958
  last_name: Feng
  orcid: 0000-0002-4008-1234
- first_name: Hugh G.
  full_name: Dickinson, Hugh G.
  last_name: Dickinson
citation:
  ama: Feng X, Dickinson HG. Cell–cell interactions during patterning of the <i>Arabidopsis</i>
    anther. <i>Biochemical Society Transactions</i>. 2010;38(2):571-576. doi:<a href="https://doi.org/10.1042/bst0380571">10.1042/bst0380571</a>
  apa: Feng, X., &#38; Dickinson, H. G. (2010). Cell–cell interactions during patterning
    of the <i>Arabidopsis</i> anther. <i>Biochemical Society Transactions</i>. Portland
    Press Ltd. <a href="https://doi.org/10.1042/bst0380571">https://doi.org/10.1042/bst0380571</a>
  chicago: Feng, Xiaoqi, and Hugh G. Dickinson. “Cell–Cell Interactions during Patterning
    of the <i>Arabidopsis</i> Anther.” <i>Biochemical Society Transactions</i>. Portland
    Press Ltd., 2010. <a href="https://doi.org/10.1042/bst0380571">https://doi.org/10.1042/bst0380571</a>.
  ieee: X. Feng and H. G. Dickinson, “Cell–cell interactions during patterning of
    the <i>Arabidopsis</i> anther,” <i>Biochemical Society Transactions</i>, vol.
    38, no. 2. Portland Press Ltd., pp. 571–576, 2010.
  ista: Feng X, Dickinson HG. 2010. Cell–cell interactions during patterning of the
    <i>Arabidopsis</i> anther. Biochemical Society Transactions. 38(2), 571–576.
  mla: Feng, Xiaoqi, and Hugh G. Dickinson. “Cell–Cell Interactions during Patterning
    of the <i>Arabidopsis</i> Anther.” <i>Biochemical Society Transactions</i>, vol.
    38, no. 2, Portland Press Ltd., 2010, pp. 571–76, doi:<a href="https://doi.org/10.1042/bst0380571">10.1042/bst0380571</a>.
  short: X. Feng, H.G. Dickinson, Biochemical Society Transactions 38 (2010) 571–576.
date_created: 2023-01-16T09:22:18Z
date_published: 2010-03-22T00:00:00Z
date_updated: 2023-05-08T10:57:59Z
day: '22'
department:
- _id: XiFe
doi: 10.1042/bst0380571
extern: '1'
external_id:
  pmid:
  - '20298223'
fulldoi: https://doi.org/10.1042/bst0380571
intvolume: '        38'
issue: '2'
keyword:
- Biochemistry
- Anther Development
- Arabidopsis
- Cell Fate
- Microsporangium
- Polarity
- Receptor Kinase
language:
- iso: eng
month: '03'
oa_version: None
page: 571-576
pmid: 1
publication: Biochemical Society Transactions
publication_identifier:
  issn:
  - 0300-5127
  - 1470-8752
publication_status: published
publisher: Portland Press Ltd.
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cell–cell interactions during patterning of the <i>Arabidopsis</i> anther
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 38
year: '2010'
...
---
_id: '14983'
abstract:
- lang: eng
  text: 'This chapter tackles a difficult challenge: presenting signal processing
    material to non-experts. This chapter is meant to be comprehensible to people
    who have some math background, including a course in linear algebra and basic
    statistics, but do not specialize in mathematics, engineering, or related fields.
    Some formulas assume the reader is familiar with matrices and basic matrix operations,
    but not more advanced material. Furthermore, we tried to make the chapter readable
    even if you skip the formulas. Nevertheless, we include some simple methods to
    demonstrate the basics of adaptive data processing, then we proceed with some
    advanced methods that are fundamental in adaptive signal processing, and are likely
    to be useful in a variety of applications. The advanced algorithms are also online
    available [30]. In the second part, these techniques are applied to some real-world
    BCI data.'
acknowledgement: This work was supported by the EU grants “BrainCom” (FP6-2004-Mobility-5
  Grant No 024259) and “Multi-adaptive BCI” (MEIF-CT-2006 Grant No 040666). Furthermore,
  we thank Matthias Krauledat for fruitful discussions and tools for generating Fig.
  5.
alternative_title:
- The Frontiers Collection
article_processing_charge: No
author:
- first_name: Alois
  full_name: Schlögl, Alois
  id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
  last_name: Schlögl
  orcid: 0000-0002-5621-8100
- first_name: Carmen
  full_name: Vidaurre, Carmen
  last_name: Vidaurre
- first_name: Klaus-Robert
  full_name: Müller, Klaus-Robert
  last_name: Müller
citation:
  ama: 'Schlögl A, Vidaurre C, Müller K-R. Adaptive Methods in BCI Research - An Introductory
    Tutorial. In: Graimann B, Pfurtscheller G, Allison B, eds. <i>Brain-Computer Interfaces</i>.
    1st ed. FRONTCOLL. Berlin, Heidelberg: Springer; 2010:331-355. doi:<a href="https://doi.org/10.1007/978-3-642-02091-9_18">10.1007/978-3-642-02091-9_18</a>'
  apa: 'Schlögl, A., Vidaurre, C., &#38; Müller, K.-R. (2010). Adaptive Methods in
    BCI Research - An Introductory Tutorial. In B. Graimann, G. Pfurtscheller, &#38;
    B. Allison (Eds.), <i>Brain-Computer Interfaces</i> (1st ed., pp. 331–355). Berlin,
    Heidelberg: Springer. <a href="https://doi.org/10.1007/978-3-642-02091-9_18">https://doi.org/10.1007/978-3-642-02091-9_18</a>'
  chicago: 'Schlögl, Alois, Carmen Vidaurre, and Klaus-Robert Müller. “Adaptive Methods
    in BCI Research - An Introductory Tutorial.” In <i>Brain-Computer Interfaces</i>,
    edited by Bernhard Graimann, Gert Pfurtscheller, and Brendan Allison, 1st ed.,
    331–55. FRONTCOLL. Berlin, Heidelberg: Springer, 2010. <a href="https://doi.org/10.1007/978-3-642-02091-9_18">https://doi.org/10.1007/978-3-642-02091-9_18</a>.'
  ieee: 'A. Schlögl, C. Vidaurre, and K.-R. Müller, “Adaptive Methods in BCI Research
    - An Introductory Tutorial,” in <i>Brain-Computer Interfaces</i>, 1st ed., B.
    Graimann, G. Pfurtscheller, and B. Allison, Eds. Berlin, Heidelberg: Springer,
    2010, pp. 331–355.'
  ista: 'Schlögl A, Vidaurre C, Müller K-R. 2010.Adaptive Methods in BCI Research
    - An Introductory Tutorial. In: Brain-Computer Interfaces. The Frontiers Collection,
    , 331–355.'
  mla: Schlögl, Alois, et al. “Adaptive Methods in BCI Research - An Introductory
    Tutorial.” <i>Brain-Computer Interfaces</i>, edited by Bernhard Graimann et al.,
    1st ed., Springer, 2010, pp. 331–55, doi:<a href="https://doi.org/10.1007/978-3-642-02091-9_18">10.1007/978-3-642-02091-9_18</a>.
  short: A. Schlögl, C. Vidaurre, K.-R. Müller, in:, B. Graimann, G. Pfurtscheller,
    B. Allison (Eds.), Brain-Computer Interfaces, 1st ed., Springer, Berlin, Heidelberg,
    2010, pp. 331–355.
corr_author: '1'
date_created: 2024-02-14T09:56:00Z
date_published: 2010-09-06T00:00:00Z
date_updated: 2024-10-21T06:03:06Z
day: '06'
department:
- _id: ScienComp
doi: 10.1007/978-3-642-02091-9_18
edition: '1'
editor:
- first_name: Bernhard
  full_name: Graimann, Bernhard
  last_name: Graimann
- first_name: Gert
  full_name: Pfurtscheller, Gert
  last_name: Pfurtscheller
- first_name: Brendan
  full_name: Allison, Brendan
  last_name: Allison
fulldoi: https://doi.org/10.1007/978-3-642-02091-9_18
language:
- iso: eng
month: '09'
oa_version: None
page: 331-355
place: Berlin, Heidelberg
publication: Brain-Computer Interfaces
publication_identifier:
  eisbn:
  - '9783642020919'
  isbn:
  - '9783642020902'
  issn:
  - 1612-3018
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
series_title: FRONTCOLL
status: public
title: Adaptive Methods in BCI Research - An Introductory Tutorial
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2010'
...
