---
_id: '670'
abstract:
- lang: eng
  text: We propose an efficient method to model paper tearing in the context of interactive
    modeling. The method uses geometrical information to automatically detect potential
    starting points of tears. We further introduce a new hybrid geometrical and physical-based
    method to compute the trajectory of tears while procedurally synthesizing high
    resolution details of the tearing path using a texture based approach. The results
    obtained are compared with real paper and with previous studies on the expected
    geometric paths of paper that tears.
article_processing_charge: No
article_type: original
author:
- first_name: Camille
  full_name: Schreck, Camille
  id: 2B14B676-F248-11E8-B48F-1D18A9856A87
  last_name: Schreck
- first_name: Damien
  full_name: Rohmer, Damien
  last_name: Rohmer
- first_name: Stefanie
  full_name: Hahmann, Stefanie
  last_name: Hahmann
citation:
  ama: Schreck C, Rohmer D, Hahmann S. Interactive paper tearing. <i>Computer Graphics
    Forum</i>. 2017;36(2):95-106. doi:<a href="https://doi.org/10.1111/cgf.13110">10.1111/cgf.13110</a>
  apa: Schreck, C., Rohmer, D., &#38; Hahmann, S. (2017). Interactive paper tearing.
    <i>Computer Graphics Forum</i>. Wiley. <a href="https://doi.org/10.1111/cgf.13110">https://doi.org/10.1111/cgf.13110</a>
  chicago: Schreck, Camille, Damien Rohmer, and Stefanie Hahmann. “Interactive Paper
    Tearing.” <i>Computer Graphics Forum</i>. Wiley, 2017. <a href="https://doi.org/10.1111/cgf.13110">https://doi.org/10.1111/cgf.13110</a>.
  ieee: C. Schreck, D. Rohmer, and S. Hahmann, “Interactive paper tearing,” <i>Computer
    Graphics Forum</i>, vol. 36, no. 2. Wiley, pp. 95–106, 2017.
  ista: Schreck C, Rohmer D, Hahmann S. 2017. Interactive paper tearing. Computer
    Graphics Forum. 36(2), 95–106.
  mla: Schreck, Camille, et al. “Interactive Paper Tearing.” <i>Computer Graphics
    Forum</i>, vol. 36, no. 2, Wiley, 2017, pp. 95–106, doi:<a href="https://doi.org/10.1111/cgf.13110">10.1111/cgf.13110</a>.
  short: C. Schreck, D. Rohmer, S. Hahmann, Computer Graphics Forum 36 (2017) 95–106.
date_created: 2018-12-11T11:47:49Z
date_published: 2017-05-01T00:00:00Z
date_updated: 2025-09-11T07:02:03Z
day: '01'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1111/cgf.13110
external_id:
  isi:
  - '000404474000011'
intvolume: '        36'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://hal.inria.fr/hal-01647113/file/eg_2017_schreck_paper_tearing.pdf
month: '05'
oa: 1
oa_version: Published Version
page: 95 - 106
project:
- _id: 25357BD2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P 24352-N23
  name: 'Deep Pictures: Creating Visual and Haptic Vector Images'
publication: Computer Graphics Forum
publication_identifier:
  issn:
  - '01677055'
publication_status: published
publisher: Wiley
publist_id: '7056'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Interactive paper tearing
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 36
year: '2017'
...
---
_id: '671'
abstract:
- lang: eng
  text: Humans routinely use conditionally cooperative strategies when interacting
    in repeated social dilemmas. They are more likely to cooperate if others cooperated
    before, and are ready to retaliate if others defected. To capture the emergence
    of reciprocity, most previous models consider subjects who can only choose from
    a restricted set of representative strategies, or who react to the outcome of
    the very last round only. As players memorize more rounds, the dimension of the
    strategy space increases exponentially. This increasing computational complexity
    renders simulations for individuals with higher cognitive abilities infeasible,
    especially if multiplayer interactions are taken into account. Here, we take an
    axiomatic approach instead. We propose several properties that a robust cooperative
    strategy for a repeated multiplayer dilemma should have. These properties naturally
    lead to a unique class of cooperative strategies, which contains the classical
    Win-Stay Lose-Shift rule as a special case. A comprehensive numerical analysis
    for the prisoner's dilemma and for the public goods game suggests that strategies
    of this class readily evolve across various memory-n spaces. Our results reveal
    that successful strategies depend not only on how cooperative others were in the
    past but also on the respective context of cooperation.
article_processing_charge: Yes (in subscription journal)
author:
- first_name: Christian
  full_name: Hilbe, Christian
  id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87
  last_name: Hilbe
  orcid: 0000-0001-5116-955X
- first_name: Vaquero
  full_name: Martinez, Vaquero
  last_name: Martinez
- 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: Nowak, Martin
  last_name: Nowak
citation:
  ama: Hilbe C, Martinez V, Chatterjee K, Nowak M. Memory-n strategies of direct reciprocity.
    <i>PNAS</i>. 2017;114(18):4715-4720. doi:<a href="https://doi.org/10.1073/pnas.1621239114">10.1073/pnas.1621239114</a>
  apa: Hilbe, C., Martinez, V., Chatterjee, K., &#38; Nowak, M. (2017). Memory-n strategies
    of direct reciprocity. <i>PNAS</i>. National Academy of Sciences. <a href="https://doi.org/10.1073/pnas.1621239114">https://doi.org/10.1073/pnas.1621239114</a>
  chicago: Hilbe, Christian, Vaquero Martinez, Krishnendu Chatterjee, and Martin Nowak.
    “Memory-n Strategies of Direct Reciprocity.” <i>PNAS</i>. National Academy of
    Sciences, 2017. <a href="https://doi.org/10.1073/pnas.1621239114">https://doi.org/10.1073/pnas.1621239114</a>.
  ieee: C. Hilbe, V. Martinez, K. Chatterjee, and M. Nowak, “Memory-n strategies of
    direct reciprocity,” <i>PNAS</i>, vol. 114, no. 18. National Academy of Sciences,
    pp. 4715–4720, 2017.
  ista: Hilbe C, Martinez V, Chatterjee K, Nowak M. 2017. Memory-n strategies of direct
    reciprocity. PNAS. 114(18), 4715–4720.
  mla: Hilbe, Christian, et al. “Memory-n Strategies of Direct Reciprocity.” <i>PNAS</i>,
    vol. 114, no. 18, National Academy of Sciences, 2017, pp. 4715–20, doi:<a href="https://doi.org/10.1073/pnas.1621239114">10.1073/pnas.1621239114</a>.
  short: C. Hilbe, V. Martinez, K. Chatterjee, M. Nowak, PNAS 114 (2017) 4715–4720.
corr_author: '1'
date_created: 2018-12-11T11:47:50Z
date_published: 2017-05-02T00:00:00Z
date_updated: 2026-06-18T19:11:14Z
day: '02'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1073/pnas.1621239114
ec_funded: 1
external_id:
  isi:
  - '000400358000050'
  pmid:
  - '28420786'
intvolume: '       114'
isi: 1
issue: '18'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5422766/
month: '05'
oa: 1
oa_version: Published Version
page: 4715 - 4720
pmid: 1
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '279307'
  name: 'Quantitative Graph Games: Theory and Applications'
- _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
publication: PNAS
publication_identifier:
  issn:
  - 0027-8424
publication_status: published
publisher: National Academy of Sciences
publist_id: '7053'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Memory-n strategies of direct reciprocity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 114
year: '2017'
...
---
_id: '672'
abstract:
- lang: eng
  text: Trafficking cells frequently transmigrate through epithelial and endothelial
    monolayers. How monolayers cooperate with the penetrating cells to support their
    transit is poorly understood. We studied dendritic cell (DC) entry into lymphatic
    capillaries as a model system for transendothelial migration. We find that the
    chemokine CCL21, which is the decisive guidance cue for intravasation, mainly
    localizes in the trans-Golgi network and intracellular vesicles of lymphatic endothelial
    cells. Upon DC transmigration, these Golgi deposits disperse and CCL21 becomes
    extracellularly enriched at the sites of endothelial cell-cell junctions. When
    we reconstitute the transmigration process in vitro, we find that secretion of
    CCL21-positive vesicles is triggered by a DC contact-induced calcium signal, and
    selective calcium chelation in lymphatic endothelium attenuates transmigration.
    Altogether, our data demonstrate a chemokine-mediated feedback between DCs and
    lymphatic endothelium, which facilitates transendothelial migration.
article_processing_charge: Yes
author:
- first_name: Kari
  full_name: Vaahtomeri, Kari
  id: 368EE576-F248-11E8-B48F-1D18A9856A87
  last_name: Vaahtomeri
  orcid: 0000-0001-7829-3518
- first_name: Markus
  full_name: Brown, Markus
  id: 3DAB9AFC-F248-11E8-B48F-1D18A9856A87
  last_name: Brown
- first_name: Robert
  full_name: Hauschild, Robert
  id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
  last_name: Hauschild
  orcid: 0000-0001-9843-3522
- first_name: Ingrid
  full_name: De Vries, Ingrid
  id: 4C7D837E-F248-11E8-B48F-1D18A9856A87
  last_name: De Vries
- first_name: Alexander F
  full_name: Leithner, Alexander F
  id: 3B1B77E4-F248-11E8-B48F-1D18A9856A87
  last_name: Leithner
  orcid: 0000-0002-1073-744X
- first_name: Matthias
  full_name: Mehling, Matthias
  id: 3C23B994-F248-11E8-B48F-1D18A9856A87
  last_name: Mehling
  orcid: 0000-0001-8599-1226
- first_name: Walter
  full_name: Kaufmann, Walter
  id: 3F99E422-F248-11E8-B48F-1D18A9856A87
  last_name: Kaufmann
  orcid: 0000-0001-9735-5315
- first_name: Michael K
  full_name: Sixt, Michael K
  id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
  last_name: Sixt
  orcid: 0000-0002-6620-9179
citation:
  ama: Vaahtomeri K, Brown M, Hauschild R, et al. Locally triggered release of the
    chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia.
    <i>Cell Reports</i>. 2017;19(5):902-909. doi:<a href="https://doi.org/10.1016/j.celrep.2017.04.027">10.1016/j.celrep.2017.04.027</a>
  apa: Vaahtomeri, K., Brown, M., Hauschild, R., de Vries, I., Leithner, A. F., Mehling,
    M., … Sixt, M. K. (2017). Locally triggered release of the chemokine CCL21 promotes
    dendritic cell transmigration across lymphatic endothelia. <i>Cell Reports</i>.
    Cell Press. <a href="https://doi.org/10.1016/j.celrep.2017.04.027">https://doi.org/10.1016/j.celrep.2017.04.027</a>
  chicago: Vaahtomeri, Kari, Markus Brown, Robert Hauschild, Ingrid de Vries, Alexander
    F Leithner, Matthias Mehling, Walter Kaufmann, and Michael K Sixt. “Locally Triggered
    Release of the Chemokine CCL21 Promotes Dendritic Cell Transmigration across Lymphatic
    Endothelia.” <i>Cell Reports</i>. Cell Press, 2017. <a href="https://doi.org/10.1016/j.celrep.2017.04.027">https://doi.org/10.1016/j.celrep.2017.04.027</a>.
  ieee: K. Vaahtomeri <i>et al.</i>, “Locally triggered release of the chemokine CCL21
    promotes dendritic cell transmigration across lymphatic endothelia,” <i>Cell Reports</i>,
    vol. 19, no. 5. Cell Press, pp. 902–909, 2017.
  ista: Vaahtomeri K, Brown M, Hauschild R, de Vries I, Leithner AF, Mehling M, Kaufmann
    W, Sixt MK. 2017. Locally triggered release of the chemokine CCL21 promotes dendritic
    cell transmigration across lymphatic endothelia. Cell Reports. 19(5), 902–909.
  mla: Vaahtomeri, Kari, et al. “Locally Triggered Release of the Chemokine CCL21
    Promotes Dendritic Cell Transmigration across Lymphatic Endothelia.” <i>Cell Reports</i>,
    vol. 19, no. 5, Cell Press, 2017, pp. 902–09, doi:<a href="https://doi.org/10.1016/j.celrep.2017.04.027">10.1016/j.celrep.2017.04.027</a>.
  short: K. Vaahtomeri, M. Brown, R. Hauschild, I. de Vries, A.F. Leithner, M. Mehling,
    W. Kaufmann, M.K. Sixt, Cell Reports 19 (2017) 902–909.
corr_author: '1'
date_created: 2018-12-11T11:47:50Z
date_published: 2017-05-02T00:00:00Z
date_updated: 2025-09-10T14:27:34Z
day: '02'
ddc:
- '570'
department:
- _id: MiSi
- _id: Bio
- _id: EM-Fac
doi: 10.1016/j.celrep.2017.04.027
ec_funded: 1
external_id:
  isi:
  - '000402124100002'
file:
- access_level: open_access
  checksum: 8fdddaab1f1d76a6ec9ca94dcb6b07a2
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:14:54Z
  date_updated: 2020-07-14T12:47:38Z
  file_id: '5109'
  file_name: IST-2017-900-v1+1_1-s2.0-S2211124717305211-main.pdf
  file_size: 2248814
  relation: main_file
file_date_updated: 2020-07-14T12:47:38Z
has_accepted_license: '1'
intvolume: '        19'
isi: 1
issue: '5'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 902 - 909
project:
- _id: 25A603A2-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '281556'
  name: Cytoskeletal force generation and force transduction of migrating leukocytes
- _id: 25A8E5EA-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Y 564-B12
  name: Cytoskeletal force generation and force transduction of migrating leukocytes
publication: Cell Reports
publication_identifier:
  issn:
  - 2211-1247
publication_status: published
publisher: Cell Press
publist_id: '7052'
pubrep_id: '900'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration
  across lymphatic endothelia
tmp:
  image: /images/cc_by_nc_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
    (CC BY-NC-ND 4.0)
  short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 19
year: '2017'
...
---
_id: '6729'
abstract:
- lang: eng
  text: Consider the problem of constructing a polar code of block length N for the
    transmission over a given channel W. Typically this requires to compute the reliability
    of all the N synthetic channels and then to include those that are sufficiently
    reliable. However, we know from [1], [2] that there is a partial order among the
    synthetic channels. Hence, it is natural to ask whether we can exploit it to reduce
    the computational burden of the construction problem. We show that, if we take
    advantage of the partial order [1], [2], we can construct a polar code by computing
    the reliability of roughly N/ log 3/2 N synthetic channels. Such a set of synthetic
    channels is universal, in the sense that it allows one to construct polar codes
    for any W, and it can be identified by solving a maximum matching problem on a
    bipartite graph. Our proof technique consists in reducing the construction problem
    to the problem of computing the maximum cardinality of an antichain for a suitable
    partially ordered set. As such, this method is general and it can be used to further
    improve the complexity of the construction problem in case a new partial order
    on the synthetic channels of polar codes is discovered.
arxiv: 1
author:
- first_name: Marco
  full_name: Mondelli, Marco
  id: 27EB676C-8706-11E9-9510-7717E6697425
  last_name: Mondelli
  orcid: 0000-0002-3242-7020
- first_name: S. Hamed
  full_name: Hassani, S. Hamed
  last_name: Hassani
- first_name: Rudiger
  full_name: Urbanke, Rudiger
  last_name: Urbanke
citation:
  ama: 'Mondelli M, Hassani SH, Urbanke R. Construction of polar codes with sublinear
    complexity. In: <i>2017 IEEE International Symposium on Information Theory </i>.
    IEEE; 2017:1853-1857. doi:<a href="https://doi.org/10.1109/isit.2017.8006850">10.1109/isit.2017.8006850</a>'
  apa: 'Mondelli, M., Hassani, S. H., &#38; Urbanke, R. (2017). Construction of polar
    codes with sublinear complexity. In <i>2017 IEEE International Symposium on Information
    Theory </i> (pp. 1853–1857). Aachen, Germany: IEEE. <a href="https://doi.org/10.1109/isit.2017.8006850">https://doi.org/10.1109/isit.2017.8006850</a>'
  chicago: Mondelli, Marco, S. Hamed Hassani, and Rudiger Urbanke. “Construction of
    Polar Codes with Sublinear Complexity.” In <i>2017 IEEE International Symposium
    on Information Theory </i>, 1853–57. IEEE, 2017. <a href="https://doi.org/10.1109/isit.2017.8006850">https://doi.org/10.1109/isit.2017.8006850</a>.
  ieee: M. Mondelli, S. H. Hassani, and R. Urbanke, “Construction of polar codes with
    sublinear complexity,” in <i>2017 IEEE International Symposium on Information
    Theory </i>, Aachen, Germany, 2017, pp. 1853–1857.
  ista: 'Mondelli M, Hassani SH, Urbanke R. 2017. Construction of polar codes with
    sublinear complexity. 2017 IEEE International Symposium on Information Theory
    . ISIT: International Symposium on Information Theory, 1853–1857.'
  mla: Mondelli, Marco, et al. “Construction of Polar Codes with Sublinear Complexity.”
    <i>2017 IEEE International Symposium on Information Theory </i>, IEEE, 2017, pp.
    1853–57, doi:<a href="https://doi.org/10.1109/isit.2017.8006850">10.1109/isit.2017.8006850</a>.
  short: M. Mondelli, S.H. Hassani, R. Urbanke, in:, 2017 IEEE International Symposium
    on Information Theory , IEEE, 2017, pp. 1853–1857.
conference:
  end_date: 2017-06-30
  location: Aachen, Germany
  name: 'ISIT: International Symposium on Information Theory'
  start_date: 2017-06-25
date_created: 2019-07-30T07:14:18Z
date_published: 2017-06-15T00:00:00Z
date_updated: 2023-02-23T12:49:08Z
day: '15'
doi: 10.1109/isit.2017.8006850
extern: '1'
external_id:
  arxiv:
  - '1612.05295'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1612.05295
month: '06'
oa: 1
oa_version: Preprint
page: 1853-1857
publication: '2017 IEEE International Symposium on Information Theory '
publication_identifier:
  eissn:
  - 2157-8117
  isbn:
  - '9781509040964'
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
  record:
  - id: '6663'
    relation: later_version
    status: public
status: public
title: Construction of polar codes with sublinear complexity
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
OA_type: closed access
_id: '673'
abstract:
- lang: eng
  text: We present a numerical study of wavy supercritical cylindrical Couette flow
    between counter-rotating cylinders in which the wavy pattern propagates either
    prograde with the inner cylinder or retrograde opposite the rotation of the inner
    cylinder. The wave propagation reversals from prograde to retrograde and vice
    versa occur at distinct values of the inner cylinder Reynolds number when the
    associated frequency of the wavy instability vanishes. The reversal occurs for
    both twofold and threefold symmetric wavy vortices. Moreover, the wave propagation
    reversal only occurs for sufficiently strong counter-rotation. The flow pattern
    reversal appears to be intrinsic in the system as either periodic boundary conditions
    or fixed end wall boundary conditions for different system sizes always result
    in the wave propagation reversal. We present a detailed bifurcation sequence and
    parameter space diagram with respect to retrograde behavior of wavy flows. The
    retrograde propagation of the instability occurs when the inner Reynolds number
    is about two times the outer Reynolds number. The mechanism for the retrograde
    propagation is associated with the inviscidly unstable region near the inner cylinder
    and the direction of the global average azimuthal velocity. Flow dynamics, spatio-temporal
    behavior, global mean angular velocity, and torque of the flow with the wavy pattern
    are explored.
article_number: '053103'
article_processing_charge: No
article_type: original
author:
- first_name: Sebastian
  full_name: Altmeyer, Sebastian
  id: 2EE67FDC-F248-11E8-B48F-1D18A9856A87
  last_name: Altmeyer
  orcid: 0000-0001-5964-0203
- first_name: Richard
  full_name: Lueptow, Richard
  last_name: Lueptow
citation:
  ama: Altmeyer S, Lueptow R. Wave propagation reversal for wavy vortices in wide
    gap counter rotating cylindrical Couette flow. <i>Physical Review E</i>. 2017;95(5).
    doi:<a href="https://doi.org/10.1103/PhysRevE.95.053103">10.1103/PhysRevE.95.053103</a>
  apa: Altmeyer, S., &#38; Lueptow, R. (2017). Wave propagation reversal for wavy
    vortices in wide gap counter rotating cylindrical Couette flow. <i>Physical Review
    E</i>. American Physical Society. <a href="https://doi.org/10.1103/PhysRevE.95.053103">https://doi.org/10.1103/PhysRevE.95.053103</a>
  chicago: Altmeyer, Sebastian, and Richard Lueptow. “Wave Propagation Reversal for
    Wavy Vortices in Wide Gap Counter Rotating Cylindrical Couette Flow.” <i>Physical
    Review E</i>. American Physical Society, 2017. <a href="https://doi.org/10.1103/PhysRevE.95.053103">https://doi.org/10.1103/PhysRevE.95.053103</a>.
  ieee: S. Altmeyer and R. Lueptow, “Wave propagation reversal for wavy vortices in
    wide gap counter rotating cylindrical Couette flow,” <i>Physical Review E</i>,
    vol. 95, no. 5. American Physical Society, 2017.
  ista: Altmeyer S, Lueptow R. 2017. Wave propagation reversal for wavy vortices in
    wide gap counter rotating cylindrical Couette flow. Physical Review E. 95(5),
    053103.
  mla: Altmeyer, Sebastian, and Richard Lueptow. “Wave Propagation Reversal for Wavy
    Vortices in Wide Gap Counter Rotating Cylindrical Couette Flow.” <i>Physical Review
    E</i>, vol. 95, no. 5, 053103, American Physical Society, 2017, doi:<a href="https://doi.org/10.1103/PhysRevE.95.053103">10.1103/PhysRevE.95.053103</a>.
  short: S. Altmeyer, R. Lueptow, Physical Review E 95 (2017).
corr_author: '1'
date_created: 2018-12-11T11:47:50Z
date_published: 2017-05-10T00:00:00Z
date_updated: 2025-09-10T14:26:12Z
day: '10'
department:
- _id: BjHo
doi: 10.1103/PhysRevE.95.053103
external_id:
  isi:
  - '000401233900007'
  pmid:
  - '28618504'
intvolume: '        95'
isi: 1
issue: '5'
language:
- iso: eng
month: '05'
oa_version: None
pmid: 1
publication: Physical Review E
publication_identifier:
  issn:
  - 2470-0045
publication_status: published
publisher: American Physical Society
publist_id: '7049'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Wave propagation reversal for wavy vortices in wide gap counter rotating cylindrical
  Couette flow
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 95
year: '2017'
...
---
_id: '6730'
abstract:
- lang: eng
  text: We introduce a new approach to proving that a sequence of deterministic linear
    codes achieves capacity on an erasure channel under maximum a posteriori decoding.
    Rather than relying on the precise structure of the codes, our method exploits
    code symmetry. In particular, the technique applies to any sequence of linear
    codes where the blocklengths are strictly increasing, the code rates converge,
    and the permutation group of each code is doubly transitive. In other words, we
    show that symmetry alone implies near-optimal performance. An important consequence
    of this result is that a sequence of Reed-Muller codes with increasing block length
    and converging rate achieves capacity. This possibility has been suggested previously
    in the literature but it has only been proven for cases where the limiting code
    rate is 0 or 1. Moreover, these results extend naturally to all affine-invariant
    codes and, thus, to extended primitive narrow-sense BCH codes. This also resolves,
    in the affirmative, the existence question for capacity-achieving sequences of
    binary cyclic codes. The primary tools used in the proof are the sharp threshold
    property for symmetric monotone Boolean functions and the area theorem for extrinsic
    information transfer functions.
arxiv: 1
author:
- first_name: Shrinivas
  full_name: Kudekar, Shrinivas
  last_name: Kudekar
- first_name: Santhosh
  full_name: Kumar, Santhosh
  last_name: Kumar
- first_name: Marco
  full_name: Mondelli, Marco
  id: 27EB676C-8706-11E9-9510-7717E6697425
  last_name: Mondelli
  orcid: 0000-0002-3242-7020
- first_name: Henry D.
  full_name: Pfister, Henry D.
  last_name: Pfister
- first_name: Eren
  full_name: Sasoglu, Eren
  last_name: Sasoglu
- first_name: Ridiger L.
  full_name: Urbanke, Ridiger L.
  last_name: Urbanke
citation:
  ama: Kudekar S, Kumar S, Mondelli M, Pfister HD, Sasoglu E, Urbanke RL. Reed–Muller
    codes achieve capacity on erasure channels. <i>IEEE Transactions on Information
    Theory</i>. 2017;63(7):4298-4316. doi:<a href="https://doi.org/10.1109/tit.2017.2673829">10.1109/tit.2017.2673829</a>
  apa: Kudekar, S., Kumar, S., Mondelli, M., Pfister, H. D., Sasoglu, E., &#38; Urbanke,
    R. L. (2017). Reed–Muller codes achieve capacity on erasure channels. <i>IEEE
    Transactions on Information Theory</i>. IEEE. <a href="https://doi.org/10.1109/tit.2017.2673829">https://doi.org/10.1109/tit.2017.2673829</a>
  chicago: Kudekar, Shrinivas, Santhosh Kumar, Marco Mondelli, Henry D. Pfister, Eren
    Sasoglu, and Ridiger L. Urbanke. “Reed–Muller Codes Achieve Capacity on Erasure
    Channels.” <i>IEEE Transactions on Information Theory</i>. IEEE, 2017. <a href="https://doi.org/10.1109/tit.2017.2673829">https://doi.org/10.1109/tit.2017.2673829</a>.
  ieee: S. Kudekar, S. Kumar, M. Mondelli, H. D. Pfister, E. Sasoglu, and R. L. Urbanke,
    “Reed–Muller codes achieve capacity on erasure channels,” <i>IEEE Transactions
    on Information Theory</i>, vol. 63, no. 7. IEEE, pp. 4298–4316, 2017.
  ista: Kudekar S, Kumar S, Mondelli M, Pfister HD, Sasoglu E, Urbanke RL. 2017. Reed–Muller
    codes achieve capacity on erasure channels. IEEE Transactions on Information Theory.
    63(7), 4298–4316.
  mla: Kudekar, Shrinivas, et al. “Reed–Muller Codes Achieve Capacity on Erasure Channels.”
    <i>IEEE Transactions on Information Theory</i>, vol. 63, no. 7, IEEE, 2017, pp.
    4298–316, doi:<a href="https://doi.org/10.1109/tit.2017.2673829">10.1109/tit.2017.2673829</a>.
  short: S. Kudekar, S. Kumar, M. Mondelli, H.D. Pfister, E. Sasoglu, R.L. Urbanke,
    IEEE Transactions on Information Theory 63 (2017) 4298–4316.
date_created: 2019-07-30T07:18:11Z
date_published: 2017-07-01T00:00:00Z
date_updated: 2021-01-12T08:08:43Z
day: '01'
doi: 10.1109/tit.2017.2673829
extern: '1'
external_id:
  arxiv:
  - '1601.04689'
intvolume: '        63'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1601.04689
month: '07'
oa: 1
oa_version: Preprint
page: 4298-4316
publication: IEEE Transactions on Information Theory
publication_identifier:
  eissn:
  - 1557-9654
  issn:
  - 0018-9448
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: Reed–Muller codes achieve capacity on erasure channels
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 63
year: '2017'
...
---
_id: '6731'
abstract:
- lang: eng
  text: 'We present a rate-compatible polar coding scheme that achieves the capacity
    of any family of channels. Our solution generalizes the previous results [1],
    [2] that provide capacity-achieving rate-compatible polar codes for a degraded
    family of channels. The motivation for our extension comes from the fact that
    in many practical scenarios, e.g., MIMO systems and non-Gaussian interference,
    the channels cannot be ordered by degradation. The main technical contribution
    of this paper consists in removing the degradation condition. To do so, we exploit
    the ideas coming from the construction of universal polar codes. Our scheme possesses
    the usual attractive features of polar codes: low complexity code construction,
    encoding, and decoding; super-polynomial scaling of the error probability with
    the block length; and absence of error floors. On the negative side, the scaling
    of the gap to capacity with the block length is slower than in standard polar
    codes, and we prove an upper bound on the scaling exponent.'
article_number: '7919107'
arxiv: 1
author:
- first_name: Marco
  full_name: Mondelli, Marco
  id: 27EB676C-8706-11E9-9510-7717E6697425
  last_name: Mondelli
  orcid: 0000-0002-3242-7020
- first_name: Hamed
  full_name: Hassani, Hamed
  last_name: Hassani
- first_name: Ivana
  full_name: Maric, Ivana
  last_name: Maric
- first_name: Dennis
  full_name: Hui, Dennis
  last_name: Hui
- first_name: Song-Nam
  full_name: Hong, Song-Nam
  last_name: Hong
citation:
  ama: 'Mondelli M, Hassani H, Maric I, Hui D, Hong S-N. Capacity-achieving rate-compatible
    polar codes for general channels. In: <i>2017 IEEE Wireless Communications and
    Networking Conference Workshops </i>. IEEE; 2017. doi:<a href="https://doi.org/10.1109/wcncw.2017.7919107">10.1109/wcncw.2017.7919107</a>'
  apa: 'Mondelli, M., Hassani, H., Maric, I., Hui, D., &#38; Hong, S.-N. (2017). Capacity-achieving
    rate-compatible polar codes for general channels. In <i>2017 IEEE Wireless Communications
    and Networking Conference Workshops </i>. San Francisco, CA, USA: IEEE. <a href="https://doi.org/10.1109/wcncw.2017.7919107">https://doi.org/10.1109/wcncw.2017.7919107</a>'
  chicago: Mondelli, Marco, Hamed Hassani, Ivana Maric, Dennis Hui, and Song-Nam Hong.
    “Capacity-Achieving Rate-Compatible Polar Codes for General Channels.” In <i>2017
    IEEE Wireless Communications and Networking Conference Workshops </i>. IEEE, 2017.
    <a href="https://doi.org/10.1109/wcncw.2017.7919107">https://doi.org/10.1109/wcncw.2017.7919107</a>.
  ieee: M. Mondelli, H. Hassani, I. Maric, D. Hui, and S.-N. Hong, “Capacity-achieving
    rate-compatible polar codes for general channels,” in <i>2017 IEEE Wireless Communications
    and Networking Conference Workshops </i>, San Francisco, CA, USA, 2017.
  ista: 'Mondelli M, Hassani H, Maric I, Hui D, Hong S-N. 2017. Capacity-achieving
    rate-compatible polar codes for general channels. 2017 IEEE Wireless Communications
    and Networking Conference Workshops . WCNCW: Wireless communications and networking
    conference workshops, 7919107.'
  mla: Mondelli, Marco, et al. “Capacity-Achieving Rate-Compatible Polar Codes for
    General Channels.” <i>2017 IEEE Wireless Communications and Networking Conference
    Workshops </i>, 7919107, IEEE, 2017, doi:<a href="https://doi.org/10.1109/wcncw.2017.7919107">10.1109/wcncw.2017.7919107</a>.
  short: M. Mondelli, H. Hassani, I. Maric, D. Hui, S.-N. Hong, in:, 2017 IEEE Wireless
    Communications and Networking Conference Workshops , IEEE, 2017.
conference:
  end_date: 2017-03-22
  location: San Francisco, CA, USA
  name: 'WCNCW: Wireless communications and networking conference workshops'
  start_date: 2017-03-19
date_created: 2019-07-31T05:56:58Z
date_published: 2017-05-04T00:00:00Z
date_updated: 2021-01-12T08:08:43Z
day: '04'
doi: 10.1109/wcncw.2017.7919107
extern: '1'
external_id:
  arxiv:
  - '1611.01199'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1611.01199
month: '05'
oa: 1
oa_version: Preprint
publication: '2017 IEEE Wireless Communications and Networking Conference Workshops '
publication_identifier:
  isbn:
  - '9781509059089'
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: Capacity-achieving rate-compatible polar codes for general channels
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '674'
abstract:
- lang: eng
  text: Navigation of cells along gradients of guidance cues is a determining step
    in many developmental and immunological processes. Gradients can either be soluble
    or immobilized to tissues as demonstrated for the haptotactic migration of dendritic
    cells (DCs) toward higher concentrations of immobilized chemokine CCL21. To elucidate
    how gradient characteristics govern cellular response patterns, we here introduce
    an in vitro system allowing to track migratory responses of DCs to precisely controlled
    immobilized gradients of CCL21. We find that haptotactic sensing depends on the
    absolute CCL21 concentration and local steepness of the gradient, consistent with
    a scenario where DC directionality is governed by the signal-to-noise ratio of
    CCL21 binding to the receptor CCR7. We find that the conditions for optimal DC
    guidance are perfectly provided by the CCL21 gradients we measure in vivo. Furthermore,
    we find that CCR7 signal termination by the G-protein-coupled receptor kinase
    6 (GRK6) is crucial for haptotactic but dispensable for chemotactic CCL21 gradient
    sensing in vitro and confirm those observations in vivo. These findings suggest
    that stable, tissue-bound CCL21 gradients as sustainable “roads” ensure optimal
    guidance in vivo.
article_processing_charge: No
author:
- first_name: Jan
  full_name: Schwarz, Jan
  id: 346C1EC6-F248-11E8-B48F-1D18A9856A87
  last_name: Schwarz
- first_name: Veronika
  full_name: Bierbaum, Veronika
  id: 3FD04378-F248-11E8-B48F-1D18A9856A87
  last_name: Bierbaum
- first_name: Kari
  full_name: Vaahtomeri, Kari
  id: 368EE576-F248-11E8-B48F-1D18A9856A87
  last_name: Vaahtomeri
  orcid: 0000-0001-7829-3518
- first_name: Robert
  full_name: Hauschild, Robert
  id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
  last_name: Hauschild
  orcid: 0000-0001-9843-3522
- first_name: Markus
  full_name: Brown, Markus
  id: 3DAB9AFC-F248-11E8-B48F-1D18A9856A87
  last_name: Brown
- first_name: Ingrid
  full_name: De Vries, Ingrid
  id: 4C7D837E-F248-11E8-B48F-1D18A9856A87
  last_name: De Vries
- first_name: Alexander F
  full_name: Leithner, Alexander F
  id: 3B1B77E4-F248-11E8-B48F-1D18A9856A87
  last_name: Leithner
  orcid: 0000-0002-1073-744X
- first_name: Anne
  full_name: Reversat, Anne
  id: 35B76592-F248-11E8-B48F-1D18A9856A87
  last_name: Reversat
  orcid: 0000-0003-0666-8928
- first_name: Jack
  full_name: Merrin, Jack
  id: 4515C308-F248-11E8-B48F-1D18A9856A87
  last_name: Merrin
  orcid: 0000-0001-5145-4609
- first_name: Teresa
  full_name: Tarrant, Teresa
  last_name: Tarrant
- first_name: Tobias
  full_name: Bollenbach, Tobias
  id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
  last_name: Bollenbach
  orcid: 0000-0003-4398-476X
- first_name: Michael K
  full_name: Sixt, Michael K
  id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
  last_name: Sixt
  orcid: 0000-0002-6620-9179
citation:
  ama: Schwarz J, Bierbaum V, Vaahtomeri K, et al. Dendritic cells interpret haptotactic
    chemokine gradients in a manner governed by signal to noise ratio and dependent
    on GRK6. <i>Current Biology</i>. 2017;27(9):1314-1325. doi:<a href="https://doi.org/10.1016/j.cub.2017.04.004">10.1016/j.cub.2017.04.004</a>
  apa: Schwarz, J., Bierbaum, V., Vaahtomeri, K., Hauschild, R., Brown, M., de Vries,
    I., … Sixt, M. K. (2017). Dendritic cells interpret haptotactic chemokine gradients
    in a manner governed by signal to noise ratio and dependent on GRK6. <i>Current
    Biology</i>. Cell Press. <a href="https://doi.org/10.1016/j.cub.2017.04.004">https://doi.org/10.1016/j.cub.2017.04.004</a>
  chicago: Schwarz, Jan, Veronika Bierbaum, Kari Vaahtomeri, Robert Hauschild, Markus
    Brown, Ingrid de Vries, Alexander F Leithner, et al. “Dendritic Cells Interpret
    Haptotactic Chemokine Gradients in a Manner Governed by Signal to Noise Ratio
    and Dependent on GRK6.” <i>Current Biology</i>. Cell Press, 2017. <a href="https://doi.org/10.1016/j.cub.2017.04.004">https://doi.org/10.1016/j.cub.2017.04.004</a>.
  ieee: J. Schwarz <i>et al.</i>, “Dendritic cells interpret haptotactic chemokine
    gradients in a manner governed by signal to noise ratio and dependent on GRK6,”
    <i>Current Biology</i>, vol. 27, no. 9. Cell Press, pp. 1314–1325, 2017.
  ista: Schwarz J, Bierbaum V, Vaahtomeri K, Hauschild R, Brown M, de Vries I, Leithner
    AF, Reversat A, Merrin J, Tarrant T, Bollenbach MT, Sixt MK. 2017. Dendritic cells
    interpret haptotactic chemokine gradients in a manner governed by signal to noise
    ratio and dependent on GRK6. Current Biology. 27(9), 1314–1325.
  mla: Schwarz, Jan, et al. “Dendritic Cells Interpret Haptotactic Chemokine Gradients
    in a Manner Governed by Signal to Noise Ratio and Dependent on GRK6.” <i>Current
    Biology</i>, vol. 27, no. 9, Cell Press, 2017, pp. 1314–25, doi:<a href="https://doi.org/10.1016/j.cub.2017.04.004">10.1016/j.cub.2017.04.004</a>.
  short: J. Schwarz, V. Bierbaum, K. Vaahtomeri, R. Hauschild, M. Brown, I. de Vries,
    A.F. Leithner, A. Reversat, J. Merrin, T. Tarrant, M.T. Bollenbach, M.K. Sixt,
    Current Biology 27 (2017) 1314–1325.
corr_author: '1'
date_created: 2018-12-11T11:47:51Z
date_published: 2017-05-09T00:00:00Z
date_updated: 2025-09-10T14:26:47Z
day: '09'
department:
- _id: MiSi
- _id: Bio
- _id: NanoFab
doi: 10.1016/j.cub.2017.04.004
ec_funded: 1
external_id:
  isi:
  - '000400741700021'
intvolume: '        27'
isi: 1
issue: '9'
language:
- iso: eng
month: '05'
oa_version: None
page: 1314 - 1325
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '291734'
  name: International IST Postdoc Fellowship Programme
- _id: 25A8E5EA-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Y 564-B12
  name: Cytoskeletal force generation and force transduction of migrating leukocytes
publication: Current Biology
publication_identifier:
  issn:
  - '09609822'
publication_status: published
publisher: Cell Press
publist_id: '7050'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dendritic cells interpret haptotactic chemokine gradients in a manner governed
  by signal to noise ratio and dependent on GRK6
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 27
year: '2017'
...
---
_id: '675'
abstract:
- lang: eng
  text: 'We report the enhancement of infrared absorption of chemisorbed carbon monoxide
    on platinum in the gap of plasmonic nanoantennas. Our method is based on the self-assembled
    formation of platinum nanoislands on nanoscopic dipole antenna arrays manufactured
    via electron beam lithography. We employ systematic variations of the plasmonic
    antenna resonance to precisely couple to the molecular stretch vibration of carbon
    monoxide adsorbed on the platinum nanoislands. Ultimately, we reach more than
    1500-fold infrared absorption enhancements, allowing for an ultrasensitive detection
    of a monolayer of chemisorbed carbon monoxide. The developed procedure can be
    adapted to other metal adsorbents and molecular species and could be utilized
    for coverage sensing in surface catalytic reactions. '
article_processing_charge: No
article_type: original
author:
- first_name: Johannes
  full_name: Haase, Johannes
  last_name: Haase
- first_name: Salvatore
  full_name: Bagiante, Salvatore
  id: 38ED402E-F248-11E8-B48F-1D18A9856A87
  last_name: Bagiante
  orcid: 0000-0002-0122-9603
- first_name: Hans
  full_name: Sigg, Hans
  last_name: Sigg
- first_name: Jeroen
  full_name: Van Bokhoven, Jeroen
  last_name: Van Bokhoven
citation:
  ama: Haase J, Bagiante S, Sigg H, Van Bokhoven J. Surface enhanced infrared absorption
    of chemisorbed carbon monoxide using plasmonic nanoantennas. <i>Optics Letters</i>.
    2017;42(10):1931-1934. doi:<a href="https://doi.org/10.1364/OL.42.001931">10.1364/OL.42.001931</a>
  apa: Haase, J., Bagiante, S., Sigg, H., &#38; Van Bokhoven, J. (2017). Surface enhanced
    infrared absorption of chemisorbed carbon monoxide using plasmonic nanoantennas.
    <i>Optics Letters</i>. Optica Publishing Group. <a href="https://doi.org/10.1364/OL.42.001931">https://doi.org/10.1364/OL.42.001931</a>
  chicago: Haase, Johannes, Salvatore Bagiante, Hans Sigg, and Jeroen Van Bokhoven.
    “Surface Enhanced Infrared Absorption of Chemisorbed Carbon Monoxide Using Plasmonic
    Nanoantennas.” <i>Optics Letters</i>. Optica Publishing Group, 2017. <a href="https://doi.org/10.1364/OL.42.001931">https://doi.org/10.1364/OL.42.001931</a>.
  ieee: J. Haase, S. Bagiante, H. Sigg, and J. Van Bokhoven, “Surface enhanced infrared
    absorption of chemisorbed carbon monoxide using plasmonic nanoantennas,” <i>Optics
    Letters</i>, vol. 42, no. 10. Optica Publishing Group, pp. 1931–1934, 2017.
  ista: Haase J, Bagiante S, Sigg H, Van Bokhoven J. 2017. Surface enhanced infrared
    absorption of chemisorbed carbon monoxide using plasmonic nanoantennas. Optics
    Letters. 42(10), 1931–1934.
  mla: Haase, Johannes, et al. “Surface Enhanced Infrared Absorption of Chemisorbed
    Carbon Monoxide Using Plasmonic Nanoantennas.” <i>Optics Letters</i>, vol. 42,
    no. 10, Optica Publishing Group, 2017, pp. 1931–34, doi:<a href="https://doi.org/10.1364/OL.42.001931">10.1364/OL.42.001931</a>.
  short: J. Haase, S. Bagiante, H. Sigg, J. Van Bokhoven, Optics Letters 42 (2017)
    1931–1934.
date_created: 2018-12-11T11:47:51Z
date_published: 2017-05-15T00:00:00Z
date_updated: 2025-09-10T14:25:19Z
day: '15'
ddc:
- '530'
department:
- _id: NanoFab
doi: 10.1364/OL.42.001931
external_id:
  isi:
  - '000401424900016'
intvolume: '        42'
isi: 1
issue: '10'
language:
- iso: eng
month: '05'
oa_version: None
page: 1931 - 1934
publication: Optics Letters
publication_status: published
publisher: Optica Publishing Group
publist_id: '7048'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Surface enhanced infrared absorption of chemisorbed carbon monoxide using plasmonic
  nanoantennas
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 42
year: '2017'
...
---
_id: '677'
abstract:
- lang: eng
  text: The INO80 complex (INO80-C) is an evolutionarily conserved nucleosome remodeler
    that acts in transcription, replication, and genome stability. It is required
    for resistance against genotoxic agents and is involved in the repair of DNA double-strand
    breaks (DSBs) by homologous recombination (HR). However, the causes of the HR
    defect in INO80-C mutant cells are controversial. Here, we unite previous findings
    using a system to study HR with high spatial resolution in budding yeast. We find
    that INO80-C has at least two distinct functions during HR—DNA end resection and
    presynaptic filament formation. Importantly, the second function is linked to
    the histone variant H2A.Z. In the absence of H2A.Z, presynaptic filament formation
    and HR are restored in INO80-C-deficient mutants, suggesting that presynaptic
    filament formation is the crucial INO80-C function during HR.
article_processing_charge: No
author:
- first_name: Claudio
  full_name: Lademann, Claudio
  last_name: Lademann
- first_name: Jörg
  full_name: Renkawitz, Jörg
  id: 3F0587C8-F248-11E8-B48F-1D18A9856A87
  last_name: Renkawitz
  orcid: 0000-0003-2856-3369
- first_name: Boris
  full_name: Pfander, Boris
  last_name: Pfander
- first_name: Stefan
  full_name: Jentsch, Stefan
  last_name: Jentsch
citation:
  ama: Lademann C, Renkawitz J, Pfander B, Jentsch S. The INO80 complex removes H2A.Z
    to promote presynaptic filament formation during homologous recombination. <i>Cell
    Reports</i>. 2017;19(7):1294-1303. doi:<a href="https://doi.org/10.1016/j.celrep.2017.04.051">10.1016/j.celrep.2017.04.051</a>
  apa: Lademann, C., Renkawitz, J., Pfander, B., &#38; Jentsch, S. (2017). The INO80
    complex removes H2A.Z to promote presynaptic filament formation during homologous
    recombination. <i>Cell Reports</i>. Cell Press. <a href="https://doi.org/10.1016/j.celrep.2017.04.051">https://doi.org/10.1016/j.celrep.2017.04.051</a>
  chicago: Lademann, Claudio, Jörg Renkawitz, Boris Pfander, and Stefan Jentsch. “The
    INO80 Complex Removes H2A.Z to Promote Presynaptic Filament Formation during Homologous
    Recombination.” <i>Cell Reports</i>. Cell Press, 2017. <a href="https://doi.org/10.1016/j.celrep.2017.04.051">https://doi.org/10.1016/j.celrep.2017.04.051</a>.
  ieee: C. Lademann, J. Renkawitz, B. Pfander, and S. Jentsch, “The INO80 complex
    removes H2A.Z to promote presynaptic filament formation during homologous recombination,”
    <i>Cell Reports</i>, vol. 19, no. 7. Cell Press, pp. 1294–1303, 2017.
  ista: Lademann C, Renkawitz J, Pfander B, Jentsch S. 2017. The INO80 complex removes
    H2A.Z to promote presynaptic filament formation during homologous recombination.
    Cell Reports. 19(7), 1294–1303.
  mla: Lademann, Claudio, et al. “The INO80 Complex Removes H2A.Z to Promote Presynaptic
    Filament Formation during Homologous Recombination.” <i>Cell Reports</i>, vol.
    19, no. 7, Cell Press, 2017, pp. 1294–303, doi:<a href="https://doi.org/10.1016/j.celrep.2017.04.051">10.1016/j.celrep.2017.04.051</a>.
  short: C. Lademann, J. Renkawitz, B. Pfander, S. Jentsch, Cell Reports 19 (2017)
    1294–1303.
date_created: 2018-12-11T11:47:52Z
date_published: 2017-05-16T00:00:00Z
date_updated: 2025-09-10T14:23:55Z
day: '16'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.1016/j.celrep.2017.04.051
external_id:
  isi:
  - '000402125100002'
file:
- access_level: open_access
  checksum: efc7287d9c6354983cb151880e9ad72a
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:15:48Z
  date_updated: 2020-07-14T12:47:40Z
  file_id: '5171'
  file_name: IST-2017-899-v1+1_1-s2.0-S2211124717305454-main.pdf
  file_size: 3005610
  relation: main_file
file_date_updated: 2020-07-14T12:47:40Z
has_accepted_license: '1'
intvolume: '        19'
isi: 1
issue: '7'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 1294 - 1303
publication: Cell Reports
publication_identifier:
  issn:
  - 2211-1247
publication_status: published
publisher: Cell Press
publist_id: '7046'
pubrep_id: '899'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The INO80 complex removes H2A.Z to promote presynaptic filament formation during
  homologous recombination
tmp:
  image: /images/cc_by_nc_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
    (CC BY-NC-ND 4.0)
  short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 19
year: '2017'
...
---
_id: '678'
abstract:
- lang: eng
  text: The seminal observation that mechanical signals can elicit changes in biochemical
    signalling within cells, a process commonly termed mechanosensation and mechanotransduction,
    has revolutionized our understanding of the role of cell mechanics in various
    fundamental biological processes, such as cell motility, adhesion, proliferation
    and differentiation. In this Review, we will discuss how the interplay and feedback
    between mechanical and biochemical signals control tissue morphogenesis and cell
    fate specification in embryonic development.
article_processing_charge: No
author:
- first_name: Nicoletta
  full_name: Petridou, Nicoletta
  id: 2A003F6C-F248-11E8-B48F-1D18A9856A87
  last_name: Petridou
  orcid: 0000-0002-8451-1195
- first_name: Zoltan P
  full_name: Spiro, Zoltan P
  id: 426AD026-F248-11E8-B48F-1D18A9856A87
  last_name: Spiro
- first_name: Carl-Philipp J
  full_name: Heisenberg, Carl-Philipp J
  id: 39427864-F248-11E8-B48F-1D18A9856A87
  last_name: Heisenberg
  orcid: 0000-0002-0912-4566
citation:
  ama: Petridou N, Spiro ZP, Heisenberg C-PJ. Multiscale force sensing in development.
    <i>Nature Cell Biology</i>. 2017;19(6):581-588. doi:<a href="https://doi.org/10.1038/ncb3524">10.1038/ncb3524</a>
  apa: Petridou, N., Spiro, Z. P., &#38; Heisenberg, C.-P. J. (2017). Multiscale force
    sensing in development. <i>Nature Cell Biology</i>. Nature Publishing Group. <a
    href="https://doi.org/10.1038/ncb3524">https://doi.org/10.1038/ncb3524</a>
  chicago: Petridou, Nicoletta, Zoltan P Spiro, and Carl-Philipp J Heisenberg. “Multiscale
    Force Sensing in Development.” <i>Nature Cell Biology</i>. Nature Publishing Group,
    2017. <a href="https://doi.org/10.1038/ncb3524">https://doi.org/10.1038/ncb3524</a>.
  ieee: N. Petridou, Z. P. Spiro, and C.-P. J. Heisenberg, “Multiscale force sensing
    in development,” <i>Nature Cell Biology</i>, vol. 19, no. 6. Nature Publishing
    Group, pp. 581–588, 2017.
  ista: Petridou N, Spiro ZP, Heisenberg C-PJ. 2017. Multiscale force sensing in development.
    Nature Cell Biology. 19(6), 581–588.
  mla: Petridou, Nicoletta, et al. “Multiscale Force Sensing in Development.” <i>Nature
    Cell Biology</i>, vol. 19, no. 6, Nature Publishing Group, 2017, pp. 581–88, doi:<a
    href="https://doi.org/10.1038/ncb3524">10.1038/ncb3524</a>.
  short: N. Petridou, Z.P. Spiro, C.-P.J. Heisenberg, Nature Cell Biology 19 (2017)
    581–588.
corr_author: '1'
date_created: 2018-12-11T11:47:53Z
date_published: 2017-05-31T00:00:00Z
date_updated: 2025-09-10T14:23:21Z
day: '31'
department:
- _id: CaHe
doi: 10.1038/ncb3524
external_id:
  isi:
  - '000402525200003'
intvolume: '        19'
isi: 1
issue: '6'
language:
- iso: eng
month: '05'
oa_version: None
page: 581 - 588
project:
- _id: 25236028-B435-11E9-9278-68D0E5697425
  grant_number: ALTF534-2016
  name: The generation and function of anisotropic tissue tension in zebrafish epiboly
publication: Nature Cell Biology
publication_identifier:
  issn:
  - 1465-7392
publication_status: published
publisher: Nature Publishing Group
publist_id: '7040'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Multiscale force sensing in development
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 19
year: '2017'
...
---
_id: '680'
abstract:
- lang: eng
  text: In order to respond reliably to specific features of their environment, sensory
    neurons need to integrate multiple incoming noisy signals. Crucially, they also
    need to compete for the interpretation of those signals with other neurons representing
    similar features. The form that this competition should take depends critically
    on the noise corrupting these signals. In this study we show that for the type
    of noise commonly observed in sensory systems, whose variance scales with the
    mean signal, sensory neurons should selectively divide their input signals by
    their predictions, suppressing ambiguous cues while amplifying others. Any change
    in the stimulus context alters which inputs are suppressed, leading to a deep
    dynamic reshaping of neural receptive fields going far beyond simple surround
    suppression. Paradoxically, these highly variable receptive fields go alongside
    and are in fact required for an invariant representation of external sensory features.
    In addition to offering a normative account of context-dependent changes in sensory
    responses, perceptual inference in the presence of signal-dependent noise accounts
    for ubiquitous features of sensory neurons such as divisive normalization, gain
    control and contrast dependent temporal dynamics.
article_number: e1005582
article_processing_charge: No
author:
- first_name: Matthew J
  full_name: Chalk, Matthew J
  id: 2BAAC544-F248-11E8-B48F-1D18A9856A87
  last_name: Chalk
  orcid: 0000-0001-7782-4436
- first_name: Paul
  full_name: Masset, Paul
  last_name: Masset
- first_name: Boris
  full_name: Gutkin, Boris
  last_name: Gutkin
- first_name: Sophie
  full_name: Denève, Sophie
  last_name: Denève
citation:
  ama: Chalk MJ, Masset P, Gutkin B, Denève S. Sensory noise predicts divisive reshaping
    of receptive fields. <i>PLoS Computational Biology</i>. 2017;13(6). doi:<a href="https://doi.org/10.1371/journal.pcbi.1005582">10.1371/journal.pcbi.1005582</a>
  apa: Chalk, M. J., Masset, P., Gutkin, B., &#38; Denève, S. (2017). Sensory noise
    predicts divisive reshaping of receptive fields. <i>PLoS Computational Biology</i>.
    Public Library of Science. <a href="https://doi.org/10.1371/journal.pcbi.1005582">https://doi.org/10.1371/journal.pcbi.1005582</a>
  chicago: Chalk, Matthew J, Paul Masset, Boris Gutkin, and Sophie Denève. “Sensory
    Noise Predicts Divisive Reshaping of Receptive Fields.” <i>PLoS Computational
    Biology</i>. Public Library of Science, 2017. <a href="https://doi.org/10.1371/journal.pcbi.1005582">https://doi.org/10.1371/journal.pcbi.1005582</a>.
  ieee: M. J. Chalk, P. Masset, B. Gutkin, and S. Denève, “Sensory noise predicts
    divisive reshaping of receptive fields,” <i>PLoS Computational Biology</i>, vol.
    13, no. 6. Public Library of Science, 2017.
  ista: Chalk MJ, Masset P, Gutkin B, Denève S. 2017. Sensory noise predicts divisive
    reshaping of receptive fields. PLoS Computational Biology. 13(6), e1005582.
  mla: Chalk, Matthew J., et al. “Sensory Noise Predicts Divisive Reshaping of Receptive
    Fields.” <i>PLoS Computational Biology</i>, vol. 13, no. 6, e1005582, Public Library
    of Science, 2017, doi:<a href="https://doi.org/10.1371/journal.pcbi.1005582">10.1371/journal.pcbi.1005582</a>.
  short: M.J. Chalk, P. Masset, B. Gutkin, S. Denève, PLoS Computational Biology 13
    (2017).
corr_author: '1'
date_created: 2018-12-11T11:47:53Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2025-09-10T14:20:48Z
day: '01'
ddc:
- '571'
department:
- _id: GaTk
doi: 10.1371/journal.pcbi.1005582
external_id:
  isi:
  - '000404565400034'
file:
- access_level: open_access
  checksum: 796a1026076af6f4405a47d985bc7b68
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:07:47Z
  date_updated: 2020-07-14T12:47:40Z
  file_id: '4645'
  file_name: IST-2017-898-v1+1_journal.pcbi.1005582.pdf
  file_size: 14555676
  relation: main_file
file_date_updated: 2020-07-14T12:47:40Z
has_accepted_license: '1'
intvolume: '        13'
isi: 1
issue: '6'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: PLoS Computational Biology
publication_identifier:
  issn:
  - 1553-734X
publication_status: published
publisher: Public Library of Science
publist_id: '7035'
pubrep_id: '898'
quality_controlled: '1'
related_material:
  record:
  - id: '9855'
    relation: research_data
    status: public
scopus_import: '1'
status: public
title: Sensory noise predicts divisive reshaping of receptive fields
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: '2017'
...
---
_id: '681'
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. In this paper we propose a new notion
    of equilibria, called doomsday equilibria, which is a strategy profile where 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. We 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.
article_processing_charge: No
article_type: original
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
  full_name: Raskin, Jean
  last_name: Raskin
citation:
  ama: Chatterjee K, Doyen L, Filiot E, Raskin J. Doomsday equilibria for omega-regular
    games. <i>Information and Computation</i>. 2017;254:296-315. doi:<a href="https://doi.org/10.1016/j.ic.2016.10.012">10.1016/j.ic.2016.10.012</a>
  apa: Chatterjee, K., Doyen, L., Filiot, E., &#38; Raskin, J. (2017). Doomsday equilibria
    for omega-regular games. <i>Information and Computation</i>. Elsevier. <a href="https://doi.org/10.1016/j.ic.2016.10.012">https://doi.org/10.1016/j.ic.2016.10.012</a>
  chicago: Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean Raskin.
    “Doomsday Equilibria for Omega-Regular Games.” <i>Information and Computation</i>.
    Elsevier, 2017. <a href="https://doi.org/10.1016/j.ic.2016.10.012">https://doi.org/10.1016/j.ic.2016.10.012</a>.
  ieee: K. Chatterjee, L. Doyen, E. Filiot, and J. Raskin, “Doomsday equilibria for
    omega-regular games,” <i>Information and Computation</i>, vol. 254. Elsevier,
    pp. 296–315, 2017.
  ista: Chatterjee K, Doyen L, Filiot E, Raskin J. 2017. Doomsday equilibria for omega-regular
    games. Information and Computation. 254, 296–315.
  mla: Chatterjee, Krishnendu, et al. “Doomsday Equilibria for Omega-Regular Games.”
    <i>Information and Computation</i>, vol. 254, Elsevier, 2017, pp. 296–315, doi:<a
    href="https://doi.org/10.1016/j.ic.2016.10.012">10.1016/j.ic.2016.10.012</a>.
  short: K. Chatterjee, L. Doyen, E. Filiot, J. Raskin, Information and Computation
    254 (2017) 296–315.
corr_author: '1'
date_created: 2018-12-11T11:47:53Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2026-04-16T10:00:03Z
day: '01'
department:
- _id: KrCh
doi: 10.1016/j.ic.2016.10.012
ec_funded: 1
external_id:
  arxiv:
  - '1311.3238'
  isi:
  - '000402025600008'
intvolume: '       254'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1311.3238
month: '06'
oa: 1
oa_version: Submitted Version
page: 296 - 315
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: 25681D80-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '291734'
  name: International IST Postdoc Fellowship Programme
publication: Information and Computation
publication_identifier:
  issn:
  - 0890-5401
publication_status: published
publisher: Elsevier
publist_id: '7036'
quality_controlled: '1'
related_material:
  record:
  - id: '10885'
    relation: earlier_version
    status: public
scopus_import: '1'
status: public
title: Doomsday equilibria for omega-regular games
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 254
year: '2017'
...
---
_id: '683'
abstract:
- lang: eng
  text: 'Given a triangulation of a point set in the plane, a flip deletes an edge
    e whose removal leaves a convex quadrilateral, and replaces e by the opposite
    diagonal of the quadrilateral. It is well known that any triangulation of a point
    set can be reconfigured to any other triangulation by some sequence of flips.
    We explore this question in the setting where each edge of a triangulation has
    a label, and a flip transfers the label of the removed edge to the new edge. It
    is not true that every labelled triangulation of a point set can be reconfigured
    to every other labelled triangulation via a sequence of flips, but we characterize
    when this is possible. There is an obvious necessary condition: for each label
    l, if edge e has label l in the first triangulation and edge f has label l in
    the second triangulation, then there must be some sequence of flips that moves
    label l from e to f, ignoring all other labels. Bose, Lubiw, Pathak and Verdonschot
    formulated the Orbit Conjecture, which states that this necessary condition is
    also sufficient, i.e. that all labels can be simultaneously mapped to their destination
    if and only if each label individually can be mapped to its destination. We prove
    this conjecture. Furthermore, we give a polynomial-time algorithm to find a sequence
    of flips to reconfigure one labelled triangulation to another, if such a sequence
    exists, and we prove an upper bound of O(n7) on the length of the flip sequence.
    Our proof uses the topological result that the sets of pairwise non-crossing edges
    on a planar point set form a simplicial complex that is homeomorphic to a high-dimensional
    ball (this follows from a result of Orden and Santos; we give a different proof
    based on a shelling argument). The dual cell complex of this simplicial ball,
    called the flip complex, has the usual flip graph as its 1-skeleton. We use properties
    of the 2-skeleton of the flip complex to prove the Orbit Conjecture.'
alternative_title:
- LIPIcs
article_number: '49'
author:
- first_name: Anna
  full_name: Lubiw, Anna
  last_name: Lubiw
- first_name: Zuzana
  full_name: Masárová, Zuzana
  id: 45CFE238-F248-11E8-B48F-1D18A9856A87
  last_name: Masárová
  orcid: 0000-0002-6660-1322
- first_name: Uli
  full_name: Wagner, Uli
  id: 36690CA2-F248-11E8-B48F-1D18A9856A87
  last_name: Wagner
  orcid: 0000-0002-1494-0568
citation:
  ama: 'Lubiw A, Masárová Z, Wagner U. A proof of the orbit conjecture for flipping
    edge labelled triangulations. In: Vol 77. Schloss Dagstuhl - Leibniz-Zentrum für
    Informatik; 2017. doi:<a href="https://doi.org/10.4230/LIPIcs.SoCG.2017.49">10.4230/LIPIcs.SoCG.2017.49</a>'
  apa: 'Lubiw, A., Masárová, Z., &#38; Wagner, U. (2017). A proof of the orbit conjecture
    for flipping edge labelled triangulations (Vol. 77). Presented at the SoCG: Symposium
    on Computational Geometry, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik. <a href="https://doi.org/10.4230/LIPIcs.SoCG.2017.49">https://doi.org/10.4230/LIPIcs.SoCG.2017.49</a>'
  chicago: Lubiw, Anna, Zuzana Masárová, and Uli Wagner. “A Proof of the Orbit Conjecture
    for Flipping Edge Labelled Triangulations,” Vol. 77. Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik, 2017. <a href="https://doi.org/10.4230/LIPIcs.SoCG.2017.49">https://doi.org/10.4230/LIPIcs.SoCG.2017.49</a>.
  ieee: 'A. Lubiw, Z. Masárová, and U. Wagner, “A proof of the orbit conjecture for
    flipping edge labelled triangulations,” presented at the SoCG: Symposium on Computational
    Geometry, Brisbane, Australia, 2017, vol. 77.'
  ista: 'Lubiw A, Masárová Z, Wagner U. 2017. A proof of the orbit conjecture for
    flipping edge labelled triangulations. SoCG: Symposium on Computational Geometry,
    LIPIcs, vol. 77, 49.'
  mla: Lubiw, Anna, et al. <i>A Proof of the Orbit Conjecture for Flipping Edge Labelled
    Triangulations</i>. Vol. 77, 49, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    2017, doi:<a href="https://doi.org/10.4230/LIPIcs.SoCG.2017.49">10.4230/LIPIcs.SoCG.2017.49</a>.
  short: A. Lubiw, Z. Masárová, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik, 2017.
conference:
  end_date: 2017-07-07
  location: Brisbane, Australia
  name: 'SoCG: Symposium on Computational Geometry'
  start_date: 2017-07-04
corr_author: '1'
date_created: 2018-12-11T11:47:54Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2025-04-15T06:53:14Z
day: '01'
ddc:
- '514'
- '516'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2017.49
file:
- access_level: open_access
  checksum: 24fdde981cc513352a78dcf9b0660ae9
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:17:12Z
  date_updated: 2020-07-14T12:47:41Z
  file_id: '5265'
  file_name: IST-2017-896-v1+1_LIPIcs-SoCG-2017-49.pdf
  file_size: 710007
  relation: main_file
file_date_updated: 2020-07-14T12:47:41Z
has_accepted_license: '1'
intvolume: '        77'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7033'
pubrep_id: '896'
quality_controlled: '1'
related_material:
  record:
  - id: '5986'
    relation: later_version
    status: public
scopus_import: 1
status: public
title: A proof of the orbit conjecture for flipping edge labelled triangulations
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: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 77
year: '2017'
...
---
_id: '684'
abstract:
- lang: eng
  text: We generalize winning conditions in two-player games by adding a structural
    acceptance condition called obligations. Obligations are orthogonal to the linear
    winning conditions that define whether a play is winning. Obligations are a declaration
    that player 0 can achieve a certain value from a configuration. If the obligation
    is met, the value of that configuration for player 0 is 1. We define the value
    in such games and show that obligation games are determined. For Markov chains
    with Borel objectives and obligations, and finite turn-based stochastic parity
    games with obligations we give an alternative and simpler characterization of
    the value function. Based on this simpler definition we show that the decision
    problem of winning finite turn-based stochastic parity games with obligations
    is in NP∩co-NP. We also show that obligation games provide a game framework for
    reasoning about p-automata. © 2017 The Association for Symbolic Logic.
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: Nir
  full_name: Piterman, Nir
  last_name: Piterman
citation:
  ama: Chatterjee K, Piterman N. Obligation blackwell games and p-automata. <i>Journal
    of Symbolic Logic</i>. 2017;82(2):420-452. doi:<a href="https://doi.org/10.1017/jsl.2016.71">10.1017/jsl.2016.71</a>
  apa: Chatterjee, K., &#38; Piterman, N. (2017). Obligation blackwell games and p-automata.
    <i>Journal of Symbolic Logic</i>. Cambridge University Press. <a href="https://doi.org/10.1017/jsl.2016.71">https://doi.org/10.1017/jsl.2016.71</a>
  chicago: Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and
    P-Automata.” <i>Journal of Symbolic Logic</i>. Cambridge University Press, 2017.
    <a href="https://doi.org/10.1017/jsl.2016.71">https://doi.org/10.1017/jsl.2016.71</a>.
  ieee: K. Chatterjee and N. Piterman, “Obligation blackwell games and p-automata,”
    <i>Journal of Symbolic Logic</i>, vol. 82, no. 2. Cambridge University Press,
    pp. 420–452, 2017.
  ista: Chatterjee K, Piterman N. 2017. Obligation blackwell games and p-automata.
    Journal of Symbolic Logic. 82(2), 420–452.
  mla: Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and P-Automata.”
    <i>Journal of Symbolic Logic</i>, vol. 82, no. 2, Cambridge University Press,
    2017, pp. 420–52, doi:<a href="https://doi.org/10.1017/jsl.2016.71">10.1017/jsl.2016.71</a>.
  short: K. Chatterjee, N. Piterman, Journal of Symbolic Logic 82 (2017) 420–452.
corr_author: '1'
date_created: 2018-12-11T11:47:54Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2025-09-10T14:18:30Z
day: '01'
department:
- _id: KrCh
doi: 10.1017/jsl.2016.71
external_id:
  arxiv:
  - '1206.5174'
  isi:
  - '000403796700002'
intvolume: '        82'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1206.5174
month: '06'
oa: 1
oa_version: Submitted Version
page: 420 - 452
publication: Journal of Symbolic Logic
publication_identifier:
  eissn:
  - 1943-5886
  issn:
  - 0022-4812
publication_status: published
publisher: Cambridge University Press
publist_id: '7026'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Obligation blackwell games and p-automata
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 82
year: '2017'
...
---
_id: '6841'
abstract:
- lang: eng
  text: In classical machine learning, regression is treated as a black box process
    of identifying a suitable function from a hypothesis set without attempting to
    gain insight into the mechanism connecting inputs and outputs. In the natural
    sciences, however, finding an interpretable function for a phenomenon is the prime
    goal as it allows to understand and generalize results. This paper proposes a
    novel type of function learning network, called equation learner (EQL), that can
    learn analytical expressions and is able to extrapolate to unseen domains. It
    is implemented as an end-to-end differentiable feed-forward network and allows
    for efficient gradient based training. Due to sparsity regularization concise
    interpretable expressions can be obtained. Often the true underlying source expression
    is identified.
arxiv: 1
author:
- first_name: Georg S
  full_name: Martius, Georg S
  id: 3A276B68-F248-11E8-B48F-1D18A9856A87
  last_name: Martius
- first_name: Christoph
  full_name: Lampert, Christoph
  id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
  last_name: Lampert
  orcid: 0000-0001-8622-7887
citation:
  ama: 'Martius GS, Lampert C. Extrapolation and learning equations. In: <i>5th International
    Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings</i>.
    International Conference on Learning Representations; 2017.'
  apa: 'Martius, G. S., &#38; Lampert, C. (2017). Extrapolation and learning equations.
    In <i>5th International Conference on Learning Representations, ICLR 2017 - Workshop
    Track Proceedings</i>. Toulon, France: International Conference on Learning Representations.'
  chicago: Martius, Georg S, and Christoph Lampert. “Extrapolation and Learning Equations.”
    In <i>5th International Conference on Learning Representations, ICLR 2017 - Workshop
    Track Proceedings</i>. International Conference on Learning Representations, 2017.
  ieee: G. S. Martius and C. Lampert, “Extrapolation and learning equations,” in <i>5th
    International Conference on Learning Representations, ICLR 2017 - Workshop Track
    Proceedings</i>, Toulon, France, 2017.
  ista: 'Martius GS, Lampert C. 2017. Extrapolation and learning equations. 5th International
    Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings.
    ICLR: International Conference on Learning Representations.'
  mla: Martius, Georg S., and Christoph Lampert. “Extrapolation and Learning Equations.”
    <i>5th International Conference on Learning Representations, ICLR 2017 - Workshop
    Track Proceedings</i>, International Conference on Learning Representations, 2017.
  short: G.S. Martius, C. Lampert, in:, 5th International Conference on Learning Representations,
    ICLR 2017 - Workshop Track Proceedings, International Conference on Learning Representations,
    2017.
conference:
  end_date: 2017-04-26
  location: Toulon, France
  name: 'ICLR: International Conference on Learning Representations'
  start_date: 2017-04-24
date_created: 2019-09-01T22:01:00Z
date_published: 2017-02-21T00:00:00Z
date_updated: 2021-01-12T08:09:17Z
day: '21'
department:
- _id: ChLa
ec_funded: 1
external_id:
  arxiv:
  - '1610.02995'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1610.02995
month: '02'
oa: 1
oa_version: Preprint
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '308036'
  name: Lifelong Learning of Visual Scene Understanding
publication: 5th International Conference on Learning Representations, ICLR 2017 -
  Workshop Track Proceedings
publication_status: published
publisher: International Conference on Learning Representations
quality_controlled: '1'
scopus_import: 1
status: public
title: Extrapolation and learning equations
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '685'
abstract:
- lang: eng
  text: By applying methods and principles from the physical sciences to biological
    problems, D'Arcy Thompson's On Growth and Form demonstrated how mathematical reasoning
    reveals elegant, simple explanations for seemingly complex processes. This has
    had a profound influence on subsequent generations of developmental biologists.
    We discuss how this influence can be traced through twentieth century morphologists,
    embryologists and theoreticians to current research that explores the molecular
    and cellular mechanisms of tissue growth and patterning, including our own studies
    of the vertebrate neural tube.
article_processing_charge: No
author:
- first_name: James
  full_name: Briscoe, James
  last_name: Briscoe
- first_name: Anna
  full_name: Kicheva, Anna
  id: 3959A2A0-F248-11E8-B48F-1D18A9856A87
  last_name: Kicheva
  orcid: 0000-0003-4509-4998
citation:
  ama: Briscoe J, Kicheva A. The physics of development 100 years after D’Arcy Thompson’s
    “on growth and form.” <i>Mechanisms of Development</i>. 2017;145:26-31. doi:<a
    href="https://doi.org/10.1016/j.mod.2017.03.005">10.1016/j.mod.2017.03.005</a>
  apa: Briscoe, J., &#38; Kicheva, A. (2017). The physics of development 100 years
    after D’Arcy Thompson’s “on growth and form.” <i>Mechanisms of Development</i>.
    Elsevier. <a href="https://doi.org/10.1016/j.mod.2017.03.005">https://doi.org/10.1016/j.mod.2017.03.005</a>
  chicago: Briscoe, James, and Anna Kicheva. “The Physics of Development 100 Years
    after D’Arcy Thompson’s ‘on Growth and Form.’” <i>Mechanisms of Development</i>.
    Elsevier, 2017. <a href="https://doi.org/10.1016/j.mod.2017.03.005">https://doi.org/10.1016/j.mod.2017.03.005</a>.
  ieee: J. Briscoe and A. Kicheva, “The physics of development 100 years after D’Arcy
    Thompson’s ‘on growth and form,’” <i>Mechanisms of Development</i>, vol. 145.
    Elsevier, pp. 26–31, 2017.
  ista: Briscoe J, Kicheva A. 2017. The physics of development 100 years after D’Arcy
    Thompson’s “on growth and form”. Mechanisms of Development. 145, 26–31.
  mla: Briscoe, James, and Anna Kicheva. “The Physics of Development 100 Years after
    D’Arcy Thompson’s ‘on Growth and Form.’” <i>Mechanisms of Development</i>, vol.
    145, Elsevier, 2017, pp. 26–31, doi:<a href="https://doi.org/10.1016/j.mod.2017.03.005">10.1016/j.mod.2017.03.005</a>.
  short: J. Briscoe, A. Kicheva, Mechanisms of Development 145 (2017) 26–31.
date_created: 2018-12-11T11:47:55Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2026-04-16T10:01:00Z
day: '01'
ddc:
- '571'
department:
- _id: AnKi
doi: 10.1016/j.mod.2017.03.005
ec_funded: 1
external_id:
  isi:
  - '000402836800006'
  pmid:
  - '28366718'
file:
- access_level: open_access
  checksum: 727043d2e4199fbef6b3704e6d1ac105
  content_type: application/pdf
  creator: dernst
  date_created: 2019-04-17T07:58:48Z
  date_updated: 2020-07-14T12:47:42Z
  file_id: '6335'
  file_name: 2017_Briscoe_Kicheva_and_DArcy_accepted_version.pdf
  file_size: 652313
  relation: main_file
file_date_updated: 2020-07-14T12:47:42Z
has_accepted_license: '1'
intvolume: '       145'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 26 - 31
pmid: 1
project:
- _id: B6FC0238-B512-11E9-945C-1524E6697425
  call_identifier: H2020
  grant_number: '680037'
  name: Coordination of Patterning And Growth In the Spinal Cord
publication: Mechanisms of Development
publication_identifier:
  issn:
  - 0925-4773
publication_status: published
publisher: Elsevier
publist_id: '7025'
pubrep_id: '985'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The physics of development 100 years after D'Arcy Thompson's “on growth and
  form”
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 145
year: '2017'
...
---
_id: '686'
abstract:
- lang: eng
  text: Tissues are thought to behave like fluids with a given surface tension. Differences
    in tissue surface tension (TST) have been proposed to trigger cell sorting and
    tissue envelopment. D'Arcy Thompson in his seminal book ‘On Growth and Form’ has
    introduced this concept of differential TST as a key physical mechanism dictating
    tissue formation and organization within the developing organism. Over the past
    century, many studies have picked up the concept of differential TST and analyzed
    the role and cell biological basis of TST in development, underlining the importance
    and influence of this concept in developmental biology.
article_processing_charge: No
author:
- first_name: Carl-Philipp J
  full_name: Heisenberg, Carl-Philipp J
  id: 39427864-F248-11E8-B48F-1D18A9856A87
  last_name: Heisenberg
  orcid: 0000-0002-0912-4566
citation:
  ama: 'Heisenberg C-PJ. D’Arcy Thompson’s ‘on growth and form’: From soap bubbles
    to tissue self organization. <i>Mechanisms of Development</i>. 2017;145:32-37.
    doi:<a href="https://doi.org/10.1016/j.mod.2017.03.006">10.1016/j.mod.2017.03.006</a>'
  apa: 'Heisenberg, C.-P. J. (2017). D’Arcy Thompson’s ‘on growth and form’: From
    soap bubbles to tissue self organization. <i>Mechanisms of Development</i>. Elsevier.
    <a href="https://doi.org/10.1016/j.mod.2017.03.006">https://doi.org/10.1016/j.mod.2017.03.006</a>'
  chicago: 'Heisenberg, Carl-Philipp J. “D’Arcy Thompson’s ‘on Growth and Form’: From
    Soap Bubbles to Tissue Self Organization.” <i>Mechanisms of Development</i>. Elsevier,
    2017. <a href="https://doi.org/10.1016/j.mod.2017.03.006">https://doi.org/10.1016/j.mod.2017.03.006</a>.'
  ieee: 'C.-P. J. Heisenberg, “D’Arcy Thompson’s ‘on growth and form’: From soap bubbles
    to tissue self organization,” <i>Mechanisms of Development</i>, vol. 145. Elsevier,
    pp. 32–37, 2017.'
  ista: 'Heisenberg C-PJ. 2017. D’Arcy Thompson’s ‘on growth and form’: From soap
    bubbles to tissue self organization. Mechanisms of Development. 145, 32–37.'
  mla: 'Heisenberg, Carl-Philipp J. “D’Arcy Thompson’s ‘on Growth and Form’: From
    Soap Bubbles to Tissue Self Organization.” <i>Mechanisms of Development</i>, vol.
    145, Elsevier, 2017, pp. 32–37, doi:<a href="https://doi.org/10.1016/j.mod.2017.03.006">10.1016/j.mod.2017.03.006</a>.'
  short: C.-P.J. Heisenberg, Mechanisms of Development 145 (2017) 32–37.
corr_author: '1'
date_created: 2018-12-11T11:47:55Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2026-04-16T10:01:32Z
day: '01'
department:
- _id: CaHe
doi: 10.1016/j.mod.2017.03.006
external_id:
  isi:
  - '000402836800007'
intvolume: '       145'
isi: 1
language:
- iso: eng
month: '06'
oa_version: None
page: 32 - 37
publication: Mechanisms of Development
publication_identifier:
  issn:
  - 0925-4773
publication_status: published
publisher: Elsevier
publist_id: '7024'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'D''Arcy Thompson''s ‘on growth and form’: From soap bubbles to tissue self
  organization'
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 145
year: '2017'
...
---
_id: '687'
abstract:
- lang: eng
  text: Pursuing the similarity between the Kontsevich-Soibelman construction of the
    cohomological Hall algebra (CoHA) of BPS states and Lusztig's construction of
    canonical bases for quantum enveloping algebras, and the similarity between the
    integrality conjecture for motivic Donaldson-Thomas invariants and the PBW theorem
    for quantum enveloping algebras, we build a coproduct on the CoHA associated to
    a quiver with potential. We also prove a cohomological dimensional reduction theorem,
    further linking a special class of CoHAs with Yangians, and explaining how to
    connect the study of character varieties with the study of CoHAs.
article_processing_charge: No
arxiv: 1
author:
- first_name: Ben
  full_name: Davison, Ben
  id: 4634AB1E-F248-11E8-B48F-1D18A9856A87
  last_name: Davison
  orcid: 0000-0002-8944-4390
citation:
  ama: Davison B. The critical CoHA of a quiver with potential. <i>Quarterly Journal
    of Mathematics</i>. 2017;68(2):635-703. doi:<a href="https://doi.org/10.1093/qmath/haw053">10.1093/qmath/haw053</a>
  apa: Davison, B. (2017). The critical CoHA of a quiver with potential. <i>Quarterly
    Journal of Mathematics</i>. Oxford University Press. <a href="https://doi.org/10.1093/qmath/haw053">https://doi.org/10.1093/qmath/haw053</a>
  chicago: Davison, Ben. “The Critical CoHA of a Quiver with Potential.” <i>Quarterly
    Journal of Mathematics</i>. Oxford University Press, 2017. <a href="https://doi.org/10.1093/qmath/haw053">https://doi.org/10.1093/qmath/haw053</a>.
  ieee: B. Davison, “The critical CoHA of a quiver with potential,” <i>Quarterly Journal
    of Mathematics</i>, vol. 68, no. 2. Oxford University Press, pp. 635–703, 2017.
  ista: Davison B. 2017. The critical CoHA of a quiver with potential. Quarterly Journal
    of Mathematics. 68(2), 635–703.
  mla: Davison, Ben. “The Critical CoHA of a Quiver with Potential.” <i>Quarterly
    Journal of Mathematics</i>, vol. 68, no. 2, Oxford University Press, 2017, pp.
    635–703, doi:<a href="https://doi.org/10.1093/qmath/haw053">10.1093/qmath/haw053</a>.
  short: B. Davison, Quarterly Journal of Mathematics 68 (2017) 635–703.
corr_author: '1'
date_created: 2018-12-11T11:47:55Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2025-09-10T14:15:30Z
day: '01'
department:
- _id: TaHa
doi: 10.1093/qmath/haw053
ec_funded: 1
external_id:
  arxiv:
  - '1311.7172'
  isi:
  - '000404545300015'
intvolume: '        68'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1311.7172
month: '06'
oa: 1
oa_version: Submitted Version
page: 635 - 703
project:
- _id: 25E549F4-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '320593'
  name: Arithmetic and physics of Higgs moduli spaces
publication: Quarterly Journal of Mathematics
publication_identifier:
  issn:
  - 0033-5606
publication_status: published
publisher: Oxford University Press
publist_id: '7022'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The critical CoHA of a quiver with potential
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 68
year: '2017'
...
---
_id: '688'
abstract:
- lang: eng
  text: 'We show that the framework of topological data analysis can be extended from
    metrics to general Bregman divergences, widening the scope of possible applications.
    Examples are the Kullback - Leibler divergence, which is commonly used for comparing
    text and images, and the Itakura - Saito divergence, popular for speech and sound.
    In particular, we prove that appropriately generalized čech and Delaunay (alpha)
    complexes capture the correct homotopy type, namely that of the corresponding
    union of Bregman balls. Consequently, their filtrations give the correct persistence
    diagram, namely the one generated by the uniformly growing Bregman balls. Moreover,
    we show that unlike the metric setting, the filtration of Vietoris-Rips complexes
    may fail to approximate the persistence diagram. We propose algorithms to compute
    the thus generalized čech, Vietoris-Rips and Delaunay complexes and experimentally
    test their efficiency. Lastly, we explain their surprisingly good performance
    by making a connection with discrete Morse theory. '
alternative_title:
- LIPIcs
article_processing_charge: No
author:
- first_name: Herbert
  full_name: Edelsbrunner, Herbert
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
- first_name: Hubert
  full_name: Wagner, Hubert
  id: 379CA8B8-F248-11E8-B48F-1D18A9856A87
  last_name: Wagner
citation:
  ama: 'Edelsbrunner H, Wagner H. Topological data analysis with Bregman divergences.
    In: Vol 77. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017:391-3916.
    doi:<a href="https://doi.org/10.4230/LIPIcs.SoCG.2017.39">10.4230/LIPIcs.SoCG.2017.39</a>'
  apa: 'Edelsbrunner, H., &#38; Wagner, H. (2017). Topological data analysis with
    Bregman divergences (Vol. 77, pp. 391–3916). Presented at the Symposium on Computational
    Geometry, SoCG, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
    <a href="https://doi.org/10.4230/LIPIcs.SoCG.2017.39">https://doi.org/10.4230/LIPIcs.SoCG.2017.39</a>'
  chicago: Edelsbrunner, Herbert, and Hubert Wagner. “Topological Data Analysis with
    Bregman Divergences,” 77:391–3916. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    2017. <a href="https://doi.org/10.4230/LIPIcs.SoCG.2017.39">https://doi.org/10.4230/LIPIcs.SoCG.2017.39</a>.
  ieee: H. Edelsbrunner and H. Wagner, “Topological data analysis with Bregman divergences,”
    presented at the Symposium on Computational Geometry, SoCG, Brisbane, Australia,
    2017, vol. 77, pp. 391–3916.
  ista: Edelsbrunner H, Wagner H. 2017. Topological data analysis with Bregman divergences.
    Symposium on Computational Geometry, SoCG, LIPIcs, vol. 77, 391–3916.
  mla: Edelsbrunner, Herbert, and Hubert Wagner. <i>Topological Data Analysis with
    Bregman Divergences</i>. Vol. 77, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    2017, pp. 391–3916, doi:<a href="https://doi.org/10.4230/LIPIcs.SoCG.2017.39">10.4230/LIPIcs.SoCG.2017.39</a>.
  short: H. Edelsbrunner, H. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    2017, pp. 391–3916.
conference:
  end_date: 2017-07-07
  location: Brisbane, Australia
  name: Symposium on Computational Geometry, SoCG
  start_date: 2017-07-04
corr_author: '1'
date_created: 2018-12-11T11:47:56Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2025-07-10T11:53:56Z
day: '01'
ddc:
- '514'
- '516'
department:
- _id: HeEd
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2017.39
file:
- access_level: open_access
  checksum: 067ab0cb3f962bae6c3af6bf0094e0f3
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:11:03Z
  date_updated: 2020-07-14T12:47:42Z
  file_id: '4856'
  file_name: IST-2017-895-v1+1_LIPIcs-SoCG-2017-39.pdf
  file_size: 990546
  relation: main_file
file_date_updated: 2020-07-14T12:47:42Z
has_accepted_license: '1'
intvolume: '        77'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 391-3916
publication_identifier:
  issn:
  - 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7021'
pubrep_id: '895'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Topological data analysis with Bregman divergences
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: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 77
year: '2017'
...
