---
_id: '9711'
article_processing_charge: No
author:
- first_name: Guillaume
full_name: Chevereau, Guillaume
id: 424D78A0-F248-11E8-B48F-1D18A9856A87
last_name: Chevereau
- first_name: Marta
full_name: Lukacisinova, Marta
id: 4342E402-F248-11E8-B48F-1D18A9856A87
last_name: Lukacisinova
orcid: 0000-0002-2519-8004
- first_name: Tugce
full_name: Batur, Tugce
last_name: Batur
- first_name: Aysegul
full_name: Guvenek, Aysegul
last_name: Guvenek
- first_name: Dilay Hazal
full_name: Ayhan, Dilay Hazal
last_name: Ayhan
- first_name: Erdal
full_name: Toprak, Erdal
last_name: Toprak
- first_name: Mark Tobias
full_name: Bollenbach, Mark Tobias
id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
last_name: Bollenbach
orcid: 0000-0003-4398-476X
citation:
ama: Chevereau G, Lukacisinova M, Batur T, et al. Excel file containing the raw
data for all figures. 2015. doi:10.1371/journal.pbio.1002299.s001
apa: Chevereau, G., Lukacisinova, M., Batur, T., Guvenek, A., Ayhan, D. H., Toprak,
E., & Bollenbach, M. T. (2015). Excel file containing the raw data for all
figures. Public Library of Science. https://doi.org/10.1371/journal.pbio.1002299.s001
chicago: Chevereau, Guillaume, Marta Lukacisinova, Tugce Batur, Aysegul Guvenek,
Dilay Hazal Ayhan, Erdal Toprak, and Mark Tobias Bollenbach. “Excel File Containing
the Raw Data for All Figures.” Public Library of Science, 2015. https://doi.org/10.1371/journal.pbio.1002299.s001.
ieee: G. Chevereau et al., “Excel file containing the raw data for all figures.”
Public Library of Science, 2015.
ista: Chevereau G, Lukacisinova M, Batur T, Guvenek A, Ayhan DH, Toprak E, Bollenbach
MT. 2015. Excel file containing the raw data for all figures, Public Library of
Science, 10.1371/journal.pbio.1002299.s001.
mla: Chevereau, Guillaume, et al. Excel File Containing the Raw Data for All
Figures. Public Library of Science, 2015, doi:10.1371/journal.pbio.1002299.s001.
short: G. Chevereau, M. Lukacisinova, T. Batur, A. Guvenek, D.H. Ayhan, E. Toprak,
M.T. Bollenbach, (2015).
date_created: 2021-07-23T11:53:50Z
date_published: 2015-11-18T00:00:00Z
date_updated: 2025-09-23T09:58:54Z
day: '18'
department:
- _id: ToBo
doi: 10.1371/journal.pbio.1002299.s001
fulldoi: https://doi.org/10.1371/journal.pbio.1002299.s001
month: '11'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1619'
relation: used_in_publication
status: public
status: public
title: Excel file containing the raw data for all figures
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9712'
article_processing_charge: No
author:
- first_name: Murat
full_name: Tugrul, Murat
id: 37C323C6-F248-11E8-B48F-1D18A9856A87
last_name: Tugrul
orcid: 0000-0002-8523-0758
- first_name: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
- 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: Gašper
full_name: Tkačik, Gašper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkačik
orcid: 0000-0002-6699-1455
citation:
ama: Tugrul M, Paixao T, Barton NH, Tkačik G. Other fitness models for comparison
& for interacting TFBSs. 2015. doi:10.1371/journal.pgen.1005639.s001
apa: Tugrul, M., Paixao, T., Barton, N. H., & Tkačik, G. (2015). Other fitness
models for comparison & for interacting TFBSs. Public Library of Science.
https://doi.org/10.1371/journal.pgen.1005639.s001
chicago: Tugrul, Murat, Tiago Paixao, Nicholas H Barton, and Gašper Tkačik. “Other
Fitness Models for Comparison & for Interacting TFBSs.” Public Library of
Science, 2015. https://doi.org/10.1371/journal.pgen.1005639.s001.
ieee: M. Tugrul, T. Paixao, N. H. Barton, and G. Tkačik, “Other fitness models for
comparison & for interacting TFBSs.” Public Library of Science, 2015.
ista: Tugrul M, Paixao T, Barton NH, Tkačik G. 2015. Other fitness models for comparison
& for interacting TFBSs, Public Library of Science, 10.1371/journal.pgen.1005639.s001.
mla: Tugrul, Murat, et al. Other Fitness Models for Comparison & for Interacting
TFBSs. Public Library of Science, 2015, doi:10.1371/journal.pgen.1005639.s001.
short: M. Tugrul, T. Paixao, N.H. Barton, G. Tkačik, (2015).
date_created: 2021-07-23T12:00:37Z
date_published: 2015-11-06T00:00:00Z
date_updated: 2025-09-23T08:31:14Z
day: '06'
department:
- _id: NiBa
- _id: CaGu
- _id: GaTk
doi: 10.1371/journal.pgen.1005639.s001
fulldoi: https://doi.org/10.1371/journal.pgen.1005639.s001
month: '11'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1666'
relation: used_in_publication
status: public
status: public
title: Other fitness models for comparison & for interacting TFBSs
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9715'
article_processing_charge: No
author:
- first_name: Barbora
full_name: Trubenova, Barbora
id: 42302D54-F248-11E8-B48F-1D18A9856A87
last_name: Trubenova
orcid: 0000-0002-6873-2967
- first_name: Sebastian
full_name: Novak, Sebastian
id: 461468AE-F248-11E8-B48F-1D18A9856A87
last_name: Novak
orcid: 0000-0002-2519-824X
- first_name: Reinmar
full_name: Hager, Reinmar
last_name: Hager
citation:
ama: Trubenova B, Novak S, Hager R. Mathematical inference of the results. 2015.
doi:10.1371/journal.pone.0126907.s001
apa: Trubenova, B., Novak, S., & Hager, R. (2015). Mathematical inference of
the results. Public Library of Science. https://doi.org/10.1371/journal.pone.0126907.s001
chicago: Trubenova, Barbora, Sebastian Novak, and Reinmar Hager. “Mathematical Inference
of the Results.” Public Library of Science, 2015. https://doi.org/10.1371/journal.pone.0126907.s001.
ieee: B. Trubenova, S. Novak, and R. Hager, “Mathematical inference of the results.”
Public Library of Science, 2015.
ista: Trubenova B, Novak S, Hager R. 2015. Mathematical inference of the results,
Public Library of Science, 10.1371/journal.pone.0126907.s001.
mla: Trubenova, Barbora, et al. Mathematical Inference of the Results. Public
Library of Science, 2015, doi:10.1371/journal.pone.0126907.s001.
short: B. Trubenova, S. Novak, R. Hager, (2015).
date_created: 2021-07-23T12:11:30Z
date_published: 2015-05-18T00:00:00Z
date_updated: 2025-09-23T09:21:54Z
day: '18'
department:
- _id: NiBa
doi: 10.1371/journal.pone.0126907.s001
fulldoi: https://doi.org/10.1371/journal.pone.0126907.s001
month: '05'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1809'
relation: used_in_publication
status: public
status: public
title: Mathematical inference of the results
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9718'
article_processing_charge: No
author:
- first_name: Tamar
full_name: Friedlander, Tamar
id: 36A5845C-F248-11E8-B48F-1D18A9856A87
last_name: Friedlander
- first_name: Avraham E.
full_name: Mayo, Avraham E.
last_name: Mayo
- first_name: Tsvi
full_name: Tlusty, Tsvi
last_name: Tlusty
- first_name: Uri
full_name: Alon, Uri
last_name: Alon
citation:
ama: Friedlander T, Mayo AE, Tlusty T, Alon U. Supporting information text. 2015.
doi:10.1371/journal.pcbi.1004055.s001
apa: Friedlander, T., Mayo, A. E., Tlusty, T., & Alon, U. (2015). Supporting
information text. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1004055.s001
chicago: Friedlander, Tamar, Avraham E. Mayo, Tsvi Tlusty, and Uri Alon. “Supporting
Information Text.” Public Library of Science, 2015. https://doi.org/10.1371/journal.pcbi.1004055.s001.
ieee: T. Friedlander, A. E. Mayo, T. Tlusty, and U. Alon, “Supporting information
text.” Public Library of Science, 2015.
ista: Friedlander T, Mayo AE, Tlusty T, Alon U. 2015. Supporting information text,
Public Library of Science, 10.1371/journal.pcbi.1004055.s001.
mla: Friedlander, Tamar, et al. Supporting Information Text. Public Library
of Science, 2015, doi:10.1371/journal.pcbi.1004055.s001.
short: T. Friedlander, A.E. Mayo, T. Tlusty, U. Alon, (2015).
date_created: 2021-07-26T08:35:23Z
date_published: 2015-03-23T00:00:00Z
date_updated: 2025-09-23T08:43:16Z
day: '23'
department:
- _id: GaTk
doi: 10.1371/journal.pcbi.1004055.s001
fulldoi: https://doi.org/10.1371/journal.pcbi.1004055.s001
month: '03'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1827'
relation: used_in_publication
status: public
status: public
title: Supporting information text
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9719'
abstract:
- lang: eng
text: Parasitism creates selection for resistance mechanisms in host populations
and is hypothesized to promote increased host evolvability. However, the influence
of these traits on host evolution when parasites are no longer present is unclear.
We used experimental evolution and whole-genome sequencing of Escherichia coli
to determine the effects of past and present exposure to parasitic viruses (phages)
on the spread of mutator alleles, resistance, and bacterial competitive fitness.
We found that mutator alleles spread rapidly during adaptation to any of four
different phage species, and this pattern was even more pronounced with multiple
phages present simultaneously. However, hypermutability did not detectably accelerate
adaptation in the absence of phages and recovery of fitness costs associated with
resistance. Several lineages evolved phage resistance through elevated mucoidy,
and during subsequent evolution in phage-free conditions they rapidly reverted
to nonmucoid, phage-susceptible phenotypes. Genome sequencing revealed that this
phenotypic reversion was achieved by additional genetic changes rather than by
genotypic reversion of the initial resistance mutations. Insertion sequence (IS)
elements played a key role in both the acquisition of resistance and adaptation
in the absence of parasites; unlike single nucleotide polymorphisms, IS insertions
were not more frequent in mutator lineages. Our results provide a genetic explanation
for rapid reversion of mucoidy, a phenotype observed in other bacterial species
including human pathogens. Moreover, this demonstrates that the types of genetic
change underlying adaptation to fitness costs, and consequently the impact of
evolvability mechanisms such as increased point-mutation rates, depend critically
on the mechanism of resistance.
article_processing_charge: No
author:
- first_name: Sébastien
full_name: Wielgoss, Sébastien
last_name: Wielgoss
- first_name: Tobias
full_name: Bergmiller, Tobias
id: 2C471CFA-F248-11E8-B48F-1D18A9856A87
last_name: Bergmiller
orcid: 0000-0001-5396-4346
- first_name: Anna M.
full_name: Bischofberger, Anna M.
last_name: Bischofberger
- first_name: Alex R.
full_name: Hall, Alex R.
last_name: Hall
citation:
ama: 'Wielgoss S, Bergmiller T, Bischofberger AM, Hall AR. Data from: Adaptation
to parasites and costs of parasite resistance in mutator and non-mutator bacteria.
2015. doi:10.5061/dryad.cj910'
apa: 'Wielgoss, S., Bergmiller, T., Bischofberger, A. M., & Hall, A. R. (2015).
Data from: Adaptation to parasites and costs of parasite resistance in mutator
and non-mutator bacteria. Dryad. https://doi.org/10.5061/dryad.cj910'
chicago: 'Wielgoss, Sébastien, Tobias Bergmiller, Anna M. Bischofberger, and Alex
R. Hall. “Data from: Adaptation to Parasites and Costs of Parasite Resistance
in Mutator and Non-Mutator Bacteria.” Dryad, 2015. https://doi.org/10.5061/dryad.cj910.'
ieee: 'S. Wielgoss, T. Bergmiller, A. M. Bischofberger, and A. R. Hall, “Data from:
Adaptation to parasites and costs of parasite resistance in mutator and non-mutator
bacteria.” Dryad, 2015.'
ista: 'Wielgoss S, Bergmiller T, Bischofberger AM, Hall AR. 2015. Data from: Adaptation
to parasites and costs of parasite resistance in mutator and non-mutator bacteria,
Dryad, 10.5061/dryad.cj910.'
mla: 'Wielgoss, Sébastien, et al. Data from: Adaptation to Parasites and Costs
of Parasite Resistance in Mutator and Non-Mutator Bacteria. Dryad, 2015, doi:10.5061/dryad.cj910.'
short: S. Wielgoss, T. Bergmiller, A.M. Bischofberger, A.R. Hall, (2015).
date_created: 2021-07-26T08:44:04Z
date_published: 2015-12-21T00:00:00Z
date_updated: 2026-04-29T05:57:01Z
day: '21'
department:
- _id: CaGu
doi: 10.5061/dryad.cj910
fulldoi: https://doi.org/10.5061/dryad.cj910
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.cj910
month: '12'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '5749'
relation: used_in_publication
status: public
status: public
title: 'Data from: Adaptation to parasites and costs of parasite resistance in mutator
and non-mutator bacteria'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9737'
article_processing_charge: No
author:
- first_name: Olga
full_name: Symonova, Olga
id: 3C0C7BC6-F248-11E8-B48F-1D18A9856A87
last_name: Symonova
orcid: 0000-0003-2012-9947
- first_name: Christopher
full_name: Topp, Christopher
last_name: Topp
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: Symonova O, Topp C, Edelsbrunner H. Root traits computed by DynamicRoots for
the maize root shown in fig 2. 2015. doi:10.1371/journal.pone.0127657.s001
apa: Symonova, O., Topp, C., & Edelsbrunner, H. (2015). Root traits computed
by DynamicRoots for the maize root shown in fig 2. Public Library of Science.
https://doi.org/10.1371/journal.pone.0127657.s001
chicago: Symonova, Olga, Christopher Topp, and Herbert Edelsbrunner. “Root Traits
Computed by DynamicRoots for the Maize Root Shown in Fig 2.” Public Library of
Science, 2015. https://doi.org/10.1371/journal.pone.0127657.s001.
ieee: O. Symonova, C. Topp, and H. Edelsbrunner, “Root traits computed by DynamicRoots
for the maize root shown in fig 2.” Public Library of Science, 2015.
ista: Symonova O, Topp C, Edelsbrunner H. 2015. Root traits computed by DynamicRoots
for the maize root shown in fig 2, Public Library of Science, 10.1371/journal.pone.0127657.s001.
mla: Symonova, Olga, et al. Root Traits Computed by DynamicRoots for the Maize
Root Shown in Fig 2. Public Library of Science, 2015, doi:10.1371/journal.pone.0127657.s001.
short: O. Symonova, C. Topp, H. Edelsbrunner, (2015).
date_created: 2021-07-28T06:20:13Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2025-09-23T08:30:43Z
day: '01'
department:
- _id: MaJö
- _id: HeEd
doi: 10.1371/journal.pone.0127657.s001
fulldoi: https://doi.org/10.1371/journal.pone.0127657.s001
month: '06'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1793'
relation: used_in_publication
status: public
status: public
title: Root traits computed by DynamicRoots for the maize root shown in fig 2
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9742'
abstract:
- lang: eng
text: 'Repeated pathogen exposure is a common threat in colonies of social insects,
posing selection pressures on colony members to respond with improved disease-defense
performance. We here tested whether experience gained by repeated tending of low-level
fungus-exposed (Metarhizium robertsii) larvae may alter the performance of sanitary
brood care in the clonal ant, Platythyrea punctata. We trained ants individually
over nine consecutive trials to either sham-treated or fungus-exposed larvae.
We then compared the larval grooming behavior of naive and trained ants and measured
how effectively they removed infectious fungal conidiospores from the fungus-exposed
larvae. We found that the ants changed the duration of larval grooming in response
to both, larval treatment and their level of experience: (1) sham-treated larvae
received longer grooming than the fungus-exposed larvae and (2) trained ants performed
less self-grooming but longer larval grooming than naive ants, which was true
for both, ants trained to fungus-exposed and also to sham-treated larvae. Ants
that groomed the fungus-exposed larvae for longer periods removed a higher number
of fungal conidiospores from the surface of the fungus-exposed larvae. As experienced
ants performed longer larval grooming, they were more effective in fungal removal,
thus making them better caretakers under pathogen attack of the colony. By studying
this clonal ant, we can thus conclude that even in the absence of genetic variation
between colony members, differences in experience levels of brood care may affect
performance of sanitary brood care in social insects.'
article_processing_charge: No
author:
- first_name: Claudia
full_name: Westhus, Claudia
last_name: Westhus
- first_name: Line V
full_name: Ugelvig, Line V
id: 3DC97C8E-F248-11E8-B48F-1D18A9856A87
last_name: Ugelvig
orcid: 0000-0003-1832-8883
- first_name: Edouard
full_name: Tourdot, Edouard
last_name: Tourdot
- first_name: Jürgen
full_name: Heinze, Jürgen
last_name: Heinze
- first_name: Claudie
full_name: Doums, Claudie
last_name: Doums
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: 'Westhus C, Ugelvig LV, Tourdot E, Heinze J, Doums C, Cremer S. Data from:
Increased grooming after repeated brood care provides sanitary benefits in a clonal
ant. 2015. doi:10.5061/dryad.7kc79'
apa: 'Westhus, C., Ugelvig, L. V., Tourdot, E., Heinze, J., Doums, C., & Cremer,
S. (2015). Data from: Increased grooming after repeated brood care provides sanitary
benefits in a clonal ant. Dryad. https://doi.org/10.5061/dryad.7kc79'
chicago: 'Westhus, Claudia, Line V Ugelvig, Edouard Tourdot, Jürgen Heinze, Claudie
Doums, and Sylvia Cremer. “Data from: Increased Grooming after Repeated Brood
Care Provides Sanitary Benefits in a Clonal Ant.” Dryad, 2015. https://doi.org/10.5061/dryad.7kc79.'
ieee: 'C. Westhus, L. V. Ugelvig, E. Tourdot, J. Heinze, C. Doums, and S. Cremer,
“Data from: Increased grooming after repeated brood care provides sanitary benefits
in a clonal ant.” Dryad, 2015.'
ista: 'Westhus C, Ugelvig LV, Tourdot E, Heinze J, Doums C, Cremer S. 2015. Data
from: Increased grooming after repeated brood care provides sanitary benefits
in a clonal ant, Dryad, 10.5061/dryad.7kc79.'
mla: 'Westhus, Claudia, et al. Data from: Increased Grooming after Repeated Brood
Care Provides Sanitary Benefits in a Clonal Ant. Dryad, 2015, doi:10.5061/dryad.7kc79.'
short: C. Westhus, L.V. Ugelvig, E. Tourdot, J. Heinze, C. Doums, S. Cremer, (2015).
date_created: 2021-07-28T08:52:53Z
date_published: 2015-07-09T00:00:00Z
date_updated: 2025-09-29T11:42:25Z
day: '09'
department:
- _id: SyCr
doi: 10.5061/dryad.7kc79
fulldoi: https://doi.org/10.5061/dryad.7kc79
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.7kc79
month: '07'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '2161'
relation: used_in_publication
status: public
status: public
title: 'Data from: Increased grooming after repeated brood care provides sanitary
benefits in a clonal ant'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9765'
article_processing_charge: No
author:
- first_name: Guillaume
full_name: Chevereau, Guillaume
id: 424D78A0-F248-11E8-B48F-1D18A9856A87
last_name: Chevereau
- first_name: Marta
full_name: Lukacisinova, Marta
id: 4342E402-F248-11E8-B48F-1D18A9856A87
last_name: Lukacisinova
orcid: 0000-0002-2519-8004
- first_name: Tugce
full_name: Batur, Tugce
last_name: Batur
- first_name: Aysegul
full_name: Guvenek, Aysegul
last_name: Guvenek
- first_name: Dilay Hazal
full_name: Ayhan, Dilay Hazal
last_name: Ayhan
- first_name: Erdal
full_name: Toprak, Erdal
last_name: Toprak
- first_name: Mark Tobias
full_name: Bollenbach, Mark Tobias
id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
last_name: Bollenbach
orcid: 0000-0003-4398-476X
citation:
ama: Chevereau G, Lukacisinova M, Batur T, et al. Gene ontology enrichment analysis
for the most sensitive gene deletion strains for all drugs. 2015. doi:10.1371/journal.pbio.1002299.s008
apa: Chevereau, G., Lukacisinova, M., Batur, T., Guvenek, A., Ayhan, D. H., Toprak,
E., & Bollenbach, M. T. (2015). Gene ontology enrichment analysis for the
most sensitive gene deletion strains for all drugs. Public Library of Science.
https://doi.org/10.1371/journal.pbio.1002299.s008
chicago: Chevereau, Guillaume, Marta Lukacisinova, Tugce Batur, Aysegul Guvenek,
Dilay Hazal Ayhan, Erdal Toprak, and Mark Tobias Bollenbach. “Gene Ontology Enrichment
Analysis for the Most Sensitive Gene Deletion Strains for All Drugs.” Public Library
of Science, 2015. https://doi.org/10.1371/journal.pbio.1002299.s008.
ieee: G. Chevereau et al., “Gene ontology enrichment analysis for the most
sensitive gene deletion strains for all drugs.” Public Library of Science, 2015.
ista: Chevereau G, Lukacisinova M, Batur T, Guvenek A, Ayhan DH, Toprak E, Bollenbach
MT. 2015. Gene ontology enrichment analysis for the most sensitive gene deletion
strains for all drugs, Public Library of Science, 10.1371/journal.pbio.1002299.s008.
mla: Chevereau, Guillaume, et al. Gene Ontology Enrichment Analysis for the Most
Sensitive Gene Deletion Strains for All Drugs. Public Library of Science,
2015, doi:10.1371/journal.pbio.1002299.s008.
short: G. Chevereau, M. Lukacisinova, T. Batur, A. Guvenek, D.H. Ayhan, E. Toprak,
M.T. Bollenbach, (2015).
date_created: 2021-08-03T07:05:16Z
date_published: 2015-11-18T00:00:00Z
date_updated: 2025-09-23T09:58:54Z
day: '18'
department:
- _id: ToBo
doi: 10.1371/journal.pbio.1002299.s008
fulldoi: https://doi.org/10.1371/journal.pbio.1002299.s008
month: '11'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1619'
relation: used_in_publication
status: public
status: public
title: Gene ontology enrichment analysis for the most sensitive gene deletion strains
for all drugs
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9772'
article_processing_charge: No
author:
- first_name: Barbora
full_name: Trubenova, Barbora
id: 42302D54-F248-11E8-B48F-1D18A9856A87
last_name: Trubenova
orcid: 0000-0002-6873-2967
- first_name: Sebastian
full_name: Novak, Sebastian
id: 461468AE-F248-11E8-B48F-1D18A9856A87
last_name: Novak
orcid: 0000-0002-2519-824X
- first_name: Reinmar
full_name: Hager, Reinmar
last_name: Hager
citation:
ama: Trubenova B, Novak S, Hager R. Description of the agent based simulations.
2015. doi:10.1371/journal.pone.0126907.s003
apa: Trubenova, B., Novak, S., & Hager, R. (2015). Description of the agent
based simulations. Public Library of Science. https://doi.org/10.1371/journal.pone.0126907.s003
chicago: Trubenova, Barbora, Sebastian Novak, and Reinmar Hager. “Description of
the Agent Based Simulations.” Public Library of Science, 2015. https://doi.org/10.1371/journal.pone.0126907.s003.
ieee: B. Trubenova, S. Novak, and R. Hager, “Description of the agent based simulations.”
Public Library of Science, 2015.
ista: Trubenova B, Novak S, Hager R. 2015. Description of the agent based simulations,
Public Library of Science, 10.1371/journal.pone.0126907.s003.
mla: Trubenova, Barbora, et al. Description of the Agent Based Simulations.
Public Library of Science, 2015, doi:10.1371/journal.pone.0126907.s003.
short: B. Trubenova, S. Novak, R. Hager, (2015).
date_created: 2021-08-05T12:55:20Z
date_published: 2015-05-18T00:00:00Z
date_updated: 2025-09-23T09:21:54Z
day: '18'
department:
- _id: NiBa
doi: 10.1371/journal.pone.0126907.s003
fulldoi: https://doi.org/10.1371/journal.pone.0126907.s003
month: '05'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1809'
relation: used_in_publication
status: public
status: public
title: Description of the agent based simulations
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9773'
article_processing_charge: No
author:
- first_name: Tamar
full_name: Friedlander, Tamar
id: 36A5845C-F248-11E8-B48F-1D18A9856A87
last_name: Friedlander
- first_name: Avraham E.
full_name: Mayo, Avraham E.
last_name: Mayo
- first_name: Tsvi
full_name: Tlusty, Tsvi
last_name: Tlusty
- first_name: Uri
full_name: Alon, Uri
last_name: Alon
citation:
ama: Friedlander T, Mayo AE, Tlusty T, Alon U. Evolutionary simulation code. 2015.
doi:10.1371/journal.pcbi.1004055.s002
apa: Friedlander, T., Mayo, A. E., Tlusty, T., & Alon, U. (2015). Evolutionary
simulation code. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1004055.s002
chicago: Friedlander, Tamar, Avraham E. Mayo, Tsvi Tlusty, and Uri Alon. “Evolutionary
Simulation Code.” Public Library of Science, 2015. https://doi.org/10.1371/journal.pcbi.1004055.s002.
ieee: T. Friedlander, A. E. Mayo, T. Tlusty, and U. Alon, “Evolutionary simulation
code.” Public Library of Science, 2015.
ista: Friedlander T, Mayo AE, Tlusty T, Alon U. 2015. Evolutionary simulation code,
Public Library of Science, 10.1371/journal.pcbi.1004055.s002.
mla: Friedlander, Tamar, et al. Evolutionary Simulation Code. Public Library
of Science, 2015, doi:10.1371/journal.pcbi.1004055.s002.
short: T. Friedlander, A.E. Mayo, T. Tlusty, U. Alon, (2015).
date_created: 2021-08-05T12:58:07Z
date_published: 2015-03-23T00:00:00Z
date_updated: 2025-09-23T08:43:16Z
day: '23'
department:
- _id: GaTk
doi: 10.1371/journal.pcbi.1004055.s002
fulldoi: https://doi.org/10.1371/journal.pcbi.1004055.s002
month: '03'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1827'
relation: used_in_publication
status: public
status: public
title: Evolutionary simulation code
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
OA_place: repository
OA_type: green
_id: '1729'
abstract:
- lang: eng
text: We present a computer-aided programming approach to concurrency. The approach
allows programmers to program assuming a friendly, non-preemptive scheduler, and
our synthesis procedure inserts synchronization to ensure that the final program
works even with a preemptive scheduler. The correctness specification is implicit,
inferred from the non-preemptive behavior. Let us consider sequences of calls
that the program makes to an external interface. The specification requires that
any such sequence produced under a preemptive scheduler should be included in
the set of such sequences produced under a non-preemptive scheduler. The solution
is based on a finitary abstraction, an algorithm for bounded language inclusion
modulo an independence relation, and rules for inserting synchronization. We apply
the approach to device-driver programming, where the driver threads call the software
interface of the device and the API provided by the operating system. Our experiments
demonstrate that our synthesis method is precise and efficient, and, since it
does not require explicit specifications, is more practical than the conventional
approach based on user-provided assertions.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- first_name: Edmund
full_name: Clarke, Edmund
last_name: Clarke
- 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: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
- first_name: Leonid
full_name: Ryzhyk, Leonid
last_name: Ryzhyk
- first_name: Roopsha
full_name: Samanta, Roopsha
id: 3D2AAC08-F248-11E8-B48F-1D18A9856A87
last_name: Samanta
- first_name: Thorsten
full_name: Tarrach, Thorsten
id: 3D6E8F2C-F248-11E8-B48F-1D18A9856A87
last_name: Tarrach
orcid: 0000-0003-4409-8487
citation:
ama: Cerny P, Clarke E, Henzinger TA, et al. From non-preemptive to preemptive scheduling
using synchronization synthesis. 2015;9207:180-197. doi:10.1007/978-3-319-21668-3_11
apa: 'Cerny, P., Clarke, E., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., Samanta,
R., & Tarrach, T. (2015). From non-preemptive to preemptive scheduling using
synchronization synthesis. Presented at the CAV: Computer Aided Verification,
San Francisco, CA, United States: Springer. https://doi.org/10.1007/978-3-319-21668-3_11'
chicago: Cerny, Pavol, Edmund Clarke, Thomas A Henzinger, Arjun Radhakrishna, Leonid
Ryzhyk, Roopsha Samanta, and Thorsten Tarrach. “From Non-Preemptive to Preemptive
Scheduling Using Synchronization Synthesis.” Lecture Notes in Computer Science.
Springer, 2015. https://doi.org/10.1007/978-3-319-21668-3_11.
ieee: P. Cerny et al., “From non-preemptive to preemptive scheduling using
synchronization synthesis,” vol. 9207. Springer, pp. 180–197, 2015.
ista: Cerny P, Clarke E, Henzinger TA, Radhakrishna A, Ryzhyk L, Samanta R, Tarrach
T. 2015. From non-preemptive to preemptive scheduling using synchronization synthesis.
9207, 180–197.
mla: Cerny, Pavol, et al. From Non-Preemptive to Preemptive Scheduling Using
Synchronization Synthesis. Vol. 9207, Springer, 2015, pp. 180–97, doi:10.1007/978-3-319-21668-3_11.
short: P. Cerny, E. Clarke, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, R. Samanta,
T. Tarrach, 9207 (2015) 180–197.
conference:
end_date: 2015-07-24
location: San Francisco, CA, United States
name: 'CAV: Computer Aided Verification'
start_date: 2015-07-18
date_created: 2018-12-11T11:53:42Z
date_published: 2015-07-01T00:00:00Z
date_updated: 2026-04-09T10:54:00Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-319-21668-3_11
ec_funded: 1
external_id:
isi:
- '000491470400011'
file:
- access_level: open_access
checksum: 6ff58ac220e2f20cb001ba35d4924495
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:53Z
date_updated: 2025-06-26T07:12:35Z
file_id: '4715'
file_name: IST-2015-336-v1+1_long_version.pdf
file_size: 481922
relation: main_file
file_date_updated: 2025-06-26T07:12:35Z
fulldoi: https://doi.org/10.1007/978-3-319-21668-3_11
has_accepted_license: '1'
intvolume: ' 9207'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 180 - 197
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Springer
publist_id: '5398'
pubrep_id: '336'
quality_controlled: '1'
related_material:
record:
- id: '1338'
relation: later_version
status: public
- id: '1130'
relation: dissertation_contains
status: public
scopus_import: '1'
series_title: Lecture Notes in Computer Science
status: public
title: From non-preemptive to preemptive scheduling using synchronization synthesis
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9207
year: '2015'
...
---
_id: '1730'
abstract:
- lang: eng
text: How much cutting is needed to simplify the topology of a surface? We provide
bounds for several instances of this question, for the minimum length of topologically
non-trivial closed curves, pants decompositions, and cut graphs with a given combinatorial
map in triangulated combinatorial surfaces (or their dual cross-metric counterpart).
Our work builds upon Riemannian systolic inequalities, which bound the minimum
length of non-trivial closed curves in terms of the genus and the area of the
surface. We first describe a systematic way to translate Riemannian systolic inequalities
to a discrete setting, and vice-versa. This implies a conjecture by Przytycka
and Przytycki (Graph structure theory. Contemporary Mathematics, vol. 147, 1993),
a number of new systolic inequalities in the discrete setting, and the fact that
a theorem of Hutchinson on the edge-width of triangulated surfaces and Gromov’s
systolic inequality for surfaces are essentially equivalent. We also discuss how
these proofs generalize to higher dimensions. Then we focus on topological decompositions
of surfaces. Relying on ideas of Buser, we prove the existence of pants decompositions
of length O(g^(3/2)n^(1/2)) for any triangulated combinatorial surface of genus
g with n triangles, and describe an O(gn)-time algorithm to compute such a decomposition.
Finally, we consider the problem of embedding a cut graph (or more generally a
cellular graph) with a given combinatorial map on a given surface. Using random
triangulations, we prove (essentially) that, for any choice of a combinatorial
map, there are some surfaces on which any cellular embedding with that combinatorial
map has length superlinear in the number of triangles of the triangulated combinatorial
surface. There is also a similar result for graphs embedded on polyhedral triangulations.
article_processing_charge: No
arxiv: 1
author:
- first_name: Éric
full_name: Colin De Verdière, Éric
last_name: Colin De Verdière
- first_name: Alfredo
full_name: Hubard, Alfredo
last_name: Hubard
- first_name: Arnaud N
full_name: De Mesmay, Arnaud N
id: 3DB2F25C-F248-11E8-B48F-1D18A9856A87
last_name: De Mesmay
citation:
ama: Colin De Verdière É, Hubard A, de Mesmay AN. Discrete systolic inequalities
and decompositions of triangulated surfaces. Discrete & Computational Geometry.
2015;53(3):587-620. doi:10.1007/s00454-015-9679-9
apa: Colin De Verdière, É., Hubard, A., & de Mesmay, A. N. (2015). Discrete
systolic inequalities and decompositions of triangulated surfaces. Discrete
& Computational Geometry. Springer. https://doi.org/10.1007/s00454-015-9679-9
chicago: Colin De Verdière, Éric, Alfredo Hubard, and Arnaud N de Mesmay. “Discrete
Systolic Inequalities and Decompositions of Triangulated Surfaces.” Discrete
& Computational Geometry. Springer, 2015. https://doi.org/10.1007/s00454-015-9679-9.
ieee: É. Colin De Verdière, A. Hubard, and A. N. de Mesmay, “Discrete systolic inequalities
and decompositions of triangulated surfaces,” Discrete & Computational
Geometry, vol. 53, no. 3. Springer, pp. 587–620, 2015.
ista: Colin De Verdière É, Hubard A, de Mesmay AN. 2015. Discrete systolic inequalities
and decompositions of triangulated surfaces. Discrete & Computational Geometry.
53(3), 587–620.
mla: Colin De Verdière, Éric, et al. “Discrete Systolic Inequalities and Decompositions
of Triangulated Surfaces.” Discrete & Computational Geometry, vol.
53, no. 3, Springer, 2015, pp. 587–620, doi:10.1007/s00454-015-9679-9.
short: É. Colin De Verdière, A. Hubard, A.N. de Mesmay, Discrete & Computational
Geometry 53 (2015) 587–620.
date_created: 2018-12-11T11:53:42Z
date_published: 2015-04-02T00:00:00Z
date_updated: 2025-09-23T08:27:38Z
day: '02'
department:
- _id: UlWa
doi: 10.1007/s00454-015-9679-9
external_id:
arxiv:
- '1408.4036'
isi:
- '000353895200006'
fulldoi: https://doi.org/10.1007/s00454-015-9679-9
intvolume: ' 53'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1408.4036
month: '04'
oa: 1
oa_version: Preprint
page: 587 - 620
publication: Discrete & Computational Geometry
publication_status: published
publisher: Springer
publist_id: '5397'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Discrete systolic inequalities and decompositions of triangulated surfaces
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 53
year: '2015'
...
---
_id: '1731'
abstract:
- lang: eng
text: 'We consider two-player zero-sum games on graphs. These games can be classified
on the basis of the information of the players and on the mode of interaction
between them. On the basis of information the classification is as follows: (a)
partial-observation (both players have partial view of the game); (b) one-sided
complete-observation (one player has complete observation); and (c) complete-observation
(both players have complete view of the game). On the basis of mode of interaction
we have the following classification: (a) concurrent (both players interact simultaneously);
and (b) turn-based (both players interact in turn). The two sources of randomness
in these games are randomness in transition function and randomness in strategies.
In general, randomized strategies are more powerful than deterministic strategies,
and randomness in transitions gives more general classes of games. In this work
we present a complete characterization for the classes of games where randomness
is not helpful in: (a) the transition function probabilistic transition can be
simulated by deterministic transition); and (b) strategies (pure strategies are
as powerful as randomized strategies). As consequence of our characterization
we obtain new undecidability results for these games. '
article_processing_charge: No
arxiv: 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: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Hugo
full_name: Gimbert, Hugo
last_name: Gimbert
- 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, Gimbert H, Henzinger TA. Randomness for free. Information
and Computation. 2015;245(12):3-16. doi:10.1016/j.ic.2015.06.003
apa: Chatterjee, K., Doyen, L., Gimbert, H., & Henzinger, T. A. (2015). Randomness
for free. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2015.06.003
chicago: Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger.
“Randomness for Free.” Information and Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.06.003.
ieee: K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for
free,” Information and Computation, vol. 245, no. 12. Elsevier, pp. 3–16,
2015.
ista: Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2015. Randomness for free.
Information and Computation. 245(12), 3–16.
mla: Chatterjee, Krishnendu, et al. “Randomness for Free.” Information and Computation,
vol. 245, no. 12, Elsevier, 2015, pp. 3–16, doi:10.1016/j.ic.2015.06.003.
short: K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, Information and Computation
245 (2015) 3–16.
corr_author: '1'
date_created: 2018-12-11T11:53:42Z
date_published: 2015-12-01T00:00:00Z
date_updated: 2025-09-23T10:32:00Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1016/j.ic.2015.06.003
ec_funded: 1
external_id:
arxiv:
- '1006.0673'
isi:
- '000368899100002'
fulldoi: https://doi.org/10.1016/j.ic.2015.06.003
intvolume: ' 245'
isi: 1
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1006.0673
month: '12'
oa: 1
oa_version: Preprint
page: 3 - 16
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _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: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Information and Computation
publication_status: published
publisher: Elsevier
publist_id: '5395'
quality_controlled: '1'
related_material:
record:
- id: '3856'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Randomness for free
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 245
year: '2015'
...
---
_id: '1732'
abstract:
- lang: eng
text: We consider partially observable Markov decision processes (POMDPs), that
are a standard framework for robotics applications to model uncertainties present
in the real world, with temporal logic specifications. All temporal logic specifications
in linear-time temporal logic (LTL) can be expressed as parity objectives. We
study the qualitative analysis problem for POMDPs with parity objectives that
asks whether there is a controller (policy) to ensure that the objective holds
with probability 1 (almost-surely). While the qualitative analysis of POMDPs with
parity objectives is undecidable, recent results show that when restricted to
finite-memory policies the problem is EXPTIME-complete. While the problem is intractable
in theory, we present a practical approach to solve the qualitative analysis problem.
We designed several heuristics to deal with the exponential complexity, and have
used our implementation on a number of well-known POMDP examples for robotics
applications. Our results provide the first practical approach to solve the qualitative
analysis of robot motion planning with LTL properties in the presence of uncertainty.
arxiv: 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: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Raghav
full_name: Gupta, Raghav
last_name: Gupta
- first_name: Ayush
full_name: Kanodia, Ayush
last_name: Kanodia
citation:
ama: 'Chatterjee K, Chmelik M, Gupta R, Kanodia A. Qualitative analysis of POMDPs
with temporal logic specifications for robotics applications. In: IEEE; 2015:325-330.
doi:10.1109/ICRA.2015.7139019'
apa: 'Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2015). Qualitative
analysis of POMDPs with temporal logic specifications for robotics applications
(pp. 325–330). Presented at the ICRA: International Conference on Robotics and
Automation, Seattle, WA, United States: IEEE. https://doi.org/10.1109/ICRA.2015.7139019'
chicago: Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia.
“Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics
Applications,” 325–30. IEEE, 2015. https://doi.org/10.1109/ICRA.2015.7139019.
ieee: 'K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Qualitative analysis
of POMDPs with temporal logic specifications for robotics applications,” presented
at the ICRA: International Conference on Robotics and Automation, Seattle, WA,
United States, 2015, pp. 325–330.'
ista: 'Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2015. Qualitative analysis of
POMDPs with temporal logic specifications for robotics applications. ICRA: International
Conference on Robotics and Automation, 325–330.'
mla: Chatterjee, Krishnendu, et al. Qualitative Analysis of POMDPs with Temporal
Logic Specifications for Robotics Applications. IEEE, 2015, pp. 325–30, doi:10.1109/ICRA.2015.7139019.
short: K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, in:, IEEE, 2015, pp. 325–330.
conference:
end_date: 2015-05-30
location: Seattle, WA, United States
name: 'ICRA: International Conference on Robotics and Automation'
start_date: 2015-05-26
date_created: 2018-12-11T11:53:43Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2023-02-23T12:25:52Z
day: '01'
department:
- _id: KrCh
doi: 10.1109/ICRA.2015.7139019
ec_funded: 1
external_id:
arxiv:
- '1409.3360'
fulldoi: https://doi.org/10.1109/ICRA.2015.7139019
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1409.3360
month: '01'
oa: 1
oa_version: Preprint
page: 325 - 330
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_status: published
publisher: IEEE
publist_id: '5394'
quality_controlled: '1'
related_material:
record:
- id: '5424'
relation: earlier_version
status: public
- id: '5426'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Qualitative analysis of POMDPs with temporal logic specifications for robotics
applications
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1734'
abstract:
- lang: eng
text: Facial appearance capture is now firmly established within academic research
and used extensively across various application domains, perhaps most prominently
in the entertainment industry through the design of virtual characters in video
games and films. While significant progress has occurred over the last two decades,
no single survey currently exists that discusses the similarities, differences,
and practical considerations of the available appearance capture techniques as
applied to human faces. A central difficulty of facial appearance capture is the
way light interacts with skin-which has a complex multi-layered structure-and
the interactions that occur below the skin surface can, by definition, only be
observed indirectly. In this report, we distinguish between two broad strategies
for dealing with this complexity. "Image-based methods" try to exhaustively
capture the exact face appearance under different lighting and viewing conditions,
and then render the face through weighted image combinations. "Parametric
methods" instead fit the captured reflectance data to some parametric appearance
model used during rendering, allowing for a more lightweight and flexible representation
but at the cost of potentially increased rendering complexity or inexact reproduction.
The goal of this report is to provide an overview that can guide practitioners
and researchers in assessing the tradeoffs between current approaches and identifying
directions for future advances in facial appearance capture.
article_processing_charge: No
author:
- first_name: Oliver
full_name: Klehm, Oliver
last_name: Klehm
- first_name: Fabrice
full_name: Rousselle, Fabrice
last_name: Rousselle
- first_name: Marios
full_name: Papas, Marios
last_name: Papas
- first_name: Derek
full_name: Bradley, Derek
last_name: Bradley
- first_name: Christophe
full_name: Hery, Christophe
last_name: Hery
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Wojciech
full_name: Jarosz, Wojciech
last_name: Jarosz
- first_name: Thabo
full_name: Beeler, Thabo
last_name: Beeler
citation:
ama: Klehm O, Rousselle F, Papas M, et al. Recent advances in facial appearance
capture. Computer Graphics Forum. 2015;34(2):709-733. doi:10.1111/cgf.12594
apa: Klehm, O., Rousselle, F., Papas, M., Bradley, D., Hery, C., Bickel, B., … Beeler,
T. (2015). Recent advances in facial appearance capture. Computer Graphics
Forum. Wiley-Blackwell. https://doi.org/10.1111/cgf.12594
chicago: Klehm, Oliver, Fabrice Rousselle, Marios Papas, Derek Bradley, Christophe
Hery, Bernd Bickel, Wojciech Jarosz, and Thabo Beeler. “Recent Advances in Facial
Appearance Capture.” Computer Graphics Forum. Wiley-Blackwell, 2015. https://doi.org/10.1111/cgf.12594.
ieee: O. Klehm et al., “Recent advances in facial appearance capture,” Computer
Graphics Forum, vol. 34, no. 2. Wiley-Blackwell, pp. 709–733, 2015.
ista: Klehm O, Rousselle F, Papas M, Bradley D, Hery C, Bickel B, Jarosz W, Beeler
T. 2015. Recent advances in facial appearance capture. Computer Graphics Forum.
34(2), 709–733.
mla: Klehm, Oliver, et al. “Recent Advances in Facial Appearance Capture.” Computer
Graphics Forum, vol. 34, no. 2, Wiley-Blackwell, 2015, pp. 709–33, doi:10.1111/cgf.12594.
short: O. Klehm, F. Rousselle, M. Papas, D. Bradley, C. Hery, B. Bickel, W. Jarosz,
T. Beeler, Computer Graphics Forum 34 (2015) 709–733.
date_created: 2018-12-11T11:53:43Z
date_published: 2015-05-01T00:00:00Z
date_updated: 2025-09-23T10:32:38Z
day: '01'
department:
- _id: BeBi
doi: 10.1111/cgf.12594
external_id:
isi:
- '000358326600063'
fulldoi: https://doi.org/10.1111/cgf.12594
intvolume: ' 34'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- url: https://graphics.ethz.ch/~mpapas/publications/fac_star.pdf
month: '05'
oa_version: None
page: 709 - 733
publication: Computer Graphics Forum
publication_status: published
publisher: Wiley-Blackwell
publist_id: '5391'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Recent advances in facial appearance capture
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 34
year: '2015'
...
---
_id: '1735'
abstract:
- lang: eng
text: This work presents a method for efficiently simplifying the pressure projection
step in a liquid simulation. We first devise a straightforward dimension reduction
technique that dramatically reduces the cost of solving the pressure projection.
Next, we introduce a novel change of basis that satisfies free-surface boundary
conditions exactly, regardless of the accuracy of the pressure solve. When combined,
these ideas greatly reduce the computational complexity of the pressure solve
without compromising free surface boundary conditions at the highest level of
detail. Our techniques are easy to parallelize, and they effectively eliminate
the computational bottleneck for large liquid simulations.
acknowledgement: The first author was supported by a JSPS Postdoctoral Fellowship
for Research Abroad
article_processing_charge: No
author:
- first_name: Ryoichi
full_name: Ando, Ryoichi
last_name: Ando
- first_name: Nils
full_name: Thürey, Nils
last_name: Thürey
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
citation:
ama: Ando R, Thürey N, Wojtan C. A dimension-reduced pressure solver for liquid
simulations. Computer Graphics Forum. 2015;34(2):473-480. doi:10.1111/cgf.12576
apa: Ando, R., Thürey, N., & Wojtan, C. (2015). A dimension-reduced pressure
solver for liquid simulations. Computer Graphics Forum. Wiley. https://doi.org/10.1111/cgf.12576
chicago: Ando, Ryoichi, Nils Thürey, and Chris Wojtan. “A Dimension-Reduced Pressure
Solver for Liquid Simulations.” Computer Graphics Forum. Wiley, 2015. https://doi.org/10.1111/cgf.12576.
ieee: R. Ando, N. Thürey, and C. Wojtan, “A dimension-reduced pressure solver for
liquid simulations,” Computer Graphics Forum, vol. 34, no. 2. Wiley, pp.
473–480, 2015.
ista: Ando R, Thürey N, Wojtan C. 2015. A dimension-reduced pressure solver for
liquid simulations. Computer Graphics Forum. 34(2), 473–480.
mla: Ando, Ryoichi, et al. “A Dimension-Reduced Pressure Solver for Liquid Simulations.”
Computer Graphics Forum, vol. 34, no. 2, Wiley, 2015, pp. 473–80, doi:10.1111/cgf.12576.
short: R. Ando, N. Thürey, C. Wojtan, Computer Graphics Forum 34 (2015) 473–480.
date_created: 2018-12-11T11:53:44Z
date_published: 2015-05-01T00:00:00Z
date_updated: 2025-09-22T14:29:19Z
day: '01'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1111/cgf.12576
external_id:
isi:
- '000358326600045'
file:
- access_level: open_access
checksum: 590752bf977855b337a80f78a9bc2404
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:30Z
date_updated: 2020-07-14T12:45:15Z
file_id: '5218'
file_name: IST-2016-607-v1+1_coarsegrid.pdf
file_size: 6312352
relation: main_file
file_date_updated: 2020-07-14T12:45:15Z
fulldoi: https://doi.org/10.1111/cgf.12576
has_accepted_license: '1'
intvolume: ' 34'
isi: 1
issue: '2'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 473 - 480
publication: Computer Graphics Forum
publication_status: published
publisher: Wiley
publist_id: '5389'
pubrep_id: '607'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A dimension-reduced pressure solver for liquid simulations
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 34
year: '2015'
...
---
_id: '1789'
abstract:
- lang: eng
text: Intellectual disability (ID) has an estimated prevalence of 2-3%. Due to its
extreme heterogeneity, the genetic basis of ID remains elusive in many cases.
Recently, whole exome sequencing (WES) studies revealed that a large proportion
of sporadic cases are caused by de novo gene variants. To identify further genes
involved in ID, we performed WES in 250 patients with unexplained ID and their
unaffected parents and included exomes of 51 previously sequenced child-parents
trios in the analysis. Exome analysis revealed de novo intragenic variants in
SET domain-containing 5 (SETD5) in two patients. One patient carried a nonsense
variant, and the other an 81 bp deletion located across a splice-donor site. Chromosomal
microarray diagnostics further identified four de novo non-recurrent microdeletions
encompassing SETD5. CRISPR/Cas9 mutation modelling of the two intragenic variants
demonstrated nonsense-mediated decay of the resulting transcripts, pointing to
a loss-of-function (LoF) and haploinsufficiency as the common disease-causing
mechanism of intragenic SETD5 sequence variants and SETD5-containing microdeletions.
In silico domain prediction of SETD5, a predicted SET domain-containing histone
methyltransferase (HMT), substantiated the presence of a SET domain and identified
a novel putative PHD domain, strengthening a functional link to well-known histone-modifying
ID genes. All six patients presented with ID and certain facial dysmorphisms,
suggesting that SETD5 sequence variants contribute substantially to the microdeletion
3p25.3 phenotype. The present report of two SETD5 LoF variants in 301 patients
demonstrates a prevalence of 0.7% and thus SETD5 variants as a relatively frequent
cause of ID.
article_processing_charge: No
author:
- first_name: Alma
full_name: Kuechler, Alma
last_name: Kuechler
- first_name: Alexander
full_name: Zink, Alexander
last_name: Zink
- first_name: Thomas
full_name: Wieland, Thomas
last_name: Wieland
- first_name: Hermann
full_name: Lüdecke, Hermann
last_name: Lüdecke
- first_name: Kirsten
full_name: Cremer, Kirsten
last_name: Cremer
- first_name: Leonardo
full_name: Salviati, Leonardo
last_name: Salviati
- first_name: Pamela
full_name: Magini, Pamela
last_name: Magini
- first_name: Kimia
full_name: Najafi, Kimia
last_name: Najafi
- first_name: Christiane
full_name: Zweier, Christiane
last_name: Zweier
- first_name: Johanna
full_name: Czeschik, Johanna
last_name: Czeschik
- first_name: Stefan
full_name: Aretz, Stefan
last_name: Aretz
- first_name: Sabine
full_name: Endele, Sabine
last_name: Endele
- first_name: Federica
full_name: Tamburrino, Federica
last_name: Tamburrino
- first_name: Claudia
full_name: Pinato, Claudia
last_name: Pinato
- first_name: Maurizio
full_name: Clementi, Maurizio
last_name: Clementi
- first_name: Jasmin
full_name: Gundlach, Jasmin
last_name: Gundlach
- first_name: Carina
full_name: Maylahn, Carina
last_name: Maylahn
- first_name: Laura
full_name: Mazzanti, Laura
last_name: Mazzanti
- first_name: Eva
full_name: Wohlleber, Eva
last_name: Wohlleber
- first_name: Thomas
full_name: Schwarzmayr, Thomas
last_name: Schwarzmayr
- first_name: Roxana
full_name: Kariminejad, Roxana
last_name: Kariminejad
- first_name: Avner
full_name: Schlessinger, Avner
last_name: Schlessinger
- first_name: Dagmar
full_name: Wieczorek, Dagmar
last_name: Wieczorek
- first_name: Tim
full_name: Strom, Tim
last_name: Strom
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
- first_name: Hartmut
full_name: Engels, Hartmut
last_name: Engels
citation:
ama: Kuechler A, Zink A, Wieland T, et al. Loss-of-function variants of SETD5 cause
intellectual disability and the core phenotype of microdeletion 3p25.3 syndrome.
European Journal of Human Genetics. 2015;23(6):753-760. doi:10.1038/ejhg.2014.165
apa: Kuechler, A., Zink, A., Wieland, T., Lüdecke, H., Cremer, K., Salviati, L.,
… Engels, H. (2015). Loss-of-function variants of SETD5 cause intellectual disability
and the core phenotype of microdeletion 3p25.3 syndrome. European Journal of
Human Genetics. Nature Publishing Group. https://doi.org/10.1038/ejhg.2014.165
chicago: Kuechler, Alma, Alexander Zink, Thomas Wieland, Hermann Lüdecke, Kirsten
Cremer, Leonardo Salviati, Pamela Magini, et al. “Loss-of-Function Variants of
SETD5 Cause Intellectual Disability and the Core Phenotype of Microdeletion 3p25.3
Syndrome.” European Journal of Human Genetics. Nature Publishing Group,
2015. https://doi.org/10.1038/ejhg.2014.165.
ieee: A. Kuechler et al., “Loss-of-function variants of SETD5 cause intellectual
disability and the core phenotype of microdeletion 3p25.3 syndrome,” European
Journal of Human Genetics, vol. 23, no. 6. Nature Publishing Group, pp. 753–760,
2015.
ista: Kuechler A, Zink A, Wieland T, Lüdecke H, Cremer K, Salviati L, Magini P,
Najafi K, Zweier C, Czeschik J, Aretz S, Endele S, Tamburrino F, Pinato C, Clementi
M, Gundlach J, Maylahn C, Mazzanti L, Wohlleber E, Schwarzmayr T, Kariminejad
R, Schlessinger A, Wieczorek D, Strom T, Novarino G, Engels H. 2015. Loss-of-function
variants of SETD5 cause intellectual disability and the core phenotype of microdeletion
3p25.3 syndrome. European Journal of Human Genetics. 23(6), 753–760.
mla: Kuechler, Alma, et al. “Loss-of-Function Variants of SETD5 Cause Intellectual
Disability and the Core Phenotype of Microdeletion 3p25.3 Syndrome.” European
Journal of Human Genetics, vol. 23, no. 6, Nature Publishing Group, 2015,
pp. 753–60, doi:10.1038/ejhg.2014.165.
short: A. Kuechler, A. Zink, T. Wieland, H. Lüdecke, K. Cremer, L. Salviati, P.
Magini, K. Najafi, C. Zweier, J. Czeschik, S. Aretz, S. Endele, F. Tamburrino,
C. Pinato, M. Clementi, J. Gundlach, C. Maylahn, L. Mazzanti, E. Wohlleber, T.
Schwarzmayr, R. Kariminejad, A. Schlessinger, D. Wieczorek, T. Strom, G. Novarino,
H. Engels, European Journal of Human Genetics 23 (2015) 753–760.
date_created: 2018-12-11T11:54:01Z
date_published: 2015-06-15T00:00:00Z
date_updated: 2025-09-23T09:30:27Z
day: '15'
department:
- _id: GaNo
doi: 10.1038/ejhg.2014.165
external_id:
isi:
- '000354474600013'
pmid:
- '25138099'
fulldoi: https://doi.org/10.1038/ejhg.2014.165
intvolume: ' 23'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4795044/
month: '06'
oa: 1
oa_version: Submitted Version
page: 753 - 760
pmid: 1
publication: European Journal of Human Genetics
publication_status: published
publisher: Nature Publishing Group
publist_id: '5324'
quality_controlled: '1'
status: public
title: Loss-of-function variants of SETD5 cause intellectual disability and the core
phenotype of microdeletion 3p25.3 syndrome
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 23
year: '2015'
...
---
_id: '1793'
abstract:
- lang: eng
text: We present a software platform for reconstructing and analyzing the growth
of a plant root system from a time-series of 3D voxelized shapes. It aligns the
shapes with each other, constructs a geometric graph representation together with
the function that records the time of growth, and organizes the branches into
a hierarchy that reflects the order of creation. The software includes the automatic
computation of structural and dynamic traits for each root in the system enabling
the quantification of growth on fine-scale. These are important advances in plant
phenotyping with applications to the study of genetic and environmental influences
on growth.
article_number: e0127657
article_processing_charge: No
author:
- first_name: Olga
full_name: Symonova, Olga
id: 3C0C7BC6-F248-11E8-B48F-1D18A9856A87
last_name: Symonova
orcid: 0000-0003-2012-9947
- first_name: Christopher
full_name: Topp, Christopher
last_name: Topp
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: 'Symonova O, Topp C, Edelsbrunner H. DynamicRoots: A software platform for
the reconstruction and analysis of growing plant roots. PLoS One. 2015;10(6).
doi:10.1371/journal.pone.0127657'
apa: 'Symonova, O., Topp, C., & Edelsbrunner, H. (2015). DynamicRoots: A software
platform for the reconstruction and analysis of growing plant roots. PLoS One.
Public Library of Science. https://doi.org/10.1371/journal.pone.0127657'
chicago: 'Symonova, Olga, Christopher Topp, and Herbert Edelsbrunner. “DynamicRoots:
A Software Platform for the Reconstruction and Analysis of Growing Plant Roots.”
PLoS One. Public Library of Science, 2015. https://doi.org/10.1371/journal.pone.0127657.'
ieee: 'O. Symonova, C. Topp, and H. Edelsbrunner, “DynamicRoots: A software platform
for the reconstruction and analysis of growing plant roots,” PLoS One,
vol. 10, no. 6. Public Library of Science, 2015.'
ista: 'Symonova O, Topp C, Edelsbrunner H. 2015. DynamicRoots: A software platform
for the reconstruction and analysis of growing plant roots. PLoS One. 10(6), e0127657.'
mla: 'Symonova, Olga, et al. “DynamicRoots: A Software Platform for the Reconstruction
and Analysis of Growing Plant Roots.” PLoS One, vol. 10, no. 6, e0127657,
Public Library of Science, 2015, doi:10.1371/journal.pone.0127657.'
short: O. Symonova, C. Topp, H. Edelsbrunner, PLoS One 10 (2015).
corr_author: '1'
date_created: 2018-12-11T11:54:02Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2025-09-23T08:30:43Z
day: '01'
ddc:
- '000'
department:
- _id: MaJö
- _id: HeEd
doi: 10.1371/journal.pone.0127657
external_id:
isi:
- '000356630900069'
file:
- access_level: open_access
checksum: d20f26461ca575276ad3ed9ce4bfc787
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:30Z
date_updated: 2020-07-14T12:45:16Z
file_id: '5150'
file_name: IST-2016-454-v1+1_journal.pone.0127657.pdf
file_size: 1850825
relation: main_file
file_date_updated: 2020-07-14T12:45:16Z
fulldoi: https://doi.org/10.1371/journal.pone.0127657
has_accepted_license: '1'
intvolume: ' 10'
isi: 1
issue: '6'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '06'
oa: 1
oa_version: Published Version
publication: PLoS One
publication_status: published
publisher: Public Library of Science
publist_id: '5318'
pubrep_id: '454'
quality_controlled: '1'
related_material:
record:
- id: '9737'
relation: research_data
status: public
scopus_import: '1'
status: public
title: 'DynamicRoots: A software platform for the reconstruction and analysis of growing
plant roots'
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: 10
year: '2015'
...
---
_id: '1804'
abstract:
- lang: eng
text: It is known that in classical fluids turbulence typically occurs at high Reynolds
numbers. But can turbulence occur at low Reynolds numbers? Here we investigate
the transition to turbulence in the classic Taylor-Couette system in which the
rotating fluids are manufactured ferrofluids with magnetized nanoparticles embedded
in liquid carriers. We find that, in the presence of a magnetic field transverse
to the symmetry axis of the system, turbulence can occur at Reynolds numbers that
are at least one order of magnitude smaller than those in conventional fluids.
This is established by extensive computational ferrohydrodynamics through a detailed
investigation of transitions in the flow structure, and characterization of behaviors
of physical quantities such as the energy, the wave number, and the angular momentum
through the bifurcations. A finding is that, as the magnetic field is increased,
onset of turbulence can be determined accurately and reliably. Our results imply
that experimental investigation of turbulence may be feasible by using ferrofluids.
Our study of transition to and evolution of turbulence in the Taylor-Couette ferrofluidic
flow system provides insights into the challenging problem of turbulence control.
article_number: '10781'
article_processing_charge: No
author:
- first_name: Sebastian
full_name: Altmeyer, Sebastian
id: 2EE67FDC-F248-11E8-B48F-1D18A9856A87
last_name: Altmeyer
orcid: 0000-0001-5964-0203
- first_name: Younghae
full_name: Do, Younghae
last_name: Do
- first_name: Ying
full_name: Lai, Ying
last_name: Lai
citation:
ama: Altmeyer S, Do Y, Lai Y. Transition to turbulence in Taylor-Couette ferrofluidic
flow. Scientific Reports. 2015;5. doi:10.1038/srep10781
apa: Altmeyer, S., Do, Y., & Lai, Y. (2015). Transition to turbulence in Taylor-Couette
ferrofluidic flow. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/srep10781
chicago: Altmeyer, Sebastian, Younghae Do, and Ying Lai. “Transition to Turbulence
in Taylor-Couette Ferrofluidic Flow.” Scientific Reports. Nature Publishing
Group, 2015. https://doi.org/10.1038/srep10781.
ieee: S. Altmeyer, Y. Do, and Y. Lai, “Transition to turbulence in Taylor-Couette
ferrofluidic flow,” Scientific Reports, vol. 5. Nature Publishing Group,
2015.
ista: Altmeyer S, Do Y, Lai Y. 2015. Transition to turbulence in Taylor-Couette
ferrofluidic flow. Scientific Reports. 5, 10781.
mla: Altmeyer, Sebastian, et al. “Transition to Turbulence in Taylor-Couette Ferrofluidic
Flow.” Scientific Reports, vol. 5, 10781, Nature Publishing Group, 2015,
doi:10.1038/srep10781.
short: S. Altmeyer, Y. Do, Y. Lai, Scientific Reports 5 (2015).
corr_author: '1'
date_created: 2018-12-11T11:54:06Z
date_published: 2015-06-12T00:00:00Z
date_updated: 2025-09-29T10:58:13Z
day: '12'
ddc:
- '530'
department:
- _id: BjHo
doi: 10.1038/srep10781
external_id:
isi:
- '000356150200001'
file:
- access_level: open_access
checksum: 7716f582f8c9d82d8f2bf80bf896b440
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:26Z
date_updated: 2020-07-14T12:45:16Z
file_id: '5280'
file_name: IST-2016-450-v1+1_srep10781.pdf
file_size: 2449723
relation: main_file
file_date_updated: 2020-07-14T12:45:16Z
fulldoi: https://doi.org/10.1038/srep10781
has_accepted_license: '1'
intvolume: ' 5'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: Scientific Reports
publication_status: published
publisher: Nature Publishing Group
publist_id: '5306'
pubrep_id: '450'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Transition to turbulence in Taylor-Couette ferrofluidic flow
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: '2015'
...
---
OA_place: publisher
OA_type: free access
_id: '1805'
abstract:
- lang: eng
text: 'We consider the problem of deciding whether the persistent homology group
of a simplicial pair (K,L) can be realized as the homology H∗(X) of some complex
X with L ⊂ X ⊂ K. We show that this problem is NP-complete even if K is embedded
in double-struck R3. As a consequence, we show that it is NP-hard to simplify
level and sublevel sets of scalar functions on double-struck S3 within a given
tolerance constraint. This problem has relevance to the visualization of medical
images by isosurfaces. We also show an implication to the theory of well groups
of scalar functions: not every well group can be realized by some level set, and
deciding whether a well group can be realized is NP-hard.'
article_processing_charge: No
article_type: original
author:
- first_name: Dominique
full_name: Attali, Dominique
last_name: Attali
- first_name: Ulrich
full_name: Bauer, Ulrich
id: 2ADD483A-F248-11E8-B48F-1D18A9856A87
last_name: Bauer
orcid: 0000-0002-9683-0724
- first_name: Olivier
full_name: Devillers, Olivier
last_name: Devillers
- first_name: Marc
full_name: Glisse, Marc
last_name: Glisse
- first_name: André
full_name: Lieutier, André
last_name: Lieutier
citation:
ama: 'Attali D, Bauer U, Devillers O, Glisse M, Lieutier A. Homological reconstruction
and simplification in R3. Computational Geometry: Theory and Applications.
2015;48(8):606-621. doi:10.1016/j.comgeo.2014.08.010'
apa: 'Attali, D., Bauer, U., Devillers, O., Glisse, M., & Lieutier, A. (2015).
Homological reconstruction and simplification in R3. Computational Geometry:
Theory and Applications. Elsevier. https://doi.org/10.1016/j.comgeo.2014.08.010'
chicago: 'Attali, Dominique, Ulrich Bauer, Olivier Devillers, Marc Glisse, and André
Lieutier. “Homological Reconstruction and Simplification in R3.” Computational
Geometry: Theory and Applications. Elsevier, 2015. https://doi.org/10.1016/j.comgeo.2014.08.010.'
ieee: 'D. Attali, U. Bauer, O. Devillers, M. Glisse, and A. Lieutier, “Homological
reconstruction and simplification in R3,” Computational Geometry: Theory and
Applications, vol. 48, no. 8. Elsevier, pp. 606–621, 2015.'
ista: 'Attali D, Bauer U, Devillers O, Glisse M, Lieutier A. 2015. Homological reconstruction
and simplification in R3. Computational Geometry: Theory and Applications. 48(8),
606–621.'
mla: 'Attali, Dominique, et al. “Homological Reconstruction and Simplification in
R3.” Computational Geometry: Theory and Applications, vol. 48, no. 8, Elsevier,
2015, pp. 606–21, doi:10.1016/j.comgeo.2014.08.010.'
short: 'D. Attali, U. Bauer, O. Devillers, M. Glisse, A. Lieutier, Computational
Geometry: Theory and Applications 48 (2015) 606–621.'
corr_author: '1'
date_created: 2018-12-11T11:54:06Z
date_published: 2015-06-03T00:00:00Z
date_updated: 2026-06-18T17:57:28Z
day: '03'
ddc:
- '500'
department:
- _id: HeEd
doi: 10.1016/j.comgeo.2014.08.010
ec_funded: 1
external_id:
isi:
- '000357353200006'
fulldoi: https://doi.org/10.1016/j.comgeo.2014.08.010
intvolume: ' 48'
isi: 1
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.comgeo.2014.08.010
month: '06'
oa: 1
oa_version: Published Version
page: 606 - 621
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: 'Computational Geometry: Theory and Applications'
publication_status: published
publisher: Elsevier
publist_id: '5305'
quality_controlled: '1'
related_material:
record:
- id: '2812'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Homological reconstruction and simplification in R3
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 48
year: '2015'
...