---
_id: '302'
author:
- first_name: Christian
  full_name: Stroh, Christian
  last_name: Stroh
citation:
  ama: Stroh C. <i>Efficient Attributes for Pairing-Based Anonymous Credentials</i>.
    Universität Paderborn; 2015.
  apa: Stroh, C. (2015). <i>Efficient Attributes for Pairing-Based Anonymous Credentials</i>.
    Universität Paderborn.
  bibtex: '@book{Stroh_2015, title={Efficient Attributes for Pairing-Based Anonymous
    Credentials}, publisher={Universität Paderborn}, author={Stroh, Christian}, year={2015}
    }'
  chicago: Stroh, Christian. <i>Efficient Attributes for Pairing-Based Anonymous Credentials</i>.
    Universität Paderborn, 2015.
  ieee: C. Stroh, <i>Efficient Attributes for Pairing-Based Anonymous Credentials</i>.
    Universität Paderborn, 2015.
  mla: Stroh, Christian. <i>Efficient Attributes for Pairing-Based Anonymous Credentials</i>.
    Universität Paderborn, 2015.
  short: C. Stroh, Efficient Attributes for Pairing-Based Anonymous Credentials, Universität
    Paderborn, 2015.
date_created: 2017-10-17T12:41:50Z
date_updated: 2022-01-06T06:58:51Z
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: Efficient Attributes for Pairing-Based Anonymous Credentials
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '305'
author:
- first_name: Sebastian
  full_name: Kniesburges, Sebastian
  last_name: Kniesburges
citation:
  ama: Kniesburges S. <i>Distributed Data Structures and the Power of Topological
    Self-Stabilization</i>. Universität Paderborn; 2015.
  apa: Kniesburges, S. (2015). <i>Distributed Data Structures and the Power of topological
    Self-Stabilization</i>. Universität Paderborn.
  bibtex: '@book{Kniesburges_2015, title={Distributed Data Structures and the Power
    of topological Self-Stabilization}, publisher={Universität Paderborn}, author={Kniesburges,
    Sebastian}, year={2015} }'
  chicago: Kniesburges, Sebastian. <i>Distributed Data Structures and the Power of
    Topological Self-Stabilization</i>. Universität Paderborn, 2015.
  ieee: S. Kniesburges, <i>Distributed Data Structures and the Power of topological
    Self-Stabilization</i>. Universität Paderborn, 2015.
  mla: Kniesburges, Sebastian. <i>Distributed Data Structures and the Power of Topological
    Self-Stabilization</i>. Universität Paderborn, 2015.
  short: S. Kniesburges, Distributed Data Structures and the Power of Topological
    Self-Stabilization, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:51Z
date_updated: 2022-01-06T06:58:54Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-13T09:14:43Z
  date_updated: 2018-03-13T09:14:43Z
  file_id: '1206'
  file_name: 305-Dissertation_-_Kniesburges.pdf
  file_size: 1709094
  relation: main_file
  success: 1
file_date_updated: 2018-03-13T09:14:43Z
has_accepted_license: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '13'
  name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Distributed Data Structures and the Power of topological Self-Stabilization
type: dissertation
user_id: '15504'
year: '2015'
...
---
_id: '312'
author:
- first_name: Patrick
  full_name: Schleiter, Patrick
  last_name: Schleiter
citation:
  ama: Schleiter P. <i>Constructions of Fully Secure Predicate Encryption Schemes</i>.
    Universität Paderborn; 2015.
  apa: Schleiter, P. (2015). <i>Constructions of Fully Secure Predicate Encryption
    Schemes</i>. Universität Paderborn.
  bibtex: '@book{Schleiter_2015, title={Constructions of Fully Secure Predicate Encryption
    Schemes}, publisher={Universität Paderborn}, author={Schleiter, Patrick}, year={2015}
    }'
  chicago: Schleiter, Patrick. <i>Constructions of Fully Secure Predicate Encryption
    Schemes</i>. Universität Paderborn, 2015.
  ieee: P. Schleiter, <i>Constructions of Fully Secure Predicate Encryption Schemes</i>.
    Universität Paderborn, 2015.
  mla: Schleiter, Patrick. <i>Constructions of Fully Secure Predicate Encryption Schemes</i>.
    Universität Paderborn, 2015.
  short: P. Schleiter, Constructions of Fully Secure Predicate Encryption Schemes,
    Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:52Z
date_updated: 2022-01-06T06:58:57Z
ddc:
- '040'
department:
- _id: '64'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:44:55Z
  date_updated: 2018-03-20T07:44:55Z
  file_id: '1439'
  file_name: 312-MA_2015_Schleiter_Constructions_of_fully_secure_PE_schemes_01.pdf
  file_size: 721996
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:44:55Z
has_accepted_license: '1'
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: Constructions of Fully Secure Predicate Encryption Schemes
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '271'
abstract:
- lang: eng
  text: In \emph{bandwidth allocation games} (BAGs), the strategy of a player consists
    of various demands on different resources. The player's utility is at most the
    sum of these demands, provided they are fully satisfied. Every resource has a
    limited capacity and if it is exceeded by the total demand, it has to be split
    between the players. Since these games generally do not have pure Nash equilibria,
    we consider approximate pure Nash equilibria, in which no player can improve her
    utility by more than some fixed factor $\alpha$ through unilateral strategy changes.
    There is a threshold $\alpha_\delta$ (where $\delta$ is a parameter that limits
    the demand of each player on a specific resource) such that $\alpha$-approximate
    pure Nash equilibria always exist for $\alpha \geq \alpha_\delta$, but not for
    $\alpha < \alpha_\delta$. We give both upper and lower bounds on this threshold
    $\alpha_\delta$ and show that the corresponding decision problem is ${\sf NP}$-hard.
    We also show that the $\alpha$-approximate price of anarchy for BAGs is $\alpha+1$.
    For a restricted version of the game, where demands of players only differ slightly
    from each other (e.g. symmetric games), we show that approximate Nash equilibria
    can be reached (and thus also be computed) in polynomial time using the best-response
    dynamic. Finally, we show that a broader class of utility-maximization games (which
    includes BAGs) converges quickly towards states whose social welfare is close
    to the optimum.
author:
- first_name: Maximilian
  full_name: Drees, Maximilian
  last_name: Drees
- first_name: Matthias
  full_name: Feldotto, Matthias
  id: '14052'
  last_name: Feldotto
  orcid: 0000-0003-1348-6516
- first_name: Sören
  full_name: Riechers, Sören
  last_name: Riechers
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
citation:
  ama: 'Drees M, Feldotto M, Riechers S, Skopalik A. On Existence and Properties of
    Approximate Pure Nash Equilibria in Bandwidth Allocation Games. In: <i>Proceedings
    of the 8th International Symposium on Algorithmic Game Theory (SAGT)</i>. Lecture
    Notes in Computer Science. ; 2015:178-189. doi:<a href="https://doi.org/10.1007/978-3-662-48433-3_14">10.1007/978-3-662-48433-3_14</a>'
  apa: Drees, M., Feldotto, M., Riechers, S., &#38; Skopalik, A. (2015). On Existence
    and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games.
    In <i>Proceedings of the 8th International Symposium on Algorithmic Game Theory
    (SAGT)</i> (pp. 178–189). <a href="https://doi.org/10.1007/978-3-662-48433-3_14">https://doi.org/10.1007/978-3-662-48433-3_14</a>
  bibtex: '@inproceedings{Drees_Feldotto_Riechers_Skopalik_2015, series={Lecture Notes
    in Computer Science}, title={On Existence and Properties of Approximate Pure Nash
    Equilibria in Bandwidth Allocation Games}, DOI={<a href="https://doi.org/10.1007/978-3-662-48433-3_14">10.1007/978-3-662-48433-3_14</a>},
    booktitle={Proceedings of the 8th International Symposium on Algorithmic Game
    Theory (SAGT)}, author={Drees, Maximilian and Feldotto, Matthias and Riechers,
    Sören and Skopalik, Alexander}, year={2015}, pages={178–189}, collection={Lecture
    Notes in Computer Science} }'
  chicago: Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik.
    “On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth
    Allocation Games.” In <i>Proceedings of the 8th International Symposium on Algorithmic
    Game Theory (SAGT)</i>, 178–89. Lecture Notes in Computer Science, 2015. <a href="https://doi.org/10.1007/978-3-662-48433-3_14">https://doi.org/10.1007/978-3-662-48433-3_14</a>.
  ieee: M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “On Existence and Properties
    of Approximate Pure Nash Equilibria in Bandwidth Allocation Games,” in <i>Proceedings
    of the 8th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2015,
    pp. 178–189.
  mla: Drees, Maximilian, et al. “On Existence and Properties of Approximate Pure
    Nash Equilibria in Bandwidth Allocation Games.” <i>Proceedings of the 8th International
    Symposium on Algorithmic Game Theory (SAGT)</i>, 2015, pp. 178–89, doi:<a href="https://doi.org/10.1007/978-3-662-48433-3_14">10.1007/978-3-662-48433-3_14</a>.
  short: 'M. Drees, M. Feldotto, S. Riechers, A. Skopalik, in: Proceedings of the
    8th International Symposium on Algorithmic Game Theory (SAGT), 2015, pp. 178–189.'
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:34Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-662-48433-3_14
external_id:
  arxiv:
  - '1507.02908'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:29:34Z
  date_updated: 2018-03-21T09:29:34Z
  file_id: '1475'
  file_name: 271-chp_3A10.1007_2F978-3-662-48433-3_14.pdf
  file_size: 256718
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:29:34Z
has_accepted_license: '1'
page: 178-189
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '16'
  name: SFB 901 - Subproject C4
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 8th International Symposium on Algorithmic Game Theory
  (SAGT)
series_title: Lecture Notes in Computer Science
status: public
title: On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth
  Allocation Games
type: conference
user_id: '14052'
year: '2015'
...
---
_id: '273'
author:
- first_name: Kathlén
  full_name: Kohn, Kathlén
  last_name: Kohn
citation:
  ama: Kohn K. <i>Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary
    Norms</i>. Universität Paderborn; 2015.
  apa: Kohn, K. (2015). <i>Number of Voronoi-relevant vectors in lattices with respect
    to arbitrary norms</i>. Universität Paderborn.
  bibtex: '@book{Kohn_2015, title={Number of Voronoi-relevant vectors in lattices
    with respect to arbitrary norms}, publisher={Universität Paderborn}, author={Kohn,
    Kathlén}, year={2015} }'
  chicago: Kohn, Kathlén. <i>Number of Voronoi-Relevant Vectors in Lattices with Respect
    to Arbitrary Norms</i>. Universität Paderborn, 2015.
  ieee: K. Kohn, <i>Number of Voronoi-relevant vectors in lattices with respect to
    arbitrary norms</i>. Universität Paderborn, 2015.
  mla: Kohn, Kathlén. <i>Number of Voronoi-Relevant Vectors in Lattices with Respect
    to Arbitrary Norms</i>. Universität Paderborn, 2015.
  short: K. Kohn, Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary
    Norms, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:37Z
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: Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '274'
abstract:
- lang: eng
  text: Consider the problem in which n jobs that are classified into k types are
    to be scheduled on m identical machines without preemption. A machine requires
    a proper setup taking s time units before processing jobs of a given type. The
    objective is to minimize the makespan of the resulting schedule. We design and
    analyze an approximation algorithm that runs in time polynomial in n,m and k and
    computes a solution with an approximation factor that can be made arbitrarily
    close to 3/2.
author:
- first_name: Alexander
  full_name: Mäcker, Alexander
  id: '13536'
  last_name: Mäcker
- first_name: Manuel
  full_name: Malatyali, Manuel
  last_name: Malatyali
- 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: 'Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Non-preemptive Scheduling
    on Machines with Setup Times. In: Dehne F, Sack JR, Stege U, eds. <i>Algorithms
    and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada,
    August 5-7, 2015. Proceedings</i>. Lecture Notes in Computer Science. ; 2015:542--553.
    doi:<a href="https://doi.org/10.1007/978-3-319-21840-3_45">10.1007/978-3-319-21840-3_45</a>'
  apa: 'Mäcker, A., Malatyali, M., Meyer auf der Heide, F., &#38; Riechers, S. (2015).
    Non-preemptive Scheduling on Machines with Setup Times. In F. Dehne, J. R. Sack,
    &#38; U. Stege (Eds.), <i>Algorithms and Data Structures: 14th International Symposium,
    WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i> (pp. 542--553).
    <a href="https://doi.org/10.1007/978-3-319-21840-3_45">https://doi.org/10.1007/978-3-319-21840-3_45</a>'
  bibtex: '@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2015, series={Lecture
    Notes in Computer Science}, title={Non-preemptive Scheduling on Machines with
    Setup Times}, DOI={<a href="https://doi.org/10.1007/978-3-319-21840-3_45">10.1007/978-3-319-21840-3_45</a>},
    booktitle={Algorithms and Data Structures: 14th International Symposium, WADS
    2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings}, author={Mäcker, Alexander
    and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören},
    editor={Dehne, Frank and Sack, Jörg Rüdiger and Stege, UlrikeEditors}, year={2015},
    pages={542--553}, collection={Lecture Notes in Computer Science} }'
  chicago: 'Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and
    Sören Riechers. “Non-Preemptive Scheduling on Machines with Setup Times.” In <i>Algorithms
    and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada,
    August 5-7, 2015. Proceedings</i>, edited by Frank Dehne, Jörg Rüdiger Sack, and
    Ulrike Stege, 542--553. Lecture Notes in Computer Science, 2015. <a href="https://doi.org/10.1007/978-3-319-21840-3_45">https://doi.org/10.1007/978-3-319-21840-3_45</a>.'
  ieee: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Non-preemptive
    Scheduling on Machines with Setup Times,” in <i>Algorithms and Data Structures:
    14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015.
    Proceedings</i>, 2015, pp. 542--553.'
  mla: 'Mäcker, Alexander, et al. “Non-Preemptive Scheduling on Machines with Setup
    Times.” <i>Algorithms and Data Structures: 14th International Symposium, WADS
    2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i>, edited by Frank
    Dehne et al., 2015, pp. 542--553, doi:<a href="https://doi.org/10.1007/978-3-319-21840-3_45">10.1007/978-3-319-21840-3_45</a>.'
  short: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: F. Dehne,
    J.R. Sack, U. Stege (Eds.), Algorithms and Data Structures: 14th International
    Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, 2015,
    pp. 542--553.'
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:39Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-21840-3_45
editor:
- first_name: Frank
  full_name: Dehne, Frank
  last_name: Dehne
- first_name: Jörg Rüdiger
  full_name: Sack, Jörg Rüdiger
  last_name: Sack
- first_name: Ulrike
  full_name: Stege, Ulrike
  last_name: Stege
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:28:34Z
  date_updated: 2018-03-21T09:28:34Z
  file_id: '1473'
  file_name: 274-chp_3A10.1007_2F978-3-319-21840-3_45.pdf
  file_size: 215498
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:28:34Z
has_accepted_license: '1'
page: 542--553
project:
- _id: '1'
  name: SFB 901
- _id: '16'
  name: SFB 901 - Subprojekt C4
- _id: '4'
  name: SFB 901 - Project Area C
publication: 'Algorithms and Data Structures: 14th International Symposium, WADS 2015,
  Victoria, BC, Canada, August 5-7, 2015. Proceedings'
series_title: Lecture Notes in Computer Science
status: public
title: Non-preemptive Scheduling on Machines with Setup Times
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '1772'
author:
- first_name: Jim
  full_name: Torresen, Jim
  last_name: Torresen
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
- first_name: Xin
  full_name: Yao, Xin
  last_name: Yao
citation:
  ama: Torresen J, Plessl C, Yao X. Self-Aware and Self-Expressive Systems – Guest
    Editor’s Introduction. <i>IEEE Computer</i>. 2015;48(7):18-20. doi:<a href="https://doi.org/10.1109/MC.2015.205">10.1109/MC.2015.205</a>
  apa: Torresen, J., Plessl, C., &#38; Yao, X. (2015). Self-Aware and Self-Expressive
    Systems – Guest Editor’s Introduction. <i>IEEE Computer</i>, <i>48</i>(7), 18–20.
    <a href="https://doi.org/10.1109/MC.2015.205">https://doi.org/10.1109/MC.2015.205</a>
  bibtex: '@article{Torresen_Plessl_Yao_2015, title={Self-Aware and Self-Expressive
    Systems – Guest Editor’s Introduction}, volume={48}, DOI={<a href="https://doi.org/10.1109/MC.2015.205">10.1109/MC.2015.205</a>},
    number={7}, journal={IEEE Computer}, publisher={IEEE Computer Society}, author={Torresen,
    Jim and Plessl, Christian and Yao, Xin}, year={2015}, pages={18–20} }'
  chicago: 'Torresen, Jim, Christian Plessl, and Xin Yao. “Self-Aware and Self-Expressive
    Systems – Guest Editor’s Introduction.” <i>IEEE Computer</i> 48, no. 7 (2015):
    18–20. <a href="https://doi.org/10.1109/MC.2015.205">https://doi.org/10.1109/MC.2015.205</a>.'
  ieee: J. Torresen, C. Plessl, and X. Yao, “Self-Aware and Self-Expressive Systems
    – Guest Editor’s Introduction,” <i>IEEE Computer</i>, vol. 48, no. 7, pp. 18–20,
    2015.
  mla: Torresen, Jim, et al. “Self-Aware and Self-Expressive Systems – Guest Editor’s
    Introduction.” <i>IEEE Computer</i>, vol. 48, no. 7, IEEE Computer Society, 2015,
    pp. 18–20, doi:<a href="https://doi.org/10.1109/MC.2015.205">10.1109/MC.2015.205</a>.
  short: J. Torresen, C. Plessl, X. Yao, IEEE Computer 48 (2015) 18–20.
date_created: 2018-03-23T14:06:12Z
date_updated: 2022-01-06T06:53:19Z
ddc:
- '000'
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1109/MC.2015.205
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T15:47:45Z
  date_updated: 2018-11-02T15:47:45Z
  file_id: '5313'
  file_name: 07163237.pdf
  file_size: 5605009
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T15:47:45Z
has_accepted_license: '1'
intvolume: '        48'
issue: '7'
keyword:
- self-awareness
- self-expression
language:
- iso: eng
page: 18-20
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '14'
  name: SFB 901 - Subproject C2
- _id: '34'
  grant_number: '610996'
  name: Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous
    System Architectures
publication: IEEE Computer
publisher: IEEE Computer Society
status: public
title: Self-Aware and Self-Expressive Systems – Guest Editor's Introduction
type: journal_article
user_id: '16153'
volume: 48
year: '2015'
...
---
_id: '235'
author:
- first_name: Sebastian
  full_name: Strotmeyer, Sebastian
  last_name: Strotmeyer
citation:
  ama: Strotmeyer S. <i>Vergleichende Betrachtung von Software-Werkzeugen zur Geschäftsmodellentwicklung</i>.
    Universität Paderborn; 2015.
  apa: Strotmeyer, S. (2015). <i>Vergleichende Betrachtung von Software-Werkzeugen
    zur Geschäftsmodellentwicklung</i>. Universität Paderborn.
  bibtex: '@book{Strotmeyer_2015, title={Vergleichende Betrachtung von Software-Werkzeugen
    zur Geschäftsmodellentwicklung}, publisher={Universität Paderborn}, author={Strotmeyer,
    Sebastian}, year={2015} }'
  chicago: Strotmeyer, Sebastian. <i>Vergleichende Betrachtung von Software-Werkzeugen
    zur Geschäftsmodellentwicklung</i>. Universität Paderborn, 2015.
  ieee: S. Strotmeyer, <i>Vergleichende Betrachtung von Software-Werkzeugen zur Geschäftsmodellentwicklung</i>.
    Universität Paderborn, 2015.
  mla: Strotmeyer, Sebastian. <i>Vergleichende Betrachtung von Software-Werkzeugen
    zur Geschäftsmodellentwicklung</i>. Universität Paderborn, 2015.
  short: S. Strotmeyer, Vergleichende Betrachtung von Software-Werkzeugen zur Geschäftsmodellentwicklung,
    Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:37Z
date_updated: 2022-01-06T06:55:56Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '17'
  name: SFB 901 - Subprojekt C5
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Vergleichende Betrachtung von Software-Werkzeugen zur Geschäftsmodellentwicklung
type: bachelorsthesis
user_id: '16205'
year: '2015'
...
---
_id: '236'
author:
- first_name: Daniel
  full_name: Neumann, Daniel
  last_name: Neumann
citation:
  ama: Neumann D. <i>Vergleichende Betrachtung ausgewählter Ansätze zur Bewertung
    von Innovation Performance im Kontext von IT-gestützten Geschäftsmodellinnovationen
    im Automotive Bereich</i>. Universität Paderborn; 2015.
  apa: Neumann, D. (2015). <i>Vergleichende Betrachtung ausgewählter Ansätze zur Bewertung
    von Innovation Performance im Kontext von IT-gestützten Geschäftsmodellinnovationen
    im Automotive Bereich</i>. Universität Paderborn.
  bibtex: '@book{Neumann_2015, title={Vergleichende Betrachtung ausgewählter Ansätze
    zur Bewertung von Innovation Performance im Kontext von IT-gestützten Geschäftsmodellinnovationen
    im Automotive Bereich}, publisher={Universität Paderborn}, author={Neumann, Daniel},
    year={2015} }'
  chicago: Neumann, Daniel. <i>Vergleichende Betrachtung ausgewählter Ansätze zur
    Bewertung von Innovation Performance im Kontext von IT-gestützten Geschäftsmodellinnovationen
    im Automotive Bereich</i>. Universität Paderborn, 2015.
  ieee: D. Neumann, <i>Vergleichende Betrachtung ausgewählter Ansätze zur Bewertung
    von Innovation Performance im Kontext von IT-gestützten Geschäftsmodellinnovationen
    im Automotive Bereich</i>. Universität Paderborn, 2015.
  mla: Neumann, Daniel. <i>Vergleichende Betrachtung ausgewählter Ansätze zur Bewertung
    von Innovation Performance im Kontext von IT-gestützten Geschäftsmodellinnovationen
    im Automotive Bereich</i>. Universität Paderborn, 2015.
  short: D. Neumann, Vergleichende Betrachtung ausgewählter Ansätze zur Bewertung
    von Innovation Performance im Kontext von IT-gestützten Geschäftsmodellinnovationen
    im Automotive Bereich, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:38Z
date_updated: 2022-01-06T06:55:57Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '17'
  name: SFB 901 - Subprojekt C5
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Vergleichende Betrachtung ausgewählter Ansätze zur Bewertung von Innovation
  Performance im Kontext von IT-gestützten Geschäftsmodellinnovationen im Automotive
  Bereich
type: mastersthesis
user_id: '16205'
year: '2015'
...
---
_id: '239'
abstract:
- lang: eng
  text: We report on the construction of the Wikidata Vandalism Corpus WDVC-2015,
    the first corpus for vandalism in knowledge bases. Our corpus is based on the
    entire revision history of Wikidata, the knowledge base underlying Wikipedia.
    Among Wikidata's 24 million manual revisions, we have identified more than 100,000
    cases of vandalism. An in-depth corpus analysis lays the groundwork for research
    and development on automatic vandalism detection in public knowledge bases. Our
    analysis shows that 58% of the vandalism revisions can be found in the textual
    portions of Wikidata, and the remainder in structural content, e.g., subject-predicate-object
    triples. Moreover, we find that some vandals also target Wikidata content whose
    manipulation may impact content displayed on Wikipedia, revealing potential vulnerabilities.
    Given today's importance of knowledge bases for information systems, this shows
    that public knowledge bases must be used with caution.
author:
- first_name: Stefan
  full_name: Heindorf, Stefan
  last_name: Heindorf
- first_name: Martin
  full_name: Potthast, Martin
  last_name: Potthast
- first_name: Benno
  full_name: Stein, Benno
  last_name: Stein
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
citation:
  ama: 'Heindorf S, Potthast M, Stein B, Engels G. Towards Vandalism Detection in
    Knowledge Bases: Corpus Construction and Analysis. In: <i>Proceedings of the 38th
    International ACM Conference on Research and Development in Information Retrieval
    (SIGIR 15)</i>. ; 2015:831--834. doi:<a href="https://doi.org/10.1145/2766462.2767804">10.1145/2766462.2767804</a>'
  apa: 'Heindorf, S., Potthast, M., Stein, B., &#38; Engels, G. (2015). Towards Vandalism
    Detection in Knowledge Bases: Corpus Construction and Analysis. In <i>Proceedings
    of the 38th International ACM Conference on Research and Development in Information
    Retrieval (SIGIR 15)</i> (pp. 831--834). <a href="https://doi.org/10.1145/2766462.2767804">https://doi.org/10.1145/2766462.2767804</a>'
  bibtex: '@inproceedings{Heindorf_Potthast_Stein_Engels_2015, title={Towards Vandalism
    Detection in Knowledge Bases: Corpus Construction and Analysis}, DOI={<a href="https://doi.org/10.1145/2766462.2767804">10.1145/2766462.2767804</a>},
    booktitle={Proceedings of the 38th International ACM Conference on Research and
    Development in Information Retrieval (SIGIR 15)}, author={Heindorf, Stefan and
    Potthast, Martin and Stein, Benno and Engels, Gregor}, year={2015}, pages={831--834}
    }'
  chicago: 'Heindorf, Stefan, Martin Potthast, Benno Stein, and Gregor Engels. “Towards
    Vandalism Detection in Knowledge Bases: Corpus Construction and Analysis.” In
    <i>Proceedings of the 38th International ACM Conference on Research and Development
    in Information Retrieval (SIGIR 15)</i>, 831--834, 2015. <a href="https://doi.org/10.1145/2766462.2767804">https://doi.org/10.1145/2766462.2767804</a>.'
  ieee: 'S. Heindorf, M. Potthast, B. Stein, and G. Engels, “Towards Vandalism Detection
    in Knowledge Bases: Corpus Construction and Analysis,” in <i>Proceedings of the
    38th International ACM Conference on Research and Development in Information Retrieval
    (SIGIR 15)</i>, 2015, pp. 831--834.'
  mla: 'Heindorf, Stefan, et al. “Towards Vandalism Detection in Knowledge Bases:
    Corpus Construction and Analysis.” <i>Proceedings of the 38th International ACM
    Conference on Research and Development in Information Retrieval (SIGIR 15)</i>,
    2015, pp. 831--834, doi:<a href="https://doi.org/10.1145/2766462.2767804">10.1145/2766462.2767804</a>.'
  short: 'S. Heindorf, M. Potthast, B. Stein, G. Engels, in: Proceedings of the 38th
    International ACM Conference on Research and Development in Information Retrieval
    (SIGIR 15), 2015, pp. 831--834.'
date_created: 2017-10-17T12:41:38Z
date_updated: 2022-01-06T06:56:04Z
ddc:
- '040'
department:
- _id: '66'
doi: 10.1145/2766462.2767804
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T10:29:18Z
  date_updated: 2018-03-21T10:29:18Z
  file_id: '1499'
  file_name: 239-p831-heindorf.pdf
  file_size: 735898
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T10:29:18Z
has_accepted_license: '1'
language:
- iso: eng
page: 831--834
project:
- _id: '1'
  name: SFB 901
- _id: '17'
  name: SFB 901 - Subprojekt C5
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 38th International ACM Conference on Research and
  Development in Information Retrieval (SIGIR 15)
status: public
title: 'Towards Vandalism Detection in Knowledge Bases: Corpus Construction and Analysis'
type: conference
user_id: '477'
year: '2015'
...
---
_id: '240'
abstract:
- lang: eng
  text: We consider online leasing problems in which demands arrive over time and
    need to be served by leasing resources. We introduce a new model for these problems
    such that a resource can be leased for K different durations each incurring a
    different cost (longer leases cost less per time unit). Each demand i can be served
    anytime between its arrival ai and its deadline ai+di by a leased resource. The
    objective is to meet all deadlines while minimizing the total leasing costs. This
    model is a natural generalization of Meyerson’s ParkingPermitProblem (FOCS 2005)
    in which di=0 for all i. We propose an online algorithm that is Θ(K+dmaxlmin)-competitive
    where dmax and lmin denote the largest di and the shortest available lease length,
    respectively. We also extend the SetCoverLeasing problem by deadlines and give
    a competitive online algorithm which also improves on existing solutions for the
    original SetCoverLeasing problem.
author:
- first_name: Shouwei
  full_name: Li, Shouwei
  last_name: Li
- first_name: Alexander
  full_name: Mäcker, Alexander
  id: '13536'
  last_name: Mäcker
- first_name: Christine
  full_name: Markarian, Christine
  id: '37612'
  last_name: Markarian
- 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: 'Li S, Mäcker A, Markarian C, Meyer auf der Heide F, Riechers S. Towards Flexible
    Demands in Online Leasing Problems. In: <i>Proceedings of the 21st Annual International
    Computing and Combinatorics Conference (COCOON)</i>. Lecture Notes in Computer
    Science. ; 2015:277--288. doi:<a href="https://doi.org/10.1007/978-3-319-21398-9_22">10.1007/978-3-319-21398-9_22</a>'
  apa: Li, S., Mäcker, A., Markarian, C., Meyer auf der Heide, F., &#38; Riechers,
    S. (2015). Towards Flexible Demands in Online Leasing Problems. In <i>Proceedings
    of the 21st Annual International Computing and Combinatorics Conference (COCOON)</i>
    (pp. 277--288). <a href="https://doi.org/10.1007/978-3-319-21398-9_22">https://doi.org/10.1007/978-3-319-21398-9_22</a>
  bibtex: '@inproceedings{Li_Mäcker_Markarian_Meyer auf der Heide_Riechers_2015, series={Lecture
    Notes in Computer Science}, title={Towards Flexible Demands in Online Leasing
    Problems}, DOI={<a href="https://doi.org/10.1007/978-3-319-21398-9_22">10.1007/978-3-319-21398-9_22</a>},
    booktitle={Proceedings of the 21st Annual International Computing and Combinatorics
    Conference (COCOON)}, author={Li, Shouwei and Mäcker, Alexander and Markarian,
    Christine and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2015},
    pages={277--288}, collection={Lecture Notes in Computer Science} }'
  chicago: Li, Shouwei, Alexander Mäcker, Christine Markarian, Friedhelm Meyer auf
    der Heide, and Sören Riechers. “Towards Flexible Demands in Online Leasing Problems.”
    In <i>Proceedings of the 21st Annual International Computing and Combinatorics
    Conference (COCOON)</i>, 277--288. Lecture Notes in Computer Science, 2015. <a
    href="https://doi.org/10.1007/978-3-319-21398-9_22">https://doi.org/10.1007/978-3-319-21398-9_22</a>.
  ieee: S. Li, A. Mäcker, C. Markarian, F. Meyer auf der Heide, and S. Riechers, “Towards
    Flexible Demands in Online Leasing Problems,” in <i>Proceedings of the 21st Annual
    International Computing and Combinatorics Conference (COCOON)</i>, 2015, pp. 277--288.
  mla: Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems.”
    <i>Proceedings of the 21st Annual International Computing and Combinatorics Conference
    (COCOON)</i>, 2015, pp. 277--288, doi:<a href="https://doi.org/10.1007/978-3-319-21398-9_22">10.1007/978-3-319-21398-9_22</a>.
  short: 'S. Li, A. Mäcker, C. Markarian, F. Meyer auf der Heide, S. Riechers, in:
    Proceedings of the 21st Annual International Computing and Combinatorics Conference
    (COCOON), 2015, pp. 277--288.'
date_created: 2017-10-17T12:41:38Z
date_updated: 2022-01-06T06:56:05Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-21398-9_22
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T10:28:50Z
  date_updated: 2018-03-21T10:28:50Z
  file_id: '1498'
  file_name: 240-chp_3A10.1007_2F978-3-319-21398-9_22.pdf
  file_size: 264482
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T10:28:50Z
has_accepted_license: '1'
page: 277--288
project:
- _id: '1'
  name: SFB 901
- _id: '16'
  name: SFB 901 - Subprojekt C4
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 21st Annual International Computing and Combinatorics
  Conference (COCOON)
series_title: Lecture Notes in Computer Science
status: public
title: Towards Flexible Demands in Online Leasing Problems
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '230'
abstract:
- lang: eng
  text: 'Cognitive fit theory (CFT) provides guidance for how best to represent information
    that is relevant for solving a given problem. CFT is widely established in information
    systems research and its validity has been demonstrated in a great variety of
    contexts. However, of the two major types of problems that exist (i.e., routine
    and creative problems) prior CFT research has addressed only one: routine problems.
    Creative problems, despite their importance, have been left unaddressed. Therefore,
    based on the visual sketching model of problem solving, we propose an extension
    of CFT and thereby demonstrate that cognitive fit can promote problem solving
    performance also for creative problems. In doing so, we extend the boundary of
    CFT and add to creativity research a previously unknown cognitive mechanism for
    promoting creative performance: cognitive fit. Moreover, we contribute to general
    problem solving research by bridging the gap between problem solving in creativity
    and information systems research.'
author:
- first_name: Thomas
  full_name: John, Thomas
  id: '3952'
  last_name: John
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
citation:
  ama: 'John T, Kundisch D. Why Fit Leads to Surprise: An Extension of Cognitive Fit
    Theory to Creative Problems. In: <i>Proceedings of the 36th International Conference
    on Information Systems (ICIS), Fort Worth, USA</i>. ; 2015.'
  apa: 'John, T., &#38; Kundisch, D. (2015). Why Fit Leads to Surprise: An Extension
    of Cognitive Fit Theory to Creative Problems. In <i>Proceedings of the 36th International
    Conference on Information Systems (ICIS), Fort Worth, USA</i>. Fort Worth, USA.'
  bibtex: '@inproceedings{John_Kundisch_2015, title={Why Fit Leads to Surprise: An
    Extension of Cognitive Fit Theory to Creative Problems}, booktitle={Proceedings
    of the 36th International Conference on Information Systems (ICIS), Fort Worth,
    USA}, author={John, Thomas and Kundisch, Dennis}, year={2015} }'
  chicago: 'John, Thomas, and Dennis Kundisch. “Why Fit Leads to Surprise: An Extension
    of Cognitive Fit Theory to Creative Problems.” In <i>Proceedings of the 36th International
    Conference on Information Systems (ICIS), Fort Worth, USA</i>, 2015.'
  ieee: 'T. John and D. Kundisch, “Why Fit Leads to Surprise: An Extension of Cognitive
    Fit Theory to Creative Problems,” in <i>Proceedings of the 36th International
    Conference on Information Systems (ICIS), Fort Worth, USA</i>, Fort Worth, USA,
    2015.'
  mla: 'John, Thomas, and Dennis Kundisch. “Why Fit Leads to Surprise: An Extension
    of Cognitive Fit Theory to Creative Problems.” <i>Proceedings of the 36th International
    Conference on Information Systems (ICIS), Fort Worth, USA</i>, 2015.'
  short: 'T. John, D. Kundisch, in: Proceedings of the 36th International Conference
    on Information Systems (ICIS), Fort Worth, USA, 2015.'
conference:
  location: Fort Worth, USA
  name: 36th International Conference on Information Systems (ICIS)
date_created: 2017-10-17T12:41:36Z
date_updated: 2022-01-06T06:55:45Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T10:32:38Z
  date_updated: 2018-03-21T10:32:38Z
  file_id: '1504'
  file_name: 230-Why_Fit_Leads_to_Surprise_-_An_Extension_of_Cognitive_Fit_Theory_to_Creative_Problems__002_.pdf
  file_size: 449413
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T10:32:38Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '17'
  name: SFB 901 - Subprojekt C5
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 36th International Conference on Information Systems
  (ICIS), Fort Worth, USA
status: public
title: 'Why Fit Leads to Surprise: An Extension of Cognitive Fit Theory to Creative
  Problems'
type: conference
user_id: '16205'
year: '2015'
...
---
_id: '233'
abstract:
- lang: eng
  text: Motivated by the deterministic single exponential time algorithm of Micciancio
    and Voulgaris for solving the shortest and closest vector problem for the Euclidean
    norm, we study the geometry and complexity of Voronoi cells of lattices with respect
    to arbitrary norms.On the positive side, we show that for strictly convex and
    smooth norms the geometry of Voronoi cells of lattices in any dimension is similar
    to the Euclidean case, i.e., the Voronoi cells are defined by the so-called Voronoi-relevant
    vectors and the facets of a Voronoi cell are in one-to-one correspondence with
    these vectors. On the negative side, we show that combinatorially Voronoi cells
    for arbitrary strictly convex and smooth norms are much more complicated than
    in the Euclidean case.In particular, we construct a family of three-dimensional
    lattices whose number of Voronoi-relevant vectors with respect to the l_3-norm
    is unbounded.Since the algorithm of Micciancio and Voulgaris and its run time
    analysis crucially dependonthefactthatfortheEuclidean normthenumber of Voronoi-relevant
    vectors is single exponential in the lattice dimension, this indicates that the
    techniques of Micciancio and Voulgaris cannot be extended to achieve deterministic
    single exponential time algorithms for lattice problems with respect to arbitrary
    l_p-norms.
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Kathlén
  full_name: Kohn, Kathlén
  last_name: Kohn
citation:
  ama: Blömer J, Kohn K. <i>Voronoi Cells of Lattices with Respect to Arbitrary Norms</i>.
    Universität Paderborn; 2015.
  apa: Blömer, J., &#38; Kohn, K. (2015). <i>Voronoi Cells of Lattices with Respect
    to Arbitrary Norms</i>. Universität Paderborn.
  bibtex: '@book{Blömer_Kohn_2015, title={Voronoi Cells of Lattices with Respect to
    Arbitrary Norms}, publisher={Universität Paderborn}, author={Blömer, Johannes
    and Kohn, Kathlén}, year={2015} }'
  chicago: Blömer, Johannes, and Kathlén Kohn. <i>Voronoi Cells of Lattices with Respect
    to Arbitrary Norms</i>. Universität Paderborn, 2015.
  ieee: J. Blömer and K. Kohn, <i>Voronoi Cells of Lattices with Respect to Arbitrary
    Norms</i>. Universität Paderborn, 2015.
  mla: Blömer, Johannes, and Kathlén Kohn. <i>Voronoi Cells of Lattices with Respect
    to Arbitrary Norms</i>. Universität Paderborn, 2015.
  short: J. Blömer, K. Kohn, Voronoi Cells of Lattices with Respect to Arbitrary Norms,
    Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:37Z
date_updated: 2022-01-06T06:55:49Z
ddc:
- '040'
department:
- _id: '64'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T10:30:18Z
  date_updated: 2018-03-21T10:30:18Z
  file_id: '1501'
  file_name: 233-1512.00720v1.pdf
  file_size: 1231102
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T10:30:18Z
has_accepted_license: '1'
main_file_link:
- open_access: '1'
  url: http://arxiv.org/pdf/1512.00720v1.pdf
oa: '1'
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
title: Voronoi Cells of Lattices with Respect to Arbitrary Norms
type: report
user_id: '25078'
year: '2015'
...
---
_id: '986'
abstract:
- lang: eng
  text: "The increasing amount of mobile traffic leads to a significantly higher energy
    consumption of mobile networks that is mainly caused by the high number of required
    base stations. One recent solution for this is based on a two-layered network
    that uses long-range macro cells to provide a full coverage signaling overlay
    and short-range small cells for fast data transmissions. These small cells can
    be switched off when they are not needed and allow network-wide energy optimizations.\r\n\r\nThis
    paper presents an architecture that extends existing mobile networks to integrate
    a small cell layer that supports on-demand cell activation. We discuss how additional
    small cells can be interconnected with existing core components and how they can
    be controlled by a resource management component. \r\nFinally, a Wi-Fi based proof
    of concept testbed implementation is presented that demonstrates the feasibility
    of the approach."
accept: '1'
author:
- first_name: Manuel
  full_name: Peuster, Manuel
  id: '13271'
  last_name: Peuster
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Peuster M, Karl H. An Architecture for Energy-aware On-demand Mobile Network
    Management. In: <i>Proceedings of the 5th Workshop on All Things Cellular: Operations,
    Applications and Challenges</i>. ; 2015.'
  apa: 'Peuster, M., &#38; Karl, H. (2015). An Architecture for Energy-aware On-demand
    Mobile Network Management. In <i>Proceedings of the 5th Workshop on All Things
    Cellular: Operations, Applications and Challenges</i>. London.'
  bibtex: '@inproceedings{Peuster_Karl_2015, title={An Architecture for Energy-aware
    On-demand Mobile Network Management}, booktitle={Proceedings of the 5th Workshop
    on All Things Cellular: Operations, Applications and Challenges}, author={Peuster,
    Manuel and Karl, Holger}, year={2015} }'
  chicago: 'Peuster, Manuel, and Holger Karl. “An Architecture for Energy-Aware On-Demand
    Mobile Network Management.” In <i>Proceedings of the 5th Workshop on All Things
    Cellular: Operations, Applications and Challenges</i>, 2015.'
  ieee: 'M. Peuster and H. Karl, “An Architecture for Energy-aware On-demand Mobile
    Network Management,” in <i>Proceedings of the 5th Workshop on All Things Cellular:
    Operations, Applications and Challenges</i>, London, 2015.'
  mla: 'Peuster, Manuel, and Holger Karl. “An Architecture for Energy-Aware On-Demand
    Mobile Network Management.” <i>Proceedings of the 5th Workshop on All Things Cellular:
    Operations, Applications and Challenges</i>, 2015.'
  short: 'M. Peuster, H. Karl, in: Proceedings of the 5th Workshop on All Things Cellular:
    Operations, Applications and Challenges, 2015.'
conference:
  location: London
  name: 'Proceedings of the 5th Workshop on All Things Cellular: Operations, Applications
    and Challenges'
date_created: 2017-11-27T10:22:29Z
date_updated: 2019-01-03T13:18:55Z
ddc:
- '000'
department:
- _id: '75'
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T14:06:06Z
  date_updated: 2018-11-02T14:06:06Z
  file_id: '5261'
  file_name: p25-peuster.pdf
  file_size: 1916017
  open_access: 1
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T14:06:06Z
language:
- iso: eng
main_file_link:
- url: https://dl.acm.org/citation.cfm?id=2785973
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '16'
  name: SFB 901 - Subproject C4
publication: 'Proceedings of the 5th Workshop on All Things Cellular: Operations,
  Applications and Challenges'
publication_status: published
status: public
title: An Architecture for Energy-aware On-demand Mobile Network Management
type: conference
user_id: '477'
year: '2015'
...
---
_id: '5413'
author:
- first_name: Lukas
  full_name: Funke, Lukas
  last_name: Funke
citation:
  ama: Funke L. <i>An LLVM Based Toolchain for Transparent Acceleration of Digital
    Image Processing Applications Using FPGA Overlay Architectures</i>. Universität
    Paderborn; 2015.
  apa: Funke, L. (2015). <i>An LLVM Based Toolchain for Transparent Acceleration of
    Digital Image Processing Applications using FPGA Overlay Architectures</i>. Universität
    Paderborn.
  bibtex: '@book{Funke_2015, title={An LLVM Based Toolchain for Transparent Acceleration
    of Digital Image Processing Applications using FPGA Overlay Architectures}, publisher={Universität
    Paderborn}, author={Funke, Lukas}, year={2015} }'
  chicago: Funke, Lukas. <i>An LLVM Based Toolchain for Transparent Acceleration of
    Digital Image Processing Applications Using FPGA Overlay Architectures</i>. Universität
    Paderborn, 2015.
  ieee: L. Funke, <i>An LLVM Based Toolchain for Transparent Acceleration of Digital
    Image Processing Applications using FPGA Overlay Architectures</i>. Universität
    Paderborn, 2015.
  mla: Funke, Lukas. <i>An LLVM Based Toolchain for Transparent Acceleration of Digital
    Image Processing Applications Using FPGA Overlay Architectures</i>. Universität
    Paderborn, 2015.
  short: L. Funke, An LLVM Based Toolchain for Transparent Acceleration of Digital
    Image Processing Applications Using FPGA Overlay Architectures, Universität Paderborn,
    2015.
date_created: 2018-11-07T15:10:35Z
date_updated: 2022-01-06T07:01:52Z
department:
- _id: '27'
- _id: '518'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '14'
  name: SFB 901 - Subproject C2
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
title: An LLVM Based Toolchain for Transparent Acceleration of Digital Image Processing
  Applications using FPGA Overlay Architectures
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '5416'
author:
- first_name: Thomas
  full_name: Löcke, Thomas
  last_name: Löcke
citation:
  ama: Löcke T. <i>Instance-Specific Computing in Hard- and Software for Faster Solving
    of Complex Problems</i>. Universität Paderborn; 2015.
  apa: Löcke, T. (2015). <i>Instance-Specific Computing in Hard- and Software for
    Faster Solving of Complex Problems</i>. Universität Paderborn.
  bibtex: '@book{Löcke_2015, title={Instance-Specific Computing in Hard- and Software
    for Faster Solving of Complex Problems}, publisher={Universität Paderborn}, author={Löcke,
    Thomas}, year={2015} }'
  chicago: Löcke, Thomas. <i>Instance-Specific Computing in Hard- and Software for
    Faster Solving of Complex Problems</i>. Universität Paderborn, 2015.
  ieee: T. Löcke, <i>Instance-Specific Computing in Hard- and Software for Faster
    Solving of Complex Problems</i>. Universität Paderborn, 2015.
  mla: Löcke, Thomas. <i>Instance-Specific Computing in Hard- and Software for Faster
    Solving of Complex Problems</i>. Universität Paderborn, 2015.
  short: T. Löcke, Instance-Specific Computing in Hard- and Software for Faster Solving
    of Complex Problems, Universität Paderborn, 2015.
date_created: 2018-11-07T16:06:53Z
date_updated: 2022-01-06T07:01:52Z
department:
- _id: '27'
- _id: '518'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '14'
  name: SFB 901 - Subproject C2
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
title: Instance-Specific Computing in Hard- and Software for Faster Solving of Complex
  Problems
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '5419'
author:
- first_name: Felix
  full_name: Wallaschek, Felix
  last_name: Wallaschek
citation:
  ama: Wallaschek F. <i>Accelerating Programmable Logic Controllers with the Use of
    FPGAs</i>. Universität Paderborn; 2015.
  apa: Wallaschek, F. (2015). <i>Accelerating Programmable Logic Controllers with
    the use of FPGAs</i>. Universität Paderborn.
  bibtex: '@book{Wallaschek_2015, title={Accelerating Programmable Logic Controllers
    with the use of FPGAs}, publisher={Universität Paderborn}, author={Wallaschek,
    Felix}, year={2015} }'
  chicago: Wallaschek, Felix. <i>Accelerating Programmable Logic Controllers with
    the Use of FPGAs</i>. Universität Paderborn, 2015.
  ieee: F. Wallaschek, <i>Accelerating Programmable Logic Controllers with the use
    of FPGAs</i>. Universität Paderborn, 2015.
  mla: Wallaschek, Felix. <i>Accelerating Programmable Logic Controllers with the
    Use of FPGAs</i>. Universität Paderborn, 2015.
  short: F. Wallaschek, Accelerating Programmable Logic Controllers with the Use of
    FPGAs, Universität Paderborn, 2015.
date_created: 2018-11-07T16:14:30Z
date_updated: 2022-01-06T07:01:52Z
department:
- _id: '27'
- _id: '518'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '14'
  name: SFB 901 - Subproject C2
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
title: Accelerating Programmable Logic Controllers with the use of FPGAs
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '296'
abstract:
- lang: eng
  text: FPGAs are known to permit huge gains in performance and efficiency for suitable
    applications but still require reduced design efforts and shorter development
    cycles for wider adoption. In this work, we compare the resulting performance
    of two design concepts that in different ways promise such increased productivity.
    As common starting point, we employ a kernel-centric design approach, where computational
    hotspots in an application are identified and individually accelerated on FPGA.
    By means of a complex stereo matching application, we evaluate two fundamentally
    different design philosophies and approaches for implementing the required kernels
    on FPGAs. In the first implementation approach, we designed individually specialized
    data flow kernels in a spatial programming language for a Maxeler FPGA platform;
    in the alternative design approach, we target a vector coprocessor with large
    vector lengths, which is implemented as a form of programmable overlay on the
    application FPGAs of a Convey HC-1. We assess both approaches in terms of overall
    system performance, raw kernel performance, and performance relative to invested
    resources. After compensating for the effects of the underlying hardware platforms,
    the specialized dataflow kernels on the Maxeler platform are around 3x faster
    than kernels executing on the Convey vector coprocessor. In our concrete scenario,
    due to trade-offs between reconfiguration overheads and exposed parallelism, the
    advantage of specialized dataflow kernels is reduced to around 2.5x.
article_number: '859425'
author:
- first_name: Tobias
  full_name: Kenter, Tobias
  id: '3145'
  last_name: Kenter
- first_name: Henning
  full_name: Schmitz, Henning
  last_name: Schmitz
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
citation:
  ama: Kenter T, Schmitz H, Plessl C. Exploring Tradeoffs between Specialized Kernels
    and a Reusable Overlay in a Stereo-Matching Case Study. <i>International Journal
    of Reconfigurable Computing (IJRC)</i>. 2015;2015. doi:<a href="https://doi.org/10.1155/2015/859425">10.1155/2015/859425</a>
  apa: Kenter, T., Schmitz, H., &#38; Plessl, C. (2015). Exploring Tradeoffs between
    Specialized Kernels and a Reusable Overlay in a Stereo-Matching Case Study. <i>International
    Journal of Reconfigurable Computing (IJRC)</i>, <i>2015</i>, Article 859425. <a
    href="https://doi.org/10.1155/2015/859425">https://doi.org/10.1155/2015/859425</a>
  bibtex: '@article{Kenter_Schmitz_Plessl_2015, title={Exploring Tradeoffs between
    Specialized Kernels and a Reusable Overlay in a Stereo-Matching Case Study}, volume={2015},
    DOI={<a href="https://doi.org/10.1155/2015/859425">10.1155/2015/859425</a>}, number={859425},
    journal={International Journal of Reconfigurable Computing (IJRC)}, publisher={Hindawi},
    author={Kenter, Tobias and Schmitz, Henning and Plessl, Christian}, year={2015}
    }'
  chicago: Kenter, Tobias, Henning Schmitz, and Christian Plessl. “Exploring Tradeoffs
    between Specialized Kernels and a Reusable Overlay in a Stereo-Matching Case Study.”
    <i>International Journal of Reconfigurable Computing (IJRC)</i> 2015 (2015). <a
    href="https://doi.org/10.1155/2015/859425">https://doi.org/10.1155/2015/859425</a>.
  ieee: 'T. Kenter, H. Schmitz, and C. Plessl, “Exploring Tradeoffs between Specialized
    Kernels and a Reusable Overlay in a Stereo-Matching Case Study,” <i>International
    Journal of Reconfigurable Computing (IJRC)</i>, vol. 2015, Art. no. 859425, 2015,
    doi: <a href="https://doi.org/10.1155/2015/859425">10.1155/2015/859425</a>.'
  mla: Kenter, Tobias, et al. “Exploring Tradeoffs between Specialized Kernels and
    a Reusable Overlay in a Stereo-Matching Case Study.” <i>International Journal
    of Reconfigurable Computing (IJRC)</i>, vol. 2015, 859425, Hindawi, 2015, doi:<a
    href="https://doi.org/10.1155/2015/859425">10.1155/2015/859425</a>.
  short: T. Kenter, H. Schmitz, C. Plessl, International Journal of Reconfigurable
    Computing (IJRC) 2015 (2015).
date_created: 2017-10-17T12:41:49Z
date_updated: 2023-09-26T13:29:08Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1155/2015/859425
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:47:56Z
  date_updated: 2018-03-20T07:47:56Z
  file_id: '1444'
  file_name: 296-859425.pdf
  file_size: 2993898
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:47:56Z
has_accepted_license: '1'
intvolume: '      2015'
language:
- iso: eng
project:
- _id: '1'
  grant_number: '160364472'
  name: SFB 901
- _id: '14'
  grant_number: '160364472'
  name: SFB 901 - Subprojekt C2
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '34'
  grant_number: '610996'
  name: Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous
    System Architectures
publication: International Journal of Reconfigurable Computing (IJRC)
publisher: Hindawi
quality_controlled: '1'
status: public
title: Exploring Tradeoffs between Specialized Kernels and a Reusable Overlay in a
  Stereo-Matching Case Study
type: journal_article
user_id: '15278'
volume: 2015
year: '2015'
...
---
_id: '303'
abstract:
- lang: eng
  text: This paper introduces Binary Acceleration At Runtime(BAAR), an easy-to-use
    on-the-fly binary acceleration mechanismwhich aims to tackle the problem of enabling
    existentsoftware to automatically utilize accelerators at runtime. BAARis based
    on the LLVM Compiler Infrastructure and has aclient-server architecture. The client
    runs the program to beaccelerated in an environment which allows program analysisand
    profiling. Program parts which are identified as suitable forthe available accelerator
    are exported and sent to the server.The server optimizes these program parts for
    the acceleratorand provides RPC execution for the client. The client transformsits
    program to utilize accelerated execution on the server foroffloaded program parts.
    We evaluate our work with a proofof-concept implementation of BAAR that uses an
    Intel XeonPhi 5110P as the acceleration target and performs automaticoffloading,
    parallelization and vectorization of suitable programparts. The practicality of
    BAAR for real-world examples is shownbased on a study of stencil codes. Our results
    show a speedup ofup to 4 without any developer-provided hints and 5.77 withhints
    over the same code compiled with the Intel Compiler atoptimization level O2 and
    running on an Intel Xeon E5-2670machine. Based on our insights gained during implementationand
    evaluation we outline future directions of research, e.g.,offloading more fine-granular
    program parts than functions, amore sophisticated communication mechanism or introducing
    onstack-replacement.
author:
- first_name: Marvin
  full_name: Damschen, Marvin
  last_name: Damschen
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
citation:
  ama: 'Damschen M, Plessl C. Easy-to-Use On-The-Fly Binary Program Acceleration on
    Many-Cores. In: <i>Proceedings of the 5th International Workshop on Adaptive Self-Tuning
    Computing Systems (ADAPT)</i>. ; 2015.'
  apa: Damschen, M., &#38; Plessl, C. (2015). Easy-to-Use On-The-Fly Binary Program
    Acceleration on Many-Cores. <i>Proceedings of the 5th International Workshop on
    Adaptive Self-Tuning Computing Systems (ADAPT)</i>.
  bibtex: '@inproceedings{Damschen_Plessl_2015, title={Easy-to-Use On-The-Fly Binary
    Program Acceleration on Many-Cores}, booktitle={Proceedings of the 5th International
    Workshop on Adaptive Self-tuning Computing Systems (ADAPT)}, author={Damschen,
    Marvin and Plessl, Christian}, year={2015} }'
  chicago: Damschen, Marvin, and Christian Plessl. “Easy-to-Use On-The-Fly Binary
    Program Acceleration on Many-Cores.” In <i>Proceedings of the 5th International
    Workshop on Adaptive Self-Tuning Computing Systems (ADAPT)</i>, 2015.
  ieee: M. Damschen and C. Plessl, “Easy-to-Use On-The-Fly Binary Program Acceleration
    on Many-Cores,” 2015.
  mla: Damschen, Marvin, and Christian Plessl. “Easy-to-Use On-The-Fly Binary Program
    Acceleration on Many-Cores.” <i>Proceedings of the 5th International Workshop
    on Adaptive Self-Tuning Computing Systems (ADAPT)</i>, 2015.
  short: 'M. Damschen, C. Plessl, in: Proceedings of the 5th International Workshop
    on Adaptive Self-Tuning Computing Systems (ADAPT), 2015.'
date_created: 2017-10-17T12:41:51Z
date_updated: 2023-09-26T13:29:59Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
- _id: '78'
external_id:
  arxiv:
  - '1412.3906'
file:
- access_level: open_access
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:46:46Z
  date_updated: 2019-08-01T09:10:44Z
  file_id: '1442'
  file_name: 303-plessl15_adapt.pdf
  file_size: 1176620
  relation: main_file
file_date_updated: 2019-08-01T09:10:44Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
project:
- _id: '1'
  grant_number: '160364472'
  name: SFB 901
- _id: '14'
  grant_number: '160364472'
  name: SFB 901 - Subprojekt C2
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '34'
  grant_number: '610996'
  name: Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous
    System Architectures
publication: Proceedings of the 5th International Workshop on Adaptive Self-tuning
  Computing Systems (ADAPT)
quality_controlled: '1'
status: public
title: Easy-to-Use On-The-Fly Binary Program Acceleration on Many-Cores
type: conference
user_id: '15278'
year: '2015'
...
---
_id: '238'
abstract:
- lang: eng
  text: In this paper, we study how binary applications can be transparently accelerated
    with novel heterogeneous computing resources without requiring any manual porting
    or developer-provided hints. Our work is based on Binary Acceleration At Runtime
    (BAAR), our previously introduced binary acceleration mechanism that uses the
    LLVM Compiler Infrastructure. BAAR is designed as a client-server architecture.
    The client runs the program to be accelerated in an environment, which allows
    program analysis and profiling and identifies and extracts suitable program parts
    to be offloaded. The server compiles and optimizes these offloaded program parts
    for the accelerator and offers access to these functions to the client with a
    remote procedure call (RPC) interface. Our previous work proved the feasibility
    of our approach, but also showed that communication time and overheads limit the
    granularity of functions that can be meaningfully offloaded. In this work, we
    motivate the importance of a lightweight, high-performance communication between
    server and client and present a communication mechanism based on the Message Passing
    Interface (MPI). We evaluate our approach by using an Intel Xeon Phi 5110P as
    the acceleration target and show that the communication overhead can be reduced
    from 40% to 10%, thus enabling even small hotspots to benefit from offloading
    to an accelerator.
author:
- first_name: Marvin
  full_name: Damschen, Marvin
  last_name: Damschen
- first_name: Heinrich
  full_name: Riebler, Heinrich
  id: '8961'
  last_name: Riebler
- first_name: Gavin Francis
  full_name: Vaz, Gavin Francis
  id: '30332'
  last_name: Vaz
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
citation:
  ama: 'Damschen M, Riebler H, Vaz GF, Plessl C. Transparent offloading of computational
    hotspots from binary code to Xeon Phi. In: <i>Proceedings of the 2015 Conference
    on Design, Automation and Test in Europe (DATE)</i>. EDA Consortium / IEEE; 2015:1078-1083.
    doi:<a href="https://doi.org/10.7873/DATE.2015.1124">10.7873/DATE.2015.1124</a>'
  apa: Damschen, M., Riebler, H., Vaz, G. F., &#38; Plessl, C. (2015). Transparent
    offloading of computational hotspots from binary code to Xeon Phi. <i>Proceedings
    of the 2015 Conference on Design, Automation and Test in Europe (DATE)</i>, 1078–1083.
    <a href="https://doi.org/10.7873/DATE.2015.1124">https://doi.org/10.7873/DATE.2015.1124</a>
  bibtex: '@inproceedings{Damschen_Riebler_Vaz_Plessl_2015, title={Transparent offloading
    of computational hotspots from binary code to Xeon Phi}, DOI={<a href="https://doi.org/10.7873/DATE.2015.1124">10.7873/DATE.2015.1124</a>},
    booktitle={Proceedings of the 2015 Conference on Design, Automation and Test in
    Europe (DATE)}, publisher={EDA Consortium / IEEE}, author={Damschen, Marvin and
    Riebler, Heinrich and Vaz, Gavin Francis and Plessl, Christian}, year={2015},
    pages={1078–1083} }'
  chicago: Damschen, Marvin, Heinrich Riebler, Gavin Francis Vaz, and Christian Plessl.
    “Transparent Offloading of Computational Hotspots from Binary Code to Xeon Phi.”
    In <i>Proceedings of the 2015 Conference on Design, Automation and Test in Europe
    (DATE)</i>, 1078–83. EDA Consortium / IEEE, 2015. <a href="https://doi.org/10.7873/DATE.2015.1124">https://doi.org/10.7873/DATE.2015.1124</a>.
  ieee: 'M. Damschen, H. Riebler, G. F. Vaz, and C. Plessl, “Transparent offloading
    of computational hotspots from binary code to Xeon Phi,” in <i>Proceedings of
    the 2015 Conference on Design, Automation and Test in Europe (DATE)</i>, 2015,
    pp. 1078–1083, doi: <a href="https://doi.org/10.7873/DATE.2015.1124">10.7873/DATE.2015.1124</a>.'
  mla: Damschen, Marvin, et al. “Transparent Offloading of Computational Hotspots
    from Binary Code to Xeon Phi.” <i>Proceedings of the 2015 Conference on Design,
    Automation and Test in Europe (DATE)</i>, EDA Consortium / IEEE, 2015, pp. 1078–83,
    doi:<a href="https://doi.org/10.7873/DATE.2015.1124">10.7873/DATE.2015.1124</a>.
  short: 'M. Damschen, H. Riebler, G.F. Vaz, C. Plessl, in: Proceedings of the 2015
    Conference on Design, Automation and Test in Europe (DATE), EDA Consortium / IEEE,
    2015, pp. 1078–1083.'
date_created: 2017-10-17T12:41:38Z
date_updated: 2023-09-26T13:31:44Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.7873/DATE.2015.1124
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T10:29:49Z
  date_updated: 2018-03-21T10:29:49Z
  file_id: '1500'
  file_name: 238-plessl15_date.pdf
  file_size: 380552
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T10:29:49Z
has_accepted_license: '1'
language:
- iso: eng
page: 1078-1083
project:
- _id: '1'
  grant_number: '160364472'
  name: SFB 901
- _id: '14'
  grant_number: '160364472'
  name: SFB 901 - Subprojekt C2
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '34'
  grant_number: '610996'
  name: Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous
    System Architectures
publication: Proceedings of the 2015 Conference on Design, Automation and Test in
  Europe (DATE)
publisher: EDA Consortium / IEEE
quality_controlled: '1'
status: public
title: Transparent offloading of computational hotspots from binary code to Xeon Phi
type: conference
user_id: '15278'
year: '2015'
...