---
_id: '8306'
abstract:
- lang: eng
  text: Bias-resistant public randomness is a critical component in many (distributed)
    protocols. Generating public randomness is hard, however, because active adversaries
    may behave dishonestly to bias public random choices toward their advantage. Existing
    solutions do not scale to hundreds or thousands of participants, as is needed
    in many decentralized systems. We propose two large-scale distributed protocols,
    RandHound and RandHerd, which provide publicly-verifiable, unpredictable, and
    unbiasable randomness against Byzantine adversaries. RandHound relies on an untrusted
    client to divide a set of randomness servers into groups for scalability, and
    it depends on the pigeonhole principle to ensure output integrity, even for non-random,
    adversarial group choices. RandHerd implements an efficient, decentralized randomness
    beacon. RandHerd is structurally similar to a BFT protocol, but uses RandHound
    in a one-time setup to arrange participants into verifiably unbiased random secret-sharing
    groups, which then repeatedly produce random output at predefined intervals. Our
    prototype demonstrates that RandHound and RandHerd achieve good performance across
    hundreds of participants while retaining a low failure probability by properly
    selecting protocol parameters, such as a group size and secret-sharing threshold.
    For example, when sharding 512 nodes into groups of 32, our experiments show that
    RandHound can produce fresh random output after 240 seconds. RandHerd, after a
    setup phase of 260 seconds, is able to generate fresh random output in intervals
    of approximately 6 seconds. For this configuration, both protocols operate at
    a failure probability of at most 0.08% against a Byzantine adversary.
article_processing_charge: No
author:
- first_name: E.
  full_name: Syta, E.
  last_name: Syta
- first_name: P.
  full_name: Jovanovic, P.
  last_name: Jovanovic
- first_name: Eleftherios
  full_name: Kokoris Kogias, Eleftherios
  id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
  last_name: Kokoris Kogias
- first_name: N.
  full_name: Gailly, N.
  last_name: Gailly
- first_name: L.
  full_name: Gasser, L.
  last_name: Gasser
- first_name: I.
  full_name: Khoffi, I.
  last_name: Khoffi
- first_name: M. J.
  full_name: Fischer, M. J.
  last_name: Fischer
- first_name: B.
  full_name: Ford, B.
  last_name: Ford
citation:
  ama: 'Syta E, Jovanovic P, Kokoris Kogias E, et al. Scalable bias-resistant distributed
    randomness. In: <i>2017 IEEE Symposium on Security and Privacy</i>. IEEE; 2017:444-460.
    doi:<a href="https://doi.org/10.1109/SP.2017.45">10.1109/SP.2017.45</a>'
  apa: 'Syta, E., Jovanovic, P., Kokoris Kogias, E., Gailly, N., Gasser, L., Khoffi,
    I., … Ford, B. (2017). Scalable bias-resistant distributed randomness. In <i>2017
    IEEE Symposium on Security and Privacy</i> (pp. 444–460). San Jose, CA, United
    States: IEEE. <a href="https://doi.org/10.1109/SP.2017.45">https://doi.org/10.1109/SP.2017.45</a>'
  chicago: Syta, E., P. Jovanovic, Eleftherios Kokoris Kogias, N. Gailly, L. Gasser,
    I. Khoffi, M. J. Fischer, and B. Ford. “Scalable Bias-Resistant Distributed Randomness.”
    In <i>2017 IEEE Symposium on Security and Privacy</i>, 444–60. IEEE, 2017. <a
    href="https://doi.org/10.1109/SP.2017.45">https://doi.org/10.1109/SP.2017.45</a>.
  ieee: E. Syta <i>et al.</i>, “Scalable bias-resistant distributed randomness,” in
    <i>2017 IEEE Symposium on Security and Privacy</i>, San Jose, CA, United States,
    2017, pp. 444–460.
  ista: 'Syta E, Jovanovic P, Kokoris Kogias E, Gailly N, Gasser L, Khoffi I, Fischer
    MJ, Ford B. 2017. Scalable bias-resistant distributed randomness. 2017 IEEE Symposium
    on Security and Privacy. SP: Symposium on Security and Privacy, 444–460.'
  mla: Syta, E., et al. “Scalable Bias-Resistant Distributed Randomness.” <i>2017
    IEEE Symposium on Security and Privacy</i>, IEEE, 2017, pp. 444–60, doi:<a href="https://doi.org/10.1109/SP.2017.45">10.1109/SP.2017.45</a>.
  short: E. Syta, P. Jovanovic, E. Kokoris Kogias, N. Gailly, L. Gasser, I. Khoffi,
    M.J. Fischer, B. Ford, in:, 2017 IEEE Symposium on Security and Privacy, IEEE,
    2017, pp. 444–460.
conference:
  end_date: 2017-05-26
  location: San Jose, CA, United States
  name: 'SP: Symposium on Security and Privacy'
  start_date: 2017-05-22
date_created: 2020-08-26T12:26:08Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2021-01-12T08:18:02Z
day: '01'
doi: 10.1109/SP.2017.45
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2016/1067
month: '06'
oa: 1
oa_version: Preprint
page: 444-460
publication: 2017 IEEE Symposium on Security and Privacy
publication_identifier:
  isbn:
  - '9781509055340'
  issn:
  - 2375-1207
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: Scalable bias-resistant distributed randomness
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '743'
abstract:
- lang: eng
  text: "This special issue of the Journal on Formal Methods in System Design is dedicated
    to Prof. Helmut Veith, who unexpectedly passed away in March 2016. Helmut Veith
    was a brilliant researcher, inspiring collaborator, passionate mentor, generous
    friend, and valued member of the formal methods community. Helmut was not only
    known for his numerous and influential contributions in the field of automated
    verification (most prominently his work on Counterexample-Guided Abstraction Refinement
    [1,2]), but also for his untiring and passionate efforts for the logic community:
    he co-organized the Vienna Summer of Logic (an event comprising twelve conferences
    and numerous workshops which attracted thousands of researchers from all over
    the world), he initiated the Vienna Center for Logic and Algorithms (which promotes
    international collaboration on logic and algorithms and organizes outreach events
    such as the LogicLounge), and he coordinated the Doctoral Program on Logical Methods
    in Computer Science at TU Wien (currently educating more than 40 doctoral students)
    and a National Research Network on Rigorous Systems Engineering (uniting fifteen
    researchers in Austria to address the challenge of building reliable and safe
    computer\r\nsystems). With his enthusiasm and commitment, Helmut completely reshaped
    the Austrian research landscape in the field of logic and verification in his
    few years as a full professor at TU Wien."
article_processing_charge: No
author:
- first_name: Georg
  full_name: Gottlob, Georg
  last_name: Gottlob
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
- first_name: Georg
  full_name: Weißenbacher, Georg
  last_name: Weißenbacher
citation:
  ama: Gottlob G, Henzinger TA, Weißenbacher G. Preface of the special issue in memoriam
    Helmut Veith. <i>Formal Methods in System Design</i>. 2017;51(2):267-269. doi:<a
    href="https://doi.org/10.1007/s10703-017-0307-6">10.1007/s10703-017-0307-6</a>
  apa: Gottlob, G., Henzinger, T. A., &#38; Weißenbacher, G. (2017). Preface of the
    special issue in memoriam Helmut Veith. <i>Formal Methods in System Design</i>.
    Springer. <a href="https://doi.org/10.1007/s10703-017-0307-6">https://doi.org/10.1007/s10703-017-0307-6</a>
  chicago: Gottlob, Georg, Thomas A Henzinger, and Georg Weißenbacher. “Preface of
    the Special Issue in Memoriam Helmut Veith.” <i>Formal Methods in System Design</i>.
    Springer, 2017. <a href="https://doi.org/10.1007/s10703-017-0307-6">https://doi.org/10.1007/s10703-017-0307-6</a>.
  ieee: G. Gottlob, T. A. Henzinger, and G. Weißenbacher, “Preface of the special
    issue in memoriam Helmut Veith,” <i>Formal Methods in System Design</i>, vol.
    51, no. 2. Springer, pp. 267–269, 2017.
  ista: Gottlob G, Henzinger TA, Weißenbacher G. 2017. Preface of the special issue
    in memoriam Helmut Veith. Formal Methods in System Design. 51(2), 267–269.
  mla: Gottlob, Georg, et al. “Preface of the Special Issue in Memoriam Helmut Veith.”
    <i>Formal Methods in System Design</i>, vol. 51, no. 2, Springer, 2017, pp. 267–69,
    doi:<a href="https://doi.org/10.1007/s10703-017-0307-6">10.1007/s10703-017-0307-6</a>.
  short: G. Gottlob, T.A. Henzinger, G. Weißenbacher, Formal Methods in System Design
    51 (2017) 267–269.
date_created: 2018-12-11T11:48:16Z
date_published: 2017-11-14T00:00:00Z
date_updated: 2023-09-27T12:29:29Z
day: '14'
department:
- _id: ToHe
doi: 10.1007/s10703-017-0307-6
external_id:
  isi:
  - '000415615600001'
intvolume: '        51'
isi: 1
issue: '2'
language:
- iso: eng
month: '11'
oa_version: None
page: 267 - 269
publication: Formal Methods in System Design
publication_status: published
publisher: Springer
publist_id: '6924'
quality_controlled: '1'
status: public
title: Preface of the special issue in memoriam Helmut Veith
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 51
year: '2017'
...
---
_id: '751'
abstract:
- lang: eng
  text: The basement membrane (BM) is a thin layer of extracellular matrix (ECM) beneath
    nearly all epithelial cell types that is critical for cellular and tissue function.
    It is composed of numerous components conserved among all bilaterians [1]; however,
    it is unknown how all of these components are generated and subsequently constructed
    to form a fully mature BM in the living animal. Although BM formation is thought
    to simply involve a process of self-assembly [2], this concept suffers from a
    number of logistical issues when considering its construction in vivo. First,
    incorporation of BM components appears to be hierarchical [3-5], yet it is unclear
    whether their production during embryogenesis must also be regulated in a temporal
    fashion. Second, many BM proteins are produced not only by the cells residing
    on the BM but also by surrounding cell types [6-9], and it is unclear how large,
    possibly insoluble protein complexes [10] are delivered into the matrix. Here
    we exploit our ability to live image and genetically dissect de novo BM formation
    during Drosophila development. This reveals that there is a temporal hierarchy
    of BM protein production that is essential for proper component incorporation.
    Furthermore, we show that BM components require secretion by migrating macrophages
    (hemocytes) during their developmental dispersal, which is critical for embryogenesis.
    Indeed, hemocyte migration is essential to deliver a subset of ECM components
    evenly throughout the embryo. This reveals that de novo BM construction requires
    a combination of both production and distribution logistics allowing for the timely
    delivery of core components.
article_processing_charge: No
author:
- first_name: Yutaka
  full_name: Matsubayashi, Yutaka
  last_name: Matsubayashi
- first_name: Adam
  full_name: Louani, Adam
  last_name: Louani
- first_name: Anca
  full_name: Dragu, Anca
  last_name: Dragu
- first_name: Besaiz
  full_name: Sanchez Sanchez, Besaiz
  last_name: Sanchez Sanchez
- first_name: Eduardo
  full_name: Serna Morales, Eduardo
  last_name: Serna Morales
- first_name: Lawrence
  full_name: Yolland, Lawrence
  last_name: Yolland
- first_name: Attila
  full_name: György, Attila
  id: 3BCEDBE0-F248-11E8-B48F-1D18A9856A87
  last_name: György
  orcid: 0000-0002-1819-198X
- first_name: Gema
  full_name: Vizcay, Gema
  last_name: Vizcay
- first_name: Roland
  full_name: Fleck, Roland
  last_name: Fleck
- first_name: John
  full_name: Heddleston, John
  last_name: Heddleston
- first_name: Teng
  full_name: Chew, Teng
  last_name: Chew
- first_name: Daria E
  full_name: Siekhaus, Daria E
  id: 3D224B9E-F248-11E8-B48F-1D18A9856A87
  last_name: Siekhaus
  orcid: 0000-0001-8323-8353
- first_name: Brian
  full_name: Stramer, Brian
  last_name: Stramer
citation:
  ama: Matsubayashi Y, Louani A, Dragu A, et al. A moving source of matrix components
    is essential for De Novo basement membrane formation. <i>Current Biology</i>.
    2017;27(22):3526-3534e.4. doi:<a href="https://doi.org/10.1016/j.cub.2017.10.001">10.1016/j.cub.2017.10.001</a>
  apa: Matsubayashi, Y., Louani, A., Dragu, A., Sanchez Sanchez, B., Serna Morales,
    E., Yolland, L., … Stramer, B. (2017). A moving source of matrix components is
    essential for De Novo basement membrane formation. <i>Current Biology</i>. Cell
    Press. <a href="https://doi.org/10.1016/j.cub.2017.10.001">https://doi.org/10.1016/j.cub.2017.10.001</a>
  chicago: Matsubayashi, Yutaka, Adam Louani, Anca Dragu, Besaiz Sanchez Sanchez,
    Eduardo Serna Morales, Lawrence Yolland, Attila György, et al. “A Moving Source
    of Matrix Components Is Essential for De Novo Basement Membrane Formation.” <i>Current
    Biology</i>. Cell Press, 2017. <a href="https://doi.org/10.1016/j.cub.2017.10.001">https://doi.org/10.1016/j.cub.2017.10.001</a>.
  ieee: Y. Matsubayashi <i>et al.</i>, “A moving source of matrix components is essential
    for De Novo basement membrane formation,” <i>Current Biology</i>, vol. 27, no.
    22. Cell Press, p. 3526–3534e.4, 2017.
  ista: Matsubayashi Y, Louani A, Dragu A, Sanchez Sanchez B, Serna Morales E, Yolland
    L, György A, Vizcay G, Fleck R, Heddleston J, Chew T, Siekhaus DE, Stramer B.
    2017. A moving source of matrix components is essential for De Novo basement membrane
    formation. Current Biology. 27(22), 3526–3534e.4.
  mla: Matsubayashi, Yutaka, et al. “A Moving Source of Matrix Components Is Essential
    for De Novo Basement Membrane Formation.” <i>Current Biology</i>, vol. 27, no.
    22, Cell Press, 2017, p. 3526–3534e.4, doi:<a href="https://doi.org/10.1016/j.cub.2017.10.001">10.1016/j.cub.2017.10.001</a>.
  short: Y. Matsubayashi, A. Louani, A. Dragu, B. Sanchez Sanchez, E. Serna Morales,
    L. Yolland, A. György, G. Vizcay, R. Fleck, J. Heddleston, T. Chew, D.E. Siekhaus,
    B. Stramer, Current Biology 27 (2017) 3526–3534e.4.
date_created: 2018-12-11T11:48:18Z
date_published: 2017-11-09T00:00:00Z
date_updated: 2023-09-27T12:25:31Z
day: '09'
ddc:
- '570'
- '576'
department:
- _id: DaSi
doi: 10.1016/j.cub.2017.10.001
external_id:
  isi:
  - '000415815800031'
file:
- access_level: open_access
  checksum: 264cf6c6c3551486ba5ea786850e000a
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:09:45Z
  date_updated: 2020-07-14T12:47:59Z
  file_id: '4770'
  file_name: IST-2017-875-v1+1_1-s2.0-S0960982217312691-main.pdf
  file_size: 4770657
  relation: main_file
file_date_updated: 2020-07-14T12:47:59Z
has_accepted_license: '1'
intvolume: '        27'
isi: 1
issue: '22'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '11'
oa: 1
oa_version: Published Version
page: 3526 - 3534e.4
publication: Current Biology
publication_identifier:
  issn:
  - '09609822'
publication_status: published
publisher: Cell Press
publist_id: '6905'
pubrep_id: '875'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A moving source of matrix components is essential for De Novo basement membrane
  formation
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 27
year: '2017'
...
---
_id: '7725'
abstract:
- lang: eng
  text: Phenotypic plasticity is the ability of an individual genotype to alter aspects
    of its phenotype depending on the current environment. It is central to the persistence,
    resistance and resilience of populations facing variation in physical or biological
    factors. Genetic variation in plasticity is pervasive, which suggests its local
    adaptation is plausible. Existing studies on the adaptation of plasticity typically
    focus on single traits and a few populations, while theory about interactions
    among genes (for example, pleiotropy) suggests that a multi-trait, landscape scale
    (for example, multiple populations) perspective is required. We present data from
    a landscape scale, replicated, multi-trait experiment using a classic predator–prey
    system centred on the water flea Daphnia pulex. We find predator regime-driven
    differences in genetic variation of multivariate plasticity. These differences
    are associated with strong divergent selection linked to a predation regime. Our
    findings are evidence for local adaptation of plasticity, suggesting that responses
    of populations to environmental variation depend on the conditions in which they
    evolved in the past.
article_processing_charge: No
article_type: original
author:
- first_name: Julia
  full_name: Reger, Julia
  last_name: Reger
- first_name: Martin I.
  full_name: Lind, Martin I.
  last_name: Lind
- first_name: Matthew Richard
  full_name: Robinson, Matthew Richard
  id: E5D42276-F5DA-11E9-8E24-6303E6697425
  last_name: Robinson
  orcid: 0000-0001-8982-8813
- first_name: Andrew P.
  full_name: Beckerman, Andrew P.
  last_name: Beckerman
citation:
  ama: Reger J, Lind MI, Robinson MR, Beckerman AP. Predation drives local adaptation
    of phenotypic plasticity. <i>Nature Ecology &#38; Evolution</i>. 2017;2:100-107.
    doi:<a href="https://doi.org/10.1038/s41559-017-0373-6">10.1038/s41559-017-0373-6</a>
  apa: Reger, J., Lind, M. I., Robinson, M. R., &#38; Beckerman, A. P. (2017). Predation
    drives local adaptation of phenotypic plasticity. <i>Nature Ecology &#38; Evolution</i>.
    Springer Nature. <a href="https://doi.org/10.1038/s41559-017-0373-6">https://doi.org/10.1038/s41559-017-0373-6</a>
  chicago: Reger, Julia, Martin I. Lind, Matthew Richard Robinson, and Andrew P. Beckerman.
    “Predation Drives Local Adaptation of Phenotypic Plasticity.” <i>Nature Ecology
    &#38; Evolution</i>. Springer Nature, 2017. <a href="https://doi.org/10.1038/s41559-017-0373-6">https://doi.org/10.1038/s41559-017-0373-6</a>.
  ieee: J. Reger, M. I. Lind, M. R. Robinson, and A. P. Beckerman, “Predation drives
    local adaptation of phenotypic plasticity,” <i>Nature Ecology &#38; Evolution</i>,
    vol. 2. Springer Nature, pp. 100–107, 2017.
  ista: Reger J, Lind MI, Robinson MR, Beckerman AP. 2017. Predation drives local
    adaptation of phenotypic plasticity. Nature Ecology &#38; Evolution. 2, 100–107.
  mla: Reger, Julia, et al. “Predation Drives Local Adaptation of Phenotypic Plasticity.”
    <i>Nature Ecology &#38; Evolution</i>, vol. 2, Springer Nature, 2017, pp. 100–07,
    doi:<a href="https://doi.org/10.1038/s41559-017-0373-6">10.1038/s41559-017-0373-6</a>.
  short: J. Reger, M.I. Lind, M.R. Robinson, A.P. Beckerman, Nature Ecology &#38;
    Evolution 2 (2017) 100–107.
date_created: 2020-04-30T10:46:02Z
date_published: 2017-11-27T00:00:00Z
date_updated: 2021-01-12T08:15:07Z
day: '27'
doi: 10.1038/s41559-017-0373-6
extern: '1'
intvolume: '         2'
language:
- iso: eng
month: '11'
oa_version: None
page: 100-107
publication: Nature Ecology & Evolution
publication_identifier:
  issn:
  - 2397-334X
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Predation drives local adaptation of phenotypic plasticity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2017'
...
---
_id: '6117'
abstract:
- lang: eng
  text: 'Interleukin-17 (IL-17) is a major pro-inflammatory cytokine: it mediates
    responses to pathogens or tissue damage, and drives autoimmune diseases. Little
    is known about its role in the nervous system. Here we show that IL-17 has neuromodulator-like
    properties in Caenorhabditis elegans. IL-17 can act directly on neurons to alter
    their response properties and contribution to behaviour. Using unbiased genetic
    screens, we delineate an IL-17 signalling pathway and show that it acts in the
    RMG hub interneurons. Disrupting IL-17 signalling reduces RMG responsiveness to
    input from oxygen sensors, and renders sustained escape from 21% oxygen transient
    and contingent on additional stimuli. Over-activating IL-17 receptors abnormally
    heightens responses to 21% oxygen in RMG neurons and whole animals. IL-17 deficiency
    can be bypassed by optogenetic stimulation of RMG. Inducing IL-17 expression in
    adults can rescue mutant defects within 6 h. These findings reveal a non-immunological
    role of IL-17 modulating circuit function and behaviour.'
author:
- first_name: Changchun
  full_name: Chen, Changchun
  last_name: Chen
- first_name: Eisuke
  full_name: Itakura, Eisuke
  last_name: Itakura
- first_name: Geoffrey M.
  full_name: Nelson, Geoffrey M.
  last_name: Nelson
- first_name: Ming
  full_name: Sheng, Ming
  last_name: Sheng
- first_name: Patrick
  full_name: Laurent, Patrick
  last_name: Laurent
- first_name: Lorenz A.
  full_name: Fenk, Lorenz A.
  last_name: Fenk
- first_name: Rebecca A.
  full_name: Butcher, Rebecca A.
  last_name: Butcher
- first_name: Ramanujan S.
  full_name: Hegde, Ramanujan S.
  last_name: Hegde
- first_name: Mario
  full_name: de Bono, Mario
  id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
  last_name: de Bono
  orcid: 0000-0001-8347-0443
citation:
  ama: Chen C, Itakura E, Nelson GM, et al. IL-17 is a neuromodulator of Caenorhabditis
    elegans sensory responses. <i>Nature</i>. 2017;542(7639):43-48. doi:<a href="https://doi.org/10.1038/nature20818">10.1038/nature20818</a>
  apa: Chen, C., Itakura, E., Nelson, G. M., Sheng, M., Laurent, P., Fenk, L. A.,
    … de Bono, M. (2017). IL-17 is a neuromodulator of Caenorhabditis elegans sensory
    responses. <i>Nature</i>. Springer Nature. <a href="https://doi.org/10.1038/nature20818">https://doi.org/10.1038/nature20818</a>
  chicago: Chen, Changchun, Eisuke Itakura, Geoffrey M. Nelson, Ming Sheng, Patrick
    Laurent, Lorenz A. Fenk, Rebecca A. Butcher, Ramanujan S. Hegde, and Mario de
    Bono. “IL-17 Is a Neuromodulator of Caenorhabditis Elegans Sensory Responses.”
    <i>Nature</i>. Springer Nature, 2017. <a href="https://doi.org/10.1038/nature20818">https://doi.org/10.1038/nature20818</a>.
  ieee: C. Chen <i>et al.</i>, “IL-17 is a neuromodulator of Caenorhabditis elegans
    sensory responses,” <i>Nature</i>, vol. 542, no. 7639. Springer Nature, pp. 43–48,
    2017.
  ista: Chen C, Itakura E, Nelson GM, Sheng M, Laurent P, Fenk LA, Butcher RA, Hegde
    RS, de Bono M. 2017. IL-17 is a neuromodulator of Caenorhabditis elegans sensory
    responses. Nature. 542(7639), 43–48.
  mla: Chen, Changchun, et al. “IL-17 Is a Neuromodulator of Caenorhabditis Elegans
    Sensory Responses.” <i>Nature</i>, vol. 542, no. 7639, Springer Nature, 2017,
    pp. 43–48, doi:<a href="https://doi.org/10.1038/nature20818">10.1038/nature20818</a>.
  short: C. Chen, E. Itakura, G.M. Nelson, M. Sheng, P. Laurent, L.A. Fenk, R.A. Butcher,
    R.S. Hegde, M. de Bono, Nature 542 (2017) 43–48.
date_created: 2019-03-19T14:06:41Z
date_published: 2017-02-02T00:00:00Z
date_updated: 2021-01-12T08:06:12Z
day: '02'
doi: 10.1038/nature20818
extern: '1'
external_id:
  pmid:
  - '    28099418'
intvolume: '       542'
issue: '7639'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.ncbi.nlm.nih.gov/pubmed/28099418
month: '02'
oa: 1
oa_version: Submitted Version
page: 43-48
pmid: 1
publication: Nature
publication_identifier:
  issn:
  - 0028-0836
  - 1476-4687
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: IL-17 is a neuromodulator of Caenorhabditis elegans sensory responses
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 542
year: '2017'
...
---
_id: '634'
abstract:
- lang: eng
  text: As autism spectrum disorder (ASD) is largely regarded as a neurodevelopmental
    condition, long-time consensus was that its hallmark features are irreversible.
    However, several studies from recent years using defined mouse models of ASD have
    provided clear evidence that in mice neurobiological and behavioural alterations
    can be ameliorated or even reversed by genetic restoration or pharmacological
    treatment either before or after symptom onset. Here, we review findings on genetic
    and pharmacological reversibility of phenotypes in mouse models of ASD. Our review
    should give a comprehensive overview on both aspects and encourage future studies
    to better understand the underlying molecular mechanisms that might be translatable
    from animals to humans.
alternative_title:
- ADVSANAT
article_processing_charge: No
author:
- first_name: Jan
  full_name: Schroeder, Jan
  last_name: Schroeder
- first_name: Elena
  full_name: Deliu, Elena
  id: 37A40D7E-F248-11E8-B48F-1D18A9856A87
  last_name: Deliu
  orcid: 0000-0002-7370-5293
- first_name: Gaia
  full_name: Novarino, Gaia
  id: 3E57A680-F248-11E8-B48F-1D18A9856A87
  last_name: Novarino
  orcid: 0000-0002-7673-7178
- first_name: Michael
  full_name: Schmeisser, Michael
  last_name: Schmeisser
citation:
  ama: 'Schroeder J, Deliu E, Novarino G, Schmeisser M. Genetic and pharmacological
    reversibility of phenotypes in mouse models of autism spectrum disorder. In: Schmeisser
    M, Boekers T, eds. <i>Translational Anatomy and Cell Biology of Autism Spectrum
    Disorder</i>. Vol 224. Advances in Anatomy Embryology and Cell Biology. Springer;
    2017:189-211. doi:<a href="https://doi.org/10.1007/978-3-319-52498-6_10">10.1007/978-3-319-52498-6_10</a>'
  apa: Schroeder, J., Deliu, E., Novarino, G., &#38; Schmeisser, M. (2017). Genetic
    and pharmacological reversibility of phenotypes in mouse models of autism spectrum
    disorder. In M. Schmeisser &#38; T. Boekers (Eds.), <i>Translational Anatomy and
    Cell Biology of Autism Spectrum Disorder</i> (Vol. 224, pp. 189–211). Springer.
    <a href="https://doi.org/10.1007/978-3-319-52498-6_10">https://doi.org/10.1007/978-3-319-52498-6_10</a>
  chicago: Schroeder, Jan, Elena Deliu, Gaia Novarino, and Michael Schmeisser. “Genetic
    and Pharmacological Reversibility of Phenotypes in Mouse Models of Autism Spectrum
    Disorder.” In <i>Translational Anatomy and Cell Biology of Autism Spectrum Disorder</i>,
    edited by Michael Schmeisser and Tobias Boekers, 224:189–211. Advances in Anatomy
    Embryology and Cell Biology. Springer, 2017. <a href="https://doi.org/10.1007/978-3-319-52498-6_10">https://doi.org/10.1007/978-3-319-52498-6_10</a>.
  ieee: J. Schroeder, E. Deliu, G. Novarino, and M. Schmeisser, “Genetic and pharmacological
    reversibility of phenotypes in mouse models of autism spectrum disorder,” in <i>Translational
    Anatomy and Cell Biology of Autism Spectrum Disorder</i>, vol. 224, M. Schmeisser
    and T. Boekers, Eds. Springer, 2017, pp. 189–211.
  ista: 'Schroeder J, Deliu E, Novarino G, Schmeisser M. 2017.Genetic and pharmacological
    reversibility of phenotypes in mouse models of autism spectrum disorder. In: Translational
    Anatomy and Cell Biology of Autism Spectrum Disorder. ADVSANAT, vol. 224, 189–211.'
  mla: Schroeder, Jan, et al. “Genetic and Pharmacological Reversibility of Phenotypes
    in Mouse Models of Autism Spectrum Disorder.” <i>Translational Anatomy and Cell
    Biology of Autism Spectrum Disorder</i>, edited by Michael Schmeisser and Tobias
    Boekers, vol. 224, Springer, 2017, pp. 189–211, doi:<a href="https://doi.org/10.1007/978-3-319-52498-6_10">10.1007/978-3-319-52498-6_10</a>.
  short: J. Schroeder, E. Deliu, G. Novarino, M. Schmeisser, in:, M. Schmeisser, T.
    Boekers (Eds.), Translational Anatomy and Cell Biology of Autism Spectrum Disorder,
    Springer, 2017, pp. 189–211.
corr_author: '1'
date_created: 2018-12-11T11:47:37Z
date_published: 2017-05-28T00:00:00Z
date_updated: 2025-09-11T07:25:25Z
day: '28'
department:
- _id: GaNo
doi: 10.1007/978-3-319-52498-6_10
editor:
- first_name: Michael
  full_name: Schmeisser, Michael
  last_name: Schmeisser
- first_name: Tobias
  full_name: Boekers, Tobias
  last_name: Boekers
external_id:
  isi:
  - '000443802500011'
intvolume: '       224'
isi: 1
language:
- iso: eng
month: '05'
oa_version: None
page: 189 - 211
project:
- _id: 25473368-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: F03523
  name: Transmembrane Transporters in Health and Disease
publication: Translational Anatomy and Cell Biology of Autism Spectrum Disorder
publication_identifier:
  eisbn:
  - 978-3-319-52498-6
publication_status: published
publisher: Springer
publist_id: '7156'
quality_controlled: '1'
scopus_import: '1'
series_title: Advances in Anatomy Embryology and Cell Biology
status: public
title: Genetic and pharmacological reversibility of phenotypes in mouse models of
  autism spectrum disorder
type: book_chapter
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 224
year: '2017'
...
---
_id: '636'
abstract:
- lang: eng
  text: Signal regular expressions can specify sequential properties of real-valued
    signals based on threshold conditions, regular operations, and duration constraints.
    In this paper we endow them with a quantitative semantics which indicates how
    robustly a signal matches or does not match a given expression. First, we show
    that this semantics is a safe approximation of a distance between the signal and
    the language defined by the expression. Then, we consider the robust matching
    problem, that is, computing the quantitative semantics of every segment of a given
    signal relative to an expression. We present an algorithm that solves this problem
    for piecewise-constant and piecewise-linear signals and show that for such signals
    the robustness map is a piecewise-linear function. The availability of an indicator
    describing how robustly a signal segment matches some regular pattern provides
    a general framework for quantitative monitoring of cyber-physical systems.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Alexey
  full_name: Bakhirkin, Alexey
  last_name: Bakhirkin
- first_name: Thomas
  full_name: Ferrere, Thomas
  id: 40960E6E-F248-11E8-B48F-1D18A9856A87
  last_name: Ferrere
  orcid: 0000-0001-5199-3143
- first_name: Oded
  full_name: Maler, Oded
  last_name: Maler
- first_name: Dogan
  full_name: Ulus, Dogan
  last_name: Ulus
citation:
  ama: 'Bakhirkin A, Ferrere T, Maler O, Ulus D. On the quantitative semantics of
    regular expressions over real-valued signals. In: Abate A, Geeraerts G, eds. Vol
    10419. Springer; 2017:189-206. doi:<a href="https://doi.org/10.1007/978-3-319-65765-3_11">10.1007/978-3-319-65765-3_11</a>'
  apa: 'Bakhirkin, A., Ferrere, T., Maler, O., &#38; Ulus, D. (2017). On the quantitative
    semantics of regular expressions over real-valued signals. In A. Abate &#38; G.
    Geeraerts (Eds.) (Vol. 10419, pp. 189–206). Presented at the FORMATS: Formal Modelling
    and Analysis of Timed Systems, Berlin, Germany: Springer. <a href="https://doi.org/10.1007/978-3-319-65765-3_11">https://doi.org/10.1007/978-3-319-65765-3_11</a>'
  chicago: Bakhirkin, Alexey, Thomas Ferrere, Oded Maler, and Dogan Ulus. “On the
    Quantitative Semantics of Regular Expressions over Real-Valued Signals.” edited
    by Alessandro Abate and Gilles Geeraerts, 10419:189–206. Springer, 2017. <a href="https://doi.org/10.1007/978-3-319-65765-3_11">https://doi.org/10.1007/978-3-319-65765-3_11</a>.
  ieee: 'A. Bakhirkin, T. Ferrere, O. Maler, and D. Ulus, “On the quantitative semantics
    of regular expressions over real-valued signals,” presented at the FORMATS: Formal
    Modelling and Analysis of Timed Systems, Berlin, Germany, 2017, vol. 10419, pp.
    189–206.'
  ista: 'Bakhirkin A, Ferrere T, Maler O, Ulus D. 2017. On the quantitative semantics
    of regular expressions over real-valued signals. FORMATS: Formal Modelling and
    Analysis of Timed Systems, LNCS, vol. 10419, 189–206.'
  mla: Bakhirkin, Alexey, et al. <i>On the Quantitative Semantics of Regular Expressions
    over Real-Valued Signals</i>. Edited by Alessandro Abate and Gilles Geeraerts,
    vol. 10419, Springer, 2017, pp. 189–206, doi:<a href="https://doi.org/10.1007/978-3-319-65765-3_11">10.1007/978-3-319-65765-3_11</a>.
  short: A. Bakhirkin, T. Ferrere, O. Maler, D. Ulus, in:, A. Abate, G. Geeraerts
    (Eds.), Springer, 2017, pp. 189–206.
conference:
  end_date: 2017-09-07
  location: Berlin, Germany
  name: 'FORMATS: Formal Modelling and Analysis of Timed Systems'
  start_date: 2017-09-05
date_created: 2018-12-11T11:47:38Z
date_published: 2017-08-03T00:00:00Z
date_updated: 2025-09-11T07:24:11Z
day: '03'
department:
- _id: ToHe
doi: 10.1007/978-3-319-65765-3_11
editor:
- first_name: Alessandro
  full_name: Abate, Alessandro
  last_name: Abate
- first_name: Gilles
  full_name: Geeraerts, Gilles
  last_name: Geeraerts
external_id:
  isi:
  - '000611678300011'
intvolume: '     10419'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://hal.archives-ouvertes.fr/hal-01552132
month: '08'
oa: 1
oa_version: Submitted Version
page: 189 - 206
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S11402-N23
  name: Moderne Concurrency Paradigms
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z211
  name: Formal methods for the design and analysis of complex systems
publication_identifier:
  isbn:
  - 978-331965764-6
publication_status: published
publisher: Springer
publist_id: '7152'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the quantitative semantics of regular expressions over real-valued signals
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 10419
year: '2017'
...
---
_id: '6426'
abstract:
- lang: eng
  text: Synchronous programs are easy to specify because the side effects of an operation
    are finished by the time the invocation of the operation returns to the caller.
    Asynchronous programs, on the other hand, are difficult to specify because there
    are side effects due to pending computation scheduled as a result of the invocation
    of an operation. They are also difficult to verify because of the large number
    of possible interleavings of concurrent asynchronous computation threads. We show
    that specifications and correctness proofs for asynchronous programs can be structured
    by introducing the fiction, for proof purposes, that intermediate, non-quiescent
    states of asynchronous operations can be ignored. Then, the task of specification
    becomes relatively simple and the task of verification can be naturally decomposed
    into smaller sub-tasks. The sub-tasks iteratively summarize, guided by the structure
    of an asynchronous program, the atomic effect of non-atomic operations and the
    synchronous effect of asynchronous operations. This structuring of specifications
    and proofs corresponds to the introduction of multiple layers of stepwise refinement
    for asynchronous programs. We present the first proof rule, called synchronization,
    to reduce asynchronous invocations on a lower layer to synchronous invocations
    on a higher layer. We implemented our proof method in CIVL and evaluated it on
    a collection of benchmark programs.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
- first_name: Bernhard
  full_name: Kragl, Bernhard
  id: 320FC952-F248-11E8-B48F-1D18A9856A87
  last_name: Kragl
  orcid: 0000-0001-7745-9117
- first_name: Shaz
  full_name: Qadeer, Shaz
  last_name: Qadeer
citation:
  ama: Henzinger TA, Kragl B, Qadeer S. <i>Synchronizing the Asynchronous</i>. IST
    Austria; 2017. doi:<a href="https://doi.org/10.15479/AT:IST-2018-853-v2-2">10.15479/AT:IST-2018-853-v2-2</a>
  apa: Henzinger, T. A., Kragl, B., &#38; Qadeer, S. (2017). <i>Synchronizing the
    asynchronous</i>. IST Austria. <a href="https://doi.org/10.15479/AT:IST-2018-853-v2-2">https://doi.org/10.15479/AT:IST-2018-853-v2-2</a>
  chicago: Henzinger, Thomas A, Bernhard Kragl, and Shaz Qadeer. <i>Synchronizing
    the Asynchronous</i>. IST Austria, 2017. <a href="https://doi.org/10.15479/AT:IST-2018-853-v2-2">https://doi.org/10.15479/AT:IST-2018-853-v2-2</a>.
  ieee: T. A. Henzinger, B. Kragl, and S. Qadeer, <i>Synchronizing the asynchronous</i>.
    IST Austria, 2017.
  ista: Henzinger TA, Kragl B, Qadeer S. 2017. Synchronizing the asynchronous, IST
    Austria, 28p.
  mla: Henzinger, Thomas A., et al. <i>Synchronizing the Asynchronous</i>. IST Austria,
    2017, doi:<a href="https://doi.org/10.15479/AT:IST-2018-853-v2-2">10.15479/AT:IST-2018-853-v2-2</a>.
  short: T.A. Henzinger, B. Kragl, S. Qadeer, Synchronizing the Asynchronous, IST
    Austria, 2017.
date_created: 2019-05-13T08:15:55Z
date_published: 2017-08-04T00:00:00Z
date_updated: 2025-04-15T08:11:53Z
day: '04'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.15479/AT:IST-2018-853-v2-2
file:
- access_level: open_access
  checksum: b48d42725182d7ca10107a118815f4cf
  content_type: application/pdf
  creator: dernst
  date_created: 2019-05-13T08:14:44Z
  date_updated: 2020-07-14T12:47:30Z
  file_id: '6431'
  file_name: main(1).pdf
  file_size: 971347
  relation: main_file
file_date_updated: 2020-07-14T12:47:30Z
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: '28'
publication_identifier:
  issn:
  - 2664-1690
publication_status: published
publisher: IST Austria
related_material:
  record:
  - id: '133'
    relation: later_version
    status: public
status: public
title: Synchronizing the asynchronous
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '644'
abstract:
- lang: eng
  text: An instance of the valued constraint satisfaction problem (VCSP) is given
    by a finite set of variables, a finite domain of labels, and a sum of functions,
    each function depending on a subset of the variables. Each function can take finite
    values specifying costs of assignments of labels to its variables or the infinite
    value, which indicates an infeasible assignment. The goal is to find an assignment
    of labels to the variables that minimizes the sum. We study, assuming that P 6=
    NP, how the complexity of this very general problem depends on the set of functions
    allowed in the instances, the so-called constraint language. The case when all
    allowed functions take values in f0;1g corresponds to ordinary CSPs, where one
    deals only with the feasibility issue, and there is no optimization. This case
    is the subject of the algebraic CSP dichotomy conjecture predicting for which
    constraint languages CSPs are tractable (i.e., solvable in polynomial time) and
    for which they are NP-hard. The case when all allowed functions take only finite
    values corresponds to a finitevalued CSP, where the feasibility aspect is trivial
    and one deals only with the optimization issue. The complexity of finite-valued
    CSPs was fully classified by Thapper and Živný. An algebraic necessary condition
    for tractability of a general-valued CSP with a fixed constraint language was
    recently given by Kozik and Ochremiak. As our main result, we prove that if a
    constraint language satisfies this algebraic necessary condition, and the feasibility
    CSP (i.e., the problem of deciding whether a given instance has a feasible solution)
    corresponding to the VCSP with this language is tractable, then the VCSP is tractable.
    The algorithm is a simple combination of the assumed algorithm for the feasibility
    CSP and the standard LP relaxation. As a corollary, we obtain that a dichotomy
    for ordinary CSPs would imply a dichotomy for general-valued CSPs.
article_processing_charge: No
arxiv: 1
author:
- first_name: Vladimir
  full_name: Kolmogorov, Vladimir
  id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
  last_name: Kolmogorov
- first_name: Andrei
  full_name: Krokhin, Andrei
  last_name: Krokhin
- first_name: Michal
  full_name: Rolinek, Michal
  id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
  last_name: Rolinek
citation:
  ama: Kolmogorov V, Krokhin A, Rolinek M. The complexity of general-valued CSPs.
    <i>SIAM Journal on Computing</i>. 2017;46(3):1087-1110. doi:<a href="https://doi.org/10.1137/16M1091836">10.1137/16M1091836</a>
  apa: Kolmogorov, V., Krokhin, A., &#38; Rolinek, M. (2017). The complexity of general-valued
    CSPs. <i>SIAM Journal on Computing</i>. SIAM. <a href="https://doi.org/10.1137/16M1091836">https://doi.org/10.1137/16M1091836</a>
  chicago: Kolmogorov, Vladimir, Andrei Krokhin, and Michal Rolinek. “The Complexity
    of General-Valued CSPs.” <i>SIAM Journal on Computing</i>. SIAM, 2017. <a href="https://doi.org/10.1137/16M1091836">https://doi.org/10.1137/16M1091836</a>.
  ieee: V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued
    CSPs,” <i>SIAM Journal on Computing</i>, vol. 46, no. 3. SIAM, pp. 1087–1110,
    2017.
  ista: Kolmogorov V, Krokhin A, Rolinek M. 2017. The complexity of general-valued
    CSPs. SIAM Journal on Computing. 46(3), 1087–1110.
  mla: Kolmogorov, Vladimir, et al. “The Complexity of General-Valued CSPs.” <i>SIAM
    Journal on Computing</i>, vol. 46, no. 3, SIAM, 2017, pp. 1087–110, doi:<a href="https://doi.org/10.1137/16M1091836">10.1137/16M1091836</a>.
  short: V. Kolmogorov, A. Krokhin, M. Rolinek, SIAM Journal on Computing 46 (2017)
    1087–1110.
date_created: 2018-12-11T11:47:40Z
date_published: 2017-06-29T00:00:00Z
date_updated: 2025-09-23T13:45:56Z
day: '29'
department:
- _id: VlKo
doi: 10.1137/16M1091836
ec_funded: 1
external_id:
  arxiv:
  - '1502.07327'
  isi:
  - '000404774300010'
intvolume: '        46'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1502.07327
month: '06'
oa: 1
oa_version: Preprint
page: 1087 - 1110
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '616160'
  name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: SIAM Journal on Computing
publication_status: published
publisher: SIAM
publist_id: '7138'
quality_controlled: '1'
related_material:
  record:
  - id: '1637'
    relation: other
    status: public
scopus_import: '1'
status: public
title: The complexity of general-valued CSPs
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 46
year: '2017'
...
---
_id: '647'
abstract:
- lang: eng
  text: Despite researchers’ efforts in the last couple of decades, reachability analysis
    is still a challenging problem even for linear hybrid systems. Among the existing
    approaches, the most practical ones are mainly based on bounded-time reachable
    set over-approximations. For the purpose of unbounded-time analysis, one important
    strategy is to abstract the original system and find an invariant for the abstraction.
    In this paper, we propose an approach to constructing a new kind of abstraction
    called conic abstraction for affine hybrid systems, and to computing reachable
    sets based on this abstraction. The essential feature of a conic abstraction is
    that it partitions the state space of a system into a set of convex polyhedral
    cones which is derived from a uniform conic partition of the derivative space.
    Such a set of polyhedral cones is able to cut all trajectories of the system into
    almost straight segments so that every segment of a reach pipe in a polyhedral
    cone tends to be straight as well, and hence can be over-approximated tightly
    by polyhedra using similar techniques as HyTech or PHAVer. In particular, for
    diagonalizable affine systems, our approach can guarantee to find an invariant
    for unbounded reachable sets, which is beyond the capability of bounded-time reachability
    analysis tools. We implemented the approach in a tool and experiments on benchmarks
    show that our approach is more powerful than SpaceEx and PHAVer in dealing with
    diagonalizable systems.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Sergiy
  full_name: Bogomolov, Sergiy
  id: 369D9A44-F248-11E8-B48F-1D18A9856A87
  last_name: Bogomolov
  orcid: 0000-0002-0686-0365
- first_name: Mirco
  full_name: Giacobbe, Mirco
  id: 3444EA5E-F248-11E8-B48F-1D18A9856A87
  last_name: Giacobbe
  orcid: 0000-0001-8180-0904
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
- first_name: Hui
  full_name: Kong, Hui
  id: 3BDE25AA-F248-11E8-B48F-1D18A9856A87
  last_name: Kong
  orcid: 0000-0002-3066-6941
citation:
  ama: 'Bogomolov S, Giacobbe M, Henzinger TA, Kong H. Conic abstractions for hybrid
    systems. In: Vol 10419. Springer; 2017:116-132. doi:<a href="https://doi.org/10.1007/978-3-319-65765-3_7">10.1007/978-3-319-65765-3_7</a>'
  apa: 'Bogomolov, S., Giacobbe, M., Henzinger, T. A., &#38; Kong, H. (2017). Conic
    abstractions for hybrid systems (Vol. 10419, pp. 116–132). Presented at the FORMATS:
    Formal Modelling and Analysis of Timed Systems, Berlin, Germany: Springer. <a
    href="https://doi.org/10.1007/978-3-319-65765-3_7">https://doi.org/10.1007/978-3-319-65765-3_7</a>'
  chicago: Bogomolov, Sergiy, Mirco Giacobbe, Thomas A Henzinger, and Hui Kong. “Conic
    Abstractions for Hybrid Systems,” 10419:116–32. Springer, 2017. <a href="https://doi.org/10.1007/978-3-319-65765-3_7">https://doi.org/10.1007/978-3-319-65765-3_7</a>.
  ieee: 'S. Bogomolov, M. Giacobbe, T. A. Henzinger, and H. Kong, “Conic abstractions
    for hybrid systems,” presented at the FORMATS: Formal Modelling and Analysis of
    Timed Systems, Berlin, Germany, 2017, vol. 10419, pp. 116–132.'
  ista: 'Bogomolov S, Giacobbe M, Henzinger TA, Kong H. 2017. Conic abstractions for
    hybrid systems. FORMATS: Formal Modelling and Analysis of Timed Systems, LNCS,
    vol. 10419, 116–132.'
  mla: Bogomolov, Sergiy, et al. <i>Conic Abstractions for Hybrid Systems</i>. Vol.
    10419, Springer, 2017, pp. 116–32, doi:<a href="https://doi.org/10.1007/978-3-319-65765-3_7">10.1007/978-3-319-65765-3_7</a>.
  short: S. Bogomolov, M. Giacobbe, T.A. Henzinger, H. Kong, in:, Springer, 2017,
    pp. 116–132.
conference:
  end_date: 2017-09-07
  location: Berlin, Germany
  name: 'FORMATS: Formal Modelling and Analysis of Timed Systems'
  start_date: 2017-09-05
corr_author: '1'
date_created: 2018-12-11T11:47:41Z
date_published: 2017-09-01T00:00:00Z
date_updated: 2026-04-08T07:47:13Z
day: '01'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.1007/978-3-319-65765-3_7
external_id:
  isi:
  - '000611678300007'
file:
- access_level: open_access
  checksum: faf546914ba29bcf9974ee36b6b16750
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:12:38Z
  date_updated: 2020-07-14T12:47:31Z
  file_id: '4956'
  file_name: IST-2017-831-v1+1_main.pdf
  file_size: 3806864
  relation: main_file
file_date_updated: 2020-07-14T12:47:31Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 116 - 132
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S11402-N23
  name: Moderne Concurrency Paradigms
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z211
  name: Formal methods for the design and analysis of complex systems
publication_identifier:
  isbn:
  - 978-331965764-6
publication_status: published
publisher: Springer
publist_id: '7129'
pubrep_id: '831'
quality_controlled: '1'
related_material:
  record:
  - id: '6894'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Conic abstractions for hybrid systems
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: '10419 '
year: '2017'
...
---
_id: '674'
abstract:
- lang: eng
  text: Navigation of cells along gradients of guidance cues is a determining step
    in many developmental and immunological processes. Gradients can either be soluble
    or immobilized to tissues as demonstrated for the haptotactic migration of dendritic
    cells (DCs) toward higher concentrations of immobilized chemokine CCL21. To elucidate
    how gradient characteristics govern cellular response patterns, we here introduce
    an in vitro system allowing to track migratory responses of DCs to precisely controlled
    immobilized gradients of CCL21. We find that haptotactic sensing depends on the
    absolute CCL21 concentration and local steepness of the gradient, consistent with
    a scenario where DC directionality is governed by the signal-to-noise ratio of
    CCL21 binding to the receptor CCR7. We find that the conditions for optimal DC
    guidance are perfectly provided by the CCL21 gradients we measure in vivo. Furthermore,
    we find that CCR7 signal termination by the G-protein-coupled receptor kinase
    6 (GRK6) is crucial for haptotactic but dispensable for chemotactic CCL21 gradient
    sensing in vitro and confirm those observations in vivo. These findings suggest
    that stable, tissue-bound CCL21 gradients as sustainable “roads” ensure optimal
    guidance in vivo.
article_processing_charge: No
author:
- first_name: Jan
  full_name: Schwarz, Jan
  id: 346C1EC6-F248-11E8-B48F-1D18A9856A87
  last_name: Schwarz
- first_name: Veronika
  full_name: Bierbaum, Veronika
  id: 3FD04378-F248-11E8-B48F-1D18A9856A87
  last_name: Bierbaum
- first_name: Kari
  full_name: Vaahtomeri, Kari
  id: 368EE576-F248-11E8-B48F-1D18A9856A87
  last_name: Vaahtomeri
  orcid: 0000-0001-7829-3518
- first_name: Robert
  full_name: Hauschild, Robert
  id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
  last_name: Hauschild
  orcid: 0000-0001-9843-3522
- first_name: Markus
  full_name: Brown, Markus
  id: 3DAB9AFC-F248-11E8-B48F-1D18A9856A87
  last_name: Brown
- first_name: Ingrid
  full_name: De Vries, Ingrid
  id: 4C7D837E-F248-11E8-B48F-1D18A9856A87
  last_name: De Vries
- first_name: Alexander F
  full_name: Leithner, Alexander F
  id: 3B1B77E4-F248-11E8-B48F-1D18A9856A87
  last_name: Leithner
  orcid: 0000-0002-1073-744X
- first_name: Anne
  full_name: Reversat, Anne
  id: 35B76592-F248-11E8-B48F-1D18A9856A87
  last_name: Reversat
  orcid: 0000-0003-0666-8928
- first_name: Jack
  full_name: Merrin, Jack
  id: 4515C308-F248-11E8-B48F-1D18A9856A87
  last_name: Merrin
  orcid: 0000-0001-5145-4609
- first_name: Teresa
  full_name: Tarrant, Teresa
  last_name: Tarrant
- first_name: Tobias
  full_name: Bollenbach, Tobias
  id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
  last_name: Bollenbach
  orcid: 0000-0003-4398-476X
- first_name: Michael K
  full_name: Sixt, Michael K
  id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
  last_name: Sixt
  orcid: 0000-0002-6620-9179
citation:
  ama: Schwarz J, Bierbaum V, Vaahtomeri K, et al. Dendritic cells interpret haptotactic
    chemokine gradients in a manner governed by signal to noise ratio and dependent
    on GRK6. <i>Current Biology</i>. 2017;27(9):1314-1325. doi:<a href="https://doi.org/10.1016/j.cub.2017.04.004">10.1016/j.cub.2017.04.004</a>
  apa: Schwarz, J., Bierbaum, V., Vaahtomeri, K., Hauschild, R., Brown, M., de Vries,
    I., … Sixt, M. K. (2017). Dendritic cells interpret haptotactic chemokine gradients
    in a manner governed by signal to noise ratio and dependent on GRK6. <i>Current
    Biology</i>. Cell Press. <a href="https://doi.org/10.1016/j.cub.2017.04.004">https://doi.org/10.1016/j.cub.2017.04.004</a>
  chicago: Schwarz, Jan, Veronika Bierbaum, Kari Vaahtomeri, Robert Hauschild, Markus
    Brown, Ingrid de Vries, Alexander F Leithner, et al. “Dendritic Cells Interpret
    Haptotactic Chemokine Gradients in a Manner Governed by Signal to Noise Ratio
    and Dependent on GRK6.” <i>Current Biology</i>. Cell Press, 2017. <a href="https://doi.org/10.1016/j.cub.2017.04.004">https://doi.org/10.1016/j.cub.2017.04.004</a>.
  ieee: J. Schwarz <i>et al.</i>, “Dendritic cells interpret haptotactic chemokine
    gradients in a manner governed by signal to noise ratio and dependent on GRK6,”
    <i>Current Biology</i>, vol. 27, no. 9. Cell Press, pp. 1314–1325, 2017.
  ista: Schwarz J, Bierbaum V, Vaahtomeri K, Hauschild R, Brown M, de Vries I, Leithner
    AF, Reversat A, Merrin J, Tarrant T, Bollenbach MT, Sixt MK. 2017. Dendritic cells
    interpret haptotactic chemokine gradients in a manner governed by signal to noise
    ratio and dependent on GRK6. Current Biology. 27(9), 1314–1325.
  mla: Schwarz, Jan, et al. “Dendritic Cells Interpret Haptotactic Chemokine Gradients
    in a Manner Governed by Signal to Noise Ratio and Dependent on GRK6.” <i>Current
    Biology</i>, vol. 27, no. 9, Cell Press, 2017, pp. 1314–25, doi:<a href="https://doi.org/10.1016/j.cub.2017.04.004">10.1016/j.cub.2017.04.004</a>.
  short: J. Schwarz, V. Bierbaum, K. Vaahtomeri, R. Hauschild, M. Brown, I. de Vries,
    A.F. Leithner, A. Reversat, J. Merrin, T. Tarrant, M.T. Bollenbach, M.K. Sixt,
    Current Biology 27 (2017) 1314–1325.
corr_author: '1'
date_created: 2018-12-11T11:47:51Z
date_published: 2017-05-09T00:00:00Z
date_updated: 2025-09-10T14:26:47Z
day: '09'
department:
- _id: MiSi
- _id: Bio
- _id: NanoFab
doi: 10.1016/j.cub.2017.04.004
ec_funded: 1
external_id:
  isi:
  - '000400741700021'
intvolume: '        27'
isi: 1
issue: '9'
language:
- iso: eng
month: '05'
oa_version: None
page: 1314 - 1325
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '291734'
  name: International IST Postdoc Fellowship Programme
- _id: 25A8E5EA-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Y 564-B12
  name: Cytoskeletal force generation and force transduction of migrating leukocytes
publication: Current Biology
publication_identifier:
  issn:
  - '09609822'
publication_status: published
publisher: Cell Press
publist_id: '7050'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dendritic cells interpret haptotactic chemokine gradients in a manner governed
  by signal to noise ratio and dependent on GRK6
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 27
year: '2017'
...
---
_id: '7064'
abstract:
- lang: eng
  text: 'The complex antiferromagnetic orders observed in the honeycomb iridates are
    a double-edged sword in the search for a quantum spin-liquid: both attesting that
    the magnetic interactions provide many of the necessary ingredients, while simultaneously
    impeding access. Focus has naturally been drawn to the unusual magnetic orders
    that hint at the underlying spin correlations. However, the study of any particular
    broken symmetry state generally provides little clue about the possibility of
    other nearby ground states. Here we use magnetic fields approaching 100 Tesla
    to reveal the extent of the spin correlations in γ-lithium iridate. We find that
    a small component of field along the magnetic easy-axis melts long-range order,
    revealing a bistable, strongly correlated spin state. Far from the usual destruction
    of antiferromagnetism via spin polarization, the high-field state possesses only
    a small fraction of the total iridium moment, without evidence for long-range
    order up to the highest attainable magnetic fields.'
article_number: '180'
article_processing_charge: No
article_type: original
author:
- first_name: Kimberly A
  full_name: Modic, Kimberly A
  id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425
  last_name: Modic
  orcid: 0000-0001-9760-3147
- first_name: B. J.
  full_name: Ramshaw, B. J.
  last_name: Ramshaw
- first_name: J. B.
  full_name: Betts, J. B.
  last_name: Betts
- first_name: Nicholas P.
  full_name: Breznay, Nicholas P.
  last_name: Breznay
- first_name: James G.
  full_name: Analytis, James G.
  last_name: Analytis
- first_name: Ross D.
  full_name: McDonald, Ross D.
  last_name: McDonald
- first_name: Arkady
  full_name: Shekhter, Arkady
  last_name: Shekhter
citation:
  ama: Modic KA, Ramshaw BJ, Betts JB, et al. Robust spin correlations at high magnetic
    fields in the harmonic honeycomb iridates. <i>Nature Communications</i>. 2017;8(1).
    doi:<a href="https://doi.org/10.1038/s41467-017-00264-6">10.1038/s41467-017-00264-6</a>
  apa: Modic, K. A., Ramshaw, B. J., Betts, J. B., Breznay, N. P., Analytis, J. G.,
    McDonald, R. D., &#38; Shekhter, A. (2017). Robust spin correlations at high magnetic
    fields in the harmonic honeycomb iridates. <i>Nature Communications</i>. Springer
    Nature. <a href="https://doi.org/10.1038/s41467-017-00264-6">https://doi.org/10.1038/s41467-017-00264-6</a>
  chicago: Modic, Kimberly A, B. J. Ramshaw, J. B. Betts, Nicholas P. Breznay, James
    G. Analytis, Ross D. McDonald, and Arkady Shekhter. “Robust Spin Correlations
    at High Magnetic Fields in the Harmonic Honeycomb Iridates.” <i>Nature Communications</i>.
    Springer Nature, 2017. <a href="https://doi.org/10.1038/s41467-017-00264-6">https://doi.org/10.1038/s41467-017-00264-6</a>.
  ieee: K. A. Modic <i>et al.</i>, “Robust spin correlations at high magnetic fields
    in the harmonic honeycomb iridates,” <i>Nature Communications</i>, vol. 8, no.
    1. Springer Nature, 2017.
  ista: Modic KA, Ramshaw BJ, Betts JB, Breznay NP, Analytis JG, McDonald RD, Shekhter
    A. 2017. Robust spin correlations at high magnetic fields in the harmonic honeycomb
    iridates. Nature Communications. 8(1), 180.
  mla: Modic, Kimberly A., et al. “Robust Spin Correlations at High Magnetic Fields
    in the Harmonic Honeycomb Iridates.” <i>Nature Communications</i>, vol. 8, no.
    1, 180, Springer Nature, 2017, doi:<a href="https://doi.org/10.1038/s41467-017-00264-6">10.1038/s41467-017-00264-6</a>.
  short: K.A. Modic, B.J. Ramshaw, J.B. Betts, N.P. Breznay, J.G. Analytis, R.D. McDonald,
    A. Shekhter, Nature Communications 8 (2017).
date_created: 2019-11-19T13:11:55Z
date_published: 2017-08-01T00:00:00Z
date_updated: 2021-01-12T08:11:39Z
day: '01'
ddc:
- '530'
doi: 10.1038/s41467-017-00264-6
extern: '1'
file:
- access_level: open_access
  checksum: 57fcd59d2f274b6b16cc89ea03cfd440
  content_type: application/pdf
  creator: cziletti
  date_created: 2019-11-20T14:12:54Z
  date_updated: 2020-07-14T12:47:48Z
  file_id: '7091'
  file_name: 2017_NatureComm_Modic.pdf
  file_size: 1242958
  relation: main_file
file_date_updated: 2020-07-14T12:47:48Z
has_accepted_license: '1'
intvolume: '         8'
issue: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
publication: Nature Communications
publication_identifier:
  issn:
  - 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Robust spin correlations at high magnetic fields in the harmonic honeycomb
  iridates
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2017'
...
---
_id: '1073'
abstract:
- lang: eng
  text: Let X and Y be finite simplicial sets (e.g. finite simplicial complexes),
    both equipped with a free simplicial action of a finite group G. Assuming that
    Y is d-connected and dimX≤2d, for some d≥1, we provide an algorithm that computes
    the set of all equivariant homotopy classes of equivariant continuous maps |X|→|Y|;
    the existence of such a map can be decided even for dimX≤2d+1. This yields the
    first algorithm for deciding topological embeddability of a k-dimensional finite
    simplicial complex into Rn under the condition k≤23n−1. More generally, we present
    an algorithm that, given a lifting-extension problem satisfying an appropriate
    stability assumption, computes the set of all homotopy classes of solutions. This
    result is new even in the non-equivariant situation.
article_processing_charge: No
arxiv: 1
author:
- first_name: Martin
  full_name: Čadek, Martin
  last_name: Čadek
- first_name: Marek
  full_name: Krcál, Marek
  id: 33E21118-F248-11E8-B48F-1D18A9856A87
  last_name: Krcál
- first_name: Lukáš
  full_name: Vokřínek, Lukáš
  last_name: Vokřínek
citation:
  ama: Čadek M, Krcál M, Vokřínek L. Algorithmic solvability of the lifting extension
    problem. <i>Discrete &#38; Computational Geometry</i>. 2017;54(4):915-965. doi:<a
    href="https://doi.org/10.1007/s00454-016-9855-6">10.1007/s00454-016-9855-6</a>
  apa: Čadek, M., Krcál, M., &#38; Vokřínek, L. (2017). Algorithmic solvability of
    the lifting extension problem. <i>Discrete &#38; Computational Geometry</i>. Springer.
    <a href="https://doi.org/10.1007/s00454-016-9855-6">https://doi.org/10.1007/s00454-016-9855-6</a>
  chicago: Čadek, Martin, Marek Krcál, and Lukáš Vokřínek. “Algorithmic Solvability
    of the Lifting Extension Problem.” <i>Discrete &#38; Computational Geometry</i>.
    Springer, 2017. <a href="https://doi.org/10.1007/s00454-016-9855-6">https://doi.org/10.1007/s00454-016-9855-6</a>.
  ieee: M. Čadek, M. Krcál, and L. Vokřínek, “Algorithmic solvability of the lifting
    extension problem,” <i>Discrete &#38; Computational Geometry</i>, vol. 54, no.
    4. Springer, pp. 915–965, 2017.
  ista: Čadek M, Krcál M, Vokřínek L. 2017. Algorithmic solvability of the lifting
    extension problem. Discrete &#38; Computational Geometry. 54(4), 915–965.
  mla: Čadek, Martin, et al. “Algorithmic Solvability of the Lifting Extension Problem.”
    <i>Discrete &#38; Computational Geometry</i>, vol. 54, no. 4, Springer, 2017,
    pp. 915–65, doi:<a href="https://doi.org/10.1007/s00454-016-9855-6">10.1007/s00454-016-9855-6</a>.
  short: M. Čadek, M. Krcál, L. Vokřínek, Discrete &#38; Computational Geometry 54
    (2017) 915–965.
date_created: 2018-12-11T11:50:00Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2025-06-04T08:11:10Z
day: '01'
department:
- _id: UlWa
doi: 10.1007/s00454-016-9855-6
external_id:
  arxiv:
  - '1307.6444'
  isi:
  - '000400072700008'
intvolume: '        54'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1307.6444
month: '06'
oa: 1
oa_version: Submitted Version
page: 915 - 965
publication: Discrete & Computational Geometry
publication_identifier:
  issn:
  - '01795376'
publication_status: published
publisher: Springer
publist_id: '6309'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Algorithmic solvability of the lifting extension problem
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 54
year: '2017'
...
---
OA_place: publisher
_id: '992'
abstract:
- lang: eng
  text: "An instance of the Constraint Satisfaction Problem (CSP) is given by a finite
    set of\r\nvariables, a finite domain of labels, and a set of constraints, each
    constraint acting on\r\na subset of the variables. The goal is to find an assignment
    of labels to its variables\r\nthat satisfies all constraints (or decide whether
    one exists). If we allow more general\r\n“soft” constraints, which come with (possibly
    infinite) costs of particular assignments,\r\nwe obtain instances from a richer
    class called Valued Constraint Satisfaction Problem\r\n(VCSP). There the goal
    is to find an assignment with minimum total cost.\r\nIn this thesis, we focus
    (assuming that P\r\n6\r\n=\r\nNP) on classifying computational com-\r\nplexity
    of CSPs and VCSPs under certain restricting conditions. Two results are the core\r\ncontent
    of the work. In one of them, we consider VCSPs parametrized by a constraint\r\nlanguage,
    that is the set of “soft” constraints allowed to form the instances, and finish\r\nthe
    complexity classification modulo (missing pieces of) complexity classification
    for\r\nanalogously parametrized CSP. The other result is a generalization of Edmonds’
    perfect\r\nmatching algorithm. This generalization contributes to complexity classfications
    in two\r\nways. First, it gives a new (largest known) polynomial-time solvable
    class of Boolean\r\nCSPs in which every variable may appear in at most two constraints
    and second, it\r\nsettles full classification of Boolean CSPs with planar drawing
    (again parametrized by a\r\nconstraint language)."
acknowledgement: FP7/2007-2013/ERC grant agreement no 616160
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Michal
  full_name: Rolinek, Michal
  id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
  last_name: Rolinek
citation:
  ama: Rolinek M. Complexity of constraint satisfaction. 2017. doi:<a href="https://doi.org/10.15479/AT:ISTA:th_815">10.15479/AT:ISTA:th_815</a>
  apa: Rolinek, M. (2017). <i>Complexity of constraint satisfaction</i>. Institute
    of Science and Technology Austria. <a href="https://doi.org/10.15479/AT:ISTA:th_815">https://doi.org/10.15479/AT:ISTA:th_815</a>
  chicago: Rolinek, Michal. “Complexity of Constraint Satisfaction.” Institute of
    Science and Technology Austria, 2017. <a href="https://doi.org/10.15479/AT:ISTA:th_815">https://doi.org/10.15479/AT:ISTA:th_815</a>.
  ieee: M. Rolinek, “Complexity of constraint satisfaction,” Institute of Science
    and Technology Austria, 2017.
  ista: Rolinek M. 2017. Complexity of constraint satisfaction. Institute of Science
    and Technology Austria.
  mla: Rolinek, Michal. <i>Complexity of Constraint Satisfaction</i>. Institute of
    Science and Technology Austria, 2017, doi:<a href="https://doi.org/10.15479/AT:ISTA:th_815">10.15479/AT:ISTA:th_815</a>.
  short: M. Rolinek, Complexity of Constraint Satisfaction, Institute of Science and
    Technology Austria, 2017.
corr_author: '1'
date_created: 2018-12-11T11:49:35Z
date_published: 2017-05-01T00:00:00Z
date_updated: 2026-04-08T14:17:06Z
day: '01'
ddc:
- '004'
degree_awarded: PhD
department:
- _id: VlKo
doi: 10.15479/AT:ISTA:th_815
ec_funded: 1
file:
- access_level: open_access
  checksum: 81761fb939acb7585c36629f765b4373
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:07:55Z
  date_updated: 2020-07-14T12:48:18Z
  file_id: '4654'
  file_name: IST-2017-815-v1+3_final_blank_signature_maybe_pdfa.pdf
  file_size: 786145
  relation: main_file
- access_level: closed
  checksum: 2b2d7e1d6c1c79a9795a7aa0f860baf3
  content_type: application/zip
  creator: dernst
  date_created: 2019-04-05T08:43:24Z
  date_updated: 2020-07-14T12:48:18Z
  file_id: '6208'
  file_name: 2017_Thesis_Rolinek_source.zip
  file_size: 5936337
  relation: source_file
file_date_updated: 2020-07-14T12:48:18Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '97'
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '616160'
  name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6407'
pubrep_id: '815'
status: public
supervisor:
- first_name: Vladimir
  full_name: Kolmogorov, Vladimir
  id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
  last_name: Kolmogorov
title: Complexity of constraint satisfaction
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2017'
...
---
_id: '424'
abstract:
- lang: eng
  text: 'We show that very weak topological assumptions are enough to ensure the existence
    of a Helly-type theorem. More precisely, we show that for any non-negative integers
    b and d there exists an integer h(b, d) such that the following holds. If F is
    a finite family of subsets of Rd such that βi(∩G)≤b for any G⊊F and every 0 ≤
    i ≤ [d/2]-1 then F has Helly number at most h(b, d). Here βi denotes the reduced
    Z2-Betti numbers (with singular homology). These topological conditions are sharp:
    not controlling any of these [d/2] first Betti numbers allow for families with
    unbounded Helly number. Our proofs combine homological non-embeddability results
    with a Ramsey-based approach to build, given an arbitrary simplicial complex K,
    some well-behaved chain map C*(K)→C*(Rd).'
article_processing_charge: No
arxiv: 1
author:
- first_name: Xavier
  full_name: Goaoc, Xavier
  last_name: Goaoc
- first_name: Pavel
  full_name: Paták, Pavel
  last_name: Paták
- first_name: Zuzana
  full_name: Patakova, Zuzana
  last_name: Patakova
  orcid: 0000-0002-3975-1683
- first_name: Martin
  full_name: Tancer, Martin
  last_name: Tancer
  orcid: 0000-0002-1191-6714
- first_name: Uli
  full_name: Wagner, Uli
  id: 36690CA2-F248-11E8-B48F-1D18A9856A87
  last_name: Wagner
  orcid: 0000-0002-1494-0568
citation:
  ama: 'Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Bounding helly numbers via
    betti numbers. In: Loebl M, Nešetřil J, Thomas R, eds. <i>A Journey through Discrete
    Mathematics: A Tribute to Jiri Matousek</i>. A Journey Through Discrete Mathematics.
    Springer; 2017:407-447. doi:<a href="https://doi.org/10.1007/978-3-319-44479-6_17">10.1007/978-3-319-44479-6_17</a>'
  apa: 'Goaoc, X., Paták, P., Patakova, Z., Tancer, M., &#38; Wagner, U. (2017). Bounding
    helly numbers via betti numbers. In M. Loebl, J. Nešetřil, &#38; R. Thomas (Eds.),
    <i>A Journey through Discrete Mathematics: A Tribute to Jiri Matousek</i> (pp.
    407–447). Springer. <a href="https://doi.org/10.1007/978-3-319-44479-6_17">https://doi.org/10.1007/978-3-319-44479-6_17</a>'
  chicago: 'Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner.
    “Bounding Helly Numbers via Betti Numbers.” In <i>A Journey through Discrete Mathematics:
    A Tribute to Jiri Matousek</i>, edited by Martin Loebl, Jaroslav Nešetřil, and
    Robin Thomas, 407–47. A Journey Through Discrete Mathematics. Springer, 2017.
    <a href="https://doi.org/10.1007/978-3-319-44479-6_17">https://doi.org/10.1007/978-3-319-44479-6_17</a>.'
  ieee: 'X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Bounding helly
    numbers via betti numbers,” in <i>A Journey through Discrete Mathematics: A Tribute
    to Jiri Matousek</i>, M. Loebl, J. Nešetřil, and R. Thomas, Eds. Springer, 2017,
    pp. 407–447.'
  ista: 'Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2017.Bounding helly numbers
    via betti numbers. In: A Journey through Discrete Mathematics: A Tribute to Jiri
    Matousek. , 407–447.'
  mla: 'Goaoc, Xavier, et al. “Bounding Helly Numbers via Betti Numbers.” <i>A Journey
    through Discrete Mathematics: A Tribute to Jiri Matousek</i>, edited by Martin
    Loebl et al., Springer, 2017, pp. 407–47, doi:<a href="https://doi.org/10.1007/978-3-319-44479-6_17">10.1007/978-3-319-44479-6_17</a>.'
  short: 'X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, M. Loebl, J.
    Nešetřil, R. Thomas (Eds.), A Journey through Discrete Mathematics: A Tribute
    to Jiri Matousek, Springer, 2017, pp. 407–447.'
date_created: 2018-12-11T11:46:24Z
date_published: 2017-10-06T00:00:00Z
date_updated: 2026-06-18T18:48:49Z
day: '06'
ddc:
- '500'
department:
- _id: UlWa
doi: 10.1007/978-3-319-44479-6_17
editor:
- first_name: Martin
  full_name: Loebl, Martin
  last_name: Loebl
- first_name: Jaroslav
  full_name: Nešetřil, Jaroslav
  last_name: Nešetřil
- first_name: Robin
  full_name: Thomas, Robin
  last_name: Thomas
external_id:
  arxiv:
  - '1310.4613'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1310.4613
month: '10'
oa: 1
oa_version: Published Version
page: 407 - 447
publication: 'A Journey through Discrete Mathematics: A Tribute to Jiri Matousek'
publication_identifier:
  isbn:
  - 978-331944479-6
publication_status: published
publisher: Springer
publist_id: '7399'
quality_controlled: '1'
related_material:
  record:
  - id: '1512'
    relation: earlier_version
    status: public
scopus_import: '1'
series_title: A Journey Through Discrete Mathematics
status: public
title: Bounding helly numbers via betti numbers
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '487'
abstract:
- lang: eng
  text: In this paper we study network architecture for unlicensed cellular networking
    for outdoor coverage in TV white spaces. The main technology proposed for TV white
    spaces is 802.11af, a Wi-Fi variant adapted for TV frequencies. However, 802.11af
    is originally designed for improved indoor propagation. We show that long links,
    typical for outdoor use, exacerbate known Wi-Fi issues, such as hidden and exposed
    terminal, and significantly reduce its efficiency. Instead, we propose CellFi,
    an alternative architecture based on LTE. LTE is designed for long-range coverage
    and throughput efficiency, but it is also designed to operate in tightly controlled
    and centrally managed networks. CellFi overcomes these problems by designing an
    LTE-compatible spectrum database component, mandatory for TV white space networking,
    and introducing an interference management component for distributed coordination.
    CellFi interference management is compatible with existing LTE mechanisms, requires
    no explicit communication between base stations, and is more efficient than CSMA
    for long links. We evaluate our design through extensive real world evaluation
    on of-the-shelf LTE equipment and simulations. We show that, compared to 802.11af,
    it increases coverage by 40% and reduces median flow completion times by 2.3x.
article_processing_charge: No
author:
- first_name: Ghufran
  full_name: Baig, Ghufran
  last_name: Baig
- first_name: Bozidar
  full_name: Radunovic, Bozidar
  last_name: Radunovic
- first_name: Dan-Adrian
  full_name: Alistarh, Dan-Adrian
  id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
  last_name: Alistarh
  orcid: 0000-0003-3650-940X
- first_name: Matthew
  full_name: Balkwill, Matthew
  last_name: Balkwill
- first_name: Thomas
  full_name: Karagiannis, Thomas
  last_name: Karagiannis
- first_name: Lili
  full_name: Qiu, Lili
  last_name: Qiu
citation:
  ama: 'Baig G, Radunovic B, Alistarh D-A, Balkwill M, Karagiannis T, Qiu L. Towards
    unlicensed cellular networks in TV white spaces. In: <i>Proceedings of the 2017
    13th International Conference on Emerging Networking EXperiments and Technologies</i>.
    ACM; 2017:2-14. doi:<a href="https://doi.org/10.1145/3143361.3143367">10.1145/3143361.3143367</a>'
  apa: 'Baig, G., Radunovic, B., Alistarh, D.-A., Balkwill, M., Karagiannis, T., &#38;
    Qiu, L. (2017). Towards unlicensed cellular networks in TV white spaces. In <i>Proceedings
    of the 2017 13th International Conference on emerging Networking EXperiments and
    Technologies</i> (pp. 2–14). Incheon, South Korea: ACM. <a href="https://doi.org/10.1145/3143361.3143367">https://doi.org/10.1145/3143361.3143367</a>'
  chicago: Baig, Ghufran, Bozidar Radunovic, Dan-Adrian Alistarh, Matthew Balkwill,
    Thomas Karagiannis, and Lili Qiu. “Towards Unlicensed Cellular Networks in TV
    White Spaces.” In <i>Proceedings of the 2017 13th International Conference on
    Emerging Networking EXperiments and Technologies</i>, 2–14. ACM, 2017. <a href="https://doi.org/10.1145/3143361.3143367">https://doi.org/10.1145/3143361.3143367</a>.
  ieee: G. Baig, B. Radunovic, D.-A. Alistarh, M. Balkwill, T. Karagiannis, and L.
    Qiu, “Towards unlicensed cellular networks in TV white spaces,” in <i>Proceedings
    of the 2017 13th International Conference on emerging Networking EXperiments and
    Technologies</i>, Incheon, South Korea, 2017, pp. 2–14.
  ista: 'Baig G, Radunovic B, Alistarh D-A, Balkwill M, Karagiannis T, Qiu L. 2017.
    Towards unlicensed cellular networks in TV white spaces. Proceedings of the 2017
    13th International Conference on emerging Networking EXperiments and Technologies.
    CoNEXT: Conference on emerging Networking EXperiments and Technologies, 2–14.'
  mla: Baig, Ghufran, et al. “Towards Unlicensed Cellular Networks in TV White Spaces.”
    <i>Proceedings of the 2017 13th International Conference on Emerging Networking
    EXperiments and Technologies</i>, ACM, 2017, pp. 2–14, doi:<a href="https://doi.org/10.1145/3143361.3143367">10.1145/3143361.3143367</a>.
  short: G. Baig, B. Radunovic, D.-A. Alistarh, M. Balkwill, T. Karagiannis, L. Qiu,
    in:, Proceedings of the 2017 13th International Conference on Emerging Networking
    EXperiments and Technologies, ACM, 2017, pp. 2–14.
conference:
  end_date: 2017-12-15
  location: Incheon, South Korea
  name: 'CoNEXT: Conference on emerging Networking EXperiments and Technologies'
  start_date: 2017-12-12
corr_author: '1'
date_created: 2018-12-11T11:46:45Z
date_published: 2017-11-28T00:00:00Z
date_updated: 2025-09-18T09:50:43Z
day: '28'
department:
- _id: DaAl
doi: 10.1145/3143361.3143367
external_id:
  isi:
  - '000526087500002'
isi: 1
language:
- iso: eng
month: '11'
oa_version: None
page: 2 - 14
publication: Proceedings of the 2017 13th International Conference on emerging Networking
  EXperiments and Technologies
publication_identifier:
  isbn:
  - 978-145035422-6
publication_status: published
publisher: ACM
publist_id: '7333'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Towards unlicensed cellular networks in TV white spaces
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2017'
...
---
_id: '11572'
abstract:
- lang: eng
  text: We present spectroscopic follow-up of candidate luminous Ly α emitters (LAEs)
    at z = 5.7–6.6 in the SA22 field with VLT/X-SHOOTER. We confirm two new luminous
    LAEs at z = 5.676 (SR6) and z = 6.532 (VR7), and also present HST follow-up of
    both sources. These sources have luminosities LLy α ≈ 3 × 1043 erg s−1, very high
    rest-frame equivalent widths of EW0 ≳ 200 Å and narrow Ly α lines (200–340 km s−1).
    VR7 is the most UV-luminous LAE at z > 6.5, with M1500 = −22.5, even brighter
    in the UV than CR7. Besides Ly α, we do not detect any other rest-frame UV lines
    in the spectra of SR6 and VR7, and argue that rest-frame UV lines are easier to
    observe in bright galaxies with low Ly α equivalent widths. We confirm that Ly α
    line widths increase with Ly α luminosity at z = 5.7, while there are indications
    that Ly α lines of faint LAEs become broader at z = 6.6, potentially due to reionization.
    We find a large spread of up to 3 dex in UV luminosity for >L⋆ LAEs, but find
    that the Ly α luminosity of the brightest LAEs is strongly related to UV luminosity
    at z = 6.6. Under basic assumptions, we find that several LAEs at z ≈ 6–7 have
    Ly α escape fractions ≳ 100  per cent, indicating bursty star formation histories,
    alternative Ly α production mechanisms, or dust attenuating Ly α emission differently
    than UV emission. Finally, we present a method to compute ξion, the production
    efficiency of ionizing photons, and find that LAEs at z ≈ 6–7 have high values
    of log10(ξion/Hz erg−1) ≈ 25.51 ± 0.09 that may alleviate the need for high Lyman-Continuum
    escape fractions required for reionization.
acknowledgement: 'We thank the referee for a constructive report that has improved
  the quality and clarity of this work. The authors thank Grecco Oyarzún for discussions.
  JM acknowledges the support of a Huygens PhD fellowship from Leiden University.
  DS acknowledges financial support from the Netherlands Organisation for Scientific
  research (NWO) through a Veni fellowship and from Lancaster University through an
  Early Career Internal Grant A100679. BD acknowledges financial support from NASA
  through the Astrophysics Data Analysis Program (ADAP), grant number NNX12AE20G.
  We thank Kasper Schmidt for providing measurements. Based on observations with the
  W.M. Keck Observatory through programme C267D. The W.M. Keck Observatory is operated
  as a scientific partnership amongst the California Institute of Technology, the
  University of California and the National Aeronautics and Space Administration.
  Based on observations made with ESO Telescopes at the La Silla Paranal Observatory
  under programme IDs 097.A-0943, 294.A 5018 and 098.A-0819 and on data products produced
  by TERAPIX and the Cambridge Astronomy Survey Unit on behalf of the UltraVISTA consortium.
  The authors acknowledge the award of observing time (W16AN004) and of service time
  (SW2014b20) on the William Herschel Telescope (WHT). WHT and its service programme
  are operated on the island of La Palma by the Isaac Newton Group in the Spanish
  Observatorio del Roque de los Muchachos of the Instituto de Astrofisica de Canarias.
  Based on observations made with the NASA/ESA HST, obtained (from the Data Archive)
  at the Space Telescope Science Institute, which is operated by the Association of
  Universities for Research in Astronomy, Inc., under NASA contract NAS 5-26555. These
  observations are associated with programme #14699. We are grateful for the excellent
  data sets from the COSMOS, UltraVISTA, SXDS, UDS and CFHTLS survey teams; without
  these legacy surveys, this research would have been impossible. We have benefited
  from the public available programming language PYTHON, including the NUMPY, MATPLOTLIB,
  PYFITS, SCIPY and ASTROPY packages, the astronomical imaging tools SEXTRACTOR, SWARP
  and SCAMP and the TOPCAT analysis tool (Taylor 2013).'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Jorryt J
  full_name: Matthee, Jorryt J
  id: 7439a258-f3c0-11ec-9501-9df22fe06720
  last_name: Matthee
  orcid: 0000-0003-2871-127X
- first_name: David
  full_name: Sobral, David
  last_name: Sobral
- first_name: Behnam
  full_name: Darvish, Behnam
  last_name: Darvish
- first_name: Sérgio
  full_name: Santos, Sérgio
  last_name: Santos
- first_name: Bahram
  full_name: Mobasher, Bahram
  last_name: Mobasher
- first_name: Ana
  full_name: Paulino-Afonso, Ana
  last_name: Paulino-Afonso
- first_name: Huub
  full_name: Röttgering, Huub
  last_name: Röttgering
- first_name: Lara
  full_name: Alegre, Lara
  last_name: Alegre
citation:
  ama: Matthee JJ, Sobral D, Darvish B, et al. Spectroscopic properties of luminous
    Ly α emitters at z ≈ 6–7 and comparison to the Lyman-break population. <i>Monthly
    Notices of the Royal Astronomical Society</i>. 2017;472(1):772-787. doi:<a href="https://doi.org/10.1093/mnras/stx2061">10.1093/mnras/stx2061</a>
  apa: Matthee, J. J., Sobral, D., Darvish, B., Santos, S., Mobasher, B., Paulino-Afonso,
    A., … Alegre, L. (2017). Spectroscopic properties of luminous Ly α emitters at
    z ≈ 6–7 and comparison to the Lyman-break population. <i>Monthly Notices of the
    Royal Astronomical Society</i>. Oxford University Press. <a href="https://doi.org/10.1093/mnras/stx2061">https://doi.org/10.1093/mnras/stx2061</a>
  chicago: Matthee, Jorryt J, David Sobral, Behnam Darvish, Sérgio Santos, Bahram
    Mobasher, Ana Paulino-Afonso, Huub Röttgering, and Lara Alegre. “Spectroscopic
    Properties of Luminous Ly α Emitters at z ≈ 6–7 and Comparison to the Lyman-Break
    Population.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford
    University Press, 2017. <a href="https://doi.org/10.1093/mnras/stx2061">https://doi.org/10.1093/mnras/stx2061</a>.
  ieee: J. J. Matthee <i>et al.</i>, “Spectroscopic properties of luminous Ly α emitters
    at z ≈ 6–7 and comparison to the Lyman-break population,” <i>Monthly Notices of
    the Royal Astronomical Society</i>, vol. 472, no. 1. Oxford University Press,
    pp. 772–787, 2017.
  ista: Matthee JJ, Sobral D, Darvish B, Santos S, Mobasher B, Paulino-Afonso A, Röttgering
    H, Alegre L. 2017. Spectroscopic properties of luminous Ly α emitters at z ≈ 6–7
    and comparison to the Lyman-break population. Monthly Notices of the Royal Astronomical
    Society. 472(1), 772–787.
  mla: Matthee, Jorryt J., et al. “Spectroscopic Properties of Luminous Ly α Emitters
    at z ≈ 6–7 and Comparison to the Lyman-Break Population.” <i>Monthly Notices of
    the Royal Astronomical Society</i>, vol. 472, no. 1, Oxford University Press,
    2017, pp. 772–87, doi:<a href="https://doi.org/10.1093/mnras/stx2061">10.1093/mnras/stx2061</a>.
  short: J.J. Matthee, D. Sobral, B. Darvish, S. Santos, B. Mobasher, A. Paulino-Afonso,
    H. Röttgering, L. Alegre, Monthly Notices of the Royal Astronomical Society 472
    (2017) 772–787.
date_created: 2022-07-13T09:47:39Z
date_published: 2017-11-01T00:00:00Z
date_updated: 2024-10-14T11:36:26Z
day: '01'
doi: 10.1093/mnras/stx2061
extern: '1'
external_id:
  arxiv:
  - '1706.06591'
intvolume: '       472'
issue: '1'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'galaxies: evolution – galaxies: high-redshift'
- dark ages
- reionization
- first stars
- 'cosmology: observations'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1706.06591
month: '11'
oa: 1
oa_version: Preprint
page: 772-787
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
  eissn:
  - 1365-2966
  issn:
  - 0035-8711
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Spectroscopic properties of luminous Ly α emitters at z ≈ 6–7 and comparison
  to the Lyman-break population
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 472
year: '2017'
...
---
_id: '1168'
abstract:
- lang: eng
  text: Optimum experimental design theory has recently been extended for parameter
    estimation in copula models. The use of these models allows one to gain in flexibility
    by considering the model parameter set split into marginal and dependence parameters.
    However, this separation also leads to the natural issue of estimating only a
    subset of all model parameters. In this work, we treat this problem with the application
    of the (Formula presented.)-optimality to copula models. First, we provide an
    extension of the corresponding equivalence theory. Then, we analyze a wide range
    of flexible copula models to highlight the usefulness of (Formula presented.)-optimality
    in many possible scenarios. Finally, we discuss how the usage of the introduced
    design criterion also relates to the more general issue of copula selection and
    optimal design for model discrimination.
acknowledgement: 'This work has been supported by the project ANR-2011-IS01-001-01
  “DESIRE” and Austrian Science Fund (FWF) I833-N18. Open access funding is provided
  by the Austrian Science Fund (FWF). '
article_processing_charge: No
author:
- first_name: Elisa
  full_name: Perrone, Elisa
  id: 2A5F8724-F248-11E8-B48F-1D18A9856A87
  last_name: Perrone
  orcid: 0000-0003-0370-9835
- first_name: Andreas
  full_name: Rappold, Andreas
  last_name: Rappold
- first_name: Werner
  full_name: Müller, Werner
  last_name: Müller
citation:
  ama: Perrone E, Rappold A, Müller W. D inf s optimality in copula models. <i>Statistical
    Methods and Applications</i>. 2017;26(3):403-418. doi:<a href="https://doi.org/10.1007/s10260-016-0375-6">10.1007/s10260-016-0375-6</a>
  apa: Perrone, E., Rappold, A., &#38; Müller, W. (2017). D inf s optimality in copula
    models. <i>Statistical Methods and Applications</i>. Springer. <a href="https://doi.org/10.1007/s10260-016-0375-6">https://doi.org/10.1007/s10260-016-0375-6</a>
  chicago: Perrone, Elisa, Andreas Rappold, and Werner Müller. “D Inf s Optimality
    in Copula Models.” <i>Statistical Methods and Applications</i>. Springer, 2017.
    <a href="https://doi.org/10.1007/s10260-016-0375-6">https://doi.org/10.1007/s10260-016-0375-6</a>.
  ieee: E. Perrone, A. Rappold, and W. Müller, “D inf s optimality in copula models,”
    <i>Statistical Methods and Applications</i>, vol. 26, no. 3. Springer, pp. 403–418,
    2017.
  ista: Perrone E, Rappold A, Müller W. 2017. D inf s optimality in copula models.
    Statistical Methods and Applications. 26(3), 403–418.
  mla: Perrone, Elisa, et al. “D Inf s Optimality in Copula Models.” <i>Statistical
    Methods and Applications</i>, vol. 26, no. 3, Springer, 2017, pp. 403–18, doi:<a
    href="https://doi.org/10.1007/s10260-016-0375-6">10.1007/s10260-016-0375-6</a>.
  short: E. Perrone, A. Rappold, W. Müller, Statistical Methods and Applications 26
    (2017) 403–418.
corr_author: '1'
date_created: 2018-12-11T11:50:31Z
date_published: 2017-08-01T00:00:00Z
date_updated: 2024-10-09T20:57:17Z
day: '01'
ddc:
- '519'
department:
- _id: CaUh
doi: 10.1007/s10260-016-0375-6
external_id:
  isi:
  - '000407973200004'
file:
- access_level: open_access
  checksum: 0b2d1b647ca96e9ef13a14b8b6775e0f
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:16:13Z
  date_updated: 2020-07-14T12:44:37Z
  file_id: '5199'
  file_name: IST-2017-739-v1+2_10260_2016_375_MOESM1_ESM.pdf
  file_size: 56664
  relation: main_file
- access_level: open_access
  checksum: 3321ef34e02e28acfc427f77cf32812a
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:16:14Z
  date_updated: 2020-07-14T12:44:37Z
  file_id: '5200'
  file_name: IST-2017-739-v1+3_s10260-016-0375-6.pdf
  file_size: 688953
  relation: main_file
file_date_updated: 2020-07-14T12:44:37Z
has_accepted_license: '1'
intvolume: '        26'
isi: 1
issue: '3'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
page: 403 - 418
publication: Statistical Methods and Applications
publication_status: published
publisher: Springer
publist_id: '6189'
pubrep_id: '739'
quality_controlled: '1'
scopus_import: '1'
status: public
title: D inf s optimality in copula models
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 26
year: '2017'
...
---
OA_place: repository
OA_type: green
_id: '21615'
abstract:
- lang: eng
  text: Focused electron beams can induce electromagnetic radiation from periodic
    surfaces. We have used low-energy electrons (1.5-6kV) to induce visible light
    emission from nanoscale gratings (50nm and 60nm). Our results coincide well with
    numerical simulations.
article_number: FM3H.6
article_processing_charge: No
arxiv: 1
author:
- first_name: Aviram
  full_name: Massuda, Aviram
  last_name: Massuda
- first_name: Charles
  full_name: Roques-Carmes, Charles
  id: e2e68fc9-6505-11ef-a541-eb4e72cc3e82
  last_name: Roques-Carmes
- first_name: Yujia
  full_name: Yang, Yujia
  last_name: Yang
- first_name: Steven E.
  full_name: Kooi, Steven E.
  last_name: Kooi
- first_name: Yi
  full_name: Yang, Yi
  last_name: Yang
- first_name: Chitraang
  full_name: Murdia, Chitraang
  last_name: Murdia
- first_name: Karl K.
  full_name: Berggren, Karl K.
  last_name: Berggren
- first_name: Ido
  full_name: Kaminer, Ido
  last_name: Kaminer
- first_name: Marin
  full_name: Soljačić, Marin
  last_name: Soljačić
citation:
  ama: 'Massuda A, Roques-Carmes C, Yang Y, et al. Smith-Purcell radiation from low-energy
    electrons. In: <i>Conference on Lasers and Electro-Optics</i>. Optica Publishing
    Group; 2017. doi:<a href="https://doi.org/10.1364/cleo_qels.2017.fm3h.6">10.1364/cleo_qels.2017.fm3h.6</a>'
  apa: 'Massuda, A., Roques-Carmes, C., Yang, Y., Kooi, S. E., Yang, Y., Murdia, C.,
    … Soljačić, M. (2017). Smith-Purcell radiation from low-energy electrons. In <i>Conference
    on Lasers and Electro-Optics</i>. San Jose, CA, United States: Optica Publishing
    Group. <a href="https://doi.org/10.1364/cleo_qels.2017.fm3h.6">https://doi.org/10.1364/cleo_qels.2017.fm3h.6</a>'
  chicago: Massuda, Aviram, Charles Roques-Carmes, Yujia Yang, Steven E. Kooi, Yi
    Yang, Chitraang Murdia, Karl K. Berggren, Ido Kaminer, and Marin Soljačić. “Smith-Purcell
    Radiation from Low-Energy Electrons.” In <i>Conference on Lasers and Electro-Optics</i>.
    Optica Publishing Group, 2017. <a href="https://doi.org/10.1364/cleo_qels.2017.fm3h.6">https://doi.org/10.1364/cleo_qels.2017.fm3h.6</a>.
  ieee: A. Massuda <i>et al.</i>, “Smith-Purcell radiation from low-energy electrons,”
    in <i>Conference on Lasers and Electro-Optics</i>, San Jose, CA, United States,
    2017.
  ista: 'Massuda A, Roques-Carmes C, Yang Y, Kooi SE, Yang Y, Murdia C, Berggren KK,
    Kaminer I, Soljačić M. 2017. Smith-Purcell radiation from low-energy electrons.
    Conference on Lasers and Electro-Optics. CLEO: Fundamental Science, FM3H.6.'
  mla: Massuda, Aviram, et al. “Smith-Purcell Radiation from Low-Energy Electrons.”
    <i>Conference on Lasers and Electro-Optics</i>, FM3H.6, Optica Publishing Group,
    2017, doi:<a href="https://doi.org/10.1364/cleo_qels.2017.fm3h.6">10.1364/cleo_qels.2017.fm3h.6</a>.
  short: A. Massuda, C. Roques-Carmes, Y. Yang, S.E. Kooi, Y. Yang, C. Murdia, K.K.
    Berggren, I. Kaminer, M. Soljačić, in:, Conference on Lasers and Electro-Optics,
    Optica Publishing Group, 2017.
conference:
  end_date: 2017-05-19
  location: San Jose, CA, United States
  name: 'CLEO: Fundamental Science'
  start_date: 2017-05-14
date_created: 2026-03-30T12:22:48Z
date_published: 2017-05-01T00:00:00Z
date_updated: 2026-05-05T06:46:39Z
day: '01'
doi: 10.1364/cleo_qels.2017.fm3h.6
extern: '1'
external_id:
  arxiv:
  - '1710.05358'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.1710.05358
month: '05'
oa: 1
oa_version: Preprint
publication: Conference on Lasers and Electro-Optics
publication_identifier:
  eisbn:
  - '9781943580279'
publication_status: published
publisher: Optica Publishing Group
quality_controlled: '1'
scopus_import: '1'
status: public
title: Smith-Purcell radiation from low-energy electrons
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '1207'
abstract:
- lang: eng
  text: The eigenvalue distribution of the sum of two large Hermitian matrices, when
    one of them is conjugated by a Haar distributed unitary matrix, is asymptotically
    given by the free convolution of their spectral distributions. We prove that this
    convergence also holds locally in the bulk of the spectrum, down to the optimal
    scales larger than the eigenvalue spacing. The corresponding eigenvectors are
    fully delocalized. Similar results hold for the sum of two real symmetric matrices,
    when one is conjugated by Haar orthogonal matrix.
article_processing_charge: Yes (via OA deal)
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
  id: 434AD0AE-F248-11E8-B48F-1D18A9856A87
  last_name: Schnelli
  orcid: 0000-0003-0954-3231
citation:
  ama: Bao Z, Erdös L, Schnelli K. Local law of addition of random matrices on optimal
    scale. <i>Communications in Mathematical Physics</i>. 2017;349(3):947-990. doi:<a
    href="https://doi.org/10.1007/s00220-016-2805-6">10.1007/s00220-016-2805-6</a>
  apa: Bao, Z., Erdös, L., &#38; Schnelli, K. (2017). Local law of addition of random
    matrices on optimal scale. <i>Communications in Mathematical Physics</i>. Springer.
    <a href="https://doi.org/10.1007/s00220-016-2805-6">https://doi.org/10.1007/s00220-016-2805-6</a>
  chicago: Bao, Zhigang, László Erdös, and Kevin Schnelli. “Local Law of Addition
    of Random Matrices on Optimal Scale.” <i>Communications in Mathematical Physics</i>.
    Springer, 2017. <a href="https://doi.org/10.1007/s00220-016-2805-6">https://doi.org/10.1007/s00220-016-2805-6</a>.
  ieee: Z. Bao, L. Erdös, and K. Schnelli, “Local law of addition of random matrices
    on optimal scale,” <i>Communications in Mathematical Physics</i>, vol. 349, no.
    3. Springer, pp. 947–990, 2017.
  ista: Bao Z, Erdös L, Schnelli K. 2017. Local law of addition of random matrices
    on optimal scale. Communications in Mathematical Physics. 349(3), 947–990.
  mla: Bao, Zhigang, et al. “Local Law of Addition of Random Matrices on Optimal Scale.”
    <i>Communications in Mathematical Physics</i>, vol. 349, no. 3, Springer, 2017,
    pp. 947–90, doi:<a href="https://doi.org/10.1007/s00220-016-2805-6">10.1007/s00220-016-2805-6</a>.
  short: Z. Bao, L. Erdös, K. Schnelli, Communications in Mathematical Physics 349
    (2017) 947–990.
date_created: 2018-12-11T11:50:43Z
date_published: 2017-02-01T00:00:00Z
date_updated: 2025-07-10T11:50:22Z
day: '01'
ddc:
- '530'
department:
- _id: LaEr
doi: 10.1007/s00220-016-2805-6
ec_funded: 1
external_id:
  isi:
  - '000393696700005'
file:
- access_level: open_access
  checksum: ddff79154c3daf27237de5383b1264a9
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:14:47Z
  date_updated: 2020-07-14T12:44:39Z
  file_id: '5102'
  file_name: IST-2016-722-v1+1_s00220-016-2805-6.pdf
  file_size: 1033743
  relation: main_file
file_date_updated: 2020-07-14T12:44:39Z
has_accepted_license: '1'
intvolume: '       349'
isi: 1
issue: '3'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 947 - 990
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '338804'
  name: Random matrices, universality and disordered quantum systems
publication: Communications in Mathematical Physics
publication_identifier:
  issn:
  - 0010-3616
publication_status: published
publisher: Springer
publist_id: '6141'
pubrep_id: '722'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Local law of addition of random matrices on optimal scale
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 349
year: '2017'
...
