---
_id: '5968'
author:
- first_name: N
  full_name: N, N
  last_name: N
citation:
  ama: N N. <i>Wie Werden Elektronische Verhandlungen Durch Präferenzen Beeinflusst?</i>
    Universität Paderborn; 2018.
  apa: N, N. (2018). <i>Wie werden elektronische Verhandlungen durch Präferenzen beeinflusst?</i>
    Universität Paderborn.
  bibtex: '@book{N_2018, title={Wie werden elektronische Verhandlungen durch Präferenzen
    beeinflusst?}, publisher={Universität Paderborn}, author={N, N}, year={2018} }'
  chicago: N, N. <i>Wie Werden Elektronische Verhandlungen Durch Präferenzen Beeinflusst?</i>
    Universität Paderborn, 2018.
  ieee: N. N, <i>Wie werden elektronische Verhandlungen durch Präferenzen beeinflusst?</i>
    Universität Paderborn, 2018.
  mla: N, N. <i>Wie Werden Elektronische Verhandlungen Durch Präferenzen Beeinflusst?</i>
    Universität Paderborn, 2018.
  short: N. N, Wie Werden Elektronische Verhandlungen Durch Präferenzen Beeinflusst?,
    Universität Paderborn, 2018.
date_created: 2018-11-28T12:08:43Z
date_updated: 2022-11-30T14:20:16Z
department:
- _id: '205'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: Wie werden elektronische Verhandlungen durch Präferenzen beeinflusst?
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '5966'
author:
- first_name: N
  full_name: N, N
  last_name: N
citation:
  ama: N N. <i>Bitcoins disruptives Potenzial im elektronischem Zahlungsverkehr</i>.
    Universität Paderborn; 2018.
  apa: N, N. (2018). <i>Bitcoins disruptives Potenzial im elektronischem Zahlungsverkehr</i>.
    Universität Paderborn.
  bibtex: '@book{N_2018, title={Bitcoins disruptives Potenzial im elektronischem Zahlungsverkehr},
    publisher={Universität Paderborn}, author={N, N}, year={2018} }'
  chicago: N, N. <i>Bitcoins disruptives Potenzial im elektronischem Zahlungsverkehr</i>.
    Universität Paderborn, 2018.
  ieee: N. N, <i>Bitcoins disruptives Potenzial im elektronischem Zahlungsverkehr</i>.
    Universität Paderborn, 2018.
  mla: N, N. <i>Bitcoins disruptives Potenzial im elektronischem Zahlungsverkehr</i>.
    Universität Paderborn, 2018.
  short: N. N, Bitcoins disruptives Potenzial im elektronischem Zahlungsverkehr, Universität
    Paderborn, 2018.
date_created: 2018-11-28T12:05:53Z
date_updated: 2022-11-30T14:19:43Z
department:
- _id: '205'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: Bitcoins disruptives Potenzial im elektronischem Zahlungsverkehr
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '5969'
author:
- first_name: N
  full_name: N, N
  last_name: N
citation:
  ama: N N. <i>Diskriminierung in sozialen Netzwerken durch Versionierung</i>. Universität
    Paderborn; 2018.
  apa: N, N. (2018). <i>Diskriminierung in sozialen Netzwerken durch Versionierung</i>.
    Universität Paderborn.
  bibtex: '@book{N_2018, title={Diskriminierung in sozialen Netzwerken durch Versionierung},
    publisher={Universität Paderborn}, author={N, N}, year={2018} }'
  chicago: N, N. <i>Diskriminierung in sozialen Netzwerken durch Versionierung</i>.
    Universität Paderborn, 2018.
  ieee: N. N, <i>Diskriminierung in sozialen Netzwerken durch Versionierung</i>. Universität
    Paderborn, 2018.
  mla: N, N. <i>Diskriminierung in sozialen Netzwerken durch Versionierung</i>. Universität
    Paderborn, 2018.
  short: N. N, Diskriminierung in sozialen Netzwerken durch Versionierung, Universität
    Paderborn, 2018.
date_created: 2018-11-28T12:10:27Z
date_updated: 2022-11-30T14:20:37Z
department:
- _id: '205'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: Diskriminierung in sozialen Netzwerken durch Versionierung
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '5965'
author:
- first_name: N
  full_name: N, N
  last_name: N
citation:
  ama: N N. <i>School Choice in Theory</i>. Universität Paderborn; 2018.
  apa: N, N. (2018). <i>School Choice in Theory</i>. Universität Paderborn.
  bibtex: '@book{N_2018, title={School Choice in Theory}, publisher={Universität Paderborn},
    author={N, N}, year={2018} }'
  chicago: N, N. <i>School Choice in Theory</i>. Universität Paderborn, 2018.
  ieee: N. N, <i>School Choice in Theory</i>. Universität Paderborn, 2018.
  mla: N, N. <i>School Choice in Theory</i>. Universität Paderborn, 2018.
  short: N. N, School Choice in Theory, Universität Paderborn, 2018.
date_created: 2018-11-28T12:04:07Z
date_updated: 2022-11-30T14:19:24Z
department:
- _id: '205'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: School Choice in Theory
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '9924'
author:
- first_name: N
  full_name: N, N
  last_name: N
citation:
  ama: N N. <i>Punktesystem für Zuwanderung in Deutschland nach Vorbild von Kanada</i>.
    Universität Paderborn; 2018.
  apa: N, N. (2018). <i>Punktesystem für Zuwanderung in Deutschland nach Vorbild von
    Kanada</i>. Universität Paderborn.
  bibtex: '@book{N_2018, title={Punktesystem für Zuwanderung in Deutschland nach Vorbild
    von Kanada}, publisher={Universität Paderborn}, author={N, N}, year={2018} }'
  chicago: N, N. <i>Punktesystem für Zuwanderung in Deutschland nach Vorbild von Kanada</i>.
    Universität Paderborn, 2018.
  ieee: N. N, <i>Punktesystem für Zuwanderung in Deutschland nach Vorbild von Kanada</i>.
    Universität Paderborn, 2018.
  mla: N, N. <i>Punktesystem für Zuwanderung in Deutschland nach Vorbild von Kanada</i>.
    Universität Paderborn, 2018.
  short: N. N, Punktesystem für Zuwanderung in Deutschland nach Vorbild von Kanada,
    Universität Paderborn, 2018.
date_created: 2019-05-23T08:41:16Z
date_updated: 2022-11-30T14:23:32Z
department:
- _id: '205'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: Punktesystem für Zuwanderung in Deutschland nach Vorbild von Kanada
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '9926'
author:
- first_name: N
  full_name: N, N
  last_name: N
citation:
  ama: N N. <i>Agenda Setting in Jury Decision by Sequential Majority Voting</i>.
    Universität Paderborn; 2018.
  apa: N, N. (2018). <i>Agenda setting in jury decision by sequential majority voting</i>.
    Universität Paderborn.
  bibtex: '@book{N_2018, title={Agenda setting in jury decision by sequential majority
    voting}, publisher={Universität Paderborn}, author={N, N}, year={2018} }'
  chicago: N, N. <i>Agenda Setting in Jury Decision by Sequential Majority Voting</i>.
    Universität Paderborn, 2018.
  ieee: N. N, <i>Agenda setting in jury decision by sequential majority voting</i>.
    Universität Paderborn, 2018.
  mla: N, N. <i>Agenda Setting in Jury Decision by Sequential Majority Voting</i>.
    Universität Paderborn, 2018.
  short: N. N, Agenda Setting in Jury Decision by Sequential Majority Voting, Universität
    Paderborn, 2018.
date_created: 2019-05-23T08:49:59Z
date_updated: 2022-11-30T14:23:47Z
department:
- _id: '205'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: Agenda setting in jury decision by sequential majority voting
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '9925'
author:
- first_name: N
  full_name: N, N
  last_name: N
citation:
  ama: N N. <i>Verbindung Terrorismusforschung und Spieltheorie</i>. Universität Paderborn;
    2018.
  apa: N, N. (2018). <i>Verbindung Terrorismusforschung und Spieltheorie</i>. Universität
    Paderborn.
  bibtex: '@book{N_2018, title={Verbindung Terrorismusforschung und Spieltheorie},
    publisher={Universität Paderborn}, author={N, N}, year={2018} }'
  chicago: N, N. <i>Verbindung Terrorismusforschung und Spieltheorie</i>. Universität
    Paderborn, 2018.
  ieee: N. N, <i>Verbindung Terrorismusforschung und Spieltheorie</i>. Universität
    Paderborn, 2018.
  mla: N, N. <i>Verbindung Terrorismusforschung und Spieltheorie</i>. Universität
    Paderborn, 2018.
  short: N. N, Verbindung Terrorismusforschung und Spieltheorie, Universität Paderborn,
    2018.
date_created: 2019-05-23T08:47:48Z
date_updated: 2022-11-30T14:24:00Z
department:
- _id: '205'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: Verbindung Terrorismusforschung und Spieltheorie
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '5417'
abstract:
- lang: eng
  text: "Molecular Dynamic (MD) simulations are computationally intensive and accelerating
    them using specialized hardware is a topic of investigation in many studies. One
    of the routines in the critical path of MD simulations is the three-dimensional
    Fast Fourier Transformation (FFT3d). The potential in accelerating FFT3d using
    hardware is usually bound by bandwidth and memory. Therefore, designing a high
    throughput solution for an FPGA that overcomes this problem is challenging.\r\nIn
    this thesis, the feasibility of offloading FFT3d computations to FPGA implemented
    using OpenCL is investigated. In order to mask the latency in memory access, an
    FFT3d that overlaps computation with communication is designed. The implementa-
    tion of this design is synthesized for the Arria 10 GX 1150 FPGA and evaluated
    with the FFTW benchmark. Analysis shows a better performance using FPGA over CPU
    for larger FFT sizes, with the 643 FFT showing a 70% improvement in runtime using
    FPGAs.\r\nThis FFT3d design is integrated with CP2K to explore the potential in
    accelerating molecular dynamic simulations. Evaluation of CP2K simulations using
    FPGA shows a 41% improvement in runtime in FFT3d computations over CPU for larger
    FFT3d designs."
author:
- first_name: Arjun
  full_name: Ramaswami, Arjun
  id: '49171'
  last_name: Ramaswami
  orcid: https://orcid.org/0000-0002-0909-1178
citation:
  ama: Ramaswami A. <i>Accelerating Molecular Dynamic Simulations by Offloading Fast
    Fourier Transformations to FPGA</i>. Universität Paderborn; 2018.
  apa: Ramaswami, A. (2018). <i>Accelerating Molecular Dynamic Simulations by Offloading
    Fast Fourier Transformations to FPGA</i>. Universität Paderborn.
  bibtex: '@book{Ramaswami_2018, title={Accelerating Molecular Dynamic Simulations
    by Offloading Fast Fourier Transformations to FPGA}, publisher={Universität Paderborn},
    author={Ramaswami, Arjun}, year={2018} }'
  chicago: Ramaswami, Arjun. <i>Accelerating Molecular Dynamic Simulations by Offloading
    Fast Fourier Transformations to FPGA</i>. Universität Paderborn, 2018.
  ieee: A. Ramaswami, <i>Accelerating Molecular Dynamic Simulations by Offloading
    Fast Fourier Transformations to FPGA</i>. Universität Paderborn, 2018.
  mla: Ramaswami, Arjun. <i>Accelerating Molecular Dynamic Simulations by Offloading
    Fast Fourier Transformations to FPGA</i>. Universität Paderborn, 2018.
  short: A. Ramaswami, Accelerating Molecular Dynamic Simulations by Offloading Fast
    Fourier Transformations to FPGA, Universität Paderborn, 2018.
date_created: 2018-11-07T16:08:32Z
date_updated: 2022-01-12T16:32:23Z
ddc:
- '000'
department:
- _id: '27'
- _id: '518'
file:
- access_level: closed
  content_type: application/pdf
  creator: arjunr
  date_created: 2020-06-15T11:29:38Z
  date_updated: 2020-06-15T11:29:38Z
  file_id: '17093'
  file_name: masterthesis.pdf
  file_size: 1297585
  relation: main_file
  success: 1
file_date_updated: 2020-06-15T11:29:38Z
has_accepted_license: '1'
keyword:
- 'FFT: FPGA'
- CP2K
- OpenCL
language:
- iso: eng
main_file_link:
- open_access: '1'
oa: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '14'
  name: SFB 901 - Subproject C2
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
title: Accelerating Molecular Dynamic Simulations by Offloading Fast Fourier Transformations
  to FPGA
type: mastersthesis
user_id: '49171'
year: '2018'
...
---
_id: '11710'
author:
- first_name: Wei-Fan
  full_name: Chen, Wei-Fan
  id: '82920'
  last_name: Chen
- first_name: Henning
  full_name: Wachsmuth, Henning
  id: '3900'
  last_name: Wachsmuth
- first_name: Khalid
  full_name: Al Khatib, Khalid
  last_name: Al Khatib
- first_name: Benno
  full_name: Stein, Benno
  last_name: Stein
citation:
  ama: 'Chen W-F, Wachsmuth H, Al Khatib K, Stein B. Learning to Flip the Bias of
    News Headlines. In: <i>Proceedings of the 11th International Conference on Natural
    Language Generation</i>. Association for Computational Linguistics; 2018:79-88.'
  apa: Chen, W.-F., Wachsmuth, H., Al Khatib, K., &#38; Stein, B. (2018). Learning
    to Flip the Bias of News Headlines. <i>Proceedings of the 11th International Conference
    on Natural Language Generation</i>, 79–88.
  bibtex: '@inproceedings{Chen_Wachsmuth_Al Khatib_Stein_2018, title={Learning to
    Flip the Bias of News Headlines}, booktitle={Proceedings of the 11th International
    Conference on Natural Language Generation}, publisher={Association for Computational
    Linguistics}, author={Chen, Wei-Fan and Wachsmuth, Henning and Al Khatib, Khalid
    and Stein, Benno}, year={2018}, pages={79–88} }'
  chicago: Chen, Wei-Fan, Henning Wachsmuth, Khalid Al Khatib, and Benno Stein. “Learning
    to Flip the Bias of News Headlines.” In <i>Proceedings of the 11th International
    Conference on Natural Language Generation</i>, 79–88. Association for Computational
    Linguistics, 2018.
  ieee: W.-F. Chen, H. Wachsmuth, K. Al Khatib, and B. Stein, “Learning to Flip the
    Bias of News Headlines,” in <i>Proceedings of the 11th International Conference
    on Natural Language Generation</i>, 2018, pp. 79–88.
  mla: Chen, Wei-Fan, et al. “Learning to Flip the Bias of News Headlines.” <i>Proceedings
    of the 11th International Conference on Natural Language Generation</i>, Association
    for Computational Linguistics, 2018, pp. 79–88.
  short: 'W.-F. Chen, H. Wachsmuth, K. Al Khatib, B. Stein, in: Proceedings of the
    11th International Conference on Natural Language Generation, Association for
    Computational Linguistics, 2018, pp. 79–88.'
date_created: 2019-07-11T13:13:43Z
date_updated: 2022-05-09T15:04:38Z
department:
- _id: '600'
- _id: '568'
language:
- iso: eng
main_file_link:
- url: https://www.aclweb.org/anthology/W18-6509.pdf
page: 79-88
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '3'
  name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '9'
  name: 'SFB 901 - B1: SFB 901 - Subproject B1'
publication: Proceedings of the 11th International Conference on Natural Language
  Generation
publisher: Association for Computational Linguistics
status: public
title: Learning to Flip the Bias of News Headlines
type: conference
user_id: '82920'
year: '2018'
...
---
_id: '14873'
author:
- first_name: Wei-Fan
  full_name: Chen, Wei-Fan
  id: '82920'
  last_name: Chen
- first_name: Matthias
  full_name: Hagen, Matthias
  last_name: Hagen
- first_name: Benno
  full_name: Stein, Benno
  last_name: Stein
- first_name: Martin
  full_name: Potthast, Martin
  last_name: Potthast
citation:
  ama: 'Chen W-F, Hagen M, Stein B, Potthast M. A User Study on Snippet Generation:
    Text Reuse vs. Paraphrases. In: <i>Proceedings of the 41st International ACM SIGIR
    Conference on Research &#38; Development in Information Retrieval</i>. ; 2018:1033-1036.'
  apa: 'Chen, W.-F., Hagen, M., Stein, B., &#38; Potthast, M. (2018). A User Study
    on Snippet Generation: Text Reuse vs. Paraphrases. <i>Proceedings of the 41st
    International ACM SIGIR Conference on Research &#38; Development in Information
    Retrieval</i>, 1033–1036.'
  bibtex: '@inproceedings{Chen_Hagen_Stein_Potthast_2018, title={A User Study on Snippet
    Generation: Text Reuse vs. Paraphrases}, booktitle={Proceedings of the 41st International
    ACM SIGIR Conference on Research &#38; Development in Information Retrieval},
    author={Chen, Wei-Fan and Hagen, Matthias and Stein, Benno and Potthast, Martin},
    year={2018}, pages={1033–1036} }'
  chicago: 'Chen, Wei-Fan, Matthias Hagen, Benno Stein, and Martin Potthast. “A User
    Study on Snippet Generation: Text Reuse vs. Paraphrases.” In <i>Proceedings of
    the 41st International ACM SIGIR Conference on Research &#38; Development in Information
    Retrieval</i>, 1033–36, 2018.'
  ieee: 'W.-F. Chen, M. Hagen, B. Stein, and M. Potthast, “A User Study on Snippet
    Generation: Text Reuse vs. Paraphrases,” in <i>Proceedings of the 41st International
    ACM SIGIR Conference on Research &#38; Development in Information Retrieval</i>,
    2018, pp. 1033–1036.'
  mla: 'Chen, Wei-Fan, et al. “A User Study on Snippet Generation: Text Reuse vs.
    Paraphrases.” <i>Proceedings of the 41st International ACM SIGIR Conference on
    Research &#38; Development in Information Retrieval</i>, 2018, pp. 1033–36.'
  short: 'W.-F. Chen, M. Hagen, B. Stein, M. Potthast, in: Proceedings of the 41st
    International ACM SIGIR Conference on Research &#38; Development in Information
    Retrieval, 2018, pp. 1033–1036.'
date_created: 2019-11-11T09:51:05Z
date_updated: 2022-05-09T15:04:59Z
department:
- _id: '600'
language:
- iso: eng
main_file_link:
- url: https://dl.acm.org/doi/pdf/10.1145/3209978.3210149
page: 1033-1036
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '3'
  name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '9'
  name: 'SFB 901 - B1: SFB 901 - Subproject B1'
publication: Proceedings of the 41st International ACM SIGIR Conference on Research
  & Development in Information Retrieval
status: public
title: 'A User Study on Snippet Generation: Text Reuse vs. Paraphrases'
type: conference
user_id: '82920'
year: '2018'
...
---
_id: '14885'
author:
- first_name: Martin
  full_name: Potthast, Martin
  last_name: Potthast
- first_name: Wei-Fan
  full_name: Chen, Wei-Fan
  id: '82920'
  last_name: Chen
- first_name: Matthias
  full_name: Hagen, Matthias
  last_name: Hagen
- first_name: Benno
  full_name: Stein, Benno
  last_name: Stein
citation:
  ama: 'Potthast M, Chen W-F, Hagen M, Stein B. A Plan for Ancillary Copyright: Original
    Snippets. In: <i>Proceedings of the Second International Workshop on Recent Trends
    in News Information Retrieval</i>. ; 2018:3-5.'
  apa: 'Potthast, M., Chen, W.-F., Hagen, M., &#38; Stein, B. (2018). A Plan for Ancillary
    Copyright: Original Snippets. <i>Proceedings of the Second International Workshop
    on Recent Trends in News Information Retrieval</i>, 3–5.'
  bibtex: '@inproceedings{Potthast_Chen_Hagen_Stein_2018, title={A Plan for Ancillary
    Copyright: Original Snippets.}, booktitle={Proceedings of the Second International
    Workshop on Recent Trends in News Information Retrieval}, author={Potthast, Martin
    and Chen, Wei-Fan and Hagen, Matthias and Stein, Benno}, year={2018}, pages={3–5}
    }'
  chicago: 'Potthast, Martin, Wei-Fan Chen, Matthias Hagen, and Benno Stein. “A Plan
    for Ancillary Copyright: Original Snippets.” In <i>Proceedings of the Second International
    Workshop on Recent Trends in News Information Retrieval</i>, 3–5, 2018.'
  ieee: 'M. Potthast, W.-F. Chen, M. Hagen, and B. Stein, “A Plan for Ancillary Copyright:
    Original Snippets.,” in <i>Proceedings of the Second International Workshop on
    Recent Trends in News Information Retrieval</i>, 2018, pp. 3–5.'
  mla: 'Potthast, Martin, et al. “A Plan for Ancillary Copyright: Original Snippets.”
    <i>Proceedings of the Second International Workshop on Recent Trends in News Information
    Retrieval</i>, 2018, pp. 3–5.'
  short: 'M. Potthast, W.-F. Chen, M. Hagen, B. Stein, in: Proceedings of the Second
    International Workshop on Recent Trends in News Information Retrieval, 2018, pp.
    3–5.'
date_created: 2019-11-11T12:32:01Z
date_updated: 2022-05-09T15:05:42Z
department:
- _id: '600'
language:
- iso: eng
main_file_link:
- url: https://webis.de/downloads/publications/papers/stein_2018b.pdf
page: 3-5
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '3'
  name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '9'
  name: 'SFB 901 - B1: SFB 901 - Subproject B1'
publication: Proceedings of the Second International Workshop on Recent Trends in
  News Information Retrieval
status: public
title: 'A Plan for Ancillary Copyright: Original Snippets.'
type: conference
user_id: '82920'
year: '2018'
...
---
_id: '3873'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Fabian
  full_name: Eidens, Fabian
  id: '25078'
  last_name: Eidens
- first_name: Jakob
  full_name: Juhnke, Jakob
  id: '48090'
  last_name: Juhnke
citation:
  ama: 'Blömer J, Eidens F, Juhnke J. Enhanced Security of Attribute-Based Signatures.
    In: <i>The International Conference on Cryptology And Network Security (CANS)</i>.
    Vol 11124. Lecture Notes in Computer Science. Springer; 2018:235-255. doi:<a href="https://doi.org/10.1007/978-3-030-00434-7_12">10.1007/978-3-030-00434-7_12</a>'
  apa: Blömer, J., Eidens, F., &#38; Juhnke, J. (2018). Enhanced Security of Attribute-Based
    Signatures. <i>The International Conference on Cryptology And Network Security
    (CANS)</i>, <i>11124</i>, 235–255. <a href="https://doi.org/10.1007/978-3-030-00434-7_12">https://doi.org/10.1007/978-3-030-00434-7_12</a>
  bibtex: '@inproceedings{Blömer_Eidens_Juhnke_2018, series={Lecture Notes in Computer
    Science}, title={Enhanced Security of Attribute-Based Signatures}, volume={11124},
    DOI={<a href="https://doi.org/10.1007/978-3-030-00434-7_12">10.1007/978-3-030-00434-7_12</a>},
    booktitle={The International Conference on Cryptology And Network Security (CANS)},
    publisher={Springer}, author={Blömer, Johannes and Eidens, Fabian and Juhnke,
    Jakob}, year={2018}, pages={235–255}, collection={Lecture Notes in Computer Science}
    }'
  chicago: Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Enhanced Security of
    Attribute-Based Signatures.” In <i>The International Conference on Cryptology
    And Network Security (CANS)</i>, 11124:235–55. Lecture Notes in Computer Science.
    Springer, 2018. <a href="https://doi.org/10.1007/978-3-030-00434-7_12">https://doi.org/10.1007/978-3-030-00434-7_12</a>.
  ieee: 'J. Blömer, F. Eidens, and J. Juhnke, “Enhanced Security of Attribute-Based
    Signatures,” in <i>The International Conference on Cryptology And Network Security
    (CANS)</i>, Naples, Italy, 2018, vol. 11124, pp. 235–255, doi: <a href="https://doi.org/10.1007/978-3-030-00434-7_12">10.1007/978-3-030-00434-7_12</a>.'
  mla: Blömer, Johannes, et al. “Enhanced Security of Attribute-Based Signatures.”
    <i>The International Conference on Cryptology And Network Security (CANS)</i>,
    vol. 11124, Springer, 2018, pp. 235–55, doi:<a href="https://doi.org/10.1007/978-3-030-00434-7_12">10.1007/978-3-030-00434-7_12</a>.
  short: 'J. Blömer, F. Eidens, J. Juhnke, in: The International Conference on Cryptology
    And Network Security (CANS), Springer, 2018, pp. 235–255.'
conference:
  location: Naples, Italy
  name: The International Conference on Cryptology And Network Security (CANS)
date_created: 2018-08-10T09:44:09Z
date_updated: 2023-01-10T10:26:13Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1007/978-3-030-00434-7_12
file:
- access_level: closed
  content_type: application/pdf
  creator: feidens
  date_created: 2018-11-08T10:15:00Z
  date_updated: 2018-11-08T10:15:00Z
  file_id: '5427'
  file_name: uc_abs.pdf
  file_size: 574228
  relation: main_file
file_date_updated: 2018-11-08T10:15:00Z
has_accepted_license: '1'
intvolume: '     11124'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2018/874
oa: '1'
page: 235-255
project:
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
- _id: '1'
  name: SFB 901
publication: The International Conference on Cryptology And Network Security (CANS)
publication_identifier:
  isbn:
  - 978-3-030-00434-7
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Enhanced Security of Attribute-Based Signatures
type: conference
user_id: '25078'
volume: 11124
year: '2018'
...
---
_id: '2379'
abstract:
- lang: eng
  text: 'In this paper, we introduce the notion of delegatable attribute-based anonymous
    credentials (DAAC). Such systems offer fine-grained anonymous access control and
    they give the credential holder the ability to issue more restricted credentials
    to other users. In our model, credentials are parameterized with attributes that
    (1) express what the credential holder himself has been certified and (2) define
    which attributes he may issue to others. Furthermore, we present a practical construction
    of DAAC. For this construction, we deviate from the usual approach of embedding
    a certificate chain in the credential. Instead, we introduce a novel approach
    for which we identify a new primitive we call dynamically malleable signatures
    (DMS) as the main ingredient. This primitive may be of independent interest. We
    also give a first instantiation of DMS with efficient protocols. '
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Jan
  full_name: Bobolz, Jan
  id: '27207'
  last_name: Bobolz
citation:
  ama: 'Blömer J, Bobolz J. Delegatable Attribute-based Anonymous Credentials from
    Dynamically Malleable Signatures. In: <i>ACNS 2018 Applied Cryptography &#38;
    Network Security</i>. LNCS. doi:<a href="https://doi.org/10.1007/978-3-319-93387-0_12">10.1007/978-3-319-93387-0_12</a>'
  apa: Blömer, J., &#38; Bobolz, J. (n.d.). Delegatable Attribute-based Anonymous
    Credentials from Dynamically Malleable Signatures. <i>ACNS 2018 Applied Cryptography
    &#38; Network Security</i>. The 16th International Conference on Applied Cryptography
    and Network Security, Leuven, Belgium. <a href="https://doi.org/10.1007/978-3-319-93387-0_12">https://doi.org/10.1007/978-3-319-93387-0_12</a>
  bibtex: '@inproceedings{Blömer_Bobolz, series={LNCS}, title={Delegatable Attribute-based
    Anonymous Credentials from Dynamically Malleable Signatures}, DOI={<a href="https://doi.org/10.1007/978-3-319-93387-0_12">10.1007/978-3-319-93387-0_12</a>},
    booktitle={ACNS 2018 Applied Cryptography &#38; Network security}, author={Blömer,
    Johannes and Bobolz, Jan}, collection={LNCS} }'
  chicago: Blömer, Johannes, and Jan Bobolz. “Delegatable Attribute-Based Anonymous
    Credentials from Dynamically Malleable Signatures.” In <i>ACNS 2018 Applied Cryptography
    &#38; Network Security</i>. LNCS, n.d. <a href="https://doi.org/10.1007/978-3-319-93387-0_12">https://doi.org/10.1007/978-3-319-93387-0_12</a>.
  ieee: 'J. Blömer and J. Bobolz, “Delegatable Attribute-based Anonymous Credentials
    from Dynamically Malleable Signatures,” presented at the The 16th International
    Conference on Applied Cryptography and Network Security, Leuven, Belgium, doi:
    <a href="https://doi.org/10.1007/978-3-319-93387-0_12">10.1007/978-3-319-93387-0_12</a>.'
  mla: Blömer, Johannes, and Jan Bobolz. “Delegatable Attribute-Based Anonymous Credentials
    from Dynamically Malleable Signatures.” <i>ACNS 2018 Applied Cryptography &#38;
    Network Security</i>, doi:<a href="https://doi.org/10.1007/978-3-319-93387-0_12">10.1007/978-3-319-93387-0_12</a>.
  short: 'J. Blömer, J. Bobolz, in: ACNS 2018 Applied Cryptography &#38; Network Security,
    n.d.'
conference:
  location: Leuven, Belgium
  name: The 16th International Conference on Applied Cryptography and Network Security
date_created: 2018-04-17T12:28:25Z
date_updated: 2023-01-10T10:28:43Z
ddc:
- '004'
department:
- _id: '7'
- _id: '64'
doi: 10.1007/978-3-319-93387-0_12
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T13:41:16Z
  date_updated: 2018-11-02T13:41:16Z
  file_id: '5252'
  file_name: 2018-340.pdf
  file_size: 542171
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T13:41:16Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2018/340
oa: '1'
project:
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subproject C1
publication: ACNS 2018 Applied Cryptography & Network security
publication_status: accepted
series_title: LNCS
status: public
title: Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable
  Signatures
type: conference
user_id: '25078'
year: '2018'
...
---
_id: '1209'
abstract:
- lang: eng
  text: 'My dissertation deals with the Gathering problem for swarms of n point-shaped
    robots on a grid, in which all robots of the swarm are supposed to gather at a
    previously undefined point. Special attention is paid to the strong limitation
    of robot capabilities. These include in particular the lack of global control,
    a global compass, global visibility and (global) communication skills. Furthermore,
    all robots are identical. The robots are given only local abilities. This includes
    a constant range of vision. The robots all work completely synchronously. In this
    work we present and analyze three different Gathering strategies in different
    robot models. We formally prove correctness and total running time: Chapter 4
    focuses on minimizing the available robot capabilities. The underlying strategy
    completes the gathering in O(n^2) time. For the following Chapters 5 and 6, the
    aim is to optimize the total running time under using only local robot capabilities:
    We additionally allow a constant-sized memory and a constant number of locally
    visible statuses (lights, flags). For the strategies of both chapters we show
    an asymptotically optimal running time of O(n). Unlike in Chapters 4 and 5, we
    additionally restrict connectivity and vision to an initially given chain connectivity
    in Chapter 6, where two chain neighbors must have a distance of 1 from each other.
    A robot can only see and interact with a constant number of its direct chain neighbors.'
author:
- first_name: Daniel
  full_name: Jung, Daniel
  id: '37827'
  last_name: Jung
citation:
  ama: Jung D. <i>Local Strategies for Swarm Formations on a Grid</i>. Universität
    Paderborn; 2018. doi:<a href="https://doi.org/10.17619/UNIPB/1-271">10.17619/UNIPB/1-271</a>
  apa: Jung, D. (2018). <i>Local Strategies for Swarm Formations on a Grid</i>. Universität
    Paderborn. <a href="https://doi.org/10.17619/UNIPB/1-271">https://doi.org/10.17619/UNIPB/1-271</a>
  bibtex: '@book{Jung_2018, title={Local Strategies for Swarm Formations on a Grid},
    DOI={<a href="https://doi.org/10.17619/UNIPB/1-271">10.17619/UNIPB/1-271</a>},
    publisher={Universität Paderborn}, author={Jung, Daniel}, year={2018} }'
  chicago: Jung, Daniel. <i>Local Strategies for Swarm Formations on a Grid</i>. Universität
    Paderborn, 2018. <a href="https://doi.org/10.17619/UNIPB/1-271">https://doi.org/10.17619/UNIPB/1-271</a>.
  ieee: D. Jung, <i>Local Strategies for Swarm Formations on a Grid</i>. Universität
    Paderborn, 2018.
  mla: Jung, Daniel. <i>Local Strategies for Swarm Formations on a Grid</i>. Universität
    Paderborn, 2018, doi:<a href="https://doi.org/10.17619/UNIPB/1-271">10.17619/UNIPB/1-271</a>.
  short: D. Jung, Local Strategies for Swarm Formations on a Grid, Universität Paderborn,
    2018.
date_created: 2018-03-13T10:26:16Z
date_updated: 2024-07-12T12:05:00Z
department:
- _id: '63'
- _id: '26'
doi: 10.17619/UNIPB/1-271
language:
- iso: eng
project:
- _id: '1'
  grant_number: '160364472'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  grant_number: '160364472'
  name: SFB 901 - Subproject A1
publication_identifier:
  isbn:
  - 978-3-942647-99-1
publisher: Universität Paderborn
related_material:
  link:
  - relation: confirmation
    url: https://doi.org/10.17619/UNIPB/1-271
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: Local Strategies for Swarm Formations on a Grid
type: dissertation
user_id: '1112'
year: '2018'
...
---
_id: '37703'
author:
- first_name: Karen Elisabeth
  full_name: Olemedo Aragon, Karen Elisabeth
  last_name: Olemedo Aragon
citation:
  ama: Olemedo Aragon KE. <i>Cartel Cases in the EU Financial Derivatives Market -
    The Role of Facilitating Factors</i>.; 2018.
  apa: Olemedo Aragon, K. E. (2018). <i>Cartel Cases in the EU Financial Derivatives
    Market - The Role of Facilitating Factors</i>.
  bibtex: '@book{Olemedo Aragon_2018, title={Cartel Cases in the EU Financial Derivatives
    Market - The Role of Facilitating Factors}, author={Olemedo Aragon, Karen Elisabeth},
    year={2018} }'
  chicago: Olemedo Aragon, Karen Elisabeth. <i>Cartel Cases in the EU Financial Derivatives
    Market - The Role of Facilitating Factors</i>, 2018.
  ieee: K. E. Olemedo Aragon, <i>Cartel Cases in the EU Financial Derivatives Market
    - The Role of Facilitating Factors</i>. 2018.
  mla: Olemedo Aragon, Karen Elisabeth. <i>Cartel Cases in the EU Financial Derivatives
    Market - The Role of Facilitating Factors</i>. 2018.
  short: K.E. Olemedo Aragon, Cartel Cases in the EU Financial Derivatives Market
    - The Role of Facilitating Factors, 2018.
date_created: 2023-01-20T10:42:46Z
date_updated: 2023-01-20T10:42:56Z
department:
- _id: '280'
language:
- iso: eng
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '2'
  name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '7'
  name: 'SFB 901 - A3: SFB 901 - Subproject A3'
status: public
supervisor:
- first_name: Burkhard
  full_name: Hehenkamp, Burkhard
  id: '37339'
  last_name: Hehenkamp
title: Cartel Cases in the EU Financial Derivatives Market - The Role of Facilitating
  Factors
type: mastersthesis
user_id: '37953'
year: '2018'
...
---
_id: '1588'
abstract:
- lang: eng
  text: The exploration of FPGAs as accelerators for scientific simulations has so
    far mostly been focused on small kernels of methods working on regular data structures,
    for example in the form of stencil computations for finite difference methods.
    In computational sciences, often more advanced methods are employed that promise
    better stability, convergence, locality and scaling. Unstructured meshes are shown
    to be more effective and more accurate, compared to regular grids, in representing
    computation domains of various shapes. Using unstructured meshes, the discontinuous
    Galerkin method preserves the ability to perform explicit local update operations
    for simulations in the time domain. In this work, we investigate FPGAs as target
    platform for an implementation of the nodal discontinuous Galerkin method to find
    time-domain solutions of Maxwell's equations in an unstructured mesh. When maximizing
    data reuse and fitting constant coefficients into suitably partitioned on-chip
    memory, high computational intensity allows us to implement and feed wide data
    paths with hundreds of floating point operators. By decoupling off-chip memory
    accesses from the computations, high memory bandwidth can be sustained, even for
    the irregular access pattern required by parts of the application. Using the Intel/Altera
    OpenCL SDK for FPGAs, we present different implementation variants for different
    polynomial orders of the method. In different phases of the algorithm, either
    computational or bandwidth limits of the Arria 10 platform are almost reached,
    thus outperforming a highly multithreaded CPU implementation by around 2x.
author:
- first_name: Tobias
  full_name: Kenter, Tobias
  id: '3145'
  last_name: Kenter
- first_name: Gopinath
  full_name: Mahale, Gopinath
  last_name: Mahale
- first_name: Samer
  full_name: Alhaddad, Samer
  id: '42456'
  last_name: Alhaddad
- first_name: Yevgen
  full_name: Grynko, Yevgen
  id: '26059'
  last_name: Grynko
- first_name: Christian
  full_name: Schmitt, Christian
  last_name: Schmitt
- first_name: Ayesha
  full_name: Afzal, Ayesha
  last_name: Afzal
- first_name: Frank
  full_name: Hannig, Frank
  last_name: Hannig
- first_name: Jens
  full_name: Förstner, Jens
  id: '158'
  last_name: Förstner
  orcid: 0000-0001-7059-9862
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
citation:
  ama: 'Kenter T, Mahale G, Alhaddad S, et al. OpenCL-based FPGA Design to Accelerate
    the Nodal Discontinuous Galerkin Method for Unstructured Meshes. In: <i>Proc.
    Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)</i>. IEEE; 2018.
    doi:<a href="https://doi.org/10.1109/FCCM.2018.00037">10.1109/FCCM.2018.00037</a>'
  apa: Kenter, T., Mahale, G., Alhaddad, S., Grynko, Y., Schmitt, C., Afzal, A., Hannig,
    F., Förstner, J., &#38; Plessl, C. (2018). OpenCL-based FPGA Design to Accelerate
    the Nodal Discontinuous Galerkin Method for Unstructured Meshes. <i>Proc. Int.
    Symp. on Field-Programmable Custom Computing Machines (FCCM)</i>. Proc. Int. Symp.
    on Field-Programmable Custom Computing Machines (FCCM). <a href="https://doi.org/10.1109/FCCM.2018.00037">https://doi.org/10.1109/FCCM.2018.00037</a>
  bibtex: '@inproceedings{Kenter_Mahale_Alhaddad_Grynko_Schmitt_Afzal_Hannig_Förstner_Plessl_2018,
    title={OpenCL-based FPGA Design to Accelerate the Nodal Discontinuous Galerkin
    Method for Unstructured Meshes}, DOI={<a href="https://doi.org/10.1109/FCCM.2018.00037">10.1109/FCCM.2018.00037</a>},
    booktitle={Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)},
    publisher={IEEE}, author={Kenter, Tobias and Mahale, Gopinath and Alhaddad, Samer
    and Grynko, Yevgen and Schmitt, Christian and Afzal, Ayesha and Hannig, Frank
    and Förstner, Jens and Plessl, Christian}, year={2018} }'
  chicago: Kenter, Tobias, Gopinath Mahale, Samer Alhaddad, Yevgen Grynko, Christian
    Schmitt, Ayesha Afzal, Frank Hannig, Jens Förstner, and Christian Plessl. “OpenCL-Based
    FPGA Design to Accelerate the Nodal Discontinuous Galerkin Method for Unstructured
    Meshes.” In <i>Proc. Int. Symp. on Field-Programmable Custom Computing Machines
    (FCCM)</i>. IEEE, 2018. <a href="https://doi.org/10.1109/FCCM.2018.00037">https://doi.org/10.1109/FCCM.2018.00037</a>.
  ieee: 'T. Kenter <i>et al.</i>, “OpenCL-based FPGA Design to Accelerate the Nodal
    Discontinuous Galerkin Method for Unstructured Meshes,” presented at the Proc.
    Int. Symp. on Field-Programmable Custom Computing Machines (FCCM), 2018, doi:
    <a href="https://doi.org/10.1109/FCCM.2018.00037">10.1109/FCCM.2018.00037</a>.'
  mla: Kenter, Tobias, et al. “OpenCL-Based FPGA Design to Accelerate the Nodal Discontinuous
    Galerkin Method for Unstructured Meshes.” <i>Proc. Int. Symp. on Field-Programmable
    Custom Computing Machines (FCCM)</i>, IEEE, 2018, doi:<a href="https://doi.org/10.1109/FCCM.2018.00037">10.1109/FCCM.2018.00037</a>.
  short: 'T. Kenter, G. Mahale, S. Alhaddad, Y. Grynko, C. Schmitt, A. Afzal, F. Hannig,
    J. Förstner, C. Plessl, in: Proc. Int. Symp. on Field-Programmable Custom Computing
    Machines (FCCM), IEEE, 2018.'
conference:
  name: Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)
date_created: 2018-03-22T10:48:01Z
date_updated: 2023-09-26T11:47:52Z
ddc:
- '000'
department:
- _id: '27'
- _id: '518'
- _id: '61'
doi: 10.1109/FCCM.2018.00037
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T14:45:05Z
  date_updated: 2018-11-02T14:45:05Z
  file_id: '5282'
  file_name: 08457652.pdf
  file_size: 269130
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T14:45:05Z
has_accepted_license: '1'
keyword:
- tet_topic_hpc
language:
- iso: eng
project:
- _id: '33'
  grant_number: 01|H16005A
  name: HighPerMeshes
- _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. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)
publisher: IEEE
quality_controlled: '1'
status: public
title: OpenCL-based FPGA Design to Accelerate the Nodal Discontinuous Galerkin Method
  for Unstructured Meshes
type: conference
user_id: '15278'
year: '2018'
...
---
_id: '1204'
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: 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: 'Riebler H, Vaz GF, Kenter T, Plessl C. Automated Code Acceleration Targeting
    Heterogeneous OpenCL Devices. In: <i>Proc. ACM SIGPLAN Symposium on Principles
    and Practice of Parallel Programming (PPoPP)</i>. ACM; 2018. doi:<a href="https://doi.org/10.1145/3178487.3178534">10.1145/3178487.3178534</a>'
  apa: Riebler, H., Vaz, G. F., Kenter, T., &#38; Plessl, C. (2018). Automated Code
    Acceleration Targeting Heterogeneous OpenCL Devices. <i>Proc. ACM SIGPLAN Symposium
    on Principles and Practice of Parallel Programming (PPoPP)</i>. <a href="https://doi.org/10.1145/3178487.3178534">https://doi.org/10.1145/3178487.3178534</a>
  bibtex: '@inproceedings{Riebler_Vaz_Kenter_Plessl_2018, title={Automated Code Acceleration
    Targeting Heterogeneous OpenCL Devices}, DOI={<a href="https://doi.org/10.1145/3178487.3178534">10.1145/3178487.3178534</a>},
    booktitle={Proc. ACM SIGPLAN Symposium on Principles and Practice of Parallel
    Programming (PPoPP)}, publisher={ACM}, author={Riebler, Heinrich and Vaz, Gavin
    Francis and Kenter, Tobias and Plessl, Christian}, year={2018} }'
  chicago: Riebler, Heinrich, Gavin Francis Vaz, Tobias Kenter, and Christian Plessl.
    “Automated Code Acceleration Targeting Heterogeneous OpenCL Devices.” In <i>Proc.
    ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)</i>.
    ACM, 2018. <a href="https://doi.org/10.1145/3178487.3178534">https://doi.org/10.1145/3178487.3178534</a>.
  ieee: 'H. Riebler, G. F. Vaz, T. Kenter, and C. Plessl, “Automated Code Acceleration
    Targeting Heterogeneous OpenCL Devices,” 2018, doi: <a href="https://doi.org/10.1145/3178487.3178534">10.1145/3178487.3178534</a>.'
  mla: Riebler, Heinrich, et al. “Automated Code Acceleration Targeting Heterogeneous
    OpenCL Devices.” <i>Proc. ACM SIGPLAN Symposium on Principles and Practice of
    Parallel Programming (PPoPP)</i>, ACM, 2018, doi:<a href="https://doi.org/10.1145/3178487.3178534">10.1145/3178487.3178534</a>.
  short: 'H. Riebler, G.F. Vaz, T. Kenter, C. Plessl, in: Proc. ACM SIGPLAN Symposium
    on Principles and Practice of Parallel Programming (PPoPP), ACM, 2018.'
date_created: 2018-03-08T14:45:18Z
date_updated: 2023-09-26T11:47:23Z
ddc:
- '000'
department:
- _id: '27'
- _id: '518'
doi: 10.1145/3178487.3178534
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T14:43:37Z
  date_updated: 2018-11-02T14:43:37Z
  file_id: '5281'
  file_name: p417-riebler.pdf
  file_size: 447769
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T14:43:37Z
has_accepted_license: '1'
keyword:
- htrop
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
publication: Proc. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
  (PPoPP)
publication_identifier:
  isbn:
  - '9781450349826'
publication_status: published
publisher: ACM
quality_controlled: '1'
status: public
title: Automated Code Acceleration Targeting Heterogeneous OpenCL Devices
type: conference
user_id: '15278'
year: '2018'
...
---
_id: '2851'
author:
- first_name: Christine
  full_name: Markarian, Christine
  id: '37612'
  last_name: Markarian
citation:
  ama: 'Markarian C. Leasing with Uncertainty. In: <i>International Conference on
    Operations Research (OR)</i>. ; 2017. doi:<a href="https://doi.org/10.1007/978-3-319-89920-6_57">10.1007/978-3-319-89920-6_57</a>'
  apa: Markarian, C. (2017). Leasing with Uncertainty. In <i>International Conference
    on Operations Research (OR)</i>. Berlin. <a href="https://doi.org/10.1007/978-3-319-89920-6_57">https://doi.org/10.1007/978-3-319-89920-6_57</a>
  bibtex: '@inproceedings{Markarian_2017, title={Leasing with Uncertainty}, DOI={<a
    href="https://doi.org/10.1007/978-3-319-89920-6_57">10.1007/978-3-319-89920-6_57</a>},
    booktitle={International Conference on Operations Research (OR)}, author={Markarian,
    Christine}, year={2017} }'
  chicago: Markarian, Christine. “Leasing with Uncertainty.” In <i>International Conference
    on Operations Research (OR)</i>, 2017. <a href="https://doi.org/10.1007/978-3-319-89920-6_57">https://doi.org/10.1007/978-3-319-89920-6_57</a>.
  ieee: C. Markarian, “Leasing with Uncertainty,” in <i>International Conference on
    Operations Research (OR)</i>, Berlin, 2017.
  mla: Markarian, Christine. “Leasing with Uncertainty.” <i>International Conference
    on Operations Research (OR)</i>, 2017, doi:<a href="https://doi.org/10.1007/978-3-319-89920-6_57">10.1007/978-3-319-89920-6_57</a>.
  short: 'C. Markarian, in: International Conference on Operations Research (OR),
    2017.'
conference:
  end_date: Sept 8, 2017
  location: Berlin
  start_date: Sept 6, 2017
date_created: 2018-05-24T08:44:43Z
date_updated: 2022-01-06T06:58:08Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-89920-6_57
file:
- access_level: closed
  content_type: application/pdf
  creator: feldi
  date_created: 2018-11-13T13:16:30Z
  date_updated: 2018-11-13T13:16:30Z
  file_id: '5537'
  file_name: Markarian2018_Chapter_LeasingWithUncertainty.pdf
  file_size: 257103
  relation: main_file
  success: 1
file_date_updated: 2018-11-13T13:16:30Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: International Conference on Operations Research (OR)
status: public
title: Leasing with Uncertainty
type: conference
user_id: '14052'
year: '2017'
...
---
_id: '2696'
author:
- first_name: Steffen
  full_name: Zimmermann, Steffen
  last_name: Zimmermann
- first_name: Philipp
  full_name: Herrmann, Philipp
  last_name: Herrmann
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
- first_name: Barrie
  full_name: Nault, Barrie
  last_name: Nault
citation:
  ama: 'Zimmermann S, Herrmann P, Kundisch D, Nault B. Decomposing the Variance of
    Online Consumer Ratings and the Impact on Price and Demand. In: <i>Workshop Theory
    in Economics of Information Systems (TEIS)</i>. ; 2017.'
  apa: Zimmermann, S., Herrmann, P., Kundisch, D., &#38; Nault, B. (2017). Decomposing
    the Variance of Online Consumer Ratings and the Impact on Price and Demand. In
    <i>Workshop Theory in Economics of Information Systems (TEIS)</i>. Sonoma, USA.
  bibtex: '@inproceedings{Zimmermann_Herrmann_Kundisch_Nault_2017, title={Decomposing
    the Variance of Online Consumer Ratings and the Impact on Price and Demand}, booktitle={Workshop
    Theory in Economics of Information Systems (TEIS)}, author={Zimmermann, Steffen
    and Herrmann, Philipp and Kundisch, Dennis and Nault, Barrie}, year={2017} }'
  chicago: Zimmermann, Steffen, Philipp Herrmann, Dennis Kundisch, and Barrie Nault.
    “Decomposing the Variance of Online Consumer Ratings and the Impact on Price and
    Demand.” In <i>Workshop Theory in Economics of Information Systems (TEIS)</i>,
    2017.
  ieee: S. Zimmermann, P. Herrmann, D. Kundisch, and B. Nault, “Decomposing the Variance
    of Online Consumer Ratings and the Impact on Price and Demand,” in <i>Workshop
    Theory in Economics of Information Systems (TEIS)</i>, Sonoma, USA, 2017.
  mla: Zimmermann, Steffen, et al. “Decomposing the Variance of Online Consumer Ratings
    and the Impact on Price and Demand.” <i>Workshop Theory in Economics of Information
    Systems (TEIS)</i>, 2017.
  short: 'S. Zimmermann, P. Herrmann, D. Kundisch, B. Nault, in: Workshop Theory in
    Economics of Information Systems (TEIS), 2017.'
conference:
  location: Sonoma, USA
  name: Workshop Theory in Economics of Information Systems (TEIS)
date_created: 2018-05-08T12:50:23Z
date_updated: 2022-01-06T06:57:31Z
ddc:
- '330'
department:
- _id: '276'
file:
- access_level: closed
  content_type: application/pdf
  creator: abursig
  date_created: 2019-01-29T14:39:27Z
  date_updated: 2019-01-29T14:39:27Z
  file_id: '7243'
  file_name: Rating Variance_CIST_Abstract.pdf
  file_size: 83968
  relation: main_file
  success: 1
file_date_updated: 2019-01-29T14:39:27Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '8'
  name: SFB 901 - Subproject A4
- _id: '1'
  name: SFB 901
publication: Workshop Theory in Economics of Information Systems (TEIS)
status: public
title: Decomposing the Variance of Online Consumer Ratings and the Impact on Price
  and Demand
type: conference_abstract
user_id: '477'
year: '2017'
...
---
_id: '3291'
abstract:
- lang: eng
  text: The microservice architecture uses independently running microservices as
    build- ing blocks for applications. These microservices are clearly bounded for
    each other and expose their functionality through, for instance, RESTful application
    inter- faces. Particularly the clear boundaries between microservices enable the
    reuse of microservice throughout different projects. Because of the increasing
    use of microservices, the composition of multiple microservices in service composition
    becomes a more important task. A challenging area in developing service compo-
    sitions is that it involves two distinct layers with few junctions. On the one
    hand, describes a service composition a business process, which involves multiple
    com- ponents. On the other hand, involves the implementation of a service composition
    topics like service discovery and message exchange protocols since the microser-
    vices involved in a service composition are located within a network environment.
    In this Bachelor’s Thesis, I describe a descriptions language to abstractly describe
    the business logic of a service composition. Furthermore, I describe a genera-
    tion process, which compiles this abstract description to a working microservice
    realizing the specified service composition. In addition to that, I provide an
    im- plementation of the generation process, as a proof of concept, and test it
    within a Kubernetes-based cluster environment.
author:
- first_name: Andreas
  full_name: Schürmann, Andreas
  last_name: Schürmann
citation:
  ama: Schürmann A. <i>Microservice-Based Execution Environment for Service Compositions</i>.
    Universität Paderborn; 2017.
  apa: Schürmann, A. (2017). <i>Microservice-based Execution Environment for Service
    Compositions</i>. Universität Paderborn.
  bibtex: '@book{Schürmann_2017, title={Microservice-based Execution Environment for
    Service Compositions}, publisher={Universität Paderborn}, author={Schürmann, Andreas},
    year={2017} }'
  chicago: Schürmann, Andreas. <i>Microservice-Based Execution Environment for Service
    Compositions</i>. Universität Paderborn, 2017.
  ieee: A. Schürmann, <i>Microservice-based Execution Environment for Service Compositions</i>.
    Universität Paderborn, 2017.
  mla: Schürmann, Andreas. <i>Microservice-Based Execution Environment for Service
    Compositions</i>. Universität Paderborn, 2017.
  short: A. Schürmann, Microservice-Based Execution Environment for Service Compositions,
    Universität Paderborn, 2017.
date_created: 2018-06-21T11:09:30Z
date_updated: 2022-01-06T06:59:09Z
department:
- _id: '75'
language:
- iso: eng
project:
- _id: '16'
  name: SFB 901 - Subproject C4
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
title: Microservice-based Execution Environment for Service Compositions
type: bachelorsthesis
user_id: '477'
year: '2017'
...