---
_id: '74'
author:
- first_name: Christoph
  full_name: Knorr, Christoph
  last_name: Knorr
citation:
  ama: Knorr C. <i>OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten</i>.
    Universität Paderborn; 2017.
  apa: Knorr, C. (2017). <i>OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten</i>.
    Universität Paderborn.
  bibtex: '@book{Knorr_2017, title={OpenCL-basierte Videoverarbeitung auf heterogenen
    Rechenknoten}, publisher={Universität Paderborn}, author={Knorr, Christoph}, year={2017}
    }'
  chicago: Knorr, Christoph. <i>OpenCL-basierte Videoverarbeitung auf heterogenen
    Rechenknoten</i>. Universität Paderborn, 2017.
  ieee: C. Knorr, <i>OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten</i>.
    Universität Paderborn, 2017.
  mla: Knorr, Christoph. <i>OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten</i>.
    Universität Paderborn, 2017.
  short: C. Knorr, OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten,
    Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:05Z
date_updated: 2022-01-06T07:03:36Z
department:
- _id: '78'
language:
- iso: ger
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: Achim
  full_name: Lösch, Achim
  id: '43646'
  last_name: Lösch
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
title: OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '85'
author:
- first_name: Lukas
  full_name: Lohrsträter, Lukas
  last_name: Lohrsträter
citation:
  ama: Lohrsträter L. <i>Literaturüberblick über die Rolle von Business Architecture
    in Enterprise Architecture</i>. Universität Paderborn; 2017.
  apa: Lohrsträter, L. (2017). <i>Literaturüberblick über die Rolle von Business Architecture
    in Enterprise Architecture</i>. Universität Paderborn.
  bibtex: '@book{Lohrsträter_2017, title={Literaturüberblick über die Rolle von Business
    Architecture in Enterprise Architecture}, publisher={Universität Paderborn}, author={Lohrsträter,
    Lukas}, year={2017} }'
  chicago: Lohrsträter, Lukas. <i>Literaturüberblick über die Rolle von Business Architecture
    in Enterprise Architecture</i>. Universität Paderborn, 2017.
  ieee: L. Lohrsträter, <i>Literaturüberblick über die Rolle von Business Architecture
    in Enterprise Architecture</i>. Universität Paderborn, 2017.
  mla: Lohrsträter, Lukas. <i>Literaturüberblick über die Rolle von Business Architecture
    in Enterprise Architecture</i>. Universität Paderborn, 2017.
  short: L. Lohrsträter, Literaturüberblick über die Rolle von Business Architecture
    in Enterprise Architecture, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:08Z
date_updated: 2022-01-06T07:03: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: Literaturüberblick über die Rolle von Business Architecture in Enterprise Architecture
type: bachelorsthesis
user_id: '16205'
year: '2017'
...
---
_id: '87'
abstract:
- lang: eng
  text: Management of complex network services requires flexible and efficient service
    provisioning as well as optimized handling of continuous changes in the workload
    of the service.To adapt to changes in the demand, service components need to be
    replicated (scaling) and allocated to physical resources (placement) dynamically.
    In this paper, we propose a fullyautomated approach to the joint optimization
    problem of scaling and placement, enabling quick reaction to changes. We formalize
    the problem, analyze its complexity, and develop two algorithms to solve it. Extensive
    empirical results show the applicability andeffectiveness of the proposed approach.
author:
- first_name: Sevil
  full_name: Dräxler, Sevil
  id: '31764'
  last_name: Dräxler
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
- first_name: Zoltan Adam
  full_name: Mann, Zoltan Adam
  last_name: Mann
citation:
  ama: 'Dräxler S, Karl H, Mann ZA. Joint Optimization of Scaling and Placement of
    Virtual Network Services. In: <i>Proceedings of the 17th IEEE/ACM International
    Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017)</i>. ; 2017. doi:<a
    href="https://doi.org/10.1109/CCGRID.2017.25">10.1109/CCGRID.2017.25</a>'
  apa: Dräxler, S., Karl, H., &#38; Mann, Z. A. (2017). Joint Optimization of Scaling
    and Placement of Virtual Network Services. In <i>Proceedings of the 17th IEEE/ACM
    International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017)</i>.
    <a href="https://doi.org/10.1109/CCGRID.2017.25">https://doi.org/10.1109/CCGRID.2017.25</a>
  bibtex: '@inproceedings{Dräxler_Karl_Mann_2017, title={Joint Optimization of Scaling
    and Placement of Virtual Network Services}, DOI={<a href="https://doi.org/10.1109/CCGRID.2017.25">10.1109/CCGRID.2017.25</a>},
    booktitle={Proceedings of the 17th IEEE/ACM International Symposium on Cluster,
    Cloud and Grid Computing (CCGrid 2017)}, author={Dräxler, Sevil and Karl, Holger
    and Mann, Zoltan Adam}, year={2017} }'
  chicago: Dräxler, Sevil, Holger Karl, and Zoltan Adam Mann. “Joint Optimization
    of Scaling and Placement of Virtual Network Services.” In <i>Proceedings of the
    17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid
    2017)</i>, 2017. <a href="https://doi.org/10.1109/CCGRID.2017.25">https://doi.org/10.1109/CCGRID.2017.25</a>.
  ieee: S. Dräxler, H. Karl, and Z. A. Mann, “Joint Optimization of Scaling and Placement
    of Virtual Network Services,” in <i>Proceedings of the 17th IEEE/ACM International
    Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017)</i>, 2017.
  mla: Dräxler, Sevil, et al. “Joint Optimization of Scaling and Placement of Virtual
    Network Services.” <i>Proceedings of the 17th IEEE/ACM International Symposium
    on Cluster, Cloud and Grid Computing (CCGrid 2017)</i>, 2017, doi:<a href="https://doi.org/10.1109/CCGRID.2017.25">10.1109/CCGRID.2017.25</a>.
  short: 'S. Dräxler, H. Karl, Z.A. Mann, in: Proceedings of the 17th IEEE/ACM International
    Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017), 2017.'
date_created: 2017-10-17T12:41:08Z
date_updated: 2022-01-06T07:03:59Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/CCGRID.2017.25
file:
- access_level: open_access
  content_type: application/pdf
  creator: sevilmeh
  date_created: 2018-06-25T08:07:43Z
  date_updated: 2018-06-25T08:07:43Z
  file_id: '3324'
  file_name: RIS.pdf
  file_size: 2229109
  relation: main_file
file_date_updated: 2018-06-25T08:07:43Z
has_accepted_license: '1'
oa: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '16'
  name: SFB 901 - Subprojekt C4
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '25'
  call_identifier: 5G PPP Phase 1
  grant_number: '671517'
  name: 'SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized
    Networks'
publication: Proceedings of the 17th IEEE/ACM International Symposium on Cluster,
  Cloud and Grid Computing (CCGrid 2017)
status: public
title: Joint Optimization of Scaling and Placement of Virtual Network Services
type: conference
urn: '873'
user_id: '31764'
year: '2017'
...
---
_id: '88'
author:
- first_name: Advait
  full_name: Ganesh Athreya, Advait
  last_name: Ganesh Athreya
citation:
  ama: Ganesh Athreya A. <i>Instantiating a Predicate Encryption Scheme via Pair Encodings</i>.
    Universität Paderborn; 2017.
  apa: Ganesh Athreya, A. (2017). <i>Instantiating a Predicate Encryption Scheme via
    Pair Encodings</i>. Universität Paderborn.
  bibtex: '@book{Ganesh Athreya_2017, title={Instantiating a Predicate Encryption
    Scheme via Pair Encodings}, publisher={Universität Paderborn}, author={Ganesh
    Athreya, Advait}, year={2017} }'
  chicago: Ganesh Athreya, Advait. <i>Instantiating a Predicate Encryption Scheme
    via Pair Encodings</i>. Universität Paderborn, 2017.
  ieee: A. Ganesh Athreya, <i>Instantiating a Predicate Encryption Scheme via Pair
    Encodings</i>. Universität Paderborn, 2017.
  mla: Ganesh Athreya, Advait. <i>Instantiating a Predicate Encryption Scheme via
    Pair Encodings</i>. Universität Paderborn, 2017.
  short: A. Ganesh Athreya, Instantiating a Predicate Encryption Scheme via Pair Encodings,
    Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:08Z
date_updated: 2022-01-06T07:04:02Z
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: Instantiating a Predicate Encryption Scheme via Pair Encodings
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '96'
author:
- first_name: Markus
  full_name: Warkentin, Markus
  last_name: Warkentin
citation:
  ama: Warkentin M. <i>Geschäftsmodell-Frameworks zur Analyse und Klassifikation bestehender
    Geschäftsmodelle</i>. Universität Paderborn; 2017.
  apa: Warkentin, M. (2017). <i>Geschäftsmodell-Frameworks zur Analyse und Klassifikation
    bestehender Geschäftsmodelle</i>. Universität Paderborn.
  bibtex: '@book{Warkentin_2017, title={Geschäftsmodell-Frameworks zur Analyse und
    Klassifikation bestehender Geschäftsmodelle}, publisher={Universität Paderborn},
    author={Warkentin, Markus}, year={2017} }'
  chicago: Warkentin, Markus. <i>Geschäftsmodell-Frameworks zur Analyse und Klassifikation
    bestehender Geschäftsmodelle</i>. Universität Paderborn, 2017.
  ieee: M. Warkentin, <i>Geschäftsmodell-Frameworks zur Analyse und Klassifikation
    bestehender Geschäftsmodelle</i>. Universität Paderborn, 2017.
  mla: Warkentin, Markus. <i>Geschäftsmodell-Frameworks zur Analyse und Klassifikation
    bestehender Geschäftsmodelle</i>. Universität Paderborn, 2017.
  short: M. Warkentin, Geschäftsmodell-Frameworks zur Analyse und Klassifikation bestehender
    Geschäftsmodelle, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:10Z
date_updated: 2022-01-06T07:04:16Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '17'
  name: SFB 901 - Subproject C5
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Geschäftsmodell-Frameworks zur Analyse und Klassifikation bestehender Geschäftsmodelle
type: bachelorsthesis
user_id: '16205'
year: '2017'
...
---
_id: '981'
abstract:
- lang: eng
  text: "Benchmarking and profiling virtual network functions (VNFs) generates input\r\nknowledge
    for resource management decisions taken by \r\nmanagement and orchestration systems.
    \r\nSuch VNFs are usually not executed in isolation but are often deployed as
    part of a service function chain (SFC) that connects single functions into complex
    \r\nstructures. To manage such chains, isolated performance\r\nprofiles of single
    functions have to be combined to get insights into \r\nthe overall behavior of
    an SFC. This becomes particularly\r\nchallenging in highly agile DevOps environments
    in which profiling\r\nprocesses need to be fully automated and detailed insights
    about a chain's\r\ninternal structures are not always available. \r\n\r\nIn this
    paper, we introduce a\r\nfully automatable, flexible, and platform-agnostic profiling\r\nsystem
    that allows to profile entire SFCs at once. This obviates \r\nmanual modeling
    procedures to combine profiling results from single\r\nVNFs to reflect SFC performance.
    \r\nWe use a case study with different SFC configurations to show that it\r\nis
    hard to model the resulting SFC performance based on single-VNF measurements and
    that\r\nperformance interactions between real, non-trivial functions that are
    deployed in a\r\nchain exist.  "
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. Profile Your Chains, Not Functions. Automated Network Service
    Profiling in DevOps Environments. In: <i>IEEE Conference on Network Function Virtualisation
    and Software Defined Networks (NFV-SDN)</i>. Berlin; 2017. doi:<a href="https://doi.org/10.1109/NFV-SDN.2017.8169826">10.1109/NFV-SDN.2017.8169826</a>'
  apa: Peuster, M., &#38; Karl, H. (2017). Profile Your Chains, Not Functions. Automated
    Network Service Profiling in DevOps Environments. In <i>IEEE Conference on Network
    Function Virtualisation and Software Defined Networks (NFV-SDN)</i>. Berlin. <a
    href="https://doi.org/10.1109/NFV-SDN.2017.8169826">https://doi.org/10.1109/NFV-SDN.2017.8169826</a>
  bibtex: '@inproceedings{Peuster_Karl_2017, place={Berlin}, title={Profile Your Chains,
    Not Functions. Automated Network Service Profiling in DevOps Environments}, DOI={<a
    href="https://doi.org/10.1109/NFV-SDN.2017.8169826">10.1109/NFV-SDN.2017.8169826</a>},
    booktitle={IEEE Conference on Network Function Virtualisation and Software Defined
    Networks (NFV-SDN)}, author={Peuster, Manuel and Karl, Holger}, year={2017} }'
  chicago: Peuster, Manuel, and Holger Karl. “Profile Your Chains, Not Functions.
    Automated Network Service Profiling in DevOps Environments.” In <i>IEEE Conference
    on Network Function Virtualisation and Software Defined Networks (NFV-SDN)</i>.
    Berlin, 2017. <a href="https://doi.org/10.1109/NFV-SDN.2017.8169826">https://doi.org/10.1109/NFV-SDN.2017.8169826</a>.
  ieee: M. Peuster and H. Karl, “Profile Your Chains, Not Functions. Automated Network
    Service Profiling in DevOps Environments,” in <i>IEEE Conference on Network Function
    Virtualisation and Software Defined Networks (NFV-SDN)</i>, Berlin, 2017.
  mla: Peuster, Manuel, and Holger Karl. “Profile Your Chains, Not Functions. Automated
    Network Service Profiling in DevOps Environments.” <i>IEEE Conference on Network
    Function Virtualisation and Software Defined Networks (NFV-SDN)</i>, 2017, doi:<a
    href="https://doi.org/10.1109/NFV-SDN.2017.8169826">10.1109/NFV-SDN.2017.8169826</a>.
  short: 'M. Peuster, H. Karl, in: IEEE Conference on Network Function Virtualisation
    and Software Defined Networks (NFV-SDN), Berlin, 2017.'
conference:
  location: Berlin
  name: IEEE Conference on Network Function Virtualisation and Software Defined Networks
    (NFV-SDN)
date_created: 2017-11-27T10:22:29Z
date_updated: 2022-01-06T07:04:22Z
ddc:
- '004'
department:
- _id: '75'
doi: 10.1109/NFV-SDN.2017.8169826
file:
- access_level: open_access
  content_type: application/pdf
  creator: peuster
  date_created: 2018-07-05T11:14:00Z
  date_updated: 2018-07-05T11:14:00Z
  file_id: '3431'
  file_name: main_ris.pdf
  file_size: 2642306
  relation: main_file
file_date_updated: 2018-07-05T11:14:00Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
place: Berlin
project:
- _id: '25'
  call_identifier: 5G PPP Phase 1
  grant_number: '671517'
  name: 'SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized
    Networks'
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '16'
  name: SFB 901 - Subproject C4
publication: IEEE Conference on Network Function Virtualisation and Software Defined
  Networks (NFV-SDN)
publication_status: published
status: public
title: Profile Your Chains, Not Functions. Automated Network Service Profiling in
  DevOps Environments
type: conference
urn: '9810'
user_id: '13271'
year: '2017'
...
---
_id: '52'
author:
- first_name: Thomas
  full_name: John, Thomas
  id: '3952'
  last_name: John
- first_name: Daniel
  full_name: Szopinski, Daniel
  id: '36372'
  last_name: Szopinski
citation:
  ama: 'John T, Szopinski D. Towards Explaining the Popularity of the Business Model
    Canvas: A Dual-coding Approach. In: <i>1st Business Model Conference</i>. ; 2017.'
  apa: 'John, T., &#38; Szopinski, D. (2017). Towards Explaining the Popularity of
    the Business Model Canvas: A Dual-coding Approach. In <i>1st Business Model Conference</i>.
    Venice, Italy.'
  bibtex: '@inproceedings{John_Szopinski_2017, title={Towards Explaining the Popularity
    of the Business Model Canvas: A Dual-coding Approach}, booktitle={1st Business
    Model Conference}, author={John, Thomas and Szopinski, Daniel}, year={2017} }'
  chicago: 'John, Thomas, and Daniel Szopinski. “Towards Explaining the Popularity
    of the Business Model Canvas: A Dual-Coding Approach.” In <i>1st Business Model
    Conference</i>, 2017.'
  ieee: 'T. John and D. Szopinski, “Towards Explaining the Popularity of the Business
    Model Canvas: A Dual-coding Approach,” in <i>1st Business Model Conference</i>,
    Venice, Italy, 2017.'
  mla: 'John, Thomas, and Daniel Szopinski. “Towards Explaining the Popularity of
    the Business Model Canvas: A Dual-Coding Approach.” <i>1st Business Model Conference</i>,
    2017.'
  short: 'T. John, D. Szopinski, in: 1st Business Model Conference, 2017.'
conference:
  location: Venice, Italy
  name: 1st Business Model Conference
date_created: 2017-10-17T12:41:01Z
date_updated: 2022-01-06T07:01:43Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
  content_type: application/pdf
  creator: dsz
  date_created: 2018-11-12T13:23:53Z
  date_updated: 2018-11-12T13:23:53Z
  file_id: '5504'
  file_name: BuMoCo2017_Memorizing.pdf
  file_size: 675134
  relation: main_file
  success: 1
file_date_updated: 2018-11-12T13:23:53Z
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: 1st Business Model Conference
status: public
title: 'Towards Explaining the Popularity of the Business Model Canvas: A Dual-coding
  Approach'
type: conference_abstract
user_id: '477'
year: '2017'
...
---
_id: '56'
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>1st Business Model Conference</i>. ; 2017.'
  apa: 'John, T. (2017). Supporting Business Model Idea Generation Through Machine-generated
    Ideas: A Design Theory. In <i>1st Business Model Conference</i>. Venice, Italy.'
  bibtex: '@inproceedings{John_2017, title={Supporting Business Model Idea Generation
    Through Machine-generated Ideas: A Design Theory}, booktitle={1st Business Model
    Conference}, author={John, Thomas}, year={2017} }'
  chicago: 'John, Thomas. “Supporting Business Model Idea Generation Through Machine-Generated
    Ideas: A Design Theory.” In <i>1st Business Model Conference</i>, 2017.'
  ieee: 'T. John, “Supporting Business Model Idea Generation Through Machine-generated
    Ideas: A Design Theory,” in <i>1st Business Model Conference</i>, Venice, Italy,
    2017.'
  mla: 'John, Thomas. “Supporting Business Model Idea Generation Through Machine-Generated
    Ideas: A Design Theory.” <i>1st Business Model Conference</i>, 2017.'
  short: 'T. John, in: 1st Business Model Conference, 2017.'
conference:
  location: Venice, Italy
  name: 1st Business Model Conference
date_created: 2017-10-17T12:41:02Z
date_updated: 2022-01-06T07:02:06Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
  content_type: application/pdf
  creator: abursig
  date_created: 2018-12-03T15:37:06Z
  date_updated: 2018-12-03T15:37:06Z
  file_id: '5992'
  file_name: BuMoCo2017_Ideagenerator.pdf
  file_size: 347981
  relation: main_file
  success: 1
file_date_updated: 2018-12-03T15:37:06Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '17'
  name: SFB 901 - Subproject C5
publication: 1st Business Model Conference
status: public
title: 'Supporting Business Model Idea Generation Through Machine-generated Ideas:
  A Design Theory'
type: conference_abstract
user_id: '477'
year: '2017'
...
---
_id: '65'
abstract:
- lang: eng
  text: Heterogeneous compute nodes in form of CPUs with attached GPU and FPGA accelerators
    have strongly gained interested in the last years. Applications differ in their
    execution characteristics and can therefore benefit from such heterogeneous resources
    in terms of performance or energy consumption. While performance optimization
    has been the only goal for a long time, nowadays research is more and more focusing
    on techniques to minimize energy consumption due to rising electricity costs.This
    paper presents reMinMin, a novel static list scheduling approach for optimizing
    the total energy consumption for a set of tasks executed on a heterogeneous compute
    node. reMinMin bases on a new energy model that differentiates between static
    and dynamic energy components and covers effects of accelerator tasks on the host
    CPU. The required energy values are retrieved by measurements on the real computing
    system. In order to evaluate reMinMin, we compare it with two reference implementations
    on three task sets with different degrees of heterogeneity. In our experiments,
    MinMin is consistently better than a scheduler optimizing for dynamic energy only,
    which requires up to 19.43% more energy, and very close to optimal schedules.
author:
- first_name: Achim
  full_name: Lösch, Achim
  id: '43646'
  last_name: Lösch
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
citation:
  ama: 'Lösch A, Platzner M. reMinMin: A Novel Static Energy-Centric List Scheduling
    Approach Based on Real Measurements. In: <i>Proceedings of the 28th Annual IEEE
    International Conference on Application-Specific Systems, Architectures and Processors
    (ASAP)</i>. ; 2017. doi:<a href="https://doi.org/10.1109/ASAP.2017.7995272">10.1109/ASAP.2017.7995272</a>'
  apa: 'Lösch, A., &#38; Platzner, M. (2017). reMinMin: A Novel Static Energy-Centric
    List Scheduling Approach Based on Real Measurements. In <i>Proceedings of the
    28th Annual IEEE International Conference on Application-specific Systems, Architectures
    and Processors (ASAP)</i>. <a href="https://doi.org/10.1109/ASAP.2017.7995272">https://doi.org/10.1109/ASAP.2017.7995272</a>'
  bibtex: '@inproceedings{Lösch_Platzner_2017, title={reMinMin: A Novel Static Energy-Centric
    List Scheduling Approach Based on Real Measurements}, DOI={<a href="https://doi.org/10.1109/ASAP.2017.7995272">10.1109/ASAP.2017.7995272</a>},
    booktitle={Proceedings of the 28th Annual IEEE International Conference on Application-specific
    Systems, Architectures and Processors (ASAP)}, author={Lösch, Achim and Platzner,
    Marco}, year={2017} }'
  chicago: 'Lösch, Achim, and Marco Platzner. “ReMinMin: A Novel Static Energy-Centric
    List Scheduling Approach Based on Real Measurements.” In <i>Proceedings of the
    28th Annual IEEE International Conference on Application-Specific Systems, Architectures
    and Processors (ASAP)</i>, 2017. <a href="https://doi.org/10.1109/ASAP.2017.7995272">https://doi.org/10.1109/ASAP.2017.7995272</a>.'
  ieee: 'A. Lösch and M. Platzner, “reMinMin: A Novel Static Energy-Centric List Scheduling
    Approach Based on Real Measurements,” in <i>Proceedings of the 28th Annual IEEE
    International Conference on Application-specific Systems, Architectures and Processors
    (ASAP)</i>, 2017.'
  mla: 'Lösch, Achim, and Marco Platzner. “ReMinMin: A Novel Static Energy-Centric
    List Scheduling Approach Based on Real Measurements.” <i>Proceedings of the 28th
    Annual IEEE International Conference on Application-Specific Systems, Architectures
    and Processors (ASAP)</i>, 2017, doi:<a href="https://doi.org/10.1109/ASAP.2017.7995272">10.1109/ASAP.2017.7995272</a>.'
  short: 'A. Lösch, M. Platzner, in: Proceedings of the 28th Annual IEEE International
    Conference on Application-Specific Systems, Architectures and Processors (ASAP),
    2017.'
date_created: 2017-10-17T12:41:04Z
date_updated: 2022-01-06T07:03:08Z
ddc:
- '040'
department:
- _id: '78'
doi: 10.1109/ASAP.2017.7995272
file:
- access_level: closed
  content_type: application/pdf
  creator: aloesch
  date_created: 2018-11-14T09:37:55Z
  date_updated: 2018-11-14T09:37:55Z
  file_id: '5550'
  file_name: loesch_asap2017.pdf
  file_size: 467545
  relation: main_file
  success: 1
file_date_updated: 2018-11-14T09:37:55Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '14'
  name: SFB 901 - Subprojekt C2
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 28th Annual IEEE International Conference on Application-specific
  Systems, Architectures and Processors (ASAP)
status: public
title: 'reMinMin: A Novel Static Energy-Centric List Scheduling Approach Based on
  Real Measurements'
type: conference
user_id: '477'
year: '2017'
...
---
_id: '66'
abstract:
- lang: eng
  text: In budget games, players compete over resources with finite budgets. For every
    resource, a player has a specific demand and as a strategy, he chooses a subset
    of resources. If the total demand on a resource does not exceed its budget, the
    utility of each player who chose that resource equals his demand. Otherwise, the
    budget is shared proportionally. In the general case, pure Nash equilibria (NE)
    do not exist for such games. In this paper, we consider the natural classes of
    singleton and matroid budget games with additional constraints and show that for
    each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential
    function to prove that every matroid budget game has an approximate pure NE which
    depends on the largest ratio between the different demands of each individual
    player.
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. Pure Nash Equilibria in Restricted
    Budget Games. In: <i>Proceedings of the 23rd International Computing and Combinatorics
    Conference (COCOON)</i>. LNCS. ; 2017:175--187. doi:<a href="https://doi.org/10.1007/978-3-319-62389-4_15">10.1007/978-3-319-62389-4_15</a>'
  apa: Drees, M., Feldotto, M., Riechers, S., &#38; Skopalik, A. (2017). Pure Nash
    Equilibria in Restricted Budget Games. In <i>Proceedings of the 23rd International
    Computing and Combinatorics Conference (COCOON)</i> (pp. 175--187). <a href="https://doi.org/10.1007/978-3-319-62389-4_15">https://doi.org/10.1007/978-3-319-62389-4_15</a>
  bibtex: '@inproceedings{Drees_Feldotto_Riechers_Skopalik_2017, series={LNCS}, title={Pure
    Nash Equilibria in Restricted Budget Games}, DOI={<a href="https://doi.org/10.1007/978-3-319-62389-4_15">10.1007/978-3-319-62389-4_15</a>},
    booktitle={Proceedings of the 23rd International Computing and Combinatorics Conference
    (COCOON)}, author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören
    and Skopalik, Alexander}, year={2017}, pages={175--187}, collection={LNCS} }'
  chicago: Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik.
    “Pure Nash Equilibria in Restricted Budget Games.” In <i>Proceedings of the 23rd
    International Computing and Combinatorics Conference (COCOON)</i>, 175--187. LNCS,
    2017. <a href="https://doi.org/10.1007/978-3-319-62389-4_15">https://doi.org/10.1007/978-3-319-62389-4_15</a>.
  ieee: M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash Equilibria
    in Restricted Budget Games,” in <i>Proceedings of the 23rd International Computing
    and Combinatorics Conference (COCOON)</i>, 2017, pp. 175--187.
  mla: Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.”
    <i>Proceedings of the 23rd International Computing and Combinatorics Conference
    (COCOON)</i>, 2017, pp. 175--187, doi:<a href="https://doi.org/10.1007/978-3-319-62389-4_15">10.1007/978-3-319-62389-4_15</a>.
  short: 'M. Drees, M. Feldotto, S. Riechers, A. Skopalik, in: Proceedings of the
    23rd International Computing and Combinatorics Conference (COCOON), 2017, pp.
    175--187.'
date_created: 2017-10-17T12:41:04Z
date_updated: 2022-01-06T07:03:13Z
ddc:
- '000'
department:
- _id: '541'
- _id: '63'
doi: 10.1007/978-3-319-62389-4_15
file:
- access_level: closed
  content_type: application/pdf
  creator: feldi
  date_created: 2018-10-31T16:58:42Z
  date_updated: 2018-10-31T16:58:42Z
  file_id: '5228'
  file_name: Drees2017_Chapter_PureNashEquilibriaInRestricted.pdf
  file_size: 346390
  relation: main_file
  success: 1
file_date_updated: 2018-10-31T16:58:42Z
has_accepted_license: '1'
language:
- iso: eng
page: 175--187
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 23rd International Computing and Combinatorics Conference
  (COCOON)
series_title: LNCS
status: public
title: Pure Nash Equilibria in Restricted Budget Games
type: conference
user_id: '14052'
year: '2017'
...
---
_id: '67'
author:
- first_name: Mirko
  full_name: Jürgens, Mirko
  last_name: Jürgens
citation:
  ama: Jürgens M. <i>Provably Secure Key-Derivation-Functions for Certain Types of
    Applications</i>. Universität Paderborn; 2017.
  apa: Jürgens, M. (2017). <i>Provably Secure Key-Derivation-Functions for Certain
    Types of Applications</i>. Universität Paderborn.
  bibtex: '@book{Jürgens_2017, title={Provably Secure Key-Derivation-Functions for
    Certain Types of Applications}, publisher={Universität Paderborn}, author={Jürgens,
    Mirko}, year={2017} }'
  chicago: Jürgens, Mirko. <i>Provably Secure Key-Derivation-Functions for Certain
    Types of Applications</i>. Universität Paderborn, 2017.
  ieee: M. Jürgens, <i>Provably Secure Key-Derivation-Functions for Certain Types
    of Applications</i>. Universität Paderborn, 2017.
  mla: Jürgens, Mirko. <i>Provably Secure Key-Derivation-Functions for Certain Types
    of Applications</i>. Universität Paderborn, 2017.
  short: M. Jürgens, Provably Secure Key-Derivation-Functions for Certain Types of
    Applications, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:04Z
date_updated: 2022-01-06T07:03:15Z
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: Provably Secure Key-Derivation-Functions for Certain Types of Applications
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '104'
author:
- first_name: Denis
  full_name: Diemert, Denis
  last_name: Diemert
citation:
  ama: Diemert D. <i>EAX - An Authenticated Encryption Mode for Block Ciphers</i>.
    Universität Paderborn; 2017.
  apa: Diemert, D. (2017). <i>EAX - An Authenticated Encryption Mode for Block Ciphers</i>.
    Universität Paderborn.
  bibtex: '@book{Diemert_2017, title={EAX - An Authenticated Encryption Mode for Block
    Ciphers}, publisher={Universität Paderborn}, author={Diemert, Denis}, year={2017}
    }'
  chicago: Diemert, Denis. <i>EAX - An Authenticated Encryption Mode for Block Ciphers</i>.
    Universität Paderborn, 2017.
  ieee: D. Diemert, <i>EAX - An Authenticated Encryption Mode for Block Ciphers</i>.
    Universität Paderborn, 2017.
  mla: Diemert, Denis. <i>EAX - An Authenticated Encryption Mode for Block Ciphers</i>.
    Universität Paderborn, 2017.
  short: D. Diemert, EAX - An Authenticated Encryption Mode for Block Ciphers, Universität
    Paderborn, 2017.
date_created: 2017-10-17T12:41:11Z
date_updated: 2022-01-06T06:50:38Z
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: EAX - An Authenticated Encryption Mode for Block Ciphers
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '1049'
author:
- first_name: Björn
  full_name: Beckendorfer, Björn
  last_name: Beckendorfer
citation:
  ama: Beckendorfer B. <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>.
    Universität Paderborn; 2017.
  apa: Beckendorfer, B. (2017). <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>.
    Universität Paderborn.
  bibtex: '@book{Beckendorfer_2017, title={Visualisierung zu Algorithmen verteilter
    Netzwerksysteme}, publisher={Universität Paderborn}, author={Beckendorfer, Björn},
    year={2017} }'
  chicago: Beckendorfer, Björn. <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>.
    Universität Paderborn, 2017.
  ieee: B. Beckendorfer, <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>.
    Universität Paderborn, 2017.
  mla: Beckendorfer, Björn. <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>.
    Universität Paderborn, 2017.
  short: B. Beckendorfer, Visualisierung zu Algorithmen verteilter Netzwerksysteme,
    Universität Paderborn, 2017.
date_created: 2017-12-13T10:17:43Z
date_updated: 2022-01-06T06:50:42Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
title: Visualisierung zu Algorithmen verteilter Netzwerksysteme
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '110'
abstract:
- lang: eng
  text: 'We consider an extension of the dynamic speed scaling scheduling model introduced
    by Yao et al.: A set of jobs, each with a release time, deadline, and workload,
    has to be scheduled on a single, speed-scalable processor. Both the maximum allowed
    speed of the processor and the energy costs may vary continuously over time. The
    objective is to find a feasible schedule that minimizes the total energy costs.
    Theoretical algorithm design for speed scaling problems often tends to discretize
    problems, as our tools in the discrete realm are often better developed or understood.
    Using the above speed scaling variant with variable, continuous maximal processor
    speeds and energy prices as an example, we demonstrate that a more direct approach
    via tools from variational calculus can not only lead to a very concise and elegant
    formulation and analysis, but also avoids the “explosion of variables/constraints”
    that often comes with discretizing. Using well-known tools from calculus of variations,
    we derive combinatorial optimality characteristics for our continuous problem
    and provide a quite concise and simple correctness proof.'
author:
- first_name: Antonios
  full_name: Antoniadis, Antonios
  last_name: Antoniadis
- first_name: Peter
  full_name: Kling, Peter
  last_name: Kling
- first_name: Sebastian
  full_name: Ott, Sebastian
  last_name: Ott
- first_name: Sören
  full_name: Riechers, Sören
  last_name: Riechers
citation:
  ama: 'Antoniadis A, Kling P, Ott S, Riechers S. Continuous Speed Scaling with Variability:
    A Simple and Direct Approach. <i>Theoretical Computer Science</i>. 2017:1-13.
    doi:<a href="https://doi.org/10.1016/j.tcs.2017.03.021">10.1016/j.tcs.2017.03.021</a>'
  apa: 'Antoniadis, A., Kling, P., Ott, S., &#38; Riechers, S. (2017). Continuous
    Speed Scaling with Variability: A Simple and Direct Approach. <i>Theoretical Computer
    Science</i>, 1–13. <a href="https://doi.org/10.1016/j.tcs.2017.03.021">https://doi.org/10.1016/j.tcs.2017.03.021</a>'
  bibtex: '@article{Antoniadis_Kling_Ott_Riechers_2017, title={Continuous Speed Scaling
    with Variability: A Simple and Direct Approach}, DOI={<a href="https://doi.org/10.1016/j.tcs.2017.03.021">10.1016/j.tcs.2017.03.021</a>},
    journal={Theoretical Computer Science}, publisher={Elsevier}, author={Antoniadis,
    Antonios and Kling, Peter and Ott, Sebastian and Riechers, Sören}, year={2017},
    pages={1–13} }'
  chicago: 'Antoniadis, Antonios, Peter Kling, Sebastian Ott, and Sören Riechers.
    “Continuous Speed Scaling with Variability: A Simple and Direct Approach.” <i>Theoretical
    Computer Science</i>, 2017, 1–13. <a href="https://doi.org/10.1016/j.tcs.2017.03.021">https://doi.org/10.1016/j.tcs.2017.03.021</a>.'
  ieee: 'A. Antoniadis, P. Kling, S. Ott, and S. Riechers, “Continuous Speed Scaling
    with Variability: A Simple and Direct Approach,” <i>Theoretical Computer Science</i>,
    pp. 1–13, 2017.'
  mla: 'Antoniadis, Antonios, et al. “Continuous Speed Scaling with Variability: A
    Simple and Direct Approach.” <i>Theoretical Computer Science</i>, Elsevier, 2017,
    pp. 1–13, doi:<a href="https://doi.org/10.1016/j.tcs.2017.03.021">10.1016/j.tcs.2017.03.021</a>.'
  short: A. Antoniadis, P. Kling, S. Ott, S. Riechers, Theoretical Computer Science
    (2017) 1–13.
date_created: 2017-10-17T12:41:13Z
date_updated: 2022-01-06T06:50:55Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1016/j.tcs.2017.03.021
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T13:07:43Z
  date_updated: 2018-03-21T13:07:43Z
  file_id: '1567'
  file_name: 110-TCSSubmission.pdf
  file_size: 494600
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T13:07:43Z
has_accepted_license: '1'
language:
- iso: eng
page: 1-13
project:
- _id: '1'
  name: SFB 901
- _id: '16'
  name: SFB 901 - Subprojekt C4
- _id: '4'
  name: SFB 901 - Project Area C
publication: Theoretical Computer Science
publisher: Elsevier
status: public
title: 'Continuous Speed Scaling with Variability: A Simple and Direct Approach'
type: journal_article
user_id: '477'
year: '2017'
...
---
_id: '117'
author:
- first_name: Pascal
  full_name: Bemmann, Pascal
  id: '32571'
  last_name: Bemmann
citation:
  ama: Bemmann P. <i>Attribute-Based Signatures Using Structure Preserving Signatures</i>.
    Universität Paderborn; 2017.
  apa: Bemmann, P. (2017). <i>Attribute-based Signatures using Structure Preserving
    Signatures</i>. Universität Paderborn.
  bibtex: '@book{Bemmann_2017, title={Attribute-based Signatures using Structure Preserving
    Signatures}, publisher={Universität Paderborn}, author={Bemmann, Pascal}, year={2017}
    }'
  chicago: Bemmann, Pascal. <i>Attribute-Based Signatures Using Structure Preserving
    Signatures</i>. Universität Paderborn, 2017.
  ieee: P. Bemmann, <i>Attribute-based Signatures using Structure Preserving Signatures</i>.
    Universität Paderborn, 2017.
  mla: Bemmann, Pascal. <i>Attribute-Based Signatures Using Structure Preserving Signatures</i>.
    Universität Paderborn, 2017.
  short: P. Bemmann, Attribute-Based Signatures Using Structure Preserving Signatures,
    Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:14Z
date_updated: 2022-01-06T06:51:06Z
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: Attribute-based Signatures using Structure Preserving Signatures
type: mastersthesis
user_id: '25078'
year: '2017'
...
---
_id: '118'
author:
- first_name: Ngoc
  full_name: Chi Banh, Ngoc
  last_name: Chi Banh
citation:
  ama: Chi Banh N. <i>An Asynchronous Adaptation of a Churn-Resistant Overlay Network</i>.
    Universität Paderborn; 2017.
  apa: Chi Banh, N. (2017). <i>An Asynchronous Adaptation of a Churn-resistant Overlay
    Network</i>. Universität Paderborn.
  bibtex: '@book{Chi Banh_2017, title={An Asynchronous Adaptation of a Churn-resistant
    Overlay Network}, publisher={Universität Paderborn}, author={Chi Banh, Ngoc},
    year={2017} }'
  chicago: Chi Banh, Ngoc. <i>An Asynchronous Adaptation of a Churn-Resistant Overlay
    Network</i>. Universität Paderborn, 2017.
  ieee: N. Chi Banh, <i>An Asynchronous Adaptation of a Churn-resistant Overlay Network</i>.
    Universität Paderborn, 2017.
  mla: Chi Banh, Ngoc. <i>An Asynchronous Adaptation of a Churn-Resistant Overlay
    Network</i>. Universität Paderborn, 2017.
  short: N. Chi Banh, An Asynchronous Adaptation of a Churn-Resistant Overlay Network,
    Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:14Z
date_updated: 2022-01-06T06:51:08Z
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: An Asynchronous Adaptation of a Churn-resistant Overlay Network
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '123'
author:
- first_name: Bahar
  full_name: Jazayeri, Bahar
  id: '36399'
  last_name: Jazayeri
- first_name: Olaf
  full_name: Zimmermann, Olaf
  last_name: Zimmermann
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
citation:
  ama: 'Jazayeri B, Zimmermann O, Engels G, Kundisch D. <i>A Variability Model for
    Store-Oriented Software Ecosystems: An Enterprise Perspective (Supplementary Material)</i>.
    Universität Paderborn; 2017.'
  apa: 'Jazayeri, B., Zimmermann, O., Engels, G., &#38; Kundisch, D. (2017). <i>A
    Variability Model for Store-oriented Software Ecosystems: An Enterprise Perspective
    (Supplementary Material)</i>. Universität Paderborn.'
  bibtex: '@book{Jazayeri_Zimmermann_Engels_Kundisch_2017, title={A Variability Model
    for Store-oriented Software Ecosystems: An Enterprise Perspective (Supplementary
    Material)}, publisher={Universität Paderborn}, author={Jazayeri, Bahar and Zimmermann,
    Olaf and Engels, Gregor and Kundisch, Dennis}, year={2017} }'
  chicago: 'Jazayeri, Bahar, Olaf Zimmermann, Gregor Engels, and Dennis Kundisch.
    <i>A Variability Model for Store-Oriented Software Ecosystems: An Enterprise Perspective
    (Supplementary Material)</i>. Universität Paderborn, 2017.'
  ieee: 'B. Jazayeri, O. Zimmermann, G. Engels, and D. Kundisch, <i>A Variability
    Model for Store-oriented Software Ecosystems: An Enterprise Perspective (Supplementary
    Material)</i>. Universität Paderborn, 2017.'
  mla: 'Jazayeri, Bahar, et al. <i>A Variability Model for Store-Oriented Software
    Ecosystems: An Enterprise Perspective (Supplementary Material)</i>. Universität
    Paderborn, 2017.'
  short: 'B. Jazayeri, O. Zimmermann, G. Engels, D. Kundisch, A Variability Model
    for Store-Oriented Software Ecosystems: An Enterprise Perspective (Supplementary
    Material), Universität Paderborn, 2017.'
date_created: 2017-10-17T12:41:15Z
date_updated: 2022-01-06T06:51:18Z
ddc:
- '040'
department:
- _id: '276'
- _id: '66'
file:
- access_level: closed
  content_type: application/pdf
  creator: bahareh
  date_created: 2018-11-12T19:13:39Z
  date_updated: 2018-11-12T19:13:39Z
  file_id: '5535'
  file_name: JZEK17.pdf
  file_size: 835116
  relation: main_file
  success: 1
file_date_updated: 2018-11-12T19:13:39Z
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
publisher: Universität Paderborn
status: public
title: 'A Variability Model for Store-oriented Software Ecosystems: An Enterprise
  Perspective (Supplementary Material)'
type: report
user_id: '477'
year: '2017'
...
---
_id: '124'
abstract:
- lang: eng
  text: Pioneers of today’s software industry like Salesforce and Apple have established
    successful ecosystems around their software platforms. Architectural knowledge
    of the existing ecosystems is implicit and fragmented among online documentation.
    In protection of intellectual property, existing documentation hardly reveals
    influential business strategies that affect the ecosystem structure. Thus, other
    platform providers can hardly learn from the existing ecosystems in order to systematically
    make reasonable design decisions with respect to their business strategies to
    create their own ecosystems. In this paper, we identify a variability model for
    architectural design decisions of a store-oriented software ecosystem product
    line from an enterprise perspective, comprising business, application, and infrastructure
    views. We derive the variability model from fragmentary material of existing ecosystems
    and a rigorous literature review using a research method based on the design science
    paradigm. To show its validity, we describe real-world ecosystems from diverse
    domains using the variability model. This knowledge helps platform providers to
    develop customized ecosystems or to recreate existing designs in a systematic
    way. This, in turn, contributes to an increase in designer and developer productivity.
author:
- first_name: Bahar
  full_name: Jazayeri, Bahar
  id: '36399'
  last_name: Jazayeri
- first_name: Olaf
  full_name: Zimmermann, Olaf
  last_name: Zimmermann
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
citation:
  ama: 'Jazayeri B, Zimmermann O, Engels G, Kundisch D. A Variability Model for Store-oriented
    Software Ecosystems: An Enterprise Perspective. In: <i>Proceedings of the 15th
    International Conference on Service Oriented Computing (ICSOC)</i>. Vol 10601.
    Lecture Notes in Computer Science (LNCS). Málaga, Spain: Springer; 2017. doi:<a
    href="https://doi.org/10.1007/978-3-319-69035-3_42">10.1007/978-3-319-69035-3_42</a>'
  apa: 'Jazayeri, B., Zimmermann, O., Engels, G., &#38; Kundisch, D. (2017). A Variability
    Model for Store-oriented Software Ecosystems: An Enterprise Perspective. In <i>Proceedings
    of the 15th International Conference on Service Oriented Computing (ICSOC)</i>
    (Vol. 10601). Málaga, Spain: Springer. <a href="https://doi.org/10.1007/978-3-319-69035-3_42">https://doi.org/10.1007/978-3-319-69035-3_42</a>'
  bibtex: '@inproceedings{Jazayeri_Zimmermann_Engels_Kundisch_2017, place={Málaga,
    Spain}, series={Lecture Notes in Computer Science (LNCS)}, title={A Variability
    Model for Store-oriented Software Ecosystems: An Enterprise Perspective}, volume={10601},
    DOI={<a href="https://doi.org/10.1007/978-3-319-69035-3_42">10.1007/978-3-319-69035-3_42</a>},
    booktitle={Proceedings of the 15th International Conference on Service Oriented
    Computing (ICSOC)}, publisher={Springer}, author={Jazayeri, Bahar and Zimmermann,
    Olaf and Engels, Gregor and Kundisch, Dennis}, year={2017}, collection={Lecture
    Notes in Computer Science (LNCS)} }'
  chicago: 'Jazayeri, Bahar, Olaf Zimmermann, Gregor Engels, and Dennis Kundisch.
    “A Variability Model for Store-Oriented Software Ecosystems: An Enterprise Perspective.”
    In <i>Proceedings of the 15th International Conference on Service Oriented Computing
    (ICSOC)</i>, Vol. 10601. Lecture Notes in Computer Science (LNCS). Málaga, Spain:
    Springer, 2017. <a href="https://doi.org/10.1007/978-3-319-69035-3_42">https://doi.org/10.1007/978-3-319-69035-3_42</a>.'
  ieee: 'B. Jazayeri, O. Zimmermann, G. Engels, and D. Kundisch, “A Variability Model
    for Store-oriented Software Ecosystems: An Enterprise Perspective,” in <i>Proceedings
    of the 15th International Conference on Service Oriented Computing (ICSOC)</i>,
    2017, vol. 10601.'
  mla: 'Jazayeri, Bahar, et al. “A Variability Model for Store-Oriented Software Ecosystems:
    An Enterprise Perspective.” <i>Proceedings of the 15th International Conference
    on Service Oriented Computing (ICSOC)</i>, vol. 10601, Springer, 2017, doi:<a
    href="https://doi.org/10.1007/978-3-319-69035-3_42">10.1007/978-3-319-69035-3_42</a>.'
  short: 'B. Jazayeri, O. Zimmermann, G. Engels, D. Kundisch, in: Proceedings of the
    15th International Conference on Service Oriented Computing (ICSOC), Springer,
    Málaga, Spain, 2017.'
date_created: 2017-10-17T12:41:15Z
date_updated: 2022-01-06T06:51:18Z
ddc:
- '040'
department:
- _id: '66'
- _id: '276'
doi: 10.1007/978-3-319-69035-3_42
file:
- access_level: closed
  content_type: application/pdf
  creator: bahareh
  date_created: 2018-11-12T18:55:55Z
  date_updated: 2018-11-12T18:55:55Z
  file_id: '5532'
  file_name: Jaz_ICSOC17.pdf
  file_size: 566612
  relation: main_file
  success: 1
file_date_updated: 2018-11-12T18:55:55Z
has_accepted_license: '1'
intvolume: '     10601'
language:
- iso: eng
place: Málaga, Spain
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 15th International Conference on Service Oriented
  Computing (ICSOC)
publisher: Springer
series_title: Lecture Notes in Computer Science (LNCS)
status: public
title: 'A Variability Model for Store-oriented Software Ecosystems: An Enterprise
  Perspective'
type: conference
user_id: '16205'
volume: 10601
year: '2017'
...
---
_id: '101'
author:
- first_name: Lennart
  full_name: Rehmer, Lennart
  last_name: Rehmer
citation:
  ama: Rehmer L. <i>Erweiterung eines kontextsensitiven Autovervollständigungstools
    zur natürlichsprachlichen Softwarespezifikation</i>. Universität Paderborn; 2017.
  apa: Rehmer, L. (2017). <i>Erweiterung eines kontextsensitiven Autovervollständigungstools
    zur natürlichsprachlichen Softwarespezifikation</i>. Universität Paderborn.
  bibtex: '@book{Rehmer_2017, title={Erweiterung eines kontextsensitiven Autovervollständigungstools
    zur natürlichsprachlichen Softwarespezifikation}, publisher={Universität Paderborn},
    author={Rehmer, Lennart}, year={2017} }'
  chicago: Rehmer, Lennart. <i>Erweiterung eines kontextsensitiven Autovervollständigungstools
    zur natürlichsprachlichen Softwarespezifikation</i>. Universität Paderborn, 2017.
  ieee: L. Rehmer, <i>Erweiterung eines kontextsensitiven Autovervollständigungstools
    zur natürlichsprachlichen Softwarespezifikation</i>. Universität Paderborn, 2017.
  mla: Rehmer, Lennart. <i>Erweiterung eines kontextsensitiven Autovervollständigungstools
    zur natürlichsprachlichen Softwarespezifikation</i>. Universität Paderborn, 2017.
  short: L. Rehmer, Erweiterung eines kontextsensitiven Autovervollständigungstools
    zur natürlichsprachlichen Softwarespezifikation, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:11Z
date_updated: 2022-01-06T06:50:29Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '17'
  name: SFB 901 - Subproject C5
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '9'
  name: SFB 901 - Subproject B1
publisher: Universität Paderborn
status: public
title: Erweiterung eines kontextsensitiven Autovervollständigungstools zur natürlichsprachlichen
  Softwarespezifikation
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '18'
abstract:
- lang: eng
  text: "Branch and bound (B&B) algorithms structure the search space as a tree and
    eliminate infeasible solutions early by pruning subtrees that cannot lead to a
    valid or optimal solution. Custom hardware designs significantly accelerate the
    execution of these algorithms. In this article, we demonstrate a high-performance
    B&B implementation on FPGAs. First, we identify general elements of B&B algorithms
    and describe their implementation as a finite state machine. Then, we introduce
    workers that autonomously cooperate using work stealing to allow parallel execution
    and full utilization of the target FPGA. Finally, we explore advantages of instance-specific
    designs that target a specific problem instance to improve performance.\r\n\r\nWe
    evaluate our concepts by applying them to a branch and bound problem, the reconstruction
    of corrupted AES keys obtained from cold-boot attacks. The evaluation shows that
    our work stealing approach is scalable with the available resources and provides
    speedups proportional to the number of workers. Instance-specific designs allow
    us to achieve an overall speedup of 47 × compared to the fastest implementation
    of AES key reconstruction so far. Finally, we demonstrate how instance-specific
    designs can be generated just-in-time such that the provided speedups outweigh
    the additional time required for design synthesis."
author:
- first_name: Heinrich
  full_name: Riebler, Heinrich
  id: '8961'
  last_name: Riebler
- first_name: Michael
  full_name: Lass, Michael
  id: '24135'
  last_name: Lass
  orcid: 0000-0002-5708-7632
- first_name: Robert
  full_name: Mittendorf, Robert
  last_name: Mittendorf
- first_name: Thomas
  full_name: Löcke, Thomas
  last_name: Löcke
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
citation:
  ama: Riebler H, Lass M, Mittendorf R, Löcke T, Plessl C. Efficient Branch and Bound
    on FPGAs Using Work Stealing and Instance-Specific Designs. <i>ACM Transactions
    on Reconfigurable Technology and Systems (TRETS)</i>. 2017;10(3):24:1-24:23. doi:<a
    href="https://doi.org/10.1145/3053687">10.1145/3053687</a>
  apa: Riebler, H., Lass, M., Mittendorf, R., Löcke, T., &#38; Plessl, C. (2017).
    Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific
    Designs. <i>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</i>,
    <i>10</i>(3), 24:1-24:23. <a href="https://doi.org/10.1145/3053687">https://doi.org/10.1145/3053687</a>
  bibtex: '@article{Riebler_Lass_Mittendorf_Löcke_Plessl_2017, title={Efficient Branch
    and Bound on FPGAs Using Work Stealing and Instance-Specific Designs}, volume={10},
    DOI={<a href="https://doi.org/10.1145/3053687">10.1145/3053687</a>}, number={3},
    journal={ACM Transactions on Reconfigurable Technology and Systems (TRETS)}, publisher={Association
    for Computing Machinery (ACM)}, author={Riebler, Heinrich and Lass, Michael and
    Mittendorf, Robert and Löcke, Thomas and Plessl, Christian}, year={2017}, pages={24:1-24:23}
    }'
  chicago: 'Riebler, Heinrich, Michael Lass, Robert Mittendorf, Thomas Löcke, and
    Christian Plessl. “Efficient Branch and Bound on FPGAs Using Work Stealing and
    Instance-Specific Designs.” <i>ACM Transactions on Reconfigurable Technology and
    Systems (TRETS)</i> 10, no. 3 (2017): 24:1-24:23. <a href="https://doi.org/10.1145/3053687">https://doi.org/10.1145/3053687</a>.'
  ieee: 'H. Riebler, M. Lass, R. Mittendorf, T. Löcke, and C. Plessl, “Efficient Branch
    and Bound on FPGAs Using Work Stealing and Instance-Specific Designs,” <i>ACM
    Transactions on Reconfigurable Technology and Systems (TRETS)</i>, vol. 10, no.
    3, p. 24:1-24:23, 2017, doi: <a href="https://doi.org/10.1145/3053687">10.1145/3053687</a>.'
  mla: Riebler, Heinrich, et al. “Efficient Branch and Bound on FPGAs Using Work Stealing
    and Instance-Specific Designs.” <i>ACM Transactions on Reconfigurable Technology
    and Systems (TRETS)</i>, vol. 10, no. 3, Association for Computing Machinery (ACM),
    2017, p. 24:1-24:23, doi:<a href="https://doi.org/10.1145/3053687">10.1145/3053687</a>.
  short: H. Riebler, M. Lass, R. Mittendorf, T. Löcke, C. Plessl, ACM Transactions
    on Reconfigurable Technology and Systems (TRETS) 10 (2017) 24:1-24:23.
date_created: 2017-07-25T14:17:32Z
date_updated: 2023-09-26T13:23:58Z
ddc:
- '000'
department:
- _id: '27'
- _id: '518'
doi: 10.1145/3053687
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T16:04:14Z
  date_updated: 2018-11-02T16:04:14Z
  file_id: '5322'
  file_name: a24-riebler.pdf
  file_size: 2131617
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T16:04:14Z
has_accepted_license: '1'
intvolume: '        10'
issue: '3'
keyword:
- coldboot
language:
- iso: eng
page: 24:1-24:23
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
- _id: '52'
  name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: ACM Transactions on Reconfigurable Technology and Systems (TRETS)
publication_identifier:
  issn:
  - 1936-7406
publication_status: published
publisher: Association for Computing Machinery (ACM)
quality_controlled: '1'
status: public
title: Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific
  Designs
type: journal_article
user_id: '15278'
volume: 10
year: '2017'
...