---
_id: '5390'
abstract:
- lang: eng
text: The class of ω regular languages provide a robust specification language in
verification. Every ω-regular condition can be decomposed into a safety part and
a liveness part. The liveness part ensures that something good happens “eventually.”
Two main strengths of the classical, infinite-limit formulation of liveness are
robustness (independence from the granularity of transitions) and simplicity (abstraction
of complicated time bounds). However, the classical liveness formulation suffers
from the drawback that the time until something good happens may be unbounded.
A stronger formulation of liveness, so-called finitary liveness, overcomes this
drawback, while still retaining robustness and simplicity. Finitary liveness requires
that there exists an unknown, fixed bound b such that something good happens within
b transitions. In this work we consider the finitary parity and Streett (fairness)
conditions. We present the topological, automata-theoretic and logical characterization
of finitary languages defined by finitary parity and Streett conditions. We (a)
show that the finitary parity and Streett languages are Σ2-complete; (b) present
a complete characterization of the expressive power of various classes of automata
with finitary and infinitary conditions (in particular we show that non-deterministic
finitary parity and Streett automata cannot be determinized to deterministic finitary
parity or Streett automata); and (c) show that the languages defined by non-deterministic
finitary parity automata exactly characterize the star-free fragment of ωB-regular
languages.
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: Nathanaël
full_name: Fijalkow, Nathanaël
last_name: Fijalkow
citation:
ama: Chatterjee K, Fijalkow N. Topological, Automata-Theoretic and Logical Characterization
of Finitary Languages. IST Austria; 2010. doi:10.15479/AT:IST-2010-0002
apa: Chatterjee, K., & Fijalkow, N. (2010). Topological, automata-theoretic
and logical characterization of finitary languages. IST Austria. https://doi.org/10.15479/AT:IST-2010-0002
chicago: Chatterjee, Krishnendu, and Nathanaël Fijalkow. Topological, Automata-Theoretic
and Logical Characterization of Finitary Languages. IST Austria, 2010. https://doi.org/10.15479/AT:IST-2010-0002.
ieee: K. Chatterjee and N. Fijalkow, Topological, automata-theoretic and logical
characterization of finitary languages. IST Austria, 2010.
ista: Chatterjee K, Fijalkow N. 2010. Topological, automata-theoretic and logical
characterization of finitary languages, IST Austria, 21p.
mla: Chatterjee, Krishnendu, and Nathanaël Fijalkow. Topological, Automata-Theoretic
and Logical Characterization of Finitary Languages. IST Austria, 2010, doi:10.15479/AT:IST-2010-0002.
short: K. Chatterjee, N. Fijalkow, Topological, Automata-Theoretic and Logical Characterization
of Finitary Languages, IST Austria, 2010.
date_created: 2018-12-12T11:39:03Z
date_published: 2010-06-04T00:00:00Z
date_updated: 2020-07-14T23:04:41Z
day: '04'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2010-0002
file:
- access_level: open_access
checksum: 283d3604d76dd4d5161585d4c8625fbe
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:10Z
date_updated: 2020-07-14T12:46:43Z
file_id: '5532'
file_name: IST-2010-0002_IST-2010-0002.pdf
file_size: 395662
relation: main_file
file_date_updated: 2020-07-14T12:46:43Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '21'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '26'
status: public
title: Topological, automata-theoretic and logical characterization of finitary languages
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2010'
...
---
_id: '5391'
abstract:
- lang: eng
text: Concurrent data structures with fine-grained synchronization are notoriously
difficult to implement correctly. The difficulty of reasoning about these implementations
does not stem from the number of variables or the program size, but rather from
the large number of possible interleavings. These implementations are therefore
prime candidates for model checking. We introduce an algorithm for verifying linearizability
of singly-linked heap-based concurrent data structures. We consider a model consisting
of an unbounded heap where each node consists an element from an unbounded data
domain, with a restricted set of operations for testing and updating pointers
and data elements. Our main result is that linearizability is decidable for programs
that invoke a fixed number of methods, possibly in parallel. This decidable fragment
covers many of the common implementation techniques — fine-grained locking, lazy
synchronization, and lock-free synchronization. We also show how the technique
can be used to verify optimistic implementations with the help of programmer annotations.
We developed a verification tool CoLT and evaluated it on a representative sample
of Java implementations of the concurrent set data structure. The tool verified
linearizability of a number of implementations, found a known error in a lock-free
imple- mentation and proved that the corrected version is linearizable.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- first_name: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
- first_name: Damien
full_name: Zufferey, Damien
id: 4397AC76-F248-11E8-B48F-1D18A9856A87
last_name: Zufferey
orcid: 0000-0002-3197-8736
- first_name: Swarat
full_name: Chaudhuri, Swarat
last_name: Chaudhuri
- first_name: Rajeev
full_name: Alur, Rajeev
last_name: Alur
citation:
ama: Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. Model Checking
of Linearizability of Concurrent List Implementations. IST Austria; 2010.
doi:10.15479/AT:IST-2010-0001
apa: Cerny, P., Radhakrishna, A., Zufferey, D., Chaudhuri, S., & Alur, R. (2010).
Model checking of linearizability of concurrent list implementations. IST
Austria. https://doi.org/10.15479/AT:IST-2010-0001
chicago: Cerny, Pavol, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri, and
Rajeev Alur. Model Checking of Linearizability of Concurrent List Implementations.
IST Austria, 2010. https://doi.org/10.15479/AT:IST-2010-0001.
ieee: P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, and R. Alur, Model
checking of linearizability of concurrent list implementations. IST Austria,
2010.
ista: Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. 2010. Model checking
of linearizability of concurrent list implementations, IST Austria, 27p.
mla: Cerny, Pavol, et al. Model Checking of Linearizability of Concurrent List
Implementations. IST Austria, 2010, doi:10.15479/AT:IST-2010-0001.
short: P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, R. Alur, Model Checking
of Linearizability of Concurrent List Implementations, IST Austria, 2010.
date_created: 2018-12-12T11:39:04Z
date_published: 2010-04-19T00:00:00Z
date_updated: 2023-02-23T12:09:09Z
day: '19'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.15479/AT:IST-2010-0001
file:
- access_level: open_access
checksum: 986645caad7dd85a6a091488f6c646dc
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:44Z
date_updated: 2020-07-14T12:46:43Z
file_id: '5505'
file_name: IST-2010-0001_IST-2010-0001.pdf
file_size: 372286
relation: main_file
file_date_updated: 2020-07-14T12:46:43Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '27'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '27'
related_material:
record:
- id: '4390'
relation: later_version
status: public
status: public
title: Model checking of linearizability of concurrent list implementations
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2010'
...
---
_id: '9452'
abstract:
- lang: eng
text: Eukaryotic cytosine methylation represses transcription but also occurs in
the bodies of active genes, and the extent of methylation biology conservation
is unclear. We quantified DNA methylation in 17 eukaryotic genomes and found that
gene body methylation is conserved between plants and animals, whereas selective
methylation of transposons is not. We show that methylation of plant transposons
in the CHG context extends to green algae and that exclusion of histone H2A.Z
from methylated DNA is conserved between plants and animals, and we present evidence
for RNA-directed DNA methylation of fungal genes. Our data demonstrate that extant
DNA methylation systems are mosaics of conserved and derived features, and indicate
that gene body methylation is an ancient property of eukaryotic genomes.
article_processing_charge: No
article_type: original
author:
- first_name: 'Assaf '
full_name: 'Zemach, Assaf '
last_name: Zemach
- first_name: Ivy E.
full_name: McDaniel, Ivy E.
last_name: McDaniel
- first_name: Pedro
full_name: Silva, Pedro
last_name: Silva
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
citation:
ama: Zemach A, McDaniel IE, Silva P, Zilberman D. Genome-wide evolutionary analysis
of eukaryotic DNA methylation. Science. 2010;328(5980):916-919. doi:10.1126/science.1186366
apa: Zemach, A., McDaniel, I. E., Silva, P., & Zilberman, D. (2010). Genome-wide
evolutionary analysis of eukaryotic DNA methylation. Science. American
Association for the Advancement of Science. https://doi.org/10.1126/science.1186366
chicago: Zemach, Assaf , Ivy E. McDaniel, Pedro Silva, and Daniel Zilberman. “Genome-Wide
Evolutionary Analysis of Eukaryotic DNA Methylation.” Science. American
Association for the Advancement of Science, 2010. https://doi.org/10.1126/science.1186366.
ieee: A. Zemach, I. E. McDaniel, P. Silva, and D. Zilberman, “Genome-wide evolutionary
analysis of eukaryotic DNA methylation,” Science, vol. 328, no. 5980. American
Association for the Advancement of Science, pp. 916–919, 2010.
ista: Zemach A, McDaniel IE, Silva P, Zilberman D. 2010. Genome-wide evolutionary
analysis of eukaryotic DNA methylation. Science. 328(5980), 916–919.
mla: Zemach, Assaf, et al. “Genome-Wide Evolutionary Analysis of Eukaryotic DNA
Methylation.” Science, vol. 328, no. 5980, American Association for the
Advancement of Science, 2010, pp. 916–19, doi:10.1126/science.1186366.
short: A. Zemach, I.E. McDaniel, P. Silva, D. Zilberman, Science 328 (2010) 916–919.
date_created: 2021-06-04T08:26:08Z
date_published: 2010-05-14T00:00:00Z
date_updated: 2021-12-14T08:35:37Z
day: '14'
department:
- _id: DaZi
doi: 10.1126/science.1186366
extern: '1'
external_id:
pmid:
- '20395474 '
intvolume: ' 328'
issue: '5980'
keyword:
- Multidisciplinary
language:
- iso: eng
month: '05'
oa_version: None
page: 916-919
pmid: 1
publication: Science
publication_identifier:
eissn:
- 1095-9203
issn:
- 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: Genome-wide evolutionary analysis of eukaryotic DNA methylation
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 328
year: '2010'
...
---
_id: '9485'
abstract:
- lang: eng
text: 'Cytosine methylation silences transposable elements in plants, vertebrates,
and fungi but also regulates gene expression. Plant methylation is catalyzed by
three families of enzymes, each with a preferred sequence context: CG, CHG (H
= A, C, or T), and CHH, with CHH methylation targeted by the RNAi pathway. Arabidopsis
thaliana endosperm, a placenta-like tissue that nourishes the embryo, is globally
hypomethylated in the CG context while retaining high non-CG methylation. Global
methylation dynamics in seeds of cereal crops that provide the bulk of human nutrition
remain unknown. Here, we show that rice endosperm DNA is hypomethylated in all
sequence contexts. Non-CG methylation is reduced evenly across the genome, whereas
CG hypomethylation is localized. CHH methylation of small transposable elements
is increased in embryos, suggesting that endosperm demethylation enhances transposon
silencing. Genes preferentially expressed in endosperm, including those coding
for major storage proteins and starch synthesizing enzymes, are frequently hypomethylated
in endosperm, indicating that DNA methylation is a crucial regulator of rice endosperm
biogenesis. Our data show that genome-wide reshaping of seed DNA methylation is
conserved among angiosperms and has a profound effect on gene expression in cereal
crops.'
article_processing_charge: No
article_type: original
author:
- first_name: Assaf
full_name: Zemach, Assaf
last_name: Zemach
- first_name: M. Yvonne
full_name: Kim, M. Yvonne
last_name: Kim
- first_name: Pedro
full_name: Silva, Pedro
last_name: Silva
- first_name: Jessica A.
full_name: Rodrigues, Jessica A.
last_name: Rodrigues
- first_name: Bradley
full_name: Dotson, Bradley
last_name: Dotson
- first_name: Matthew D.
full_name: Brooks, Matthew D.
last_name: Brooks
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
citation:
ama: Zemach A, Kim MY, Silva P, et al. Local DNA hypomethylation activates genes
in rice endosperm. Proceedings of the National Academy of Sciences. 2010;107(43):18729-18734.
doi:10.1073/pnas.1009695107
apa: Zemach, A., Kim, M. Y., Silva, P., Rodrigues, J. A., Dotson, B., Brooks, M.
D., & Zilberman, D. (2010). Local DNA hypomethylation activates genes in rice
endosperm. Proceedings of the National Academy of Sciences. National Academy
of Sciences. https://doi.org/10.1073/pnas.1009695107
chicago: Zemach, Assaf, M. Yvonne Kim, Pedro Silva, Jessica A. Rodrigues, Bradley
Dotson, Matthew D. Brooks, and Daniel Zilberman. “Local DNA Hypomethylation Activates
Genes in Rice Endosperm.” Proceedings of the National Academy of Sciences.
National Academy of Sciences, 2010. https://doi.org/10.1073/pnas.1009695107.
ieee: A. Zemach et al., “Local DNA hypomethylation activates genes in rice
endosperm,” Proceedings of the National Academy of Sciences, vol. 107,
no. 43. National Academy of Sciences, pp. 18729–18734, 2010.
ista: Zemach A, Kim MY, Silva P, Rodrigues JA, Dotson B, Brooks MD, Zilberman D.
2010. Local DNA hypomethylation activates genes in rice endosperm. Proceedings
of the National Academy of Sciences. 107(43), 18729–18734.
mla: Zemach, Assaf, et al. “Local DNA Hypomethylation Activates Genes in Rice Endosperm.”
Proceedings of the National Academy of Sciences, vol. 107, no. 43, National
Academy of Sciences, 2010, pp. 18729–34, doi:10.1073/pnas.1009695107.
short: A. Zemach, M.Y. Kim, P. Silva, J.A. Rodrigues, B. Dotson, M.D. Brooks, D.
Zilberman, Proceedings of the National Academy of Sciences 107 (2010) 18729–18734.
date_created: 2021-06-07T09:31:01Z
date_published: 2010-10-26T00:00:00Z
date_updated: 2021-12-14T08:40:02Z
day: '26'
department:
- _id: DaZi
doi: 10.1073/pnas.1009695107
extern: '1'
external_id:
pmid:
- '20937895'
intvolume: ' 107'
issue: '43'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1073/pnas.1009695107
month: '10'
oa: 1
oa_version: Published Version
page: 18729-18734
pmid: 1
publication: Proceedings of the National Academy of Sciences
publication_identifier:
eissn:
- 1091-6490
issn:
- 0027-8424
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: Local DNA hypomethylation activates genes in rice endosperm
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 107
year: '2010'
...
---
_id: '9489'
abstract:
- lang: eng
text: Cytosine methylation is an ancient process with conserved enzymology but diverse
biological functions that include defense against transposable elements and regulation
of gene expression. Here we will discuss the evolution and biological significance
of eukaryotic DNA methylation, the likely drivers of that evolution, and major
remaining mysteries.
article_processing_charge: No
article_type: review
author:
- first_name: Assaf
full_name: Zemach, Assaf
last_name: Zemach
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
citation:
ama: Zemach A, Zilberman D. Evolution of eukaryotic DNA methylation and the pursuit
of safer sex. Current Biology. 2010;20(17):R780-R785. doi:10.1016/j.cub.2010.07.007
apa: Zemach, A., & Zilberman, D. (2010). Evolution of eukaryotic DNA methylation
and the pursuit of safer sex. Current Biology. Elsevier. https://doi.org/10.1016/j.cub.2010.07.007
chicago: Zemach, Assaf, and Daniel Zilberman. “Evolution of Eukaryotic DNA Methylation
and the Pursuit of Safer Sex.” Current Biology. Elsevier, 2010. https://doi.org/10.1016/j.cub.2010.07.007.
ieee: A. Zemach and D. Zilberman, “Evolution of eukaryotic DNA methylation and the
pursuit of safer sex,” Current Biology, vol. 20, no. 17. Elsevier, pp.
R780–R785, 2010.
ista: Zemach A, Zilberman D. 2010. Evolution of eukaryotic DNA methylation and the
pursuit of safer sex. Current Biology. 20(17), R780–R785.
mla: Zemach, Assaf, and Daniel Zilberman. “Evolution of Eukaryotic DNA Methylation
and the Pursuit of Safer Sex.” Current Biology, vol. 20, no. 17, Elsevier,
2010, pp. R780–85, doi:10.1016/j.cub.2010.07.007.
short: A. Zemach, D. Zilberman, Current Biology 20 (2010) R780–R785.
date_created: 2021-06-07T09:45:27Z
date_published: 2010-09-14T00:00:00Z
date_updated: 2021-12-14T08:52:34Z
day: '14'
department:
- _id: DaZi
doi: 10.1016/j.cub.2010.07.007
extern: '1'
external_id:
pmid:
- '20833323'
intvolume: ' 20'
issue: '17'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.cub.2010.07.007
month: '09'
oa: 1
oa_version: Published Version
page: R780-R785
pmid: 1
publication: Current Biology
publication_identifier:
eissn:
- 1879-0445
issn:
- 0960-9822
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Evolution of eukaryotic DNA methylation and the pursuit of safer sex
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 20
year: '2010'
...
---
_id: '9764'
article_processing_charge: No
author:
- first_name: Ulises
full_name: Rosas, Ulises
last_name: Rosas
- 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: Lucy
full_name: Copsey, Lucy
last_name: Copsey
- first_name: Pierre
full_name: Barbier De Reuille, Pierre
last_name: Barbier De Reuille
- first_name: Enrico
full_name: Coen, Enrico
last_name: Coen
citation:
ama: Rosas U, Barton NH, Copsey L, Barbier De Reuille P, Coen E. Heterosis and the
drift load. 2010. doi:10.1371/journal.pbio.1000429.s003
apa: Rosas, U., Barton, N. H., Copsey, L., Barbier De Reuille, P., & Coen, E.
(2010). Heterosis and the drift load. Public Library of Science. https://doi.org/10.1371/journal.pbio.1000429.s003
chicago: Rosas, Ulises, Nicholas H Barton, Lucy Copsey, Pierre Barbier De Reuille,
and Enrico Coen. “Heterosis and the Drift Load.” Public Library of Science, 2010.
https://doi.org/10.1371/journal.pbio.1000429.s003.
ieee: U. Rosas, N. H. Barton, L. Copsey, P. Barbier De Reuille, and E. Coen, “Heterosis
and the drift load.” Public Library of Science, 2010.
ista: Rosas U, Barton NH, Copsey L, Barbier De Reuille P, Coen E. 2010. Heterosis
and the drift load, Public Library of Science, 10.1371/journal.pbio.1000429.s003.
mla: Rosas, Ulises, et al. Heterosis and the Drift Load. Public Library of
Science, 2010, doi:10.1371/journal.pbio.1000429.s003.
short: U. Rosas, N.H. Barton, L. Copsey, P. Barbier De Reuille, E. Coen, (2010).
date_created: 2021-08-02T09:45:39Z
date_published: 2010-07-20T00:00:00Z
date_updated: 2023-02-23T11:42:17Z
day: '20'
department:
- _id: NiBa
doi: 10.1371/journal.pbio.1000429.s003
month: '07'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '3779'
relation: used_in_publication
status: public
status: public
title: Heterosis and the drift load
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2010'
...
---
_id: '3675'
abstract:
- lang: eng
text: "Sex and recombination have long been seen as adaptations that facilitate
natural selection by generating favorable variations. If recombination is to aid
selection, there must be negative linkage disequilibria—favorable alleles must
be found together less often than expected by chance. These negative linkage disequilibria
can be generated directly by selection, but this must involve negative epistasis
of just the right strength, which is not expected, from either experiment or theory.
Random drift provides a more general source of negative associations: Favorable
mutations almost always arise on different genomes, and negative associations
tend to persist, precisely because they shield variation from selection.\r\n\r\nWe
can understand how recombination aids adaptation by determining the maximum possible
rate of adaptation. With unlinked loci, this rate increases only logarithmically
with the influx of favorable mutations. With a linear genome, a scaling argument
shows that in a large population, the rate of adaptive substitution depends only
on the expected rate in the absence of interference, divided by the total rate
of recombination. A two-locus approximation predicts an upper bound on the rate
of substitution, proportional to recombination rate.\r\n\r\nIf associations between
linked loci do impede adaptation, there can be substantial selection for modifiers
that increase recombination. Whether this can account for the maintenance of high
rates of sex and recombination depends on the extent of selection. It is clear
that the rate of species-wide substitutions is typically far too low to generate
appreciable selection for recombination. However, local sweeps within a subdivided
population may be effective."
acknowledgement: Royal Society and the Engineering and Physical Sciences for support
(GR/ T11753/01)
author:
- 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: 'Barton NH. Why sex and recombination? . In: Cold Spring Harbor Symposia
on Quantitative Biology. Vol 74. Cold Spring Harbor Laboratory Press; 2009:187-195.
doi:10.1101/sqb.2009.74.030'
apa: Barton, N. H. (2009). Why sex and recombination? . In Cold Spring Harbor
Symposia on Quantitative Biology (Vol. 74, pp. 187–195). Cold Spring Harbor
Laboratory Press. https://doi.org/10.1101/sqb.2009.74.030
chicago: Barton, Nicholas H. “Why Sex and Recombination? .” In Cold Spring Harbor
Symposia on Quantitative Biology, 74:187–95. Cold Spring Harbor Laboratory
Press, 2009. https://doi.org/10.1101/sqb.2009.74.030.
ieee: N. H. Barton, “Why sex and recombination? ,” in Cold Spring Harbor Symposia
on Quantitative Biology, vol. 74, Cold Spring Harbor Laboratory Press, 2009,
pp. 187–195.
ista: 'Barton NH. 2009.Why sex and recombination? . In: Cold Spring Harbor Symposia
on Quantitative Biology. vol. 74, 187–195.'
mla: Barton, Nicholas H. “Why Sex and Recombination? .” Cold Spring Harbor Symposia
on Quantitative Biology, vol. 74, Cold Spring Harbor Laboratory Press, 2009,
pp. 187–95, doi:10.1101/sqb.2009.74.030.
short: N.H. Barton, in:, Cold Spring Harbor Symposia on Quantitative Biology, Cold
Spring Harbor Laboratory Press, 2009, pp. 187–195.
date_created: 2018-12-11T12:04:33Z
date_published: 2009-11-10T00:00:00Z
date_updated: 2021-01-12T07:45:04Z
day: '10'
department:
- _id: NiBa
doi: 10.1101/sqb.2009.74.030
intvolume: ' 74'
language:
- iso: eng
month: '11'
oa_version: None
page: 187 - 195
publication: Cold Spring Harbor Symposia on Quantitative Biology
publication_status: published
publisher: Cold Spring Harbor Laboratory Press
publist_id: '2708'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Why sex and recombination? '
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 74
year: '2009'
...
---
_id: '3775'
abstract:
- lang: eng
text: There is a close analogy between statistical thermodynamics and the evolution
of allele frequencies under mutation, selection and random drift. Wright's formula
for the stationary distribution of allele frequencies is analogous to the Boltzmann
distribution in statistical physics. Population size, 2N, plays the role of the
inverse temperature, 1/kT, and determines the magnitude of random fluctuations.
Log mean fitness, View the MathML source, tends to increase under selection, and
is analogous to a (negative) energy; a potential function, U, increases under
mutation in a similar way. An entropy, SH, can be defined which measures the deviation
from the distribution of allele frequencies expected under random drift alone;
the sum View the MathML source gives a free fitness that increases as the population
evolves towards its stationary distribution. Usually, we observe the distribution
of a few quantitative traits that depend on the frequencies of very many alleles.
The mean and variance of such traits are analogous to observable quantities in
statistical thermodynamics. Thus, we can define an entropy, SΩ, which measures
the volume of allele frequency space that is consistent with the observed trait
distribution. The stationary distribution of the traits is View the MathML source;
this applies with arbitrary epistasis and dominance. The entropies SΩ, SH are
distinct, but converge when there are so many alleles that traits fluctuate close
to their expectations. Populations tend to evolve towards states that can be realised
in many ways (i.e., large SΩ), which may lead to a substantial drop below the
adaptive peak; we illustrate this point with a simple model of genetic redundancy.
This analogy with statistical thermodynamics brings together previous ideas in
a general framework, and justifies a maximum entropy approximation to the dynamics
of quantitative traits.
acknowledgement: "This work was supported by a Royal Society/Wolfson Award, and by
grants EP/T11753/01, EP/C546318/01 from the EPSRC.\r\nWe are grateful to M. Cates,
H.P. de Vladar and G. Sella, and to two anonymous referees, for their helpful comments."
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: Jason
full_name: Coe, Jason
last_name: Coe
citation:
ama: Barton NH, Coe J. On the application of statistical physics to evolutionary
biology. Journal of Theoretical Biology. 2009;259(2):317-324. doi:10.1016/j.jtbi.2009.03.019
apa: Barton, N. H., & Coe, J. (2009). On the application of statistical physics
to evolutionary biology. Journal of Theoretical Biology. Elsevier. https://doi.org/10.1016/j.jtbi.2009.03.019
chicago: Barton, Nicholas H, and Jason Coe. “On the Application of Statistical Physics
to Evolutionary Biology.” Journal of Theoretical Biology. Elsevier, 2009.
https://doi.org/10.1016/j.jtbi.2009.03.019.
ieee: N. H. Barton and J. Coe, “On the application of statistical physics to evolutionary
biology,” Journal of Theoretical Biology, vol. 259, no. 2. Elsevier, pp.
317–324, 2009.
ista: Barton NH, Coe J. 2009. On the application of statistical physics to evolutionary
biology. Journal of Theoretical Biology. 259(2), 317–324.
mla: Barton, Nicholas H., and Jason Coe. “On the Application of Statistical Physics
to Evolutionary Biology.” Journal of Theoretical Biology, vol. 259, no.
2, Elsevier, 2009, pp. 317–24, doi:10.1016/j.jtbi.2009.03.019.
short: N.H. Barton, J. Coe, Journal of Theoretical Biology 259 (2009) 317–324.
date_created: 2018-12-11T12:05:06Z
date_published: 2009-07-21T00:00:00Z
date_updated: 2021-01-12T07:52:06Z
day: '21'
department:
- _id: NiBa
doi: 10.1016/j.jtbi.2009.03.019
intvolume: ' 259'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal.archives-ouvertes.fr/hal-00554594/document
month: '07'
oa: 1
oa_version: Submitted Version
page: 317 - 324
publication: Journal of Theoretical Biology
publication_status: published
publisher: Elsevier
publist_id: '2452'
quality_controlled: '1'
scopus_import: 1
status: public
title: On the application of statistical physics to evolutionary biology
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 259
year: '2009'
...
---
_id: '3780'
abstract:
- lang: eng
text: Why are sinistral snails so rare? Two main hypotheses are that selection acts
against the establishment of new coiling morphs, because dextral and sinistral
snails have trouble mating, or else a developmental constraint prevents the establishment
of sinistrals. We therefore used an isolate of the snail Lymnaea stagnalis, in
which sinistrals are rare, and populations of Partula suturalis, in which sinistrals
are common, as well as a mathematical model, to understand the circumstances by
which new morphs evolve. The main finding is that the sinistral genotype is associated
with reduced egg viability in L. stagnalis, but in P. suturalis individuals of
sinistral and dextral genotype appear equally fecund, implying a lack of a constraint.
As positive frequency-dependent selection against the rare chiral morph in P.
suturalis also operates over a narrow range (< 3%), the results suggest a model
for chiral evolution in snails in which weak positive frequency-dependent selection
may be overcome by a negative frequency-dependent selection, such as reproductive
character displacement. In snails, there is not always a developmental constraint.
As the direction of cleavage, and thus the directional asymmetry of the entire
body, does not generally vary in other Spiralia (annelids, echiurans, vestimentiferans,
sipunculids and nemerteans), it remains an open question as to whether this is
because of a constraint and/or because most taxa do not have a conspicuous external
asymmetry (like a shell) upon which selection can act.
acknowledgement: We owe a great debt to Jim Murray for his many contributions to the
study of Partula, in the field, in the laboratory, in the interpretation of data,
and in generating new ideas about evolution. With pleasure and respect we dedicate
this paper to him. Jim Murray played a leading role in making the collections used
here. We are very grateful also to Ann Clarke and Elizabeth Murray for help with
collecting, to Lorna Stewart for snail dissections, to Joris Koene for the gift
of snails, to Natasha Constant for entering the data, and Takahiro Asami, Edmund
Gittenberger and Gerhard Falkner for establishing the sinistral stock of L. stagnalis.
Comments from an anonymous referee, A. Richard Palmer and the editorial board improved
the manuscript. Work in the field was supported by the Royal Society, The Carnegie
Trust, the Percy Sladen Trust and the National Science Foundation. The Science Research
Council (B/SR/4144), the National Science Foundation (GB-4188), the Royal Society
and the University of Nottingham supported work in the laboratory.
author:
- first_name: Angus
full_name: Davison, Angus
last_name: Davison
- 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: Bryan
full_name: Clarke, Bryan
last_name: Clarke
citation:
ama: 'Davison A, Barton NH, Clarke B. The effect of chirality phenotype and genotype
on the fecundity and viability of Partula suturalis and Lymnaea stagnalis: Implications
for the evolution of sinistral snails. Journal of Evolutionary Biology.
2009;22(8):1624-1635. doi:10.1111/j.1420-9101.2009.01770.x'
apa: 'Davison, A., Barton, N. H., & Clarke, B. (2009). The effect of chirality
phenotype and genotype on the fecundity and viability of Partula suturalis and
Lymnaea stagnalis: Implications for the evolution of sinistral snails. Journal
of Evolutionary Biology. Wiley. https://doi.org/10.1111/j.1420-9101.2009.01770.x'
chicago: 'Davison, Angus, Nicholas H Barton, and Bryan Clarke. “The Effect of Chirality
Phenotype and Genotype on the Fecundity and Viability of Partula Suturalis and
Lymnaea Stagnalis: Implications for the Evolution of Sinistral Snails.” Journal
of Evolutionary Biology. Wiley, 2009. https://doi.org/10.1111/j.1420-9101.2009.01770.x.'
ieee: 'A. Davison, N. H. Barton, and B. Clarke, “The effect of chirality phenotype
and genotype on the fecundity and viability of Partula suturalis and Lymnaea stagnalis:
Implications for the evolution of sinistral snails,” Journal of Evolutionary
Biology, vol. 22, no. 8. Wiley, pp. 1624–1635, 2009.'
ista: 'Davison A, Barton NH, Clarke B. 2009. The effect of chirality phenotype and
genotype on the fecundity and viability of Partula suturalis and Lymnaea stagnalis:
Implications for the evolution of sinistral snails. Journal of Evolutionary Biology.
22(8), 1624–1635.'
mla: 'Davison, Angus, et al. “The Effect of Chirality Phenotype and Genotype on
the Fecundity and Viability of Partula Suturalis and Lymnaea Stagnalis: Implications
for the Evolution of Sinistral Snails.” Journal of Evolutionary Biology,
vol. 22, no. 8, Wiley, 2009, pp. 1624–35, doi:10.1111/j.1420-9101.2009.01770.x.'
short: A. Davison, N.H. Barton, B. Clarke, Journal of Evolutionary Biology 22 (2009)
1624–1635.
date_created: 2018-12-11T12:05:08Z
date_published: 2009-08-01T00:00:00Z
date_updated: 2021-01-12T07:52:09Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1111/j.1420-9101.2009.01770.x
file:
- access_level: open_access
checksum: f70c15c6ab9306121d4153a3be0d2346
content_type: application/pdf
creator: dernst
date_created: 2019-02-22T09:21:44Z
date_updated: 2020-07-14T12:46:15Z
file_id: '6044'
file_name: Davison_JEB_v31_2009.pdf
file_size: 2583812
relation: main_file
file_date_updated: 2020-07-14T12:46:15Z
has_accepted_license: '1'
intvolume: ' 22'
issue: '8'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
page: 1624 - 1635
publication: Journal of Evolutionary Biology
publication_status: published
publisher: Wiley
publist_id: '2447'
pubrep_id: '553'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'The effect of chirality phenotype and genotype on the fecundity and viability
of Partula suturalis and Lymnaea stagnalis: Implications for the evolution of sinistral
snails'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 22
year: '2009'
...
---
_id: '3837'
abstract:
- lang: eng
text: In this paper we extend the work of Alfaro, Henzinger et al. on interface
theories for component-based design. Existing interface theories often fail to
capture functional relations between the inputs and outputs of an interface. For
example, a simple synchronous interface that takes as input a number n ≥ 0 and
returns, at the same time, as output n + 1, cannot be expressed in existing theories.
In this paper we provide a theory of relational interfaces, where such input-output
relations can be captured. Our theory supports synchronous interfaces, both stateless
and stateful. It includes explicit notions of environments and pluggability, and
satisfies fundamental properties such as preservation of refinement by composition,
and characterization of pluggability by refinement. We achieve these properties
by making reasonable restrictions on feedback loops in interface compositions.
acknowledgement: 'This work is supported by the Center for Hybrid and Embedded Software
Systems (CHESS) at UC Berkeley, which receives support from the National Science
Foundation (NSF awards #0720882 (CSR-EHS: PRET) and #0720841 (CSR-CPS)), the U.S.
Army Research Office (ARO #W911NF-07-2-0019), the U.S. Air Force Office of Scientific
Research (MURI #FA9550-06-0312), the Air Force Research Lab (AFRL), the State of
California Micro Program, and the following companies: Agilent, Bosch, Lockheed-Martin,
National Instruments, Thales and Toyota. This work is also supported by the COMBEST
and ArtistDesign projects of the European Union, and the Swiss National Science
Foundation. '
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. On relational interfaces. In: EMSOFT
’09 Proceedings of the Seventh ACM International Conference on Embedded Software.
ACM; 2009:67-76. doi:10.1145/1629335.1629346'
apa: 'Tripakis, S., Lickly, B., Henzinger, T. A., & Lee, E. (2009). On relational
interfaces. In EMSOFT ’09 Proceedings of the seventh ACM international conference
on Embedded software (pp. 67–76). Grenoble, France: ACM. https://doi.org/10.1145/1629335.1629346'
chicago: Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “On
Relational Interfaces.” In EMSOFT ’09 Proceedings of the Seventh ACM International
Conference on Embedded Software, 67–76. ACM, 2009. https://doi.org/10.1145/1629335.1629346.
ieee: S. Tripakis, B. Lickly, T. A. Henzinger, and E. Lee, “On relational interfaces,”
in EMSOFT ’09 Proceedings of the seventh ACM international conference on Embedded
software, Grenoble, France, 2009, pp. 67–76.
ista: 'Tripakis S, Lickly B, Henzinger TA, Lee E. 2009. On relational interfaces.
EMSOFT ’09 Proceedings of the seventh ACM international conference on Embedded
software. EMSOFT: Embedded Software , 67–76.'
mla: Tripakis, Stavros, et al. “On Relational Interfaces.” EMSOFT ’09 Proceedings
of the Seventh ACM International Conference on Embedded Software, ACM, 2009,
pp. 67–76, doi:10.1145/1629335.1629346.
short: S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, in:, EMSOFT ’09 Proceedings
of the Seventh ACM International Conference on Embedded Software, ACM, 2009, pp.
67–76.
conference:
end_date: 2009-10-16
location: Grenoble, France
name: 'EMSOFT: Embedded Software '
start_date: 2009-10-12
date_created: 2018-12-11T12:05:26Z
date_published: 2009-01-01T00:00:00Z
date_updated: 2021-01-12T07:52:33Z
day: '01'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.1145/1629335.1629346
ec_funded: 1
file:
- access_level: open_access
checksum: 3a70e21527dfaad2f198549ae5710786
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:57Z
date_updated: 2020-07-14T12:46:16Z
file_id: '5045'
file_name: IST-2012-70-v1+1_On_Relational_Interfaces.pdf
file_size: 310902
relation: main_file
file_date_updated: 2020-07-14T12:46:16Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 67 - 76
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
publication: EMSOFT '09 Proceedings of the seventh ACM international conference on
Embedded software
publication_status: published
publisher: ACM
publist_id: '2360'
pubrep_id: '70'
quality_controlled: '1'
status: public
title: On relational interfaces
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2009'
...
---
_id: '3841'
abstract:
- lang: eng
text: 'We compare several languages for specifying Markovian population models such
as queuing networks and chemical reaction networks. These languages —matrix descriptions,
stochastic Petri nets, stoichiometric equations, stochastic process algebras,
and guarded command models— all describe continuous-time Markov chains, but they
differ according to important properties, such as compositionality, expressiveness
and succinctness, executability, ease of use, and the support they provide for
checking the well-formedness of a model and for analyzing a model. '
acknowledgement: This research was supported in part by the Excellence Cluster on
Multimodal Computing and Interaction and the Swiss National Science Foundation.
alternative_title:
- LNCS
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: Barbara
full_name: Jobstmann, Barbara
last_name: Jobstmann
- first_name: Verena
full_name: Wolf, Verena
last_name: Wolf
citation:
ama: 'Henzinger TA, Jobstmann B, Wolf V. Formalisms for specifying Markovian population
models. In: Vol 5797. Springer; 2009:3-23. doi:10.1007/978-3-642-04420-5_2'
apa: 'Henzinger, T. A., Jobstmann, B., & Wolf, V. (2009). Formalisms for specifying
Markovian population models (Vol. 5797, pp. 3–23). Presented at the RP: Reachability
Problems, Palaiseau, France: Springer. https://doi.org/10.1007/978-3-642-04420-5_2'
chicago: Henzinger, Thomas A, Barbara Jobstmann, and Verena Wolf. “Formalisms for
Specifying Markovian Population Models,” 5797:3–23. Springer, 2009. https://doi.org/10.1007/978-3-642-04420-5_2.
ieee: 'T. A. Henzinger, B. Jobstmann, and V. Wolf, “Formalisms for specifying Markovian
population models,” presented at the RP: Reachability Problems, Palaiseau, France,
2009, vol. 5797, pp. 3–23.'
ista: 'Henzinger TA, Jobstmann B, Wolf V. 2009. Formalisms for specifying Markovian
population models. RP: Reachability Problems, LNCS, vol. 5797, 3–23.'
mla: Henzinger, Thomas A., et al. Formalisms for Specifying Markovian Population
Models. Vol. 5797, Springer, 2009, pp. 3–23, doi:10.1007/978-3-642-04420-5_2.
short: T.A. Henzinger, B. Jobstmann, V. Wolf, in:, Springer, 2009, pp. 3–23.
conference:
end_date: 2009-09-25
location: Palaiseau, France
name: 'RP: Reachability Problems'
start_date: 2009-09-23
date_created: 2018-12-11T12:05:28Z
date_published: 2009-09-07T00:00:00Z
date_updated: 2023-02-23T11:24:49Z
day: '07'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.1007/978-3-642-04420-5_2
file:
- access_level: open_access
checksum: df88431872586c773fbcfea37d7b36a2
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:41Z
date_updated: 2020-07-14T12:46:16Z
file_id: '4702'
file_name: IST-2012-67-v1+1_Formalisms_for_specifying_Markovian_population_models.pdf
file_size: 222840
relation: main_file
file_date_updated: 2020-07-14T12:46:16Z
has_accepted_license: '1'
intvolume: ' 5797'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 3 - 23
publication_status: published
publisher: Springer
publist_id: '2352'
pubrep_id: '67'
quality_controlled: '1'
related_material:
record:
- id: '3381'
relation: later_version
status: public
scopus_import: 1
status: public
title: Formalisms for specifying Markovian population models
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5797
year: '2009'
...
---
_id: '3843'
abstract:
- lang: eng
text: "Within systems biology there is an increasing interest in the stochastic
behavior of biochemical reaction networks. An appropriate stochastic description
is provided by the chemical master equation, which represents a continuous- time
Markov chain (CTMC).\r\nStandard Uniformization (SU) is an efficient method for
the transient analysis of CTMCs. For systems with very different time scales,
such as biochemical reaction networks, SU is computationally expensive. In these
cases, a variant of SU, called adaptive uniformization (AU), is known to reduce
the large number of iterations needed by SU. The additional difficulty of AU is
that it requires the solution of a birth process.\r\nIn this paper we present
an on-the-fly variant of AU, where we improve the original algorithm for AU at
the cost of a small approximation error. By means of several examples, we show
that our approach is particularly well-suited for biochemical reaction networks."
acknowledgement: This research has been partially funded by the Swiss National Science
Foundation under grant 205321-111840 and by the Cluster of Excellence on Multimodal
Computing and Interaction at Saarland University.
article_processing_charge: No
author:
- first_name: Frédéric
full_name: Didier, Frédéric
last_name: Didier
- 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: Maria
full_name: Mateescu, Maria
id: 3B43276C-F248-11E8-B48F-1D18A9856A87
last_name: Mateescu
- first_name: Verena
full_name: Wolf, Verena
last_name: Wolf
citation:
ama: 'Didier F, Henzinger TA, Mateescu M, Wolf V. Fast adaptive uniformization of
the chemical master equation. In: Vol 4. IEEE; 2009:118-127. doi:10.1109/HiBi.2009.23'
apa: 'Didier, F., Henzinger, T. A., Mateescu, M., & Wolf, V. (2009). Fast adaptive
uniformization of the chemical master equation (Vol. 4, pp. 118–127). Presented
at the HIBI: High-Performance Computational Systems Biology, Trento, Italy: IEEE.
https://doi.org/10.1109/HiBi.2009.23'
chicago: Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf.
“Fast Adaptive Uniformization of the Chemical Master Equation,” 4:118–27. IEEE,
2009. https://doi.org/10.1109/HiBi.2009.23.
ieee: 'F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Fast adaptive uniformization
of the chemical master equation,” presented at the HIBI: High-Performance Computational
Systems Biology, Trento, Italy, 2009, vol. 4, no. 6, pp. 118–127.'
ista: 'Didier F, Henzinger TA, Mateescu M, Wolf V. 2009. Fast adaptive uniformization
of the chemical master equation. HIBI: High-Performance Computational Systems
Biology vol. 4, 118–127.'
mla: Didier, Frédéric, et al. Fast Adaptive Uniformization of the Chemical Master
Equation. Vol. 4, no. 6, IEEE, 2009, pp. 118–27, doi:10.1109/HiBi.2009.23.
short: F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, in:, IEEE, 2009, pp. 118–127.
conference:
end_date: 2009-10-16
location: Trento, Italy
name: 'HIBI: High-Performance Computational Systems Biology'
start_date: 2009-10-14
date_created: 2018-12-11T12:05:28Z
date_published: 2009-10-30T00:00:00Z
date_updated: 2023-02-23T11:45:05Z
day: '30'
ddc:
- '000'
department:
- _id: ToHe
- _id: CaGu
doi: 10.1109/HiBi.2009.23
file:
- access_level: open_access
checksum: 9a3bde48f43203991a0b3c6a277c2f5b
content_type: application/pdf
creator: dernst
date_created: 2020-05-19T16:33:55Z
date_updated: 2020-07-14T12:46:17Z
file_id: '7874'
file_name: 2009_HIBI_Didier.pdf
file_size: 222890
relation: main_file
file_date_updated: 2020-07-14T12:46:17Z
has_accepted_license: '1'
intvolume: ' 4'
issue: '6'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 118 - 127
publication_status: published
publisher: IEEE
publist_id: '2348'
quality_controlled: '1'
related_material:
record:
- id: '3842'
relation: later_version
status: public
scopus_import: 1
status: public
title: Fast adaptive uniformization of the chemical master equation
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2009'
...
---
_id: '3844'
abstract:
- lang: eng
text: The Hierarchical Timing Language (HTL) is a real-time coordination language
for distributed control systems. HTL programs must be checked for well-formedness,
race freedom, transmission safety (schedulability of inter-host communication),
and time safety (schedulability of host computation). We present a modular abstract
syntax and semantics for HTL, modular checks of well-formedness, race freedom,
and transmission safety, and modular code distribution. Our contributions here
complement previous results on HTL time safety and modular code generation. Modularity
in HTL can be utilized in easy program composition as well as fast program analysis
and code generation, but also in so-called runtime patching, where program components
may be modified at runtime.
acknowledgement: Supported by the EU ArtistDesign Network of Excellence on Embedded
Systems Design, the EU project COMBEST, the Austrian Science Funds P18913-N15 and
V00125, and Fundacao para a Ciencia e Tecnologia funds SFRH/BD/29461/2006 and PTDC/EIA/71462/2006
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: Christoph
full_name: Kirsch, Christoph
last_name: Kirsch
- first_name: Eduardo
full_name: Marques, Eduardo
last_name: Marques
- first_name: Ana
full_name: Sokolova, Ana
last_name: Sokolova
citation:
ama: 'Henzinger TA, Kirsch C, Marques E, Sokolova A. Distributed, modular HTL. In:
IEEE; 2009:171-180. doi:10.1109/RTSS.2009.9'
apa: 'Henzinger, T. A., Kirsch, C., Marques, E., & Sokolova, A. (2009). Distributed,
modular HTL (pp. 171–180). Presented at the RTSS: Real-Time Systems Symposium,
Washington, DC, United States: IEEE. https://doi.org/10.1109/RTSS.2009.9'
chicago: Henzinger, Thomas A, Christoph Kirsch, Eduardo Marques, and Ana Sokolova.
“Distributed, Modular HTL,” 171–80. IEEE, 2009. https://doi.org/10.1109/RTSS.2009.9.
ieee: 'T. A. Henzinger, C. Kirsch, E. Marques, and A. Sokolova, “Distributed, modular
HTL,” presented at the RTSS: Real-Time Systems Symposium, Washington, DC, United
States, 2009, pp. 171–180.'
ista: 'Henzinger TA, Kirsch C, Marques E, Sokolova A. 2009. Distributed, modular
HTL. RTSS: Real-Time Systems Symposium, 171–180.'
mla: Henzinger, Thomas A., et al. Distributed, Modular HTL. IEEE, 2009, pp.
171–80, doi:10.1109/RTSS.2009.9.
short: T.A. Henzinger, C. Kirsch, E. Marques, A. Sokolova, in:, IEEE, 2009, pp.
171–180.
conference:
end_date: 2009-12-04
location: Washington, DC, United States
name: 'RTSS: Real-Time Systems Symposium'
start_date: 2009-12-01
date_created: 2018-12-11T12:05:28Z
date_published: 2009-01-01T00:00:00Z
date_updated: 2021-01-12T07:52:36Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1109/RTSS.2009.9
ec_funded: 1
file:
- access_level: open_access
checksum: b2b15a5ef71eb50d62eaa5aea7efd8c4
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:56Z
date_updated: 2020-07-14T12:46:17Z
file_id: '4655'
file_name: IST-2012-65-v1+1_Distributed_modular_Htl.pdf
file_size: 526458
relation: main_file
file_date_updated: 2020-07-14T12:46:17Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 171 - 180
project:
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
publication_status: published
publisher: IEEE
publist_id: '2346'
pubrep_id: '65'
quality_controlled: '1'
status: public
title: Distributed, modular HTL
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2009'
...
---
_id: '3870'
abstract:
- lang: eng
text: Games on graphs with omega-regular objectives provide a model for the control
and synthesis of reactive systems. Every omega-regular objective can be decomposed
into a safety part and a liveness part. The liveness part ensures that something
good happens “eventually.” Two main strengths of the classical, infinite-limit
formulation of liveness are robustness (independence from the granularity of transitions)
and simplicity (abstraction of complicated time bounds). However, the classical
liveness formulation suffers from the drawback that the time until something good
happens may be unbounded. A stronger formulation of liveness, so-called finitary
liveness, overcomes this drawback, while still retaining robustness and simplicity.
Finitary liveness requires that there exists an unknown, fixed bound b such that
something good happens within b transitions. While for one-shot liveness (reachability)
objectives, classical and finitary liveness coincide, for repeated liveness (Buchi)
objectives, the finitary formulation is strictly stronger. In this work we study
games with finitary parity and Streett objectives. We prove the determinacy of
these games, present algorithms for solving these games, and characterize the
memory requirements of winning strategies. We show that finitary parity games
can be solved in polynomial time, which is not known for infinitary parity games.
For finitary Streett games, we give an EXPTIME algorithm and show that the problem
is NP-hard. Our algorithms can be used, for example, for synthesizing controllers
that do not let the response time of a system increase without bound.
acknowledgement: "This research was supported in part by the AFOSR MURI grant F49620-00-1-0327,
the NSF grants CCR-0132780, CNS-0720884, and CCR- 225610, by the Swiss National
Science Foundation, by the COMBEST project of the European Union, and EU-TMR network
Games.\r\nWe thank anonymous reviewers for useful comments."
article_number: '1'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Florian
full_name: Horn, Florian
id: 37327ACE-F248-11E8-B48F-1D18A9856A87
last_name: Horn
citation:
ama: Chatterjee K, Henzinger TA, Horn F. Finitary winning in omega-regular games.
ACM Transactions on Computational Logic (TOCL). 2009;11(1). doi:10.1145/1614431.1614432
apa: Chatterjee, K., Henzinger, T. A., & Horn, F. (2009). Finitary winning in
omega-regular games. ACM Transactions on Computational Logic (TOCL). ACM.
https://doi.org/10.1145/1614431.1614432
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “Finitary
Winning in Omega-Regular Games.” ACM Transactions on Computational Logic (TOCL).
ACM, 2009. https://doi.org/10.1145/1614431.1614432.
ieee: K. Chatterjee, T. A. Henzinger, and F. Horn, “Finitary winning in omega-regular
games,” ACM Transactions on Computational Logic (TOCL), vol. 11, no. 1.
ACM, 2009.
ista: Chatterjee K, Henzinger TA, Horn F. 2009. Finitary winning in omega-regular
games. ACM Transactions on Computational Logic (TOCL). 11(1), 1.
mla: Chatterjee, Krishnendu, et al. “Finitary Winning in Omega-Regular Games.” ACM
Transactions on Computational Logic (TOCL), vol. 11, no. 1, 1, ACM, 2009,
doi:10.1145/1614431.1614432.
short: K. Chatterjee, T.A. Henzinger, F. Horn, ACM Transactions on Computational
Logic (TOCL) 11 (2009).
date_created: 2018-12-11T12:05:37Z
date_published: 2009-10-01T00:00:00Z
date_updated: 2021-01-12T07:52:50Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.1145/1614431.1614432
ec_funded: 1
file:
- access_level: open_access
checksum: 139c4586d24f11e5da31fb3a0cf96ef4
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:08Z
date_updated: 2020-07-14T12:46:20Z
file_id: '5125'
file_name: IST-2012-53-v1+1_Finitary_winning_in_omega-regular_games.pdf
file_size: 180082
relation: main_file
file_date_updated: 2020-07-14T12:46:20Z
has_accepted_license: '1'
intvolume: ' 11'
issue: '1'
language:
- iso: eng
month: '10'
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
publication: ACM Transactions on Computational Logic (TOCL)
publication_status: published
publisher: ACM
publist_id: '2309'
pubrep_id: '53'
quality_controlled: '1'
scopus_import: 1
status: public
title: Finitary winning in omega-regular games
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 11
year: '2009'
...
---
_id: '3871'
abstract:
- lang: eng
text: 'Nondeterministic weighted automata are finite automata with numerical weights
oil transitions. They define quantitative languages 1, that assign to each word
v; a real number L(w). The value of ail infinite word w is computed as the maximal
value of all runs over w, and the value of a run as the supremum, limsup liminf,
limit average, or discounted sum of the transition weights. We introduce probabilistic
weighted antomata, in which the transitions are chosen in a randomized (rather
than nondeterministic) fashion. Under almost-sure semantics (resp. positive semantics),
the value of a word v) is the largest real v such that the runs over w have value
at least v with probability I (resp. positive probability). We study the classical
questions of automata theory for probabilistic weighted automata: emptiness and
universality, expressiveness, and closure under various operations oil languages.
For quantitative languages, emptiness university axe defined as whether the value
of some (resp. every) word exceeds a given threshold. We prove some, of these
questions to he decidable, and others undecidable. Regarding expressive power,
we show that probabilities allow its to define a wide variety of new classes of
quantitative languages except for discounted-sum automata, where probabilistic
choice is no more expressive than nondeterminism. Finally we live ail almost complete
picture of the closure of various classes of probabilistic weighted automata for
the following, provide, is operations oil quantitative languages: maximum, sum.
and numerical complement.'
acknowledgement: This research was supported in part by the Swiss National Science
Foundation under the Indo-Swiss Joint Research Programme, by the European Network
of Excellence on Embedded Systems Design (ArtistDesign), by the European projects
Combest, Quasimodo, and Gasics, by the PAI program Moves funded by the Belgian Federal
Government, and by the CFV (Federated Center in Verification ) funded by the F.R.S.-FNRS.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Chatterjee K, Doyen L, Henzinger TA. Probabilistic weighted automata. In:
Vol 5710. Springer; 2009:244-258. doi:10.1007/978-3-642-04081-8_17'
apa: 'Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). Probabilistic weighted
automata (Vol. 5710, pp. 244–258). Presented at the CONCUR: Concurrency Theory,
Bologna, Italy: Springer. https://doi.org/10.1007/978-3-642-04081-8_17'
chicago: Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Probabilistic
Weighted Automata,” 5710:244–58. Springer, 2009. https://doi.org/10.1007/978-3-642-04081-8_17.
ieee: 'K. Chatterjee, L. Doyen, and T. A. Henzinger, “Probabilistic weighted automata,”
presented at the CONCUR: Concurrency Theory, Bologna, Italy, 2009, vol. 5710,
pp. 244–258.'
ista: 'Chatterjee K, Doyen L, Henzinger TA. 2009. Probabilistic weighted automata.
CONCUR: Concurrency Theory, LNCS, vol. 5710, 244–258.'
mla: Chatterjee, Krishnendu, et al. Probabilistic Weighted Automata. Vol.
5710, Springer, 2009, pp. 244–58, doi:10.1007/978-3-642-04081-8_17.
short: K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 244–258.
conference:
end_date: 2009-09-04
location: Bologna, Italy
name: 'CONCUR: Concurrency Theory'
start_date: 2009-09-01
date_created: 2018-12-11T12:05:37Z
date_published: 2009-09-01T00:00:00Z
date_updated: 2021-01-12T07:52:50Z
day: '01'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.1007/978-3-642-04081-8_17
ec_funded: 1
file:
- access_level: open_access
checksum: af973ddbcf131b8810c6bff2c055ff56
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:46Z
date_updated: 2020-07-14T12:46:20Z
file_id: '4771'
file_name: IST-2012-52-v1+1_Probabilistic_Weighted_Automata.pdf
file_size: 200161
relation: main_file
file_date_updated: 2020-07-14T12:46:20Z
has_accepted_license: '1'
intvolume: ' 5710'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 244 - 258
project:
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
publication_status: published
publisher: Springer
publist_id: '2304'
pubrep_id: '52'
quality_controlled: '1'
scopus_import: 1
status: public
title: Probabilistic weighted automata
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5710
year: '2009'
...
---
_id: '3968'
abstract:
- lang: eng
text: We describe an algorithm for segmenting three-dimensional medical imaging
data modeled as a continuous function on a 3-manifold. It is related to watershed
algorithms developed in image processing but is closer to its mathematical roots,
which are Morse theory and homological algebra. It allows for the implicit treatment
of an underlying mesh, thus combining the structural integrity of its mathematical
foundations with the computational efficiency of image processing.
acknowledgement: This research was partially supported by Geomagic, Inc., and by the
Defense Advanced Research Projects Agency (DARPA) under grants HR0011-05-1-0007
and HR0011-05-1-0057.
alternative_title:
- LNCS
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: John
full_name: Harer, John
last_name: Harer
citation:
ama: 'Edelsbrunner H, Harer J. The persistent Morse complex segmentation of a 3-manifold.
In: Vol 5903. Springer; 2009:36-50. doi:10.1007/978-3-642-10470-1_4'
apa: 'Edelsbrunner, H., & Harer, J. (2009). The persistent Morse complex segmentation
of a 3-manifold (Vol. 5903, pp. 36–50). Presented at the 3DPH: Modelling the Physiological
Human, Zermatt, Switzerland: Springer. https://doi.org/10.1007/978-3-642-10470-1_4'
chicago: Edelsbrunner, Herbert, and John Harer. “The Persistent Morse Complex Segmentation
of a 3-Manifold,” 5903:36–50. Springer, 2009. https://doi.org/10.1007/978-3-642-10470-1_4.
ieee: 'H. Edelsbrunner and J. Harer, “The persistent Morse complex segmentation
of a 3-manifold,” presented at the 3DPH: Modelling the Physiological Human, Zermatt,
Switzerland, 2009, vol. 5903, pp. 36–50.'
ista: 'Edelsbrunner H, Harer J. 2009. The persistent Morse complex segmentation
of a 3-manifold. 3DPH: Modelling the Physiological Human, LNCS, vol. 5903, 36–50.'
mla: Edelsbrunner, Herbert, and John Harer. The Persistent Morse Complex Segmentation
of a 3-Manifold. Vol. 5903, Springer, 2009, pp. 36–50, doi:10.1007/978-3-642-10470-1_4.
short: H. Edelsbrunner, J. Harer, in:, Springer, 2009, pp. 36–50.
conference:
end_date: 2009-12-02
location: Zermatt, Switzerland
name: '3DPH: Modelling the Physiological Human'
start_date: 2009-11-29
date_created: 2018-12-11T12:06:10Z
date_published: 2009-11-17T00:00:00Z
date_updated: 2021-01-12T07:53:32Z
day: '17'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1007/978-3-642-10470-1_4
file:
- access_level: open_access
checksum: 11fc85bcc19bab1f020e706a4b8a4660
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:33Z
date_updated: 2020-07-14T12:46:21Z
file_id: '4694'
file_name: IST-2016-535-v1+1_2009-P-04-3ManifoldSegmentation.pdf
file_size: 165090
relation: main_file
file_date_updated: 2020-07-14T12:46:21Z
has_accepted_license: '1'
intvolume: ' 5903'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
page: 36 - 50
publication_status: published
publisher: Springer
publist_id: '2160'
pubrep_id: '535'
quality_controlled: '1'
scopus_import: 1
status: public
title: The persistent Morse complex segmentation of a 3-manifold
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5903
year: '2009'
...
---
_id: '4136'
abstract:
- lang: eng
text: 'Populations living in a spatially and temporally changing environment can
adapt to the changing optimum and/or migrate toward favorable habitats. Here we
extend previous analyses with a static optimum to allow the environment to vary
in time as well as in space. The model follows both population dynamics and the
trait mean under stabilizing selection, and the outcomes can be understood by
comparing the loads due to genetic variance, dispersal, and temporal change. With
fixed genetic variance, we obtain two regimes: (1) adaptation that is uniform
along the environmental gradient and that responds to the moving optimum as expected
for panmictic populations and when the spatial gradient is sufficiently steep,
and (2) a population with limited range that adapts more slowly than the environmental
optimum changes in both time and space; the population therefore becomes locally
extinct and migrates toward suitable habitat. We also use a population‐genetic
model with many loci to allow genetic variance to evolve, and we show that the
only solution now has uniform adaptation.'
article_processing_charge: No
article_type: original
author:
- first_name: Jitka
full_name: Polechova, Jitka
id: 3BBFB084-F248-11E8-B48F-1D18A9856A87
last_name: Polechova
orcid: 0000-0003-0951-3112
- 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: Glenn
full_name: Marion, Glenn
last_name: Marion
citation:
ama: 'Polechova J, Barton NH, Marion G. Species’ range: Adaptation in space and
time. American Naturalist. 2009;174(5):E186-E204. doi:10.1086/605958'
apa: 'Polechova, J., Barton, N. H., & Marion, G. (2009). Species’ range: Adaptation
in space and time. American Naturalist. University of Chicago Press. https://doi.org/10.1086/605958'
chicago: 'Polechova, Jitka, Nicholas H Barton, and Glenn Marion. “Species’ Range:
Adaptation in Space and Time.” American Naturalist. University of Chicago
Press, 2009. https://doi.org/10.1086/605958.'
ieee: 'J. Polechova, N. H. Barton, and G. Marion, “Species’ range: Adaptation in
space and time,” American Naturalist, vol. 174, no. 5. University of Chicago
Press, pp. E186–E204, 2009.'
ista: 'Polechova J, Barton NH, Marion G. 2009. Species’ range: Adaptation in space
and time. American Naturalist. 174(5), E186–E204.'
mla: 'Polechova, Jitka, et al. “Species’ Range: Adaptation in Space and Time.” American
Naturalist, vol. 174, no. 5, University of Chicago Press, 2009, pp. E186–204,
doi:10.1086/605958.'
short: J. Polechova, N.H. Barton, G. Marion, American Naturalist 174 (2009) E186–E204.
date_created: 2018-12-11T12:07:09Z
date_published: 2009-11-05T00:00:00Z
date_updated: 2021-01-12T07:54:46Z
day: '05'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1086/605958
external_id:
pmid:
- ' 19788353'
intvolume: ' 174'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.doi.org/10.1086/605958
month: '11'
oa: 1
oa_version: Published Version
page: E186 - E204
pmid: 1
publication: American Naturalist
publication_status: published
publisher: University of Chicago Press
publist_id: '1986'
pubrep_id: '552'
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1086/659642
scopus_import: 1
status: public
title: 'Species'' range: Adaptation in space and time'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 174
year: '2009'
...
---
_id: '4231'
abstract:
- lang: eng
text: The evolution of quantitative characters depends on the frequencies of the
alleles involved, yet these frequencies cannot usually be measured. Previous groups
have proposed an approximation to the dynamics of quantitative traits, based on
an analogy with statistical mechanics. We present a modified version of that approach,
which makes the analogy more precise and applies quite generally to describe the
evolution of allele frequencies. We calculate explicitly how the macroscopic quantities
(i.e., quantities that depend on the quantitative trait) depend on evolutionary
forces, in a way that is independent of the microscopic details. We first show
that the stationary distribution of allele frequencies under drift, selection,
and mutation maximizes a certain measure of entropy, subject to constraints on
the expectation of observable quantities. We then approximate the dynamical changes
in these expectations, assuming that the distribution of allele frequencies always
maximizes entropy, conditional on the expected values. When applied to directional
selection on an additive trait, this gives a very good approximation to the evolution
of the trait mean and the genetic variance, when the number of mutations per generation
is sufficiently high (4Nμ > 1). We show how the method can be modified for
small mutation rates (4Nμ → 0). We outline how this method describes epistatic
interactions as, for example, with stabilizing selection.
acknowledgement: "N.B. was supported by the Engineering and Physical Sciences Research
Council (GR/T11753 and GR/T19537) and by the Royal Society.\r\nWe are grateful to
Ellen Baake for helping to initiate this project and for her comments on this manuscript.
We also thank Michael Turelli for his comments on the manuscript and I. Pen for
discussions and support in this project. This project was a result of a collaboration
supported by the European Science Foundation grant “Integrating population genetics
and conservation biology.” "
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: Harold
full_name: De Vladar, Harold
last_name: De Vladar
citation:
ama: Barton NH, De Vladar H. Statistical mechanics and the evolution of polygenic
quantitative traits. Genetics. 2009;181(3):997-1011. doi:10.1534/genetics.108.099309
apa: Barton, N. H., & De Vladar, H. (2009). Statistical mechanics and the evolution
of polygenic quantitative traits. Genetics. Genetics Society of America.
https://doi.org/10.1534/genetics.108.099309
chicago: Barton, Nicholas H, and Harold De Vladar. “Statistical Mechanics and the
Evolution of Polygenic Quantitative Traits.” Genetics. Genetics Society
of America, 2009. https://doi.org/10.1534/genetics.108.099309.
ieee: N. H. Barton and H. De Vladar, “Statistical mechanics and the evolution of
polygenic quantitative traits,” Genetics, vol. 181, no. 3. Genetics Society
of America, pp. 997–1011, 2009.
ista: Barton NH, De Vladar H. 2009. Statistical mechanics and the evolution of polygenic
quantitative traits. Genetics. 181(3), 997–1011.
mla: Barton, Nicholas H., and Harold De Vladar. “Statistical Mechanics and the Evolution
of Polygenic Quantitative Traits.” Genetics, vol. 181, no. 3, Genetics
Society of America, 2009, pp. 997–1011, doi:10.1534/genetics.108.099309.
short: N.H. Barton, H. De Vladar, Genetics 181 (2009) 997–1011.
date_created: 2018-12-11T12:07:44Z
date_published: 2009-03-01T00:00:00Z
date_updated: 2021-01-12T07:55:29Z
day: '01'
department:
- _id: NiBa
doi: 10.1534/genetics.108.099309
intvolume: ' 181'
issue: '3'
language:
- iso: eng
month: '03'
oa_version: None
page: 997 - 1011
publication: Genetics
publication_status: published
publisher: Genetics Society of America
publist_id: '1882'
quality_controlled: '1'
scopus_import: 1
status: public
title: Statistical mechanics and the evolution of polygenic quantitative traits
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 181
year: '2009'
...
---
_id: '4242'
abstract:
- lang: eng
text: 'Felsenstein distinguished two ways by which selection can directly strengthen
isolation. First, a modifier that strengthens prezygotic isolation can be favored
everywhere. This fits with the traditional view of reinforcement as an adaptation
to reduce deleterious hybridization by strengthening assortative mating. Second,
selection can favor association between different incompatibilities, despite recombination.
We generalize this “two allele” model to follow associations among any number
of incompatibilities, which may include both assortment and hybrid inviability.
Our key argument is that this process, of coupling between incompatibilities,
may be quite different from the usual view of reinforcement: strong isolation
can evolve through the coupling of any kind of incompatibility, whether prezygotic
or postzygotic. Single locus incompatibilities become coupled because associations
between them increase the variance in compatibility, which in turn increases mean
fitness if there is positive epistasis. Multiple incompatibilities, each maintained
by epistasis, can become coupled in the same way. In contrast, a single-locus
incompatibility can become coupled with loci that reduce the viability of haploid
hybrids because this reduces harmful recombination. We obtain simple approximations
for the limits of tight linkage, and strong assortment, and show how assortment
alleles can invade through associations with other components of reproductive
isolation.'
acknowledgement: "This work was supported by a Royal Society/Wolfson Research Merit
award, and by a grant from the Natural Environment Research Council.\r\nWe are very
grateful for insightful comments from S. P. Otto, and for helpful suggestions from
the referees and the Associate Editor, Maria Servedio."
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: Maria
full_name: De Cara, Maria
last_name: De Cara
citation:
ama: Barton NH, De Cara M. The evolution of strong reproductive isolation. Evolution;
International Journal of Organic Evolution. 2009;63(5):1171-1190. doi:10.1111/j.1558-5646.2009.00622.x
apa: Barton, N. H., & De Cara, M. (2009). The evolution of strong reproductive
isolation. Evolution; International Journal of Organic Evolution. Wiley.
https://doi.org/10.1111/j.1558-5646.2009.00622.x
chicago: Barton, Nicholas H, and Maria De Cara. “The Evolution of Strong Reproductive
Isolation.” Evolution; International Journal of Organic Evolution. Wiley,
2009. https://doi.org/10.1111/j.1558-5646.2009.00622.x.
ieee: N. H. Barton and M. De Cara, “The evolution of strong reproductive isolation,”
Evolution; International Journal of Organic Evolution, vol. 63, no. 5.
Wiley, pp. 1171–1190, 2009.
ista: Barton NH, De Cara M. 2009. The evolution of strong reproductive isolation.
Evolution; International Journal of Organic Evolution. 63(5), 1171–1190.
mla: Barton, Nicholas H., and Maria De Cara. “The Evolution of Strong Reproductive
Isolation.” Evolution; International Journal of Organic Evolution, vol.
63, no. 5, Wiley, 2009, pp. 1171–90, doi:10.1111/j.1558-5646.2009.00622.x.
short: N.H. Barton, M. De Cara, Evolution; International Journal of Organic Evolution
63 (2009) 1171–1190.
date_created: 2018-12-11T12:07:48Z
date_published: 2009-05-01T00:00:00Z
date_updated: 2021-01-12T07:55:33Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1111/j.1558-5646.2009.00622.x
file:
- access_level: open_access
checksum: 1920d2e25ef335833764256c1a47bbfb
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:46Z
date_updated: 2020-07-14T12:46:25Z
file_id: '4903'
file_name: IST-2016-551-v1+1_BartonDeCaraRevNew.pdf
file_size: 720913
relation: main_file
- access_level: open_access
checksum: c1c51bbc10d4f328fc96fc5b0e5dc25d
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:47Z
date_updated: 2020-07-14T12:46:25Z
file_id: '4904'
file_name: IST-2016-551-v1+2_BartonDeCaraRevNewSI.pdf
file_size: 290160
relation: main_file
file_date_updated: 2020-07-14T12:46:25Z
has_accepted_license: '1'
intvolume: ' 63'
issue: '5'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 1171 - 1190
publication: Evolution; International Journal of Organic Evolution
publication_status: published
publisher: Wiley
publist_id: '1866'
pubrep_id: '551'
quality_controlled: '1'
scopus_import: 1
status: public
title: The evolution of strong reproductive isolation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 63
year: '2009'
...
---
_id: '4542'
abstract:
- lang: eng
text: "Weighted automata are finite automata with numerical weights on transitions.
Nondeterministic weighted automata define quantitative languages L that assign
to each word w a real number L(w) computed as the maximal value of all runs over
w, and the value of a run r is a function of the sequence of weights that appear
along r. There are several natural functions to consider such as Sup, LimSup,
LimInf, limit average, and discounted sum of transition weights.\r\nWe introduce
alternating weighted automata in which the transitions of the runs are chosen
by two players in a turn-based fashion. Each word is assigned the maximal value
of a run that the first player can enforce regardless of the choices made by the
second player. We survey the results about closure properties, expressiveness,
and decision problems for nondeterministic weighted automata, and we extend these
results to alternating weighted automata.\r\nFor quantitative languages L 1 and
L 2, we consider the pointwise operations max(L 1,L 2), min(L 1,L 2), 1 − L 1,
and the sum L 1 + L 2. We establish the closure properties of all classes of alternating
weighted automata with respect to these four operations.\r\nWe next compare the
expressive power of the various classes of alternating and nondeterministic weighted
automata over infinite words. In particular, for limit average and discounted
sum, we show that alternation brings more expressive power than nondeterminism.\r\nFinally,
we present decidability results and open questions for the quantitative extension
of the classical decision problems in automata theory: emptiness, universality,
language inclusion, and language equivalence."
acknowledgement: This research was supported in part by the Swiss National Science
Foundation under the Indo-Swiss Joint Research Programme, by the European Network
of Excellence on Embedded Systems Design (ArtistDesign), by the European Combest,
Quasimodo, and Gasics projects, by the PAI program Moves funded by the Belgian Federal
Government, and by the CFV (Federated Center in Verification) funded by the F.R.S.-FNRS.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Chatterjee K, Doyen L, Henzinger TA. Alternating weighted automata. In: Vol
5699. Springer; 2009:3-13. doi:10.1007/978-3-642-03409-1_2'
apa: 'Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). Alternating weighted
automata (Vol. 5699, pp. 3–13). Presented at the FCT: Fundamentals of Computation
Theory, Wroclaw, Poland: Springer. https://doi.org/10.1007/978-3-642-03409-1_2'
chicago: Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Alternating
Weighted Automata,” 5699:3–13. Springer, 2009. https://doi.org/10.1007/978-3-642-03409-1_2.
ieee: 'K. Chatterjee, L. Doyen, and T. A. Henzinger, “Alternating weighted automata,”
presented at the FCT: Fundamentals of Computation Theory, Wroclaw, Poland, 2009,
vol. 5699, pp. 3–13.'
ista: 'Chatterjee K, Doyen L, Henzinger TA. 2009. Alternating weighted automata.
FCT: Fundamentals of Computation Theory, LNCS, vol. 5699, 3–13.'
mla: Chatterjee, Krishnendu, et al. Alternating Weighted Automata. Vol. 5699,
Springer, 2009, pp. 3–13, doi:10.1007/978-3-642-03409-1_2.
short: K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 3–13.
conference:
end_date: 2009-09-04
location: Wroclaw, Poland
name: 'FCT: Fundamentals of Computation Theory'
start_date: 2009-09-02
date_created: 2018-12-11T12:09:23Z
date_published: 2009-09-10T00:00:00Z
date_updated: 2021-01-12T07:59:34Z
day: '10'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.1007/978-3-642-03409-1_2
ec_funded: 1
file:
- access_level: open_access
checksum: e8f53abb63579de3f2bff58b2a1188e2
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:09Z
date_updated: 2020-07-14T12:46:31Z
file_id: '5126'
file_name: IST-2012-39-v1+1_Alternating_Weighted_Automata.pdf
file_size: 164428
relation: main_file
file_date_updated: 2020-07-14T12:46:31Z
has_accepted_license: '1'
intvolume: ' 5699'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 3 - 13
project:
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
publication_status: published
publisher: Springer
publist_id: '180'
pubrep_id: '39'
quality_controlled: '1'
scopus_import: 1
status: public
title: Alternating weighted automata
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5699
year: '2009'
...