---
_id: '1633'
abstract:
- lang: eng
  text: "We present a method for simulating brittle fracture under the assumptions
    of quasi-static linear elastic fracture mechanics (LEFM). Using the boundary element
    method (BEM) and Lagrangian crack-fronts, we produce highly detailed fracture
    surfaces. The computational cost of the BEM is alleviated by using a low-resolution
    mesh and interpolating the resulting stress intensity factors when propagating
    the high-resolution crack-front.\r\n\r\nOur system produces physics-based fracture
    surfaces with high spatial and temporal resolution, taking spatial variation of
    material toughness and/or strength into account. It also allows for crack initiation
    to be handled separately from crack propagation, which is not only more reasonable
    from a physics perspective, but can also be used to control the simulation.\r\n\r\nSeparating
    the resolution of the crack-front from the resolution of the computational mesh
    increases the efficiency and therefore the amount of visual detail on the resulting
    fracture surfaces. The BEM also allows us to re-use previously computed blocks
    of the system matrix."
article_number: '151'
article_processing_charge: No
author:
- first_name: David
  full_name: Hahn, David
  id: 357A6A66-F248-11E8-B48F-1D18A9856A87
  last_name: Hahn
- 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: 'Hahn D, Wojtan C. High-resolution brittle fracture simulation with boundary
    elements. In: Vol 34. ACM; 2015. doi:<a href="https://doi.org/10.1145/2766896">10.1145/2766896</a>'
  apa: 'Hahn, D., &#38; Wojtan, C. (2015). High-resolution brittle fracture simulation
    with boundary elements (Vol. 34). Presented at the SIGGRAPH: Special Interest
    Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United
    States: ACM. <a href="https://doi.org/10.1145/2766896">https://doi.org/10.1145/2766896</a>'
  chicago: Hahn, David, and Chris Wojtan. “High-Resolution Brittle Fracture Simulation
    with Boundary Elements,” Vol. 34. ACM, 2015. <a href="https://doi.org/10.1145/2766896">https://doi.org/10.1145/2766896</a>.
  ieee: 'D. Hahn and C. Wojtan, “High-resolution brittle fracture simulation with
    boundary elements,” presented at the SIGGRAPH: Special Interest Group on Computer
    Graphics and Interactive Techniques, Los Angeles, CA, United States, 2015, vol.
    34, no. 4.'
  ista: 'Hahn D, Wojtan C. 2015. High-resolution brittle fracture simulation with
    boundary elements. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive
    Techniques vol. 34, 151.'
  mla: Hahn, David, and Chris Wojtan. <i>High-Resolution Brittle Fracture Simulation
    with Boundary Elements</i>. Vol. 34, no. 4, 151, ACM, 2015, doi:<a href="https://doi.org/10.1145/2766896">10.1145/2766896</a>.
  short: D. Hahn, C. Wojtan, in:, ACM, 2015.
conference:
  end_date: 2015-08-13
  location: Los Angeles, CA, United States
  name: 'SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques'
  start_date: 2015-08-09
corr_author: '1'
date_created: 2018-12-11T11:53:09Z
date_published: 2015-07-27T00:00:00Z
date_updated: 2026-07-29T13:27:24Z
day: '27'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/2766896
ec_funded: 1
external_id:
  isi:
  - '000358786600117'
file:
- access_level: open_access
  checksum: 955aee971983f6b6152bcc1c9b4a7c20
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:15:13Z
  date_updated: 2020-07-14T12:45:07Z
  file_id: '5131'
  file_name: IST-2016-609-v1+1_FractureBEM.pdf
  file_size: 20154270
  relation: main_file
file_date_updated: 2020-07-14T12:45:07Z
has_accepted_license: '1'
intvolume: '        34'
isi: 1
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '638176'
  name: 'Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large
    Scales'
publication_status: published
publisher: ACM
publist_id: '5522'
pubrep_id: '609'
quality_controlled: '1'
related_material:
  record:
  - id: '839'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: High-resolution brittle fracture simulation with boundary elements
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 34
year: '2015'
...
---
_id: '1830'
abstract:
- lang: eng
  text: To prevent epidemics, insect societies have evolved collective disease defences
    that are highly effective at curing exposed individuals and limiting disease transmission
    to healthy group members. Grooming is an important sanitary behaviour—either performed
    towards oneself (self-grooming) or towards others (allogrooming)—to remove infectious
    agents from the body surface of exposed individuals, but at the risk of disease
    contraction by the groomer. We use garden ants (Lasius neglectus) and the fungal
    pathogen Metarhizium as a model system to study how pathogen presence affects
    self-grooming and allogrooming between exposed and healthy individuals. We develop
    an epidemiological SIS model to explore how experimentally observed grooming patterns
    affect disease spread within the colony, thereby providing a direct link between
    the expression and direction of sanitary behaviours, and their effects on colony-level
    epidemiology. We find that fungus-exposed ants increase self-grooming, while simultaneously
    decreasing allogrooming. This behavioural modulation seems universally adaptive
    and is predicted to contain disease spread in a great variety of host–pathogen
    systems. In contrast, allogrooming directed towards pathogen-exposed individuals
    might both increase and decrease disease risk. Our model reveals that the effect
    of allogrooming depends on the balance between pathogen infectiousness and efficiency
    of social host defences, which are likely to vary across host–pathogen systems.
acknowledgement: We thank Meghan L. Vyleta for the genetical fungal strain characterization
  and Eva Sixt for ant drawings, Matthias Konrad for discussion and Christopher D.
  Pull, Barbara Casillas-Peréz, Sebastian Novak, as well as three anonymous reviewers
  and the theme issue editors Peter Kappeler and Charlie Nunn for valuable comments
  on the manuscript.
article_processing_charge: No
article_type: original
author:
- first_name: Fabian
  full_name: Theis, Fabian
  last_name: Theis
- 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: Carsten
  full_name: Marr, Carsten
  last_name: Marr
- first_name: Sylvia
  full_name: Cremer, Sylvia
  id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
  last_name: Cremer
  orcid: 0000-0002-2193-3868
citation:
  ama: Theis F, Ugelvig LV, Marr C, Cremer S. Opposing effects of allogrooming on
    disease transmission in ant societies. <i>Philosophical Transactions of the Royal
    Society of London Series B, Biological Sciences</i>. 2015;370(1669). doi:<a href="https://doi.org/10.1098/rstb.2014.0108">10.1098/rstb.2014.0108</a>
  apa: Theis, F., Ugelvig, L. V., Marr, C., &#38; Cremer, S. (2015). Opposing effects
    of allogrooming on disease transmission in ant societies. <i>Philosophical Transactions
    of the Royal Society of London. Series B, Biological Sciences</i>. Royal Society.
    <a href="https://doi.org/10.1098/rstb.2014.0108">https://doi.org/10.1098/rstb.2014.0108</a>
  chicago: Theis, Fabian, Line V Ugelvig, Carsten Marr, and Sylvia Cremer. “Opposing
    Effects of Allogrooming on Disease Transmission in Ant Societies.” <i>Philosophical
    Transactions of the Royal Society of London. Series B, Biological Sciences</i>.
    Royal Society, 2015. <a href="https://doi.org/10.1098/rstb.2014.0108">https://doi.org/10.1098/rstb.2014.0108</a>.
  ieee: F. Theis, L. V. Ugelvig, C. Marr, and S. Cremer, “Opposing effects of allogrooming
    on disease transmission in ant societies,” <i>Philosophical Transactions of the
    Royal Society of London. Series B, Biological Sciences</i>, vol. 370, no. 1669.
    Royal Society, 2015.
  ista: Theis F, Ugelvig LV, Marr C, Cremer S. 2015. Opposing effects of allogrooming
    on disease transmission in ant societies. Philosophical Transactions of the Royal
    Society of London. Series B, Biological Sciences. 370(1669).
  mla: Theis, Fabian, et al. “Opposing Effects of Allogrooming on Disease Transmission
    in Ant Societies.” <i>Philosophical Transactions of the Royal Society of London.
    Series B, Biological Sciences</i>, vol. 370, no. 1669, Royal Society, 2015, doi:<a
    href="https://doi.org/10.1098/rstb.2014.0108">10.1098/rstb.2014.0108</a>.
  short: F. Theis, L.V. Ugelvig, C. Marr, S. Cremer, Philosophical Transactions of
    the Royal Society of London. Series B, Biological Sciences 370 (2015).
corr_author: '1'
date_created: 2018-12-11T11:54:15Z
date_published: 2015-05-26T00:00:00Z
date_updated: 2026-08-12T06:27:32Z
day: '26'
department:
- _id: SyCr
doi: 10.1098/rstb.2014.0108
ec_funded: 1
external_id:
  isi:
  - '000354143400010'
  pmid:
  - '25870394'
intvolume: '       370'
isi: 1
issue: '1669'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4410374/
month: '05'
oa: 1
oa_version: Submitted Version
pmid: 1
project:
- _id: 25DC711C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '243071'
  name: 'Social Vaccination in Ant Colonies: from Individual Mechanisms to Society
    Effects'
- _id: 25DDF0F0-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '302004'
  name: 'Collective disease defence and pathogen detection abilities in ant societies:
    a chemo-neuro-immunological approach'
- _id: 25E0E184-B435-11E9-9278-68D0E5697425
  name: Schnellboot Antnet Junge Akademie
- _id: 25E24DB2-B435-11E9-9278-68D0E5697425
  name: Fellowship of Wissenschaftskolleg zu Berlin
publication: Philosophical Transactions of the Royal Society of London. Series B,
  Biological Sciences
publication_identifier:
  eissn:
  - 1471-2970
  issn:
  - 0962-8436
publication_status: published
publisher: Royal Society
publist_id: '5273'
quality_controlled: '1'
related_material:
  record:
  - id: '9721'
    relation: research_data
    status: public
scopus_import: '1'
status: public
title: Opposing effects of allogrooming on disease transmission in ant societies
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 370
year: '2015'
...
---
_id: '9721'
abstract:
- lang: eng
  text: To prevent epidemics, insect societies have evolved collective disease defences
    that are highly effective at curing exposed individuals and limiting disease transmission
    to healthy group members. Grooming is an important sanitary behaviour—either performed
    towards oneself (self-grooming) or towards others (allogrooming)—to remove infectious
    agents from the body surface of exposed individuals, but at the risk of disease
    contraction by the groomer. We use garden ants (Lasius neglectus) and the fungal
    pathogen Metarhizium as a model system to study how pathogen presence affects
    self-grooming and allogrooming between exposed and healthy individuals. We develop
    an epidemiological SIS model to explore how experimentally observed grooming patterns
    affect disease spread within the colony, thereby providing a direct link between
    the expression and direction of sanitary behaviours, and their effects on colony-level
    epidemiology. We find that fungus-exposed ants increase self-grooming, while simultaneously
    decreasing allogrooming. This behavioural modulation seems universally adaptive
    and is predicted to contain disease spread in a great variety of host–pathogen
    systems. In contrast, allogrooming directed towards pathogen-exposed individuals
    might both increase and decrease disease risk. Our model reveals that the effect
    of allogrooming depends on the balance between pathogen infectiousness and efficiency
    of social host defences, which are likely to vary across host–pathogen systems.
article_processing_charge: No
author:
- first_name: Fabian
  full_name: Theis, Fabian
  last_name: Theis
- 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: Carsten
  full_name: Marr, Carsten
  last_name: Marr
- first_name: Sylvia
  full_name: Cremer, Sylvia
  id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
  last_name: Cremer
  orcid: 0000-0002-2193-3868
citation:
  ama: 'Theis F, Ugelvig LV, Marr C, Cremer S. Data from: Opposing effects of allogrooming
    on disease transmission in ant societies. 2015. doi:<a href="https://doi.org/10.5061/dryad.dj2bf">10.5061/dryad.dj2bf</a>'
  apa: 'Theis, F., Ugelvig, L. V., Marr, C., &#38; Cremer, S. (2015). Data from: Opposing
    effects of allogrooming on disease transmission in ant societies. Dryad. <a href="https://doi.org/10.5061/dryad.dj2bf">https://doi.org/10.5061/dryad.dj2bf</a>'
  chicago: 'Theis, Fabian, Line V Ugelvig, Carsten Marr, and Sylvia Cremer. “Data
    from: Opposing Effects of Allogrooming on Disease Transmission in Ant Societies.”
    Dryad, 2015. <a href="https://doi.org/10.5061/dryad.dj2bf">https://doi.org/10.5061/dryad.dj2bf</a>.'
  ieee: 'F. Theis, L. V. Ugelvig, C. Marr, and S. Cremer, “Data from: Opposing effects
    of allogrooming on disease transmission in ant societies.” Dryad, 2015.'
  ista: 'Theis F, Ugelvig LV, Marr C, Cremer S. 2015. Data from: Opposing effects
    of allogrooming on disease transmission in ant societies, Dryad, <a href="https://doi.org/10.5061/dryad.dj2bf">10.5061/dryad.dj2bf</a>.'
  mla: 'Theis, Fabian, et al. <i>Data from: Opposing Effects of Allogrooming on Disease
    Transmission in Ant Societies</i>. Dryad, 2015, doi:<a href="https://doi.org/10.5061/dryad.dj2bf">10.5061/dryad.dj2bf</a>.'
  short: F. Theis, L.V. Ugelvig, C. Marr, S. Cremer, (2015).
date_created: 2021-07-26T09:38:36Z
date_published: 2015-12-29T00:00:00Z
date_updated: 2026-08-12T06:27:32Z
day: '29'
department:
- _id: SyCr
doi: 10.5061/dryad.dj2bf
main_file_link:
- open_access: '1'
  url: https://doi.org/10.5061/dryad.dj2bf
month: '12'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
  record:
  - id: '1830'
    relation: used_in_publication
    status: public
status: public
title: 'Data from: Opposing effects of allogrooming on disease transmission in ant
  societies'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '1811'
abstract:
- lang: eng
  text: Atomic form factors are widely used for the characterization of targets and
    specimens, from crystallography to biology. By using recent mathematical results,
    here we derive an analytical expression for the atomic form factor within the
    independent particle model constructed from nonrelativistic screened hydrogenic
    wave functions. The range of validity of this analytical expression is checked
    by comparing the analytically obtained form factors with the ones obtained within
    the Hartee-Fock method. As an example, we apply our analytical expression for
    the atomic form factor to evaluate the differential cross section for Rayleigh
    scattering off neutral atoms.
acknowledgement: The research leading to these results has received funding from the
  People Programme (Marie Curie Actions) of the European Union’s Seventh Framework
  Programme (FP7/2007-2013) under REA grant agreement n◦ [291734]. F.F. acknowledges
  support by Fundação de Amparo à Pesquisa do estado de Minas Gerais (FAPEMIG), by
  Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq), and by the
  Austrian Science Fund (FWF) through the START Grant No. Y 591-N16.
article_number: '052105'
article_processing_charge: No
arxiv: 1
author:
- first_name: Laleh
  full_name: Safari, Laleh
  id: 3C325E5E-F248-11E8-B48F-1D18A9856A87
  last_name: Safari
- first_name: José
  full_name: Santos, José
  last_name: Santos
- first_name: Pedro
  full_name: Amaro, Pedro
  last_name: Amaro
- first_name: Kari
  full_name: Jänkälä, Kari
  last_name: Jänkälä
- first_name: Filippo
  full_name: Fratini, Filippo
  last_name: Fratini
citation:
  ama: 'Safari L, Santos J, Amaro P, Jänkälä K, Fratini F. Analytical evaluation of
    atomic form factors: Application to Rayleigh scattering. <i>Journal of Mathematical
    Physics</i>. 2015;56(5). doi:<a href="https://doi.org/10.1063/1.4921227">10.1063/1.4921227</a>'
  apa: 'Safari, L., Santos, J., Amaro, P., Jänkälä, K., &#38; Fratini, F. (2015).
    Analytical evaluation of atomic form factors: Application to Rayleigh scattering.
    <i>Journal of Mathematical Physics</i>. AIP Publishing. <a href="https://doi.org/10.1063/1.4921227">https://doi.org/10.1063/1.4921227</a>'
  chicago: 'Safari, Laleh, José Santos, Pedro Amaro, Kari Jänkälä, and Filippo Fratini.
    “Analytical Evaluation of Atomic Form Factors: Application to Rayleigh Scattering.”
    <i>Journal of Mathematical Physics</i>. AIP Publishing, 2015. <a href="https://doi.org/10.1063/1.4921227">https://doi.org/10.1063/1.4921227</a>.'
  ieee: 'L. Safari, J. Santos, P. Amaro, K. Jänkälä, and F. Fratini, “Analytical evaluation
    of atomic form factors: Application to Rayleigh scattering,” <i>Journal of Mathematical
    Physics</i>, vol. 56, no. 5. AIP Publishing, 2015.'
  ista: 'Safari L, Santos J, Amaro P, Jänkälä K, Fratini F. 2015. Analytical evaluation
    of atomic form factors: Application to Rayleigh scattering. Journal of Mathematical
    Physics. 56(5), 052105.'
  mla: 'Safari, Laleh, et al. “Analytical Evaluation of Atomic Form Factors: Application
    to Rayleigh Scattering.” <i>Journal of Mathematical Physics</i>, vol. 56, no.
    5, 052105, AIP Publishing, 2015, doi:<a href="https://doi.org/10.1063/1.4921227">10.1063/1.4921227</a>.'
  short: L. Safari, J. Santos, P. Amaro, K. Jänkälä, F. Fratini, Journal of Mathematical
    Physics 56 (2015).
corr_author: '1'
date_created: 2018-12-11T11:54:08Z
date_published: 2015-05-20T00:00:00Z
date_updated: 2026-08-12T13:58:42Z
day: '20'
department:
- _id: MiLe
doi: 10.1063/1.4921227
ec_funded: 1
external_id:
  arxiv:
  - '1409.0110'
  isi:
  - '000355920800016'
intvolume: '        56'
isi: 1
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1409.0110
month: '05'
oa: 1
oa_version: Preprint
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '291734'
  name: International IST Postdoc Fellowship Programme
publication: Journal of Mathematical Physics
publication_status: published
publisher: AIP Publishing
publist_id: '5295'
scopus_import: '1'
status: public
title: 'Analytical evaluation of atomic form factors: Application to Rayleigh scattering'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 56
year: '2015'
...
---
_id: '1677'
abstract:
- lang: eng
  text: We consider real symmetric and complex Hermitian random matrices with the
    additional symmetry hxy = hN-y,N-x. The matrix elements are independent (up to
    the fourfold symmetry) and not necessarily identically distributed. This ensemble
    naturally arises as the Fourier transform of a Gaussian orthogonal ensemble. Italso
    occurs as the flip matrix model - an approximation of the two-dimensional Anderson
    model at small disorder. We show that the density of states converges to the Wigner
    semicircle law despite the new symmetry type. We also prove the local version
    of the semicircle law on the optimal scale.
article_number: '103301'
article_processing_charge: No
arxiv: 1
author:
- first_name: Johannes
  full_name: Alt, Johannes
  id: 36D3D8B6-F248-11E8-B48F-1D18A9856A87
  last_name: Alt
citation:
  ama: Alt J. The local semicircle law for random matrices with a fourfold symmetry.
    <i>Journal of Mathematical Physics</i>. 2015;56(10). doi:<a href="https://doi.org/10.1063/1.4932606">10.1063/1.4932606</a>
  apa: Alt, J. (2015). The local semicircle law for random matrices with a fourfold
    symmetry. <i>Journal of Mathematical Physics</i>. AIP Publishing. <a href="https://doi.org/10.1063/1.4932606">https://doi.org/10.1063/1.4932606</a>
  chicago: Alt, Johannes. “The Local Semicircle Law for Random Matrices with a Fourfold
    Symmetry.” <i>Journal of Mathematical Physics</i>. AIP Publishing, 2015. <a href="https://doi.org/10.1063/1.4932606">https://doi.org/10.1063/1.4932606</a>.
  ieee: J. Alt, “The local semicircle law for random matrices with a fourfold symmetry,”
    <i>Journal of Mathematical Physics</i>, vol. 56, no. 10. AIP Publishing, 2015.
  ista: Alt J. 2015. The local semicircle law for random matrices with a fourfold
    symmetry. Journal of Mathematical Physics. 56(10), 103301.
  mla: Alt, Johannes. “The Local Semicircle Law for Random Matrices with a Fourfold
    Symmetry.” <i>Journal of Mathematical Physics</i>, vol. 56, no. 10, 103301, AIP
    Publishing, 2015, doi:<a href="https://doi.org/10.1063/1.4932606">10.1063/1.4932606</a>.
  short: J. Alt, Journal of Mathematical Physics 56 (2015).
corr_author: '1'
date_created: 2018-12-11T11:53:25Z
date_published: 2015-10-09T00:00:00Z
date_updated: 2026-08-12T13:58:57Z
day: '09'
department:
- _id: LaEr
doi: 10.1063/1.4932606
ec_funded: 1
external_id:
  arxiv:
  - '1506.04683'
  isi:
  - '000364237000026'
intvolume: '        56'
isi: 1
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1506.04683
month: '10'
oa: 1
oa_version: Preprint
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '338804'
  name: Random matrices, universality and disordered quantum systems
publication: Journal of Mathematical Physics
publication_status: published
publisher: AIP Publishing
publist_id: '5472'
quality_controlled: '1'
related_material:
  record:
  - id: '149'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: The local semicircle law for random matrices with a fourfold symmetry
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 56
year: '2015'
...
---
_id: '1587'
abstract:
- lang: eng
  text: We investigate the quantum interference shifts between energetically close
    states, where the state structure is observed by laser spectroscopy. We report
    a compact and analytical expression that models the quantum interference induced
    shift for any admixture of circular polarization of the incident laser and angle
    of observation. An experimental scenario free of quantum interference can thus
    be predicted with this formula. Although this study is exemplified here for muonic
    deuterium, it can be applied to any other laser spectroscopy measurement of ns-n′p
    frequencies of a nonrelativistic atomic system, via an ns→n′p→n′′s scheme.
article_number: '062506'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Pedro
  full_name: Amaro, Pedro
  last_name: Amaro
- first_name: Filippo
  full_name: Fratini, Filippo
  last_name: Fratini
- first_name: Laleh
  full_name: Safari, Laleh
  id: 3C325E5E-F248-11E8-B48F-1D18A9856A87
  last_name: Safari
- first_name: Aldo
  full_name: Antognini, Aldo
  last_name: Antognini
- first_name: Paul
  full_name: Indelicato, Paul
  last_name: Indelicato
- first_name: Randolf
  full_name: Pohl, Randolf
  last_name: Pohl
- first_name: José
  full_name: Santos, José
  last_name: Santos
citation:
  ama: Amaro P, Fratini F, Safari L, et al. Quantum interference shifts in laser spectroscopy
    with elliptical polarization. <i>Physical Review A</i>. 2015;92(6). doi:<a href="https://doi.org/10.1103/PhysRevA.92.062506">10.1103/PhysRevA.92.062506</a>
  apa: Amaro, P., Fratini, F., Safari, L., Antognini, A., Indelicato, P., Pohl, R.,
    &#38; Santos, J. (2015). Quantum interference shifts in laser spectroscopy with
    elliptical polarization. <i>Physical Review A</i>. American Physical Society.
    <a href="https://doi.org/10.1103/PhysRevA.92.062506">https://doi.org/10.1103/PhysRevA.92.062506</a>
  chicago: Amaro, Pedro, Filippo Fratini, Laleh Safari, Aldo Antognini, Paul Indelicato,
    Randolf Pohl, and José Santos. “Quantum Interference Shifts in Laser Spectroscopy
    with Elliptical Polarization.” <i>Physical Review A</i>. American Physical Society,
    2015. <a href="https://doi.org/10.1103/PhysRevA.92.062506">https://doi.org/10.1103/PhysRevA.92.062506</a>.
  ieee: P. Amaro <i>et al.</i>, “Quantum interference shifts in laser spectroscopy
    with elliptical polarization,” <i>Physical Review A</i>, vol. 92, no. 6. American
    Physical Society, 2015.
  ista: Amaro P, Fratini F, Safari L, Antognini A, Indelicato P, Pohl R, Santos J.
    2015. Quantum interference shifts in laser spectroscopy with elliptical polarization.
    Physical Review A. 92(6), 062506.
  mla: Amaro, Pedro, et al. “Quantum Interference Shifts in Laser Spectroscopy with
    Elliptical Polarization.” <i>Physical Review A</i>, vol. 92, no. 6, 062506, American
    Physical Society, 2015, doi:<a href="https://doi.org/10.1103/PhysRevA.92.062506">10.1103/PhysRevA.92.062506</a>.
  short: P. Amaro, F. Fratini, L. Safari, A. Antognini, P. Indelicato, R. Pohl, J.
    Santos, Physical Review A 92 (2015).
date_created: 2018-12-11T11:52:53Z
date_published: 2015-12-31T00:00:00Z
date_updated: 2026-08-12T14:20:30Z
day: '31'
department:
- _id: MiLe
doi: 10.1103/PhysRevA.92.062506
ec_funded: 1
external_id:
  arxiv:
  - '1511.03585'
  isi:
  - '000367373900002'
intvolume: '        92'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1511.03585
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '291734'
  name: International IST Postdoc Fellowship Programme
publication: Physical Review A
publication_status: published
publisher: American Physical Society
publist_id: '5584'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quantum interference shifts in laser spectroscopy with elliptical polarization
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 92
year: '2015'
...
---
_id: '1940'
abstract:
- lang: eng
  text: We typically think of cells as responding to external signals independently
    by regulating their gene expression levels, yet they often locally exchange information
    and coordinate. Can such spatial coupling be of benefit for conveying signals
    subject to gene regulatory noise? Here we extend our information-theoretic framework
    for gene regulation to spatially extended systems. As an example, we consider
    a lattice of nuclei responding to a concentration field of a transcriptional regulator
    (the &quot;input&quot;) by expressing a single diffusible target gene. When input
    concentrations are low, diffusive coupling markedly improves information transmission;
    optimal gene activation functions also systematically change. A qualitatively
    new regulatory strategy emerges where individual cells respond to the input in
    a nearly step-like fashion that is subsequently averaged out by strong diffusion.
    While motivated by early patterning events in the Drosophila embryo, our framework
    is generically applicable to spatially coupled stochastic gene expression models.
article_number: '062710'
article_processing_charge: No
arxiv: 1
author:
- first_name: Thomas R
  full_name: Sokolowski, Thomas R
  id: 3E999752-F248-11E8-B48F-1D18A9856A87
  last_name: Sokolowski
  orcid: 0000-0002-1287-3779
- first_name: Gasper
  full_name: Tkacik, Gasper
  id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
  last_name: Tkacik
  orcid: 0000-0002-6699-1455
citation:
  ama: Sokolowski TR, Tkačik G. Optimizing information flow in small genetic networks.
    IV. Spatial coupling. <i>Physical Review E</i>. 2015;91(6). doi:<a href="https://doi.org/10.1103/PhysRevE.91.062710">10.1103/PhysRevE.91.062710</a>
  apa: Sokolowski, T. R., &#38; Tkačik, G. (2015). Optimizing information flow in
    small genetic networks. IV. Spatial coupling. <i>Physical Review E</i>. American
    Physical Society. <a href="https://doi.org/10.1103/PhysRevE.91.062710">https://doi.org/10.1103/PhysRevE.91.062710</a>
  chicago: Sokolowski, Thomas R, and Gašper Tkačik. “Optimizing Information Flow in
    Small Genetic Networks. IV. Spatial Coupling.” <i>Physical Review E</i>. American
    Physical Society, 2015. <a href="https://doi.org/10.1103/PhysRevE.91.062710">https://doi.org/10.1103/PhysRevE.91.062710</a>.
  ieee: T. R. Sokolowski and G. Tkačik, “Optimizing information flow in small genetic
    networks. IV. Spatial coupling,” <i>Physical Review E</i>, vol. 91, no. 6. American
    Physical Society, 2015.
  ista: Sokolowski TR, Tkačik G. 2015. Optimizing information flow in small genetic
    networks. IV. Spatial coupling. Physical Review E. 91(6), 062710.
  mla: Sokolowski, Thomas R., and Gašper Tkačik. “Optimizing Information Flow in Small
    Genetic Networks. IV. Spatial Coupling.” <i>Physical Review E</i>, vol. 91, no.
    6, 062710, American Physical Society, 2015, doi:<a href="https://doi.org/10.1103/PhysRevE.91.062710">10.1103/PhysRevE.91.062710</a>.
  short: T.R. Sokolowski, G. Tkačik, Physical Review E 91 (2015).
corr_author: '1'
date_created: 2018-12-11T11:54:49Z
date_published: 2015-06-15T00:00:00Z
date_updated: 2026-08-12T14:28:08Z
day: '15'
department:
- _id: GaTk
doi: 10.1103/PhysRevE.91.062710
external_id:
  arxiv:
  - '1501.04015'
  isi:
  - '000356131600006'
intvolume: '        91'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1501.04015
month: '06'
oa: 1
oa_version: Preprint
publication: Physical Review E
publication_status: published
publisher: American Physical Society
publist_id: '5145'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimizing information flow in small genetic networks. IV. Spatial coupling
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 91
year: '2015'
...
---
_id: '1883'
abstract:
- lang: eng
  text: "We introduce a one-parametric family of tree growth models, in which branching
    probabilities decrease with branch age τ as τ-α. Depending on the exponent α,
    the scaling of tree depth with tree size n displays a transition between the logarithmic
    scaling of random trees and an algebraic growth. At the transition (α=1) tree
    depth grows as (logn)2. This anomalous scaling is in good agreement with the trend
    observed in evolution of biological species, thus providing a theoretical support
    for age-dependent speciation and associating it to the occurrence of a critical
    point.\r\n"
article_number: '022803'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Stephanie
  full_name: Keller-Schmidt, Stephanie
  last_name: Keller-Schmidt
- first_name: Murat
  full_name: Tugrul, Murat
  id: 37C323C6-F248-11E8-B48F-1D18A9856A87
  last_name: Tugrul
  orcid: 0000-0002-8523-0758
- first_name: Víctor
  full_name: Eguíluz, Víctor
  last_name: Eguíluz
- first_name: Emilio
  full_name: Hernandez Garcia, Emilio
  last_name: Hernandez Garcia
- first_name: Konstantin
  full_name: Klemm, Konstantin
  last_name: Klemm
citation:
  ama: Keller-Schmidt S, Tugrul M, Eguíluz V, Hernandez Garcia E, Klemm K. Anomalous
    scaling in an age-dependent branching model. <i>Physical Review E</i>. 2015;91(2).
    doi:<a href="https://doi.org/10.1103/PhysRevE.91.022803">10.1103/PhysRevE.91.022803</a>
  apa: Keller-Schmidt, S., Tugrul, M., Eguíluz, V., Hernandez Garcia, E., &#38; Klemm,
    K. (2015). Anomalous scaling in an age-dependent branching model. <i>Physical
    Review E</i>. American Physical Society. <a href="https://doi.org/10.1103/PhysRevE.91.022803">https://doi.org/10.1103/PhysRevE.91.022803</a>
  chicago: Keller-Schmidt, Stephanie, Murat Tugrul, Víctor Eguíluz, Emilio Hernandez
    Garcia, and Konstantin Klemm. “Anomalous Scaling in an Age-Dependent Branching
    Model.” <i>Physical Review E</i>. American Physical Society, 2015. <a href="https://doi.org/10.1103/PhysRevE.91.022803">https://doi.org/10.1103/PhysRevE.91.022803</a>.
  ieee: S. Keller-Schmidt, M. Tugrul, V. Eguíluz, E. Hernandez Garcia, and K. Klemm,
    “Anomalous scaling in an age-dependent branching model,” <i>Physical Review E</i>,
    vol. 91, no. 2. American Physical Society, 2015.
  ista: Keller-Schmidt S, Tugrul M, Eguíluz V, Hernandez Garcia E, Klemm K. 2015.
    Anomalous scaling in an age-dependent branching model. Physical Review E. 91(2),
    022803.
  mla: Keller-Schmidt, Stephanie, et al. “Anomalous Scaling in an Age-Dependent Branching
    Model.” <i>Physical Review E</i>, vol. 91, no. 2, 022803, American Physical Society,
    2015, doi:<a href="https://doi.org/10.1103/PhysRevE.91.022803">10.1103/PhysRevE.91.022803</a>.
  short: S. Keller-Schmidt, M. Tugrul, V. Eguíluz, E. Hernandez Garcia, K. Klemm,
    Physical Review E 91 (2015).
date_created: 2018-12-11T11:54:31Z
date_published: 2015-02-02T00:00:00Z
date_updated: 2026-08-12T14:26:46Z
day: '02'
department:
- _id: NiBa
doi: 10.1103/PhysRevE.91.022803
external_id:
  arxiv:
  - '1012.3298'
  isi:
  - '000349860900006'
intvolume: '        91'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1012.3298
month: '02'
oa: 1
oa_version: Preprint
publication: Physical Review E
publication_status: published
publisher: American Physical Society
publist_id: '5213'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Anomalous scaling in an age-dependent branching model
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 91
year: '2015'
...
---
_id: '1820'
abstract:
- lang: eng
  text: 'We consider partially observable Markov decision processes (POMDPs) with
    a set of target states and every transition is associated with an integer cost.
    The optimization objec- tive we study asks to minimize the expected total cost
    till the target set is reached, while ensuring that the target set is reached
    almost-surely (with probability 1). We show that for integer costs approximating
    the optimal cost is undecidable. For positive costs, our results are as follows:
    (i) we establish matching lower and upper bounds for the optimal cost and the
    bound is double exponential; (ii) we show that the problem of approximating the
    optimal cost is decidable and present ap- proximation algorithms developing on
    the existing algorithms for POMDPs with finite-horizon objectives. While the worst-
    case running time of our algorithm is double exponential, we present efficient
    stopping criteria for the algorithm and show experimentally that it performs well
    in many examples.'
acknowledgement: ' The research was partly supported by Austrian Science Fund (FWF)
  Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307:
  Graph Games), and Microsoft faculty fellows award.'
alternative_title:
- Artifical Intelligence
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: 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. Optimal cost almost-sure reachability
    in POMDPs. In: <i>Proceedings of the Twenty-Ninth AAAI Conference on Artificial
    Intelligence </i>. Vol 5. AAAI Press; 2015:3496-3502. doi:<a href="https://doi.org/10.1609/aaai.v29i1.9683">10.1609/aaai.v29i1.9683</a>'
  apa: 'Chatterjee, K., Chmelik, M., Gupta, R., &#38; Kanodia, A. (2015). Optimal
    cost almost-sure reachability in POMDPs. In <i>Proceedings of the Twenty-Ninth
    AAAI Conference on Artificial Intelligence </i> (Vol. 5, pp. 3496–3502). Austin,
    TX, USA: AAAI Press. <a href="https://doi.org/10.1609/aaai.v29i1.9683">https://doi.org/10.1609/aaai.v29i1.9683</a>'
  chicago: Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia.
    “Optimal Cost Almost-Sure Reachability in POMDPs.” In <i>Proceedings of the Twenty-Ninth
    AAAI Conference on Artificial Intelligence </i>, 5:3496–3502. AAAI Press, 2015.
    <a href="https://doi.org/10.1609/aaai.v29i1.9683">https://doi.org/10.1609/aaai.v29i1.9683</a>.
  ieee: K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Optimal cost almost-sure
    reachability in POMDPs,” in <i>Proceedings of the Twenty-Ninth AAAI Conference
    on Artificial Intelligence </i>, Austin, TX, USA, 2015, vol. 5, pp. 3496–3502.
  ista: 'Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2015. Optimal cost almost-sure
    reachability in POMDPs. Proceedings of the Twenty-Ninth AAAI Conference on Artificial
    Intelligence . IAAI: Innovative Applications of Artificial Intelligence, Artifical
    Intelligence, vol. 5, 3496–3502.'
  mla: Chatterjee, Krishnendu, et al. “Optimal Cost Almost-Sure Reachability in POMDPs.”
    <i>Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence
    </i>, vol. 5, AAAI Press, 2015, pp. 3496–502, doi:<a href="https://doi.org/10.1609/aaai.v29i1.9683">10.1609/aaai.v29i1.9683</a>.
  short: K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, in:, Proceedings of the
    Twenty-Ninth AAAI Conference on Artificial Intelligence , AAAI Press, 2015, pp.
    3496–3502.
conference:
  end_date: 2015-01-30
  location: Austin, TX, USA
  name: 'IAAI: Innovative Applications of Artificial Intelligence'
  start_date: 2015-01-25
corr_author: '1'
date_created: 2018-12-11T11:54:11Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2026-08-19T09:31:47Z
day: '01'
department:
- _id: KrCh
doi: 10.1609/aaai.v29i1.9683
ec_funded: 1
external_id:
  arxiv:
  - '1411.3880'
  isi:
  - '000372683700002'
intvolume: '         5'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1411.3880
month: '06'
oa: 1
oa_version: Preprint
page: 3496-3502
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P 23499-N23
  name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '279307'
  name: 'Quantitative Graph Games: Theory and Applications'
publication: 'Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence '
publication_status: published
publisher: AAAI Press
publist_id: '5286'
quality_controlled: '1'
related_material:
  record:
  - id: '1529'
    relation: later_version
    status: public
scopus_import: '1'
status: public
title: Optimal cost almost-sure reachability in POMDPs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2015'
...
---
_id: '1619'
abstract:
- lang: eng
  text: The emergence of drug resistant pathogens is a serious public health problem.
    It is a long-standing goal to predict rates of resistance evolution and design
    optimal treatment strategies accordingly. To this end, it is crucial to reveal
    the underlying causes of drug-specific differences in the evolutionary dynamics
    leading to resistance. However, it remains largely unknown why the rates of resistance
    evolution via spontaneous mutations and the diversity of mutational paths vary
    substantially between drugs. Here we comprehensively quantify the distribution
    of fitness effects (DFE) of mutations, a key determinant of evolutionary dynamics,
    in the presence of eight antibiotics representing the main modes of action. Using
    precise high-throughput fitness measurements for genome-wide Escherichia coli
    gene deletion strains, we find that the width of the DFE varies dramatically between
    antibiotics and, contrary to conventional wisdom, for some drugs the DFE width
    is lower than in the absence of stress. We show that this previously underappreciated
    divergence in DFE width among antibiotics is largely caused by their distinct
    drug-specific dose-response characteristics. Unlike the DFE, the magnitude of
    the changes in tolerated drug concentration resulting from genome-wide mutations
    is similar for most drugs but exceptionally small for the antibiotic nitrofurantoin,
    i.e., mutations generally have considerably smaller resistance effects for nitrofurantoin
    than for other drugs. A population genetics model predicts that resistance evolution
    for drugs with this property is severely limited and confined to reproducible
    mutational paths. We tested this prediction in laboratory evolution experiments
    using the “morbidostat”, a device for evolving bacteria in well-controlled drug
    environments. Nitrofurantoin resistance indeed evolved extremely slowly via reproducible
    mutations—an almost paradoxical behavior since this drug causes DNA damage and
    increases the mutation rate. Overall, we identified novel quantitative characteristics
    of the evolutionary landscape that provide the conceptual foundation for predicting
    the dynamics of drug resistance evolution.
article_number: e1002299
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: Dravecka, Marta
  id: 4342E402-F248-11E8-B48F-1D18A9856A87
  last_name: Dravecka
  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
  full_name: Ayhan, Dilay
  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. Quantifying the determinants of
    evolutionary dynamics leading to drug resistance. <i>PLoS Biology</i>. 2015;13(11).
    doi:<a href="https://doi.org/10.1371/journal.pbio.1002299">10.1371/journal.pbio.1002299</a>
  apa: Chevereau, G., Lukacisinova, M., Batur, T., Guvenek, A., Ayhan, D., Toprak,
    E., &#38; Bollenbach, M. T. (2015). Quantifying the determinants of evolutionary
    dynamics leading to drug resistance. <i>PLoS Biology</i>. Public Library of Science.
    <a href="https://doi.org/10.1371/journal.pbio.1002299">https://doi.org/10.1371/journal.pbio.1002299</a>
  chicago: Chevereau, Guillaume, Marta Lukacisinova, Tugce Batur, Aysegul Guvenek,
    Dilay Ayhan, Erdal Toprak, and Mark Tobias Bollenbach. “Quantifying the Determinants
    of Evolutionary Dynamics Leading to Drug Resistance.” <i>PLoS Biology</i>. Public
    Library of Science, 2015. <a href="https://doi.org/10.1371/journal.pbio.1002299">https://doi.org/10.1371/journal.pbio.1002299</a>.
  ieee: G. Chevereau <i>et al.</i>, “Quantifying the determinants of evolutionary
    dynamics leading to drug resistance,” <i>PLoS Biology</i>, vol. 13, no. 11. Public
    Library of Science, 2015.
  ista: Chevereau G, Lukacisinova M, Batur T, Guvenek A, Ayhan D, Toprak E, Bollenbach
    MT. 2015. Quantifying the determinants of evolutionary dynamics leading to drug
    resistance. PLoS Biology. 13(11), e1002299.
  mla: Chevereau, Guillaume, et al. “Quantifying the Determinants of Evolutionary
    Dynamics Leading to Drug Resistance.” <i>PLoS Biology</i>, vol. 13, no. 11, e1002299,
    Public Library of Science, 2015, doi:<a href="https://doi.org/10.1371/journal.pbio.1002299">10.1371/journal.pbio.1002299</a>.
  short: G. Chevereau, M. Lukacisinova, T. Batur, A. Guvenek, D. Ayhan, E. Toprak,
    M.T. Bollenbach, PLoS Biology 13 (2015).
corr_author: '1'
date_created: 2018-12-11T11:53:04Z
date_published: 2015-11-18T00:00:00Z
date_updated: 2026-08-28T22:31:10Z
day: '18'
ddc:
- '570'
department:
- _id: ToBo
doi: 10.1371/journal.pbio.1002299
ec_funded: 1
external_id:
  isi:
  - '000365898900011'
file:
- access_level: open_access
  checksum: 0e82e3279f50b15c6c170c042627802b
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:09:00Z
  date_updated: 2020-07-14T12:45:07Z
  file_id: '4723'
  file_name: IST-2016-468-v1+1_journal.pbio.1002299.pdf
  file_size: 1387760
  relation: main_file
file_date_updated: 2020-07-14T12:45:07Z
has_accepted_license: '1'
intvolume: '        13'
isi: 1
issue: '11'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 25EB3A80-B435-11E9-9278-68D0E5697425
  grant_number: RGP0042/2013
  name: Revealing the fundamental limits of cell growth
- _id: 25E9AF9E-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P27201-B22
  name: Revealing the mechanisms underlying drug interactions
- _id: 25E83C2C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '303507'
  name: Optimality principles in responses to antibiotics
publication: PLoS Biology
publication_status: published
publisher: Public Library of Science
publist_id: '5547'
pubrep_id: '468'
quality_controlled: '1'
related_material:
  record:
  - id: '9711'
    relation: research_data
    status: public
  - id: '9765'
    relation: research_data
    status: public
  - id: '6263'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Quantifying the determinants of evolutionary dynamics leading to drug resistance
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: 13
year: '2015'
...
---
_id: '10817'
abstract:
- lang: eng
  text: The Morse-Smale complex can be either explicitly or implicitly represented.
    Depending on the type of representation, the simplification of the Morse-Smale
    complex works differently. In the explicit representation, the Morse-Smale complex
    is directly simplified by explicitly reconnecting the critical points during the
    simplification. In the implicit representation, on the other hand, the Morse-Smale
    complex is given by a combinatorial gradient field. In this setting, the simplification
    changes the combinatorial flow, which yields an indirect simplification of the
    Morse-Smale complex. The topological complexity of the Morse-Smale complex is
    reduced in both representations. However, the simplifications generally yield
    different results. In this chapter, we emphasize properties of the two representations
    that cause these differences. We also provide a complexity analysis of the two
    schemes with respect to running time and memory consumption.
acknowledgement: This research is supported and funded by the Digiteo unTopoVis project,
  the TOPOSYS project FP7-ICT-318493-STREP, and MPC-VCC.
article_processing_charge: No
author:
- first_name: David
  full_name: Günther, David
  last_name: Günther
- first_name: Jan
  full_name: Reininghaus, Jan
  id: 4505473A-F248-11E8-B48F-1D18A9856A87
  last_name: Reininghaus
- first_name: Hans-Peter
  full_name: Seidel, Hans-Peter
  last_name: Seidel
- first_name: Tino
  full_name: Weinkauf, Tino
  last_name: Weinkauf
citation:
  ama: 'Günther D, Reininghaus J, Seidel H-P, Weinkauf T. Notes on the simplification
    of the Morse-Smale complex. In: Bremer P-T, Hotz I, Pascucci V, Peikert R, eds.
    <i>Topological Methods in Data Analysis and Visualization III.</i> Mathematics
    and Visualization. Cham: Springer Nature; 2014:135-150. doi:<a href="https://doi.org/10.1007/978-3-319-04099-8_9">10.1007/978-3-319-04099-8_9</a>'
  apa: 'Günther, D., Reininghaus, J., Seidel, H.-P., &#38; Weinkauf, T. (2014). Notes
    on the simplification of the Morse-Smale complex. In P.-T. Bremer, I. Hotz, V.
    Pascucci, &#38; R. Peikert (Eds.), <i>Topological Methods in Data Analysis and
    Visualization III.</i> (pp. 135–150). Cham: Springer Nature. <a href="https://doi.org/10.1007/978-3-319-04099-8_9">https://doi.org/10.1007/978-3-319-04099-8_9</a>'
  chicago: 'Günther, David, Jan Reininghaus, Hans-Peter Seidel, and Tino Weinkauf.
    “Notes on the Simplification of the Morse-Smale Complex.” In <i>Topological Methods
    in Data Analysis and Visualization III.</i>, edited by Peer-Timo Bremer, Ingrid
    Hotz, Valerio Pascucci, and Ronald Peikert, 135–50. Mathematics and Visualization.
    Cham: Springer Nature, 2014. <a href="https://doi.org/10.1007/978-3-319-04099-8_9">https://doi.org/10.1007/978-3-319-04099-8_9</a>.'
  ieee: 'D. Günther, J. Reininghaus, H.-P. Seidel, and T. Weinkauf, “Notes on the
    simplification of the Morse-Smale complex,” in <i>Topological Methods in Data
    Analysis and Visualization III.</i>, P.-T. Bremer, I. Hotz, V. Pascucci, and R.
    Peikert, Eds. Cham: Springer Nature, 2014, pp. 135–150.'
  ista: 'Günther D, Reininghaus J, Seidel H-P, Weinkauf T. 2014.Notes on the simplification
    of the Morse-Smale complex. In: Topological Methods in Data Analysis and Visualization
    III. , 135–150.'
  mla: Günther, David, et al. “Notes on the Simplification of the Morse-Smale Complex.”
    <i>Topological Methods in Data Analysis and Visualization III.</i>, edited by
    Peer-Timo Bremer et al., Springer Nature, 2014, pp. 135–50, doi:<a href="https://doi.org/10.1007/978-3-319-04099-8_9">10.1007/978-3-319-04099-8_9</a>.
  short: D. Günther, J. Reininghaus, H.-P. Seidel, T. Weinkauf, in:, P.-T. Bremer,
    I. Hotz, V. Pascucci, R. Peikert (Eds.), Topological Methods in Data Analysis
    and Visualization III., Springer Nature, Cham, 2014, pp. 135–150.
date_created: 2022-03-04T08:33:57Z
date_published: 2014-03-19T00:00:00Z
date_updated: 2025-04-15T08:37:54Z
day: '19'
department:
- _id: HeEd
doi: 10.1007/978-3-319-04099-8_9
ec_funded: 1
editor:
- first_name: Peer-Timo
  full_name: Bremer, Peer-Timo
  last_name: Bremer
- first_name: Ingrid
  full_name: Hotz, Ingrid
  last_name: Hotz
- first_name: Valerio
  full_name: Pascucci, Valerio
  last_name: Pascucci
- first_name: Ronald
  full_name: Peikert, Ronald
  last_name: Peikert
language:
- iso: eng
month: '03'
oa_version: None
page: 135-150
place: Cham
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '318493'
  name: Topological Complex Systems
publication: Topological Methods in Data Analysis and Visualization III.
publication_identifier:
  eisbn:
  - '9783319040998'
  eissn:
  - 2197-666X
  isbn:
  - '9783319040981'
  issn:
  - 1612-3786
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: Mathematics and Visualization
status: public
title: Notes on the simplification of the Morse-Smale complex
type: book_chapter
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2014'
...
---
_id: '10884'
abstract:
- lang: eng
  text: "We revisit the parameterized model checking problem for token-passing systems
    and specifications in indexed CTL  ∗ \\X. Emerson and Namjoshi (1995, 2003) have
    shown that parameterized model checking of indexed CTL  ∗ \\X in uni-directional
    token rings can be reduced to checking rings up to some cutoff size. Clarke et
    al. (2004) have shown a similar result for general topologies and indexed LTL
    \\X, provided processes cannot choose the directions for sending or receiving
    the token.\r\nWe unify and substantially extend these results by systematically
    exploring fragments of indexed CTL  ∗ \\X with respect to general topologies.
    For each fragment we establish whether a cutoff exists, and for some concrete
    topologies, such as rings, cliques and stars, we infer small cutoffs. Finally,
    we show that the problem becomes undecidable, and thus no cutoffs exist, if processes
    are allowed to choose the directions in which they send or from which they receive
    the token."
acknowledgement: "This work was supported by the Austrian Science Fund through grant
  P23499-N23\r\nand through the RiSE network (S11403, S11405, S11406, S11407-N23);
  ERC Starting Grant (279307: Graph Games); Vienna Science and Technology Fund (WWTF)\r\ngrants
  PROSEED, ICT12-059, and VRG11-005."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Benjamin
  full_name: Aminof, Benjamin
  id: 4A55BD00-F248-11E8-B48F-1D18A9856A87
  last_name: Aminof
- first_name: Swen
  full_name: Jacobs, Swen
  last_name: Jacobs
- first_name: Ayrat
  full_name: Khalimov, Ayrat
  last_name: Khalimov
- first_name: Sasha
  full_name: Rubin, Sasha
  id: 2EC51194-F248-11E8-B48F-1D18A9856A87
  last_name: Rubin
citation:
  ama: 'Aminof B, Jacobs S, Khalimov A, Rubin S. Parameterized model checking of token-passing
    systems. In: <i>Verification, Model Checking, and Abstract Interpretation</i>.
    Vol 8318. Springer Nature; 2014:262-281. doi:<a href="https://doi.org/10.1007/978-3-642-54013-4_15">10.1007/978-3-642-54013-4_15</a>'
  apa: 'Aminof, B., Jacobs, S., Khalimov, A., &#38; Rubin, S. (2014). Parameterized
    model checking of token-passing systems. In <i>Verification, Model Checking, and
    Abstract Interpretation</i> (Vol. 8318, pp. 262–281). San Diego, CA, United States:
    Springer Nature. <a href="https://doi.org/10.1007/978-3-642-54013-4_15">https://doi.org/10.1007/978-3-642-54013-4_15</a>'
  chicago: Aminof, Benjamin, Swen Jacobs, Ayrat Khalimov, and Sasha Rubin. “Parameterized
    Model Checking of Token-Passing Systems.” In <i>Verification, Model Checking,
    and Abstract Interpretation</i>, 8318:262–81. Springer Nature, 2014. <a href="https://doi.org/10.1007/978-3-642-54013-4_15">https://doi.org/10.1007/978-3-642-54013-4_15</a>.
  ieee: B. Aminof, S. Jacobs, A. Khalimov, and S. Rubin, “Parameterized model checking
    of token-passing systems,” in <i>Verification, Model Checking, and Abstract Interpretation</i>,
    San Diego, CA, United States, 2014, vol. 8318, pp. 262–281.
  ista: 'Aminof B, Jacobs S, Khalimov A, Rubin S. 2014. Parameterized model checking
    of token-passing systems. Verification, Model Checking, and Abstract Interpretation.
    VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318,
    262–281.'
  mla: Aminof, Benjamin, et al. “Parameterized Model Checking of Token-Passing Systems.”
    <i>Verification, Model Checking, and Abstract Interpretation</i>, vol. 8318, Springer
    Nature, 2014, pp. 262–81, doi:<a href="https://doi.org/10.1007/978-3-642-54013-4_15">10.1007/978-3-642-54013-4_15</a>.
  short: B. Aminof, S. Jacobs, A. Khalimov, S. Rubin, in:, Verification, Model Checking,
    and Abstract Interpretation, Springer Nature, 2014, pp. 262–281.
conference:
  end_date: 2014-01-21
  location: San Diego, CA, United States
  name: 'VMCAI: Verifcation, Model Checking, and Abstract Interpretation'
  start_date: 2014-01-19
date_created: 2022-03-18T13:01:22Z
date_published: 2014-01-30T00:00:00Z
date_updated: 2025-04-15T06:29:59Z
day: '30'
department:
- _id: KrCh
doi: 10.1007/978-3-642-54013-4_15
ec_funded: 1
external_id:
  arxiv:
  - '1311.4425'
intvolume: '      8318'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: ' https://doi.org/10.48550/arXiv.1311.4425'
month: '01'
oa: 1
oa_version: Preprint
page: 262-281
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: Verification, Model Checking, and Abstract Interpretation
publication_identifier:
  eisbn:
  - '9783642540134'
  eissn:
  - 1611-3349
  isbn:
  - '9783642540127'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Parameterized model checking of token-passing systems
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8318
year: '2014'
...
---
OA_place: repository
OA_type: green
_id: '10885'
abstract:
- lang: eng
  text: "Two-player games on graphs provide the theoretical framework for many important
    problems such as reactive synthesis. While the traditional study of two-player
    zero-sum games has been extended to multi-player games with several notions of
    equilibria, they are decidable only for perfect-information games, whereas several
    applications require imperfect-information games.\r\nIn this paper we propose
    a new notion of equilibria, called doomsday equilibria, which is a strategy profile
    such that all players satisfy their own objective, and if any coalition of players
    deviates and violates even one of the players objective, then the objective of
    every player is violated.\r\nWe present algorithms and complexity results for
    deciding the existence of doomsday equilibria for various classes of ω-regular
    objectives, both for imperfect-information games, and for perfect-information
    games.We provide optimal complexity bounds for imperfect-information games, and
    in most cases for perfect-information games."
acknowledgement: " Supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF
  NFN Grant No\r\nS11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft
  faculty fellows award."
alternative_title:
- LNCS
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: Emmanuel
  full_name: Filiot, Emmanuel
  last_name: Filiot
- first_name: Jean-François
  full_name: Raskin, Jean-François
  last_name: Raskin
citation:
  ama: 'Chatterjee K, Doyen L, Filiot E, Raskin J-F. Doomsday equilibria for omega-regular
    games. In: <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i>.
    Vol 8318. Springer Nature; 2014:78-97. doi:<a href="https://doi.org/10.1007/978-3-642-54013-4_5">10.1007/978-3-642-54013-4_5</a>'
  apa: 'Chatterjee, K., Doyen, L., Filiot, E., &#38; Raskin, J.-F. (2014). Doomsday
    equilibria for omega-regular games. In <i>VMCAI 2014: Verification, Model Checking,
    and Abstract Interpretation</i> (Vol. 8318, pp. 78–97). San Diego, CA, United
    States: Springer Nature. <a href="https://doi.org/10.1007/978-3-642-54013-4_5">https://doi.org/10.1007/978-3-642-54013-4_5</a>'
  chicago: 'Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean-François
    Raskin. “Doomsday Equilibria for Omega-Regular Games.” In <i>VMCAI 2014: Verification,
    Model Checking, and Abstract Interpretation</i>, 8318:78–97. Springer Nature,
    2014. <a href="https://doi.org/10.1007/978-3-642-54013-4_5">https://doi.org/10.1007/978-3-642-54013-4_5</a>.'
  ieee: 'K. Chatterjee, L. Doyen, E. Filiot, and J.-F. Raskin, “Doomsday equilibria
    for omega-regular games,” in <i>VMCAI 2014: Verification, Model Checking, and
    Abstract Interpretation</i>, San Diego, CA, United States, 2014, vol. 8318, pp.
    78–97.'
  ista: 'Chatterjee K, Doyen L, Filiot E, Raskin J-F. 2014. Doomsday equilibria for
    omega-regular games. VMCAI 2014: Verification, Model Checking, and Abstract Interpretation.
    VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318,
    78–97.'
  mla: 'Chatterjee, Krishnendu, et al. “Doomsday Equilibria for Omega-Regular Games.”
    <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i>,
    vol. 8318, Springer Nature, 2014, pp. 78–97, doi:<a href="https://doi.org/10.1007/978-3-642-54013-4_5">10.1007/978-3-642-54013-4_5</a>.'
  short: 'K. Chatterjee, L. Doyen, E. Filiot, J.-F. Raskin, in:, VMCAI 2014: Verification,
    Model Checking, and Abstract Interpretation, Springer Nature, 2014, pp. 78–97.'
conference:
  end_date: 2014-01-21
  location: San Diego, CA, United States
  name: 'VMCAI: Verifcation, Model Checking, and Abstract Interpretation'
  start_date: 2014-01-19
date_created: 2022-03-18T13:03:15Z
date_published: 2014-01-30T00:00:00Z
date_updated: 2026-04-16T10:00:03Z
day: '30'
department:
- _id: KrCh
doi: 10.1007/978-3-642-54013-4_5
ec_funded: 1
external_id:
  arxiv:
  - '1311.3238'
intvolume: '      8318'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.1311.3238
month: '01'
oa: 1
oa_version: Preprint
page: 78-97
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
publication: 'VMCAI 2014: Verification, Model Checking, and Abstract Interpretation'
publication_identifier:
  eisbn:
  - '9783642540134'
  eissn:
  - 1611-3349
  isbn:
  - '9783642540127'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  record:
  - id: '681'
    relation: later_version
    status: public
scopus_import: '1'
status: public
title: Doomsday equilibria for omega-regular games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8318
year: '2014'
...
---
_id: '10886'
abstract:
- lang: eng
  text: We propose a method for visualizing two-dimensional symmetric positive definite
    tensor fields using the Heat Kernel Signature (HKS). The HKS is derived from the
    heat kernel and was originally introduced as an isometry invariant shape signature.
    Each positive definite tensor field defines a Riemannian manifold by considering
    the tensor field as a Riemannian metric. On this Riemmanian manifold we can apply
    the definition of the HKS. The resulting scalar quantity is used for the visualization
    of tensor fields. The HKS is closely related to the Gaussian curvature of the
    Riemannian manifold and the time parameter of the heat kernel allows a multiscale
    analysis in a natural way. In this way, the HKS represents field related scale
    space properties, enabling a level of detail analysis of tensor fields. This makes
    the HKS an interesting new scalar quantity for tensor fields, which differs significantly
    from usual tensor invariants like the trace or the determinant. A method for visualization
    and a numerical realization of the HKS for tensor fields is proposed in this chapter.
    To validate the approach we apply it to some illustrating simple examples as isolated
    critical points and to a medical diffusion tensor data set.
acknowledgement: This research is partially supported by the TOPOSYS project FP7-ICT-318493-STREP.
alternative_title:
- Mathematics and Visualization
article_processing_charge: No
author:
- first_name: Valentin
  full_name: Zobel, Valentin
  last_name: Zobel
- first_name: Jan
  full_name: Reininghaus, Jan
  id: 4505473A-F248-11E8-B48F-1D18A9856A87
  last_name: Reininghaus
- first_name: Ingrid
  full_name: Hotz, Ingrid
  last_name: Hotz
citation:
  ama: 'Zobel V, Reininghaus J, Hotz I. Visualization of two-dimensional symmetric
    positive definite tensor fields using the heat kernel signature. In: <i>Topological
    Methods in Data Analysis and Visualization III </i>. Springer; 2014:249-262. doi:<a
    href="https://doi.org/10.1007/978-3-319-04099-8_16">10.1007/978-3-319-04099-8_16</a>'
  apa: Zobel, V., Reininghaus, J., &#38; Hotz, I. (2014). Visualization of two-dimensional
    symmetric positive definite tensor fields using the heat kernel signature. In
    <i>Topological Methods in Data Analysis and Visualization III </i> (pp. 249–262).
    Springer. <a href="https://doi.org/10.1007/978-3-319-04099-8_16">https://doi.org/10.1007/978-3-319-04099-8_16</a>
  chicago: Zobel, Valentin, Jan Reininghaus, and Ingrid Hotz. “Visualization of Two-Dimensional
    Symmetric Positive Definite Tensor Fields Using the Heat Kernel Signature.” In
    <i>Topological Methods in Data Analysis and Visualization III </i>, 249–62. Springer,
    2014. <a href="https://doi.org/10.1007/978-3-319-04099-8_16">https://doi.org/10.1007/978-3-319-04099-8_16</a>.
  ieee: V. Zobel, J. Reininghaus, and I. Hotz, “Visualization of two-dimensional symmetric
    positive definite tensor fields using the heat kernel signature,” in <i>Topological
    Methods in Data Analysis and Visualization III </i>, 2014, pp. 249–262.
  ista: Zobel V, Reininghaus J, Hotz I. 2014. Visualization of two-dimensional symmetric
    positive definite tensor fields using the heat kernel signature. Topological Methods
    in Data Analysis and Visualization III . , Mathematics and Visualization, , 249–262.
  mla: Zobel, Valentin, et al. “Visualization of Two-Dimensional Symmetric Positive
    Definite Tensor Fields Using the Heat Kernel Signature.” <i>Topological Methods
    in Data Analysis and Visualization III </i>, Springer, 2014, pp. 249–62, doi:<a
    href="https://doi.org/10.1007/978-3-319-04099-8_16">10.1007/978-3-319-04099-8_16</a>.
  short: V. Zobel, J. Reininghaus, I. Hotz, in:, Topological Methods in Data Analysis
    and Visualization III , Springer, 2014, pp. 249–262.
date_created: 2022-03-18T13:05:39Z
date_published: 2014-03-19T00:00:00Z
date_updated: 2023-09-05T14:13:16Z
day: '19'
department:
- _id: HeEd
doi: 10.1007/978-3-319-04099-8_16
language:
- iso: eng
month: '03'
oa_version: None
page: 249-262
publication: 'Topological Methods in Data Analysis and Visualization III '
publication_identifier:
  eisbn:
  - '9783319040998'
  eissn:
  - 2197-666X
  isbn:
  - '9783319040981'
  issn:
  - 1612-3786
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
status: public
title: Visualization of two-dimensional symmetric positive definite tensor fields
  using the heat kernel signature
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2014'
...
---
_id: '10892'
abstract:
- lang: eng
  text: "In this paper, we introduce planar matchings on directed pseudo-line arrangements,
    which yield a planar set of pseudo-line segments such that only matching-partners
    are adjacent. By translating the planar matching problem into a corresponding
    stable roommates problem we show that such matchings always exist.\r\nUsing our
    new framework, we establish, for the first time, a complete, rigorous definition
    of weighted straight skeletons, which are based on a so-called wavefront propagation
    process. We present a generalized and unified approach to treat structural changes
    in the wavefront that focuses on the restoration of weak planarity by finding
    planar matchings."
acknowledgement: 'T. Biedl was supported by NSERC and the Ross and Muriel Cheriton
  Fellowship. P. Palfrader was supported by Austrian Science Fund (FWF): P25816-N15.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Therese
  full_name: Biedl, Therese
  last_name: Biedl
- first_name: Stefan
  full_name: Huber, Stefan
  id: 4700A070-F248-11E8-B48F-1D18A9856A87
  last_name: Huber
  orcid: 0000-0002-8871-5814
- first_name: Peter
  full_name: Palfrader, Peter
  last_name: Palfrader
citation:
  ama: 'Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons.
    In: <i>25th International Symposium, ISAAC 2014</i>. Vol 8889. Springer Nature;
    2014:117-127. doi:<a href="https://doi.org/10.1007/978-3-319-13075-0_10">10.1007/978-3-319-13075-0_10</a>'
  apa: 'Biedl, T., Huber, S., &#38; Palfrader, P. (2014). Planar matchings for weighted
    straight skeletons. In <i>25th International Symposium, ISAAC 2014</i> (Vol. 8889,
    pp. 117–127). Jeonju, Korea: Springer Nature. <a href="https://doi.org/10.1007/978-3-319-13075-0_10">https://doi.org/10.1007/978-3-319-13075-0_10</a>'
  chicago: Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for
    Weighted Straight Skeletons.” In <i>25th International Symposium, ISAAC 2014</i>,
    8889:117–27. Springer Nature, 2014. <a href="https://doi.org/10.1007/978-3-319-13075-0_10">https://doi.org/10.1007/978-3-319-13075-0_10</a>.
  ieee: T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight
    skeletons,” in <i>25th International Symposium, ISAAC 2014</i>, Jeonju, Korea,
    2014, vol. 8889, pp. 117–127.
  ista: 'Biedl T, Huber S, Palfrader P. 2014. Planar matchings for weighted straight
    skeletons. 25th International Symposium, ISAAC 2014. ISAAC: International Symposium
    on Algorithms and Computation, LNCS, vol. 8889, 117–127.'
  mla: Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.”
    <i>25th International Symposium, ISAAC 2014</i>, vol. 8889, Springer Nature, 2014,
    pp. 117–27, doi:<a href="https://doi.org/10.1007/978-3-319-13075-0_10">10.1007/978-3-319-13075-0_10</a>.
  short: T. Biedl, S. Huber, P. Palfrader, in:, 25th International Symposium, ISAAC
    2014, Springer Nature, 2014, pp. 117–127.
conference:
  end_date: 2014-12-17
  location: Jeonju, Korea
  name: 'ISAAC: International Symposium on Algorithms and Computation'
  start_date: 2014-12-15
corr_author: '1'
date_created: 2022-03-21T07:09:03Z
date_published: 2014-11-08T00:00:00Z
date_updated: 2025-09-29T13:22:55Z
day: '08'
department:
- _id: HeEd
doi: 10.1007/978-3-319-13075-0_10
external_id:
  isi:
  - '000354865900010'
intvolume: '      8889'
isi: 1
language:
- iso: eng
month: '11'
oa_version: None
page: 117-127
publication: 25th International Symposium, ISAAC 2014
publication_identifier:
  eisbn:
  - '9783319130750'
  eissn:
  - 1611-3349
  isbn:
  - '9783319130743'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  record:
  - id: '481'
    relation: later_version
    status: public
scopus_import: '1'
status: public
title: Planar matchings for weighted straight skeletons
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 8889
year: '2014'
...
---
_id: '10893'
abstract:
- lang: eng
  text: Saddle periodic orbits are an essential and stable part of the topological
    skeleton of a 3D vector field. Nevertheless, there is currently no efficient algorithm
    to robustly extract these features. In this chapter, we present a novel technique
    to extract saddle periodic orbits. Exploiting the analytic properties of such
    an orbit, we propose a scalar measure based on the finite-time Lyapunov exponent
    (FTLE) that indicates its presence. Using persistent homology, we can then extract
    the robust cycles of this field. These cycles thereby represent the saddle periodic
    orbits of the given vector field. We discuss the different existing FTLE approximation
    schemes regarding their applicability to this specific problem and propose an
    adapted version of FTLE called Normalized Velocity Separation. Finally, we evaluate
    our method using simple analytic vector field data.
acknowledgement: First, we thank the reviewers of this paper for their ideas and critical
  comments. In addition, we thank Ronny Peikert and Filip Sadlo for a fruitful discussions.
  This research is supported by the European Commission under the TOPOSYS project
  FP7-ICT-318493-STREP, the European Social Fund (ESF App. No. 100098251), and the
  European Science Foundation under the ACAT Research Network Program.
article_processing_charge: No
author:
- first_name: Jens
  full_name: Kasten, Jens
  last_name: Kasten
- first_name: Jan
  full_name: Reininghaus, Jan
  id: 4505473A-F248-11E8-B48F-1D18A9856A87
  last_name: Reininghaus
- first_name: Wieland
  full_name: Reich, Wieland
  last_name: Reich
- first_name: Gerik
  full_name: Scheuermann, Gerik
  last_name: Scheuermann
citation:
  ama: 'Kasten J, Reininghaus J, Reich W, Scheuermann G. Toward the extraction of
    saddle periodic orbits. In: Bremer P-T, Hotz I, Pascucci V, Peikert R, eds. <i>Topological
    Methods in Data Analysis and Visualization III </i>. Vol 1. Mathematics and Visualization.
    Cham: Springer; 2014:55-69. doi:<a href="https://doi.org/10.1007/978-3-319-04099-8_4">10.1007/978-3-319-04099-8_4</a>'
  apa: 'Kasten, J., Reininghaus, J., Reich, W., &#38; Scheuermann, G. (2014). Toward
    the extraction of saddle periodic orbits. In P.-T. Bremer, I. Hotz, V. Pascucci,
    &#38; R. Peikert (Eds.), <i>Topological Methods in Data Analysis and Visualization
    III </i> (Vol. 1, pp. 55–69). Cham: Springer. <a href="https://doi.org/10.1007/978-3-319-04099-8_4">https://doi.org/10.1007/978-3-319-04099-8_4</a>'
  chicago: 'Kasten, Jens, Jan Reininghaus, Wieland Reich, and Gerik Scheuermann. “Toward
    the Extraction of Saddle Periodic Orbits.” In <i>Topological Methods in Data Analysis
    and Visualization III </i>, edited by Peer-Timo Bremer, Ingrid Hotz, Valerio Pascucci,
    and Ronald Peikert, 1:55–69. Mathematics and Visualization. Cham: Springer, 2014.
    <a href="https://doi.org/10.1007/978-3-319-04099-8_4">https://doi.org/10.1007/978-3-319-04099-8_4</a>.'
  ieee: 'J. Kasten, J. Reininghaus, W. Reich, and G. Scheuermann, “Toward the extraction
    of saddle periodic orbits,” in <i>Topological Methods in Data Analysis and Visualization
    III </i>, vol. 1, P.-T. Bremer, I. Hotz, V. Pascucci, and R. Peikert, Eds. Cham:
    Springer, 2014, pp. 55–69.'
  ista: 'Kasten J, Reininghaus J, Reich W, Scheuermann G. 2014.Toward the extraction
    of saddle periodic orbits. In: Topological Methods in Data Analysis and Visualization
    III . vol. 1, 55–69.'
  mla: Kasten, Jens, et al. “Toward the Extraction of Saddle Periodic Orbits.” <i>Topological
    Methods in Data Analysis and Visualization III </i>, edited by Peer-Timo Bremer
    et al., vol. 1, Springer, 2014, pp. 55–69, doi:<a href="https://doi.org/10.1007/978-3-319-04099-8_4">10.1007/978-3-319-04099-8_4</a>.
  short: J. Kasten, J. Reininghaus, W. Reich, G. Scheuermann, in:, P.-T. Bremer, I.
    Hotz, V. Pascucci, R. Peikert (Eds.), Topological Methods in Data Analysis and
    Visualization III , Springer, Cham, 2014, pp. 55–69.
date_created: 2022-03-21T07:11:23Z
date_published: 2014-03-19T00:00:00Z
date_updated: 2025-04-15T08:37:54Z
day: '19'
department:
- _id: HeEd
doi: 10.1007/978-3-319-04099-8_4
ec_funded: 1
editor:
- first_name: Peer-Timo
  full_name: Bremer, Peer-Timo
  last_name: Bremer
- first_name: Ingrid
  full_name: Hotz, Ingrid
  last_name: Hotz
- first_name: Valerio
  full_name: Pascucci, Valerio
  last_name: Pascucci
- first_name: Ronald
  full_name: Peikert, Ronald
  last_name: Peikert
intvolume: '         1'
language:
- iso: eng
month: '03'
oa_version: None
page: 55-69
place: Cham
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '318493'
  name: Topological Complex Systems
publication: 'Topological Methods in Data Analysis and Visualization III '
publication_identifier:
  eisbn:
  - '9783319040998'
  eissn:
  - 2197-666X
  isbn:
  - '9783319040981'
  issn:
  - 1612-3786
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
series_title: Mathematics and Visualization
status: public
title: Toward the extraction of saddle periodic orbits
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2014'
...
---
_id: '10894'
abstract:
- lang: eng
  text: PHAT is a C++ library for the computation of persistent homology by matrix
    reduction. We aim for a simple generic design that decouples algorithms from data
    structures without sacrificing efficiency or user-friendliness. This makes PHAT
    a versatile platform for experimenting with algorithmic ideas and comparing them
    to state of the art implementations.
article_processing_charge: No
author:
- first_name: Ulrich
  full_name: Bauer, Ulrich
  id: 2ADD483A-F248-11E8-B48F-1D18A9856A87
  last_name: Bauer
  orcid: 0000-0002-9683-0724
- first_name: Michael
  full_name: Kerber, Michael
  last_name: Kerber
- first_name: Jan
  full_name: Reininghaus, Jan
  id: 4505473A-F248-11E8-B48F-1D18A9856A87
  last_name: Reininghaus
- first_name: Hubert
  full_name: Wagner, Hubert
  last_name: Wagner
citation:
  ama: 'Bauer U, Kerber M, Reininghaus J, Wagner H. PHAT – Persistent Homology Algorithms
    Toolbox. In: <i>ICMS 2014: International Congress on Mathematical Software</i>.
    Vol 8592. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg; 2014:137-143.
    doi:<a href="https://doi.org/10.1007/978-3-662-44199-2_24">10.1007/978-3-662-44199-2_24</a>'
  apa: 'Bauer, U., Kerber, M., Reininghaus, J., &#38; Wagner, H. (2014). PHAT – Persistent
    Homology Algorithms Toolbox. In <i>ICMS 2014: International Congress on Mathematical
    Software</i> (Vol. 8592, pp. 137–143). Berlin, Heidelberg: Springer Berlin Heidelberg.
    <a href="https://doi.org/10.1007/978-3-662-44199-2_24">https://doi.org/10.1007/978-3-662-44199-2_24</a>'
  chicago: 'Bauer, Ulrich, Michael Kerber, Jan Reininghaus, and Hubert Wagner. “PHAT
    – Persistent Homology Algorithms Toolbox.” In <i>ICMS 2014: International Congress
    on Mathematical Software</i>, 8592:137–43. LNCS. Berlin, Heidelberg: Springer
    Berlin Heidelberg, 2014. <a href="https://doi.org/10.1007/978-3-662-44199-2_24">https://doi.org/10.1007/978-3-662-44199-2_24</a>.'
  ieee: 'U. Bauer, M. Kerber, J. Reininghaus, and H. Wagner, “PHAT – Persistent Homology
    Algorithms Toolbox,” in <i>ICMS 2014: International Congress on Mathematical Software</i>,
    Seoul, South Korea, 2014, vol. 8592, pp. 137–143.'
  ista: 'Bauer U, Kerber M, Reininghaus J, Wagner H. 2014. PHAT – Persistent Homology
    Algorithms Toolbox. ICMS 2014: International Congress on Mathematical Software.
    ICMS: International Congress on Mathematical SoftwareLNCS vol. 8592, 137–143.'
  mla: 'Bauer, Ulrich, et al. “PHAT – Persistent Homology Algorithms Toolbox.” <i>ICMS
    2014: International Congress on Mathematical Software</i>, vol. 8592, Springer
    Berlin Heidelberg, 2014, pp. 137–43, doi:<a href="https://doi.org/10.1007/978-3-662-44199-2_24">10.1007/978-3-662-44199-2_24</a>.'
  short: 'U. Bauer, M. Kerber, J. Reininghaus, H. Wagner, in:, ICMS 2014: International
    Congress on Mathematical Software, Springer Berlin Heidelberg, Berlin, Heidelberg,
    2014, pp. 137–143.'
conference:
  end_date: 2014-08-09
  location: Seoul, South Korea
  name: 'ICMS: International Congress on Mathematical Software'
  start_date: 2014-08-05
date_created: 2022-03-21T07:12:16Z
date_published: 2014-09-01T00:00:00Z
date_updated: 2026-06-18T17:35:15Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/978-3-662-44199-2_24
intvolume: '      8592'
language:
- iso: eng
month: '09'
oa_version: None
page: 137-143
place: Berlin, Heidelberg
publication: 'ICMS 2014: International Congress on Mathematical Software'
publication_identifier:
  eisbn:
  - '9783662441992'
  eissn:
  - 1611-3349
  isbn:
  - '9783662441985'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Berlin Heidelberg
quality_controlled: '1'
related_material:
  record:
  - id: '1433'
    relation: later_version
    status: public
scopus_import: '1'
series_title: LNCS
status: public
title: PHAT – Persistent Homology Algorithms Toolbox
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 8592
year: '2014'
...
---
_id: '2212'
abstract:
- lang: eng
  text: 'The theory of graph games is the foundation for modeling and synthesizing
    reactive processes. In the synthesis of stochastic processes, we use 2 1/2-player
    games where some transitions of the game graph are controlled by two adversarial
    players, the System and the Environment, and the other transitions are determined
    probabilistically. We consider 2 1/2-player games where the objective of the System
    is the conjunction of a qualitative objective (specified as a parity condition)
    and a quantitative objective (specified as a mean-payoff condition). We establish
    that the problem of deciding whether the System can ensure that the probability
    to satisfy the mean-payoff parity objective is at least a given threshold is in
    NP ∩ coNP, matching the best known bound in the special case of 2-player games
    (where all transitions are deterministic). We present an algorithm running in
    time O(d·n2d·MeanGame) to compute the set of almost-sure winning states from which
    the objective can be ensured with probability 1, where n is the number of states
    of the game, d the number of priorities of the parity objective, and MeanGame
    is the complexity to compute the set of almost-sure winning states in 2 1/2-player
    mean-payoff games. Our results are useful in the synthesis of stochastic reactive
    systems with both functional requirement (given as a qualitative objective) and
    performance requirement (given as a quantitative objective). '
acknowledgement: "This research was supported by European project Cassting (FP7-601148).\r\nA
  Technical Report of this paper is available at: \r\nhttps://repository.ist.ac.at/id/eprint/128."
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: Hugo
  full_name: Gimbert, Hugo
  last_name: Gimbert
- first_name: Youssouf
  full_name: Oualhadj, Youssouf
  last_name: Oualhadj
citation:
  ama: 'Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. Perfect-information stochastic
    mean-payoff parity games. In: Vol 8412. Springer; 2014:210-225. doi:<a href="https://doi.org/10.1007/978-3-642-54830-7_14">10.1007/978-3-642-54830-7_14</a>'
  apa: 'Chatterjee, K., Doyen, L., Gimbert, H., &#38; Oualhadj, Y. (2014). Perfect-information
    stochastic mean-payoff parity games (Vol. 8412, pp. 210–225). Presented at the
    FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble,
    France: Springer. <a href="https://doi.org/10.1007/978-3-642-54830-7_14">https://doi.org/10.1007/978-3-642-54830-7_14</a>'
  chicago: Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Youssouf Oualhadj.
    “Perfect-Information Stochastic Mean-Payoff Parity Games,” 8412:210–25. Springer,
    2014. <a href="https://doi.org/10.1007/978-3-642-54830-7_14">https://doi.org/10.1007/978-3-642-54830-7_14</a>.
  ieee: 'K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, “Perfect-information
    stochastic mean-payoff parity games,” presented at the FoSSaCS: Foundations of
    Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412,
    pp. 210–225.'
  ista: 'Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. 2014. Perfect-information stochastic
    mean-payoff parity games. FoSSaCS: Foundations of Software Science and Computation
    Structures, LNCS, vol. 8412, 210–225.'
  mla: Chatterjee, Krishnendu, et al. <i>Perfect-Information Stochastic Mean-Payoff
    Parity Games</i>. Vol. 8412, Springer, 2014, pp. 210–25, doi:<a href="https://doi.org/10.1007/978-3-642-54830-7_14">10.1007/978-3-642-54830-7_14</a>.
  short: K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, in:, Springer, 2014, pp.
    210–225.
conference:
  end_date: 2014-04-13
  location: Grenoble, France
  name: 'FoSSaCS: Foundations of Software Science and Computation Structures'
  start_date: 2014-04-05
date_created: 2018-12-11T11:56:21Z
date_published: 2014-04-01T00:00:00Z
date_updated: 2023-02-23T12:24:50Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-54830-7_14
ec_funded: 1
intvolume: '      8412'
language:
- iso: eng
month: '04'
oa_version: None
page: 210 - 225
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
publication_status: published
publisher: Springer
publist_id: '4758'
quality_controlled: '1'
related_material:
  record:
  - id: '5405'
    relation: earlier_version
    status: public
scopus_import: 1
status: public
title: Perfect-information stochastic mean-payoff parity games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8412
year: '2014'
...
---
_id: '2213'
abstract:
- lang: eng
  text: We consider two-player partial-observation stochastic games on finitestate
    graphs where player 1 has partial observation and player 2 has perfect observation.
    The winning condition we study are ε-regular conditions specified as parity objectives.
    The qualitative-analysis problem given a partial-observation stochastic game and
    a parity objective asks whether there is a strategy to ensure that the objective
    is satisfied with probability 1 (resp. positive probability). These qualitative-analysis
    problems are known to be undecidable. However in many applications the relevant
    question is the existence of finite-memory strategies, and the qualitative-analysis
    problems under finite-memory strategies was recently shown to be decidable in
    2EXPTIME.We improve the complexity and show that the qualitative-analysis problems
    for partial-observation stochastic parity games under finite-memory strategies
    are EXPTIME-complete; and also establish optimal (exponential) memory bounds for
    finite-memory strategies required for qualitative analysis.
acknowledgement: 'This research was supported by European project Cassting (FP7-601148),
  NSF grants CNS 1049862 and CCF-1139011, by NSF Expe ditions in Computing project
  “ExCAPE: Expeditions in Computer Augmented Program Engineering”, by BSF grant 9800096,
  and by gift from Intel.'
alternative_title:
- LNCS
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: Sumit
  full_name: Nain, Sumit
  last_name: Nain
- first_name: Moshe
  full_name: Vardi, Moshe
  last_name: Vardi
citation:
  ama: 'Chatterjee K, Doyen L, Nain S, Vardi M. The complexity of partial-observation
    stochastic parity games with finite-memory strategies. In: Vol 8412. Springer;
    2014:242-257. doi:<a href="https://doi.org/10.1007/978-3-642-54830-7_16">10.1007/978-3-642-54830-7_16</a>'
  apa: 'Chatterjee, K., Doyen, L., Nain, S., &#38; Vardi, M. (2014). The complexity
    of partial-observation stochastic parity games with finite-memory strategies (Vol.
    8412, pp. 242–257). Presented at the FoSSaCS: Foundations of Software Science
    and Computation Structures, Grenoble, France: Springer. <a href="https://doi.org/10.1007/978-3-642-54830-7_16">https://doi.org/10.1007/978-3-642-54830-7_16</a>'
  chicago: Chatterjee, Krishnendu, Laurent Doyen, Sumit Nain, and Moshe Vardi. “The
    Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies,”
    8412:242–57. Springer, 2014. <a href="https://doi.org/10.1007/978-3-642-54830-7_16">https://doi.org/10.1007/978-3-642-54830-7_16</a>.
  ieee: 'K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, “The complexity of partial-observation
    stochastic parity games with finite-memory strategies,” presented at the FoSSaCS:
    Foundations of Software Science and Computation Structures, Grenoble, France,
    2014, vol. 8412, pp. 242–257.'
  ista: 'Chatterjee K, Doyen L, Nain S, Vardi M. 2014. The complexity of partial-observation
    stochastic parity games with finite-memory strategies. FoSSaCS: Foundations of
    Software Science and Computation Structures, LNCS, vol. 8412, 242–257.'
  mla: Chatterjee, Krishnendu, et al. <i>The Complexity of Partial-Observation Stochastic
    Parity Games with Finite-Memory Strategies</i>. Vol. 8412, Springer, 2014, pp.
    242–57, doi:<a href="https://doi.org/10.1007/978-3-642-54830-7_16">10.1007/978-3-642-54830-7_16</a>.
  short: K. Chatterjee, L. Doyen, S. Nain, M. Vardi, in:, Springer, 2014, pp. 242–257.
conference:
  end_date: 2014-04-13
  location: Grenoble, France
  name: 'FoSSaCS: Foundations of Software Science and Computation Structures'
  start_date: 2014-04-05
date_created: 2018-12-11T11:56:21Z
date_published: 2014-04-01T00:00:00Z
date_updated: 2023-02-23T12:24:58Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-54830-7_16
ec_funded: 1
external_id:
  arxiv:
  - '1401.3289'
intvolume: '      8412'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1401.3289
month: '04'
oa: 1
oa_version: Preprint
page: 242 - 257
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
publication_status: published
publisher: Springer
publist_id: '4757'
quality_controlled: '1'
related_material:
  record:
  - id: '5408'
    relation: earlier_version
    status: public
scopus_import: 1
status: public
title: The complexity of partial-observation stochastic parity games with finite-memory
  strategies
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8412
year: '2014'
...
---
_id: '2214'
abstract:
- lang: eng
  text: A hallmark of immune cell trafficking is directional guidance via gradients
    of soluble or surface bound chemokines. Vascular endothelial cells produce, transport
    and deposit either their own chemokines or chemokines produced by the underlying
    stroma. Endothelial heparan sulfate (HS) was suggested to be a critical scaffold
    for these chemokine pools, but it is unclear how steep chemokine gradients are
    sustained between the lumenal and ablumenal aspects of blood vessels. Addressing
    this question by semi-quantitative immunostaining of HS moieties around blood
    vessels with a pan anti-HS IgM mAb, we found a striking HS enrichment in the basal
    lamina of resting and inflamed post capillary skin venules, as well as in high
    endothelial venules (HEVs) of lymph nodes. Staining of skin vessels with a glycocalyx
    probe further suggested that their lumenal glycocalyx contains much lower HS density
    than their basolateral extracellular matrix (ECM). This polarized HS pattern was
    observed also in isolated resting and inflamed microvascular dermal cells. Notably,
    progressive skin inflammation resulted in massive ECM deposition and in further
    HS enrichment around skin post capillary venules and their associated pericytes.
    Inflammation-dependent HS enrichment was not compromised in mice deficient in
    the main HS degrading enzyme, heparanase. Our results suggest that the blood vasculature
    patterns steep gradients of HS scaffolds between their lumenal and basolateral
    endothelial aspects, and that inflammatory processes can further enrich the HS
    content nearby inflamed vessels. We propose that chemokine gradients between the
    lumenal and ablumenal sides of vessels could be favored by these sharp HS scaffold
    gradients.
acknowledgement: Michael Sixt's research is supported by the European Research Council
  (ERC Starting grant).
article_number: e85699
article_processing_charge: No
author:
- first_name: Liat
  full_name: Stoler Barak, Liat
  last_name: Stoler Barak
- first_name: Christine
  full_name: Moussion, Christine
  id: 3356F664-F248-11E8-B48F-1D18A9856A87
  last_name: Moussion
- first_name: Elias
  full_name: Shezen, Elias
  last_name: Shezen
- first_name: Miki
  full_name: Hatzav, Miki
  last_name: Hatzav
- first_name: Michael K
  full_name: Sixt, Michael K
  id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
  last_name: Sixt
  orcid: 0000-0002-6620-9179
- first_name: Ronen
  full_name: Alon, Ronen
  last_name: Alon
citation:
  ama: Stoler Barak L, Moussion C, Shezen E, Hatzav M, Sixt MK, Alon R. Blood vessels
    pattern heparan sulfate gradients between their apical and basolateral aspects.
    <i>PLoS One</i>. 2014;9(1). doi:<a href="https://doi.org/10.1371/journal.pone.0085699">10.1371/journal.pone.0085699</a>
  apa: Stoler Barak, L., Moussion, C., Shezen, E., Hatzav, M., Sixt, M. K., &#38;
    Alon, R. (2014). Blood vessels pattern heparan sulfate gradients between their
    apical and basolateral aspects. <i>PLoS One</i>. Public Library of Science. <a
    href="https://doi.org/10.1371/journal.pone.0085699">https://doi.org/10.1371/journal.pone.0085699</a>
  chicago: Stoler Barak, Liat, Christine Moussion, Elias Shezen, Miki Hatzav, Michael
    K Sixt, and Ronen Alon. “Blood Vessels Pattern Heparan Sulfate Gradients between
    Their Apical and Basolateral Aspects.” <i>PLoS One</i>. Public Library of Science,
    2014. <a href="https://doi.org/10.1371/journal.pone.0085699">https://doi.org/10.1371/journal.pone.0085699</a>.
  ieee: L. Stoler Barak, C. Moussion, E. Shezen, M. Hatzav, M. K. Sixt, and R. Alon,
    “Blood vessels pattern heparan sulfate gradients between their apical and basolateral
    aspects,” <i>PLoS One</i>, vol. 9, no. 1. Public Library of Science, 2014.
  ista: Stoler Barak L, Moussion C, Shezen E, Hatzav M, Sixt MK, Alon R. 2014. Blood
    vessels pattern heparan sulfate gradients between their apical and basolateral
    aspects. PLoS One. 9(1), e85699.
  mla: Stoler Barak, Liat, et al. “Blood Vessels Pattern Heparan Sulfate Gradients
    between Their Apical and Basolateral Aspects.” <i>PLoS One</i>, vol. 9, no. 1,
    e85699, Public Library of Science, 2014, doi:<a href="https://doi.org/10.1371/journal.pone.0085699">10.1371/journal.pone.0085699</a>.
  short: L. Stoler Barak, C. Moussion, E. Shezen, M. Hatzav, M.K. Sixt, R. Alon, PLoS
    One 9 (2014).
date_created: 2018-12-11T11:56:22Z
date_published: 2014-01-22T00:00:00Z
date_updated: 2025-09-29T11:30:42Z
day: '22'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.1371/journal.pone.0085699
ec_funded: 1
external_id:
  isi:
  - '000330283100061'
file:
- access_level: open_access
  checksum: 84a8033bda2e07e39405f5acc85f4eca
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:07:48Z
  date_updated: 2020-07-14T12:45:33Z
  file_id: '4646'
  file_name: IST-2016-433-v1+1_journal.pone.0085699.pdf
  file_size: 12634775
  relation: main_file
file_date_updated: 2020-07-14T12:45:33Z
has_accepted_license: '1'
intvolume: '         9'
isi: 1
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 25A76F58-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '289720'
  name: Stromal Cell-immune Cell Interactions in Health and Disease
publication: PLoS One
publication_status: published
publisher: Public Library of Science
publist_id: '4756'
pubrep_id: '433'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Blood vessels pattern heparan sulfate gradients between their apical and basolateral
  aspects
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: 9
year: '2014'
...
