---
_id: '15403'
author:
- first_name: S.
  full_name: Lu, S.
  last_name: Lu
- first_name: Eyke
  full_name: Hüllermeier, Eyke
  id: '48129'
  last_name: Hüllermeier
citation:
  ama: 'Lu S, Hüllermeier E. Support vector classification on noisy data using fuzzy
    superset losses. In: Hüllermeier E, Hoffmann F, Mikut R, eds. <i>In Proceedings
    26th Workshop Computational Intelligence, Dortmund Germany</i>. KIT Scientific
    Publishing; 2016:1-8.'
  apa: Lu, S., &#38; Hüllermeier, E. (2016). Support vector classification on noisy
    data using fuzzy superset losses. In E. Hüllermeier, F. Hoffmann, &#38; R. Mikut
    (Eds.), <i>in Proceedings 26th Workshop Computational Intelligence, Dortmund Germany</i>
    (pp. 1–8). KIT Scientific Publishing.
  bibtex: '@inproceedings{Lu_Hüllermeier_2016, title={Support vector classification
    on noisy data using fuzzy superset losses}, booktitle={in Proceedings 26th Workshop
    Computational Intelligence, Dortmund Germany}, publisher={KIT Scientific Publishing},
    author={Lu, S. and Hüllermeier, Eyke}, editor={Hüllermeier, Eyke and Hoffmann,
    F. and Mikut, R.Editors}, year={2016}, pages={1–8} }'
  chicago: Lu, S., and Eyke Hüllermeier. “Support Vector Classification on Noisy Data
    Using Fuzzy Superset Losses.” In <i>In Proceedings 26th Workshop Computational
    Intelligence, Dortmund Germany</i>, edited by Eyke Hüllermeier, F. Hoffmann, and
    R. Mikut, 1–8. KIT Scientific Publishing, 2016.
  ieee: S. Lu and E. Hüllermeier, “Support vector classification on noisy data using
    fuzzy superset losses,” in <i>in Proceedings 26th Workshop Computational Intelligence,
    Dortmund Germany</i>, 2016, pp. 1–8.
  mla: Lu, S., and Eyke Hüllermeier. “Support Vector Classification on Noisy Data
    Using Fuzzy Superset Losses.” <i>In Proceedings 26th Workshop Computational Intelligence,
    Dortmund Germany</i>, edited by Eyke Hüllermeier et al., KIT Scientific Publishing,
    2016, pp. 1–8.
  short: 'S. Lu, E. Hüllermeier, in: E. Hüllermeier, F. Hoffmann, R. Mikut (Eds.),
    In Proceedings 26th Workshop Computational Intelligence, Dortmund Germany, KIT
    Scientific Publishing, 2016, pp. 1–8.'
date_created: 2019-12-19T16:40:33Z
date_updated: 2022-01-06T06:52:23Z
department:
- _id: '34'
- _id: '7'
- _id: '355'
editor:
- first_name: Eyke
  full_name: Hüllermeier, Eyke
  last_name: Hüllermeier
- first_name: F.
  full_name: Hoffmann, F.
  last_name: Hoffmann
- first_name: R.
  full_name: Mikut, R.
  last_name: Mikut
language:
- iso: eng
page: 1-8
publication: in Proceedings 26th Workshop Computational Intelligence, Dortmund Germany
publisher: KIT Scientific Publishing
status: public
title: Support vector classification on noisy data using fuzzy superset losses
type: conference
user_id: '49109'
year: '2016'
...
---
_id: '15404'
author:
- first_name: D.
  full_name: Schäfer, D.
  last_name: Schäfer
- first_name: Eyke
  full_name: Hüllermeier, Eyke
  id: '48129'
  last_name: Hüllermeier
citation:
  ama: 'Schäfer D, Hüllermeier E. Plackett-Luce networks for dyad ranking. In: <i>In
    Workshop LWDA “Lernen, Wissen, Daten, Analysen” Potsdam, Germany</i>. ; 2016.'
  apa: Schäfer, D., &#38; Hüllermeier, E. (2016). Plackett-Luce networks for dyad
    ranking. In <i>in Workshop LWDA “Lernen, Wissen, Daten, Analysen” Potsdam, Germany</i>.
  bibtex: '@inproceedings{Schäfer_Hüllermeier_2016, title={Plackett-Luce networks
    for dyad ranking}, booktitle={in Workshop LWDA “Lernen, Wissen, Daten, Analysen”
    Potsdam, Germany}, author={Schäfer, D. and Hüllermeier, Eyke}, year={2016} }'
  chicago: Schäfer, D., and Eyke Hüllermeier. “Plackett-Luce Networks for Dyad Ranking.”
    In <i>In Workshop LWDA “Lernen, Wissen, Daten, Analysen” Potsdam, Germany</i>,
    2016.
  ieee: D. Schäfer and E. Hüllermeier, “Plackett-Luce networks for dyad ranking,”
    in <i>in Workshop LWDA “Lernen, Wissen, Daten, Analysen” Potsdam, Germany</i>,
    2016.
  mla: Schäfer, D., and Eyke Hüllermeier. “Plackett-Luce Networks for Dyad Ranking.”
    <i>In Workshop LWDA “Lernen, Wissen, Daten, Analysen” Potsdam, Germany</i>, 2016.
  short: 'D. Schäfer, E. Hüllermeier, in: In Workshop LWDA “Lernen, Wissen, Daten,
    Analysen” Potsdam, Germany, 2016.'
date_created: 2019-12-19T16:43:27Z
date_updated: 2022-01-06T06:52:23Z
department:
- _id: '34'
- _id: '7'
- _id: '355'
language:
- iso: eng
publication: in Workshop LWDA "Lernen, Wissen, Daten, Analysen" Potsdam, Germany
status: public
title: Plackett-Luce networks for dyad ranking
type: conference
user_id: '49109'
year: '2016'
...
---
_id: '15435'
author:
- first_name: Gitta
  full_name: Domik, Gitta
  id: '90'
  last_name: Domik
citation:
  ama: 'Domik G. A data visualization course at the university of paderborn. In: <i>Pedagogy
    Data Visualization, IEEE VIS Workshop</i>. Baltimore; 2016.'
  apa: Domik, G. (2016). A data visualization course at the university of paderborn.
    In <i>Pedagogy Data Visualization, IEEE VIS Workshop</i>. Baltimore.
  bibtex: '@inproceedings{Domik_2016, place={Baltimore}, title={A data visualization
    course at the university of paderborn}, booktitle={Pedagogy Data Visualization,
    IEEE VIS Workshop}, author={Domik, Gitta}, year={2016} }'
  chicago: Domik, Gitta. “A Data Visualization Course at the University of Paderborn.”
    In <i>Pedagogy Data Visualization, IEEE VIS Workshop</i>. Baltimore, 2016.
  ieee: G. Domik, “A data visualization course at the university of paderborn,” in
    <i>Pedagogy Data Visualization, IEEE VIS Workshop</i>, 2016.
  mla: Domik, Gitta. “A Data Visualization Course at the University of Paderborn.”
    <i>Pedagogy Data Visualization, IEEE VIS Workshop</i>, 2016.
  short: 'G. Domik, in: Pedagogy Data Visualization, IEEE VIS Workshop, Baltimore,
    2016.'
date_created: 2020-01-07T07:54:37Z
date_updated: 2022-01-06T06:52:25Z
department:
- _id: '65'
language:
- iso: eng
place: Baltimore
publication: Pedagogy Data Visualization, IEEE VIS Workshop
status: public
title: A data visualization course at the university of paderborn
type: conference
user_id: '90'
year: '2016'
...
---
_id: '155'
abstract:
- lang: eng
  text: We present a self-stabilizing algorithm for overlay networks that, for an
    arbitrary metric given by a distance oracle, constructs the graph representing
    that metric. The graph representing a metric is the unique minimal undirected
    graph such that for any pair of nodes the length of a shortest path between the
    nodes corresponds to the distance between the nodes according to the metric. The
    algorithm works under both an asynchronous and a synchronous daemon. In the synchronous
    case, the algorithm stablizes in time O(n) and it is almost silent in that after
    stabilization a node sends and receives a constant number of messages per round.
author:
- first_name: Robert
  full_name: Gmyr, Robert
  last_name: Gmyr
- first_name: Jonas
  full_name: Lefèvre, Jonas
  last_name: Lefèvre
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Gmyr R, Lefèvre J, Scheideler C. Self-stabilizing Metric Graphs. In: <i>Proceedings
    of the 18th International Symposium on Stabilization, Safety, and Security of
    Distributed Systems (SSS)</i>. LNCS. ; 2016:248--262. doi:<a href="https://doi.org/10.1007/978-3-319-49259-9_20">10.1007/978-3-319-49259-9_20</a>'
  apa: Gmyr, R., Lefèvre, J., &#38; Scheideler, C. (2016). Self-stabilizing Metric
    Graphs. In <i>Proceedings of the 18th International Symposium on Stabilization,
    Safety, and Security of Distributed Systems (SSS)</i> (pp. 248--262). <a href="https://doi.org/10.1007/978-3-319-49259-9_20">https://doi.org/10.1007/978-3-319-49259-9_20</a>
  bibtex: '@inproceedings{Gmyr_Lefèvre_Scheideler_2016, series={LNCS}, title={Self-stabilizing
    Metric Graphs}, DOI={<a href="https://doi.org/10.1007/978-3-319-49259-9_20">10.1007/978-3-319-49259-9_20</a>},
    booktitle={Proceedings of the 18th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS)}, author={Gmyr, Robert and Lefèvre,
    Jonas and Scheideler, Christian}, year={2016}, pages={248--262}, collection={LNCS}
    }'
  chicago: Gmyr, Robert, Jonas Lefèvre, and Christian Scheideler. “Self-Stabilizing
    Metric Graphs.” In <i>Proceedings of the 18th International Symposium on Stabilization,
    Safety, and Security of Distributed Systems (SSS)</i>, 248--262. LNCS, 2016. <a
    href="https://doi.org/10.1007/978-3-319-49259-9_20">https://doi.org/10.1007/978-3-319-49259-9_20</a>.
  ieee: R. Gmyr, J. Lefèvre, and C. Scheideler, “Self-stabilizing Metric Graphs,”
    in <i>Proceedings of the 18th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS)</i>, 2016, pp. 248--262.
  mla: Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.” <i>Proceedings of the
    18th International Symposium on Stabilization, Safety, and Security of Distributed
    Systems (SSS)</i>, 2016, pp. 248--262, doi:<a href="https://doi.org/10.1007/978-3-319-49259-9_20">10.1007/978-3-319-49259-9_20</a>.
  short: 'R. Gmyr, J. Lefèvre, C. Scheideler, in: Proceedings of the 18th International
    Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS),
    2016, pp. 248--262.'
date_created: 2017-10-17T12:41:22Z
date_updated: 2022-01-06T06:52:28Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-49259-9_20
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T12:51:24Z
  date_updated: 2018-03-21T12:51:24Z
  file_id: '1550'
  file_name: 155-SSS16-GLS.pdf
  file_size: 389136
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T12:51:24Z
has_accepted_license: '1'
page: 248--262
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 18th International Symposium on Stabilization, Safety,
  and Security of Distributed Systems (SSS)
series_title: LNCS
status: public
title: Self-stabilizing Metric Graphs
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '157'
abstract:
- lang: eng
  text: Consider a scheduling problem in which a set of jobs with interjob communication,
    canonically represented by a weighted tree, needs to be scheduled on m parallel
    processors interconnected by a shared communication channel. In each time step,
    we may allow any processed job to use a certain capacity of the channel in order
    to satisfy (parts of) its communication demands to adjacent jobs processed in
    parallel. The goal is to find a schedule that minimizes the makespan and in which
    communication demands of all jobs are satisfied.We show that this problem is NP-hard
    in the strong sense even if the number of processors and the maximum degree of
    the underlying tree is constant.Consequently, we design and analyze simple approximation
    algorithms with asymptotic approximation ratio 2-2/m in case of paths and a ratio
    of 5/2 in case of arbitrary trees.
author:
- first_name: Jürgen
  full_name: König, Jürgen
  last_name: König
- first_name: Alexander
  full_name: Mäcker, Alexander
  id: '13536'
  last_name: Mäcker
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Sören
  full_name: Riechers, Sören
  last_name: Riechers
citation:
  ama: 'König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with Interjob
    Communication on Parallel Processors. In: <i>Proceedings of the 10th Annual International
    Conference on Combinatorial Optimization and Applications (COCOA)</i>. LNCS. ;
    2016:563--577. doi:<a href="https://doi.org/10.1007/978-3-319-48749-6_41">10.1007/978-3-319-48749-6_41</a>'
  apa: König, J., Mäcker, A., Meyer auf der Heide, F., &#38; Riechers, S. (2016).
    Scheduling with Interjob Communication on Parallel Processors. In <i>Proceedings
    of the 10th Annual International Conference on Combinatorial Optimization and
    Applications (COCOA)</i> (pp. 563--577). <a href="https://doi.org/10.1007/978-3-319-48749-6_41">https://doi.org/10.1007/978-3-319-48749-6_41</a>
  bibtex: '@inproceedings{König_Mäcker_Meyer auf der Heide_Riechers_2016, series={LNCS},
    title={Scheduling with Interjob Communication on Parallel Processors}, DOI={<a
    href="https://doi.org/10.1007/978-3-319-48749-6_41">10.1007/978-3-319-48749-6_41</a>},
    booktitle={Proceedings of the 10th Annual International Conference on Combinatorial
    Optimization and Applications (COCOA)}, author={König, Jürgen and Mäcker, Alexander
    and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016}, pages={563--577},
    collection={LNCS} }'
  chicago: König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören
    Riechers. “Scheduling with Interjob Communication on Parallel Processors.” In
    <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization
    and Applications (COCOA)</i>, 563--577. LNCS, 2016. <a href="https://doi.org/10.1007/978-3-319-48749-6_41">https://doi.org/10.1007/978-3-319-48749-6_41</a>.
  ieee: J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling
    with Interjob Communication on Parallel Processors,” in <i>Proceedings of the
    10th Annual International Conference on Combinatorial Optimization and Applications
    (COCOA)</i>, 2016, pp. 563--577.
  mla: König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.”
    <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization
    and Applications (COCOA)</i>, 2016, pp. 563--577, doi:<a href="https://doi.org/10.1007/978-3-319-48749-6_41">10.1007/978-3-319-48749-6_41</a>.
  short: 'J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, in: Proceedings
    of the 10th Annual International Conference on Combinatorial Optimization and
    Applications (COCOA), 2016, pp. 563--577.'
date_created: 2017-10-17T12:41:22Z
date_updated: 2022-01-06T06:52:32Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-48749-6_41
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T12:50:29Z
  date_updated: 2018-03-21T12:50:29Z
  file_id: '1549'
  file_name: 157-chp_3A10.1007_2F978-3-319-48749-6_41.pdf
  file_size: 753147
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T12:50:29Z
has_accepted_license: '1'
page: 563--577
project:
- _id: '1'
  name: SFB 901
- _id: '16'
  name: SFB 901 - Subprojekt C4
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 10th Annual International Conference on Combinatorial
  Optimization and Applications (COCOA)
series_title: LNCS
status: public
title: Scheduling with Interjob Communication on Parallel Processors
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '15873'
author:
- first_name: Alexander
  full_name: Boschmann, Alexander
  last_name: Boschmann
- first_name: Andreas
  full_name: Agne, Andreas
  last_name: Agne
- first_name: Linus Matthias
  full_name: Witschen, Linus Matthias
  id: '49051'
  last_name: Witschen
- first_name: Georg
  full_name: Thombansen, Georg
  last_name: Thombansen
- first_name: Florian
  full_name: Kraus, Florian
  last_name: Kraus
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
citation:
  ama: 'Boschmann A, Agne A, Witschen LM, Thombansen G, Kraus F, Platzner M. FPGA-based
    acceleration of high density myoelectric signal processing. In: <i>2015 International
    Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>. IEEE; 2016. doi:<a
    href="https://doi.org/10.1109/reconfig.2015.7393312">10.1109/reconfig.2015.7393312</a>'
  apa: 'Boschmann, A., Agne, A., Witschen, L. M., Thombansen, G., Kraus, F., &#38;
    Platzner, M. (2016). FPGA-based acceleration of high density myoelectric signal
    processing. In <i>2015 International Conference on ReConFigurable Computing and
    FPGAs (ReConFig)</i>. Mexiko City, Mexiko: IEEE. <a href="https://doi.org/10.1109/reconfig.2015.7393312">https://doi.org/10.1109/reconfig.2015.7393312</a>'
  bibtex: '@inproceedings{Boschmann_Agne_Witschen_Thombansen_Kraus_Platzner_2016,
    title={FPGA-based acceleration of high density myoelectric signal processing},
    DOI={<a href="https://doi.org/10.1109/reconfig.2015.7393312">10.1109/reconfig.2015.7393312</a>},
    booktitle={2015 International Conference on ReConFigurable Computing and FPGAs
    (ReConFig)}, publisher={IEEE}, author={Boschmann, Alexander and Agne, Andreas
    and Witschen, Linus Matthias and Thombansen, Georg and Kraus, Florian and Platzner,
    Marco}, year={2016} }'
  chicago: Boschmann, Alexander, Andreas Agne, Linus Matthias Witschen, Georg Thombansen,
    Florian Kraus, and Marco Platzner. “FPGA-Based Acceleration of High Density Myoelectric
    Signal Processing.” In <i>2015 International Conference on ReConFigurable Computing
    and FPGAs (ReConFig)</i>. IEEE, 2016. <a href="https://doi.org/10.1109/reconfig.2015.7393312">https://doi.org/10.1109/reconfig.2015.7393312</a>.
  ieee: A. Boschmann, A. Agne, L. M. Witschen, G. Thombansen, F. Kraus, and M. Platzner,
    “FPGA-based acceleration of high density myoelectric signal processing,” in <i>2015
    International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>,
    Mexiko City, Mexiko, 2016.
  mla: Boschmann, Alexander, et al. “FPGA-Based Acceleration of High Density Myoelectric
    Signal Processing.” <i>2015 International Conference on ReConFigurable Computing
    and FPGAs (ReConFig)</i>, IEEE, 2016, doi:<a href="https://doi.org/10.1109/reconfig.2015.7393312">10.1109/reconfig.2015.7393312</a>.
  short: 'A. Boschmann, A. Agne, L.M. Witschen, G. Thombansen, F. Kraus, M. Platzner,
    in: 2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig),
    IEEE, 2016.'
conference:
  location: Mexiko City, Mexiko
  name: 2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)
date_created: 2020-02-11T07:48:56Z
date_updated: 2022-01-06T06:52:38Z
department:
- _id: '78'
doi: 10.1109/reconfig.2015.7393312
keyword:
- Electromyography
- Feature extraction
- Delays
- Hardware  Pattern recognition
- Prosthetics
- High definition video
language:
- iso: eng
publication: 2015 International Conference on ReConFigurable Computing and FPGAs (ReConFig)
publication_identifier:
  isbn:
  - '9781467394062'
publication_status: published
publisher: IEEE
status: public
title: FPGA-based acceleration of high density myoelectric signal processing
type: conference
user_id: '49051'
year: '2016'
...
---
_id: '159'
abstract:
- lang: eng
  text: Abstract—Max-min fairness (MMF) is a widely known approachto a fair allocation
    of bandwidth to each of the usersin a network. This allocation can be computed
    by uniformlyraising the bandwidths of all users without violating capacityconstraints.
    We consider an extension of these allocations byraising the bandwidth with arbitrary
    and not necessarily uniformtime-depending velocities (allocation rates). These
    allocationsare used in a game-theoretic context for routing choices, whichwe formalize
    in progressive filling games (PFGs). We present avariety of results for equilibria
    in PFGs. We show that these gamespossess pure Nash and strong equilibria. While
    computation ingeneral is NP-hard, there are polynomial-time algorithms forprominent
    classes of Max-Min-Fair Games (MMFG), includingthe case when all users have the
    same source-destination pair.We characterize prices of anarchy and stability for
    pure Nashand strong equilibria in PFGs and MMFGs when players havedifferent or
    the same source-destination pairs. In addition, weshow that when a designer can
    adjust allocation rates, it is possibleto design games with optimal strong equilibria.
    Some initial resultson polynomial-time algorithms in this direction are also derived.
author:
- first_name: Tobias
  full_name: Harks, Tobias
  last_name: Harks
- first_name: Martin
  full_name: Höfer, Martin
  last_name: Höfer
- first_name: Kevin
  full_name: Schewior, Kevin
  last_name: Schewior
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
citation:
  ama: Harks T, Höfer M, Schewior K, Skopalik A. Routing Games With Progressive Filling.
    <i>IEEE/ACM Transactions on Networking</i>. 2016;(4):2553-2562. doi:<a href="https://doi.org/10.1109/TNET.2015.2468571">10.1109/TNET.2015.2468571</a>
  apa: Harks, T., Höfer, M., Schewior, K., &#38; Skopalik, A. (2016). Routing Games
    With Progressive Filling. <i>IEEE/ACM Transactions on Networking</i>, (4), 2553–2562.
    <a href="https://doi.org/10.1109/TNET.2015.2468571">https://doi.org/10.1109/TNET.2015.2468571</a>
  bibtex: '@article{Harks_Höfer_Schewior_Skopalik_2016, title={Routing Games With
    Progressive Filling}, DOI={<a href="https://doi.org/10.1109/TNET.2015.2468571">10.1109/TNET.2015.2468571</a>},
    number={4}, journal={IEEE/ACM Transactions on Networking}, publisher={IEEE}, author={Harks,
    Tobias and Höfer, Martin and Schewior, Kevin and Skopalik, Alexander}, year={2016},
    pages={2553–2562} }'
  chicago: 'Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing
    Games With Progressive Filling.” <i>IEEE/ACM Transactions on Networking</i>, no.
    4 (2016): 2553–62. <a href="https://doi.org/10.1109/TNET.2015.2468571">https://doi.org/10.1109/TNET.2015.2468571</a>.'
  ieee: T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games With Progressive
    Filling,” <i>IEEE/ACM Transactions on Networking</i>, no. 4, pp. 2553–2562, 2016.
  mla: Harks, Tobias, et al. “Routing Games With Progressive Filling.” <i>IEEE/ACM
    Transactions on Networking</i>, no. 4, IEEE, 2016, pp. 2553–62, doi:<a href="https://doi.org/10.1109/TNET.2015.2468571">10.1109/TNET.2015.2468571</a>.
  short: T. Harks, M. Höfer, K. Schewior, A. Skopalik, IEEE/ACM Transactions on Networking
    (2016) 2553–2562.
date_created: 2017-10-17T12:41:23Z
date_updated: 2022-01-06T06:52:40Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1109/TNET.2015.2468571
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T12:48:02Z
  date_updated: 2018-03-21T12:48:02Z
  file_id: '1547'
  file_name: 159-Harks-Hoefer-Schewior-Skopalik2016.pdf
  file_size: 1655309
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T12:48:02Z
has_accepted_license: '1'
issue: '4'
language:
- iso: eng
page: 2553 - 2562
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publication: IEEE/ACM Transactions on Networking
publisher: IEEE
status: public
title: Routing Games With Progressive Filling
type: journal_article
user_id: '477'
year: '2016'
...
---
_id: '146'
author:
- first_name: Julian
  full_name: Hamm, Julian
  last_name: Hamm
citation:
  ama: Hamm J. <i>Symmetric Anonymous Credentials with Protocols for Relations on
    Attributes</i>. Universität Paderborn; 2016.
  apa: Hamm, J. (2016). <i>Symmetric Anonymous Credentials with Protocols for Relations
    on Attributes</i>. Universität Paderborn.
  bibtex: '@book{Hamm_2016, title={Symmetric Anonymous Credentials with Protocols
    for Relations on Attributes}, publisher={Universität Paderborn}, author={Hamm,
    Julian}, year={2016} }'
  chicago: Hamm, Julian. <i>Symmetric Anonymous Credentials with Protocols for Relations
    on Attributes</i>. Universität Paderborn, 2016.
  ieee: J. Hamm, <i>Symmetric Anonymous Credentials with Protocols for Relations on
    Attributes</i>. Universität Paderborn, 2016.
  mla: Hamm, Julian. <i>Symmetric Anonymous Credentials with Protocols for Relations
    on Attributes</i>. Universität Paderborn, 2016.
  short: J. Hamm, Symmetric Anonymous Credentials with Protocols for Relations on
    Attributes, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:20Z
date_updated: 2022-01-06T06:52:03Z
department:
- _id: '64'
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Symmetric Anonymous Credentials with Protocols for Relations on Attributes
type: mastersthesis
user_id: '477'
year: '2016'
...
---
_id: '14881'
author:
- first_name: Wei-Fan
  full_name: Chen, Wei-Fan
  id: '82920'
  last_name: Chen
- first_name: Lun-Wei
  full_name: Ku, Lun-Wei
  last_name: Ku
citation:
  ama: 'Chen W-F, Ku L-W. UTCNN: a Deep Learning Model of Stance Classification on
    Social Media Text. In: <i>Proceedings of COLING 2016, the 26th International Conference
    on Computational Linguistics</i>. ; 2016:1635-1645.'
  apa: 'Chen, W.-F., &#38; Ku, L.-W. (2016). UTCNN: a Deep Learning Model of Stance
    Classification on Social Media Text. In <i>Proceedings of COLING 2016, the 26th
    International Conference on Computational Linguistics</i> (pp. 1635–1645).'
  bibtex: '@inproceedings{Chen_Ku_2016, title={UTCNN: a Deep Learning Model of Stance
    Classification on Social Media Text}, booktitle={Proceedings of COLING 2016, the
    26th International Conference on Computational Linguistics}, author={Chen, Wei-Fan
    and Ku, Lun-Wei}, year={2016}, pages={1635–1645} }'
  chicago: 'Chen, Wei-Fan, and Lun-Wei Ku. “UTCNN: A Deep Learning Model of Stance
    Classification on Social Media Text.” In <i>Proceedings of COLING 2016, the 26th
    International Conference on Computational Linguistics</i>, 1635–45, 2016.'
  ieee: 'W.-F. Chen and L.-W. Ku, “UTCNN: a Deep Learning Model of Stance Classification
    on Social Media Text,” in <i>Proceedings of COLING 2016, the 26th International
    Conference on Computational Linguistics</i>, 2016, pp. 1635–1645.'
  mla: 'Chen, Wei-Fan, and Lun-Wei Ku. “UTCNN: A Deep Learning Model of Stance Classification
    on Social Media Text.” <i>Proceedings of COLING 2016, the 26th International Conference
    on Computational Linguistics</i>, 2016, pp. 1635–45.'
  short: 'W.-F. Chen, L.-W. Ku, in: Proceedings of COLING 2016, the 26th International
    Conference on Computational Linguistics, 2016, pp. 1635–1645.'
date_created: 2019-11-11T12:28:24Z
date_updated: 2022-01-06T06:52:09Z
department:
- _id: '600'
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://www.aclweb.org/anthology/C16-1154.pdf
page: 1635-1645
publication: Proceedings of COLING 2016, the 26th International Conference on Computational
  Linguistics
status: public
title: 'UTCNN: a Deep Learning Model of Stance Classification on Social Media Text'
type: conference
user_id: '82920'
year: '2016'
...
---
_id: '14882'
author:
- first_name: Wei-Fan
  full_name: Chen, Wei-Fan
  id: '82920'
  last_name: Chen
- first_name: Fang-Yu
  full_name: Lin, Fang-Yu
  last_name: Lin
- first_name: Lun-Wei
  full_name: Ku, Lun-Wei
  last_name: Ku
citation:
  ama: 'Chen W-F, Lin F-Y, Ku L-W. WordForce: Visualizing Controversial Words in Debates.
    In: <i>Proceedings of COLING 2016, the 26th International Conference on Computational
    Linguistics: System Demonstrations</i>. ; 2016:273-277.'
  apa: 'Chen, W.-F., Lin, F.-Y., &#38; Ku, L.-W. (2016). WordForce: Visualizing Controversial
    Words in Debates. In <i>Proceedings of COLING 2016, the 26th International Conference
    on Computational Linguistics: System Demonstrations</i> (pp. 273–277).'
  bibtex: '@inproceedings{Chen_Lin_Ku_2016, title={WordForce: Visualizing Controversial
    Words in Debates}, booktitle={Proceedings of COLING 2016, the 26th International
    Conference on Computational Linguistics: System Demonstrations}, author={Chen,
    Wei-Fan and Lin, Fang-Yu and Ku, Lun-Wei}, year={2016}, pages={273–277} }'
  chicago: 'Chen, Wei-Fan, Fang-Yu Lin, and Lun-Wei Ku. “WordForce: Visualizing Controversial
    Words in Debates.” In <i>Proceedings of COLING 2016, the 26th International Conference
    on Computational Linguistics: System Demonstrations</i>, 273–77, 2016.'
  ieee: 'W.-F. Chen, F.-Y. Lin, and L.-W. Ku, “WordForce: Visualizing Controversial
    Words in Debates,” in <i>Proceedings of COLING 2016, the 26th International Conference
    on Computational Linguistics: System Demonstrations</i>, 2016, pp. 273–277.'
  mla: 'Chen, Wei-Fan, et al. “WordForce: Visualizing Controversial Words in Debates.”
    <i>Proceedings of COLING 2016, the 26th International Conference on Computational
    Linguistics: System Demonstrations</i>, 2016, pp. 273–77.'
  short: 'W.-F. Chen, F.-Y. Lin, L.-W. Ku, in: Proceedings of COLING 2016, the 26th
    International Conference on Computational Linguistics: System Demonstrations,
    2016, pp. 273–277.'
date_created: 2019-11-11T12:29:14Z
date_updated: 2022-01-06T06:52:09Z
department:
- _id: '600'
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://www.aclweb.org/anthology/C16-2057.pdf
page: 273-277
publication: 'Proceedings of COLING 2016, the 26th International Conference on Computational
  Linguistics: System Demonstrations'
status: public
title: 'WordForce: Visualizing Controversial Words in Debates'
type: conference
user_id: '82920'
year: '2016'
...
---
_id: '14883'
author:
- first_name: Lun-Wei
  full_name: Ku, Lun-Wei
  last_name: Ku
- first_name: Wei-Fan
  full_name: Chen, Wei-Fan
  id: '82920'
  last_name: Chen
citation:
  ama: 'Ku L-W, Chen W-F. Chinese Textual Sentiment Analysis: Datasets, Resources
    and Tools. In: <i>Proceedings of COLING 2016, the 26th International Conference
    on Computational Linguistics: Tutorial Abstracts</i>. ; 2016:5-8.'
  apa: 'Ku, L.-W., &#38; Chen, W.-F. (2016). Chinese Textual Sentiment Analysis: Datasets,
    Resources and Tools. In <i>Proceedings of COLING 2016, the 26th International
    Conference on Computational Linguistics: Tutorial Abstracts</i> (pp. 5–8).'
  bibtex: '@inproceedings{Ku_Chen_2016, title={Chinese Textual Sentiment Analysis:
    Datasets, Resources and Tools}, booktitle={Proceedings of COLING 2016, the 26th
    International Conference on Computational Linguistics: Tutorial Abstracts}, author={Ku,
    Lun-Wei and Chen, Wei-Fan}, year={2016}, pages={5–8} }'
  chicago: 'Ku, Lun-Wei, and Wei-Fan Chen. “Chinese Textual Sentiment Analysis: Datasets,
    Resources and Tools.” In <i>Proceedings of COLING 2016, the 26th International
    Conference on Computational Linguistics: Tutorial Abstracts</i>, 5–8, 2016.'
  ieee: 'L.-W. Ku and W.-F. Chen, “Chinese Textual Sentiment Analysis: Datasets, Resources
    and Tools,” in <i>Proceedings of COLING 2016, the 26th International Conference
    on Computational Linguistics: Tutorial Abstracts</i>, 2016, pp. 5–8.'
  mla: 'Ku, Lun-Wei, and Wei-Fan Chen. “Chinese Textual Sentiment Analysis: Datasets,
    Resources and Tools.” <i>Proceedings of COLING 2016, the 26th International Conference
    on Computational Linguistics: Tutorial Abstracts</i>, 2016, pp. 5–8.'
  short: 'L.-W. Ku, W.-F. Chen, in: Proceedings of COLING 2016, the 26th International
    Conference on Computational Linguistics: Tutorial Abstracts, 2016, pp. 5–8.'
date_created: 2019-11-11T12:30:04Z
date_updated: 2022-01-06T06:52:09Z
department:
- _id: '600'
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://www.aclweb.org/anthology/C16-3002.pdf
page: 5-8
publication: 'Proceedings of COLING 2016, the 26th International Conference on Computational
  Linguistics: Tutorial Abstracts'
status: public
title: 'Chinese Textual Sentiment Analysis: Datasets, Resources and Tools'
type: conference_abstract
user_id: '82920'
year: '2016'
...
---
_id: '149'
abstract:
- lang: eng
  text: 'In this paper we consider a strategic variant of the online facility location
    problem. Given is a graph in which each node serves two roles: it is a strategic
    client stating requests as well as a potential location for a facility. In each
    time step one client states a request which induces private costs equal to the
    distance to the closest facility. Before serving, the clients may collectively
    decide to open new facilities, sharing the corresponding price. Instead of optimizing
    the global costs, each client acts selfishly. The prices of new facilities vary
    between nodes and also change over time, but are always bounded by some fixed
    value α. Both the requests as well as the facility prices are given by an online
    sequence and are not known in advance.We characterize the optimal strategies of
    the clients and analyze their overall performance in comparison to a centralized
    offline solution. If all players optimize their own competitiveness, the global
    performance of the system is O(√α⋅α) times worse than the offline optimum. A restriction
    to a natural subclass of strategies improves this result to O(α). We also show
    that for fixed facility costs, we can find strategies such that this bound further
    improves to O(√α).'
author:
- first_name: Maximilian
  full_name: Drees, Maximilian
  last_name: Drees
- first_name: Björn
  full_name: Feldkord, Björn
  id: '22704'
  last_name: Feldkord
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
citation:
  ama: 'Drees M, Feldkord B, Skopalik A. Strategic Online Facility Location. In: <i>Proceedings
    of the 10th Annual International Conference on Combinatorial Optimization and
    Applications (COCOA)</i>. LNCS. ; 2016:593--607. doi:<a href="https://doi.org/10.1007/978-3-319-48749-6_43">10.1007/978-3-319-48749-6_43</a>'
  apa: Drees, M., Feldkord, B., &#38; Skopalik, A. (2016). Strategic Online Facility
    Location. In <i>Proceedings of the 10th Annual International Conference on Combinatorial
    Optimization and Applications (COCOA)</i> (pp. 593--607). <a href="https://doi.org/10.1007/978-3-319-48749-6_43">https://doi.org/10.1007/978-3-319-48749-6_43</a>
  bibtex: '@inproceedings{Drees_Feldkord_Skopalik_2016, series={LNCS}, title={Strategic
    Online Facility Location}, DOI={<a href="https://doi.org/10.1007/978-3-319-48749-6_43">10.1007/978-3-319-48749-6_43</a>},
    booktitle={Proceedings of the 10th Annual International Conference on Combinatorial
    Optimization and Applications (COCOA)}, author={Drees, Maximilian and Feldkord,
    Björn and Skopalik, Alexander}, year={2016}, pages={593--607}, collection={LNCS}
    }'
  chicago: Drees, Maximilian, Björn Feldkord, and Alexander Skopalik. “Strategic Online
    Facility Location.” In <i>Proceedings of the 10th Annual International Conference
    on Combinatorial Optimization and Applications (COCOA)</i>, 593--607. LNCS, 2016.
    <a href="https://doi.org/10.1007/978-3-319-48749-6_43">https://doi.org/10.1007/978-3-319-48749-6_43</a>.
  ieee: M. Drees, B. Feldkord, and A. Skopalik, “Strategic Online Facility Location,”
    in <i>Proceedings of the 10th Annual International Conference on Combinatorial
    Optimization and Applications (COCOA)</i>, 2016, pp. 593--607.
  mla: Drees, Maximilian, et al. “Strategic Online Facility Location.” <i>Proceedings
    of the 10th Annual International Conference on Combinatorial Optimization and
    Applications (COCOA)</i>, 2016, pp. 593--607, doi:<a href="https://doi.org/10.1007/978-3-319-48749-6_43">10.1007/978-3-319-48749-6_43</a>.
  short: 'M. Drees, B. Feldkord, A. Skopalik, in: Proceedings of the 10th Annual International
    Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607.'
date_created: 2017-10-17T12:41:21Z
date_updated: 2022-01-06T06:52:10Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-319-48749-6_43
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T12:55:43Z
  date_updated: 2018-03-21T12:55:43Z
  file_id: '1553'
  file_name: 149-chp_3A10.1007_2F978-3-319-48749-6_43.pdf
  file_size: 236253
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T12:55:43Z
has_accepted_license: '1'
language:
- iso: eng
page: 593--607
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '7'
  name: SFB 901 - Subproject A3
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 10th Annual International Conference on Combinatorial
  Optimization and Applications (COCOA)
series_title: LNCS
status: public
title: Strategic Online Facility Location
type: conference
user_id: '477'
year: '2016'
...
---
_id: '150'
author:
- first_name: Svetlana
  full_name: Arifulina, Svetlana
  last_name: Arifulina
citation:
  ama: Arifulina S. <i>Solving Heterogeneity for a Successful Service Market</i>.
    Universität Paderborn; 2016. doi:<a href="https://doi.org/10.17619/UNIPB/1-13">10.17619/UNIPB/1-13</a>
  apa: Arifulina, S. (2016). <i>Solving Heterogeneity for a Successful Service Market</i>.
    Universität Paderborn. <a href="https://doi.org/10.17619/UNIPB/1-13">https://doi.org/10.17619/UNIPB/1-13</a>
  bibtex: '@book{Arifulina_2016, title={Solving Heterogeneity for a Successful Service
    Market}, DOI={<a href="https://doi.org/10.17619/UNIPB/1-13">10.17619/UNIPB/1-13</a>},
    publisher={Universität Paderborn}, author={Arifulina, Svetlana}, year={2016} }'
  chicago: Arifulina, Svetlana. <i>Solving Heterogeneity for a Successful Service
    Market</i>. Universität Paderborn, 2016. <a href="https://doi.org/10.17619/UNIPB/1-13">https://doi.org/10.17619/UNIPB/1-13</a>.
  ieee: S. Arifulina, <i>Solving Heterogeneity for a Successful Service Market</i>.
    Universität Paderborn, 2016.
  mla: Arifulina, Svetlana. <i>Solving Heterogeneity for a Successful Service Market</i>.
    Universität Paderborn, 2016, doi:<a href="https://doi.org/10.17619/UNIPB/1-13">10.17619/UNIPB/1-13</a>.
  short: S. Arifulina, Solving Heterogeneity for a Successful Service Market, Universität
    Paderborn, 2016.
date_created: 2017-10-17T12:41:21Z
date_updated: 2022-01-06T06:52:13Z
ddc:
- '040'
department:
- _id: '66'
doi: 10.17619/UNIPB/1-13
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T12:54:05Z
  date_updated: 2018-03-21T12:54:05Z
  file_id: '1552'
  file_name: 150-Dissertation_Svetlana_Arifulina.pdf
  file_size: 6340482
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T12:54:05Z
has_accepted_license: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '9'
  name: SFB 901 - Subprojekt B1
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
title: Solving Heterogeneity for a Successful Service Market
type: dissertation
user_id: '477'
year: '2016'
...
---
_id: '15085'
author:
- first_name: Alexander
  full_name: Dunst, Alexander
  last_name: Dunst
- first_name: Rita
  full_name: Hartel, Rita
  id: '14961'
  last_name: Hartel
- first_name: Sven
  full_name: Hohenstein, Sven
  last_name: Hohenstein
- first_name: Jochen
  full_name: Laubrock, Jochen
  last_name: Laubrock
citation:
  ama: 'Dunst A, Hartel R, Hohenstein S, Laubrock J. Corpus Analyses of Multimodal
    Narrative: The Example of Graphic Novels. In: <i>Digital Humanities 2016, DH 2016,
    Conference Abstracts</i>. ; 2016:178-180.'
  apa: 'Dunst, A., Hartel, R., Hohenstein, S., &#38; Laubrock, J. (2016). Corpus Analyses
    of Multimodal Narrative: The Example of Graphic Novels. In <i>Digital Humanities
    2016, DH 2016, Conference Abstracts</i> (pp. 178–180).'
  bibtex: '@inproceedings{Dunst_Hartel_Hohenstein_Laubrock_2016, title={Corpus Analyses
    of Multimodal Narrative: The Example of Graphic Novels}, booktitle={Digital Humanities
    2016, DH 2016, Conference Abstracts}, author={Dunst, Alexander and Hartel, Rita
    and Hohenstein, Sven and Laubrock, Jochen}, year={2016}, pages={178–180} }'
  chicago: 'Dunst, Alexander, Rita Hartel, Sven Hohenstein, and Jochen Laubrock. “Corpus
    Analyses of Multimodal Narrative: The Example of Graphic Novels.” In <i>Digital
    Humanities 2016, DH 2016, Conference Abstracts</i>, 178–80, 2016.'
  ieee: 'A. Dunst, R. Hartel, S. Hohenstein, and J. Laubrock, “Corpus Analyses of
    Multimodal Narrative: The Example of Graphic Novels,” in <i>Digital Humanities
    2016, DH 2016, Conference Abstracts</i>, 2016, pp. 178–180.'
  mla: 'Dunst, Alexander, et al. “Corpus Analyses of Multimodal Narrative: The Example
    of Graphic Novels.” <i>Digital Humanities 2016, DH 2016, Conference Abstracts</i>,
    2016, pp. 178–80.'
  short: 'A. Dunst, R. Hartel, S. Hohenstein, J. Laubrock, in: Digital Humanities
    2016, DH 2016, Conference Abstracts, 2016, pp. 178–180.'
date_created: 2019-11-21T14:49:46Z
date_updated: 2022-01-06T06:52:15Z
department:
- _id: '69'
language:
- iso: eng
page: 178-180
publication: Digital Humanities 2016, DH 2016, Conference Abstracts
status: public
title: 'Corpus Analyses of Multimodal Narrative: The Example of Graphic Novels'
type: conference
user_id: '14961'
year: '2016'
...
---
_id: '15086'
author:
- first_name: Stefan
  full_name: Böttcher, Stefan
  id: '624'
  last_name: Böttcher
- first_name: Rita
  full_name: Hartel, Rita
  id: '14961'
  last_name: Hartel
- first_name: Thomas
  full_name: Jacobs, Thomas
  last_name: Jacobs
- first_name: Sebastian
  full_name: Maneth, Sebastian
  last_name: Maneth
citation:
  ama: 'Böttcher S, Hartel R, Jacobs T, Maneth S. Incremental updates on compressed
    XML. In: <i>2016 IEEE 32nd International Conference on Data Engineering (ICDE)</i>.
    IEEE; 2016:1026-1037. doi:<a href="https://doi.org/10.1109/icde.2016.7498310">10.1109/icde.2016.7498310</a>'
  apa: Böttcher, S., Hartel, R., Jacobs, T., &#38; Maneth, S. (2016). Incremental
    updates on compressed XML. In <i>2016 IEEE 32nd International Conference on Data
    Engineering (ICDE)</i> (pp. 1026–1037). IEEE. <a href="https://doi.org/10.1109/icde.2016.7498310">https://doi.org/10.1109/icde.2016.7498310</a>
  bibtex: '@inproceedings{Böttcher_Hartel_Jacobs_Maneth_2016, title={Incremental updates
    on compressed XML}, DOI={<a href="https://doi.org/10.1109/icde.2016.7498310">10.1109/icde.2016.7498310</a>},
    booktitle={2016 IEEE 32nd International Conference on Data Engineering (ICDE)},
    publisher={IEEE}, author={Böttcher, Stefan and Hartel, Rita and Jacobs, Thomas
    and Maneth, Sebastian}, year={2016}, pages={1026–1037} }'
  chicago: Böttcher, Stefan, Rita Hartel, Thomas Jacobs, and Sebastian Maneth. “Incremental
    Updates on Compressed XML.” In <i>2016 IEEE 32nd International Conference on Data
    Engineering (ICDE)</i>, 1026–37. IEEE, 2016. <a href="https://doi.org/10.1109/icde.2016.7498310">https://doi.org/10.1109/icde.2016.7498310</a>.
  ieee: S. Böttcher, R. Hartel, T. Jacobs, and S. Maneth, “Incremental updates on
    compressed XML,” in <i>2016 IEEE 32nd International Conference on Data Engineering
    (ICDE)</i>, 2016, pp. 1026–1037.
  mla: Böttcher, Stefan, et al. “Incremental Updates on Compressed XML.” <i>2016 IEEE
    32nd International Conference on Data Engineering (ICDE)</i>, IEEE, 2016, pp.
    1026–37, doi:<a href="https://doi.org/10.1109/icde.2016.7498310">10.1109/icde.2016.7498310</a>.
  short: 'S. Böttcher, R. Hartel, T. Jacobs, S. Maneth, in: 2016 IEEE 32nd International
    Conference on Data Engineering (ICDE), IEEE, 2016, pp. 1026–1037.'
date_created: 2019-11-21T14:52:52Z
date_updated: 2022-01-06T06:52:15Z
department:
- _id: '69'
doi: 10.1109/icde.2016.7498310
language:
- iso: eng
page: 1026-1037
publication: 2016 IEEE 32nd International Conference on Data Engineering (ICDE)
publication_identifier:
  isbn:
  - '9781509020201'
publication_status: published
publisher: IEEE
status: public
title: Incremental updates on compressed XML
type: conference
user_id: '14961'
year: '2016'
...
---
_id: '15111'
author:
- first_name: Karlson
  full_name: Pfannschmidt, Karlson
  id: '13472'
  last_name: Pfannschmidt
  orcid: 0000-0001-9407-7903
- first_name: Eyke
  full_name: Hüllermeier, Eyke
  id: '48129'
  last_name: Hüllermeier
- first_name: S.
  full_name: Held, S.
  last_name: Held
- first_name: R.
  full_name: Neiger, R.
  last_name: Neiger
citation:
  ama: 'Pfannschmidt K, Hüllermeier E, Held S, Neiger R. Evaluating tests in medical 
    diagnosis-Combining machine learning with game-theoretical concepts. In: <i>In
    Proceedings IPMU 16th International Conference on Information Processing and Management 
    of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven, The Netherlands</i>.
    Springer; 2016:450-461.'
  apa: Pfannschmidt, K., Hüllermeier, E., Held, S., &#38; Neiger, R. (2016). Evaluating
    tests in medical  diagnosis-Combining machine learning with game-theoretical concepts.
    In <i>In Proceedings IPMU 16th International Conference on Information Processing
    and Management  of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven,
    The Netherlands</i> (pp. 450–461). Springer.
  bibtex: '@inproceedings{Pfannschmidt_Hüllermeier_Held_Neiger_2016, title={Evaluating
    tests in medical  diagnosis-Combining machine learning with game-theoretical concepts},
    booktitle={In Proceedings IPMU 16th International Conference on Information Processing
    and Management  of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven,
    The Netherlands}, publisher={Springer}, author={Pfannschmidt, Karlson and Hüllermeier,
    Eyke and Held, S. and Neiger, R.}, year={2016}, pages={450–461} }'
  chicago: Pfannschmidt, Karlson, Eyke Hüllermeier, S. Held, and R. Neiger. “Evaluating
    Tests in Medical  Diagnosis-Combining Machine Learning with Game-Theoretical Concepts.”
    In <i>In Proceedings IPMU 16th International Conference on Information Processing
    and Management  of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven,
    The Netherlands</i>, 450–61. Springer, 2016.
  ieee: K. Pfannschmidt, E. Hüllermeier, S. Held, and R. Neiger, “Evaluating tests
    in medical  diagnosis-Combining machine learning with game-theoretical concepts,”
    in <i>In Proceedings IPMU 16th International Conference on Information Processing
    and Management  of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven,
    The Netherlands</i>, 2016, pp. 450–461.
  mla: Pfannschmidt, Karlson, et al. “Evaluating Tests in Medical  Diagnosis-Combining
    Machine Learning with Game-Theoretical Concepts.” <i>In Proceedings IPMU 16th
    International Conference on Information Processing and Management  of Uncertainty
    in Knowledge-Based Systems, Part 1, Eindhoven, The Netherlands</i>, Springer,
    2016, pp. 450–61.
  short: 'K. Pfannschmidt, E. Hüllermeier, S. Held, R. Neiger, in: In Proceedings
    IPMU 16th International Conference on Information Processing and Management  of
    Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven, The Netherlands, Springer,
    2016, pp. 450–461.'
date_created: 2019-11-21T16:42:47Z
date_updated: 2022-01-06T06:52:15Z
department:
- _id: '34'
- _id: '7'
- _id: '355'
language:
- iso: eng
page: 450-461
publication: In Proceedings IPMU 16th International Conference on Information Processing
  and Management  of Uncertainty in Knowledge-Based Systems, Part 1, Eindhoven, The
  Netherlands
publisher: Springer
status: public
title: Evaluating tests in medical  diagnosis-Combining machine learning with game-theoretical
  concepts
type: conference
user_id: '49109'
year: '2016'
...
---
_id: '15184'
author:
- first_name: Alexander
  full_name: Dunst, Alexander
  last_name: Dunst
- first_name: Rita
  full_name: Hartel, Rita
  id: '14961'
  last_name: Hartel
citation:
  ama: 'Dunst A, Hartel R. Die Corpusanalyse multimodaler Erzählungen am Beispiel
    graphischer Romane. In: <i>DHd-Tagung 2015, Modellierung - Vernetzung - Visualisierung,
    Die Digital Humanities Als Fächerübergreifendes Forschungsparadigma</i>. ; 2016.'
  apa: Dunst, A., &#38; Hartel, R. (2016). Die Corpusanalyse multimodaler Erzählungen
    am Beispiel graphischer Romane. In <i>DHd-Tagung 2015, Modellierung - Vernetzung
    - Visualisierung, Die Digital Humanities als fächerübergreifendes Forschungsparadigma</i>.
  bibtex: '@inproceedings{Dunst_Hartel_2016, title={Die Corpusanalyse multimodaler
    Erzählungen am Beispiel graphischer Romane}, booktitle={DHd-Tagung 2015, Modellierung
    - Vernetzung - Visualisierung, Die Digital Humanities als fächerübergreifendes
    Forschungsparadigma}, author={Dunst, Alexander and Hartel, Rita}, year={2016}
    }'
  chicago: Dunst, Alexander, and Rita Hartel. “Die Corpusanalyse Multimodaler Erzählungen
    Am Beispiel Graphischer Romane.” In <i>DHd-Tagung 2015, Modellierung - Vernetzung
    - Visualisierung, Die Digital Humanities Als Fächerübergreifendes Forschungsparadigma</i>,
    2016.
  ieee: A. Dunst and R. Hartel, “Die Corpusanalyse multimodaler Erzählungen am Beispiel
    graphischer Romane,” in <i>DHd-Tagung 2015, Modellierung - Vernetzung - Visualisierung,
    Die Digital Humanities als fächerübergreifendes Forschungsparadigma</i>, 2016.
  mla: Dunst, Alexander, and Rita Hartel. “Die Corpusanalyse Multimodaler Erzählungen
    Am Beispiel Graphischer Romane.” <i>DHd-Tagung 2015, Modellierung - Vernetzung
    - Visualisierung, Die Digital Humanities Als Fächerübergreifendes Forschungsparadigma</i>,
    2016.
  short: 'A. Dunst, R. Hartel, in: DHd-Tagung 2015, Modellierung - Vernetzung - Visualisierung,
    Die Digital Humanities Als Fächerübergreifendes Forschungsparadigma, 2016.'
date_created: 2019-11-26T09:27:07Z
date_updated: 2022-01-06T06:52:16Z
department:
- _id: '69'
language:
- iso: eng
publication: DHd-Tagung 2015, Modellierung - Vernetzung - Visualisierung, Die Digital
  Humanities als fächerübergreifendes Forschungsparadigma
status: public
title: Die Corpusanalyse multimodaler Erzählungen am Beispiel graphischer Romane
type: conference_abstract
user_id: '14961'
year: '2016'
...
---
_id: '152'
author:
- first_name: Fynn
  full_name: Dallmeier, Fynn
  last_name: Dallmeier
citation:
  ama: 'Dallmeier F. <i>Short Randomizable Aggregatable Signatures: Constructions
    and Security Analysis</i>. Universität Paderborn; 2016.'
  apa: 'Dallmeier, F. (2016). <i>Short Randomizable Aggregatable Signatures: Constructions
    and Security Analysis</i>. Universität Paderborn.'
  bibtex: '@book{Dallmeier_2016, title={Short Randomizable Aggregatable Signatures:
    Constructions and Security Analysis}, publisher={Universität Paderborn}, author={Dallmeier,
    Fynn}, year={2016} }'
  chicago: 'Dallmeier, Fynn. <i>Short Randomizable Aggregatable Signatures: Constructions
    and Security Analysis</i>. Universität Paderborn, 2016.'
  ieee: 'F. Dallmeier, <i>Short Randomizable Aggregatable Signatures: Constructions
    and Security Analysis</i>. Universität Paderborn, 2016.'
  mla: 'Dallmeier, Fynn. <i>Short Randomizable Aggregatable Signatures: Constructions
    and Security Analysis</i>. Universität Paderborn, 2016.'
  short: 'F. Dallmeier, Short Randomizable Aggregatable Signatures: Constructions
    and Security Analysis, Universität Paderborn, 2016.'
date_created: 2017-10-17T12:41:21Z
date_updated: 2022-01-06T06:52:16Z
department:
- _id: '64'
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: 'Short Randomizable Aggregatable Signatures: Constructions and Security Analysis'
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '160'
abstract:
- lang: eng
  text: 'A task at the beginning of the software development process is the creation
    of a requirements specification. The requirements specification is usually created
    by a software engineering expert. We try to substitute this expert by a domain
    expert (the user) and formulate the problem of creating requirements specifications
    as a search-based software engineering problem. The domain expert provides only
    examples of event sequences that describe the behavior of the required software
    program. These examples are represented by simple sequence diagrams and are divided
    into two subsets: positive examples of required program behavior and negative
    examples of prohibited program behavior. The task is then to synthesize a generalized
    requirements specification that usefully describes the required software. We approach
    this problem by applying a genetic algorithm and evolve deterministic finite automata
    (DFAs). These DFAs take the sequence diagrams as input that should be either accepted
    (positive example) or rejected (negative example). The problem is neither to find
    the minimal nor the most general automaton. Instead, the user should be provided
    with several appropriate automata from which the user can select, or which help
    the user to refine the examples given initially. We present the context of our
    research ("On-The-Fly Computing"), present our approach, report results indicating
    its feasibility, and conclude with a discussion.'
author:
- first_name: Lorijn
  full_name: van Rooijen, Lorijn
  id: '58843'
  last_name: van Rooijen
- first_name: Heiko
  full_name: Hamann, Heiko
  last_name: Hamann
citation:
  ama: 'van Rooijen L, Hamann H. Requirements Specification-by-Example Using a Multi-Objective
    Evolutionary Algorithm. In: <i>Proceedings of 24th IEEE International Requirements
    Engineering Conference (RE 2016)</i>. ; 2016:3--9. doi:<a href="https://doi.org/10.1109/REW.2016.015">10.1109/REW.2016.015</a>'
  apa: van Rooijen, L., &#38; Hamann, H. (2016). Requirements Specification-by-Example
    Using a Multi-Objective Evolutionary Algorithm. In <i>Proceedings of 24th IEEE
    International Requirements Engineering Conference (RE 2016)</i> (pp. 3--9). <a
    href="https://doi.org/10.1109/REW.2016.015">https://doi.org/10.1109/REW.2016.015</a>
  bibtex: '@inproceedings{van Rooijen_Hamann_2016, title={Requirements Specification-by-Example
    Using a Multi-Objective Evolutionary Algorithm}, DOI={<a href="https://doi.org/10.1109/REW.2016.015">10.1109/REW.2016.015</a>},
    booktitle={Proceedings of 24th IEEE International Requirements Engineering Conference
    (RE 2016)}, author={van Rooijen, Lorijn and Hamann, Heiko}, year={2016}, pages={3--9}
    }'
  chicago: Rooijen, Lorijn van, and Heiko Hamann. “Requirements Specification-by-Example
    Using a Multi-Objective Evolutionary Algorithm.” In <i>Proceedings of 24th IEEE
    International Requirements Engineering Conference (RE 2016)</i>, 3--9, 2016. <a
    href="https://doi.org/10.1109/REW.2016.015">https://doi.org/10.1109/REW.2016.015</a>.
  ieee: L. van Rooijen and H. Hamann, “Requirements Specification-by-Example Using
    a Multi-Objective Evolutionary Algorithm,” in <i>Proceedings of 24th IEEE International
    Requirements Engineering Conference (RE 2016)</i>, 2016, pp. 3--9.
  mla: van Rooijen, Lorijn, and Heiko Hamann. “Requirements Specification-by-Example
    Using a Multi-Objective Evolutionary Algorithm.” <i>Proceedings of 24th IEEE International
    Requirements Engineering Conference (RE 2016)</i>, 2016, pp. 3--9, doi:<a href="https://doi.org/10.1109/REW.2016.015">10.1109/REW.2016.015</a>.
  short: 'L. van Rooijen, H. Hamann, in: Proceedings of 24th IEEE International Requirements
    Engineering Conference (RE 2016), 2016, pp. 3--9.'
date_created: 2017-10-17T12:41:23Z
date_updated: 2022-01-06T06:52:42Z
ddc:
- '040'
department:
- _id: '66'
doi: 10.1109/REW.2016.015
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T12:47:21Z
  date_updated: 2018-03-21T12:47:21Z
  file_id: '1546'
  file_name: 160-07815598.pdf
  file_size: 419026
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T12:47:21Z
has_accepted_license: '1'
language:
- iso: eng
page: 3--9
project:
- _id: '1'
  name: SFB 901
- _id: '9'
  name: SFB 901 - Subprojekt B1
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of 24th IEEE International Requirements Engineering Conference
  (RE 2016)
status: public
title: Requirements Specification-by-Example Using a Multi-Objective Evolutionary
  Algorithm
type: conference
user_id: '477'
year: '2016'
...
---
_id: '16041'
author:
- first_name: M.
  full_name: Leinweber, M.
  last_name: Leinweber
- first_name: T.
  full_name: Fober, T.
  last_name: Fober
- first_name: M.
  full_name: Strickert, M.
  last_name: Strickert
- first_name: L.
  full_name: Baumgärtner, L.
  last_name: Baumgärtner
- first_name: G.
  full_name: Klebe, G.
  last_name: Klebe
- first_name: B.
  full_name: Freisleben, B.
  last_name: Freisleben
- first_name: Eyke
  full_name: Hüllermeier, Eyke
  id: '48129'
  last_name: Hüllermeier
citation:
  ama: 'Leinweber M, Fober T, Strickert M, et al. CavSimBase: A database for large
    scale comparison of protein binding sites. <i>IEEE Transactions on Knowledge and
    Data Engineering</i>. 2016;28(6):1423-1434.'
  apa: 'Leinweber, M., Fober, T., Strickert, M., Baumgärtner, L., Klebe, G., Freisleben,
    B., &#38; Hüllermeier, E. (2016). CavSimBase: A database for large scale comparison
    of protein binding sites. <i>IEEE Transactions on Knowledge and Data Engineering</i>,
    <i>28</i>(6), 1423–1434.'
  bibtex: '@article{Leinweber_Fober_Strickert_Baumgärtner_Klebe_Freisleben_Hüllermeier_2016,
    title={CavSimBase: A database for large scale comparison of protein binding sites},
    volume={28}, number={6}, journal={IEEE Transactions on Knowledge and Data Engineering},
    author={Leinweber, M. and Fober, T. and Strickert, M. and Baumgärtner, L. and
    Klebe, G. and Freisleben, B. and Hüllermeier, Eyke}, year={2016}, pages={1423–1434}
    }'
  chicago: 'Leinweber, M., T. Fober, M. Strickert, L. Baumgärtner, G. Klebe, B. Freisleben,
    and Eyke Hüllermeier. “CavSimBase: A Database for Large Scale Comparison of Protein
    Binding Sites.” <i>IEEE Transactions on Knowledge and Data Engineering</i> 28,
    no. 6 (2016): 1423–34.'
  ieee: 'M. Leinweber <i>et al.</i>, “CavSimBase: A database for large scale comparison
    of protein binding sites,” <i>IEEE Transactions on Knowledge and Data Engineering</i>,
    vol. 28, no. 6, pp. 1423–1434, 2016.'
  mla: 'Leinweber, M., et al. “CavSimBase: A Database for Large Scale Comparison of
    Protein Binding Sites.” <i>IEEE Transactions on Knowledge and Data Engineering</i>,
    vol. 28, no. 6, 2016, pp. 1423–34.'
  short: M. Leinweber, T. Fober, M. Strickert, L. Baumgärtner, G. Klebe, B. Freisleben,
    E. Hüllermeier, IEEE Transactions on Knowledge and Data Engineering 28 (2016)
    1423–1434.
date_created: 2020-02-24T16:04:59Z
date_updated: 2022-01-06T06:52:42Z
department:
- _id: '34'
- _id: '7'
- _id: '355'
intvolume: '        28'
issue: '6'
language:
- iso: eng
page: 1423-1434
publication: IEEE Transactions on Knowledge and Data Engineering
status: public
title: 'CavSimBase: A database for large scale comparison of protein binding sites'
type: journal_article
user_id: '49109'
volume: 28
year: '2016'
...