---
_id: '10862'
abstract:
- lang: eng
  text: We consider the sum of two large Hermitian matrices A and B with a Haar unitary
    conjugation bringing them into a general relative position. We prove that the
    eigenvalue density on the scale slightly above the local eigenvalue spacing is
    asymptotically given by the free additive convolution of the laws of A and B as
    the dimension of the matrix increases. This implies optimal rigidity of the eigenvalues
    and optimal rate of convergence in Voiculescu's theorem. Our previous works [4],
    [5] established these results in the bulk spectrum, the current paper completely
    settles the problem at the spectral edges provided they have the typical square-root
    behavior. The key element of our proof is to compensate the deterioration of the
    stability of the subordination equations by sharp error estimates that properly
    account for the local density near the edge. Our results also hold if the Haar
    unitary matrix is replaced by the Haar orthogonal matrix.
acknowledgement: Partially supported by ERC Advanced Grant RANMAT No. 338804.
article_number: '108639'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Zhigang
  full_name: Bao, Zhigang
  id: 442E6A6C-F248-11E8-B48F-1D18A9856A87
  last_name: Bao
  orcid: 0000-0003-3036-1475
- first_name: László
  full_name: Erdös, László
  id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
  last_name: Erdös
  orcid: 0000-0001-5366-9603
- first_name: Kevin
  full_name: Schnelli, Kevin
  last_name: Schnelli
citation:
  ama: Bao Z, Erdös L, Schnelli K. Spectral rigidity for addition of random matrices
    at the regular edge. <i>Journal of Functional Analysis</i>. 2020;279(7). doi:<a
    href="https://doi.org/10.1016/j.jfa.2020.108639">10.1016/j.jfa.2020.108639</a>
  apa: Bao, Z., Erdös, L., &#38; Schnelli, K. (2020). Spectral rigidity for addition
    of random matrices at the regular edge. <i>Journal of Functional Analysis</i>.
    Elsevier. <a href="https://doi.org/10.1016/j.jfa.2020.108639">https://doi.org/10.1016/j.jfa.2020.108639</a>
  chicago: Bao, Zhigang, László Erdös, and Kevin Schnelli. “Spectral Rigidity for
    Addition of Random Matrices at the Regular Edge.” <i>Journal of Functional Analysis</i>.
    Elsevier, 2020. <a href="https://doi.org/10.1016/j.jfa.2020.108639">https://doi.org/10.1016/j.jfa.2020.108639</a>.
  ieee: Z. Bao, L. Erdös, and K. Schnelli, “Spectral rigidity for addition of random
    matrices at the regular edge,” <i>Journal of Functional Analysis</i>, vol. 279,
    no. 7. Elsevier, 2020.
  ista: Bao Z, Erdös L, Schnelli K. 2020. Spectral rigidity for addition of random
    matrices at the regular edge. Journal of Functional Analysis. 279(7), 108639.
  mla: Bao, Zhigang, et al. “Spectral Rigidity for Addition of Random Matrices at
    the Regular Edge.” <i>Journal of Functional Analysis</i>, vol. 279, no. 7, 108639,
    Elsevier, 2020, doi:<a href="https://doi.org/10.1016/j.jfa.2020.108639">10.1016/j.jfa.2020.108639</a>.
  short: Z. Bao, L. Erdös, K. Schnelli, Journal of Functional Analysis 279 (2020).
date_created: 2022-03-18T10:18:59Z
date_published: 2020-10-15T00:00:00Z
date_updated: 2023-08-24T14:08:42Z
day: '15'
department:
- _id: LaEr
doi: 10.1016/j.jfa.2020.108639
ec_funded: 1
external_id:
  arxiv:
  - '1708.01597'
  isi:
  - '000559623200009'
intvolume: '       279'
isi: 1
issue: '7'
keyword:
- Analysis
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1708.01597
month: '10'
oa: 1
oa_version: Preprint
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '338804'
  name: Random matrices, universality and disordered quantum systems
publication: Journal of Functional Analysis
publication_identifier:
  issn:
  - 0022-1236
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Spectral rigidity for addition of random matrices at the regular edge
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 279
year: '2020'
...
---
_id: '10865'
abstract:
- lang: eng
  text: "We introduce the notion of Witness Maps as a cryptographic notion of a proof
    system. A Unique Witness Map (UWM) deterministically maps all witnesses for an
    \  NP  statement to a single representative witness, resulting in a computationally
    sound, deterministic-prover, non-interactive witness independent proof system.
    A relaxation of UWM, called Compact Witness Map (CWM), maps all the witnesses
    to a small number of witnesses, resulting in a “lossy” deterministic-prover, non-interactive
    proof-system. We also define a Dual Mode Witness Map (DMWM) which adds an “extractable”
    mode to a CWM.\r\nOur main construction is a DMWM for all   NP  relations, assuming
    sub-exponentially secure indistinguishability obfuscation (  iO ), along with
    standard cryptographic assumptions. The DMWM construction relies on a CWM and
    a new primitive called Cumulative All-Lossy-But-One Trapdoor Functions (C-ALBO-TDF),
    both of which are in turn instantiated based on   iO  and other primitives. Our
    instantiation of a CWM is in fact a UWM; in turn, we show that a UWM implies Witness
    Encryption. Along the way to constructing UWM and C-ALBO-TDF, we also construct,
    from standard assumptions, Puncturable Digital Signatures and a new primitive
    called Cumulative Lossy Trapdoor Functions (C-LTDF). The former improves up on
    a construction of Bellare et al. (Eurocrypt 2016), who relied on sub-exponentially
    secure   iO  and sub-exponentially secure OWF.\r\nAs an application of our constructions,
    we show how to use a DMWM to construct the first leakage and tamper-resilient
    signatures with a deterministic signer, thereby solving a decade old open problem
    posed by Katz and Vaikunthanathan (Asiacrypt 2009), by Boyle, Segev and Wichs
    (Eurocrypt 2011), as well as by Faonio and Venturi (Asiacrypt 2016). Our construction
    achieves the optimal leakage rate of   1−o(1) ."
acknowledgement: We would like to thank the anonymous reviewers of PKC 2019 for their
  useful comments and suggestions. We thank Omer Paneth for pointing out to us the
  connection between Unique Witness Maps (UWM) and Witness encryption (WE). The first
  author would like to acknowledge Pandu Rangan for his involvement during the initial
  discussion phase of the project.
article_processing_charge: No
author:
- first_name: Suvradip
  full_name: Chakraborty, Suvradip
  id: B9CD0494-D033-11E9-B219-A439E6697425
  last_name: Chakraborty
- first_name: Manoj
  full_name: Prabhakaran, Manoj
  last_name: Prabhakaran
- first_name: Daniel
  full_name: Wichs, Daniel
  last_name: Wichs
citation:
  ama: 'Chakraborty S, Prabhakaran M, Wichs D. Witness maps and applications. In:
    Kiayias A, ed. <i>Public-Key Cryptography</i>. Vol 12110. LNCS. Cham: Springer
    Nature; 2020:220-246. doi:<a href="https://doi.org/10.1007/978-3-030-45374-9_8">10.1007/978-3-030-45374-9_8</a>'
  apa: 'Chakraborty, S., Prabhakaran, M., &#38; Wichs, D. (2020). Witness maps and
    applications. In A. Kiayias (Ed.), <i>Public-Key Cryptography</i> (Vol. 12110,
    pp. 220–246). Cham: Springer Nature. <a href="https://doi.org/10.1007/978-3-030-45374-9_8">https://doi.org/10.1007/978-3-030-45374-9_8</a>'
  chicago: 'Chakraborty, Suvradip, Manoj Prabhakaran, and Daniel Wichs. “Witness Maps
    and Applications.” In <i>Public-Key Cryptography</i>, edited by A Kiayias, 12110:220–46.
    LNCS. Cham: Springer Nature, 2020. <a href="https://doi.org/10.1007/978-3-030-45374-9_8">https://doi.org/10.1007/978-3-030-45374-9_8</a>.'
  ieee: 'S. Chakraborty, M. Prabhakaran, and D. Wichs, “Witness maps and applications,”
    in <i>Public-Key Cryptography</i>, vol. 12110, A. Kiayias, Ed. Cham: Springer
    Nature, 2020, pp. 220–246.'
  ista: 'Chakraborty S, Prabhakaran M, Wichs D. 2020.Witness maps and applications.
    In: Public-Key Cryptography. vol. 12110, 220–246.'
  mla: Chakraborty, Suvradip, et al. “Witness Maps and Applications.” <i>Public-Key
    Cryptography</i>, edited by A Kiayias, vol. 12110, Springer Nature, 2020, pp.
    220–46, doi:<a href="https://doi.org/10.1007/978-3-030-45374-9_8">10.1007/978-3-030-45374-9_8</a>.
  short: S. Chakraborty, M. Prabhakaran, D. Wichs, in:, A. Kiayias (Ed.), Public-Key
    Cryptography, Springer Nature, Cham, 2020, pp. 220–246.
date_created: 2022-03-18T11:35:51Z
date_published: 2020-04-29T00:00:00Z
date_updated: 2023-09-05T15:10:02Z
day: '29'
doi: 10.1007/978-3-030-45374-9_8
editor:
- first_name: A
  full_name: Kiayias, A
  last_name: Kiayias
intvolume: '     12110'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2020/090
month: '04'
oa: 1
oa_version: Preprint
page: 220-246
place: Cham
publication: Public-Key Cryptography
publication_identifier:
  eissn:
  - 1611-3349
  isbn:
  - '9783030453732'
  - '9783030453749'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: LNCS
status: public
title: Witness maps and applications
type: book_chapter
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 12110
year: '2020'
...
---
_id: '10866'
abstract:
- lang: eng
  text: Recent discoveries have shown that, when two layers of van der Waals (vdW)
    materials are superimposed with a relative twist angle between them, the electronic
    properties of the coupled system can be dramatically altered. Here, we demonstrate
    that a similar concept can be extended to the optics realm, particularly to propagating
    phonon polaritons–hybrid light-matter interactions. To do this, we fabricate stacks
    composed of two twisted slabs of a vdW crystal (α-MoO3) supporting anisotropic
    phonon polaritons (PhPs), and image the propagation of the latter when launched
    by localized sources. Our images reveal that, under a critical angle, the PhPs
    isofrequency curve undergoes a topological transition, in which the propagation
    of PhPs is strongly guided (canalization regime) along predetermined directions
    without geometric spreading. These results demonstrate a new degree of freedom
    (twist angle) for controlling the propagation of polaritons at the nanoscale with
    potential for nanoimaging, (bio)-sensing, or heat management.
acknowledgement: "J.T.-G. and G.Á.-P. acknowledge support through the Severo Ochoa
  Program from the\r\nGovernment of the Principality of Asturias (nos. PA-18-PF-BP17-126
  and PA20-PF-BP19-053,\r\nrespectively). J. M-S acknowledges financial support through
  the Ramón y Cajal Program from\r\nthe Government of Spain (RYC2018-026196-I). A.Y.N.
  acknowledges the Spanish Ministry of\r\nScience, Innovation and Universities (national
  project no. MAT201788358-C3-3-R). P.A.-G.\r\nacknowledges support from the European
  Research Council under starting grant no. 715496,\r\n2DNANOPTICA."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Jiahua
  full_name: Duan, Jiahua
  last_name: Duan
- first_name: Nathaniel
  full_name: Capote-Robayna, Nathaniel
  last_name: Capote-Robayna
- first_name: Javier
  full_name: Taboada-Gutiérrez, Javier
  last_name: Taboada-Gutiérrez
- first_name: Gonzalo
  full_name: Álvarez-Pérez, Gonzalo
  last_name: Álvarez-Pérez
- first_name: Ivan
  full_name: Prieto Gonzalez, Ivan
  id: 2A307FE2-F248-11E8-B48F-1D18A9856A87
  last_name: Prieto Gonzalez
  orcid: 0000-0002-7370-5357
- first_name: Javier
  full_name: Martín-Sánchez, Javier
  last_name: Martín-Sánchez
- first_name: Alexey Y.
  full_name: Nikitin, Alexey Y.
  last_name: Nikitin
- first_name: Pablo
  full_name: Alonso-González, Pablo
  last_name: Alonso-González
citation:
  ama: 'Duan J, Capote-Robayna N, Taboada-Gutiérrez J, et al. Twisted nano-optics:
    Manipulating light at the nanoscale with twisted phonon polaritonic slabs. <i>Nano
    Letters</i>. 2020;20(7):5323-5329. doi:<a href="https://doi.org/10.1021/acs.nanolett.0c01673">10.1021/acs.nanolett.0c01673</a>'
  apa: 'Duan, J., Capote-Robayna, N., Taboada-Gutiérrez, J., Álvarez-Pérez, G., Prieto
    Gonzalez, I., Martín-Sánchez, J., … Alonso-González, P. (2020). Twisted nano-optics:
    Manipulating light at the nanoscale with twisted phonon polaritonic slabs. <i>Nano
    Letters</i>. American Chemical Society. <a href="https://doi.org/10.1021/acs.nanolett.0c01673">https://doi.org/10.1021/acs.nanolett.0c01673</a>'
  chicago: 'Duan, Jiahua, Nathaniel Capote-Robayna, Javier Taboada-Gutiérrez, Gonzalo
    Álvarez-Pérez, Ivan Prieto Gonzalez, Javier Martín-Sánchez, Alexey Y. Nikitin,
    and Pablo Alonso-González. “Twisted Nano-Optics: Manipulating Light at the Nanoscale
    with Twisted Phonon Polaritonic Slabs.” <i>Nano Letters</i>. American Chemical
    Society, 2020. <a href="https://doi.org/10.1021/acs.nanolett.0c01673">https://doi.org/10.1021/acs.nanolett.0c01673</a>.'
  ieee: 'J. Duan <i>et al.</i>, “Twisted nano-optics: Manipulating light at the nanoscale
    with twisted phonon polaritonic slabs,” <i>Nano Letters</i>, vol. 20, no. 7. American
    Chemical Society, pp. 5323–5329, 2020.'
  ista: 'Duan J, Capote-Robayna N, Taboada-Gutiérrez J, Álvarez-Pérez G, Prieto Gonzalez
    I, Martín-Sánchez J, Nikitin AY, Alonso-González P. 2020. Twisted nano-optics:
    Manipulating light at the nanoscale with twisted phonon polaritonic slabs. Nano
    Letters. 20(7), 5323–5329.'
  mla: 'Duan, Jiahua, et al. “Twisted Nano-Optics: Manipulating Light at the Nanoscale
    with Twisted Phonon Polaritonic Slabs.” <i>Nano Letters</i>, vol. 20, no. 7, American
    Chemical Society, 2020, pp. 5323–29, doi:<a href="https://doi.org/10.1021/acs.nanolett.0c01673">10.1021/acs.nanolett.0c01673</a>.'
  short: J. Duan, N. Capote-Robayna, J. Taboada-Gutiérrez, G. Álvarez-Pérez, I. Prieto
    Gonzalez, J. Martín-Sánchez, A.Y. Nikitin, P. Alonso-González, Nano Letters 20
    (2020) 5323–5329.
date_created: 2022-03-18T11:37:38Z
date_published: 2020-07-01T00:00:00Z
date_updated: 2023-09-05T12:05:58Z
day: '01'
department:
- _id: NanoFab
doi: 10.1021/acs.nanolett.0c01673
external_id:
  arxiv:
  - '2004.14599'
  isi:
  - '000548893200082'
  pmid:
  - '32530634'
intvolume: '        20'
isi: 1
issue: '7'
keyword:
- Mechanical Engineering
- Condensed Matter Physics
- General Materials Science
- General Chemistry
- Bioengineering
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/2004.14599
month: '07'
oa: 1
oa_version: Preprint
page: 5323-5329
pmid: 1
publication: Nano Letters
publication_identifier:
  eissn:
  - 1530-6992
  issn:
  - 1530-6984
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Twisted nano-optics: Manipulating light at the nanoscale with twisted phonon
  polaritonic slabs'
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 20
year: '2020'
...
---
_id: '10867'
abstract:
- lang: eng
  text: In this paper we find a tight estimate for Gromov’s waist of the balls in
    spaces of constant curvature, deduce the estimates for the balls in Riemannian
    manifolds with upper bounds on the curvature (CAT(ϰ)-spaces), and establish similar
    result for normed spaces.
acknowledgement: ' Supported by the Russian Foundation for Basic Research grant 18-01-00036.'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Arseniy
  full_name: Akopyan, Arseniy
  id: 430D2C90-F248-11E8-B48F-1D18A9856A87
  last_name: Akopyan
  orcid: 0000-0002-2548-617X
- first_name: Roman
  full_name: Karasev, Roman
  last_name: Karasev
citation:
  ama: Akopyan A, Karasev R. Waist of balls in hyperbolic and spherical spaces. <i>International
    Mathematics Research Notices</i>. 2020;2020(3):669-697. doi:<a href="https://doi.org/10.1093/imrn/rny037">10.1093/imrn/rny037</a>
  apa: Akopyan, A., &#38; Karasev, R. (2020). Waist of balls in hyperbolic and spherical
    spaces. <i>International Mathematics Research Notices</i>. Oxford University Press.
    <a href="https://doi.org/10.1093/imrn/rny037">https://doi.org/10.1093/imrn/rny037</a>
  chicago: Akopyan, Arseniy, and Roman Karasev. “Waist of Balls in Hyperbolic and
    Spherical Spaces.” <i>International Mathematics Research Notices</i>. Oxford University
    Press, 2020. <a href="https://doi.org/10.1093/imrn/rny037">https://doi.org/10.1093/imrn/rny037</a>.
  ieee: A. Akopyan and R. Karasev, “Waist of balls in hyperbolic and spherical spaces,”
    <i>International Mathematics Research Notices</i>, vol. 2020, no. 3. Oxford University
    Press, pp. 669–697, 2020.
  ista: Akopyan A, Karasev R. 2020. Waist of balls in hyperbolic and spherical spaces.
    International Mathematics Research Notices. 2020(3), 669–697.
  mla: Akopyan, Arseniy, and Roman Karasev. “Waist of Balls in Hyperbolic and Spherical
    Spaces.” <i>International Mathematics Research Notices</i>, vol. 2020, no. 3,
    Oxford University Press, 2020, pp. 669–97, doi:<a href="https://doi.org/10.1093/imrn/rny037">10.1093/imrn/rny037</a>.
  short: A. Akopyan, R. Karasev, International Mathematics Research Notices 2020 (2020)
    669–697.
date_created: 2022-03-18T11:39:30Z
date_published: 2020-02-01T00:00:00Z
date_updated: 2023-08-24T14:19:55Z
day: '01'
department:
- _id: HeEd
doi: 10.1093/imrn/rny037
external_id:
  arxiv:
  - '1702.07513'
  isi:
  - '000522852700002'
intvolume: '      2020'
isi: 1
issue: '3'
keyword:
- General Mathematics
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1702.07513
month: '02'
oa: 1
oa_version: Preprint
page: 669-697
publication: International Mathematics Research Notices
publication_identifier:
  eissn:
  - 1687-0247
  issn:
  - 1073-7928
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Waist of balls in hyperbolic and spherical spaces
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 2020
year: '2020'
...
---
_id: '12901'
article_processing_charge: No
author:
- first_name: Alois
  full_name: Schlögl, Alois
  id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
  last_name: Schlögl
  orcid: 0000-0002-5621-8100
- first_name: Janos
  full_name: Kiss, Janos
  id: 3D3A06F8-F248-11E8-B48F-1D18A9856A87
  last_name: Kiss
- first_name: Stefano
  full_name: Elefante, Stefano
  id: 490F40CE-F248-11E8-B48F-1D18A9856A87
  last_name: Elefante
citation:
  ama: 'Schlögl A, Kiss J, Elefante S. Is Debian suitable for running an HPC Cluster?
    In: <i>AHPC19 - Austrian HPC Meeting 2019 </i>. Institut für Mathematik und wissenschaftliches
    Rechnen der Universität Graz; 2019:25.'
  apa: 'Schlögl, A., Kiss, J., &#38; Elefante, S. (2019). Is Debian suitable for running
    an HPC Cluster? In <i>AHPC19 - Austrian HPC Meeting 2019 </i> (p. 25). Grundlsee,
    Austria: Institut für Mathematik und wissenschaftliches Rechnen der Universität
    Graz.'
  chicago: Schlögl, Alois, Janos Kiss, and Stefano Elefante. “Is Debian Suitable for
    Running an HPC Cluster?” In <i>AHPC19 - Austrian HPC Meeting 2019 </i>, 25. Institut
    für Mathematik und wissenschaftliches Rechnen der Universität Graz, 2019.
  ieee: A. Schlögl, J. Kiss, and S. Elefante, “Is Debian suitable for running an HPC
    Cluster?,” in <i>AHPC19 - Austrian HPC Meeting 2019 </i>, Grundlsee, Austria,
    2019, p. 25.
  ista: 'Schlögl A, Kiss J, Elefante S. 2019. Is Debian suitable for running an HPC
    Cluster? AHPC19 - Austrian HPC Meeting 2019 . AHPC: Austrian HPC Meeting, 25.'
  mla: Schlögl, Alois, et al. “Is Debian Suitable for Running an HPC Cluster?” <i>AHPC19
    - Austrian HPC Meeting 2019 </i>, Institut für Mathematik und wissenschaftliches
    Rechnen der Universität Graz, 2019, p. 25.
  short: A. Schlögl, J. Kiss, S. Elefante, in:, AHPC19 - Austrian HPC Meeting 2019
    , Institut für Mathematik und wissenschaftliches Rechnen der Universität Graz,
    2019, p. 25.
conference:
  end_date: 2019-02-27
  location: Grundlsee, Austria
  name: 'AHPC: Austrian HPC Meeting'
  start_date: 2019-02-25
date_created: 2023-05-05T12:48:48Z
date_published: 2019-02-27T00:00:00Z
date_updated: 2023-05-16T07:29:32Z
day: '27'
ddc:
- '000'
department:
- _id: ScienComp
file:
- access_level: open_access
  checksum: acc8272027faaf30709c51ac5c58ffa4
  content_type: application/pdf
  creator: dernst
  date_created: 2023-05-16T07:27:09Z
  date_updated: 2023-05-16T07:27:09Z
  file_id: '12970'
  file_name: 2019_AHPC_Schloegl.pdf
  file_size: 1097603
  relation: main_file
  success: 1
file_date_updated: 2023-05-16T07:27:09Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://vsc.ac.at/fileadmin/user_upload/vsc/conferences/ahpc19/BOOKLET_AHPC19.pdf
month: '02'
oa: 1
oa_version: Published Version
page: '25'
publication: 'AHPC19 - Austrian HPC Meeting 2019 '
publication_status: published
publisher: Institut für Mathematik und wissenschaftliches Rechnen der Universität
  Graz
status: public
title: Is Debian suitable for running an HPC Cluster?
type: conference_abstract
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '13067'
abstract:
- lang: eng
  text: Genetic incompatibilities contribute to reproductive isolation between many
    diverging populations, but it is still unclear to what extent they play a role
    if divergence happens with gene flow. In contact zones between the "Crab" and
    "Wave" ecotypes of the snail Littorina saxatilis divergent selection forms strong
    barriers to gene flow, while the role of postzygotic barriers due to selection
    against hybrids remains unclear. High embryo abortion rates in this species could
    indicate the presence of such barriers. Postzygotic barriers might include genetic
    incompatibilities (e.g. Dobzhansky-Muller incompatibilities) but also maladaptation,
    both expected to be most pronounced in contact zones. In addition, embryo abortion
    might reflect physiological stress on females and embryos independent of any genetic
    stress. We examined all embryos of &gt;500 females sampled outside and inside
    contact zones of three populations in Sweden. Females' clutch size ranged from
    0 to 1011 embryos (mean 130±123) and abortion rates varied between 0 and100% (mean
    12%). We described female genotypes by using a hybrid index based on hundreds
    of SNPs differentiated between ecotypes with which we characterised female genotypes.
    We also calculated female SNP heterozygosity and inversion karyotype. Clutch size
    did not vary with female hybrid index and abortion rates were only weakly related
    to hybrid index in two sites but not at all in a third site. No additional variation
    in abortion rate was explained by female SNP heterozygosity, but increased female
    inversion heterozygosity added slightly to increased abortion. Our results show
    only weak and probably biologically insignificant postzygotic barriers contributing
    to ecotype divergence and the high and variable abortion rates were marginally,
    if at all, explained by hybrid index of females.
article_processing_charge: No
author:
- first_name: Kerstin
  full_name: Johannesson, Kerstin
  last_name: Johannesson
- first_name: Zuzanna
  full_name: Zagrodzka, Zuzanna
  last_name: Zagrodzka
- first_name: Rui
  full_name: Faria, Rui
  last_name: Faria
- first_name: Anja M
  full_name: Westram, Anja M
  id: 3C147470-F248-11E8-B48F-1D18A9856A87
  last_name: Westram
  orcid: 0000-0003-1050-4969
- first_name: Roger
  full_name: Butlin, Roger
  last_name: Butlin
citation:
  ama: 'Johannesson K, Zagrodzka Z, Faria R, Westram AM, Butlin R. Data from: Is embryo
    abortion a postzygotic barrier to gene flow between Littorina ecotypes? 2019.
    doi:<a href="https://doi.org/10.5061/DRYAD.TB2RBNZWK">10.5061/DRYAD.TB2RBNZWK</a>'
  apa: 'Johannesson, K., Zagrodzka, Z., Faria, R., Westram, A. M., &#38; Butlin, R.
    (2019). Data from: Is embryo abortion a postzygotic barrier to gene flow between
    Littorina ecotypes? Dryad. <a href="https://doi.org/10.5061/DRYAD.TB2RBNZWK">https://doi.org/10.5061/DRYAD.TB2RBNZWK</a>'
  chicago: 'Johannesson, Kerstin, Zuzanna Zagrodzka, Rui Faria, Anja M Westram, and
    Roger Butlin. “Data from: Is Embryo Abortion a Postzygotic Barrier to Gene Flow
    between Littorina Ecotypes?” Dryad, 2019. <a href="https://doi.org/10.5061/DRYAD.TB2RBNZWK">https://doi.org/10.5061/DRYAD.TB2RBNZWK</a>.'
  ieee: 'K. Johannesson, Z. Zagrodzka, R. Faria, A. M. Westram, and R. Butlin, “Data
    from: Is embryo abortion a postzygotic barrier to gene flow between Littorina
    ecotypes?” Dryad, 2019.'
  ista: 'Johannesson K, Zagrodzka Z, Faria R, Westram AM, Butlin R. 2019. Data from:
    Is embryo abortion a postzygotic barrier to gene flow between Littorina ecotypes?,
    Dryad, <a href="https://doi.org/10.5061/DRYAD.TB2RBNZWK">10.5061/DRYAD.TB2RBNZWK</a>.'
  mla: 'Johannesson, Kerstin, et al. <i>Data from: Is Embryo Abortion a Postzygotic
    Barrier to Gene Flow between Littorina Ecotypes?</i> Dryad, 2019, doi:<a href="https://doi.org/10.5061/DRYAD.TB2RBNZWK">10.5061/DRYAD.TB2RBNZWK</a>.'
  short: K. Johannesson, Z. Zagrodzka, R. Faria, A.M. Westram, R. Butlin, (2019).
date_created: 2023-05-23T16:36:27Z
date_published: 2019-12-02T00:00:00Z
date_updated: 2023-09-06T14:48:57Z
day: '02'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.5061/DRYAD.TB2RBNZWK
license: https://creativecommons.org/publicdomain/zero/1.0/
main_file_link:
- open_access: '1'
  url: https://doi.org/10.5061/dryad.tb2rbnzwk
month: '12'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
  record:
  - id: '7205'
    relation: used_in_publication
    status: public
status: public
title: 'Data from: Is embryo abortion a postzygotic barrier to gene flow between Littorina
  ecotypes?'
tmp:
  image: /images/cc_0.png
  legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
  name: Creative Commons Public Domain Dedication (CC0 1.0)
  short: CC0 (1.0)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '8281'
abstract:
- lang: eng
  text: We review the history of population genetics, starting with its origins a
    century ago from the synthesis between Mendel and Darwin's ideas, through to the
    recent development of sophisticated schemes of inference from sequence data, based
    on the coalescent. We explain the close relation between the coalescent and a
    diffusion process, which we illustrate by their application to understand spatial
    structure. We summarise the powerful methods available for analysis of multiple
    loci, when linkage equilibrium can be assumed, and then discuss approaches to
    the more challenging case, where associations between alleles require that we
    follow genotype, rather than allele, frequencies. Though we can hardly cover the
    whole of population genetics, we give an overview of the current state of the
    subject, and future challenges to it.
article_processing_charge: No
author:
- first_name: Nicholas H
  full_name: Barton, Nicholas H
  id: 4880FE40-F248-11E8-B48F-1D18A9856A87
  last_name: Barton
  orcid: 0000-0002-8548-5240
- first_name: Alison
  full_name: Etheridge, Alison
  last_name: Etheridge
citation:
  ama: 'Barton NH, Etheridge A. Mathematical models in population genetics. In: Balding
    D, Moltke I, Marioni J, eds. <i>Handbook of Statistical Genomics</i>. 4th ed.
    Wiley; 2019:115-144. doi:<a href="https://doi.org/10.1002/9781119487845.ch4">10.1002/9781119487845.ch4</a>'
  apa: Barton, N. H., &#38; Etheridge, A. (2019). Mathematical models in population
    genetics. In D. Balding, I. Moltke, &#38; J. Marioni (Eds.), <i>Handbook of statistical
    genomics</i> (4th ed., pp. 115–144). Wiley. <a href="https://doi.org/10.1002/9781119487845.ch4">https://doi.org/10.1002/9781119487845.ch4</a>
  chicago: Barton, Nicholas H, and Alison Etheridge. “Mathematical Models in Population
    Genetics.” In <i>Handbook of Statistical Genomics</i>, edited by David Balding,
    Ida Moltke, and John Marioni, 4th ed., 115–44. Wiley, 2019. <a href="https://doi.org/10.1002/9781119487845.ch4">https://doi.org/10.1002/9781119487845.ch4</a>.
  ieee: N. H. Barton and A. Etheridge, “Mathematical models in population genetics,”
    in <i>Handbook of statistical genomics</i>, 4th ed., D. Balding, I. Moltke, and
    J. Marioni, Eds. Wiley, 2019, pp. 115–144.
  ista: 'Barton NH, Etheridge A. 2019.Mathematical models in population genetics.
    In: Handbook of statistical genomics. , 115–144.'
  mla: Barton, Nicholas H., and Alison Etheridge. “Mathematical Models in Population
    Genetics.” <i>Handbook of Statistical Genomics</i>, edited by David Balding et
    al., 4th ed., Wiley, 2019, pp. 115–44, doi:<a href="https://doi.org/10.1002/9781119487845.ch4">10.1002/9781119487845.ch4</a>.
  short: N.H. Barton, A. Etheridge, in:, D. Balding, I. Moltke, J. Marioni (Eds.),
    Handbook of Statistical Genomics, 4th ed., Wiley, 2019, pp. 115–144.
date_created: 2020-08-21T04:25:39Z
date_published: 2019-07-29T00:00:00Z
date_updated: 2023-09-08T11:24:15Z
day: '29'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.1002/9781119487845.ch4
edition: '4'
editor:
- first_name: David
  full_name: Balding, David
  last_name: Balding
- first_name: Ida
  full_name: Moltke, Ida
  last_name: Moltke
- first_name: John
  full_name: Marioni, John
  last_name: Marioni
external_id:
  isi:
  - '000261343000003'
isi: 1
language:
- iso: eng
month: '07'
oa_version: None
page: 115-144
publication: Handbook of statistical genomics
publication_identifier:
  isbn:
  - '9781119429142'
publication_status: published
publisher: Wiley
quality_controlled: '1'
status: public
title: Mathematical models in population genetics
type: book_chapter
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '8305'
abstract:
- lang: eng
  text: In this paper, we present the first fully asynchronous distributed key generation
    (ADKG) algorithm as well as the first distributed key generation algorithm that
    can create keys with a dual (f,2f+1)−threshold that are necessary for scalable
    consensus (which so far needs a trusted dealer assumption). In order to create
    a DKG with a dual (f,2f+1)− threshold we first answer in the affirmative the open
    question posed by Cachin et al. how to create an AVSS protocol with recovery thresholds
    f+1<k≤2f+1, which is of independent interest. Our High-threshold-AVSS (HAVSS)
    uses an asymmetric bi-variate polynomial, where the secret shared is hidden from
    any set of k nodes but an honest node that did not participate in the sharing
    phase can still recover his share with only n−2f shares, hence be able to contribute
    in the secret reconstruction. Another building block for ADKG is a novel Eventually
    Perfect Common Coin (EPCC) abstraction and protocol that enables the participants
    to create a common coin that might fail to agree at most f+1 times (even if invoked
    a polynomial number of times). Using EPCC we implement an Eventually Efficient
    Asynchronous Binary Agreement (EEABA) in which each instance takes O(n2) bits
    and O(1) rounds in expectation, except for at most f+1 instances which may take
    O(n4) bits and O(n) rounds in total. Using EEABA we construct the first fully
    Asynchronous Distributed Key Generation (ADKG) which has the same overhead and
    expected runtime as the best partially-synchronous DKG (O(n4) words, O(n) rounds).
    As a corollary of our ADKG we can also create the first Validated Asynchronous
    Byzantine Agreement (VABA) in the authenticated setting that does not need a trusted
    dealer to setup threshold signatures of degree n−f. Our VABA has an overhead of
    expected O(n2) words and O(1) time per instance after an initial O(n4) words and
    O(n) time bootstrap via ADKG.
article_number: 2019/1015
article_processing_charge: No
author:
- first_name: Eleftherios
  full_name: KOKORIS KOGIAS, Eleftherios
  id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
  last_name: KOKORIS KOGIAS
- first_name: Alexander
  full_name: Spiegelman, Alexander
  last_name: Spiegelman
- first_name: Dahlia
  full_name: Malkhi, Dahlia
  last_name: Malkhi
- first_name: Ittai
  full_name: Abraham, Ittai
  last_name: Abraham
citation:
  ama: 'Kokoris Kogias E, Spiegelman A, Malkhi D, Abraham I. Bootstrapping consensus
    without trusted setup: fully asynchronous distributed key generation. <i>Cryptology
    ePrint Archive</i>.'
  apa: 'Kokoris Kogias, E., Spiegelman, A., Malkhi, D., &#38; Abraham, I. (n.d.).
    Bootstrapping consensus without trusted setup: fully asynchronous distributed
    key generation. <i>Cryptology ePrint Archive</i>.'
  chicago: 'Kokoris Kogias, Eleftherios, Alexander Spiegelman, Dahlia Malkhi, and
    Ittai Abraham. “Bootstrapping Consensus without Trusted Setup: Fully Asynchronous
    Distributed Key Generation.” <i>Cryptology EPrint Archive</i>, n.d.'
  ieee: 'E. Kokoris Kogias, A. Spiegelman, D. Malkhi, and I. Abraham, “Bootstrapping
    consensus without trusted setup: fully asynchronous distributed key generation,”
    <i>Cryptology ePrint Archive</i>. .'
  ista: 'Kokoris Kogias E, Spiegelman A, Malkhi D, Abraham I. Bootstrapping consensus
    without trusted setup: fully asynchronous distributed key generation. Cryptology
    ePrint Archive, 2019/1015.'
  mla: 'Kokoris Kogias, Eleftherios, et al. “Bootstrapping Consensus without Trusted
    Setup: Fully Asynchronous Distributed Key Generation.” <i>Cryptology EPrint Archive</i>,
    2019/1015.'
  short: E. Kokoris Kogias, A. Spiegelman, D. Malkhi, I. Abraham, Cryptology EPrint
    Archive (n.d.).
date_created: 2020-08-26T12:18:00Z
date_published: 2019-09-10T00:00:00Z
date_updated: 2023-05-10T09:27:54Z
day: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2019/1015
month: '09'
oa: 1
oa_version: Preprint
publication: Cryptology ePrint Archive
publication_status: submitted
status: public
title: 'Bootstrapping consensus without trusted setup: fully asynchronous distributed
  key generation'
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2019'
...
---
_id: '8570'
abstract:
- lang: eng
  text: 'This report presents the results of a friendly competition for formal verification
    of continuous and hybrid systems with linear continuous dynamics. The friendly
    competition took place as part of the workshop Applied Verification for Continuous
    and Hybrid Systems (ARCH) in 2019. In its third edition, seven tools have been
    applied to solve six different benchmark problems in the category for linear continuous
    dynamics (in alphabetical order): CORA, CORA/SX, HyDRA, Hylaa, JuliaReach, SpaceEx,
    and XSpeed. This report is a snapshot of the current landscape of tools and the
    types of benchmarks they are particularly suited for. Due to the diversity of
    problems, we are not ranking tools, yet the presented results provide one of the
    most complete assessments of tools for the safety verification of continuous and
    hybrid systems with linear continuous dynamics up to this date.</jats:p>'
article_processing_charge: No
author:
- first_name: Matthias
  full_name: Althoff, Matthias
  last_name: Althoff
- first_name: Stanley
  full_name: Bak, Stanley
  last_name: Bak
- first_name: Marcelo
  full_name: Forets, Marcelo
  last_name: Forets
- first_name: Goran
  full_name: Frehse, Goran
  last_name: Frehse
- first_name: Niklas
  full_name: Kochdumper, Niklas
  last_name: Kochdumper
- first_name: Rajarshi
  full_name: Ray, Rajarshi
  last_name: Ray
- first_name: Christian
  full_name: Schilling, Christian
  id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87
  last_name: Schilling
  orcid: 0000-0003-3658-1065
- first_name: Stefan
  full_name: Schupp, Stefan
  last_name: Schupp
citation:
  ama: 'Althoff M, Bak S, Forets M, et al. ARCH-COMP19 Category Report: Continuous
    and hybrid systems with linear continuous dynamics. In: <i>EPiC Series in Computing</i>.
    Vol 61. EasyChair; 2019:14-40. doi:<a href="https://doi.org/10.29007/bj1w">10.29007/bj1w</a>'
  apa: 'Althoff, M., Bak, S., Forets, M., Frehse, G., Kochdumper, N., Ray, R., … Schupp,
    S. (2019). ARCH-COMP19 Category Report: Continuous and hybrid systems with linear
    continuous dynamics. In <i>EPiC Series in Computing</i> (Vol. 61, pp. 14–40).
    Montreal, Canada: EasyChair. <a href="https://doi.org/10.29007/bj1w">https://doi.org/10.29007/bj1w</a>'
  chicago: 'Althoff, Matthias, Stanley Bak, Marcelo Forets, Goran Frehse, Niklas Kochdumper,
    Rajarshi Ray, Christian Schilling, and Stefan Schupp. “ARCH-COMP19 Category Report:
    Continuous and Hybrid Systems with Linear Continuous Dynamics.” In <i>EPiC Series
    in Computing</i>, 61:14–40. EasyChair, 2019. <a href="https://doi.org/10.29007/bj1w">https://doi.org/10.29007/bj1w</a>.'
  ieee: 'M. Althoff <i>et al.</i>, “ARCH-COMP19 Category Report: Continuous and hybrid
    systems with linear continuous dynamics,” in <i>EPiC Series in Computing</i>,
    Montreal, Canada, 2019, vol. 61, pp. 14–40.'
  ista: 'Althoff M, Bak S, Forets M, Frehse G, Kochdumper N, Ray R, Schilling C, Schupp
    S. 2019. ARCH-COMP19 Category Report: Continuous and hybrid systems with linear
    continuous dynamics. EPiC Series in Computing. ARCH: International Workshop on
    Applied Verification on Continuous and Hybrid Systems vol. 61, 14–40.'
  mla: 'Althoff, Matthias, et al. “ARCH-COMP19 Category Report: Continuous and Hybrid
    Systems with Linear Continuous Dynamics.” <i>EPiC Series in Computing</i>, vol.
    61, EasyChair, 2019, pp. 14–40, doi:<a href="https://doi.org/10.29007/bj1w">10.29007/bj1w</a>.'
  short: M. Althoff, S. Bak, M. Forets, G. Frehse, N. Kochdumper, R. Ray, C. Schilling,
    S. Schupp, in:, EPiC Series in Computing, EasyChair, 2019, pp. 14–40.
conference:
  end_date: 2019-04-15
  location: Montreal, Canada
  name: 'ARCH: International Workshop on Applied Verification on Continuous and Hybrid
    Systems'
  start_date: 2019-04-15
date_created: 2020-09-26T14:23:54Z
date_published: 2019-05-25T00:00:00Z
date_updated: 2021-01-12T08:20:05Z
day: '25'
department:
- _id: ToHe
doi: 10.29007/bj1w
intvolume: '        61'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://easychair.org/publications/open/1gbP
month: '05'
oa: 1
oa_version: Published Version
page: 14-40
publication: EPiC Series in Computing
publication_identifier:
  eissn:
  - '23987340'
publication_status: published
publisher: EasyChair
quality_controlled: '1'
status: public
title: 'ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous
  dynamics'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 61
year: '2019'
...
---
_id: '9261'
abstract:
- lang: eng
  text: 'Bending-active structures are able to efficiently produce complex curved
    shapes starting from flat panels. The desired deformation of the panels derives
    from the proper selection of their elastic properties. Optimized panels, called
    FlexMaps, are designed such that, once they are bent and assembled, the resulting
    static equilibrium configuration matches a desired input 3D shape. The FlexMaps
    elastic properties are controlled by locally varying spiraling geometric mesostructures,
    which are optimized in size and shape to match the global curvature (i.e., bending
    requests) of the target shape. The design pipeline starts from a quad mesh representing
    the input 3D shape, which defines the edge size and the total amount of spirals:
    every quad will embed one spiral. Then, an optimization algorithm tunes the geometry
    of the spirals by using a simplified pre-computed rod model. This rod model is
    derived from a non-linear regression algorithm which approximates the non-linear
    behavior of solid FEM spiral models subject to hundreds of load combinations.
    This innovative pipeline has been applied to the project of a lightweight plywood
    pavilion named FlexMaps Pavilion, which is a single-layer piecewise twisted arc
    that fits a bounding box of 3.90x3.96x3.25 meters.'
article_processing_charge: No
author:
- first_name: Francesco
  full_name: Laccone, Francesco
  last_name: Laccone
- first_name: Luigi
  full_name: Malomo, Luigi
  last_name: Malomo
- first_name: Jesus
  full_name: Perez Rodriguez, Jesus
  id: 2DC83906-F248-11E8-B48F-1D18A9856A87
  last_name: Perez Rodriguez
- first_name: Nico
  full_name: Pietroni, Nico
  last_name: Pietroni
- first_name: Federico
  full_name: Ponchio, Federico
  last_name: Ponchio
- first_name: Bernd
  full_name: Bickel, Bernd
  id: 49876194-F248-11E8-B48F-1D18A9856A87
  last_name: Bickel
  orcid: 0000-0001-6511-9385
- first_name: Paolo
  full_name: Cignoni, Paolo
  last_name: Cignoni
citation:
  ama: 'Laccone F, Malomo L, Perez Rodriguez J, et al. FlexMaps Pavilion: A twisted
    arc made of mesostructured flat flexible panels. In: <i>IASS Symposium 2019 -
    60th Anniversary Symposium of the International Association for Shell and Spatial
    Structures; Structural Membranes 2019 - 9th International Conference on Textile
    Composites and Inflatable Structures, FORM and FORCE</i>. International Center
    for Numerical Methods in Engineering; 2019:509-515.'
  apa: 'Laccone, F., Malomo, L., Perez Rodriguez, J., Pietroni, N., Ponchio, F., Bickel,
    B., &#38; Cignoni, P. (2019). FlexMaps Pavilion: A twisted arc made of mesostructured
    flat flexible panels. In <i>IASS Symposium 2019 - 60th Anniversary Symposium of
    the International Association for Shell and Spatial Structures; Structural Membranes
    2019 - 9th International Conference on Textile Composites and Inflatable Structures,
    FORM and FORCE</i> (pp. 509–515). Barcelona, Spain: International Center for Numerical
    Methods in Engineering.'
  chicago: 'Laccone, Francesco, Luigi Malomo, Jesus Perez Rodriguez, Nico Pietroni,
    Federico Ponchio, Bernd Bickel, and Paolo Cignoni. “FlexMaps Pavilion: A Twisted
    Arc Made of Mesostructured Flat Flexible Panels.” In <i>IASS Symposium 2019 -
    60th Anniversary Symposium of the International Association for Shell and Spatial
    Structures; Structural Membranes 2019 - 9th International Conference on Textile
    Composites and Inflatable Structures, FORM and FORCE</i>, 509–15. International
    Center for Numerical Methods in Engineering, 2019.'
  ieee: 'F. Laccone <i>et al.</i>, “FlexMaps Pavilion: A twisted arc made of mesostructured
    flat flexible panels,” in <i>IASS Symposium 2019 - 60th Anniversary Symposium
    of the International Association for Shell and Spatial Structures; Structural
    Membranes 2019 - 9th International Conference on Textile Composites and Inflatable
    Structures, FORM and FORCE</i>, Barcelona, Spain, 2019, pp. 509–515.'
  ista: 'Laccone F, Malomo L, Perez Rodriguez J, Pietroni N, Ponchio F, Bickel B,
    Cignoni P. 2019. FlexMaps Pavilion: A twisted arc made of mesostructured flat
    flexible panels. IASS Symposium 2019 - 60th Anniversary Symposium of the International
    Association for Shell and Spatial Structures; Structural Membranes 2019 - 9th
    International Conference on Textile Composites and Inflatable Structures, FORM
    and FORCE. IASS: International Association for Shell and Spatial Structures, 509–515.'
  mla: 'Laccone, Francesco, et al. “FlexMaps Pavilion: A Twisted Arc Made of Mesostructured
    Flat Flexible Panels.” <i>IASS Symposium 2019 - 60th Anniversary Symposium of
    the International Association for Shell and Spatial Structures; Structural Membranes
    2019 - 9th International Conference on Textile Composites and Inflatable Structures,
    FORM and FORCE</i>, International Center for Numerical Methods in Engineering,
    2019, pp. 509–15.'
  short: F. Laccone, L. Malomo, J. Perez Rodriguez, N. Pietroni, F. Ponchio, B. Bickel,
    P. Cignoni, in:, IASS Symposium 2019 - 60th Anniversary Symposium of the International
    Association for Shell and Spatial Structures; Structural Membranes 2019 - 9th
    International Conference on Textile Composites and Inflatable Structures, FORM
    and FORCE, International Center for Numerical Methods in Engineering, 2019, pp.
    509–515.
conference:
  end_date: 2019-10-10
  location: Barcelona, Spain
  name: 'IASS: International Association for Shell and Spatial Structures'
  start_date: 2019-10-07
date_created: 2021-03-21T23:01:21Z
date_published: 2019-10-10T00:00:00Z
date_updated: 2023-09-08T11:21:54Z
day: '10'
department:
- _id: BeBi
external_id:
  isi:
  - '000563497600059'
isi: 1
language:
- iso: eng
month: '10'
oa_version: None
page: 509-515
publication: IASS Symposium 2019 - 60th Anniversary Symposium of the International
  Association for Shell and Spatial Structures; Structural Membranes 2019 - 9th International
  Conference on Textile Composites and Inflatable Structures, FORM and FORCE
publication_identifier:
  isbn:
  - '9788412110104'
  issn:
  - 2518-6582
publication_status: published
publisher: International Center for Numerical Methods in Engineering
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'FlexMaps Pavilion: A twisted arc made of mesostructured flat flexible panels'
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '6919'
article_number: eaaw6490
article_processing_charge: No
author:
- first_name: Chao
  full_name: Qi, Chao
  last_name: Qi
- first_name: Giulio Di
  full_name: Minin, Giulio Di
  last_name: Minin
- first_name: Irene
  full_name: Vercellino, Irene
  id: 3ED6AF16-F248-11E8-B48F-1D18A9856A87
  last_name: Vercellino
  orcid: 0000-0001-5618-3449
- first_name: Anton
  full_name: Wutz, Anton
  last_name: Wutz
- first_name: Volodymyr M.
  full_name: Korkhov, Volodymyr M.
  last_name: Korkhov
citation:
  ama: Qi C, Minin GD, Vercellino I, Wutz A, Korkhov VM. Structural basis of sterol
    recognition by human hedgehog receptor PTCH1. <i>Science Advances</i>. 2019;5(9).
    doi:<a href="https://doi.org/10.1126/sciadv.aaw6490">10.1126/sciadv.aaw6490</a>
  apa: Qi, C., Minin, G. D., Vercellino, I., Wutz, A., &#38; Korkhov, V. M. (2019).
    Structural basis of sterol recognition by human hedgehog receptor PTCH1. <i>Science
    Advances</i>. American Association for the Advancement of Science. <a href="https://doi.org/10.1126/sciadv.aaw6490">https://doi.org/10.1126/sciadv.aaw6490</a>
  chicago: Qi, Chao, Giulio Di Minin, Irene Vercellino, Anton Wutz, and Volodymyr
    M. Korkhov. “Structural Basis of Sterol Recognition by Human Hedgehog Receptor
    PTCH1.” <i>Science Advances</i>. American Association for the Advancement of Science,
    2019. <a href="https://doi.org/10.1126/sciadv.aaw6490">https://doi.org/10.1126/sciadv.aaw6490</a>.
  ieee: C. Qi, G. D. Minin, I. Vercellino, A. Wutz, and V. M. Korkhov, “Structural
    basis of sterol recognition by human hedgehog receptor PTCH1,” <i>Science Advances</i>,
    vol. 5, no. 9. American Association for the Advancement of Science, 2019.
  ista: Qi C, Minin GD, Vercellino I, Wutz A, Korkhov VM. 2019. Structural basis of
    sterol recognition by human hedgehog receptor PTCH1. Science Advances. 5(9), eaaw6490.
  mla: Qi, Chao, et al. “Structural Basis of Sterol Recognition by Human Hedgehog
    Receptor PTCH1.” <i>Science Advances</i>, vol. 5, no. 9, eaaw6490, American Association
    for the Advancement of Science, 2019, doi:<a href="https://doi.org/10.1126/sciadv.aaw6490">10.1126/sciadv.aaw6490</a>.
  short: C. Qi, G.D. Minin, I. Vercellino, A. Wutz, V.M. Korkhov, Science Advances
    5 (2019).
date_created: 2019-09-29T22:00:45Z
date_published: 2019-09-18T00:00:00Z
date_updated: 2023-08-30T06:55:31Z
day: '18'
ddc:
- '570'
department:
- _id: LeSa
doi: 10.1126/sciadv.aaw6490
external_id:
  isi:
  - '000491128800062'
file:
- access_level: open_access
  checksum: b2256c9117655bc15f621ba0babf219f
  content_type: application/pdf
  creator: kschuh
  date_created: 2019-10-02T11:13:54Z
  date_updated: 2020-07-14T12:47:44Z
  file_id: '6928'
  file_name: 2019_AAAS_Qi.pdf
  file_size: 1236101
  relation: main_file
file_date_updated: 2020-07-14T12:47:44Z
has_accepted_license: '1'
intvolume: '         5'
isi: 1
issue: '9'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '09'
oa: 1
oa_version: Published Version
publication: Science Advances
publication_identifier:
  eissn:
  - '23752548'
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: Structural basis of sterol recognition by human hedgehog receptor PTCH1
tmp:
  image: /images/cc_by_nc.png
  legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
  short: CC BY-NC (4.0)
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 5
year: '2019'
...
---
_id: '6920'
article_processing_charge: No
article_type: original
author:
- first_name: Christina
  full_name: Artner, Christina
  id: 45DF286A-F248-11E8-B48F-1D18A9856A87
  last_name: Artner
- first_name: Eva
  full_name: Benková, Eva
  id: 38F4F166-F248-11E8-B48F-1D18A9856A87
  last_name: Benková
  orcid: 0000-0002-8510-9739
citation:
  ama: Artner C, Benková E. Ethylene and cytokinin - partners in root growth regulation.
    <i>Molecular Plant</i>. 2019;12(10):1312-1314. doi:<a href="https://doi.org/10.1016/j.molp.2019.09.003">10.1016/j.molp.2019.09.003</a>
  apa: Artner, C., &#38; Benková, E. (2019). Ethylene and cytokinin - partners in
    root growth regulation. <i>Molecular Plant</i>. Cell Press. <a href="https://doi.org/10.1016/j.molp.2019.09.003">https://doi.org/10.1016/j.molp.2019.09.003</a>
  chicago: Artner, Christina, and Eva Benková. “Ethylene and Cytokinin - Partners
    in Root Growth Regulation.” <i>Molecular Plant</i>. Cell Press, 2019. <a href="https://doi.org/10.1016/j.molp.2019.09.003">https://doi.org/10.1016/j.molp.2019.09.003</a>.
  ieee: C. Artner and E. Benková, “Ethylene and cytokinin - partners in root growth
    regulation,” <i>Molecular Plant</i>, vol. 12, no. 10. Cell Press, pp. 1312–1314,
    2019.
  ista: Artner C, Benková E. 2019. Ethylene and cytokinin - partners in root growth
    regulation. Molecular Plant. 12(10), 1312–1314.
  mla: Artner, Christina, and Eva Benková. “Ethylene and Cytokinin - Partners in Root
    Growth Regulation.” <i>Molecular Plant</i>, vol. 12, no. 10, Cell Press, 2019,
    pp. 1312–14, doi:<a href="https://doi.org/10.1016/j.molp.2019.09.003">10.1016/j.molp.2019.09.003</a>.
  short: C. Artner, E. Benková, Molecular Plant 12 (2019) 1312–1314.
date_created: 2019-09-30T10:00:40Z
date_published: 2019-10-07T00:00:00Z
date_updated: 2023-08-30T06:55:02Z
day: '07'
department:
- _id: EvBe
doi: 10.1016/j.molp.2019.09.003
external_id:
  isi:
  - '000489132500002'
  pmid:
  - '31541740'
intvolume: '        12'
isi: 1
issue: '10'
language:
- iso: eng
month: '10'
oa_version: None
page: 1312-1314
pmid: 1
project:
- _id: 2685A872-B435-11E9-9278-68D0E5697425
  name: Hormonal regulation of plant adaptive responses to environmental signals
publication: Molecular Plant
publication_identifier:
  issn:
  - 1674-2052
  - 1752-9867
publication_status: published
publisher: Cell Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Ethylene and cytokinin - partners in root growth regulation
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 12
year: '2019'
...
---
_id: '6931'
abstract:
- lang: eng
  text: "Consider a distributed system with n processors out of which f can be Byzantine
    faulty. In the\r\napproximate agreement task, each processor i receives an input
    value xi and has to decide on an\r\noutput value yi such that\r\n1. the output
    values are in the convex hull of the non-faulty processors’ input values,\r\n2.
    the output values are within distance d of each other.\r\n\r\n\r\nClassically,
    the values are assumed to be from an m-dimensional Euclidean space, where m ≥
    1.\r\nIn this work, we study the task in a discrete setting, where input values
    with some structure\r\nexpressible as a graph. Namely, the input values are vertices
    of a finite graph G and the goal is to\r\noutput vertices that are within distance
    d of each other in G, but still remain in the graph-induced\r\nconvex hull of
    the input values. For d = 0, the task reduces to consensus and cannot be solved
    with\r\na deterministic algorithm in an asynchronous system even with a single
    crash fault. For any d ≥ 1,\r\nwe show that the task is solvable in asynchronous
    systems when G is chordal and n > (ω + 1)f,\r\nwhere ω is the clique number of
    G. In addition, we give the first Byzantine-tolerant algorithm for a\r\nvariant
    of lattice agreement. For synchronous systems, we show tight resilience bounds
    for the exact\r\nvariants of these and related tasks over a large class of combinatorial
    structures."
alternative_title:
- LIPIcs
article_processing_charge: No
arxiv: 1
author:
- first_name: Thomas
  full_name: Nowak, Thomas
  last_name: Nowak
- first_name: Joel
  full_name: Rybicki, Joel
  id: 334EFD2E-F248-11E8-B48F-1D18A9856A87
  last_name: Rybicki
  orcid: 0000-0002-6432-6646
citation:
  ama: 'Nowak T, Rybicki J. Byzantine approximate agreement on graphs. In: <i>33rd
    International Symposium on Distributed Computing</i>. Vol 146. Schloss Dagstuhl
    - Leibniz-Zentrum für Informatik; 2019:29:1--29:17. doi:<a href="https://doi.org/10.4230/LIPICS.DISC.2019.29">10.4230/LIPICS.DISC.2019.29</a>'
  apa: 'Nowak, T., &#38; Rybicki, J. (2019). Byzantine approximate agreement on graphs.
    In <i>33rd International Symposium on Distributed Computing</i> (Vol. 146, p.
    29:1--29:17). Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
    <a href="https://doi.org/10.4230/LIPICS.DISC.2019.29">https://doi.org/10.4230/LIPICS.DISC.2019.29</a>'
  chicago: Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.”
    In <i>33rd International Symposium on Distributed Computing</i>, 146:29:1--29:17.
    Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. <a href="https://doi.org/10.4230/LIPICS.DISC.2019.29">https://doi.org/10.4230/LIPICS.DISC.2019.29</a>.
  ieee: T. Nowak and J. Rybicki, “Byzantine approximate agreement on graphs,” in <i>33rd
    International Symposium on Distributed Computing</i>, Budapest, Hungary, 2019,
    vol. 146, p. 29:1--29:17.
  ista: 'Nowak T, Rybicki J. 2019. Byzantine approximate agreement on graphs. 33rd
    International Symposium on Distributed Computing. DISC: International Symposium
    on Distributed Computing, LIPIcs, vol. 146, 29:1--29:17.'
  mla: Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.”
    <i>33rd International Symposium on Distributed Computing</i>, vol. 146, Schloss
    Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17, doi:<a href="https://doi.org/10.4230/LIPICS.DISC.2019.29">10.4230/LIPICS.DISC.2019.29</a>.
  short: T. Nowak, J. Rybicki, in:, 33rd International Symposium on Distributed Computing,
    Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17.
conference:
  end_date: 2019-10-18
  location: Budapest, Hungary
  name: 'DISC: International Symposium on Distributed Computing'
  start_date: 2019-10-14
date_created: 2019-10-08T12:41:38Z
date_published: 2019-01-01T00:00:00Z
date_updated: 2021-01-12T08:09:38Z
ddc:
- '004'
department:
- _id: DaAl
doi: 10.4230/LIPICS.DISC.2019.29
ec_funded: 1
external_id:
  arxiv:
  - '1908.02743'
file:
- access_level: open_access
  checksum: 2d2202f90c6ac991e50876451627c4b5
  content_type: application/pdf
  creator: jrybicki
  date_created: 2019-10-08T12:47:19Z
  date_updated: 2020-07-14T12:47:44Z
  file_id: '6934'
  file_name: LIPIcs-DISC-2019-29.pdf
  file_size: 639378
  relation: main_file
file_date_updated: 2020-07-14T12:47:44Z
has_accepted_license: '1'
intvolume: '       146'
keyword:
- consensus
- approximate agreement
- Byzantine faults
- chordal graphs
- lattice agreement
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
oa: 1
oa_version: Published Version
page: 29:1--29:17
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '754411'
  name: ISTplus - Postdoctoral Fellowships
publication: 33rd International Symposium on Distributed Computing
publication_identifier:
  eisbn:
  - 978-3-95977-126-9
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: 1
status: public
title: Byzantine approximate agreement on graphs
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 146
year: '2019'
...
---
_id: '6933'
abstract:
- lang: eng
  text: "We design fast deterministic algorithms for distance computation in the CONGESTED
    CLIQUE model. Our key contributions include:\r\n\r\n - A (2+ε)-approximation for
    all-pairs shortest paths problem in O(log²n / ε) rounds on unweighted undirected
    graphs. With a small additional additive factor, this also applies for weighted
    graphs. This is the first sub-polynomial constant-factor approximation for APSP
    in this model.\r\n - A (1+ε)-approximation for multi-source shortest paths problem
    from O(√n) sources in O(log² n / ε) rounds on weighted undirected graphs. This
    is the first sub-polynomial algorithm obtaining this approximation for a set of
    sources of polynomial size.\r\n\r\nOur main techniques are new distance tools
    that are obtained via improved algorithms for sparse matrix multiplication, which
    we leverage to construct efficient hopsets and shortest paths. Furthermore, our
    techniques extend to additional distance problems for which we improve upon the
    state-of-the-art, including diameter approximation, and an exact single-source
    shortest paths algorithm for weighted undirected graphs in Õ(n^{1/6}) rounds."
article_processing_charge: No
arxiv: 1
author:
- first_name: Keren
  full_name: Censor-Hillel, Keren
  last_name: Censor-Hillel
- first_name: Michal
  full_name: Dory, Michal
  last_name: Dory
- first_name: Janne
  full_name: Korhonen, Janne
  id: C5402D42-15BC-11E9-A202-CA2BE6697425
  last_name: Korhonen
- first_name: Dean
  full_name: Leitersdorf, Dean
  last_name: Leitersdorf
citation:
  ama: 'Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. Fast approximate shortest
    paths in the congested clique. In: <i>Proceedings of the 2019 ACM Symposium on
    Principles of Distributed Computin</i>. ACM; 2019:74-83. doi:<a href="https://doi.org/10.1145/3293611.3331633">10.1145/3293611.3331633</a>'
  apa: 'Censor-Hillel, K., Dory, M., Korhonen, J., &#38; Leitersdorf, D. (2019). Fast
    approximate shortest paths in the congested clique. In <i>Proceedings of the 2019
    ACM Symposium on Principles of Distributed Computin</i> (pp. 74–83). Toronto,
    ON, Canada: ACM. <a href="https://doi.org/10.1145/3293611.3331633">https://doi.org/10.1145/3293611.3331633</a>'
  chicago: Censor-Hillel, Keren, Michal Dory, Janne Korhonen, and Dean Leitersdorf.
    “Fast Approximate Shortest Paths in the Congested Clique.” In <i>Proceedings of
    the 2019 ACM Symposium on Principles of Distributed Computin</i>, 74–83. ACM,
    2019. <a href="https://doi.org/10.1145/3293611.3331633">https://doi.org/10.1145/3293611.3331633</a>.
  ieee: K. Censor-Hillel, M. Dory, J. Korhonen, and D. Leitersdorf, “Fast approximate
    shortest paths in the congested clique,” in <i>Proceedings of the 2019 ACM Symposium
    on Principles of Distributed Computin</i>, Toronto, ON, Canada, 2019, pp. 74–83.
  ista: 'Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. 2019. Fast approximate
    shortest paths in the congested clique. Proceedings of the 2019 ACM Symposium
    on Principles of Distributed Computin. PODC: Symposium on Principles of Distributed
    Computing, 74–83.'
  mla: Censor-Hillel, Keren, et al. “Fast Approximate Shortest Paths in the Congested
    Clique.” <i>Proceedings of the 2019 ACM Symposium on Principles of Distributed
    Computin</i>, ACM, 2019, pp. 74–83, doi:<a href="https://doi.org/10.1145/3293611.3331633">10.1145/3293611.3331633</a>.
  short: K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, in:, Proceedings
    of the 2019 ACM Symposium on Principles of Distributed Computin, ACM, 2019, pp.
    74–83.
conference:
  end_date: 2019-08-02
  location: Toronto, ON, Canada
  name: 'PODC: Symposium on Principles of Distributed Computing'
  start_date: 2019-07-29
date_created: 2019-10-08T12:48:42Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2024-03-07T14:43:38Z
day: '01'
department:
- _id: DaAl
doi: 10.1145/3293611.3331633
external_id:
  arxiv:
  - '1903.05956'
  isi:
  - '000570442000011'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1903.05956
month: '08'
oa: 1
oa_version: Preprint
page: 74-83
publication: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin
publication_identifier:
  isbn:
  - '9781450362177'
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
  record:
  - id: '7939'
    relation: later_version
    status: public
scopus_import: '1'
status: public
title: Fast approximate shortest paths in the congested clique
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2019'
...
---
_id: '6935'
abstract:
- lang: eng
  text: "This paper investigates the power of preprocessing in the CONGEST model.
    Schmid and Suomela (ACM HotSDN 2013) introduced the SUPPORTED CONGEST model to
    study the application of distributed algorithms in Software-Defined Networks (SDNs).
    In this paper, we show that a large class of lower bounds in the CONGEST model
    still hold in the SUPPORTED model, highlighting the robustness of these bounds.
    This also raises the question how much does\r\npreprocessing help in the CONGEST
    model."
article_processing_charge: No
arxiv: 1
author:
- first_name: Klaus-Tycho
  full_name: Foerster, Klaus-Tycho
  last_name: Foerster
- first_name: Janne
  full_name: Korhonen, Janne
  id: C5402D42-15BC-11E9-A202-CA2BE6697425
  last_name: Korhonen
- first_name: Joel
  full_name: Rybicki, Joel
  id: 334EFD2E-F248-11E8-B48F-1D18A9856A87
  last_name: Rybicki
  orcid: 0000-0002-6432-6646
- first_name: Stefan
  full_name: Schmid, Stefan
  last_name: Schmid
citation:
  ama: 'Foerster K-T, Korhonen J, Rybicki J, Schmid S. Does preprocessing help under
    congestion? In: <i>Proceedings of the 2019 ACM Symposium on Principles of Distributed
    Computing</i>. ACM; 2019:259-261. doi:<a href="https://doi.org/10.1145/3293611.3331581">10.1145/3293611.3331581</a>'
  apa: 'Foerster, K.-T., Korhonen, J., Rybicki, J., &#38; Schmid, S. (2019). Does
    preprocessing help under congestion? In <i>Proceedings of the 2019 ACM Symposium
    on Principles of Distributed Computing</i> (pp. 259–261). Toronto, ON, Canada:
    ACM. <a href="https://doi.org/10.1145/3293611.3331581">https://doi.org/10.1145/3293611.3331581</a>'
  chicago: Foerster, Klaus-Tycho, Janne Korhonen, Joel Rybicki, and Stefan Schmid.
    “Does Preprocessing Help under Congestion?” In <i>Proceedings of the 2019 ACM
    Symposium on Principles of Distributed Computing</i>, 259–61. ACM, 2019. <a href="https://doi.org/10.1145/3293611.3331581">https://doi.org/10.1145/3293611.3331581</a>.
  ieee: K.-T. Foerster, J. Korhonen, J. Rybicki, and S. Schmid, “Does preprocessing
    help under congestion?,” in <i>Proceedings of the 2019 ACM Symposium on Principles
    of Distributed Computing</i>, Toronto, ON, Canada, 2019, pp. 259–261.
  ista: 'Foerster K-T, Korhonen J, Rybicki J, Schmid S. 2019. Does preprocessing help
    under congestion? Proceedings of the 2019 ACM Symposium on Principles of Distributed
    Computing. PODC: Symposium on Principles of Distributed Computing, 259–261.'
  mla: Foerster, Klaus-Tycho, et al. “Does Preprocessing Help under Congestion?” <i>Proceedings
    of the 2019 ACM Symposium on Principles of Distributed Computing</i>, ACM, 2019,
    pp. 259–61, doi:<a href="https://doi.org/10.1145/3293611.3331581">10.1145/3293611.3331581</a>.
  short: K.-T. Foerster, J. Korhonen, J. Rybicki, S. Schmid, in:, Proceedings of the
    2019 ACM Symposium on Principles of Distributed Computing, ACM, 2019, pp. 259–261.
conference:
  end_date: 2019-08-02
  location: Toronto, ON, Canada
  name: 'PODC: Symposium on Principles of Distributed Computing'
  start_date: 2019-07-29
date_created: 2019-10-08T12:57:14Z
date_published: 2019-08-01T00:00:00Z
date_updated: 2023-09-08T11:37:22Z
day: '01'
department:
- _id: DaAl
doi: 10.1145/3293611.3331581
ec_funded: 1
external_id:
  arxiv:
  - '1905.03012'
  isi:
  - '000570442000037'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1905.03012
month: '08'
oa: 1
oa_version: Preprint
page: 259-261
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '754411'
  name: ISTplus - Postdoctoral Fellowships
publication: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing
publication_identifier:
  isbn:
  - '9781450362177'
publication_status: published
publisher: ACM
quality_controlled: '1'
scopus_import: '1'
status: public
title: Does preprocessing help under congestion?
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '6936'
abstract:
- lang: eng
  text: "A key challenge for community ecology is to understand to what extent observational
    data can be used to infer the underlying community assembly processes. As different
    processes can lead to similar or even identical patterns, statistical analyses
    of non‐manipulative observational data never yield undisputable causal inference
    on the underlying processes. Still, most empirical studies in community ecology
    are based on observational data, and hence understanding under which circumstances
    such data can shed light on assembly processes is a central concern for community
    ecologists. We simulated a spatial agent‐based model that generates variation
    in metacommunity dynamics across multiple axes, including the four classic metacommunity
    paradigms as special cases. We further simulated a virtual ecologist who analysed
    snapshot data sampled from the simulations using eighteen output metrics derived
    from beta‐diversity and habitat variation indices, variation partitioning and
    joint species distribution modelling. Our results indicated two main axes of variation
    in the output metrics. The first axis of variation described whether the landscape
    has patchy or continuous variation, and thus was essentially independent of the
    properties of the species community. The second axis of variation related to the
    level of predictability of the metacommunity. The most predictable communities
    were niche‐based metacommunities inhabiting static landscapes with marked environmental
    heterogeneity, such as metacommunities following the species sorting paradigm
    or the mass effects paradigm. The most unpredictable communities were neutral‐based
    metacommunities inhabiting dynamics landscapes with little spatial heterogeneity,
    such as metacommunities following the neutral or patch sorting paradigms. The
    output metrics from joint species distribution modelling yielded generally the
    highest resolution to disentangle among the simulated scenarios. Yet, the different
    types of statistical approaches utilized in this study carried complementary information,
    and thus our results suggest that the most comprehensive evaluation of metacommunity
    structure can be obtained by combining them.\r\n"
article_processing_charge: No
article_type: original
author:
- first_name: Otso
  full_name: Ovaskainen, Otso
  last_name: Ovaskainen
- first_name: Joel
  full_name: Rybicki, Joel
  id: 334EFD2E-F248-11E8-B48F-1D18A9856A87
  last_name: Rybicki
  orcid: 0000-0002-6432-6646
- first_name: Nerea
  full_name: Abrego, Nerea
  last_name: Abrego
citation:
  ama: Ovaskainen O, Rybicki J, Abrego N. What can observational data reveal about
    metacommunity processes? <i>Ecography</i>. 2019;42(11):1877-1886. doi:<a href="https://doi.org/10.1111/ecog.04444">10.1111/ecog.04444</a>
  apa: Ovaskainen, O., Rybicki, J., &#38; Abrego, N. (2019). What can observational
    data reveal about metacommunity processes? <i>Ecography</i>. Wiley. <a href="https://doi.org/10.1111/ecog.04444">https://doi.org/10.1111/ecog.04444</a>
  chicago: Ovaskainen, Otso, Joel Rybicki, and Nerea Abrego. “What Can Observational
    Data Reveal about Metacommunity Processes?” <i>Ecography</i>. Wiley, 2019. <a
    href="https://doi.org/10.1111/ecog.04444">https://doi.org/10.1111/ecog.04444</a>.
  ieee: O. Ovaskainen, J. Rybicki, and N. Abrego, “What can observational data reveal
    about metacommunity processes?,” <i>Ecography</i>, vol. 42, no. 11. Wiley, pp.
    1877–1886, 2019.
  ista: Ovaskainen O, Rybicki J, Abrego N. 2019. What can observational data reveal
    about metacommunity processes? Ecography. 42(11), 1877–1886.
  mla: Ovaskainen, Otso, et al. “What Can Observational Data Reveal about Metacommunity
    Processes?” <i>Ecography</i>, vol. 42, no. 11, Wiley, 2019, pp. 1877–86, doi:<a
    href="https://doi.org/10.1111/ecog.04444">10.1111/ecog.04444</a>.
  short: O. Ovaskainen, J. Rybicki, N. Abrego, Ecography 42 (2019) 1877–1886.
date_created: 2019-10-08T13:01:24Z
date_published: 2019-11-01T00:00:00Z
date_updated: 2023-08-30T06:57:25Z
day: '01'
ddc:
- '577'
department:
- _id: DaAl
doi: 10.1111/ecog.04444
ec_funded: 1
external_id:
  isi:
  - '000486348700001'
file:
- access_level: open_access
  checksum: 6c9fbbd5ea8ce10ae93e55ad560a7bf9
  content_type: application/pdf
  creator: jrybicki
  date_created: 2019-10-08T13:07:44Z
  date_updated: 2020-07-14T12:47:45Z
  file_id: '6937'
  file_name: ecog.04444.pdf
  file_size: 1682718
  relation: main_file
file_date_updated: 2020-07-14T12:47:45Z
has_accepted_license: '1'
intvolume: '        42'
isi: 1
issue: '11'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 1877-1886
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '754411'
  name: ISTplus - Postdoctoral Fellowships
publication: Ecography
publication_identifier:
  eissn:
  - 1600-0587
  issn:
  - 0906-7590
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: What can observational data reveal about metacommunity processes?
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 42
year: '2019'
...
---
_id: '6940'
abstract:
- lang: eng
  text: "We study the effect of a linear tunneling coupling between two-dimensional
    systems, each separately\r\nexhibiting the topological Berezinskii-Kosterlitz-Thouless
    (BKT) transition. In the uncoupled limit, there\r\nare two phases: one where the
    one-body correlation functions are algebraically decaying and the other with\r\nexponential
    decay. When the linear coupling is turned on, a third BKT-paired phase emerges,
    in which one-body correlations are exponentially decaying, while two-body correlation
    functions exhibit power-law\r\ndecay. We perform numerical simulations in the
    paradigmatic case of two coupled XY models at finite\r\ntemperature, finding evidences
    that for any finite value of the interlayer coupling, the BKT-paired phase is\r\npresent.
    We provide a picture of the phase diagram using a renormalization group approach."
acknowledgement: "We thank S. Chiacchiera, G. Delfino, N. Dupuis, T. Enss, M. Fabrizio
  and G. Gori for many stimulating discussions.\r\nG.B. acknowledges support from
  the Austrian Science Fund (FWF), under project No. M2461-N27. N.D. acknowledges\r\nsupport
  from Deutsche Forschungsgemeinschaft (DFG) under Germany’s Excellence Strategy EXC-2181/1
  - 390900948 (the Heidelberg STRUCTURES Excellence Cluster) and from the DFG Collaborative
  Research Centre “SFB 1225 ISOQUANT”. Support from the CNR/MTA Italy-Hungary 2019-2021
  Joint Project “Strongly interacting systems in confined geometries” is gratefully
  acknowledged."
article_number: '100601'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Giacomo
  full_name: Bighin, Giacomo
  id: 4CA96FD4-F248-11E8-B48F-1D18A9856A87
  last_name: Bighin
  orcid: 0000-0001-8823-9777
- first_name: Nicolò
  full_name: Defenu, Nicolò
  last_name: Defenu
- first_name: István
  full_name: Nándori, István
  last_name: Nándori
- first_name: Luca
  full_name: Salasnich, Luca
  last_name: Salasnich
- first_name: Andrea
  full_name: Trombettoni, Andrea
  last_name: Trombettoni
citation:
  ama: Bighin G, Defenu N, Nándori I, Salasnich L, Trombettoni A. Berezinskii-Kosterlitz-Thouless
    paired phase in coupled XY models. <i>Physical Review Letters</i>. 2019;123(10).
    doi:<a href="https://doi.org/10.1103/physrevlett.123.100601">10.1103/physrevlett.123.100601</a>
  apa: Bighin, G., Defenu, N., Nándori, I., Salasnich, L., &#38; Trombettoni, A. (2019).
    Berezinskii-Kosterlitz-Thouless paired phase in coupled XY models. <i>Physical
    Review Letters</i>. American Physical Society. <a href="https://doi.org/10.1103/physrevlett.123.100601">https://doi.org/10.1103/physrevlett.123.100601</a>
  chicago: Bighin, Giacomo, Nicolò Defenu, István Nándori, Luca Salasnich, and Andrea
    Trombettoni. “Berezinskii-Kosterlitz-Thouless Paired Phase in Coupled XY Models.”
    <i>Physical Review Letters</i>. American Physical Society, 2019. <a href="https://doi.org/10.1103/physrevlett.123.100601">https://doi.org/10.1103/physrevlett.123.100601</a>.
  ieee: G. Bighin, N. Defenu, I. Nándori, L. Salasnich, and A. Trombettoni, “Berezinskii-Kosterlitz-Thouless
    paired phase in coupled XY models,” <i>Physical Review Letters</i>, vol. 123,
    no. 10. American Physical Society, 2019.
  ista: Bighin G, Defenu N, Nándori I, Salasnich L, Trombettoni A. 2019. Berezinskii-Kosterlitz-Thouless
    paired phase in coupled XY models. Physical Review Letters. 123(10), 100601.
  mla: Bighin, Giacomo, et al. “Berezinskii-Kosterlitz-Thouless Paired Phase in Coupled
    XY Models.” <i>Physical Review Letters</i>, vol. 123, no. 10, 100601, American
    Physical Society, 2019, doi:<a href="https://doi.org/10.1103/physrevlett.123.100601">10.1103/physrevlett.123.100601</a>.
  short: G. Bighin, N. Defenu, I. Nándori, L. Salasnich, A. Trombettoni, Physical
    Review Letters 123 (2019).
date_created: 2019-10-14T06:31:13Z
date_published: 2019-09-06T00:00:00Z
date_updated: 2024-08-07T07:16:52Z
day: '06'
department:
- _id: MiLe
doi: 10.1103/physrevlett.123.100601
external_id:
  arxiv:
  - '1907.06253'
  isi:
  - '000483587200004'
intvolume: '       123'
isi: 1
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1907.06253
month: '09'
oa: 1
oa_version: Preprint
project:
- _id: 26986C82-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: M02641
  name: A path-integral approach to composite impurities
publication: Physical Review Letters
publication_identifier:
  eissn:
  - 1079-7114
  issn:
  - 0031-9007
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
related_material:
  link:
  - description: News auf IST Website
    relation: press_release
    url: https://ist.ac.at/en/news/new-form-of-magnetism-found/
scopus_import: '1'
status: public
title: Berezinskii-Kosterlitz-Thouless paired phase in coupled XY models
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 123
year: '2019'
...
---
_id: '6942'
abstract:
- lang: eng
  text: "Graph games and Markov decision processes (MDPs) are standard models in reactive
    synthesis and verification of probabilistic systems with nondeterminism. The class
    of   \U0001D714 -regular winning conditions; e.g., safety, reachability, liveness,
    parity conditions; provides a robust and expressive specification formalism for
    properties that arise in analysis of reactive systems. The resolutions of nondeterminism
    in games and MDPs are represented as strategies, and we consider succinct representation
    of such strategies. The decision-tree data structure from machine learning retains
    the flavor of decisions of strategies and allows entropy-based minimization to
    obtain succinct trees. However, in contrast to traditional machine-learning problems
    where small errors are allowed, for winning strategies in graph games and MDPs
    no error is allowed, and the decision tree must represent the entire strategy.
    In this work we propose decision trees with linear classifiers for representation
    of strategies in graph games and MDPs. We have implemented strategy representation
    using this data structure and we present experimental results for problems on
    graph games and MDPs, which show that this new data structure presents a much
    more efficient strategy representation as compared to standard decision trees."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Pranav
  full_name: Ashok, Pranav
  last_name: Ashok
- first_name: Tomáš
  full_name: Brázdil, Tomáš
  last_name: Brázdil
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Jan
  full_name: Křetínský, Jan
  last_name: Křetínský
- first_name: Christoph
  full_name: Lampert, Christoph
  id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
  last_name: Lampert
  orcid: 0000-0001-8622-7887
- first_name: Viktor
  full_name: Toman, Viktor
  id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87
  last_name: Toman
  orcid: 0000-0001-9036-063X
citation:
  ama: 'Ashok P, Brázdil T, Chatterjee K, Křetínský J, Lampert C, Toman V. Strategy
    representation by decision trees with linear classifiers. In: <i>16th International
    Conference on Quantitative Evaluation of Systems</i>. Vol 11785. Springer Nature;
    2019:109-128. doi:<a href="https://doi.org/10.1007/978-3-030-30281-8_7">10.1007/978-3-030-30281-8_7</a>'
  apa: 'Ashok, P., Brázdil, T., Chatterjee, K., Křetínský, J., Lampert, C., &#38;
    Toman, V. (2019). Strategy representation by decision trees with linear classifiers.
    In <i>16th International Conference on Quantitative Evaluation of Systems</i>
    (Vol. 11785, pp. 109–128). Glasgow, United Kingdom: Springer Nature. <a href="https://doi.org/10.1007/978-3-030-30281-8_7">https://doi.org/10.1007/978-3-030-30281-8_7</a>'
  chicago: Ashok, Pranav, Tomáš Brázdil, Krishnendu Chatterjee, Jan Křetínský, Christoph
    Lampert, and Viktor Toman. “Strategy Representation by Decision Trees with Linear
    Classifiers.” In <i>16th International Conference on Quantitative Evaluation of
    Systems</i>, 11785:109–28. Springer Nature, 2019. <a href="https://doi.org/10.1007/978-3-030-30281-8_7">https://doi.org/10.1007/978-3-030-30281-8_7</a>.
  ieee: P. Ashok, T. Brázdil, K. Chatterjee, J. Křetínský, C. Lampert, and V. Toman,
    “Strategy representation by decision trees with linear classifiers,” in <i>16th
    International Conference on Quantitative Evaluation of Systems</i>, Glasgow, United
    Kingdom, 2019, vol. 11785, pp. 109–128.
  ista: 'Ashok P, Brázdil T, Chatterjee K, Křetínský J, Lampert C, Toman V. 2019.
    Strategy representation by decision trees with linear classifiers. 16th International
    Conference on Quantitative Evaluation of Systems. QEST: Quantitative Evaluation
    of Systems, LNCS, vol. 11785, 109–128.'
  mla: Ashok, Pranav, et al. “Strategy Representation by Decision Trees with Linear
    Classifiers.” <i>16th International Conference on Quantitative Evaluation of Systems</i>,
    vol. 11785, Springer Nature, 2019, pp. 109–28, doi:<a href="https://doi.org/10.1007/978-3-030-30281-8_7">10.1007/978-3-030-30281-8_7</a>.
  short: P. Ashok, T. Brázdil, K. Chatterjee, J. Křetínský, C. Lampert, V. Toman,
    in:, 16th International Conference on Quantitative Evaluation of Systems, Springer
    Nature, 2019, pp. 109–128.
conference:
  end_date: 2019-09-12
  location: Glasgow, United Kingdom
  name: 'QEST: Quantitative Evaluation of Systems'
  start_date: 2019-09-10
date_created: 2019-10-14T06:57:49Z
date_published: 2019-09-04T00:00:00Z
date_updated: 2025-06-02T08:53:47Z
day: '04'
department:
- _id: KrCh
- _id: ChLa
doi: 10.1007/978-3-030-30281-8_7
external_id:
  arxiv:
  - '1906.08178'
  isi:
  - '000679281300007'
intvolume: '     11785'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1906.08178
month: '09'
oa: 1
oa_version: Preprint
page: 109-128
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S11407
  name: Game Theory
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S11402-N23
  name: Rigorous Systems Engineering
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
  grant_number: ICT15-003
  name: Efficient Algorithms for Computer Aided Verification
publication: 16th International Conference on Quantitative Evaluation of Systems
publication_identifier:
  eisbn:
  - '9783030302818'
  isbn:
  - '9783030302801'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Strategy representation by decision trees with linear classifiers
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 11785
year: '2019'
...
---
_id: '6943'
abstract:
- lang: eng
  text: Plants as sessile organisms are constantly under attack by herbivores, rough
    environmental situations, or mechanical pressure. These challenges often lead
    to the induction of wounds or destruction of already specified and developed tissues.
    Additionally, wounding makes plants vulnerable to invasion by pathogens, which
    is why wound signalling often triggers specific defence responses. To stay competitive
    or, eventually, survive under these circumstances, plants need to regenerate efficiently,
    which in rigid, tissue migration-incompatible plant tissues requires post-embryonic
    patterning and organogenesis. Now, several studies used laser-assisted single
    cell ablation in the Arabidopsis root tip as a minimal wounding proxy. Here, we
    discuss their findings and put them into context of a broader spectrum of wound
    signalling, pathogen responses and tissue as well as organ regeneration.
article_processing_charge: No
article_type: original
author:
- first_name: Lukas
  full_name: Hörmayer, Lukas
  id: 2EEE7A2A-F248-11E8-B48F-1D18A9856A87
  last_name: Hörmayer
  orcid: 0000-0001-8295-2926
- first_name: Jiří
  full_name: Friml, Jiří
  id: 4159519E-F248-11E8-B48F-1D18A9856A87
  last_name: Friml
  orcid: 0000-0002-8302-7596
citation:
  ama: Hörmayer L, Friml J. Targeted cell ablation-based insights into wound healing
    and restorative patterning. <i>Current Opinion in Plant Biology</i>. 2019;52:124-130.
    doi:<a href="https://doi.org/10.1016/j.pbi.2019.08.006">10.1016/j.pbi.2019.08.006</a>
  apa: Hörmayer, L., &#38; Friml, J. (2019). Targeted cell ablation-based insights
    into wound healing and restorative patterning. <i>Current Opinion in Plant Biology</i>.
    Elsevier. <a href="https://doi.org/10.1016/j.pbi.2019.08.006">https://doi.org/10.1016/j.pbi.2019.08.006</a>
  chicago: Hörmayer, Lukas, and Jiří Friml. “Targeted Cell Ablation-Based Insights
    into Wound Healing and Restorative Patterning.” <i>Current Opinion in Plant Biology</i>.
    Elsevier, 2019. <a href="https://doi.org/10.1016/j.pbi.2019.08.006">https://doi.org/10.1016/j.pbi.2019.08.006</a>.
  ieee: L. Hörmayer and J. Friml, “Targeted cell ablation-based insights into wound
    healing and restorative patterning,” <i>Current Opinion in Plant Biology</i>,
    vol. 52. Elsevier, pp. 124–130, 2019.
  ista: Hörmayer L, Friml J. 2019. Targeted cell ablation-based insights into wound
    healing and restorative patterning. Current Opinion in Plant Biology. 52, 124–130.
  mla: Hörmayer, Lukas, and Jiří Friml. “Targeted Cell Ablation-Based Insights into
    Wound Healing and Restorative Patterning.” <i>Current Opinion in Plant Biology</i>,
    vol. 52, Elsevier, 2019, pp. 124–30, doi:<a href="https://doi.org/10.1016/j.pbi.2019.08.006">10.1016/j.pbi.2019.08.006</a>.
  short: L. Hörmayer, J. Friml, Current Opinion in Plant Biology 52 (2019) 124–130.
date_created: 2019-10-14T07:00:24Z
date_published: 2019-12-01T00:00:00Z
date_updated: 2024-03-25T23:30:06Z
day: '01'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.1016/j.pbi.2019.08.006
ec_funded: 1
external_id:
  isi:
  - '000502890600017'
  pmid:
  - '31585333'
file:
- access_level: open_access
  checksum: d6fd68a6e965f1efe3f0bf2d2070a616
  content_type: application/pdf
  creator: dernst
  date_created: 2019-10-14T14:48:21Z
  date_updated: 2020-07-14T12:47:45Z
  file_id: '6946'
  file_name: 2019_CurrentOpinionPlant_Hoermayer.pdf
  file_size: 1659288
  relation: main_file
file_date_updated: 2020-07-14T12:47:45Z
has_accepted_license: '1'
intvolume: '        52'
isi: 1
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 124-130
pmid: 1
project:
- _id: 261099A6-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '742985'
  name: Tracing Evolution of Auxin Transport and Polarity in Plants
publication: Current Opinion in Plant Biology
publication_identifier:
  issn:
  - 1369-5266
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
  record:
  - id: '9992'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Targeted cell ablation-based insights into wound healing and restorative patterning
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 52
year: '2019'
...
---
_id: '6947'
abstract:
- lang: eng
  text: Lymph nodes  are es s ential organs  of the immune  s ys tem where adaptive
    immune responses originate, and consist of various leukocyte populations and a
    stromal backbone. Fibroblastic reticular  cells (FRCs) are  the  main  stromal  cells
    and  form  a sponge-like extracellular matrix network,   called  conduits ,  which  they   thems
    elves   enwrap   and  contract.  Lymph,  containing  s oluble  antigens ,  arrive
    in  lymph  nodes  via afferent lymphatic  vessels that  connect  to  the  s ubcaps
    ular  s inus   and  conduit  network.  According  to  the  current  paradigm,  the  conduit  network   dis
    tributes   afferent  lymph  through   lymph  nodes   and  thus   provides   acces
    s   for  immune  cells to lymph-borne  antigens. An  elas tic  caps ule  s urrounds   the  organ  and  confines   the
    immune  cells and  FRC  network.   Lymph   nodes   are  completely  packed  with  lymphocytes   and  lymphocyte  numbers  directly  dictates  the
    size  of  the  organ.  Although  lymphocytes   cons tantly  enter  and  leave  the  lymph  node,  its   s
    ize  remains   remarkedly   s table  under  homeostatic conditions. It is only
    partly known  how the cellularity and s ize of the lymph node is regulated and  how  the  lymph  node  is
    able to swell in inflammation.  The role of the FRC network   in  lymph  node   s
    welling  and  trans fer  of  fluids   are  inves tigated in  this   thes is.  Furthermore,   we  s
    tudied  what  trafficking  routes   are  us ed  by  cancer  cells   in  lymph  nodes   to  form  distal
    metastases.We examined the role of a mechanical feedback in regulation of lymph  node
    swelling. Using parallel plate compression  and UV-las er  cutting  experiments   we  dis
    s ected  the  mechanical  force dynamics  of the whole lymph  node, and individually
    for FRCs  and the  caps ule. Physical forces   generated  by  packed  lymphocytes   directly  affect  the  tens
    ion  on  the  FRC  network  and  capsule,  which  increases  its  resistance  to   swelling.  This  implies  a  feedback  mechanism  between   tis
    s ue   pres s ure   and   ability   of   lymphocytes    to   enter   the   organ.   Following   inflammation,  the  lymph  node  swells
    ∼10 fold in two weeks . Yet, what  is  the role  for tens ion on  the  FRC  network   and  caps
    ule,  and  how  are  lymphocytes   able  to  enter  in  conditions  that resist
    swelling remain open ques tions . We s how that tens ion on the FRC network is  important
    to  limit  the  swelling  rate  of  the  organ  so  that  the  FRC  network  can  grow  in  a  coordinated  fashion.
    This is illustrated by interfering with FRC contractility, which leads to faster
    swelling rates  and a dis organized FRC network  in the inflamed lymph  node.
    Growth  of the FRC network  in  turn  is   expected  to  releas e  tens ion  on  thes
    e  s tructures   and  lowers   the  res is tance  to  swelling, thereby allowing
    more lymphocytes to enter the organ and drive more swelling. Halt of  swelling
    coincides   with  a  thickening  of  the  caps ule,  which  forms   a  thick  res
    is tant  band  around  the organ and lowers  tens ion on the FRC network  to form
    a new force equilibrium.The  FRC  and  conduit   network   are  further   believed  to  be  a  privileged  s
    ite  of  s oluble  information  within  the  lymph  node,  although  many  details   remain  uns
    olved.  We  s how  by  3D  ultra-recons truction   that  FRCs   and  antigen  pres
    enting  cells   cover  the  s urface  of  conduit  s ys tem for more  than 99%
    and we dis cus s  the implications  for s oluble information  exchangeat the conduit
    level.Finally, there  is an ongoing debate in the cancer field whether and how
    cancer cells  in lymph nodes   s eed  dis tal  metas tas es .  We  s how  that  cancer  cells   infus
    ed  into  the  lymph  node  can  utilize trafficking routes of immune  cells and  rapidly  migrate  to  blood  vessels.
    Once  in  the  blood circulation,  these cells are able to form  metastases in
    distal tissues.
acknowledged_ssus:
- _id: Bio
- _id: PreCl
- _id: EM-Fac
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Frank P
  full_name: Assen, Frank P
  id: 3A8E7F24-F248-11E8-B48F-1D18A9856A87
  last_name: Assen
  orcid: 0000-0003-3470-6119
citation:
  ama: 'Assen FP. Lymph node mechanics: Deciphering the interplay between stroma contractility,
    morphology and lymphocyte trafficking. 2019. doi:<a href="https://doi.org/10.15479/AT:ISTA:6947">10.15479/AT:ISTA:6947</a>'
  apa: 'Assen, F. P. (2019). <i>Lymph node mechanics: Deciphering the interplay between
    stroma contractility, morphology and lymphocyte trafficking</i>. Institute of
    Science and Technology Austria. <a href="https://doi.org/10.15479/AT:ISTA:6947">https://doi.org/10.15479/AT:ISTA:6947</a>'
  chicago: 'Assen, Frank P. “Lymph Node Mechanics: Deciphering the Interplay between
    Stroma Contractility, Morphology and Lymphocyte Trafficking.” Institute of Science
    and Technology Austria, 2019. <a href="https://doi.org/10.15479/AT:ISTA:6947">https://doi.org/10.15479/AT:ISTA:6947</a>.'
  ieee: 'F. P. Assen, “Lymph node mechanics: Deciphering the interplay between stroma
    contractility, morphology and lymphocyte trafficking,” Institute of Science and
    Technology Austria, 2019.'
  ista: 'Assen FP. 2019. Lymph node mechanics: Deciphering the interplay between stroma
    contractility, morphology and lymphocyte trafficking. Institute of Science and
    Technology Austria.'
  mla: 'Assen, Frank P. <i>Lymph Node Mechanics: Deciphering the Interplay between
    Stroma Contractility, Morphology and Lymphocyte Trafficking</i>. Institute of
    Science and Technology Austria, 2019, doi:<a href="https://doi.org/10.15479/AT:ISTA:6947">10.15479/AT:ISTA:6947</a>.'
  short: 'F.P. Assen, Lymph Node Mechanics: Deciphering the Interplay between Stroma
    Contractility, Morphology and Lymphocyte Trafficking, Institute of Science and
    Technology Austria, 2019.'
date_created: 2019-10-14T16:54:52Z
date_published: 2019-10-09T00:00:00Z
date_updated: 2023-09-13T08:50:57Z
day: '9'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: MiSi
doi: 10.15479/AT:ISTA:6947
file:
- access_level: closed
  checksum: 53a739752a500f84d0f8ec953cbbd0b6
  content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
  creator: fassen
  date_created: 2019-11-06T12:30:02Z
  date_updated: 2020-11-07T23:30:03Z
  embargo_to: open_access
  file_id: '6990'
  file_name: PhDthesis_FrankAssen_revised2.docx
  file_size: 214172667
  relation: source_file
- access_level: open_access
  checksum: 8c156b65d9347bb599623a4b09f15d15
  content_type: application/pdf
  creator: fassen
  date_created: 2019-11-06T12:30:57Z
  date_updated: 2020-11-07T23:30:03Z
  embargo: 2020-11-06
  file_id: '6991'
  file_name: PhDthesis_FrankAssen_revised2.pdf
  file_size: 83637532
  relation: main_file
file_date_updated: 2020-11-07T23:30:03Z
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '142'
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
  record:
  - id: '664'
    relation: part_of_dissertation
    status: public
  - id: '402'
    relation: part_of_dissertation
    status: public
status: public
supervisor:
- first_name: Michael K
  full_name: Sixt, Michael K
  id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
  last_name: Sixt
  orcid: 0000-0002-6620-9179
title: 'Lymph node mechanics: Deciphering the interplay between stroma contractility,
  morphology and lymphocyte trafficking'
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
