---
_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
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: '1101'
abstract:
- lang: eng
  text: Optical sensors based on the phenomenon of Förster resonance energy transfer
    (FRET) are powerful tools that have advanced the study of small molecules in biological
    systems. However, sensor construction is not trivial and often requires multiple
    rounds of engineering or an ability to screen large numbers of variants. A method
    that would allow the accurate rational design of FRET sensors would expedite the
    production of biologically useful sensors. Here, we present Rangefinder, a computational
    algorithm that allows rapid in silico screening of dye attachment sites in a ligand-binding
    protein for the conjugation of a dye molecule to act as a Förster acceptor for
    a fused fluorescent protein. We present three ratiometric fluorescent sensors
    designed with Rangefinder, including a maltose sensor with a dynamic range of
    &gt;300% and the first sensors for the most abundant sialic acid in human cells,
    N-acetylneuraminic acid. Provided a ligand-binding protein exists, it is our expectation
    that this model will facilitate the design of an optical sensor for any small
    molecule of interest.
acknowledgement: "J.A.M., J.H.W., and W.H.Z. were supported by Australian\r\nPostgraduate
  Awards (APA), AS Sargeson Supplementary\r\nscholarships, and RSC supplementary scholarships.
  C.J.J.\r\nacknowledges support from a Human Frontiers in Science\r\nYoung Investigator
  Award and a Discovery Project and Future\r\nFellowship from the Australian Research
  Council. M.L.O. is\r\nsupported by an Australian Research Council Discovery Project\r\n(DP130102153)
  and the Merit Allocation Scheme of the\r\nNational Computational Infrastructure."
article_processing_charge: No
author:
- first_name: Joshua
  full_name: Mitchell, Joshua
  last_name: Mitchell
- first_name: Jason
  full_name: Whitfield, Jason
  last_name: Whitfield
- first_name: William
  full_name: Zhang, William
  last_name: Zhang
- first_name: Christian
  full_name: Henneberger, Christian
  last_name: Henneberger
- first_name: Harald L
  full_name: Janovjak, Harald L
  id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
  last_name: Janovjak
  orcid: 0000-0002-8023-9315
- first_name: Megan
  full_name: O'Mara, Megan
  last_name: O'Mara
- first_name: Colin
  full_name: Jackson, Colin
  last_name: Jackson
citation:
  ama: 'Mitchell J, Whitfield J, Zhang W, et al. Rangefinder: A semisynthetic FRET
    sensor design algorithm. <i>ACS SENSORS</i>. 2016;1(11):1286-1290. doi:<a href="https://doi.org/10.1021/acssensors.6b00576">10.1021/acssensors.6b00576</a>'
  apa: 'Mitchell, J., Whitfield, J., Zhang, W., Henneberger, C., Janovjak, H. L.,
    O’Mara, M., &#38; Jackson, C. (2016). Rangefinder: A semisynthetic FRET sensor
    design algorithm. <i>ACS SENSORS</i>. American Chemical Society. <a href="https://doi.org/10.1021/acssensors.6b00576">https://doi.org/10.1021/acssensors.6b00576</a>'
  chicago: 'Mitchell, Joshua, Jason Whitfield, William Zhang, Christian Henneberger,
    Harald L Janovjak, Megan O’Mara, and Colin Jackson. “Rangefinder: A Semisynthetic
    FRET Sensor Design Algorithm.” <i>ACS SENSORS</i>. American Chemical Society,
    2016. <a href="https://doi.org/10.1021/acssensors.6b00576">https://doi.org/10.1021/acssensors.6b00576</a>.'
  ieee: 'J. Mitchell <i>et al.</i>, “Rangefinder: A semisynthetic FRET sensor design
    algorithm,” <i>ACS SENSORS</i>, vol. 1, no. 11. American Chemical Society, pp.
    1286–1290, 2016.'
  ista: 'Mitchell J, Whitfield J, Zhang W, Henneberger C, Janovjak HL, O’Mara M, Jackson
    C. 2016. Rangefinder: A semisynthetic FRET sensor design algorithm. ACS SENSORS.
    1(11), 1286–1290.'
  mla: 'Mitchell, Joshua, et al. “Rangefinder: A Semisynthetic FRET Sensor Design
    Algorithm.” <i>ACS SENSORS</i>, vol. 1, no. 11, American Chemical Society, 2016,
    pp. 1286–90, doi:<a href="https://doi.org/10.1021/acssensors.6b00576">10.1021/acssensors.6b00576</a>.'
  short: J. Mitchell, J. Whitfield, W. Zhang, C. Henneberger, H.L. Janovjak, M. O’Mara,
    C. Jackson, ACS SENSORS 1 (2016) 1286–1290.
date_created: 2018-12-11T11:50:09Z
date_published: 2016-11-10T00:00:00Z
date_updated: 2025-09-22T14:14:58Z
day: '10'
department:
- _id: HaJa
doi: 10.1021/acssensors.6b00576
external_id:
  isi:
  - '000388914800003'
intvolume: '         1'
isi: 1
issue: '11'
language:
- iso: eng
month: '11'
oa_version: None
page: 1286 - 1290
publication: ACS SENSORS
publication_status: published
publisher: American Chemical Society
publist_id: '6274'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Rangefinder: A semisynthetic FRET sensor design algorithm'
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 1
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."
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: 2021-01-12T06:48:18Z
day: '01'
department:
- _id: ChLa
doi: 10.5244/C.30.92
ec_funded: 1
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: 3E5EF7F0-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'
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: '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'
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'
...
---
_id: '1134'
abstract:
- lang: eng
  text: 'Hybrid systems have both continuous and discrete dynamics and are useful
    for modeling a variety of control systems, from air traffic control protocols
    to robotic maneuvers and beyond. Recently, numerous powerful and scalable tools
    for analyzing hybrid systems have emerged. Several of these tools implement automated
    formal methods for mathematically proving a system meets a specification. This
    tutorial session will present three recent hybrid systems tools: C2E2, HyST, and
    TuLiP. C2E2 is a simulated-based verification tool for hybrid systems, and uses
    validated numerical solvers and bloating of simulation traces to verify systems
    meet specifications. HyST is a hybrid systems model transformation and translation
    tool, and uses a canonical intermediate representation to support most of the
    recent verification tools, as well as automated sound abstractions that simplify
    verification of a given hybrid system. TuLiP is a controller synthesis tool for
    hybrid systems, where given a temporal logic specification to be satisfied for
    a system (plant) model, TuLiP will find a controller that meets a given specification.
    © 2016 IEEE.'
article_number: '7587948'
author:
- first_name: Parasara
  full_name: Duggirala, Parasara
  last_name: Duggirala
- first_name: Chuchu
  full_name: Fan, Chuchu
  last_name: Fan
- first_name: Matthew
  full_name: Potok, Matthew
  last_name: Potok
- first_name: Bolun
  full_name: Qi, Bolun
  last_name: Qi
- first_name: Sayan
  full_name: Mitra, Sayan
  last_name: Mitra
- first_name: Mahesh
  full_name: Viswanathan, Mahesh
  last_name: Viswanathan
- first_name: Stanley
  full_name: Bak, Stanley
  last_name: Bak
- first_name: Sergiy
  full_name: Bogomolov, Sergiy
  id: 369D9A44-F248-11E8-B48F-1D18A9856A87
  last_name: Bogomolov
  orcid: 0000-0002-0686-0365
- first_name: Taylor
  full_name: Johnson, Taylor
  last_name: Johnson
- first_name: Luan
  full_name: Nguyen, Luan
  last_name: Nguyen
- first_name: Christian
  full_name: Schilling, Christian
  id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87
  last_name: Schilling
  orcid: 0000-0003-3658-1065
- first_name: Andrew
  full_name: Sogokon, Andrew
  last_name: Sogokon
- first_name: Hoang
  full_name: Tran, Hoang
  last_name: Tran
- first_name: Weiming
  full_name: Xiang, Weiming
  last_name: Xiang
citation:
  ama: 'Duggirala P, Fan C, Potok M, et al. Tutorial: Software tools for hybrid systems
    verification transformation and synthesis C2E2 HyST and TuLiP. In: <i>2016 IEEE
    Conference on Control Applications</i>. IEEE; 2016. doi:<a href="https://doi.org/10.1109/CCA.2016.7587948">10.1109/CCA.2016.7587948</a>'
  apa: 'Duggirala, P., Fan, C., Potok, M., Qi, B., Mitra, S., Viswanathan, M., … Xiang,
    W. (2016). Tutorial: Software tools for hybrid systems verification transformation
    and synthesis C2E2 HyST and TuLiP. In <i>2016 IEEE Conference on Control Applications</i>.
    Buenos Aires, Argentina : IEEE. <a href="https://doi.org/10.1109/CCA.2016.7587948">https://doi.org/10.1109/CCA.2016.7587948</a>'
  chicago: 'Duggirala, Parasara, Chuchu Fan, Matthew Potok, Bolun Qi, Sayan Mitra,
    Mahesh Viswanathan, Stanley Bak, et al. “Tutorial: Software Tools for Hybrid Systems
    Verification Transformation and Synthesis C2E2 HyST and TuLiP.” In <i>2016 IEEE
    Conference on Control Applications</i>. IEEE, 2016. <a href="https://doi.org/10.1109/CCA.2016.7587948">https://doi.org/10.1109/CCA.2016.7587948</a>.'
  ieee: 'P. Duggirala <i>et al.</i>, “Tutorial: Software tools for hybrid systems
    verification transformation and synthesis C2E2 HyST and TuLiP,” in <i>2016 IEEE
    Conference on Control Applications</i>, Buenos Aires, Argentina , 2016.'
  ista: 'Duggirala P, Fan C, Potok M, Qi B, Mitra S, Viswanathan M, Bak S, Bogomolov
    S, Johnson T, Nguyen L, Schilling C, Sogokon A, Tran H, Xiang W. 2016. Tutorial:
    Software tools for hybrid systems verification transformation and synthesis C2E2
    HyST and TuLiP. 2016 IEEE Conference on Control Applications. CCA: Control Applications
    , 7587948.'
  mla: 'Duggirala, Parasara, et al. “Tutorial: Software Tools for Hybrid Systems Verification
    Transformation and Synthesis C2E2 HyST and TuLiP.” <i>2016 IEEE Conference on
    Control Applications</i>, 7587948, IEEE, 2016, doi:<a href="https://doi.org/10.1109/CCA.2016.7587948">10.1109/CCA.2016.7587948</a>.'
  short: P. Duggirala, C. Fan, M. Potok, B. Qi, S. Mitra, M. Viswanathan, S. Bak,
    S. Bogomolov, T. Johnson, L. Nguyen, C. Schilling, A. Sogokon, H. Tran, W. Xiang,
    in:, 2016 IEEE Conference on Control Applications, IEEE, 2016.
conference:
  end_date: 2016-09-22
  location: 'Buenos Aires, Argentina '
  name: 'CCA: Control Applications '
  start_date: 2016-09-19
date_created: 2018-12-11T11:50:20Z
date_published: 2016-10-10T00:00:00Z
date_updated: 2021-01-12T06:48:32Z
day: '10'
department:
- _id: ToHe
doi: 10.1109/CCA.2016.7587948
language:
- iso: eng
month: '10'
oa_version: None
publication: 2016 IEEE Conference on Control Applications
publication_status: published
publisher: IEEE
publist_id: '6224'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Tutorial: Software tools for hybrid systems verification transformation and
  synthesis C2E2 HyST and TuLiP'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '1135'
abstract:
- lang: eng
  text: 'Time-triggered (TT) switched networks are a deterministic communication infrastructure
    used by real-time distributed embedded systems. These networks rely on the notion
    of globally discretized time (i.e. time slots) and a static TT schedule that prescribes
    which message is sent through which link at every time slot, such that all messages
    reach their destination before a global timeout. These schedules are generated
    offline, assuming a static network with fault-free links, and entrusting all error-handling
    functions to the end user. Assuming the network is static is an over-optimistic
    view, and indeed links tend to fail in practice. We study synthesis of TT schedules
    on a network in which links fail over time and we assume the switches run a very
    simple error-recovery protocol once they detect a crashed link. We address the
    problem of finding a pk; qresistant schedule; namely, one that, assuming the switches
    run a fixed error-recovery protocol, guarantees that the number of messages that
    arrive at their destination by the timeout is at least no matter what sequence
    of at most k links fail. Thus, we maintain the simplicity of the switches while
    giving a guarantee on the number of messages that meet the timeout. We show how
    a pk; q-resistant schedule can be obtained using a CEGAR-like approach: find a
    schedule, decide whether it is pk; q-resistant, and if it is not, use the witnessing
    fault sequence to generate a constraint that is added to the program. The newly
    added constraint disallows the schedule to be regenerated in a future iteration
    while also eliminating several other schedules that are not pk; q-resistant. We
    illustrate the applicability of our approach using an SMT-based implementation.
    © 2016 ACM.'
article_number: '26'
article_processing_charge: No
author:
- first_name: Guy
  full_name: Avni, Guy
  id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
  last_name: Avni
  orcid: 0000-0001-5588-8287
- first_name: Shibashis
  full_name: Guha, Shibashis
  last_name: Guha
- first_name: Guillermo
  full_name: Rodríguez Navas, Guillermo
  last_name: Rodríguez Navas
citation:
  ama: 'Avni G, Guha S, Rodríguez Navas G. Synthesizing time triggered schedules for
    switched networks with faulty links. In: <i>Proceedings of the 13th International
    Conference on Embedded Software </i>. ACM; 2016. doi:<a href="https://doi.org/10.1145/2968478.2968499">10.1145/2968478.2968499</a>'
  apa: 'Avni, G., Guha, S., &#38; Rodríguez Navas, G. (2016). Synthesizing time triggered
    schedules for switched networks with faulty links. In <i>Proceedings of the 13th
    International Conference on Embedded Software </i>. Pittsburgh, PA, USA: ACM.
    <a href="https://doi.org/10.1145/2968478.2968499">https://doi.org/10.1145/2968478.2968499</a>'
  chicago: Avni, Guy, Shibashis Guha, and Guillermo Rodríguez Navas. “Synthesizing
    Time Triggered Schedules for Switched Networks with Faulty Links.” In <i>Proceedings
    of the 13th International Conference on Embedded Software </i>. ACM, 2016. <a
    href="https://doi.org/10.1145/2968478.2968499">https://doi.org/10.1145/2968478.2968499</a>.
  ieee: G. Avni, S. Guha, and G. Rodríguez Navas, “Synthesizing time triggered schedules
    for switched networks with faulty links,” in <i>Proceedings of the 13th International
    Conference on Embedded Software </i>, Pittsburgh, PA, USA, 2016.
  ista: 'Avni G, Guha S, Rodríguez Navas G. 2016. Synthesizing time triggered schedules
    for switched networks with faulty links. Proceedings of the 13th International
    Conference on Embedded Software . EMSOFT: Embedded Software , 26.'
  mla: Avni, Guy, et al. “Synthesizing Time Triggered Schedules for Switched Networks
    with Faulty Links.” <i>Proceedings of the 13th International Conference on Embedded
    Software </i>, 26, ACM, 2016, doi:<a href="https://doi.org/10.1145/2968478.2968499">10.1145/2968478.2968499</a>.
  short: G. Avni, S. Guha, G. Rodríguez Navas, in:, Proceedings of the 13th International
    Conference on Embedded Software , ACM, 2016.
conference:
  end_date: 2016-10-07
  location: Pittsburgh, PA, USA
  name: 'EMSOFT: Embedded Software '
  start_date: 2016-10-01
date_created: 2018-12-11T11:50:20Z
date_published: 2016-10-01T00:00:00Z
date_updated: 2025-09-22T14:14:05Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1145/2968478.2968499
ec_funded: 1
external_id:
  isi:
  - '000414220100026'
file:
- access_level: open_access
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:09:31Z
  date_updated: 2018-12-12T10:09:31Z
  file_id: '4755'
  file_name: IST-2016-644-v1+1_emsoft-no-format.pdf
  file_size: 279240
  relation: main_file
file_date_updated: 2018-12-12T10:09:31Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted 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: 'Proceedings of the 13th International Conference on Embedded Software '
publication_status: published
publisher: ACM
publist_id: '6223'
pubrep_id: '644'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Synthesizing time triggered schedules for switched networks with faulty links
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2016'
...
---
_id: '1136'
abstract:
- lang: eng
  text: We propose an interactive sculpting system for seamlessly editing pre-computed
    animations of liquid, without the need for any resimulation. The input is a sequence
    of meshes without correspondences representing the liquid surface over time. Our
    method enables the efficient selection of consistent space-time parts of this
    animation, such as moving waves or droplets, which we call space-time features.
    Once selected, a feature can be copied, edited, or duplicated and then pasted
    back anywhere in space and time in the same or in another liquid animation sequence.
    Our method circumvents tedious user interactions by automatically computing the
    spatial and temporal ranges of the selected feature. We also provide space-time
    shape editing tools for non-uniform scaling, rotation, trajectory changes, and
    temporal editing to locally speed up or slow down motion. Using our tools, the
    user can edit and progressively refine any input simulation result, possibly using
    a library of precomputed space-time features extracted from other animations.
    In contrast to the trial-and-error loop usually required to edit animation results
    through the tuning of indirect simulation parameters, our method gives the user
    full control over the edited space-time behaviors. © 2016 Copyright held by the
    owner/author(s).
acknowledgement: This work was partly supported by the starting grant BigSplash, as
  well as the advanced grant EXPRESSIVE from the European Research Council (ERC-2014-StG
  638176 , and ERC-2011-ADG 20110209).
article_number: '2994261'
article_processing_charge: No
author:
- first_name: Pierre
  full_name: Manteaux, Pierre
  last_name: Manteaux
- first_name: Ulysse
  full_name: Vimont, Ulysse
  last_name: Vimont
- first_name: Christopher J
  full_name: Wojtan, Christopher J
  id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
  last_name: Wojtan
  orcid: 0000-0001-6646-5546
- first_name: Damien
  full_name: Rohmer, Damien
  last_name: Rohmer
- first_name: Marie
  full_name: Cani, Marie
  last_name: Cani
citation:
  ama: 'Manteaux P, Vimont U, Wojtan C, Rohmer D, Cani M. Space-time sculpting of
    liquid animation. In: <i>Proceedings of the 9th International Conference on Motion
    in Games </i>. ACM; 2016. doi:<a href="https://doi.org/10.1145/2994258.2994261">10.1145/2994258.2994261</a>'
  apa: 'Manteaux, P., Vimont, U., Wojtan, C., Rohmer, D., &#38; Cani, M. (2016). Space-time
    sculpting of liquid animation. In <i>Proceedings of the 9th International Conference
    on Motion in Games </i>. San Francisco, CA, USA: ACM. <a href="https://doi.org/10.1145/2994258.2994261">https://doi.org/10.1145/2994258.2994261</a>'
  chicago: Manteaux, Pierre, Ulysse Vimont, Chris Wojtan, Damien Rohmer, and Marie
    Cani. “Space-Time Sculpting of Liquid Animation.” In <i>Proceedings of the 9th
    International Conference on Motion in Games </i>. ACM, 2016. <a href="https://doi.org/10.1145/2994258.2994261">https://doi.org/10.1145/2994258.2994261</a>.
  ieee: P. Manteaux, U. Vimont, C. Wojtan, D. Rohmer, and M. Cani, “Space-time sculpting
    of liquid animation,” in <i>Proceedings of the 9th International Conference on
    Motion in Games </i>, San Francisco, CA, USA, 2016.
  ista: 'Manteaux P, Vimont U, Wojtan C, Rohmer D, Cani M. 2016. Space-time sculpting
    of liquid animation. Proceedings of the 9th International Conference on Motion
    in Games . MIG: Motion in Games, 2994261.'
  mla: Manteaux, Pierre, et al. “Space-Time Sculpting of Liquid Animation.” <i>Proceedings
    of the 9th International Conference on Motion in Games </i>, 2994261, ACM, 2016,
    doi:<a href="https://doi.org/10.1145/2994258.2994261">10.1145/2994258.2994261</a>.
  short: P. Manteaux, U. Vimont, C. Wojtan, D. Rohmer, M. Cani, in:, Proceedings of
    the 9th International Conference on Motion in Games , ACM, 2016.
conference:
  end_date: 2016-10-12
  location: San Francisco, CA, USA
  name: 'MIG: Motion in Games'
  start_date: 2016-10-10
date_created: 2018-12-11T11:50:20Z
date_published: 2016-10-10T00:00:00Z
date_updated: 2024-10-22T09:58:18Z
day: '10'
ddc:
- '004'
department:
- _id: ChWo
doi: 10.1145/2994258.2994261
ec_funded: 1
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://hal.inria.fr/hal-01367181
month: '10'
oa: 1
oa_version: Submitted Version
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '638176'
  name: 'Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large
    Scales'
publication: 'Proceedings of the 9th International Conference on Motion in Games '
publication_status: published
publisher: ACM
publist_id: '6222'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Space-time sculpting of liquid animation
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '1137'
abstract:
- lang: eng
  text: RASGRP1 is an important guanine nucleotide exchange factor and activator of
    the RAS-MAPK pathway following T cell antigen receptor (TCR) signaling. The consequences
    of RASGRP1 mutations in humans are unknown. In a patient with recurrent bacterial
    and viral infections, born to healthy consanguineous parents, we used homozygosity
    mapping and exome sequencing to identify a biallelic stop-gain variant in RASGRP1.
    This variant segregated perfectly with the disease and has not been reported in
    genetic databases. RASGRP1 deficiency was associated in T cells and B cells with
    decreased phosphorylation of the extracellular-signal-regulated serine kinase
    ERK, which was restored following expression of wild-type RASGRP1. RASGRP1 deficiency
    also resulted in defective proliferation, activation and motility of T cells and
    B cells. RASGRP1-deficient natural killer (NK) cells exhibited impaired cytotoxicity
    with defective granule convergence and actin accumulation. Interaction proteomics
    identified the dynein light chain DYNLL1 as interacting with RASGRP1, which links
    RASGRP1 to cytoskeletal dynamics. RASGRP1-deficient cells showed decreased activation
    of the GTPase RhoA. Treatment with lenalidomide increased RhoA activity and reversed
    the migration and activation defects of RASGRP1-deficient lymphocytes.
article_processing_charge: No
article_type: original
author:
- first_name: Elisabeth
  full_name: Salzer, Elisabeth
  last_name: Salzer
- first_name: Deniz
  full_name: Çaǧdaş, Deniz
  last_name: Çaǧdaş
- first_name: Miroslav
  full_name: Hons, Miroslav
  id: 4167FE56-F248-11E8-B48F-1D18A9856A87
  last_name: Hons
  orcid: 0000-0002-6625-3348
- first_name: Emily
  full_name: Mace, Emily
  last_name: Mace
- first_name: Wojciech
  full_name: Garncarz, Wojciech
  last_name: Garncarz
- first_name: Oezlem
  full_name: Petronczki, Oezlem
  last_name: Petronczki
- first_name: René
  full_name: Platzer, René
  last_name: Platzer
- first_name: Laurène
  full_name: Pfajfer, Laurène
  last_name: Pfajfer
- first_name: Ivan
  full_name: Bilic, Ivan
  last_name: Bilic
- first_name: Sol
  full_name: Ban, Sol
  last_name: Ban
- first_name: Katharina
  full_name: Willmann, Katharina
  last_name: Willmann
- first_name: Malini
  full_name: Mukherjee, Malini
  last_name: Mukherjee
- first_name: Verena
  full_name: Supper, Verena
  last_name: Supper
- first_name: Hsiangting
  full_name: Hsu, Hsiangting
  last_name: Hsu
- first_name: Pinaki
  full_name: Banerjee, Pinaki
  last_name: Banerjee
- first_name: Papiya
  full_name: Sinha, Papiya
  last_name: Sinha
- first_name: Fabienne
  full_name: Mcclanahan, Fabienne
  last_name: Mcclanahan
- first_name: Gerhard
  full_name: Zlabinger, Gerhard
  last_name: Zlabinger
- first_name: Winfried
  full_name: Pickl, Winfried
  last_name: Pickl
- first_name: John
  full_name: Gribben, John
  last_name: Gribben
- first_name: Hannes
  full_name: Stockinger, Hannes
  last_name: Stockinger
- first_name: Keiryn
  full_name: Bennett, Keiryn
  last_name: Bennett
- first_name: Johannes
  full_name: Huppa, Johannes
  last_name: Huppa
- first_name: Loï̈C
  full_name: Dupré, Loï̈C
  last_name: Dupré
- first_name: Özden
  full_name: Sanal, Özden
  last_name: Sanal
- first_name: Ulrich
  full_name: Jäger, Ulrich
  last_name: Jäger
- first_name: Michael K
  full_name: Sixt, Michael K
  id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
  last_name: Sixt
  orcid: 0000-0002-6620-9179
- first_name: Ilhan
  full_name: Tezcan, Ilhan
  last_name: Tezcan
- first_name: Jordan
  full_name: Orange, Jordan
  last_name: Orange
- first_name: Kaan
  full_name: Boztug, Kaan
  last_name: Boztug
citation:
  ama: Salzer E, Çaǧdaş D, Hons M, et al. RASGRP1 deficiency causes immunodeficiency
    with impaired cytoskeletal dynamics. <i>Nature Immunology</i>. 2016;17(12):1352-1360.
    doi:<a href="https://doi.org/10.1038/ni.3575">10.1038/ni.3575</a>
  apa: Salzer, E., Çaǧdaş, D., Hons, M., Mace, E., Garncarz, W., Petronczki, O., …
    Boztug, K. (2016). RASGRP1 deficiency causes immunodeficiency with impaired cytoskeletal
    dynamics. <i>Nature Immunology</i>. Nature Publishing Group. <a href="https://doi.org/10.1038/ni.3575">https://doi.org/10.1038/ni.3575</a>
  chicago: Salzer, Elisabeth, Deniz Çaǧdaş, Miroslav Hons, Emily Mace, Wojciech Garncarz,
    Oezlem Petronczki, René Platzer, et al. “RASGRP1 Deficiency Causes Immunodeficiency
    with Impaired Cytoskeletal Dynamics.” <i>Nature Immunology</i>. Nature Publishing
    Group, 2016. <a href="https://doi.org/10.1038/ni.3575">https://doi.org/10.1038/ni.3575</a>.
  ieee: E. Salzer <i>et al.</i>, “RASGRP1 deficiency causes immunodeficiency with
    impaired cytoskeletal dynamics,” <i>Nature Immunology</i>, vol. 17, no. 12. Nature
    Publishing Group, pp. 1352–1360, 2016.
  ista: Salzer E, Çaǧdaş D, Hons M, Mace E, Garncarz W, Petronczki O, Platzer R, Pfajfer
    L, Bilic I, Ban S, Willmann K, Mukherjee M, Supper V, Hsu H, Banerjee P, Sinha
    P, Mcclanahan F, Zlabinger G, Pickl W, Gribben J, Stockinger H, Bennett K, Huppa
    J, Dupré L, Sanal Ö, Jäger U, Sixt MK, Tezcan I, Orange J, Boztug K. 2016. RASGRP1
    deficiency causes immunodeficiency with impaired cytoskeletal dynamics. Nature
    Immunology. 17(12), 1352–1360.
  mla: Salzer, Elisabeth, et al. “RASGRP1 Deficiency Causes Immunodeficiency with
    Impaired Cytoskeletal Dynamics.” <i>Nature Immunology</i>, vol. 17, no. 12, Nature
    Publishing Group, 2016, pp. 1352–60, doi:<a href="https://doi.org/10.1038/ni.3575">10.1038/ni.3575</a>.
  short: E. Salzer, D. Çaǧdaş, M. Hons, E. Mace, W. Garncarz, O. Petronczki, R. Platzer,
    L. Pfajfer, I. Bilic, S. Ban, K. Willmann, M. Mukherjee, V. Supper, H. Hsu, P.
    Banerjee, P. Sinha, F. Mcclanahan, G. Zlabinger, W. Pickl, J. Gribben, H. Stockinger,
    K. Bennett, J. Huppa, L. Dupré, Ö. Sanal, U. Jäger, M.K. Sixt, I. Tezcan, J. Orange,
    K. Boztug, Nature Immunology 17 (2016) 1352–1360.
date_created: 2018-12-11T11:50:21Z
date_published: 2016-12-01T00:00:00Z
date_updated: 2025-09-22T14:13:22Z
day: '01'
department:
- _id: MiSi
doi: 10.1038/ni.3575
external_id:
  isi:
  - '000388056400005'
  pmid:
  - '27776107'
intvolume: '        17'
isi: 1
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6400263
month: '12'
oa: 1
oa_version: Submitted Version
page: 1352 - 1360
pmid: 1
publication: Nature Immunology
publication_status: published
publisher: Nature Publishing Group
publist_id: '6221'
quality_controlled: '1'
scopus_import: '1'
status: public
title: RASGRP1 deficiency causes immunodeficiency with impaired cytoskeletal dynamics
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 17
year: '2016'
...
---
_id: '1138'
abstract:
- lang: eng
  text: Automata with monitor counters, where the transitions do not depend on counter
    values, and nested weighted automata are two expressive automata-theoretic frameworks
    for quantitative properties. For a well-studied and wide class of quantitative
    functions, we establish that automata with monitor counters and nested weighted
    automata are equivalent. We study for the first time such quantitative automata
    under probabilistic semantics. We show that several problems that are undecidable
    for the classical questions of emptiness and universality become decidable under
    the probabilistic semantics. We present a complete picture of decidability for
    such automata, and even an almost-complete picture of computational complexity,
    for the probabilistic questions we consider. © 2016 ACM.
acknowledgement: This research was funded in part by the European Research Council
  (ERC) under grant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF)
  projects S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), FWF Grant No P23499-
  N23, FWF NFN Grant No S114
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: 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. Quantitative automata under probabilistic
    semantics. In: <i>Proceedings of the 31st Annual ACM/IEEE Symposium</i>. IEEE;
    2016:76-85. doi:<a href="https://doi.org/10.1145/2933575.2933588">10.1145/2933575.2933588</a>'
  apa: 'Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2016). Quantitative automata
    under probabilistic semantics. In <i>Proceedings of the 31st Annual ACM/IEEE Symposium</i>
    (pp. 76–85). New York, NY, USA: IEEE. <a href="https://doi.org/10.1145/2933575.2933588">https://doi.org/10.1145/2933575.2933588</a>'
  chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Quantitative
    Automata under Probabilistic Semantics.” In <i>Proceedings of the 31st Annual
    ACM/IEEE Symposium</i>, 76–85. IEEE, 2016. <a href="https://doi.org/10.1145/2933575.2933588">https://doi.org/10.1145/2933575.2933588</a>.
  ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, “Quantitative automata under
    probabilistic semantics,” in <i>Proceedings of the 31st Annual ACM/IEEE Symposium</i>,
    New York, NY, USA, 2016, pp. 76–85.
  ista: 'Chatterjee K, Henzinger TA, Otop J. 2016. Quantitative automata under probabilistic
    semantics. Proceedings of the 31st Annual ACM/IEEE Symposium. LICS: Logic in Computer
    Science, 76–85.'
  mla: Chatterjee, Krishnendu, et al. “Quantitative Automata under Probabilistic Semantics.”
    <i>Proceedings of the 31st Annual ACM/IEEE Symposium</i>, IEEE, 2016, pp. 76–85,
    doi:<a href="https://doi.org/10.1145/2933575.2933588">10.1145/2933575.2933588</a>.
  short: K. Chatterjee, T.A. Henzinger, J. Otop, in:, Proceedings of the 31st Annual
    ACM/IEEE Symposium, IEEE, 2016, pp. 76–85.
conference:
  end_date: 2016-07-08
  location: New York, NY, USA
  name: 'LICS: Logic in Computer Science'
  start_date: 2016-07-05
date_created: 2018-12-11T11:50:21Z
date_published: 2016-07-05T00:00:00Z
date_updated: 2025-09-22T14:12:47Z
day: '05'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1145/2933575.2933588
ec_funded: 1
external_id:
  arxiv:
  - '1604.06764'
  isi:
  - '000387609200008'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1604.06764
month: '07'
oa: 1
oa_version: Preprint
page: 76 - 85
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
- _id: 2584A770-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: P 23499-N23
  name: Modern Graph Algorithmic Techniques in Formal Verification
- _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: Proceedings of the 31st Annual ACM/IEEE Symposium
publication_status: published
publisher: IEEE
publist_id: '6220'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quantitative automata under probabilistic semantics
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2016'
...
---
_id: '1140'
abstract:
- lang: eng
  text: 'Given a model of a system and an objective, the model-checking question asks
    whether the model satisfies the objective. We study polynomial-time problems in
    two classical models, graphs and Markov Decision Processes (MDPs), with respect
    to several fundamental -regular objectives, e.g., Rabin and Streett objectives.
    For many of these problems the best-known upper bounds are quadratic or cubic,
    yet no super-linear lower bounds are known. In this work our contributions are
    two-fold: First, we present several improved algorithms, and second, we present
    the first conditional super-linear lower bounds based on widely believed assumptions
    about the complexity of CNF-SAT and combinatorial Boolean matrix multiplication.
    A separation result for two models with respect to an objective means a conditional
    lower bound for one model that is strictly higher than the existing upper bound
    for the other model, and similarly for two objectives with respect to a model.
    Our results establish the following separation results: (1) A separation of models
    (graphs and MDPs) for disjunctive queries of reachability and Büchi objectives.
    (2) Two kinds of separations of objectives, both for graphs and MDPs, namely,
    (2a) the separation of dual objectives such as Streett/Rabin objectives, and (2b)
    the separation of conjunction and disjunction of multiple objectives of the same
    type such as safety, Büchi, and coBüchi. In summary, our results establish the
    first model and objective separation results for graphs and MDPs for various classical
    -regular objectives. Quite strikingly, we establish conditional lower bounds for
    the disjunction of objectives that are strictly higher than the existing upper
    bounds for the conjunction of the same objectives. © 2016 ACM.'
acknowledgement: "K.  C.,  M.  H.,  and  W.  D.  are  partially  supported  by  the
  \ Vienna\r\nScience and Technology Fund (WWTF) through project ICT15-003.\r\nK.
  C. is partially supported by the Austrian Science Fund (FWF)\r\nNFN Grant No S11407-N23
  (RiSE/SHiNE) and an ERC Start grant\r\n(279307: Graph Games). For W. D., M. H.,
  and V. L. the research\r\nleading to these results has received funding from the
  European\r\nResearch Council under the European Union’s Seventh Framework\r\nProgramme
  (FP/2007-2013) / ERC Grant Agreement no. 340506."
alternative_title:
- Proceedings Symposium on Logic in Computer Science
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Wolfgang
  full_name: Dvoák, Wolfgang
  last_name: Dvoák
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
- first_name: Veronika
  full_name: Loitzenbauer, Veronika
  last_name: Loitzenbauer
citation:
  ama: 'Chatterjee K, Dvoák W, Henzinger M, Loitzenbauer V. Model and objective separation
    with conditional lower bounds: disjunction is harder than conjunction. In: <i>Proceedings
    of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE;
    2016:197-206. doi:<a href="https://doi.org/10.1145/2933575.2935304">10.1145/2933575.2935304</a>'
  apa: 'Chatterjee, K., Dvoák, W., Henzinger, M., &#38; Loitzenbauer, V. (2016). Model
    and objective separation with conditional lower bounds: disjunction is harder
    than conjunction. In <i>Proceedings of the 31st Annual ACM/IEEE Symposium on Logic
    in Computer Science</i> (pp. 197–206). New York, NY, USA: IEEE. <a href="https://doi.org/10.1145/2933575.2935304">https://doi.org/10.1145/2933575.2935304</a>'
  chicago: 'Chatterjee, Krishnendu, Wolfgang Dvoák, Monika Henzinger, and Veronika
    Loitzenbauer. “Model and Objective Separation with Conditional Lower Bounds: Disjunction
    Is Harder than Conjunction.” In <i>Proceedings of the 31st Annual ACM/IEEE Symposium
    on Logic in Computer Science</i>, 197–206. IEEE, 2016. <a href="https://doi.org/10.1145/2933575.2935304">https://doi.org/10.1145/2933575.2935304</a>.'
  ieee: 'K. Chatterjee, W. Dvoák, M. Henzinger, and V. Loitzenbauer, “Model and objective
    separation with conditional lower bounds: disjunction is harder than conjunction,”
    in <i>Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science</i>,
    New York, NY, USA, 2016, pp. 197–206.'
  ista: 'Chatterjee K, Dvoák W, Henzinger M, Loitzenbauer V. 2016. Model and objective
    separation with conditional lower bounds: disjunction is harder than conjunction.
    Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science.
    LICS: Logic in Computer Science, Proceedings Symposium on Logic in Computer Science,
    , 197–206.'
  mla: 'Chatterjee, Krishnendu, et al. “Model and Objective Separation with Conditional
    Lower Bounds: Disjunction Is Harder than Conjunction.” <i>Proceedings of the 31st
    Annual ACM/IEEE Symposium on Logic in Computer Science</i>, IEEE, 2016, pp. 197–206,
    doi:<a href="https://doi.org/10.1145/2933575.2935304">10.1145/2933575.2935304</a>.'
  short: K. Chatterjee, W. Dvoák, M. Henzinger, V. Loitzenbauer, in:, Proceedings
    of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2016,
    pp. 197–206.
conference:
  end_date: 2016-07-08
  location: New York, NY, USA
  name: 'LICS: Logic in Computer Science'
  start_date: 2016-07-05
date_created: 2018-12-11T11:50:22Z
date_published: 2016-07-05T00:00:00Z
date_updated: 2025-09-22T14:12:05Z
day: '05'
department:
- _id: KrCh
doi: 10.1145/2933575.2935304
external_id:
  arxiv:
  - '1602.02670'
  isi:
  - '000387609200020'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1602.02670
month: '07'
oa: 1
oa_version: Preprint
page: 197 - 206
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
  grant_number: ICT15-003
  name: Efficient Algorithms for Computer Aided Verification
publication: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer
  Science
publication_status: published
publisher: IEEE
publist_id: '6219'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Model and objective separation with conditional lower bounds: disjunction
  is harder than conjunction'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2016'
...
---
_id: '1141'
abstract:
- lang: eng
  text: In this paper we introduce the Multiobjective Optimization Hierarchic Genetic
    Strategy with maturing (MO-mHGS), a meta-algorithm that performs evolutionary
    optimization in a hierarchy of populations. The maturing mechanism improves growth
    and reduces redundancy. The performance of MO-mHGS with selected state-of-the-art
    multiobjective evolutionary algorithms as internal algorithms is analysed on benchmark
    problems and their modifications for which single fitness evaluation time depends
    on the solution accuracy. We compare the proposed algorithm with the Island Model
    Genetic Algorithm as well as with single-deme methods, and discuss the impact
    of internal algorithms on the MO-mHGS meta-algorithm. © 2016 Elsevier B.V.
acknowledgement: The work presented in this paper was partially supported by Polish
  National Science Centre grant nos. DEC-2012/05/N/ST6/03433 and DEC-2011/03/B/ST6/01393.
  Radosław Łazarz was supported by Polish National Science Centre grant no. DEC-2013/10/M/ST6/00531.
article_processing_charge: No
author:
- first_name: Radosław
  full_name: Łazarz, Radosław
  last_name: Łazarz
- first_name: Michał
  full_name: Idzik, Michał
  last_name: Idzik
- first_name: Konrad
  full_name: Gądek, Konrad
  last_name: Gądek
- first_name: Ewa P
  full_name: Gajda-Zagorska, Ewa P
  id: 47794CF0-F248-11E8-B48F-1D18A9856A87
  last_name: Gajda-Zagorska
citation:
  ama: Łazarz R, Idzik M, Gądek K, Gajda-Zagorska EP. Hierarchic genetic strategy
    with maturing as a generic tool for multiobjective optimization. <i>Journal of
    Computational Science</i>. 2016;17(1):249-260. doi:<a href="https://doi.org/10.1016/j.jocs.2016.03.004">10.1016/j.jocs.2016.03.004</a>
  apa: Łazarz, R., Idzik, M., Gądek, K., &#38; Gajda-Zagorska, E. P. (2016). Hierarchic
    genetic strategy with maturing as a generic tool for multiobjective optimization.
    <i>Journal of Computational Science</i>. Elsevier. <a href="https://doi.org/10.1016/j.jocs.2016.03.004">https://doi.org/10.1016/j.jocs.2016.03.004</a>
  chicago: Łazarz, Radosław, Michał Idzik, Konrad Gądek, and Ewa P Gajda-Zagorska.
    “Hierarchic Genetic Strategy with Maturing as a Generic Tool for Multiobjective
    Optimization.” <i>Journal of Computational Science</i>. Elsevier, 2016. <a href="https://doi.org/10.1016/j.jocs.2016.03.004">https://doi.org/10.1016/j.jocs.2016.03.004</a>.
  ieee: R. Łazarz, M. Idzik, K. Gądek, and E. P. Gajda-Zagorska, “Hierarchic genetic
    strategy with maturing as a generic tool for multiobjective optimization,” <i>Journal
    of Computational Science</i>, vol. 17, no. 1. Elsevier, pp. 249–260, 2016.
  ista: Łazarz R, Idzik M, Gądek K, Gajda-Zagorska EP. 2016. Hierarchic genetic strategy
    with maturing as a generic tool for multiobjective optimization. Journal of Computational
    Science. 17(1), 249–260.
  mla: Łazarz, Radosław, et al. “Hierarchic Genetic Strategy with Maturing as a Generic
    Tool for Multiobjective Optimization.” <i>Journal of Computational Science</i>,
    vol. 17, no. 1, Elsevier, 2016, pp. 249–60, doi:<a href="https://doi.org/10.1016/j.jocs.2016.03.004">10.1016/j.jocs.2016.03.004</a>.
  short: R. Łazarz, M. Idzik, K. Gądek, E.P. Gajda-Zagorska, Journal of Computational
    Science 17 (2016) 249–260.
date_created: 2018-12-11T11:50:22Z
date_published: 2016-11-01T00:00:00Z
date_updated: 2025-09-22T14:11:23Z
day: '01'
department:
- _id: ChWo
doi: 10.1016/j.jocs.2016.03.004
external_id:
  isi:
  - '000390625600021'
intvolume: '        17'
isi: 1
issue: '1'
language:
- iso: eng
month: '11'
oa_version: None
page: 249 - 260
publication: Journal of Computational Science
publication_status: published
publisher: Elsevier
publist_id: '6217'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Hierarchic genetic strategy with maturing as a generic tool for multiobjective
  optimization
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 17
year: '2016'
...
---
_id: '1142'
abstract:
- lang: eng
  text: Hemolysis drives susceptibility to bacterial infections and predicts poor
    outcome from sepsis. These detrimental effects are commonly considered to be a
    consequence of heme-iron serving as a nutrient for bacteria. We employed a Gram-negative
    sepsis model and found that elevated heme levels impaired the control of bacterial
    proliferation independently of heme-iron acquisition by pathogens. Heme strongly
    inhibited phagocytosis and the migration of human and mouse phagocytes by disrupting
    actin cytoskeletal dynamics via activation of the GTP-binding Rho family protein
    Cdc42 by the guanine nucleotide exchange factor DOCK8. A chemical screening approach
    revealed that quinine effectively prevented heme effects on the cytoskeleton,
    restored phagocytosis and improved survival in sepsis. These mechanistic insights
    provide potential therapeutic targets for patients with sepsis or hemolytic disorders.
acknowledgement: 'Y. Fukui (Medical Institute of Bioregulation, Kyushu University)
  and J. Stein (Theodor Kocher Institute, University of Bern) are acknowledged for
  providing the DOCK8 deficient bone marrow. and H. Häcker (St. Judes Children''s
  Research Hospital) for providing the ERHBD-HoxB8-encoding retroviral construct.
  pSpCas9(BB)-2a-Puro (PX459) was a gift from F. Zhang (Massachusetts Institute of
  Technology) (Addgene plasmid # 48139) and pGRG36 was a gift from N. Craig (Johns
  Hopkins University School of Medicine) (Addgene plasmid # 16666). LifeAct-GFP-encoding
  retrovirus was kindly provided by A. Leithner (Institute of Science and Technology
  Austria). pSIM8 and TKC E. coli were gifts from D.L. Court (Center for Cancer Research,
  National Cancer Institute). We acknowledge M. Gröger and S. Rauscher for excellent
  technical support (Core imaging facility, Medical University of Vienna). We thank
  D.P. Barlow and L.R. Cheever for critical reading of the manuscript. This work was
  supported by the Austrian Academy of Sciences, the Science Fund of the Austrian
  National Bank (14107) and the Austrian Science Fund FWF (I1620-B22) in the Infect-ERA
  framework (to S.Knapp).'
article_processing_charge: No
author:
- first_name: Rui
  full_name: Martins, Rui
  last_name: Martins
- first_name: Julia
  full_name: Maier, Julia
  last_name: Maier
- first_name: Anna
  full_name: Gorki, Anna
  last_name: Gorki
- first_name: Kilian
  full_name: Huber, Kilian
  last_name: Huber
- first_name: Omar
  full_name: Sharif, Omar
  last_name: Sharif
- first_name: Philipp
  full_name: Starkl, Philipp
  last_name: Starkl
- first_name: Simona
  full_name: Saluzzo, Simona
  last_name: Saluzzo
- first_name: Federica
  full_name: Quattrone, Federica
  last_name: Quattrone
- first_name: Riem
  full_name: Gawish, Riem
  last_name: Gawish
- first_name: Karin
  full_name: Lakovits, Karin
  last_name: Lakovits
- first_name: Michael
  full_name: Aichinger, Michael
  last_name: Aichinger
- first_name: Branka
  full_name: Radic Sarikas, Branka
  last_name: Radic Sarikas
- first_name: Charles
  full_name: Lardeau, Charles
  last_name: Lardeau
- first_name: Anastasiya
  full_name: Hladik, Anastasiya
  last_name: Hladik
- first_name: Ana
  full_name: Korosec, Ana
  last_name: Korosec
- first_name: Markus
  full_name: Brown, Markus
  id: 3DAB9AFC-F248-11E8-B48F-1D18A9856A87
  last_name: Brown
- first_name: Kari
  full_name: Vaahtomeri, Kari
  id: 368EE576-F248-11E8-B48F-1D18A9856A87
  last_name: Vaahtomeri
  orcid: 0000-0001-7829-3518
- first_name: Michelle
  full_name: Duggan, Michelle
  id: 2EDEA62C-F248-11E8-B48F-1D18A9856A87
  last_name: Duggan
- first_name: Dontscho
  full_name: Kerjaschki, Dontscho
  last_name: Kerjaschki
- first_name: Harald
  full_name: Esterbauer, Harald
  last_name: Esterbauer
- first_name: Jacques
  full_name: Colinge, Jacques
  last_name: Colinge
- first_name: Stephanie
  full_name: Eisenbarth, Stephanie
  last_name: Eisenbarth
- first_name: Thomas
  full_name: Decker, Thomas
  last_name: Decker
- first_name: Keiryn
  full_name: Bennett, Keiryn
  last_name: Bennett
- first_name: Stefan
  full_name: Kubicek, Stefan
  last_name: Kubicek
- first_name: Michael K
  full_name: Sixt, Michael K
  id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
  last_name: Sixt
  orcid: 0000-0002-6620-9179
- first_name: Giulio
  full_name: Superti Furga, Giulio
  last_name: Superti Furga
- first_name: Sylvia
  full_name: Knapp, Sylvia
  last_name: Knapp
citation:
  ama: Martins R, Maier J, Gorki A, et al. Heme drives hemolysis-induced susceptibility
    to infection via disruption of phagocyte functions. <i>Nature Immunology</i>.
    2016;17(12):1361-1372. doi:<a href="https://doi.org/10.1038/ni.3590">10.1038/ni.3590</a>
  apa: Martins, R., Maier, J., Gorki, A., Huber, K., Sharif, O., Starkl, P., … Knapp,
    S. (2016). Heme drives hemolysis-induced susceptibility to infection via disruption
    of phagocyte functions. <i>Nature Immunology</i>. Nature Publishing Group. <a
    href="https://doi.org/10.1038/ni.3590">https://doi.org/10.1038/ni.3590</a>
  chicago: Martins, Rui, Julia Maier, Anna Gorki, Kilian Huber, Omar Sharif, Philipp
    Starkl, Simona Saluzzo, et al. “Heme Drives Hemolysis-Induced Susceptibility to
    Infection via Disruption of Phagocyte Functions.” <i>Nature Immunology</i>. Nature
    Publishing Group, 2016. <a href="https://doi.org/10.1038/ni.3590">https://doi.org/10.1038/ni.3590</a>.
  ieee: R. Martins <i>et al.</i>, “Heme drives hemolysis-induced susceptibility to
    infection via disruption of phagocyte functions,” <i>Nature Immunology</i>, vol.
    17, no. 12. Nature Publishing Group, pp. 1361–1372, 2016.
  ista: Martins R, Maier J, Gorki A, Huber K, Sharif O, Starkl P, Saluzzo S, Quattrone
    F, Gawish R, Lakovits K, Aichinger M, Radic Sarikas B, Lardeau C, Hladik A, Korosec
    A, Brown M, Vaahtomeri K, Duggan M, Kerjaschki D, Esterbauer H, Colinge J, Eisenbarth
    S, Decker T, Bennett K, Kubicek S, Sixt MK, Superti Furga G, Knapp S. 2016. Heme
    drives hemolysis-induced susceptibility to infection via disruption of phagocyte
    functions. Nature Immunology. 17(12), 1361–1372.
  mla: Martins, Rui, et al. “Heme Drives Hemolysis-Induced Susceptibility to Infection
    via Disruption of Phagocyte Functions.” <i>Nature Immunology</i>, vol. 17, no.
    12, Nature Publishing Group, 2016, pp. 1361–72, doi:<a href="https://doi.org/10.1038/ni.3590">10.1038/ni.3590</a>.
  short: R. Martins, J. Maier, A. Gorki, K. Huber, O. Sharif, P. Starkl, S. Saluzzo,
    F. Quattrone, R. Gawish, K. Lakovits, M. Aichinger, B. Radic Sarikas, C. Lardeau,
    A. Hladik, A. Korosec, M. Brown, K. Vaahtomeri, M. Duggan, D. Kerjaschki, H. Esterbauer,
    J. Colinge, S. Eisenbarth, T. Decker, K. Bennett, S. Kubicek, M.K. Sixt, G. Superti
    Furga, S. Knapp, Nature Immunology 17 (2016) 1361–1372.
date_created: 2018-12-11T11:50:22Z
date_published: 2016-12-01T00:00:00Z
date_updated: 2025-09-22T14:10:50Z
day: '01'
department:
- _id: MiSi
- _id: PeJo
doi: 10.1038/ni.3590
external_id:
  isi:
  - '000388056400006'
intvolume: '        17'
isi: 1
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://ora.ox.ac.uk/objects/uuid:f53a464e-1e5b-4f08-a7d8-b6749b852b9d
month: '12'
oa: 1
oa_version: Submitted Version
page: 1361 - 1372
publication: Nature Immunology
publication_status: published
publisher: Nature Publishing Group
publist_id: '6216'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Heme drives hemolysis-induced susceptibility to infection via disruption of
  phagocyte functions
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 17
year: '2016'
...
---
_id: '1143'
abstract:
- lang: eng
  text: We study the ground state of a dilute Bose gas in a scaling limit where the
    Gross-Pitaevskii functional emerges. This is a repulsive nonlinear Schrödinger
    functional whose quartic term is proportional to the scattering length of the
    interparticle interaction potential. We propose a new derivation of this limit
    problem, with a method that bypasses some of the technical difficulties that previous
    derivations had to face. The new method is based on a combination of Dyson\'s
    lemma, the quantum de Finetti theorem and a second moment estimate for ground
    states of the effective Dyson Hamiltonian. It applies equally well to the case
    where magnetic fields or rotation are present.
article_processing_charge: No
arxiv: 1
author:
- first_name: Phan
  full_name: Nam, Phan
  id: 404092F4-F248-11E8-B48F-1D18A9856A87
  last_name: Nam
- first_name: Nicolas
  full_name: Rougerie, Nicolas
  last_name: Rougerie
- first_name: Robert
  full_name: Seiringer, Robert
  id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
  last_name: Seiringer
  orcid: 0000-0002-6781-0521
citation:
  ama: 'Nam P, Rougerie N, Seiringer R. Ground states of large bosonic systems: The
    gross Pitaevskii limit revisited. <i>Analysis and PDE</i>. 2016;9(2):459-485.
    doi:<a href="https://doi.org/10.2140/apde.2016.9.459">10.2140/apde.2016.9.459</a>'
  apa: 'Nam, P., Rougerie, N., &#38; Seiringer, R. (2016). Ground states of large
    bosonic systems: The gross Pitaevskii limit revisited. <i>Analysis and PDE</i>.
    Mathematical Sciences Publishers. <a href="https://doi.org/10.2140/apde.2016.9.459">https://doi.org/10.2140/apde.2016.9.459</a>'
  chicago: 'Nam, Phan, Nicolas Rougerie, and Robert Seiringer. “Ground States of Large
    Bosonic Systems: The Gross Pitaevskii Limit Revisited.” <i>Analysis and PDE</i>.
    Mathematical Sciences Publishers, 2016. <a href="https://doi.org/10.2140/apde.2016.9.459">https://doi.org/10.2140/apde.2016.9.459</a>.'
  ieee: 'P. Nam, N. Rougerie, and R. Seiringer, “Ground states of large bosonic systems:
    The gross Pitaevskii limit revisited,” <i>Analysis and PDE</i>, vol. 9, no. 2.
    Mathematical Sciences Publishers, pp. 459–485, 2016.'
  ista: 'Nam P, Rougerie N, Seiringer R. 2016. Ground states of large bosonic systems:
    The gross Pitaevskii limit revisited. Analysis and PDE. 9(2), 459–485.'
  mla: 'Nam, Phan, et al. “Ground States of Large Bosonic Systems: The Gross Pitaevskii
    Limit Revisited.” <i>Analysis and PDE</i>, vol. 9, no. 2, Mathematical Sciences
    Publishers, 2016, pp. 459–85, doi:<a href="https://doi.org/10.2140/apde.2016.9.459">10.2140/apde.2016.9.459</a>.'
  short: P. Nam, N. Rougerie, R. Seiringer, Analysis and PDE 9 (2016) 459–485.
date_created: 2018-12-11T11:50:23Z
date_published: 2016-03-24T00:00:00Z
date_updated: 2025-09-22T14:10:16Z
day: '24'
department:
- _id: RoSe
doi: 10.2140/apde.2016.9.459
ec_funded: 1
external_id:
  arxiv:
  - '1503.07061'
  isi:
  - '000378287000006'
intvolume: '         9'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1503.07061
month: '03'
oa: 1
oa_version: Preprint
page: 459 - 485
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '291734'
  name: International IST Postdoc Fellowship Programme
publication: Analysis and PDE
publication_status: published
publisher: Mathematical Sciences Publishers
publist_id: '6215'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Ground states of large bosonic systems: The gross Pitaevskii limit revisited'
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9
year: '2016'
...
---
_id: '1008'
abstract:
- lang: eng
  text: Feedback loops in biological networks, among others, enable differentiation
    and cell cycle progression, and increase robustness in signal transduction. In
    natural networks, feedback loops are often complex and intertwined, making it
    challenging to identify which loops are mainly responsible for an observed behavior.
    However, minimal synthetic replicas could allow for such identification. Here,
    we engineered a synthetic permease-inducer-repressor system in Saccharomyces cerevisiae
    to analyze if a transport-mediated positive feedback loop could be a core mechanism
    for the switch-like behavior in the regulation of metabolic gene networks such
    as the S. cerevisiae GAL system or the Escherichia coli lac operon. We characterized
    the synthetic circuit using deterministic and stochastic mathematical models.
    Similar to its natural counterparts, our synthetic system shows bistable and hysteretic
    behavior, and the inducer concentration range for bistability as well as the switching
    rates between the two stable states depend on the repressor concentration. Our
    results indicate that a generic permease–inducer–repressor circuit with a single
    feedback loop is sufficient to explain the experimentally observed bistable behavior
    of the natural systems. We anticipate that the approach of reimplementing natural
    systems with orthogonal parts to identify crucial network components is applicable
    to other natural systems such as signaling pathways.
acknowledgement: We thank Julio Polaina (Instituto de Agroqu ı ́ mica y Tecnolog ı
  ́ a de Alimentos, C.S.I.C., Paterna, Spain) for the gift of plasmid pMR4, Gregor
  W. Schmidt for provision of and support with the micro fl uidic device, Markus Du
  ̈ rr for the cell tracking R script, and Lukas Widmer for the script for MEIGO using
  “ parfor ” in MATLAB. We acknowledge the members of the Stelling group for discussions,
  comments, and support.
article_processing_charge: No
author:
- first_name: Robert
  full_name: Gnügge, Robert
  last_name: Gnügge
- first_name: Lekshmi
  full_name: Dharmarajan, Lekshmi
  last_name: Dharmarajan
- first_name: Moritz
  full_name: Lang, Moritz
  id: 29E0800A-F248-11E8-B48F-1D18A9856A87
  last_name: Lang
- first_name: Jörg
  full_name: Stelling, Jörg
  last_name: Stelling
citation:
  ama: Gnügge R, Dharmarajan L, Lang M, Stelling J. An orthogonal permease–inducer–repressor
    feedback loop shows bistability. <i>ACS Synthetic Biology</i>. 2016;5(10):1098-1107.
    doi:<a href="https://doi.org/10.1021/acssynbio.6b00013">10.1021/acssynbio.6b00013</a>
  apa: Gnügge, R., Dharmarajan, L., Lang, M., &#38; Stelling, J. (2016). An orthogonal
    permease–inducer–repressor feedback loop shows bistability. <i>ACS Synthetic Biology</i>.
    American Chemical Society. <a href="https://doi.org/10.1021/acssynbio.6b00013">https://doi.org/10.1021/acssynbio.6b00013</a>
  chicago: Gnügge, Robert, Lekshmi Dharmarajan, Moritz Lang, and Jörg Stelling. “An
    Orthogonal Permease–Inducer–Repressor Feedback Loop Shows Bistability.” <i>ACS
    Synthetic Biology</i>. American Chemical Society, 2016. <a href="https://doi.org/10.1021/acssynbio.6b00013">https://doi.org/10.1021/acssynbio.6b00013</a>.
  ieee: R. Gnügge, L. Dharmarajan, M. Lang, and J. Stelling, “An orthogonal permease–inducer–repressor
    feedback loop shows bistability,” <i>ACS Synthetic Biology</i>, vol. 5, no. 10.
    American Chemical Society, pp. 1098–1107, 2016.
  ista: Gnügge R, Dharmarajan L, Lang M, Stelling J. 2016. An orthogonal permease–inducer–repressor
    feedback loop shows bistability. ACS Synthetic Biology. 5(10), 1098–1107.
  mla: Gnügge, Robert, et al. “An Orthogonal Permease–Inducer–Repressor Feedback Loop
    Shows Bistability.” <i>ACS Synthetic Biology</i>, vol. 5, no. 10, American Chemical
    Society, 2016, pp. 1098–107, doi:<a href="https://doi.org/10.1021/acssynbio.6b00013">10.1021/acssynbio.6b00013</a>.
  short: R. Gnügge, L. Dharmarajan, M. Lang, J. Stelling, ACS Synthetic Biology 5
    (2016) 1098–1107.
date_created: 2018-12-11T11:49:40Z
date_published: 2016-05-05T00:00:00Z
date_updated: 2025-09-22T14:20:45Z
day: '05'
department:
- _id: CaGu
doi: 10.1021/acssynbio.6b00013
external_id:
  isi:
  - '000386196100008'
intvolume: '         5'
isi: 1
issue: '10'
language:
- iso: eng
month: '05'
oa_version: None
page: 1098 - 1107
publication: ACS Synthetic Biology
publication_status: published
publisher: American Chemical Society
publist_id: '6390'
quality_controlled: '1'
status: public
title: An orthogonal permease–inducer–repressor feedback loop shows bistability
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 5
year: '2016'
...
---
_id: '1552'
abstract:
- lang: eng
  text: Antibiotic resistance carries a fitness cost that must be overcome in order
    for resistance to persist over the long term. Compensatory mutations that recover
    the functional defects associated with resistance mutations have been argued to
    play a key role in overcoming the cost of resistance, but compensatory mutations
    are expected to be rare relative to generally beneficial mutations that increase
    fitness, irrespective of antibiotic resistance. Given this asymmetry, population
    genetics theory predicts that populations should adapt by compensatory mutations
    when the cost of resistance is large, whereas generally beneficial mutations should
    drive adaptation when the cost of resistance is small. We tested this prediction
    by determining the genomic mechanisms underpinning adaptation to antibiotic-free
    conditions in populations of the pathogenic bacterium Pseudomonas aeruginosa that
    carry costly antibiotic resistance mutations. Whole-genome sequencing revealed
    that populations founded by high-cost rifampicin-resistant mutants adapted via
    compensatory mutations in three genes of the RNA polymerase core enzyme, whereas
    populations founded by low-cost mutants adapted by generally beneficial mutations,
    predominantly in the quorum-sensing transcriptional regulator gene lasR. Even
    though the importance of compensatory evolution in maintaining resistance has
    been widely recognized, our study shows that the roles of general adaptation in
    maintaining resistance should not be underestimated and highlights the need to
    understand how selection at other sites in the genome influences the dynamics
    of resistance alleles in clinical settings.
acknowledgement: "We thank the High-Throughput Genomics Group at the Wellcome Trust
  Centre for Human Genetics funded by Wellcome\r\nTrust grant reference 090532/Z/09/Z
  and Medical Research Council Hub grant no. G0900747 91070 for generation of the
  high-throughput sequencing data. We thank Wook Kim and two anonymous reviewers for
  their constructive feedback on previous versions of our manuscript."
article_number: '20152452'
article_processing_charge: No
author:
- first_name: Qin
  full_name: Qi, Qin
  id: 3B22D412-F248-11E8-B48F-1D18A9856A87
  last_name: Qi
  orcid: 0000-0002-6148-2416
- first_name: Macarena
  full_name: Toll Riera, Macarena
  last_name: Toll Riera
- first_name: Karl
  full_name: Heilbron, Karl
  last_name: Heilbron
- first_name: Gail
  full_name: Preston, Gail
  last_name: Preston
- first_name: R Craig
  full_name: Maclean, R Craig
  last_name: Maclean
citation:
  ama: Qi Q, Toll Riera M, Heilbron K, Preston G, Maclean RC. The genomic basis of
    adaptation to the fitness cost of rifampicin resistance in Pseudomonas aeruginosa.
    <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>.
    2016;283(1822). doi:<a href="https://doi.org/10.1098/rspb.2015.2452">10.1098/rspb.2015.2452</a>
  apa: Qi, Q., Toll Riera, M., Heilbron, K., Preston, G., &#38; Maclean, R. C. (2016).
    The genomic basis of adaptation to the fitness cost of rifampicin resistance in
    Pseudomonas aeruginosa. <i>Proceedings of the Royal Society of London Series B
    Biological Sciences</i>. Royal Society, The. <a href="https://doi.org/10.1098/rspb.2015.2452">https://doi.org/10.1098/rspb.2015.2452</a>
  chicago: Qi, Qin, Macarena Toll Riera, Karl Heilbron, Gail Preston, and R Craig
    Maclean. “The Genomic Basis of Adaptation to the Fitness Cost of Rifampicin Resistance
    in Pseudomonas Aeruginosa.” <i>Proceedings of the Royal Society of London Series
    B Biological Sciences</i>. Royal Society, The, 2016. <a href="https://doi.org/10.1098/rspb.2015.2452">https://doi.org/10.1098/rspb.2015.2452</a>.
  ieee: Q. Qi, M. Toll Riera, K. Heilbron, G. Preston, and R. C. Maclean, “The genomic
    basis of adaptation to the fitness cost of rifampicin resistance in Pseudomonas
    aeruginosa,” <i>Proceedings of the Royal Society of London Series B Biological
    Sciences</i>, vol. 283, no. 1822. Royal Society, The, 2016.
  ista: Qi Q, Toll Riera M, Heilbron K, Preston G, Maclean RC. 2016. The genomic basis
    of adaptation to the fitness cost of rifampicin resistance in Pseudomonas aeruginosa.
    Proceedings of the Royal Society of London Series B Biological Sciences. 283(1822),
    20152452.
  mla: Qi, Qin, et al. “The Genomic Basis of Adaptation to the Fitness Cost of Rifampicin
    Resistance in Pseudomonas Aeruginosa.” <i>Proceedings of the Royal Society of
    London Series B Biological Sciences</i>, vol. 283, no. 1822, 20152452, Royal Society,
    The, 2016, doi:<a href="https://doi.org/10.1098/rspb.2015.2452">10.1098/rspb.2015.2452</a>.
  short: Q. Qi, M. Toll Riera, K. Heilbron, G. Preston, R.C. Maclean, Proceedings
    of the Royal Society of London Series B Biological Sciences 283 (2016).
date_created: 2018-12-11T11:52:40Z
date_published: 2016-01-13T00:00:00Z
date_updated: 2025-09-18T11:03:28Z
day: '13'
ddc:
- '570'
department:
- _id: ToBo
doi: 10.1098/rspb.2015.2452
external_id:
  isi:
  - '000368441200022'
file:
- access_level: open_access
  checksum: 78ffe70c1c88af3856d31ca6b7195a27
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:11:43Z
  date_updated: 2020-07-14T12:45:02Z
  file_id: '4899'
  file_name: IST-2016-488-v1+1_20152452.full.pdf
  file_size: 626804
  relation: main_file
file_date_updated: 2020-07-14T12:45:02Z
has_accepted_license: '1'
intvolume: '       283'
isi: 1
issue: '1822'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
publication: Proceedings of the Royal Society of London Series B Biological Sciences
publication_status: published
publisher: Royal Society, The
publist_id: '5619'
pubrep_id: '488'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The genomic basis of adaptation to the fitness cost of rifampicin resistance
  in Pseudomonas aeruginosa
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: 283
year: '2016'
...
---
_id: '1592'
abstract:
- lang: eng
  text: A modular approach to constructing cryptographic protocols leads to simple
    designs but often inefficient instantiations. On the other hand, ad hoc constructions
    may yield efficient protocols at the cost of losing conceptual simplicity. We
    suggest a new design paradigm, structure-preserving cryptography, that provides
    a way to construct modular protocols with reasonable efficiency while retaining
    conceptual simplicity. A cryptographic scheme over a bilinear group is called
    structure-preserving if its public inputs and outputs consist of elements from
    the bilinear groups and their consistency can be verified by evaluating pairing-product
    equations. As structure-preserving schemes smoothly interoperate with each other,
    they are useful as building blocks in modular design of cryptographic applications.
    This paper introduces structure-preserving commitment and signature schemes over
    bilinear groups with several desirable properties. The commitment schemes include
    homomorphic, trapdoor and length-reducing commitments to group elements, and the
    structure-preserving signature schemes are the first ones that yield constant-size
    signatures on multiple group elements. A structure-preserving signature scheme
    is called automorphic if the public keys lie in the message space, which cannot
    be achieved by compressing inputs via a cryptographic hash function, as this would
    destroy the mathematical structure we are trying to preserve. Automorphic signatures
    can be used for building certification chains underlying privacy-preserving protocols.
    Among a vast number of applications of structure-preserving protocols, we present
    an efficient round-optimal blind-signature scheme and a group signature scheme
    with an efficient and concurrently secure protocol for enrolling new members.
acknowledgement: The authors would like to thank the anonymous reviewers of this paper.
  We also would like to express our appreciation to the program committee and the
  anonymous reviewers for CRYPTO 2010. The first author thanks Sherman S. M. Chow
  for his comment on group signatures in Sect. 7.1.
article_processing_charge: No
author:
- first_name: Masayuki
  full_name: Abe, Masayuki
  last_name: Abe
- first_name: Georg
  full_name: Fuchsbauer, Georg
  id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
  last_name: Fuchsbauer
- first_name: Jens
  full_name: Groth, Jens
  last_name: Groth
- first_name: Kristiyan
  full_name: Haralambiev, Kristiyan
  last_name: Haralambiev
- first_name: Miyako
  full_name: Ohkubo, Miyako
  last_name: Ohkubo
citation:
  ama: Abe M, Fuchsbauer G, Groth J, Haralambiev K, Ohkubo M. Structure preserving
    signatures and commitments to group elements. <i>Journal of Cryptology</i>. 2016;29(2):363-421.
    doi:<a href="https://doi.org/10.1007/s00145-014-9196-7">10.1007/s00145-014-9196-7</a>
  apa: Abe, M., Fuchsbauer, G., Groth, J., Haralambiev, K., &#38; Ohkubo, M. (2016).
    Structure preserving signatures and commitments to group elements. <i>Journal
    of Cryptology</i>. Springer. <a href="https://doi.org/10.1007/s00145-014-9196-7">https://doi.org/10.1007/s00145-014-9196-7</a>
  chicago: Abe, Masayuki, Georg Fuchsbauer, Jens Groth, Kristiyan Haralambiev, and
    Miyako Ohkubo. “Structure Preserving Signatures and Commitments to Group Elements.”
    <i>Journal of Cryptology</i>. Springer, 2016. <a href="https://doi.org/10.1007/s00145-014-9196-7">https://doi.org/10.1007/s00145-014-9196-7</a>.
  ieee: M. Abe, G. Fuchsbauer, J. Groth, K. Haralambiev, and M. Ohkubo, “Structure
    preserving signatures and commitments to group elements,” <i>Journal of Cryptology</i>,
    vol. 29, no. 2. Springer, pp. 363–421, 2016.
  ista: Abe M, Fuchsbauer G, Groth J, Haralambiev K, Ohkubo M. 2016. Structure preserving
    signatures and commitments to group elements. Journal of Cryptology. 29(2), 363–421.
  mla: Abe, Masayuki, et al. “Structure Preserving Signatures and Commitments to Group
    Elements.” <i>Journal of Cryptology</i>, vol. 29, no. 2, Springer, 2016, pp. 363–421,
    doi:<a href="https://doi.org/10.1007/s00145-014-9196-7">10.1007/s00145-014-9196-7</a>.
  short: M. Abe, G. Fuchsbauer, J. Groth, K. Haralambiev, M. Ohkubo, Journal of Cryptology
    29 (2016) 363–421.
date_created: 2018-12-11T11:52:54Z
date_published: 2016-04-01T00:00:00Z
date_updated: 2025-09-18T11:02:49Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/s00145-014-9196-7
external_id:
  isi:
  - '000371077900004'
intvolume: '        29'
isi: 1
issue: '2'
language:
- iso: eng
month: '04'
oa_version: None
page: 363 - 421
publication: Journal of Cryptology
publication_status: published
publisher: Springer
publist_id: '5579'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Structure preserving signatures and commitments to group elements
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 29
year: '2016'
...
---
_id: '1597'
abstract:
- lang: eng
  text: Chemokines are the main guidance cues directing leukocyte migration. Opposed
    to early assumptions, chemokines do not necessarily act as soluble cues but are
    often immobilized within tissues, e.g., dendritic cell migration toward lymphatic
    vessels is guided by a haptotactic gradient of the chemokine CCL21. Controlled
    assay systems to quantitatively study haptotaxis in vitro are still missing. In
    this chapter, we describe an in vitro haptotaxis assay optimized for the unique
    properties of dendritic cells. The chemokine CCL21 is immobilized in a bioactive
    state, using laser-assisted protein adsorption by photobleaching. The cells follow
    this immobilized CCL21 gradient in a haptotaxis chamber, which provides three
    dimensionally confined migration conditions.
acknowledged_ssus:
- _id: Bio
acknowledgement: This work was supported by the Boehringer Ingelheim Fonds, the European
  Research Council (ERC StG 281556), and a START Award of the Austrian Science Foundation
  (FWF). We thank Robert Hauschild, Anne Reversat, and Jack Merrin for valuable input
  and the Imaging Facility of IST Austria for excellent support.
article_processing_charge: No
article_type: original
author:
- first_name: Jan
  full_name: Schwarz, Jan
  id: 346C1EC6-F248-11E8-B48F-1D18A9856A87
  last_name: Schwarz
- first_name: Michael K
  full_name: Sixt, Michael K
  id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
  last_name: Sixt
  orcid: 0000-0002-6620-9179
citation:
  ama: Schwarz J, Sixt MK. Quantitative analysis of dendritic cell haptotaxis. <i>Methods
    in Enzymology</i>. 2016;570:567-581. doi:<a href="https://doi.org/10.1016/bs.mie.2015.11.004">10.1016/bs.mie.2015.11.004</a>
  apa: Schwarz, J., &#38; Sixt, M. K. (2016). Quantitative analysis of dendritic cell
    haptotaxis. <i>Methods in Enzymology</i>. Elsevier. <a href="https://doi.org/10.1016/bs.mie.2015.11.004">https://doi.org/10.1016/bs.mie.2015.11.004</a>
  chicago: Schwarz, Jan, and Michael K Sixt. “Quantitative Analysis of Dendritic Cell
    Haptotaxis.” <i>Methods in Enzymology</i>. Elsevier, 2016. <a href="https://doi.org/10.1016/bs.mie.2015.11.004">https://doi.org/10.1016/bs.mie.2015.11.004</a>.
  ieee: J. Schwarz and M. K. Sixt, “Quantitative analysis of dendritic cell haptotaxis,”
    <i>Methods in Enzymology</i>, vol. 570. Elsevier, pp. 567–581, 2016.
  ista: Schwarz J, Sixt MK. 2016. Quantitative analysis of dendritic cell haptotaxis.
    Methods in Enzymology. 570, 567–581.
  mla: Schwarz, Jan, and Michael K. Sixt. “Quantitative Analysis of Dendritic Cell
    Haptotaxis.” <i>Methods in Enzymology</i>, vol. 570, Elsevier, 2016, pp. 567–81,
    doi:<a href="https://doi.org/10.1016/bs.mie.2015.11.004">10.1016/bs.mie.2015.11.004</a>.
  short: J. Schwarz, M.K. Sixt, Methods in Enzymology 570 (2016) 567–581.
corr_author: '1'
date_created: 2018-12-11T11:52:56Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2025-09-18T11:02:13Z
day: '01'
department:
- _id: MiSi
doi: 10.1016/bs.mie.2015.11.004
ec_funded: 1
external_id:
  isi:
  - '000375648700025'
  pmid:
  - '26921962'
intvolume: '       570'
isi: 1
language:
- iso: eng
month: '01'
oa_version: None
page: 567 - 581
pmid: 1
project:
- _id: 25A603A2-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '281556'
  name: Cytoskeletal force generation and force transduction of migrating leukocytes
- _id: 25A8E5EA-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Y 564-B12
  name: Cytoskeletal force generation and force transduction of migrating leukocytes
publication: Methods in Enzymology
publication_status: published
publisher: Elsevier
publist_id: '5573'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quantitative analysis of dendritic cell haptotaxis
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 570
year: '2016'
...
