---
_id: '366'
abstract:
- lang: eng
  text: On-The-Fly (OTF) Computing constitutes an approach towards highly dynamic
    and individualized software markets. Based on service-oriented computing, OTF
    Computing is about realizing global markets of services that can be flexibly combined.
    We report on our current research activities, the security and privacy implications
    thereof, and our approaches to tackle the challenges. Furthermore, we discuss
    how the security and privacy challenges are addressed in research projects similar
    to OTF Computing.
author:
- first_name: Ronald
  full_name: Petrlic, Ronald
  last_name: Petrlic
- first_name: Alexander
  full_name: Jungmann, Alexander
  last_name: Jungmann
- first_name: Marie Christin
  full_name: Platenius, Marie Christin
  last_name: Platenius
- first_name: Wilhelm
  full_name: Schäfer, Wilhelm
  last_name: Schäfer
- first_name: Christoph
  full_name: Sorge, Christoph
  last_name: Sorge
citation:
  ama: 'Petrlic R, Jungmann A, Platenius MC, Schäfer W, Sorge C. Security and Privacy
    Challenges in On-The-Fly Computing. In: <i>Tagungsband Der 4. Konferenz Software-Technologien
    Und -Prozesse (STeP 2014)</i>. ; 2014:131-142.'
  apa: Petrlic, R., Jungmann, A., Platenius, M. C., Schäfer, W., &#38; Sorge, C. (2014).
    Security and Privacy Challenges in On-The-Fly Computing. In <i>Tagungsband der
    4. Konferenz Software-Technologien und -Prozesse (STeP 2014)</i> (pp. 131–142).
  bibtex: '@inproceedings{Petrlic_Jungmann_Platenius_Schäfer_Sorge_2014, title={Security
    and Privacy Challenges in On-The-Fly Computing}, booktitle={Tagungsband der 4.
    Konferenz Software-Technologien und -Prozesse (STeP 2014)}, author={Petrlic, Ronald
    and Jungmann, Alexander and Platenius, Marie Christin and Schäfer, Wilhelm and
    Sorge, Christoph}, year={2014}, pages={131–142} }'
  chicago: Petrlic, Ronald, Alexander Jungmann, Marie Christin Platenius, Wilhelm
    Schäfer, and Christoph Sorge. “Security and Privacy Challenges in On-The-Fly Computing.”
    In <i>Tagungsband Der 4. Konferenz Software-Technologien Und -Prozesse (STeP 2014)</i>,
    131–42, 2014.
  ieee: R. Petrlic, A. Jungmann, M. C. Platenius, W. Schäfer, and C. Sorge, “Security
    and Privacy Challenges in On-The-Fly Computing,” in <i>Tagungsband der 4. Konferenz
    Software-Technologien und -Prozesse (STeP 2014)</i>, 2014, pp. 131–142.
  mla: Petrlic, Ronald, et al. “Security and Privacy Challenges in On-The-Fly Computing.”
    <i>Tagungsband Der 4. Konferenz Software-Technologien Und -Prozesse (STeP 2014)</i>,
    2014, pp. 131–42.
  short: 'R. Petrlic, A. Jungmann, M.C. Platenius, W. Schäfer, C. Sorge, in: Tagungsband
    Der 4. Konferenz Software-Technologien Und -Prozesse (STeP 2014), 2014, pp. 131–142.'
date_created: 2017-10-17T12:42:03Z
date_updated: 2022-01-06T06:59:29Z
ddc:
- '040'
department:
- _id: '76'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:18:47Z
  date_updated: 2018-03-20T07:18:47Z
  file_id: '1405'
  file_name: 366-otf-security-privacy-final.pdf
  file_size: 74488
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:18:47Z
has_accepted_license: '1'
language:
- iso: eng
page: 131-142
project:
- _id: '1'
  name: SFB 901
- _id: '9'
  name: SFB 901 - Subprojekt B1
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '10'
  name: SFB 901 - Subproject B2
publication: Tagungsband der 4. Konferenz Software-Technologien und -Prozesse (STeP
  2014)
status: public
title: Security and Privacy Challenges in On-The-Fly Computing
type: conference
user_id: '477'
year: '2014'
...
---
_id: '3663'
author:
- first_name: Andreas
  full_name: Rausch, Andreas
  last_name: Rausch
- first_name: Jürgen
  full_name: Seifried, Jürgen
  last_name: Seifried
- first_name: Christian
  full_name: Harteis, Christian
  id: '27503'
  last_name: Harteis
  orcid: https://orcid.org/0000-0002-3570-7626
citation:
  ama: 'Rausch A, Seifried J, Harteis C. Ausbleibende Effekte pädagogischer Professionalisierung
    des betrieblichen Ausbildungspersonals: Ergebnisse einer Längsschnittstudie. <i>Zeitschrift
    für Erziehungswissenschaft</i>. 2014;17(Sonderheft):127--147.'
  apa: 'Rausch, A., Seifried, J., &#38; Harteis, C. (2014). Ausbleibende Effekte pädagogischer
    Professionalisierung des betrieblichen Ausbildungspersonals: Ergebnisse einer
    Längsschnittstudie. <i>Zeitschrift Für Erziehungswissenschaft</i>, <i>17</i>(Sonderheft),
    127--147.'
  bibtex: '@article{Rausch_Seifried_Harteis_2014, title={Ausbleibende Effekte pädagogischer
    Professionalisierung des betrieblichen Ausbildungspersonals: Ergebnisse einer
    Längsschnittstudie}, volume={17}, number={Sonderheft}, journal={Zeitschrift für
    Erziehungswissenschaft}, author={Rausch, Andreas and Seifried, Jürgen and Harteis,
    Christian}, year={2014}, pages={127--147} }'
  chicago: 'Rausch, Andreas, Jürgen Seifried, and Christian Harteis. “Ausbleibende
    Effekte Pädagogischer Professionalisierung Des Betrieblichen Ausbildungspersonals:
    Ergebnisse Einer Längsschnittstudie.” <i>Zeitschrift Für Erziehungswissenschaft</i>
    17, no. Sonderheft (2014): 127--147.'
  ieee: 'A. Rausch, J. Seifried, and C. Harteis, “Ausbleibende Effekte pädagogischer
    Professionalisierung des betrieblichen Ausbildungspersonals: Ergebnisse einer
    Längsschnittstudie,” <i>Zeitschrift für Erziehungswissenschaft</i>, vol. 17, no.
    Sonderheft, pp. 127--147, 2014.'
  mla: 'Rausch, Andreas, et al. “Ausbleibende Effekte Pädagogischer Professionalisierung
    Des Betrieblichen Ausbildungspersonals: Ergebnisse Einer Längsschnittstudie.”
    <i>Zeitschrift Für Erziehungswissenschaft</i>, vol. 17, no. Sonderheft, 2014,
    pp. 127--147.'
  short: A. Rausch, J. Seifried, C. Harteis, Zeitschrift Für Erziehungswissenschaft
    17 (2014) 127--147.
date_created: 2018-07-23T13:02:02Z
date_updated: 2022-01-06T06:59:29Z
department:
- _id: '452'
intvolume: '        17'
issue: Sonderheft
page: 127--147
publication: Zeitschrift für Erziehungswissenschaft
status: public
title: 'Ausbleibende Effekte pädagogischer Professionalisierung des betrieblichen
  Ausbildungspersonals: Ergebnisse einer Längsschnittstudie'
type: journal_article
user_id: '27503'
volume: 17
year: '2014'
...
---
_id: '3664'
author:
- first_name: David
  full_name: Gijbels, David
  last_name: Gijbels
- first_name: Christian
  full_name: Harteis, Christian
  id: '27503'
  last_name: Harteis
  orcid: https://orcid.org/0000-0002-3570-7626
- first_name: Vincent
  full_name: Donche, Vincent
  last_name: Donche
- first_name: Piet
  full_name: Van den Bossche, Piet
  last_name: Van den Bossche
- first_name: Steffi
  full_name: Maes, Steffi
  last_name: Maes
- first_name: Katrin
  full_name: Temmen, Katrin
  last_name: Temmen
citation:
  ama: 'Gijbels D, Harteis C, Donche V, Van den Bossche P, Maes S, Temmen K. Grasping
    learning during internships: the case of engineering education. In: Harteis C,
    Seifried J, Rausch A, eds. <i>Discourses on Professional Learning</i>. Dordrecht:
    Springer; 2014:177--188.'
  apa: 'Gijbels, D., Harteis, C., Donche, V., Van den Bossche, P., Maes, S., &#38;
    Temmen, K. (2014). Grasping learning during internships: the case of engineering
    education. In C. Harteis, J. Seifried, &#38; A. Rausch (Eds.), <i>Discourses on
    Professional Learning</i> (pp. 177--188). Dordrecht: Springer.'
  bibtex: '@inbook{Gijbels_Harteis_Donche_Van den Bossche_Maes_Temmen_2014, place={Dordrecht},
    title={Grasping learning during internships: the case of engineering education},
    booktitle={Discourses on Professional Learning}, publisher={Springer}, author={Gijbels,
    David and Harteis, Christian and Donche, Vincent and Van den Bossche, Piet and
    Maes, Steffi and Temmen, Katrin}, editor={Harteis, Christian and Seifried, Jürgen
    and Rausch, AndreasEditors}, year={2014}, pages={177--188} }'
  chicago: 'Gijbels, David, Christian Harteis, Vincent Donche, Piet Van den Bossche,
    Steffi Maes, and Katrin Temmen. “Grasping Learning during Internships: The Case
    of Engineering Education.” In <i>Discourses on Professional Learning</i>, edited
    by Christian Harteis, Jürgen Seifried, and Andreas Rausch, 177--188. Dordrecht:
    Springer, 2014.'
  ieee: 'D. Gijbels, C. Harteis, V. Donche, P. Van den Bossche, S. Maes, and K. Temmen,
    “Grasping learning during internships: the case of engineering education,” in
    <i>Discourses on Professional Learning</i>, C. Harteis, J. Seifried, and A. Rausch,
    Eds. Dordrecht: Springer, 2014, pp. 177--188.'
  mla: 'Gijbels, David, et al. “Grasping Learning during Internships: The Case of
    Engineering Education.” <i>Discourses on Professional Learning</i>, edited by
    Christian Harteis et al., Springer, 2014, pp. 177--188.'
  short: 'D. Gijbels, C. Harteis, V. Donche, P. Van den Bossche, S. Maes, K. Temmen,
    in: C. Harteis, J. Seifried, A. Rausch (Eds.), Discourses on Professional Learning,
    Springer, Dordrecht, 2014, pp. 177--188.'
date_created: 2018-07-23T13:03:54Z
date_updated: 2022-01-06T06:59:29Z
department:
- _id: '452'
editor:
- first_name: Christian
  full_name: Harteis, Christian
  last_name: Harteis
- first_name: Jürgen
  full_name: Seifried, Jürgen
  last_name: Seifried
- first_name: Andreas
  full_name: Rausch, Andreas
  last_name: Rausch
page: 177--188
place: Dordrecht
publication: Discourses on Professional Learning
publisher: Springer
status: public
title: 'Grasping learning during internships: the case of engineering education'
type: book_chapter
user_id: '27503'
year: '2014'
...
---
_id: '3665'
author:
- first_name: Christian
  full_name: Harteis, Christian
  id: '27503'
  last_name: Harteis
  orcid: https://orcid.org/0000-0002-3570-7626
- first_name: Andreas
  full_name: Rausch, Andreas
  last_name: Rausch
- first_name: Jürgen
  full_name: Seifried, Jürgen
  last_name: Seifried
citation:
  ama: 'Harteis C, Rausch A, Seifried J. Discourses on professional learning: On the
    boundary between learning and working. In: Harteis C, Seifried J, Rausch A, eds.
    <i>Discourses on Professional Learning</i>. Dordrecht: Springer; 2014:1--7.'
  apa: 'Harteis, C., Rausch, A., &#38; Seifried, J. (2014). Discourses on professional
    learning: On the boundary between learning and working. In C. Harteis, J. Seifried,
    &#38; A. Rausch (Eds.), <i>Discourses on Professional Learning</i> (pp. 1--7).
    Dordrecht: Springer.'
  bibtex: '@inbook{Harteis_Rausch_Seifried_2014, place={Dordrecht}, title={Discourses
    on professional learning: On the boundary between learning and working}, booktitle={Discourses
    on Professional Learning}, publisher={Springer}, author={Harteis, Christian and
    Rausch, Andreas and Seifried, Jürgen}, editor={Harteis, Christian and Seifried,
    Jürgen and Rausch, AndreasEditors}, year={2014}, pages={1--7} }'
  chicago: 'Harteis, Christian, Andreas Rausch, and Jürgen Seifried. “Discourses on
    Professional Learning: On the Boundary between Learning and Working.” In <i>Discourses
    on Professional Learning</i>, edited by Christian Harteis, Jürgen Seifried, and
    Andreas Rausch, 1--7. Dordrecht: Springer, 2014.'
  ieee: 'C. Harteis, A. Rausch, and J. Seifried, “Discourses on professional learning:
    On the boundary between learning and working,” in <i>Discourses on Professional
    Learning</i>, C. Harteis, J. Seifried, and A. Rausch, Eds. Dordrecht: Springer,
    2014, pp. 1--7.'
  mla: 'Harteis, Christian, et al. “Discourses on Professional Learning: On the Boundary
    between Learning and Working.” <i>Discourses on Professional Learning</i>, edited
    by Christian Harteis et al., Springer, 2014, pp. 1--7.'
  short: 'C. Harteis, A. Rausch, J. Seifried, in: C. Harteis, J. Seifried, A. Rausch
    (Eds.), Discourses on Professional Learning, Springer, Dordrecht, 2014, pp. 1--7.'
date_created: 2018-07-23T13:05:13Z
date_updated: 2022-01-06T06:59:29Z
department:
- _id: '452'
editor:
- first_name: Christian
  full_name: Harteis, Christian
  last_name: Harteis
- first_name: Jürgen
  full_name: Seifried, Jürgen
  last_name: Seifried
- first_name: Andreas
  full_name: Rausch, Andreas
  last_name: Rausch
page: 1--7
place: Dordrecht
publication: Discourses on Professional Learning
publisher: Springer
status: public
title: 'Discourses on professional learning: On the boundary between learning and
  working'
type: book_chapter
user_id: '27503'
year: '2014'
...
---
_id: '3666'
citation:
  ama: 'Harteis C, Rausch A, Seifried J, eds. <i>Discourses on Professional Learning</i>.
    Dordrecht: Springer; 2014.'
  apa: 'Harteis, C., Rausch, A., &#38; Seifried, J. (Eds.). (2014). <i>Discourses
    on professional learning</i>. Dordrecht: Springer.'
  bibtex: '@book{Harteis_Rausch_Seifried_2014, place={Dordrecht}, title={Discourses
    on professional learning}, publisher={Springer}, year={2014} }'
  chicago: 'Harteis, Christian, Andreas Rausch, and Jürgen Seifried, eds. <i>Discourses
    on Professional Learning</i>. Dordrecht: Springer, 2014.'
  ieee: 'C. Harteis, A. Rausch, and J. Seifried, Eds., <i>Discourses on professional
    learning</i>. Dordrecht: Springer, 2014.'
  mla: Harteis, Christian, et al., editors. <i>Discourses on Professional Learning</i>.
    Springer, 2014.
  short: C. Harteis, A. Rausch, J. Seifried, eds., Discourses on Professional Learning,
    Springer, Dordrecht, 2014.
date_created: 2018-07-23T13:07:39Z
date_updated: 2022-01-06T06:59:29Z
department:
- _id: '452'
editor:
- first_name: Christian
  full_name: Harteis, Christian
  id: '27503'
  last_name: Harteis
  orcid: https://orcid.org/0000-0002-3570-7626
- first_name: Andreas
  full_name: Rausch, Andreas
  last_name: Rausch
- first_name: Jürgen
  full_name: Seifried, Jürgen
  last_name: Seifried
place: Dordrecht
publisher: Springer
status: public
title: Discourses on professional learning
type: book_editor
user_id: '27503'
year: '2014'
...
---
_id: '3667'
author:
- first_name: Christian
  full_name: Harteis, Christian
  id: '27503'
  last_name: Harteis
  orcid: https://orcid.org/0000-0002-3570-7626
- first_name: Johannes
  full_name: Bauer, Johannes
  last_name: Bauer
citation:
  ama: 'Harteis C, Bauer J. Learning from errors at work. In: Billett S, Harteis C,
    Gruber H, eds. <i>International Handbook of Research in Professional and Practice-Based
    Learning</i>. ; 2014:699--732.'
  apa: Harteis, C., &#38; Bauer, J. (2014). Learning from errors at work. In S. Billett,
    C. Harteis, &#38; H. Gruber (Eds.), <i>International handbook of research in professional
    and practice-based learning</i> (pp. 699--732).
  bibtex: '@inbook{Harteis_Bauer_2014, title={Learning from errors at work}, booktitle={International
    handbook of research in professional and practice-based learning}, author={Harteis,
    Christian and Bauer, Johannes}, editor={Billett, Stephen and Harteis, Christian
    and Gruber, HansEditors}, year={2014}, pages={699--732} }'
  chicago: Harteis, Christian, and Johannes Bauer. “Learning from Errors at Work.”
    In <i>International Handbook of Research in Professional and Practice-Based Learning</i>,
    edited by Stephen Billett, Christian Harteis, and Hans Gruber, 699--732, 2014.
  ieee: C. Harteis and J. Bauer, “Learning from errors at work,” in <i>International
    handbook of research in professional and practice-based learning</i>, S. Billett,
    C. Harteis, and H. Gruber, Eds. 2014, pp. 699--732.
  mla: Harteis, Christian, and Johannes Bauer. “Learning from Errors at Work.” <i>International
    Handbook of Research in Professional and Practice-Based Learning</i>, edited by
    Stephen Billett et al., 2014, pp. 699--732.
  short: 'C. Harteis, J. Bauer, in: S. Billett, C. Harteis, H. Gruber (Eds.), International
    Handbook of Research in Professional and Practice-Based Learning, 2014, pp. 699--732.'
date_created: 2018-07-23T13:08:09Z
date_updated: 2022-01-06T06:59:29Z
department:
- _id: '452'
editor:
- first_name: Stephen
  full_name: Billett, Stephen
  last_name: Billett
- first_name: Christian
  full_name: Harteis, Christian
  last_name: Harteis
- first_name: Hans
  full_name: Gruber, Hans
  last_name: Gruber
page: 699--732
publication: International handbook of research in professional and practice-based
  learning
status: public
title: Learning from errors at work
type: book_chapter
user_id: '27503'
year: '2014'
...
---
_id: '3668'
citation:
  ama: 'Billett S, Harteis C, Gruber H, eds. <i>International Handbook of Research
    in Professional and Practice-Based Learning</i>. Dordrecht: Springer; 2014.'
  apa: 'Billett, S., Harteis, C., &#38; Gruber, H. (Eds.). (2014). <i>International
    handbook of research in professional and practice-based learning</i>. Dordrecht:
    Springer.'
  bibtex: '@book{Billett_Harteis_Gruber_2014, place={Dordrecht}, title={International
    handbook of research in professional and practice-based learning}, publisher={Springer},
    year={2014} }'
  chicago: 'Billett, Stephen, Christian Harteis, and Hans Gruber, eds. <i>International
    Handbook of Research in Professional and Practice-Based Learning</i>. Dordrecht:
    Springer, 2014.'
  ieee: 'S. Billett, C. Harteis, and H. Gruber, Eds., <i>International handbook of
    research in professional and practice-based learning</i>. Dordrecht: Springer,
    2014.'
  mla: Billett, Stephen, et al., editors. <i>International Handbook of Research in
    Professional and Practice-Based Learning</i>. Springer, 2014.
  short: S. Billett, C. Harteis, H. Gruber, eds., International Handbook of Research
    in Professional and Practice-Based Learning, Springer, Dordrecht, 2014.
date_created: 2018-07-23T13:10:22Z
date_updated: 2022-01-06T06:59:29Z
department:
- _id: '452'
editor:
- first_name: Stephen
  full_name: Billett, Stephen
  last_name: Billett
- first_name: Christian
  full_name: Harteis, Christian
  id: '27503'
  last_name: Harteis
  orcid: https://orcid.org/0000-0002-3570-7626
- first_name: Hans
  full_name: Gruber, Hans
  last_name: Gruber
place: Dordrecht
publisher: Springer
status: public
title: International handbook of research in professional and practice-based learning
type: book_editor
user_id: '27503'
year: '2014'
...
---
_id: '367'
abstract:
- lang: eng
  text: Online social networks are attracting billions of nowadays, both on a global
    scale as well as in social enterprise networks. Using distributed hash tables
    and peer-to-peer technology allows online social networks to be operated securely
    and efficiently only by using the resources of the user devices, thus alleviating
    censorship or data misuse by a single network operator. In this paper, we address
    the challenges that arise in implementing reliably and conveniently to use distributed
    data structures, such as lists or sets, in such a distributed hash-tablebased
    online social network. We present a secure, distributed list data structure that
    manages the list entries in several buckets in the distributed hash table. The
    list entries are authenticated, integrity is maintained and access control for
    single users and also groups is integrated. The approach for secure distributed
    lists is also applied for prefix trees and sets, and implemented and evaluated
    in a peer-to-peer framework for social networks. Evaluation shows that the distributed
    data structure is convenient and efficient to use and that the requirements on
    security hold.
author:
- first_name: Jens
  full_name: Janiuk, Jens
  last_name: Janiuk
- first_name: Alexander
  full_name: Mäcker, Alexander
  id: '13536'
  last_name: Mäcker
- first_name: Kalman
  full_name: Graffi, Kalman
  last_name: Graffi
citation:
  ama: 'Janiuk J, Mäcker A, Graffi K. Secure Distributed Data Structures for Peer-to-Peer-based
    Social Networks. In: <i>Proceedings of the International Conference on Collaboration
    Technologies and Systems (CTS)</i>. ; 2014:396-405. doi:<a href="https://doi.org/10.1109/CTS.2014.6867595">10.1109/CTS.2014.6867595</a>'
  apa: Janiuk, J., Mäcker, A., &#38; Graffi, K. (2014). Secure Distributed Data Structures
    for Peer-to-Peer-based Social Networks. In <i>Proceedings of the International
    Conference on Collaboration Technologies and Systems (CTS)</i> (pp. 396–405).
    <a href="https://doi.org/10.1109/CTS.2014.6867595">https://doi.org/10.1109/CTS.2014.6867595</a>
  bibtex: '@inproceedings{Janiuk_Mäcker_Graffi_2014, title={Secure Distributed Data
    Structures for Peer-to-Peer-based Social Networks}, DOI={<a href="https://doi.org/10.1109/CTS.2014.6867595">10.1109/CTS.2014.6867595</a>},
    booktitle={Proceedings of the International Conference on Collaboration Technologies
    and Systems (CTS)}, author={Janiuk, Jens and Mäcker, Alexander and Graffi, Kalman},
    year={2014}, pages={396–405} }'
  chicago: Janiuk, Jens, Alexander Mäcker, and Kalman Graffi. “Secure Distributed
    Data Structures for Peer-to-Peer-Based Social Networks.” In <i>Proceedings of
    the International Conference on Collaboration Technologies and Systems (CTS)</i>,
    396–405, 2014. <a href="https://doi.org/10.1109/CTS.2014.6867595">https://doi.org/10.1109/CTS.2014.6867595</a>.
  ieee: J. Janiuk, A. Mäcker, and K. Graffi, “Secure Distributed Data Structures for
    Peer-to-Peer-based Social Networks,” in <i>Proceedings of the International Conference
    on Collaboration Technologies and Systems (CTS)</i>, 2014, pp. 396–405.
  mla: Janiuk, Jens, et al. “Secure Distributed Data Structures for Peer-to-Peer-Based
    Social Networks.” <i>Proceedings of the International Conference on Collaboration
    Technologies and Systems (CTS)</i>, 2014, pp. 396–405, doi:<a href="https://doi.org/10.1109/CTS.2014.6867595">10.1109/CTS.2014.6867595</a>.
  short: 'J. Janiuk, A. Mäcker, K. Graffi, in: Proceedings of the International Conference
    on Collaboration Technologies and Systems (CTS), 2014, pp. 396–405.'
date_created: 2017-10-17T12:42:03Z
date_updated: 2022-01-06T06:59:29Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/CTS.2014.6867595
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:18:12Z
  date_updated: 2018-03-20T07:18:12Z
  file_id: '1404'
  file_name: 367-cts_conf.pdf
  file_size: 647997
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:18:12Z
has_accepted_license: '1'
language:
- iso: eng
page: 396-405
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the International Conference on Collaboration Technologies
  and Systems (CTS)
status: public
title: Secure Distributed Data Structures for Peer-to-Peer-based Social Networks
type: conference
user_id: '477'
year: '2014'
...
---
_id: '3678'
author:
- first_name: Anna Liza
  full_name: Daunert, Anna Liza
  last_name: Daunert
- first_name: Christian
  full_name: Harteis, Christian
  id: '27503'
  last_name: Harteis
  orcid: https://orcid.org/0000-0002-3570-7626
citation:
  ama: 'Daunert AL, Harteis C. Pre-service teachers’ perspectives and practices in
    utilizing ubiquitous technologies for academic-oriented learning and knowledge
    management. In: Pelet J-E, ed. <i>E-Learning 2.0 Technologies and Web Applications
    in Higher Education</i>. Hershey: IGI Global; 2014:254--272.'
  apa: 'Daunert, A. L., &#38; Harteis, C. (2014). Pre-service teachers’ perspectives
    and practices in utilizing ubiquitous technologies for academic-oriented learning
    and knowledge management. In J.-E. Pelet (Ed.), <i>E-Learning 2.0 Technologies
    and Web Applications in Higher Education</i> (pp. 254--272). Hershey: IGI Global.'
  bibtex: '@inbook{Daunert_Harteis_2014, place={Hershey}, title={Pre-service teachers’
    perspectives and practices in utilizing ubiquitous technologies for academic-oriented
    learning and knowledge management}, booktitle={E-Learning 2.0 Technologies and
    Web Applications in Higher Education}, publisher={IGI Global}, author={Daunert,
    Anna Liza and Harteis, Christian}, editor={Pelet, J.-E.Editor}, year={2014}, pages={254--272}
    }'
  chicago: 'Daunert, Anna Liza, and Christian Harteis. “Pre-Service Teachers’ Perspectives
    and Practices in Utilizing Ubiquitous Technologies for Academic-Oriented Learning
    and Knowledge Management.” In <i>E-Learning 2.0 Technologies and Web Applications
    in Higher Education</i>, edited by J.-E. Pelet, 254--272. Hershey: IGI Global,
    2014.'
  ieee: 'A. L. Daunert and C. Harteis, “Pre-service teachers’ perspectives and practices
    in utilizing ubiquitous technologies for academic-oriented learning and knowledge
    management,” in <i>E-Learning 2.0 Technologies and Web Applications in Higher
    Education</i>, J.-E. Pelet, Ed. Hershey: IGI Global, 2014, pp. 254--272.'
  mla: Daunert, Anna Liza, and Christian Harteis. “Pre-Service Teachers’ Perspectives
    and Practices in Utilizing Ubiquitous Technologies for Academic-Oriented Learning
    and Knowledge Management.” <i>E-Learning 2.0 Technologies and Web Applications
    in Higher Education</i>, edited by J.-E. Pelet, IGI Global, 2014, pp. 254--272.
  short: 'A.L. Daunert, C. Harteis, in: J.-E. Pelet (Ed.), E-Learning 2.0 Technologies
    and Web Applications in Higher Education, IGI Global, Hershey, 2014, pp. 254--272.'
date_created: 2018-07-23T13:24:44Z
date_updated: 2022-01-06T06:59:29Z
department:
- _id: '452'
editor:
- first_name: J.-E.
  full_name: Pelet, J.-E.
  last_name: Pelet
page: 254--272
place: Hershey
publication: E-Learning 2.0 Technologies and Web Applications in Higher Education
publisher: IGI Global
status: public
title: Pre-service teachers’ perspectives and practices in utilizing ubiquitous technologies
  for academic-oriented learning and knowledge management
type: book_chapter
user_id: '27503'
year: '2014'
...
---
_id: '368'
abstract:
- lang: eng
  text: We consider the problem of scheduling a number of jobs on $m$ identical processors
    sharing a continuously divisible resource. Each job j comes with a resource requirement
    r_j \in {0,1}. The job can be processed at full speed if granted its full resource
    requirement. If receiving only an x-portion of r_j, it is processed at an x-fraction
    of the full speed. Our goal is to find a resource assignment that minimizes the
    makespan (i.e., the latest completion time). Variants of such problems, relating
    the resource assignment of jobs to their \emph{processing speeds}, have been studied
    under the term discrete-continuous scheduling. Known results are either very pessimistic
    or heuristic in nature.In this paper, we suggest and analyze a slightly simplified
    model. It focuses on the assignment of shared continuous resources to the processors.
    The job assignment to processors and the ordering of the jobs have already been
    fixed. It is shown that, even for unit size jobs, finding an optimal solution
    is NP-hard if the number of processors is part of the input. Positive results
    for unit size jobs include an efficient optimal algorithm for 2 processors. Moreover,
    we prove that balanced schedules yield a 2-1/m-approximation for a fixed number
    of processors. Such schedules are computed by our GreedyBalance algorithm, for
    which the bound is tight.
author:
- first_name: Andre
  full_name: Brinkmann, Andre
  last_name: Brinkmann
- first_name: Peter
  full_name: Kling, Peter
  last_name: Kling
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Lars
  full_name: Nagel, Lars
  last_name: Nagel
- first_name: Sören
  full_name: Riechers, Sören
  last_name: Riechers
- first_name: 'Tim '
  full_name: 'Suess, Tim '
  last_name: Suess
citation:
  ama: 'Brinkmann A, Kling P, Meyer auf der Heide F, Nagel L, Riechers S, Suess T.
    Scheduling Shared Continuous Resources on Many-Cores. In: <i>Proceedings of the
    26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>.
    ; 2014:128-137. doi:<a href="https://doi.org/10.1145/2612669.2612698">10.1145/2612669.2612698</a>'
  apa: Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L., Riechers, S.,
    &#38; Suess, T. (2014). Scheduling Shared Continuous Resources on Many-Cores.
    <i>Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures
    (SPAA)</i>, 128–137. <a href="https://doi.org/10.1145/2612669.2612698">https://doi.org/10.1145/2612669.2612698</a>
  bibtex: '@inproceedings{Brinkmann_Kling_Meyer auf der Heide_Nagel_Riechers_Suess_2014,
    title={Scheduling Shared Continuous Resources on Many-Cores}, DOI={<a href="https://doi.org/10.1145/2612669.2612698">10.1145/2612669.2612698</a>},
    booktitle={Proceedings of the 26th ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA)}, author={Brinkmann, Andre and Kling, Peter and Meyer
    auf der Heide, Friedhelm and Nagel, Lars and Riechers, Sören and Suess, Tim },
    year={2014}, pages={128–137} }'
  chicago: Brinkmann, Andre, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel,
    Sören Riechers, and Tim  Suess. “Scheduling Shared Continuous Resources on Many-Cores.”
    In <i>Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures
    (SPAA)</i>, 128–37, 2014. <a href="https://doi.org/10.1145/2612669.2612698">https://doi.org/10.1145/2612669.2612698</a>.
  ieee: 'A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S. Riechers, and
    T. Suess, “Scheduling Shared Continuous Resources on Many-Cores,” in <i>Proceedings
    of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>,
    2014, pp. 128–137, doi: <a href="https://doi.org/10.1145/2612669.2612698">10.1145/2612669.2612698</a>.'
  mla: Brinkmann, Andre, et al. “Scheduling Shared Continuous Resources on Many-Cores.”
    <i>Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures
    (SPAA)</i>, 2014, pp. 128–37, doi:<a href="https://doi.org/10.1145/2612669.2612698">10.1145/2612669.2612698</a>.
  short: 'A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S. Riechers, T.
    Suess, in: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA), 2014, pp. 128–137.'
date_created: 2017-10-17T12:42:03Z
date_updated: 2022-01-06T06:59:30Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1145/2612669.2612698
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:17:38Z
  date_updated: 2018-03-20T07:17:38Z
  file_id: '1403'
  file_name: 368-BKMNRS14.pdf
  file_size: 485767
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:17:38Z
has_accepted_license: '1'
language:
- iso: eng
page: 128-137
project:
- _id: '1'
  name: SFB 901
- _id: '16'
  name: SFB 901 - Subprojekt C4
- _id: '14'
  name: SFB 901 - Subproject C2
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and
  Architectures (SPAA)
status: public
title: Scheduling Shared Continuous Resources on Many-Cores
type: conference
user_id: '15415'
year: '2014'
...
---
_id: '3685'
author:
- first_name: Michael
  full_name: Goller, Michael
  id: '30984'
  last_name: Goller
  orcid: 0000-0002-2820-9178
- first_name: Christian
  full_name: Harteis, Christian
  id: '27503'
  last_name: Harteis
  orcid: https://orcid.org/0000-0002-3570-7626
citation:
  ama: 'Goller M, Harteis C. Employing agency in academic settings: Doctoral students
    shaping their own experiences. In: Harteis C, Rausch A, Seifried J, eds. <i>Discourses
    on Professional Learning</i>. Dordrecht: Springer; 2014:189--210.'
  apa: 'Goller, M., &#38; Harteis, C. (2014). Employing agency in academic settings:
    Doctoral students shaping their own experiences. In C. Harteis, A. Rausch, &#38;
    J. Seifried (Eds.), <i>Discourses on Professional Learning</i> (pp. 189--210).
    Dordrecht: Springer.'
  bibtex: '@inbook{Goller_Harteis_2014, place={Dordrecht}, title={Employing agency
    in academic settings: Doctoral students shaping their own experiences}, booktitle={Discourses
    on Professional Learning}, publisher={Springer}, author={Goller, Michael and Harteis,
    Christian}, editor={Harteis, Christian and Rausch, Andreas and Seifried, JürgenEditors},
    year={2014}, pages={189--210} }'
  chicago: 'Goller, Michael, and Christian Harteis. “Employing Agency in Academic
    Settings: Doctoral Students Shaping Their Own Experiences.” In <i>Discourses on
    Professional Learning</i>, edited by Christian Harteis, Andreas Rausch, and Jürgen
    Seifried, 189--210. Dordrecht: Springer, 2014.'
  ieee: 'M. Goller and C. Harteis, “Employing agency in academic settings: Doctoral
    students shaping their own experiences,” in <i>Discourses on Professional Learning</i>,
    C. Harteis, A. Rausch, and J. Seifried, Eds. Dordrecht: Springer, 2014, pp. 189--210.'
  mla: 'Goller, Michael, and Christian Harteis. “Employing Agency in Academic Settings:
    Doctoral Students Shaping Their Own Experiences.” <i>Discourses on Professional
    Learning</i>, edited by Christian Harteis et al., Springer, 2014, pp. 189--210.'
  short: 'M. Goller, C. Harteis, in: C. Harteis, A. Rausch, J. Seifried (Eds.), Discourses
    on Professional Learning, Springer, Dordrecht, 2014, pp. 189--210.'
date_created: 2018-07-23T13:36:48Z
date_updated: 2022-01-06T06:59:30Z
department:
- _id: '452'
editor:
- first_name: Christian
  full_name: Harteis, Christian
  last_name: Harteis
- first_name: Andreas
  full_name: Rausch, Andreas
  last_name: Rausch
- first_name: Jürgen
  full_name: Seifried, Jürgen
  last_name: Seifried
page: 189--210
place: Dordrecht
publication: Discourses on Professional Learning
publisher: Springer
status: public
title: 'Employing agency in academic settings: Doctoral students shaping their own
  experiences'
type: book_chapter
user_id: '27503'
year: '2014'
...
---
_id: '3686'
author:
- first_name: Christian
  full_name: Harteis, Christian
  id: '27503'
  last_name: Harteis
  orcid: https://orcid.org/0000-0002-3570-7626
- first_name: Michael
  full_name: Goller, Michael
  id: '30984'
  last_name: Goller
  orcid: 0000-0002-2820-9178
citation:
  ama: 'Harteis C, Goller M. New skills for new jobs: Work agency as a necessary condition
    for successful lifelong learning. In: Halttunen T, Koivisto M, Billett S, eds.
    <i>Promoting, Assessing, Recognizing and Certifying Lifelong Learning</i>. Dordrecht:
    Springer; 2014:37--56.'
  apa: 'Harteis, C., &#38; Goller, M. (2014). New skills for new jobs: Work agency
    as a necessary condition for successful lifelong learning. In T. Halttunen, M.
    Koivisto, &#38; S. Billett (Eds.), <i>Promoting, assessing, recognizing and certifying
    lifelong learning</i> (pp. 37--56). Dordrecht: Springer.'
  bibtex: '@inbook{Harteis_Goller_2014, place={Dordrecht}, title={New skills for new
    jobs: Work agency as a necessary condition for successful lifelong learning},
    booktitle={Promoting, assessing, recognizing and certifying lifelong learning},
    publisher={Springer}, author={Harteis, Christian and Goller, Michael}, editor={Halttunen,
    Timo and Koivisto, Mari and Billett, StephenEditors}, year={2014}, pages={37--56}
    }'
  chicago: 'Harteis, Christian, and Michael Goller. “New Skills for New Jobs: Work
    Agency as a Necessary Condition for Successful Lifelong Learning.” In <i>Promoting,
    Assessing, Recognizing and Certifying Lifelong Learning</i>, edited by Timo Halttunen,
    Mari Koivisto, and Stephen Billett, 37--56. Dordrecht: Springer, 2014.'
  ieee: 'C. Harteis and M. Goller, “New skills for new jobs: Work agency as a necessary
    condition for successful lifelong learning,” in <i>Promoting, assessing, recognizing
    and certifying lifelong learning</i>, T. Halttunen, M. Koivisto, and S. Billett,
    Eds. Dordrecht: Springer, 2014, pp. 37--56.'
  mla: 'Harteis, Christian, and Michael Goller. “New Skills for New Jobs: Work Agency
    as a Necessary Condition for Successful Lifelong Learning.” <i>Promoting, Assessing,
    Recognizing and Certifying Lifelong Learning</i>, edited by Timo Halttunen et
    al., Springer, 2014, pp. 37--56.'
  short: 'C. Harteis, M. Goller, in: T. Halttunen, M. Koivisto, S. Billett (Eds.),
    Promoting, Assessing, Recognizing and Certifying Lifelong Learning, Springer,
    Dordrecht, 2014, pp. 37--56.'
date_created: 2018-07-23T13:38:10Z
date_updated: 2022-01-06T06:59:30Z
department:
- _id: '452'
editor:
- first_name: Timo
  full_name: Halttunen, Timo
  last_name: Halttunen
- first_name: Mari
  full_name: Koivisto, Mari
  last_name: Koivisto
- first_name: Stephen
  full_name: Billett, Stephen
  last_name: Billett
page: 37--56
place: Dordrecht
publication: Promoting, assessing, recognizing and certifying lifelong learning
publisher: Springer
status: public
title: 'New skills for new jobs: Work agency as a necessary condition for successful
  lifelong learning'
type: book_chapter
user_id: '27503'
year: '2014'
...
---
_id: '369'
abstract:
- lang: eng
  text: 'RSA Full Domain Hash ist im Zufallsorakelmodell ein EUF-CMA sicheres Signaturverfahren
    (existentially unforgeable under chosen-message attacks). Der Sicherheitsbeweis
    wird unter anderem in der Vorlesung Einf{\"u}hrung in die Kryptographie vorgestellt.
    Auch bei einer genaueren Analyse verliert man bei der Reduktion einen Faktor \nicefrac{1}{q_{s}}(wobei
    q_{s}die Anzahl der Anfragen an das Signaturorakel darstellt), was f{\"u}r die
    Praxis in relativ großen Systemparametern (RSA-Modul) resultiert [1].Seit der
    Ver{\"o}ffentlichung von [2] wurde geglaubt, dass der Faktor \nicefrac{1}{q_{s}}optimal
    ist. Erst zehn Jahre sp{\"a}ter offenbarten die Autoren von [3] einen Fehler in
    [2] und zeigten eine bessere Reduktion allerdings unter einer etwas st{\"a}rkeren
    Sicherheitsannahme.Die Ergebnisse aus [3] lassen sich auf PSS-Verfahren (Probabilistic
    Signature Scheme), das z.B. in PKCS #1 benutzt wird, {\"u}bertragen und sind somit
    von großer Bedeutung f{\"u}r die Praxis. Weiterhin sind die in den Beweisen verwendete
    Techniken n{\"u}tzlich auch bei anderen kryptographischen Verfahren.In Rahmen
    dieser Arbeit sollen die entsprechenden Sicherheitsbeweise aufgearbeitet und dessen
    Auswirkungen f{\"u}r die Praxis analysiert werden.[1] J.S. Coron, “On the Exact
    Security of Full Domain Hash”, CRYPTO 2000. LNCS 1880, pp. 229-235, 2000.[2] J.S.
    Coron, “Optimal security proofs for PPS and other signature schemes”, EUROCRYPT
    2002. LNCS 2332, pp 272-287, 2002.[3] S.A. Kakvi and E. Kiltz, “Optimal Security
    Proofs for Full Domain Hash, Revisited”, in EUROCRYPT 2012. LNCS 7237, pp 537-553,
    2012.'
author:
- first_name: Timo
  full_name: Rath, Timo
  last_name: Rath
citation:
  ama: Rath T. <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn; 2014.
  apa: Rath, T. (2014). <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn.
  bibtex: '@book{Rath_2014, title={RSA-Full Domain Hash Revisited}, publisher={Universität
    Paderborn}, author={Rath, Timo}, year={2014} }'
  chicago: Rath, Timo. <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn,
    2014.
  ieee: T. Rath, <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn, 2014.
  mla: Rath, Timo. <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn, 2014.
  short: T. Rath, RSA-Full Domain Hash Revisited, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:04Z
date_updated: 2022-01-06T06:59:30Z
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: RSA-Full Domain Hash Revisited
type: bachelorsthesis
user_id: '477'
year: '2014'
...
---
_id: '3699'
abstract:
- lang: eng
  text: When taxes on capital or wealth are levied, in most countries companies have
    to be assessed in terms of their market value (MV). Estimating the MV of private
    companies for tax purposes is a challenging task for tax authorities as MVs are
    not available. In this study, I empirically analyse to what extent an accounting-based
    tax valuation method for private companies, a simplified residual income model,
    succeeds in matching the MV. I refer to the mandatory Standardised Combination
    Model that is a special case of methods commonly used in several countries. In
    the absence of market prices for private companies, I use a sample of small German
    public companies as a proxy. I validate this approach using a sensitivity analysis
    that involves matching the sample of public companies with that of private companies.
    The results imply that the mandatory Standardised Combination Model leads to a
    severe unequal treatment not only between public and private companies but also
    among private companies across and within industries. Furthermore, I simulate
    the effects of variation in the key parameters and highlight their impact on the
    approximation quality of the Standardised Combination Method. The findings are
    relevant to tax reform discussions as well as to tax policy-makers and practitioners
    in many countries.
article_type: original
author:
- first_name: Jens
  full_name: Müller, Jens
  id: '1245'
  last_name: Müller
citation:
  ama: Müller J. The challenge of assessing the market value of private companies
    using a standardised combination method for tax purposes--Lessons to be learnt
    from past experience. <i>European Accounting Review</i>. 2014;(1):117--141.
  apa: Müller, J. (2014). The challenge of assessing the market value of private companies
    using a standardised combination method for tax purposes--Lessons to be learnt
    from past experience. <i>European Accounting Review</i>, (1), 117--141.
  bibtex: '@article{Müller_2014, title={The challenge of assessing the market value
    of private companies using a standardised combination method for tax purposes--Lessons
    to be learnt from past experience}, number={1}, journal={European Accounting Review},
    author={Müller, Jens}, year={2014}, pages={117--141} }'
  chicago: 'Müller, Jens. “The Challenge of Assessing the Market Value of Private
    Companies Using a Standardised Combination Method for Tax Purposes--Lessons to
    Be Learnt from Past Experience.” <i>European Accounting Review</i>, no. 1 (2014):
    117--141.'
  ieee: J. Müller, “The challenge of assessing the market value of private companies
    using a standardised combination method for tax purposes--Lessons to be learnt
    from past experience,” <i>European Accounting Review</i>, no. 1, pp. 117--141,
    2014.
  mla: Müller, Jens. “The Challenge of Assessing the Market Value of Private Companies
    Using a Standardised Combination Method for Tax Purposes--Lessons to Be Learnt
    from Past Experience.” <i>European Accounting Review</i>, no. 1, 2014, pp. 117--141.
  short: J. Müller, European Accounting Review (2014) 117--141.
date_created: 2018-07-25T07:53:11Z
date_updated: 2022-01-06T06:59:30Z
department:
- _id: '189'
issue: '1'
jel:
- H2
- M41
keyword:
- Challenge of Assessing
- Tax Purposes
language:
- iso: eng
page: 117--141
publication: European Accounting Review
status: public
title: The challenge of assessing the market value of private companies using a standardised
  combination method for tax purposes--Lessons to be learnt from past experience
type: journal_article
user_id: '48187'
year: '2014'
...
---
_id: '370'
abstract:
- lang: eng
  text: 'Max-min fairness (MMF) is a widely known approach to a fair allocation of
    bandwidth to each of the users in a network. This allocation can be computed by
    uniformly raising the bandwidths of all users without violating capacity constraints.
    We consider an extension of these allocations by raising the bandwidth with arbitrary
    and not necessarily uniform time-depending velocities (allocation rates). These
    allocations are used in a game-theoretic context for routing choices, which we
    formalize in progressive filling games (PFGs).We present a variety of results
    for equilibria in PFGs. We show that these games possess pure Nash and strong
    equilibria. While computation in general is NP-hard, there are polynomial-time
    algorithms for prominent classes of Max-Min-Fair Games (MMFG), including the case
    when all users have the same source-destination pair. We characterize prices of
    anarchy and stability for pure Nash and strong equilibria in PFGs and MMFGs when
    players have different or the same source-destination pairs. In addition, we show
    that when a designer can adjust allocation rates, it is possible to design games
    with optimal strong equilibria. Some initial results on polynomial-time algorithms
    in this direction are also derived. '
author:
- first_name: Tobias
  full_name: Harks, Tobias
  last_name: Harks
- first_name: Martin
  full_name: Höfer, Martin
  last_name: Höfer
- first_name: Kevin
  full_name: Schewior, Kevin
  last_name: Schewior
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
citation:
  ama: 'Harks T, Höfer M, Schewior K, Skopalik A. Routing Games with Progressive Filling.
    In: <i>Proceedings of the 33rd Annual IEEE International Conference on Computer
    Communications (INFOCOM’14)</i>. ; 2014:352-360. doi:<a href="https://doi.org/10.1109/TNET.2015.2468571">10.1109/TNET.2015.2468571</a>'
  apa: Harks, T., Höfer, M., Schewior, K., &#38; Skopalik, A. (2014). Routing Games
    with Progressive Filling. In <i>Proceedings of the 33rd Annual IEEE International
    Conference on Computer Communications (INFOCOM’14)</i> (pp. 352–360). <a href="https://doi.org/10.1109/TNET.2015.2468571">https://doi.org/10.1109/TNET.2015.2468571</a>
  bibtex: '@inproceedings{Harks_Höfer_Schewior_Skopalik_2014, title={Routing Games
    with Progressive Filling}, DOI={<a href="https://doi.org/10.1109/TNET.2015.2468571">10.1109/TNET.2015.2468571</a>},
    booktitle={Proceedings of the 33rd Annual IEEE International Conference on Computer
    Communications (INFOCOM’14)}, author={Harks, Tobias and Höfer, Martin and Schewior,
    Kevin and Skopalik, Alexander}, year={2014}, pages={352–360} }'
  chicago: Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing
    Games with Progressive Filling.” In <i>Proceedings of the 33rd Annual IEEE International
    Conference on Computer Communications (INFOCOM’14)</i>, 352–60, 2014. <a href="https://doi.org/10.1109/TNET.2015.2468571">https://doi.org/10.1109/TNET.2015.2468571</a>.
  ieee: T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games with Progressive
    Filling,” in <i>Proceedings of the 33rd Annual IEEE International Conference on
    Computer Communications (INFOCOM’14)</i>, 2014, pp. 352–360.
  mla: Harks, Tobias, et al. “Routing Games with Progressive Filling.” <i>Proceedings
    of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)</i>,
    2014, pp. 352–60, doi:<a href="https://doi.org/10.1109/TNET.2015.2468571">10.1109/TNET.2015.2468571</a>.
  short: 'T. Harks, M. Höfer, K. Schewior, A. Skopalik, in: Proceedings of the 33rd
    Annual IEEE International Conference on Computer Communications (INFOCOM’14),
    2014, pp. 352–360.'
date_created: 2017-10-17T12:42:04Z
date_updated: 2022-01-06T06:59:30Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1109/TNET.2015.2468571
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:17:04Z
  date_updated: 2018-03-20T07:17:04Z
  file_id: '1402'
  file_name: 370-HHSS14.pdf
  file_size: 179583
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:17:04Z
has_accepted_license: '1'
language:
- iso: eng
page: 352-360
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 33rd Annual IEEE International Conference on Computer
  Communications (INFOCOM'14)
status: public
title: Routing Games with Progressive Filling
type: conference
user_id: '477'
year: '2014'
...
---
_id: '371'
abstract:
- lang: eng
  text: In this work we present the first distributed storage system that is provably
    robust against crash failures issued by an adaptive adversary, i.e., for each
    batch of requests the adversary can decide based on the entire system state which
    servers will be unavailable for that batch of requests. Despite up to \gamma n^{1/\log\log
    n} crashed servers, with \gamma>0 constant and n denoting the number of servers,
    our system can correctly process any batch of lookup and write requests (with
    at most a polylogarithmic number of requests issued at each non-crashed server)
    in at most a polylogarithmic number of communication rounds, with at most polylogarithmic
    time and work at each server and only a logarithmic storage overhead. Our system
    is based on previous work by Eikel and Scheideler (SPAA 2013), who presented IRIS,
    a distributed information system that is provably robust against the same kind
    of crash failures. However, IRIS is only able to serve lookup requests. Handling
    both lookup and write requests has turned out to require major changes in the
    design of IRIS.
author:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Alexander
  full_name: Setzer, Alexander
  id: '11108'
  last_name: Setzer
- first_name: Martina
  full_name: Eikel, Martina
  last_name: Eikel
citation:
  ama: 'Scheideler C, Setzer A, Eikel M. RoBuSt: A Crash-Failure-Resistant Distributed
    Storage System. In: <i>Proceedings of the 18th International Conference on Principles
    of Distributed Systems (OPODIS)</i>. LNCS. ; 2014:107--122. doi:<a href="https://doi.org/10.1007/978-3-319-14472-6_8">10.1007/978-3-319-14472-6_8</a>'
  apa: 'Scheideler, C., Setzer, A., &#38; Eikel, M. (2014). RoBuSt: A Crash-Failure-Resistant
    Distributed Storage System. In <i>Proceedings of the 18th International Conference
    on Principles of Distributed Systems (OPODIS)</i> (pp. 107--122). <a href="https://doi.org/10.1007/978-3-319-14472-6_8">https://doi.org/10.1007/978-3-319-14472-6_8</a>'
  bibtex: '@inproceedings{Scheideler_Setzer_Eikel_2014, series={LNCS}, title={RoBuSt:
    A Crash-Failure-Resistant Distributed Storage System}, DOI={<a href="https://doi.org/10.1007/978-3-319-14472-6_8">10.1007/978-3-319-14472-6_8</a>},
    booktitle={Proceedings of the 18th International Conference on Principles of Distributed
    Systems (OPODIS)}, author={Scheideler, Christian and Setzer, Alexander and Eikel,
    Martina}, year={2014}, pages={107--122}, collection={LNCS} }'
  chicago: 'Scheideler, Christian, Alexander Setzer, and Martina Eikel. “RoBuSt: A
    Crash-Failure-Resistant Distributed Storage System.” In <i>Proceedings of the
    18th International Conference on Principles of Distributed Systems (OPODIS)</i>,
    107--122. LNCS, 2014. <a href="https://doi.org/10.1007/978-3-319-14472-6_8">https://doi.org/10.1007/978-3-319-14472-6_8</a>.'
  ieee: 'C. Scheideler, A. Setzer, and M. Eikel, “RoBuSt: A Crash-Failure-Resistant
    Distributed Storage System,” in <i>Proceedings of the 18th International Conference
    on Principles of Distributed Systems (OPODIS)</i>, 2014, pp. 107--122.'
  mla: 'Scheideler, Christian, et al. “RoBuSt: A Crash-Failure-Resistant Distributed
    Storage System.” <i>Proceedings of the 18th International Conference on Principles
    of Distributed Systems (OPODIS)</i>, 2014, pp. 107--122, doi:<a href="https://doi.org/10.1007/978-3-319-14472-6_8">10.1007/978-3-319-14472-6_8</a>.'
  short: 'C. Scheideler, A. Setzer, M. Eikel, in: Proceedings of the 18th International
    Conference on Principles of Distributed Systems (OPODIS), 2014, pp. 107--122.'
date_created: 2017-10-17T12:42:04Z
date_updated: 2022-01-06T06:59:31Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-14472-6_8
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:16:32Z
  date_updated: 2018-03-20T07:16:32Z
  file_id: '1401'
  file_name: 371-RoBuSt-OPODIS.pdf
  file_size: 269941
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:16:32Z
has_accepted_license: '1'
page: 107--122
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 18th International Conference on Principles of Distributed
  Systems (OPODIS)
series_title: LNCS
status: public
title: 'RoBuSt: A Crash-Failure-Resistant Distributed Storage System'
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '3718'
author:
- first_name: Christian
  full_name: Harteis, Christian
  id: '27503'
  last_name: Harteis
  orcid: https://orcid.org/0000-0002-3570-7626
citation:
  ama: 'Harteis C. Auswirkungen des Bologna-Prozesses: Eine Expertise der Hochschuldidaktik.
    In: Arnold R, Wolf K, eds. <i>Herausforderung Kompetenzorientierte Hochschule</i>.
    Hohengeheren: Schneider; 2014:189-211.'
  apa: 'Harteis, C. (2014). Auswirkungen des Bologna-Prozesses: Eine Expertise der
    Hochschuldidaktik. In R. Arnold &#38; K. Wolf (Eds.), <i>Herausforderung kompetenzorientierte
    Hochschule</i> (pp. 189–211). Hohengeheren: Schneider.'
  bibtex: '@inbook{Harteis_2014, place={Hohengeheren}, title={Auswirkungen des Bologna-Prozesses:
    Eine Expertise der Hochschuldidaktik}, booktitle={Herausforderung kompetenzorientierte
    Hochschule}, publisher={Schneider}, author={Harteis, Christian}, editor={Arnold,
    Rolf and Wolf, KEditors}, year={2014}, pages={189–211} }'
  chicago: 'Harteis, Christian. “Auswirkungen Des Bologna-Prozesses: Eine Expertise
    Der Hochschuldidaktik.” In <i>Herausforderung Kompetenzorientierte Hochschule</i>,
    edited by Rolf Arnold and K Wolf, 189–211. Hohengeheren: Schneider, 2014.'
  ieee: 'C. Harteis, “Auswirkungen des Bologna-Prozesses: Eine Expertise der Hochschuldidaktik,”
    in <i>Herausforderung kompetenzorientierte Hochschule</i>, R. Arnold and K. Wolf,
    Eds. Hohengeheren: Schneider, 2014, pp. 189–211.'
  mla: 'Harteis, Christian. “Auswirkungen Des Bologna-Prozesses: Eine Expertise Der
    Hochschuldidaktik.” <i>Herausforderung Kompetenzorientierte Hochschule</i>, edited
    by Rolf Arnold and K Wolf, Schneider, 2014, pp. 189–211.'
  short: 'C. Harteis, in: R. Arnold, K. Wolf (Eds.), Herausforderung Kompetenzorientierte
    Hochschule, Schneider, Hohengeheren, 2014, pp. 189–211.'
date_created: 2018-07-26T10:26:26Z
date_updated: 2022-01-06T06:59:31Z
department:
- _id: '452'
editor:
- first_name: Rolf
  full_name: Arnold, Rolf
  last_name: Arnold
- first_name: K
  full_name: Wolf, K
  last_name: Wolf
page: 189-211
place: Hohengeheren
publication: Herausforderung kompetenzorientierte Hochschule
publisher: Schneider
status: public
title: 'Auswirkungen des Bologna-Prozesses: Eine Expertise der Hochschuldidaktik'
type: book_chapter
user_id: '27503'
year: '2014'
...
---
_id: '3719'
author:
- first_name: Christian
  full_name: Harteis, Christian
  id: '27503'
  last_name: Harteis
  orcid: https://orcid.org/0000-0002-3570-7626
citation:
  ama: 'Harteis C. Investigating intuition under the perpective of expertise: Experiences
    from two experimental studies. In: Sinclair M, ed. <i>Handbook of Intuition Research
    Methodology</i>. Cheltenham: Edward Elgar; 2014:116-129.'
  apa: 'Harteis, C. (2014). Investigating intuition under the perpective of expertise:
    Experiences from two experimental studies. In M. Sinclair (Ed.), <i>Handbook of
    intuition research methodology</i> (pp. 116–129). Cheltenham: Edward Elgar.'
  bibtex: '@inbook{Harteis_2014, place={Cheltenham}, title={Investigating intuition
    under the perpective of expertise: Experiences from two experimental studies},
    booktitle={Handbook of intuition research methodology}, publisher={Edward Elgar},
    author={Harteis, Christian}, editor={Sinclair, MarthaEditor}, year={2014}, pages={116–129}
    }'
  chicago: 'Harteis, Christian. “Investigating Intuition under the Perpective of Expertise:
    Experiences from Two Experimental Studies.” In <i>Handbook of Intuition Research
    Methodology</i>, edited by Martha Sinclair, 116–29. Cheltenham: Edward Elgar,
    2014.'
  ieee: 'C. Harteis, “Investigating intuition under the perpective of expertise: Experiences
    from two experimental studies,” in <i>Handbook of intuition research methodology</i>,
    M. Sinclair, Ed. Cheltenham: Edward Elgar, 2014, pp. 116–129.'
  mla: 'Harteis, Christian. “Investigating Intuition under the Perpective of Expertise:
    Experiences from Two Experimental Studies.” <i>Handbook of Intuition Research
    Methodology</i>, edited by Martha Sinclair, Edward Elgar, 2014, pp. 116–29.'
  short: 'C. Harteis, in: M. Sinclair (Ed.), Handbook of Intuition Research Methodology,
    Edward Elgar, Cheltenham, 2014, pp. 116–129.'
date_created: 2018-07-26T10:28:02Z
date_updated: 2022-01-06T06:59:31Z
department:
- _id: '452'
editor:
- first_name: Martha
  full_name: Sinclair, Martha
  last_name: Sinclair
page: 116-129
place: Cheltenham
publication: Handbook of intuition research methodology
publisher: Edward Elgar
status: public
title: 'Investigating intuition under the perpective of expertise: Experiences from
  two experimental studies'
type: book_chapter
user_id: '27503'
year: '2014'
...
---
_id: '372'
abstract:
- lang: eng
  text: 'In the near future many more compute resources will be available at different
    geographical locations. To minimize the response time of requests, application
    servers closer to the user can hence be used to shorten network round trip times.
    However, this advantage is neutralized if the used data centre is highly loaded
    as the processing time of re- quests is important as well. We model the request
    response time as the network round trip time plus the processing time at a data
    centre.We present a capacitated facility location problem formal- ization where
    the processing time is modelled as the sojourn time of a queueing model. We discuss
    the Pareto trade-off between the number of used data centres and the resulting
    response time. For example, using fewer data centres could cut expenses but results
    in high utilization, high response time, and smaller revenues.Previous work presented
    a non-linear cost function. We prove its convexity and exploit this property in
    two ways: First, we transform the convex model into a linear model while controlling
    the maximum approximation error. Sec- ond, we used a convex solver instead of
    a slower non-linear solver. Numerical results on network topologies exemplify
    our work.'
author:
- first_name: Matthias
  full_name: Keller, Matthias
  last_name: Keller
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Keller M, Karl H. Response Time-Optimized Distributed Cloud Resource Allocation.
    In: <i>Proceedings of the SIGCOMM Workshop on Distributed Cloud Computing</i>.
    ; 2014:47--52. doi:<a href="https://doi.org/10.1145/2627566.2627570">10.1145/2627566.2627570</a>'
  apa: Keller, M., &#38; Karl, H. (2014). Response Time-Optimized Distributed Cloud
    Resource Allocation. In <i>Proceedings of the SIGCOMM workshop on Distributed
    cloud computing</i> (pp. 47--52). <a href="https://doi.org/10.1145/2627566.2627570">https://doi.org/10.1145/2627566.2627570</a>
  bibtex: '@inproceedings{Keller_Karl_2014, title={Response Time-Optimized Distributed
    Cloud Resource Allocation}, DOI={<a href="https://doi.org/10.1145/2627566.2627570">10.1145/2627566.2627570</a>},
    booktitle={Proceedings of the SIGCOMM workshop on Distributed cloud computing},
    author={Keller, Matthias and Karl, Holger}, year={2014}, pages={47--52} }'
  chicago: Keller, Matthias, and Holger Karl. “Response Time-Optimized Distributed
    Cloud Resource Allocation.” In <i>Proceedings of the SIGCOMM Workshop on Distributed
    Cloud Computing</i>, 47--52, 2014. <a href="https://doi.org/10.1145/2627566.2627570">https://doi.org/10.1145/2627566.2627570</a>.
  ieee: M. Keller and H. Karl, “Response Time-Optimized Distributed Cloud Resource
    Allocation,” in <i>Proceedings of the SIGCOMM workshop on Distributed cloud computing</i>,
    2014, pp. 47--52.
  mla: Keller, Matthias, and Holger Karl. “Response Time-Optimized Distributed Cloud
    Resource Allocation.” <i>Proceedings of the SIGCOMM Workshop on Distributed Cloud
    Computing</i>, 2014, pp. 47--52, doi:<a href="https://doi.org/10.1145/2627566.2627570">10.1145/2627566.2627570</a>.
  short: 'M. Keller, H. Karl, in: Proceedings of the SIGCOMM Workshop on Distributed
    Cloud Computing, 2014, pp. 47--52.'
date_created: 2017-10-17T12:42:04Z
date_updated: 2022-01-06T06:59:31Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1145/2627566.2627570
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T14:00:54Z
  date_updated: 2018-11-02T14:00:54Z
  file_id: '5259'
  file_name: p47-keller.pdf
  file_size: 804240
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T14:00:54Z
has_accepted_license: '1'
language:
- iso: eng
page: 47--52
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the SIGCOMM workshop on Distributed cloud computing
status: public
title: Response Time-Optimized Distributed Cloud Resource Allocation
type: conference
user_id: '477'
year: '2014'
...
---
_id: '373'
author:
- first_name: David
  full_name: Pahl, David
  last_name: Pahl
citation:
  ama: Pahl D. <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>. Universität
    Paderborn; 2014.
  apa: Pahl, D. (2014). <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>.
    Universität Paderborn.
  bibtex: '@book{Pahl_2014, title={Reputationssysteme für zusammengesetzte Dienstleistungen},
    publisher={Universität Paderborn}, author={Pahl, David}, year={2014} }'
  chicago: Pahl, David. <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>.
    Universität Paderborn, 2014.
  ieee: D. Pahl, <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>.
    Universität Paderborn, 2014.
  mla: Pahl, David. <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>.
    Universität Paderborn, 2014.
  short: D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen, Universität
    Paderborn, 2014.
date_created: 2017-10-17T12:42:04Z
date_updated: 2022-01-06T06:59:31Z
department:
- _id: '63'
- _id: '541'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
title: Reputationssysteme für zusammengesetzte Dienstleistungen
type: bachelorsthesis
user_id: '14052'
year: '2014'
...
