---
_id: '1027'
abstract:
- lang: eng
  text: The rising prevalence of antibiotic resistant bacteria is an increasingly
    serious public health challenge. To address this problem, recent work ranging
    from clinical studies to theoretical modeling has provided valuable insights into
    the mechanisms of resistance, its emergence and spread, and ways to counteract
    it. A deeper understanding of the underlying dynamics of resistance evolution
    will require a combination of experimental and theoretical expertise from different
    disciplines and new technology for studying evolution in the laboratory. Here,
    we review recent advances in the quantitative understanding of the mechanisms
    and evolution of antibiotic resistance. We focus on key theoretical concepts and
    new technology that enables well-controlled experiments. We further highlight
    key challenges that can be met in the near future to ultimately develop effective
    strategies for combating resistance.
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Marta
  full_name: Lukacisinova, Marta
  id: 4342E402-F248-11E8-B48F-1D18A9856A87
  last_name: Lukacisinova
  orcid: 0000-0002-2519-8004
- first_name: Mark Tobias
  full_name: Bollenbach, Mark Tobias
  id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
  last_name: Bollenbach
  orcid: 0000-0003-4398-476X
citation:
  ama: Lukacisinova M, Bollenbach MT. Toward a quantitative understanding of antibiotic
    resistance evolution. <i>Current Opinion in Biotechnology</i>. 2017;46:90-97.
    doi:<a href="https://doi.org/10.1016/j.copbio.2017.02.013">10.1016/j.copbio.2017.02.013</a>
  apa: Lukacisinova, M., &#38; Bollenbach, M. T. (2017). Toward a quantitative understanding
    of antibiotic resistance evolution. <i>Current Opinion in Biotechnology</i>. Elsevier.
    <a href="https://doi.org/10.1016/j.copbio.2017.02.013">https://doi.org/10.1016/j.copbio.2017.02.013</a>
  chicago: Lukacisinova, Marta, and Mark Tobias Bollenbach. “Toward a Quantitative
    Understanding of Antibiotic Resistance Evolution.” <i>Current Opinion in Biotechnology</i>.
    Elsevier, 2017. <a href="https://doi.org/10.1016/j.copbio.2017.02.013">https://doi.org/10.1016/j.copbio.2017.02.013</a>.
  ieee: M. Lukacisinova and M. T. Bollenbach, “Toward a quantitative understanding
    of antibiotic resistance evolution,” <i>Current Opinion in Biotechnology</i>,
    vol. 46. Elsevier, pp. 90–97, 2017.
  ista: Lukacisinova M, Bollenbach MT. 2017. Toward a quantitative understanding of
    antibiotic resistance evolution. Current Opinion in Biotechnology. 46, 90–97.
  mla: Lukacisinova, Marta, and Mark Tobias Bollenbach. “Toward a Quantitative Understanding
    of Antibiotic Resistance Evolution.” <i>Current Opinion in Biotechnology</i>,
    vol. 46, Elsevier, 2017, pp. 90–97, doi:<a href="https://doi.org/10.1016/j.copbio.2017.02.013">10.1016/j.copbio.2017.02.013</a>.
  short: M. Lukacisinova, M.T. Bollenbach, Current Opinion in Biotechnology 46 (2017)
    90–97.
corr_author: '1'
date_created: 2018-12-11T11:49:45Z
date_published: 2017-08-01T00:00:00Z
date_updated: 2026-10-06T22:31:01Z
day: '01'
ddc:
- '570'
department:
- _id: ToBo
doi: 10.1016/j.copbio.2017.02.013
ec_funded: 1
external_id:
  isi:
  - '000408077400015'
file:
- access_level: open_access
  content_type: application/pdf
  creator: dernst
  date_created: 2019-01-18T09:57:57Z
  date_updated: 2019-01-18T09:57:57Z
  file_id: '5846'
  file_name: 2017_CurrentOpinion_Lukaciinova.pdf
  file_size: 858338
  relation: main_file
  success: 1
file_date_updated: 2019-01-18T09:57:57Z
fulldoi: https://doi.org/10.1016/j.copbio.2017.02.013
has_accepted_license: '1'
intvolume: '        46'
isi: 1
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 90 - 97
project:
- _id: 25E9AF9E-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P27201-B22
  name: Revealing the mechanisms underlying drug interactions
- _id: 25E83C2C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '303507'
  name: Optimality principles in responses to antibiotics
- _id: 25EB3A80-B435-11E9-9278-68D0E5697425
  grant_number: RGP0042/2013
  name: Revealing the fundamental limits of cell growth
publication: Current Opinion in Biotechnology
publication_status: published
publisher: Elsevier
publist_id: '6364'
pubrep_id: '801'
quality_controlled: '1'
related_material:
  record:
  - id: '6263'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Toward a quantitative understanding of antibiotic resistance evolution
tmp:
  image: /images/cc_by_nc_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
    (CC BY-NC-ND 4.0)
  short: CC BY-NC-ND (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 46
year: '2017'
...
---
_id: '682'
abstract:
- lang: eng
  text: Left-right asymmetry is a fundamental feature of higher-order brain structure;
    however, the molecular basis of brain asymmetry remains unclear. We recently identified
    structural and functional asymmetries in mouse hippocampal circuitry that result
    from the asymmetrical distribution of two distinct populations of pyramidal cell
    synapses that differ in the density of the NMDA receptor subunit GluRε2 (also
    known as NR2B, GRIN2B or GluN2B). By examining the synaptic distribution of ε2
    subunits, we previously found that β2-microglobulin-deficient mice, which lack
    cell surface expression of the vast majority of major histocompatibility complex
    class I (MHCI) proteins, do not exhibit circuit asymmetry. In the present study,
    we conducted electrophysiological and anatomical analyses on the hippocampal circuitry
    of mice with a knockout of the paired immunoglobulin-like receptor B (PirB), an
    MHCI receptor. As in β2-microglobulin-deficient mice, the PirB-deficient hippocampus
    lacked circuit asymmetries. This finding that MHCI loss-of-function mice and PirB
    knockout mice have identical phenotypes suggests that MHCI signals that produce
    hippocampal asymmetries are transduced through PirB. Our results provide evidence
    for a critical role of the MHCI/PirB signaling system in the generation of asymmetries
    in hippocampal circuitry.
article_number: e0179377
article_processing_charge: No
article_type: original
author:
- first_name: Hikari
  full_name: Ukai, Hikari
  last_name: Ukai
- first_name: Aiko
  full_name: Kawahara, Aiko
  last_name: Kawahara
- first_name: Keiko
  full_name: Hirayama, Keiko
  last_name: Hirayama
- first_name: Matthew J
  full_name: Case, Matthew J
  id: 44B7CA5A-F248-11E8-B48F-1D18A9856A87
  last_name: Case
- first_name: Shotaro
  full_name: Aino, Shotaro
  last_name: Aino
- first_name: Masahiro
  full_name: Miyabe, Masahiro
  last_name: Miyabe
- first_name: Ken
  full_name: Wakita, Ken
  last_name: Wakita
- first_name: Ryohei
  full_name: Oogi, Ryohei
  last_name: Oogi
- first_name: Michiyo
  full_name: Kasayuki, Michiyo
  last_name: Kasayuki
- first_name: Shihomi
  full_name: Kawashima, Shihomi
  last_name: Kawashima
- first_name: Shunichi
  full_name: Sugimoto, Shunichi
  last_name: Sugimoto
- first_name: Kanako
  full_name: Chikamatsu, Kanako
  last_name: Chikamatsu
- first_name: Noritaka
  full_name: Nitta, Noritaka
  last_name: Nitta
- first_name: Tsuneyuki
  full_name: Koga, Tsuneyuki
  last_name: Koga
- first_name: Ryuichi
  full_name: Shigemoto, Ryuichi
  id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
  last_name: Shigemoto
  orcid: 0000-0001-8761-9444
- first_name: Toshiyuki
  full_name: Takai, Toshiyuki
  last_name: Takai
- first_name: Isao
  full_name: Ito, Isao
  last_name: Ito
citation:
  ama: Ukai H, Kawahara A, Hirayama K, et al. PirB regulates asymmetries in hippocampal
    circuitry. <i>PLoS One</i>. 2017;12(6). doi:<a href="https://doi.org/10.1371/journal.pone.0179377">10.1371/journal.pone.0179377</a>
  apa: Ukai, H., Kawahara, A., Hirayama, K., Case, M. J., Aino, S., Miyabe, M., …
    Ito, I. (2017). PirB regulates asymmetries in hippocampal circuitry. <i>PLoS One</i>.
    Public Library of Science. <a href="https://doi.org/10.1371/journal.pone.0179377">https://doi.org/10.1371/journal.pone.0179377</a>
  chicago: Ukai, Hikari, Aiko Kawahara, Keiko Hirayama, Matthew J Case, Shotaro Aino,
    Masahiro Miyabe, Ken Wakita, et al. “PirB Regulates Asymmetries in Hippocampal
    Circuitry.” <i>PLoS One</i>. Public Library of Science, 2017. <a href="https://doi.org/10.1371/journal.pone.0179377">https://doi.org/10.1371/journal.pone.0179377</a>.
  ieee: H. Ukai <i>et al.</i>, “PirB regulates asymmetries in hippocampal circuitry,”
    <i>PLoS One</i>, vol. 12, no. 6. Public Library of Science, 2017.
  ista: Ukai H, Kawahara A, Hirayama K, Case MJ, Aino S, Miyabe M, Wakita K, Oogi
    R, Kasayuki M, Kawashima S, Sugimoto S, Chikamatsu K, Nitta N, Koga T, Shigemoto
    R, Takai T, Ito I. 2017. PirB regulates asymmetries in hippocampal circuitry.
    PLoS One. 12(6), e0179377.
  mla: Ukai, Hikari, et al. “PirB Regulates Asymmetries in Hippocampal Circuitry.”
    <i>PLoS One</i>, vol. 12, no. 6, e0179377, Public Library of Science, 2017, doi:<a
    href="https://doi.org/10.1371/journal.pone.0179377">10.1371/journal.pone.0179377</a>.
  short: H. Ukai, A. Kawahara, K. Hirayama, M.J. Case, S. Aino, M. Miyabe, K. Wakita,
    R. Oogi, M. Kasayuki, S. Kawashima, S. Sugimoto, K. Chikamatsu, N. Nitta, T. Koga,
    R. Shigemoto, T. Takai, I. Ito, PLoS One 12 (2017).
date_created: 2018-12-11T11:47:54Z
date_published: 2017-06-01T00:00:00Z
date_updated: 2026-10-06T22:31:03Z
day: '01'
ddc:
- '571'
department:
- _id: RySh
doi: 10.1371/journal.pone.0179377
external_id:
  isi:
  - '000402923200125'
file:
- access_level: open_access
  checksum: 24dd19c46fb1c761b0bcbbcd1025a3a8
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:12:16Z
  date_updated: 2020-07-14T12:47:40Z
  file_id: '4934'
  file_name: IST-2017-897-v1+1_journal.pone.0179377.pdf
  file_size: 5798454
  relation: main_file
file_date_updated: 2020-07-14T12:47:40Z
fulldoi: https://doi.org/10.1371/journal.pone.0179377
has_accepted_license: '1'
intvolume: '        12'
isi: 1
issue: '6'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: PLoS One
publication_identifier:
  issn:
  - 1932-6203
publication_status: published
publisher: Public Library of Science
publist_id: '7034'
pubrep_id: '897'
quality_controlled: '1'
related_material:
  record:
  - id: '51'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: PirB regulates asymmetries in hippocampal circuitry
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 12
year: '2017'
...
---
_id: '1024'
abstract:
- lang: eng
  text: The history of auxin and cytokinin biology including the initial discoveries
    by father–son duo Charles Darwin and Francis Darwin (1880), and Gottlieb Haberlandt
    (1919) is a beautiful demonstration of unceasing continuity of research. Novel
    findings are integrated into existing hypotheses and models and deepen our understanding
    of biological principles. At the same time new questions are triggered and hand
    to hand with this new methodologies are developed to address these new challenges.
alternative_title:
- Methods in Molecular Biology
article_processing_charge: No
author:
- first_name: Andrej
  full_name: Hurny, Andrej
  id: 4DC4AF46-F248-11E8-B48F-1D18A9856A87
  last_name: Hurny
  orcid: 0000-0003-3638-1426
- first_name: Eva
  full_name: Benková, Eva
  id: 38F4F166-F248-11E8-B48F-1D18A9856A87
  last_name: Benková
  orcid: 0000-0002-8510-9739
citation:
  ama: Hurny A, Benková E. Methodological advances in auxin and cytokinin biology.
    <i>Auxins and Cytokinins in Plant Biology</i>. 2017;1569:1-29. doi:<a href="https://doi.org/10.1007/978-1-4939-6831-2_1">10.1007/978-1-4939-6831-2_1</a>
  apa: Hurny, A., &#38; Benková, E. (2017). Methodological advances in auxin and cytokinin
    biology. <i>Auxins and Cytokinins in Plant Biology</i>. Springer. <a href="https://doi.org/10.1007/978-1-4939-6831-2_1">https://doi.org/10.1007/978-1-4939-6831-2_1</a>
  chicago: Hurny, Andrej, and Eva Benková. “Methodological Advances in Auxin and Cytokinin
    Biology.” <i>Auxins and Cytokinins in Plant Biology</i>. Springer, 2017. <a href="https://doi.org/10.1007/978-1-4939-6831-2_1">https://doi.org/10.1007/978-1-4939-6831-2_1</a>.
  ieee: A. Hurny and E. Benková, “Methodological advances in auxin and cytokinin biology,”
    <i>Auxins and Cytokinins in Plant Biology</i>, vol. 1569. Springer, pp. 1–29,
    2017.
  ista: Hurny A, Benková E. 2017. Methodological advances in auxin and cytokinin biology.
    Auxins and Cytokinins in Plant Biology. 1569, 1–29.
  mla: Hurny, Andrej, and Eva Benková. “Methodological Advances in Auxin and Cytokinin
    Biology.” <i>Auxins and Cytokinins in Plant Biology</i>, vol. 1569, Springer,
    2017, pp. 1–29, doi:<a href="https://doi.org/10.1007/978-1-4939-6831-2_1">10.1007/978-1-4939-6831-2_1</a>.
  short: A. Hurny, E. Benková, Auxins and Cytokinins in Plant Biology 1569 (2017)
    1–29.
corr_author: '1'
date_created: 2018-12-11T11:49:45Z
date_published: 2017-03-17T00:00:00Z
date_updated: 2026-10-06T22:31:06Z
day: '17'
ddc:
- '575'
department:
- _id: EvBe
doi: 10.1007/978-1-4939-6831-2_1
file:
- access_level: open_access
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:14:18Z
  date_updated: 2019-10-15T07:47:05Z
  file_id: '5068'
  file_name: IST-2018-1019-v1+1_Hurny_MethodsMolBiol_2017.pdf
  file_size: 840646
  relation: main_file
file_date_updated: 2019-10-15T07:47:05Z
fulldoi: https://doi.org/10.1007/978-1-4939-6831-2_1
has_accepted_license: '1'
intvolume: '      1569'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
page: 1 - 29
project:
- _id: 2542D156-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: I 1774-B16
  name: Hormone cross-talk drives nutrient dependent plant development
publication: Auxins and Cytokinins in Plant Biology
publication_identifier:
  issn:
  - 1064-3745
publication_status: published
publisher: Springer
publist_id: '6369'
pubrep_id: '1019'
quality_controlled: '1'
related_material:
  record:
  - id: '539'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Methodological advances in auxin and cytokinin biology
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1569
year: '2017'
...
---
_id: '1028'
abstract:
- lang: eng
  text: Optogenetics and photopharmacology provide spatiotemporally precise control
    over protein interactions and protein function in cells and animals. Optogenetic
    methods that are sensitive to green light and can be used to break protein complexes
    are not broadly available but would enable multichromatic experiments with previously
    inaccessible biological targets. Herein, we repurposed cobalamin (vitamin B12)
    binding domains of bacterial CarH transcription factors for green-light-induced
    receptor dissociation. In cultured cells, we observed oligomerization-induced
    cell signaling for the fibroblast growth factor receptor 1 fused to cobalamin-binding
    domains in the dark that was rapidly eliminated upon illumination. In zebrafish
    embryos expressing fusion receptors, green light endowed control over aberrant
    fibroblast growth factor signaling during development. Green-light-induced domain
    dissociation and light-inactivated receptors will critically expand the optogenetic
    toolbox for control of biological processes.
acknowledgement: "This work was supported by a grant from the European Union\U0010FC1Ds
  Seventh Framework Programme (CIG-303564). E.R. was supported by the graduate program
  MolecularDrugTargets (Austrian Science Fund (FWF), W1232) and a FemTech fellowship
  (Austrian Research Promotion Agency, 3580812)"
article_processing_charge: No
author:
- first_name: Stephanie
  full_name: Kainrath, Stephanie
  id: 32CFBA64-F248-11E8-B48F-1D18A9856A87
  last_name: Kainrath
  orcid: 0000-0002-6709-2195
- first_name: Manuela
  full_name: Stadler, Manuela
  last_name: Stadler
- first_name: Eva
  full_name: Gschaider-Reichhart, Eva
  id: 3FEE232A-F248-11E8-B48F-1D18A9856A87
  last_name: Gschaider-Reichhart
  orcid: 0000-0002-7218-7738
- first_name: Martin
  full_name: Distel, Martin
  last_name: Distel
- first_name: Harald L
  full_name: Janovjak, Harald L
  id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
  last_name: Janovjak
  orcid: 0000-0002-8023-9315
citation:
  ama: Kainrath S, Stadler M, Gschaider-Reichhart E, Distel M, Janovjak HL. Green-light-induced
    inactivation of receptor signaling using cobalamin-binding domains. <i>Angewandte
    Chemie International Edition</i>. 2017;56(16):4608-4611. doi:<a href="https://doi.org/10.1002/anie.201611998">10.1002/anie.201611998</a>
  apa: Kainrath, S., Stadler, M., Gschaider-Reichhart, E., Distel, M., &#38; Janovjak,
    H. L. (2017). Green-light-induced inactivation of receptor signaling using cobalamin-binding
    domains. <i>Angewandte Chemie International Edition</i>. Wiley. <a href="https://doi.org/10.1002/anie.201611998">https://doi.org/10.1002/anie.201611998</a>
  chicago: Kainrath, Stephanie, Manuela Stadler, Eva Gschaider-Reichhart, Martin Distel,
    and Harald L Janovjak. “Green-Light-Induced Inactivation of Receptor Signaling
    Using Cobalamin-Binding Domains.” <i>Angewandte Chemie International Edition</i>.
    Wiley, 2017. <a href="https://doi.org/10.1002/anie.201611998">https://doi.org/10.1002/anie.201611998</a>.
  ieee: S. Kainrath, M. Stadler, E. Gschaider-Reichhart, M. Distel, and H. L. Janovjak,
    “Green-light-induced inactivation of receptor signaling using cobalamin-binding
    domains,” <i>Angewandte Chemie International Edition</i>, vol. 56, no. 16. Wiley,
    pp. 4608–4611, 2017.
  ista: Kainrath S, Stadler M, Gschaider-Reichhart E, Distel M, Janovjak HL. 2017.
    Green-light-induced inactivation of receptor signaling using cobalamin-binding
    domains. Angewandte Chemie International Edition. 56(16), 4608–4611.
  mla: Kainrath, Stephanie, et al. “Green-Light-Induced Inactivation of Receptor Signaling
    Using Cobalamin-Binding Domains.” <i>Angewandte Chemie International Edition</i>,
    vol. 56, no. 16, Wiley, 2017, pp. 4608–11, doi:<a href="https://doi.org/10.1002/anie.201611998">10.1002/anie.201611998</a>.
  short: S. Kainrath, M. Stadler, E. Gschaider-Reichhart, M. Distel, H.L. Janovjak,
    Angewandte Chemie International Edition 56 (2017) 4608–4611.
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T11:49:46Z
date_published: 2017-03-20T00:00:00Z
date_updated: 2026-10-06T22:31:06Z
day: '20'
ddc:
- '540'
department:
- _id: CaGu
- _id: HaJa
doi: 10.1002/anie.201611998
ec_funded: 1
external_id:
  isi:
  - '000398154000038'
file:
- access_level: open_access
  content_type: application/pdf
  creator: dernst
  date_created: 2019-01-18T09:39:55Z
  date_updated: 2019-01-18T09:39:55Z
  file_id: '5845'
  file_name: 2017_communications_Kainrath.pdf
  file_size: 2614942
  relation: main_file
  success: 1
file_date_updated: 2019-01-18T09:39:55Z
fulldoi: https://doi.org/10.1002/anie.201611998
has_accepted_license: '1'
intvolume: '        56'
isi: 1
issue: '16'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 4608-4611
project:
- _id: 25548C20-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '303564'
  name: Microbial Ion Channels for Synthetic Neurobiology
- _id: 26AA4EF2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: W1232-B24
  name: Molecular Drug Targets
publication: Angewandte Chemie International Edition
publication_identifier:
  issn:
  - 1433-7851
publication_status: published
publisher: Wiley
publist_id: '6362'
quality_controlled: '1'
related_material:
  record:
  - id: '418'
    relation: dissertation_contains
    status: public
  - id: '7680'
    relation: part_of_dissertation
    status: public
scopus_import: '1'
status: public
title: Green-light-induced inactivation of receptor signaling using cobalamin-binding
  domains
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: 56
year: '2017'
...
---
_id: '1082'
abstract:
- lang: eng
  text: In many applications, it is desirable to extract only the relevant aspects
    of data. A principled way to do this is the information bottleneck (IB) method,
    where one seeks a code that maximises information about a relevance variable,
    Y, while constraining the information encoded about the original data, X. Unfortunately
    however, the IB method is computationally demanding when data are high-dimensional
    and/or non-gaussian. Here we propose an approximate variational scheme for maximising
    a lower bound on the IB objective, analogous to variational EM. Using this method,
    we derive an IB algorithm to recover features that are both relevant and sparse.
    Finally, we demonstrate how kernelised versions of the algorithm can be used to
    address a broad range of problems with non-linear relation between X and Y.
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Matthew J
  full_name: Chalk, Matthew J
  id: 2BAAC544-F248-11E8-B48F-1D18A9856A87
  last_name: Chalk
  orcid: 0000-0001-7782-4436
- first_name: Olivier
  full_name: Marre, Olivier
  last_name: Marre
- first_name: Gasper
  full_name: Tkacik, Gasper
  id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
  last_name: Tkacik
  orcid: 0000-0002-6699-1455
citation:
  ama: 'Chalk MJ, Marre O, Tkačik G. Relevant sparse codes with variational information
    bottleneck. In: Vol 29. Neural Information Processing Systems Foundation; 2016:1965-1973.'
  apa: 'Chalk, M. J., Marre, O., &#38; Tkačik, G. (2016). Relevant sparse codes with
    variational information bottleneck (Vol. 29, pp. 1965–1973). Presented at the
    NIPS: Neural Information Processing Systems, Barcelona, Spain: Neural Information
    Processing Systems Foundation.'
  chicago: Chalk, Matthew J, Olivier Marre, and Gašper Tkačik. “Relevant Sparse Codes
    with Variational Information Bottleneck,” 29:1965–73. Neural Information Processing
    Systems Foundation, 2016.
  ieee: 'M. J. Chalk, O. Marre, and G. Tkačik, “Relevant sparse codes with variational
    information bottleneck,” presented at the NIPS: Neural Information Processing
    Systems, Barcelona, Spain, 2016, vol. 29, pp. 1965–1973.'
  ista: 'Chalk MJ, Marre O, Tkačik G. 2016. Relevant sparse codes with variational
    information bottleneck. NIPS: Neural Information Processing Systems, Advances
    in Neural Information Processing Systems, vol. 29, 1965–1973.'
  mla: Chalk, Matthew J., et al. <i>Relevant Sparse Codes with Variational Information
    Bottleneck</i>. Vol. 29, Neural Information Processing Systems Foundation, 2016,
    pp. 1965–73.
  short: M.J. Chalk, O. Marre, G. Tkačik, in:, Neural Information Processing Systems
    Foundation, 2016, pp. 1965–1973.
conference:
  end_date: 2016-12-10
  location: Barcelona, Spain
  name: 'NIPS: Neural Information Processing Systems'
  start_date: 2016-12-05
date_created: 2018-12-11T11:50:03Z
date_published: 2016-12-01T00:00:00Z
date_updated: 2025-06-03T11:33:51Z
day: '01'
department:
- _id: GaTk
external_id:
  arxiv:
  - '1605.07332'
intvolume: '        29'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1605.07332
month: '12'
oa: 1
oa_version: Preprint
page: 1965-1973
publication_status: published
publisher: Neural Information Processing Systems Foundation
publist_id: '6298'
quality_controlled: '1'
related_material:
  link:
  - relation: other
    url: https://papers.nips.cc/paper/6101-relevant-sparse-codes-with-variational-information-bottleneck
scopus_import: '1'
status: public
title: Relevant sparse codes with variational information bottleneck
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 29
year: '2016'
...
---
_id: '1090'
abstract:
- lang: eng
  text: ' While weighted automata provide a natural framework to express quantitative
    properties, many basic properties like average response time cannot be expressed
    with weighted automata. Nested weighted automata extend weighted automata and
    consist of a master automaton and a set of slave automata that are invoked by
    the master automaton. Nested weighted automata are strictly more expressive than
    weighted automata (e.g., average response time can be expressed with nested weighted
    automata), but the basic decision questions have higher complexity (e.g., for
    deterministic automata, the emptiness question for nested weighted automata is
    PSPACE-hard, whereas the corresponding complexity for weighted automata is PTIME).
    We consider a natural subclass of nested weighted automata where at any point
    at most a bounded number k of slave automata can be active. We focus on automata
    whose master value function is the limit average. We show that these nested weighted
    automata with bounded width are strictly more expressive than weighted automata
    (e.g., average response time with no overlapping requests can be expressed with
    bound k=1, but not with non-nested weighted automata). We show that the complexity
    of the basic decision problems (i.e., emptiness and universality) for the subclass
    with k constant matches the complexity for weighted automata. Moreover, when k
    is part of the input given in unary we establish PSPACE-completeness.'
acknowledgement: "This research was supported in part by the Austrian Science Fund
  (FWF) under grants S11402-N23\r\n(RiSE/SHiNE) and Z211-N23 (Wittgenstein Award),
  ERC Start grant (279307: Graph Games), Vienna\r\nScience and Technology Fund (WWTF)
  through project ICT15-003 and by the National Science Centre\r\n(NCN), Poland under
  grant 2014/15/D/ST6/04543."
alternative_title:
- LIPIcs
article_number: '24'
article_processing_charge: No
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- 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: Jan
  full_name: Otop, Jan
  id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
  last_name: Otop
citation:
  ama: 'Chatterjee K, Henzinger TA, Otop J. Nested weighted limit-average automata
    of bounded width. In: Vol 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
    2016. doi:<a href="https://doi.org/10.4230/LIPIcs.MFCS.2016.24">10.4230/LIPIcs.MFCS.2016.24</a>'
  apa: 'Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2016). Nested weighted limit-average
    automata of bounded width (Vol. 58). Presented at the MFCS: Mathematical Foundations
    of Computer Science, Krakow; Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
    <a href="https://doi.org/10.4230/LIPIcs.MFCS.2016.24">https://doi.org/10.4230/LIPIcs.MFCS.2016.24</a>'
  chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted
    Limit-Average Automata of Bounded Width,” Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik, 2016. <a href="https://doi.org/10.4230/LIPIcs.MFCS.2016.24">https://doi.org/10.4230/LIPIcs.MFCS.2016.24</a>.
  ieee: 'K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted limit-average
    automata of bounded width,” presented at the MFCS: Mathematical Foundations of
    Computer Science, Krakow; Poland, 2016, vol. 58.'
  ista: 'Chatterjee K, Henzinger TA, Otop J. 2016. Nested weighted limit-average automata
    of bounded width. MFCS: Mathematical Foundations of Computer Science, LIPIcs,
    vol. 58, 24.'
  mla: Chatterjee, Krishnendu, et al. <i>Nested Weighted Limit-Average Automata of
    Bounded Width</i>. Vol. 58, 24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    2016, doi:<a href="https://doi.org/10.4230/LIPIcs.MFCS.2016.24">10.4230/LIPIcs.MFCS.2016.24</a>.
  short: K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik, 2016.
conference:
  end_date: 2016-08-26
  location: Krakow; Poland
  name: 'MFCS: Mathematical Foundations of Computer Science'
  start_date: 2016-08-22
date_created: 2018-12-11T11:50:05Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2025-07-10T11:50:02Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
- _id: ToHe
doi: 10.4230/LIPIcs.MFCS.2016.24
ec_funded: 1
file:
- access_level: open_access
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:17:31Z
  date_updated: 2018-12-12T10:17:31Z
  file_id: '5286'
  file_name: IST-2017-795-v1+1_LIPIcs-MFCS-2016-24.pdf
  file_size: 564560
  relation: main_file
file_date_updated: 2018-12-12T10:17:31Z
fulldoi: https://doi.org/10.4230/LIPIcs.MFCS.2016.24
has_accepted_license: '1'
intvolume: '        58'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z211
  name: Formal methods for the design and analysis of complex systems
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '279307'
  name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
  grant_number: ICT15-003
  name: Efficient Algorithms for Computer Aided Verification
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '6286'
pubrep_id: '795'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nested weighted limit-average automata of bounded width
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 58
year: '2016'
...
---
_id: '1093'
abstract:
- lang: eng
  text: 'We introduce a general class of distances (metrics) between Markov chains,
    which are based on linear behaviour. This class encompasses distances given topologically
    (such as the total variation distance or trace distance) as well as by temporal
    logics or automata. We investigate which of the distances can be approximated
    by observing the systems, i.e. by black-box testing or simulation, and we provide
    both negative and positive results. '
acknowledgement: "This research was funded in part by the European Research Council
  (ERC) under grant agreement 267989\r\n(QUAREM), the Austrian Science Fund (FWF)
  under grants project S11402-N23 (RiSE and SHiNE)\r\nand Z211-N23 (Wittgenstein Award),
  by the Czech Science Foundation Grant No. P202/12/G061, and\r\nby the SNSF Advanced
  Postdoc. Mobility Fellowship – grant number P300P2_161067."
alternative_title:
- LIPIcs
article_number: '20'
author:
- first_name: Przemyslaw
  full_name: Daca, Przemyslaw
  id: 49351290-F248-11E8-B48F-1D18A9856A87
  last_name: Daca
- 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: Jan
  full_name: Kretinsky, Jan
  id: 44CEF464-F248-11E8-B48F-1D18A9856A87
  last_name: Kretinsky
  orcid: 0000-0002-8122-2881
- first_name: Tatjana
  full_name: Petrov, Tatjana
  id: 3D5811FC-F248-11E8-B48F-1D18A9856A87
  last_name: Petrov
  orcid: 0000-0002-9041-0905
citation:
  ama: 'Daca P, Henzinger TA, Kretinsky J, Petrov T. Linear distances between Markov
    chains. In: Vol 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a
    href="https://doi.org/10.4230/LIPIcs.CONCUR.2016.20">10.4230/LIPIcs.CONCUR.2016.20</a>'
  apa: 'Daca, P., Henzinger, T. A., Kretinsky, J., &#38; Petrov, T. (2016). Linear
    distances between Markov chains (Vol. 59). Presented at the CONCUR: Concurrency
    Theory, Quebec City; Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
    <a href="https://doi.org/10.4230/LIPIcs.CONCUR.2016.20">https://doi.org/10.4230/LIPIcs.CONCUR.2016.20</a>'
  chicago: Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov.
    “Linear Distances between Markov Chains,” Vol. 59. Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik, 2016. <a href="https://doi.org/10.4230/LIPIcs.CONCUR.2016.20">https://doi.org/10.4230/LIPIcs.CONCUR.2016.20</a>.
  ieee: 'P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Linear distances
    between Markov chains,” presented at the CONCUR: Concurrency Theory, Quebec City;
    Canada, 2016, vol. 59.'
  ista: 'Daca P, Henzinger TA, Kretinsky J, Petrov T. 2016. Linear distances between
    Markov chains. CONCUR: Concurrency Theory, LIPIcs, vol. 59, 20.'
  mla: Daca, Przemyslaw, et al. <i>Linear Distances between Markov Chains</i>. Vol.
    59, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href="https://doi.org/10.4230/LIPIcs.CONCUR.2016.20">10.4230/LIPIcs.CONCUR.2016.20</a>.
  short: P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, in:, Schloss Dagstuhl -
    Leibniz-Zentrum für Informatik, 2016.
conference:
  end_date: 2016-08-26
  location: Quebec City; Canada
  name: 'CONCUR: Concurrency Theory'
  start_date: 2016-08-23
date_created: 2018-12-11T11:50:06Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2026-04-15T10:02:12Z
day: '01'
ddc:
- '004'
department:
- _id: ToHe
- _id: KrCh
- _id: CaGu
doi: 10.4230/LIPIcs.CONCUR.2016.20
ec_funded: 1
file:
- access_level: open_access
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:11:39Z
  date_updated: 2018-12-12T10:11:39Z
  file_id: '4895'
  file_name: IST-2017-794-v1+1_LIPIcs-CONCUR-2016-20.pdf
  file_size: 501827
  relation: main_file
file_date_updated: 2018-12-12T10:11:39Z
fulldoi: https://doi.org/10.4230/LIPIcs.CONCUR.2016.20
has_accepted_license: '1'
intvolume: '        59'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '267989'
  name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z211
  name: Formal methods for the design and analysis of complex systems
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '6283'
pubrep_id: '794'
quality_controlled: '1'
related_material:
  record:
  - id: '1155'
    relation: dissertation_contains
    status: public
scopus_import: 1
status: public
title: Linear distances between Markov chains
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 59
year: '2016'
...
---
_id: '1095'
abstract:
- lang: eng
  text: ' The semantics of concurrent data structures is usually given by a sequential
    specification and a consistency condition. Linearizability is the most popular
    consistency condition due to its simplicity and general applicability. Nevertheless,
    for applications that do not require all guarantees offered by linearizability,
    recent research has focused on improving performance and scalability of concurrent
    data structures by relaxing their semantics. In this paper, we present local linearizability,
    a relaxed consistency condition that is applicable to container-type concurrent
    data structures like pools, queues, and stacks. While linearizability requires
    that the effect of each operation is observed by all threads at the same time,
    local linearizability only requires that for each thread T, the effects of its
    local insertion operations and the effects of those removal operations that remove
    values inserted by T are observed by all threads at the same time. We investigate
    theoretical and practical properties of local linearizability and its relationship
    to many existing consistency conditions. We present a generic implementation method
    for locally linearizable data structures that uses existing linearizable data
    structures as building blocks. Our implementations show performance and scalability
    improvements over the original building blocks and outperform the fastest existing
    container-type implementations. '
acknowledgement: "This work has been supported by the National Research Network RiSE
  on Rigorous Systems Engineering\r\n(Austrian Science Fund (FWF): S11402-N23, S11403-N23,
  S11404-N23, S11411-N23), a Google\r\nPhD Fellowship, an Erwin Schrödinger Fellowship
  (Austrian Science Fund (FWF): J3696-N26), EPSRC\r\ngrants EP/H005633/1 and EP/K008528/1,
  the Vienna Science and Technology Fund (WWTF) trough\r\ngrant PROSEED, the European
  Research Council (ERC) under grant 267989 (QUAREM) and by the\r\nAustrian Science
  Fund (FWF) under grant Z211-N23 (Wittgenstein Award)."
alternative_title:
- LIPIcs
article_number: '6'
author:
- first_name: Andreas
  full_name: Haas, Andreas
  last_name: Haas
- 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: Andreas
  full_name: Holzer, Andreas
  last_name: Holzer
- first_name: Christoph
  full_name: Kirsch, Christoph
  last_name: Kirsch
- first_name: Michael
  full_name: Lippautz, Michael
  last_name: Lippautz
- first_name: Hannes
  full_name: Payer, Hannes
  last_name: Payer
- first_name: Ali
  full_name: Sezgin, Ali
  id: 4C7638DA-F248-11E8-B48F-1D18A9856A87
  last_name: Sezgin
- first_name: Ana
  full_name: Sokolova, Ana
  last_name: Sokolova
- first_name: Helmut
  full_name: Veith, Helmut
  last_name: Veith
citation:
  ama: 'Haas A, Henzinger TA, Holzer A, et al. Local linearizability for concurrent
    container-type data structures. In: <i>Leibniz International Proceedings in Informatics</i>.
    Vol 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a href="https://doi.org/10.4230/LIPIcs.CONCUR.2016.6">10.4230/LIPIcs.CONCUR.2016.6</a>'
  apa: 'Haas, A., Henzinger, T. A., Holzer, A., Kirsch, C., Lippautz, M., Payer, H.,
    … Veith, H. (2016). Local linearizability for concurrent container-type data structures.
    In <i>Leibniz International Proceedings in Informatics</i> (Vol. 59). Quebec City;
    Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href="https://doi.org/10.4230/LIPIcs.CONCUR.2016.6">https://doi.org/10.4230/LIPIcs.CONCUR.2016.6</a>'
  chicago: Haas, Andreas, Thomas A Henzinger, Andreas Holzer, Christoph Kirsch, Michael
    Lippautz, Hannes Payer, Ali Sezgin, Ana Sokolova, and Helmut Veith. “Local Linearizability
    for Concurrent Container-Type Data Structures.” In <i>Leibniz International Proceedings
    in Informatics</i>, Vol. 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    2016. <a href="https://doi.org/10.4230/LIPIcs.CONCUR.2016.6">https://doi.org/10.4230/LIPIcs.CONCUR.2016.6</a>.
  ieee: A. Haas <i>et al.</i>, “Local linearizability for concurrent container-type
    data structures,” in <i>Leibniz International Proceedings in Informatics</i>,
    Quebec City; Canada, 2016, vol. 59.
  ista: 'Haas A, Henzinger TA, Holzer A, Kirsch C, Lippautz M, Payer H, Sezgin A,
    Sokolova A, Veith H. 2016. Local linearizability for concurrent container-type
    data structures. Leibniz International Proceedings in Informatics. CONCUR: Concurrency
    Theory, LIPIcs, vol. 59, 6.'
  mla: Haas, Andreas, et al. “Local Linearizability for Concurrent Container-Type
    Data Structures.” <i>Leibniz International Proceedings in Informatics</i>, vol.
    59, 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href="https://doi.org/10.4230/LIPIcs.CONCUR.2016.6">10.4230/LIPIcs.CONCUR.2016.6</a>.
  short: A. Haas, T.A. Henzinger, A. Holzer, C. Kirsch, M. Lippautz, H. Payer, A.
    Sezgin, A. Sokolova, H. Veith, in:, Leibniz International Proceedings in Informatics,
    Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.
conference:
  end_date: 2016-08-26
  location: Quebec City; Canada
  name: 'CONCUR: Concurrency Theory'
  start_date: 2016-08-23
date_created: 2018-12-11T11:50:07Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2025-04-15T06:25:58Z
day: '01'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.CONCUR.2016.6
ec_funded: 1
file:
- access_level: open_access
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:10:10Z
  date_updated: 2018-12-12T10:10:10Z
  file_id: '4795'
  file_name: IST-2017-793-v1+1_LIPIcs-CONCUR-2016-6.pdf
  file_size: 589747
  relation: main_file
file_date_updated: 2018-12-12T10:10:10Z
fulldoi: https://doi.org/10.4230/LIPIcs.CONCUR.2016.6
has_accepted_license: '1'
intvolume: '        59'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '267989'
  name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z211
  name: Formal methods for the design and analysis of complex systems
publication: Leibniz International Proceedings in Informatics
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '6280'
pubrep_id: '793'
quality_controlled: '1'
scopus_import: 1
status: public
title: Local linearizability for concurrent container-type data structures
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 59
year: '2016'
...
---
_id: '1097'
abstract:
- lang: eng
  text: We present an interactive system for computational design, optimization, and
    fabrication of multicopters. Our computational approach allows non-experts to
    design, explore, and evaluate a wide range of different multicopters. We provide
    users with an intuitive interface for assembling a multicopter from a collection
    of components (e.g., propellers, motors, and carbon fiber rods). Our algorithm
    interactively optimizes shape and controller parameters of the current design
    to ensure its proper operation. In addition, we allow incorporating a variety
    of other metrics (such as payload, battery usage, size, and cost) into the design
    process and exploring tradeoffs between them. We show the efficacy of our method
    and system by designing, optimizing, fabricating, and operating multicopters with
    complex geometries and propeller configurations. We also demonstrate the ability
    of our optimization algorithm to improve the multicopter performance under different
    metrics.
acknowledgement: "We thank Nobuyuki Umetani for his insightful suggestions in our
  discussions. We thank Alan Schultz and his colleagues at NRL for building the hexacopter
  and for the valuable discussions. We thank Randall Davis, Boris Katz, and Howard
  Shrobe at MIT for their advice. We are grateful to Nick Bandiera for preprocessing
  mechanical parts and providing 3D printing technical support; Charles Blouin from
  RCBenchmark for dynamometer hardware support; Brian Saavedra for the composition
  UI; Yingzhe Yuan for data acquisition and video recording in the experiments; Michael
  Foshey and David Kim for their comments on the draft of the paper. \r\n\r\n\r\nThis
  work was partially supported by Air Force Research Laboratory’s sponsorship of Julia:
  A Fresh Approach to Technical Computing and Data Processing (Sponsor Award ID FA8750-15-2-
  0272, MIT Award ID 024831-00003), and NSF Expedition project (Sponsor Award ID CCF-1138967,
  MIT Award ID 020610-00002). The views expressed herein are not endorsed by the sponsors.
  This project has also received funding from the European Union’s Horizon 2020 research
  and innovation program under grant agreement No 645599. "
alternative_title:
- ACM Transactions on Graphics
article_number: '227'
article_processing_charge: No
author:
- first_name: Tao
  full_name: Du, Tao
  last_name: Du
- first_name: Adriana
  full_name: Schulz, Adriana
  last_name: Schulz
- first_name: Bo
  full_name: Zhu, Bo
  last_name: Zhu
- first_name: Bernd
  full_name: Bickel, Bernd
  id: 49876194-F248-11E8-B48F-1D18A9856A87
  last_name: Bickel
  orcid: 0000-0001-6511-9385
- first_name: Wojciech
  full_name: Matusik, Wojciech
  last_name: Matusik
citation:
  ama: 'Du T, Schulz A, Zhu B, Bickel B, Matusik W. Computational multicopter design.
    In: Vol 35. ACM; 2016. doi:<a href="https://doi.org/10.1145/2980179.2982427">10.1145/2980179.2982427</a>'
  apa: 'Du, T., Schulz, A., Zhu, B., Bickel, B., &#38; Matusik, W. (2016). Computational
    multicopter design (Vol. 35). Presented at the SIGGRAPH Asia: Conference and Exhibition
    on Computer Graphics and Interactive Techniques in Asia, Macao, China: ACM. <a
    href="https://doi.org/10.1145/2980179.2982427">https://doi.org/10.1145/2980179.2982427</a>'
  chicago: Du, Tao, Adriana Schulz, Bo Zhu, Bernd Bickel, and Wojciech Matusik. “Computational
    Multicopter Design,” Vol. 35. ACM, 2016. <a href="https://doi.org/10.1145/2980179.2982427">https://doi.org/10.1145/2980179.2982427</a>.
  ieee: 'T. Du, A. Schulz, B. Zhu, B. Bickel, and W. Matusik, “Computational multicopter
    design,” presented at the SIGGRAPH Asia: Conference and Exhibition on Computer
    Graphics and Interactive Techniques in Asia, Macao, China, 2016, vol. 35, no.
    6.'
  ista: 'Du T, Schulz A, Zhu B, Bickel B, Matusik W. 2016. Computational multicopter
    design. SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive
    Techniques in Asia, ACM Transactions on Graphics, vol. 35, 227.'
  mla: Du, Tao, et al. <i>Computational Multicopter Design</i>. Vol. 35, no. 6, 227,
    ACM, 2016, doi:<a href="https://doi.org/10.1145/2980179.2982427">10.1145/2980179.2982427</a>.
  short: T. Du, A. Schulz, B. Zhu, B. Bickel, W. Matusik, in:, ACM, 2016.
conference:
  end_date: 2016-12-08
  location: Macao, China
  name: 'SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive
    Techniques in Asia'
  start_date: 2016-12-05
date_created: 2018-12-11T11:50:07Z
date_published: 2016-11-01T00:00:00Z
date_updated: 2025-09-22T14:17:29Z
day: '01'
ddc:
- '006'
department:
- _id: BeBi
doi: 10.1145/2980179.2982427
ec_funded: 1
external_id:
  isi:
  - '000388446200069'
file:
- access_level: open_access
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:17:42Z
  date_updated: 2018-12-12T10:17:42Z
  file_id: '5298'
  file_name: IST-2017-759-v1+1_copter.pdf
  file_size: 33114420
  relation: main_file
file_date_updated: 2018-12-12T10:17:42Z
fulldoi: https://doi.org/10.1145/2980179.2982427
has_accepted_license: '1'
intvolume: '        35'
isi: 1
issue: '6'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
project:
- _id: 25082902-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '645599'
  name: Soft-bodied intelligence for Manipulation
publication_status: published
publisher: ACM
publist_id: '6278'
pubrep_id: '759'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Computational multicopter design
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 35
year: '2016'
...
---
_id: '1098'
abstract:
- lang: eng
  text: Better understanding of the potential benefits of information transfer and
    representation learning is an important step towards the goal of building intelligent
    systems that are able to persist in the world and learn over time. In this work,
    we consider a setting where the learner encounters a stream of tasks but is able
    to retain only limited information from each encountered task, such as a learned
    predictor. In contrast to most previous works analyzing this scenario, we do not
    make any distributional assumptions on the task generating process. Instead, we
    formulate a complexity measure that captures the diversity of the observed tasks.
    We provide a lifelong learning algorithm with error guarantees for every observed
    task (rather than on average). We show sample complexity reductions in comparison
    to solving every task in isolation in terms of our task complexity measure. Further,
    our algorithmic framework can naturally be viewed as learning a representation
    from encountered tasks with a neural network.
acknowledgement: "This work was in parts funded by the European Research Council under
  the European Union’s Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement
  no 308036.\r\n\r\n"
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
author:
- first_name: Anastasia
  full_name: Pentina, Anastasia
  id: 42E87FC6-F248-11E8-B48F-1D18A9856A87
  last_name: Pentina
- first_name: Ruth
  full_name: Urner, Ruth
  last_name: Urner
citation:
  ama: 'Pentina A, Urner R. Lifelong learning with weighted majority votes. In: Vol
    29. Neural Information Processing Systems Foundation; 2016:3619-3627.'
  apa: 'Pentina, A., &#38; Urner, R. (2016). Lifelong learning with weighted majority
    votes (Vol. 29, pp. 3619–3627). Presented at the NIPS: Neural Information Processing
    Systems, Barcelona, Spain: Neural Information Processing Systems Foundation.'
  chicago: Pentina, Anastasia, and Ruth Urner. “Lifelong Learning with Weighted Majority
    Votes,” 29:3619–27. Neural Information Processing Systems Foundation, 2016.
  ieee: 'A. Pentina and R. Urner, “Lifelong learning with weighted majority votes,”
    presented at the NIPS: Neural Information Processing Systems, Barcelona, Spain,
    2016, vol. 29, pp. 3619–3627.'
  ista: 'Pentina A, Urner R. 2016. Lifelong learning with weighted majority votes.
    NIPS: Neural Information Processing Systems, Advances in Neural Information Processing
    Systems, vol. 29, 3619–3627.'
  mla: Pentina, Anastasia, and Ruth Urner. <i>Lifelong Learning with Weighted Majority
    Votes</i>. Vol. 29, Neural Information Processing Systems Foundation, 2016, pp.
    3619–27.
  short: A. Pentina, R. Urner, in:, Neural Information Processing Systems Foundation,
    2016, pp. 3619–3627.
conference:
  end_date: 2016-12-10
  location: Barcelona, Spain
  name: 'NIPS: Neural Information Processing Systems'
  start_date: 2016-12-05
date_created: 2018-12-11T11:50:08Z
date_published: 2016-12-01T00:00:00Z
date_updated: 2025-06-03T11:35:58Z
day: '01'
ddc:
- '006'
department:
- _id: ChLa
ec_funded: 1
file:
- access_level: open_access
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:12:42Z
  date_updated: 2018-12-12T10:12:42Z
  file_id: '4961'
  file_name: IST-2017-775-v1+1_main.pdf
  file_size: 237111
  relation: main_file
- access_level: open_access
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:12:43Z
  date_updated: 2018-12-12T10:12:43Z
  file_id: '4962'
  file_name: IST-2017-775-v1+2_supplementary.pdf
  file_size: 185818
  relation: main_file
file_date_updated: 2018-12-12T10:12:43Z
has_accepted_license: '1'
intvolume: '        29'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 3619-3627
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '308036'
  name: Lifelong Learning of Visual Scene Understanding
publication_status: published
publisher: Neural Information Processing Systems Foundation
publist_id: '6277'
pubrep_id: '775'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Lifelong learning with weighted majority votes
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 29
year: '2016'
...
---
_id: '1099'
abstract:
- lang: eng
  text: We present FlexMolds, a novel computational approach to automatically design
    flexible, reusable molds that, once 3D printed, allow us to physically fabricate,
    by means of liquid casting, multiple copies of complex shapes with rich surface
    details and complex topology. The approach to design such flexible molds is based
    on a greedy bottom-up search of possible cuts over an object, evaluating for each
    possible cut the feasibility of the resulting mold. We use a dynamic simulation
    approach to evaluate candidate molds, providing a heuristic to generate forces
    that are able to open, detach, and remove a complex mold from the object it surrounds.
    We have tested the approach with a number of objects with nontrivial shapes and
    topologies.
acknowledgement: "The armadillo, bunny and dragon models are courtesy of the Stanford
  \ 3D  Scanning  Repository.   The  bimba,  fertility  and  elephant models are courtesy
  of the AIM@SHAPE Shape Repository.  \r\nThis project has received funding from the
  European Union’s Horizon 2020  research  and  innovation  programme  under  grant
  \ agreement\r\nNo. 645599."
alternative_title:
- ACM Transactions on Graphics
article_number: '223'
article_processing_charge: No
author:
- first_name: Luigi
  full_name: Malomo, Luigi
  last_name: Malomo
- first_name: Nico
  full_name: Pietroni, Nico
  last_name: Pietroni
- first_name: Bernd
  full_name: Bickel, Bernd
  id: 49876194-F248-11E8-B48F-1D18A9856A87
  last_name: Bickel
  orcid: 0000-0001-6511-9385
- first_name: Paolo
  full_name: Cignoni, Paolo
  last_name: Cignoni
citation:
  ama: 'Malomo L, Pietroni N, Bickel B, Cignoni P. FlexMolds: Automatic design of
    flexible shells for molding. In: Vol 35. ACM; 2016. doi:<a href="https://doi.org/10.1145/2980179.2982397">10.1145/2980179.2982397</a>'
  apa: 'Malomo, L., Pietroni, N., Bickel, B., &#38; Cignoni, P. (2016). FlexMolds:
    Automatic design of flexible shells for molding (Vol. 35). Presented at the SIGGRAPH
    Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques
    in Asia, Macao, China: ACM. <a href="https://doi.org/10.1145/2980179.2982397">https://doi.org/10.1145/2980179.2982397</a>'
  chicago: 'Malomo, Luigi, Nico Pietroni, Bernd Bickel, and Paolo Cignoni. “FlexMolds:
    Automatic Design of Flexible Shells for Molding,” Vol. 35. ACM, 2016. <a href="https://doi.org/10.1145/2980179.2982397">https://doi.org/10.1145/2980179.2982397</a>.'
  ieee: 'L. Malomo, N. Pietroni, B. Bickel, and P. Cignoni, “FlexMolds: Automatic
    design of flexible shells for molding,” presented at the SIGGRAPH Asia: Conference
    and Exhibition on Computer Graphics and Interactive Techniques in Asia, Macao,
    China, 2016, vol. 35, no. 6.'
  ista: 'Malomo L, Pietroni N, Bickel B, Cignoni P. 2016. FlexMolds: Automatic design
    of flexible shells for molding. SIGGRAPH Asia: Conference and Exhibition on Computer
    Graphics and Interactive Techniques in Asia, ACM Transactions on Graphics, vol.
    35, 223.'
  mla: 'Malomo, Luigi, et al. <i>FlexMolds: Automatic Design of Flexible Shells for
    Molding</i>. Vol. 35, no. 6, 223, ACM, 2016, doi:<a href="https://doi.org/10.1145/2980179.2982397">10.1145/2980179.2982397</a>.'
  short: L. Malomo, N. Pietroni, B. Bickel, P. Cignoni, in:, ACM, 2016.
conference:
  end_date: 2016-12-08
  location: Macao, China
  name: 'SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive
    Techniques in Asia'
  start_date: 2016-12-05
date_created: 2018-12-11T11:50:08Z
date_published: 2016-11-01T00:00:00Z
date_updated: 2025-09-22T14:16:02Z
day: '01'
ddc:
- '000'
- '005'
department:
- _id: BeBi
doi: 10.1145/2980179.2982397
ec_funded: 1
external_id:
  isi:
  - '000388446200065'
file:
- access_level: open_access
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:12:01Z
  date_updated: 2018-12-12T10:12:01Z
  file_id: '4918'
  file_name: IST-2017-760-v1+1_flexmolds.pdf
  file_size: 11122029
  relation: main_file
file_date_updated: 2018-12-12T10:12:01Z
fulldoi: https://doi.org/10.1145/2980179.2982397
has_accepted_license: '1'
intvolume: '        35'
isi: 1
issue: '6'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
project:
- _id: 25082902-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '645599'
  name: Soft-bodied intelligence for Manipulation
publication_status: published
publisher: ACM
publist_id: '6276'
pubrep_id: '760'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'FlexMolds: Automatic design of flexible shells for molding'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 35
year: '2016'
...
---
_id: '1102'
abstract:
- lang: eng
  text: Weakly-supervised object localization methods tend to fail for object classes
    that consistently co-occur with the same background elements, e.g. trains on tracks.
    We propose a method to overcome these failures by adding a very small amount of
    model-specific additional annotation. The main idea is to cluster a deep network\'s
    mid-level representations and assign object or distractor labels to each cluster.
    Experiments show substantially improved localization results on the challenging
    ILSVC2014 dataset for bounding box detection and the PASCAL VOC2012 dataset for
    semantic segmentation.
acknowledgement: "This work was funded in parts by the European Research Council\r\nunder
  the European Union’s Seventh Framework Programme (FP7/2007-2013)/ERC grant\r\nagreement
  no 308036. We gratefully acknowledge the support of NVIDIA Corporation with\r\nthe
  donation of the GPUs used for this research."
article_processing_charge: No
author:
- first_name: Alexander
  full_name: Kolesnikov, Alexander
  id: 2D157DB6-F248-11E8-B48F-1D18A9856A87
  last_name: Kolesnikov
- first_name: Christoph
  full_name: Lampert, Christoph
  id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
  last_name: Lampert
  orcid: 0000-0001-8622-7887
citation:
  ama: 'Kolesnikov A, Lampert C. Improving weakly-supervised object localization by
    micro-annotation. In: <i>Proceedings of the British Machine Vision Conference
    2016</i>. Vol 2016-September. BMVA Press; 2016:92.1-92.12. doi:<a href="https://doi.org/10.5244/C.30.92">10.5244/C.30.92</a>'
  apa: 'Kolesnikov, A., &#38; Lampert, C. (2016). Improving weakly-supervised object
    localization by micro-annotation. In <i>Proceedings of the British Machine Vision
    Conference 2016</i> (Vol. 2016–September, p. 92.1-92.12). York, United Kingdom:
    BMVA Press. <a href="https://doi.org/10.5244/C.30.92">https://doi.org/10.5244/C.30.92</a>'
  chicago: Kolesnikov, Alexander, and Christoph Lampert. “Improving Weakly-Supervised
    Object Localization by Micro-Annotation.” In <i>Proceedings of the British Machine
    Vision Conference 2016</i>, 2016–September:92.1-92.12. BMVA Press, 2016. <a href="https://doi.org/10.5244/C.30.92">https://doi.org/10.5244/C.30.92</a>.
  ieee: A. Kolesnikov and C. Lampert, “Improving weakly-supervised object localization
    by micro-annotation,” in <i>Proceedings of the British Machine Vision Conference
    2016</i>, York, United Kingdom, 2016, vol. 2016–September, p. 92.1-92.12.
  ista: 'Kolesnikov A, Lampert C. 2016. Improving weakly-supervised object localization
    by micro-annotation. Proceedings of the British Machine Vision Conference 2016.
    BMVC: British Machine Vision Conference vol. 2016–September, 92.1-92.12.'
  mla: Kolesnikov, Alexander, and Christoph Lampert. “Improving Weakly-Supervised
    Object Localization by Micro-Annotation.” <i>Proceedings of the British Machine
    Vision Conference 2016</i>, vol. 2016–September, BMVA Press, 2016, p. 92.1-92.12,
    doi:<a href="https://doi.org/10.5244/C.30.92">10.5244/C.30.92</a>.
  short: A. Kolesnikov, C. Lampert, in:, Proceedings of the British Machine Vision
    Conference 2016, BMVA Press, 2016, p. 92.1-92.12.
conference:
  end_date: 2016-09-22
  location: York, United Kingdom
  name: 'BMVC: British Machine Vision Conference'
  start_date: 2016-09-19
date_created: 2018-12-11T11:50:09Z
date_published: 2016-09-01T00:00:00Z
date_updated: 2026-06-18T10:46:30Z
day: '01'
ddc:
- '000'
department:
- _id: ChLa
doi: 10.5244/C.30.92
ec_funded: 1
fulldoi: https://doi.org/10.5244/C.30.92
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://www.bmva.org/bmvc/2016/papers/paper092/paper092.pdf
month: '09'
oa: 1
oa_version: Published Version
page: 92.1-92.12
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '308036'
  name: Lifelong Learning of Visual Scene Understanding
publication: Proceedings of the British Machine Vision Conference 2016
publication_status: published
publisher: BMVA Press
publist_id: '6273'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Improving weakly-supervised object localization by micro-annotation
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2016-September
year: '2016'
...
---
_id: '1103'
abstract:
- lang: eng
  text: We propose two parallel state-space-exploration algorithms for hybrid automaton
    (HA), with the goal of enhancing performance on multi-core shared-memory systems.
    The first uses the parallel, breadth-first-search algorithm (PBFS) of the SPIN
    model checker, when traversing the discrete modes of the HA, and enhances it with
    a parallel exploration of the continuous states within each mode. We show that
    this simple-minded extension of PBFS does not provide the desired load balancing
    in many HA benchmarks. The second algorithm is a task-parallel BFS algorithm (TP-BFS),
    which uses a cheap precomputation of the cost associated with the post operations
    (both continuous and discrete) in order to improve load balancing. We illustrate
    the TP-BFS and the cost precomputation of the post operators on a support-function-based
    algorithm for state-space exploration. The performance comparison of the two algorithms
    shows that, in general, TP-BFS provides a better utilization/load-balancing of
    the CPU. Both algorithms are implemented in the model checker XSpeed. Our experiments
    show a maximum speed-up of more than 2000 χ on a navigation benchmark, with respect
    to SpaceEx LGG scenario. In order to make the comparison fair, we employed an
    equal number of post operations in both tools. To the best of our knowledge, this
    paper represents the first attempt to provide parallel, reachability-analysis
    algorithms for HA.
acknowledgement: This work was supported in part by DST-SERB, GoI under Project No.
  YSS/2014/000623 and by the European Research Council (ERC) under grant 267989 (QUAREM)
  and by the Austrian Science Fund (FWF) under grants S11402-N23, S11405-N23 and S11412-N23
  (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award).
article_number: '7797741'
article_processing_charge: No
arxiv: 1
author:
- first_name: Amit
  full_name: Gurung, Amit
  last_name: Gurung
- first_name: Arup
  full_name: Deka, Arup
  last_name: Deka
- first_name: Ezio
  full_name: Bartocci, Ezio
  last_name: Bartocci
- first_name: Sergiy
  full_name: Bogomolov, Sergiy
  id: 369D9A44-F248-11E8-B48F-1D18A9856A87
  last_name: Bogomolov
  orcid: 0000-0002-0686-0365
- first_name: Radu
  full_name: Grosu, Radu
  last_name: Grosu
- first_name: Rajarshi
  full_name: Ray, Rajarshi
  last_name: Ray
citation:
  ama: 'Gurung A, Deka A, Bartocci E, Bogomolov S, Grosu R, Ray R. Parallel reachability
    analysis for hybrid systems. In: IEEE; 2016. doi:<a href="https://doi.org/10.1109/MEMCOD.2016.7797741">10.1109/MEMCOD.2016.7797741</a>'
  apa: 'Gurung, A., Deka, A., Bartocci, E., Bogomolov, S., Grosu, R., &#38; Ray, R.
    (2016). Parallel reachability analysis for hybrid systems. Presented at the MEMOCODE:
    Conference on Formal Methods and Models for System Design, Kanpur, India : IEEE.
    <a href="https://doi.org/10.1109/MEMCOD.2016.7797741">https://doi.org/10.1109/MEMCOD.2016.7797741</a>'
  chicago: Gurung, Amit, Arup Deka, Ezio Bartocci, Sergiy Bogomolov, Radu Grosu, and
    Rajarshi Ray. “Parallel Reachability Analysis for Hybrid Systems.” IEEE, 2016.
    <a href="https://doi.org/10.1109/MEMCOD.2016.7797741">https://doi.org/10.1109/MEMCOD.2016.7797741</a>.
  ieee: 'A. Gurung, A. Deka, E. Bartocci, S. Bogomolov, R. Grosu, and R. Ray, “Parallel
    reachability analysis for hybrid systems,” presented at the MEMOCODE: Conference
    on Formal Methods and Models for System Design, Kanpur, India , 2016.'
  ista: 'Gurung A, Deka A, Bartocci E, Bogomolov S, Grosu R, Ray R. 2016. Parallel
    reachability analysis for hybrid systems. MEMOCODE: Conference on Formal Methods
    and Models for System Design, 7797741.'
  mla: Gurung, Amit, et al. <i>Parallel Reachability Analysis for Hybrid Systems</i>.
    7797741, IEEE, 2016, doi:<a href="https://doi.org/10.1109/MEMCOD.2016.7797741">10.1109/MEMCOD.2016.7797741</a>.
  short: A. Gurung, A. Deka, E. Bartocci, S. Bogomolov, R. Grosu, R. Ray, in:, IEEE,
    2016.
conference:
  end_date: 2016-11-20
  location: 'Kanpur, India '
  name: 'MEMOCODE: Conference on Formal Methods and Models for System Design'
  start_date: 2016-11-18
date_created: 2018-12-11T11:50:09Z
date_published: 2016-12-27T00:00:00Z
date_updated: 2025-06-04T11:52:29Z
day: '27'
department:
- _id: ToHe
doi: 10.1109/MEMCOD.2016.7797741
ec_funded: 1
external_id:
  arxiv:
  - '1606.05473'
fulldoi: https://doi.org/10.1109/MEMCOD.2016.7797741
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1606.05473
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '267989'
  name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z211
  name: Formal methods for the design and analysis of complex systems
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
publication_status: published
publisher: IEEE
publist_id: '6272'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Parallel reachability analysis for hybrid systems
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '1105'
abstract:
- lang: eng
  text: Jointly characterizing neural responses in terms of several external variables
    promises novel insights into circuit function, but remains computationally prohibitive
    in practice. Here we use gaussian process (GP) priors and exploit recent advances
    in fast GP inference and learning based on Kronecker methods, to efficiently estimate
    multidimensional nonlinear tuning functions. Our estimator require considerably
    less data than traditional methods and further provides principled uncertainty
    estimates. We apply these tools to hippocampal recordings during open field exploration
    and use them to characterize the joint dependence of CA1 responses on the position
    of the animal and several other variables, including the animal\'s speed, direction
    of motion, and network oscillations.Our results provide an unprecedentedly detailed
    quantification of the tuning of hippocampal neurons. The model\'s generality suggests
    that our approach can be used to estimate neural response properties in other
    brain regions.
acknowledgement: "We  thank  Jozsef  Csicsvari  for  kindly  sharing  the  CA1  data.\r\nThis
  work was supported by the People Programme (Marie Curie Actions) of the European
  Union’s Seventh Framework Programme(FP7/2007-2013) under REA grant agreement no.
  291734."
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
author:
- first_name: Cristina
  full_name: Savin, Cristina
  id: 3933349E-F248-11E8-B48F-1D18A9856A87
  last_name: Savin
- first_name: Gasper
  full_name: Tkacik, Gasper
  id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
  last_name: Tkacik
  orcid: 0000-0002-6699-1455
citation:
  ama: 'Savin C, Tkačik G. Estimating nonlinear neural response functions using GP
    priors and Kronecker methods. In: Vol 29. Neural Information Processing Systems
    Foundation; 2016:3610-3618.'
  apa: 'Savin, C., &#38; Tkačik, G. (2016). Estimating nonlinear neural response functions
    using GP priors and Kronecker methods (Vol. 29, pp. 3610–3618). Presented at the
    NIPS: Neural Information Processing Systems, Barcelona; Spain: Neural Information
    Processing Systems Foundation.'
  chicago: Savin, Cristina, and Gašper Tkačik. “Estimating Nonlinear Neural Response
    Functions Using GP Priors and Kronecker Methods,” 29:3610–18. Neural Information
    Processing Systems Foundation, 2016.
  ieee: 'C. Savin and G. Tkačik, “Estimating nonlinear neural response functions using
    GP priors and Kronecker methods,” presented at the NIPS: Neural Information Processing
    Systems, Barcelona; Spain, 2016, vol. 29, pp. 3610–3618.'
  ista: 'Savin C, Tkačik G. 2016. Estimating nonlinear neural response functions using
    GP priors and Kronecker methods. NIPS: Neural Information Processing Systems,
    Advances in Neural Information Processing Systems, vol. 29, 3610–3618.'
  mla: Savin, Cristina, and Gašper Tkačik. <i>Estimating Nonlinear Neural Response
    Functions Using GP Priors and Kronecker Methods</i>. Vol. 29, Neural Information
    Processing Systems Foundation, 2016, pp. 3610–18.
  short: C. Savin, G. Tkačik, in:, Neural Information Processing Systems Foundation,
    2016, pp. 3610–3618.
conference:
  end_date: 2016-12-10
  location: Barcelona; Spain
  name: 'NIPS: Neural Information Processing Systems'
  start_date: 2016-12-05
corr_author: '1'
date_created: 2018-12-11T11:50:10Z
date_published: 2016-12-01T00:00:00Z
date_updated: 2025-06-03T11:36:49Z
day: '01'
department:
- _id: GaTk
ec_funded: 1
intvolume: '        29'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://papers.nips.cc/paper/6153-estimating-nonlinear-neural-response-functions-using-gp-priors-and-kronecker-methods
month: '12'
oa: 1
oa_version: None
page: 3610-3618
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '291734'
  name: International IST Postdoc Fellowship Programme
publication_status: published
publisher: Neural Information Processing Systems Foundation
publist_id: '6265'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Estimating nonlinear neural response functions using GP priors and Kronecker
  methods
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 29
year: '2016'
...
---
_id: '11069'
abstract:
- lang: eng
  text: Repeated rounds of nuclear envelope (NE) rupture and repair have been observed
    in laminopathy and cancer cells and result in intermittent loss of nucleus compartmentalization.
    Currently, the causes of NE rupture are unclear. Here, we show that NE rupture
    in cancer cells relies on the assembly of contractile actin bundles that interact
    with the nucleus via the linker of nucleoskeleton and cytoskeleton (LINC) complex.
    We found that the loss of actin bundles or the LINC complex did not rescue nuclear
    lamina defects, a previously identified determinant of nuclear membrane stability,
    but did decrease the number and size of chromatin hernias. Finally, NE rupture
    inhibition could be rescued in cells treated with actin-depolymerizing drugs by
    mechanically constraining nucleus height. These data suggest a model of NE rupture
    where weak membrane areas, caused by defects in lamina organization, rupture because
    of an increase in intranuclear pressure from actin-based nucleus confinement.
article_processing_charge: No
article_type: original
author:
- first_name: Emily M.
  full_name: Hatch, Emily M.
  last_name: Hatch
- first_name: Martin W
  full_name: HETZER, Martin W
  id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
  last_name: HETZER
  orcid: 0000-0002-2111-992X
citation:
  ama: Hatch EM, Hetzer M. Nuclear envelope rupture is induced by actin-based nucleus
    confinement. <i>Journal of Cell Biology</i>. 2016;215(1):27-36. doi:<a href="https://doi.org/10.1083/jcb.201603053">10.1083/jcb.201603053</a>
  apa: Hatch, E. M., &#38; Hetzer, M. (2016). Nuclear envelope rupture is induced
    by actin-based nucleus confinement. <i>Journal of Cell Biology</i>. Rockefeller
    University Press. <a href="https://doi.org/10.1083/jcb.201603053">https://doi.org/10.1083/jcb.201603053</a>
  chicago: Hatch, Emily M., and Martin Hetzer. “Nuclear Envelope Rupture Is Induced
    by Actin-Based Nucleus Confinement.” <i>Journal of Cell Biology</i>. Rockefeller
    University Press, 2016. <a href="https://doi.org/10.1083/jcb.201603053">https://doi.org/10.1083/jcb.201603053</a>.
  ieee: E. M. Hatch and M. Hetzer, “Nuclear envelope rupture is induced by actin-based
    nucleus confinement,” <i>Journal of Cell Biology</i>, vol. 215, no. 1. Rockefeller
    University Press, pp. 27–36, 2016.
  ista: Hatch EM, Hetzer M. 2016. Nuclear envelope rupture is induced by actin-based
    nucleus confinement. Journal of Cell Biology. 215(1), 27–36.
  mla: Hatch, Emily M., and Martin Hetzer. “Nuclear Envelope Rupture Is Induced by
    Actin-Based Nucleus Confinement.” <i>Journal of Cell Biology</i>, vol. 215, no.
    1, Rockefeller University Press, 2016, pp. 27–36, doi:<a href="https://doi.org/10.1083/jcb.201603053">10.1083/jcb.201603053</a>.
  short: E.M. Hatch, M. Hetzer, Journal of Cell Biology 215 (2016) 27–36.
date_created: 2022-04-07T07:47:42Z
date_published: 2016-10-03T00:00:00Z
date_updated: 2024-10-14T11:20:38Z
day: '03'
doi: 10.1083/jcb.201603053
extern: '1'
external_id:
  pmid:
  - '27697922'
fulldoi: https://doi.org/10.1083/jcb.201603053
intvolume: '       215'
issue: '1'
keyword:
- Cell Biology
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1083/jcb.201603053
month: '10'
oa: 1
oa_version: Published Version
page: 27-36
pmid: 1
publication: Journal of Cell Biology
publication_identifier:
  issn:
  - 0021-9525
  - 1540-8140
publication_status: published
publisher: Rockefeller University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nuclear envelope rupture is induced by actin-based nucleus confinement
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 215
year: '2016'
...
---
_id: '11070'
abstract:
- lang: eng
  text: The organization of the genome in the three-dimensional space of the nucleus
    is coupled with cell type-specific gene expression. However, how nuclear architecture
    influences transcription that governs cell identity remains unknown. Here, we
    show that nuclear pore complex (NPC) components Nup93 and Nup153 bind superenhancers
    (SE), regulatory structures that drive the expression of key genes that specify
    cell identity. We found that nucleoporin-associated SEs localize preferentially
    to the nuclear periphery, and absence of Nup153 and Nup93 results in dramatic
    transcriptional changes of SE-associated genes. Our results reveal a crucial role
    of NPC components in the regulation of cell type-specifying genes and highlight
    nuclear architecture as a regulatory layer of genome functions in cell fate.
article_processing_charge: No
article_type: original
author:
- first_name: Arkaitz
  full_name: Ibarra, Arkaitz
  last_name: Ibarra
- first_name: Chris
  full_name: Benner, Chris
  last_name: Benner
- first_name: Swati
  full_name: Tyagi, Swati
  last_name: Tyagi
- first_name: Jonah
  full_name: Cool, Jonah
  last_name: Cool
- first_name: Martin W
  full_name: HETZER, Martin W
  id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
  last_name: HETZER
  orcid: 0000-0002-2111-992X
citation:
  ama: Ibarra A, Benner C, Tyagi S, Cool J, Hetzer M. Nucleoporin-mediated regulation
    of cell identity genes. <i>Genes &#38; Development</i>. 2016;30(20):2253-2258.
    doi:<a href="https://doi.org/10.1101/gad.287417.116">10.1101/gad.287417.116</a>
  apa: Ibarra, A., Benner, C., Tyagi, S., Cool, J., &#38; Hetzer, M. (2016). Nucleoporin-mediated
    regulation of cell identity genes. <i>Genes &#38; Development</i>. Cold Spring
    Harbor Laboratory. <a href="https://doi.org/10.1101/gad.287417.116">https://doi.org/10.1101/gad.287417.116</a>
  chicago: Ibarra, Arkaitz, Chris Benner, Swati Tyagi, Jonah Cool, and Martin Hetzer.
    “Nucleoporin-Mediated Regulation of Cell Identity Genes.” <i>Genes &#38; Development</i>.
    Cold Spring Harbor Laboratory, 2016. <a href="https://doi.org/10.1101/gad.287417.116">https://doi.org/10.1101/gad.287417.116</a>.
  ieee: A. Ibarra, C. Benner, S. Tyagi, J. Cool, and M. Hetzer, “Nucleoporin-mediated
    regulation of cell identity genes,” <i>Genes &#38; Development</i>, vol. 30, no.
    20. Cold Spring Harbor Laboratory, pp. 2253–2258, 2016.
  ista: Ibarra A, Benner C, Tyagi S, Cool J, Hetzer M. 2016. Nucleoporin-mediated
    regulation of cell identity genes. Genes &#38; Development. 30(20), 2253–2258.
  mla: Ibarra, Arkaitz, et al. “Nucleoporin-Mediated Regulation of Cell Identity Genes.”
    <i>Genes &#38; Development</i>, vol. 30, no. 20, Cold Spring Harbor Laboratory,
    2016, pp. 2253–58, doi:<a href="https://doi.org/10.1101/gad.287417.116">10.1101/gad.287417.116</a>.
  short: A. Ibarra, C. Benner, S. Tyagi, J. Cool, M. Hetzer, Genes &#38; Development
    30 (2016) 2253–2258.
date_created: 2022-04-07T07:48:08Z
date_published: 2016-11-02T00:00:00Z
date_updated: 2024-10-14T11:21:07Z
day: '02'
doi: 10.1101/gad.287417.116
extern: '1'
external_id:
  pmid:
  - '27807035'
fulldoi: https://doi.org/10.1101/gad.287417.116
intvolume: '        30'
issue: '20'
keyword:
- Developmental Biology
- Genetics
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1101/gad.287417.116
month: '11'
oa: 1
oa_version: Published Version
page: 2253-2258
pmid: 1
publication: Genes & Development
publication_identifier:
  eissn:
  - 1549-5477
  issn:
  - 0890-9369
publication_status: published
publisher: Cold Spring Harbor Laboratory
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nucleoporin-mediated regulation of cell identity genes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 30
year: '2016'
...
---
_id: '11071'
abstract:
- lang: eng
  text: Nuclear pore complexes (NPCs) emerged as nuclear transport channels in eukaryotic
    cells ∼1.5 billion years ago. While the primary role of NPCs is to regulate nucleo–cytoplasmic
    transport, recent research suggests that certain NPC proteins have additionally
    acquired the role of affecting gene expression at the nuclear periphery and in
    the nucleoplasm in metazoans. Here we identify a widely expressed variant of the
    transmembrane nucleoporin (Nup) Pom121 (named sPom121, for “soluble Pom121”) that
    arose by genomic rearrangement before the divergence of hominoids. sPom121 lacks
    the nuclear membrane-anchoring domain and thus does not localize to the NPC. Instead,
    sPom121 colocalizes and interacts with nucleoplasmic Nup98, a previously identified
    transcriptional regulator, at gene promoters to control transcription of its target
    genes in human cells. Interestingly, sPom121 transcripts appear independently
    in several mammalian species, suggesting convergent innovation of Nup-mediated
    transcription regulation during mammalian evolution. Our findings implicate alternate
    transcription initiation as a mechanism to increase the functional diversity of
    NPC components.
article_processing_charge: No
article_type: original
author:
- first_name: Tobias M.
  full_name: Franks, Tobias M.
  last_name: Franks
- first_name: Chris
  full_name: Benner, Chris
  last_name: Benner
- first_name: Iñigo
  full_name: Narvaiza, Iñigo
  last_name: Narvaiza
- first_name: Maria C.N.
  full_name: Marchetto, Maria C.N.
  last_name: Marchetto
- first_name: Janet M.
  full_name: Young, Janet M.
  last_name: Young
- first_name: Harmit S.
  full_name: Malik, Harmit S.
  last_name: Malik
- first_name: Fred H.
  full_name: Gage, Fred H.
  last_name: Gage
- first_name: Martin W
  full_name: HETZER, Martin W
  id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
  last_name: HETZER
  orcid: 0000-0002-2111-992X
citation:
  ama: Franks TM, Benner C, Narvaiza I, et al. Evolution of a transcriptional regulator
    from a transmembrane nucleoporin. <i>Genes &#38; Development</i>. 2016;30(10):1155-1171.
    doi:<a href="https://doi.org/10.1101/gad.280941.116">10.1101/gad.280941.116</a>
  apa: Franks, T. M., Benner, C., Narvaiza, I., Marchetto, M. C. N., Young, J. M.,
    Malik, H. S., … Hetzer, M. (2016). Evolution of a transcriptional regulator from
    a transmembrane nucleoporin. <i>Genes &#38; Development</i>. Cold Spring Harbor
    Laboratory. <a href="https://doi.org/10.1101/gad.280941.116">https://doi.org/10.1101/gad.280941.116</a>
  chicago: Franks, Tobias M., Chris Benner, Iñigo Narvaiza, Maria C.N. Marchetto,
    Janet M. Young, Harmit S. Malik, Fred H. Gage, and Martin Hetzer. “Evolution of
    a Transcriptional Regulator from a Transmembrane Nucleoporin.” <i>Genes &#38;
    Development</i>. Cold Spring Harbor Laboratory, 2016. <a href="https://doi.org/10.1101/gad.280941.116">https://doi.org/10.1101/gad.280941.116</a>.
  ieee: T. M. Franks <i>et al.</i>, “Evolution of a transcriptional regulator from
    a transmembrane nucleoporin,” <i>Genes &#38; Development</i>, vol. 30, no. 10.
    Cold Spring Harbor Laboratory, pp. 1155–1171, 2016.
  ista: Franks TM, Benner C, Narvaiza I, Marchetto MCN, Young JM, Malik HS, Gage FH,
    Hetzer M. 2016. Evolution of a transcriptional regulator from a transmembrane
    nucleoporin. Genes &#38; Development. 30(10), 1155–1171.
  mla: Franks, Tobias M., et al. “Evolution of a Transcriptional Regulator from a
    Transmembrane Nucleoporin.” <i>Genes &#38; Development</i>, vol. 30, no. 10, Cold
    Spring Harbor Laboratory, 2016, pp. 1155–71, doi:<a href="https://doi.org/10.1101/gad.280941.116">10.1101/gad.280941.116</a>.
  short: T.M. Franks, C. Benner, I. Narvaiza, M.C.N. Marchetto, J.M. Young, H.S. Malik,
    F.H. Gage, M. Hetzer, Genes &#38; Development 30 (2016) 1155–1171.
date_created: 2022-04-07T07:48:20Z
date_published: 2016-05-19T00:00:00Z
date_updated: 2024-10-14T11:21:48Z
day: '19'
doi: 10.1101/gad.280941.116
extern: '1'
external_id:
  pmid:
  - '27198230'
fulldoi: https://doi.org/10.1101/gad.280941.116
intvolume: '        30'
issue: '10'
keyword:
- Developmental Biology
- Genetics
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1101/gad.280941.116
month: '05'
oa: 1
oa_version: Published Version
page: 1155-1171
pmid: 1
publication: Genes & Development
publication_identifier:
  eissn:
  - 1549-5477
  issn:
  - 0890-9369
publication_status: published
publisher: Cold Spring Harbor Laboratory
quality_controlled: '1'
scopus_import: '1'
status: public
title: Evolution of a transcriptional regulator from a transmembrane nucleoporin
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 30
year: '2016'
...
---
_id: '11072'
abstract:
- lang: eng
  text: "Spatiotemporal activation of RhoA and actomyosin contraction underpins cellular
    adhesion and division. Loss of cell–cell adhesion and chromosomal instability
    are cardinal events that drive tumour progression. Here, we show that p120-catenin
    (p120) not only controls cell–cell adhesion, but also acts as a critical regulator
    of cytokinesis. We find that p120 regulates actomyosin contractility through concomitant
    binding to RhoA and the centralspindlin component MKLP1, independent of cadherin
    association. In anaphase, p120 is enriched at the cleavage furrow where it binds
    MKLP1 to spatially control RhoA GTPase cycling. Binding of p120 to MKLP1 during
    cytokinesis depends on the N-terminal coiled-coil domain of p120 isoform 1A. Importantly,
    clinical data show that loss of p120 expression is a common event in breast cancer
    that strongly correlates with multinucleation and adverse patient survival. In
    summary, our study identifies p120 loss as a driver event of chromosomal instability
    in cancer.\r\n"
article_number: '13874'
article_processing_charge: No
article_type: original
author:
- first_name: Robert A.H.
  full_name: van de Ven, Robert A.H.
  last_name: van de Ven
- first_name: Jolien S.
  full_name: de Groot, Jolien S.
  last_name: de Groot
- first_name: Danielle
  full_name: Park, Danielle
  last_name: Park
- first_name: Robert
  full_name: van Domselaar, Robert
  last_name: van Domselaar
- first_name: Danielle
  full_name: de Jong, Danielle
  last_name: de Jong
- first_name: Karoly
  full_name: Szuhai, Karoly
  last_name: Szuhai
- first_name: Elsken
  full_name: van der Wall, Elsken
  last_name: van der Wall
- first_name: Oscar M.
  full_name: Rueda, Oscar M.
  last_name: Rueda
- first_name: H. Raza
  full_name: Ali, H. Raza
  last_name: Ali
- first_name: Carlos
  full_name: Caldas, Carlos
  last_name: Caldas
- first_name: Paul J.
  full_name: van Diest, Paul J.
  last_name: van Diest
- first_name: Martin W
  full_name: HETZER, Martin W
  id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
  last_name: HETZER
  orcid: 0000-0002-2111-992X
- first_name: Erik
  full_name: Sahai, Erik
  last_name: Sahai
- first_name: Patrick W.B.
  full_name: Derksen, Patrick W.B.
  last_name: Derksen
citation:
  ama: van de Ven RAH, de Groot JS, Park D, et al. p120-catenin prevents multinucleation
    through control of MKLP1-dependent RhoA activity during cytokinesis. <i>Nature
    Communications</i>. 2016;7. doi:<a href="https://doi.org/10.1038/ncomms13874">10.1038/ncomms13874</a>
  apa: van de Ven, R. A. H., de Groot, J. S., Park, D., van Domselaar, R., de Jong,
    D., Szuhai, K., … Derksen, P. W. B. (2016). p120-catenin prevents multinucleation
    through control of MKLP1-dependent RhoA activity during cytokinesis. <i>Nature
    Communications</i>. Springer Nature. <a href="https://doi.org/10.1038/ncomms13874">https://doi.org/10.1038/ncomms13874</a>
  chicago: Ven, Robert A.H. van de, Jolien S. de Groot, Danielle Park, Robert van
    Domselaar, Danielle de Jong, Karoly Szuhai, Elsken van der Wall, et al. “P120-Catenin
    Prevents Multinucleation through Control of MKLP1-Dependent RhoA Activity during
    Cytokinesis.” <i>Nature Communications</i>. Springer Nature, 2016. <a href="https://doi.org/10.1038/ncomms13874">https://doi.org/10.1038/ncomms13874</a>.
  ieee: R. A. H. van de Ven <i>et al.</i>, “p120-catenin prevents multinucleation
    through control of MKLP1-dependent RhoA activity during cytokinesis,” <i>Nature
    Communications</i>, vol. 7. Springer Nature, 2016.
  ista: van de Ven RAH, de Groot JS, Park D, van Domselaar R, de Jong D, Szuhai K,
    van der Wall E, Rueda OM, Ali HR, Caldas C, van Diest PJ, Hetzer M, Sahai E, Derksen
    PWB. 2016. p120-catenin prevents multinucleation through control of MKLP1-dependent
    RhoA activity during cytokinesis. Nature Communications. 7, 13874.
  mla: van de Ven, Robert A. H., et al. “P120-Catenin Prevents Multinucleation through
    Control of MKLP1-Dependent RhoA Activity during Cytokinesis.” <i>Nature Communications</i>,
    vol. 7, 13874, Springer Nature, 2016, doi:<a href="https://doi.org/10.1038/ncomms13874">10.1038/ncomms13874</a>.
  short: R.A.H. van de Ven, J.S. de Groot, D. Park, R. van Domselaar, D. de Jong,
    K. Szuhai, E. van der Wall, O.M. Rueda, H.R. Ali, C. Caldas, P.J. van Diest, M.
    Hetzer, E. Sahai, P.W.B. Derksen, Nature Communications 7 (2016).
date_created: 2022-04-07T07:48:34Z
date_published: 2016-12-22T00:00:00Z
date_updated: 2022-07-18T08:34:32Z
day: '22'
doi: 10.1038/ncomms13874
extern: '1'
external_id:
  pmid:
  - '28004812'
fulldoi: https://doi.org/10.1038/ncomms13874
intvolume: '         7'
keyword:
- General Physics and Astronomy
- General Biochemistry
- Genetics and Molecular Biology
- General Chemistry
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1038/ncomms13874
month: '12'
oa: 1
oa_version: Published Version
pmid: 1
publication: Nature Communications
publication_identifier:
  issn:
  - 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
  link:
  - relation: erratum
    url: https://doi.org/10.1038/ncomms16030
scopus_import: '1'
status: public
title: p120-catenin prevents multinucleation through control of MKLP1-dependent RhoA
  activity during cytokinesis
type: journal_article
user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd
volume: 7
year: '2016'
...
---
_id: '1115'
abstract:
- lang: eng
  text: We present a coherent microwave to telecom signal converter based on the electro-optical
    effect using a crystalline WGM-resonator coupled to a 3D microwave cavity, achieving
    high photon conversion efficiency of 0.1% with MHz bandwidth.
article_number: '7788479'
article_processing_charge: No
arxiv: 1
author:
- first_name: Alfredo
  full_name: Rueda, Alfredo
  last_name: Rueda
- first_name: Florian
  full_name: Sedlmeir, Florian
  last_name: Sedlmeir
- first_name: Michele
  full_name: Collodo, Michele
  last_name: Collodo
- first_name: Ulrich
  full_name: Vogl, Ulrich
  last_name: Vogl
- first_name: Birgit
  full_name: Stiller, Birgit
  last_name: Stiller
- first_name: Georg
  full_name: Schunk, Georg
  last_name: Schunk
- first_name: Dimitry
  full_name: Strekalov, Dimitry
  last_name: Strekalov
- first_name: Christoph
  full_name: Marquardt, Christoph
  last_name: Marquardt
- first_name: Johannes M
  full_name: Fink, Johannes M
  id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
  last_name: Fink
  orcid: 0000-0001-8112-028X
- first_name: Oskar
  full_name: Painter, Oskar
  last_name: Painter
- first_name: Gerd
  full_name: Leuchs, Gerd
  last_name: Leuchs
- first_name: Harald
  full_name: Schwefel, Harald
  last_name: Schwefel
citation:
  ama: 'Rueda A, Sedlmeir F, Collodo M, et al. Efficient single sideband microwave
    to optical conversion using a LiNbO₃ WGM-resonator. In: IEEE; 2016. doi:<a href="https://doi.org/10.1364/CLEO_SI.2016.SF2G.3">10.1364/CLEO_SI.2016.SF2G.3</a>'
  apa: 'Rueda, A., Sedlmeir, F., Collodo, M., Vogl, U., Stiller, B., Schunk, G., …
    Schwefel, H. (2016). Efficient single sideband microwave to optical conversion
    using a LiNbO₃ WGM-resonator. Presented at the CLEO: Conference on Lasers and
    Electro Optics, San Jose, CA, USA: IEEE. <a href="https://doi.org/10.1364/CLEO_SI.2016.SF2G.3">https://doi.org/10.1364/CLEO_SI.2016.SF2G.3</a>'
  chicago: Rueda, Alfredo, Florian Sedlmeir, Michele Collodo, Ulrich Vogl, Birgit
    Stiller, Georg Schunk, Dimitry Strekalov, et al. “Efficient Single Sideband Microwave
    to Optical Conversion Using a LiNbO₃ WGM-Resonator.” IEEE, 2016. <a href="https://doi.org/10.1364/CLEO_SI.2016.SF2G.3">https://doi.org/10.1364/CLEO_SI.2016.SF2G.3</a>.
  ieee: 'A. Rueda <i>et al.</i>, “Efficient single sideband microwave to optical conversion
    using a LiNbO₃ WGM-resonator,” presented at the CLEO: Conference on Lasers and
    Electro Optics, San Jose, CA, USA, 2016.'
  ista: 'Rueda A, Sedlmeir F, Collodo M, Vogl U, Stiller B, Schunk G, Strekalov D,
    Marquardt C, Fink JM, Painter O, Leuchs G, Schwefel H. 2016. Efficient single
    sideband microwave to optical conversion using a LiNbO₃ WGM-resonator. CLEO: Conference
    on Lasers and Electro Optics, 7788479.'
  mla: Rueda, Alfredo, et al. <i>Efficient Single Sideband Microwave to Optical Conversion
    Using a LiNbO₃ WGM-Resonator</i>. 7788479, IEEE, 2016, doi:<a href="https://doi.org/10.1364/CLEO_SI.2016.SF2G.3">10.1364/CLEO_SI.2016.SF2G.3</a>.
  short: A. Rueda, F. Sedlmeir, M. Collodo, U. Vogl, B. Stiller, G. Schunk, D. Strekalov,
    C. Marquardt, J.M. Fink, O. Painter, G. Leuchs, H. Schwefel, in:, IEEE, 2016.
conference:
  end_date: 2016-06-10
  location: San Jose, CA, USA
  name: 'CLEO: Conference on Lasers and Electro Optics'
  start_date: 2016-06-05
date_created: 2018-12-11T11:50:14Z
date_published: 2016-12-16T00:00:00Z
date_updated: 2025-04-22T13:41:54Z
day: '16'
department:
- _id: JoFi
doi: 10.1364/CLEO_SI.2016.SF2G.3
external_id:
  arxiv:
  - '1601.07261'
fulldoi: https://doi.org/10.1364/CLEO_SI.2016.SF2G.3
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1601.07261
month: '12'
oa: 1
oa_version: Preprint
publication_status: published
publisher: IEEE
publist_id: '6251'
quality_controlled: '1'
related_material:
  link:
  - relation: other
    url: http://ieeexplore.ieee.org/document/7788479/
scopus_import: '1'
status: public
title: Efficient single sideband microwave to optical conversion using a LiNbO₃ WGM-resonator
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
OA_place: publisher
_id: '1130'
abstract:
- lang: eng
  text: "In this thesis we present a computer-aided programming approach to concurrency.
    Our approach helps the programmer by automatically fixing concurrency-related
    bugs, i.e. bugs that occur when the program is executed using an aggressive preemptive
    scheduler, but not when using a non-preemptive (cooperative) scheduler. Bugs are
    program behaviours that are incorrect w.r.t. a specification. We consider both
    user-provided explicit specifications in the form of assertion\r\nstatements in
    the code as well as an implicit specification. The implicit specification is inferred
    from the non-preemptive behaviour. Let us consider sequences of calls that the
    program makes to an external interface. The implicit specification requires that
    any such sequence produced under a preemptive scheduler should be included in
    the set of sequences produced under a non-preemptive scheduler. We consider several
    semantics-preserving fixes that go beyond atomic sections typically explored in
    the synchronisation synthesis literature. Our synthesis is able to place locks,
    barriers and wait-signal statements and last, but not least reorder independent
    statements. The latter may be useful if a thread is released to early, e.g., before
    some initialisation is completed. We guarantee that our synthesis does not introduce
    deadlocks and that the synchronisation inserted is optimal w.r.t. a given objective
    function. We dub our solution trace-based synchronisation synthesis and it is
    loosely based on counterexample-guided inductive synthesis (CEGIS). The synthesis
    works by discovering a trace that is incorrect w.r.t. the specification and identifying
    ordering constraints crucial to trigger the specification violation. Synchronisation
    may be placed immediately (greedy approach) or delayed until all incorrect traces
    are found (non-greedy approach). For the non-greedy approach we construct a set
    of global constraints over synchronisation placements. Each model of the global
    constraints set corresponds to a correctness-ensuring synchronisation placement.
    The placement that is optimal w.r.t. the given objective function is chosen as
    the synchronisation solution. We evaluate our approach on a number of realistic
    (albeit simplified) Linux device-driver\r\nbenchmarks. The benchmarks are versions
    of the drivers with known concurrency-related bugs. For the experiments with an
    explicit specification we added assertions that would detect the bugs in the experiments.
    Device drivers lend themselves to implicit specification, where the device and
    the operating system are the external interfaces. Our experiments demonstrate
    that our synthesis method is precise and efficient. We implemented objective functions
    for coarse-grained and fine-grained locking and observed that different synchronisation
    placements are produced for our experiments, favouring e.g. a minimal number of
    synchronisation operations or maximum concurrency."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Thorsten
  full_name: Tarrach, Thorsten
  id: 3D6E8F2C-F248-11E8-B48F-1D18A9856A87
  last_name: Tarrach
  orcid: 0000-0003-4409-8487
citation:
  ama: Tarrach T. Automatic synthesis of synchronisation primitives for concurrent
    programs. 2016. doi:<a href="https://doi.org/10.15479/at:ista:1130">10.15479/at:ista:1130</a>
  apa: Tarrach, T. (2016). <i>Automatic synthesis of synchronisation primitives for
    concurrent programs</i>. Institute of Science and Technology Austria. <a href="https://doi.org/10.15479/at:ista:1130">https://doi.org/10.15479/at:ista:1130</a>
  chicago: Tarrach, Thorsten. “Automatic Synthesis of Synchronisation Primitives for
    Concurrent Programs.” Institute of Science and Technology Austria, 2016. <a href="https://doi.org/10.15479/at:ista:1130">https://doi.org/10.15479/at:ista:1130</a>.
  ieee: T. Tarrach, “Automatic synthesis of synchronisation primitives for concurrent
    programs,” Institute of Science and Technology Austria, 2016.
  ista: Tarrach T. 2016. Automatic synthesis of synchronisation primitives for concurrent
    programs. Institute of Science and Technology Austria.
  mla: Tarrach, Thorsten. <i>Automatic Synthesis of Synchronisation Primitives for
    Concurrent Programs</i>. Institute of Science and Technology Austria, 2016, doi:<a
    href="https://doi.org/10.15479/at:ista:1130">10.15479/at:ista:1130</a>.
  short: T. Tarrach, Automatic Synthesis of Synchronisation Primitives for Concurrent
    Programs, Institute of Science and Technology Austria, 2016.
corr_author: '1'
date_created: 2018-12-11T11:50:19Z
date_published: 2016-07-07T00:00:00Z
date_updated: 2026-04-09T10:54:01Z
day: '07'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: ToHe
- _id: GradSch
doi: 10.15479/at:ista:1130
ec_funded: 1
file:
- access_level: open_access
  checksum: 319a506831650327e85376db41fc1094
  content_type: application/pdf
  creator: dernst
  date_created: 2021-02-22T11:39:32Z
  date_updated: 2021-02-22T11:39:32Z
  file_id: '9179'
  file_name: 2016_Tarrach_Thesis.pdf
  file_size: 1523935
  relation: main_file
  success: 1
- access_level: closed
  checksum: 39efcd789f0ad859ff15652cb7afc412
  content_type: application/pdf
  creator: cchlebak
  date_created: 2021-11-16T14:14:38Z
  date_updated: 2021-11-17T13:46:55Z
  file_id: '10296'
  file_name: 2016_Tarrach_Thesispdfa.pdf
  file_size: 1306068
  relation: main_file
file_date_updated: 2021-11-17T13:46:55Z
fulldoi: https://doi.org/10.15479/at:ista:1130
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://thorstent.github.io/theses/phd_thorsten_tarrach.pdf
month: '07'
oa: 1
oa_version: Published Version
page: '151'
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '267989'
  name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _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:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6230'
related_material:
  record:
  - id: '2218'
    relation: part_of_dissertation
    status: public
  - id: '2445'
    relation: part_of_dissertation
    status: public
  - id: '1729'
    relation: part_of_dissertation
    status: public
status: public
supervisor:
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
title: Automatic synthesis of synchronisation primitives for concurrent programs
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2016'
...
