---
_id: '1874'
abstract:
- lang: eng
  text: 'The hippocampal region, comprising the hippocampal formation and the parahippocampal
    region, has been one of the most intensively studied parts of the brain for decades.
    Better understanding of its functional diversity and complexity has led to an
    increased demand for specificity in experimental procedures and manipulations.
    In view of the complex 3D structure of the hippocampal region, precisely positioned
    experimental approaches require a fine-grained architectural description that
    is available and readable to experimentalists lacking detailed anatomical experience.
    In this paper, we provide the first cyto- and chemoarchitectural description of
    the hippocampal formation and parahippocampal region in the rat at high resolution
    and in the three standard sectional planes: coronal, horizontal and sagittal.
    The atlas uses a series of adjacent sections stained for neurons and for a number
    of chemical marker substances, particularly parvalbumin and calbindin. All the
    borders defined in one plane have been cross-checked against their counterparts
    in the other two planes. The entire dataset will be made available as a web-based
    interactive application through the Rodent Brain WorkBench (http://www.rbwb.org)
    which, together with this paper, provides a unique atlas resource.'
article_processing_charge: No
author:
- first_name: Charlotte
  full_name: Boccara, Charlotte
  id: 3FC06552-F248-11E8-B48F-1D18A9856A87
  last_name: Boccara
  orcid: 0000-0001-7237-5109
- first_name: Lisa
  full_name: Kjønigsen, Lisa
  last_name: Kjønigsen
- first_name: Ingvild
  full_name: Hammer, Ingvild
  last_name: Hammer
- first_name: Jan
  full_name: Bjaalie, Jan
  last_name: Bjaalie
- first_name: Trygve
  full_name: Leergaard, Trygve
  last_name: Leergaard
- first_name: Menno
  full_name: Witter, Menno
  last_name: Witter
citation:
  ama: Boccara CN, Kjønigsen L, Hammer I, Bjaalie J, Leergaard T, Witter M. A three-plane
    architectonic atlas of the rat hippocampal region. <i>Hippocampus</i>. 2015;25(7):838-857.
    doi:<a href="https://doi.org/10.1002/hipo.22407">10.1002/hipo.22407</a>
  apa: Boccara, C. N., Kjønigsen, L., Hammer, I., Bjaalie, J., Leergaard, T., &#38;
    Witter, M. (2015). A three-plane architectonic atlas of the rat hippocampal region.
    <i>Hippocampus</i>. Wiley. <a href="https://doi.org/10.1002/hipo.22407">https://doi.org/10.1002/hipo.22407</a>
  chicago: Boccara, Charlotte N., Lisa Kjønigsen, Ingvild Hammer, Jan Bjaalie, Trygve
    Leergaard, and Menno Witter. “A Three-Plane Architectonic Atlas of the Rat Hippocampal
    Region.” <i>Hippocampus</i>. Wiley, 2015. <a href="https://doi.org/10.1002/hipo.22407">https://doi.org/10.1002/hipo.22407</a>.
  ieee: C. N. Boccara, L. Kjønigsen, I. Hammer, J. Bjaalie, T. Leergaard, and M. Witter,
    “A three-plane architectonic atlas of the rat hippocampal region,” <i>Hippocampus</i>,
    vol. 25, no. 7. Wiley, pp. 838–857, 2015.
  ista: Boccara CN, Kjønigsen L, Hammer I, Bjaalie J, Leergaard T, Witter M. 2015.
    A three-plane architectonic atlas of the rat hippocampal region. Hippocampus.
    25(7), 838–857.
  mla: Boccara, Charlotte N., et al. “A Three-Plane Architectonic Atlas of the Rat
    Hippocampal Region.” <i>Hippocampus</i>, vol. 25, no. 7, Wiley, 2015, pp. 838–57,
    doi:<a href="https://doi.org/10.1002/hipo.22407">10.1002/hipo.22407</a>.
  short: C.N. Boccara, L. Kjønigsen, I. Hammer, J. Bjaalie, T. Leergaard, M. Witter,
    Hippocampus 25 (2015) 838–857.
date_created: 2018-12-11T11:54:29Z
date_published: 2015-07-01T00:00:00Z
date_updated: 2025-09-23T07:29:29Z
day: '01'
department:
- _id: JoCs
doi: 10.1002/hipo.22407
external_id:
  isi:
  - '000356812700007'
intvolume: '        25'
isi: 1
issue: '7'
language:
- iso: eng
month: '07'
oa_version: None
page: 838 - 857
publication: Hippocampus
publication_status: published
publisher: Wiley
publist_id: '5222'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A three-plane architectonic atlas of the rat hippocampal region
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 25
year: '2015'
...
---
_id: '1878'
abstract:
- lang: eng
  text: Petrocoptis is a small genus of chasmophytic plants endemic to the Iberian
    Peninsula, with some localized populations in the French Pyrenees. Within the
    genus, a dozen species have been recognized based on morphological diversity,
    most of them with limited distribution area, in small populations and frequently
    with potential threats to their survival. To date, however, a molecular evaluation
    of the current systematic treatments has not been carried out. The aim of the
    present study is to infer phylogenetic relationships among its subordinate taxa
    by using plastidial rps16 intron and nuclear internal transcribed spacer (ITS)
    DNA sequences; and evaluate the phylogenetic placement of the genus Petrocoptis
    within the family Caryophyllaceae. The monophyly of Petrocoptis is supported by
    both ITS and rps16 intron sequence analyses. Furthermore, time estimates using
    BEAST analyses indicate a Middle to Late Miocene diversification (10.59 Myr, 6.44–15.26
    Myr highest posterior densities [HPD], for ITS; 14.30 Myr, 8.61–21.00 Myr HPD,
    for rps16 intron).
article_processing_charge: No
author:
- first_name: Eduardo
  full_name: Cires Rodriguez, Eduardo
  id: 2AD56A7A-F248-11E8-B48F-1D18A9856A87
  last_name: Cires Rodriguez
- first_name: José
  full_name: Prieto, José
  last_name: Prieto
citation:
  ama: Cires Rodriguez E, Prieto J. Phylogenetic relationships of Petrocoptis A. Braun
    ex Endl. (Caryophyllaceae), a discussed genus from the Iberian Peninsula. <i>Journal
    of Plant Research</i>. 2015;128(2):223-238. doi:<a href="https://doi.org/10.1007/s10265-014-0691-6">10.1007/s10265-014-0691-6</a>
  apa: Cires Rodriguez, E., &#38; Prieto, J. (2015). Phylogenetic relationships of
    Petrocoptis A. Braun ex Endl. (Caryophyllaceae), a discussed genus from the Iberian
    Peninsula. <i>Journal of Plant Research</i>. Springer. <a href="https://doi.org/10.1007/s10265-014-0691-6">https://doi.org/10.1007/s10265-014-0691-6</a>
  chicago: Cires Rodriguez, Eduardo, and José Prieto. “Phylogenetic Relationships
    of Petrocoptis A. Braun Ex Endl. (Caryophyllaceae), a Discussed Genus from the
    Iberian Peninsula.” <i>Journal of Plant Research</i>. Springer, 2015. <a href="https://doi.org/10.1007/s10265-014-0691-6">https://doi.org/10.1007/s10265-014-0691-6</a>.
  ieee: E. Cires Rodriguez and J. Prieto, “Phylogenetic relationships of Petrocoptis
    A. Braun ex Endl. (Caryophyllaceae), a discussed genus from the Iberian Peninsula,”
    <i>Journal of Plant Research</i>, vol. 128, no. 2. Springer, pp. 223–238, 2015.
  ista: Cires Rodriguez E, Prieto J. 2015. Phylogenetic relationships of Petrocoptis
    A. Braun ex Endl. (Caryophyllaceae), a discussed genus from the Iberian Peninsula.
    Journal of Plant Research. 128(2), 223–238.
  mla: Cires Rodriguez, Eduardo, and José Prieto. “Phylogenetic Relationships of Petrocoptis
    A. Braun Ex Endl. (Caryophyllaceae), a Discussed Genus from the Iberian Peninsula.”
    <i>Journal of Plant Research</i>, vol. 128, no. 2, Springer, 2015, pp. 223–38,
    doi:<a href="https://doi.org/10.1007/s10265-014-0691-6">10.1007/s10265-014-0691-6</a>.
  short: E. Cires Rodriguez, J. Prieto, Journal of Plant Research 128 (2015) 223–238.
corr_author: '1'
date_created: 2018-12-11T11:54:30Z
date_published: 2015-01-24T00:00:00Z
date_updated: 2025-09-23T09:49:04Z
day: '24'
department:
- _id: JiFr
doi: 10.1007/s10265-014-0691-6
external_id:
  isi:
  - '000350826000001'
intvolume: '       128'
isi: 1
issue: '2'
language:
- iso: eng
month: '01'
oa_version: None
page: 223 - 238
publication: Journal of Plant Research
publication_status: published
publisher: Springer
publist_id: '5217'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Phylogenetic relationships of Petrocoptis A. Braun ex Endl. (Caryophyllaceae),
  a discussed genus from the Iberian Peninsula
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 128
year: '2015'
...
---
_id: '1879'
abstract:
- lang: eng
  text: When electron microscopy (EM) was introduced in the 1930s it gave scientists
    their first look into the nanoworld of cells. Over the last 80 years EM has vastly
    increased our understanding of the complex cellular structures that underlie the
    diverse functions that cells need to maintain life. One drawback that has been
    difficult to overcome was the inherent lack of volume information, mainly due
    to the limit on the thickness of sections that could be viewed in a transmission
    electron microscope (TEM). For many years scientists struggled to achieve three-dimensional
    (3D) EM using serial section reconstructions, TEM tomography, and scanning EM
    (SEM) techniques such as freeze-fracture. Although each technique yielded some
    special information, they required a significant amount of time and specialist
    expertise to obtain even a very small 3D EM dataset. Almost 20 years ago scientists
    began to exploit SEMs to image blocks of embedded tissues and perform serial sectioning
    of these tissues inside the SEM chamber. Using first focused ion beams (FIB) and
    subsequently robotic ultramicrotomes (serial block-face, SBF-SEM) microscopists
    were able to collect large volumes of 3D EM information at resolutions that could
    address many important biological questions, and do so in an efficient manner.
    We present here some examples of 3D EM taken from the many diverse specimens that
    have been imaged in our core facility. We propose that the next major step forward
    will be to efficiently correlate functional information obtained using light microscopy
    (LM) with 3D EM datasets to more completely investigate the important links between
    cell structures and their functions.
acknowledgement: The Zeiss Merlin with Gatan 3View2XP and Zeiss Auriga were acquired
  through a CLEM grant from Minister Ingrid Lieten to the VIB Bio-Imaging-Core. Michiel
  Krols and Saskia Lippens are the recipients of a fellowship from the FWO (Fonds
  Wetenschappelijk Onderzoek) of Flanders.
article_processing_charge: No
author:
- first_name: A
  full_name: Kremer, A
  last_name: Kremer
- first_name: Stefaan
  full_name: Lippens, Stefaan
  last_name: Lippens
- first_name: Sonia
  full_name: Bartunkova, Sonia
  last_name: Bartunkova
- first_name: Bob
  full_name: Asselbergh, Bob
  last_name: Asselbergh
- first_name: Cendric
  full_name: Blanpain, Cendric
  last_name: Blanpain
- first_name: Matyas
  full_name: Fendrych, Matyas
  id: 43905548-F248-11E8-B48F-1D18A9856A87
  last_name: Fendrych
  orcid: 0000-0002-9767-8699
- first_name: A
  full_name: Goossens, A
  last_name: Goossens
- first_name: Matthew
  full_name: Holt, Matthew
  last_name: Holt
- first_name: Sophie
  full_name: Janssens, Sophie
  last_name: Janssens
- first_name: Michiel
  full_name: Krols, Michiel
  last_name: Krols
- first_name: Jean
  full_name: Larsimont, Jean
  last_name: Larsimont
- first_name: Conor
  full_name: Mc Guire, Conor
  last_name: Mc Guire
- first_name: Moritz
  full_name: Nowack, Moritz
  last_name: Nowack
- first_name: Xavier
  full_name: Saelens, Xavier
  last_name: Saelens
- first_name: Andreas
  full_name: Schertel, Andreas
  last_name: Schertel
- first_name: B
  full_name: Schepens, B
  last_name: Schepens
- first_name: M
  full_name: Slezak, M
  last_name: Slezak
- first_name: Vincent
  full_name: Timmerman, Vincent
  last_name: Timmerman
- first_name: Clara
  full_name: Theunis, Clara
  last_name: Theunis
- first_name: Ronald
  full_name: Van Brempt, Ronald
  last_name: Van Brempt
- first_name: Y
  full_name: Visser, Y
  last_name: Visser
- first_name: Christophe
  full_name: Guérin, Christophe
  last_name: Guérin
citation:
  ama: Kremer A, Lippens S, Bartunkova S, et al. Developing 3D SEM in a broad biological
    context. <i>Journal of Microscopy</i>. 2015;259(2):80-96. doi:<a href="https://doi.org/10.1111/jmi.12211">10.1111/jmi.12211</a>
  apa: Kremer, A., Lippens, S., Bartunkova, S., Asselbergh, B., Blanpain, C., Fendrych,
    M., … Guérin, C. (2015). Developing 3D SEM in a broad biological context. <i>Journal
    of Microscopy</i>. Wiley-Blackwell. <a href="https://doi.org/10.1111/jmi.12211">https://doi.org/10.1111/jmi.12211</a>
  chicago: Kremer, A, Stefaan Lippens, Sonia Bartunkova, Bob Asselbergh, Cendric Blanpain,
    Matyas Fendrych, A Goossens, et al. “Developing 3D SEM in a Broad Biological Context.”
    <i>Journal of Microscopy</i>. Wiley-Blackwell, 2015. <a href="https://doi.org/10.1111/jmi.12211">https://doi.org/10.1111/jmi.12211</a>.
  ieee: A. Kremer <i>et al.</i>, “Developing 3D SEM in a broad biological context,”
    <i>Journal of Microscopy</i>, vol. 259, no. 2. Wiley-Blackwell, pp. 80–96, 2015.
  ista: Kremer A, Lippens S, Bartunkova S, Asselbergh B, Blanpain C, Fendrych M, Goossens
    A, Holt M, Janssens S, Krols M, Larsimont J, Mc Guire C, Nowack M, Saelens X,
    Schertel A, Schepens B, Slezak M, Timmerman V, Theunis C, Van Brempt R, Visser
    Y, Guérin C. 2015. Developing 3D SEM in a broad biological context. Journal of
    Microscopy. 259(2), 80–96.
  mla: Kremer, A., et al. “Developing 3D SEM in a Broad Biological Context.” <i>Journal
    of Microscopy</i>, vol. 259, no. 2, Wiley-Blackwell, 2015, pp. 80–96, doi:<a href="https://doi.org/10.1111/jmi.12211">10.1111/jmi.12211</a>.
  short: A. Kremer, S. Lippens, S. Bartunkova, B. Asselbergh, C. Blanpain, M. Fendrych,
    A. Goossens, M. Holt, S. Janssens, M. Krols, J. Larsimont, C. Mc Guire, M. Nowack,
    X. Saelens, A. Schertel, B. Schepens, M. Slezak, V. Timmerman, C. Theunis, R.
    Van Brempt, Y. Visser, C. Guérin, Journal of Microscopy 259 (2015) 80–96.
date_created: 2018-12-11T11:54:30Z
date_published: 2015-08-01T00:00:00Z
date_updated: 2025-09-23T08:26:17Z
day: '01'
ddc:
- '570'
department:
- _id: JiFr
doi: 10.1111/jmi.12211
external_id:
  isi:
  - '000358300600002'
file:
- access_level: open_access
  checksum: 3649c5372d1644062d728ea9287e367f
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:11:19Z
  date_updated: 2020-07-14T12:45:19Z
  file_id: '4872'
  file_name: IST-2016-459-v1+1_KREMER_et_al-2015-Journal_of_Microscopy.pdf
  file_size: 2899898
  relation: main_file
file_date_updated: 2020-07-14T12:45:19Z
has_accepted_license: '1'
intvolume: '       259'
isi: 1
issue: '2'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 80 - 96
publication: Journal of Microscopy
publication_status: published
publisher: Wiley-Blackwell
publist_id: '5218'
pubrep_id: '459'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Developing 3D SEM in a broad biological context
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: 259
year: '2015'
...
---
_id: '1880'
abstract:
- lang: eng
  text: We investigate the relation between Bose-Einstein condensation (BEC) and superfluidity
    in the ground state of a one-dimensional model of interacting bosons in a strong
    random potential. We prove rigorously that in a certain parameter regime the superfluid
    fraction can be arbitrarily small while complete BEC prevails. In another regime
    there is both complete BEC and complete superfluidity, despite the strong disorder
acknowledgement: Support from the Natural Sciences and Engineering Research Council
  of Canada NSERC (MK and RS) and from the Austrian Science Fund FWF (JY, under project
  P 22929-N16) is gratefully acknowledged
article_number: '013022'
article_processing_charge: No
author:
- first_name: Martin
  full_name: Könenberg, Martin
  last_name: Könenberg
- first_name: Thomas
  full_name: Moser, Thomas
  id: 2B5FC9A4-F248-11E8-B48F-1D18A9856A87
  last_name: Moser
- first_name: Robert
  full_name: Seiringer, Robert
  id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
  last_name: Seiringer
  orcid: 0000-0002-6781-0521
- first_name: Jakob
  full_name: Yngvason, Jakob
  last_name: Yngvason
citation:
  ama: Könenberg M, Moser T, Seiringer R, Yngvason J. Superfluid behavior of a Bose-Einstein
    condensate in a random potential. <i>New Journal of Physics</i>. 2015;17. doi:<a
    href="https://doi.org/10.1088/1367-2630/17/1/013022">10.1088/1367-2630/17/1/013022</a>
  apa: Könenberg, M., Moser, T., Seiringer, R., &#38; Yngvason, J. (2015). Superfluid
    behavior of a Bose-Einstein condensate in a random potential. <i>New Journal of
    Physics</i>. IOP Publishing. <a href="https://doi.org/10.1088/1367-2630/17/1/013022">https://doi.org/10.1088/1367-2630/17/1/013022</a>
  chicago: Könenberg, Martin, Thomas Moser, Robert Seiringer, and Jakob Yngvason.
    “Superfluid Behavior of a Bose-Einstein Condensate in a Random Potential.” <i>New
    Journal of Physics</i>. IOP Publishing, 2015. <a href="https://doi.org/10.1088/1367-2630/17/1/013022">https://doi.org/10.1088/1367-2630/17/1/013022</a>.
  ieee: M. Könenberg, T. Moser, R. Seiringer, and J. Yngvason, “Superfluid behavior
    of a Bose-Einstein condensate in a random potential,” <i>New Journal of Physics</i>,
    vol. 17. IOP Publishing, 2015.
  ista: Könenberg M, Moser T, Seiringer R, Yngvason J. 2015. Superfluid behavior of
    a Bose-Einstein condensate in a random potential. New Journal of Physics. 17,
    013022.
  mla: Könenberg, Martin, et al. “Superfluid Behavior of a Bose-Einstein Condensate
    in a Random Potential.” <i>New Journal of Physics</i>, vol. 17, 013022, IOP Publishing,
    2015, doi:<a href="https://doi.org/10.1088/1367-2630/17/1/013022">10.1088/1367-2630/17/1/013022</a>.
  short: M. Könenberg, T. Moser, R. Seiringer, J. Yngvason, New Journal of Physics
    17 (2015).
date_created: 2018-12-11T11:54:30Z
date_published: 2015-01-15T00:00:00Z
date_updated: 2025-09-23T10:51:00Z
day: '15'
ddc:
- '530'
department:
- _id: RoSe
doi: 10.1088/1367-2630/17/1/013022
external_id:
  isi:
  - '000348759300007'
file:
- access_level: open_access
  checksum: 38fdf2b5ac30445e26a5d613abd84b16
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:12:44Z
  date_updated: 2020-07-14T12:45:20Z
  file_id: '4963'
  file_name: IST-2016-447-v1+1_document_1_.pdf
  file_size: 768108
  relation: main_file
file_date_updated: 2020-07-14T12:45:20Z
has_accepted_license: '1'
intvolume: '        17'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 26450934-B435-11E9-9278-68D0E5697425
  name: NSERC Postdoctoral fellowship
publication: New Journal of Physics
publication_status: published
publisher: IOP Publishing
publist_id: '5214'
pubrep_id: '447'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Superfluid behavior of a Bose-Einstein condensate in a random potential
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: 17
year: '2015'
...
---
_id: '1882'
abstract:
- lang: eng
  text: We provide a framework for compositional and iterative design and verification
    of systems with quantitative information, such as rewards, time or energy. It
    is based on disjunctive modal transition systems where we allow actions to bear
    various types of quantitative information. Throughout the design process the actions
    can be further refined and the information made more precise. We show how to compute
    the results of standard operations on the systems, including the quotient (residual),
    which has not been previously considered for quantitative non-deterministic systems.
    Our quantitative framework has close connections to the modal nu-calculus and
    is compositional with respect to general notions of distances between systems
    and the standard operations.
acknowledgement: This research was funded in part by the European Research Council
  (ERC) under grant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF)
  project S11402-N23 (RiSE), and by the Czech Science Foundation, grant No. P202/12/G061.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Uli
  full_name: Fahrenberg, Uli
  last_name: Fahrenberg
- first_name: Jan
  full_name: Kretinsky, Jan
  id: 44CEF464-F248-11E8-B48F-1D18A9856A87
  last_name: Kretinsky
  orcid: 0000-0002-8122-2881
- first_name: Axel
  full_name: Legay, Axel
  last_name: Legay
- first_name: Louis
  full_name: Traonouez, Louis
  last_name: Traonouez
citation:
  ama: 'Fahrenberg U, Kretinsky J, Legay A, Traonouez L. Compositionality for quantitative
    specifications. In: Vol 8997. Springer; 2015:306-324. doi:<a href="https://doi.org/10.1007/978-3-319-15317-9_19">10.1007/978-3-319-15317-9_19</a>'
  apa: 'Fahrenberg, U., Kretinsky, J., Legay, A., &#38; Traonouez, L. (2015). Compositionality
    for quantitative specifications (Vol. 8997, pp. 306–324). Presented at the FACS:
    Formal Aspects of Component Software, Bertinoro, Italy: Springer. <a href="https://doi.org/10.1007/978-3-319-15317-9_19">https://doi.org/10.1007/978-3-319-15317-9_19</a>'
  chicago: Fahrenberg, Uli, Jan Kretinsky, Axel Legay, and Louis Traonouez. “Compositionality
    for Quantitative Specifications,” 8997:306–24. Springer, 2015. <a href="https://doi.org/10.1007/978-3-319-15317-9_19">https://doi.org/10.1007/978-3-319-15317-9_19</a>.
  ieee: 'U. Fahrenberg, J. Kretinsky, A. Legay, and L. Traonouez, “Compositionality
    for quantitative specifications,” presented at the FACS: Formal Aspects of Component
    Software, Bertinoro, Italy, 2015, vol. 8997, pp. 306–324.'
  ista: 'Fahrenberg U, Kretinsky J, Legay A, Traonouez L. 2015. Compositionality for
    quantitative specifications. FACS: Formal Aspects of Component Software, LNCS,
    vol. 8997, 306–324.'
  mla: Fahrenberg, Uli, et al. <i>Compositionality for Quantitative Specifications</i>.
    Vol. 8997, Springer, 2015, pp. 306–24, doi:<a href="https://doi.org/10.1007/978-3-319-15317-9_19">10.1007/978-3-319-15317-9_19</a>.
  short: U. Fahrenberg, J. Kretinsky, A. Legay, L. Traonouez, in:, Springer, 2015,
    pp. 306–324.
conference:
  end_date: 2014-09-12
  location: Bertinoro, Italy
  name: 'FACS: Formal Aspects of Component Software'
  start_date: 2014-09-10
corr_author: '1'
date_created: 2018-12-11T11:54:31Z
date_published: 2015-01-30T00:00:00Z
date_updated: 2025-06-11T07:22:00Z
day: '30'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1007/978-3-319-15317-9_19
ec_funded: 1
external_id:
  arxiv:
  - '1408.1256'
intvolume: '      8997'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1408.1256
month: '01'
oa: 1
oa_version: Preprint
page: 306 - 324
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '267989'
  name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
publication_status: published
publisher: Springer
publist_id: '5216'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Compositionality for quantitative specifications
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8997
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 Statistical
    Nonlinear and Soft Matter Physics</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 Statistical Nonlinear and Soft Matter Physics</i>. American Institute
    of Physics. <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 Statistical Nonlinear and Soft Matter Physics</i>.
    American Institute of Physics, 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
    Statistical Nonlinear and Soft Matter Physics</i>, vol. 91, no. 2. American Institute
    of Physics, 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 Statistical
    Nonlinear and Soft Matter Physics. 91(2), 022803.
  mla: Keller-Schmidt, Stephanie, et al. “Anomalous Scaling in an Age-Dependent Branching
    Model.” <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>,
    vol. 91, no. 2, 022803, American Institute of Physics, 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 Statistical Nonlinear and Soft Matter Physics 91 (2015).
date_created: 2018-12-11T11:54:31Z
date_published: 2015-02-02T00:00:00Z
date_updated: 2025-09-23T07:53:52Z
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 Statistical Nonlinear and Soft Matter Physics
publication_status: published
publisher: American Institute of Physics
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 91
year: '2015'
...
---
_id: '1885'
abstract:
- lang: eng
  text: 'The concept of positional information is central to our understanding of
    how cells determine their location in a multicellular structure and thereby their
    developmental fates. Nevertheless, positional information has neither been defined
    mathematically nor quantified in a principled way. Here we provide an information-theoretic
    definition in the context of developmental gene expression patterns and examine
    the features of expression patterns that affect positional information quantitatively.
    We connect positional information with the concept of positional error and develop
    tools to directly measure information and error from experimental data. We illustrate
    our framework for the case of gap gene expression patterns in the early Drosophila
    embryo and show how information that is distributed among only four genes is sufficient
    to determine developmental fates with nearly single-cell resolution. Our approach
    can be generalized to a variety of different model systems; procedures and examples
    are discussed in detail. '
article_processing_charge: No
arxiv: 1
author:
- first_name: Gasper
  full_name: Tkacik, Gasper
  id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
  last_name: Tkacik
  orcid: 0000-0002-6699-1455
- first_name: Julien
  full_name: Dubuis, Julien
  last_name: Dubuis
- first_name: Mariela
  full_name: Petkova, Mariela
  last_name: Petkova
- first_name: Thomas
  full_name: Gregor, Thomas
  last_name: Gregor
citation:
  ama: 'Tkačik G, Dubuis J, Petkova M, Gregor T. Positional information, positional
    error, and readout precision in morphogenesis: A mathematical framework. <i>Genetics</i>.
    2015;199(1):39-59. doi:<a href="https://doi.org/10.1534/genetics.114.171850">10.1534/genetics.114.171850</a>'
  apa: 'Tkačik, G., Dubuis, J., Petkova, M., &#38; Gregor, T. (2015). Positional information,
    positional error, and readout precision in morphogenesis: A mathematical framework.
    <i>Genetics</i>. Genetics Society of America. <a href="https://doi.org/10.1534/genetics.114.171850">https://doi.org/10.1534/genetics.114.171850</a>'
  chicago: 'Tkačik, Gašper, Julien Dubuis, Mariela Petkova, and Thomas Gregor. “Positional
    Information, Positional Error, and Readout Precision in Morphogenesis: A Mathematical
    Framework.” <i>Genetics</i>. Genetics Society of America, 2015. <a href="https://doi.org/10.1534/genetics.114.171850">https://doi.org/10.1534/genetics.114.171850</a>.'
  ieee: 'G. Tkačik, J. Dubuis, M. Petkova, and T. Gregor, “Positional information,
    positional error, and readout precision in morphogenesis: A mathematical framework,”
    <i>Genetics</i>, vol. 199, no. 1. Genetics Society of America, pp. 39–59, 2015.'
  ista: 'Tkačik G, Dubuis J, Petkova M, Gregor T. 2015. Positional information, positional
    error, and readout precision in morphogenesis: A mathematical framework. Genetics.
    199(1), 39–59.'
  mla: 'Tkačik, Gašper, et al. “Positional Information, Positional Error, and Readout
    Precision in Morphogenesis: A Mathematical Framework.” <i>Genetics</i>, vol. 199,
    no. 1, Genetics Society of America, 2015, pp. 39–59, doi:<a href="https://doi.org/10.1534/genetics.114.171850">10.1534/genetics.114.171850</a>.'
  short: G. Tkačik, J. Dubuis, M. Petkova, T. Gregor, Genetics 199 (2015) 39–59.
corr_author: '1'
date_created: 2018-12-11T11:54:32Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2025-09-23T09:53:07Z
day: '01'
department:
- _id: GaTk
doi: 10.1534/genetics.114.171850
external_id:
  arxiv:
  - '1404.5599'
  isi:
  - '000347712900004'
intvolume: '       199'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1404.5599
month: '01'
oa: 1
oa_version: Preprint
page: 39 - 59
publication: Genetics
publication_status: published
publisher: Genetics Society of America
publist_id: '5210'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Positional information, positional error, and readout precision in morphogenesis:
  A mathematical framework'
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 199
year: '2015'
...
---
_id: '1938'
abstract:
- lang: eng
  text: 'We numerically investigate the distribution of extrema of ''chaotic'' Laplacian
    eigenfunctions on two-dimensional manifolds. Our contribution is two-fold: (a)
    we count extrema on grid graphs with a small number of randomly added edges and
    show the behavior to coincide with the 1957 prediction of Longuet-Higgins for
    the continuous case and (b) we compute the regularity of their spatial distribution
    using discrepancy, which is a classical measure from the theory of Monte Carlo
    integration. The first part suggests that grid graphs with randomly added edges
    should behave like two-dimensional surfaces with ergodic geodesic flow; in the
    second part we show that the extrema are more regularly distributed in space than
    the grid Z2.'
acknowledgement: "F.P. was supported by the Graduate School of IST Austria. S.S. was
  partially supported by CRC1060 of the DFG\r\nThe authors thank Olga Symonova and
  Michael Kerber for sharing their implementation of the persistence algorithm. "
article_processing_charge: No
author:
- first_name: Florian
  full_name: Pausinger, Florian
  id: 2A77D7A2-F248-11E8-B48F-1D18A9856A87
  last_name: Pausinger
  orcid: 0000-0002-8379-3768
- first_name: Stefan
  full_name: Steinerberger, Stefan
  last_name: Steinerberger
citation:
  ama: Pausinger F, Steinerberger S. On the distribution of local extrema in quantum
    chaos. <i>Physics Letters, Section A</i>. 2015;379(6):535-541. doi:<a href="https://doi.org/10.1016/j.physleta.2014.12.010">10.1016/j.physleta.2014.12.010</a>
  apa: Pausinger, F., &#38; Steinerberger, S. (2015). On the distribution of local
    extrema in quantum chaos. <i>Physics Letters, Section A</i>. Elsevier. <a href="https://doi.org/10.1016/j.physleta.2014.12.010">https://doi.org/10.1016/j.physleta.2014.12.010</a>
  chicago: Pausinger, Florian, and Stefan Steinerberger. “On the Distribution of Local
    Extrema in Quantum Chaos.” <i>Physics Letters, Section A</i>. Elsevier, 2015.
    <a href="https://doi.org/10.1016/j.physleta.2014.12.010">https://doi.org/10.1016/j.physleta.2014.12.010</a>.
  ieee: F. Pausinger and S. Steinerberger, “On the distribution of local extrema in
    quantum chaos,” <i>Physics Letters, Section A</i>, vol. 379, no. 6. Elsevier,
    pp. 535–541, 2015.
  ista: Pausinger F, Steinerberger S. 2015. On the distribution of local extrema in
    quantum chaos. Physics Letters, Section A. 379(6), 535–541.
  mla: Pausinger, Florian, and Stefan Steinerberger. “On the Distribution of Local
    Extrema in Quantum Chaos.” <i>Physics Letters, Section A</i>, vol. 379, no. 6,
    Elsevier, 2015, pp. 535–41, doi:<a href="https://doi.org/10.1016/j.physleta.2014.12.010">10.1016/j.physleta.2014.12.010</a>.
  short: F. Pausinger, S. Steinerberger, Physics Letters, Section A 379 (2015) 535–541.
corr_author: '1'
date_created: 2018-12-11T11:54:49Z
date_published: 2015-03-06T00:00:00Z
date_updated: 2025-09-23T09:44:12Z
day: '06'
department:
- _id: HeEd
doi: 10.1016/j.physleta.2014.12.010
external_id:
  isi:
  - '000349586000006'
intvolume: '       379'
isi: 1
issue: '6'
language:
- iso: eng
month: '03'
oa_version: None
page: 535 - 541
publication: Physics Letters, Section A
publication_status: published
publisher: Elsevier
publist_id: '5152'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the distribution of local extrema in quantum chaos
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 379
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 Statistical Nonlinear and Soft Matter
    Physics</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 Statistical
    Nonlinear and Soft Matter Physics</i>. American Institute of Physics. <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 Statistical
    Nonlinear and Soft Matter Physics</i>. American Institute of Physics, 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 Statistical Nonlinear and
    Soft Matter Physics</i>, vol. 91, no. 6. American Institute of Physics, 2015.
  ista: Sokolowski TR, Tkačik G. 2015. Optimizing information flow in small genetic
    networks. IV. Spatial coupling. Physical Review E Statistical Nonlinear and Soft
    Matter Physics. 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 Statistical Nonlinear
    and Soft Matter Physics</i>, vol. 91, no. 6, 062710, American Institute of Physics,
    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 Statistical Nonlinear and Soft
    Matter Physics 91 (2015).
corr_author: '1'
date_created: 2018-12-11T11:54:49Z
date_published: 2015-06-15T00:00:00Z
date_updated: 2025-09-23T09:46:10Z
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 Statistical Nonlinear and Soft Matter Physics
publication_status: published
publisher: American Institute of Physics
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 91
year: '2015'
...
---
_id: '1944'
acknowledgement: This work was supported by the European Research Council (project
  ERC-2011-StG-20101109-PSDP); the Agency for Innovation by Science and Technology
  (IWT) (predoctoral fellowship to H.R.); and the People Programme (Marie Curie Actions)
  of the European Union
article_processing_charge: No
author:
- first_name: Hana
  full_name: Rakusová, Hana
  last_name: Rakusová
- first_name: Matyas
  full_name: Fendrych, Matyas
  id: 43905548-F248-11E8-B48F-1D18A9856A87
  last_name: Fendrych
  orcid: 0000-0002-9767-8699
- first_name: Jirí
  full_name: Friml, Jirí
  id: 4159519E-F248-11E8-B48F-1D18A9856A87
  last_name: Friml
  orcid: 0000-0002-8302-7596
citation:
  ama: Rakusová H, Fendrych M, Friml J. Intracellular trafficking and PIN-mediated
    cell polarity during tropic responses in plants. <i>Current Opinion in Plant Biology</i>.
    2015;23(2):116-123. doi:<a href="https://doi.org/10.1016/j.pbi.2014.12.002">10.1016/j.pbi.2014.12.002</a>
  apa: Rakusová, H., Fendrych, M., &#38; Friml, J. (2015). Intracellular trafficking
    and PIN-mediated cell polarity during tropic responses in plants. <i>Current Opinion
    in Plant Biology</i>. Elsevier. <a href="https://doi.org/10.1016/j.pbi.2014.12.002">https://doi.org/10.1016/j.pbi.2014.12.002</a>
  chicago: Rakusová, Hana, Matyas Fendrych, and Jiří Friml. “Intracellular Trafficking
    and PIN-Mediated Cell Polarity during Tropic Responses in Plants.” <i>Current
    Opinion in Plant Biology</i>. Elsevier, 2015. <a href="https://doi.org/10.1016/j.pbi.2014.12.002">https://doi.org/10.1016/j.pbi.2014.12.002</a>.
  ieee: H. Rakusová, M. Fendrych, and J. Friml, “Intracellular trafficking and PIN-mediated
    cell polarity during tropic responses in plants,” <i>Current Opinion in Plant
    Biology</i>, vol. 23, no. 2. Elsevier, pp. 116–123, 2015.
  ista: Rakusová H, Fendrych M, Friml J. 2015. Intracellular trafficking and PIN-mediated
    cell polarity during tropic responses in plants. Current Opinion in Plant Biology.
    23(2), 116–123.
  mla: Rakusová, Hana, et al. “Intracellular Trafficking and PIN-Mediated Cell Polarity
    during Tropic Responses in Plants.” <i>Current Opinion in Plant Biology</i>, vol.
    23, no. 2, Elsevier, 2015, pp. 116–23, doi:<a href="https://doi.org/10.1016/j.pbi.2014.12.002">10.1016/j.pbi.2014.12.002</a>.
  short: H. Rakusová, M. Fendrych, J. Friml, Current Opinion in Plant Biology 23 (2015)
    116–123.
corr_author: '1'
date_created: 2018-12-11T11:54:51Z
date_published: 2015-02-01T00:00:00Z
date_updated: 2025-09-23T09:23:09Z
day: '01'
department:
- _id: JiFr
doi: 10.1016/j.pbi.2014.12.002
ec_funded: 1
external_id:
  isi:
  - '000349880900017'
intvolume: '        23'
isi: 1
issue: '2'
language:
- iso: eng
month: '02'
oa_version: None
page: 116 - 123
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '282300'
  name: Polarity and subcellular dynamics in plants
- _id: 25681D80-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '291734'
  name: International IST Postdoc Fellowship Programme
publication: Current Opinion in Plant Biology
publication_status: published
publisher: Elsevier
publist_id: '5140'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Intracellular trafficking and PIN-mediated cell polarity during tropic responses
  in plants
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 23
year: '2015'
...
---
_id: '473'
abstract:
- lang: eng
  text: We prove that nonlinear Gibbs measures can be obtained from the corresponding
    many-body, grand-canonical, quantum Gibbs states, in a mean-field limit where
    the temperature T diverges and the interaction strength behaves as 1/T. We proceed
    by characterizing the interacting Gibbs state as minimizing a functional counting
    the free-energy relatively to the non-interacting case. We then perform an infinite-dimensional
    analogue of phase-space semiclassical analysis, using fine properties of the quantum
    relative entropy, the link between quantum de Finetti measures and upper/lower
    symbols in a coherent state basis, as well as Berezin-Lieb type inequalities.
    Our results cover the measure built on the defocusing nonlinear Schrödinger functional
    on a finite interval, as well as smoother interactions in dimensions d 2.
author:
- first_name: Mathieu
  full_name: Lewin, Mathieu
  last_name: Lewin
- first_name: Nam
  full_name: Phan Thanh, Nam
  id: 404092F4-F248-11E8-B48F-1D18A9856A87
  last_name: Phan Thanh
- first_name: Nicolas
  full_name: Rougerie, Nicolas
  last_name: Rougerie
citation:
  ama: Lewin M, Nam P, Rougerie N. Derivation of nonlinear gibbs measures from many-body
    quantum mechanics. <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. 2015;2:65-115.
    doi:<a href="https://doi.org/10.5802/jep.18">10.5802/jep.18</a>
  apa: Lewin, M., Nam, P., &#38; Rougerie, N. (2015). Derivation of nonlinear gibbs
    measures from many-body quantum mechanics. <i>Journal de l’Ecole Polytechnique
    - Mathematiques</i>. Ecole Polytechnique. <a href="https://doi.org/10.5802/jep.18">https://doi.org/10.5802/jep.18</a>
  chicago: Lewin, Mathieu, Phan Nam, and Nicolas Rougerie. “Derivation of Nonlinear
    Gibbs Measures from Many-Body Quantum Mechanics.” <i>Journal de l’Ecole Polytechnique
    - Mathematiques</i>. Ecole Polytechnique, 2015. <a href="https://doi.org/10.5802/jep.18">https://doi.org/10.5802/jep.18</a>.
  ieee: M. Lewin, P. Nam, and N. Rougerie, “Derivation of nonlinear gibbs measures
    from many-body quantum mechanics,” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>,
    vol. 2. Ecole Polytechnique, pp. 65–115, 2015.
  ista: Lewin M, Nam P, Rougerie N. 2015. Derivation of nonlinear gibbs measures from
    many-body quantum mechanics. Journal de l’Ecole Polytechnique - Mathematiques.
    2, 65–115.
  mla: Lewin, Mathieu, et al. “Derivation of Nonlinear Gibbs Measures from Many-Body
    Quantum Mechanics.” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>, vol.
    2, Ecole Polytechnique, 2015, pp. 65–115, doi:<a href="https://doi.org/10.5802/jep.18">10.5802/jep.18</a>.
  short: M. Lewin, P. Nam, N. Rougerie, Journal de l’Ecole Polytechnique - Mathematiques
    2 (2015) 65–115.
date_created: 2018-12-11T11:46:40Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T08:00:52Z
day: '01'
ddc:
- '539'
department:
- _id: RoSe
doi: 10.5802/jep.18
ec_funded: 1
file:
- access_level: open_access
  checksum: a40eb4016717ddc9927154798a4c164a
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:12:53Z
  date_updated: 2020-07-14T12:46:35Z
  file_id: '4974'
  file_name: IST-2018-951-v1+1_2015_Thanh-Nam_Derivation_of.pdf
  file_size: 1084254
  relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: '         2'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 65 - 115
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '291734'
  name: International IST Postdoc Fellowship Programme
publication: Journal de l'Ecole Polytechnique - Mathematiques
publication_status: published
publisher: Ecole Polytechnique
publist_id: '7344'
pubrep_id: '951'
quality_controlled: '1'
scopus_import: 1
status: public
title: Derivation of nonlinear gibbs measures from many-body quantum mechanics
tmp:
  image: /image/cc_by_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
  name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
  short: CC BY-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2015'
...
---
_id: '477'
abstract:
- lang: eng
  text: Dendritic cells are potent antigen-presenting cells endowed with the unique
    ability to initiate adaptive immune responses upon inflammation. Inflammatory
    processes are often associated with an increased production of serotonin, which
    operates by activating specific receptors. However, the functional role of serotonin
    receptors in regulation of dendritic cell functions is poorly understood. Here,
    we demonstrate that expression of serotonin receptor 5-HT7 (5-HT7TR) as well as
    its downstream effector Cdc42 is upregulated in dendritic cells upon maturation.
    Although dendritic cell maturation was independent of 5-HT7TR, receptor stimulation
    affected dendritic cell morphology through Cdc42-mediated signaling. In addition,
    basal activity of 5-HT7TR was required for the proper expression of the chemokine
    receptor CCR7, which is a key factor that controls dendritic cell migration. Consistent
    with this, we observed that 5-HT7TR enhances chemotactic motility of dendritic
    cells in vitro by modulating their directionality and migration velocity. Accordingly,
    migration of dendritic cells in murine colon explants was abolished after pharmacological
    receptor inhibition. Our results indicate that there is a crucial role for 5-HT7TR-Cdc42-mediated
    signaling in the regulation of dendritic cell morphology and motility, suggesting
    that 5-HT7TR could be a new target for treatment of a variety of inflammatory
    and immune disorders.
article_processing_charge: No
author:
- first_name: Katrin
  full_name: Holst, Katrin
  last_name: Holst
- first_name: Daria
  full_name: Guseva, Daria
  last_name: Guseva
- first_name: Susann
  full_name: Schindler, Susann
  last_name: Schindler
- 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: Armin
  full_name: Braun, Armin
  last_name: Braun
- first_name: Himpriya
  full_name: Chopra, Himpriya
  last_name: Chopra
- first_name: Oliver
  full_name: Pabst, Oliver
  last_name: Pabst
- first_name: Evgeni
  full_name: Ponimaskin, Evgeni
  last_name: Ponimaskin
citation:
  ama: Holst K, Guseva D, Schindler S, et al. The serotonin receptor 5-HT7R regulates
    the morphology and migratory properties of dendritic cells. <i>Journal of Cell
    Science</i>. 2015;128(15):2866-2880. doi:<a href="https://doi.org/10.1242/jcs.167999">10.1242/jcs.167999</a>
  apa: Holst, K., Guseva, D., Schindler, S., Sixt, M. K., Braun, A., Chopra, H., …
    Ponimaskin, E. (2015). The serotonin receptor 5-HT7R regulates the morphology
    and migratory properties of dendritic cells. <i>Journal of Cell Science</i>. Company
    of Biologists. <a href="https://doi.org/10.1242/jcs.167999">https://doi.org/10.1242/jcs.167999</a>
  chicago: Holst, Katrin, Daria Guseva, Susann Schindler, Michael K Sixt, Armin Braun,
    Himpriya Chopra, Oliver Pabst, and Evgeni Ponimaskin. “The Serotonin Receptor
    5-HT7R Regulates the Morphology and Migratory Properties of Dendritic Cells.”
    <i>Journal of Cell Science</i>. Company of Biologists, 2015. <a href="https://doi.org/10.1242/jcs.167999">https://doi.org/10.1242/jcs.167999</a>.
  ieee: K. Holst <i>et al.</i>, “The serotonin receptor 5-HT7R regulates the morphology
    and migratory properties of dendritic cells,” <i>Journal of Cell Science</i>,
    vol. 128, no. 15. Company of Biologists, pp. 2866–2880, 2015.
  ista: Holst K, Guseva D, Schindler S, Sixt MK, Braun A, Chopra H, Pabst O, Ponimaskin
    E. 2015. The serotonin receptor 5-HT7R regulates the morphology and migratory
    properties of dendritic cells. Journal of Cell Science. 128(15), 2866–2880.
  mla: Holst, Katrin, et al. “The Serotonin Receptor 5-HT7R Regulates the Morphology
    and Migratory Properties of Dendritic Cells.” <i>Journal of Cell Science</i>,
    vol. 128, no. 15, Company of Biologists, 2015, pp. 2866–80, doi:<a href="https://doi.org/10.1242/jcs.167999">10.1242/jcs.167999</a>.
  short: K. Holst, D. Guseva, S. Schindler, M.K. Sixt, A. Braun, H. Chopra, O. Pabst,
    E. Ponimaskin, Journal of Cell Science 128 (2015) 2866–2880.
date_created: 2018-12-11T11:46:41Z
date_published: 2015-06-15T00:00:00Z
date_updated: 2025-09-23T14:16:38Z
day: '15'
department:
- _id: MiSi
doi: 10.1242/jcs.167999
external_id:
  isi:
  - '000359782100013'
intvolume: '       128'
isi: 1
issue: '15'
language:
- iso: eng
month: '06'
oa_version: None
page: 2866 - 2880
publication: Journal of Cell Science
publication_status: published
publisher: Company of Biologists
publist_id: '7343'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The serotonin receptor 5-HT7R regulates the morphology and migratory properties
  of dendritic cells
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 128
year: '2015'
...
---
_id: '523'
abstract:
- lang: eng
  text: We consider two-player games played on weighted directed graphs with mean-payoff
    and total-payoff objectives, two classical quantitative objectives. While for
    single-dimensional games the complexity and memory bounds for both objectives
    coincide, we show that in contrast to multi-dimensional mean-payoff games that
    are known to be coNP-complete, multi-dimensional total-payoff games are undecidable.
    We introduce conservative approximations of these objectives, where the payoff
    is considered over a local finite window sliding along a play, instead of the
    whole play. For single dimension, we show that (i) if the window size is polynomial,
    deciding the winner takes polynomial time, and (ii) the existence of a bounded
    window can be decided in NP ∩ coNP, and is at least as hard as solving mean-payoff
    games. For multiple dimensions, we show that (i) the problem with fixed window
    size is EXPTIME-complete, and (ii) there is no primitive-recursive algorithm to
    decide the existence of a bounded window.
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: Mickael
  full_name: Randour, Mickael
  last_name: Randour
- first_name: Jean
  full_name: Raskin, Jean
  last_name: Raskin
citation:
  ama: Chatterjee K, Doyen L, Randour M, Raskin J. Looking at mean-payoff and total-payoff
    through windows. <i>Information and Computation</i>. 2015;242(6):25-52. doi:<a
    href="https://doi.org/10.1016/j.ic.2015.03.010">10.1016/j.ic.2015.03.010</a>
  apa: Chatterjee, K., Doyen, L., Randour, M., &#38; Raskin, J. (2015). Looking at
    mean-payoff and total-payoff through windows. <i>Information and Computation</i>.
    Elsevier. <a href="https://doi.org/10.1016/j.ic.2015.03.010">https://doi.org/10.1016/j.ic.2015.03.010</a>
  chicago: Chatterjee, Krishnendu, Laurent Doyen, Mickael Randour, and Jean Raskin.
    “Looking at Mean-Payoff and Total-Payoff through Windows.” <i>Information and
    Computation</i>. Elsevier, 2015. <a href="https://doi.org/10.1016/j.ic.2015.03.010">https://doi.org/10.1016/j.ic.2015.03.010</a>.
  ieee: K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff
    and total-payoff through windows,” <i>Information and Computation</i>, vol. 242,
    no. 6. Elsevier, pp. 25–52, 2015.
  ista: Chatterjee K, Doyen L, Randour M, Raskin J. 2015. Looking at mean-payoff and
    total-payoff through windows. Information and Computation. 242(6), 25–52.
  mla: Chatterjee, Krishnendu, et al. “Looking at Mean-Payoff and Total-Payoff through
    Windows.” <i>Information and Computation</i>, vol. 242, no. 6, Elsevier, 2015,
    pp. 25–52, doi:<a href="https://doi.org/10.1016/j.ic.2015.03.010">10.1016/j.ic.2015.03.010</a>.
  short: K. Chatterjee, L. Doyen, M. Randour, J. Raskin, Information and Computation
    242 (2015) 25–52.
date_created: 2018-12-11T11:46:57Z
date_published: 2015-03-24T00:00:00Z
date_updated: 2025-09-23T09:29:55Z
day: '24'
department:
- _id: KrCh
doi: 10.1016/j.ic.2015.03.010
ec_funded: 1
external_id:
  arxiv:
  - '1302.4248'
  isi:
  - '000355664900003'
intvolume: '       242'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1302.4248
month: '03'
oa: 1
oa_version: Preprint
page: 25 - 52
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: Information and Computation
publication_status: published
publisher: Elsevier
publist_id: '7296'
quality_controlled: '1'
related_material:
  record:
  - id: '2279'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: Looking at mean-payoff and total-payoff through windows
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 242
year: '2015'
...
---
_id: '524'
abstract:
- lang: eng
  text: 'We consider concurrent games played by two players on a finite-state graph,
    where in every round the players simultaneously choose a move, and the current
    state along with the joint moves determine the successor state. We study the most
    fundamental objective for concurrent games, namely, mean-payoff or limit-average
    objective, where a reward is associated to each transition, and the goal of player
    1 is to maximize the long-run average of the rewards, and the objective of player
    2 is strictly the opposite (i.e., the games are zero-sum). The path constraint
    for player 1 could be qualitative, i.e., the mean-payoff is the maximal reward,
    or arbitrarily close to it; or quantitative, i.e., a given threshold between the
    minimal and maximal reward. We consider the computation of the almost-sure (resp.
    positive) winning sets, where player 1 can ensure that the path constraint is
    satisfied with probability 1 (resp. positive probability). Almost-sure winning
    with qualitative constraint exactly corresponds to the question of whether there
    exists a strategy to ensure that the payoff is the maximal reward of the game.
    Our main results for qualitative path constraints are as follows: (1) we establish
    qualitative determinacy results that show that for every state either player 1
    has a strategy to ensure almost-sure (resp. positive) winning against all player-2
    strategies, or player 2 has a spoiling strategy to falsify almost-sure (resp.
    positive) winning against all player-1 strategies; (2) we present optimal strategy
    complexity results that precisely characterize the classes of strategies required
    for almost-sure and positive winning for both players; and (3) we present quadratic
    time algorithms to compute the almost-sure and the positive winning sets, matching
    the best known bound of the algorithms for much simpler problems (such as reachability
    objectives). For quantitative constraints we show that a polynomial time solution
    for the almost-sure or the positive winning set would imply a solution to a long-standing
    open problem (of solving the value problem of turn-based deterministic mean-payoff
    games) that is not known to be solvable in polynomial time.'
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: Rasmus
  full_name: Ibsen-Jensen, Rasmus
  id: 3B699956-F248-11E8-B48F-1D18A9856A87
  last_name: Ibsen-Jensen
  orcid: 0000-0003-4783-0389
citation:
  ama: Chatterjee K, Ibsen-Jensen R. Qualitative analysis of concurrent mean payoff
    games. <i>Information and Computation</i>. 2015;242(6):2-24. doi:<a href="https://doi.org/10.1016/j.ic.2015.03.009">10.1016/j.ic.2015.03.009</a>
  apa: Chatterjee, K., &#38; Ibsen-Jensen, R. (2015). Qualitative analysis of concurrent
    mean payoff games. <i>Information and Computation</i>. Elsevier. <a href="https://doi.org/10.1016/j.ic.2015.03.009">https://doi.org/10.1016/j.ic.2015.03.009</a>
  chicago: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis
    of Concurrent Mean Payoff Games.” <i>Information and Computation</i>. Elsevier,
    2015. <a href="https://doi.org/10.1016/j.ic.2015.03.009">https://doi.org/10.1016/j.ic.2015.03.009</a>.
  ieee: K. Chatterjee and R. Ibsen-Jensen, “Qualitative analysis of concurrent mean
    payoff games,” <i>Information and Computation</i>, vol. 242, no. 6. Elsevier,
    pp. 2–24, 2015.
  ista: Chatterjee K, Ibsen-Jensen R. 2015. Qualitative analysis of concurrent mean
    payoff games. Information and Computation. 242(6), 2–24.
  mla: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent
    Mean Payoff Games.” <i>Information and Computation</i>, vol. 242, no. 6, Elsevier,
    2015, pp. 2–24, doi:<a href="https://doi.org/10.1016/j.ic.2015.03.009">10.1016/j.ic.2015.03.009</a>.
  short: K. Chatterjee, R. Ibsen-Jensen, Information and Computation 242 (2015) 2–24.
corr_author: '1'
date_created: 2018-12-11T11:46:57Z
date_published: 2015-10-11T00:00:00Z
date_updated: 2025-09-23T09:56:28Z
day: '11'
department:
- _id: KrCh
doi: 10.1016/j.ic.2015.03.009
external_id:
  arxiv:
  - '1409.5306'
  isi:
  - '000355664900002'
intvolume: '       242'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1409.5306
month: '10'
oa: 1
oa_version: Preprint
page: 2 - 24
publication: Information and Computation
publication_status: published
publisher: Elsevier
publist_id: '7295'
quality_controlled: '1'
related_material:
  record:
  - id: '5403'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: Qualitative analysis of concurrent mean payoff games
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 242
year: '2015'
...
---
_id: '532'
abstract:
- lang: eng
  text: Ethylene is a gaseous phytohormone that plays vital roles in plant growth
    and development. Previous studies uncovered EIN2 as an essential signal transducer
    linking ethylene perception on ER to transcriptional regulation in the nucleus
    through a “cleave and shuttle” model. In this study, we report another mechanism
    of EIN2-mediated ethylene signaling, whereby EIN2 imposes the translational repression
    of EBF1 and EBF2 mRNA. We find that the EBF1/2 3′ UTRs mediate EIN2-directed translational
    repression and identify multiple poly-uridylates (PolyU) motifs as functional
    cis elements of 3′ UTRs. Furthermore, we demonstrate that ethylene induces EIN2
    to associate with 3′ UTRs and target EBF1/2 mRNA to cytoplasmic processing-body
    (P-body) through interacting with multiple P-body factors, including EIN5 and
    PABs. Our study illustrates translational regulation as a key step in ethylene
    signaling and presents mRNA 3′ UTR functioning as a “signal transducer” to sense
    and relay cellular signaling in plants.
article_processing_charge: No
author:
- first_name: Wenyang
  full_name: Li, Wenyang
  last_name: Li
- first_name: Mengdi
  full_name: Ma, Mengdi
  last_name: Ma
- first_name: Ying
  full_name: Feng, Ying
  last_name: Feng
- first_name: Hongjiang
  full_name: Li, Hongjiang
  id: 33CA54A6-F248-11E8-B48F-1D18A9856A87
  last_name: Li
  orcid: 0000-0001-5039-9660
- first_name: Yichuan
  full_name: Wang, Yichuan
  last_name: Wang
- first_name: Yutong
  full_name: Ma, Yutong
  last_name: Ma
- first_name: Mingzhe
  full_name: Li, Mingzhe
  last_name: Li
- first_name: Fengying
  full_name: An, Fengying
  last_name: An
- first_name: Hongwei
  full_name: Guo, Hongwei
  last_name: Guo
citation:
  ama: Li W, Ma M, Feng Y, et al. EIN2-directed translational regulation of ethylene
    signaling in arabidopsis. <i>Cell</i>. 2015;163(3):670-683. doi:<a href="https://doi.org/10.1016/j.cell.2015.09.037">10.1016/j.cell.2015.09.037</a>
  apa: Li, W., Ma, M., Feng, Y., Li, H., Wang, Y., Ma, Y., … Guo, H. (2015). EIN2-directed
    translational regulation of ethylene signaling in arabidopsis. <i>Cell</i>. Cell
    Press. <a href="https://doi.org/10.1016/j.cell.2015.09.037">https://doi.org/10.1016/j.cell.2015.09.037</a>
  chicago: Li, Wenyang, Mengdi Ma, Ying Feng, Hongjiang Li, Yichuan Wang, Yutong Ma,
    Mingzhe Li, Fengying An, and Hongwei Guo. “EIN2-Directed Translational Regulation
    of Ethylene Signaling in Arabidopsis.” <i>Cell</i>. Cell Press, 2015. <a href="https://doi.org/10.1016/j.cell.2015.09.037">https://doi.org/10.1016/j.cell.2015.09.037</a>.
  ieee: W. Li <i>et al.</i>, “EIN2-directed translational regulation of ethylene signaling
    in arabidopsis,” <i>Cell</i>, vol. 163, no. 3. Cell Press, pp. 670–683, 2015.
  ista: Li W, Ma M, Feng Y, Li H, Wang Y, Ma Y, Li M, An F, Guo H. 2015. EIN2-directed
    translational regulation of ethylene signaling in arabidopsis. Cell. 163(3), 670–683.
  mla: Li, Wenyang, et al. “EIN2-Directed Translational Regulation of Ethylene Signaling
    in Arabidopsis.” <i>Cell</i>, vol. 163, no. 3, Cell Press, 2015, pp. 670–83, doi:<a
    href="https://doi.org/10.1016/j.cell.2015.09.037">10.1016/j.cell.2015.09.037</a>.
  short: W. Li, M. Ma, Y. Feng, H. Li, Y. Wang, Y. Ma, M. Li, F. An, H. Guo, Cell
    163 (2015) 670–683.
date_created: 2018-12-11T11:47:00Z
date_published: 2015-10-22T00:00:00Z
date_updated: 2025-09-23T08:40:43Z
day: '22'
department:
- _id: JiFr
doi: 10.1016/j.cell.2015.09.037
external_id:
  isi:
  - '000364828900020'
intvolume: '       163'
isi: 1
issue: '3'
language:
- iso: eng
month: '10'
oa_version: None
page: 670 - 683
publication: Cell
publication_status: published
publisher: Cell Press
publist_id: '7285'
quality_controlled: '1'
scopus_import: '1'
status: public
title: EIN2-directed translational regulation of ethylene signaling in arabidopsis
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 163
year: '2015'
...
---
_id: '5429'
abstract:
- lang: eng
  text: "We consider Markov decision processes (MDPs) with multiple limit-average
    (or mean-payoff) objectives. \r\nThere have been two different views: (i) the
    expectation semantics, where the goal is to optimize the expected mean-payoff
    objective, and (ii) the satisfaction semantics, where the goal is to maximize
    the probability of runs such that the mean-payoff value stays above a given vector.
    \ \r\nWe consider the problem where the goal is to optimize the expectation under
    the constraint that the satisfaction semantics is ensured, and thus consider a
    generalization that unifies the existing semantics.\r\nOur problem captures the
    notion of optimization with respect to strategies that are risk-averse (i.e.,
    ensures certain probabilistic guarantee).\r\nOur main results are algorithms for
    the decision problem which are always polynomial in the size of the MDP. We also
    show that an approximation of the Pareto-curve can be computed in time polynomial
    in the size of the MDP, and the approximation factor, but exponential in the number
    of dimensions.\r\nFinally, we present a complete characterization of the strategy
    complexity (in terms of memory bounds and randomization) required to solve our
    problem."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Zuzana
  full_name: Komarkova, Zuzana
  last_name: Komarkova
- first_name: Jan
  full_name: Kretinsky, Jan
  id: 44CEF464-F248-11E8-B48F-1D18A9856A87
  last_name: Kretinsky
  orcid: 0000-0002-8122-2881
citation:
  ama: Chatterjee K, Komarkova Z, Kretinsky J. <i>Unifying Two Views on Multiple Mean-Payoff
    Objectives in Markov Decision Processes</i>. IST Austria; 2015. doi:<a href="https://doi.org/10.15479/AT:IST-2015-318-v1-1">10.15479/AT:IST-2015-318-v1-1</a>
  apa: Chatterjee, K., Komarkova, Z., &#38; Kretinsky, J. (2015). <i>Unifying two
    views on multiple mean-payoff objectives in Markov decision processes</i>. IST
    Austria. <a href="https://doi.org/10.15479/AT:IST-2015-318-v1-1">https://doi.org/10.15479/AT:IST-2015-318-v1-1</a>
  chicago: Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. <i>Unifying
    Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>.
    IST Austria, 2015. <a href="https://doi.org/10.15479/AT:IST-2015-318-v1-1">https://doi.org/10.15479/AT:IST-2015-318-v1-1</a>.
  ieee: K. Chatterjee, Z. Komarkova, and J. Kretinsky, <i>Unifying two views on multiple
    mean-payoff objectives in Markov decision processes</i>. IST Austria, 2015.
  ista: Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple
    mean-payoff objectives in Markov decision processes, IST Austria, 41p.
  mla: Chatterjee, Krishnendu, et al. <i>Unifying Two Views on Multiple Mean-Payoff
    Objectives in Markov Decision Processes</i>. IST Austria, 2015, doi:<a href="https://doi.org/10.15479/AT:IST-2015-318-v1-1">10.15479/AT:IST-2015-318-v1-1</a>.
  short: K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple
    Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.
date_created: 2018-12-12T11:39:17Z
date_published: 2015-01-12T00:00:00Z
date_updated: 2025-09-29T11:00:42Z
day: '12'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-318-v1-1
file:
- access_level: open_access
  checksum: e4869a584567c506349abda9c8ec7db3
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:54:11Z
  date_updated: 2020-07-14T12:46:52Z
  file_id: '5533'
  file_name: IST-2015-318-v1+1_main.pdf
  file_size: 689863
  relation: main_file
file_date_updated: 2020-07-14T12:46:52Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: '41'
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '318'
related_material:
  record:
  - id: '5435'
    relation: later_version
    status: public
  - id: '466'
    relation: later_version
    status: public
  - id: '1657'
    relation: later_version
    status: public
status: public
title: Unifying two views on multiple mean-payoff objectives in Markov decision processes
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5430'
abstract:
- lang: eng
  text: We consider the core algorithmic problems related to verification of systems
    with respect to three classical quantitative properties, namely, the mean- payoff
    property, the ratio property, and the minimum initial credit for energy property.
    The algorithmic problem given a graph and a quantitative property asks to compute
    the optimal value (the infimum value over all traces) from every node of the graph.
    We consider graphs with constant treewidth, and it is well-known that the control-flow
    graphs of most programs have constant treewidth. Let n denote the number of nodes
    of a graph, m the number of edges (for constant treewidth graphs m = O ( n ) )
    and W the largest absolute value of the weights. Our main theoretical results
    are as follows. First, for constant treewidth graphs we present an algorithm that
    approximates the mean-payoff value within a mul- tiplicative factor of ∊ in time
    O ( n · log( n/∊ )) and linear space, as compared to the classical algorithms
    that require quadratic time. Second, for the ratio property we present an algorithm
    that for constant treewidth graphs works in time O ( n · log( | a · b · n | ))
    = O ( n · log( n · W )) , when the output is a b , as compared to the previously
    best known algorithm with running time O ( n 2 · log( n · W )) . Third, for the
    minimum initial credit problem we show that (i) for general graphs the problem
    can be solved in O ( n 2 · m ) time and the associated decision problem can be
    solved in O ( n · m ) time, improving the previous known O ( n 3 · m · log( n
    · W )) and O ( n 2 · m ) bounds, respectively; and (ii) for constant treewidth
    graphs we present an algorithm that requires O ( n · log n ) time, improving the
    previous known O ( n 4 · log( n · W )) bound. We have implemented some of our
    algorithms and show that they present a significant speedup on standard benchmarks.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Rasmus
  full_name: Ibsen-Jensen, Rasmus
  id: 3B699956-F248-11E8-B48F-1D18A9856A87
  last_name: Ibsen-Jensen
  orcid: 0000-0003-4783-0389
- first_name: Andreas
  full_name: Pavlogiannis, Andreas
  id: 49704004-F248-11E8-B48F-1D18A9856A87
  last_name: Pavlogiannis
  orcid: 0000-0002-8943-0722
citation:
  ama: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. <i>Faster Algorithms for Quantitative
    Verification in Constant Treewidth Graphs</i>. IST Austria; 2015. doi:<a href="https://doi.org/10.15479/AT:IST-2015-319-v1-1">10.15479/AT:IST-2015-319-v1-1</a>
  apa: Chatterjee, K., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2015). <i>Faster
    algorithms for quantitative verification in constant treewidth graphs</i>. IST
    Austria. <a href="https://doi.org/10.15479/AT:IST-2015-319-v1-1">https://doi.org/10.15479/AT:IST-2015-319-v1-1</a>
  chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis.
    <i>Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs</i>.
    IST Austria, 2015. <a href="https://doi.org/10.15479/AT:IST-2015-319-v1-1">https://doi.org/10.15479/AT:IST-2015-319-v1-1</a>.
  ieee: K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, <i>Faster algorithms
    for quantitative verification in constant treewidth graphs</i>. IST Austria, 2015.
  ista: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for
    quantitative verification in constant treewidth graphs, IST Austria, 31p.
  mla: Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Quantitative Verification
    in Constant Treewidth Graphs</i>. IST Austria, 2015, doi:<a href="https://doi.org/10.15479/AT:IST-2015-319-v1-1">10.15479/AT:IST-2015-319-v1-1</a>.
  short: K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative
    Verification in Constant Treewidth Graphs, IST Austria, 2015.
date_created: 2018-12-12T11:39:17Z
date_published: 2015-02-10T00:00:00Z
date_updated: 2025-09-23T08:47:23Z
day: '10'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-319-v1-1
file:
- access_level: open_access
  checksum: 62c6ea01e342553dcafb88a070fb1ad5
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:53:21Z
  date_updated: 2020-07-14T12:46:52Z
  file_id: '5482'
  file_name: IST-2015-319-v1+1_long.pdf
  file_size: 1089651
  relation: main_file
file_date_updated: 2020-07-14T12:46:52Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '31'
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '319'
related_material:
  record:
  - id: '5437'
    relation: later_version
    status: public
  - id: '1607'
    relation: later_version
    status: public
status: public
title: Faster algorithms for quantitative verification in constant treewidth graphs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5431'
abstract:
- lang: eng
  text: "We consider finite-state concurrent stochastic games, played by k>=2 players
    for an infinite number of rounds, where in every round, each player simultaneously
    and independently of the other players chooses an action, whereafter the successor
    state is determined by a probability distribution given by the current state and
    the chosen actions. We consider reachability objectives that given a target set
    of states require that some state in the target set is visited, and the dual safety
    objectives that given a target set require that only states in the target set
    are visited. We are interested in the complexity of stationary strategies measured
    by their patience, which is defined as the inverse of the smallest non-zero probability
    employed.\r\n\r\n Our main results are as follows: We show that in two-player
    zero-sum concurrent stochastic games (with reachability objective for one player
    and the complementary safety objective for the other player): (i) the optimal
    bound on the patience of optimal and epsilon-optimal strategies, for both players
    is doubly exponential; and (ii) even in games with a single non-absorbing state
    exponential (in the number of actions) patience is necessary. In general we study
    the class of non-zero-sum games admitting epsilon-Nash equilibria. We show that
    if there is at least one player with reachability objective, then doubly-exponential
    patience is needed in general for epsilon-Nash equilibrium strategies, whereas
    in contrast if all players have safety objectives, then the optimal bound on patience
    for epsilon-Nash equilibrium strategies is only exponential."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Rasmus
  full_name: Ibsen-Jensen, Rasmus
  id: 3B699956-F248-11E8-B48F-1D18A9856A87
  last_name: Ibsen-Jensen
  orcid: 0000-0003-4783-0389
- first_name: Kristoffer
  full_name: Hansen, Kristoffer
  last_name: Hansen
citation:
  ama: Chatterjee K, Ibsen-Jensen R, Hansen K. <i>The Patience of Concurrent Stochastic
    Games with Safety and Reachability Objectives</i>. IST Austria; 2015. doi:<a href="https://doi.org/10.15479/AT:IST-2015-322-v1-1">10.15479/AT:IST-2015-322-v1-1</a>
  apa: Chatterjee, K., Ibsen-Jensen, R., &#38; Hansen, K. (2015). <i>The patience
    of concurrent stochastic games with safety and reachability objectives</i>. IST
    Austria. <a href="https://doi.org/10.15479/AT:IST-2015-322-v1-1">https://doi.org/10.15479/AT:IST-2015-322-v1-1</a>
  chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Kristoffer Hansen. <i>The
    Patience of Concurrent Stochastic Games with Safety and Reachability Objectives</i>.
    IST Austria, 2015. <a href="https://doi.org/10.15479/AT:IST-2015-322-v1-1">https://doi.org/10.15479/AT:IST-2015-322-v1-1</a>.
  ieee: K. Chatterjee, R. Ibsen-Jensen, and K. Hansen, <i>The patience of concurrent
    stochastic games with safety and reachability objectives</i>. IST Austria, 2015.
  ista: Chatterjee K, Ibsen-Jensen R, Hansen K. 2015. The patience of concurrent stochastic
    games with safety and reachability objectives, IST Austria, 25p.
  mla: Chatterjee, Krishnendu, et al. <i>The Patience of Concurrent Stochastic Games
    with Safety and Reachability Objectives</i>. IST Austria, 2015, doi:<a href="https://doi.org/10.15479/AT:IST-2015-322-v1-1">10.15479/AT:IST-2015-322-v1-1</a>.
  short: K. Chatterjee, R. Ibsen-Jensen, K. Hansen, The Patience of Concurrent Stochastic
    Games with Safety and Reachability Objectives, IST Austria, 2015.
date_created: 2018-12-12T11:39:17Z
date_published: 2015-02-19T00:00:00Z
date_updated: 2021-01-12T08:02:13Z
day: '19'
ddc:
- '005'
- '519'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-322-v1-1
file:
- access_level: open_access
  checksum: bfb858262c30445b8e472c40069178a2
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:53:31Z
  date_updated: 2020-07-14T12:46:53Z
  file_id: '5491'
  file_name: IST-2015-322-v1+1_safetygames.pdf
  file_size: 661015
  relation: main_file
file_date_updated: 2020-07-14T12:46:53Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '25'
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '322'
status: public
title: The patience of concurrent stochastic games with safety and reachability objectives
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5432'
abstract:
- lang: eng
  text: "Evolution occurs in populations of reproducing individuals. The structure
    of the population affects the outcome of the evolutionary process. Evolutionary
    graph theory is a powerful approach to study this phenomenon. There are two graphs.
    The interaction graph specifies who interacts with whom in the context of evolution.The
    replacement graph specifies who competes with whom for reproduction. \r\nThe vertices
    of the two graphs are the same, and each vertex corresponds to an individual of
    the population. A key quantity is the fixation probability of a new mutant. It
    is defined as the probability that a newly introduced mutant (on a single vertex)
    generates a lineage of offspring which eventually takes over the entire population
    of resident individuals. The basic computational questions are as follows: (i)
    the qualitative question asks whether the fixation probability is positive; and
    (ii) the quantitative approximation question asks for an approximation of the
    fixation probability. \r\nOur main results are:\r\n(1) We show that the qualitative
    question is NP-complete and the quantitative approximation question is #P-hard
    in the special case when the interaction and the replacement graphs coincide and
    even with the restriction that the resident individuals do not reproduce (which
    corresponds to an invading population taking over an empty structure).\r\n(2)
    We show that in general the qualitative question is PSPACE-complete and the quantitative
    approximation question is PSPACE-hard and can be solved in exponential time.\r\n"
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Rasmus
  full_name: Ibsen-Jensen, Rasmus
  id: 3B699956-F248-11E8-B48F-1D18A9856A87
  last_name: Ibsen-Jensen
  orcid: 0000-0003-4783-0389
- first_name: Martin
  full_name: Nowak, Martin
  last_name: Nowak
citation:
  ama: Chatterjee K, Ibsen-Jensen R, Nowak M. <i>The Complexity of Evolutionary Games
    on Graphs</i>. IST Austria; 2015. doi:<a href="https://doi.org/10.15479/AT:IST-2015-323-v1-1">10.15479/AT:IST-2015-323-v1-1</a>
  apa: Chatterjee, K., Ibsen-Jensen, R., &#38; Nowak, M. (2015). <i>The complexity
    of evolutionary games on graphs</i>. IST Austria. <a href="https://doi.org/10.15479/AT:IST-2015-323-v1-1">https://doi.org/10.15479/AT:IST-2015-323-v1-1</a>
  chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. <i>The Complexity
    of Evolutionary Games on Graphs</i>. IST Austria, 2015. <a href="https://doi.org/10.15479/AT:IST-2015-323-v1-1">https://doi.org/10.15479/AT:IST-2015-323-v1-1</a>.
  ieee: K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, <i>The complexity of evolutionary
    games on graphs</i>. IST Austria, 2015.
  ista: Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary
    games on graphs, IST Austria, 29p.
  mla: Chatterjee, Krishnendu, et al. <i>The Complexity of Evolutionary Games on Graphs</i>.
    IST Austria, 2015, doi:<a href="https://doi.org/10.15479/AT:IST-2015-323-v1-1">10.15479/AT:IST-2015-323-v1-1</a>.
  short: K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary
    Games on Graphs, IST Austria, 2015.
date_created: 2018-12-12T11:39:18Z
date_published: 2015-02-19T00:00:00Z
date_updated: 2023-02-23T12:26:33Z
day: '19'
ddc:
- '005'
- '576'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-323-v1-1
file:
- access_level: open_access
  checksum: 546c1b291d545e7b24aaaf4199dac671
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:53:57Z
  date_updated: 2020-07-14T12:46:53Z
  file_id: '5519'
  file_name: IST-2015-323-v1+1_main.pdf
  file_size: 576347
  relation: main_file
file_date_updated: 2020-07-14T12:46:53Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '29'
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '323'
related_material:
  record:
  - id: '5421'
    relation: earlier_version
    status: public
  - id: '5440'
    relation: later_version
    status: public
status: public
title: The complexity of evolutionary games on graphs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5434'
abstract:
- lang: eng
  text: DEC-POMDPs extend POMDPs to a multi-agent setting, where several agents operate
    in an uncertain environment independently to achieve a joint objective. DEC-POMDPs
    have been studied with finite-horizon and infinite-horizon discounted-sum objectives,
    and there exist solvers both for exact and approximate solutions. In this work
    we consider Goal-DEC-POMDPs, where given a set of target states, the objective
    is to ensure that the target set is reached with minimal cost. We consider the
    indefinite-horizon (infinite-horizon with either discounted-sum, or undiscounted-sum,
    where absorbing goal states have zero-cost) problem. We present a new method to
    solve the problem that extends methods for finite-horizon DEC- POMDPs and the
    RTDP-Bel approach for POMDPs. We present experimental results on several examples,
    and show our approach presents promising results.
alternative_title:
- IST Austria Technical Report
author:
- first_name: '1'
  full_name: Anonymous, 1
  last_name: Anonymous
- first_name: '2'
  full_name: Anonymous, 2
  last_name: Anonymous
citation:
  ama: Anonymous 1, Anonymous 2. <i>Optimal Cost Indefinite-Horizon Reachability in
    Goal DEC-POMDPs</i>. IST Austria; 2015.
  apa: Anonymous, 1, &#38; Anonymous, 2. (2015). <i>Optimal cost indefinite-horizon
    reachability in goal DEC-POMDPs</i>. IST Austria.
  chicago: Anonymous, 1, and 2 Anonymous. <i>Optimal Cost Indefinite-Horizon Reachability
    in Goal DEC-POMDPs</i>. IST Austria, 2015.
  ieee: 1 Anonymous and 2 Anonymous, <i>Optimal cost indefinite-horizon reachability
    in goal DEC-POMDPs</i>. IST Austria, 2015.
  ista: Anonymous 1, Anonymous 2. 2015. Optimal cost indefinite-horizon reachability
    in goal DEC-POMDPs, IST Austria, 16p.
  mla: Anonymous, 1, and 2 Anonymous. <i>Optimal Cost Indefinite-Horizon Reachability
    in Goal DEC-POMDPs</i>. IST Austria, 2015.
  short: 1 Anonymous, 2 Anonymous, Optimal Cost Indefinite-Horizon Reachability in
    Goal DEC-POMDPs, IST Austria, 2015.
date_created: 2018-12-12T11:39:18Z
date_published: 2015-02-19T00:00:00Z
date_updated: 2020-07-14T23:04:59Z
day: '19'
ddc:
- '000'
file:
- access_level: open_access
  checksum: 8542fd0b10aed7811cd41077b8ccb632
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T11:53:14Z
  date_updated: 2020-07-14T12:46:53Z
  file_id: '5475'
  file_name: IST-2015-326-v1+1_main.pdf
  file_size: 378162
  relation: main_file
- access_level: closed
  checksum: 84c31c537bdaf7a91909f18d25d640ab
  content_type: text/plain
  creator: dernst
  date_created: 2019-04-16T13:00:33Z
  date_updated: 2020-07-14T12:46:53Z
  file_id: '6317'
  file_name: IST-2015-326-v1+2_authors.txt
  file_size: 64
  relation: main_file
file_date_updated: 2020-07-14T12:46:53Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '16'
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '326'
status: public
title: Optimal cost indefinite-horizon reachability in goal DEC-POMDPs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
