---
_id: '129'
author:
- first_name: Alexander
  full_name: Schmidt, Alexander
  last_name: Schmidt
citation:
  ama: Schmidt A. <i>Wie entsteht Kreativität? Ein Überblick über vergleichende Studien
    zu verschiedenen Formen des Brainstormings</i>. Universität Paderborn; 2016.
  apa: Schmidt, A. (2016). <i>Wie entsteht Kreativität? Ein Überblick über vergleichende
    Studien zu verschiedenen Formen des Brainstormings</i>. Universität Paderborn.
  bibtex: '@book{Schmidt_2016, title={Wie entsteht Kreativität? Ein Überblick über
    vergleichende Studien zu verschiedenen Formen des Brainstormings}, publisher={Universität
    Paderborn}, author={Schmidt, Alexander}, year={2016} }'
  chicago: Schmidt, Alexander. <i>Wie entsteht Kreativität? Ein Überblick über vergleichende
    Studien zu verschiedenen Formen des Brainstormings</i>. Universität Paderborn,
    2016.
  ieee: A. Schmidt, <i>Wie entsteht Kreativität? Ein Überblick über vergleichende
    Studien zu verschiedenen Formen des Brainstormings</i>. Universität Paderborn,
    2016.
  mla: Schmidt, Alexander. <i>Wie entsteht Kreativität? Ein Überblick über vergleichende
    Studien zu verschiedenen Formen des Brainstormings</i>. Universität Paderborn,
    2016.
  short: A. Schmidt, Wie entsteht Kreativität? Ein Überblick über vergleichende Studien
    zu verschiedenen Formen des Brainstormings, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:16Z
date_updated: 2022-01-06T06:51:24Z
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: Wie entsteht Kreativität? Ein Überblick über vergleichende Studien zu verschiedenen
  Formen des Brainstormings
type: bachelorsthesis
user_id: '16205'
year: '2016'
...
---
_id: '153'
author:
- first_name: Jürgen
  full_name: König, Jürgen
  last_name: König
citation:
  ama: König J. <i>Shared Resource Scheduling with Interconnected Services</i>. Universität
    Paderborn; 2016.
  apa: König, J. (2016). <i>Shared Resource Scheduling with Interconnected Services</i>.
    Universität Paderborn.
  bibtex: '@book{König_2016, title={Shared Resource Scheduling with Interconnected
    Services}, publisher={Universität Paderborn}, author={König, Jürgen}, year={2016}
    }'
  chicago: König, Jürgen. <i>Shared Resource Scheduling with Interconnected Services</i>.
    Universität Paderborn, 2016.
  ieee: J. König, <i>Shared Resource Scheduling with Interconnected Services</i>.
    Universität Paderborn, 2016.
  mla: König, Jürgen. <i>Shared Resource Scheduling with Interconnected Services</i>.
    Universität Paderborn, 2016.
  short: J. König, Shared Resource Scheduling with Interconnected Services, Universität
    Paderborn, 2016.
date_created: 2017-10-17T12:41:21Z
date_updated: 2022-01-06T06:52:20Z
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '16'
  name: SFB 901 - Subproject C4
publisher: Universität Paderborn
status: public
title: Shared Resource Scheduling with Interconnected Services
type: mastersthesis
user_id: '15504'
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: '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: '148'
abstract:
- lang: eng
  text: 'Successful business model innovation is impossible without innovative business
    model ideas. When generating such ideas, humans make use of two properties of
    the human cognitive system: First, their ability to build up knowledge (i.e.,
    raw material for new ideas), and second, their ability to flexibly recombine that
    knowledge. While these properties enable humans to generate innovative ideas,
    the amounts of knowledge and cognitive flexibility that humans can possess are
    limited, which in turn limits human idea generation capability. With business
    model idea generators, a new class of information systems is proposed that can
    contribute to alleviating the limits that constrain human idea generation. The
    ideas that such idea generators produce can complement human business model ideas,
    thereby increase the probability for high-quality ideas, and eventually raise
    the odds of successful business model innovation. The contribution is a design
    theory that describes the architecture of the proposed idea generators.'
author:
- first_name: Thomas
  full_name: John, Thomas
  id: '3952'
  last_name: John
citation:
  ama: 'John T. Supporting Business Model Idea Generation Through Machine-generated
    Ideas: A Design Theory. In: <i>Proceedings of the 37th International Conference
    on Information Systems (ICIS), Dublin, Ireland</i>. ; 2016.'
  apa: 'John, T. (2016). Supporting Business Model Idea Generation Through Machine-generated
    Ideas: A Design Theory. In <i>Proceedings of the 37th International Conference
    on Information Systems (ICIS), Dublin, Ireland</i>. Dublin, Ireland.'
  bibtex: '@inproceedings{John_2016, title={Supporting Business Model Idea Generation
    Through Machine-generated Ideas: A Design Theory}, booktitle={Proceedings of the
    37th International Conference on Information Systems (ICIS), Dublin, Ireland},
    author={John, Thomas}, year={2016} }'
  chicago: 'John, Thomas. “Supporting Business Model Idea Generation Through Machine-Generated
    Ideas: A Design Theory.” In <i>Proceedings of the 37th International Conference
    on Information Systems (ICIS), Dublin, Ireland</i>, 2016.'
  ieee: 'T. John, “Supporting Business Model Idea Generation Through Machine-generated
    Ideas: A Design Theory,” in <i>Proceedings of the 37th International Conference
    on Information Systems (ICIS), Dublin, Ireland</i>, Dublin, Ireland, 2016.'
  mla: 'John, Thomas. “Supporting Business Model Idea Generation Through Machine-Generated
    Ideas: A Design Theory.” <i>Proceedings of the 37th International Conference on
    Information Systems (ICIS), Dublin, Ireland</i>, 2016.'
  short: 'T. John, in: Proceedings of the 37th International Conference on Information
    Systems (ICIS), Dublin, Ireland, 2016.'
conference:
  location: Dublin, Ireland
  name: 37th International Conference on Information Systems (ICIS)
date_created: 2017-10-17T12:41:20Z
date_updated: 2022-01-06T06:52:06Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
  content_type: application/pdf
  creator: abursig
  date_created: 2018-12-03T15:29:08Z
  date_updated: 2018-12-03T15:29:08Z
  file_id: '5991'
  file_name: Supporting Business Model Idea Generation Through Machine-generat.pdf
  file_size: 1626458
  relation: main_file
  success: 1
file_date_updated: 2018-12-03T15:29:08Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: http://aisel.aisnet.org/icis2016/DigitalInnovation/Presentations/5/
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 37th International Conference on Information Systems
  (ICIS), Dublin, Ireland
status: public
title: 'Supporting Business Model Idea Generation Through Machine-generated Ideas:
  A Design Theory'
type: conference
user_id: '16205'
year: '2016'
...
---
_id: '151'
author:
- first_name: Jan
  full_name: Berhörster, Jan
  last_name: Berhörster
citation:
  ama: 'Berhörster J. <i>Software-gestützte Entwicklung von Geschäftsmodellideen:
    Theoretische Grundlagen und prototypische Implementierung</i>. Universität Paderborn;
    2016.'
  apa: 'Berhörster, J. (2016). <i>Software-gestützte Entwicklung von Geschäftsmodellideen:
    Theoretische Grundlagen und prototypische Implementierung</i>. Universität Paderborn.'
  bibtex: '@book{Berhörster_2016, title={Software-gestützte Entwicklung von Geschäftsmodellideen:
    Theoretische Grundlagen und prototypische Implementierung}, publisher={Universität
    Paderborn}, author={Berhörster, Jan}, year={2016} }'
  chicago: 'Berhörster, Jan. <i>Software-gestützte Entwicklung von Geschäftsmodellideen:
    Theoretische Grundlagen und prototypische Implementierung</i>. Universität Paderborn,
    2016.'
  ieee: 'J. Berhörster, <i>Software-gestützte Entwicklung von Geschäftsmodellideen:
    Theoretische Grundlagen und prototypische Implementierung</i>. Universität Paderborn,
    2016.'
  mla: 'Berhörster, Jan. <i>Software-gestützte Entwicklung von Geschäftsmodellideen:
    Theoretische Grundlagen und prototypische Implementierung</i>. Universität Paderborn,
    2016.'
  short: 'J. Berhörster, Software-gestützte Entwicklung von Geschäftsmodellideen:
    Theoretische Grundlagen und prototypische Implementierung, Universität Paderborn,
    2016.'
date_created: 2017-10-17T12:41:21Z
date_updated: 2022-01-06T06:52:15Z
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: 'Software-gestützte Entwicklung von Geschäftsmodellideen: Theoretische Grundlagen
  und prototypische Implementierung'
type: mastersthesis
user_id: '16205'
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: '161'
author:
- first_name: Tobias
  full_name: Kenter, Tobias
  id: '3145'
  last_name: Kenter
citation:
  ama: Kenter T. <i>Reconfigurable Accelerators in the World of General-Purpose Computing</i>.
    Universität Paderborn; 2016.
  apa: Kenter, T. (2016). <i>Reconfigurable Accelerators in the World of General-Purpose
    Computing</i>. Universität Paderborn.
  bibtex: '@book{Kenter_2016, title={Reconfigurable Accelerators in the World of General-Purpose
    Computing}, publisher={Universität Paderborn}, author={Kenter, Tobias}, year={2016}
    }'
  chicago: Kenter, Tobias. <i>Reconfigurable Accelerators in the World of General-Purpose
    Computing</i>. Universität Paderborn, 2016.
  ieee: T. Kenter, <i>Reconfigurable Accelerators in the World of General-Purpose
    Computing</i>. Universität Paderborn, 2016.
  mla: Kenter, Tobias. <i>Reconfigurable Accelerators in the World of General-Purpose
    Computing</i>. Universität Paderborn, 2016.
  short: T. Kenter, Reconfigurable Accelerators in the World of General-Purpose Computing,
    Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:23Z
date_updated: 2022-01-06T06:52:43Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T12:46:48Z
  date_updated: 2018-03-21T12:46:48Z
  file_id: '1545'
  file_name: 161kenter16_diss_submission_print_16-08-26.pdf
  file_size: 5039555
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T12:46:48Z
has_accepted_license: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '14'
  name: SFB 901 - Subprojekt C2
- _id: '4'
  name: SFB 901 - Project Area C
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: Reconfigurable Accelerators in the World of General-Purpose Computing
type: dissertation
user_id: '3145'
year: '2016'
...
---
_id: '163'
citation:
  ama: Dressler F, Meyer auf der Heide F, eds. <i>Proceedings of the 17th ACM International
    Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)</i>. ACM; 2016.
    doi:<a href="https://doi.org/10.1145/2942358">10.1145/2942358</a>
  apa: 'Dressler, F., &#38; Meyer auf der Heide, F. (Eds.). (2016). <i>Proceedings
    of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing
    (MobiHoc)</i>. Presented at the MobiHoc, Paderborn, Germany: ACM. <a href="https://doi.org/10.1145/2942358">https://doi.org/10.1145/2942358</a>'
  bibtex: '@book{Dressler_Meyer auf der Heide_2016, title={Proceedings of the 17th
    ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)},
    DOI={<a href="https://doi.org/10.1145/2942358">10.1145/2942358</a>}, publisher={ACM},
    year={2016} }'
  chicago: Dressler, Falko, and Friedhelm Meyer auf der Heide, eds. <i>Proceedings
    of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing
    (MobiHoc)</i>. ACM, 2016. <a href="https://doi.org/10.1145/2942358">https://doi.org/10.1145/2942358</a>.
  ieee: F. Dressler and F. Meyer auf der Heide, Eds., <i>Proceedings of the 17th ACM
    International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)</i>.
    ACM, 2016.
  mla: Dressler, Falko, and Friedhelm Meyer auf der Heide, editors. <i>Proceedings
    of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing
    (MobiHoc)</i>. ACM, 2016, doi:<a href="https://doi.org/10.1145/2942358">10.1145/2942358</a>.
  short: F. Dressler, F. Meyer auf der Heide, eds., Proceedings of the 17th ACM International
    Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), ACM, 2016.
conference:
  end_date: 2016-07-08
  location: Paderborn, Germany
  name: MobiHoc
  start_date: 2016-07-04
date_created: 2017-10-17T12:41:23Z
date_updated: 2022-01-06T06:52:48Z
department:
- _id: '63'
doi: 10.1145/2942358
editor:
- first_name: Falko
  full_name: Dressler, Falko
  last_name: Dressler
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
project:
- _id: '1'
  name: SFB 901
- _id: '16'
  name: SFB 901 - Subprojekt C4
- _id: '4'
  name: SFB 901 - Project Area C
publisher: ACM
status: public
title: Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking
  and Computing (MobiHoc)
type: conference_editor
user_id: '15504'
year: '2016'
...
---
_id: '139'
abstract:
- lang: eng
  text: 'We consider online optimization problems in which certain goods have to be
    acquired in order to provide a service or infrastructure. Classically, decisions
    for such problems are considered as final: one buys the goods. However, in many
    real world applications, there is a shift away from the idea of buying goods.
    Instead, leasing is often a more flexible and lucrative business model. Research
    has realized this shift and recently initiated the theoretical study of leasing
    models (Anthony and Gupta in Proceedings of the integer programming and combinatorial
    optimization: 12th International IPCO Conference, Ithaca, NY, USA, June 25–27,
    2007; Meyerson in Proceedings of the 46th Annual IEEE Symposium on Foundations
    of Computer Science (FOCS 2005), 23–25 Oct 2005, Pittsburgh, PA, USA, 2005; Nagarajan
    and Williamson in Discret Optim 10(4):361–370, 2013) We extend this line of work
    and suggest a more systematic study of leasing aspects for a class of online optimization
    problems. We provide two major technical results. We introduce the leasing variant
    of online set multicover and give an O(log(mK)logn)-competitive algorithm (with
    n, m, and K being the number of elements, sets, and leases, respectively). Our
    results also imply improvements for the non-leasing variant of online set cover.
    Moreover, we extend results for the leasing variant of online facility location.
    Nagarajan and Williamson (Discret Optim 10(4):361–370, 2013) gave an O(Klogn)-competitive
    algorithm for this problem (with n and K being the number of clients and leases,
    respectively). We remove the dependency on n (and, thereby, on time). In general,
    this leads to a bound of O(lmaxloglmax) (with the maximal lease length lmax).
    For many natural problem instances, the bound improves to O(K2).'
author:
- first_name: Sebastian
  full_name: Abshoff, Sebastian
  last_name: Abshoff
- first_name: Peter
  full_name: Kling, Peter
  last_name: Kling
- 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: 'Peter '
  full_name: 'Pietrzyk, Peter '
  last_name: Pietrzyk
citation:
  ama: Abshoff S, Kling P, Markarian C, Meyer auf der Heide F, Pietrzyk P. Towards
    the price of leasing online. <i>Journal of Combinatorial Optimization</i>. 2016;(4):1197--1216.
    doi:<a href="https://doi.org/10.1007/s10878-015-9915-5">10.1007/s10878-015-9915-5</a>
  apa: Abshoff, S., Kling, P., Markarian, C., Meyer auf der Heide, F., &#38; Pietrzyk,
    P. (2016). Towards the price of leasing online. <i>Journal of Combinatorial Optimization</i>,
    (4), 1197--1216. <a href="https://doi.org/10.1007/s10878-015-9915-5">https://doi.org/10.1007/s10878-015-9915-5</a>
  bibtex: '@article{Abshoff_Kling_Markarian_Meyer auf der Heide_Pietrzyk_2016, title={Towards
    the price of leasing online}, DOI={<a href="https://doi.org/10.1007/s10878-015-9915-5">10.1007/s10878-015-9915-5</a>},
    number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer},
    author={Abshoff, Sebastian and Kling, Peter and Markarian, Christine and Meyer
    auf der Heide, Friedhelm and Pietrzyk, Peter }, year={2016}, pages={1197--1216}
    }'
  chicago: 'Abshoff, Sebastian, Peter Kling, Christine Markarian, Friedhelm Meyer
    auf der Heide, and Peter  Pietrzyk. “Towards the Price of Leasing Online.” <i>Journal
    of Combinatorial Optimization</i>, no. 4 (2016): 1197--1216. <a href="https://doi.org/10.1007/s10878-015-9915-5">https://doi.org/10.1007/s10878-015-9915-5</a>.'
  ieee: S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, and P. Pietrzyk,
    “Towards the price of leasing online,” <i>Journal of Combinatorial Optimization</i>,
    no. 4, pp. 1197--1216, 2016.
  mla: Abshoff, Sebastian, et al. “Towards the Price of Leasing Online.” <i>Journal
    of Combinatorial Optimization</i>, no. 4, Springer, 2016, pp. 1197--1216, doi:<a
    href="https://doi.org/10.1007/s10878-015-9915-5">10.1007/s10878-015-9915-5</a>.
  short: S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, P. Pietrzyk,
    Journal of Combinatorial Optimization (2016) 1197--1216.
date_created: 2017-10-17T12:41:18Z
date_updated: 2022-01-06T06:51:46Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/s10878-015-9915-5
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T15:57:25Z
  date_updated: 2018-11-02T15:57:25Z
  file_id: '5318'
  file_name: Abshoff-TowardsThePriceOfLeasingOnline.pdf
  file_size: 654903
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T15:57:25Z
has_accepted_license: '1'
issue: '4'
language:
- iso: eng
page: ' 1197--1216'
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '16'
  name: SFB 901 - Subprojekt C4
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '4'
  name: SFB 901 - Project Area C
publication: Journal of Combinatorial Optimization
publisher: Springer
status: public
title: Towards the price of leasing online
type: journal_article
user_id: '477'
year: '2016'
...
---
_id: '10136'
author:
- first_name: Martina
  full_name: Eikel, Martina
  last_name: Eikel
citation:
  ama: Eikel M. <i>Insider-Resistent Distributed Storage Systems</i>. Universität
    Paderborn; 2016.
  apa: Eikel, M. (2016). <i>Insider-resistent Distributed Storage Systems</i>. Universität
    Paderborn.
  bibtex: '@book{Eikel_2016, title={Insider-resistent Distributed Storage Systems},
    publisher={Universität Paderborn}, author={Eikel, Martina}, year={2016} }'
  chicago: Eikel, Martina. <i>Insider-Resistent Distributed Storage Systems</i>. Universität
    Paderborn, 2016.
  ieee: M. Eikel, <i>Insider-resistent Distributed Storage Systems</i>. Universität
    Paderborn, 2016.
  mla: Eikel, Martina. <i>Insider-Resistent Distributed Storage Systems</i>. Universität
    Paderborn, 2016.
  short: M. Eikel, Insider-Resistent Distributed Storage Systems, Universität Paderborn,
    2016.
date_created: 2019-06-07T06:37:37Z
date_updated: 2022-01-06T06:50:30Z
ddc:
- '000'
department:
- _id: '79'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2019-06-07T06:39:13Z
  date_updated: 2019-06-07T06:39:13Z
  file_id: '10137'
  file_name: DissertationEikel.pdf
  file_size: 1605187
  relation: main_file
  success: 1
file_date_updated: 2019-06-07T06:39:13Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _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: Insider-resistent Distributed Storage Systems
type: dissertation
user_id: '477'
year: '2016'
...
---
_id: '10292'
author:
- first_name: Thomas
  full_name: John, Thomas
  id: '3952'
  last_name: John
citation:
  ama: John T. <i>Business Model Modeling Languages as Tools for Innovation:  Theory
    and Empirical Evidence</i>. Universität Paderborn; 2016. doi:<a href="https://doi.org/10.17619/UNIPB/1-259
    ">10.17619/UNIPB/1-259 </a>
  apa: John, T. (2016). <i>Business Model Modeling Languages as Tools for Innovation: 
    Theory and Empirical Evidence</i>. Universität Paderborn. <a href="https://doi.org/10.17619/UNIPB/1-259
    ">https://doi.org/10.17619/UNIPB/1-259 </a>
  bibtex: '@book{John_2016, place={Universität Paderborn}, title={Business Model Modeling
    Languages as Tools for Innovation:  Theory and Empirical Evidence}, DOI={<a href="https://doi.org/10.17619/UNIPB/1-259
    ">10.17619/UNIPB/1-259 </a>}, author={John, Thomas}, year={2016} }'
  chicago: John, Thomas. <i>Business Model Modeling Languages as Tools for Innovation: 
    Theory and Empirical Evidence</i>. Universität Paderborn, 2016. <a href="https://doi.org/10.17619/UNIPB/1-259
    ">https://doi.org/10.17619/UNIPB/1-259 </a>.
  ieee: T. John, <i>Business Model Modeling Languages as Tools for Innovation:  Theory
    and Empirical Evidence</i>. Universität Paderborn, 2016.
  mla: John, Thomas. <i>Business Model Modeling Languages as Tools for Innovation: 
    Theory and Empirical Evidence</i>. 2016, doi:<a href="https://doi.org/10.17619/UNIPB/1-259
    ">10.17619/UNIPB/1-259 </a>.
  short: T. John, Business Model Modeling Languages as Tools for Innovation:  Theory
    and Empirical Evidence, Universität Paderborn, 2016.
date_created: 2019-06-25T09:50:01Z
date_updated: 2022-01-06T06:50:35Z
department:
- _id: '276'
doi: '10.17619/UNIPB/1-259 '
language:
- iso: eng
place: Universität Paderborn
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '17'
  name: SFB 901 - Subproject C5
status: public
supervisor:
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
title: 'Business Model Modeling Languages as Tools for Innovation:  Theory and Empirical
  Evidence'
type: dissertation
user_id: '477'
year: '2016'
...
---
_id: '135'
author:
- first_name: Sebastian
  full_name: Strotmeyer, Sebastian
  last_name: Strotmeyer
- 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: 'Strotmeyer S, John T, Kundisch D. Vergleichende Betrachtung von Software-Werkzeugen
    zur Geschäftsmodellentwicklung. In: <i>Multikonferenz Wirtschaftsinformatik (MKWI)</i>.
    ; 2016.'
  apa: Strotmeyer, S., John, T., &#38; Kundisch, D. (2016). Vergleichende Betrachtung
    von Software-Werkzeugen zur Geschäftsmodellentwicklung. In <i>Multikonferenz Wirtschaftsinformatik
    (MKWI)</i>. Ilmenau, Germany.
  bibtex: '@inproceedings{Strotmeyer_John_Kundisch_2016, title={Vergleichende Betrachtung
    von Software-Werkzeugen zur Geschäftsmodellentwicklung}, booktitle={Multikonferenz
    Wirtschaftsinformatik (MKWI)}, author={Strotmeyer, Sebastian and John, Thomas
    and Kundisch, Dennis}, year={2016} }'
  chicago: Strotmeyer, Sebastian, Thomas John, and Dennis Kundisch. “Vergleichende
    Betrachtung von Software-Werkzeugen Zur Geschäftsmodellentwicklung.” In <i>Multikonferenz
    Wirtschaftsinformatik (MKWI)</i>, 2016.
  ieee: S. Strotmeyer, T. John, and D. Kundisch, “Vergleichende Betrachtung von Software-Werkzeugen
    zur Geschäftsmodellentwicklung,” in <i>Multikonferenz Wirtschaftsinformatik (MKWI)</i>,
    Ilmenau, Germany, 2016.
  mla: Strotmeyer, Sebastian, et al. “Vergleichende Betrachtung von Software-Werkzeugen
    Zur Geschäftsmodellentwicklung.” <i>Multikonferenz Wirtschaftsinformatik (MKWI)</i>,
    2016.
  short: 'S. Strotmeyer, T. John, D. Kundisch, in: Multikonferenz Wirtschaftsinformatik
    (MKWI), 2016.'
conference:
  location: Ilmenau, Germany
  name: Multikonferenz Wirtschaftsinformatik (MKWI)
date_created: 2017-10-17T12:41:17Z
date_updated: 2022-01-06T06:51:37Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
  content_type: application/pdf
  creator: abursig
  date_created: 2018-11-14T12:46:37Z
  date_updated: 2018-11-14T12:46:37Z
  file_id: '5608'
  file_name: MKWI2016_BMDT.PDF
  file_size: 657458
  relation: main_file
  success: 1
file_date_updated: 2018-11-14T12:46:37Z
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: Multikonferenz Wirtschaftsinformatik (MKWI)
status: public
title: Vergleichende Betrachtung von Software-Werkzeugen zur Geschäftsmodellentwicklung
type: conference_abstract
user_id: '477'
year: '2016'
...
---
_id: '137'
abstract:
- lang: eng
  text: Wikidata is the new, large-scale knowledge base of the Wikimedia Foundation.
    Its knowledge is increasingly used within Wikipedia itself and various other kinds
    of information systems, imposing high demands on its integrity.Wikidata can be
    edited by anyone and, unfortunately, it frequently gets vandalized, exposing all
    information systems using it to the risk of spreading vandalized and falsified
    information. In this paper, we present a new machine learning-based approach to
    detect vandalism in Wikidata.We propose a set of 47 features that exploit both
    content and context information, and we report on 4 classifiers of increasing
    effectiveness tailored to this learning task. Our approach is evaluated on the
    recently published Wikidata Vandalism Corpus WDVC-2015 and it achieves an area
    under curve value of the receiver operating characteristic, ROC-AUC, of 0.991.
    It significantly outperforms the state of the art represented by the rule-based
    Wikidata Abuse Filter (0.865 ROC-AUC) and a prototypical vandalism detector recently
    introduced by Wikimedia within the Objective Revision Evaluation Service (0.859
    ROC-AUC).
author:
- first_name: Stefan
  full_name: Heindorf, Stefan
  id: '11871'
  last_name: Heindorf
  orcid: 0000-0002-4525-6865
- first_name: Matthias
  full_name: Potthast, Matthias
  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. Vandalism Detection in Wikidata.
    In: <i>Proceedings of the 25th International Conference on Information and Knowledge
    Management (CIKM 2016)</i>. ; 2016:327--336. doi:<a href="https://doi.org/10.1145/2983323.2983740">10.1145/2983323.2983740</a>'
  apa: Heindorf, S., Potthast, M., Stein, B., &#38; Engels, G. (2016). Vandalism Detection
    in Wikidata. <i>Proceedings of the 25th International Conference on Information
    and Knowledge Management (CIKM 2016)</i>, 327--336. <a href="https://doi.org/10.1145/2983323.2983740">https://doi.org/10.1145/2983323.2983740</a>
  bibtex: '@inproceedings{Heindorf_Potthast_Stein_Engels_2016, title={Vandalism Detection
    in Wikidata}, DOI={<a href="https://doi.org/10.1145/2983323.2983740">10.1145/2983323.2983740</a>},
    booktitle={Proceedings of the 25th International Conference on Information and
    Knowledge Management (CIKM 2016)}, author={Heindorf, Stefan and Potthast, Matthias
    and Stein, Benno and Engels, Gregor}, year={2016}, pages={327--336} }'
  chicago: Heindorf, Stefan, Matthias Potthast, Benno Stein, and Gregor Engels. “Vandalism
    Detection in Wikidata.” In <i>Proceedings of the 25th International Conference
    on Information and Knowledge Management (CIKM 2016)</i>, 327--336, 2016. <a href="https://doi.org/10.1145/2983323.2983740">https://doi.org/10.1145/2983323.2983740</a>.
  ieee: 'S. Heindorf, M. Potthast, B. Stein, and G. Engels, “Vandalism Detection in
    Wikidata,” in <i>Proceedings of the 25th International Conference on Information
    and Knowledge Management (CIKM 2016)</i>, 2016, pp. 327--336, doi: <a href="https://doi.org/10.1145/2983323.2983740">10.1145/2983323.2983740</a>.'
  mla: Heindorf, Stefan, et al. “Vandalism Detection in Wikidata.” <i>Proceedings
    of the 25th International Conference on Information and Knowledge Management (CIKM
    2016)</i>, 2016, pp. 327--336, doi:<a href="https://doi.org/10.1145/2983323.2983740">10.1145/2983323.2983740</a>.
  short: 'S. Heindorf, M. Potthast, B. Stein, G. Engels, in: Proceedings of the 25th
    International Conference on Information and Knowledge Management (CIKM 2016),
    2016, pp. 327--336.'
date_created: 2017-10-17T12:41:18Z
date_updated: 2022-10-17T11:31:41Z
ddc:
- '040'
department:
- _id: '66'
doi: 10.1145/2983323.2983740
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T13:01:43Z
  date_updated: 2018-03-21T13:01:43Z
  file_id: '1561'
  file_name: 137-p327-heindorf.pdf
  file_size: 1842753
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T13:01:43Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://groups.uni-paderborn.de/fg-engels/publications_pdfs/Konferenzbeitraege/heindorf2016_CIKM.pdf
oa: '1'
page: 327--336
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 25th International Conference on Information and Knowledge
  Management (CIKM 2016)
status: public
title: Vandalism Detection in Wikidata
type: conference
user_id: '11871'
year: '2016'
...
---
_id: '31'
author:
- 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
- first_name: Ettore M. G.
  full_name: Trainiti, Ettore M. G.
  last_name: Trainiti
- first_name: Gianluca C.
  full_name: Durelli, Gianluca C.
  last_name: Durelli
- first_name: Cristiana
  full_name: Bolchini, Cristiana
  last_name: Bolchini
citation:
  ama: 'Riebler H, Vaz GF, Plessl C, Trainiti EMG, Durelli GC, Bolchini C. Using Just-in-Time
    Code Generation for Transparent Resource Management in Heterogeneous Systems.
    In: <i>Proc. HiPEAC Workshop on Reonfigurable Computing (WRC)</i>. ; 2016.'
  apa: Riebler, H., Vaz, G. F., Plessl, C., Trainiti, E. M. G., Durelli, G. C., &#38;
    Bolchini, C. (2016). Using Just-in-Time Code Generation for Transparent Resource
    Management in Heterogeneous Systems. <i>Proc. HiPEAC Workshop on Reonfigurable
    Computing (WRC)</i>.
  bibtex: '@inproceedings{Riebler_Vaz_Plessl_Trainiti_Durelli_Bolchini_2016, title={Using
    Just-in-Time Code Generation for Transparent Resource Management in Heterogeneous
    Systems}, booktitle={Proc. HiPEAC Workshop on Reonfigurable Computing (WRC)},
    author={Riebler, Heinrich and Vaz, Gavin Francis and Plessl, Christian and Trainiti,
    Ettore M. G. and Durelli, Gianluca C. and Bolchini, Cristiana}, year={2016} }'
  chicago: Riebler, Heinrich, Gavin Francis Vaz, Christian Plessl, Ettore M. G. Trainiti,
    Gianluca C. Durelli, and Cristiana Bolchini. “Using Just-in-Time Code Generation
    for Transparent Resource Management in Heterogeneous Systems.” In <i>Proc. HiPEAC
    Workshop on Reonfigurable Computing (WRC)</i>, 2016.
  ieee: H. Riebler, G. F. Vaz, C. Plessl, E. M. G. Trainiti, G. C. Durelli, and C.
    Bolchini, “Using Just-in-Time Code Generation for Transparent Resource Management
    in Heterogeneous Systems,” 2016.
  mla: Riebler, Heinrich, et al. “Using Just-in-Time Code Generation for Transparent
    Resource Management in Heterogeneous Systems.” <i>Proc. HiPEAC Workshop on Reonfigurable
    Computing (WRC)</i>, 2016.
  short: 'H. Riebler, G.F. Vaz, C. Plessl, E.M.G. Trainiti, G.C. Durelli, C. Bolchini,
    in: Proc. HiPEAC Workshop on Reonfigurable Computing (WRC), 2016.'
date_created: 2017-07-26T15:16:31Z
date_updated: 2023-09-26T13:25:59Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
file:
- access_level: closed
  content_type: application/pdf
  creator: deffel
  date_created: 2019-01-11T11:56:55Z
  date_updated: 2019-01-11T11:56:55Z
  file_id: '6626'
  file_name: wrc_upb_polimi_final.pdf
  file_size: 394563
  relation: main_file
  success: 1
file_date_updated: 2019-01-11T11:56:55Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  grant_number: '160364472'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '14'
  grant_number: '160364472'
  name: SFB 901 - Subproject C2
- _id: '34'
  grant_number: '610996'
  name: Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous
    System Architectures
publication: Proc. HiPEAC Workshop on Reonfigurable Computing (WRC)
quality_controlled: '1'
status: public
title: Using Just-in-Time Code Generation for Transparent Resource Management in Heterogeneous
  Systems
type: conference
user_id: '15278'
year: '2016'
...
---
_id: '24'
author:
- first_name: Tobias
  full_name: Kenter, Tobias
  id: '3145'
  last_name: Kenter
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
citation:
  ama: 'Kenter T, Plessl C. Microdisk Cavity FDTD Simulation on FPGA using OpenCL.
    In: <i>Proc. Workshop on Heterogeneous High-Performance Reconfigurable Computing
    (H2RC)</i>. ; 2016.'
  apa: Kenter, T., &#38; Plessl, C. (2016). Microdisk Cavity FDTD Simulation on FPGA
    using OpenCL. <i>Proc. Workshop on Heterogeneous High-Performance Reconfigurable
    Computing (H2RC)</i>.
  bibtex: '@inproceedings{Kenter_Plessl_2016, title={Microdisk Cavity FDTD Simulation
    on FPGA using OpenCL}, booktitle={Proc. Workshop on Heterogeneous High-performance
    Reconfigurable Computing (H2RC)}, author={Kenter, Tobias and Plessl, Christian},
    year={2016} }'
  chicago: Kenter, Tobias, and Christian Plessl. “Microdisk Cavity FDTD Simulation
    on FPGA Using OpenCL.” In <i>Proc. Workshop on Heterogeneous High-Performance
    Reconfigurable Computing (H2RC)</i>, 2016.
  ieee: T. Kenter and C. Plessl, “Microdisk Cavity FDTD Simulation on FPGA using OpenCL,”
    2016.
  mla: Kenter, Tobias, and Christian Plessl. “Microdisk Cavity FDTD Simulation on
    FPGA Using OpenCL.” <i>Proc. Workshop on Heterogeneous High-Performance Reconfigurable
    Computing (H2RC)</i>, 2016.
  short: 'T. Kenter, C. Plessl, in: Proc. Workshop on Heterogeneous High-Performance
    Reconfigurable Computing (H2RC), 2016.'
date_created: 2017-07-26T15:00:43Z
date_updated: 2023-09-26T13:26:17Z
ddc:
- '004'
department:
- _id: '27'
- _id: '518'
file:
- access_level: closed
  content_type: application/pdf
  creator: kenter
  date_created: 2018-11-14T12:38:45Z
  date_updated: 2018-11-14T12:38:45Z
  file_id: '5602'
  file_name: paper_26.pdf
  file_size: 129552
  relation: main_file
  success: 1
file_date_updated: 2018-11-14T12:38:45Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '32'
  grant_number: PL 595/2-1 / 320898746
  name: Performance and Efficiency in HPC with Custom Computing
- _id: '1'
  grant_number: '160364472'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '14'
  grant_number: '160364472'
  name: SFB 901 - Subproject C2
publication: Proc. Workshop on Heterogeneous High-performance Reconfigurable Computing
  (H2RC)
quality_controlled: '1'
status: public
title: Microdisk Cavity FDTD Simulation on FPGA using OpenCL
type: conference
user_id: '15278'
year: '2016'
...
---
_id: '138'
abstract:
- lang: eng
  text: Hardware accelerators are becoming popular in academia and industry. To move
    one step further from the state-of-the-art multicore plus accelerator approaches,
    we present in this paper our innovative SAVEHSA architecture. It comprises of
    a heterogeneous hardware platform with three different high-end accelerators attached
    over PCIe (GPGPU, FPGA and Intel MIC). Such systems can process parallel workloads
    very efficiently whilst being more energy efficient than regular CPU systems.
    To leverage the heterogeneity, the workload has to be distributed among the computing
    units in a way that each unit is well-suited for the assigned task and executable
    code must be available. To tackle this problem we present two software components;
    the first can perform resource allocation at runtime while respecting system and
    application goals (in terms of throughput, energy, latency, etc.) and the second
    is able to analyze an application and generate executable code for an accelerator
    at runtime. We demonstrate the first proof-of-concept implementation of our framework
    on the heterogeneous platform, discuss different runtime policies and measure
    the introduced overheads.
author:
- 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
- first_name: 'Ettore M. G. '
  full_name: 'Trainiti, Ettore M. G. '
  last_name: Trainiti
- first_name: Gianluca C.
  full_name: Durelli, Gianluca C.
  last_name: Durelli
- first_name: Emanuele
  full_name: Del Sozzo, Emanuele
  last_name: Del Sozzo
- first_name: 'Marco D. '
  full_name: 'Santambrogio, Marco D. '
  last_name: Santambrogio
- first_name: Christina
  full_name: Bolchini, Christina
  last_name: Bolchini
citation:
  ama: 'Riebler H, Vaz GF, Plessl C, et al. Using Just-in-Time Code Generation for
    Transparent Resource Management in Heterogeneous Systems. In: <i>Proceedings of
    International Forum on Research and Technologies for Society and Industry (RTSI)</i>.
    IEEE; 2016:1-5. doi:<a href="https://doi.org/10.1109/RTSI.2016.7740545">10.1109/RTSI.2016.7740545</a>'
  apa: Riebler, H., Vaz, G. F., Plessl, C., Trainiti, E. M. G., Durelli, G. C., Del
    Sozzo, E., Santambrogio, M. D., &#38; Bolchini, C. (2016). Using Just-in-Time
    Code Generation for Transparent Resource Management in Heterogeneous Systems.
    <i>Proceedings of International Forum on Research and Technologies for Society
    and Industry (RTSI)</i>, 1–5. <a href="https://doi.org/10.1109/RTSI.2016.7740545">https://doi.org/10.1109/RTSI.2016.7740545</a>
  bibtex: '@inproceedings{Riebler_Vaz_Plessl_Trainiti_Durelli_Del Sozzo_Santambrogio_Bolchini_2016,
    title={Using Just-in-Time Code Generation for Transparent Resource Management
    in Heterogeneous Systems}, DOI={<a href="https://doi.org/10.1109/RTSI.2016.7740545">10.1109/RTSI.2016.7740545</a>},
    booktitle={Proceedings of International Forum on Research and Technologies for
    Society and Industry (RTSI)}, publisher={IEEE}, author={Riebler, Heinrich and
    Vaz, Gavin Francis and Plessl, Christian and Trainiti, Ettore M. G.  and Durelli,
    Gianluca C. and Del Sozzo, Emanuele and Santambrogio, Marco D.  and Bolchini,
    Christina}, year={2016}, pages={1–5} }'
  chicago: Riebler, Heinrich, Gavin Francis Vaz, Christian Plessl, Ettore M. G.  Trainiti,
    Gianluca C. Durelli, Emanuele Del Sozzo, Marco D.  Santambrogio, and Christina
    Bolchini. “Using Just-in-Time Code Generation for Transparent Resource Management
    in Heterogeneous Systems.” In <i>Proceedings of International Forum on Research
    and Technologies for Society and Industry (RTSI)</i>, 1–5. IEEE, 2016. <a href="https://doi.org/10.1109/RTSI.2016.7740545">https://doi.org/10.1109/RTSI.2016.7740545</a>.
  ieee: 'H. Riebler <i>et al.</i>, “Using Just-in-Time Code Generation for Transparent
    Resource Management in Heterogeneous Systems,” in <i>Proceedings of International
    Forum on Research and Technologies for Society and Industry (RTSI)</i>, 2016,
    pp. 1–5, doi: <a href="https://doi.org/10.1109/RTSI.2016.7740545">10.1109/RTSI.2016.7740545</a>.'
  mla: Riebler, Heinrich, et al. “Using Just-in-Time Code Generation for Transparent
    Resource Management in Heterogeneous Systems.” <i>Proceedings of International
    Forum on Research and Technologies for Society and Industry (RTSI)</i>, IEEE,
    2016, pp. 1–5, doi:<a href="https://doi.org/10.1109/RTSI.2016.7740545">10.1109/RTSI.2016.7740545</a>.
  short: 'H. Riebler, G.F. Vaz, C. Plessl, E.M.G. Trainiti, G.C. Durelli, E. Del Sozzo,
    M.D. Santambrogio, C. Bolchini, in: Proceedings of International Forum on Research
    and Technologies for Society and Industry (RTSI), IEEE, 2016, pp. 1–5.'
date_created: 2017-10-17T12:41:18Z
date_updated: 2023-09-26T13:28:11Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
doi: 10.1109/RTSI.2016.7740545
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T13:01:09Z
  date_updated: 2018-03-21T13:01:09Z
  file_id: '1560'
  file_name: 138-07740545.pdf
  file_size: 184334
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T13:01:09Z
has_accepted_license: '1'
language:
- iso: eng
page: 1-5
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 International Forum on Research and Technologies for Society
  and Industry (RTSI)
publisher: IEEE
quality_controlled: '1'
status: public
title: Using Just-in-Time Code Generation for Transparent Resource Management in Heterogeneous
  Systems
type: conference
user_id: '15278'
year: '2016'
...
---
_id: '156'
abstract:
- lang: eng
  text: Many modern compute nodes are heterogeneous multi-cores that integrate several
    CPU cores with fixed function or reconfigurable hardware cores. Such systems need
    to adapt task scheduling and mapping to optimise for performance and energy under
    varying workloads and, increasingly important, for thermal and fault management
    and are thus relevant targets for self-aware computing. In this chapter, we take
    up the generic reference architecture for designing self-aware and self-expressive
    computing systems and refine it for heterogeneous multi-cores. We present ReconOS,
    an architecture, programming model and execution environment for heterogeneous
    multi-cores, and show how the components of the reference architecture can be
    implemented on top of ReconOS. In particular, the unique feature of dynamic partial
    reconfiguration supports self-expression through starting and terminating reconfigurable
    hardware cores. We detail a case study that runs two applications on an architecture
    with one CPU and 12 reconfigurable hardware cores and present self-expression
    strategies for adapting under performance, temperature and even conflicting constraints.
    The case study demonstrates that the reference architecture as a model for self-aware
    computing is highly useful as it allows us to structure and simplify the design
    process, which will be essential for designing complex future compute nodes. Furthermore,
    ReconOS is used as a base technology for flexible protocol stacks in Chapter 10,
    an approach for self-aware computing at the networking level.
author:
- first_name: Andreas
  full_name: Agne, Andreas
  last_name: Agne
- first_name: Markus
  full_name: Happe, Markus
  last_name: Happe
- first_name: Achim
  full_name: Lösch, Achim
  id: '43646'
  last_name: Lösch
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
citation:
  ama: 'Agne A, Happe M, Lösch A, Plessl C, Platzner M. Self-aware Compute Nodes.
    In: <i>Self-Aware Computing Systems</i>. Natural Computing Series (NCS). Springer
    International Publishing; 2016:145-165. doi:<a href="https://doi.org/10.1007/978-3-319-39675-0_8">10.1007/978-3-319-39675-0_8</a>'
  apa: Agne, A., Happe, M., Lösch, A., Plessl, C., &#38; Platzner, M. (2016). Self-aware
    Compute Nodes. In <i>Self-aware Computing Systems</i> (pp. 145–165). Springer
    International Publishing. <a href="https://doi.org/10.1007/978-3-319-39675-0_8">https://doi.org/10.1007/978-3-319-39675-0_8</a>
  bibtex: '@inbook{Agne_Happe_Lösch_Plessl_Platzner_2016, place={Cham}, series={Natural
    Computing Series (NCS)}, title={Self-aware Compute Nodes}, DOI={<a href="https://doi.org/10.1007/978-3-319-39675-0_8">10.1007/978-3-319-39675-0_8</a>},
    booktitle={Self-aware Computing Systems}, publisher={Springer International Publishing},
    author={Agne, Andreas and Happe, Markus and Lösch, Achim and Plessl, Christian
    and Platzner, Marco}, year={2016}, pages={145–165}, collection={Natural Computing
    Series (NCS)} }'
  chicago: 'Agne, Andreas, Markus Happe, Achim Lösch, Christian Plessl, and Marco
    Platzner. “Self-Aware Compute Nodes.” In <i>Self-Aware Computing Systems</i>,
    145–65. Natural Computing Series (NCS). Cham: Springer International Publishing,
    2016. <a href="https://doi.org/10.1007/978-3-319-39675-0_8">https://doi.org/10.1007/978-3-319-39675-0_8</a>.'
  ieee: 'A. Agne, M. Happe, A. Lösch, C. Plessl, and M. Platzner, “Self-aware Compute
    Nodes,” in <i>Self-aware Computing Systems</i>, Cham: Springer International Publishing,
    2016, pp. 145–165.'
  mla: Agne, Andreas, et al. “Self-Aware Compute Nodes.” <i>Self-Aware Computing Systems</i>,
    Springer International Publishing, 2016, pp. 145–65, doi:<a href="https://doi.org/10.1007/978-3-319-39675-0_8">10.1007/978-3-319-39675-0_8</a>.
  short: 'A. Agne, M. Happe, A. Lösch, C. Plessl, M. Platzner, in: Self-Aware Computing
    Systems, Springer International Publishing, Cham, 2016, pp. 145–165.'
date_created: 2017-10-17T12:41:22Z
date_updated: 2023-09-26T13:27:44Z
ddc:
- '040'
department:
- _id: '518'
- _id: '27'
- _id: '78'
doi: 10.1007/978-3-319-39675-0_8
file:
- access_level: closed
  content_type: application/pdf
  creator: aloesch
  date_created: 2018-11-14T13:20:32Z
  date_updated: 2018-11-14T13:20:32Z
  file_id: '5613'
  file_name: chapter8.pdf
  file_size: 833054
  relation: main_file
  success: 1
file_date_updated: 2018-11-14T13:20:32Z
has_accepted_license: '1'
language:
- iso: eng
page: 145-165
place: Cham
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: '31'
  grant_number: '257906'
  name: Engineering Proprioception in Computing Systems
publication: Self-aware Computing Systems
publisher: Springer International Publishing
quality_controlled: '1'
series_title: Natural Computing Series (NCS)
status: public
title: Self-aware Compute Nodes
type: book_chapter
user_id: '15278'
year: '2016'
...
---
_id: '165'
abstract:
- lang: eng
  text: A broad spectrum of applications can be accelerated by offloading computation
    intensive parts to reconfigurable hardware. However, to achieve speedups, the
    number of loop it- erations (trip count) needs to be sufficiently large to amortize
    offloading overheads. Trip counts are frequently not known at compile time, but
    only at runtime just before entering a loop. Therefore, we propose to generate
    code for both the CPU and the coprocessor, and defer the offloading decision to
    the application runtime. We demonstrate how a toolflow, based on the LLVM compiler
    framework, can automatically embed dynamic offloading de- cisions into the application
    code. We perform in-depth static and dynamic analysis of pop- ular benchmarks,
    which confirm the general potential of such an approach. We also pro- pose to
    optimize the offloading process by decoupling the runtime decision from the loop
    execution (decision slack). The feasibility of our approach is demonstrated by
    a toolflow that automatically identifies suitable data-parallel loops and generates
    code for the FPGA coprocessor of a Convey HC-1. We evaluate the integrated toolflow
    with representative loops executed for different input data sizes.
author:
- first_name: Gavin Francis
  full_name: Vaz, Gavin Francis
  id: '30332'
  last_name: Vaz
- first_name: Heinrich
  full_name: Riebler, Heinrich
  id: '8961'
  last_name: Riebler
- first_name: Tobias
  full_name: Kenter, Tobias
  id: '3145'
  last_name: Kenter
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
citation:
  ama: Vaz GF, Riebler H, Kenter T, Plessl C. Potential and Methods for Embedding
    Dynamic Offloading Decisions into Application Code. <i>Computers and Electrical
    Engineering</i>. 2016;55:91-111. doi:<a href="https://doi.org/10.1016/j.compeleceng.2016.04.021">10.1016/j.compeleceng.2016.04.021</a>
  apa: Vaz, G. F., Riebler, H., Kenter, T., &#38; Plessl, C. (2016). Potential and
    Methods for Embedding Dynamic Offloading Decisions into Application Code. <i>Computers
    and Electrical Engineering</i>, <i>55</i>, 91–111. <a href="https://doi.org/10.1016/j.compeleceng.2016.04.021">https://doi.org/10.1016/j.compeleceng.2016.04.021</a>
  bibtex: '@article{Vaz_Riebler_Kenter_Plessl_2016, title={Potential and Methods for
    Embedding Dynamic Offloading Decisions into Application Code}, volume={55}, DOI={<a
    href="https://doi.org/10.1016/j.compeleceng.2016.04.021">10.1016/j.compeleceng.2016.04.021</a>},
    journal={Computers and Electrical Engineering}, publisher={Elsevier}, author={Vaz,
    Gavin Francis and Riebler, Heinrich and Kenter, Tobias and Plessl, Christian},
    year={2016}, pages={91–111} }'
  chicago: 'Vaz, Gavin Francis, Heinrich Riebler, Tobias Kenter, and Christian Plessl.
    “Potential and Methods for Embedding Dynamic Offloading Decisions into Application
    Code.” <i>Computers and Electrical Engineering</i> 55 (2016): 91–111. <a href="https://doi.org/10.1016/j.compeleceng.2016.04.021">https://doi.org/10.1016/j.compeleceng.2016.04.021</a>.'
  ieee: 'G. F. Vaz, H. Riebler, T. Kenter, and C. Plessl, “Potential and Methods for
    Embedding Dynamic Offloading Decisions into Application Code,” <i>Computers and
    Electrical Engineering</i>, vol. 55, pp. 91–111, 2016, doi: <a href="https://doi.org/10.1016/j.compeleceng.2016.04.021">10.1016/j.compeleceng.2016.04.021</a>.'
  mla: Vaz, Gavin Francis, et al. “Potential and Methods for Embedding Dynamic Offloading
    Decisions into Application Code.” <i>Computers and Electrical Engineering</i>,
    vol. 55, Elsevier, 2016, pp. 91–111, doi:<a href="https://doi.org/10.1016/j.compeleceng.2016.04.021">10.1016/j.compeleceng.2016.04.021</a>.
  short: G.F. Vaz, H. Riebler, T. Kenter, C. Plessl, Computers and Electrical Engineering
    55 (2016) 91–111.
date_created: 2017-10-17T12:41:24Z
date_updated: 2023-09-26T13:26:38Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
doi: 10.1016/j.compeleceng.2016.04.021
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T12:45:47Z
  date_updated: 2018-03-21T12:45:47Z
  file_id: '1544'
  file_name: 165-1-s2.0-S0045790616301021-main.pdf
  file_size: 3037854
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T12:45:47Z
has_accepted_license: '1'
intvolume: '        55'
language:
- iso: eng
page: 91-111
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: Computers and Electrical Engineering
publication_identifier:
  issn:
  - 0045-7906
publisher: Elsevier
quality_controlled: '1'
status: public
title: Potential and Methods for Embedding Dynamic Offloading Decisions into Application
  Code
type: journal_article
user_id: '15278'
volume: 55
year: '2016'
...
